Method fastRemove

src/common/classes/tree.h:549–628

Remove item. Current position moves to next item after this call. If next item doesn't exist method returns false

		// Remove item. Current position moves to next item after this call.
		// If next item doesn't exist method returns false
		bool fastRemove()
		{
			// invalidate current position of defaultAccessor
			// if i'm not a defaultAccessor
			if (this != &tree->defaultAccessor)
				tree->defaultAccessor.curr = nullptr;

			if (!tree->level)
			{
				this->curr->remove(this->curPos);
				return this->curPos < this->curr->getCount();
			}
			if (this->curr->getCount() == 1)
			{
				// Only one node left in the current page. We cannot remove it directly
				// because is would invalidate our tree structure
				fb_assert(this->curPos == 0);
				ItemList* temp;
				if ((temp = this->curr->prev) && NEED_MERGE(temp->getCount(), LEAF_COUNT))
				{
					temp = this->curr->next;
					tree->_removePage(0, this->curr);
					this->curr = temp;
					return this->curr;
				}
				if ((temp = this->curr->next) && NEED_MERGE(temp->getCount(), LEAF_COUNT))
				{
					tree->_removePage(0, this->curr);
					this->curr = temp;
					return true;
				}
				if ((temp = this->curr->prev))
				{
					(*this->curr)[0] = (*temp)[temp->getCount() - 1];
					temp->shrink(temp->getCount() - 1);
					this->curr = this->curr->next;
					return this->curr;
				}
				if ((temp = this->curr->next))
				{
					(*this->curr)[0] = (*temp)[0];
					temp->remove(0);
					return true;
				}
				// It means the tree is broken
				fb_assert(false);
				return false;
			}
			this->curr->remove(this->curPos);
			ItemList *temp;
			if ((temp = this->curr->prev) &&
				NEED_MERGE(temp->getCount() + this->curr->getCount(), LEAF_COUNT))
			{
				// After join upper levels of the tree remain stable because join doesn't change
				// key of the page. The same applies to lower case too.
				this->curPos += temp->getCount();
				temp->join(*this->curr);
				tree->_removePage(0, this->curr);