def test_1(self): list1 = OrderedList() list1.add(1) list1.add(2) list1.add(3) print(list1) self.assertEqual(list1.search_forward(3), True) self.assertEqual(list1.search_backward(3), True) self.assertEqual(list1.search_forward(5), False) self.assertEqual(list1.search_backward(-1), False) self.assertEqual(list1.size(), 3) list2 = OrderedList() self.assertEqual(list2.is_empty(), True) self.assertEqual(list2.index(3), 2) list2.add(1) self.assertEqual(list2.pop(), 1)
def test_search_forward(self): lst = OrderedList() self.assertFalse(lst.search_forward(10)) lst.head = Node(2, Node(5, Node(10, None))) lst.tail = Node(10) lst.num_items = 3 self.assertTrue(lst.search_forward(10))
def test_desc(self): self.ol = OrderedList(False) self.assertEqual(0, self.ol.len()) self.assertEqual(0, self.ol.len_reverse()) self.assertIsNone(self.ol.delete(30)) self.assertEqual(0, self.ol.len()) self.assertEqual(0, self.ol.len_reverse())
def test_OrderedList_office_hours(self): orderlst = OrderedList() orderlst.add(5) orderlst.add(3) orderlst.add(6) orderlst.add(2) self.assertEqual(orderlst.pop(), 6) self.assertEqual(orderlst.pop(0), 2)
def test_remove(self): lst = OrderedList() lst.add(1) lst.add(3) lst.add(2) self.assertEqual(lst.remove(1), 0) self.assertEqual(lst.remove(3), 1) self.assertRaises(ValueError, lst.remove, 3)
def test_index(self): lst = OrderedList() self.assertRaises(LookupError, lst.index, 5) lst.head = Node(2, Node(5, Node(10, None))) lst.num_items = 3 self.assertEqual(lst.index(5), 1) self.assertEqual(lst.index(2), 0) self.assertEqual(lst.index(10), 2)
def test_5(self): ordered_list = OrderedList() ordered_list.add(1) ordered_list.add(2) ordered_list.add(5) ordered_list.add(3) self.assertEqual(ordered_list.head.val, 1) self.assertEqual(ordered_list.tail.val, 5) self.assertEqual(ordered_list.size(), 4)
def test_1(self): ordered_list = OrderedList() self.assertEqual(ordered_list.is_empty(), True) ordered_list.add(2) self.assertEqual(ordered_list.head.val, 2) self.assertEqual(ordered_list.tail.val, 2) ordered_list.add(1) ordered_list.add(3) self.assertEqual(ordered_list.size(), 3)
def test_add_ascending(self): ol = OrderedList(asc=True) items = [4, 6, 2, 8, 5] for item in items: ol.add(item) items.sort() self.assertEqual([node.value for node in ol.get_all()], items)
def test_len(self): ol = OrderedList(asc=True) items = [4, 6, 2, 8, 5] for item in items: ol.add(item) self.assertEqual(ol.len(), len(items))
def test_3(self): ordered_list = OrderedList() self.assertEqual(ordered_list.is_empty(), True) ordered_list.add(2) self.assertEqual(ordered_list.head.val, 2) self.assertEqual(ordered_list.tail.val, 2) ordered_list.add(1) ordered_list.add(3) self.assertEqual(ordered_list.search_forward(3), True) self.assertEqual(ordered_list.search_backward(3), True)
def test_2(self): ordered_list = OrderedList() ordered_list.add(2) self.assertEqual(ordered_list.head.val, 2) self.assertEqual(ordered_list.tail.val, 2) ordered_list.add(1) ordered_list.add(3) self.assertEqual(ordered_list.index(1), 0) self.assertEqual(ordered_list.index(2), 1) self.assertEqual(ordered_list.index(3), 2) self.assertRaises(LookupError, ordered_list.index, 4)
def test_adding(self): l = OrderedList() self.assertEqual(l.size(), 0) self.assertTrue(l.is_empty()) l.add(1) self.assertEqual(l.size(), 1) self.assertEqual(l.head.value, 1) self.assertFalse(l.is_empty()) l.add(2) self.assertEqual(l.size(), 2) self.assertEqual(l.head.value, 1)
def test_find_by_value_descending(self): ol = OrderedList(asc=True) items = [4, 6, 2, 8, 5] for item in items: ol.add(item) node = ol.find(4) self.assertEqual(node.value, 4)
def test_clean(self): ol = OrderedList(asc=True) items = [4, 6, 2, 8, 5] for item in items: ol.add(item) ol.clean(asc=True) self.assertEqual(ol.head, None) self.assertEqual(ol.tail, None)
def test_4(self): ordered_list = OrderedList() self.assertEqual(ordered_list.is_empty(), True) ordered_list.add(2) ordered_list.add(1) ordered_list.add(3) self.assertEqual(ordered_list.head.val, 1) self.assertEqual(ordered_list.tail.val, 3) self.assertRaises(ValueError, ordered_list.remove, 4) self.assertEqual(ordered_list.remove(2), 1) self.assertEqual(ordered_list.pop(0), 1) self.assertEqual(ordered_list.pop(), 3)
def test_pop(self): lst = OrderedList() self.assertRaises(IndexError, lst.pop) lst.add(1) lst.add(3) lst.add(2) self.assertRaises(IndexError, lst.pop, 3) self.assertEqual(lst.pop(1), 2) self.assertEqual(lst.pop(0), 1) lst.add(4) self.assertEqual(lst.pop(), 4) self.assertEqual(lst.pop(), 3)
def test_delete_ascending_end(self): ol = OrderedList(asc=True) items = [4, 6, 2, 8, 5] for item in items: ol.add(item) items.sort() items.remove(8) ol.delete(8) self.assertEqual([node.value for node in ol.get_all()], items)
def test_7(self): ordered_list = OrderedList() ordered_list.add(1) ordered_list.add(2) ordered_list.add(5) ordered_list.add(3) self.assertEqual(ordered_list.head.val, 1) self.assertEqual(ordered_list.tail.val, 5) self.assertEqual(ordered_list.search_forward(4), False) self.assertEqual(ordered_list.search_forward(6), False) self.assertEqual(ordered_list.search_forward(1), True) self.assertEqual(ordered_list.search_backward(4), False) self.assertEqual(ordered_list.search_backward(2), True) self.assertEqual(ordered_list.search_backward(5), True)
def test_delete_descending_begin(self): ol = OrderedList(asc=False) items = [4, 6, 2, 8, 5] for item in items: ol.add(item) items.sort(reverse=True) items.remove(2) ol.delete(2) self.assertEqual([node.value for node in ol.get_all()], items)
def test_8(self): ordered_list = OrderedList() ordered_list.add(1) ordered_list.add(2) ordered_list.add(5) ordered_list.add(3) self.assertEqual(ordered_list.head.val, 1) self.assertEqual(ordered_list.tail.val, 5) self.assertEqual(ordered_list.pop(), 5) self.assertEqual(ordered_list.pop(1), 2) self.assertEqual(ordered_list.pop(), 3) self.assertRaises(IndexError, ordered_list.pop, 1) self.assertEqual(ordered_list.index(1), 0) self.assertEqual(ordered_list.pop(), 1) self.assertRaises(IndexError, ordered_list.pop)
def test_OrderedList(self): ordered_list = OrderedList() self.assertEqual(ordered_list.is_empty(), True) ordered_list.add(2) ordered_list.add(1) ordered_list.add(3) self.assertEqual(ordered_list.size(), 3) self.assertEqual(ordered_list.index(2), 1) self.assertEqual(ordered_list.index(4), -1) self.assertEqual(ordered_list.search_forward(3), True) self.assertEqual(ordered_list.search_backward(3), True) self.assertEqual(ordered_list.remove(4), -1) self.assertEqual(ordered_list.remove(2), 1) self.assertEqual(ordered_list.pop(0), 1) self.assertEqual(ordered_list.pop(), 3)
def test_desc(self): self.ol = OrderedList(False) self.assertEqual(0, self.ol.len()) self.assertEqual(0, self.ol.len_reverse()) self.assertIsNone(self.ol.head) self.assertIsNone(self.ol.tail) self.ol.add(1) self.assertEqual(1, self.ol.len()) self.assertEqual(1, self.ol.len_reverse()) self.assertEqual(1, self.ol.head.value) self.assertEqual(1, self.ol.tail.value) self.assertEqual(1, self.ol.get_all()[0].value)
def create_huff_tree(char_freq): '''Create a Huffman tree for characters with non-zero frequency Returns the root node of the Huffman tree''' ol = OrderedList() for i in range(255): if char_freq[i] != 0: ol.add(HuffmanNode(i, char_freq[i])) while ol.size() > 1: a = ol.pop(0) b = ol.pop(0) if a.char < b.char: char = a.char else: char = b.char new = HuffmanNode(char, a.freq + b.freq) new.left = a new.right = b ol.add(new) return ol.pop(0)
def test_OrderedList_coverage_cases(self): ordered_list = OrderedList() ordered_list.add(1) ordered_list.add(2) ordered_list.add(5) ordered_list.add(3) self.assertEqual(ordered_list.search_forward(4), False) self.assertEqual(ordered_list.search_forward(6), False) self.assertEqual(ordered_list.search_forward(1), True) self.assertEqual(ordered_list.search_backward(4), False) self.assertEqual(ordered_list.search_backward(2), True) self.assertEqual(ordered_list.search_backward(5), True) self.assertEqual(ordered_list.pop(), 5) self.assertEqual(ordered_list.pop(1), 2) self.assertEqual(ordered_list.pop(), 3) self.assertRaises(IndexError, ordered_list.pop, 1) self.assertEqual(ordered_list.index(1), 0) self.assertEqual(ordered_list.pop(), 1) self.assertRaises(IndexError, ordered_list.pop)
def test_add(self): lst = OrderedList() lst.add(1) self.assertEqual(lst.head, Node(1)) lst.add(3) lst.add(2)
def test_search_backward(self): lst = OrderedList() self.assertFalse(lst.search_backward(10)) lst.tail = Node(10, None, Node(5, None, Node(3))) lst.num_items = 3 self.assertTrue(lst.search_backward(5))
def test_is_empty(self): lst = OrderedList() self.assertTrue(lst.is_empty()) lst.num_items = 20 self.assertFalse(lst.is_empty())
def test_size(self): lst = OrderedList() self.assertEqual(lst.size(), 0) lst.num_items = 20 self.assertEqual(lst.size(), 20)
def decode_to_ordered_list(self): return OrderedList(self.decode_from_bytes_to_list(self.coded_sequence))