HomeSort by relevance Sort by last modified time
    Searched refs:nearest (Results 1 - 25 of 55) sorted by null

1 2 3

  /external/valgrind/main/none/tests/s390x/
srnmb.stderr.exp 4 Continuing using 'round to nearest'. Results may differ!
rounding-6.stdout.exp 1 cfebr 1.400000 -> 1 cc = 2 [-> nearest even]
5 cfebr 1.500000 -> 2 cc = 2 [-> nearest even]
9 cfebr 2.500000 -> 2 cc = 2 [-> nearest even]
13 cfebr 1.600000 -> 2 cc = 2 [-> nearest even]
17 cfebr -1.400000 -> -1 cc = 1 [-> nearest even]
21 cfebr -1.500000 -> -2 cc = 1 [-> nearest even]
25 cfebr -2.500000 -> -2 cc = 1 [-> nearest even]
29 cfebr -1.600000 -> -2 cc = 1 [-> nearest even]
33 cfebr 0.000000 -> 0 cc = 0 [-> nearest even]
37 cgebr 1.400000 -> 1 cc = 2 [-> nearest even
    [all...]
  /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/
vp9_mvref_common.h 41 int_mv *mvlist, int_mv *nearest, int_mv *near);
46 int_mv *nearest, int_mv *near);
vp9_mvref_common.c 212 // The nearest 2 blocks are treated differently
307 int_mv *mvlist, int_mv *nearest, int_mv *near) {
314 *nearest = mvlist[0];
321 int_mv *nearest, int_mv *near) {
335 nearest->as_int = mv_list[0].as_int;
340 nearest->as_int = bmi[0].as_mv[ref].as_int;
342 if (nearest->as_int != mv_list[n].as_int) {
354 nearest->as_int = bmi[2].as_mv[ref].as_int;
356 if (nearest->as_int != candidates[n].as_int) {
  /external/libvpx/libvpx/vp9/common/
vp9_mvref_common.h 41 int_mv *mvlist, int_mv *nearest, int_mv *near);
46 int_mv *nearest, int_mv *near);
vp9_mvref_common.c 212 // The nearest 2 blocks are treated differently
307 int_mv *mvlist, int_mv *nearest, int_mv *near) {
314 *nearest = mvlist[0];
321 int_mv *nearest, int_mv *near) {
335 nearest->as_int = mv_list[0].as_int;
340 nearest->as_int = bmi[0].as_mv[ref].as_int;
342 if (nearest->as_int != mv_list[n].as_int) {
354 nearest->as_int = bmi[2].as_mv[ref].as_int;
356 if (nearest->as_int != candidates[n].as_int) {
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/
vp9_mvref_common.h 41 int_mv *mvlist, int_mv *nearest, int_mv *near);
46 int_mv *nearest, int_mv *near);
vp9_mvref_common.c 212 // The nearest 2 blocks are treated differently
307 int_mv *mvlist, int_mv *nearest, int_mv *near) {
314 *nearest = mvlist[0];
321 int_mv *nearest, int_mv *near) {
335 nearest->as_int = mv_list[0].as_int;
340 nearest->as_int = bmi[0].as_mv[ref].as_int;
342 if (nearest->as_int != mv_list[n].as_int) {
354 nearest->as_int = bmi[2].as_mv[ref].as_int;
356 if (nearest->as_int != candidates[n].as_int) {
  /external/chromium_org/third_party/WebKit/Source/core/html/
TimeRanges.h 65 double nearest(double time) const;
TimeRanges.cpp 186 double TimeRanges::nearest(double time) const function in class:TimeRanges
  /external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/
findnearmv.c 28 int_mv *nearest,
108 /* See if above-left MV can be merged with NEAREST */
117 /* Swap near and nearest if necessary */
135 nearest->as_int = near_mvs[CNT_NEAREST].as_int;
findnearmv.h 78 int_mv *nearest, int_mv *nearby, int_mv *best,
  /external/libvpx/libvpx/vp8/common/
findnearmv.c 28 int_mv *nearest,
108 /* See if above-left MV can be merged with NEAREST */
117 /* Swap near and nearest if necessary */
135 nearest->as_int = near_mvs[CNT_NEAREST].as_int;
findnearmv.h 78 int_mv *nearest, int_mv *nearby, int_mv *best,
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/
findnearmv.c 28 int_mv *nearest,
108 /* See if above-left MV can be merged with NEAREST */
117 /* Swap near and nearest if necessary */
135 nearest->as_int = near_mvs[CNT_NEAREST].as_int;
findnearmv.h 78 int_mv *nearest, int_mv *nearby, int_mv *best,
  /libcore/luni/src/main/java/java/util/
TreeMap.java 275 Node<K, V> nearest = root; local
278 ? comparableKey.compareTo(nearest.key)
279 : comparator.compare(key, nearest.key);
287 return nearest.prev();
292 return nearest;
294 return nearest.next();
298 Node<K, V> child = (comparison < 0) ? nearest.left : nearest.right;
300 nearest = child;
305 * We found a nearest node. Every key not in the tree has up to tw
    [all...]
  /external/chromium_org/third_party/sqlite/src/ext/rtree/
viewrtree.tcl 63 bind .l <1> {listbox_click [.l nearest %y]}
64 bind .l <Motion> {listbox_mouseover [.l nearest %y]}
  /frameworks/rs/java/tests/ImageProcessing/src/com/android/rs/image/
resize.rs 26 uchar4 __attribute__((kernel)) nearest(uint32_t x, uint32_t y) {
  /frameworks/rs/java/tests/ImageProcessing_jb/src/com/android/rs/image/
resize.rs 26 uchar4 __attribute__((kernel)) nearest(uint32_t x, uint32_t y) {
  /packages/apps/Camera2/src/com/android/camera/widget/
FilmstripView.java 765 int nearest = 0; local
767 while (nearest < BUFFER_SIZE
768 && (mViewItem[nearest] == null || mViewItem[nearest].getLeftPosition() == -1)) {
769 nearest++;
772 if (nearest == BUFFER_SIZE) {
776 int min = Math.abs(pointX - mViewItem[nearest].getCenterX());
778 for (int itemID = nearest + 1; itemID < BUFFER_SIZE && mViewItem[itemID] != null; itemID++) {
788 nearest = itemID;
791 return nearest;
855 final int nearest = findTheNearestView(mCenterX); local
    [all...]
  /external/qemu/distrib/sdl-1.2.15/src/loadso/macosx/
SDL_dlcompat.c 105 const char *dli_sname; /* Name of nearest symbol */
106 void *dli_saddr; /* Address of nearest symbol */
    [all...]
  /external/chromium_org/third_party/WebKit/Source/web/
TextFinder.cpp 530 int nearest = -1; local
539 nearest = i;
543 return nearest;
  /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
date_widget.js 142 // Set to nearest Thursday: current date + 4 - current day number
148 // Calculate full weeks to nearest Thursday
  /packages/inputmethods/LatinIME/native/jni/src/suggest/core/layout/
proximity_info_state_utils.h 122 const int time, const bool lastPoint, const float nearest, const float sumAngle,

Completed in 1219 milliseconds

1 2 3