The TrieMap package

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, and can be used anywhere Data.Map can be used.

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. For best performance, use cabal install -fllvm -O2.

Properties

Versions	0.0.1.0, 0.0.1.1, 0.0.1.2, 0.5.0, 0.5.1, 0.5.2, 0.5.3, 0.5.4, 0.6.0, 0.6.1, 0.6.2, 0.6.3, 0.7.0, 0.7.1, 0.7.2, 1.0.0, 1.5.0, 2.0.0, 2.0.1, 2.0.2, 2.0.3, 3.0.0, 3.0.1, 4.0.0, 4.0.1, 4.1.0
Dependencies	base (<5.0.0.0), bytestring (≥0.9.1.0), containers, primitive (≥0.3), template-haskell (≥2.7.0.0), th-expand-syns, transformers (≥0.2.0.0), unpack-funcs (≥0.1.2), vector (≥0.6)
License	BSD3
Author	Louis Wasserman
Maintainer	wasserman.louis@gmail.com
Category	Algorithms
Source repository	git clone git@github.com:lowasser/TrieMap.git
Upload date	Thu Apr 18 23:58:55 UTC 2013
Uploaded by	LouisWasserman
Build failure	ghc-7.6 (log)

Modules

Data
- Data.TrieMap
  - Data.TrieMap.Class
  - Data.TrieMap.Modifiers
  - Data.TrieMap.Representation
- Data.TrieSet

Downloads

TrieMap-4.1.0.tar.gz (Cabal source package)
package description (included in the package)