summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorLouisWasserman <>2011-02-04 16:02:20 (GMT)
committerLuite Stegeman <luite@luite.com>2011-02-04 16:02:20 (GMT)
commite36c7d20fc8b8729959a4291571e46aa6b3f7ce4 (patch)
tree780f286e416fee82d4c3b895190455b12431b30b
parent0b0be62b639a5872548c262781bffbdb11a5f06f (diff)
version 3.0.13.0.1
-rw-r--r--TrieMap.cabal5
1 files changed, 3 insertions, 2 deletions
diff --git a/TrieMap.cabal b/TrieMap.cabal
index 0805c9b..446e2ae 100644
--- a/TrieMap.cabal
+++ b/TrieMap.cabal
@@ -1,5 +1,5 @@
name: TrieMap
-version: 3.0.0
+version: 3.0.1
cabal-version: >= 1.6
tested-with: GHC
category: Algorithms
@@ -15,7 +15,8 @@ description: Provides a efficient and compact implementation of generalized
Compared to Data.Map and Data.Set, on e.g. @ByteString@s, TrieMaps support 6-12x faster @union@,
@intersection@, and @difference@ operations, 2x faster @lookup@, but 2x slower @toList@, and 4x slower @filter@.
- Other operations are closely tied.
+ Other operations are closely tied. TrieMaps tend to use somewhat more memory, and frequently perform better
+ with increased heap space and allocation area.
license: BSD3
license-file: LICENSE
author: Louis Wasserman