@hackage data-stringmap1.0.1.1

An efficient implementation of maps from strings to arbitrary values

Categories
- Data Structures
License
MIT
Maintainer
Uwe Schmidt (uwe@fh-wedel.de), Sebastian Philipp (sebastian@spawnhost.de)
Links
Versions
- 1.0.1.1 Thu, 27 Feb 2014
- 1.0.0 Sun, 9 Feb 2014
- 0.9.2 Tue, 3 Dec 2013
- 0.9.1 Tue, 29 Oct 2013
- 0.9 Tue, 29 Oct 2013

Installation
In your cabal file:
Dependencies (6)
- base >=4.5 && <5
- binary >=0.5 && <1
- bytestring ==0.10.0.2
- containers >=0.4 && <1
- deepseq >=1.2 && <2
- data-size >=0.1.3 && <1
Dependents (4)
@hackage/clafer, @hackage/acme-everything, @hackage/claferIG, @hackage/hunt-searchengine

Package Flags

with-sizeable

(off by default)

test-properties

(on by default)

test-strict

(off by default)

An efficient implementation of maps from strings to arbitrary values. Values can associated with an arbitrary byte key. Searching for keys is very fast, but the prefix tree probably consumes more memory than Data.Map. The main differences are the special prefixFind functions, which can be used to perform prefix queries.

@hackage data-stringmap1.0.1.1

Categories

License

Maintainer

Links

Versions

Installation

Dependencies (6)

Dependents (4)

Package Flags