#include #include template class circular_list { public: circular_list(); ~circular_list(); void push(const T& value); T pop(); T peek() const; void print() const; void clear(); inline bool empty() const; private: struct node { T value; node *next; } *head, *tail; std::size_t size; }; int main() { circular_list clist; for(std::size_t i = 0; i < 10; i++) { clist.push(i); } clist.print(); } template circular_list::circular_list():head(nullptr), tail(nullptr), size(0) {} template circular_list::~circular_list() { clear(); } template void circular_list::push(const T& value) { node *tmp = new node; tmp->value = value; tmp->next = head; if(empty()) { head = tail = tmp; } else { tail->next = tmp; tail = tmp; } size++; } template T circular_list::pop() { if(empty()) { throw "EXCEPTION: List is empty!\n"; } node *tmp = head; T value = head->value; head = head->next; delete tmp; size--; return value; } template T circular_list::peek() const { if(empty()) { throw "List is empty!"; } return head->value; } template void circular_list::print() const { node *tmp = head; int tmpsize = size; while(tmpsize) { std::cout << tmp->value << " "; tmp = tmp->next; tmpsize--; } } template inline bool circular_list::empty() const { return !size; } template void circular_list::clear() { while(!empty()) { pop(); } }

Circular list class template