This repository was archived by the owner on May 3, 2026. It is now read-only.
10.1.0
[10.1.0] - 2018-04-12
Added
Vector,OrdMapandHashMapnow implementIndexand
IndexMut, allowing for syntax likemap[key] = value.- Added
cons,snoc,unconsandunsnocaliases where they were missing. - Everything now implements
SumandExtendwhere possible.
Changed
- Generalised
OrdMap/OrdSet's internal nodes soOrdSetnow only
needs to store pointers to its values, not pairs of pointers to
value andUnit. This has causedOrdMap/Set's type constraints to
tighten somewhat - in particular, iteration over maps/sets whose
keys don't implementOrdis no longer possible, but as you would
only have been able to create empty instances of these, no sensible
code should break because of this. HashMap/HashSetnow also cannot be iterated over unless they
implementHash + Eq, with the same note as above.- Constraints on single operations that take closures on
HashMapand
OrdMaphave been relaxed fromFntoFnOnce. (Fixes #7.)
Fixed
- Hashes are now stored in
HashMaps along with their associated
values, removing the need to recompute the hash when a value is
reordered inside the tree.