Searched defs:scc (Results 1 - 7 of 7) sorted by relevance

/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dconnect.h37 // scc[i]: strongly-connected component number for state i.
44 SccVisitor(vector<StateId> *scc, vector<bool> *access, argument
46 : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {}
178 vector<StateId> *scc_; // State's scc number
H A Dqueue.h410 SccQueue(const vector<StateId> &scc, vector<Queue*> *queue) argument
411 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0),
457 if (front_ < back_) // Queue scc # back_ not empty unless back_==front_
548 // If all the scc are trivial, FST is acyclic and the scc# gives
617 const vector<StateId> &scc,
647 const vector<StateId> &scc,
668 if (scc[state] == scc[arc.nextstate]) {
669 QueueType &type = (*queue_type)[scc[stat
646 SccQueueType(const Fst<A> &fst, const vector<StateId> &scc, vector<QueueType> *queue_type, ArcFilter filter, Less *less, bool *all_trivial, bool *unweighted) argument
[all...]
H A Drmepsilon.h228 vector<StateId> scc; local
229 SccVisitor<Arc> scc_visitor(&scc, 0, 0, &props);
231 vector<StateId> first(scc.size(), kNoStateId);
232 vector<StateId> next(scc.size(), kNoStateId);
233 for (StateId i = 0; i < (StateId)scc.size(); i++) {
234 if (first[scc[i]] != kNoStateId)
235 next[i] = first[scc[i]];
236 first[scc[i]] = i;
/external/openfst/src/include/fst/
H A Dconnect.h127 // scc[i]: strongly-connected component number for state i.
134 SccVisitor(vector<StateId> *scc, vector<bool> *access, argument
136 : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {}
187 vector<StateId> *scc_; // State's scc number
H A Dqueue.h447 SccQueue(const vector<StateId> &scc, vector<Queue*> *queue) argument
448 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0),
490 if (front_ < back_) // Queue scc # back_ not empty unless back_==front_
586 // If all the scc are trivial, FST is acyclic and the scc# gives
654 const vector<StateId> &scc,
689 const vector<StateId> &scc,
710 if (scc[state] == scc[arc.nextstate]) {
711 QueueType &type = (*queue_type)[scc[stat
688 SccQueueType(const Fst<A> &fst, const vector<StateId> &scc, vector<QueueType> *queue_type, ArcFilter filter, Less *less, bool *all_trivial, bool *unweighted) argument
[all...]
H A Drmepsilon.h276 vector<StateId> scc; local
277 SccVisitor<Arc> scc_visitor(&scc, 0, 0, &props);
279 vector<StateId> first(scc.size(), kNoStateId);
280 vector<StateId> next(scc.size(), kNoStateId);
281 for (StateId i = 0; i < scc.size(); i++) {
282 if (first[scc[i]] != kNoStateId)
283 next[i] = first[scc[i]];
284 first[scc[i]] = i;
/external/openfst/src/include/fst/script/
H A Dinfo-impl.h135 vector<StateId> scc; local
138 SccVisitor<Arc> scc_visitor(&scc, &access, &coaccess, &props);
152 for (StateId s = 0; s < scc.size(); ++s) {
159 if (scc[s] >= nscc_)
160 nscc_ = scc[s] + 1;

Completed in 151 milliseconds