Searched refs:m_lastNodeInserted (Results 1 – 2 of 2) sorted by relevance
72 …Node* lastLeafInserted() const { return m_lastNodeInserted ? &NodeTraversal::lastWithinOrSelf(*m_l… in lastLeafInserted()73 …pastLastLeaf() const { return m_lastNodeInserted ? NodeTraversal::next(NodeTraversal::lastWithinOr… in pastLastLeaf()77 RefPtrWillBeMember<Node> m_lastNodeInserted; variable
344 m_lastNodeInserted = &node; in respondToNodeInsertion()351 if (m_lastNodeInserted.get() == node) in willRemoveNodePreservingChildren()352 …m_lastNodeInserted = node.lastChild() ? node.lastChild() : NodeTraversal::nextSkippingChildren(nod… in willRemoveNodePreservingChildren()357 if (m_firstNodeInserted.get() == node && m_lastNodeInserted.get() == node) { in willRemoveNode()359 m_lastNodeInserted = nullptr; in willRemoveNode()362 } else if (m_lastNodeInserted.get() == node) { in willRemoveNode()363 m_lastNodeInserted = NodeTraversal::previousSkippingChildren(*m_lastNodeInserted); in willRemoveNode()371 if (m_lastNodeInserted.get() == node) in didReplaceNode()372 m_lastNodeInserted = &newNode; in didReplaceNode()