PlanStage::StageState S2NearStage::work(WorkingSetID* out) {
if (!_initted) { init(); }
if (_failed) {
mongoutils::str::stream ss;
ss << "unable to load geo index " << _params.indexKeyPattern;
Status status(ErrorCodes::IndexNotFound, ss);
*out = WorkingSetCommon::allocateStatusMember( _ws, status);
return PlanStage::FAILURE;
}
if (isEOF()) { return PlanStage::IS_EOF; }
++_commonStats.works;
// If we haven't opened up our very first ixscan+fetch children, do it. This is kind of
// heavy so we don't want to do it in the ctor.
if (!_worked) {
nextAnnulus();
_worked = true;
}
// If we're still reading results from the child, do that.
if (NULL != _child.get()) {
return addResultToQueue(out);
}
// Not reading results. Perhaps we're returning buffered results.
if (!_results.empty()) {
Result result = _results.top();
_results.pop();
*out = result.id;
// Remove from invalidation map.
WorkingSetMember* member = _ws->get(*out);
if (member->hasLoc()) {
unordered_map<DiskLoc, WorkingSetID, DiskLoc::Hasher>::iterator it
= _invalidationMap.find(member->loc);
verify(_invalidationMap.end() != it);
_invalidationMap.erase(it);
}
++_commonStats.advanced;
return PlanStage::ADVANCED;
}
// Not EOF, not reading results, not returning any buffered results. Look in the next shell
// for results.
nextAnnulus();
return PlanStage::NEED_TIME;
}
S2NearCursor::S2NearCursor(const BSONObj &keyPattern, const IndexDetails *details,
const BSONObj &query, const vector<GeoQueryField> &fields,
const S2IndexingParams ¶ms, int numWanted, double maxDistance)
: _details(details), _fields(fields), _params(params), _keyPattern(keyPattern),
_numToReturn(numWanted), _maxDistance(maxDistance) {
BSONObjBuilder geoFieldsToNuke;
for (size_t i = 0; i < _fields.size(); ++i) {
geoFieldsToNuke.append(_fields[i].field, "");
}
// false means we want to filter OUT geoFieldsToNuke, not filter to include only that.
_filteredQuery = query.filterFieldsUndotted(geoFieldsToNuke.obj(), false);
_matcher.reset(new CoveredIndexMatcher(_filteredQuery, keyPattern));
// More indexing machinery.
BSONObjBuilder specBuilder;
BSONObjIterator specIt(_keyPattern);
while (specIt.more()) {
BSONElement e = specIt.next();
specBuilder.append(e.fieldName(), 1);
}
BSONObj spec = specBuilder.obj();
_specForFRV = IndexSpec(spec);
// Start with a conservative _radiusIncrement.
_radiusIncrement = S2::kAvgEdge.GetValue(_params.finestIndexedLevel) * _params.radius;
_innerRadius = _outerRadius = 0;
// Set up _outerRadius with proper checks (maybe maxDistance is really small?)
nextAnnulus();
}
bool S2NearCursor::advance() {
if (_numToReturn <= 0) {
LOG(2) << "advancing but no more to return" << endl;
return false;
}
if (_innerRadius > _maxDistance) {
LOG(2) << "advancing but exhausted search distance" << endl;
return false;
}
if (!_results.empty()) {
_returned.insert(_results.top().loc);
_results.pop();
--_numToReturn;
// Safe to grow the radius as we've returned everything in our shell. We don't do this
// check outside of !_results.empty() because we could have results, yield, dump them
// (_results would be empty), then need to recreate them w/the same radii. In that case
// we'd grow when we shouldn't.
if (_results.empty()) { nextAnnulus(); }
}
if (_results.empty()) { fillResults(); }
// The only reason _results should be empty now is if there are no more possible results.
return !_results.empty();
}
PlanStage::StageState S2NearStage::work(WorkingSetID* out) {
if (_failed) { return PlanStage::FAILURE; }
if (isEOF()) { return PlanStage::IS_EOF; }
++_commonStats.works;
// If we haven't opened up our very first ixscan+fetch children, do it. This is kind of
// heavy so we don't want to do it in the ctor.
if (!_worked) {
nextAnnulus();
_worked = true;
}
// If we're still reading results from the child, do that.
if (NULL != _child.get()) {
return addResultToQueue(out);
}
// Not reading results. Perhaps we're returning buffered results.
if (!_results.empty()) {
Result result = _results.top();
_results.pop();
*out = result.id;
// Remove from invalidation map.
WorkingSetMember* member = _ws->get(*out);
if (member->hasLoc()) {
unordered_map<DiskLoc, WorkingSetID, DiskLoc::Hasher>::iterator it = _invalidationMap.find(member->loc);
verify(_invalidationMap.end() != it);
_invalidationMap.erase(it);
}
// Drop flagged results.
if (_ws->isFlagged(*out)) {
_ws->free(*out);
return PlanStage::NEED_TIME;
}
++_commonStats.advanced;
return PlanStage::ADVANCED;
}
// Not EOF, not reading results, not returning any buffered results. Look in the next shell
// for results.
nextAnnulus();
return PlanStage::NEED_TIME;
}
void S2NearIndexCursor::seek(const BSONObj& query, const NearQuery& nearQuery,
const vector<GeoQuery>& regions) {
_indexedGeoFields = regions;
_nearQuery = nearQuery;
_returnedDistance = 0;
_nearFieldIndex = 0;
_stats = Stats();
_returned = unordered_set<DiskLoc, DiskLoc::Hasher>();
_results = priority_queue<Result>();
BSONObjBuilder geoFieldsToNuke;
for (size_t i = 0; i < _indexedGeoFields.size(); ++i) {
geoFieldsToNuke.append(_indexedGeoFields[i].getField(), "");
}
// false means we want to filter OUT geoFieldsToNuke, not filter to include only that.
_filteredQuery = query.filterFieldsUndotted(geoFieldsToNuke.obj(), false);
// More indexing machinery.
BSONObjBuilder specBuilder;
BSONObjIterator specIt(_descriptor->keyPattern());
while (specIt.more()) {
BSONElement e = specIt.next();
// Checked in AccessMethod already, so we know this spec has only numbers and 2dsphere
if ( e.type() == String ) {
specBuilder.append( e.fieldName(), 1 );
}
else {
specBuilder.append( e.fieldName(), e.numberInt() );
}
}
_specForFRV = specBuilder.obj();
specIt = BSONObjIterator(_descriptor->keyPattern());
while (specIt.more()) {
if (specIt.next().fieldName() == _nearQuery.field) { break; }
++_nearFieldIndex;
}
_minDistance = max(0.0, _nearQuery.minDistance);
// _outerRadius can't be greater than (pi * r) or we wrap around the opposite
// side of the world.
_maxDistance = min(M_PI * _params.radius, _nearQuery.maxDistance);
uassert(16892, "$minDistance too large", _minDistance < _maxDistance);
// Start with a conservative _radiusIncrement.
_radiusIncrement = 5 * S2::kAvgEdge.GetValue(_params.finestIndexedLevel) * _params.radius;
_innerRadius = _outerRadius = _minDistance;
// We might want to adjust the sizes of our coverings if our search
// isn't local to the start point.
// Set up _outerRadius with proper checks (maybe maxDistance is really small?)
nextAnnulus();
fillResults();
}
S2NearCursor::S2NearCursor(const BSONObj &keyPattern, const IndexDetails *details,
const BSONObj &query, const NearQuery &nearQuery,
const vector<GeoQuery> &indexedGeoFields,
const S2IndexingParams ¶ms)
: _details(details), _nearQuery(nearQuery), _indexedGeoFields(indexedGeoFields),
_params(params), _keyPattern(keyPattern), _nearFieldIndex(0), _returnedDistance(0) {
BSONObjBuilder geoFieldsToNuke;
for (size_t i = 0; i < _indexedGeoFields.size(); ++i) {
geoFieldsToNuke.append(_indexedGeoFields[i].getField(), "");
}
// false means we want to filter OUT geoFieldsToNuke, not filter to include only that.
_filteredQuery = query.filterFieldsUndotted(geoFieldsToNuke.obj(), false);
_matcher.reset(new CoveredIndexMatcher(_filteredQuery, keyPattern));
// More indexing machinery.
BSONObjBuilder specBuilder;
BSONObjIterator specIt(_keyPattern);
while (specIt.more()) {
BSONElement e = specIt.next();
// Checked in AccessMethod already, so we know this spec has only numbers and 2dsphere
if ( e.type() == String ) {
specBuilder.append( e.fieldName(), 1 );
}
else {
specBuilder.append( e.fieldName(), e.numberInt() );
}
}
BSONObj spec = specBuilder.obj();
_specForFRV = IndexSpec(spec);
specIt = BSONObjIterator(_keyPattern);
while (specIt.more()) {
if (specIt.next().fieldName() == _nearQuery.field) { break; }
++_nearFieldIndex;
}
// _outerRadius can't be greater than (pi * r) or we wrap around the opposite
// side of the world.
_maxDistance = min(M_PI * _params.radius, _nearQuery.maxDistance);
// Start with a conservative _radiusIncrement.
_radiusIncrement = 5 * S2::kAvgEdge.GetValue(_params.finestIndexedLevel) * _params.radius;
_innerRadius = _outerRadius = 0;
// We might want to adjust the sizes of our coverings if our search
// isn't local to the start point.
// Set up _outerRadius with proper checks (maybe maxDistance is really small?)
nextAnnulus();
}
void S2NearIndexCursor::next() {
if (_innerRadius > _maxDistance) {
LOG(2) << "advancing but exhausted search distance" << endl;
}
if (!_results.empty()) {
_returnedDistance = _results.top().distance;
_returned.insert(_results.top().loc);
_results.pop();
++_stats._numReturned;
// Safe to grow the radius as we've returned everything in our shell. We don't do this
// check outside of !_results.empty() because we could have results, yield, dump them
// (_results would be empty), then need to recreate them w/the same radii. In that case
// we'd grow when we shouldn't.
if (_results.empty()) { nextAnnulus(); }
}
if (_results.empty()) { fillResults(); }
}
bool S2NearCursor::advance() {
if (_numToReturn <= 0) { return false; }
if (_innerRadius > _maxDistance) { return false; }
if (!_results.empty()) {
_returned.insert(_results.top().loc);
_results.pop();
--_numToReturn;
++_nscanned;
// Safe to grow the radius as we've returned everything in our shell. We don't do this
// check outside of !_results.empty() because we could have results, yield, dump them
// (_results would be empty), then need to recreate them w/the same radii. In that case
// we'd grow when we shouldn't.
if (_results.empty()) { nextAnnulus(); }
}
if (_results.empty()) { fillResults(); }
// The only reason this should be empty is if there are no more results to be had.
return !_results.empty();
}
// Fill _results with all of the results in the annulus defined by _innerRadius and
// _outerRadius. If no results are found, grow the annulus and repeat until success (or
// until the edge of the world).
void S2NearIndexCursor::fillResults() {
verify(_results.empty());
if (_innerRadius >= _outerRadius) {
return;
}
if (_innerRadius > _maxDistance) {
return;
}
// We iterate until 1. our search radius is too big or 2. we find results.
do {
// Some of these arguments are opaque, look at the definitions of the involved classes.
FieldRangeSet frs(_descriptor->parentNS().c_str(), makeFRSObject(), false, false);
shared_ptr<FieldRangeVector> frv(new FieldRangeVector(frs, _specForFRV, 1));
scoped_ptr<BtreeCursor> cursor(BtreeCursor::make(nsdetails(_descriptor->parentNS()),
_descriptor->getOnDisk(), frv, 0, 1));
// The cursor may return the same obj more than once for a given
// FRS, so we make sure to only consider it once in any given annulus.
//
// We don't want this outside of the 'do' loop because the covering
// for an annulus may return an object whose distance to the query
// point is actually contained in a subsequent annulus. If we
// didn't consider every object in a given annulus we might miss
// the point.
//
// We don't use a global 'seen' because we get that by requiring
// the distance from the query point to the indexed geo to be
// within our 'current' annulus, and I want to dodge all yield
// issues if possible.
unordered_set<DiskLoc, DiskLoc::Hasher> seen;
LOG(1) << "looking at annulus from " << _innerRadius << " to " << _outerRadius << endl;
LOG(1) << "Total # returned: " << _stats._numReturned << endl;
// Do the actual search through this annulus.
for (; cursor->ok(); cursor->advance()) {
// Don't bother to look at anything we've returned.
if (_returned.end() != _returned.find(cursor->currLoc())) {
++_stats._returnSkip;
continue;
}
++_stats._nscanned;
if (seen.end() != seen.find(cursor->currLoc())) {
++_stats._btreeDups;
continue;
}
// Get distance interval from our query point to the cell.
// If it doesn't overlap with our current shell, toss.
BSONObj currKey(cursor->currKey());
BSONObjIterator it(currKey);
BSONElement geoKey;
for (int i = 0; i <= _nearFieldIndex; ++i) {
geoKey = it.next();
}
S2Cell keyCell = S2Cell(S2CellId::FromString(geoKey.String()));
if (!_annulus.MayIntersect(keyCell)) {
++_stats._keyGeoSkip;
continue;
}
// We have to add this document to seen *AFTER* the key intersection test.
// A geometry may have several keys, one of which may be in our search shell and one
// of which may be outside of it. We don't want to ignore a document just because
// one of its covers isn't inside this annulus.
seen.insert(cursor->currLoc());
// At this point forward, we will not examine the document again in this annulus.
const BSONObj& indexedObj = cursor->currLoc().obj();
// Match against indexed geo fields.
++_stats._geoMatchTested;
size_t geoFieldsMatched = 0;
// See if the object actually overlaps w/the geo query fields.
for (size_t i = 0; i < _indexedGeoFields.size(); ++i) {
BSONElementSet geoFieldElements;
indexedObj.getFieldsDotted(_indexedGeoFields[i].getField(), geoFieldElements,
false);
if (geoFieldElements.empty()) {
continue;
}
bool match = false;
for (BSONElementSet::iterator oi = geoFieldElements.begin();
!match && (oi != geoFieldElements.end()); ++oi) {
if (!oi->isABSONObj()) {
continue;
}
const BSONObj &geoObj = oi->Obj();
GeometryContainer geoContainer;
uassert(16762, "ill-formed geometry: " + geoObj.toString(),
geoContainer.parseFrom(geoObj));
match = _indexedGeoFields[i].satisfiesPredicate(geoContainer);
}
if (match) {
++geoFieldsMatched;
}
}
if (geoFieldsMatched != _indexedGeoFields.size()) {
continue;
}
// Get all the fields with that name from the document.
BSONElementSet geoFieldElements;
indexedObj.getFieldsDotted(_nearQuery.field, geoFieldElements, false);
if (geoFieldElements.empty()) {
continue;
}
++_stats._inAnnulusTested;
double minDistance = 1e20;
// Look at each field in the document and take the min. distance.
for (BSONElementSet::iterator oi = geoFieldElements.begin();
oi != geoFieldElements.end(); ++oi) {
if (!oi->isABSONObj()) {
continue;
}
double dist = distanceTo(oi->Obj());
minDistance = min(dist, minDistance);
}
// We could be in an annulus, yield, add new points closer to
// query point than the last point we returned, then unyield.
// This would return points out of order.
if (minDistance < _returnedDistance) {
continue;
}
// If the min. distance satisfies our distance criteria
if (minDistance >= _innerRadius && minDistance < _outerRadius) {
// The result is valid. We have to de-dup ourselves here.
if (_returned.end() == _returned.find(cursor->currLoc())) {
_results.push(Result(cursor->currLoc(), cursor->currKey(),
minDistance));
}
}
}
if (_results.empty()) {
LOG(1) << "results empty!\n";
_radiusIncrement *= 2;
nextAnnulus();
} else if (_results.size() < 300) {
_radiusIncrement *= 2;
} else if (_results.size() > 600) {
_radiusIncrement /= 2;
}
} while (_results.empty()
&& _innerRadius < _maxDistance
&& _innerRadius < _outerRadius);
LOG(1) << "Filled shell with " << _results.size() << " results" << endl;
}
// Fill _results with the next shell of results. We may have to search several times to do
// this. If _results.empty() after calling fillResults, there are no more possible results.
void S2NearCursor::fillResults() {
verify(_results.empty());
if (_innerRadius >= _outerRadius) { return; }
if (_innerRadius > _maxDistance) { return; }
// We iterate until 1. our search radius is too big or 2. we find results.
do {
// Some of these arguments are opaque, look at the definitions of the involved classes.
FieldRangeSet frs(_details->parentNS().c_str(), makeFRSObject(), false, false);
shared_ptr<FieldRangeVector> frv(new FieldRangeVector(frs, _specForFRV, 1));
scoped_ptr<BtreeCursor> cursor(BtreeCursor::make(nsdetails(_details->parentNS().c_str()),
*_details, frv, 0, 1));
// Do the actual search through this annulus.
size_t considered = 0;
for (; cursor->ok(); cursor->advance()) {
++_nscanned;
++considered;
MatchDetails details;
bool matched = _matcher->matchesCurrent(cursor.get(), &details);
if (!matched) { continue; }
const BSONObj& indexedObj = cursor->currLoc().obj();
size_t geoFieldsInRange = 0;
double minMatchingDistance = 1e20;
// Calculate the distance from our query point(s) to the geo field(s).
for (size_t i = 0; i < _fields.size(); ++i) {
const GeoQueryField& field = _fields[i];
BSONElementSet geoFieldElements;
indexedObj.getFieldsDotted(field.field, geoFieldElements);
if (geoFieldElements.empty()) { continue; }
S2Point us = field.getCentroid();
for (BSONElementSet::iterator oi = geoFieldElements.begin();
oi != geoFieldElements.end(); ++oi) {
const BSONObj &geoObj = oi->Obj();
double dist = -1;
S2Point them;
if (GeoJSONParser::isPolygon(geoObj)) {
S2Polygon shape;
GeoJSONParser::parsePolygon(geoObj, &shape);
them = shape.Project(us);
} else if (GeoJSONParser::isLineString(geoObj)) {
S2Polyline shape;
GeoJSONParser::parseLineString(geoObj, &shape);
int tmp;
them = shape.Project(us, &tmp);
} else if (GeoJSONParser::isPoint(geoObj)) {
S2Cell point;
GeoJSONParser::parsePoint(geoObj, &point);
them = point.GetCenter();
}
S1Angle angle(us, them);
dist = angle.radians() * _params.radius;
if (dist >= _innerRadius && dist <= _outerRadius) {
++geoFieldsInRange;
minMatchingDistance = min(dist, minMatchingDistance);
}
}
}
if (_fields.size() == geoFieldsInRange) {
if (_returned.end() == _returned.find(cursor->currLoc())) {
_results.push(Result(cursor->currLoc(), cursor->currKey(), minMatchingDistance));
}
}
}
if (_results.empty()) {
_radiusIncrement *= 2;
nextAnnulus();
}
} while (_results.empty() && _innerRadius < M_PI * _params.radius);
// TODO: consider shrinking _radiusIncrement if _results.size() meets some criteria.
}
// Fill _results with the next shell of results. We may have to search several times to do
// this. If _results.empty() after calling fillResults, there are no more possible results.
void S2NearCursor::fillResults() {
verify(_results.empty());
if (_innerRadius >= _outerRadius) { return; }
if (_innerRadius > _maxDistance) { return; }
// We iterate until 1. our search radius is too big or 2. we find results.
do {
// Some of these arguments are opaque, look at the definitions of the involved classes.
FieldRangeSet frs(_details->parentNS().c_str(), makeFRSObject(), false, false);
shared_ptr<FieldRangeVector> frv(new FieldRangeVector(frs, _specForFRV, 1));
scoped_ptr<BtreeCursor> cursor(BtreeCursor::make(nsdetails(_details->parentNS().c_str()),
*_details, frv, 0, 1));
// Do the actual search through this annulus.
size_t considered = 0;
for (; cursor->ok(); cursor->advance()) {
++considered;
MatchDetails details;
bool matched = _matcher->matchesCurrent(cursor.get(), &details);
if (!matched) { continue; }
const BSONObj& indexedObj = cursor->currLoc().obj();
size_t geoFieldsInRange = 0;
double minMatchingDistance = 1e20;
// Calculate the distance from our query point(s) to the geo field(s).
// For each geo field in the query...
for (size_t i = 0; i < _fields.size(); ++i) {
const QueryGeometry& field = _fields[i];
// Get all the fields with that name from the document.
BSONElementSet geoFieldElements;
indexedObj.getFieldsDotted(field.field, geoFieldElements, false);
if (geoFieldElements.empty()) { continue; }
// For each field with that name in the document...
for (BSONElementSet::iterator oi = geoFieldElements.begin();
oi != geoFieldElements.end(); ++oi) {
if (!oi->isABSONObj()) { continue; }
double dist = distanceBetween(field, oi->Obj());
// If it satisfies our distance criteria...
if (dist >= _innerRadius && dist <= _outerRadius) {
// Success! For this field.
++geoFieldsInRange;
minMatchingDistance = min(dist, minMatchingDistance);
}
}
}
// If all the geo query fields had something in range
if (_fields.size() == geoFieldsInRange) {
// The result is valid. We have to de-dup ourselves here.
if (_returned.end() == _returned.find(cursor->currLoc())) {
_results.push(Result(cursor->currLoc(), cursor->currKey(),
minMatchingDistance));
}
}
}
if (_results.empty()) {
_radiusIncrement *= 2;
nextAnnulus();
}
} while (_results.empty()
&& _innerRadius < _maxDistance
&& _innerRadius < _outerRadius
&& _innerRadius < M_PI * _params.radius);
// TODO: consider shrinking _radiusIncrement if _results.size() meets some criteria.
}
// Fill _results with the next shell of results. We may have to search several times to do
// this. If _results.empty() after calling fillResults, there are no more possible results.
void S2NearCursor::fillResults() {
verify(_results.empty());
if (_innerRadius >= _outerRadius) { return; }
if (_innerRadius > _maxDistance) { return; }
if (0 == _numToReturn) { return; }
// We iterate until 1. our search radius is too big or 2. we find results.
do {
// Some of these arguments are opaque, look at the definitions of the involved classes.
FieldRangeSet frs(_details->parentNS().c_str(), makeFRSObject(), false, false);
shared_ptr<FieldRangeVector> frv(new FieldRangeVector(frs, _specForFRV, 1));
scoped_ptr<BtreeCursor> cursor(BtreeCursor::make(nsdetails(_details->parentNS()),
*_details, frv, 0, 1));
// The cursor may return the same obj more than once for a given
// FRS, so we make sure to only consider it once in any given annulus.
//
// We don't want this outside of the 'do' loop because the covering
// for an annulus may return an object whose distance to the query
// point is actually contained in a subsequent annulus. If we
// didn't consider every object in a given annulus we might miss
// the point.
//
// We don't use a global 'seen' because we get that by requiring
// the distance from the query point to the indexed geo to be
// within our 'current' annulus, and I want to dodge all yield
// issues if possible.
set<DiskLoc> seen;
LOG(1) << "looking at annulus from " << _innerRadius << " to " << _outerRadius << endl;
// Do the actual search through this annulus.
for (; cursor->ok(); cursor->advance()) {
++_nscanned;
if (seen.end() != seen.find(cursor->currLoc())) { continue; }
seen.insert(cursor->currLoc());
// Match against non-indexed fields.
++_matchTested;
MatchDetails details;
bool matched = _matcher->matchesCurrent(cursor.get(), &details);
if (!matched) { continue; }
const BSONObj& indexedObj = cursor->currLoc().obj();
++_geoTested;
// Match against indexed geo fields.
size_t geoFieldsMatched = 0;
// OK, cool, non-geo match satisfied. See if the object actually overlaps w/the geo
// query fields.
for (size_t i = 0; i < _indexedGeoFields.size(); ++i) {
BSONElementSet geoFieldElements;
indexedObj.getFieldsDotted(_indexedGeoFields[i].getField(), geoFieldElements,
false);
if (geoFieldElements.empty()) { continue; }
bool match = false;
for (BSONElementSet::iterator oi = geoFieldElements.begin();
!match && (oi != geoFieldElements.end()); ++oi) {
if (!oi->isABSONObj()) { continue; }
const BSONObj &geoObj = oi->Obj();
GeometryContainer geoContainer;
uassert(16699, "ill-formed geometry: " + geoObj.toString(),
geoContainer.parseFrom(geoObj));
match = _indexedGeoFields[i].satisfiesPredicate(geoContainer);
}
if (match) { ++geoFieldsMatched; }
}
if (geoFieldsMatched != _indexedGeoFields.size()) { continue; }
// Finally, see if the item is in our search annulus.
size_t geoFieldsInRange = 0;
double minMatchingDistance = 1e20;
// Get all the fields with that name from the document.
BSONElementSet geoFieldElements;
indexedObj.getFieldsDotted(_nearQuery.field, geoFieldElements, false);
if (geoFieldElements.empty()) { continue; }
// For each field with that name in the document...
for (BSONElementSet::iterator oi = geoFieldElements.begin();
oi != geoFieldElements.end(); ++oi) {
if (!oi->isABSONObj()) { continue; }
double dist = distanceTo(oi->Obj());
// If it satisfies our distance criteria...
if (dist >= _innerRadius && dist <= _outerRadius) {
// Success! For this field.
++geoFieldsInRange;
minMatchingDistance = min(dist, minMatchingDistance);
}
}
// If all the geo query fields had something in range
if (geoFieldsInRange > 0) {
// The result is valid. We have to de-dup ourselves here.
if (_returned.end() == _returned.find(cursor->currLoc())) {
_results.push(Result(cursor->currLoc(), cursor->currKey(),
minMatchingDistance));
}
}
}
if (_results.empty()) {
_radiusIncrement *= 2;
nextAnnulus();
}
} while (_results.empty()
&& _innerRadius < _maxDistance
&& _innerRadius < _outerRadius);
}