The intern package
Efficient hash-consing for arbitrary data types
Changes from 0.5.2 to 0.6
Widened the caches so they don't go through a single MVar per type. This has made a dramatic impact on performance. However, this broke the previous invariant that newer entries always had higher Ids than older entries.
Changes from 0.5.1 to 0.5.2
Added Data.Interned.IntSet
Properties
| Versions | 0.1, 0.2.0, 0.2.2, 0.2.2.1, 0.3.0, 0.4.0, 0.5.0, 0.5.1, 0.5.1.1, 0.5.2, 0.6, 0.8, 0.8.0.1, 0.9, 0.9.0.1, 0.9.1, 0.9.1.1 |
|---|---|
| Dependencies | array (≥0.3.0.2 & <0.4), base (4.*), bytestring (≥0.9.1 & <0.10), hashable (≥1.1.2 & <1.2), text (≥0.11.1.5 & <0.12), unordered-containers (≥0.1.4 & <0.2) |
| License | BSD3 |
| Copyright | Copyright (C) 2011 Edward A. Kmett |
| Author | Edward A. Kmett |
| Maintainer | Edward A. Kmett <ekmett@gmail.com> |
| Stability | experimental |
| Category | Data, Data Structures |
| Home page | http://github.com/ekmett/intern/ |
| Source repository | git clone git://github.com/ekmett/intern.git |
| Upload date | Sat Aug 13 05:08:05 UTC 2011 |
| Uploaded by | EdwardKmett |
| Built on | ghc-7.2 |
Modules
Downloads
- intern-0.6.tar.gz (Cabal source package)
- package description (included in the package)