-- Initial linkedhashmap.cabal generated by cabal init. For further -- documentation, see http://haskell.org/cabal/users-guide/ name: linkedhashmap version: 0.4.0.0 license: BSD3 license-file: LICENSE author: Andrey Basko maintainer: Andrey Basko copyright: Copyright (C) 2014 Andrey Basko category: Data build-type: Simple tested-with: GHC == 7.8.3 homepage: https://github.com/abasko/linkedhashmap bug-reports: https://github.com/abasko/linkedhashmap/issues cabal-version: >=1.10 synopsis: Persistent LinkedHashMap data structure description: Haskell implementation of Java LinkedHashMap. . Underlying HashMap is based on Data.HashMap.Strict. . Two different implementations are based on Data.Sequence and Data.IntMap.Strict to keep keys in the order of insertion. . Criterion report: extra-source-files: README.md tests/linkedhashmap-tests.cabal benchmarks/Tests.java benchmarks/report.html benchmarks/runJava.sh benchmarks/linkedhashmap-benchmarks.cabal source-repository head type: git location: git://github.com/abasko/linkedhashmap.git library exposed-modules: Data.LinkedHashMap, Data.LinkedHashSet, Data.LinkedHashMap.Seq, Data.LinkedHashMap.IntMap -- other-modules: other-extensions: BangPatterns build-depends: base >=4.6 && <5 , containers >=0.5 && <0.6 , deepseq >=1.1 && <2 , hashable >=1.2 && <2 , unordered-containers >=0.2 && <0.3 hs-source-dirs: src default-language: Haskell2010 test-suite linkedhashmap-tests type: exitcode-stdio-1.0 main-is: Main.hs build-depends: base, containers, deepseq, hashable, unordered-containers , mtl >=2.1 && <3 , tasty >=0.10 && <0.11 , tasty-hunit >=0.9 && <0.10 hs-source-dirs: tests src default-language: Haskell2010 benchmark benchmarks type: exitcode-stdio-1.0 main-is: Main.hs hs-source-dirs: benchmarks src build-depends: base, containers, deepseq, hashable, unordered-containers , criterion >=1 && <2 default-language: Haskell2010 ghc-options: -O2 -fmax-simplifier-iterations=10 -fdicts-cheap -fspec-constr-count=6