rangetree 0.1.2

Range-tree for storing non-overlapping scalar ranges.
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57

// Apache License, Version 2.0
// (c) Campbell Barton, 2016

use std::ptr;
use mempool_elem::{
    MemPool,
    MemElemUtils,
};

struct TestElem {
    value: usize,
    link: *mut TestElem,
}

impl MemElemUtils for TestElem {
    fn free_ptr_get(&self) -> *mut TestElem {
        return self.link;
    }
    fn free_ptr_set(&mut self, ptr: *mut TestElem) {
        self.link = ptr;
    }
}

impl Default for TestElem {
    fn default() -> TestElem {
        TestElem {
            value: 0,
            link: ptr::null_mut(),
        }
    }
}

#[test]
fn test_mempool() {
    let total = 128;
    let chunk_size = 2;
    let mut p: MemPool<TestElem> = MemPool::new(chunk_size);

    for _ in 0..2 {
        let mut a = unsafe { &mut *p.alloc_elem() };
        a.value = 0;
        for i in 1..total {
            let a_next = p.alloc_elem();
            let a_prev = a;
            a = unsafe { &mut *a_next };
            a.value = i;
            a.link = a_prev;
        }

        for i in (0..total).rev() {
            assert!(a.value == i);
            let a_next = unsafe { &mut *a.link };
            p.free_elem(a);
            a = a_next;
        }
    }
}