weak-lists 0.1.0

Lists with weak references and concurrent iteration and modification
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
155
156

use {
    crate::unsync::{WeakList, WeakListElement},
    alloc::rc::Rc,
    core::array,
};

#[derive(Debug)]
struct Element {
    i: usize,
    element: WeakListElement<Element>,
}

impl PartialEq for Element {
    fn eq(&self, other: &Self) -> bool {
        self.i == other.i
    }
}

impl Element {
    fn new(i: usize) -> Rc<Self> {
        Rc::new_cyclic(|slf| Self {
            i,
            element: WeakListElement::new(slf.clone()),
        })
    }
}

#[test]
fn clear() {
    let list = WeakList::default();
    let entry = Element::new(0);
    entry.element.attach(&list);
    assert!(list.iter().next().is_some());
    list.clear();
    assert!(list.iter().next().is_none());
}

#[test]
fn attach_detach() {
    let list = WeakList::<Element>::default();
    let entries: [_; 3] = array::from_fn(|i| Element::new(1 << i));
    assert_eq!(list.iter().map(|e| e.i).sum::<usize>(), 0);
    entries[0].element.attach(&list);
    assert_eq!(list.iter().map(|e| e.i).sum::<usize>(), 1);
    entries[1].element.attach(&list);
    assert_eq!(list.iter().map(|e| e.i).sum::<usize>(), 3);
    entries[2].element.attach(&list);
    assert_eq!(list.iter().map(|e| e.i).sum::<usize>(), 7);
    entries[1].element.detach();
    assert_eq!(list.iter().map(|e| e.i).sum::<usize>(), 5);
    assert_eq!(
        list.iter()
            .map(|e| e.i)
            .inspect(|i| {
                if *i == 1 {
                    entries[1].element.attach(&list)
                }
            })
            .sum::<usize>(),
        7
    );
    assert_eq!(list.iter().map(|e| e.i).sum::<usize>(), 7);
    entries[0].element.detach();
    assert_eq!(
        list.iter()
            .map(|e| e.i)
            .inspect(|i| {
                if *i == 2 {
                    entries[0].element.attach(&list)
                }
            })
            .sum::<usize>(),
        6
    );
    assert_eq!(list.iter().map(|e| e.i).sum::<usize>(), 7);
    assert_eq!(
        list.iter()
            .map(|e| e.i)
            .inspect(|i| {
                if *i == 1 {
                    entries[1].element.detach();
                    entries[2].element.detach();
                }
            })
            .sum::<usize>(),
        1
    );
    assert_eq!(list.iter().map(|e| e.i).sum::<usize>(), 1);
}

#[test]
fn no_compact_with_iter() {
    let list = WeakList::<Element>::default();
    let entries: [_; 16] = array::from_fn(|i| Element::new(1 << i));
    for entry in &entries {
        entry.element.attach(&list);
    }
    for i in 0..15 {
        entries[i].element.detach();
    }
    let mut iter = list.iter();
    entries[0].element.attach(&list);
    assert_eq!(iter.next().unwrap().i, 1 << 15);
    assert!(iter.next().is_none());
    list.clear();
    for entry in &entries {
        entry.element.attach(&list);
    }
    for i in 0..15 {
        entries[i].element.detach();
    }
    let mut iter = list.iter();
    entries[0].element.attach(&list);
    assert_eq!(iter.next().unwrap().i, 1 << 0);
    assert_eq!(iter.next().unwrap().i, 1 << 15);
}

#[test]
fn clone_iter() {
    let list = WeakList::<Element>::default();
    let entries: [_; 3] = array::from_fn(|i| Element::new(1 << i));
    for entry in &entries {
        entry.element.attach(&list);
    }
    let mut iter1 = list.iter();
    iter1.next();
    let mut iter2 = iter1.clone();
    assert_eq!(iter1.next(), iter2.next());
    assert_eq!(iter1.next(), iter2.next());
    assert_eq!(iter1.next(), iter2.next());
}

#[test]
fn into_iter() {
    let list = WeakList::<Element>::default();
    let entries: [_; 3] = array::from_fn(|i| Element::new(1 << i));
    for entry in &entries {
        entry.element.attach(&list);
    }
    let mut iter1 = (&list).into_iter();
    let mut iter2 = list.iter();
    assert_eq!(iter1.next(), iter2.next());
    assert_eq!(iter1.next(), iter2.next());
    assert_eq!(iter1.next(), iter2.next());
    assert_eq!(iter1.next(), iter2.next());
}

#[test]
fn detach_on_drop() {
    let list = WeakList::<Element>::default();
    let entry = Element::new(1);
    entry.element.attach(&list);
    assert_eq!(list.iter().map(|e| e.i).sum::<usize>(), 1);
    drop(entry);
    assert_eq!(list.iter().map(|e| e.i).sum::<usize>(), 0);
}