Lines Matching defs:erase
16 // individual keys, and insert and erase operations use key intervals as well.
94 // void erase();
258 /// erase - Erase elements [i;j).
259 /// @param i Beginning of the range to erase.
262 void erase(unsigned i, unsigned j, unsigned Size) {
266 /// erase - Erase element at i.
267 /// @param i Index of element to erase.
269 void erase(unsigned i, unsigned Size) {
270 erase(i, i+1, Size);
288 erase(0, Count, Size);
639 this->erase(i, Size);
1578 /// erase - Erase the current interval.
1579 void erase();
1691 erase();
1706 erase();
1716 erase();
1722 erase();
1824 // 2. Extend a to SibLeaf, erase the SibLeaf entry and continue.
1867 /// erase - erase the current interval and move to the next position.
1870 iterator::erase() {
1873 assert(P.valid() && "Cannot erase end()");
1876 IM.rootLeaf().erase(P.leafOffset(), IM.rootSize);
1880 /// treeErase - erase() for a branched tree.
1899 Node.erase(P.leafOffset(), P.leafSize());
1902 // When we erase the last entry, update stop and move to a legal position.
1917 assert(Level && "Cannot erase root node");
1922 IM.rootBranch().erase(P.offset(0), IM.rootSize);
1939 Parent.erase(P.offset(Level), P.size(Level));