-
Notifications
You must be signed in to change notification settings - Fork 313
/
Copy pathtest_linked_lists.py
249 lines (233 loc) · 7.82 KB
/
test_linked_lists.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
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
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
from pydatastructs.linear_data_structures import DoublyLinkedList, SinglyLinkedList, SinglyCircularLinkedList, DoublyCircularLinkedList, SkipList
from pydatastructs.utils.raises_util import raises
import copy, random
def test_DoublyLinkedList():
random.seed(1000)
dll = DoublyLinkedList()
assert raises(IndexError, lambda: dll[2])
dll.appendleft(5)
dll.append(1)
dll.appendleft(2)
dll.append(3)
dll.insert_after(dll[-1], 4)
dll.insert_after(dll[2], 6)
dll.insert_before(dll[4], 1.1)
dll.insert_before(dll[0], 7)
dll.insert_at(0, 2)
dll.insert_at(-1, 9)
dll.extract(2)
assert dll.popleft().key == 2
assert dll.popright().key == 4
assert dll.search(3) == dll[-2]
assert dll.search(-1) is None
dll[-2].key = 0
assert str(dll) == ("['(7, None)', '(5, None)', '(1, None)', "
"'(6, None)', '(1.1, None)', '(0, None)', "
"'(9, None)']")
assert len(dll) == 7
assert raises(IndexError, lambda: dll.insert_at(8, None))
assert raises(IndexError, lambda: dll.extract(20))
dll_copy = DoublyCircularLinkedList()
for i in range(dll.size):
dll_copy.append(dll[i])
for i in range(len(dll)):
if i%2 == 0:
dll.popleft()
else:
dll.popright()
assert str(dll) == "[]"
for _ in range(len(dll_copy)):
index = random.randint(0, len(dll_copy) - 1)
dll_copy.extract(index)
assert str(dll_copy) == "[]"
assert raises(ValueError, lambda: dll_copy.extract(1))
dll_palindrome = DoublyLinkedList()
dll_palindrome.append(1)
dll_palindrome.append(2)
dll_palindrome.append(3)
dll_palindrome.append(2)
dll_palindrome.append(1)
assert dll_palindrome.is_palindrome() is True
dll_not_palindrome = DoublyLinkedList()
dll_not_palindrome.append(1)
dll_not_palindrome.append(2)
dll_not_palindrome.append(3)
assert dll_not_palindrome.is_palindrome() is False
def test_SinglyLinkedList():
random.seed(1000)
sll = SinglyLinkedList()
assert raises(IndexError, lambda: sll[2])
sll.appendleft(5)
sll.append(1)
sll.appendleft(2)
sll.append(3)
sll.insert_after(sll[1], 4)
sll.insert_after(sll[-1], 6)
sll.insert_at(0, 2)
sll.insert_at(-1, 9)
sll.extract(2)
assert sll.popleft().key == 2
assert sll.popright().key == 6
sll[-2].key = 0
assert str(sll) == ("['(2, None)', '(4, None)', '(1, None)', "
"'(0, None)', '(9, None)']")
assert len(sll) == 5
assert raises(IndexError, lambda: sll.insert_at(6, None))
assert raises(IndexError, lambda: sll.extract(20))
sll_copy = DoublyCircularLinkedList()
for i in range(sll.size):
sll_copy.append(sll[i])
for i in range(len(sll)):
if i%2 == 0:
sll.popleft()
else:
sll.popright()
assert str(sll) == "[]"
for _ in range(len(sll_copy)):
index = random.randint(0, len(sll_copy) - 1)
sll_copy.extract(index)
assert str(sll_copy) == "[]"
assert raises(ValueError, lambda: sll_copy.extract(1))
sll_palindrome = SinglyLinkedList()
sll_palindrome.append(1)
sll_palindrome.append(2)
sll_palindrome.append(3)
sll_palindrome.append(2)
sll_palindrome.append(1)
assert sll_palindrome.is_palindrome() is True
sll_not_palindrome = SinglyLinkedList()
sll_not_palindrome.append(1)
sll_not_palindrome.append(2)
sll_not_palindrome.append(3)
assert sll_not_palindrome.is_palindrome() is False
def test_SinglyCircularLinkedList():
random.seed(1000)
scll = SinglyCircularLinkedList()
assert raises(IndexError, lambda: scll[2])
scll.appendleft(5)
scll.append(1)
scll.appendleft(2)
scll.append(3)
scll.insert_after(scll[1], 4)
scll.insert_after(scll[-1], 6)
scll.insert_at(0, 2)
scll.insert_at(-1, 9)
scll.extract(2)
assert scll.popleft().key == 2
assert scll.popright().key == 6
assert scll.search(-1) is None
scll[-2].key = 0
assert str(scll) == ("['(2, None)', '(4, None)', '(1, None)', "
"'(0, None)', '(9, None)']")
assert len(scll) == 5
assert raises(IndexError, lambda: scll.insert_at(6, None))
assert raises(IndexError, lambda: scll.extract(20))
scll_copy = DoublyCircularLinkedList()
for i in range(scll.size):
scll_copy.append(scll[i])
for i in range(len(scll)):
if i%2 == 0:
scll.popleft()
else:
scll.popright()
assert str(scll) == "[]"
for _ in range(len(scll_copy)):
index = random.randint(0, len(scll_copy) - 1)
scll_copy.extract(index)
assert str(scll_copy) == "[]"
assert raises(ValueError, lambda: scll_copy.extract(1))
scll_palindrome = SinglyCircularLinkedList()
scll_palindrome.append(1)
scll_palindrome.append(2)
scll_palindrome.append(3)
scll_palindrome.append(2)
scll_palindrome.append(1)
assert scll_palindrome.is_palindrome() is True
scll_not_palindrome = SinglyCircularLinkedList()
scll_not_palindrome.append(1)
scll_not_palindrome.append(2)
scll_not_palindrome.append(3)
assert scll_not_palindrome.is_palindrome() is False
def test_DoublyCircularLinkedList():
random.seed(1000)
dcll = DoublyCircularLinkedList()
assert raises(IndexError, lambda: dcll[2])
dcll.appendleft(5)
dcll.append(1)
dcll.appendleft(2)
dcll.append(3)
dcll.insert_after(dcll[-1], 4)
dcll.insert_after(dcll[2], 6)
dcll.insert_before(dcll[4], 1)
dcll.insert_before(dcll[0], 7)
dcll.insert_at(0, 2)
dcll.insert_at(-1, 9)
dcll.extract(2)
assert dcll.popleft().key == 2
assert dcll.popright().key == 4
dcll[-2].key = 0
assert str(dcll) == ("['(7, None)', '(5, None)', '(1, None)', "
"'(6, None)', '(1, None)', '(0, None)', "
"'(9, None)']")
assert len(dcll) == 7
assert raises(IndexError, lambda: dcll.insert_at(8, None))
assert raises(IndexError, lambda: dcll.extract(20))
dcll_copy = DoublyCircularLinkedList()
for i in range(dcll.size):
dcll_copy.append(dcll[i])
for i in range(len(dcll)):
if i%2 == 0:
dcll.popleft()
else:
dcll.popright()
assert str(dcll) == "[]"
for _ in range(len(dcll_copy)):
index = random.randint(0, len(dcll_copy) - 1)
dcll_copy.extract(index)
assert str(dcll_copy) == "[]"
assert raises(ValueError, lambda: dcll_copy.extract(1))
dcll_palindrome = DoublyCircularLinkedList()
dcll_palindrome.append(1)
dcll_palindrome.append(2)
dcll_palindrome.append(3)
dcll_palindrome.append(2)
dcll_palindrome.append(1)
assert dcll_palindrome.is_palindrome() is True
dcll_not_palindrome = DoublyCircularLinkedList()
dcll_not_palindrome.append(1)
dcll_not_palindrome.append(2)
dcll_not_palindrome.append(3)
assert dcll_not_palindrome.is_palindrome() is False
def test_SkipList():
random.seed(0)
sl = SkipList()
sl.insert(2)
sl.insert(10)
sl.insert(92)
sl.insert(1)
sl.insert(4)
sl.insert(27)
sl.extract(10)
assert str(sl) == ("(1, None) None None None None \n"
"(1, None) None None None None \n"
"(1, None) (2, None) (4, None) (27, None) (92, None) \n")
assert raises(KeyError, lambda: sl.extract(15))
assert sl.search(1) is True
assert sl.search(47) is False
sl = SkipList()
for a in range(0, 20, 2):
sl.insert(a)
assert sl.search(16) is True
for a in range(4, 20, 4):
sl.extract(a)
assert sl.search(10) is True
for a in range(4, 20, 4):
sl.insert(a)
for a in range(0, 20, 2):
sl.extract(a)
assert sl.search(3) is False
li = SkipList()
li.insert(1)
li.insert(2)
assert li.levels == 1
assert li.size == 2