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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: Query.hxx,v $
* $Revision: 1.4 $
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifndef _XMLSEARCH_QE_QUERY_HXX_
#define _XMLSEARCH_QE_QUERY_HXX_
#include <sal/types.h>
#include <rtl/memory.h>
#include <rtl/ustring.hxx>
#include <vector>
namespace xmlsearch {
namespace qe {
class Search;
class RoleFiller;
class QueryHit
{
public:
QueryHit( sal_Int32 nColumns,double penalty,sal_Int32 doc,sal_Int32 begin,sal_Int32 end )
: doc_( doc ),
begin_( begin ),
end_( end ),
matchesL_( 2*nColumns ),
matches_( new sal_Int32[ 2*nColumns ] ),
penalty_( penalty )
{
rtl_zeroMemory( matches_,sizeof( sal_Int32 ) * matchesL_ );
}
~QueryHit() { delete[] matches_; }
sal_Int32 getDocument() const { return doc_; }
sal_Int32 countOfMatches() const { return matchesL_; }
sal_Int32 getBegin() const { return begin_; }
sal_Int32 getEnd() const { return end_; }
double getPenalty() const { return penalty_; }
bool betterThan( const QueryHit* o )
{
if( penalty_ != o->penalty_ )
return penalty_ < o->penalty_;
else if( begin_ != o->begin_ )
return begin_ < o->begin_;
else if( end_ != o->end_ )
return end_ < o->end_;
else
return false;
}
bool worseThan( const QueryHit* o )
{
if( penalty_ != o->penalty_ )
return penalty_ > o->penalty_;
else if( begin_ != o->begin_ )
return begin_ > o->begin_;
else if( end_ != o->end_ )
return end_ > o->end_;
else
return false;
}
bool worseThan( double penalty,sal_Int32 begin,sal_Int32 end )
{
if( penalty_ != penalty )
return penalty_ > penalty;
else if( begin_ != begin )
return begin_ > begin;
else if( end_ != end )
return end_ > end;
else
return false;
}
bool compareTo( const QueryHit* o ) const
{
if( penalty_ != o->penalty_ )
return penalty_ < o->penalty_;
else if( begin_ != o->begin_ )
return begin_ < o->begin_;
else if( end_ != o->end_ )
return end_ < o->end_;
else
return false;
}
private:
sal_Int32 doc_,begin_,end_;
sal_Int32 matchesL_;
sal_Int32 *matches_; // ...concept, word number, ...
double penalty_;
}; // end class QueryHit
class QueryHitData
{
public:
QueryHitData( double penalty,const rtl::OUString& document,sal_Int32 termsL, rtl::OUString* terms )
: penalty_( penalty ),
document_( document ),
termsL_( termsL ),
terms_( terms ) { }
~QueryHitData() { delete[] terms_; }
rtl::OUString getDocument() const { return document_; }
double getPenalty() const { return penalty_; }
private:
double penalty_;
const rtl::OUString document_;
sal_Int32 termsL_;
rtl::OUString* terms_;
}; // end class QueryHitData
class PrefixTranslator
{
public:
static PrefixTranslator* makePrefixTranslator( const rtl::OUString*,sal_Int32 )
{
return 0;
}
};
}
}
#endif
|
