xref: /AOO41X/main/xmlhelp/source/cxxhelp/inc/qe/Query.hxx (revision cdf0e10c4e3984b49a9502b011690b615761d4a3)
1*cdf0e10cSrcweir /*************************************************************************
2*cdf0e10cSrcweir  *
3*cdf0e10cSrcweir  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4*cdf0e10cSrcweir  *
5*cdf0e10cSrcweir  * Copyright 2000, 2010 Oracle and/or its affiliates.
6*cdf0e10cSrcweir  *
7*cdf0e10cSrcweir  * OpenOffice.org - a multi-platform office productivity suite
8*cdf0e10cSrcweir  *
9*cdf0e10cSrcweir  * This file is part of OpenOffice.org.
10*cdf0e10cSrcweir  *
11*cdf0e10cSrcweir  * OpenOffice.org is free software: you can redistribute it and/or modify
12*cdf0e10cSrcweir  * it under the terms of the GNU Lesser General Public License version 3
13*cdf0e10cSrcweir  * only, as published by the Free Software Foundation.
14*cdf0e10cSrcweir  *
15*cdf0e10cSrcweir  * OpenOffice.org is distributed in the hope that it will be useful,
16*cdf0e10cSrcweir  * but WITHOUT ANY WARRANTY; without even the implied warranty of
17*cdf0e10cSrcweir  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
18*cdf0e10cSrcweir  * GNU Lesser General Public License version 3 for more details
19*cdf0e10cSrcweir  * (a copy is included in the LICENSE file that accompanied this code).
20*cdf0e10cSrcweir  *
21*cdf0e10cSrcweir  * You should have received a copy of the GNU Lesser General Public License
22*cdf0e10cSrcweir  * version 3 along with OpenOffice.org.  If not, see
23*cdf0e10cSrcweir  * <http://www.openoffice.org/license.html>
24*cdf0e10cSrcweir  * for a copy of the LGPLv3 License.
25*cdf0e10cSrcweir  *
26*cdf0e10cSrcweir  ************************************************************************/
27*cdf0e10cSrcweir #ifndef _XMLSEARCH_QE_QUERY_HXX_
28*cdf0e10cSrcweir #define _XMLSEARCH_QE_QUERY_HXX_
29*cdf0e10cSrcweir 
30*cdf0e10cSrcweir #include <sal/types.h>
31*cdf0e10cSrcweir #include <rtl/memory.h>
32*cdf0e10cSrcweir #include <rtl/ustring.hxx>
33*cdf0e10cSrcweir #include <vector>
34*cdf0e10cSrcweir 
35*cdf0e10cSrcweir 
36*cdf0e10cSrcweir namespace xmlsearch {
37*cdf0e10cSrcweir 
38*cdf0e10cSrcweir 	namespace qe {
39*cdf0e10cSrcweir 
40*cdf0e10cSrcweir 		class Search;
41*cdf0e10cSrcweir 		class RoleFiller;
42*cdf0e10cSrcweir 
43*cdf0e10cSrcweir 		class QueryHit
44*cdf0e10cSrcweir 		{
45*cdf0e10cSrcweir 		public:
46*cdf0e10cSrcweir 
47*cdf0e10cSrcweir 			QueryHit( sal_Int32 nColumns,double penalty,sal_Int32 doc,sal_Int32 begin,sal_Int32 end )
48*cdf0e10cSrcweir 				: doc_( doc ),
49*cdf0e10cSrcweir 				  begin_( begin ),
50*cdf0e10cSrcweir 				  end_( end ),
51*cdf0e10cSrcweir   				  matchesL_( 2*nColumns ),
52*cdf0e10cSrcweir   				  matches_( new sal_Int32[ 2*nColumns ] ),
53*cdf0e10cSrcweir                   penalty_( penalty )
54*cdf0e10cSrcweir 			{
55*cdf0e10cSrcweir 				rtl_zeroMemory( matches_,sizeof( sal_Int32 ) * matchesL_ );
56*cdf0e10cSrcweir 			}
57*cdf0e10cSrcweir 
58*cdf0e10cSrcweir 			~QueryHit() { delete[] matches_; }
59*cdf0e10cSrcweir 
60*cdf0e10cSrcweir 			sal_Int32 getDocument() const { return doc_; }
61*cdf0e10cSrcweir 
62*cdf0e10cSrcweir 			sal_Int32 countOfMatches() const { return matchesL_; }
63*cdf0e10cSrcweir 
64*cdf0e10cSrcweir 			sal_Int32 getBegin() const { return begin_; }
65*cdf0e10cSrcweir 
66*cdf0e10cSrcweir 			sal_Int32 getEnd() const { return end_; }
67*cdf0e10cSrcweir 
68*cdf0e10cSrcweir 			double getPenalty() const { return penalty_; }
69*cdf0e10cSrcweir 
70*cdf0e10cSrcweir 			bool betterThan( const QueryHit* o )
71*cdf0e10cSrcweir 			{
72*cdf0e10cSrcweir 				if( penalty_ != o->penalty_ )
73*cdf0e10cSrcweir 					return penalty_ < o->penalty_;
74*cdf0e10cSrcweir 				else if( begin_ != o->begin_ )
75*cdf0e10cSrcweir 					return begin_ < o->begin_;
76*cdf0e10cSrcweir 				else if( end_ != o->end_ )
77*cdf0e10cSrcweir 					return end_ < o->end_;
78*cdf0e10cSrcweir 				else
79*cdf0e10cSrcweir 					return false;
80*cdf0e10cSrcweir 			}
81*cdf0e10cSrcweir 
82*cdf0e10cSrcweir 			bool worseThan( const QueryHit* o )
83*cdf0e10cSrcweir 			{
84*cdf0e10cSrcweir 				if( penalty_ != o->penalty_ )
85*cdf0e10cSrcweir 					return penalty_ > o->penalty_;
86*cdf0e10cSrcweir 				else if( begin_ != o->begin_ )
87*cdf0e10cSrcweir 					return begin_ > o->begin_;
88*cdf0e10cSrcweir 				else if( end_ != o->end_ )
89*cdf0e10cSrcweir 					return end_ > o->end_;
90*cdf0e10cSrcweir 				else
91*cdf0e10cSrcweir 					return false;
92*cdf0e10cSrcweir 			}
93*cdf0e10cSrcweir 
94*cdf0e10cSrcweir 			bool worseThan( double penalty,sal_Int32 begin,sal_Int32 end )
95*cdf0e10cSrcweir 			{
96*cdf0e10cSrcweir 				if( penalty_ != penalty )
97*cdf0e10cSrcweir 					return penalty_ > penalty;
98*cdf0e10cSrcweir 				else if( begin_ != begin )
99*cdf0e10cSrcweir 					return begin_ > begin;
100*cdf0e10cSrcweir 				else if( end_ != end )
101*cdf0e10cSrcweir 					return end_ > end;
102*cdf0e10cSrcweir 				else
103*cdf0e10cSrcweir 					return false;
104*cdf0e10cSrcweir 			}
105*cdf0e10cSrcweir 
106*cdf0e10cSrcweir 			bool compareTo( const QueryHit* o ) const
107*cdf0e10cSrcweir 			{
108*cdf0e10cSrcweir 				if( penalty_ != o->penalty_ )
109*cdf0e10cSrcweir 					return penalty_ < o->penalty_;
110*cdf0e10cSrcweir 				else if( begin_ != o->begin_ )
111*cdf0e10cSrcweir 					return begin_ < o->begin_;
112*cdf0e10cSrcweir 				else if( end_ != o->end_ )
113*cdf0e10cSrcweir 					return end_ < o->end_;
114*cdf0e10cSrcweir 				else
115*cdf0e10cSrcweir 					return false;
116*cdf0e10cSrcweir 			}
117*cdf0e10cSrcweir 
118*cdf0e10cSrcweir 
119*cdf0e10cSrcweir 		private:
120*cdf0e10cSrcweir 
121*cdf0e10cSrcweir 			sal_Int32    doc_,begin_,end_;
122*cdf0e10cSrcweir 
123*cdf0e10cSrcweir   			sal_Int32    matchesL_;
124*cdf0e10cSrcweir   			sal_Int32    *matches_;    // ...concept, word number, ...
125*cdf0e10cSrcweir 
126*cdf0e10cSrcweir 			double penalty_;
127*cdf0e10cSrcweir 
128*cdf0e10cSrcweir 		}; // end class QueryHit
129*cdf0e10cSrcweir 
130*cdf0e10cSrcweir 
131*cdf0e10cSrcweir 
132*cdf0e10cSrcweir 		class QueryHitData
133*cdf0e10cSrcweir 		{
134*cdf0e10cSrcweir 		public:
135*cdf0e10cSrcweir 
136*cdf0e10cSrcweir 			QueryHitData( double penalty,const rtl::OUString& document,sal_Int32 termsL, rtl::OUString* terms )
137*cdf0e10cSrcweir 				: penalty_( penalty ),
138*cdf0e10cSrcweir 				  document_( document ),
139*cdf0e10cSrcweir 				  termsL_( termsL ),
140*cdf0e10cSrcweir 				  terms_( terms )      { }
141*cdf0e10cSrcweir 
142*cdf0e10cSrcweir 			~QueryHitData() { delete[] terms_; }
143*cdf0e10cSrcweir 
144*cdf0e10cSrcweir 			rtl::OUString getDocument() const { return document_; }
145*cdf0e10cSrcweir 
146*cdf0e10cSrcweir 			double getPenalty() const { return penalty_; }
147*cdf0e10cSrcweir 
148*cdf0e10cSrcweir 
149*cdf0e10cSrcweir 		private:
150*cdf0e10cSrcweir 
151*cdf0e10cSrcweir 			double        penalty_;
152*cdf0e10cSrcweir 
153*cdf0e10cSrcweir 			const rtl::OUString document_;
154*cdf0e10cSrcweir 
155*cdf0e10cSrcweir 			sal_Int32      termsL_;
156*cdf0e10cSrcweir 			rtl::OUString* terms_;
157*cdf0e10cSrcweir 
158*cdf0e10cSrcweir 		};  // end class QueryHitData
159*cdf0e10cSrcweir 
160*cdf0e10cSrcweir 
161*cdf0e10cSrcweir 		class PrefixTranslator
162*cdf0e10cSrcweir 		{
163*cdf0e10cSrcweir 		public:
164*cdf0e10cSrcweir 
165*cdf0e10cSrcweir 			static PrefixTranslator* makePrefixTranslator( const rtl::OUString*,sal_Int32 )
166*cdf0e10cSrcweir 			{
167*cdf0e10cSrcweir 				return 0;
168*cdf0e10cSrcweir 			}
169*cdf0e10cSrcweir 		};
170*cdf0e10cSrcweir 	}
171*cdf0e10cSrcweir 
172*cdf0e10cSrcweir }
173*cdf0e10cSrcweir 
174*cdf0e10cSrcweir 
175*cdf0e10cSrcweir #endif
176