| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | SERVER-41071 Replace NULL and 0 with nullptr | A. Jesse Jiryu Davis | 2019-06-14 | 1 | -2/+2 |
| | | |||||
| * | SERVER-39339 Remove `stdx/memory.h` | ADAM David Alan Martin | 2019-06-10 | 1 | -1/+1 |
| | | |||||
| * | SERVER-39560 - remove leading blank line on all C++ files | Billy Donahue | 2019-02-13 | 1 | -1/+0 |
| | | | | | | | Remove leading comments that are just stating the filename. Move any file-level comments below the copyright banner. Remove leading blank lines. | ||||
| * | SERVER-37651 Update header files with new license | Ramon Fernandez | 2018-10-22 | 1 | -8/+10 |
| | | |||||
| * | SERVER-36517 Allow wildcard indexes to provide DISTINCT_SCAN | Bernard Gorman | 2018-10-11 | 1 | -2/+0 |
| | | |||||
| * | SERVER-37188 Rename "All Paths" index to "Wildcard" index | James Wahlin | 2018-10-02 | 1 | -1/+1 |
| | | |||||
| * | SERVER-35493 Planning support for "field name or array index" path ↵ | Bernard Gorman | 2018-09-22 | 1 | -0/+2 |
| | | | | | components in wildcard indexes | ||||
| * | SERVER-35455 Eliminate owned raw pointers from QueryPlannerAccess. | David Storch | 2018-06-12 | 1 | -94/+96 |
| | | | | | | This fixes a previous version of this commit by adding std::move() where copy elision is not guaranteed. | ||||
| * | Revert "SERVER-35455 Eliminate owned raw pointers from QueryPlannerAccess." | David Storch | 2018-06-12 | 1 | -96/+94 |
| | | | | | This reverts commit dd1a525f1d1b9e3cf8f902d6c04a17607d565dea. | ||||
| * | SERVER-35455 Eliminate owned raw pointers from QueryPlannerAccess. | David Storch | 2018-06-11 | 1 | -94/+96 |
| | | |||||
| * | SERVER-29218 Use std:::unique_ptr to manage QuerySolutionNode objects | Justin Seyster | 2017-05-17 | 1 | -3/+3 |
| | | | | | | | | | | | | This started with a test failure caused by a QuerySolutionNode getting leaked in QueryPlannerAccess::makeCollectionScan(). I converted the leaky pointer to std::unique_ptr management and then I spread std::unique_ptr to all the places that interact with makeCollectionScan(). I may revisit this to use unique_ptrs for all QuerySolutionNode references. | ||||
| * | SERVER-13732 Index access plan for contained OR should consider top-level ↵ | Tess Avitabile | 2017-02-17 | 1 | -3/+0 |
| | | | | | predicates | ||||
| * | SERVER-13732 rewrite contained $or queries to rooted $or in the SubplanStage | David Storch | 2015-07-10 | 1 | -0/+22 |
| | | | | | | | This allows queries with an $or contained within an explicit or implicit $and to be answered with more efficient plans. It also expands the use of the SubplanStage to include contained $or queries and therefore may reduce the number of plans considered for these queries. | ||||
| * | SERVER-18978: Clang-Format - Fix comment word wrapping indentation | Mark Benvenuto | 2015-06-20 | 1 | -2/+2 |
| | | |||||
| * | SERVER-18579: Clang-Format - reformat code, no comment reflow | Mark Benvenuto | 2015-06-20 | 1 | -338/+337 |
| | | |||||
| * | SERVER-17309 Replace std::auto_ptr<T> with std::unique_ptr<T> | Andrew Morrow | 2015-06-10 | 1 | -5/+5 |
| | | |||||
| * | SERVER-16750 doc-locking storage engines must recheck exact predicates for ↵ | David Storch | 2015-01-15 | 1 | -7/+9 |
| | | | | | index intersection | ||||
| * | SERVER-16256 get rid of ALL match expressions | David Storch | 2014-12-01 | 1 | -4/+4 |
| | | | | | | | Every $all should parse to an AND match expression. This simplifies the implementation, and fixes a bug related to bounds building for $all-$elemMatch constructions. | ||||
| * | SERVER-14425: handle deadlocks in the middle up a multi-update | Eliot Horowitz | 2014-10-31 | 1 | -0/+4 |
| | | |||||
| * | SERVER-13960 bug fixes for OR with inexact predicates | David Storch | 2014-05-30 | 1 | -0/+5 |
| | | |||||
| * | SERVER-13960 fix access planning for OR with inexact child predicates | David Storch | 2014-05-30 | 1 | -19/+154 |
| | | | | | | Includes a refactor of QueryPlannerAccess::processIndexScans(...) which makes this change saner. | ||||
| * | SERVER-13256: Remove pch - qualify std in headers | Mark Benvenuto | 2014-05-19 | 1 | -7/+7 |
| | | |||||
| * | SERVER-13789 recursively build data access for subnodes beneath elemMatch | David Storch | 2014-05-06 | 1 | -3/+7 |
| | | |||||
| * | SERVER-12354 SERVER-12144 plan compound text correctly | Hari Khalsa | 2014-02-13 | 1 | -0/+3 |
| | | |||||
| * | SERVER-12470 SERVER-12475 SERVER-9532 fix multikey index bounds for compound ↵ | David Storch | 2014-02-10 | 1 | -0/+83 |
| | | | | | | | | | indices and elemMatch The new query system multikey index bounds behavior now largely matches that of 2.4. For a detailed description of the rules for building multikey index bounds, see the long comment atop db/query/planner_access.h. | ||||
| * | SERVER-2094 fast distinct when field is indexed and query is fully covered | Hari Khalsa | 2014-01-23 | 1 | -7/+0 |
| | | |||||
| * | SERVER-10026 support max/min in new sys | Hari Khalsa | 2013-12-04 | 1 | -0/+9 |
| | | |||||
| * | SERVER-10026 add maxScan support for new query | Hari Khalsa | 2013-12-04 | 1 | -1/+2 |
| | | |||||
| * | SERVER-11852 fix query planning for inexact regexes | David Storch | 2013-12-02 | 1 | -0/+11 |
| | | | | | Signed-off-by: Matt Kangas <matt.kangas@mongodb.com> | ||||
| * | SERVER-11817 use enum instead of bool for exact/inexact index bounds | David Storch | 2013-11-22 | 1 | -2/+3 |
| | | | | | Signed-off-by: Matt Kangas <matt.kangas@mongodb.com> | ||||
| * | SERVER-10026 break planner into four pieces | Hari Khalsa | 2013-11-21 | 1 | -0/+159 |
 |
index : delta/mongo.git | |
| github.com: mongodb/mongo.git |
| summaryrefslogtreecommitdiff |