47     void insertAfter(NODE* node, NODE* newNode) {  in insertAfter()  argument
48         newNode->prev = node;  in insertAfter()
49         newNode->next = node->next;  in insertAfter()
50         if (node->next == 0) mLast = newNode;  in insertAfter()
51         else                 node->next->prev = newNode;  in insertAfter()
52         node->next = newNode;  in insertAfter()
55     void insertBefore(NODE* node, NODE* newNode) {  in insertBefore()  argument
56          newNode->prev = node->prev;  in insertBefore()
57          newNode->next = node;  in insertBefore()
58          if (node->prev == 0)   mFirst = newNode;  in insertBefore()
59          else                   node->prev->next = newNode;  in insertBefore()
60          node->prev = newNode;  in insertBefore()
86     NODE* remove(NODE* node) {  in remove()  argument
87         if (node->prev == 0)    mFirst = node->next;  in remove()
88         else                    node->prev->next = node->next;  in remove()
89         if (node->next == 0)    mLast = node->prev;  in remove()
90         else                    node->next->prev = node->prev;  in remove()
91         return node;  in remove()