def test_insert_and_remove_list( self ):
ll = DoubleLinkedList()
ll.add( 50 )
ll.addEnd( 100 )
ll.insert( 150, ll.search(50) ) # insert in middle
self.assertEqual( ll.size(), 3 )
ll.remove( ll.search( 150 ) )
self.assertEqual( ll.size(), 2 )
self.assertEqual( ll.toList(), [50, 100] )
def test_insert_remove_and_reverse_list( self ):
ll = DoubleLinkedList()
ll.add( 50 )
ll.addEnd( 100 )
ll.insert( 150, ll.search(50) ) # insert in middle
self.assertEqual( ll.size(), 3 )
ll.remove( ll.search( 50 ) )
self.assertEqual( ll.size(), 2 )
ll.reverse()
# NOTE: This test is testing that you don't forget to
# update next / prev properly when inserting..
self.assertEqual( ll.toList(), [100, 150] )
def test_insert_end_nonempty_list( self ):
ll = DoubleLinkedList()
ll.add( 50 )
ll.insert( 100, ll.search(50) )
self.assertEqual( ll.size(), 2 )
