FIFO (computing and electronics): Difference between revisions

Revision as of 14:04, 30 January 2020

Revision as of 14:11, 30 January 2020

Line 37:

public:

void enqueue(T _value) {

auto new_node = back->swap(make_unique<Node>(_value));

back->swap(new_node);

back = &(**back).next;

}