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
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
|
#!/usr/bin/env python3
from typing import Any, Sequence
class Trie(object):
"""
This is a Trie class, see: https://en.wikipedia.org/wiki/Trie.
It attempts to follow Pythonic container patterns. See doctests
for examples.
"""
def __init__(self):
self.root = {}
self.end = "~END~"
self.length = 0
self.viz = ''
def insert(self, item: Sequence[Any]):
"""
Insert an item.
>>> t = Trie()
>>> t.insert('test')
>>> t.__contains__('test')
True
"""
current = self.root
for child in item:
current = current.setdefault(child, {})
current[self.end] = self.end
self.length += 1
def __contains__(self, item: Sequence[Any]) -> bool:
"""
Check whether an item is in the Trie.
>>> t = Trie()
>>> t.insert('test')
>>> t.__contains__('test')
True
>>> t.__contains__('testing')
False
>>> 'test' in t
True
"""
current = self.__traverse__(item)
if current is None:
return False
else:
return self.end in current
def contains_prefix(self, item: Sequence[Any]):
"""
Check whether a prefix is in the Trie. The prefix may or may not
be a full item.
>>> t = Trie()
>>> t.insert('testicle')
>>> t.contains_prefix('test')
True
>>> t.contains_prefix('testicle')
True
>>> t.contains_prefix('tessel')
False
"""
current = self.__traverse__(item)
return current is not None
def __traverse__(self, item: Sequence[Any]):
current = self.root
for child in item:
if child in current:
current = current[child]
else:
return None
return current
def __getitem__(self, item: Sequence[Any]):
"""Given an item, return its Trie node which contains all
of the successor (child) node pointers. If the item is not
a node in the Trie, raise a KeyError.
>>> t = Trie()
>>> t.insert('test')
>>> t.insert('testicle')
>>> t.insert('tessera')
>>> t.insert('tesack')
>>> t['tes']
{'t': {'~END~': '~END~', 'i': {'c': {'l': {'e': {'~END~': '~END~'}}}}}, 's': {'e': {'r': {'a': {'~END~': '~END~'}}}}, 'a': {'c': {'k': {'~END~': '~END~'}}}}
"""
ret = self.__traverse__(item)
if ret is None:
raise KeyError(f"Node '{item}' is not in the trie")
return ret
def delete_recursively(self, node, item: Sequence[Any]) -> bool:
if len(item) == 1:
del node[item]
if len(node) == 0 and node is not self.root:
del node
return True
else:
return False
else:
car = item[0]
cdr = item[1:]
lower = node[car]
if self.delete_recursively(lower, cdr):
return self.delete_recursively(node, car)
return False
def __delitem__(self, item: Sequence[Any]):
"""
Delete an item from the Trie.
>>> t = Trie()
>>> t.insert('test')
>>> t.insert('tess')
>>> t.insert('tessel')
>>> len(t)
3
>>> t.root
{'t': {'e': {'s': {'t': {'~END~': '~END~'}, 's': {'~END~': '~END~', 'e': {'l': {'~END~': '~END~'}}}}}}}
>>> t.__delitem__('test')
>>> len(t)
2
>>> t.root
{'t': {'e': {'s': {'s': {'~END~': '~END~', 'e': {'l': {'~END~': '~END~'}}}}}}}
>>> for x in t:
... print(x)
tess
tessel
>>> t.__delitem__('tessel')
>>> len(t)
1
>>> t.root
{'t': {'e': {'s': {'s': {'~END~': '~END~'}}}}}
>>> for x in t:
... print(x)
tess
>>> t.__delitem__('tess')
>>> len(t)
0
>>> t.root
{}
>>> t.insert('testy')
>>> len(t)
1
"""
if item not in self:
raise KeyError(f"Node '{item}' is not in the trie")
self.delete_recursively(self.root, item)
self.length -= 1
def __len__(self):
"""
Returns a count of the Trie's item population.
>>> t = Trie()
>>> len(t)
0
>>> t.insert('test')
>>> len(t)
1
>>> t.insert('testicle')
>>> len(t)
2
"""
return self.length
def __iter__(self):
self.content_generator = self.generate_recursively(self.root, '')
return self
def generate_recursively(self, node, path: Sequence[Any]):
"""
Generate items in the trie one by one.
>>> t = Trie()
>>> t.insert('test')
>>> t.insert('tickle')
>>> for item in t.generate_recursively(t.root, ''):
... print(item)
test
tickle
"""
for child in node:
if child == self.end:
yield path
else:
yield from self.generate_recursively(node[child], path + child)
def __next__(self):
"""
Iterate through the contents of the trie.
>>> t = Trie()
>>> t.insert('test')
>>> t.insert('tickle')
>>> for item in t:
... print(item)
test
tickle
"""
ret = next(self.content_generator)
if ret is not None:
return ret
raise StopIteration
def successors(self, item: Sequence[Any]):
"""
Return a list of the successors of an item.
>>> t = Trie()
>>> t.insert('what')
>>> t.insert('who')
>>> t.insert('when')
>>> t.successors('wh')
['a', 'o', 'e']
>>> u = Trie()
>>> u.insert(['this', 'is', 'a', 'test'])
>>> u.insert(['this', 'is', 'a', 'robbery'])
>>> u.insert(['this', 'is', 'a', 'walrus'])
>>> u.successors(['this', 'is', 'a'])
['test', 'robbery', 'walrus']
"""
node = self.__traverse__(item)
if node is None:
return None
return [x for x in node if x != self.end]
def repr_fancy(self, padding: str, pointer: str, parent: str, node: Any, has_sibling: bool):
if node is None:
return
if node is not self.root:
ret = f'\n{padding}{pointer}'
if has_sibling:
padding += '│ '
else:
padding += ' '
else:
ret = f'{pointer}'
child_count = 0
for child in node:
if child != self.end:
child_count += 1
for child in node:
if child != self.end:
if child_count > 1:
pointer = "├──"
has_sibling = True
else:
pointer = "└──"
has_sibling = False
pointer += f'{child}'
child_count -= 1
ret += self.repr_fancy(padding, pointer, node, node[child], has_sibling)
return ret
def repr_brief(self, node, delimiter):
"""
A friendly string representation of the contents of the Trie.
>>> t = Trie()
>>> t.insert([10, 0, 0, 1])
>>> t.insert([10, 0, 0, 2])
>>> t.insert([10, 10, 10, 1])
>>> t.insert([10, 10, 10, 2])
>>> t.repr_brief(t.root, '.')
'10.[0.0.[1, 2], 10.10.[1, 2]]'
"""
child_count = 0
my_rep = ''
for child in node:
if child != self.end:
child_count += 1
child_rep = self.repr_brief(node[child], delimiter)
if len(child_rep) > 0:
my_rep += str(child) + delimiter + child_rep + ", "
else:
my_rep += str(child) + ", "
if len(my_rep) > 1:
my_rep = my_rep[:-2]
if child_count > 1:
my_rep = f'[{my_rep}]'
return my_rep
def __repr__(self):
"""
A friendly string representation of the contents of the Trie. Under
the covers uses repr_fancy.
>>> t = Trie()
>>> t.insert([10, 0, 0, 1])
>>> t.insert([10, 0, 0, 2])
>>> t.insert([10, 10, 10, 1])
>>> t.insert([10, 10, 10, 2])
>>> print(t)
*
└──10
├──0
│ └──0
│ ├──1
│ └──2
└──10
└──10
├──1
└──2
"""
return self.repr_fancy('', '*', self.root, self.root, False)
if __name__ == '__main__':
import doctest
doctest.testmod()
|
