c++如何实现一个环形缓冲区(Ring Buffer)_c++高性能无锁数据结构

#include <atomic>
#include <vector>
<p>template <typename T>
class RingBuffer {
private:
std::vector<T> buffer;
std::atomic<size_t> read_index{0};
std::atomic<size_t> write_index{0};
const size_t capacity;</p><p>public:
explicit RingBuffer(size_t size) : buffer(size), capacity(size) {}</p><pre class="brush:php;toolbar:false;"><pre class="brush:php;toolbar:false;">bool push(const T& item) {
    size_t current_write = write_index.load(std::memory_order_relaxed);
    size_t next_write = (current_write + 1) % capacity;

    if (next_write == read_index.load(std::memory_order_acquire)) {
        return false; // 缓冲区满
    }

    buffer[current_write] = item;
    write_index.store(next_write, std::memory_order_release);
    return true;
}

bool pop(T& item) {
    size_t current_read = read_index.load(std::memory_order_relaxed);

    if (current_read == write_index.load(std::memory_order_acquire)) {
        return false; // 缓冲区空
    }

    item = buffer[current_read];
    size_t next_read = (current_read + 1) % capacity;
    read_index.store(next_read, std::memory_order_release);
    return true;
}

bool empty() const {
    return read_index.load() == write_index.load();
}

bool full() const {
    size_t next_write = (write_index.load() + 1) % capacity;
    return next_write == read_index.load();
}

RingBuffer<int> rb(8);
rb.push(42);
int val;
if (rb.pop(val)) {
    // val == 42
}