32#ifndef GOOGLETEST_SAMPLES_SAMPLE3_INL_H_
33#define GOOGLETEST_SAMPLES_SAMPLE3_INL_H_
47 friend class Queue<E>;
51 const E&
element()
const {
return element_; }
61 : element_(an_element), next_(nullptr) {}
75 Queue() : head_(nullptr), last_(nullptr), size_(0) {}
89 if (node ==
nullptr)
break;
94 head_ = last_ =
nullptr;
100 size_t Size()
const {
return size_; }
118 head_ = last_ = new_node;
121 last_->next_ = new_node;
135 head_ = head_->next_;
141 E* element =
new E(old_head->
element());
150 template <
typename F>
154 node = node->next_) {
155 new_queue->
Enqueue(function(node->element()));
const QueueNode< E > * Head() const
Queue * Map(F function) const
const QueueNode< E > * Last() const
void Enqueue(const E &element)
const QueueNode * next() const
const E & element() const