intern

Efficient hash-consing for arbitrary data types

http://github.com/ekmett/intern/

Version on this page:0.9.3@rev:1
LTS Haskell 18.22:0.9.4@rev:2
Stackage Nightly 2022-01-15:0.9.4@rev:2
Latest on Hackage:0.9.4@rev:2

See all snapshots intern appears in

BSD-3-Clause licensed by Edward A. Kmett
Maintained by Edward A. Kmett
This version can be pinned in stack with:intern-0.9.3@sha256:34d7f0fe36b8d9caaeb5138f3e947d477b99837fd549e04273c9da52deae54b2,1741

intern

Hackage Build Status

Efficient hash-consing for arbitrary data types.

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact me through github or on the #haskell IRC channel on irc.freenode.net.

-Edward Kmett

Changes

0.9.3 [2020.09.30]

  • Add Hashable instances for InternedString, InternedByteString, InternedText, and IntSet.

0.9.2

  • Add a Semigroup IntSet instance.

0.9

  • Removed identity from the Interned class, to support applications where the identity is obtained by other means (e.g. a unique Ptr value)

0.8

  • Disabled cache removal as it was causing problems on large data sets. There is no good way to ensure that both references remain alive long enough to finish comparisons.
  • Switched to IORef from MVar

0.7

  • Fixed problem where comparisons could happen between data structures while one was still a thunk, leading to equal structures comparing as inequal in limited circumstances, by appropriately using strictness annotations.

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.

0.5.2

  • Added Data.Interned.IntSet