| /external/openfst/src/include/fst/ |
| topsort.h | 43 // If acyclic, ORDER[i] gives the topological position of state Id i;
44 // otherwise unchanged. ACYCLIC will be true iff the FST has
46 TopOrderVisitor(vector<StateId> *order, bool *acyclic)
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;
|
| replace-util.h | 407 bool acyclic = false; local
409 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
411 if (!acyclic) {
|
| rmepsilon.h | 252 // States sorted in topological order when (acyclic) or generic
262 bool acyclic; local
263 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
265 // Sanity check: should be acyclic if property bit is set.
266 if(!acyclic) {
267 FSTERROR() << "RmEpsilon: inconsistent acyclic property bit";
338 // - Acyclic: O(V2 + V E)
|
| queue.h | 311 // States are ordered in the queue topologically. The FST must be acyclic.
324 bool acyclic; local
325 TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic);
327 if (!acyclic) {
328 FSTERROR() << "TopOrderQueue: fst is not acyclic.";
586 // If all the scc are trivial, FST is acyclic and the scc# gives
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| topsort.h | 38 // If acyclic, ORDER[i] gives the topological position of state Id i;
39 // otherwise unchanged. ACYCLIC will be true iff the FST has
41 TopOrderVisitor(vector<StateId> *order, bool *acyclic)
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;
|
| 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
|
| 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";
277 // - Acyclic: O(V2 + V E)
|
| /external/openfst/src/bin/ |
| fsttopsort.cc | 47 bool acyclic = TopSort(fst);
48 if (!acyclic)
|
| /external/openfst/src/lib/ |
| properties.cc | 286 bool acyclic = true; local
296 acyclic = false;
306 if (acyclic)
422 "cyclic", "acyclic",
423 "cyclic at initial state", "acyclic at initial state",
|
