bytehash: Universal hashing of bytes

[ bsd3, data, library ] [ Propose Tags ]

Taken together, universal hash functions and a good source of entropy provide a foundation for hash maps guarantee O(1) lookups even if an adversary chooses the keys. This library implements such a hash map. The implementation of lookup is tuned for performance. The functions for building hash maps are not since they are intended to be called infrequently.

Modules

[Last Documentation]

  • Data
    • Bytes
      • Data.Bytes.Hash
      • Data.Bytes.HashMap
        • Data.Bytes.HashMap.Word

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.1.1.0, 0.1.1.1, 0.1.1.2
Change log CHANGELOG.md
Dependencies base (>=4.17.1 && <5), byte-order (>=0.1.2 && <0.2), byteslice (>=0.2.1 && <0.3), bytestring (>=0.10.8 && <0.12), entropy (>=0.4.1.5 && <0.5), primitive (>=0.7 && <0.10), primitive-unlifted (>=2.1), transformers (>=0.5.6 && <0.7) [details]
License BSD-3-Clause
Copyright 2020 Andrew Martin
Author Andrew Martin
Maintainer andrew.thaddeus@gmail.com
Category Data
Home page https://github.com/andrewthad/bytehash
Bug tracker https://github.com/andrewthad/bytehash/issues
Uploaded by andrewthad at 2023-07-06T14:18:14Z
Distributions LTSHaskell:0.1.1.0, NixOS:0.1.1.0
Reverse Dependencies 1 direct, 6 indirect [details]
Downloads 961 total (32 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2023-07-06 [all 2 reports]