, including all inherited members.
| _alloc(int bytes) | mongo::BucketBasics | [protected] |
| _delKeyAtPos(int keypos, bool mayEmpty=false) | mongo::BucketBasics | [protected] |
| _insert(const DiskLoc thisLoc, const DiskLoc recordLoc, const BSONObj &key, const Ordering &order, bool dupsAllowed, const DiskLoc lChild, const DiskLoc rChild, IndexDetails &idx) const | mongo::BtreeBucket | [protected] |
| _pack(const DiskLoc thisLoc, const Ordering &order, int &refPos) const | mongo::BucketBasics | [protected] |
| _packReadyForMod(const Ordering &order, int &refPos) | mongo::BucketBasics | [protected] |
| _pushBack(const DiskLoc recordLoc, const BSONObj &key, const Ordering &order, const DiskLoc prevChild) | mongo::BucketBasics | [protected] |
| _reserved1 | mongo::BtreeData | [protected] |
| _shape(int level, stringstream &) const | mongo::BucketBasics | [protected] |
| _unalloc(int bytes) | mongo::BucketBasics | [protected] |
| _wasSize | mongo::BtreeData | [protected] |
| a_test(IndexDetails &) | mongo::BtreeBucket | [static] |
| addBucket(const IndexDetails &) | mongo::BtreeBucket | [static] |
| advance(const DiskLoc &thisLoc, int &keyOfs, int direction, const char *caller) const | mongo::BtreeBucket | |
| advanceTo(DiskLoc &thisLoc, int &keyOfs, const BSONObj &keyBegin, int keyBeginLen, bool afterKey, const vector< const BSONElement * > &keyEnd, const vector< bool > &keyEndInclusive, const Ordering &order, int direction) const | mongo::BtreeBucket | |
| allocTemp() | mongo::BtreeBucket | [protected, static] |
| assertValid(const Ordering &order, bool force=false) const | mongo::BucketBasics | |
| assertValid(const BSONObj &orderObj, bool force=false) const | mongo::BucketBasics | [inline] |
| assertWritable() | mongo::BucketBasics | |
| basicInsert(const DiskLoc thisLoc, int &keypos, const DiskLoc recordLoc, const BSONObj &key, const Ordering &order) const | mongo::BucketBasics | [protected] |
| bodySize() | mongo::BucketBasics | [inline, static] |
| bt_insert(const DiskLoc thisLoc, const DiskLoc recordLoc, const BSONObj &key, const Ordering &order, bool dupsAllowed, IndexDetails &idx, bool toplevel=true) const | mongo::BtreeBucket | |
| BtreeCursor class | mongo::BtreeBucket | [friend] |
| bucketSummary() const | mongo::BtreeBucket | |
| canMergeChildren(const DiskLoc &thisLoc, int leftIndex) const | mongo::BtreeBucket | [protected] |
| childForPos(int p) const | mongo::BucketBasics | [inline, protected] |
| childForPos(int p) | mongo::BucketBasics | [inline, protected] |
| customBSONCmp(const BSONObj &l, const BSONObj &rBegin, int rBeginLen, bool rSup, const vector< const BSONElement * > &rEnd, const vector< bool > &rEndInclusive, const Ordering &o, int direction) | mongo::BtreeBucket | [protected, static] |
| customFind(int l, int h, const BSONObj &keyBegin, int keyBeginLen, bool afterKey, const vector< const BSONElement * > &keyEnd, const vector< bool > &keyEndInclusive, const Ordering &order, int direction, DiskLoc &thisLoc, int &keyOfs, pair< DiskLoc, int > &bestParent) const | mongo::BtreeBucket | [protected] |
| customLocate(DiskLoc &thisLoc, int &keyOfs, const BSONObj &keyBegin, int keyBeginLen, bool afterKey, const vector< const BSONElement * > &keyEnd, const vector< bool > &keyEndInclusive, const Ordering &order, int direction, pair< DiskLoc, int > &bestParent) const | mongo::BtreeBucket | |
| data | mongo::BtreeData | [protected] |
| dataAt(short ofs) | mongo::BucketBasics | [inline, protected] |
| deallocBucket(const DiskLoc thisLoc, const IndexDetails &id) | mongo::BtreeBucket | |
| delBucket(const DiskLoc thisLoc, const IndexDetails &) | mongo::BtreeBucket | [protected] |
| deleteInternalKey(const DiskLoc thisLoc, int keypos, IndexDetails &id, const Ordering &order) | mongo::BtreeBucket | [protected] |
| delKeyAtPos(const DiskLoc thisLoc, IndexDetails &id, int p, const Ordering &order) | mongo::BtreeBucket | [protected] |
| doBalanceChildren(const DiskLoc thisLoc, int leftIndex, IndexDetails &id, const Ordering &order) | mongo::BtreeBucket | [protected] |
| doBalanceLeftToRight(const DiskLoc thisLoc, int leftIndex, int split, BtreeBucket *l, const DiskLoc lchild, BtreeBucket *r, const DiskLoc rchild, IndexDetails &id, const Ordering &order) | mongo::BtreeBucket | [protected] |
| doBalanceRightToLeft(const DiskLoc thisLoc, int leftIndex, int split, BtreeBucket *l, const DiskLoc lchild, BtreeBucket *r, const DiskLoc rchild, IndexDetails &id, const Ordering &order) | mongo::BtreeBucket | [protected] |
| doMergeChildren(const DiskLoc thisLoc, int leftIndex, IndexDetails &id, const Ordering &order) | mongo::BtreeBucket | [protected] |
| dropFront(int nDrop, const Ordering &order, int &refPos) | mongo::BucketBasics | [protected] |
| dump() const | mongo::BtreeBucket | |
| dumpTree(const DiskLoc &thisLoc, const BSONObj &order) const | mongo::BtreeBucket | |
| dupKeyError(const IndexDetails &idx, const BSONObj &key) | mongo::BtreeBucket | [static] |
| emptySize | mongo::BtreeData | [protected] |
| exists(const IndexDetails &idx, const DiskLoc &thisLoc, const BSONObj &key, const Ordering &order) const | mongo::BtreeBucket | |
| find(const IndexDetails &idx, const BSONObj &key, const DiskLoc &recordLoc, const Ordering &order, int &pos, bool assertIfDup) const | mongo::BtreeBucket | [protected] |
| findLargestKey(const DiskLoc &thisLoc, DiskLoc &largestLoc, int &largestKey) | mongo::BtreeBucket | [protected, static] |
| findSingle(const IndexDetails &indexdetails, const DiskLoc &thisLoc, const BSONObj &key) const | mongo::BtreeBucket | |
| fix(const DiskLoc thisLoc, const DiskLoc child) | mongo::BtreeBucket | [protected, static] |
| fixParentPtrs(const DiskLoc thisLoc, int firstIndex=0, int lastIndex=-1) const | mongo::BtreeBucket | [protected] |
| flags | mongo::BtreeData | [protected] |
| Flags enum name | mongo::BucketBasics | [protected] |
| fullValidate(const DiskLoc &thisLoc, const BSONObj &order, int *unusedCount=0, bool strict=false) const | mongo::BtreeBucket | |
| getHead(const DiskLoc &thisLoc) const | mongo::BtreeBucket | |
| getKeyMax() | mongo::BtreeBucket | [static] |
| getLowWaterMark() | mongo::BtreeBucket | [static] |
| getNextChild() const | mongo::BucketBasics | [inline] |
| headerSize() | mongo::BucketBasics | [inline, static] |
| indexInParent(const DiskLoc &thisLoc) const | mongo::BtreeBucket | [protected] |
| init() | mongo::BucketBasics | [protected] |
| insertHere(const DiskLoc thisLoc, int keypos, const DiskLoc recordLoc, const BSONObj &key, const Ordering &order, const DiskLoc lchild, const DiskLoc rchild, IndexDetails &idx) const | mongo::BtreeBucket | [protected] |
| isHead() const | mongo::BtreeBucket | [inline] |
| isUsed(int i) const | mongo::BtreeBucket | [inline] |
| k(int i) const | mongo::BucketBasics | [inline, protected] |
| k(int i) | mongo::BucketBasics | [inline, protected] |
| keyAt(int keyOfs) const | mongo::BtreeBucket | [inline, protected] |
| keyNode(int i) const | mongo::BucketBasics | [inline] |
| locate(const IndexDetails &idx, const DiskLoc &thisLoc, const BSONObj &key, const Ordering &order, int &pos, bool &found, const DiskLoc &recordLoc, int direction=1) const | mongo::BtreeBucket | |
| markUnused(int keypos) | mongo::BucketBasics | [protected] |
| mayBalanceWithNeighbors(const DiskLoc thisLoc, IndexDetails &id, const Ordering &order) const | mongo::BtreeBucket | [protected] |
| mayDropKey(int index, int refPos) const | mongo::BucketBasics | [protected] |
| n | mongo::BtreeData | [protected] |
| nextChild | mongo::BtreeData | [protected] |
| nKeys() const | mongo::BucketBasics | [inline] |
| Packed enum value | mongo::BucketBasics | [protected] |
| packedDataSize(int refPos) const | mongo::BucketBasics | [protected] |
| parent | mongo::BtreeData | [protected] |
| popBack(DiskLoc &recLoc, BSONObj &key) | mongo::BucketBasics | [protected] |
| pushBack(const DiskLoc recordLoc, const BSONObj &key, const Ordering &order, const DiskLoc prevChild) | mongo::BucketBasics | [inline, protected] |
| rebalancedSeparatorPos(const DiskLoc &thisLoc, int leftIndex) const | mongo::BtreeBucket | [protected] |
| renameIndexNamespace(const char *oldNs, const char *newNs) | mongo::BtreeBucket | [static] |
| replaceWithNextChild(const DiskLoc thisLoc, IndexDetails &id) | mongo::BtreeBucket | [protected] |
| reserved | mongo::BtreeData | [protected] |
| reserveKeysFront(int nAdd) | mongo::BucketBasics | [protected] |
| setInternalKey(const DiskLoc thisLoc, int keypos, const DiskLoc recordLoc, const BSONObj &key, const Ordering &order, const DiskLoc lchild, const DiskLoc rchild, IndexDetails &idx) | mongo::BtreeBucket | [protected] |
| setKey(int i, const DiskLoc recordLoc, const BSONObj &key, const DiskLoc prevChildBucket) | mongo::BucketBasics | [protected] |
| setNotPacked() | mongo::BucketBasics | [inline, protected] |
| setPacked() | mongo::BucketBasics | [inline, protected] |
| shape(stringstream &) const | mongo::BtreeBucket | |
| Size() const | mongo::BucketBasics | [protected] |
| split(const DiskLoc thisLoc, int keypos, const DiskLoc recordLoc, const BSONObj &key, const Ordering &order, const DiskLoc lchild, const DiskLoc rchild, IndexDetails &idx) | mongo::BtreeBucket | [protected] |
| splitPos(int keypos) const | mongo::BucketBasics | [protected] |
| tempNext() const | mongo::BucketBasics | [inline, protected] |
| tempNext() | mongo::BucketBasics | [inline, protected] |
| topSize | mongo::BtreeData | [protected] |
| totalDataSize() const | mongo::BucketBasics | [protected] |
| truncateTo(int N, const Ordering &order, int &refPos) | mongo::BucketBasics | [protected] |
| tryBalanceChildren(const DiskLoc thisLoc, int leftIndex, IndexDetails &id, const Ordering &order) const | mongo::BtreeBucket | [protected] |
| unindex(const DiskLoc thisLoc, IndexDetails &id, const BSONObj &key, const DiskLoc recordLoc) const | mongo::BtreeBucket | |
| wouldCreateDup(const IndexDetails &idx, const DiskLoc &thisLoc, const BSONObj &key, const Ordering &order, const DiskLoc &self) const | mongo::BtreeBucket | |
