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