| /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;
|
| minimize.h | 302 // Computes equivalence classes for acyclic Fsts. The implementation details
305 // Minimization of acyclic deterministic automata in linear time
500 // Acyclic minimization (revuz)
501 VLOG(2) << "Acyclic Minimization";
523 // In the acyclic case, we use an algorithm from Dominique Revuz that
|
| 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)
|
| connect.h | 128 // SCC numbers will be in topological order for acyclic input.
174 // Numbers SCC's in topological order when acyclic.
|
| replace-util.h | 407 bool acyclic = false; local
409 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
411 if (!acyclic) {
|
| 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;
|
| 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)
|
| connect.h | 38 // SCC numbers will be in topological order for acyclic input.
165 // Numbers SCC's in topological order when acyclic.
|
| minimize.h | 289 // Computes equivalence classes for acyclic Fsts. The implementation details
292 // Minimization of acyclic deterministic automata in linear time
484 // Acyclic minimization (revuz)
485 VLOG(2) << "Acyclic Minimization";
506 // For acyclic automata we use an algorithm from Dominique Revuz that is
|
| properties.cpp | 332 "cyclic", "acyclic",
333 "cyclic at initial state", "acyclic at initial state",
|
| 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
|
| determinize.h | 526 // The determinizable automata include all unweighted and all acyclic input.
704 // The determinizable automata include all unweighted and all acyclic input.
|
| /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",
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| GrammarReport.java | 403 // buf.append("Min acyclic DFA states: "); buf.append(fields[13]);
405 // buf.append("Max acyclic DFA states: "); buf.append(fields[14]);
407 // buf.append("Average acyclic DFA states: "); buf.append(fields[15]);
409 // buf.append("Standard deviation of acyclic DFA states: "); buf.append(fields[16]);
411 // buf.append("Total acyclic DFA states: "); buf.append(fields[17]);
|
| /external/llvm/include/llvm/ADT/ |
| DAGDeltaAlgorithm.h | 18 /// directed acyclic graphs using a predicate function.
|
| /external/llvm/docs/ |
| Lexicon.rst | 60 Directed Acyclic Graph
|
| /external/openfst/ |
| NEWS | 92 * Fixed bug in acyclic minimization that led to non-minimal
|
| /frameworks/native/include/cpustats/ |
| ThreadCpuUsage.h | 30 // For acyclic threads, or for cyclic threads where you want to measure/track
|
| /frameworks/base/graphics/java/android/renderscript/ |
| ScriptGroup.java | 35 * must contain only a single directed acyclic graph (DAG) of
159 * A ScriptGroup must contain a single directed acyclic graph (DAG); it
|
| /frameworks/support/v8/renderscript/java/src/android/support/v8/renderscript/ |
| ScriptGroup.java | 35 * must contain only a single directed acyclic graph (DAG) of
160 * A ScriptGroup must contain a single directed acyclic graph (DAG); it
|
| /dalvik/vm/compiler/ |
| CompilerIR.h | 69 kJitTrace = 0, // Acyclic - all instructions come from the trace descriptor
|
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_mutex.cc | 116 // Verify that the graph is acyclic.
|
| /external/llvm/include/llvm/Analysis/ |
| PathNumbering.h | 10 // Ball-Larus path numbers uniquely identify paths through a directed acyclic
|
