summaryrefslogtreecommitdiff
path: root/src/mongo/db/query/plan_ranker.h
diff options
context:
space:
mode:
authorDavid Storch <david.storch@10gen.com>2015-04-13 22:30:46 -0400
committerDavid Storch <david.storch@10gen.com>2015-04-13 22:31:19 -0400
commit81a1f70b87b3f3754931829b11faa0a53df64527 (patch)
tree6709655fa170d218abc7e42aeb6710e70e2419c0 /src/mongo/db/query/plan_ranker.h
parent14fbbf72657a1d1898a7a9c9db48fc978992fde8 (diff)
downloadmongo-81a1f70b87b3f3754931829b11faa0a53df64527.tar.gz
SERVER-15225 CachedPlanStage can replan poorly performing queries after a trial period
Diffstat (limited to 'src/mongo/db/query/plan_ranker.h')
-rw-r--r--src/mongo/db/query/plan_ranker.h10
1 files changed, 1 insertions, 9 deletions
diff --git a/src/mongo/db/query/plan_ranker.h b/src/mongo/db/query/plan_ranker.h
index 758c4d428b8..ed41c0c1c5a 100644
--- a/src/mongo/db/query/plan_ranker.h
+++ b/src/mongo/db/query/plan_ranker.h
@@ -87,7 +87,7 @@ namespace mongo {
*/
struct PlanRankingDecision {
- PlanRankingDecision() : tieForBest(false) { }
+ PlanRankingDecision() { }
/**
* Make a deep copy.
@@ -101,7 +101,6 @@ namespace mongo {
}
decision->scores = scores;
decision->candidateOrder = candidateOrder;
- decision->tieForBest = tieForBest;
return decision;
}
@@ -120,13 +119,6 @@ namespace mongo {
// candidates[candidateOrder[1]] followed by
// candidates[candidateOrder[2]], ...
std::vector<size_t> candidateOrder;
-
- // Did two plans tie for best?
- //
- // NOTE: Reading this is the only reliable way to determine if there was a tie,
- // because the scores kept inside the PlanRankingDecision do not incorporate
- // the EOF bonus.
- bool tieForBest;
};
} // namespace mongo