Lines Matching refs:queue_
411 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0),
416 (((*queue_)[front_] && (*queue_)[front_]->Empty())
417 || (((*queue_)[front_] == 0) &&
423 if ((*queue_)[front_])
424 return (*queue_)[front_]->Head();
433 if ((*queue_)[scc_[s]]) {
434 (*queue_)[scc_[s]]->Enqueue(s);
445 if ((*queue_)[front_])
446 (*queue_)[front_]->Dequeue();
452 if ((*queue_)[scc_[s]])
453 (*queue_)[scc_[s]]->Update(s);
461 else if ((*queue_)[front_])
462 return (*queue_)[front_]->Empty();
470 if ((*queue_)[i])
471 (*queue_)[i]->Clear();
479 vector<Queue*> *queue_;
514 queue_ = new StateOrderQueue<StateId>();
517 queue_ = new TopOrderQueue<StateId>(fst, filter);
520 queue_ = new LifoQueue<StateId>();
542 queue_ = new LifoQueue<StateId>();
551 queue_ = new TopOrderQueue<StateId>(scc_);
585 queue_ = new SccQueue< StateId, QueueBase<StateId> >(scc_, &queues_);
594 delete queue_;
597 StateId Head() const { return queue_->Head(); }
599 void Enqueue(StateId s) { queue_->Enqueue(s); }
601 void Dequeue() { queue_->Dequeue(); }
603 void Update(StateId s) { queue_->Update(s); }
605 bool Empty() const { return queue_->Empty(); }
607 void Clear() { queue_->Clear(); }
611 QueueBase<StateId> *queue_;