-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlinkqueue.py
More file actions
51 lines (42 loc) · 1.19 KB
/
linkqueue.py
File metadata and controls
51 lines (42 loc) · 1.19 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
from node import Node
from myiterator import MyIterator
__all__ = ['LinkQueue']
class LinkQueue:
def __init__(self):
self.head = None
self.tail = None
def isempty(self):
return self.head is None
def enqueue(self, elem):
node = Node(elem)
if self.tail:
self.tail.next = node
else:
self.head = node
self.tail = node
def dequeue(self):
try:
rst = self.getnext()
except IndexError:
raise IndexError("dequeue from empty queue")
self.head = self.head.next
if not self.head:
self.tail = None
return rst
def getnext(self):
if self.isempty():
raise IndexError("get element from empty queue")
return self.head.elem
def __iter__(self):
return MyIterator(self)
def __repr__(self):
rst = list("LinkQueue()")
if not self.isempty():
node = self.head
while node:
rst[-1:-1] = list(str(node.elem))
node = node.next
if node:
rst[-1:-1] = [", "]
rst = "".join(rst)
return rst