Name:               dfinity-radix-tree
Version:            0.5.1
Synopsis:           A generic data integrity layer.
Description:
   This library allows you to construct a Merkle tree on top of any underlying
   key–value database. It works by organizing your key–value pairs into a binary
   radix tree, which is well suited for storing large dictionaries of fairly
   random keys, and is optimized for storing keys of the same length.

License:            GPL-3
License-File:       LICENSE
Category:           Blockchain, DFINITY, Database
Copyright:          2018 DFINITY Stiftung
Author:             Enzo Haussecker <enzo@dfinity.org>, Remy Goldschmidt <remy@dfinity.org>, Armando Ramirez <armando@dfinity.org>
Maintainer:         Enzo Haussecker <enzo@dfinity.org>, Remy Goldschmidt <remy@dfinity.org>, Armando Ramirez <armando@dfinity.org>
Homepage:           https://github.com/dfinity-lab/dev
Bug-Reports:        https://github.com/dfinity-lab/dev/issues
Tested-With:        GHC==8.4.3, GHC==8.2.2
Build-Type:         Simple
Cabal-Version:      >= 1.10
Extra-Source-Files: CHANGELOG.md, README.md

Library
   Build-Depends:
      BoundedChan,
      base >=4.10 && <5,
      base16-bytestring,
      blake2,
      bloomfilter,
      bytestring,
      concurrent-extra,
      conduit,
      containers,
      data-default-class,
      deepseq,
      directory,
      dlist,
      ghc-prim,
      hashtables,
      lens-simple,
      leveldb-haskell,
      lmdb-simple,
      lrucaching,
      mtl,
      reducers,
      resourcet,
      semigroups,
      serialise,
      stm,
      temporary,
      transformers
   Default-Language:
      Haskell2010
   Exposed-Modules:
      DFINITY.RadixTree
      DFINITY.RadixTree.Conduit
   GHC-Options:
      -O2
      -Wall
      -fno-warn-missing-signatures
   HS-Source-Dirs:
      src
   Other-Modules:
      DFINITY.RadixTree.Bits
      DFINITY.RadixTree.Bloom
      DFINITY.RadixTree.Lenses
      DFINITY.RadixTree.Lock
      DFINITY.RadixTree.Memory
      DFINITY.RadixTree.Serialise
      DFINITY.RadixTree.Types
      DFINITY.RadixTree.Utilities

Executable dfinity-radix-tree-benchmarks
   Build-Depends:
      base >=4.10 && <5,
      blake2,
      bytestring,
      cmdargs,
      criterion,
      data-default-class,
      dfinity-radix-tree,
      leveldb-haskell,
      lmdb-simple,
      resourcet,
      temporary
   Default-Language:
      Haskell2010
   GHC-Options:
      -O2
      -Wall
      -rtsopts
      -threaded
   HS-Source-Dirs:
      benchmark
   Main-Is:
      Main.hs

test-suite tests
   Build-Depends:
      BoundedChan,
      QuickCheck,
      aeson,
      base >=4.10 && <5,
      base16-bytestring,
      blake2,
      bytestring,
      concurrent-extra,
      conduit,
      containers,
      dfinity-radix-tree,
      filepath,
      leveldb-haskell,
      mtl,
      resourcet,
      tasty,
      tasty-hunit,
      tasty-quickcheck,
      text,
      temporary,
      transformers,
      unordered-containers
   Default-Language:
      Haskell2010
   GHC-Options:
      -O2
      -Wall
   HS-Source-Dirs:
      test
   Main-Is:
      Tests.hs
   Other-Modules:
      Integrations,
      Properties,
      Types,
      Units
   Type:
      exitcode-stdio-1.0