Searched refs:m_lastNodeInserted (Results 1 – 2 of 2) sorted by relevance
69 …Node& lastLeafInserted() const { ASSERT(m_lastNodeInserted); return m_lastNodeInserted->lastDescen… in lastLeafInserted()70 …Node* pastLastLeaf() const { return m_lastNodeInserted ? NodeTraversal::next(lastLeafInserted()) :… in pastLastLeaf()74 RefPtr<Node> m_lastNodeInserted; variable
329 m_lastNodeInserted = &node; in respondToNodeInsertion()336 if (m_lastNodeInserted == node) in willRemoveNodePreservingChildren()337 …m_lastNodeInserted = node.lastChild() ? node.lastChild() : NodeTraversal::nextSkippingChildren(nod… in willRemoveNodePreservingChildren()342 if (m_firstNodeInserted == node && m_lastNodeInserted == node) { in willRemoveNode()344 m_lastNodeInserted = 0; in willRemoveNode()347 } else if (m_lastNodeInserted == node) { in willRemoveNode()348 m_lastNodeInserted = NodeTraversal::previousSkippingChildren(*m_lastNodeInserted); in willRemoveNode()356 if (m_lastNodeInserted == node) in didReplaceNode()357 m_lastNodeInserted = &newNode; in didReplaceNode()