6 releases
0.1.5 | Jan 1, 2022 |
---|---|
0.1.4 | Apr 17, 2021 |
0.1.3 | Apr 21, 2020 |
#1297 in Data structures
19KB
444 lines
skiplist-rs
Description
Skip list is a kind of ordered map and can store any value inside. See skip list wikipedia page to learn more about this data structure.
How To Use
fn main() {
let mut list = Skiplist::new();
list.set(10, "helloworld".to_string());
if let Some(t) = list.get(&10) {
println!("{}", t);
}
list.remove(&10);
if let Some(t) = list.get(&10) {
println!("{}", t);
} else {
println!("not found");
}
}
#[test]
fn test_iterator() {
let mut rng = rand::thread_rng();
let y: f64 = rng.gen();
let mut nums: Vec<u32> = (1..200).collect();
nums.shuffle(&mut rng);
let mut skiplist = Skiplist::new();
for i in nums {
println!("index is {}", i);
skiplist.set(i, format!("Helloworld_{}", i));
}
for v in &mut skiplist {
println!("{}", v.as_str());
}
skiplist.set(9999, "Helloworld_9999".to_string());
for v in &mut skiplist {
println!("{}", v.as_str());
}
}
License
This library is licensed under MIT license. See LICENSE for details.
Dependencies
~310KB