Lines Matching defs:QueueNode
46 // QueueNode is a node in a Queue, which consists of an element of
49 class QueueNode {
57 QueueNode * next() { return next_; }
58 const QueueNode * next() const { return next_; }
63 QueueNode(const E & element) : element_(element), next_(NULL) {}
66 const QueueNode & operator = (const QueueNode &);
67 QueueNode(const QueueNode &);
70 QueueNode * next_;
87 QueueNode<E> * node = head_;
88 QueueNode<E> * next = node->next();
106 QueueNode<E> * Head() { return head_; }
107 const QueueNode<E> * Head() const { return head_; }
110 QueueNode<E> * Last() { return last_; }
111 const QueueNode<E> * Last() const { return last_; }
118 QueueNode<E> * new_node = new QueueNode<E>(element);
137 const QueueNode<E> * const old_head = head_;
156 for (const QueueNode<E> * node = head_; node != NULL; node = node->next_) {
164 QueueNode<E> * head_; // The first node of the queue.
165 QueueNode<E> * last_; // The last node of the queue.