forked from keon/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_queues.py
106 lines (82 loc) · 2.99 KB
/
test_queues.py
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
from algorithms.queues import (
ArrayQueue, LinkedListQueue,
max_sliding_window,
reconstruct_queue,
PriorityQueue, PriorityQueueNode
)
import unittest
class TestQueue(unittest.TestCase):
"""
Test suite for the Queue data structures.
"""
def test_ArrayQueue(self):
queue = ArrayQueue()
queue.enqueue(1)
queue.enqueue(2)
queue.enqueue(3)
# test __iter__()
it = iter(queue)
self.assertEqual(1, next(it))
self.assertEqual(2, next(it))
self.assertEqual(3, next(it))
self.assertRaises(StopIteration, next, it)
# test __len__()
self.assertEqual(3, len(queue))
# test is_empty()
self.assertFalse(queue.is_empty())
# test peek()
self.assertEqual(1, queue.peek())
# test dequeue()
self.assertEqual(1, queue.dequeue())
self.assertEqual(2, queue.dequeue())
self.assertEqual(3, queue.dequeue())
self.assertTrue(queue.is_empty())
def test_LinkedListQueue(self):
queue = LinkedListQueue()
queue.enqueue(1)
queue.enqueue(2)
queue.enqueue(3)
# test __iter__()
it = iter(queue)
self.assertEqual(1, next(it))
self.assertEqual(2, next(it))
self.assertEqual(3, next(it))
self.assertRaises(StopIteration, next, it)
# test __len__()
self.assertEqual(3, len(queue))
# test is_empty()
self.assertFalse(queue.is_empty())
# test peek()
self.assertEqual(1, queue.peek())
# test dequeue()
self.assertEqual(1, queue.dequeue())
self.assertEqual(2, queue.dequeue())
self.assertEqual(3, queue.dequeue())
self.assertTrue(queue.is_empty())
class TestSuite(unittest.TestCase):
def test_max_sliding_window(self):
array = [1, 3, -1, -3, 5, 3, 6, 7]
self.assertEqual(max_sliding_window(array, k=5), [5, 5, 6, 7])
self.assertEqual(max_sliding_window(array, k=3), [3, 3, 5, 5, 6, 7])
self.assertEqual(max_sliding_window(array, k=7), [6, 7])
array = [8, 5, 10, 7, 9, 4, 15, 12, 90, 13]
self.assertEqual(max_sliding_window(array, k=4), [10, 10, 10, 15, 15, 90, 90])
self.assertEqual(max_sliding_window(array, k=7), [15, 15, 90, 90])
self.assertEqual(max_sliding_window(array, k=2), [8, 10, 10, 9, 9, 15, 15, 90, 90])
def test_reconstruct_queue(self):
self.assertEqual([[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]],
reconstruct_queue([[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]))
class TestPriorityQueue(unittest.TestCase):
"""
Test suite for the PriorityQueue data structures.
"""
def test_PriorityQueue(self):
queue = PriorityQueue()
queue.push(3)
queue.push(4)
queue.push(1)
queue.push(6)
self.assertEqual(4,queue.size())
self.assertEqual(str(1) + ": " + str(1),str(queue.pop()))
if __name__ == "__main__":
unittest.main()