The list-tries package

[Tags: bsd3, library]

This library provides implementations of finite sets and maps for list keys using tries, both simple and of the Patricia kind. In most (or all? sorry, haven't benchmarked yet) cases, the Patricia tries will have better performance, so use them unless you have reasons not to.

The data types are parametrized over the map type they use internally to store the child nodes: this allows extending them to support different kinds of key types or increasing efficiency. Child maps are required to be instances of the Map class in Data.ListTrie.Base.Map. Some operations additionally require an OrdMap instance.

The Eq, Ord, and Enum modules contain ready structures for key types which are instances of those classes, using lists of pairs, Data.Map, and Data.IntMap respectively.


Versions0.0, 0.1, 0.2, 0.3, 0.4, 0.4.1, 0.4.2, 0.4.3, 0.5, 0.5.1, 0.5.2, 0.6.0, 0.6.1
Change logCHANGELOG.txt
Dependenciesbase (>=3 && <4.7), binary (>=0.5 && <0.7), ChasingBottoms (>=1.2 && <1.4), containers (>=0.3 && <0.6), dlist (>=0.4 && <0.6), HUnit (==1.2.*), QuickCheck (>=2.1 && <2.6), template-haskell (>=2.3 && <2.9), test-framework (>=0.2 && <0.9), test-framework-hunit (>=0.2 && <0.4), test-framework-quickcheck2 (>=0.2 && <0.4) [details]
AuthorMatti Niemenmaa
MaintainerMatti Niemenmaa <>
CategoryData, Data Structures
Home page
UploadedThu May 9 08:02:03 UTC 2013 by MattiNiemenmaa
Downloads2476 total (90 in last 30 days)
0 []
StatusDocs not available [build log]
All reported builds failed as of 2015-06-04 [all 2 reports]



testingEnable building a test executableDisabledAutomatic

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainers' corner

For package maintainers and hackage trustees