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
|
// fts_search.h
/**
* Copyright (C) 2012 10gen Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* This program 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the GNU Affero General Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#pragma once
#include <map>
#include <set>
#include <vector>
#include <queue>
#include "mongo/base/disallow_copying.h"
#include "mongo/db/fts/fts_matcher.h"
#include "mongo/db/fts/fts_query.h"
#include "mongo/db/fts/fts_util.h"
#include "mongo/db/index/index_descriptor.h"
#include "mongo/db/matcher.h"
namespace mongo {
class BtreeCursor;
namespace fts {
// priority queue template, for use when we're populating results
// vector returned to the user. extends the default priority_queue
// by providing direct access to the underlying vector, which should
// be used CAREFULLY because you can get into trouble..
template <class T, class S, class C>
class a_priority_queue : public std::priority_queue<T, S, C> {
public:
// return the value of an element at position n when we call pq[n]
T operator[](const int &n) { return this->c[n]; }
// return underlying data structure. called dangerous because it is.
S dangerous() { return this->c; }
};
typedef a_priority_queue<ScoredLocation, vector<ScoredLocation>, ScoredLocationComp> Results;
class FTSSearch {
MONGO_DISALLOW_COPYING(FTSSearch);
public:
typedef std::map<Record*,double> Scores;
FTSSearch( IndexDescriptor* descriptor,
const FTSSpec& ftsSpec,
const BSONObj& indexPrefix,
const FTSQuery& query,
const BSONObj& filter );
void go(Results* results, unsigned limit );
long long getKeysLookedAt() const { return _keysLookedAt; }
long long getObjLookedAt() const { return _objectsLookedAt; }
private:
void _process( BtreeCursor* cursor );
/**
* checks not index pieces
* i.e. prhases & negated terms
*/
bool _ok( Record* record ) const;
IndexDescriptor* _descriptor;
const FTSSpec& _ftsSpec;
BSONObj _indexPrefix;
FTSQuery _query;
FTSMatcher _ftsMatcher;
scoped_ptr<CoveredIndexMatcher> _matcher;
long long _keysLookedAt;
long long _objectsLookedAt;
Scores _scores;
};
} // namespace fts
} // namespace mongo
|
