litemap 0.1.1

A key-value Map implementation based on a flat, sorted Vec.
Documentation

litemap

litemap is a crate providing LiteMap, a highly simplistic "flat" key-value map based off of a single sorted vector.

The goal of this crate is to provide a map that is good enough for small sizes, and does not carry the binary size impact of HashMap or BTreeMap.

If binary size is not a concern, BTreeMap may be a better choice for your use case. It behaves very similarly to LiteMap for less than 12 elements, and upgrades itself gracefully for larger inputs.