@hackage intern0.6

Efficient hash-consing for arbitrary data types

Categories
- Data Structures
License
BSD-3-Clause
Maintainer
Edward A. Kmett <ekmett@gmail.com>
Links
Versions
- 0.9.5 Fri, 5 Jul 2024
- 0.9.4 Mon, 10 Jul 2023
- 0.9.3 Sat, 9 Jan 2021
- 0.9.2 Fri, 10 May 2019
- 0.9.1.4 Wed, 10 Oct 2018
- 0.9.1.3 Thu, 27 Mar 2014

Installation
In your cabal file:
Dependencies (6)
- array >=0.3.0.2 && <0.4
- base >=4 && <5
- bytestring >=0.9.1 && <0.10
- text >=0.11.1.5 && <0.12
- hashable >=1.1.2 && <1.2
- unordered-containers >=0.1.4 && <0.2
Dependents (18)
@hackage/WordAlignment, @hackage/swish, @hackage/libffi-dynamic, @hackage/toysolver, @hackage/MIP, @hackage/ecta, Show all…

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