| Crates.io | tiered-vector |
| lib.rs | tiered-vector |
| version | 1.0.1 |
| created_at | 2025-10-19 01:03:38.413192+00 |
| updated_at | 2025-11-02 21:56:09.372542+00 |
| description | Tiered Vectors |
| homepage | |
| repository | https://github.com/nlfiedler/tiervec |
| max_upload_size | |
| id | 1889803 |
| size | 85,743 |
This Rust crate provides an implementation of a tiered vector as described in the paper Tiered Vector by Goodrich and Kloss II, published in 1998 (and subsequently in 1999).
This data structure supports efficient get and update operations with a running time of O(1) as well as insert and remove operations on the order of O(√N). It uses a collection of circular buffers to achieve this with a space overhead on the order of O(√N).
Expect random remove/insert operations on a tiered vector to be orders of magnitude faster than a standard vector. Note that the benchmarks use different values because using an equal number for both data structures would take much too long.
A simple example copied from the unit tests.
let mut tiered = Vector::<usize>::new();
assert!(tiered.is_empty());
for value in (1..=16).rev() {
tiered.insert(0, value);
}
assert!(!tiered.is_empty());
for (index, value) in (1..=16).enumerate() {
assert_eq!(tiered[index], value);
}
The Rust edition is set to 2024 and hence version 1.85.0 is the minimum supported version.
Finding memory leaks with Address Sanitizer is fairly easy and seems to work best on Linux. A Docker container with bash access and Rust nightly installed can be found in the containers directory.
cd containers
docker compose build --pull
docker compose run leaktest
sh leak.sh
If no problems were detected, a single line of output will appear. When done, clean up the docker artifacts.
exit
docker compose down