| /external/valgrind/none/tests/s390x/ |
| fixbr.stdout.exp | 1 fixbr 1.25000 -> 1 [-> nearest even]
5 fixbr 1.50000 -> 2 [-> nearest even]
9 fixbr 2.50000 -> 2 [-> nearest even]
13 fixbr 1.75000 -> 2 [-> nearest even]
17 fixbr -1.25000 -> -1 [-> nearest even]
21 fixbr -1.50000 -> -2 [-> nearest even]
25 fixbr -2.50000 -> -2 [-> nearest even]
29 fixbr -1.75000 -> -2 [-> nearest even]
33 fixbr 0.00000 -> 0 [-> nearest even]
|
| 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...] |
| fixbr.c | 11 IRRoundingMode. As a consequence m3=1 which is "round to nearest with
20 case 1: return "[-> nearest away]";
22 case 4: return "[-> nearest even]";
|
| /external/eigen/doc/examples/ |
| Tutorial_ReductionsVisitorsBroadcasting_broadcast_1nn.cpp | 19 // find nearest neighbour
22 cout << "Nearest neighbour is column " << index << ":" << endl;
|
| /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);
|
| /frameworks/rs/java/tests/RSTest_CompatLib/src/com/android/rs/test/ |
| UT_sampler.java | 39 b.setMinification(Sampler.Value.NEAREST);
40 b.setMagnification(Sampler.Value.NEAREST);
85 _RS_ASSERT("minification.getMagnification() == Sampler.Value.NEAREST",
86 minification.getMagnification() == Sampler.Value.NEAREST);
98 _RS_ASSERT("magnification.getMinification() == Sampler.Value.NEAREST",
99 magnification.getMinification() == Sampler.Value.NEAREST);
107 _RS_ASSERT("wrapS.getMagnification() == Sampler.Value.NEAREST",
108 wrapS.getMagnification() == Sampler.Value.NEAREST);
109 _RS_ASSERT("wrapS.getMinification() == Sampler.Value.NEAREST",
110 wrapS.getMinification() == Sampler.Value.NEAREST);
[all...] |
| /frameworks/rs/java/tests/RSTest_CompatLibLegacy/src/com/android/rs/test/ |
| UT_sampler.java | 39 b.setMinification(Sampler.Value.NEAREST);
40 b.setMagnification(Sampler.Value.NEAREST);
85 _RS_ASSERT("minification.getMagnification() == Sampler.Value.NEAREST",
86 minification.getMagnification() == Sampler.Value.NEAREST);
98 _RS_ASSERT("magnification.getMinification() == Sampler.Value.NEAREST",
99 magnification.getMinification() == Sampler.Value.NEAREST);
107 _RS_ASSERT("wrapS.getMagnification() == Sampler.Value.NEAREST",
108 wrapS.getMagnification() == Sampler.Value.NEAREST);
109 _RS_ASSERT("wrapS.getMinification() == Sampler.Value.NEAREST",
110 wrapS.getMinification() == Sampler.Value.NEAREST);
[all...] |
| /frameworks/rs/java/tests/RsTest/src/com/android/rs/test/ |
| UT_sampler.java | 39 b.setMinification(Sampler.Value.NEAREST);
40 b.setMagnification(Sampler.Value.NEAREST);
85 _RS_ASSERT("minification.getMagnification() == Sampler.Value.NEAREST",
86 minification.getMagnification() == Sampler.Value.NEAREST);
98 _RS_ASSERT("magnification.getMinification() == Sampler.Value.NEAREST",
99 magnification.getMinification() == Sampler.Value.NEAREST);
107 _RS_ASSERT("wrapS.getMagnification() == Sampler.Value.NEAREST",
108 wrapS.getMagnification() == Sampler.Value.NEAREST);
109 _RS_ASSERT("wrapS.getMinification() == Sampler.Value.NEAREST",
110 wrapS.getMinification() == Sampler.Value.NEAREST);
[all...] |
| /external/libgdx/tests/gdx-tests-android/assets/data/ |
| atlased-fonts.txt | 3 filter: Nearest,Nearest
|
| testpack | 4 filter: Nearest,Nearest
|
| testpackobb | 4 filter: Nearest,Nearest
|
| issue_pack | 4 filter: MipMapLinearNearest,Nearest
|
| jump.txt | 3 filter: Nearest,Nearest
|
| /external/opencv3/doc/py_tutorials/py_ml/py_knn/ |
| py_knn_index.markdown | 1 K-Nearest Neighbour {#tutorial_py_knn_index}
|
| /external/mesa3d/src/gallium/drivers/nv30/ |
| nv30_transfer.h | 21 NEAREST = 0,
|
| /external/opencv3/doc/py_tutorials/py_ml/py_knn/py_knn_understanding/ |
| py_knn_understanding.markdown | 1 Understanding k-Nearest Neighbour {#tutorial_py_knn_understanding}
7 In this chapter, we will understand the concepts of k-Nearest Neighbour (kNN) algorithm.
30 One method is to check who is his nearest neighbour. From the image, it is clear it is the Red
31 Triangle family. So he is also added into Red Triangle. This method is called simply **Nearest
32 Neighbour**, because classification depends only on the nearest neighbour.
34 But there is a problem with that. Red Triangle may be the nearest. But what if there are lot of Blue
36 just checking nearest one is not sufficient. Instead we check some k nearest families. Then whoever
37 is majority in them, the new guy belongs to that family. In our image, let's take k=3, ie 3 nearest
42 So better take k as an odd number. So this method is called **k-Nearest Neighbour** sinc
[all...] |
| /external/skia/include/core/ |
| SkFilterQuality.h | 18 kNone_SkFilterQuality, //!< fastest but lowest quality, typically nearest-neighbor
|
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| nn_index.h | 43 * Nearest-neighbour index base class
61 * \brief Perform k-nearest neighbor search
62 * \param[in] queries The query points for which to find the nearest neighbors
63 * \param[out] indices The indices of the nearest neighbors found
64 * \param[out] dists Distances to the nearest neighbors found
65 * \param[in] knn Number of nearest neighbors to return
97 * \param[out] dists The distances to the nearest neighbors found
170 * \brief Method that searches for nearest-neighbours
|
| /frameworks/rs/java/tests/SampleTest/res/values/ |
| strings.xml | 26 <string name="wrapnearest">Wrap Nearest</string>
27 <string name="clampnearest">Clamp Nearest</string>
|
| /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);
|
| /frameworks/base/rs/java/android/renderscript/ |
| Sampler.java | 31 NEAREST (0),
93 * Retrieve a sampler with min and mag set to nearest and wrap modes set to
105 b.setMinification(Value.NEAREST);
106 b.setMagnification(Value.NEAREST);
165 * Retrieve a sampler with min and mag set to nearest and wrap modes set to
177 b.setMinification(Value.NEAREST);
178 b.setMagnification(Value.NEAREST);
237 * Retrieve a sampler with min and mag set to nearest and wrap modes set to
249 b.setMinification(Value.NEAREST);
250 b.setMagnification(Value.NEAREST);
[all...] |
| /frameworks/support/v8/renderscript/java/src/android/support/v8/renderscript/ |
| Sampler.java | 44 NEAREST (0),
105 * Retrieve a sampler with min and mag set to nearest and wrap modes set to
115 b.setMinification(Value.NEAREST);
116 b.setMagnification(Value.NEAREST);
165 * Retrieve a sampler with min and mag set to nearest and wrap modes set to
175 b.setMinification(Value.NEAREST);
176 b.setMagnification(Value.NEAREST);
225 * Retrieve a sampler with min and mag set to nearest and wrap modes set to
235 b.setMinification(Value.NEAREST);
236 b.setMagnification(Value.NEAREST);
[all...] |
| /external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/ |
| FilterPerformanceTest.java | 44 String[] filterNames = {"nearest", "linear", "nearest mipmap nearest", "linear mipmap nearest", "linear mipmap linear"};
64 texture.setFilter(TextureFilter.MipMap, TextureFilter.Nearest);
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
| btInternalEdgeUtility.cpp | 492 btVector3 nearest; local
493 btNearestPointInLineSegment(cp.m_localPointB,v0,v1,nearest);
498 btDebugDrawLine(tr*nearest,tr*cp.m_localPointB,red);
518 btVector3 nearest; local
519 btNearestPointInLineSegment( cp.m_localPointB, v0, v1, nearest );
520 btScalar len=(contact-nearest).length();
531 btVector3 nearest; local
532 btNearestPointInLineSegment( cp.m_localPointB, v1, v2, nearest );
533 btScalar len=(contact-nearest).length();
544 btVector3 nearest; local
[all...] |
