SERVER-18579: Clang-Format - reformat code, no comment reflow

1 files changed, 52 insertions, 52 deletions

diff --git a/src/mongo/db/query/query_knobs.h b/src/mongo/db/query/query_knobs.h
index f2b775593d0..c82d6828a29 100644
--- a/src/mongo/db/query/query_knobs.h
+++ b/src/mongo/db/query/query_knobs.h
@@ -30,78 +30,78 @@
 
 namespace mongo {
 
-    //
-    // multi-plan ranking
-    //
+//
+// multi-plan ranking
+//
 
-    // Max number of times we call work() on plans before comparing them,
-    // for small collections.
-    extern int internalQueryPlanEvaluationWorks;
+// Max number of times we call work() on plans before comparing them,
+// for small collections.
+extern int internalQueryPlanEvaluationWorks;
 
-    // For large collections, the number times we work() candidate plans is
-    // taken as this fraction of the collection size.
-    extern double internalQueryPlanEvaluationCollFraction;
+// For large collections, the number times we work() candidate plans is
+// taken as this fraction of the collection size.
+extern double internalQueryPlanEvaluationCollFraction;
 
-    // Stop working plans once a plan returns this many results.
-    extern int internalQueryPlanEvaluationMaxResults;
+// Stop working plans once a plan returns this many results.
+extern int internalQueryPlanEvaluationMaxResults;
 
-    // Do we give a big ranking bonus to intersection plans?
-    extern bool internalQueryForceIntersectionPlans;
+// Do we give a big ranking bonus to intersection plans?
+extern bool internalQueryForceIntersectionPlans;
 
-    // Do we have ixisect on at all?
-    extern bool internalQueryPlannerEnableIndexIntersection;
+// Do we have ixisect on at all?
+extern bool internalQueryPlannerEnableIndexIntersection;
 
-    // Do we use hash-based intersection for rooted $and queries?
-    extern bool internalQueryPlannerEnableHashIntersection;
+// Do we use hash-based intersection for rooted $and queries?
+extern bool internalQueryPlannerEnableHashIntersection;
 
-    //
-    // plan cache
-    //
+//
+// plan cache
+//
 
-    // How many entries in the cache?
-    extern int internalQueryCacheSize;
+// How many entries in the cache?
+extern int internalQueryCacheSize;
 
-    // How many feedback entries do we collect before possibly evicting from the cache based on bad
-    // performance?
-    extern int internalQueryCacheFeedbacksStored;
+// How many feedback entries do we collect before possibly evicting from the cache based on bad
+// performance?
+extern int internalQueryCacheFeedbacksStored;
 
-    // How many times more works must we perform in order to justify plan cache eviction
-    // and replanning?
-    extern double internalQueryCacheEvictionRatio;
+// How many times more works must we perform in order to justify plan cache eviction
+// and replanning?
+extern double internalQueryCacheEvictionRatio;
 
-    // How many write ops should we allow in a collection before tossing all cache entries?
-    extern int internalQueryCacheWriteOpsBetweenFlush;
+// How many write ops should we allow in a collection before tossing all cache entries?
+extern int internalQueryCacheWriteOpsBetweenFlush;
 
-    //
-    // Planning and enumeration.
-    //
+//
+// Planning and enumeration.
+//
 
-    // How many indexed solutions will QueryPlanner::plan output?
-    extern int internalQueryPlannerMaxIndexedSolutions;
+// How many indexed solutions will QueryPlanner::plan output?
+extern int internalQueryPlannerMaxIndexedSolutions;
 
-    // How many solutions will the enumerator consider at each OR?
-    extern int internalQueryEnumerationMaxOrSolutions;
+// How many solutions will the enumerator consider at each OR?
+extern int internalQueryEnumerationMaxOrSolutions;
 
-    // How many intersections will the enumerator consider at each AND?
-    extern int internalQueryEnumerationMaxIntersectPerAnd;
+// How many intersections will the enumerator consider at each AND?
+extern int internalQueryEnumerationMaxIntersectPerAnd;
 
-    // Do we want to plan each child of the OR independently?
-    extern bool internalQueryPlanOrChildrenIndependently;
+// Do we want to plan each child of the OR independently?
+extern bool internalQueryPlanOrChildrenIndependently;
 
-    // How many index scans are we willing to produce in order to obtain a sort order
-    // during explodeForSort?
-    extern int internalQueryMaxScansToExplode;
+// How many index scans are we willing to produce in order to obtain a sort order
+// during explodeForSort?
+extern int internalQueryMaxScansToExplode;
 
-    //
-    // Query execution.
-    //
+//
+// Query execution.
+//
 
-    extern int internalQueryExecMaxBlockingSortBytes;
+extern int internalQueryExecMaxBlockingSortBytes;
 
-    // Yield after this many "should yield?" checks.
-    extern int internalQueryExecYieldIterations;
+// Yield after this many "should yield?" checks.
+extern int internalQueryExecYieldIterations;
 
-    // Yield if it's been at least this many milliseconds since we last yielded.
-    extern int internalQueryExecYieldPeriodMS;
+// Yield if it's been at least this many milliseconds since we last yielded.
+extern int internalQueryExecYieldPeriodMS;
 
 }  // namespace mongo