C++ Class Problem

circbuf.h

#ifndef CIRCBUF_H #define CIRCBUF_H #include using std::ostream; #include using std::vector; #include using std::initializer_list; class CircBuf{ private: int sz_; int cnt_; vector buf_; size_t head_; size_t tail_; public: CircBuf(size_t s=10); CircBuf(initializer_list, size_t); long front() const; long back() const; bool full() const; bool empty() const; void add(long); void remove();; friend ostream& operator 
 
 
circbuf_main.cpp
 
#include using std::cout; using std::cin; using std::endl; #include using std::boolalpha; #include using std::string; #include using std::runtime_error; #include "circbuf.h" int main(){ cout   Some Background Our CircularBuffer will be a data structure that stores long. A CircularBuffer is a fixed size FIFO (First In, First Out) data structure. It is essentially a line (a queue). First thing added (the Head position in the diagram) is the first thing read. The next thing added is at the Tail position. It is the last thing added, the last thing that will be readread. The underlying data structure for this approach has a fixed size data structure. It can become empty, it can become full. It does not grow or shrink in size over the course of the run of the program. Head (extract) FIFO as a Circular Buffer Tail (insert) Things you can do with your CircularBuffer:  you can add to the CircularBuffer. An element is added at the Tail position. The write position is then advanced (clockwise in the diagram you can remove an element. The element at the Head position is removed. The Head position is then advanced (clockwise in the diagram) you can test if it is full you can test if it is empty. you can report the front element you can report the back element