v1.2.1

Changelog:

• Unicode handling fixed in trie.
• trie remove now deletes nodes recursively instead of just marking them as removed.
• hashset no longer requires its key to implement comparable.

v1.2.0

• More generic and powerful set that is implemented over hashset/mapset.
• Bi-directional map.
• Some new convenience functions.

v1.1.0

• New heap data structure.
• Fixes for interval tree and trie.

v1.0.0

Changes:

• New multimap data structure.
• New Clamp function.
• Eviction callback in cache.
• Interval tree accepts generically comparable intervals
• Fixes and optimizations for hashmap/AVL tree.

v0.2.0

Changes:

• new mapset package implementing a set using the built-in Go map.
• copy function for hashset.
• hashmap package function NewMap renamed to New for better naming consistency.

v0.1.0

This is the initial release of this package now that Go 1.18 has been released. There is no longer an iter package, and data structures have an Each function for iterating over elements. In the future an iterator API may be used when it is clearer how best to implement it.