| /packages/apps/Camera2/src/com/android/camera/ui/focus/ |
| LensRangeCalculator.java | 48 // represents the nearest focus the device can achieve.
55 Float nearest = characteristics.get(CameraCharacteristics.LENS_INFO_MINIMUM_FOCUS_DISTANCE); local
58 if (nearest == null && hyperfocal == null) {
62 nearest = (nearest == null) ? 0.0f : nearest;
65 if (nearest > hyperfocal) {
66 return new LinearScale(hyperfocal, nearest, 0, 1);
69 return new LinearScale(nearest, hyperfocal, 0, 1);
|
| /external/valgrind/none/tests/s390x/ |
| srnmb.stderr.exp | 4 Continuing using 'round to nearest'. Results may differ!
|
| rounding-6.stdout.exp | 1 cfebr 1.250000 -> 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.750000 -> 2 cc = 2 [-> nearest even]
17 cfebr -1.250000 -> -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.750000 -> -2 cc = 1 [-> nearest even]
33 cfebr 0.000000 -> 0 cc = 0 [-> nearest even]
37 cgebr 1.250000 -> 1 cc = 2 [-> nearest even
[all...] |
| /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/libvpx/libvpx/vp9/common/ |
| vp9_mvref_common.c | 37 // The nearest 2 blocks are treated differently
132 int_mv *mvlist, int_mv *nearest, int_mv *near) {
139 *nearest = mvlist[0];
146 int_mv *nearest, int_mv *near) {
160 nearest->as_int = mv_list[0].as_int;
165 nearest->as_int = bmi[0].as_mv[ref].as_int;
167 if (nearest->as_int != mv_list[n].as_int) {
179 nearest->as_int = bmi[2].as_mv[ref].as_int;
181 if (nearest->as_int != candidates[n].as_int) {
|
| vp9_mvref_common.h | 216 int_mv *mvlist, int_mv *nearest, int_mv *near);
221 int_mv *nearest, int_mv *near);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/ |
| PolynomialFunctionLagrangeForm.java | 166 int nearest = 0; local
178 nearest = i;
184 double value = y[nearest];
201 if (nearest < 0.5*(n-i+1)) {
202 value += c[nearest]; // fork down
204 nearest--;
205 value += d[nearest]; // fork up
|
| /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,
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/assortativity/ |
| connectivity.py | 16 # "k nearest neighbors, or neighbor_connectivity
49 The average degree connectivity is the average nearest neighbor degree of
99 This algorithm is sometimes called "k nearest neighbors'.
|
| /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/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
| KMeansPlusPlusClusterer.java | 174 // the nearest center that has already been chosen.
178 final Cluster<T> nearest = getNearestCluster(resultSet, p); local
179 final double d = p.distanceFrom(nearest.getCenter());
312 * Returns the nearest {@link Cluster} to the given point
316 * @param point the point to find the nearest {@link Cluster} for
317 * @return the nearest {@link Cluster} to the given point
|
| /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/ImageProcessing2/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/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,
|
| proximity_info_state_utils.cpp | 313 // the given point and the nearest key position.
355 const int x, const int y, const int time, const bool lastPoint, const float nearest,
379 } else if (nearest < ProximityInfoParams::NEAR_KEY_THRESHOLD_FOR_POINT_SCORE) {
416 const float nearest = updateNearKeysDistances(proximityInfo, maxPointToKeyLength, x, y, local
418 const float score = getPointScore(mostCommonKeyWidth, x, y, time, isLastPoint, nearest,
[all...] |
| /packages/apps/Camera2/src/com/android/camera/widget/ |
| FilmstripView.java | 799 int nearest = 0; local
801 while (nearest < BUFFER_SIZE
802 && (mViewItems[nearest] == null || mViewItems[nearest].getLeftPosition() == -1)) {
803 nearest++;
806 if (nearest == BUFFER_SIZE) {
810 int min = Math.abs(viewX - mViewItems[nearest].getCenterX());
812 for (int i = nearest + 1; i < BUFFER_SIZE && mViewItems[i] != null; i++) {
822 nearest = i;
825 return nearest;
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| AutoCompleteWindow.py | 321 jump = self.listbox.nearest(self.listbox.winfo_height()) - \
322 self.listbox.nearest(0)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| AutoCompleteWindow.py | 321 jump = self.listbox.nearest(self.listbox.winfo_height()) - \
322 self.listbox.nearest(0)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/generators/ |
| random_graphs.py | 297 Each node is connected to k nearest neighbors in ring topology
306 connected with its k nearest neighbors (k-1 neighbors if k is odd).
308 for each edge u-v in the underlying "n-ring with k nearest neighbors"
362 Each node is connected to k nearest neighbors in ring topology
376 connected with its k nearest neighbors (k-1 neighbors if k is odd).
378 for each edge u-v in the underlying "n-ring with k nearest neighbors"
435 Each node is connected to k nearest neighbors in ring topology
|
| /external/v8/test/mjsunit/ |
| debug-setbreakpoint.js | 198 // to the script body, its actual position is taken from the nearest statement
|
