HomeSort by relevance Sort by last modified time
    Searched full:nearest (Results 801 - 825 of 1437) sorted by null

<<31323334353637383940>>

  /bionic/libm/upstream-freebsd/lib/msun/ld128/
k_expl.h 245 /* Use a specialized rint() to get fn. Assume round-to-nearest. */
  /cts/libs/deviceutil/src/android/cts/util/
MediaUtils.java 839 /** returns an array of percentiles for the points using nearest rank */
  /cts/tests/camera/src/android/hardware/camera2/cts/
BurstCaptureRawTest.java 94 * Round [exposure, gain] down, rather than to the nearest, in RAW 10/16
  /dalvik/libdex/
DexFile.h 574 * Utility function -- rounds up to the nearest power of 2.
  /external/ImageMagick/ImageMagick/api/
quantize.html 65 <p>The algorithm maps this domain onto a tree in which each node represents a cube within that domain. In the following discussion these cubes are defined by the coordinate of two opposite vertices (vertex nearest the origin in RGB space and the vertex farthest from the origin).</p>
  /external/ImageMagick/ImageMagick/script/
quantize.html 65 <p>The algorithm maps this domain onto a tree in which each node represents a cube within that domain. In the following discussion, these cubes are defined by the coordinate of two opposite vertices: The vertex nearest the origin in RGB space and the vertex farthest from the origin.</p>
  /external/ImageMagick/www/api/
quantize.html 69 <p>The algorithm maps this domain onto a tree in which each node represents a cube within that domain. In the following discussion these cubes are defined by the coordinate of two opposite vertices (vertex nearest the origin in RGB space and the vertex farthest from the origin).</p>
quantize.php 65 <p>The algorithm maps this domain onto a tree in which each node represents a cube within that domain. In the following discussion these cubes are defined by the coordinate of two opposite vertices (vertex nearest the origin in RGB space and the vertex farthest from the origin).</p>
  /external/ImageMagick/www/
quantize.html 69 <p>The algorithm maps this domain onto a tree in which each node represents a cube within that domain. In the following discussion, these cubes are defined by the coordinate of two opposite vertices: The vertex nearest the origin in RGB space and the vertex farthest from the origin.</p>
  /external/autotest/client/site_tests/graphics_PiglitBVT/test_scripts/other/
graphics_PiglitBVT_5.sh     [all...]
  /external/chromium-trace/catapult/dashboard/dashboard/
graph_json.py 326 extend their query range. We only want the num_points/2 rows nearest rev
  /external/chromium-trace/catapult/telemetry/third_party/webpagereplay/
replay.py 461 'their nearest match in the archive.')
  /external/clang/include/clang/Analysis/
ProgramPoint.h 503 /// The nearest statement is provided for diagnostic purposes.
  /external/deqp/modules/gles3/functional/
es3fTextureWrapTests.cpp 387 { "nearest", GL_NEAREST },
  /external/deqp/modules/gles31/functional/
es31fCopyImageTests.cpp 911 renderParams.sampler = Sampler(Sampler::CLAMP_TO_EDGE, Sampler::CLAMP_TO_EDGE, Sampler::CLAMP_TO_EDGE, Sampler::NEAREST_MIPMAP_NEAREST, Sampler::NEAREST);
    [all...]
  /external/e2fsprogs/ext2ed/
dir_com.c 186 2. The path is divided into the nearest path and the rest of the path. For example, cd 1/2/3/4 is divided into
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/
libcairo-swt.so 
  /external/flac/libFLAC/
bitwriter.c 102 /* round up capacity increase to the nearest FLAC__BITWRITER_DEFAULT_INCREMENT */
  /external/google-breakpad/src/processor/
range_map_unittest.cc 203 // Now, check RetrieveNearestRange. The nearest range is always
  /external/guava/guava/src/com/google/common/primitives/
Chars.java 89 * Returns the {@code char} nearest in value to {@code value}.
Ints.java 97 * Returns the {@code int} nearest in value to {@code value}.
Shorts.java 96 * Returns the {@code short} nearest in value to {@code value}.
  /external/guava/guava-gwt/src-super/com/google/common/primitives/super/com/google/common/primitives/
Chars.java 87 * Returns the {@code char} nearest in value to {@code value}.
Ints.java 96 * Returns the {@code int} nearest in value to {@code value}.
Shorts.java 94 * Returns the {@code short} nearest in value to {@code value}.

Completed in 1346 milliseconds

<<31323334353637383940>>