Searched refs:acyclic (Results 1 - 9 of 9) sorted by relevance
/external/openfst/src/include/fst/ |
H A D | topsort.h | 43 // If acyclic, ORDER[i] gives the topological position of state Id i; 46 TopOrderVisitor(vector<StateId> *order, bool *acyclic) argument 47 : order_(order), acyclic_(acyclic) {} 82 // Topologically sorts its input if acyclic, modifying it. Otherwise, 95 bool acyclic; local 97 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); 100 if (acyclic) { 107 return acyclic;
|
H A D | replace-util.h | 407 bool acyclic = false; local 409 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); 411 if (!acyclic) {
|
H A D | rmepsilon.h | 253 // States sorted in topological order when (acyclic) or generic 263 bool acyclic; local 264 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); 266 // Sanity check: should be acyclic if property bit is set. 267 if(!acyclic) { 268 FSTERROR() << "RmEpsilon: inconsistent acyclic property bit";
|
H A D | queue.h | 310 // States are ordered in the queue topologically. The FST must be acyclic. 323 bool acyclic; local 324 TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic); 326 if (!acyclic) { 327 FSTERROR() << "TopOrderQueue: fst is not acyclic."; 585 // If all the scc are trivial, FST is acyclic and the scc# gives
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | topsort.h | 38 // If acyclic, ORDER[i] gives the topological position of state Id i; 41 TopOrderVisitor(vector<StateId> *order, bool *acyclic) argument 42 : order_(order), acyclic_(acyclic) {} 77 // Topologically sorts its input if acyclic, modifying it. Otherwise, 90 bool acyclic; local 92 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); 95 if (acyclic) { 102 return acyclic;
|
H A D | rmepsilon.h | 209 // States sorted in topological order when (acyclic) or generic 218 bool acyclic; local 219 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); 221 if (!acyclic) 222 LOG(FATAL) << "RmEpsilon: not acyclic though property bit is set";
|
H A D | queue.h | 280 // States are ordered in the queue topologically. The FST must be acyclic. 294 bool acyclic; local 295 TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic); 297 if (!acyclic) 298 LOG(FATAL) << "TopOrderQueue: fst is not acyclic."; 548 // If all the scc are trivial, FST is acyclic and the scc# gives
|
/external/openfst/src/bin/ |
H A D | fsttopsort.cc | 47 bool acyclic = TopSort(fst); 48 if (!acyclic)
|
/external/openfst/src/lib/ |
H A D | properties.cc | 284 bool acyclic = true; local 294 acyclic = false; 304 if (acyclic) 419 "cyclic", "acyclic", 420 "cyclic at initial state", "acyclic at initial state",
|
Completed in 154 milliseconds