Cabal revisions of trie-simple-0.4.1.1
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
-name: trie-simple-version: 0.4.1.1-synopsis: Simple Map-based Trie-description:- Trie data structure `TMap` to hold mapping from list of characters to- something, i.e. isomorphic to `Map [c] v`.- - It is more efficient to query compared to `Map`. Also, it supports extra- operation like prefix matching.- This package also contains `TSet`, which is isomorphic to `Set` of lists of- characters.-license: BSD3-license-file: LICENSE-author: Koji Miyazato-maintainer: viercc@gmail.com-copyright: Koji Miyazato-category: Data Structure-build-type: Simple-extra-source-files: README.md, CHANGELOG.md-cabal-version: >=1.10--source-repository head- type: git- location: https://github.com/viercc/trie-simple- branch: master--library- hs-source-dirs: src- exposed-modules: Data.Trie.Set,- Data.Trie.Set.Internal,- Data.Trie.Map,- Data.Trie.Map.Internal- other-modules: Data.Trie.Set.Hidden,- Data.Trie.Map.Hidden- build-depends: base >= 4.9 && < 4.13,- containers >= 0.5.7.1 && < 0.6,- deepseq >= 1.4.2.0 && < 1.5,- mtl >= 2.2.1 && < 2.3- default-language: Haskell2010- ghc-options: -Wall -Wno-dodgy-exports--test-suite trie-simple-test- type: exitcode-stdio-1.0- hs-source-dirs: test- main-is: Spec.hs- other-modules: Data.Trie.SetSpec,- Data.Trie.Set.Gen,- Data.Trie.MapSpec,- Data.Trie.Map.Gen,- Common- build-depends: base,- containers,- vector,- QuickCheck,- hspec,- trie-simple- ghc-options: -Wall -threaded -rtsopts -with-rtsopts=-N- default-language: Haskell2010--benchmark trie-benchmark- type: exitcode-stdio-1.0- hs-source-dirs: bench- main-is: trie-benchmark.hs- other-modules: Common- build-depends: base,- deepseq,- containers,- criterion,- vector,- mwc-random,- trie-simple- ghc-options: -O2 -Wall -threaded -rtsopts -with-rtsopts=-N- default-language: Haskell2010+name: trie-simple +version: 0.4.1.1 +x-revision: 1 +synopsis: Simple Map-based Trie +description: + Trie data structure `TMap` to hold mapping from list of characters to + something, i.e. isomorphic to `Map [c] v`. + + It is more efficient to query compared to `Map`. Also, it supports extra + operation like prefix matching. + This package also contains `TSet`, which is isomorphic to `Set` of lists of + characters. +license: BSD3 +license-file: LICENSE +author: Koji Miyazato +maintainer: viercc@gmail.com +copyright: Koji Miyazato +category: Data Structure +build-type: Simple +extra-source-files: README.md, CHANGELOG.md +cabal-version: >=1.10 + +source-repository head + type: git + location: https://github.com/viercc/trie-simple + branch: master + +library + hs-source-dirs: src + exposed-modules: Data.Trie.Set, + Data.Trie.Set.Internal, + Data.Trie.Map, + Data.Trie.Map.Internal + other-modules: Data.Trie.Set.Hidden, + Data.Trie.Map.Hidden + build-depends: base >= 4.9 && < 4.14, + containers >= 0.5.7.1 && < 0.7, + deepseq >= 1.4.2.0 && < 1.5, + mtl >= 2.2.1 && < 2.3 + default-language: Haskell2010 + ghc-options: -Wall -Wno-dodgy-exports + +test-suite trie-simple-test + type: exitcode-stdio-1.0 + hs-source-dirs: test + main-is: Spec.hs + other-modules: Data.Trie.SetSpec, + Data.Trie.Set.Gen, + Data.Trie.MapSpec, + Data.Trie.Map.Gen, + Common + build-depends: base, + containers, + vector, + QuickCheck, + hspec, + trie-simple + ghc-options: -Wall -threaded -rtsopts -with-rtsopts=-N + default-language: Haskell2010 + +benchmark trie-benchmark + type: exitcode-stdio-1.0 + hs-source-dirs: bench + main-is: trie-benchmark.hs + other-modules: Common + build-depends: base, + deepseq, + containers, + criterion, + vector, + mwc-random, + trie-simple + ghc-options: -O2 -Wall -threaded -rtsopts -with-rtsopts=-N + default-language: Haskell2010
revision 2
name: trie-simple version: 0.4.1.1 -x-revision: 1 +x-revision: 2 synopsis: Simple Map-based Trie description: Trie data structure `TMap` to hold mapping from list of characters to Data.Trie.Map.Internal other-modules: Data.Trie.Set.Hidden, Data.Trie.Map.Hidden - build-depends: base >= 4.9 && < 4.14, + build-depends: base >= 4.9 && < 4.15, containers >= 0.5.7.1 && < 0.7, deepseq >= 1.4.2.0 && < 1.5, mtl >= 2.2.1 && < 2.3
revision 3
name: trie-simple version: 0.4.1.1 -x-revision: 2 +x-revision: 3 synopsis: Simple Map-based Trie description: Trie data structure `TMap` to hold mapping from list of characters to author: Koji Miyazato maintainer: viercc@gmail.com copyright: Koji Miyazato -category: Data Structure +category: Data Structures build-type: Simple extra-source-files: README.md, CHANGELOG.md cabal-version: >=1.10
revision 4
name: trie-simple version: 0.4.1.1 -x-revision: 3 +x-revision: 4 synopsis: Simple Map-based Trie description: Trie data structure `TMap` to hold mapping from list of characters to Data.Trie.Map.Internal other-modules: Data.Trie.Set.Hidden, Data.Trie.Map.Hidden - build-depends: base >= 4.9 && < 4.15, + build-depends: base >= 4.9 && < 4.17, containers >= 0.5.7.1 && < 0.7, deepseq >= 1.4.2.0 && < 1.5, mtl >= 2.2.1 && < 2.3
revision 5
name: trie-simple version: 0.4.1.1 -x-revision: 4 +x-revision: 5 synopsis: Simple Map-based Trie description: - Trie data structure `TMap` to hold mapping from list of characters to - something, i.e. isomorphic to `Map [c] v`. - - It is more efficient to query compared to `Map`. Also, it supports extra + A trie data structure @TMap c v@, to hold a mapping from list of characters (@[c]@) to + something. In other words, a data structure isomorphic to @Map [c] v@. + It is more efficient to query compared to @Map@. Also, it supports extra operation like prefix matching. - This package also contains `TSet`, which is isomorphic to `Set` of lists of + + This package contains @TSet@ too, which is isomorphic to @Set@ of lists of characters. license: BSD3 license-file: LICENSE Data.Trie.Map.Internal other-modules: Data.Trie.Set.Hidden, Data.Trie.Map.Hidden - build-depends: base >= 4.9 && < 4.17, + build-depends: base >= 4.9 && < 4.18, containers >= 0.5.7.1 && < 0.7, deepseq >= 1.4.2.0 && < 1.5, mtl >= 2.2.1 && < 2.3
revision 6
name: trie-simple version: 0.4.1.1 -x-revision: 5 +x-revision: 6 synopsis: Simple Map-based Trie description: A trie data structure @TMap c v@, to hold a mapping from list of characters (@[c]@) to Data.Trie.Map.Internal other-modules: Data.Trie.Set.Hidden, Data.Trie.Map.Hidden - build-depends: base >= 4.9 && < 4.18, + build-depends: base >= 4.9 && < 4.19, containers >= 0.5.7.1 && < 0.7, deepseq >= 1.4.2.0 && < 1.5, - mtl >= 2.2.1 && < 2.3 + mtl >= 2.2.1 && < 2.4 default-language: Haskell2010 ghc-options: -Wall -Wno-dodgy-exports