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
|
// fts_util.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/>.
*/
#pragma once
#include <string>
#include "mongo/db/hasher.h"
#include "mongo/db/jsobj.h"
#include "mongo/db/record.h"
#include "mongo/util/unordered_fast_key_table.h"
namespace mongo {
namespace fts {
extern const std::string WILDCARD;
extern const std::string INDEX_NAME;
/**
* destructive!
*/
inline void makeLower( std::string* s ) {
std::string::size_type sz = s->size();
for ( std::string::size_type i = 0; i < sz; i++ )
(*s)[i] = (char)tolower( (int)(*s)[i] );
}
/*
* ScoredLocation stores the total score for a document (record *) wrt a search
*
*/
struct ScoredLocation {
ScoredLocation( Record* r, double sc )
: rec(r), score(sc) {
}
Record* rec;
double score;
bool operator<( const ScoredLocation& other ) const {
if ( other.score < score )
return true;
if ( other.score > score )
return false;
return rec < other.rec;
}
};
// scored location comparison is done based on score
class ScoredLocationComp {
public:
bool operator() (const ScoredLocation& lhs, const ScoredLocation& rhs) const {
return (lhs.score > rhs.score);
}
};
struct _be_hash {
size_t operator()( const BSONElement& e ) const {
return static_cast<size_t>( BSONElementHasher::hash64( e, 17 ) );
}
};
struct _be_equals {
bool operator()( const BSONElement& a, const BSONElement& b ) const {
return a == b;
}
};
struct _be_convert {
BSONElement operator()( const BSONObj& o ) const {
const BSONElement& x = o.firstElement();
BSONElement y( x.rawdata() );
return y;
}
};
struct _be_convert_other {
BSONObj operator()( const BSONElement& e ) const {
return e.wrap();
}
};
template< typename V >
class BSONElementMap : public UnorderedFastKeyTable<BSONElement,
BSONObj,
V,
_be_hash,
_be_equals,
_be_convert,
_be_convert_other > {
};
}
}
|
