15 releases
0.7.4 | Nov 23, 2024 |
---|---|
0.7.3 | May 28, 2024 |
0.7.2 | Nov 16, 2023 |
0.7.0 | Apr 13, 2023 |
0.1.1 | Mar 4, 2021 |
#108 in Data structures
3,728,562 downloads per month
Used in 27,369 crates
(17 directly)
115KB
2K
SLoC
litemap
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, 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
.
Dependencies
~180KB