class Store:
def __init__(self):
self.stock = Stock()
#self.workers = Gegevensstruct("hashmap")
self.workers = Stack()
self.worker_list = Gegevensstruct("hashmap")
self.orders = Queue(50)
self.orders_busy = Gegevensstruct("hashmap")
self.users = Gegevensstruct("hashmap")
#self.date = date
def getStock(self):
temp_count = 0
temp_list = self.stock.getStockList()
empty_list = []
for i in range(len(temp_list)):
if len(temp_list[i]) == 0:
temp_count+=1
if temp_count == 5:
return empty_list
else:
return temp_list
def addWorker(self, werknemer):
#self.workers.insert(werknemer)
self.worker_list.insert(werknemer)
self.workers.push((werknemer.getKey(), werknemer.getWorkLoad()))
def removeWorker(self, ID):
self.worker_list.delete(ID)
def getWorkers(self):
lijst = self.worker_list.traverse()
returnlist = []
for i in lijst:
returnlist.append(i[0])
return returnlist
def addOrder(self, bestelling):
self.orders.insert(bestelling)
def getOrdersList(self):
lijst = self.orders_busy.traverse()
returnlist = []
for i in lijst:
returnlist.append(i[0])
return returnlist
def getOrders(self):
lijst = self.orders.traverse()
returnlist = []
for i in lijst:
returnlist.append(i)
return returnlist
def addUser(self, gebruiker):
self.users.insert(gebruiker)
def removeUser(self, ID):
self.users.delete(ID)
def getUsers(self):
lijst = self.users.traverse()
returnlist = []
for i in lijst:
returnlist.append(i[0])
return returnlist
def getUser(self, id):
if self.users.getItem(id) == None:
return False
else:
return self.users.getItem(id)
def getWorker(self, id):
if self.worker_list.getItem(id) == None:
return False
else:
return self.worker_list.getItem(id)
in a Queue using the Linked List and Print the Anagrams from the Queue.
Note no Collection Library can be used.
"""
from queue import Queue, Node
from primeclass import Prime
"""Creating object of queue class"""
obj = Queue()
"""Creating object of prime class"""
prime_obj = Prime()
"""Creating prime_anagram list"""
prime_anagram = []
"""Creating list of prime number in given range"""
prime_list = prime_obj.prime(0, 1000)
"""Checking prime number anagran or not"""
for num in prime_list:
if num <= 10:
continue
number = prime_obj.anagram(num)
if prime_obj.prime_check(number) and 0 <= number <= 1000:
prime_anagram.append(number)
prime_anagram.append(num)
prime_list.remove(number)
"""finding the length of prime anagram list"""
length = len(prime_anagram)
"""Adding the prime anagram in to queue"""
for number in range(length):
num = Node(prime_anagram[number])
obj.enqueqe(num)
"""Printind the anagram from queue """
obj.traverse()
class Handler:
""" Handler class """
def __init__(self):
""" Initialize class """
self.my_list = Queue()
self.start()
def start(self):
""" Start method """
while True:
print("""
[1] Add a value
[2] Remove the next value
[3] Look at the current value
[4] Look at the next value
[5] Size
[6] Empty ?
[7] List all values
[exit] Exit
""")
val = input('What do you want to do ? \n>>> ')
if val == "1":
print("\nAdd a value:")
value = input(">>> ")
self.my_list.enqueue(value)
elif val == "2":
print("\nRemove the next value:\n")
self.my_list.dequeue()
elif val == "3":
print("\nLook at the current value:\n")
try:
print(self.my_list.peek_current())
except EmptyQueueException as e:
print(e)
elif val == "4":
print("\nLook at the next value\n")
try:
print(self.my_list.peek())
except EmptyQueueException as e:
print(e)
elif val == "5":
print("\nSize\n")
print(self.my_list.size())
elif val == "6":
print("\nEmpty ?\n")
print(self.my_list.is_empty())
elif val == "7":
print("\nList all values\n")
try:
self.my_list.traverse()
except EmptyQueueException as e:
print(e)
elif val == "exit":
sys.exit()
else:
print("Finns inget val för detta buuuu")
