forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIntQueueTest.java
More file actions
128 lines (109 loc) · 2.98 KB
/
IntQueueTest.java
File metadata and controls
128 lines (109 loc) · 2.98 KB
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
package com.dataStructures;
import static org.junit.Assert.*;
import java.util.*;
import org.junit.Before;
import org.junit.Test;
public class IntQueueTest {
@Before
public void setup() {}
@Test
public void testEmptyQueue() {
IntQueue queue = new IntQueue(0);
assertTrue(queue.isEmpty());
assertEquals(queue.size(), 0);
}
@Test
public void testEnqueueOneElement() {
IntQueue queue = new IntQueue(1);
queue.enqueue(77);
assertEquals(queue.size(), 1);
}
@Test
public void testAll() {
int n = 5;
IntQueue queue = new IntQueue(10);
assertTrue(queue.isEmpty());
for (int i = 1; i <= n; i++) {
queue.enqueue(i);
assertFalse(queue.isEmpty());
}
for (int i = 1; i <= n; i++) {
assertEquals(i, queue.peek());
assertEquals(i, queue.dequeue());
assertEquals(queue.size(), n - i);
}
assertTrue(queue.isEmpty());
n = 8;
for (int i = 1; i <= n; i++) {
queue.enqueue(i);
assertFalse(queue.isEmpty());
}
for (int i = 1; i <= n; i++) {
assertEquals(i, queue.peek());
assertEquals(i, queue.dequeue());
assertEquals(queue.size(), n - i);
}
assertTrue(queue.isEmpty());
n = 9;
for (int i = 1; i <= n; i++) {
queue.enqueue(i);
assertFalse(queue.isEmpty());
}
for (int i = 1; i <= n; i++) {
assertEquals(i, queue.peek());
assertEquals(i, queue.dequeue());
assertEquals(queue.size(), n - i);
}
assertTrue(queue.isEmpty());
n = 10;
for (int i = 1; i <= n; i++) {
queue.enqueue(i);
assertFalse(queue.isEmpty());
}
for (int i = 1; i <= n; i++) {
assertEquals(i, queue.peek());
assertEquals(i, queue.dequeue());
assertEquals(queue.size(), n - i);
}
assertTrue(queue.isEmpty());
}
@Test
public void testPeekOneElement() {
IntQueue queue = new IntQueue(1);
queue.enqueue(77);
assertTrue(queue.peek() == 77);
assertEquals(queue.size(), 1);
}
@Test
public void testDequeueOneElement() {
IntQueue queue = new IntQueue(1);
queue.enqueue(77);
assertTrue(queue.dequeue() == 77);
assertEquals(queue.size(), 0);
}
@Test
public void testRandom() {
for (int qSize = 1; qSize <= 50; qSize++) {
IntQueue intQ = new IntQueue(qSize);
ArrayDeque<Integer> javaQ = new ArrayDeque<>(qSize);
assertEquals(javaQ.isEmpty(), intQ.isEmpty());
assertEquals(javaQ.size(), intQ.size());
for (int operations = 0; operations < 5000; operations++) {
double r = Math.random();
if (r < 0.60) {
int elem = (int) (1000 * Math.random());
if (javaQ.size() < qSize) {
javaQ.offer(elem);
intQ.enqueue(elem);
}
} else {
if (!javaQ.isEmpty()) {
assertEquals((int) javaQ.poll(), (int) intQ.dequeue());
}
}
assertEquals(javaQ.isEmpty(), intQ.isEmpty());
assertEquals(javaQ.size(), intQ.size());
}
}
}
}