def test_add(self):
data = [randint(0, 100) for i in range(10)]
L = UnorderedList()
for d in data:
L.add(d)
self.assertFalse(L.is_empty())
self.assertEqual(sorted(data), sorted(self.get_data(L)))
class Deque: def __init__(self): self.dq = UnorderedList() def add_rear(self,item): self.dq.add(item) def add_front(self,item): self.dq.append(item) def remove_rear(self): return self.dq.pop(0) def remove_front(self): return self.dq.pop() def size(self): return self.dq.size() def is_empty(self): return self.dq.is_empty() def show(self): print(self.dq)
class Queue: def __init__(self): self.q = UnorderedList() def enque(self,items): self.q.add(items) def deque(self): return self.q.pop() def size(self): return self.q.size() def is_empty(self): return self.q.is_empty() def show(self): print(self.q)
class Stack:
def __init__(self):
self.s = UnorderedList()
def push(self, items):
self.s.add(items)
def pop_stack(self):
return self.s.pop(0)
def peek_stack(self):
return self.s.head.get_data()
def is_empty(self):
return self.s.is_empty()
def size(self):
return self.s.size()
def show(self):
print(self.s)
class Deque:
def __init__(self):
self.dq = UnorderedList()
def add_rear(self, item):
self.dq.add(item)
def add_front(self, item):
self.dq.append(item)
def remove_rear(self):
return self.dq.pop(0)
def remove_front(self):
return self.dq.pop()
def size(self):
return self.dq.size()
def is_empty(self):
return self.dq.is_empty()
def show(self):
print(self.dq)
def test_is_empty(self):
L = UnorderedList()
self.assertTrue(L.is_empty())
L.add(32)
self.assertFalse(L.is_empty())