Lines Matching defs:front_
106 TrivialQueue() : QueueBase<S>(TRIVIAL_QUEUE), front_(kNoStateId) {}
107 StateId Head() const { return front_; }
108 void Enqueue(StateId s) { front_ = s; }
109 void Dequeue() { front_ = kNoStateId; }
111 bool Empty() const { return front_ == kNoStateId; }
112 void Clear() { front_ = kNoStateId; }
123 StateId front_;
292 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
305 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
308 StateId Head() const { return state_[front_]; }
311 if (front_ > back_) front_ = back_ = order_[s];
313 else if (order_[s] < front_) front_ = order_[s];
318 state_[front_] = kNoStateId;
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;
329 front_ = 0;
333 StateId front_;
356 : QueueBase<S>(STATE_ORDER_QUEUE), front_(0), back_(kNoStateId) {}
358 StateId Head() const { return front_; }
361 if (front_ > back_) front_ = back_ = s;
363 else if (s < front_) front_ = s;
369 enqueued_[front_] = false;
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;
379 front_ = 0;
384 StateId front_;
411 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0),
415 while ((front_ <= back_) &&
416 (((*queue_)[front_] && (*queue_)[front_]->Empty())
417 || (((*queue_)[front_] == 0) &&
418 ((front_ > (StateId)trivial_queue_.size())
419 || (trivial_queue_[front_] == kNoStateId)))))
420 ++front_;
421 if (front_ > back_)
423 if ((*queue_)[front_])
424 return (*queue_)[front_]->Head();
426 return trivial_queue_[front_];
430 if (front_ > back_) front_ = back_ = scc_[s];
432 else if (scc_[s] < front_) front_ = scc_[s];
443 if (front_ > back_)
445 if ((*queue_)[front_])
446 (*queue_)[front_]->Dequeue();
447 else if (front_ < (StateId)trivial_queue_.size())
448 trivial_queue_[front_] = kNoStateId;
457 if (front_ < back_) // Queue scc # back_ not empty unless back_==front_
459 else if (front_ > back_)
461 else if ((*queue_)[front_])
462 return (*queue_)[front_]->Empty();
464 return (front_ > (StateId)trivial_queue_.size())
465 || (trivial_queue_[front_] == kNoStateId);
469 for (StateId i = front_; i <= back_; ++i)
474 front_ = 0;
481 mutable StateId front_;
