bytehash-0.1.1.0: bytehash.cabal

cabal-version: 2.2
name: bytehash
version: 0.1.1.0
synopsis: Universal hashing of bytes
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.
homepage: https://github.com/andrewthad/bytehash
bug-reports: https://github.com/andrewthad/bytehash/issues
license: BSD-3-Clause
license-file: LICENSE
author: Andrew Martin
maintainer: andrew.thaddeus@gmail.com
copyright: 2020 Andrew Martin
category: Data
build-type: Simple
extra-source-files: CHANGELOG.md

library
  exposed-modules:
    Data.Bytes.Hash
    Data.Bytes.HashMap
    Data.Bytes.HashMap.Word
  other-modules:
    Data.Bytes.HashMap.Internal
  build-depends:
    , base >=4.17.1 && <5
    , byte-order >=0.1.2 && <0.2
    , primitive >=0.7 && <0.10
    , primitive-unlifted >=2.1
    , byteslice >=0.2.1 && <0.3
    , entropy >=0.4.1.5 && <0.5
    , bytestring >=0.10.8 && <0.12
    , transformers >=0.5.6 && <0.7
  hs-source-dirs: src
  ghc-options: -O2 -Wall
  default-language: Haskell2010

test-suite test
  type: exitcode-stdio-1.0
  main-is: Main.hs
  ghc-options: -rtsopts -threaded -O2
  hs-source-dirs: test
  build-depends:
    , base >=4.12 && <5
    , bytehash
    , byteslice >=0.1.4
    , entropy >=0.4.1.5
    , primitive >=0.6.4
    , tasty >=1.0
    , tasty-hunit >=0.9
    , tasty-hedgehog
    , hedgehog >=1.0.1
  default-language: Haskell2010

benchmark bench
  type: exitcode-stdio-1.0
  build-depends:
    , base
    , byteslice
    , bytestring
    , bytehash
    , entropy
    , gauge
    , primitive
    , primitive-unlifted
    , bytesmith
    , unordered-containers
    , split >=0.2.3.3
  ghc-options: -Wall -O2
  default-language: Haskell2010
  hs-source-dirs: bench
  main-is: Main.hs