Crate immutable_map [−] [src]
Immutable binary search tree.
This crate provides functional programming style binary search trees which returns modified
copy of original map or set with the new data, and preserves the original. Many features and
algorithms are borrowed from
Data.Map of Haskell's standard library.
See https://yoichihirai.com/bst.pdf for the balancing algorithm.
To share the data between the old and the new data structure after modification, most of the
functions require the key and value type to implement
Clone. If you want to store non-
clonable data into this map, you can wrap it under shared pointer such as
An immutable map based on binary search tree
An immutable set based on binary search tree
An endpoint of a range of keys.