-
Notifications
You must be signed in to change notification settings - Fork 0
/
cppWebSearch.cpp
454 lines (390 loc) · 11.1 KB
/
cppWebSearch.cpp
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
/* Project: cppWebSearch
* File: cppWebSearch.cpp
*
* Created by Rane Brown 4/19/2015
*
*/
#include "cppWebSearch.h"
#include <boost/network/protocol/http/client.hpp>
#include <string>
#include <fstream>
#include <unistd.h> // for usleep function
/*
Function prototype:
WebSearch::WebSearch()
Function description:
Constructor - creates instance of WebSearch class. No required initilization.
Example:
N/A
Pre-conditions: N/A
Post-conditions: N/A
*/
WebSearch::WebSearch() {
}
/*
Function prototype:
WebSearch::~WebSearch()
Function description:
Destructor - destroys instance of WebSearch class when it goes out of scope
Example:
N/A
Pre-conditions: N/A
Post-conditions: N/A
*/
WebSearch::~WebSearch() {
}
/*
Function prototype:
void WebSearch::EnqueueSite(string)
Function description:
EnqueSite function accepts the address of a website and adds it to the queue
of sites that are waiting to be searched for further links and keywords.
Format of url is http://www."remainder of address"
Example:
WebSearch *newSearch = new WebSearch;
newSearch.EnqueueSite("http://www.google.com");
Pre-conditions: a valid url must be entered as string
Post-conditions: prints the url that was added to queue
*/
void WebSearch::EnqueueSite(std::string url) {
std::string valid = "http://";
std::string check(url, 0, 7); //writes the first 7 characters of url to string check
// Check if a valid url was entered
if(valid.compare(check) != 0) {
std::cout<<"invalid url\n"<<"url must begin with http://\n";
return;
}
urlList.push(url);
std::cout<<url<<" has been added to queue\n";
}
/*
Function prototype:
void WebSearch::BuildQueue(string, int)
Function description:
Build Queue scans each website for links and adds the links to a queue.
The queue is set to be of size depth specified by user. Once the queue is full
further searching stops.
Example:
WebSearch *newSearch = new WebSearch;
newSearch.BuildQueue("http://www.google.com");
Pre-conditions: a valid url must be entered as string
Post-conditions: displays each site as it is processed
*/
void WebSearch::BuildQueue(std::string url, int depth) {
using namespace boost::network;
if(!urlList.empty()) {
std::cout<<"Base queue of urls has already been built\n";
return;
}
urlList.push(url); // add url to queue
bool scan = true;
std::queue<std::string> tempQ;
tempQ.push(url);
while((int)urlList.size() < depth) {
scan = true;
if(tempQ.empty()) // couldn't find enough links to
break;
url = tempQ.front(); // extract next url and scan for more links
tempQ.pop();
usleep(200000); // .2 second delay
// create connection to url and save html code to a text file
try {
std::cout<<"Processing: "<<url<<std::endl;
http::client client;
http::client::request request(url);
request << header("Connection", "close");
http::client::response response = client.get(request);
remove("temp.txt"); // delete old temporary text file
std::ofstream tempOut("temp.txt");
if(tempOut.is_open()) {
tempOut << body(response);
tempOut << "\n";
}
tempOut.close();
}
catch(boost::system::system_error const& ec) {
std::cout<<"Connection error to url: "<<url<<std::endl;
scan = false;
if(urlList.size() ==1)
return;
}
catch(std::bad_alloc& ba) {
std::cout<<"Allocation error with:"<<url<<std::endl;
scan = false;
if(urlList.size() ==1)
return;
}
catch (const std::length_error& le) {
std::cout<<"Length error with:"<<url<<std::endl;
scan = false;
if(urlList.size() ==1)
return;
}
if(scan == true) {
// open the text file and scan for urls
std::ifstream tempIn("temp.txt");
if(!tempIn.is_open())
std::cout<<"Error opening file\n";
else {
std::string temp;
std::size_t start, end;
bool unique;
while(getline(tempIn,temp,' ')) {
if((int)urlList.size() >= depth)
break;
start = temp.find("http://www."); // find the beginning of a new url
end = temp.find('"',start); // find the end of the url (assuming url in inside "quotes")
if(start != std::string::npos && end != std::string::npos) {
std::string foundURL = temp.substr(start, (end-start)); // extract only the url
std::string valid = "http://";
std::string check(foundURL, 0, 7);
// Check found url is valid
if(valid.compare(check) != 0); // do nothing
else {
unique = IsUnique(foundURL); // check if found url is unique (hasn't already been found)
if(unique == true) {
urlList.push(foundURL);
tempQ.push(foundURL);
}
}
}
if( tempIn.eof() ) break;
}
}
}
}
std::cout<<"...................\n";
StoreWords();
}
/*
Function prototype:
bool WebSearch::IsUnique(string)
Function description:
Takes a url as input and checks if that url has already been added to queue.
If it has already been added returns false. Otherwise returns true.
Example:
WebSearch *newSearch = new WebSearch;
newSearch.IsUnique("http://www.google.com");
Pre-conditions: a valid url must be entered as string
Post-conditions: returns true or false
*/
bool WebSearch::IsUnique(std::string url) {
bool unique = true;
std::queue<std::string> tempQueue;
std::string dqURL;
// copy queue to temp location
while(!urlList.empty()) {
dqURL = urlList.front();
urlList.pop();
tempQueue.push(dqURL);
}
// check if url has already been added
while(!tempQueue.empty()) {
dqURL = tempQueue.front();
tempQueue.pop();
if(dqURL == url)
unique = false;
urlList.push(dqURL); // copy back to original queue
}
return unique;
}
/*
Function prototype:
void WebSearch::PrintHTML(string)
Function description:
PrintHTML accepts the url of a website and prints out the associated HTML code to std out
Format of url is http://www."remainder of address"
Example:
WebSearch *newSearch = new WebSearch;
newSearch.PrintHTML("http://www.google.com");
Pre-conditions: a valid url must be entered as string
Post-conditions: prints the html code to std out
*/
void WebSearch::PrintHTML(std::string url) {
std::string valid = "http://";
std::string check(url, 0, 7); //writes the first 11 characters of url to string check
// Check if a valid url was entered
if(valid.compare(check) != 0) {
std::cout<<"invalid url\n"<<"url must begin with http://\n";
return;
}
using namespace boost::network;
try {
http::client client;
http::client::request request(url);
request << header("Connection", "close");
http::client::response response = client.get(request);
std::cout << body(response) << std::endl;
}
catch(boost::system::system_error const& ec) {
std::cout<<"Connection error to url: "<<url<<std::endl;
return;
}
catch(std::bad_alloc& ba) {
std::cout<<"Allocation error with:"<<url<<std::endl;
return;
}
catch (const std::length_error& le) {
std::cout<<"Length error with:"<<url<<std::endl;
return;
}
}
/*
Function prototype:
void WebSearch::PrintURLs()
Function description:
Prints all saved urls while preserving the original queue
Example:
WebSearch *newSearch = new WebSearch;
newSearch.PrintURLs();
Pre-conditions: Must have initialized search with BuildQueue function
Post-conditions: prints all saved urls or error message
*/
void WebSearch::PrintURLs() {
std::queue<std::string> tempQueue;
std::string dqURL;
if(urlList.empty())
std::cout<<"No urls in queue, they have already been processed or not yet stored\n";
// copy queue to temp location
while(!urlList.empty()) {
dqURL = urlList.front();
urlList.pop();
tempQueue.push(dqURL);
}
// Print all queued urls
while(!tempQueue.empty()) {
dqURL = tempQueue.front();
tempQueue.pop();
std::cout<<dqURL<<std::endl;
urlList.push(dqURL);
}
}
/*
Function prototype:
void WebSearch::StoreWords()
Function description:
Processes each URL in the queue for words. Function stores each word and the
number of times that word occurs in each website
Example:
WebSearch *newSearch = new WebSearch;
newSearch.StoreWords();
Pre-conditions: Must have at least one url stored in queue
Post-conditions: Displays each site as it is processed, creates hash table of stored words
*/
void WebSearch::StoreWords() {
using namespace boost::network;
if(urlList.empty()) {
std::cout<<"There are no URLs to process for words.\n";
return;
}
std::string url;
bool scan;
std::queue<std::string> temp;
while(!urlList.empty()) {
scan = true;
url = urlList.front();
urlList.pop();
temp.push(url);
usleep(200000); // .2 second delay
// create connection to url and save html code to a text file
try {
std::cout<<"Processing: "<<url<<" for words\n";
http::client client;
http::client::request request(url);
request << header("Connection", "close");
http::client::response response = client.get(request);
remove("temp.txt"); // delete old temporary text file
std::ofstream tempOut("temp.txt");
if(tempOut.is_open()) {
tempOut << body(response);
tempOut << "\n";
}
tempOut.close();
}
catch(boost::system::system_error const& ec) {
std::cout<<"Connection error to url: "<<url<<std::endl;
std::cout<<"Remainder of URLs will process\n";
scan = false;
}
catch(std::bad_alloc& ba) {
std::cout<<"Allocation error with:"<<url<<std::endl;
std::cout<<"Remainder of URLs will process\n";
scan = false;
}
catch (const std::length_error& le) {
std::cout<<"Length error with:"<<url<<std::endl;
std::cout<<"Remainder of URLs will process\n";
scan = false;
}
if(scan == true) {
// open the text file and scan for urls
std::ifstream tempIn("temp.txt");
if(!tempIn.is_open())
std::cout<<"Error opening file\n";
else {
std::string temp;
int i = 0;
while(getline(tempIn,temp,' ')) {
i++;
hTable.Insert(temp,url); // store the word and related url in hash table
if( tempIn.eof() ) break;
}
std::cout<<"\t found:"<<i<<" words"<<std::endl;
}
}
}
// copy urls back to original queue
while(!temp.empty()) {
url = temp.front();
temp.pop();
urlList.push(url);
}
}
/*
Function prototype:
void WebSearch::PrintWords()
Function description:
Prints all stored words
Example:
WebSearch *newSearch = new WebSearch;
newSearch.PrintWords();
Pre-conditions: Must have words stored hash table
Post-conditions: Displays all stored words to std out
*/
void WebSearch::PrintWords() {
hTable.Print();
}
/*
Function prototype:
void WebSearch::FindWebsite(string)
Function description:
Searches for the website that contains the highest occurence of a user specifed word
Prints the found website url
Example:
WebSearch *newSearch = new WebSearch;
newSearch.FindWebsite("it");
Pre-conditions: Must have words stored hash table
Post-conditions: Prints address of URL with highest occurence of word
*/
void WebSearch::FindWebsite(std::string word) {
hTable.Find(word);
}
/*
Function prototype:
void WebSearch::ClearAll()
Function description:
Deletes all stored words and URLs
Example:
WebSearch *newSearch = new WebSearch;
newSearch.ClearAll();
Pre-conditions: Must initialized queue and have words stored in hashtable
Post-conditions: Deletes all stored values
*/
void WebSearch::ClearAll() {
// clear hash table values
hTable.Clear();
// clear queue of saved urls
while(!urlList.empty()) {
urlList.pop();
}
}