diff options
| author | David Storch <david.storch@10gen.com> | 2015-01-12 20:34:07 -0500 |
|---|---|---|
| committer | David Storch <david.storch@10gen.com> | 2015-01-15 09:51:01 -0500 |
| commit | dbe1b1677a85721c6041903bc28411ca40682747 (patch) | |
| tree | 4f6708c381da82c36063491c914fe7f719daabd5 /src/mongo/dbtests/plan_ranking.cpp | |
| parent | 57806db0234321b9b88a74e013d952104e0c459a (diff) | |
| download | mongo-dbe1b1677a85721c6041903bc28411ca40682747.tar.gz | |
SERVER-16750 doc-locking storage engines must recheck exact predicates for index intersection
Diffstat (limited to 'src/mongo/dbtests/plan_ranking.cpp')
| -rw-r--r-- | src/mongo/dbtests/plan_ranking.cpp | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/mongo/dbtests/plan_ranking.cpp b/src/mongo/dbtests/plan_ranking.cpp index 7ff4bc3ab8d..ce6fd53a7a2 100644 --- a/src/mongo/dbtests/plan_ranking.cpp +++ b/src/mongo/dbtests/plan_ranking.cpp @@ -214,7 +214,7 @@ namespace PlanRankingTests { // Takes ownership of cq. soln = pickBestPlan(cq); ASSERT(QueryPlannerTestLib::solutionMatches( - "{fetch: {filter: null, node: {andSorted: {nodes: [" + "{fetch: {node: {andSorted: {nodes: [" "{ixscan: {filter: null, pattern: {a:1}}}," "{ixscan: {filter: null, pattern: {b:1}}}]}}}}", soln->root.get())); @@ -250,7 +250,7 @@ namespace PlanRankingTests { // Takes ownership of cq. QuerySolution* soln = pickBestPlan(cq); ASSERT(QueryPlannerTestLib::solutionMatches( - "{fetch: {filter: null, node: {andHash: {nodes: [" + "{fetch: {node: {andHash: {nodes: [" "{ixscan: {filter: null, pattern: {a:1}}}," "{ixscan: {filter: null, pattern: {b:1}}}]}}}}", soln->root.get())); @@ -624,7 +624,7 @@ namespace PlanRankingTests { QuerySolution* soln = pickBestPlan(cq); ASSERT(QueryPlannerTestLib::solutionMatches( - "{fetch: {filter: null, node: {andSorted: {nodes: [" + "{fetch: {node: {andSorted: {nodes: [" "{ixscan: {filter: null, pattern: {a:1}}}," "{ixscan: {filter: null, pattern: {b:1}}}]}}}}", soln->root.get())); @@ -666,7 +666,7 @@ namespace PlanRankingTests { // Choose the index intersection plan. QuerySolution* soln = pickBestPlan(cq); ASSERT(QueryPlannerTestLib::solutionMatches( - "{fetch: {filter: null, node: {andSorted: {nodes: [" + "{fetch: {node: {andSorted: {nodes: [" "{ixscan: {filter: null, pattern: {a:1}}}," "{ixscan: {filter: null, pattern: {b:1}}}]}}}}", soln->root.get())); @@ -710,7 +710,7 @@ namespace PlanRankingTests { // other plans are busy fetching documents. QuerySolution* soln = pickBestPlan(cq); ASSERT(QueryPlannerTestLib::solutionMatches( - "{fetch: {filter: {a:1}, node: {andSorted: {nodes: [" + "{fetch: {node: {andSorted: {nodes: [" "{ixscan: {filter: null, pattern: {b:1}}}," "{ixscan: {filter: null, pattern: {c:1}}}]}}}}", soln->root.get())); |