Python linked_list.LinkedList类代码示例

 def test_pop_from_empty_list(self):
     """Pop from a LinkedList that is empty."""
     ll = LinkedList()
     self.assertTrue(ll.head is None)
     node = ll.pop()
     self.assertTrue(node is None)
     self.assertTrue(ll.head is None)

 def test_remove_empty_list(self):
     """Remove from an empty LinkedList."""
     ll = LinkedList()
     prestring = ll.__str__()
     ll.remove(self.insert_float)
     poststring = ll.__str__()
     self.assertEqual(prestring, poststring)

 def test_pop_from_one_list(self):
     """Pop from a LinkedList with one node."""
     ll = LinkedList()
     ll.insert(self.insert_string)
     self.assertEqual(ll.head.value, self.insert_string)
     node = ll.pop()
     self.assertEqual(node.value, self.insert_string)
     self.assertTrue(ll.head is None)

def test_search():
    items = range(10)
    a_list = LinkedList(items)
    # searching for a non-contained item returns None
    assert a_list.search(object()) is None
    # prove those values are searchable
    for item in items:
        assert a_list.search(item).data == item

 def test_text_representation(self):
     self.assertEqual(repr(self.ll), 'LinkedList()')
     self.ll = LinkedList(1)
     self.assertEqual(repr(self.ll), 'LinkedList(1)')
     self.ll = LinkedList([1, 2, 3, 4])
     self.assertEqual(repr(self.ll), 'LinkedList([1, 2, 3, 4])')
     self.ll = LinkedList(1, 2, 3, 4)
     self.assertEqual(repr(self.ll), 'LinkedList(1, 2, 3, 4)')

    def test_remove_item(self):
        ll = LinkedList()
        ll.add(1)
        ll.add(2)

        self.assertEqual(len(ll), 2)
        ll.remove(1)
        self.assertEqual(len(ll), 1)

    def test_insert_float_into_empty(self):
        """Insert into a LinkedList that is empty."""
        ll = LinkedList()

        self.assertTrue(ll.head is None)
        ll.insert(self.insert_float)
        self.assertEqual(ll.head.value, self.insert_float)
        self.assertTrue(isinstance(ll.head.value, float))
        self.assertTrue(ll.head.next is None)

    def test_remove_list_with_value_at_tail(self):
        """Remove from a populated LinkedList a value it contains at its tail."""
        ll = LinkedList()
        ll.insert(self.insert_float)
        ll.insert(self.insert_int)
        ll.insert(self.insert_string)

        ll.remove(self.insert_float)
        expected = '(' + "'" + self.insert_string + "'" + ', ' + \
            str(self.insert_int) + ')'
        poststring = ll.__str__()
        self.assertEqual(expected, poststring)

    def test_search_list_without_value(self):
        """Search a populated LinkedList for a value it doesn't contain."""
        ll = LinkedList()
        ll.insert(self.insert_float)
        ll.insert(self.insert_int)
        ll.insert(self.insert_string)

        node = ll.search(self.value_not_in_list)
        self.assertTrue(node is None)

    def test_size_of_populated_list(self):
        """Get the size of a populated LinkedList."""
        ll = LinkedList()
        ll.insert(self.insert_float)
        ll.insert(self.insert_int)
        ll.insert(self.insert_string)

        self.assertEqual(ll.head.value, self.insert_string)
        self.assertEqual(ll.size(), 3)

 def test_init(self):
     ll = LinkedList()
     self.assertTrue(ll.is_empty(), msg="initalizing an empty linked list should be empty")
     ll = LinkedList('Data')
     self.assertFalse(ll.is_empty(), msg="initalizing a linked list with one element should not be empty")
     ll = LinkedList(['Data', 'Data2'])
     self.assertFalse(ll.is_empty(), msg="initalizing a linked list with one list should not be empty")
     ll = LinkedList('Data', 'Data2', 'Data3')
     self.assertFalse(ll.is_empty(), msg="initalizing a linked list with multiple element should not be empty")

 def test_partition_around_x(self):
     self.linky = LinkedList()
     l = [1, 2, 3, 4, 5, 6, 7, 5, 8, 9, 10]
     for i in range(len(l)):
         self.linky.insert(l[i])
     self.linky.partition_around_x(5)
     self.assertListEqual([1, 2, 3, 4, 5, 5, 10, 9, 8, 7, 6],
                          self.linky.print_me())

 def test_insert_at_index(self):
     self.ll = LinkedList('Data1', 'Data2', 'Data3', 'Data4', 'Data5')
     self.ll.insert_at_index(3, 'Data3.5')
     self.assertEqual(self.ll[3], 'Data3.5', 'Insert at index should set the data at the index')
     self.assertEqual(self.ll[2], 'Data3', 'Insert at index should not change the data at the index before it')
     self.assertEqual(self.ll[4], 'Data4', 'Insert at index should move the other data up an index')
     with self.assertRaises(IndexError, msg='Insert at out of bounds index should raise IndexError'):
         self.ll.insert_at_index(len(self.ll) + 1, 'Data7')

    def test_search_list_with_value_at_tail(self):
        """Search a populated LinkedList for a value it contains at its tail."""
        ll = LinkedList()
        ll.insert(self.insert_float)
        ll.insert(self.insert_int)
        ll.insert(self.insert_string)

        node = ll.search(self.insert_float)
        self.assertTrue(isinstance(node, LinkedListNode))
        self.assertEqual(node.value, self.insert_float)

    def test_str_many_list(self):
        """Get the string representation of a LinkedList with many values."""
        ll = LinkedList()
        ll.insert(self.insert_float)
        ll.insert(self.insert_int)
        ll.insert(self.insert_string)

        self.assertEqual(ll.__str__(), '(' + "'" + self.insert_string +
            "', " + str(self.insert_int) + ', ' + str(self.insert_float) +
            ')')