def test_insert_in_the_middle(self): linked = SinglyLinkedList(100) linked.append(200) linked.append(300) linked.insert(1000, 1) self.assertEqual(linked.as_list(), [100, 1000, 200, 300])
def main(): List = SinglyLinkedList( ) # creating list to store the main Fibonacci sequence count = 100 cal_fib = fibonacci(count) # fibonacci generator object # add data in linked list for i in range(100): List.insert(next(cal_fib)) print(List) # print linked list data List.reverse() # reverse linked list print(List) # print reverse linked list
def time_prepend(): n = 50000 print('time_prepend, n =', n) with timewith(' linked list '): container = SLL() for x in range(n): container.prepend(x) del container with timewith(' list '): container = list() for x in range(n): container.insert(0, x) del container with timewith(' deque '): container = deque() for x in range(n): container.appendleft(x) del container
def test_insert_raises_if_index_is_too_big(self): linked = SinglyLinkedList(100) with self.assertRaises(ValueError): linked.insert(1000, 1)
def test_insert_at_the_beginning_without_initial_value(self): linked = SinglyLinkedList() linked.insert(1000, 0) self.assertEqual(linked.as_list(), [1000])