def populate_list(llist: LinkedList2):
nodes = (
Node(12),
Node(34),
Node(56),
)
for node in nodes:
llist.add_in_tail(node)
return nodes
def test_find(self):
node = Node(99)
self.list.add_in_tail(Node(13))
self.list.add_in_tail(Node(0))
self.list.add_in_tail(node)
self.list.add_in_tail(Node(44))
found_node = self.list.find(node.value)
self.assertIsNotNone(found_node)
self.assertEqual(node, found_node)
def test_add_multiple_in_head_empty_list(self):
node = Node(99)
node_alt = Node(77)
self.list.add_in_head(node_alt)
self.list.add_in_head(node)
self.assertIsNone(node.prev)
self.assertEqual(node_alt, node.next)
self.assertEqual(node, self.list.head)
self.assertEqual(node_alt, self.list.tail)
self.assertEqual(2, self.list.len())
def test_find_all(self):
source_node = Node(99)
self.list.add_in_tail(Node(28))
self.list.add_in_tail(Node(source_node.value))
self.populate_list(self.list)
self.list.add_in_tail(Node(source_node.value))
self.list.add_in_tail(Node(81))
self.list.add_in_tail(source_node)
found_nodes = self.list.find_all(source_node.value)
self.assertEqual(3, len(found_nodes))
for node in found_nodes:
self.assertEqual(source_node.value, node.value)
def test_insert_after(self):
node = Node(99)
prev_node = Node(77)
next_node = Node(55)
self.list.add_in_tail(Node(33))
self.list.add_in_tail(prev_node)
self.list.add_in_tail(next_node)
self.list.add_in_tail(Node(64))
self.list.insert(prev_node, node)
self.assertEqual(5, self.list.len())
self.assertEqual(node, prev_node.next)
self.assertEqual(prev_node, node.prev)
self.assertEqual(node, next_node.prev)
self.assertEqual(next_node, node.next)
def test_add_in_tail(self):
first_node = Node(23)
second_node = Node(72)
self.list.add_in_tail(first_node)
self.assertEqual(first_node, self.list.head)
self.assertEqual(first_node, self.list.tail)
self.list.add_in_tail(second_node)
self.assertEqual(first_node, self.list.head)
self.assertEqual(second_node, self.list.tail)
self.assertEqual(first_node, second_node.prev)
self.assertEqual(second_node, first_node.next)
self.assertIsNone(first_node.prev)
self.assertIsNone(second_node.next)
def test_insert_multiple(self):
prev_node = None
nodes = (
Node(12),
Node(34),
Node(56),
)
for node in nodes:
self.list.insert(prev_node, node)
prev_node = node
self.assertEqual(len(nodes), self.list.len())
self.assertEqual(nodes[0], self.list.head)
self.assertIsNone(nodes[0].prev)
self.assertEqual(nodes[len(nodes) - 1], self.list.tail)
self.assertIsNone(nodes[len(nodes) - 1].next)
def test_delete_in_head(self):
node = Node(99)
node_alt = Node(node.value)
self.list.add_in_tail(node)
nodes = self.populate_list(self.list)
self.list.add_in_tail(node_alt)
self.list.delete(node.value)
self.assertEqual(len(nodes) + 1, self.list.len())
self.assertEqual(1, len(self.list.find_all(node.value)))
self.assertNotEqual(node, self.list.head)
self.assertEqual(nodes[0], self.list.head)
self.assertIsNone(nodes[0].prev)
self.assertEqual(node_alt, self.list.tail)
self.assertIsNone(node.prev)
self.assertIsNone(node.next)
def test_add_in_head_empty_list(self):
node = Node(99)
self.list.add_in_head(node)
self.assertIsNone(node.prev)
self.assertIsNone(node.next)
self.assertEqual(node, self.list.head)
self.assertEqual(node, self.list.tail)
self.assertEqual(1, self.list.len())
def test_insert_in_empty_list(self):
node = Node(99)
self.list.insert(None, node)
self.assertEqual(node, self.list.head)
self.assertEqual(node, self.list.tail)
self.assertIsNone(node.prev)
self.assertIsNone(node.next)
self.assertEqual(1, self.list.len())
def test_delete_all_in_one_elem_list(self):
node = Node(99)
self.list.add_in_tail(node)
self.list.delete(node.value, True)
self.assertEqual(0, self.list.len())
self.assertIsNone(self.list.head)
self.assertIsNone(self.list.tail)
self.assertIsNone(node.prev)
self.assertIsNone(node.next)
def test_add_in_head(self):
node = Node(99)
nodes = self.populate_list(self.list)
self.list.add_in_head(node)
self.assertEqual(node, self.list.head)
self.assertIsNone(node.prev)
self.assertEqual(nodes[0], node.next)
self.assertEqual(nodes[len(nodes) - 1], self.list.tail)
self.assertEqual(len(nodes) + 1, self.list.len())
def test_delete_all_with_sequentially_nodes(self):
node = Node(99)
node_alt = Node(node.value)
node_result = Node(8)
self.list.add_in_tail(node)
self.list.add_in_tail(node_alt)
self.list.add_in_tail(node_result)
self.list.delete(node.value, True)
self.assertEqual(1, self.list.len())
self.assertEqual(0, len(self.list.find_all(node.value)))
self.assertNotEqual(node, self.list.head)
self.assertNotEqual(node_alt, self.list.head)
self.assertEqual(node_result, self.list.head)
self.assertNotEqual(node, self.list.tail)
self.assertNotEqual(node_alt, self.list.tail)
self.assertEqual(node_result, self.list.tail)
self.assertIsNone(node.prev)
self.assertIsNone(node.next)
self.assertIsNone(node_alt.prev)
self.assertIsNone(node_alt.next)
def test_insert_in_tail(self):
node = Node(99)
nodes = self.populate_list(self.list)
self.list.insert(None, node)
self.assertNotEqual(node, self.list.head)
self.assertEqual(nodes[0], self.list.head)
self.assertIsNone(nodes[0].prev)
self.assertEqual(node, self.list.tail)
self.assertEqual(len(nodes) + 1, self.list.len())
self.assertIsNone(node.next)
self.assertEqual(nodes[len(nodes) - 1], node.prev)
def test_find_all_in_empty_list(self):
node = Node(99)
found_nodes = self.list.find_all(node.value)
self.assertEqual(0, self.list.len())
self.assertEqual([], found_nodes)
def test_find_in_empty_list(self):
node = Node(99)
found_node = self.list.find(node.value)
self.assertEqual(0, self.list.len())
self.assertIsNone(found_node)