summaryrefslogtreecommitdiff
path: root/src/mongo/db/query/index_tag.h
diff options
context:
space:
mode:
authorHari Khalsa <hkhalsa@10gen.com>2013-09-28 18:48:55 -0400
committerHari Khalsa <hkhalsa@10gen.com>2013-09-30 18:56:52 -0400
commit257d3f5361627bdd1b719c288381a959793246a2 (patch)
tree9bd74d4d54df83bac5ef09fc30a3ae03be2fde63 /src/mongo/db/query/index_tag.h
parentbbb2659eff533a362e43d60914b0cda0f44a9343 (diff)
downloadmongo-257d3f5361627bdd1b719c288381a959793246a2.tar.gz
SERVER-10471 enumerate indices w/array operators correctly, clean up and comment planner
Diffstat (limited to 'src/mongo/db/query/index_tag.h')
-rw-r--r--src/mongo/db/query/index_tag.h11
1 files changed, 7 insertions, 4 deletions
diff --git a/src/mongo/db/query/index_tag.h b/src/mongo/db/query/index_tag.h
index 3d505a19d06..2912aca5218 100644
--- a/src/mongo/db/query/index_tag.h
+++ b/src/mongo/db/query/index_tag.h
@@ -74,14 +74,17 @@ namespace mongo {
};
/**
- * Tags each node of the tree with the lowest numbered indexed that the sub-tree
- * rooted at that node uses.
+ * Tags each node of the tree with the lowest numbered index that the sub-tree rooted at that
+ * node uses.
+ *
+ * Nodes that satisfy Indexability::nodeCanUseIndexOnOwnField are already tagged if there
+ * exists an index that that node can use.
*/
void tagForSort(MatchExpression* tree);
/**
- * Then sorts the tree using its IndexTag()s. The outcome is that nodes that use the same index
- * are adjacent to one another.
+ * Sorts the tree using its IndexTag(s). Nodes that use the same index are adjacent to one
+ * another.
*/
void sortUsingTags(MatchExpression* tree);