Lines Matching refs:back_
292 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
305 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
311 if (front_ > back_) front_ = back_ = order_[s];
312 else if (order_[s] > back_) back_ = order_[s];
319 while ((front_ <= back_) && (state_[front_] == kNoStateId)) ++front_;
324 bool Empty() const { return front_ > back_; }
327 for (StateId i = front_; i <= back_; ++i) state_[i] = kNoStateId;
328 back_ = kNoStateId;
334 StateId back_;
356 : QueueBase<S>(STATE_ORDER_QUEUE), front_(0), back_(kNoStateId) {}
361 if (front_ > back_) front_ = back_ = s;
362 else if (s > back_) back_ = s;
370 while ((front_ <= back_) && (enqueued_[front_] == false)) ++front_;
375 bool Empty() const { return front_ > back_; }
378 for (StateId i = front_; i <= back_; ++i) enqueued_[i] = false;
380 back_ = kNoStateId;
385 StateId back_;
412 back_(kNoStateId) {}
415 while ((front_ <= back_) &&
421 if (front_ > back_)
430 if (front_ > back_) front_ = back_ = scc_[s];
431 else if (scc_[s] > back_) back_ = scc_[s];
443 if (front_ > back_)
457 if (front_ < back_) // Queue scc # back_ not empty unless back_==front_
459 else if (front_ > back_)
469 for (StateId i = front_; i <= back_; ++i)
475 back_ = kNoStateId;
482 StateId back_;
