int main(int argc, char* argv[]) {
if( argc != 2 ) return 0;
struct linkedList * b = createLinkedList();
/* Test Area Start
printf("For starters_ front: %d, back: %d \n", frontList(b), backList(b));
printf("empty: %d \n", isEmptyList(b));
addFrontList(b,24);
addFrontList(b,33);
printf("front: %d, back: %d \n", frontList(b), backList(b));
addBackList(b,69);
printf("front: %d, back: %d \n", frontList(b), backList(b));
removeBackList(b);
printf("front: %d, back: %d \n", frontList(b), backList(b));
removeFrontList(b);
printf("front: %d, back: %d \n", frontList(b), backList(b));
printf("empty: %d \n", isEmptyList(b));
removeFrontList(b);
printf("front: %d, back: %d \n", frontList(b), backList(b));
printf("empty: %d \n", isEmptyList(b));
//bag interface
addList(b,13);
addList(b,8);
printf("contains (0): %d \n", containsList(b,1));
printf("contains (1): %d \n", containsList(b,13));
printf("contains (2): %d \n", containsList(b,8));
removeList(b,13);
printf("contains (0): %d \n", containsList(b,13));
addList(b,663);
removeList(b,8);
printf("contains (0): %d \n", containsList(b,8));
Test Area End */
int n = atoi(argv[1]);/*number of elements to add*/
int i;
for( i = 0 ; i < n; i++)
addList(b, (TYPE)i);/*Add elements*/
double t1 = getMilliseconds();/*Time before contains()*/
for(i=0; i<n; i++)
containsList(b, i);
double t2 = getMilliseconds();/*Time after contains()*/
printf("%d %g\n", n, t2-t1);
return 0;
}
int main(int argc, char* argv[]) {
printf("implement testLinkedList.c!\n");
struct linkedList *lst;
lst = createLinkedList();
printf("isEmptyList?%i\n", isEmptyList(lst));
printf("\nTesting add links (3),5,6,9,8\n");
addList(lst, 5);
printf("addList 5:%i\n", frontList(lst));
addBackList(lst, 6);
printf("backList 6:%i\n", backList(lst));
addBackList(lst, 9);
printf("backList 9:%i\n", backList(lst));
addFrontList(lst,3);
printf("frontList 3:%i\n", frontList(lst));
addBackList(lst, 8);
printf("backList 8:%i\n\n", backList(lst));
printf("frontList 3:%i\n", frontList(lst));
printf("backList 8:%i\n\n", backList(lst));
printf("remove the front(3) and back(8)...\n");
removeFrontList(lst);
printf("frontList should now be 5:%i\n", frontList(lst));
removeBackList(lst);
printf("backList should now be 9:%i\n", backList(lst));
printf("contains 5?%i\n",containsList(lst,5));
printf("removing 5...");
removeFrontList(lst);
printf("contains 5?%i\n",containsList(lst,5));
printf("removing 6...");
removeList(lst,6);
printf("frontList? 9:%i", frontList(lst));
printf("isEmptyList?%i\n", isEmptyList(lst));
return 0;
}
int main(int argc, char* argv[]) {
int returned = -1;
struct linkedList* q = createLinkedList(3);
printf("Checking if the list is empty: %d\n", isEmptyList(q));
printf("Attempting to add to front \n");
addFrontList(q, 1);
removeList(q, 1);
printf("Checking if the list is empty: %d\n", isEmptyList(q));
addFrontList(q, 2);
addFrontList(q, 3);
_printList(q);
printf("Attempting to add to back \n");
addBackList(q, 4);
addBackList(q, 5);
addBackList(q, 6);
_printList(q);
printf("Attempting to print front \n");
printf("%d\n", frontList(q));
printf("Attempting to print back \n");
printf("%d\n", backList(q));
printf("Attempting to remove front \n");
removeFrontList(q);
_printList(q);
printf("Attempting to remove back \n");
removeBackList(q);
_printList(q);
printf("Attempting to delete 4 \n");
removeList(q, 4);
_printList(q);
printf("Attempting to print list \n");
_printList(q);
printf("Attempting to confirm contains 5 \n");
returned = containsList(q, 5);
if (returned == 1)
printf("true \n");
else
printf("false \n");
return 0;
}
int main(int argc, char* argv[]){
if( argc != 2 ) return 0;
struct linkedList* b = createLinkedList();
int n = atoi(argv[1]);/*number of elements to add*/
int i;
for( i = 0 ; i < n; i++)
addList(b, (TYPE)i);/*Add elements*/
double t1 = getMilliseconds();/*Time before contains()*/
for(i=0; i<n; i++)
containsList(b, i);
double t2 = getMilliseconds();/*Time after contains()*/
printf("%d %g\n", n, t2-t1);
return 0;
}
int main(int argc, char* argv[]){
struct linkedList* b;
int n, i;
double t1, t2;
#ifdef MEMORY_TEST_INCLUDED
/* variables to hold memory used before and after creating LinkedList */
long m1, m2;
/* memory used BEFORE creating LinkedList */
m1 = getMemoryUsage();
#endif
if( argc != 2 ) return 0;
b = createLinkedList();
n = atoi(argv[1]);/*number of elements to add*/
for( i = 0 ; i < n; i++) {
addList(b, (TYPE)i);/*Add elements*/
}
#ifdef MEMORY_TEST_INCLUDED
/* memory used AFTER creating LinkedList */
m2 = getMemoryUsage();
printf("Memory used by LinkedList: %ld KB \n", m2-m1);
#endif
t1 = getMilliseconds();/*Time before contains()*/
for(i=0; i<n; i++) {
containsList(b, i);
}
t2 = getMilliseconds();/*Time after contains()*/
printf("Time for running contains() on %d elements: %g ms\n", n, t2-t1);
/* delete the linked list */
deleteLinkedList(b);
return 0;
}
