useIndexForSort:

dothebart · dothebart · commit 8bfb71573d15 · 2014-09-09T17:19:49.000+02:00
- redirect to pass #5 here too, so now possible obsolete CalculaionNodes are removed by the removeUnnecessaryCalculationsRule
diff --git a/arangod/Aql/OptimizerRules.cpp b/arangod/Aql/OptimizerRules.cpp
@@ -940,8 +940,11 @@ class sortToIndexNode : public WalkerWorker<ExecutionNode> {
 
         if (idx.fullmatch) { // if the index superseedes the sort, remove it.
           _sortNode->removeSortNodeFromPlan(newPlan);
+          _opt->addPlan(newPlan, Optimizer::RuleLevel::pass5, true);
+        }
+        else {
+          _opt->addPlan(newPlan, level, true);
         }
-        _opt->addPlan(newPlan, level, true);
       }
       catch (...) {
         delete newPlan;

Original file line number	Diff line number	Diff line change
`@@ -940,8 +940,11 @@ class sortToIndexNode : public WalkerWorker<ExecutionNode> {`
`940`	`940`
`941`	`941`	`if (idx.fullmatch) { // if the index superseedes the sort, remove it.`
`942`	`942`	`_sortNode->removeSortNodeFromPlan(newPlan);`
	`943`	`+ _opt->addPlan(newPlan, Optimizer::RuleLevel::pass5, true);`
	`944`	`+ }`
	`945`	`+ else {`
	`946`	`+ _opt->addPlan(newPlan, level, true);`
`943`	`947`	`}`
`944`		`- _opt->addPlan(newPlan, level, true);`
`945`	`948`	`}`
`946`	`949`	`catch (...) {`
`947`	`950`	`delete newPlan;`