Home
last modified time | relevance | path

Searched refs:scc_ (Results 1 – 4 of 4) sorted by relevance

/external/srec/tools/thirdparty/OpenFst/fst/lib/
Dconnect.h46 : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {} in SccVisitor()
48 : scc_(0), access_(0), coaccess_(0), props_(props) {} in SccVisitor()
51 if (scc_) in InitVisit()
52 scc_->clear(); in InitVisit()
77 if (scc_) in InitState()
78 scc_->push_back(-1); in InitState()
143 if (scc_) in FinishState()
144 (*scc_)[t] = nscc_; in FinishState()
166 if (scc_) in FinishVisit()
167 for (StateId i = 0; i < (StateId)scc_->size(); ++i) in FinishVisit()
[all …]
Dqueue.h411 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0), in SccQueue()
430 if (front_ > back_) front_ = back_ = scc_[s]; in Enqueue()
431 else if (scc_[s] > back_) back_ = scc_[s]; in Enqueue()
432 else if (scc_[s] < front_) front_ = scc_[s]; in Enqueue()
433 if ((*queue_)[scc_[s]]) { in Enqueue()
434 (*queue_)[scc_[s]]->Enqueue(s); in Enqueue()
436 while ( (StateId)trivial_queue_.size() <= scc_[s]) in Enqueue()
438 trivial_queue_[scc_[s]] = s; in Enqueue()
452 if ((*queue_)[scc_[s]]) in Update()
453 (*queue_)[scc_[s]]->Update(s); in Update()
[all …]
/external/openfst/src/include/fst/
Dconnect.h136 : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {} in SccVisitor()
138 : scc_(0), access_(0), coaccess_(0), props_(props) {} in SccVisitor()
175 if (scc_) in FinishVisit()
176 for (StateId i = 0; i < scc_->size(); ++i) in FinishVisit()
177 (*scc_)[i] = nscc_ - 1 - (*scc_)[i]; in FinishVisit()
187 vector<StateId> *scc_; // State's scc number
204 if (scc_) in InitVisit()
205 scc_->clear(); in InitVisit()
231 if (scc_) in InitState()
232 scc_->push_back(-1); in InitState()
[all …]
Dqueue.h448 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0), in SccQueue()
465 if (front_ > back_) front_ = back_ = scc_[s]; in Enqueue()
466 else if (scc_[s] > back_) back_ = scc_[s]; in Enqueue()
467 else if (scc_[s] < front_) front_ = scc_[s]; in Enqueue()
468 if ((*queue_)[scc_[s]]) { in Enqueue()
469 (*queue_)[scc_[s]]->Enqueue(s); in Enqueue()
471 while (trivial_queue_.size() <= scc_[s]) in Enqueue()
473 trivial_queue_[scc_[s]] = s; in Enqueue()
485 if ((*queue_)[scc_[s]]) in Update()
486 (*queue_)[scc_[s]]->Update(s); in Update()
[all …]