Searched refs:acyclic (Results 1 – 10 of 10) sorted by relevance
| /external/openfst/src/include/fst/ |
| D | topsort.h | 46 TopOrderVisitor(vector<StateId> *order, bool *acyclic) in TopOrderVisitor() argument
47 : order_(order), acyclic_(acyclic) {} in TopOrderVisitor()
95 bool acyclic; in TopSort() local
97 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); in TopSort()
100 if (acyclic) { in TopSort()
107 return acyclic; in TopSort()
|
| D | replace-util.h | 407 bool acyclic = false; in GetTopOrder() local
409 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); in GetTopOrder()
411 if (!acyclic) { in GetTopOrder()
|
| D | rmepsilon.h | 262 bool acyclic; in RmEpsilon() local
263 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); in RmEpsilon()
266 if(!acyclic) { in RmEpsilon()
|
| D | queue.h | 324 bool acyclic; in TopOrderQueue() local
325 TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic); in TopOrderQueue()
327 if (!acyclic) { in TopOrderQueue()
|
| /external/openfst/src/bin/ |
| D | fsttopsort.cc | 47 bool acyclic = TopSort(fst); in main() local
48 if (!acyclic) in main()
|
| /external/openfst/src/lib/ |
| D | properties.cc | 286 bool acyclic = true; in ReplaceProperties() local
296 acyclic = false; in ReplaceProperties()
306 if (acyclic) in ReplaceProperties()
|
| /external/openfst/ |
| D | NEWS | 92 * Fixed bug in acyclic minimization that led to non-minimal
|
| /external/antlr/antlr-3.4/runtime/C/ |
| D | README | 337 When forcing some acyclic DFA to be state tables, they broke.
436 acyclic inline DFA (i.e., using an IF). Upon non-LL(*) decisions
439 a protection in front of the acyclic DFA generator to avoid if
933 * no more computing DFA transition tables for acyclic DFA.
|
| /external/antlr/antlr-3.4/tool/ |
| D | CHANGES.txt | 1049 affectively avoids some acyclic DFA that still have many states
1907 When forcing some acyclic DFA to be state tables, they broke.
2006 acyclic inline DFA (i.e., using an IF). Upon non-LL(*) decisions
2009 a protection in front of the acyclic DFA generator to avoid if
2503 * no more computing DFA transition tables for acyclic DFA.
|
| /external/clang/docs/ |
| D | PCHInternals.rst | 516 linear chain of precompiled headers to an arbitrary directed acyclic graph
|