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
|
use crate::RingBuffer;
#[test]
fn for_each() {
let cap = 2;
let buf = RingBuffer::<i32>::new(cap);
let (mut prod, mut cons) = buf.split();
prod.push(10).unwrap();
prod.push(20).unwrap();
let mut sum_1 = 0;
cons.for_each(|v| {
sum_1 += *v;
});
let first = cons.pop().expect("First element not available");
let second = cons.pop().expect("Second element not available");
assert_eq!(sum_1, first + second);
}
#[test]
fn for_each_mut() {
let cap = 2;
let buf = RingBuffer::<i32>::new(cap);
let (mut prod, mut cons) = buf.split();
prod.push(10).unwrap();
prod.push(20).unwrap();
cons.for_each_mut(|v| {
*v *= 2;
});
let mut sum_1 = 0;
cons.for_each_mut(|v| {
sum_1 += *v;
});
let first = cons.pop().expect("First element not available");
let second = cons.pop().expect("Second element not available");
assert_eq!(sum_1, first + second);
}
#[test]
fn push_pop_slice() {
let buf = RingBuffer::<i32>::new(4);
let (mut prod, mut cons) = buf.split();
let mut tmp = [0; 5];
assert_eq!(prod.push_slice(&[]), 0);
assert_eq!(prod.push_slice(&[0, 1, 2]), 3);
assert_eq!(cons.pop_slice(&mut tmp[0..2]), 2);
assert_eq!(tmp[0..2], [0, 1]);
assert_eq!(prod.push_slice(&[3, 4]), 2);
assert_eq!(prod.push_slice(&[5, 6]), 1);
assert_eq!(cons.pop_slice(&mut tmp[0..3]), 3);
assert_eq!(tmp[0..3], [2, 3, 4]);
assert_eq!(prod.push_slice(&[6, 7, 8, 9]), 3);
assert_eq!(cons.pop_slice(&mut tmp), 4);
assert_eq!(tmp[0..4], [5, 6, 7, 8]);
}
#[test]
fn move_slice() {
let buf0 = RingBuffer::<i32>::new(4);
let buf1 = RingBuffer::<i32>::new(4);
let (mut prod0, mut cons0) = buf0.split();
let (mut prod1, mut cons1) = buf1.split();
let mut tmp = [0; 5];
assert_eq!(prod0.push_slice(&[0, 1, 2]), 3);
assert_eq!(prod1.move_from(&mut cons0, None), 3);
assert_eq!(prod1.move_from(&mut cons0, None), 0);
assert_eq!(cons1.pop_slice(&mut tmp), 3);
assert_eq!(tmp[0..3], [0, 1, 2]);
assert_eq!(prod0.push_slice(&[3, 4, 5]), 3);
assert_eq!(prod1.move_from(&mut cons0, None), 3);
assert_eq!(cons1.pop_slice(&mut tmp), 3);
assert_eq!(tmp[0..3], [3, 4, 5]);
assert_eq!(prod1.push_slice(&[6, 7, 8]), 3);
assert_eq!(prod0.push_slice(&[9, 10]), 2);
assert_eq!(prod1.move_from(&mut cons0, None), 1);
assert_eq!(prod1.move_from(&mut cons0, None), 0);
assert_eq!(cons1.pop_slice(&mut tmp), 4);
assert_eq!(tmp[0..4], [6, 7, 8, 9]);
}
#[test]
fn move_slice_count() {
let buf0 = RingBuffer::<i32>::new(4);
let buf1 = RingBuffer::<i32>::new(4);
let (mut prod0, mut cons0) = buf0.split();
let (mut prod1, mut cons1) = buf1.split();
let mut tmp = [0; 5];
assert_eq!(prod0.push_slice(&[0, 1, 2]), 3);
assert_eq!(prod1.move_from(&mut cons0, Some(2)), 2);
assert_eq!(cons1.pop_slice(&mut tmp), 2);
assert_eq!(tmp[0..2], [0, 1]);
assert_eq!(prod1.move_from(&mut cons0, Some(2)), 1);
assert_eq!(cons1.pop_slice(&mut tmp), 1);
assert_eq!(tmp[0..1], [2]);
assert_eq!(prod0.push_slice(&[3, 4, 5, 6]), 4);
assert_eq!(prod1.move_from(&mut cons0, Some(3)), 3);
assert_eq!(cons1.pop_slice(&mut tmp), 3);
assert_eq!(tmp[0..3], [3, 4, 5]);
assert_eq!(prod0.push_slice(&[7, 8, 9]), 3);
assert_eq!(prod1.move_from(&mut cons0, Some(5)), 4);
assert_eq!(cons1.pop_slice(&mut tmp), 4);
assert_eq!(tmp[0..4], [6, 7, 8, 9]);
}
|
