rb_tree 0.5.0

A Red Black Tree implementation in Rust
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
29
30
31
32
33

use rb_tree::RBQueue;

struct ByReference {
    queue: RBQueue<i32, &'static dyn Fn(&i32, &i32) -> std::cmp::Ordering>,
}

impl Default for ByReference {
    fn default() -> Self {
        Self {
            queue: RBQueue::new(&|l: &i32, r: &i32| l.cmp(r)),
        }
    }
}

struct Boxing {
    queue: RBQueue<i32, Box<dyn Fn(&i32, &i32) -> std::cmp::Ordering>>,
}

impl Default for Boxing {
    fn default() -> Self {
        Self {
            queue: RBQueue::new(Box::new(|l: &i32, r: &i32| l.cmp(r))),
        }
    }
}

fn main() {
    let mut h = ByReference::default();
    h.queue.insert(1i32);

    let mut b = Boxing::default();
    b.queue.insert(1i32);
}