Lines Matching refs: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
85 // 1. Deletes every node.
86 QueueNode<E>* node = head_;
87 QueueNode<E>* next = node->next();
89 delete node;
90 node = next;
91 if (node == NULL) break;
92 next = node->next();
155 for (const QueueNode<E>* node = head_; node != NULL; node = node->next_) {
156 new_queue->Enqueue(function(node->element()));
163 QueueNode<E>* head_; // The first node of the queue.
164 QueueNode<E>* last_; // The last node of the queue.
