c++中怎么实现一个环形缓冲区(ring buffer)_c++环形队列实现方法

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

// 写入一个元素
bool push(const T& item) {
    if (full) return false;
    buffer[head] = item;
    head = (head + 1) % N;
    if (head == tail) {
        full = true;
    }
    return true;
}

// 读取一个元素
bool pop(T& item) {
    if (empty()) return false;
    item = buffer[tail];
    tail = (tail + 1) % N;
    full = false;
    return true;
}

// 返回当前元素数量
size_t size() const {
    if (full) return N;
    return (head >= tail) ? (head - tail) : (N - tail + head);
}

#include <iostream>
<p>int main() {
RingBuffer<int, 4> rb;</p><pre class='brush:php;toolbar:false;'>rb.push(1);
rb.push(2);
rb.push(3);

int val;
while (rb.pop(val)) {
    std::cout << val << " ";
}
// 输出：1 2 3
return 0;