name: TrieMap version: 2.0.1 tested-with: GHC category: Algorithms synopsis: Automatic type inference of generalized tries with Template Haskell. description: Provides a efficient and compact implementation of generalized tries, and Template Haskell tools to generate the necessary translation code. This is meant as a drop-in replacement for Data.Map. The most recent release combines zipper-based ideas from recently proposed changes to Data.Map, as well as heavily optimized ByteString and Vector instances based on the vector package. license: BSD3 license-file: LICENSE author: Louis Wasserman maintainer: wasserman.louis@gmail.com build-Depends: base < 5.0.0.0, containers, template-haskell, bytestring, th-expand-syns, vector, primitive build-type: Simple ghc-options: -Wall -fno-warn-name-shadowing -fno-warn-orphans -O2 -fno-spec-constr-count -fno-spec-constr-threshold -fno-liberate-case-threshold -fmax-worker-args=100 extra-source-files: Tests.hs exposed-modules: Data.TrieMap, Data.TrieSet, Data.TrieMap.Class, Data.TrieMap.Representation, Data.TrieMap.Modifiers other-modules: Data.TrieMap.Utils, Data.TrieMap.Sized, Data.TrieMap.Applicative, Data.TrieMap.Representation.Class, Data.TrieMap.Representation.TH, Data.TrieMap.Representation.TH.Utils, Data.TrieMap.Representation.TH.Representation, Data.TrieMap.Representation.TH.Factorized, Data.TrieMap.Representation.TH.ReprMonad, Data.TrieMap.Representation.Instances, Data.TrieMap.Representation.Instances.Basic, Data.TrieMap.Representation.Instances.Prim, Data.TrieMap.Representation.Instances.Foreign, Data.TrieMap.Representation.Instances.Vectors, Data.TrieMap.Representation.Instances.ByteString Data.TrieMap.IntMap, Data.TrieMap.OrdMap, Data.TrieMap.UnitMap, Data.TrieMap.ProdMap, Data.TrieMap.UnionMap, Data.TrieMap.ReverseMap, Data.TrieMap.Key, Data.TrieMap.RadixTrie, Data.TrieMap.RadixTrie.Slice, Data.TrieMap.RadixTrie.Edge, Data.TrieMap.Class.Instances