Lines Matching full:queue_
448 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0),
453 (((*queue_)[front_] && (*queue_)[front_]->Empty())
454 || (((*queue_)[front_] == 0) &&
458 if ((*queue_)[front_])
459 return (*queue_)[front_]->Head();
468 if ((*queue_)[scc_[s]]) {
469 (*queue_)[scc_[s]]->Enqueue(s);
478 if ((*queue_)[front_])
479 (*queue_)[front_]->Dequeue();
485 if ((*queue_)[scc_[s]])
486 (*queue_)[scc_[s]]->Update(s);
494 else if ((*queue_)[front_])
495 return (*queue_)[front_]->Empty();
503 if ((*queue_)[i])
504 (*queue_)[i]->Clear();
512 vector<Queue*> *queue_;
552 queue_ = new StateOrderQueue<StateId>();
555 queue_ = new TopOrderQueue<StateId>(fst, filter);
558 queue_ = new LifoQueue<StateId>();
580 queue_ = new LifoQueue<StateId>();
589 queue_ = new TopOrderQueue<StateId>(scc_);
622 queue_ = new SccQueue< StateId, QueueBase<StateId> >(scc_, &queues_);
631 delete queue_;
634 StateId Head() const { return queue_->Head(); }
636 void Enqueue(StateId s) { queue_->Enqueue(s); }
638 void Dequeue() { queue_->Dequeue(); }
640 void Update(StateId s) { queue_->Update(s); }
642 bool Empty() const { return queue_->Empty(); }
644 void Clear() { queue_->Clear(); }
648 QueueBase<StateId> *queue_;
812 queue_(queue),
817 ~PruneQueue() { delete queue_; }
819 StateId Head() const { return queue_->Head(); }
831 queue_->Enqueue(s);
834 void Dequeue() { queue_->Dequeue(); }
840 queue_->Update(s);
843 bool Empty() const { return queue_->Empty(); }
844 void Clear() { queue_->Clear(); }
858 Q *queue_;
899 queue_(queue),
902 ~FilterQueue() { delete queue_; }
904 StateId Head() const { return queue_->Head(); }
909 queue_->Enqueue(s);
913 void Dequeue() { queue_->Dequeue(); }
916 bool Empty() const { return queue_->Empty(); }
917 void Clear() { queue_->Clear(); }
930 Q *queue_;
