name:		     TrieMap
version:             1.5.0
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.
license:             BSD3
license-file:	     LICENSE
author:              Louis Wasserman
maintainer:          wasserman.louis@gmail.com
build-Depends:       base < 5.0.0.0, containers, template-haskell, bytestring, array, th-expand-syns, ghc-prim
build-type:	     Simple
ghc-options:         -Wall -fno-warn-name-shadowing -fno-warn-orphans
extra-source-files:  Tests.hs
exposed-modules:  
	Data.TrieMap,
	Data.TrieSet,
	Data.TrieMap.Representation,
	Data.TrieMap.Representation.TH,
	Data.TrieMap.Modifiers
other-modules:
	Data.TrieMap.Class,
	Data.TrieMap.Class.Instances,
	Data.TrieMap.Key,
	Data.TrieMap.TrieKey,
	Data.TrieMap.Applicative,
	Data.TrieMap.ProdMap,
	Data.TrieMap.RadixTrie,
	Data.TrieMap.UnionMap,
	Data.TrieMap.UnitMap,
	Data.TrieMap.Rep,
	Data.TrieMap.Rep.Instances,
	Data.TrieMap.Rep.TH,
	Data.TrieMap.IntMap,
	Data.TrieMap.OrdMap,
	Data.TrieMap.ReverseMap,
	Data.TrieMap.Sized,
	Data.TrieMap.Applicative