Lines Matching defs:erase
16 // individual keys, and insert and erase operations use key intervals as well.
94 // void erase();
238 /// erase - Erase elements [i;j).
239 /// @param i Beginning of the range to erase.
242 void erase(unsigned i, unsigned j, unsigned Size) {
246 /// erase - Erase element at i.
247 /// @param i Index of element to erase.
249 void erase(unsigned i, unsigned Size) {
250 erase(i, i+1, Size);
268 erase(0, Count, Size);
619 this->erase(i, Size);
1558 /// erase - Erase the current interval.
1559 void erase();
1671 erase();
1686 erase();
1696 erase();
1702 erase();
1804 // 2. Extend a to SibLeaf, erase the SibLeaf entry and continue.
1847 /// erase - erase the current interval and move to the next position.
1850 iterator::erase() {
1853 assert(P.valid() && "Cannot erase end()");
1856 IM.rootLeaf().erase(P.leafOffset(), IM.rootSize);
1860 /// treeErase - erase() for a branched tree.
1879 Node.erase(P.leafOffset(), P.leafSize());
1882 // When we erase the last entry, update stop and move to a legal position.
1897 assert(Level && "Cannot erase root node");
1902 IM.rootBranch().erase(P.offset(0), IM.rootSize);
1919 Parent.erase(P.offset(Level), P.size(Level));