homepage: https://github.com/andrewthad/bytehash
changelog-type: markdown
hash: 31d9018c896eff6170329774ec1c1b247712448871f2400a541e92e64286c610
test-bench-deps:
  bytestring: -any
  split: '>=0.2.3.3'
  base: '>=4.12 && <5'
  tasty-hedgehog: -any
  unordered-containers: -any
  bytehash: -any
  entropy: '>=0.4.1.5'
  primitive-checked: '>=0.6.4'
  hedgehog: '>=1.0.1'
  gauge: -any
  primitive-unlifted: -any
  byteslice: '>=0.1.4'
  tasty-hunit: '>=0.9'
  tasty: '>=1.0'
  primitive: -any
  bytesmith: -any
maintainer: andrew.thaddeus@gmail.com
synopsis: Universal hashing of bytes
changelog: |
  # Revision history for bytehash

  ## 0.1.0.0 -- 2020-04-30

  * Initial release.
basic-deps:
  bytestring: '>=0.10.8 && <0.11'
  base: '>=4.12 && <5'
  entropy: '>=0.4.1.5 && <0.5'
  primitive-unlifted: '>=0.1.2 && <0.2'
  byteslice: '>=0.2.1 && <0.3'
  transformers: '>=0.5.6 && <0.6'
  primitive: '>=0.7 && <0.8'
  byte-order: '>=0.1.2 && <0.2'
all-versions:
- 0.1.0.0
author: Andrew Martin
latest: 0.1.0.0
description-type: haddock
description: |-
  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.
license-name: BSD-3-Clause

Update from Hackage at 2020-04-30T17:16:24Z
Update from Hackage at 2020-04-30T17:16:24Z
