Lines Matching refs:back_
322 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
337 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
343 if (front_ > back_) front_ = back_ = order_[s];
344 else if (order_[s] > back_) back_ = order_[s];
351 while ((front_ <= back_) && (state_[front_] == kNoStateId)) ++front_;
356 bool Empty() const { return front_ > back_; }
359 for (StateId i = front_; i <= back_; ++i) state_[i] = kNoStateId;
360 back_ = kNoStateId;
366 StateId back_;
390 : QueueBase<S>(STATE_ORDER_QUEUE), front_(0), back_(kNoStateId) {}
395 if (front_ > back_) front_ = back_ = s;
396 else if (s > back_) back_ = s;
404 while ((front_ <= back_) && (enqueued_[front_] == false)) ++front_;
409 bool Empty() const { return front_ > back_; }
412 for (StateId i = front_; i <= back_; ++i) enqueued_[i] = false;
414 back_ = kNoStateId;
419 StateId back_;
449 back_(kNoStateId) {}
452 while ((front_ <= back_) &&
465 if (front_ > back_) front_ = back_ = scc_[s];
466 else if (scc_[s] > back_) back_ = scc_[s];
490 if (front_ < back_) // Queue scc # back_ not empty unless back_==front_
492 else if (front_ > back_)
502 for (StateId i = front_; i <= back_; ++i)
508 back_ = kNoStateId;
515 StateId back_;
