HomeSort by relevance Sort by last modified time
    Searched full:shortest (Results 26 - 50 of 250) sorted by null

12 3 4 5 6 7 8 910

  /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/include/fst/
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
queue.h 64 SHORTEST_FIRST_QUEUE = 3, // Shortest-first queue
206 // Shortest-first queue discipline, templated on the StateId and
295 // Shortest-first queue discipline, templated on the StateId and Weight, is
541 // shortest-first queue using the natural order w.r.t to the distance.
607 ": using shortest-first discipline";
732 // an estimate of the shortest distance to the final states.
741 // shortest distance from the initial state, a Less comparison
743 // shortest distance to the final states, this class defines a
770 // estimate E of the shortest distance to the final states, is specialized
796 // only when its shortest distance (so far), as specified b
    [all...]
fstlib.h 90 #include <fst/shortest-distance.h>
91 #include <fst/shortest-path.h>
push.h 31 #include <fst/shortest-distance.h>
40 // the output of ShortestDistance. 'distance' is the shortest distance from the
randequivalent.h 29 #include <fst/shortest-distance.h>
  /external/llvm/lib/Target/Mips/
MipsAnalyzeImmediate.h 53 /// GetShortestSeq - Find the shortest instruction sequence in SeqLs and
  /external/v8/src/
fixed-dtoa.h 46 // shortest representation of the input.
  /external/apache-http/src/org/apache/commons/codec/language/
RefinedSoundex.java 79 * same. This return value ranges from 0 to the length of the shortest
89 * same from 0 to to the length of the shortest encoded String.
  /external/icu4c/common/
bmpset.h 113 * Bits for 0..7F (non-shortest forms) are set to the result of contains(FFFD)
131 * Bits for 0..7FF (non-shortest forms) and D800..DFFF are set to
  /external/openfst/src/include/fst/script/
fstscript.h 62 #include <fst/script/shortest-distance.h>
63 #include <fst/script/shortest-path.h>
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
shortest-path.h 26 #include <fst/shortest-path.h>
27 #include <fst/script/shortest-distance.h> // for ShortestDistanceOptions
  /external/v8/test/cctest/
cctest.gyp 48 'gay-shortest.cc',
143 # MSVS wants this for gay-{precision,shortest}.cc.
test-fast-dtoa.cc 13 #include "gay-shortest.h"
263 // success rate than for the shortest representation.
  /frameworks/testing/uiautomator_test_libraries/src/com/android/uiautomator/common/helpers/
DatePickerHelper.java 132 // Adjust day - increment or decrement using the shortest path
148 // Adjust month - increment or decrement using the shortest path
TimePickerHelper.java 120 // Adjust minutes - increment or decrement using the shortest path
135 // Adjust hour - increment or decrement using the shortest path
  /external/openfst/src/include/
Makefile.in 72 fst/fst.h fst/properties.h fst/shortest-distance.h \
74 fst/shortest-path.h fst/const-fst.h fst/heap.h fst/push.h \
98 fst/extensions/pdt/shortest-path.h fst/script/arcsort.h \
116 fst/script/script-impl.h fst/script/shortest-distance.h \
117 fst/script/shortest-path.h fst/script/symbols.h \
290 @HAVE_PDT_TRUE@fst/extensions/pdt/reverse.h fst/extensions/pdt/shortest-path.h
306 fst/script/shortest-distance.h fst/script/shortest-path.h \
327 fst/fst.h fst/properties.h fst/shortest-distance.h fst/weight.h \
328 fst/connect.h fst/fstlib.h fst/prune.h fst/shortest-path.h
    [all...]
  /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
ShadowLocation.java 347 * shortest path between them. Distance and bearing are defined using the
401 * North when traveling along the shortest path between this
402 * location and the given location. The shortest path is defined
  /external/openfst/src/extensions/pdt/
pdtscript.cc 34 #include <fst/extensions/pdt/shortest-path.h>
  /external/openfst/src/include/fst/extensions/far/
print-strings.h 30 #include <fst/shortest-distance.h>
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
push.h 27 #include "fst/lib/shortest-distance.h"
  /external/tcpdump/
INSTALL 125 ospf.h - Open Shortest Path First definitions
126 ospf6.h - IPv6 Open Shortest Path First definitions
190 print-ospf.c - Open Shortest Path First printer routines
191 print-ospf6.c - IPv6 Open Shortest Path First printer routines
  /external/openfst/src/script/
Makefile.in 88 shortest-distance.cc shortest-path.cc synchronize.cc \
100 @HAVE_SCRIPT_TRUE@ shortest-distance.lo shortest-path.lo \
253 @HAVE_SCRIPT_TRUE@shortest-distance.cc shortest-path.cc synchronize.cc text-io.cc topsort.cc \
364 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/shortest-distance.Plo@am__quote@
365 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/shortest-path.Plo@am__quote@

Completed in 431 milliseconds

12 3 4 5 6 7 8 910