intern: Efficient hash-consing for arbitrary data types

[ bsd3, data, data-structures, library ] [ Propose Tags ]

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

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 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, 0.9.1.2, 0.9.1.3, 0.9.1.4, 0.9.2, 0.9.3, 0.9.4, 0.9.5
Dependencies array (>=0.3.0.2 && <0.4), base (>=4 && <5), 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) [details]
License BSD-3-Clause
Copyright Copyright (C) 2011 Edward A. Kmett
Author Edward A. Kmett
Maintainer Edward A. Kmett <ekmett@gmail.com>
Category Data, Data Structures
Home page http://github.com/ekmett/intern/
Source repo head: git clone git://github.com/ekmett/intern.git
Uploaded by EdwardKmett at 2011-08-13T05:08:05Z
Distributions Debian:0.9.4, LTSHaskell:0.9.5, NixOS:0.9.5, Stackage:0.9.5
Reverse Dependencies 17 direct, 199 indirect [details]
Downloads 25169 total (86 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]