HomeSort by relevance Sort by last modified time
    Searched full:scc_ (Results 1 - 4 of 4) sorted by null

  /external/srec/tools/thirdparty/OpenFst/fst/lib/
connect.h 46 : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {}
48 : scc_(0), access_(0), coaccess_(0), props_(props) {}
51 if (scc_)
52 scc_->clear();
77 if (scc_)
78 scc_->push_back(-1);
143 if (scc_)
144 (*scc_)[t] = nscc_;
166 if (scc_)
167 for (StateId i = 0; i < (StateId)scc_->size(); ++i)
178 vector<StateId> *scc_; \/\/ State's scc number member in class:fst::SccVisitor
    [all...]
queue.h 411 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0),
430 if (front_ > back_) front_ = back_ = scc_[s];
431 else if (scc_[s] > back_) back_ = scc_[s];
432 else if (scc_[s] < front_) front_ = scc_[s];
433 if ((*queue_)[scc_[s]]) {
434 (*queue_)[scc_[s]]->Enqueue(s);
436 while ( (StateId)trivial_queue_.size() <= scc_[s])
438 trivial_queue_[scc_[s]] = s
480 const vector<StateId> &scc_; member in class:fst::SccQueue
613 vector<StateId> scc_; member in class:fst::AutoQueue
    [all...]
  /external/openfst/src/include/fst/
connect.h 136 : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {}
138 : scc_(0), access_(0), coaccess_(0), props_(props) {}
175 if (scc_)
176 for (StateId i = 0; i < scc_->size(); ++i)
177 (*scc_)[i] = nscc_ - 1 - (*scc_)[i];
187 vector<StateId> *scc_; // State's scc number member in class:fst::SccVisitor
204 if (scc_)
205 scc_->clear();
231 if (scc_)
    [all...]
queue.h 447 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0),
464 if (front_ > back_) front_ = back_ = scc_[s];
465 else if (scc_[s] > back_) back_ = scc_[s];
466 else if (scc_[s] < front_) front_ = scc_[s];
467 if ((*queue_)[scc_[s]]) {
468 (*queue_)[scc_[s]]->Enqueue(s);
470 while (trivial_queue_.size() <= scc_[s])
472 trivial_queue_[scc_[s]] = s
512 const vector<StateId> &scc_; member in class:fst::SccQueue
649 vector<StateId> scc_; member in class:fst::AutoQueue
    [all...]

Completed in 606 milliseconds