def test_sort_not_reversed(self):
my_list = linkedList()
for i in range(19, -1, -1):
my_list.append(i)
comparison_list = linkedList()
for i in range(20):
comparison_list.append(i)
my_list.sort(False)
self.assertEqual(my_list, comparison_list)
def __init__(self):
"""@:self.the_list: (List) An array based list"""
self.the_list = linkedList()
counter = 0
while counter < length:
popped = copy.pop()
print(counter)
reverse_data.append(popped)
counter += 1
#Compare the linked list data set to its reversal.
#If equal, the data is a palindrome.
if reverse_data == list_values:
print("Yes, this is a palindrome!")
else:
print("Not a palindrome!")
test_two = linkedList()
test_two.add_to_tail("a")
test_two.add_to_tail("a")
test_two.add_to_tail("b")
test_two.add_to_tail("a")
test_two.add_to_tail("a")
single_palindrome(test_two)
test = linkedList()
test.add_to_tail(5)
test.add_to_tail(10)
test.insert(10, 15)
test.add_to_tail(20)
test.add_to_tail(15)
test.add_to_tail(20)
test.add_to_tail(10)
def test_delete_at_invalid_index(self):
my_list = linkedList()
for i in range(10):
my_list.append(i)
self.assertFalse(my_list.delete(-11))
def test_remove_valid_item(self):
my_list = linkedList()
my_list.append("remove this")
self.assertTrue(my_list.remove("remove this"))
def test_remove_invalid_item(self):
my_list = linkedList()
my_list.append(1)
self.assertFalse(my_list.remove("remove this"))
def test_insert_invalid_index_empty_list(self):
my_list = linkedList()
self.assertFalse(my_list.insert(1, 1))
def test_insert_valid_index_full_list(self):
my_list = linkedList()
my_list.append(1)
self.assertTrue(my_list.insert(1, 2))
def test_insert_valid_index_empty_list(self):
my_list = linkedList()
self.assertTrue(my_list.insert(0, 1))
def test_append_empty_list(self):
my_list = linkedList()
my_list.append(2)
self.assertEqual(my_list[0].value, 2)
def test_reset_list(self):
my_list = linkedList()
my_list.append(1)
my_list.reset()
self.assertTrue(my_list.is_empty())
def test_is_empty_false(self):
my_list = linkedList()
my_list.append(1)
self.assertFalse(my_list.is_empty())
def test_is_empty_true(self):
my_list = linkedList()
self.assertTrue(my_list.is_empty())