13 unstable releases

0.7.2 Nov 16, 2023
0.7.0 Apr 13, 2023
0.6.1 Jan 26, 2023
0.6.0 Sep 26, 2022
0.1.1 Mar 4, 2021

#63 in Data structures

Download history 20077/week @ 2024-01-01 22671/week @ 2024-01-08 24025/week @ 2024-01-15 23547/week @ 2024-01-22 30213/week @ 2024-01-29 32718/week @ 2024-02-05 32041/week @ 2024-02-12 32406/week @ 2024-02-19 30602/week @ 2024-02-26 32371/week @ 2024-03-04 34273/week @ 2024-03-11 33878/week @ 2024-03-18 32104/week @ 2024-03-25 30081/week @ 2024-04-01 31839/week @ 2024-04-08 30897/week @ 2024-04-15

128,488 downloads per month
Used in 152 crates (11 directly)

Custom license


litemap crates.io


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, std::collections::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.

Pluggable Backends

By default, LiteMap is backed by a Vec; however, it can be backed by any appropriate random-access data store, giving that data store a map-like interface. See the store module for more details.

Const construction

LiteMap supports const construction from any store that is const-constructible, such as a static slice, via [LiteMap::from_sorted_store_unchecked()]. This also makes LiteMap suitable for use with databake. See impl Bake for LiteMap for more details.

More Information

For more information on development, authorship, contributing etc. please visit ICU4X home page.