def test_add_empty_to_filled_queue():
q1 = Queue()
q1.enqueue('cat')
q2 = Queue()
q1 + q2
assert q1.front.value == 'cat'
assert q1.rear.value == 'cat'
def test_add_two_queues():
q1 = Queue()
q1.enqueue('cat')
q2 = Queue()
q2.enqueue('dog')
q1 + q2
assert q1.front.value == 'cat'
assert q1.rear.value == 'dog'
def test_enqueue_two():
q = Queue()
q.enqueue("apples")
q.enqueue("bananas")
actual = q.peek()
expected = "apples"
assert actual == expected
def test_dequeue():
q = Queue()
q.enqueue("apple")
q.enqueue("orange")
actual = q.dequeue()
expected = "apple"
assert actual == expected
def test_dequeue_when_full():
q = Queue()
q.enqueue("apples")
q.enqueue("bananas")
actual = q.dequeue()
expected = "apples"
assert actual == expected
def test_exhausted():
q = Queue()
q.enqueue("apple")
q.enqueue("banana")
q.dequeue()
q.dequeue()
assert q.is_empty() == True
def test_enqueue_onto_full_queue():
s = Queue()
s.enqueue("apple")
s.enqueue("cucumber")
s.enqueue("phone")
actual = s.rear.value
excepted = "phone"
assert actual == excepted
def test_enqueue_multiple():
queue = Queue()
queue.enqueue('Ron')
queue.enqueue('Andy')
queue.enqueue('Leslie')
actual = queue.rear.value
expected = 'Leslie'
assert actual == expected
def test_dequeue():
q = Queue()
q.enqueue("apple")
q.enqueue("banana")
q.dequeue()
actual = q.peek()
expected = "banana"
assert actual == expected
def test_peek_queue_long():
s = Queue()
s.enqueue("apple")
s.enqueue("cucumber")
s.enqueue("phone")
actual = s.peek()
expected = "apple"
assert actual == expected
def test_peek():
q = Queue()
q.enqueue("apple")
q.enqueue("banana")
q.enqueue("cucumber")
actual = q.peek()
expected = "apple"
assert actual == expected
def test_exhausted():
q = Queue()
q.enqueue("apples")
q.enqueue("orange")
q.dequeue()
q.dequeue()
actual = q.is_empty()
expected = True
assert actual == expected
def test_dequeue():
queue = Queue()
queue.enqueue('Dennis')
queue.enqueue('Mac')
queue.enqueue('Charlie')
queue.enqueue('Dee')
queue.dequeue()
actual = queue.front.value
expected = 'Mac'
assert actual == expected
def test_queue_enqueu():
test_queue = Queue()
assert test_queue.front == None
test_queue.enqueue(5)
assert test_queue.front.value == 5
test_queue.enqueue('b')
assert test_queue.rear.value == 'b'
assert test_queue.front.value == 5
test_queue.enqueue('c')
assert test_queue.rear.value == 'c'
assert test_queue.front.value == 5
def test_exhausted():
q = Queue()
q.enqueue("apple")
q.enqueue("banana")
q.enqueue("cucumber")
q.dequeue()
q.dequeue()
q.dequeue()
actual = q.is_empty()
expected = True
assert actual == expected
def breadth_first(self) -> list:
breadth_queue = Queue()
output = []
breadth_queue.enqueue(self.root)
while not breadth_queue.is_empty():
front = breadth_queue.dequeue()
output.append(front.value)
if front.left:
breadth_queue.enqueue(front.left)
if front.right:
breadth_queue.enqueue(front.right)
return output
def test_dequeue_empty():
queue = Queue()
queue.enqueue('Dennis')
queue.enqueue('Mac')
queue.enqueue('Charlie')
queue.enqueue('Dee')
queue.dequeue()
queue.dequeue()
queue.dequeue()
queue.dequeue()
actual = queue.is_empty()
expected = True
assert actual == expected
def dequeue(self, preference=None):
if not preference:
return super().dequeue()
current = super().dequeue()
q = Queue()
while (current != preference):
print(self)
q.enqueue(current)
current = super().dequeue()
if (self.front):
self.front.next = q.rear
self.front = q.front
return current
def breadth_traverse(self):
if not self.root:
raise Exception('tree is empty')
output = []
q = Queue()
q.enqueue(self.root)
while not q.is_empty():
current = q.dequeue()
if current.left:
q.enqueue(current.left)
if current.right:
q.enqueue(current.right)
output.append(current.value)
return output
def breadth_first(self, node):
visited = [node]
q = Queue()
q.enqueue(node)
while not q.is_empty():
node = q.dequeue()
neighbors = [edge.vertex for edge in self.get_neighbors(node)]
for neighbor in neighbors:
if neighbor not in visited:
visited.append(neighbor)
q.enqueue(neighbor)
return visited
def test_peek_queue():
s = Queue()
s.enqueue("apple")
actual = s.peek()
expected = "apple"
assert actual == expected
def test_is_empty():
q = Queue()
assert q.is_empty() == True
def test_dequeue_when_empty():
q = Queue()
with pytest.raises(InvalidOperationError) as e:
q.dequeue()
assert str(e.value) == "Method not allowed on an empty collection"
def test_shelter_with_a_cat():
q = Queue()
q.enqueue('cat')
assert q.front.value == 'cat'
assert q.rear.value == 'cat'
def test_enqueue():
q = Queue()
q.enqueue("apple")
actual = q.front.value
expected = "apple"
assert actual == expected
def test_queue_add_error():
q = Queue()
with pytest.raises(TypeError) as e:
q + 1
assert str(e.value) == "Method only allowed with another Queue"
def test_dequeue_queue():
s = Queue()
s.enqueue("apple")
actual = s.dequeue()
expected = "apple"
assert actual == expected
def test_is_empty_queue():
s = Queue()
actual = s.isEmpty()
expected = True
assert actual == expected
def test_enqueue_onto_empty_queue():
s = Queue()
s.enqueue("apple")
actual = s.rear.value
excepted = "apple"
assert actual == excepted
def test_queue_has_rear():
s = Queue()
assert s.rear is None