Lines Matching defs:idx
159 iterator(CircularQueue* cq, uint32_t idx, uint32_t round)
160 : _cq(cq), _idx(idx), _round(round) {}
407 size_t idx() const { return _idx; }
434 bool isValidIdx(size_t idx) const
449 (_head < idx && _tail < idx) ||
450 (_head > idx && _tail > idx)
451 )) || (_tail < idx && idx < _head));
457 bool isValidIdx(size_t idx, uint32_t round) const
482 (round == _round && idx <= _tail && (
483 _head <= idx || _head > _tail)) ||
485 idx > _tail &&
486 idx >= _head &&
573 for (auto idx = 0; idx < len; idx++)
635 * is picked so that isValidIndex(idx, round) is true. If that is not
639 iterator getIterator(size_t idx)
641 assert(isValidIdx(idx) || moduloAdd(_tail, 1) == idx);
646 if (idx > _tail) {
647 if (idx >= _head && _head > _tail) {
650 } else if (idx < _head && _tail + 1 == _capacity) {
653 return iterator(this, idx, round);