def queue_of_four():
new_queue = Queue()
new_queue.enqueue('Penny')
new_queue.enqueue('Honey')
new_queue.enqueue('Lacey')
new_queue.enqueue('Pickles')
return new_queue
def test_enqueue_two():
q = Queue()
q.enqueue("apples")
q.enqueue("bananas")
actual = q.peek()
expected = "apples"
assert actual == expected
def breadth_add(self, value):
"""Method that takes in a value, and creates nodes with given value in level order"""
node = Node(value)
if not self.root:
self.root = node
return
q = Queue()
q.enqueue(self.root)
while not q.is_empty():
current = q.dequeue()
if current.left:
q.enqueue(current.left)
else:
current.left = node
break
if current.right:
q.enqueue(current.right)
else:
current.right = node
break
def test_dequeue():
q = Queue()
q.enqueue("apple")
q.enqueue("banana")
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_queue_enqueue():
testing_queue = Queue()
testing_queue.enqueue(1)
testing_queue.enqueue(2)
expected = 1
actual = testing_queue.peek()
assert actual == expected
def test_enqueue():
q = Queue()
q.enqueue('1')
q.enqueue('2')
q.enqueue('3')
assert q.peek() == '1'
def test_enqueue_multiple():
q = Queue()
q.enqueue(1)
q.enqueue(2)
q.enqueue(3)
assert q.length == 3
def test_enqueue():
q = Queue()
q.enqueue(1)
q.enqueue(2)
q.enqueue(3)
assert q.front.value == 1
def test_queue_peek():
testing_queue = Queue()
testing_queue.enqueue('hello')
testing_queue.enqueue('hallo')
expected = 'hello'
actual = testing_queue.peek()
assert actual == expected
def breadth_first(self, starting_vertex):
"""
Method to do breadth-first traversal on a graph.
Input: starting vertex
Output: list of vertices in the breadth-first order
"""
vertices = []
breadth = Queue()
if starting_vertex not in self._adjacency_list:
raise ValueError
breadth.enqueue(starting_vertex)
while not breadth.is_empty():
front = breadth.dequeue()
vertices.append(front)
for neighbor in self.get_neighbors(front):
if not neighbor[0].visited:
neighbor[0].visited = True
breadth.enqueue(neighbor[0])
for node in self._adjacency_list:
node.visited = False
return vertices
def queue_of_four():
new_queue = Queue()
new_queue.enqueue('One')
new_queue.enqueue(2)
new_queue.enqueue('Three')
new_queue.enqueue(4)
return new_queue
def test_dequeue_one():
food = Queue()
food.enqueue('bacon')
food.enqueue('cheese')
food.dequeue()
assert 'cheese' == food.peek_queue()
def test_dequeue():
q = Queue()
q.enqueue('1')
q.enqueue('2')
q.enqueue('3')
assert q.dequeue().__str__() == '1 -> None'
assert q.dequeue().__str__() == '2 -> None'
def test_peek():
q = Queue()
q.enqueue(1)
q.enqueue(2)
actual = q.peek()
expected = 1
assert actual == expected
def test_q_peek():
q = Queue()
q.enqueue(1)
q.enqueue(2)
q.enqueue(3)
assert q.peek() == 1
def test_dequeue_to_empty():
queue = Queue()
queue.enqueue(1)
queue.enqueue(2)
one = queue.dequeue()
two = queue.dequeue()
assert one.value == 1 and two.value == 2
def test_peek():
q = Queue()
q.enqueue("apple")
q.enqueue("banana")
q.enqueue("cucumber")
actual = q.peek()
expected = "apple"
assert actual == expected
def test_queue_peek_empty():
# peek into a queue, seeing the expected value
q = Queue()
actualBool, actualStr = q.peek()
expectedBool = False
assert actualBool == expectedBool
expected = ''
assert expected == actualStr
def test_enqueue_multiple():
q = Queue()
q.enqueue('A')
q.enqueue('B')
q.enqueue('C')
expected = 'A'
actual = q.front.value
assert expected == actual
def test_peek_post_dequeue():
q = Queue()
q.enqueue("apples")
q.enqueue("bananas")
q.dequeue()
actual = q.peek()
expected = "bananas"
assert actual == expected
def test_error_deque():
q = Queue()
q.enqueue("apple")
q.dequeue()
q.dequeue()
actual = q.peek()
expected = "empty queue"
assert actual == expected
def test_enqueue_two():
"""Can successfully enqueue items.
"""
line = Queue()
line.enqueue('Pam')
line.enqueue('Jim')
assert line.rear.value == 'Jim'
def test_queue_exception():
queue = Queue()
exc = "Method not allowed on empty collection."
with pytest.raises(InvalidOperationError) as error1:
queue.peek()
with pytest.raises(InvalidOperationError) as error2:
queue.dequeue()
assert str(error1.value) == exc and str(error2.value) == exc
def test_queue_peek():
line = Queue()
line.enqueue('Steve')
line.enqueue('Ted')
line.enqueue('Mary')
line.enqueue('Pam')
assert line.peek() == 'Steve'
def test_add_four():
new_queue = Queue()
new_queue.enqueue('One')
new_queue.enqueue(2)
new_queue.enqueue('Three')
new_queue.enqueue(4)
assert new_queue.front.value == 'One'
assert new_queue.end.value == 4
def test_add_four():
new_queue = Queue()
new_queue.enqueue('Penny')
new_queue.enqueue('Honey')
new_queue.enqueue('Lacey')
new_queue.enqueue('Pickles')
assert new_queue.front.value == 'Penny'
assert new_queue.end.value == 'Pickles'
def test_dequeue_one():
q = Queue()
q.enqueue('A')
q.enqueue('B')
q.enqueue('C')
q.dequeue()
expected = 'B'
actual = q.peek()
assert expected == actual
def test_dequeue():
q = Queue()
q.enqueue(1)
q.enqueue(2)
q.enqueue(3)
q.dequeue()
assert q.length == 2
assert q.front.value == 2
def helper_queue_enqueue_lots():
q = Queue()
q.enqueue('pao de queijo')
q.enqueue('pappa sandwidh')
q.enqueue('banana')
q.enqueue('crackers')
q.enqueue('strawberries')
q.enqueue('chocolate chips')
return q
