HomeSort by relevance Sort by last modified time
    Searched refs:shortest (Results 1 - 21 of 21) sorted by null

  /external/strace/
count.c 48 static struct timeval shortest = { 1000000, 0 }; variable in typeref:struct:timeval
93 if (tv_cmp(&shortest, &one_tick) < 0)
94 *tv = shortest;
100 if (tv_cmp(tv, &shortest) < 0)
101 shortest = *tv;
177 tv_mul(&overhead, &shortest, 8);
  /external/harfbuzz_ng/src/
hb-ot-shape-normalize.cc 132 decompose (const hb_ot_shape_normalize_context_t *c, bool shortest, hb_codepoint_t ab)
141 if (shortest && has_a) {
152 if ((ret = decompose (c, shortest, a))) {
196 decompose_current_character (const hb_ot_shape_normalize_context_t *c, bool shortest)
202 if (shortest && c->font->get_glyph (buffer->cur().codepoint, 0, &glyph))
204 else if (decompose (c, shortest, buffer->cur().codepoint))
206 else if (!shortest && c->font->get_glyph (buffer->cur().codepoint, 0, &glyph))
  /external/openfst/src/script/
shortest-distance.cc 19 #include <fst/script/shortest-distance.h>
shortest-path.cc 19 #include <fst/script/shortest-path.h>
  /external/openfst/src/include/fst/
fstlib.h 90 #include <fst/shortest-distance.h>
91 #include <fst/shortest-path.h>
randequivalent.h 29 #include <fst/shortest-distance.h>
push.h 31 #include <fst/shortest-distance.h>
40 // the output of ShortestDistance. 'distance' is the shortest distance from the
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
rmepsilon.h 42 #include <fst/shortest-distance.h>
135 // Shortest distance algorithm computation state.
224 // The vector 'distance' will be used to hold the shortest distances
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
66 // Shortest-path algorithm: normally not called directly; prefer
67 // 'ShortestPath' below with n=1. 'ofst' contains the shortest path in
68 // 'ifst'. 'distance' returns the shortest distances from the sourc
    [all...]
  /external/openfst/src/bin/
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") {
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/
print-strings.h 30 #include <fst/shortest-distance.h>
  /external/openfst/src/include/fst/script/
fstscript.h 62 #include <fst/script/shortest-distance.h>
63 #include <fst/script/shortest-path.h>
shortest-path.h 26 #include <fst/shortest-path.h>
27 #include <fst/script/shortest-distance.h> // for ShortestDistanceOptions
rmepsilon.h 26 #include <fst/script/shortest-distance.h> // for ShortestDistanceOptions
33 %include "nlp/fst/script/shortest-distance.h"
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/
pdtscript.cc 34 #include <fst/extensions/pdt/shortest-path.h>
  /external/openfst/src/include/fst/extensions/pdt/
pdtscript.h 32 #include <fst/script/shortest-path.h>
39 #include <fst/extensions/pdt/shortest-path.h>
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 path up to the ope
    [all...]
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.
479 SP *reverse_shortest_path_; // Shortest path for rfst_
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_'
    [all...]

Completed in 214 milliseconds