Searched refs:m_previousSibling (Results 1 – 6 of 6) sorted by relevance
37 , m_previousSibling(0) in CounterNode()81 CounterNode* previous = m_previousSibling; in previousInPreOrder()94 if (m_previousSibling) in computeCountInParent()95 return m_previousSibling->m_countInParent + increment; in computeCountInParent()133 ASSERT(!newChild->m_previousSibling); in insertAfter()153 newChild->m_previousSibling = refChild; in insertAfter()158 ASSERT(next->m_previousSibling == refChild); in insertAfter()159 next->m_previousSibling = newChild; in insertAfter()178 first->m_previousSibling = newChild; in insertAfter()190 next->m_previousSibling = last; in insertAfter()[all …]
52 CounterNode* previousSibling() const { return m_previousSibling; } in previousSibling()85 CounterNode* m_previousSibling; variable
34 , m_previousSibling(0) in FrameTree()48 Frame* previousSibling() const { return m_previousSibling; } in previousSibling()80 Frame* m_previousSibling; variable
73 child->tree()->m_previousSibling = oldLast; in appendChild()91 …tionForNext = m_firstChild == child ? m_firstChild : child->tree()->m_previousSibling->tree()->m_n… in removeChild()92 …ous = m_lastChild == child ? m_lastChild : child->tree()->m_nextSibling->tree()->m_previousSibling; in removeChild()95 std::swap(newLocationForPrevious, child->tree()->m_previousSibling); in removeChild()97 child->tree()->m_previousSibling = 0; in removeChild()
64 SVGElementInstance* previousSibling() const { return m_previousSibling; } in previousSibling()145 void setPreviousSibling(SVGElementInstance* sibling) { m_previousSibling = sibling; } in setPreviousSibling()156 SVGElementInstance* m_previousSibling; variable
46 , m_previousSibling(0) in SVGElementInstance()