Lines Matching defs:last
80 CounterNode* last = m_lastChild;
81 if (!last)
84 while (CounterNode* lastChild = last->m_lastChild)
85 last = lastChild;
87 return last;
237 CounterNode* last = newChild->m_lastChild;
246 // counter node being created, it will be inserted as the last child so next is null.
251 last->m_nextSibling = next;
253 next->m_previousSibling = last;
255 m_lastChild = last;
258 if (last == next)
