diff options
Diffstat (limited to 'src/mongo/db/exec/geo_near.cpp')
-rw-r--r-- | src/mongo/db/exec/geo_near.cpp | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/src/mongo/db/exec/geo_near.cpp b/src/mongo/db/exec/geo_near.cpp index df28f3edcdb..ef1fb4e2aa9 100644 --- a/src/mongo/db/exec/geo_near.cpp +++ b/src/mongo/db/exec/geo_near.cpp @@ -95,7 +95,7 @@ struct StoredGeometry { BSONElement element; GeometryContainer geometry; }; -} +} // namespace /** * Find and parse all geometry elements on the appropriate field path from the document. @@ -555,7 +555,7 @@ private: // Owns matcher const unique_ptr<MatchExpression> _matcher; }; -} +} // namespace static double min2DBoundsIncrement(const GeoNearExpression& query, const IndexDescriptor* twoDIndex) { @@ -590,9 +590,9 @@ static R2Annulus projectBoundsToTwoDDegrees(R2Annulus sphereBounds) { } StatusWith<NearStage::CoveredInterval*> // - GeoNear2DStage::nextInterval(OperationContext* opCtx, - WorkingSet* workingSet, - const Collection* collection) { +GeoNear2DStage::nextInterval(OperationContext* opCtx, + WorkingSet* workingSet, + const Collection* collection) { // The search is finished if we searched at least once and all the way to the edge if (_currBounds.getInner() >= 0 && _currBounds.getOuter() == _fullBounds.getOuter()) { return StatusWith<CoveredInterval*>(nullptr); @@ -829,7 +829,7 @@ S2Region* buildS2Region(const R2Annulus& sphereBounds) { // Takes ownership of caps return new S2RegionIntersection(®ions); } -} +} // namespace // Estimate the density of data by search the nearest cells level by level around center. class GeoNear2DSphereStage::DensityEstimator { @@ -1010,9 +1010,9 @@ PlanStage::StageState GeoNear2DSphereStage::initialize(OperationContext* opCtx, } StatusWith<NearStage::CoveredInterval*> // - GeoNear2DSphereStage::nextInterval(OperationContext* opCtx, - WorkingSet* workingSet, - const Collection* collection) { +GeoNear2DSphereStage::nextInterval(OperationContext* opCtx, + WorkingSet* workingSet, + const Collection* collection) { // The search is finished if we searched at least once and all the way to the edge if (_currBounds.getInner() >= 0 && _currBounds.getOuter() == _fullBounds.getOuter()) { return StatusWith<CoveredInterval*>(nullptr); |