skippy-rs 0.0.0-alpha.4

A set of lock free, thread safe, and fast data structures implemented via a Skip List
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28

pub trait SkipList<K, V> {
    type Entry<'a>: Entry<'a, K, V>
    where
        Self: 'a;

    fn new() -> Self;

    fn insert(&self, key: K, value: V) -> Option<V>;

    fn get<'a>(&'a self, key: &K) -> Option<Self::Entry<'a>>;

    fn remove(&self, key: &K) -> Option<(K, V)>;

    fn front<'a>(&'a self) -> Option<Self::Entry<'a>>;

    fn last<'a>(&'a self) -> Option<Self::Entry<'a>>;

    fn len(&self) -> usize;

    fn is_empty(&self) -> bool {
        self.len() < 1
    }
}

pub trait Entry<'a, K, V> {
    fn val(&self) -> &V;
    fn key(&self) -> &K;
}