-
Notifications
You must be signed in to change notification settings - Fork 0
/
inverted.c
96 lines (73 loc) · 2.23 KB
/
inverted.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
/*
* COMP2521 - Data Structures and Algorithms
* Assignment 2 - Simple Search Engines
*
* Group: TwoBrothers
*
* Partners: Kurt Banwell-Pachernegg (Z5022859)
* Sam Eager (Z3414861)
*
*
* Part 1. B - Inverted Index
*/
#include <stdlib.h>
#include <stdio.h>
#include <ctype.h>
#include <string.h>
#include <assert.h>
#include <math.h>
#include "collection.h"
#include "BST.h"
#include "HashMap.h"
#include "Queue.h"
#include "PriorityQueue.h"
//String compare for PriorityQueue.
static int compare(void * a, void * b);
int main (int argc, char *argv[])
{
BST words;
// A PriorityQueue of unique words for easy itteration over the collection.
PriorityQueue wordList = newPriorityQueue(compare);
// A collection of words and corresponding urls where each key is abort
// word and the corresponding value is a PriorityQueue (BST) of words.
HashMap collection = newStringHashMap();
char * url;
char * word;
PriorityQueue urls;
Queue queue = getUrls();
// Fill the wordList and collection.
while(!emptyQueue(queue)) {
url = (char *) nextQueue(queue);
words = (BST) getUrlWords(url);
while(!emptyBST(words)) {
word = (char *) removeBST(words, maxBST(words));
// Add to wordList.
if(!existsPriorityQueue(wordList, word)) addPriorityQueue(wordList, word);
// Add to collection.
if(existsHashMap(collection, word)) urls = (PriorityQueue) getHashMap(collection, word);
else urls = newPriorityQueue(compare);
addPriorityQueue(urls, url);
addHashMap(collection, word, urls);
}
freeBST(words);
}
FILE * file = fopen("invertedIndex.txt", "w");
// Print the collection to invertedIndex.txt.
while(!emptyPriorityQueue(wordList)) {
word = (char *) nextPriorityQueue(wordList);
urls = (PriorityQueue) getHashMap(collection, word);
fprintf(file, "%s ", word);
while(!emptyPriorityQueue(urls)) {
url = (char *) nextPriorityQueue(urls);
fprintf(file, "%s", url);
if(!emptyPriorityQueue(urls)) fprintf(file, " ");
}
if(!emptyPriorityQueue(wordList)) fprintf(file, "\n");
}
fclose(file);
return 1;
}
static int compare(void * a, void * b)
{
return strcmp((char *) b, (char *) a);
}