| /external/valgrind/none/tests/s390x/ |
| D | 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 …]
|
| D | 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]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/ |
| D | PolynomialFunctionLagrangeForm.java | 166 int nearest = 0; in evaluate() local
178 nearest = i; in evaluate()
184 double value = y[nearest]; in evaluate()
201 if (nearest < 0.5*(n-i+1)) { in evaluate()
202 value += c[nearest]; // fork down in evaluate()
204 nearest--; in evaluate()
205 value += d[nearest]; // fork up in evaluate()
|
| /external/opencv3/3rdparty/openexr/Imath/ |
| D | ImathVecAlgo.h | 122 Vec nearest = v0; in closestVertex() local
129 nearest = v1; in closestVertex()
137 nearest = v2; in closestVertex()
140 return nearest; in closestVertex()
|
| D | ImathLineAlgo.h | 234 Vec3<T> nearest = v0; in closestVertex() local
242 nearest = v1; in closestVertex()
249 nearest = v2; in closestVertex()
252 return nearest; in closestVertex()
|
| /external/opencv3/doc/py_tutorials/py_ml/py_knn/py_knn_understanding/ |
| D | py_knn_understanding.markdown | 30 One method is to check who is his nearest neighbour. From the image, it is clear it is the Red
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
43 classification depends on k nearest neighbours.
56 the distance from new-comer to all the existing houses to find the nearest neighbour. If there
105 find the nearest neighbours of new-comer. We can specify how many neighbours we want. It returns:
110 3. Corresponding distances from new-comer to each nearest neighbour.
|
| /external/libpng/contrib/intel/ |
| D | filter_sse2_intrinsics.c | 216 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2() local
221 d = _mm_add_epi8(d, nearest); in png_read_filter_row_paeth3_sse2()
272 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth4_sse2() local
277 d = _mm_add_epi8(d, nearest); in png_read_filter_row_paeth4_sse2()
|
| /external/deqp/external/vulkancts/mustpass/1.0.0/ |
| D | vk-default.txt | 30992 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.min_filter.nearest
30994 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mag_filter.nearest
30995 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.equal_min_3_max_3
30996 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.select_min_1
30997 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.select_max_4
30998 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.select_bias_2_1
30999 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.select_bias_2_5
31000 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.select_bias_3_1
31001 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.select_bias_3_7
31039 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4b4a4_unorm_pack16.min_filter.nearest
[all …]
|
| /external/deqp/android/cts/master/ |
| D | vk-master.txt | 30996 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.min_filter.nearest
30998 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mag_filter.nearest
30999 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.equal_min_3_max_3
31000 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.select_min_1
31001 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.select_max_4
31002 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.select_bias_2_1
31003 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.select_bias_2_5
31004 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.select_bias_3_1
31005 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4_unorm_pack8.mipmap.nearest.lod.select_bias_3_7
31043 dEQP-VK.pipeline.sampler.view_type.1d.format.r4g4b4a4_unorm_pack16.min_filter.nearest
[all …]
|
| /external/llvm/test/CodeGen/AMDGPU/ |
| D | llvm.rint.ll | 52 %0 = call float @llvm.AMDIL.round.nearest.f32(float %in) #0
57 declare float @llvm.AMDIL.round.nearest.f32(float) #0
|
| /external/libvpx/libvpx/vp8/common/ |
| D | findnearmv.c | 28 int_mv *nearest, in vp8_find_near_mvs() argument
135 nearest->as_int = near_mvs[CNT_NEAREST].as_int; in vp8_find_near_mvs()
|
| D | findnearmv.h | 81 int_mv *nearest, int_mv *nearby, int_mv *best,
|
| /external/compiler-rt/lib/builtins/ |
| D | fp_trunc_impl.inc | 11 // IEEE-754 floating-point type in the default (round to nearest, ties to even)
87 // Round to nearest
123 // Round to nearest
|
| D | fp_mul_impl.inc | 11 // rounding (to nearest, ties to even).
112 // default IEEE-754 round-to-nearest, ties-to-even rounding mode.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
| D | KMeansPlusPlusClusterer.java | 178 final Cluster<T> nearest = getNearestCluster(resultSet, p); in chooseInitialCenters() local
179 final double d = p.distanceFrom(nearest.getCenter()); in chooseInitialCenters()
|
| /external/llvm/test/CodeGen/Hexagon/ |
| D | doubleconvert-ieee-rnd-near.ll | 3 ; to 32-bit int value in IEEE rounding to the nearest mode in V5.
|
| /external/llvm/test/CodeGen/WebAssembly/ |
| D | f64.ll | 109 ; CHECK: f64.nearest $push0=, $0{{$}}
117 ; CHECK: f64.nearest $push0=, $0{{$}}
|
| D | f32.ll | 109 ; CHECK: f32.nearest $push0=, $0{{$}}
117 ; CHECK: f32.nearest $push0=, $0{{$}}
|
| /external/opencv3/doc/py_tutorials/py_imgproc/py_histograms/py_2d_histogram/ |
| D | py_2d_histogram.markdown | 84 @note While using this function, remember, interpolation flag should be nearest for better results.
96 plt.imshow(hist,interpolation = 'nearest')
|
| /external/vulkan-validation-layers/libs/glm/detail/ |
| D | type_half.inl | 187 // Round to nearest, round "0.5" up.
239 // Round to nearest, round "0.5" up
|
| /external/autotest/client/site_tests/graphics_GLBench/ |
| D | control | 47 - nearest
|
| D | control.bvt-cq | 53 - nearest
|
| D | control.hwqual | 51 - nearest
|
| /external/deqp/doc/testspecs/GLES2/ |
| D | performance.texture.format.txt | 37 filtering (nearest neighbor mode). Shader body is populated with one or
|
| /external/opencv3/doc/tutorials/imgproc/imgtrans/distance_transformation/ |
| D | distance_transform.markdown | 10 …ry image, where the value of each pixel is replaced by its distance to the nearest background pixel
|