Lines Matching defs:node
46 // QueueNode is a node in a Queue, which consists of an element of
47 // type E and a pointer to the next node.
53 // Gets the element in this node.
56 // Gets the next node in the queue.
61 // Creates a node with a given element value. The next pointer is
86 // 1. Deletes every node.
87 QueueNode<E> * node = head_;
88 QueueNode<E> * next = node->next();
90 delete node;
91 node = next;
92 if (node == NULL) break;
93 next = node->next();
156 for (const QueueNode<E> * node = head_; node != NULL; node = node->next_) {
157 new_queue->Enqueue(function(node->element()));
164 QueueNode<E> * head_; // The first node of the queue.
165 QueueNode<E> * last_; // The last node of the queue.
