import UnorderedList
#===========================================================================
# create a linked list to test MergeSort()
myList = UnorderedList()
myList.add(13)
myList.add(38)
myList.add(50)
myList.add(14)
myList.add(45)
myList.add(27)
myList.append(70)
myList.insert(4, 48)
#===========================================================================
# define a function to return a sliced linked list given the startnode and endnode
def getSlice(MLL, first, last):
# a function validating input params should be added later on
current = MLL.head
while current != first:
current = current.getNext()
sliceLL = UnorderedList()
while current != last.getNext():
sliceLL.append(current.getData())
current = current.getNext()
return sliceLL
# define a function to return the midnode between the startnode and endnode
def getMid(MLL, first, last):
# a function validating input params should be added later on
current = MLL.head
def test_remove(self):
ulist = UnorderedList()
ulist.add(1)
ulist.remove(1)
self.assertEqual(ulist.isEmpty(), True)
def test_size(self):
ulist = UnorderedList()
ulist.add(1)
self.assertEqual(ulist.size(), 1)
def test_search(self):
ulist = UnorderedList()
ulist.add(1)
self.assertEqual(ulist.head.data, 1)
self.assertEqual(ulist.head.next, None)
self.assertEqual(ulist.search(1), True)
def test_add(self):
ulist = UnorderedList()
ulist.add(1)
self.assertEqual(ulist.isEmpty(), False)
self.assertEqual(ulist.head.getNext(), None)
