Little fixes; added min(limit) and max(limit) methods

The tree structure means that it is easy to walk keys to find an approximate match. The largest key less than a limit, or the smallest key greater than a limit. This release also cleans up the code of some things that Ameba dislikes.

Full Changelog: v0.2.2...v0.3.0

Announcing on_prune

This adds support for an on_prune callback that, if defined, is invoked every time a key/value is pruned from the tree. This allows for sophisticated accounting and handling of pruned resources in situations where it is helpful for the code to know what got removed from the tree.

Support a maximum size parameter

This release adds support for a #maxsize/#maxsize= method. When a maximum size is set, the structure will automatically perform a prune operation every time its size exceeds the maximum.

v0.1.3

This release adds some thread safety. It still isn't perfect, but most of the main methods should be safe, now.

v0.1.1

Bundle shard.yml changes for Crystal 1.0.0.

Initial Release of the generally Hash-compatible Splay Tree Map for Crystal

This is the first release of this data structure as a standalone library. It provides a generally Hash-compatible data structure for Crystal that supports key/value looking, all of the convenience methods of a Hash, and can easily be size restricted with deletion of the data that is generally least utilized, making it a nice data structure for a cache.