void ht_merge(SortedListPtr list, const char* filepath, HashTable *hashtable, SortedListPtr wordlist) {
FileCountPair *fcp;
WordCountPair *wcp;
SortedListIteratorPtr iterator;
SortedListIteratorPtr mainListIterator;
char *word;
WordListPair *wlp;
iterator = SLCreateIterator(wordlist);
while ((word = SLNextItem(iterator)) != NULL) {
mainListIterator = SLCreateIterator(list);
wcp = ht_get(hashtable, word);
fcp = malloc(sizeof(FileCountPair));
fcp->filepath = filepath;
fcp->count = wcp->count;
while ((wlp = SLNextItem(mainListIterator)) != NULL) {
if (strcmp(wlp->word, word) == 0) {
break;
}
}
if (wlp == NULL) { //the word is not already in the main list
SortedListPtr newlist = SLCreate(&compareFileCounts);
SLInsert(newlist, fcp);
wlp = malloc(sizeof(WordListPair));
wlp->word = word;
wlp->list = newlist;
SLInsert(list, wlp);
} else {
SLInsert(wlp->list, fcp);
}
SLDestroyIterator(mainListIterator);
}
SLDestroyIterator(iterator);
}
void destroyWordList() {
SortedListIteratorPtr wordIterator = NULL;
wordIterator = SLCreateIterator(wordList);
WordNode curWord;
SortedListIteratorPtr fileIterator = NULL;
FileWithCount curFile;
void *obj = NULL;
void *objInWord = NULL;
while ((obj = SLNextItem(wordIterator))) {
curWord = (WordNode) obj;
free (curWord->word);
fileIterator = SLCreateIterator(curWord->files);
while ((objInWord = SLNextItem(fileIterator))) {
curFile = (FileWithCount) objInWord;
free(curFile->filename);
}
SLDestroyIterator(fileIterator);
SLDestroy(curWord->files);
}
SLDestroyIterator(wordIterator);
SLDestroy(wordList);
}
int SLRemove(SortedListPtr list, void *newObj)
{
SortedListIteratorPtr ptr = SLCreateIterator(list);
if(ptr == NULL)
{
return 0;
}
listItem* cur;
listItem* prev;
//checking at head
int compcur = list->compareF(newObj,list->head->data);
if(compcur == 0)
{
//move head
list->head = list->head->next;
//if been viewed once, free
if(ptr->current->viewers==1)
{
freeItem(ptr->current);
}
SLDestroyIterator(ptr);
return 1;
}
cur = ptr->current->next;
prev = ptr->current;
while(ptr->current != NULL && prev != NULL)
{
compcur = list->compareF(newObj, SLNextItem(ptr));
if(compcur == 0)
{
prev->next = cur->next;
if(cur->viewers == 1)
{
freeItem(cur);
}
SLDestroyIterator(ptr);
return 1;
}
prev = cur;
cur = cur->next;
}
SLDestroyIterator(ptr);
printf("we should not have gotten here");
return 0;
}
void writeWordListToFile(char *filename) {
/*Traverse wordlist, grab each word*/
FILE *f = fopen(filename, "w");
if (f == NULL)
{
printf("Error opening file!\n");
exit(1);
}
/* print some text */
const char *text = "Write this to the file";
fprintf(f, "Some text: %s\n", text);
SortedListIteratorPtr wordIterator = NULL;
wordIterator = SLCreateIterator(wordList);
WordNode curWord;
SortedListIteratorPtr fileIterator = NULL;
FileWithCount curFile;
void *obj = NULL;
void *objInWord = NULL;
while ((obj = SLNextItem(wordIterator))) {
curWord = (WordNode) obj;
fprintf(f,"<list> %s\n",curWord->word);
fileIterator = SLCreateIterator(curWord->files);
while ((objInWord = SLNextItem(fileIterator))) {
curFile = (FileWithCount) objInWord;
fprintf(f,"%s %d ",curFile->filename,curFile->count);
}
SLDestroyIterator(fileIterator);
fprintf(f,"\n</list>\n",curWord->word);
}
SLDestroyIterator(wordIterator);
fclose(f);
return;
}
/*
test 1:
1. create list, check it is empty
2. use 1, create list iterate, check empty
3. use 2, check SLGetItem
4. use 3, check SLNextItem
5. destroy list iterator
6. destroy list
*/
void test1(){
SortedListPtr list = SLCreate(compare, destroy);
SortedListIteratorPtr iter;
int* value;
if (list == NULL)
{
printf("Cannot created list\n");
exit(0);
}
iter = SLCreateIterator(list);
value = (int*)SLGetItem(iter);
if (value != NULL)
{
printf("Value must be null\n");
exit(0);
}
value = (int*)SLNextItem(iter);
if (value != NULL)
{
printf("Value must be null\n");
exit(0);
}
SLDestroy(list);
SLDestroyIterator(iter);
printf("Test 1 completed\n");
}
/*
test 7:
1. create list with compare and destroy functions
2. check SLInsert, add 1, 2, 3, 4, 5, SLRemove
3. create list iterate
4. check SLGetItem, SLNextItem
5. destroy list iterator
6. destroy list
*/
void test7(){
SortedListPtr list = SLCreate(compare, destroy);
SortedListIteratorPtr iter;
int i;
int* value;
for (i = 1; i <= 5; i++)
{
value = (int*)malloc(sizeof(int));
*value = i;
SLInsert(list, (void*)value);
}
iter = SLCreateIterator(list);
i = SLRemove(list, value);
printf("SLRemove 5 returned %d\n", i);
i = SLRemove(list, value);
printf("SLRemove 5 returned %d\n", i);
value = (int*)SLGetItem(iter);
while (value != NULL)
{
printf("Value = %d\n", *value);
value = (int*)SLNextItem(iter);
}
SLDestroy(list);
SLDestroyIterator(iter);
printf("Test 7 completed\n");
}
/*
test 6:
1. Do the test 5 with SLNextItem over list
*/
void test6(){
SortedListPtr list = SLCreate(compare, destroy);
SortedListIteratorPtr iter;
int i;
int* value;
for (i = 1; i <= 5; i++)
{
value = (int*)malloc(sizeof(int));
*value = i;
SLInsert(list, (void*)value);
}
iter = SLCreateIterator(list);
value = (int*)SLGetItem(iter);
while (value != NULL)
{
printf("Value = %d\n", *value);
value = (int*)SLNextItem(iter);
}
value = (int*)SLNextItem(iter);
if (value != NULL)
{
printf("Over end of list, must be null\n");
exit(0);
}
SLDestroy(list);
SLDestroyIterator(iter);
printf("Test 6 completed\n");
}
/* Destroy a word struct. Free all associated memory.
*
*/
void destroyWordStruct(WordPtr wordStruct)
{
if(wordStruct == NULL)
{
return;
}
else
{
//printf("Freeing wordStruct for %s\n", wordStruct->wordArray);
//Loop over filestats array and free all values
if(wordStruct->filestats != NULL)
{
if(wordStruct->filestats->headOfList != NULL) //Free the filestats data too
{
SortedListIteratorPtr filestatsIter = SLCreateIterator(wordStruct->filestats);
do
{
SLNode curNode = filestatsIter->curNode;
StatsPtr value = (StatsPtr)curNode->value;
destroyStatsStruct(value);
}while(SLNextItem(filestatsIter) != NULL);
SLDestroyIterator(filestatsIter);
SLDestroy(wordStruct->filestats);
}
}
free(wordStruct->wordArray);
free(wordStruct);
return;
}
}
int addWord(char * word, char * filename){
//intialisation
WordCount fileToAdd;
fileToAdd = (WordCount)malloc(sizeof(WordCount));
fileToAdd->filename = (char*)malloc((sizeof(char)*100));
fileToAdd->count = 1;
fileToAdd->filename = filename;
ll word = (ll)malloc(sizeof(ll));
word->word = (char*)malloc((sizeof(char)*100));
word->word = word;
//need to look at sorted list
ll wordexists;
wordexists = (ll) SLFindNode(wordList, word);
//if exists
if(wordexists != NULL){
printf("word %s exists\n", word);
SortedListIteratorPtr iter;
iter = SLCreateIterator(wordexists->file);
void *object = NULL;
while((object = SLNextItem(iter))){
WordCount file;
file = object;
if(compareCounts(file, object) == 0){
file->count++;
break;
}
//addWord(file->file->filename);
}
SLDestroyIterator(iter);
if(object == NULL){ //does not found, add!!
SLInsert(wordexists->file, fileToAdd); //adding
//free
free(word->word);
free(word);
return 1;
}
else{
//free everything
printf("error when adding word\n");
free(fileToAdd->filename);
free(fileToAdd);
free(word->word);
free(word);
}
return 0;
}
else{ //file not found
word->file = SLCreate(compareCounts);
SLInsert(word->file,fileToAdd);
SLInsert(wordList, word);
return 1;
}
}
/* Given a sorted list storing strings, go through and free the value.
*
*/
void destroyAllStrings(SortedListPtr list)
{
SortedListIteratorPtr listIter = SLCreateIterator(list);
do
{
free(listIter->curNode->value);
}while(SLNextItem(listIter) != NULL);
SLDestroyIterator(listIter);
return;
}
int SLRemove(SortedListPtr list, void *newObj)
{
int removeVal;
void* currObj;
SortedListIteratorPtr remPtr = SLCreateIterator(list);
if (remPtr == NULL){
printf("Failed to create iterator!\n");
return 0;
}
node *prev = remPtr->curr;
removeVal=(*list->compF)(newObj, list->head->obj);
if(removeVal == 0){
list->head = list->head->next;
if (remPtr->curr->refs==2){ //remove head
free(remPtr->curr);
}
SLDestroyIterator(remPtr);
return 1;
}
currObj=SLNextItem(remPtr);
while(remPtr->curr != NULL){ //go until eof
removeVal = (*list->compF)(newObj, currObj);
if(removeVal==0){ //match found
prev->next = remPtr->curr->next;
if(remPtr->curr->refs == 2){
free(remPtr->curr); //destroy node if not used by other iterators
}
SLDestroyIterator(remPtr);
return 1;
}else{
prev = remPtr->curr;
currObj=SLNextItem(remPtr);
}
}
SLDestroyIterator(remPtr);
printf("Object not found\n"); //not found
return 0;
}
/* Insert all file names from a given word's node into a given list
*
*/
void insertAllFilenames(SortedListPtr list, SLNode word)
{
WordPtr actualWord = (WordPtr)word->value;
SortedListIteratorPtr filenameIter = SLCreateIterator(actualWord->filestats);
do
{
StatsPtr curStat = filenameIter->curNode->value;
char *word = curStat->filename;
SLInsert(list, word);
}while(SLNextItem(filenameIter) != NULL);
SLDestroyIterator(filenameIter);
}
int SLInsert(SortedListPtr list, void *newObj){
double compareVal;
void* currObj;
SortedListIteratorPtr iterPtr = SLCreateIterator(list);
if (iterPtr == NULL){
return 0;
}
node* prev = iterPtr->curr;
if (iterPtr->curr == NULL || (*list->compF)(newObj, iterPtr->curr->obj) > 0){ //empty list/first object bigger
list->head = NodeCreate(newObj,iterPtr->curr); // head insert
SLDestroyIterator(iterPtr);
return 1;
}
currObj=SLNextItem(iterPtr);
while(iterPtr->curr != NULL){
compareVal = (*list->compF)(newObj, currObj); //compare curr/new objs
if(compareVal >= 0){ //add here
break;
}else if(compareVal == 0){ //duplicate, ignore
SLDestroyIterator(iterPtr);
printf("duplicate item!!!\n");
return 1;
}else{ //increment pointers
prev = iterPtr->curr;
currObj=SLNextItem(iterPtr);
}
}
prev->next = NodeCreate(newObj,iterPtr->curr); //insert node
if (prev->next==NULL) {
printf("Malloc fail!\n");
return 0;
}
SLDestroyIterator(iterPtr);
return 1;
}
SortedListPtr searchOr(SortedListPtr indexList, SortedListPtr inputList)
{
//need a result list
SortedListPtr result = SLCreate(*compareStrings);
//need to iterate through the inputList to check the words in the indexList
SortedListIteratorPtr inputIterator = SLCreateIterator(inputList);
do
{
SLNode inputListPtr = inputIterator->curNode;
char* inputListWord = (char*)inputListPtr->value;
//need to iterate through the indexListIterator for each item of inputList
SortedListIteratorPtr indexListIterator = SLCreateIterator(indexList);
do
{
//compare the word in the indexed list to the input list to see if they match
SLNode indexListPtr = indexListIterator->curNode;
WordPtr indexWord = (WordPtr) indexListPtr->value;
int compareWords = strcmp(indexWord->wordArray, inputListWord);
if(compareWords == 0)
{
//extract the filelist for the word
SortedListPtr filePtr = indexWord->filestats;
SortedListIteratorPtr fileIterator = SLCreateIterator(filePtr);
//add the word to the result list
do
{
SLNode fileHead = (SLNode)filePtr->headOfList;
StatsPtr fileNamesPtr = (StatsPtr)fileHead->value;
char* filenameToAdd = fileNamesPtr->filename;
SLInsert(result, filenameToAdd);
}while (SLNextItem(fileIterator) != NULL);
SLDestroyIterator(fileIterator);
}
} while (SLNextItem(indexListIterator) != NULL);
SLDestroyIterator(indexListIterator);
} while(SLNextItem(inputIterator) != NULL);
SLDestroyIterator(inputIterator);
return result;
}
/* Given two lists of file names, return a list of file names that
* is in both lists.
*/
SortedListPtr findCommonElements(SortedListPtr firstList, SortedListPtr secondList)
{
SortedListPtr commonElements = SLCreate(*compareStrings);
SortedListIteratorPtr outsideIter = SLCreateIterator(firstList);
do
{
//printf("Grabbing outside node.\n");
SLNode outsideNode = outsideIter->curNode;
SortedListIteratorPtr insideIter = SLCreateIterator(secondList);
do
{
//For every element in the second list, compare it to whatever my outsideIter is pointing to.
SLNode insideNode = insideIter->curNode;
//printf("Attempting to compare file stats by file name\n");
//int compareVal = compareStatsByFilename(outsideNode->value, insideNode->value);
if(outsideNode == NULL || insideNode == NULL || outsideNode->value == NULL || insideNode->value == NULL)
{
SLDestroyIterator(insideIter);
SLDestroyIterator(outsideIter);
SLDestroy(commonElements);
//printf("Returning from findcommonelements because something is null.\n");
return NULL;
}
int compareVal = strcmp(outsideNode->value, insideNode->value);
//printf("Compareval = %d\n",compareVal);
if(compareVal == 0) //Same file name, add it to the results list
{
//Theyre the same, so I can just add the outside one
char* outsideStats = outsideNode->value;
//printf("Found common element: %s\n", outsideStats);
SLInsert(commonElements, outsideStats);
}
}while(SLNextItem(insideIter) != NULL);
SLDestroyIterator(insideIter);
}while(SLNextItem(outsideIter) != NULL);
SLDestroyIterator(outsideIter);
return commonElements;
}
int main(int argc, char **argv) {
/* int i7,i5,i3,i4; */
/* double d1, d2, d3, d4, d5; */
char *s1, *s2, *s3, *s4, *s5;
SortedListPtr sl;
SortedListIteratorPtr slip;
sl = SLCreate(compareInts);
s1 = "Hello";
s2 = "World";
s3 = "Dawgs";
s4 = "Tacos";
s5 = "Zebra";
SLInsert(sl, s1); // => ['HELLO']
printListString(sl);
SLInsert(sl, s2); // => ['WORLD', 'HELLO']
printListString(sl);
SLInsert(sl, s3); // => ['WORLD', 'HELLO', 'DOGS']
printListString(sl);
SLInsert(sl, s4); // => ['WORLD', 'HELLO', 'DOGS']
printListString(sl);
SLInsert(sl, s5); // => ['ZZZ', 'WORLD', 'HELLO', 'DOGS']
printListString(sl);
SLRemove(sl, s2); // => ['ZZZ', 'HELLO', 'DOGS']
printListString(sl);
slip = SLCreateIterator(sl);
printf("------------------------------\n");
printf("%s\n", (char*)SLNextItem(slip));
SLRemove(sl, s1);
printf("%s\n", (char*)SLNextItem(slip));
printListString(sl);
printf("%s\n", (char*)SLNextItem(slip));
SLDestroyIterator(slip);
SLDestroy(sl);
return 0;
}
/* Given an index, go through and free all memory for word structs.
*
*/
void destroyAllWordStructs(SortedListPtr index)
{
if(index == NULL)
{
return;
}
if(index->headOfList == NULL)
{
return;
}
SortedListIteratorPtr wordIter = SLCreateIterator(index);
do
{
WordPtr curWordStruct = (WordPtr)wordIter->curNode->value;
destroyWordStruct(curWordStruct);
}while(SLNextItem(wordIter) != NULL);
SLDestroyIterator(wordIter);
return;
}
void *SLFind(SortedListPtr list, void *newObj) {
SortedListIteratorPtr iterator = NULL;
iterator = SLCreateIterator(list);
ListNode curNode = list->begin;
if (list->begin == NULL) return NULL;
if ( list->cf(newObj, curNode->item) == 0) {
return curNode->item;
}
while ( (curNode = curNode->next) ) {
if ( list->cf(newObj, curNode->item) == 0) {
return curNode->item;
}
}
SLDestroyIterator(iterator);
return NULL;
}
/*
test 4:
1. create list with compare and destroy functions
2. check SLInsert, add 1, 2, 3, 4, 5
3. create list iterate
4. check SLGetItem
5. destroy list iterator
6. destroy list
*/
void test4(){
SortedListPtr list = SLCreate(compare, destroy);
SortedListIteratorPtr iter;
int i;
int* value;
for (i = 1; i <= 5; i++)
{
value = (int*)malloc(sizeof(int));
*value = i;
SLInsert(list, (void*)value);
}
iter = SLCreateIterator(list);
value = (int*)SLGetItem(iter);
printf("Value = %d\n", *value);
SLDestroy(list);
SLDestroyIterator(iter);
printf("Test 4 completed\n");
}
int main(int argc, char** argv){
//***************** STRING TEST ***********************
int i;
const char* stringList[] = {"Hey", "Boy", "Zeus", "world", " ", "blah", " zzz", "aaa"};
char* stringPtr = (char*) malloc(sizeof(stringList));
SortedListPtr stringsl = SLCreate(compareStrings, NULL);
/*
for(i=0; i<(sizeof(stringList)/sizeof(stringList[0])); i++){
stringPtr = (char*) stringList[i];
SLInsert(stringsl, stringPtr);
}
*/
SortedListIteratorPtr stringiterator2 = SLCreateIterator(stringsl);
SLNextItem(stringiterator2);
SLInsert(stringsl, "f");
SLInsert(stringsl, "d");
SLInsert(stringsl, "b");
//SLRemove(stringsl, "Apple");
SortedListIteratorPtr stringiterator = SLCreateIterator(stringsl);
while((stringPtr = (char*) SLNextItem(stringiterator)) != NULL){
printf("%s\n", stringPtr);
}
//cleans mess
free(stringPtr);
SLDestroy(stringsl);
SLDestroyIterator(stringiterator);
}
int main()
{
SortedListPtr list = SLCreate(&compareInts);
SortedListIteratorPtr iterator, iterator_nulltest, iterator_1, iterator_2;
int *buffer;
char *buffer_char;
int i;
int *a, *b, *c, *d, *e;
char *a_char, *b_char, *c_char, *d_char;
if (list->head == NULL) { // Make sure list has been created correctly
fprintf(stdout, "\nList created\n");
}
// Setting up {7,5,3} example from announcements
// Will remove 5, then insert 4
fprintf(stdout, "\nTest Case 1\n");
a = (int*)malloc(sizeof(int));
*a = 7;
b = (int*)malloc(sizeof(int));
*b = 5;
c = (int*)malloc(sizeof(int));
*c = 3;
d = (int*)malloc(sizeof(int));
*d = 4;
SLInsert(list, a);
SLInsert(list, b);
SLInsert(list, c);
iterator = SLCreateIterator(list);
fprintf(stdout, "Next Item: %d\n", *(int*)(SLNextItem(iterator)));
fprintf(stdout, "Next Item: %d\n", *(int*)(SLNextItem(iterator)));
i = SLRemove(list, b); fprintf(stdout, "Remove: %d ", *b);
fprintf(stdout, "Remove returns (%d)\n", i);
SLInsert(list, d);
fprintf(stdout, "Next Item: %d\n", *(int*)(SLNextItem(iterator)));
SLDestroy(list);
SLDestroyIterator(iterator);
// Setting up {7,5,3} example from announcements
// Will remove 5, then insert 6
fprintf(stdout, "\nTest Case 2\n");
list = SLCreate(&compareInts);
iterator = SLCreateIterator(list);
a = (int*)malloc(sizeof(int));
*a = 7;
b = (int*)malloc(sizeof(int));
*b = 5;
c = (int*)malloc(sizeof(int));
*c = 3;
d = (int*)malloc(sizeof(int));
*d = 6;
SLInsert(list, a);
SLInsert(list, b);
SLInsert(list, c);
fprintf(stdout, "Next Item: %d\n", *(int*)(SLNextItem(iterator)));
fprintf(stdout, "Next Item: %d\n", *(int*)(SLNextItem(iterator)));
i = SLRemove(list, b); fprintf(stdout, "Remove: %d ", *b);
fprintf(stdout, "Remove returns (%d)\n", i);
SLInsert(list, d);
fprintf(stdout, "Next Item: %d\n", *(int*)(SLNextItem(iterator)));
SLDestroyIterator(iterator);
// Removal Test
// Already removed data, non-existent data, NULL pointer
fprintf(stdout, "\nTest Case 3\n");
e = (int*)malloc(sizeof(int));
*e = 1000;
i = SLRemove(list, b);
fprintf(stdout, "Remove returns (%d)\n", i);
i = SLRemove(list, e);
fprintf(stdout, "Remove returns (%d)\n", i);
i = SLRemove(list, NULL);
fprintf(stdout, "Remove returns (%d)\n", i);
SLDestroy(list);
/*
// Destroying something already destroyed
fprintf(stdout, "Destruction Testing\n");
fprintf(stdout, "Second List Destroy...\n");
//SLDestroy(list);
fprintf(stdout, "Second Iterator Destroy...\n");
// SLDestroyIterator(iterator);
*/
// Setting up to check sorting
// insert 5, 7, 3, 10
fprintf(stdout, "\nTest Case 4\n");
list = SLCreate(&compareInts);
iterator = SLCreateIterator(list);
a = (int*)malloc(sizeof(int));
*a = 1;
b = (int*)malloc(sizeof(int));
*b = 20;
c = (int*)malloc(sizeof(int));
*c = 17;
d = (int*)malloc(sizeof(int));
*d = 34;
SLInsert(list, a);
SLInsert(list, b);
SLInsert(list, c);
SLInsert(list, d);
fprintf(stdout, "Next Item: %d\n", *(int*)(SLNextItem(iterator)));
fprintf(stdout, "Next Item: %d\n", *(int*)(SLNextItem(iterator)));
fprintf(stdout, "Next Item: %d\n", *(int*)(SLNextItem(iterator)));
fprintf(stdout, "Next Item: %d\n", *(int*)(SLNextItem(iterator)));
SLDestroy(list);
SLDestroyIterator(iterator);
// Push Iterator to end of list
fprintf(stdout, "\nTest Case 5\n");
list = SLCreate(&compareInts);
iterator = SLCreateIterator(list);
a = (int*)malloc(sizeof(int));
*a = 1;
b = (int*)malloc(sizeof(int));
*b = 2;
c = (int*)malloc(sizeof(int));
*c = 3;
d = (int*)malloc(sizeof(int));
*d = 4;
SLInsert(list, a);
SLInsert(list, b);
SLInsert(list, c);
SLInsert(list, d);
while ( ( buffer = (int*)(SLNextItem(iterator)) ) != NULL ) {
fprintf(stdout, "Next Item: %d\n", *buffer);
}
SLDestroy(list);
SLDestroyIterator(iterator);
// Two iterators on single list
fprintf(stdout, "\nTest Case 6\n");
list = SLCreate(&compareInts);
iterator_1 = SLCreateIterator(list);
iterator_2 = SLCreateIterator(list);
a = (int*)malloc(sizeof(int));
*a = 1;
b = (int*)malloc(sizeof(int));
*b = 2;
c = (int*)malloc(sizeof(int));
*c = 3;
d = (int*)malloc(sizeof(int));
*d = 4;
SLInsert(list, a);
SLInsert(list, b);
SLInsert(list, c);
SLInsert(list, d);
for (i = 0; i < 2; i++) {
buffer = (int*)(SLNextItem(iterator_1));
fprintf(stdout, "Iterator 1 Next Item: %d\n", *buffer);
}
while ( (buffer = (int*)(SLNextItem(iterator_2))) != NULL ) {
fprintf(stdout, "Iterator 2 Next Item: %d\n", *buffer);
}
while ( (buffer = (int*)(SLNextItem(iterator_1))) != NULL ) {
fprintf(stdout, "Iterator 1 Next Item: %d\n", *buffer);
}
SLDestroy(list);
SLDestroyIterator(iterator_1);
SLDestroyIterator(iterator_2);
// Using different data types
fprintf(stdout, "\nTest Case 7\n");
list = SLCreate(&compareInts);
iterator = SLCreateIterator(list);
a_char = (char*)malloc(sizeof(char));
*a_char = 'a';
b_char = (char*)malloc(sizeof(char));
*b_char = 'b';
c_char = (char*)malloc(sizeof(char));
*c_char = 'c';
d_char = (char*)malloc(sizeof(char));
*d_char = 'd';
SLInsert(list, a_char);
SLInsert(list, b_char);
SLInsert(list, c_char);
SLInsert(list, d_char);
while ( (buffer_char = (char*)(SLNextItem(iterator))) != NULL ) {
fprintf(stdout, "Next Item: %c\n", *buffer_char);
}
SLDestroy(list);
SLDestroyIterator(iterator);
// Attempt to insert duplicate
fprintf(stdout, "\nTest Case 8\n");
list = SLCreate(&compareInts);
iterator = SLCreateIterator(list);
a = (int*)malloc(sizeof(int));
*a = 1;
b = (int*)malloc(sizeof(int));
*b = 2;
c = (int*)malloc(sizeof(int));
*c = 3;
d = (int*)malloc(sizeof(int));
*d = 3;
SLInsert(list, a); //fprintf(stdout, "Insert: %d\n", *a);
SLInsert(list, b); //fprintf(stdout, "Insert: %d\n", *b);
SLInsert(list, c); //fprintf(stdout, "Insert: %d\n", *c);
i = SLInsert(list, d);
fprintf(stdout, "Insert returns (%d)\n", i);
while ( (buffer = (int*)(SLNextItem(iterator))) != NULL ) {
fprintf(stdout, "Next Item: %d\n", *buffer);
}
// Test some NULL pointers
fprintf(stdout, "\nTest Case 9\n");
a = (int*)malloc(sizeof(int));
*a = 1;
SLInsert(NULL, a);
i = SLRemove(NULL, a);
fprintf(stdout, "Remove returns (%d)\n", i);
i = SLRemove(list, NULL);
fprintf(stdout, "Remove returns (%d)\n", i);
iterator_nulltest = SLCreateIterator(NULL);
if (SLNextItem(iterator_nulltest) == NULL) {
fprintf(stdout, "NULL Iterator\n");
}
return 1;
}
/*
Will write to the file specified by @param1 using the data in TokenList.
It will first check whether the filename is already in use and prompt the user if so.
Then it will use sorted-list iterator objects to navigate through TokenList and its nested sorted-lists
to output a JSON formated inverted-index file.
@param filename : Output file name.
*/
void writeFile(char *filename)
{
/* Checking if filename is a duplicate. */
if(!SLisEmpty(TokenList)){
if(access(filename,0) == 0){
printf("The requested output file name is already in use.\nOverwrite? (y/n)\n");
char c;
scanf("%c",&c);
if(c != 'y'){
exit(0);
}
}
}else{
printf("The input does not contain any tokens to index.\n");
exit(0);
}
/* Writing file to filename */
FILE *file;
if ((file = fopen(filename, "w+")) != NULL) {
fprintf(file, "{\"list\" : [\n");
SortedListIteratorPtr itr1 = SLCreateIterator(TokenList);
Token *tmp = SLGetItem(itr1);
while (tmp != NULL) {
fprintf(file, "\t {\"%s\" : [ \n", tmp->word);
SortedListIteratorPtr itr2 = SLCreateIterator(tmp->fileList);
fileRecord *tmp2 = SLGetItem(itr2);
while (tmp2 != NULL) {
fprintf(file, "\t\t {\"%s\" : %d}", tmp2->filename, tmp2->frequency);
if (!SLIsLastItem(itr2))
fprintf(file, ",");
fprintf(file, "\n");
tmp2 = SLNextItem(itr2);
}
fprintf(file, "\t ]}");
if (!SLIsLastItem(itr1))
fprintf(file, ",");
fprintf(file, "\n");
SLDestroyIterator(itr2);
tmp = SLNextItem(itr1);
}
fprintf(file, "]}\n");
SLDestroyIterator(itr1);
fclose(file);
printf("Inverted-index file successfully written to %s\n", filename);
}
else {
fprintf(stderr, "%s\n", filename);
fprintf(stderr, "errno %d: %s\n",errno, strerror(errno));
}
}
/* Perform logical and search
*
*
*/
SortedListPtr searchLogicalAnd(SortedListPtr indexHead, SortedListPtr words)
{
SortedListPtr result = SLCreate(*compareStrings);
SortedListPtr nextResult = NULL;
SortedListPtr testResult = NULL;
//Check if the first word exists
SortedListIteratorPtr wordIter = SLCreateIterator(words);
char *curWord = (char*)wordIter->curNode->value;
int wordSearch = SLSearchWord(indexHead, curWord);
//If the word is not in the list then just screw it, they get nothing.
if(wordSearch == -1)
{
//printf("Returning becasue wordSearch=-1\n");
SLDestroyIterator(wordIter);
SLDestroy(result);
return NULL;
}
//First word is in the list, so just copy everything from its filestats to results
SLNode firstwordNode = SLGetIndex(indexHead, wordSearch);
//printf("Copying all first word's stuff into new list\n");
insertAllFilenames(result, firstwordNode);
//Now hop into a while loop and check over and over.
int i = 0;
while(SLNextItem(wordIter) != NULL)
{
SortedListPtr nextWordList = SLCreate(*compareStrings);
curWord = (char*)wordIter->curNode->value;
int searchVal = SLSearchWord(indexHead, curWord);
if(searchVal == -1) //Word not in the list, return nothing immediately.
{
//destroyAllStrings(result);
//printf("Returning because searchVal = -1 inside while.\n");
SLDestroy(nextWordList);
//SLDestroy(result);
if(nextResult != NULL)
{
SLDestroy(nextResult);
}
SLDestroyIterator(wordIter);
return NULL;
}
else
{
SLNode nextNode = SLGetIndex(indexHead, searchVal);
//printf("Copying another word's file stats shit\n");
insertAllFilenames(nextWordList, nextNode);
//printf("Attempting to find common elements.\n");
if(i == 0)
{
testResult = findCommonElements(result, nextWordList);
if(testResult != NULL)
{
nextResult = testResult;
}
else
{
if(nextResult != NULL)
{
SLDestroy(nextResult);
}
SLDestroyIterator(wordIter);
SLDestroy(nextWordList);
return NULL;
}
SLDestroy(result);
}
else
{
testResult = findCommonElements(nextResult, nextWordList);
if(testResult != NULL)
{
nextResult = testResult;
}
else
{
if(nextResult != NULL)
{
SLDestroy(nextResult);
}
SLDestroyIterator(wordIter);
SLDestroy(nextWordList);
return NULL;
}
}
}
//destroyAllStrings(nextWordList);
SLDestroy(nextWordList);
i++;
}
SLDestroyIterator(wordIter);
if(i == 0)
{
return result;
}
else
{
return nextResult;
}
}
int main()
{
Employee *a=(Employee*)malloc(sizeof(Employee));
a->name="Albert";
a->salary=48000;
Employee *b=(Employee*)malloc(sizeof(Employee));
b->name="Bob";
b->salary=47000;
Employee *c=(Employee*)malloc(sizeof(Employee));
c->name="Carter";
c->salary=46000;
Employee *d=(Employee*)malloc(sizeof(Employee));
d->name="Dudley";
d->salary=45000;
//////////////////////// INITIALISING THE SORTED LIST ///////////////////////////
SortedListPtr ptr=SLCreate(&compareEmployees, &destroyEmployee);
printf("Creating SortedList...\n");
if(SLInsert(ptr, (void *)b))
printf("Inserted employee with name %s and salary %d \n",b->name,b->salary);
if(SLInsert(ptr, (void *)a))
printf("Inserted employee with name %s and salary %d \n",a->name,a->salary);
if(SLInsert(ptr, (void *)c))
printf("Inserted employee with name %s and salary %d \n",c->name,c->salary);
if(SLInsert(ptr, (void *)d))
printf("Inserted employee with name %s and salary %d \n",d->name,d->salary);
printf("Finished inserting.\n\n");
Employee* firstEmp=(Employee*)(ptr->head->data);
printf("%s is the first employee in the sorted list. \n\n",firstEmp->name);
////////////////////// CREATING ITERATORS //////////////////////////////////////
printf("Creating iterator 1 and 2\n");
SortedListIteratorPtr walker = SLCreateIterator(ptr);
SortedListIteratorPtr walker2 = SLCreateIterator(ptr);
printf("Testing SLGetItem for Iterator 1: %s \n", ((Employee*)(SLGetItem(walker)))->name);
//the walker1 will traverse through the list to the last element
while(walker->current->next!=NULL){
SLNextItem(walker);
printf("Testing Iterator 1 NextItem: %s \n\n", ((Employee *)(SLGetItem(walker)))->name);
}
///////////////// OPERATIONS ON SORTED LISTS //////////////////////////
printf("Attempting to remove Bob from the list.\n");
if(SLRemove(ptr, (void *)b))
printf("Element removed successfully.\n");
//trying to remove from list when iterator points to it
printf("Attempting to remove Dudley from the SortedList (iterator 1 points to it).\n");
SLRemove(ptr, (void *)d);
//destroyed the list but an iterator still points to one of the elements.
printf("Attempting to destroy the list. (Note that iterators 1 and 2 are still active.\n\n");
SLDestroy(ptr);
// testing iterators
printf("Iterator 1 is pointing to: %s \n", ((Employee *)(SLGetItem(walker)))->name);
printf("Iterator 2 is pointing to: %s\n",((Employee *)(SLGetItem(walker2)))->name );
printf("CHecking next element for each iterator\n");
if(SLNextItem(walker)==NULL)
printf("Iterator 1 reaches null\n");
if(SLNextItem(walker2)==NULL)
printf("Iterator 2 reaches null\n");
SLDestroyIterator(walker);
SLDestroyIterator(walker2);
return 0;
}
int main(int argc, char*argv[])
{
int choice = atoi(argv[1]);
printf("Choice: %d\n", choice);
if(choice == 1){
//1. Normal SLInserts (@ beginning, middle, end of list)
//a. integers
SortedListPtr s = SLCreate(compareInts);
int iarr[6] = {7,5,155,42,-1,6};
if(populate_list(s,INT,sizeof(iarr)/sizeof(int),iarr,NULL,NULL) == 0){
failure();
return 1;
}
SortedListIteratorPtr iter = SLCreateIterator(s);
iterprint_all(s,iter,INT); //prints 155 42 7 6 5 -1
}else if(choice == 2){
//b. doubles
SortedListPtr s = SLCreate(compareDoubles);
double darr[6] = {7.43,5.55,155.26,42.1,-1.5,6.7};
if(populate_list(s,DOUBLE,sizeof(darr)/sizeof(double),NULL,darr,NULL) == 0){
failure();
return 1;
}
SortedListIteratorPtr iter = SLCreateIterator(s);
iterprint_all(s,iter,DOUBLE); //prints 155.26 42.1 7.43 6.7 5.55 -1.5
}else if(choice == 3){
//c. strings
SortedListPtr s = SLCreate(compareStrings);
char *carr[6] = {"cat","dog","catamaran","apple","cormorant","zebra"};
if(populate_list(s,STRING,6,0,0,carr) == 0){
failure();
return 1;
}
SortedListIteratorPtr iter = SLCreateIterator(s);
iterprint_all(s,iter,STRING); //prints apple cat catamaran cormorant dog zebra
}else if(choice == 4){
//SLInsert on null list;
int x = 5;
if(SLInsert(NULL, &x) == 0){
success();
}else{
failure();
}
}else if(choice == 5){
//SLInsert null object
SortedListPtr s = SLCreate(compareDoubles);
if (SLInsert(s,NULL) == 0){
success();
}else{
failure();
}
}else if(choice == 6){
//SLRemove nonexistent element
SortedListPtr s = SLCreate(compareInts);
int iarr[6] = {7,5,155,42,-1,6};
populate_list(s,INT,sizeof(iarr)/sizeof(int),iarr,0,0);
int toremove = 54;
if (SLRemove(s,&toremove) != 0) {
failure();
}else{
success();
}
}else if(choice == 7){
//SLRemove existing element (no duplicates; didn't handle them anyway)
SortedListPtr s = SLCreate(compareInts);
int iarr[6] = {7,5,155,42,-1,6};
populate_list(s,INT,sizeof(iarr)/sizeof(int),iarr,0,0);
int toremove = 5;
if (SLRemove(s,&toremove) != 0) {
SortedListIteratorPtr iter = SLCreateIterator(s);
iterprint_all_int(s,iter); //prints 155 42 7 6 -1
}else{
failure();
}
}else if(choice == 8){
//Iterate on empty list
SortedListPtr s = SLCreate(compareInts);
SortedListIteratorPtr iter = SLCreateIterator(s);
iterprint_all_int(s,iter);
//TODO: Separate into a) create iterator b) print empty list
}else if(choice == 9){
//Create new iterator on list, destroy old one mid-iteration
SortedListPtr s = SLCreate(compareInts);
int iarr[6] = {7,5,155,42,-1,6};
populate_list(s,INT,sizeof(iarr)/sizeof(int),iarr,0,0);
SortedListIteratorPtr olditer = SLCreateIterator(s);
void *olditem = SLNextItem(olditer);
olditem = SLNextItem(olditer);
SortedListIteratorPtr iter = SLCreateIterator(s);
SLDestroyIterator(olditer);
iterprint_all_int(s,iter); //prints 155 42 7 6 5 -1
}else if(choice == 10){ //TODO
//Create multiple iterators on same list, interleave iterations.
SortedListPtr s = SLCreate(compareInts);
int iarr[6] = {7,5,155,42,-1,6};
populate_list(s,INT,sizeof(iarr)/sizeof(int),iarr,0,0);
SortedListIteratorPtr olditer = SLCreateIterator(s);
SortedListIteratorPtr iter = SLCreateIterator(s);
void *item;
item = SLNextItem(olditer);
printf("%d ", *((int*)item));
item = SLNextItem(olditer);
printf("%d ", *((int*)item)); //prints 155 42
item = SLNextItem(iter);
printf("%d ", *((int*)item));
item = SLNextItem(iter);
printf("%d ", *((int*)item));
item = SLNextItem(iter);
printf("%d ", *((int*)item)); //prints 155 42 7
item = SLNextItem(iter); //prints 6
printf("%d ", *((int*)item));
item = SLNextItem(olditer);
printf("%d ", *((int*)item)); //prints 7
iterprint_all_int(s,iter); //prints 5 -1
iterprint_all_int(s,olditer); //prints 6 5 -1
}else if(choice == 11){
//SLRemove end element, iterator positioned on it
SortedListPtr s = SLCreate(compareInts);
int iarr[3] = {7,5,3};
populate_list(s,INT,sizeof(iarr)/sizeof(int),iarr,0,0);
SortedListIteratorPtr iter = SLCreateIterator(s);
int x3 = 3;
void *item = SLNextItem(iter);
item = SLNextItem(iter);
if(SLRemove(s,&x3) && SLNextItem(iter) == NULL){
success();
}else{
failure();
}
}else if(choice == 12){ //TODO
//SLRemove beginning element, iterator positioned on it
SortedListPtr s = SLCreate(compareInts);
int iarr[3] = {7,5,3};
populate_list(s,INT,sizeof(iarr)/sizeof(int),iarr,0,0);
SortedListIteratorPtr iter = SLCreateIterator(s);
int x1 = 7;
if(SLRemove(s,&x1) && *((int*)SLNextItem(iter)) == 5 &&
*((int*)SLNextItem(iter)) == 3 &&
((int*)SLNextItem(iter)) == NULL){
success();
}else{
failure();
}
}else if(choice == 13){ //TODO
//SLRemove element in middle, iterator positioned on it
SortedListPtr s = SLCreate(compareInts);
int iarr[3] = {7,5,3};
populate_list(s,INT,sizeof(iarr)/sizeof(int),iarr,0,0);
SortedListIteratorPtr iter = SLCreateIterator(s);
void *item = SLNextItem(iter);
if (*((int*)item) != 7) {
failure();
return 1;
}
int x1 = 5;
if(SLRemove(s,&x1) && *((int*)SLNextItem(iter)) == 3 &&
((int*)SLNextItem(iter)) == NULL){
success();
}else{
failure();
}
}else if(choice == 14){
//Add element after iterator
SortedListPtr s = SLCreate(compareInts);
int iarr[3] = {7,5,3};
populate_list(s,INT,sizeof(iarr)/sizeof(int),iarr,0,0);
SortedListIteratorPtr iter = SLCreateIterator(s);
void *item = SLNextItem(iter);
item = SLNextItem(iter);
int x4 = 4;
SLInsert(s,&x4); //prints 4 3
iterprint_all_int(s,iter);
}else if(choice == 15){
//Remove element after iterator
SortedListPtr s = SLCreate(compareInts);
int iarr[4] = {7,5,3,4};
populate_list(s,INT,sizeof(iarr)/sizeof(int),iarr,0,0);
SortedListIteratorPtr iter = SLCreateIterator(s);
void *item = SLNextItem(iter);
item = SLNextItem(iter);
int x4 = 4;
if(SLRemove(s,&x4)){
iterprint_all_int(s,iter); //prints 3
}else{
failure();
}
}else{
printf("Bad input\n");
}
return 0;
}
int main(int argc, const char * argv[]) {
char * strs[7] = {"supar short","this is a short string","this is a longer string so I can test the comparator", "this is an even longer string so I can test the comparator", "this is a super duper mooper long string so I can test this stuff", "this is a short stringmk","this is an even longer string so I can test the comparator"};
int numbers[5] = {5,1,3,7,5};
Struct_Obj strtarr[7];
strtarr[0].data = 200;
strtarr[1].data = 1;
strtarr[2].data = 3;
strtarr[3].data = 9;
strtarr[4].data = 45;
strtarr[5].data = 600;
strtarr[6].data = 324;
char c;
int i;
c = getchar();
if (c == '1') {
/*
* This test is simply to test order, it will populat a list,
* and then remove a few items. The iterator is absent from this test.
*/
SortedListPtr list = SLCreate(compareStrings, destroy);
for(i = 0; i < 3; i++)
SLInsert(list, strs[i]);
//SLRemove(list, strs[3]);
//SLRemove(list, strs[5]);
Node curr = NULL;
for(curr = list->next; curr != NULL; curr = curr->next)
{
printf("output strlen: %lu\n", strlen(((char*)curr->Object)));
}
SLDestroy(list);
}
else if (c == '2')
{
/*
* This will test iterators traversing a list.
* A remove will be inserted mid traversal to test the "ghost routine"
* described in the readme.
*/
SortedListPtr list = SLCreate(compareStrings, destroy);
for(i = 0; i < 7; i++)
SLInsert(list, strs[i]);
SortedListIteratorPtr iter2= SLCreateIterator(list); // this will work because the list has elements.
SLGetItem(iter2);
SLNextItem(iter2);
SLNextItem(iter2);
SLRemove(list, strs[1]);
SLRemove(list, strs[4]);
Node curr = NULL;
for(curr = list->next; curr != NULL; curr = curr->next)
{
if(!curr->Object)
continue;
printf("output: %lu\n", strlen(((char*)curr->Object)));
}
SLDestroyIterator(iter2);
SLDestroy(list);
}
else if(c == '3')
{
/*
* This case will test the ghost node functionality of SortedList.
* It will create some iterators and delete the object at the target location
* of the current iterator.
*/
SortedListPtr list = SLCreate(compareStrings, destroy);
for(i = 0; i < 7; i++)
SLInsert(list, strs[i]);
SortedListIteratorPtr iter= SLCreateIterator(list);
SLRemove(list, strs[4]); //remove head
SLRemove(list, strs[3]); //remove head + 1
SLRemove(list, strs[3]); //remove head + 2
SLNextItem(iter);
Node curr = NULL;
for(curr = list->next; curr != NULL; curr = curr->next)
{
if(!curr->Object)
continue;
printf("output: %lu\n", strlen(((char*)curr->Object)));
}
SLDestroyIterator(iter);
SLDestroy(list);
}
else if(c == '4')
{
/*
* This test case will create and list, assign it two iterator
* and remove the node of the current target of the iterator.
* The node at the end of the list will be removed. We will then
* try to push the iterator passed the end of the list.
*/
SortedListPtr list = SLCreate(compareStrings, destroy);
for(i = 0; i < 7; i++)
SLInsert(list, strs[i]);
SortedListIteratorPtr iter= SLCreateIterator(list);
SortedListIteratorPtr iter2 = SLCreateIterator(list);
SLRemove(list, strs[4]); //remove head
SLRemove(list, strs[3]); //remove head + 1
SLRemove(list, strs[3]); //remove head + 2
SLRemove(list, strs[0]); //remove tail
SLNextItem(iter2);
SLNextItem(iter2);
SLNextItem(iter2);
SLNextItem(iter2);
SLNextItem(iter2); //well passed end of list
SLNextItem(iter);
SLNextItem(iter);
Node curr = NULL;
for(curr = list->next; curr != NULL; curr = curr->next)
{
if(!curr->Object)
continue;
printf("output: %lu\n", strlen(((char*)curr->Object)));
}
SLDestroyIterator(iter);
SLDestroyIterator(iter2);
SLDestroy(list);
}
else if(c == '5')
{
/*
* This is the stress test-case we will use sting objects, it will
* test all of the previous cases along with actions to attempt to
* weed out an edge case.
*/
SortedListPtr list = SLCreate(compareStrings, destroy);
for(i = 0; i < 7; i++)
SLInsert(list, strs[i]);
SortedListIteratorPtr iter= SLCreateIterator(list);
SortedListIteratorPtr iter2 = SLCreateIterator(list);
SLRemove(list, strs[4]); //remove head
SLRemove(list, strs[3]); //remove head + 1
SLRemove(list, strs[3]); //remove head + 2
SLRemove(list, strs[0]); //remove tail
SLNextItem(iter);
SLNextItem(iter2);
SLNextItem(iter2);
SLNextItem(iter2);
SLNextItem(iter2); //well passed end of list
SLNextItem(iter);
SLNextItem(iter);
for(i = 0; i < 7; i++)
SLInsert(list, strs[i]);
SortedListIteratorPtr iter3 = SLCreateIterator(list);
SLNextItem(iter3);
SLNextItem(iter3);
SLRemove(list, strs[4]);
Node curr = NULL;
for(curr = list->next; curr != NULL; curr = curr->next)
{
if(!curr->Object)
continue;
printf("output: %lu\n", strlen(((char*)curr->Object)));
}
SLNextItem(iter);
SLDestroyIterator(iter);
SLDestroyIterator(iter3);
SLDestroyIterator(iter2);
SLDestroy(list);
}
else if (c == '6')
{
SortedListPtr list = SLCreate(compareStrings, destroy);
for(i = 0; i < 7; i++)
SLInsert(list, strs[i]);
SortedListIteratorPtr iter = SLCreateIterator(list);
for(i=0;i<7;i++)
SLRemove(list, strs[i]);
for (i = 0; i < 100; i++) //try to break iterator
SLNextItem(iter);
SLRemove(list, strs[0]); //try to remove object that isn't in the list
Node curr = NULL;
for(curr = list->next; curr != NULL; curr = curr->next)
{
if(!curr->Object)
continue;
printf("output strlen: %lu\n", strlen(((char*)curr->Object)));
}
SLDestroyIterator(iter);
SLDestroy(list);
}
else if (c =='7')
{
/*
* This case tests a new object type.
* This is a simple load, no deletes or iterators are used.
*/
SortedListPtr list = SLCreate(compareInts, destroy);
for (i=0; i< 5; i++) {
int *ptr;
ptr = &numbers[i];
SLInsert(list, ptr);
}
Node curr = NULL;
for(curr = list->next; curr != NULL; curr = curr->next)
{
printf("output int: %d\n", *((int *)curr->Object));
}
SLDestroy(list);
}
else if (c == '8')
{
/*
* Load the LL with int object, then proceed to
* created an iterator. Nuke the current target of the iterator
* which is also the head. Increment iterator and check valid LL
*/
SortedListPtr list = SLCreate(compareInts, destroy);
int *ptr;
for (i=0; i< 5; i++) {
ptr = &numbers[i];
SLInsert(list, ptr);
}
SortedListIteratorPtr iter = SLCreateIterator(list);
int x = 7;
ptr = &x; //remove head while iterator is targeting
// SLRemove(list, ptr);
SLNextItem(iter); //advance iterator after making target ghost node
Node curr = NULL;
for(curr = list->next; curr != NULL; curr = curr->next)
{
if(!curr->Object)
continue;
printf("output int: %d\n", *((int *)curr->Object));
}
SLDestroy(list);
SLDestroyIterator(iter);
}
else if(c == '9')
{
/*
* This case is for testing structs for storing in the LL.
* Load structs into LL and test for correct order.
*/
SortedListPtr list = SLCreate(compareStrings, destroy);
Struct_Obj *ptr;
for (i=0; i< 7; i++) {
ptr = &strtarr[i];
SLInsert(list, ptr);
}
Node curr = NULL;
for(curr = list->next; curr != NULL; curr = curr->next)
{
if(!curr->Object)
continue;
printf("output int: %d\n", *((int *)curr->Object));
}
SLDestroy(list);
}
else if(c == '0')
{
SortedListPtr list = SLCreate(compareStrings, destroy);
Struct_Obj *ptr;
for (i=0; i< 7; i++) {
ptr = &strtarr[i];
SLInsert(list, ptr);
}
SortedListIteratorPtr iter = SLCreateIterator(list);
ptr = &strtarr[5];
SLRemove(list, ptr); //remove head / iterator target
for(i=0;i<20;i++) //iterate past end of LL
SLNextItem(iter);
Node curr = NULL;
for(curr = list->next; curr != NULL; curr = curr->next)
{
if(!curr->Object)
continue;
printf("output int: %d\n", *((int *)curr->Object));
}
SLDestroy(list);
SLDestroyIterator(iter);
}
else
{
printf("bad input, please run the program again, proper input is 0-9\n");
}
return 0;
}
int main(int argc, char** argv){
printf("Sample test cases, for more test cases look at testcode.txt and at testplan.txt for its expected behavior\n\n");
printf("********************************************* TEST CASE 1 ***********************************************\n\n");
SortedListPtr sl1 = SLCreate(compareInts, NULL);
SLDestroy(sl1);
printf("\n");
printf("********************************************* TEST CASE 6 ***********************************************\n\n");
const char * stringArray[] = {"Zoid", "Brackets", "Apple"};
void * printer;
SortedListPtr sl2 = SLCreate(compareStrings, destroyBasicTypeNoAlloc);
int i;
for(i=0; i<(sizeof(stringArray)/sizeof(stringArray[0])); i++){
if(SLInsert(sl2, (void *)stringArray[i])==0)
printf("There was an error but the list was still created anyway\n");
}
SortedListIteratorPtr iter2 = SLCreateIterator(sl2);
printf("List: ");
while((printer=SLNextItem(iter2)) != NULL)
printf("%s ", (char *)printer);
SLInsert(sl2, " zoom");
printf("%s ", (char *)SLNextItem(iter2));
printf("\n\n");
SLDestroy(sl2);
SLDestroyIterator(iter2);
printf("********************************************* TEST CASE 8 ***********************************************\n\n");
const char * stringArr[] = {"zoom", "wii", "Soccer", "Zoid", "Brackets", " zoom"};
void * print;
void * print2;
SortedListPtr sl = SLCreate(compareStrings, destroyBasicTypeNoAlloc);
int p;
for(p=0; p<(sizeof(stringArr)/sizeof(stringArr[0])); p++){
if(SLInsert(sl, (void *)stringArr[p])==0)
printf("There was an error but the list was still created anyway\n");
}
SortedListIteratorPtr iterator = SLCreateIterator(sl);
SortedListIteratorPtr iterator2 = SLCreateIterator(sl);
printf("iterator 1: ");
print = SLNextItem(iterator);
printf("%s \n", (char *)iterator->currentNode->data);
printf("iterator 2: ");
print2 = SLNextItem(iterator2);
print2 = SLNextItem(iterator2);
printf("%s \n", (char *)iterator2->currentNode->data);
SLRemove(sl, iterator->currentNode->data);
SLRemove(sl, iterator2->currentNode->data);
printf("%s \n", (char *)SLNextItem(iterator));
printf("%s \n", (char *)SLNextItem(iterator2));
SLDestroyIterator(iterator);
SLDestroy(sl);
return 0;
}
int main(void)
{
//TEST CASE 1 WITH CHARACTERS
SortedListPtr si =SLCreate(compareStrings, destroy);
SLInsert(si, "z");
SLInsert(si, "a");
SLInsert(si, "a");
SLInsert(si, "b");
SLInsert(si, "x");
printf("\n=-=-=-=-=-=-=- Testing Characters =-=-=-=-=-=-=-=-=-=-=-=-=-=\n");
printf("Completed inserting characters into list\n");
// SLRemove(si, "x");
Node *ptr;
SortedListIteratorPtr it = SLCreateIterator(si);
//iterator has been created, begin to iterate through the list and print out the values
//we use the SLGetItem to return the current item
ptr =SLGetItem(it);
while(ptr != NULL)
{
printf("\n%s", ptr->data);
ptr = SLNextItem(it); //uses the SLNextItem to move the pointer to the next item to continue iterating
}
printf("\nCompleted interating through the list\n");
//The iterator gets destroyed
SLDestroyIterator(it);
printf("Iterator has been destroyed\n");
//the list has not been affected since the iterator got destroyed
printf("Destroyed iterator does not affect list by printing out values from list\n");
printf("First item in the list: %s\n", si->head->data); //prints out the item in the list where head points to
printf("Second item in the list: %s\n", si->head->next->data); //prints out the item after head
printf("=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-\n");
//+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+
//TEST CASE 2 WITH INTEGERS
int arr[]= {2,3,10,8,4,11,21,8,1,7,16};
int length = sizeof(arr)/sizeof(arr[0]);
int i;
SortedListPtr si2 =SLCreate(compareInts, destroy);
int *intPtr;
int x = 100; //
int *insrt; // to insert a number 100
insrt = &x; // after iterated through list
printf("\n=-=-=-=-=-=-=-=-=-Testing Integers=-=-=-=-=-=-=-=-=-=-=-=\n");
//inserts numbers from arrray into linked list
for(i = 0; i < length;i++)
{
intPtr = &arr[i];
SLInsert(si2,intPtr);
}
printf("Finished inserting numbers into linked list\n");
Node* ptr2;
SortedListIteratorPtr it2 = SLCreateIterator(si2);
ptr2 = SLGetItem(it2);
//iterator traverses through the list
while(ptr2 != NULL)
{
printf("%d\n", (*(int*)(ptr2->data)) );
ptr2 = SLNextItem(it2);
}
printf("Finished traversing through linked list\n");
SLInsert(si2, insrt);
printf("Number 100 has been inserted into the list\n");
//destroys iterator
SLDestroyIterator(it2);
printf("Iterator has been destroyed\n");
//list has not been affectedby iterator by printing values in list
printf("First value in list: %d\n", (*(int*)(si2->head->data)) );
printf("Second value in list: %d\n", (*(int*)(si2->head->next->data)) );
//remove item from list
SLRemove(si2, insrt);
printf("item containing 100 has been deleted from list\n");
printf("First item after deletion:%d\n", (*(int*)(si2->head->data)) );
printf("Second item after deletion:%d\n", (*(int*)(si2->head->next->data)) );
printf("=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n");
//TESTING FLOATS--------------------------
float arrDbl[]= {2.2,3.6,10.9,8.3,4.7,11.3,21.7,8.1,1.8,7.2,16.5};
int size = sizeof(arrDbl)/sizeof(arrDbl[0]);
int count;
SortedListPtr si3 =SLCreate(compareDoubles, destroy);
float *dblPtr;
float var = 170.5;
float *insert;
insert = &var;
printf("\n=-=-=-=-=-=-=-=-=-Testing Floats=-=-=-=-=-=-=-=-=-=-=-=\n");
//inserts numbers from arrray into linked list
for(count = 0; count < size;count++)
{
dblPtr = &arrDbl[count];
SLInsert(si3,dblPtr);
}
printf("Finished inserting numbers into linked list\n");
Node* ptr3;
SortedListIteratorPtr it3 = SLCreateIterator(si3);
ptr3 = SLGetItem(it3);
//iterator traverses through the list
while(ptr3 != NULL)
{
printf("%f\n", (*(float*)(ptr3->data)) );
ptr3 = SLNextItem(it3);
}
printf("Finished traversing through linked list\n");
SLInsert(si3, insert);
printf("Number 170.5 has been inserted into the list\n");
//destroys iterator
SLDestroyIterator(it3);
printf("Iterator has been destroyed\n");
//list has not been affectedby iterator by printing values in list
printf("First value in list: %f\n", (*(float*)(si3->head->data)) );
printf("Second value in list: %f\n", (*(float*)(si3->head->next->data)) );
//remove item from list
SLRemove(si3, insert);
printf("item containing 100 has been deleted from list\n");
printf("First item after deletion:%f\n", (*(float*)(si3->head->data)) );
printf("Second item after deletion:%f\n", (*(float*)(si3->head->next->data)) );
printf("=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-\n");
return 0;
}
int main()
{
SortedListPtr sl = SLCreate(&compareInts);
int* n1 = malloc(sizeof(int*));
int* n2 = malloc(sizeof(int*));
int* n3 = malloc(sizeof(int*));
int* n4 = malloc(sizeof(int*));
int* n5 = malloc(sizeof(int*));
*n1 = 5;
*n2 = 10;
*n3 = 3;
*n4 = 8;
*n5 = 11;
printf("Test Case 1: Adding\n");
SLInsert(sl, n1);
SLInsert(sl, n2);
SLInsert(sl, n3);
SLInsert(sl, n4);
SortedListIteratorPtr sp = SLCreateIterator(sl);
int* foo;
do{
foo = SLNextItem(sp);
if (foo == NULL) {
break;
}
printf("%d\n", *foo);
} while (foo != NULL);
printf("Test Case 2: Removing \n");
SortedListIteratorPtr sz = SLCreateIterator(sl);
SLRemove(sl, n4);
do{
foo = SLNextItem(sz);
if (foo == NULL) {
break;
}
printf("%d\n", *foo);
} while (foo != NULL);
printf("Test Case 3: Removing/Adding in Middle\n");
SortedListPtr t3 = SLCreate(&compareInts);
SLInsert(t3, n1);
SLInsert(t3, n2);
SLInsert(t3, n3);
SLInsert(t3, n4);
SortedListIteratorPtr p3 = SLCreateIterator(t3);
foo = SLNextItem(p3);
printf("%d\n", *foo);
printf("remove: 8, then continue iterating \n");
SLRemove(t3, n4);
printf("add 11, then continue iterating \n");
SLInsert(t3, n5);
do{
foo = SLNextItem(p3);
if (foo == NULL) {
break;
}
printf("%d\n", *foo);
} while (foo != NULL);
printf("Iterate whole list from start \n");
SortedListIteratorPtr p3a = SLCreateIterator(t3);
do{
foo = SLNextItem(p3a);
if (foo == NULL) {
break;
}
printf("%d\n", *foo);
} while (foo != NULL);
printf("Test Case 4: Removing and Iterating Empty List\n");
SortedListPtr t4 = SLCreate(&compareInts);
SLRemove(t4, n1);
SortedListIteratorPtr p4 = SLCreateIterator(t4);
do{
foo = SLNextItem(p4);
if (foo == NULL) {
break;
}
printf("%d\n", *foo);
} while (foo != NULL);
printf("Test Case 5: Strings\n");
char* c1 = malloc(sizeof(char) * 5);
char* c2 = malloc(sizeof(char) * 5);
char* c3 = malloc(sizeof(char) * 5);
strcpy(c1, "hey\0");
strcpy(c2, "yo\0");
strcpy(c3, "kk\0");
printf("%s\n", c1);
SortedListPtr t5 = SLCreate(&compareStrings);
SLInsert(t5, c1);
SortedListIteratorPtr p5 = SLCreateIterator(t5);
char *resp = SLNextItem(p5);
printf("%s\n", resp);
free(n1);
free(n2);
free(n3);
free(n4);
free(n5);
SLDestroyIterator(p4);
SLDestroyIterator(p3);
SLDestroyIterator(p3a);
SLDestroyIterator(sz);
SLDestroyIterator(sp);
SLDestroy(sl);
SLDestroy(t3);
SLDestroy(t4);
}
void add_word(char *filename, char *wordToAdd, char *tokenString) {
FileWithCount file;
file = (FileWithCount) malloc( sizeof(FileWithCount) );
file->filename = (char *) malloc( BUFSIZ+1 );
snprintf(file->filename, BUFSIZ, "%s", filename);
file->count = 1;
printf("Filename after file %s and should be %s\n",file->filename,filename);
/*Find if word exists*/
WordNode wordToFind = (WordNode) malloc(sizeof(WordNode));
wordToFind->word = (char *) malloc (BUFSIZ+1);
snprintf(wordToFind->word, BUFSIZ, "%s", wordToAdd);
WordNode isWordThere;
isWordThere = (WordNode) SLFind(wordList, wordToFind);
if (isWordThere != NULL) { /*Word already exists*/
printf("WORD EXISTS: %s\n", wordToAdd);
SortedListIteratorPtr iter;
iter = SLCreateIterator(isWordThere->files);
void *obj = NULL;
while ((obj = SLNextItem(iter))) {
FileWithCount objFile;
objFile = obj;
if (compareFilesWithCount(objFile, file) == 0) {
/*Filename present,
just increase count and break*/
objFile->count++;
break;
}
}
SLDestroyIterator(iter);
if(obj == NULL) {
/*File not found, insert it into list*/
printf("Filename before slinsert %s\n",file->filename);
SLInsert(isWordThere->files, file);
printf("Inserted file %s into word %s\n",file->filename,isWordThere->word);
printf("Filename actually %s\n",filename);
free (wordToFind->word);
free (wordToFind);
} else {
fprintf(stderr, "ERROR: Add Word\n");
free (file->filename);
free (file);
free (wordToFind->word);
free (wordToFind);
}
return;
} else { /*Word doesn't exist yet*/
wordToFind->files = SLCreate(compareFilesWithCount);
/* printf("The word of the day is %s\n", w->word); */
/*Insert file path into word*/
SLInsert(wordToFind->files, file);
/*Insert word into word list*/
SLInsert(wordList, wordToFind);
return;
}
}
