C++如何实现一个环形缓冲区_C++高效数据结构与环形缓冲区实现

template <typename T, size_t Capacity>
class RingBuffer {
private:
    T buffer[Capacity];
    size_t read_index = 0;
    size_t write_index = 0;
    bool full = false;
<p>public:
// 判断是否为空
bool empty() const {
return (!full && (read_index == write_index));
}</p><pre class='brush:php;toolbar:false;'>// 判断是否已满
bool is_full() const {
    return full;
}

// 写入一个元素
bool push(const T& item) {
    if (is_full()) return false;

    buffer[write_index] = item;
    write_index = (write_index + 1) % Capacity;

    if (write_index == read_index)
        full = true;

    return true;
}

// 读取一个元素
bool pop(T& item) {
    if (empty()) return false;

    item = buffer[read_index];
    read_index = (read_index + 1) % Capacity;
    full = false; // 只要读了，就不可能还是满的

    return true;
}

// 查看可读数据数量
size_t size() const {
    if (full)
        return Capacity;
    if (write_index >= read_index)
        return write_index - read_index;
    return Capacity - (read_index - write_index);
}

// 清空缓冲区
void reset() {
    read_index = 0;
    write_index = 0;
    full = false;
}

RingBuffer<int, 8> rb;
<p>rb.push(1);
rb.push(2);
rb.push(3);</p><p>int val;
while (rb.pop(val)) {
std::cout << val << " ";
}
// 输出：1 2 3</p>