| /external/strace/ |
| H A D | count.c | 48 static struct timeval shortest = { 1000000, 0 }; variable in typeref:struct:timeval
97 if (tv_cmp(&shortest, &one_tick) < 0)
98 tv = &shortest;
103 if (tv_cmp(tv, &shortest) < 0)
104 shortest = *tv;
179 tv_mul(&overhead, &shortest, 8);
|
| /external/chromium_org/third_party/harfbuzz-ng/src/ |
| H A D | hb-ot-shape-normalize.cc | 132 decompose (const hb_ot_shape_normalize_context_t *c, bool shortest, hb_codepoint_t ab) argument
143 if (shortest && has_a) {
154 if ((ret = decompose (c, shortest, a))) {
197 decompose_current_character (const hb_ot_shape_normalize_context_t *c, bool shortest) argument
203 if (shortest && c->font->get_glyph (buffer->cur().codepoint, 0, &glyph))
205 else if (decompose (c, shortest, buffer->cur().codepoint))
207 else if (!shortest && c->font->get_glyph (buffer->cur().codepoint, 0, &glyph))
|
| /external/harfbuzz_ng/src/ |
| H A D | hb-ot-shape-normalize.cc | 132 decompose (const hb_ot_shape_normalize_context_t *c, bool shortest, hb_codepoint_t ab) argument
143 if (shortest && has_a) {
154 if ((ret = decompose (c, shortest, a))) {
197 decompose_current_character (const hb_ot_shape_normalize_context_t *c, bool shortest) argument
203 if (shortest && c->font->get_glyph (buffer->cur().codepoint, 0, &glyph))
205 else if (decompose (c, shortest, buffer->cur().codepoint))
207 else if (!shortest && c->font->get_glyph (buffer->cur().codepoint, 0, &glyph))
|
| /external/openfst/src/script/ |
| H A D | shortest-distance.cc | 19 #include <fst/script/shortest-distance.h>
|
| H A D | shortest-path.cc | 19 #include <fst/script/shortest-path.h>
|
| /external/openfst/src/include/fst/ |
| H A D | fstlib.h | 90 #include <fst/shortest-distance.h>
91 #include <fst/shortest-path.h>
|
| H A D | randequivalent.h | 29 #include <fst/shortest-distance.h>
|
| H A D | push.h | 31 #include <fst/shortest-distance.h>
40 // the output of ShortestDistance. 'distance' is the shortest distance from the
|
| H A D | prune.h | 29 #include <fst/shortest-distance.h>
46 // If non-zero, passes in pre-computed shortest distance to final states.
48 // Determines the degree of convergence required when computing shortest
93 // the weight of the shortest path Times() 'opts.weight_threshold'.
190 // more than the weight of the shortest path Times()
210 // 'ifst' whose weight is no more than the weight of the shortest path
321 // the weight of the shortest path Times() 'weight_threshold'. When
|
| H A D | rmepsilon.h | 42 #include <fst/shortest-distance.h>
224 // The vector 'distance' will be used to hold the shortest distances
|
| H A D | shortest-path.h | 0 // shortest-path.h
19 // Functions to find shortest paths in an FST.
33 #include <fst/shortest-distance.h>
44 size_t nshortest; // return n-shortest paths
47 // shortest distance from the initial state
48 bool first_path; // Single shortest path stops after finding the first
49 // path to a final state. That path is the shortest path
67 // 'ShortestPath' below with n=1. 'ofst' contains the shortest path in
68 // 'ifst'. 'distance' returns the shortest distances from the source
72 // The shortest pat
[all...] |
| /external/openfst/src/bin/ |
| H A D | fstshortestdistance.cc | 20 // Find shortest distances in an FST.
26 #include <fst/script/shortest-distance.h>
33 "\"fifo\", \"lifo\", \"shortest\", \"state\", \"top\"");
39 string usage = "Finds shortest distance(s) in an FST.\n\n Usage: ";
66 } else if (FLAGS_queue_type == "shortest") {
|
| H A D | fstshortestpath.cc | 20 // Find shortest path(s) in an FST.
22 #include <fst/script/shortest-path.h>
25 DEFINE_int64(nshortest, 1, "Return N-shortest paths");
30 "\"fifo\", \"lifo\", \"shortest\', \"state\", \"top\"");
39 string usage = "Finds shortest path(s) in an FST.\n\n Usage: ";
72 } else if (FLAGS_queue_type == "shortest") {
|
| /external/openfst/src/include/fst/extensions/far/ |
| H A D | print-strings.h | 30 #include <fst/shortest-distance.h>
|
| /external/openfst/src/include/fst/script/ |
| H A D | fstscript.h | 62 #include <fst/script/shortest-distance.h>
63 #include <fst/script/shortest-path.h>
|
| H A D | shortest-path.h | 26 #include <fst/shortest-path.h>
27 #include <fst/script/shortest-distance.h> // for ShortestDistanceOptions
|
| H A D | rmepsilon.h | 26 #include <fst/script/shortest-distance.h> // for ShortestDistanceOptions
33 %include "nlp/fst/script/shortest-distance.h"
|
| H A D | shortest-distance.h | 28 #include <fst/shortest-distance.h>
36 // See nlp/fst/lib/shortest-distance.h for the template options class
|
| /external/openfst/src/extensions/pdt/ |
| H A D | pdtscript.cc | 34 #include <fst/extensions/pdt/shortest-path.h>
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| H A D | pdtscript.h | 32 #include <fst/script/shortest-path.h>
39 #include <fst/extensions/pdt/shortest-path.h>
|
| H A D | shortest-path.h | 0 // shortest-path.h
19 // Functions to find shortest paths in a PDT.
24 #include <fst/shortest-path.h>
50 // Class to store PDT shortest path results. Stores shortest path
53 // (1) By SearchState: This is a usual node in a shortest path tree but:
60 // (2) By ParenSpec: This connects shortest path trees depending on the
119 SearchState parent; // Parent state in shortest path tree
361 // This computes the single source shortest (balanced) path (SSSP)
368 // sub-graph SSSP problem with the shortest pat
[all...] |
| H A D | expand.h | 29 #include <fst/extensions/pdt/shortest-path.h>
326 // shortest-stack first queue discipline and relies on the
327 // shortest-distance information computed using a reverse
328 // shortest-path call to perform the pruning.
388 // 1. states corresponding to shortest stack first,
390 // 3. among states with the same stack, shortest-first order is used.
494 // the shortest-distance from '(s, current_stack_id_)' to the final
544 // Returns the weight of the shortest balanced path from 'source' to 'dest'
570 // Returns the shortest distance from the initial state to 's' in 'ofst_'.
576 // Sets the shortest distanc
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/ |
| H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ... |
| /external/chromium_org/third_party/closure_compiler/compiler/ |
| H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ... |