Search/trunk/Ranker.hpp

/* ============================================================================
 * Douglas Thrift's Search Engine License
 *
 * Copyright (C) 2002-2004, 2008, Douglas Thrift. All Rights Reserved.
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright notice,
 *    this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 *
 * 3. The end-user documentation included with the redistribution, if any, must
 *    include the following acknowledgment:
 *
 *       "This product includes software developed by Douglas Thrift
 *       (http://computers.douglasthrift.net/searchengine/)."
 *
 *    Alternately, this acknowledgment may appear in the software itself, if
 *    and wherever such third-party acknowledgments normally appear.
 *
 * 4. The names "Douglas Thrift" and "Douglas Thrift's Search Engine" must not
 *    be used to endorse or promote products derived from this software without
 *    specific prior written permission.  For written permission, please visit
 *    http://www.douglasthrift.net/contact.cgi for contact information.
 *
 * 5. Products derived from this software may not be called "Douglas Thrift's
 *    Search Engine", nor may "Douglas Thrift's Search Engine" appear in their
 *    name, without prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
 * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
 * OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 * ============================================================================
 */
// Douglas Thrift's Search Engine Ranker
//
// Douglas Thrift
//
// $Id$

#ifndef _Ranker_hpp_
#define _Ranker_hpp_

#include "Search.hpp"
#include "Page.hpp"

class Ranker : public Page
{
private:
        typedef map<size_t, size_t> Map;
        enum state { all, title, url, text };
        enum { sampleMax = 160 };
        string sample;
        Map occurrencesTitle;
        Map occurrencesDescription;
        Map occurrencesText;
        size_t value;
        vector<string> required;
        vector<string> excluded;
        vector<string> eitherOr;
        size_t requiredValue;
        size_t excludedValue;
        size_t eitherOrValue;
        string site;
        state allIn;
        string lowerURL;
        string lowerAddress;
        string lowerTitle;
        string lowerText;
        void rank();
        void checkRequired();
        void checkExcluded();
        void checkEitherOr();
        size_t find(string word, const string& where);
        size_t find(string word, const string& where, Map& occurrences);
        size_t phrase(const string& phrase, const string& where);
        size_t phrase(const string& phrase, const string& where,
                Map& occurrences);
        size_t phrase(const vector<string>& words, size_t word,
                size_t& begin, bool start, const string& where);
        size_t phrase(const vector<string>& words, size_t word,
                size_t& begin, bool start, const string& where, Map& occurrences);
        size_t evaluate(vector<size_t>& ins);
        void decrap(string& crap);
public:
        Ranker(Page& page) : Page(page), value(0), requiredValue(0),
                excludedValue(0), eitherOrValue(0), allIn(all) {}
        ~Ranker() {}
        void rank(vector<string> query);
        void setSample();
        string getTitle();
        string getDescription();
        string& getSample() { return sample; }
        bool operator==(const size_t number) const;
        bool operator==(const Ranker& ranker) const;
        bool operator!=(const size_t number) const;
        bool operator!=(const Ranker& ranker) const;
        bool operator<(const size_t number) const;
        bool operator<(const Ranker& ranker) const;
        bool operator>(const size_t number) const;
        bool operator>(const Ranker& ranker) const;
        bool operator<=(const size_t number) const
        {
                return *this == number || *this < number;
        }
        bool operator<=(const Ranker& ranker) const
        {
                return *this == ranker || *this < ranker;
        }
        bool operator>=(const size_t number) const
        {
                return *this == number || *this > number;
        }
        bool operator>=(const Ranker& ranker) const
        {
                return *this == ranker || *this > ranker;
        }
// friends:
        friend bool operator==(const size_t number, const Ranker& ranker)
        {
                return ranker == number;
        }
        friend bool operator!=(const size_t number, const Ranker& ranker)
        {
                return ranker != number;
        }
        friend bool operator>(const size_t number, const Ranker& ranker)
        {
                return ranker < number;
        }
        friend bool operator<(const size_t number, const Ranker& ranker)
        {
                return ranker > number;
        }
        friend bool operator>=(const size_t number, const Ranker& ranker)
        {
                return ranker <= number;
        }
        friend bool operator<=(const size_t number, const Ranker& ranker)
        {
                return ranker >= number;
        }
};

#endif // _Ranker_h_
Revision:	372
Committed:	2008-08-23T04:00:12-07:00 (16 years, 9 months ago) by douglas
File size:	5407 byte(s)
Log Message:	Update copyright dates.
#	Content
1	/* ============================================================================
2	* Douglas Thrift's Search Engine License
3	*
4	* Copyright (C) 2002-2004, 2008, 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 Ranker
46	//
47	// Douglas Thrift
48	//
49	// $Id$
50
51	#ifndef _Ranker_hpp_
52	#define _Ranker_hpp_
53
54	#include "Search.hpp"
55	#include "Page.hpp"
56
57	class Ranker : public Page
58	{
59	private:
60	typedef map<size_t, size_t> Map;
61	enum state { all, title, url, text };
62	enum { sampleMax = 160 };
63	string sample;
64	Map occurrencesTitle;
65	Map occurrencesDescription;
66	Map occurrencesText;
67	size_t value;
68	vector<string> required;
69	vector<string> excluded;
70	vector<string> eitherOr;
71	size_t requiredValue;
72	size_t excludedValue;
73	size_t eitherOrValue;
74	string site;
75	state allIn;
76	string lowerURL;
77	string lowerAddress;
78	string lowerTitle;
79	string lowerText;
80	void rank();
81	void checkRequired();
82	void checkExcluded();
83	void checkEitherOr();
84	size_t find(string word, const string& where);
85	size_t find(string word, const string& where, Map& occurrences);
86	size_t phrase(const string& phrase, const string& where);
87	size_t phrase(const string& phrase, const string& where,
88	Map& occurrences);
89	size_t phrase(const vector<string>& words, size_t word,
90	size_t& begin, bool start, const string& where);
91	size_t phrase(const vector<string>& words, size_t word,
92	size_t& begin, bool start, const string& where, Map& occurrences);
93	size_t evaluate(vector<size_t>& ins);
94	void decrap(string& crap);
95	public:
96	Ranker(Page& page) : Page(page), value(0), requiredValue(0),
97	excludedValue(0), eitherOrValue(0), allIn(all) {}
98	~Ranker() {}
99	void rank(vector<string> query);
100	void setSample();
101	string getTitle();
102	string getDescription();
103	string& getSample() { return sample; }
104	bool operator==(const size_t number) const;
105	bool operator==(const Ranker& ranker) const;
106	bool operator!=(const size_t number) const;
107	bool operator!=(const Ranker& ranker) const;
108	bool operator<(const size_t number) const;
109	bool operator<(const Ranker& ranker) const;
110	bool operator>(const size_t number) const;
111	bool operator>(const Ranker& ranker) const;
112	bool operator<=(const size_t number) const
113	{
114	return this == number \|\| this < number;
115	}
116	bool operator<=(const Ranker& ranker) const
117	{
118	return this == ranker \|\| this < ranker;
119	}
120	bool operator>=(const size_t number) const
121	{
122	return this == number \|\| this > number;
123	}
124	bool operator>=(const Ranker& ranker) const
125	{
126	return this == ranker \|\| this > ranker;
127	}
128	// friends:
129	friend bool operator==(const size_t number, const Ranker& ranker)
130	{
131	return ranker == number;
132	}
133	friend bool operator!=(const size_t number, const Ranker& ranker)
134	{
135	return ranker != number;
136	}
137	friend bool operator>(const size_t number, const Ranker& ranker)
138	{
139	return ranker < number;
140	}
141	friend bool operator<(const size_t number, const Ranker& ranker)
142	{
143	return ranker > number;
144	}
145	friend bool operator>=(const size_t number, const Ranker& ranker)
146	{
147	return ranker <= number;
148	}
149	friend bool operator<=(const size_t number, const Ranker& ranker)
150	{
151	return ranker >= number;
152	}
153	};
154
155	#endif // _Ranker_h_