Lines Matching full:back_
321 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
336 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
342 if (front_ > back_) front_ = back_ = order_[s];
343 else if (order_[s] > back_) back_ = order_[s];
350 while ((front_ <= back_) && (state_[front_] == kNoStateId)) ++front_;
355 bool Empty() const { return front_ > back_; }
358 for (StateId i = front_; i <= back_; ++i) state_[i] = kNoStateId;
359 back_ = kNoStateId;
365 StateId back_;
389 : QueueBase<S>(STATE_ORDER_QUEUE), front_(0), back_(kNoStateId) {}
394 if (front_ > back_) front_ = back_ = s;
395 else if (s > back_) back_ = s;
403 while ((front_ <= back_) && (enqueued_[front_] == false)) ++front_;
408 bool Empty() const { return front_ > back_; }
411 for (StateId i = front_; i <= back_; ++i) enqueued_[i] = false;
413 back_ = kNoStateId;
418 StateId back_;
448 back_(kNoStateId) {}
451 while ((front_ <= back_) &&
464 if (front_ > back_) front_ = back_ = scc_[s];
465 else if (scc_[s] > back_) back_ = scc_[s];
489 if (front_ < back_) // Queue scc # back_ not empty unless back_==front_
491 else if (front_ > back_)
501 for (StateId i = front_; i <= back_; ++i)
507 back_ = kNoStateId;
514 StateId back_;
