-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLinkedDequeTest.java
73 lines (59 loc) · 1.7 KB
/
LinkedDequeTest.java
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
package projectCode20280;
import static org.junit.jupiter.api.Assertions.*;
import org.junit.jupiter.api.Test;
class LinkedDequeTest {
@Test
void testSize() {
LinkedDeque<Integer> s = new LinkedDeque<>();
for(int i = 0; i < 10; ++i)
s.addFirst(i);
assertEquals(10, s.size());
}
@Test
void testIsEmpty() {
LinkedDeque<Integer> s = new LinkedDeque<>();
for(int i = 0; i < 10; ++i)
s.addFirst(i);
for(int i = 0; i < 10; ++i)
s.removeFirst();
assertEquals(true, s.isEmpty());
}
@Test
void testEnqueueFirst() {
LinkedDeque<Integer> s = new LinkedDeque<>();
for(int i = 0; i < 10; ++i)
s.addLast(i);
assertEquals("[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]", s.toString());
}
@Test
void testFirst() {
LinkedDeque<Integer> s = new LinkedDeque<>();
for(int i = 0; i < 10; ++i)
s.addLast(i);
assertEquals(0, s.first());
}
@Test
void testDequeueFirst() {
LinkedDeque<Integer> s = new LinkedDeque<>();
for(int i = 0; i < 10; ++i)
s.addLast(i);
assertEquals(0, s.removeFirst());
assertEquals(9, s.size());
}
@Test
void testDequeueLast() {
LinkedDeque<Integer> s = new LinkedDeque<>();
for(int i = 0; i < 10; ++i)
s.addLast(i);
assertEquals(9, s.removeLast());
assertEquals(9, s.size());
}
@Test
void testEnqueueLast() {
LinkedDeque<Integer> s = new LinkedDeque<>();
for(int i = 0; i < 10; ++i)
s.addFirst(i);
assertEquals(9, s.removeFirst());
assertEquals(9, s.size());
}
}