15#if __has_include("defs.h")
26 using value_type =
typename T;
27 using reference =
typename T&;
28 using const_reference =
typename T
const&;
29 using size_type =
typename size_t;
36 using difference_type = std::ptrdiff_t;
38 using reference = T
const&;
39 using pointer = T
const*;
40 using iterator_category = std::bidirectional_iterator_tag;
51 if (pos == (
size_t)(-1))
52 throw std::range_error (
"Ring buffer iterator at end!");
53 return ring->buf[pos];
59 if (pos == (
size_t)(-1))
60 throw std::range_error (
"Ring buffer iterator at end!");
61 return ring->buf[pos];
67 if (pos == (
size_t)(-1))
68 throw std::range_error (
"Ring buffer iterator at end!");
69 return &ring->buf[pos];
75 if (pos == (
size_t)(-1))
76 throw std::range_error (
"Ring buffer iterator at end!");
77 return &ring->buf[pos];
84 pos = ring->increment (pos);
91 pos = ring->increment (pos);
99 pos = ring->decrement (pos);
106 pos = ring->decrement (pos);
113 return (ring == it.ring) && (pos == it.pos);
137 tmp.pos = ring->add (pos, inc);
144 pos = ring->add (pos, inc);
152 tmp.pos = ring->subtract (pos, dec);
159 pos = ring->subtract (pos, dec);
166 assert (ring == other.ring);
167 size_t p1 = (pos != -1) ? pos
168 : (ring->back_idx == ring->front_idx) ? ring->sz
170 size_t p2 = (other.pos != -1) ? other.pos
171 : (ring->back_idx == ring->front_idx) ? ring->sz
176 return ring->cap - p2 + p1;
182 , pos (ring->sz?pos_: -1)
195 using difference_type = std::ptrdiff_t;
196 using value_type = T;
197 using reference = T&;
199 using iterator_category = std::bidirectional_iterator_tag;
298 : buf (std::unique_ptr<T[]> (new T[
size]))
315 : front_idx (other.front_idx)
316 , back_idx (other.back_idx)
322 buf = std::unique_ptr<T[]> (new T[other.cap]);
323 for (size_t i = 0; i < sz; i++)
325 size_t idx = (front_idx + i) % cap;
326 buf[idx] = other.buf[idx];
333 : buf (std::unique_ptr<T[]> (new T[il.
size ()]))
340 for (
const auto v : il)
341 buf[i++] = std::move (v);
349 front_idx = rhs.front_idx;
350 back_idx = rhs.back_idx;
355 buf.reset (
new T[rhs.cap]);
356 for (
size_t i = 0; i < sz; i++)
358 size_t idx = (front_idx + i) % cap;
359 buf[idx] = rhs.buf[idx];
371 if (cap == other.cap && sz == other.sz)
373 for (
size_t i = 0; i < sz; i++)
375 size_t idx1 = (front_idx + i) % cap;
376 size_t idx2 = (other.front_idx + i) % other.cap;
377 if (buf[idx1] != other.buf[idx2])
392 operator std::vector<T> ()
const
394 std::vector<T> v (sz);
395 for (
size_t i = 0; i < sz; i++)
396 v[i] = buf[(front_idx + i) % cap];
407 if (sz && back_idx == front_idx)
408 front_idx = (front_idx + 1) % cap;
411 buf[back_idx] = item;
412 back_idx = (back_idx + 1) % cap;
436 return iterator (
this, (
size_t)(-1));
456 throw std::range_error (
"ring_buffer::pop_front - empty container");
458 front_idx = (front_idx + 1) % cap;
467 throw std::range_error (
"ring_buffer::front - empty container");
469 return buf[front_idx];
477 throw std::range_error (
"ring_buffer::front - empty container");
479 return buf[front_idx];
487 throw std::range_error (
"ring_buffer::back - empty container");
489 return buf[(back_idx + cap - 1) % cap];
497 throw std::range_error (
"ring_buffer::back - empty container");
499 return buf[(back_idx + cap - 1) % cap];
507 if (ptr.ring !=
this)
508 throw std::runtime_error (
"ring_buffer<>::erase - Invalid iterator");
512 size_t pos = ptr.pos == (size_t)-1 ? back_idx : ptr.pos;
514 if ((front_idx < back_idx && (pos < front_idx || pos >= back_idx))
515 || (front_idx > back_idx && (pos < back_idx || pos >= front_idx)))
516 throw std::range_error (
"ring_buffer<>::erase - Bad iterator position");
518 for (
auto p = pos; p != front_idx; )
520 auto pp = decrement (p);
521 assert (pp != (
size_t)-1);
526 if (pos == front_idx)
527 pos = increment (pos);
528 front_idx = (front_idx + 1) % cap;
535 front_idx = back_idx;
560 std::unique_ptr<T[]> newbuf (new_cap ?
new T[new_cap] :
nullptr);
565 for (
size_t i = 0; i < sz; i++)
566 newbuf[i] = buf[(front_idx + i) % cap];
573 back_idx = cap ? (front_idx + sz) % cap : 0;
584 size_t increment (
size_t pos)
const
586 if (cap && pos != (
size_t)-1)
587 pos = (pos + 1) % cap;
594 size_t decrement (
size_t pos)
const
598 if (pos == (
size_t)-1)
599 pos = (back_idx + cap - 1) % cap;
600 else if (pos != front_idx)
601 pos = (pos + cap - 1) % cap;
607 size_t add (
size_t oldpos,
size_t delta)
const
609 if (cap && oldpos != -1)
611 size_t np = oldpos + (delta % cap);
612 if (np >= cap && np >= back_idx + cap)
622 size_t subtract (
size_t oldpos,
size_t delta)
const
626 size_t np = (oldpos == (size_t)-1 ? back_idx : oldpos) - (delta % cap) + cap;
636 std::unique_ptr<T[]> buf;
Iterator through the circular buffer.
Definition ringbuf.h:33
bool operator!=(const const_iterator &it) const
Inequality comparison.
Definition ringbuf.h:117
const_iterator()
Default constructor.
Definition ringbuf.h:43
const_iterator & operator+=(size_t inc)
Addition assignment operator.
Definition ringbuf.h:142
const_iterator & operator--()
Decrement operator (prefix)
Definition ringbuf.h:104
const_iterator & operator=(const const_iterator &rhs)
Assignment operator.
Definition ringbuf.h:123
reference operator*()
Dereference operator.
Definition ringbuf.h:49
const_iterator operator-(size_t dec) const
Subtraction operator.
Definition ringbuf.h:149
const pointer operator->() const
Object pointer (const version)
Definition ringbuf.h:73
pointer operator->()
Object pointer.
Definition ringbuf.h:65
const_iterator & operator-=(size_t dec)
Subtraction assignment operator.
Definition ringbuf.h:157
const_iterator operator+(size_t inc) const
Addition operator.
Definition ringbuf.h:134
bool operator==(const const_iterator &it) const
Equality comparison.
Definition ringbuf.h:111
const_iterator & operator++()
Increment operator (prefix)
Definition ringbuf.h:89
iterator()
Default constructor.
Definition ringbuf.h:203
reference operator*()
Dereference operator.
Definition ringbuf.h:212
iterator & operator++()
Increment operator (prefix)
Definition ringbuf.h:230
iterator & operator--()
Decrement operator (prefix)
Definition ringbuf.h:243
iterator operator+(size_t inc) const
Addition operator.
Definition ringbuf.h:257
iterator & operator=(const const_iterator &rhs)
Assignment operator.
Definition ringbuf.h:250
iterator & operator-=(size_t dec)
Subtraction assignment operator.
Definition ringbuf.h:276
iterator operator-(size_t dec) const
Subtraction operator.
Definition ringbuf.h:270
iterator & operator+=(size_t inc)
Addition assignment operator.
Definition ringbuf.h:263
pointer operator->()
Object pointer.
Definition ringbuf.h:218
Circular buffer.
Definition ringbuf.h:24
void pop_front()
Remove oldest element from buffer.
Definition ringbuf.h:452
void clear(void)
Remove all elements from buffer.
Definition ringbuf.h:533
size_t size() const
Return number of elements in buffer.
Definition ringbuf.h:577
ring_buffer(const ring_buffer &other)
Copy constructor.
Definition ringbuf.h:314
T & front()
Return a reference to first (oldest) element in buffer.
Definition ringbuf.h:463
void push_back(const T &item)
Inserts new element in buffer.
Definition ringbuf.h:402
ring_buffer()
Default constructor.
Definition ringbuf.h:306
bool empty(void) const
Return true if buffer is empty.
Definition ringbuf.h:540
const T & front() const
Return a reference to first (oldest) element in buffer.
Definition ringbuf.h:473
ring_buffer(std::initializer_list< T > il)
Initializer list constructor.
Definition ringbuf.h:332
bool full(void) const
Return true if buffer is full.
Definition ringbuf.h:546
const_iterator begin() const
Return a const iterator pointing to first (oldest) element in buffer.
Definition ringbuf.h:422
void resize(size_t new_cap)
(Re)allocate buffer with a different capacity
Definition ringbuf.h:558
const T & back() const
Return reference to last (newest) element in buffer.
Definition ringbuf.h:493
size_t capacity() const
Return maximum buffer size.
Definition ringbuf.h:552
const_iterator cbegin()
Return a const iterator pointing to first (oldest) element in buffer.
Definition ringbuf.h:428
iterator end()
Return an iterator pointing past the last (newest) element in buffer.
Definition ringbuf.h:434
T & back()
Return reference to last (newest) element in buffer.
Definition ringbuf.h:483
const_iterator end() const
Return a const iterator pointing past the last (newest) element in buffer.
Definition ringbuf.h:440
iterator erase(const_iterator &ptr)
Definition ringbuf.h:504
ring_buffer(size_t size)
Constructor.
Definition ringbuf.h:297
const_iterator cend()
Return an iterator pointing past the last (newest) element in buffer.
Definition ringbuf.h:446
iterator begin()
Return an iterator pointing to first (oldest) element in buffer.
Definition ringbuf.h:416
bool operator!=(const timeval &t1, const timeval &t2)
"Not equal" operator
Definition tvops.h:73
bool operator==(const timeval &t1, const timeval &t2)
Equality operator.
Definition tvops.h:31