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
|
use simple_linked_list::SimpleLinkedList;
#[test]
fn test_new_list_is_empty() {
let list: SimpleLinkedList<u32> = SimpleLinkedList::new();
assert_eq!(list.len(), 0, "list's length must be 0");
}
#[test]
fn test_push_increments_length() {
let mut list: SimpleLinkedList<u32> = SimpleLinkedList::new();
list.push(1);
assert_eq!(list.len(), 1, "list's length must be 1");
list.push(2);
assert_eq!(list.len(), 2, "list's length must be 2");
}
#[test]
fn test_pop_decrements_length() {
let mut list: SimpleLinkedList<u32> = SimpleLinkedList::new();
list.push(1);
list.push(2);
list.pop();
assert_eq!(list.len(), 1, "list's length must be 1");
list.pop();
assert_eq!(list.len(), 0, "list's length must be 0");
}
#[test]
fn test_is_empty() {
let mut list: SimpleLinkedList<u32> = SimpleLinkedList::new();
assert!(list.is_empty(), "List wasn't empty on creation");
for inserts in 0..100 {
for i in 0..inserts {
list.push(i);
assert!(
!list.is_empty(),
"List was empty after having inserted {}/{} elements",
i,
inserts
);
}
for i in 0..inserts {
assert!(
!list.is_empty(),
"List was empty before removing {}/{} elements",
i,
inserts
);
list.pop();
}
assert!(
list.is_empty(),
"List wasn't empty after having removed {} elements",
inserts
);
}
}
#[test]
fn test_pop_returns_head_element_and_removes_it() {
let mut list: SimpleLinkedList<u32> = SimpleLinkedList::new();
list.push(1);
list.push(2);
assert_eq!(list.pop(), Some(2), "Element must be 2");
assert_eq!(list.pop(), Some(1), "Element must be 1");
assert_eq!(list.pop(), None, "No element should be contained in list");
}
#[test]
fn test_peek_returns_reference_to_head_element_but_does_not_remove_it() {
let mut list: SimpleLinkedList<u32> = SimpleLinkedList::new();
assert_eq!(list.peek(), None, "No element should be contained in list");
list.push(2);
assert_eq!(list.peek(), Some(&2), "Element must be 2");
assert_eq!(list.peek(), Some(&2), "Element must be still 2");
list.push(3);
assert_eq!(list.peek(), Some(&3), "Head element is now 3");
assert_eq!(list.pop(), Some(3), "Element must be 3");
assert_eq!(list.peek(), Some(&2), "Head element is now 2");
assert_eq!(list.pop(), Some(2), "Element must be 2");
assert_eq!(list.peek(), None, "No element should be contained in list");
}
#[test]
fn test_from_slice() {
let mut array = vec!["1", "2", "3", "4"];
let mut list: SimpleLinkedList<_> = array.drain(..).collect();
assert_eq!(list.pop(), Some("4"));
assert_eq!(list.pop(), Some("3"));
assert_eq!(list.pop(), Some("2"));
assert_eq!(list.pop(), Some("1"));
}
#[test]
fn test_reverse() {
let mut list: SimpleLinkedList<u32> = SimpleLinkedList::new();
list.push(1);
list.push(2);
list.push(3);
let mut rev_list = list.rev();
assert_eq!(rev_list.pop(), Some(1));
assert_eq!(rev_list.pop(), Some(2));
assert_eq!(rev_list.pop(), Some(3));
assert_eq!(rev_list.pop(), None);
}
#[test]
fn test_into_vector() {
let mut v = Vec::new();
let mut s = SimpleLinkedList::new();
for i in 1..4 {
v.push(i);
s.push(i);
}
let s_as_vec: Vec<i32> = s.into();
assert_eq!(v, s_as_vec);
}
|
