dlist 0.1.4

List data structure based on AVL tree. It can store elements which have dimension and quickly search for elements by distance from 0.
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

extern crate dlist;

use dlist::{DList, ItemInfo, Measurer};

struct StringMeasurer;

impl Measurer<String> for StringMeasurer {
    type Measure = usize;
    fn nil(&self) -> usize {
        0
    }

    fn measure(&self, value: &String) -> usize {
        value.len()
    }
}

#[test]
fn del_odd() {
    let mut dl = DList::new(StringMeasurer);
    dl.append("a".to_string());
    dl.append("b".to_string());
    dl.append("c".to_string());
    dl.append("d".to_string());
    dl.append("e".to_string());
    dl.append("f".to_string());
    dl.delete(0);
    dl.delete(1);
    dl.delete(2);
    assert_eq!(
        Some(ItemInfo {
            index: 0,
            item: &"b".to_string(),
            inner_distance: 0,
            outer_distance: 0,
        }),
        dl.get_by_index(0)
    );
    assert_eq!(
        Some(ItemInfo {
            index: 1,
            item: &"d".to_string(),
            inner_distance: 0,
            outer_distance: 1,
        }),
        dl.get_by_index(1)
    );
    assert_eq!(
        Some(ItemInfo {
            index: 2,
            item: &"f".to_string(),
            inner_distance: 0,
            outer_distance: 2,
        }),
        dl.get_by_index(2)
    );
}