orx-linked-list 3.9.0

A linked list implementation with unique features and an extended list of constant time methods providing high performance traversals and mutations.
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154

mod doubly;
use orx_linked_list::*;
use std::fmt::Debug;

fn assert_empty_slice<'a, T: Debug + Eq>(slice: &DoublyListSlice<'a, T>) {
    assert_eq!(slice.iter().count(), 0);
    assert_eq!(slice.iter_ptr().count(), 0);
    assert_eq!(slice.front(), None);
    assert_eq!(slice.back(), None);
}

#[test]
fn empty_from_empty() {
    let list = DoublyList::<usize>::new();
    assert_empty_slice(&list.slice(..));
}

#[test]
fn empty_from_nonempty() {
    let mut list = DoublyList::new();
    let b = list.push_back('b');
    let a = list.push_front('a');
    let c = list.push_back('c');
    assert!(list.eq_to_iter_vals(['a', 'b', 'c']));

    let indices = [a.clone(), b.clone(), c.clone()];

    for x in &indices {
        assert_empty_slice(&list.slice(x..x));
    }
}

#[test]
fn singleton_slice() {
    let mut list = DoublyList::new();
    let b = list.push_back('b');
    let a = list.push_front('a');
    let c = list.push_back('c');

    let expected = ['a', 'b', 'c'];
    assert!(list.eq_to_iter_refs(expected.iter()));

    let indices = [a.clone(), b.clone(), c.clone()];

    for (i, x) in indices.iter().enumerate() {
        let slice = list.slice(x..=x);
        slice.eq_to_iter_vals([expected[i]]);
    }
}

#[test]
fn full_slice() {
    let mut list = DoublyList::new();
    let _ = list.push_back('b');
    let a = list.push_front('a');
    let c = list.push_back('c');
    assert!(list.eq_to_iter_vals(['a', 'b', 'c']));

    assert!(list.eq_to_iter_refs(list.slice(..).iter()));
    assert!(list.eq_to_iter_refs(list.slice(&a..).iter()));
    assert!(list.eq_to_iter_refs(list.slice(..=&c).iter()));
}

#[test]
fn non_empty() {
    let mut list = DoublyList::new();
    let b = list.push_back('b');
    let a = list.push_front('a');
    let c = list.push_back('c');

    let expected = ['a', 'b', 'c'];
    assert!(list.eq_to_iter_refs(expected.iter()));

    let indices = [a, b, c];

    for i in 0..expected.len() {
        for j in i..expected.len() {
            let slice = list.slice(&indices[i]..=&indices[j]);
            slice.eq_to_iter_refs(&expected.as_slice()[i..=j]);

            let slice = list.slice(&indices[i]..&indices[j]);
            slice.eq_to_iter_refs(&expected.as_slice()[i..j]);
        }
    }
}

#[test]
fn demo_usage() {
    let mut list = DoublyList::new();

    list.push_back(3);
    list.push_front(1);
    list.push_front(7);
    list.push_back(4);
    list.push_front(9);

    let expected_values = vec![9, 7, 1, 3, 4];

    assert!(list.eq_to_iter_refs(&expected_values));
    assert!(list.slice(..).eq_to_iter_refs(&expected_values));

    let idx: Vec<_> = list.indices().collect();

    let slice = list.slice(&idx[1]..=&idx[3]);
    assert_eq!(slice.front(), Some(&7));
    assert_eq!(slice.back(), Some(&3));
    assert!(slice.eq_to_iter_vals([7, 1, 3]));

    let sum: usize = slice.iter().sum();
    assert_eq!(sum, 11);
}

#[test]
fn doubly_slice() {
    let list = doubly::new_doubly(&mut doubly::rng(), 50, 200);

    let n = list.len();
    let vec: Vec<_> = list.iter().cloned().collect();
    let idx: Vec<_> = list.indices().collect();

    // empty
    for i in 0..n {
        assert_empty_slice(&list.slice(&idx[i]..&idx[i]));
    }

    // single
    for i in 0..n {
        let s = list.slice(&idx[i]..=&idx[i]);
        s.eq_to_iter_refs(&vec[i..=i]);

        if i != n - 1 {
            let s = list.slice(&idx[i]..&idx[i + 1]);
            s.eq_to_iter_refs(&vec[i..=i]);
        }
    }

    // full
    list.slice(..).eq_to_iter_refs(&vec[..]);
    list.slice(&idx[0]..).eq_to_iter_refs(&vec[0..]);
    list.slice(..=&idx[n - 1]).eq_to_iter_refs(&vec[..(n - 1)]);
    list.slice(&idx[0]..=&idx[n - 1])
        .eq_to_iter_refs(&vec[0..(n - 1)]);

    // arbitrary ranges
    for i in 0..n {
        for j in i..n {
            let s = list.slice(&idx[i]..=&idx[j]);
            s.eq_to_iter_refs(&vec[i..=j]);

            let s = list.slice(&idx[i]..&idx[j]);
            s.eq_to_iter_refs(&vec[i..j]);
        }
    }
}