32#ifndef GTEST_SAMPLES_SAMPLE3_INL_H_
33#define GTEST_SAMPLES_SAMPLE3_INL_H_
48 friend class Queue<E>;
90 if (node ==
nullptr)
break;
142 E* element =
new E(old_head->
element());
151 template <
typename F>
155 node = node->
next_) {
156 new_queue->
Enqueue(function(node->element()));
const QueueNode & operator=(const QueueNode &)
const QueueNode * next() const
QueueNode(const E &an_element)
QueueNode(const QueueNode &)
const E & element() const
const QueueNode< E > * Head() const
Queue * Map(F function) const
const QueueNode< E > * Last() const
const Queue & operator=(const Queue &)
void Enqueue(const E &element)