36     NODE*  mLast;  variable
39                 LinkedList() : mFirst(0), mLast(0) { }  in LinkedList()
43     NODE const* tail() const { return mLast; }  in tail()
44     NODE*       tail() { return mLast; }  in tail()
49         if (node->next == 0) mLast = newNode;  in insertAfter()
64             mFirst = mLast = newNode;  in insertHead()
75         if (mLast == 0) {  in insertTail()
78             newNode->prev = mLast;  in insertTail()
80             mLast->next = newNode;  in insertTail()
81             mLast = newNode;  in insertTail()
88         if (node->next == 0)    mLast = node->prev;  in remove()