Searched refs:front_index_ (Results 1 – 3 of 3) sorted by relevance
217 front_index_(0), in Ring()231 bool empty() const { return back_index_ == front_index_; } in empty()236 return front_index_ != CircularIncrement(back_index_); in CanPush()241 DCHECK_NE(CircularDecrement(front_index_), back_index_); in push_front()242 new (&data_[front_index_]) T(std::move(t)); in push_front()243 front_index_ = CircularDecrement(front_index_); in push_front()252 bool CanPop() const { return front_index_ != back_index_; } in CanPop()256 front_index_ = CircularIncrement(front_index_); in pop_front()257 data_[front_index_].~T(); in pop_front()262 return data_[CircularIncrement(front_index_)]; in front()[all …]
34 : error_reporter_(error_reporter), front_index_(0), size_(0) {} in PreviousResultsQueue()51 Result& front() { return results_[front_index_]; } in front()53 int back_index = front_index_ + (size_ - 1); in back()76 front_index_ += 1; in pop_front()77 if (front_index_ >= kMaxResults) { in pop_front()78 front_index_ = 0; in pop_front()92 int index = front_index_ + offset; in from_front()104 int front_index_; variable
1207 TaggedNodeReadyQueue() : front_index_(0) {} in TaggedNodeReadyQueue()1211 DCHECK_LT(front_index_, ready_.size()); in front()1212 return ready_[front_index_]; in front()1215 DCHECK_LT(front_index_, ready_.size()); in pop_front()1216 front_index_++; in pop_front()1217 if ((front_index_ == ready_.size()) || (front_index_ > 16384)) { in pop_front()1218 if (front_index_ == ready_.size()) { in pop_front()1223 ready_.erase(ready_.begin(), ready_.begin() + front_index_); in pop_front()1225 front_index_ = 0; in pop_front()1229 const TaggedNode* begin() const { return ready_.begin() + front_index_; } in begin()[all …]