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

12 3 4 5 6 7 8 91011>>

  /external/v8/src/
fixed-dtoa.h 25 // shortest representation of the input.
  /frameworks/av/media/libstagefright/codecs/amrwbenc/inc/
wb_vad_c.h 72 #define HANG_LOW 2 /* shortest hangover */
74 #define HANG_P2 (Word16)(4*SCALE) /* threshold for shortest hangover */
79 #define BURST_LOW 3 /* shortest burst length */
81 #define BURST_P2 THR_LOW /* threshold for shortest burst */
  /external/icu/icu4c/source/test/intltest/
colldata.h 195 * compute the length of the shortest string that can
261 * Return the length of the shortest string that will generate
267 * @return the length of the shortest string.
273 * Return the length of the shortest string that will generate
287 * @return the length of the shortest string.
  /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/
core.rst 18 topological sort, finding connected components, shortest paths as well as a number
  /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/
__init__.py 16 topological sort, finding connected components, shortest paths as well as a number
85 node 8 is 5 hops away. To find the shortest distance between two nodes you
90 It will print the nodes on one (if there are more) the shortest paths::
  /external/opencv3/modules/shape/src/
haus_dis.cpp 116 Mat shortest(disMat.rows,1,CV_32F);
122 shortest.at<float>(ii,0) = float(mindis);
125 cv::sort(shortest, sorted, SORT_EVERY_ROW | SORT_DESCENDING);
  /external/webrtc/webrtc/test/testsupport/metrics/
video_metrics.h 58 // This function only compares video frames up to the point when the shortest
82 // This function only compares video frames up to the point when the shortest
102 // This function only compares video frames up to the point when the shortest
  /external/harfbuzz_ng/src/
hb-ot-shape-normalize.cc 120 decompose (const hb_ot_shape_normalize_context_t *c, bool shortest, hb_codepoint_t ab)
131 if (shortest && has_a) {
142 if ((ret = decompose (c, shortest, a))) {
163 decompose_current_character (const hb_ot_shape_normalize_context_t *c, bool shortest)
169 if (shortest && c->font->get_nominal_glyph (u, &glyph))
175 if (decompose (c, shortest, u))
181 if (!shortest && c->font->get_nominal_glyph (u, &glyph))
  /external/llvm/lib/Target/Mips/
MipsAnalyzeImmediate.h 53 /// GetShortestSeq - Find the shortest instruction sequence in SeqLs and
  /frameworks/opt/bitmap/sample/src/com/example/bitmapsample/
BitmapRequestKeyImpl.java 78 // Character difference between shortest and longest uri.
  /external/apache-http/src/org/apache/commons/codec/language/
RefinedSoundex.java 84 * same. This return value ranges from 0 to the length of the shortest
94 * same from 0 to to the length of the shortest encoded String.
  /external/icu/icu4c/source/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
dictionarydata.h 79 * from shortest to longest. Lengths are in native indexing units
82 * from shortest to longest. Lengths are the number of Unicode code points.
  /external/libgdx/gdx/src/com/badlogic/gdx/math/
Plane.java 95 /** Calculates the shortest signed distance between the plane and the given point.
98 * @return the shortest signed distance between the plane and the point */
  /external/opencv3/doc/py_tutorials/py_imgproc/py_contours/py_contours_more_functions/
py_contours_more_functions.markdown 9 - Finding shortest distance from a point to a polygon
66 This function finds the shortest distance between a point in the image and a contour. It returns the
  /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/
ftoa.go 93 shortest := false
95 shortest = true
99 // Precision for shortest representation mode.
139 // If precision was the shortest possible, use eprec = 6 for
141 if shortest {
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/big/
ftoa.go 90 shortest := false
92 shortest = true
96 // Precision for shortest representation mode.
136 // If precision was the shortest possible, use eprec = 6 for
138 if shortest {
  /prebuilts/go/darwin-x86/src/math/big/
ftoa.go 90 shortest := false
92 shortest = true
96 // Precision for shortest representation mode.
136 // If precision was the shortest possible, use eprec = 6 for
138 if shortest {
  /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/
ftoa.go 93 shortest := false
95 shortest = true
99 // Precision for shortest representation mode.
139 // If precision was the shortest possible, use eprec = 6 for
141 if shortest {
  /prebuilts/go/linux-x86/src/cmd/compile/internal/big/
ftoa.go 90 shortest := false
92 shortest = true
96 // Precision for shortest representation mode.
136 // If precision was the shortest possible, use eprec = 6 for
138 if shortest {
  /prebuilts/go/linux-x86/src/math/big/
ftoa.go 90 shortest := false
92 shortest = true
96 // Precision for shortest representation mode.
136 // If precision was the shortest possible, use eprec = 6 for
138 if shortest {
  /external/robolectric/v1/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
  /bionic/libc/bionic/
c32rtomb.cpp 64 // We always output the shortest sequence possible. Also specify the
  /developers/build/prebuilts/gradle/MultiWindowPlayground/Application/src/main/
AndroidManifest.xml 45 (500dp at its shortest side). It is launched in the top/end (top/right) corner by default.
  /developers/samples/android/ui/window/MultiWindowPlayground/Application/src/main/
AndroidManifest.xml 45 (500dp at its shortest side). It is launched in the top/end (top/right) corner by default.

Completed in 1980 milliseconds

12 3 4 5 6 7 8 91011>>