-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue.py
More file actions
83 lines (70 loc) · 1.96 KB
/
Copy pathqueue.py
File metadata and controls
83 lines (70 loc) · 1.96 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
"""
queue.py
author: James heliotis
description: A linked queue (FIFO) implementation
"""
from node import LinkedNode
class Queue:
__slots__ = "front", "back"
def __init__( self ):
""" Create a new empty queue.
"""
self.front = None
self.back = None
def __str__( self ):
""" Return a string representation of the contents of
this queue, oldest value first.
"""
result = "Queue["
n = self.front
while n != None:
result += " " + str( n.value )
n = n.link
result += " ]"
return result
def is_empty( self ):
return self.front == None
def enqueue( self, newValue ):
newNode = LinkedNode( newValue )
if self.front == None:
self.front = newNode
else:
self.back.link = newNode
self.back = newNode
def dequeue( self ):
assert not self.is_empty(), "Dequeue from empty queue"
self.front = self.front.link
if self.front == None:
self.back = None
def peek( self ):
assert not self.is_empty(), "peek on empty stack"
return self.front.value
insert = enqueue
remove = dequeue
def test():
s = Queue()
print( s )
for value in 1, 2, 3:
s.enqueue( value )
print( s )
print( "Dequeueing:", s.peek() )
s.dequeue()
print( s )
for value in 15, 16:
s.insert( value )
print( s )
print( "Removing:", s.peek() )
s.remove()
print( s )
while not s.is_empty():
print( "Dequeueing:", s.peek() )
s.dequeue()
print( s )
print( "Trying one too many dequeues... ", end="" )
try:
s.dequeue()
print( "Problem: it succeeded!" )
except Exception as e:
print( "Exception was '" + str( e ) + "'" )
if __name__ == "__main__":
test()