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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89

#![feature(test)]

extern crate dlist;
extern crate test;

use std::rc::Rc;

use dlist::{DList, Measurer};
use lipsum::lipsum;
use test::Bencher;

struct MeasurerU32;
struct MeasurerU64;
struct MeasurerString;
struct MeasurerStringRc;

impl Measurer<u32> for MeasurerU32 {
    type Measure = u64;
    fn nil(&self) -> u64 {
        0
    }

    fn measure(&self, value: &u32) -> u64 {
        *value as u64
    }
}

impl Measurer<u64> for MeasurerU64 {
    type Measure = u64;
    fn nil(&self) -> u64 {
        0
    }

    fn measure(&self, value: &u64) -> u64 {
        *value
    }
}

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

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

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

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

fn add_n(n: usize, b: &mut Bencher) {
    let mut lines = Vec::new();
    for _i in 0..n {
        let mut lorem = lipsum(25);
        lorem.shrink_to_fit();
        lines.push(Rc::new(lorem));
    }
    b.iter(|| {
        let mut dl = DList::new(MeasurerStringRc);
        for (i, s) in lines.iter().enumerate() {
            dl.insert(i, s.clone());
        }
    });
}

#[bench]
fn add_1(b: &mut Bencher) {
    add_n(1, b);
}

#[bench]
fn add_1000(b: &mut Bencher) {
    add_n(1000, b);
}

#[bench]
fn add_100000(b: &mut Bencher) {
    add_n(100000, b);
}