1 |
/* ============================================================================ |
2 |
* Douglas Thrift's Search Engine License |
3 |
* |
4 |
* Copyright (C) 2002-2003, Douglas Thrift. All Rights Reserved. |
5 |
* Redistribution and use in source and binary forms, with or without |
6 |
* modification, are permitted provided that the following conditions are met: |
7 |
* |
8 |
* 1. Redistributions of source code must retain the above copyright notice, |
9 |
* this list of conditions and the following disclaimer. |
10 |
* |
11 |
* 2. Redistributions in binary form must reproduce the above copyright notice, |
12 |
* this list of conditions and the following disclaimer in the documentation |
13 |
* and/or other materials provided with the distribution. |
14 |
* |
15 |
* 3. The end-user documentation included with the redistribution, if any, must |
16 |
* include the following acknowledgment: |
17 |
* |
18 |
* "This product includes software developed by Douglas Thrift |
19 |
* (http://computers.douglasthrift.net/searchengine/)." |
20 |
* |
21 |
* Alternately, this acknowledgment may appear in the software itself, if |
22 |
* and wherever such third-party acknowledgments normally appear. |
23 |
* |
24 |
* 4. The names "Douglas Thrift" and "Douglas Thrift's Search Engine" must not |
25 |
* be used to endorse or promote products derived from this software without |
26 |
* specific prior written permission. For written permission, please visit |
27 |
* http://www.douglasthrift.net/contact.cgi for contact information. |
28 |
* |
29 |
* 5. Products derived from this software may not be called "Douglas Thrift's |
30 |
* Search Engine", nor may "Douglas Thrift's Search Engine" appear in their |
31 |
* name, without prior written permission. |
32 |
* |
33 |
* THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, |
34 |
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND |
35 |
* FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE |
36 |
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, |
37 |
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
38 |
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, |
39 |
* OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF |
40 |
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING |
41 |
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, |
42 |
* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
43 |
* ============================================================================ |
44 |
*/ |
45 |
// Douglas Thrift's Search Engine Searcher |
46 |
// |
47 |
// Douglas Thrift |
48 |
// |
49 |
// $Id: Searcher.h,v 1.3 2003/07/11 07:54:47 douglas Exp $ |
50 |
|
51 |
#ifndef _Searcher_h_ |
52 |
#define _Searcher_h_ |
53 |
|
54 |
#include "Search.h" |
55 |
#include "Page.h" |
56 |
#include "URL.h" |
57 |
#include "Ranker.h" |
58 |
|
59 |
typedef multiset<Ranker, greater<Ranker> > MultiSet; |
60 |
typedef multiset<Ranker, greater<Ranker> >::iterator MultiSetIterator; |
61 |
|
62 |
class Searcher |
63 |
{ |
64 |
private: |
65 |
string queryString; |
66 |
vector<string> query; |
67 |
MultiSet pages; |
68 |
set<string> common; |
69 |
vector<string> commonUsed; |
70 |
bool and_; |
71 |
bool or_; |
72 |
string ignore; |
73 |
clock_t start; |
74 |
clock_t finish; |
75 |
void search(Page& page); |
76 |
void setQuery(); |
77 |
void setCommon(); |
78 |
void setAnd(bool answer) { and_ = answer; } |
79 |
void setOr(bool answer) { or_ = answer; } |
80 |
void setIgnore(string& ignore) { this->ignore = ignore; } |
81 |
public: |
82 |
Searcher(string& queryString); |
83 |
~Searcher() {} |
84 |
void search(vector<string> indices); |
85 |
vector<string> getQuery() { return query; } |
86 |
vector<string> getCommonUsed() { return commonUsed; } |
87 |
bool getAnd() { return and_; } |
88 |
bool getOr() { return or_; } |
89 |
string getIgnore() { return ignore; } |
90 |
string getQueryString() { return queryString; } |
91 |
MultiSet& getPages() { return pages; } |
92 |
double time() { return double(finish - start) / double(CLOCKS_PER_SEC); } |
93 |
}; |
94 |
|
95 |
#endif // _Searcher_h_ |