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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
|
#![allow(clippy::unit_arg)]
use std::fmt::{Debug, Error, Formatter, Write};
use crate::Vector;
use proptest::proptest;
use proptest_derive::Arbitrary;
#[derive(Arbitrary, Debug)]
enum Action<A> {
PushFront(A),
PushBack(A),
PopFront,
PopBack,
Insert(usize, A),
Remove(usize),
JoinLeft(Vec<A>),
JoinRight(Vec<A>),
SplitLeft(usize),
SplitRight(usize),
}
#[derive(Arbitrary)]
struct Actions<A>(Vec<Action<A>>)
where
A: Clone;
impl<A> Debug for Actions<A>
where
A: Debug + Clone,
{
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {
let mut out = String::new();
let mut expected = vec![];
writeln!(out, "let mut vec = Vector::new();")?;
for action in &self.0 {
match action {
Action::PushFront(ref value) => {
expected.insert(0, value.clone());
writeln!(out, "vec.push_front({:?});", value)?
}
Action::PushBack(ref value) => {
expected.push(value.clone());
writeln!(out, "vec.push_back({:?});", value)?
}
Action::PopFront => {
if !expected.is_empty() {
expected.remove(0);
}
writeln!(out, "vec.pop_front();")?
}
Action::PopBack => {
expected.pop();
writeln!(out, "vec.pop_back();")?
}
Action::Insert(ref index, ref value) => {
let index = cap_index(expected.len(), *index);
expected.insert(index, value.clone());
writeln!(out, "vec.insert({:?}, {:?});", index, value)?
}
Action::Remove(ref index) => {
if !expected.is_empty() {
let index = cap_index(expected.len(), *index);
expected.remove(index);
writeln!(out, "vec.remove({:?})", index)?
} else {
continue;
}
}
Action::JoinLeft(ref vec) => {
let mut vec_new = vec.clone();
vec_new.append(&mut expected);
expected = vec_new;
writeln!(
out,
"let mut vec_new = Vector::from(vec!{:?}); // size {:?}",
vec,
vec.len()
)?;
writeln!(out, "vec_new.append(vec);")?;
writeln!(out, "vec = vec_new;")?
}
Action::JoinRight(ref vec) => {
expected.append(&mut vec.clone());
writeln!(
out,
"vec.append(Vector::from(vec!{:?})); // size {:?}",
vec,
vec.len()
)?
}
Action::SplitLeft(ref index) => {
let index = cap_index(expected.len(), *index);
expected.truncate(index);
writeln!(out, "vec.split_off({:?});", index)?
}
Action::SplitRight(ref index) => {
let index = cap_index(expected.len(), *index);
expected = expected.split_off(index);
writeln!(out, "vec = vec.split_off({:?});", index)?
}
}
writeln!(out, "// len = {:?}", expected.len())?;
}
writeln!(out, "let expected = vec!{:?};", expected)?;
writeln!(out, "assert_eq!(Vector::from(expected), vec);")?;
write!(f, "{}", super::code_fmt(&out))
}
}
fn cap_index(len: usize, index: usize) -> usize {
if len == 0 {
0
} else {
index % len
}
}
proptest! {
#[test]
fn comprehensive(actions: Actions<u8>) {
let mut vec = Vector::new();
let mut nat = Vec::new();
vec.assert_invariants();
for action in actions.0 {
match action {
Action::PushFront(value) => {
let len = vec.len();
nat.insert(0, value);
vec.push_front(value);
assert_eq!(len + 1, vec.len());
}
Action::PushBack(value) => {
let len = vec.len();
nat.push(value);
vec.push_back(value);
assert_eq!(len + 1, vec.len());
}
Action::PopFront => {
if vec.is_empty() {
assert_eq!(None, vec.pop_front());
} else {
let len = vec.len();
assert_eq!(nat.remove(0), vec.pop_front().unwrap());
assert_eq!(len - 1, vec.len());
}
}
Action::PopBack => {
if vec.is_empty() {
assert_eq!(None, vec.pop_back());
} else {
let len = vec.len();
assert_eq!(nat.pop(), vec.pop_back());
assert_eq!(len - 1, vec.len());
}
}
Action::Insert(index, value) => {
let index = cap_index(vec.len(), index);
let len = vec.len();
nat.insert(index, value);
vec.insert(index, value);
assert_eq!(len + 1, vec.len());
}
Action::Remove(index) => {
if vec.is_empty() {
continue;
}
let index = cap_index(vec.len(), index);
let len = vec.len();
assert_eq!(nat.remove(index), vec.remove(index));
assert_eq!(len - 1, vec.len());
}
Action::JoinLeft(mut new_nat) => {
let mut new_vec = new_nat.iter().cloned().collect::<Vector<_>>();
let add_len = new_nat.len();
let len = vec.len();
new_vec.append(vec);
vec = new_vec;
new_nat.append(&mut nat);
nat = new_nat;
assert_eq!(len + add_len, vec.len());
}
Action::JoinRight(mut new_nat) => {
let new_vec = new_nat.iter().cloned().collect::<Vector<_>>();
let add_len = new_nat.len();
let len = vec.len();
vec.append(new_vec);
nat.append(&mut new_nat);
assert_eq!(len + add_len, vec.len());
}
Action::SplitLeft(index) => {
let index = cap_index(vec.len(), index);
let len = vec.len();
let vec_right = vec.split_off(index);
let nat_right = nat.split_off(index);
assert_eq!(index, vec.len());
assert_eq!(len - index, vec_right.len());
assert_eq!(nat_right.iter().cloned().collect::<Vector<_>>(), vec_right);
}
Action::SplitRight(index) => {
let index = cap_index(vec.len(), index);
let len = vec.len();
let vec_right = vec.split_off(index);
let nat_right = nat.split_off(index);
assert_eq!(index, vec.len());
assert_eq!(len - index, vec_right.len());
assert_eq!(nat.iter().cloned().collect::<Vector<_>>(), vec);
vec = vec_right;
nat = nat_right;
}
}
vec.assert_invariants();
assert_eq!(nat.len(),vec.len());
assert_eq!(nat.iter().cloned().collect::<Vector<_>>(), vec);
}
}
}
#[test]
fn test_inserts() {
const N: usize = 2000;
let mut v = Vector::new();
for i in 0..N {
v.insert(v.len() / 2, i);
}
let mut rv: Vec<usize> = Vec::new();
rv.extend((0..N).skip(1).step_by(2));
rv.extend((0..N).step_by(2).rev());
assert_eq!(rv.iter().cloned().collect::<Vector<_>>(), v);
}
|
