def test_sort_menor_a_mayor (self):
"""
Lista con elementos en orden aleatorio
"""
print ("sorting ....")
sort.quickSort (self.lst_movies, self.greater)
self.printList (self.lst_movies)
def test_orderedElementss():
"""
Lista ordenada normalmente, deberia ser igual a como se ingresan los libros
"""
lst = slt.newList(list_type)
slt.addFirst(lst, book10)
slt.addFirst(lst, book9)
slt.addFirst(lst, book8)
slt.addFirst(lst, book7)
slt.addFirst(lst, book6)
slt.addFirst(lst, book5)
slt.addFirst(lst, book4)
slt.addFirst(lst, book3)
slt.addFirst(lst, book2)
slt.addFirst(lst, book1)
print("Inverted list:----------------------------------------------------")
iterator = it.newIterator(lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
print("sorting ....")
sort.quickSort(lst, less)
probarOrden(lst)
def test_sort(self):
"""
Lista con elementos en orden aleatorio
"""
print("sorting ....")
sort.quickSort(self.lst_books, self.lessequal)
self.printList(self.lst_books)
def test_repeatedElements (self):
"""
Con muchos elementos en la lista
"""
self.lst = slt.newList(self.list_type)
slt.addFirst (self.lst, self.book5)
slt.addFirst (self.lst, self.book6)
slt.addFirst (self.lst, self.book14)
slt.addFirst (self.lst, self.book3)
slt.addFirst (self.lst, self.book13)
slt.addFirst (self.lst, self.book10)
slt.addFirst (self.lst, self.book1)
slt.addFirst (self.lst, self.book12)
slt.addFirst (self.lst, self.book2)
slt.addFirst (self.lst, self.book8)
slt.addFirst (self.lst, self.book4)
slt.addFirst (self.lst, self.book11)
slt.addFirst (self.lst, self.book7)
slt.addFirst (self.lst, self.book9)
print ("Repeated elements:----------------------------------------------------")
iterator = it.newIterator(self.lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(str(key) + ": " + str(value) + ", " for key, value in element.items())
print (result)
print ("sorting ....")
sort.quickSort (self.lst, self.lessequal)
iterator = it.newIterator(self.lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(str(key) + ": " + str(value) + ", " for key, value in element.items())
print (result)
def test_invertedElements (self):
"""
Lista ordenada inversamente
"""
self.lst = slt.newList(self.list_type)
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)
slt.addFirst (self.lst, self.book6)
slt.addFirst (self.lst, self.book7)
slt.addFirst (self.lst, self.book8)
slt.addFirst (self.lst, self.book9)
slt.addFirst (self.lst, self.book10)
print ("Inverted list:----------------------------------------------------")
iterator = it.newIterator(self.lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(str(key) + ": " + str(value) + ", " for key, value in element.items())
print (result)
print ("sorting ....")
sort.quickSort (self.lst, self.lessequal)
iterator = it.newIterator(self.lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(str(key) + ": " + str(value) + ", " for key, value in element.items())
print (result)
def test_randomElements(self):
"""
Lista con elementos en orden aleatorio
"""
self.lst = slt.newList(self.list_type)
slt.addFirst(self.lst, self.movie5)
slt.addFirst(self.lst, self.movie6)
slt.addFirst(self.lst, self.movie3)
slt.addFirst(self.lst, self.movie4)
slt.addFirst(self.lst, self.movie1)
slt.addFirst(self.lst, self.movie2)
print(
"Random list:----------------------------------------------------")
iterator = it.newIterator(self.lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
print("sorting ....")
sort.quickSort(self.lst, self.lessequal)
iterator = it.newIterator(self.lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
def test_repeatedElements_greater(self):
"""
Con muchos elementos en la lista
"""
self.lst = slt.newList(self.list_type)
slt.addFirst(self.lst, self.movie5)
slt.addFirst(self.lst, self.movie4)
slt.addFirst(self.lst, self.movie6)
slt.addFirst(self.lst, self.movie3)
slt.addFirst(self.lst, self.movie1)
slt.addFirst(self.lst, self.movie6)
slt.addFirst(self.lst, self.movie2)
slt.addFirst(self.lst, self.movie4)
print(
"Repeated elements:----------------------------------------------------"
)
iterator = it.newIterator(self.lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
print("sorting ....")
sort.quickSort(self.lst, self.greaterequal)
iterator = it.newIterator(self.lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
def test_oneElement_greater(self):
"""
Un elemento
"""
self.lst = slt.newList(self.list_type)
slt.addFirst(self.lst, self.movie1)
print(
"one element:----------------------------------------------------")
iterator = it.newIterator(self.lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
print("sorting ....")
sort.quickSort(self.lst, self.greaterequal)
iterator = it.newIterator(self.lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
def test_invertedElements_greater(self):
"""
Lista ordenada inversamente
"""
self.lst = slt.newList(self.list_type)
slt.addFirst(self.lst, self.movie1)
slt.addFirst(self.lst, self.movie2)
slt.addFirst(self.lst, self.movie3)
slt.addFirst(self.lst, self.movie4)
slt.addFirst(self.lst, self.movie5)
slt.addFirst(self.lst, self.movie6)
print(
"Inverted list:----------------------------------------------------"
)
iterator = it.newIterator(self.lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
print("sorting ....")
sort.quickSort(self.lst, self.greaterequal)
iterator = it.newIterator(self.lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
def test_invertedElements():
"""
Lista ordenada inversamente, sale correcta si el orden final es el inverso a la forma en la cual se
agregan
"""
lst = slt.newList(list_type)
slt.addFirst(lst, book1)
slt.addFirst(lst, book2)
slt.addFirst(lst, book3)
slt.addFirst(lst, book4)
slt.addFirst(lst, book5)
slt.addFirst(lst, book6)
slt.addFirst(lst, book7)
slt.addFirst(lst, book8)
slt.addFirst(lst, book9)
slt.addFirst(lst, book10)
print("Inverted list:----------------------------------------------------")
iterator = it.newIterator(lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
print("sorting ....")
sort.quickSort(lst, less)
iterator = it.newIterator(lst)
probarOrden(lst)
def test_randomElements():
"""
Lista con elementos en orden aleatorio, prueba que se ordene correctamente cuando no hay orden alguno
"""
lst = slt.newList(list_type)
slt.addFirst(lst, book5)
slt.addFirst(lst, book6)
slt.addFirst(lst, book3)
slt.addFirst(lst, book10)
slt.addFirst(lst, book1)
slt.addFirst(lst, book2)
slt.addFirst(lst, book8)
slt.addFirst(lst, book4)
slt.addFirst(lst, book7)
slt.addFirst(lst, book9)
print("Random list:----------------------------------------------------")
iterator = it.newIterator(lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
print("sorting ....")
sort.quickSort(lst, less)
probarOrden(lst)
def crear_ranking_peli(details, x=10, ascendent=True):
if ascendent:
sort.quickSort(details, h.comp_count_avg_asc)
else:
sort.quickSort(details, h.comp_count_avg_desc)
ranking = [item for item in itert.islice(h.travel(details), 0, x)]
return ranking
def test_loading_CSV_y_ordenamiento():
"""
Prueba que se pueda leer el archivo y que despues de relizar el sort, el orden este correcto
"""
setUp()
sort.quickSort(lst_books, less)
while not (lt.isEmpty(lst_books)):
x = int(lt.removeLast(lst_books)['goodreads_book_id'])
if not (lt.isEmpty(lst_books)):
y = int(lt.lastElement(lst_books)['goodreads_book_id'])
else:
break
assert x > y
def test_ManyElements():
"""
Con muchos elementos en la lista, en donde identificadores se repiten
Deben aparecer consecutivos aquellos con id igual
"""
lst = slt.newList(list_type)
slt.addFirst(lst, book5)
slt.addFirst(lst, book6)
slt.addFirst(lst, book14)
slt.addFirst(lst, book3)
slt.addFirst(lst, book13)
slt.addFirst(lst, book10)
slt.addFirst(lst, book1)
slt.addFirst(lst, book12)
slt.addFirst(lst, book2)
slt.addFirst(lst, book8)
slt.addFirst(lst, book4)
slt.addFirst(lst, book11)
slt.addFirst(lst, book7)
slt.addFirst(lst, book9)
print(
"Repeated elements:----------------------------------------------------"
)
iterator = it.newIterator(lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
print("sorting ....")
sort.quickSort(lst, less)
assert slt.removeFirst(lst) == book1
assert slt.removeFirst(lst) == book2
assert slt.removeFirst(lst) == book3
assert slt.removeFirst(lst) == book4
assert slt.removeFirst(lst) == book5
assert slt.removeFirst(lst) == book6
assert slt.removeFirst(lst) == book7
assert slt.removeFirst(lst) == book11
assert slt.removeFirst(lst) == book8
assert slt.removeFirst(lst) == book12
assert slt.removeFirst(lst) == book13
assert slt.removeFirst(lst) == book9
assert slt.removeFirst(lst) == book10
assert slt.removeFirst(lst) == book14
def crear_ranking_genero(details, genero, retrieve=10, ascendent=True):
dgend = h.filter(details, "genres", genero, impl="ARRAY_LIST")
if ascendent:
sort.quickSort(dgend, h.comp_count_avg_asc)
else:
sort.quickSort(dgend, h.comp_count_avg_desc)
raw = [item for item in itert.islice(h.travel(dgend), 0, retrieve)]
ranking = [peli["title"] for peli in raw]
avg_vote_lst = [int(i["vote_count"]) for i in raw]
avg_vote = sum(avg_vote_lst) / len(avg_vote_lst)
return ranking, avg_vote
def test_oneElement():
"""
Se prueba el ordenamiento de un elemento, solo deberia haber un elemento en la lista
"""
lst = slt.newList(list_type)
slt.addFirst(lst, book1)
print("one element:----------------------------------------------------")
iterator = it.newIterator(lst)
while it.hasNext(iterator):
element = it.next(iterator)
result = "".join(
str(key) + ": " + str(value) + ", "
for key, value in element.items())
print(result)
print("sorting ....")
sort.quickSort(lst, less)
iterator = it.newIterator(lst)
while it.hasNext(iterator):
element = it.next(iterator)
assert element == book1
def rankingPeliculas(function, lst, criteria, elements):
"""
Retorna el ranking de películas con base en los parámetros
Args:
function
Función de ordenamiento que se va a usar
column:: str
Columna que se usa para realiza el ordenamiento (vote_average o vote_count)
lst
Lista encadenada o arreglo
criteria:: str
Critero para ordenar (less o greater)
elements:: int
Cantidad de elementos para el ranking
Return:
counter :: int
la cantidad de veces ue aparece un elemento con el criterio definido
"""
t1_start = process_time() #tiempo inicial
if function == "selectionsort":
selectionsort.selectionSort(lst, criteria)
if function == "insertionsort":
insertionsort.insertionSort(lst, criteria)
if function == "mergesort":
mergesort.mergesort(lst, criteria)
if function == "quicksort":
quicksort.quickSort(lst, criteria)
if function == "shellsort":
shellsort.shellSort(lst, criteria)
i = 0
ordenado = []
while i < elements:
i += 1
pelicula = lt.getElement(lst, i)
ordenado.append(pelicula)
t1_stop = process_time() #tiempo final
print("Tiempo de ejecución ", t1_stop - t1_start, " segundos")
return ordenado
def test_agregarYquitar():
"""
Prueba que al hacer varios ordnamientos el orden debe mantenerse asi se cambien los elementos
Se requiere tener la lista ordenada, luego desordenada y probar que genera excepcion
"""
lst = slt.newList(list_type)
slt.addFirst(lst, book10)
slt.addFirst(lst, book9)
slt.addFirst(lst, book8)
slt.addFirst(lst, book7)
slt.addFirst(lst, book6)
slt.addFirst(lst, book5)
slt.addFirst(lst, book4)
slt.addFirst(lst, book3)
slt.addFirst(lst, book2)
slt.addFirst(lst, book1)
probarOrden(lst) #Prueba que al inicio la lista esté en orden
slt.addFirst(lst, slt.removeLast(lst))
slt.addLast(lst, slt.removeFirst(lst))
slt.addFirst(lst, slt.removeLast(lst))
with pytest.raises(Exception):
probarOrden(lst)
sort.quickSort(lst, less)
probarOrden(lst)
def crear_ranking(lst):
votos_ranking = qc.quickSort(lst,compareRecordVotos)
average_ranking = qc.quickSort(lst,compareRecordAverage)
return (votos_ranking,average_ranking)
t1_stop = process_time()
# printList(l)
print("SelectionSort:\t", t1_stop - t1_start, " segundos")
#=======================================
l = lt.subList(lista, 1, lt.size(lista))
t1_start = process_time()
mergesort.mergesort(l, less)
t1_stop = process_time()
# printList(l)
print("MergeSort:\t", t1_stop - t1_start, " segundos")
#=======================================
l = lt.subList(lista, 1, lt.size(lista))
t1_start = process_time()
quicksort.quickSort(l, less)
t1_stop = process_time()
# printList(l)
print("QuickSort:\t", t1_stop - t1_start, " segundos")
#=======================================
l = lt.subList(lista, 1, lt.size(lista))
t1_start = process_time()
quicksort3way.quickSort3Way(l, less)
t1_stop = process_time()
# printList(l)
print("Quick3-way:\t", t1_stop - t1_start, " segundos")
def quicksort(lst, lessequalfunction):
qk.quickSort(lst, lessequalfunction)
def test_sort():
"""
Lista con elementos en orden aleatorio
"""
print("sorting ....")
sort.quickSort(lst_books, less)
