def test_merge(self):
first, second = random_list(), random_list()
test_struct_first, test_struct_second = List.SinglyLinkedList(
), List.SinglyLinkedList()
for elem in first:
test_struct_first.add_back(elem)
for elem in second:
test_struct_second.add_back(elem)
index = random.randint(0, len(first) - 1)
first = first[:index] + second + first[index:]
test_struct_first.merge(test_struct_second, index)
# print()
self.assertTrue(content_equal(first, test_struct_first))
def test_iteration(self):
test_struct = List.SinglyLinkedList(random_list())
counter = 0
for x in test_struct:
self.assertEqual(x, test_struct[counter])
counter += 1
self.assertEqual(counter, len(test_struct))
def test_add_first(self):
test_struct = List.SinglyLinkedList()
test_data = []
# print()
for i in random_list():
test_data.insert(0, i)
test_struct.add_front(i)
self.assertTrue(content_equal(test_data, test_struct))
def test_delete_index(self):
data = random_list()
test_list = List.SinglyLinkedList(data)
# print()
while len(data) > 0:
rand_index = random.randint(0, len(data) - 1)
data.remove(data[rand_index])
test_list.remove_index(rand_index)
# print(data, test_list)
self.assertTrue(content_equal(data, test_list))
def test_add_random_index(self):
test_struct = List.SinglyLinkedList()
test_data = []
# print()
for i in random_list():
index = random.randint(0, len(test_data))
test_data.insert(index, i)
test_struct.add(data=i, index=index)
# print("{0} vs {1}".format(test_data[0], test_struct.at(0)))
self.assertTrue(content_equal(test_data, test_struct))
def test_add_last(self):
test_struct = List.SinglyLinkedList()
test_data = []
# print()
for i in random_list():
test_data.append(i)
test_struct.add_back(i)
for i in range(len(test_data)):
# print("{0} vs {1}".format(test_data[i], test_struct.at(i)))
self.assertEqual(test_data[i], test_struct.at(i))