### 1 unstable release

0.1.0 | Jun 11, 2020 |
---|

#**1518** in Data structures

**49,109** downloads per month

Used in **10** crates
(5 directly)

**MIT/Apache**

58KB

1.5K
SLoC

# sorted_vector_map

is an implementation of an ordered map and set (like
`sorted_vector_map`

and `std ::`

`collections`BTreeMap

`::``std``::``collections``::`BTreeSet

) using a sorted vector as the backing store.Sorted vector maps are appropriate when data is frequently loaded from an ordered source, queried a small number of times, and infrequently modified through insertion or removal.

Loading from an ordered sequence is *O(n)* through an optimization to

that handles
in-order insertions specially. Extension of the sequence is also optimized,
where extending a map or set of size n with m elements in a single operation is
`insert`*O(n + m log m)*. Otherwise, loading from an unordered sequence is *O(n^2)*.

Look-up is *O(log n)* through binary search. Insertion and removal are both *O(n)*, as
are set operations like intersection, union and difference.

is part of
rust-shed. See the rust-shed
repository for more documentation, including the contributing guide.`sorted_vector_map`

## License

sorted_vector_map is both MIT and Apache License, Version 2.0 licensed, as found in the LICENSE-MIT and LICENSE-APACHE files.

#### Dependencies

~470KB