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
|
/**
* 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.
*/
#include "mongo/db/diskloc.h"
#include "mongo/db/geo/geoparser.h"
#include "mongo/db/geo/geoconstants.h"
#include "third_party/s2/s2.h"
#include "third_party/s2/s2regioncoverer.h"
#include "third_party/s2/s2cell.h"
#include "third_party/s2/s2polyline.h"
#include "third_party/s2/s2polygon.h"
#include "third_party/s2/s2regioncoverer.h"
#pragma once
namespace mongo {
struct S2IndexingParams {
// Since we take the cartesian product when we generate keys for an insert,
// we need a cap.
size_t maxKeysPerInsert;
// This is really an advisory parameter that we pass to the cover generator. The
// finest/coarsest index level determine the required # of cells.
int maxCellsInCovering;
// What's the finest grained level that we'll index? When we query for a point
// we start at that -- we index nothing finer than this.
int finestIndexedLevel;
// And, what's the coarsest? When we search in larger coverings we know we
// can stop here -- we index nothing coarser than this.
int coarsestIndexedLevel;
double radius;
string toString() const {
stringstream ss;
ss << "maxKeysPerInsert: " << maxKeysPerInsert << endl;
ss << "maxCellsInCovering: " << maxCellsInCovering << endl;
ss << "finestIndexedLevel: " << finestIndexedLevel << endl;
ss << "coarsestIndexedLevel: " << coarsestIndexedLevel << endl;
return ss.str();
}
void configureCoverer(S2RegionCoverer *coverer) const {
coverer->set_min_level(coarsestIndexedLevel);
coverer->set_max_level(finestIndexedLevel);
// This is advisory; the two above are strict.
coverer->set_max_cells(maxCellsInCovering);
}
};
class S2SearchUtil {
public:
// Given a coverer, region, and field name, generate a BSONObj that we can pass to a
// FieldRangeSet so that we only examine the keys that the provided region may intersect.
static BSONObj coverAsBSON(const vector<S2CellId> &cover, const string& field,
const int coarsestIndexedLevel);
static void setCoverLimitsBasedOnArea(double area, S2RegionCoverer *coverer, int coarsestIndexedLevel);
static bool getKeysForObject(const BSONObj& obj, const S2IndexingParams& params,
vector<string>* out);
static bool distanceBetween(const S2Point& us, const BSONObj& them,
const S2IndexingParams ¶ms, double *out);
};
} // namespace mongo
|
