src/base/circular_queue.hh

10  * terms below provided that you ensure that this notice is replicated
15  * modification, are permitted provided that the following conditions are
68  * an element of the vector that is out-of-bounds of the circular queue,
69  * while 'o' represents and element that is inside the bounds. The
70  * characters '[' and ']' are added to mark the entries that hold the head
98      * ambiguity, we need the round number to guarantee that it did not become
138      * iterator implementation to provide the circular-ness that the
196          * index is a valid index to that queue. PTE test is required to
220         bool operator==(const iterator& that) const
222             return _cq == that._cq && _idx == that._idx &&
223                 _round == that._round;
230         bool operator!=(const iterator& that)
232             return !(*this == that);
289          * and we are talking about the past-the-end iterator. In that case,
367          * that + ret == this
369         difference_type operator-(const iterator& that)
372             auto ret = _cq->sub(this->_idx, that._idx, _cq->capacity());
374             if (this->_round != that._round) {
375                 ret += ((this->_round - that._round) * _cq->capacity());
389         operator<(const iterator& that) const
391             assert(_cq && that._cq == _cq);
392             return (this->_round < that._round) ||
393                 (this->_round == that._round && _idx < that._idx);
397         operator>(const iterator& that) const
398         { return !(*this <= that); }
400         bool operator>=(const iterator& that) const
401         { return !(*this < that); }
403         bool operator<=(const iterator& that) const
404         { return !(that < *this); }
462          *          - index <= tail (if index > tail, that would be PTE)
471          *          - index > tail. If index <= tail, that would be BTB:
475          *          - index >= head. If index < head, that would be BTB:
477          *          - head > tail. If head <= tail, that would be BTB:
479          *      Other values of the round meand that the index is PTE or BTB
520      * Check that the queue is not empty. And set it to empty if it
635      * is picked so that isValidIndex(idx, round) is true. If that is not