Skip to content

Instantly share code, notes, and snippets.

@Yoplitein
Last active August 11, 2022 04:51
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save Yoplitein/1ecbb4ce10219b95338c0d1519532f10 to your computer and use it in GitHub Desktop.
Save Yoplitein/1ecbb4ce10219b95338c0d1519532f10 to your computer and use it in GitHub Desktop.
Fixed-capacity ring buffer type
struct RingBuffer(T, size_t _capacity)
{
import core.lifetime: move;
private
{
T[capacity] buffer;
size_t read;
size_t write;
size_t len; // keep it simple :^)
}
invariant(read < capacity);
invariant(write < capacity);
invariant(len <= capacity);
enum capacity = _capacity;
size_t length() { return len; }
void push(T rhs)
{
if(len == capacity) pop;
buffer[write++] = move(rhs);
write %= capacity;
len++;
}
T pop()
{
scope(exit) read %= capacity;
len--;
return move(buffer[read++]);
}
auto range()
{
static struct Range
{
private
{
T[] buffer;
size_t read, len;
}
bool empty() { return len == 0; }
size_t length() { return len; }
ref T front()
in(!empty)
{
return buffer[read];
}
void popFront()
{
len--;
read = (read + 1) % capacity;
}
}
return Range(buffer[], read, len);
}
int opApply(scope int delegate(size_t index, ref T element) dg)
{
auto ptr = read;
foreach(i; 0 .. len)
{
if(auto res = dg(i, buffer[ptr++]))
return res;
ptr %= capacity;
}
return 0;
}
int opApply(scope int delegate(ref T element) dg)
{
foreach(_, ref v; this)
if(auto res = dg(v))
return res;
return 0;
}
}
unittest
{
import std.algorithm: equal;
RingBuffer!(int, 3) ints;
static assert(ints.capacity == 3);
assert(ints.length == 0);
ints.push(1);
assert(ints.length == 1);
assert(ints.range.equal([1]));
ints.push(2);
ints.push(3);
assert(ints.length == 3);
assert(ints.range.equal([1, 2, 3]));
ints.push(4);
assert(ints.length == 3);
assert(ints.range.equal([2, 3, 4]));
assert(ints.pop() == 2);
assert(ints.pop() == 3);
assert(ints.pop() == 4);
assert(ints.length == 0);
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment