src/base/circular_queue.hh

90     const uint32_t _capacity;
166         using const_reference = const value_type&;
168         using const_pointer = const value_type*;
179         iterator(const iterator& it)
183         operator=(const iterator& it)
207         dereferenceable() const
220         bool operator==(const iterator& that) const
230         bool operator!=(const iterator& that)
242         const_reference operator*() const
256         const_pointer operator->() const
294         decrementable() const
318         iterator& operator+=(const difference_type& t)
326         iterator& operator-=(const difference_type& t)
341         iterator operator+(const difference_type& t)
347         friend iterator operator+(const difference_type& t, iterator& it)
354         iterator operator-(const difference_type& t)
360         friend iterator operator-(const difference_type& t, iterator& it)
369         difference_type operator-(const iterator& that)
385         operator[](const Idx& index) { return *(*this + index); }
389         operator<(const iterator& that) const
397         operator>(const iterator& that) const
400         bool operator>=(const iterator& that) const
403         bool operator<=(const iterator& that) const
407         size_t idx() const { return _idx; }
434     bool isValidIdx(size_t idx) const
457     bool isValidIdx(size_t idx, uint32_t round) const
493     uint32_t head() const { return _head; }
494     uint32_t tail() const { return _tail; }
495     size_t capacity() const { return _capacity; }
497     uint32_t size() const
507     uint32_t moduloAdd(uint32_t s1, uint32_t s2) const
512     uint32_t moduloSub(uint32_t s1, uint32_t s2) const
578     bool empty() const { return _empty; }
585     bool full() const
603     iterator begin() const
624     iterator end() const