Searched refs:m_lastNodeInserted (Results 1 – 2 of 2) sorted by relevance
72 …Node* lastLeafInserted() const { return m_lastNodeInserted ? &m_lastNodeInserted->lastDescendantOr… in lastLeafInserted()73 …Node* pastLastLeaf() const { return m_lastNodeInserted ? NodeTraversal::next(m_lastNodeInserted->l… in pastLastLeaf()77 RefPtrWillBeMember<Node> m_lastNodeInserted; variable
335 m_lastNodeInserted = &node; in respondToNodeInsertion()342 if (m_lastNodeInserted.get() == node) in willRemoveNodePreservingChildren()343 …m_lastNodeInserted = node.lastChild() ? node.lastChild() : NodeTraversal::nextSkippingChildren(nod… in willRemoveNodePreservingChildren()348 if (m_firstNodeInserted.get() == node && m_lastNodeInserted.get() == node) { in willRemoveNode()350 m_lastNodeInserted = nullptr; in willRemoveNode()353 } else if (m_lastNodeInserted.get() == node) { in willRemoveNode()354 m_lastNodeInserted = NodeTraversal::previousSkippingChildren(*m_lastNodeInserted); in willRemoveNode()362 if (m_lastNodeInserted.get() == node) in didReplaceNode()363 m_lastNodeInserted = &newNode; in didReplaceNode()