def test_addFirstOneElement(self):
"""
Con un elemento en la lista
"""
self.lst = slt.newList('SINGLE_LINKED_LIST')
self.assertEqual(slt.isEmpty(self.lst), True)
self.assertEqual(slt.size(self.lst), 0)
slt.addFirst(self.lst, self.book1)
self.assertEqual(slt.size(self.lst), 1)
book = slt.firstElement(self.lst)
self.assertDictEqual(book, self.book1)
slt.addFirst(self.lst, self.book2)
self.assertEqual(slt.size(self.lst), 2)
book = slt.firstElement(self.lst)
self.assertDictEqual(book, self.book2)
def test_addFirst(self):
self.lst = slt.newList('ARRAY_LIST')
slt.addFirst(self.lst, self.book1)
self.assertEqual(slt.size(self.lst), 1)
slt.addFirst(self.lst, self.book2)
self.assertEqual(slt.size(self.lst), 2)
book = slt.firstElement(self.lst)
self.assertDictEqual(book, self.book2)
def test_addFirst (self):
self.lst = slt.newList()
self.assertEqual (slt.isEmpty(self.lst), True)
self.assertEqual (slt.size(self.lst), 0)
slt.addFirst (self.lst, self.book1)
self.assertEqual (slt.size(self.lst), 1)
slt.addFirst (self.lst, self.book2)
self.assertEqual (slt.size(self.lst), 2)
book = slt.firstElement(self.lst)
self.assertDictEqual (book, self.book2)
def test_addLast(self):
self.lst = slt.newList()
slt.addLast(self.lst, self.book1)
self.assertEqual(slt.size(self.lst), 1)
slt.addLast(self.lst, self.book2)
self.assertEqual(slt.size(self.lst), 2)
book = slt.firstElement(self.lst)
self.assertDictEqual(book, self.book1)
book = slt.lastElement(self.lst)
self.assertDictEqual(book, self.book2)
def test_addFirst(self):
self.lst = slt.newList('ARRAY_LIST')
self.assertEqual(slt.isEmpty(self.lst), True)
self.assertEqual(slt.size(self.lst), 0)
slt.addFirst(self.lst, self.movie1)
self.assertEqual(slt.size(self.lst), 1)
slt.addFirst(self.lst, self.movie2)
self.assertEqual(slt.size(self.lst), 2)
movie = slt.firstElement(self.lst)
self.assertDictEqual(movie, self.movie2)
def test_listAddFirst(self):
"""
Lista con elementos en orden aleatorio
"""
self.lst = lt.newList()
lt.addFirst(self.lst, self.book1)
self.assertEqual(lt.size(self.lst), 1)
lt.addFirst(self.lst, self.book2)
self.assertEqual(lt.size(self.lst), 2)
book = lt.firstElement(self.lst)
self.assertDictEqual(book, self.book2)
def firstElement(lst):
""" Retorna el primer elemento de una lista no vacía. No se elimina el elemento.
Args:
lst: La lista a examinar
Raises:
Exception
"""
try:
return lt.firstElement(lst)
except Exception as exp:
error.reraise(exp, 'TADList->firstElement: ')
def test_addFirstMultiElements(self):
"""
Con muchos elementos en la lista
"""
self.lst = slt.newList('SINGLE_LINKED_LIST')
slt.addFirst(self.lst, self.book1)
slt.addFirst(self.lst, self.book2)
slt.addFirst(self.lst, self.book3)
slt.addFirst(self.lst, self.book4)
slt.addFirst(self.lst, self.book5)
self.assertEqual(slt.size(self.lst), 5)
book = slt.firstElement(self.lst)
self.assertDictEqual(book, self.book5)
def peek (queue):
""" Retorna el elemento en la primer posición de la cola sin eliminarlo
Args:
queue: La cola a examinar
Returns:
True el primer elemento de cola sin eliminarlo
Raises:
Exception
"""
try:
return lt.firstElement (queue)
except Exception as exp:
error.reraise (exp, 'TADQueue->isEmpty: ')
def top(stack):
""" Retorna el elemento en tope de la pila, sin eliminarlo de la pila
Args:
stack: La pila a examinar
Returns:
El primer elemento de la pila, sin eliminarlo
Raises:
Exception
"""
try:
return lt.firstElement(stack)
except Exception as exp:
error.reraise(exp, 'TADStack->top: ')
def firstElement(lst):
"""
Retorna el primer elemento de la lista, sin eliminarlo.
"""
return lt.firstElement(lst)
def peek(queue):
"""
Retorna el elemento en la primer posición de la cola sin eliminarlo
"""
return lt.firstElement(queue)
def top(stack):
"""
Retorna el elemento en tope de la pila, sin eliminarlo de la pila
"""
return lt.firstElement(stack)
