def test_find_in_queue2(self):
name = "Jose"
phone = "123-456-7890"
node = Node(name, phone)
queue = Queue()
queue.enqueue(node)
self.assertEqual(queue.find_name(name), node)
def test_dequeue(self):
names = ("Jose", "1234-356"), ("Rolf",
"2345-1-53563-2"), ("Anna",
"345623-16779-3")
nodes = [Node(name, phone) for name, phone in names]
queue = Queue()
for node in nodes:
queue.enqueue(node)
self.assertIsNotNone(queue.find_name("Jose"))
popped_node = queue.dequeue()
self.assertEqual(popped_node, nodes[0])
with self.assertRaises(LookupError):
queue.find_name("Jose")
def test_find_in_queue(self):
names = ("Jose", "1234-356"), ("Rolf",
"2345-1-53563-2"), ("Anna",
"345623-16779-3")
nodes = [Node(name, phone) for name, phone in names]
queue = Queue()
for node in nodes:
queue.enqueue(node)
marker = queue.get_root()
for i in range(len(nodes) - 1, -1, -1):
self.assertEqual(queue.find_name(marker.name), nodes[i])
marker = marker.get_next()
def test_find_missing_in_queue(self):
queue = Queue()
with self.assertRaises(LookupError):
queue.find_name("Smith")