-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlist.py
More file actions
294 lines (197 loc) · 6.13 KB
/
Copy pathlist.py
File metadata and controls
294 lines (197 loc) · 6.13 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
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
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
"""
Linked List implementation
run tests:
python3 list.py
"""
import unittest
class Node:
def __init__(self, value):
self.next = None
self.value = value
class LinkedList:
def __init__(self):
self.head = None
def append(self, value):
if self.is_empty():
self.head = Node(value)
else:
cursor = self.head
while cursor.next:
# iterate to end of list
cursor = cursor.next
cursor.next = Node(value)
def insert(self, value):
if self.is_empty():
self.head = Node(value)
return
temp = Node(value)
temp.next = self.head
self.head = temp
def count(self):
if self.is_empty():
return 0
cursor = self.head
count = 1
while cursor.next:
cursor = cursor.next
count += 1
return count
def search(self, value):
if self.is_empty():
return False
cursor = self.head
def found():
return cursor.value == value
if found():
return cursor
while cursor.next:
if found():
return cursor
cursor = cursor.next
return False
def remove(self, value):
if self.is_empty():
return False
# special treatment for first value
# TODO find algorithm that avoids this
if self.head.value == value:
self.head = None
return True
assert self.count() > 1, 'list has at least one element'
found = False
current = self.head
previous = None
while not found:
if current.value == value:
found = True
break
elif not current.next:
break
previous = current
current = current.next
if not found:
return False
previous.next = current.next
# current is garbage collected
return True
def is_empty(self):
return not bool(self.head)
class OrderedLinkedList(LinkedList):
def append(self, value):
# meaningless in this context
raise(NotImplemented)
def insert():
# TODO insert value at correct location
# to maintain ordering
pass
def search(self, value):
# TODO implent binary or quick search
pass
class TestLinkedList(unittest.TestCase):
def test_creation_returns_empty_list(self):
list_ = LinkedList()
self.assertTrue(list_.is_empty)
def test_one_value(self):
list_ = LinkedList()
list_.append(1)
self.assertTrue(isinstance(list_.head, Node))
self.assertEqual(list_.head.value, 1)
self.assertFalse(list_.is_empty())
def test_two_nodes(self):
list_ = LinkedList()
list_.append(1)
list_.append(2)
self.assertEqual(list_.head.next.value, 2)
def test_three_nodes(self):
list_ = LinkedList()
list_.append(1)
list_.append(2)
list_.append(3)
self.assertEqual(list_.head.next.next.value, 3)
def test_insert_empty(self):
list_ = LinkedList()
list_.insert(1)
self.assertEqual(list_.head.value, 1)
def test_insert_one_member(self):
list_ = LinkedList()
list_.append(1)
list_.insert(2)
self.assertEqual(list_.head.value, 2)
self.assertEqual(list_.head.next.value, 1)
def test_insert_two_members(self):
list_ = LinkedList()
list_.append(1)
list_.insert(2)
list_.insert(3)
self.assertEqual(list_.head.next.next.value, 1)
self.assertEqual(list_.head.next.value, 2)
self.assertEqual(list_.head.value, 3)
def test_count_empty(self):
list_ = LinkedList()
self.assertEqual(list_.count(), 0)
def test_count_one_member(self):
list_ = LinkedList()
list_.insert(2)
self.assertEqual(list_.count(), 1)
def test_count_hundred_members(self):
list_ = LinkedList()
for i in range(100):
list_.insert(i)
self.assertEqual(list_.count(), 100)
def test_search_empty(self):
list_ = LinkedList()
got = list_.search(3)
self.assertFalse(got)
def test_search_one_member_true(self):
list_ = LinkedList()
list_.insert(3)
got = list_.search(3)
self.assertTrue(got)
self.assertEqual(got.value, 3)
def test_search_one_member_false(self):
list_ = LinkedList()
list_.insert(2)
got = list_.search(3)
self.assertFalse(got)
def test_search_fifty_members_true(self):
list_ = LinkedList()
for i in range(50):
list_.insert(i)
got = list_.search(49)
self.assertTrue(got)
self.assertEqual(got.value, 49)
def test_search_fifty_members_false(self):
list_ = LinkedList()
for i in range(50):
list_.insert(i)
got = list_.search(50)
self.assertFalse(got)
def test_remove_empty_list(self):
list_ = LinkedList()
self.assertFalse(list_.remove(5))
def test_remove_from_one_member_list(self):
list_ = LinkedList()
list_.insert(5)
list_.remove(5)
self.assertTrue(list_.is_empty())
def test_remove_from_two_member_list(self):
list_ = LinkedList()
list_.insert(5)
list_.insert(65)
list_.remove(5)
self.assertEqual(list_.count(), 1)
self.assertEqual(list_.head.value, 65)
def test_remove_from_end_of_three_member_list(self):
list_ = LinkedList()
list_.insert(5)
list_.insert(65)
list_.insert(43)
list_.remove(5) # first inserted will be last in list
self.assertEqual(list_.count(), 2)
self.assertEqual(list_.head.value, 43)
self.assertEqual(list_.head.next.value, 65)
self.assertIsNone(list_.head.next.next)
class TestOrderedLinkedList(unittest.TestCase):
pass
if __name__ == '__main__':
unittest.main()