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
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
|
/**
* Copyright (C) 2014 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.
*/
/**
* This file tests near search functionality.
*/
#include "mongo/platform/basic.h"
#include "mongo/base/owned_pointer_vector.h"
#include "mongo/db/client.h"
#include "mongo/db/exec/near.h"
#include "mongo/db/exec/queued_data_stage.h"
#include "mongo/db/exec/working_set_common.h"
#include "mongo/stdx/memory.h"
#include "mongo/unittest/unittest.h"
namespace {
using namespace mongo;
using std::shared_ptr;
using std::unique_ptr;
using std::vector;
using stdx::make_unique;
class QueryStageNearTest : public unittest::Test {
protected:
const ServiceContext::UniqueOperationContext _uniqOpCtx = cc().makeOperationContext();
OperationContext* const _opCtx = _uniqOpCtx.get();
};
/**
* Stage which implements a basic distance search, and interprets the "distance" field of
* fetched documents as the distance.
*/
class MockNearStage final : public NearStage {
public:
struct MockInterval {
MockInterval(const vector<BSONObj>& data, double min, double max)
: data(data), min(min), max(max) {}
vector<BSONObj> data;
double min;
double max;
};
MockNearStage(OperationContext* opCtx, WorkingSet* workingSet)
: NearStage(opCtx, "MOCK_DISTANCE_SEARCH_STAGE", STAGE_UNKNOWN, workingSet, NULL),
_pos(0) {}
void addInterval(vector<BSONObj> data, double min, double max) {
_intervals.mutableVector().push_back(new MockInterval(data, min, max));
}
virtual StatusWith<CoveredInterval*> nextInterval(OperationContext* txn,
WorkingSet* workingSet,
Collection* collection) {
if (_pos == static_cast<int>(_intervals.size()))
return StatusWith<CoveredInterval*>(NULL);
const MockInterval& interval = *_intervals.vector()[_pos++];
bool lastInterval = _pos == static_cast<int>(_intervals.vector().size());
auto queuedStage = make_unique<QueuedDataStage>(txn, workingSet);
for (unsigned int i = 0; i < interval.data.size(); i++) {
// Add all documents from the lastInterval into the QueuedDataStage.
const WorkingSetID id = workingSet->allocate();
WorkingSetMember* member = workingSet->get(id);
member->obj = Snapshotted<BSONObj>(SnapshotId(), interval.data[i]);
workingSet->transitionToOwnedObj(id);
queuedStage->pushBack(id);
}
_children.push_back(std::move(queuedStage));
return StatusWith<CoveredInterval*>(new CoveredInterval(
_children.back().get(), true, interval.min, interval.max, lastInterval));
}
StatusWith<double> computeDistance(WorkingSetMember* member) final {
ASSERT(member->hasObj());
return StatusWith<double>(member->obj.value()["distance"].numberDouble());
}
virtual StageState initialize(OperationContext* txn,
WorkingSet* workingSet,
Collection* collection,
WorkingSetID* out) {
return IS_EOF;
}
private:
OwnedPointerVector<MockInterval> _intervals;
int _pos;
};
static vector<BSONObj> advanceStage(PlanStage* stage, WorkingSet* workingSet) {
vector<BSONObj> results;
WorkingSetID nextMemberID;
PlanStage::StageState state = PlanStage::NEED_TIME;
while (PlanStage::NEED_TIME == state) {
while (PlanStage::ADVANCED == (state = stage->work(&nextMemberID))) {
results.push_back(workingSet->get(nextMemberID)->obj.value());
}
}
return results;
}
static void assertAscendingAndValid(const vector<BSONObj>& results) {
double lastDistance = -1.0;
for (vector<BSONObj>::const_iterator it = results.begin(); it != results.end(); ++it) {
double distance = (*it)["distance"].numberDouble();
bool shouldInclude = (*it)["$included"].eoo() || (*it)["$included"].trueValue();
ASSERT(shouldInclude);
ASSERT_GREATER_THAN_OR_EQUALS(distance, lastDistance);
lastDistance = distance;
}
}
TEST_F(QueryStageNearTest, Basic) {
vector<BSONObj> mockData;
WorkingSet workingSet;
MockNearStage nearStage(_opCtx, &workingSet);
// First set of results
mockData.clear();
mockData.push_back(BSON("distance" << 0.5));
// Not included in this interval, but will be buffered and included in the last interval
mockData.push_back(BSON("distance" << 2.0));
mockData.push_back(BSON("distance" << 0.0));
mockData.push_back(BSON("distance" << 3.5)); // Not included
nearStage.addInterval(mockData, 0.0, 1.0);
// Second set of results
mockData.clear();
mockData.push_back(BSON("distance" << 1.5));
mockData.push_back(BSON("distance" << 0.5)); // Not included
mockData.push_back(BSON("distance" << 1.0));
nearStage.addInterval(mockData, 1.0, 2.0);
// Last set of results
mockData.clear();
mockData.push_back(BSON("distance" << 2.5));
mockData.push_back(BSON("distance" << 3.0)); // Included
mockData.push_back(BSON("distance" << 2.0));
mockData.push_back(BSON("distance" << 3.5)); // Not included
nearStage.addInterval(mockData, 2.0, 3.0);
vector<BSONObj> results = advanceStage(&nearStage, &workingSet);
ASSERT_EQUALS(results.size(), 8u);
assertAscendingAndValid(results);
}
TEST_F(QueryStageNearTest, EmptyResults) {
vector<BSONObj> mockData;
WorkingSet workingSet;
MockNearStage nearStage(_opCtx, &workingSet);
// Empty set of results
mockData.clear();
nearStage.addInterval(mockData, 0.0, 1.0);
// Non-empty set of results
mockData.clear();
mockData.push_back(BSON("distance" << 1.5));
mockData.push_back(BSON("distance" << 2.0));
mockData.push_back(BSON("distance" << 1.0));
nearStage.addInterval(mockData, 1.0, 2.0);
vector<BSONObj> results = advanceStage(&nearStage, &workingSet);
ASSERT_EQUALS(results.size(), 3u);
assertAscendingAndValid(results);
}
}
|