I found this implementation of a ring buffer with a mutex on github. I paste the code for you to read:
#include <cstdio>
#include <memory>
#include <mutex>
template <class T>
class circular_buffer {
public:
explicit circular_buffer(size_t size) :
buf_(std::unique_ptr<T[]>(new T[size])),
max_size_(size)
{
}
void put(T item)
{
std::lock_guard<std::mutex> lock(mutex_);
buf_[head_] = item;
if(full_)
{
tail_ = (tail_ + 1) % max_size_;
}
head_ = (head_ + 1) % max_size_;
full_ = head_ == tail_;
}
T get()
{
std::lock_guard<std::mutex> lock(mutex_);
if(empty())
{
return T();
}
//Read data and advance the tail (we now have a free space)
auto val = buf_[tail_];
full_ = false;
tail_ = (tail_ + 1) % max_size_;
return val;
}
void reset()
{
std::lock_guard<std::mutex> lock(mutex_);
head_ = tail_;
full_ = false;
}
bool empty() const
{
//if head and tail are equal, we are empty
return (!full_ && (head_ == tail_));
}
bool full() const
{
//If tail is ahead the head by 1, we are full
return full_;
}
size_t capacity() const
{
return max_size_;
}
size_t size() const
{
size_t size = max_size_;
if(!full_)
{
if(head_ >= tail_)
{
size = head_ - tail_;
}
else
{
size = max_size_ + head_ - tail_;
}
}
return size;
}
private:
std::mutex mutex_;
std::unique_ptr<T[]> buf_;
size_t head_ = 0;
size_t tail_ = 0;
const size_t max_size_;
bool full_ = 0;
};
int main(void)
{
circular_buffer<uint32_t> circle(10);
printf("\n === CPP Circular buffer check ===\n");
printf("Size: %zu, Capacity: %zu\n", circle.size(), circle.capacity());
uint32_t x = 1;
printf("Put 1, val: %d\n", x);
circle.put(x);
x = circle.get();
printf("Popped: %d\n", x);
printf("Empty: %d\n", circle.empty());
printf("Adding %zu values\n", circle.capacity() - 1);
for(uint32_t i = 0; i < circle.capacity() - 1; i++)
{
circle.put(i);
}
circle.reset();
printf("Full: %d\n", circle.full());
printf("Adding %zu values\n", circle.capacity());
for(uint32_t i = 0; i < circle.capacity(); i++)
{
circle.put(i);
}
printf("Full: %d\n", circle.full());
printf("Reading back values: ");
while(!circle.empty())
{
printf("%u ", circle.get());
}
printf("\n");
printf("Adding 15 values\n");
for(uint32_t i = 0; i < circle.size() + 5; i++)
{
circle.put(i);
}
printf("Full: %d\n", circle.full());
printf("Reading back values: ");
while(!circle.empty())
{
printf("%u ", circle.get());
}
printf("\n");
printf("Empty: %d\n", circle.empty());
printf("Full: %d\n", circle.full());
return 0;
}
At the end of the code chunk you can find a main funcion with an example. There, the queue is initialized with space for 10 elemets as
circular_buffer<uint32_t> circle(10);
As I want to use one of these ring buffers as an object in another class for testing, I have been trying to declare the buffer and then initialize it with a variable indicating the size. This is just an example of what I want to accomplish, as usually done in java:
int size = 20;
circular_buffer<uint16_t> ring;
ring = new circular_buffer<uint16_t>(size);
So far all the things I tried do not compile. Is this possible in C++ with a templated class?
Thanks.