def concatenate(lists):
output = arraylist.arraylist()
i = 0
for i in range(lists.end()):
sublist = lists.retrieve(i)
for j in range(sublist.end()):
element = sublist.retrieve(j)
output.insert(element, output.last)
return output
import arraylist
def concatenate(lists):
output = arraylist.arraylist()
i = 0
for i in range(lists.end()):
sublist = lists.retrieve(i)
for j in range(sublist.end()):
element = sublist.retrieve(j)
output.insert(element, output.last)
return output
if __name__ == "__main__":
test1 = arraylist.arraylist()
test1.insert(0, 0)
test1.insert(12, 1)
test1.insert(63, 2)
test1.insert(81, 3)
test2 = arraylist.arraylist()
test2.insert(132, 0)
test2.insert(51, 1)
test2.insert(31, 2)
test2.insert(92, 3)
tests = arraylist.arraylist()
tests.insert(test1, 0)
tests.insert(test2, 1)
tests = concatenate(tests)
for i in range(0, tests.end()):
print tests.retrieve(i),
#!usr/bin/python from arraylist import arraylist L = arraylist() L.element = [3, 2, 1, 0, 0, 0] L.last = 5 print '\n[TEST]\t\tarraylist.END()' assert (L.END() == 5) print '\n[TEST]\t\tarraylist.FIRST()' assert (L.FIRST() == 3) print '\n[TEST]\t\tarraylist.RETRIEVE()' assert (L.RETRIEVE(2, L) == 1) print '\n[TEST]\t\tarraylist.LOCATE()' assert (L.LOCATE(1, L) == 2) print '\n[TEST]\t\tarraylist.NEXT()' assert (L.NEXT(0, L) == 1) print '\n[TEST]\t\tarraylist.PREVIOUS()' assert (L.PREVIOUS(3, L) == 2) print '\n[TEST]\t\tarraylist.INSERT()' L.INSERT(5, 4, L) assert (L.RETRIEVE(4, L) == 5) print '\n[TEST]\t\tarraylist.DELETE()' L.DELETE(0, L) assert (L.RETRIEVE(0, L) == 2) print '\n[TEST]\t\tarraylist.MAKENULL()' L.MAKENULL() assert (L.last == 5 and L.FIRST() == None) print '\n[PASSED]\t9 TEST\n'
def arraylist_tail_insertion():
test_list = arraylist()
for i in range(N):
test_list.insert(i, test_list.end())
def arraylist_head_insertion():
test_list = arraylist()
for i in range(N):
test_list.insert(i, 0)
start_time = time.time()
library_traversal(test_list)
end_time = time.time()
print("List data structure traversal time for 1000 elements (millisecond): ",
end_time * 1000 - start_time * 1000)
# Arraylist traversal
def arraylist_traversal(test_list):
i = test_list.first()
while (i < test_list.end() - 1):
x = test_list.retrieve(i)
i = test_list.next_position(i)
test_list = arraylist()
for i in range(N):
test_list.insert(i, 0)
start_time = time.time()
arraylist_traversal(test_list)
end_time = time.time()
print("Arraylist traversal time for 1000 elements (millisecond): ",
end_time * 1000 - start_time * 1000)
# Pointerlist traversal
def pointerlist_traversal(test_list):
p = test_list.first()
while (p is not test_list.end()):
p = p.next