-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue.py
More file actions
88 lines (68 loc) · 1.84 KB
/
Copy pathQueue.py
File metadata and controls
88 lines (68 loc) · 1.84 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
class Queue:
def __init__(self):
self.items = []
self.frontIdx = 0
def __compress(self):
newlst = []
for i in range(self.frontIdx, len(self.items)):
newlst.append(self.items[i])
self.items = newlst
self.frontIdx = 0
def dequeue(self):
if self.isEmpty():
raise RuntimeError("Percobaan dequeue pada queue kosong")
# mengkompress queue saat keadaan setengah penuh
if self.frontIdx*2 > len(self.items):
self.__compress()
item = self.items[self.frontIdx]
self.frontIdx += 1
return item
def enqueue(self, item):
self.items.append(item)
def front(self):
if self.isEmpty():
raise RuntimeError("Percobaan akses front queue kosong")
return self.items[self.frontIdx]
def isEmpty(self):
return self.frontIdx == len(self.items)
def main():
q = Queue()
lst = list(range(10))
lst2 = []
for k in lst:
q.enqueue(k)
if q.front() == 0:
print("Tes 1 berhasil")
else:
print("Tes 1 gagal")
while not q.isEmpty():
lst2.append(q.dequeue())
if lst2 == lst:
print("Tes 2 berhasil")
else:
print("Tes 2 gagal")
for k in lst:
q.enqueue(k)
lst2 = []
while not q.isEmpty():
lst2.append(q.dequeue())
if lst2 == lst:
print("Tes 3 berhasil")
else:
print("Tes 3 gagal")
try:
q.dequeue()
print("Tes 4 gagal")
except RuntimeError:
print("Tes 4 berhasil")
except:
print("Tes 4 gagal")
try:
q.front()
print("Tes 5 gagal")
except RuntimeError:
print("Tes 5 berhasil")
except:
print("Tes 5 gagal")
if __name__=="__main__":
main()