/external/valgrind/none/tests/s390x/ |
H A 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]
|
H A D | srnmb.stderr.exp | 4 Continuing using 'round to nearest'. Results may differ!
|
H A 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 eve [all...] |
/external/python/cpython2/Tools/pynche/ |
H A D | ColorDB.py | 102 def nearest(self, red, green, blue): 103 """Return the name of color nearest (red, green, blue)""" 105 # octree for speeding up the locating of nearest point? Exhaustive 107 nearest = -1 115 if nearest == -1 or distance < nearest: 116 nearest = distance 267 r, g, b = (1, 1, 128) # nearest to navy 268 r, g, b = (145, 238, 144) # nearest to lightgreen variable 270 print 'finding nearest t 101 def nearest(self, red, green, blue): member in class:ColorDB [all...] |
H A D | ChipViewer.py | 4 ChipWidgets, one for the selected color and one for the nearest color. The 6 nearest color is the named color from the X11 database that is closest to the 8 nearest one is the first one found. 10 Clicking on the nearest color chip selects that named color. 13 selected and nearest ChipWidgets. 92 # create the chip that will display the nearest real X11 color 101 # Selected always shows the #rrggbb name of the color, nearest always 102 # shows the name of the nearest color in the database. BAW: should 110 # find the nearest 111 nearest [all...] |
/external/python/cpython3/Tools/pynche/ |
H A D | ColorDB.py | 101 def nearest(self, red, green, blue): 102 """Return the name of color nearest (red, green, blue)""" 104 # octree for speeding up the locating of nearest point? Exhaustive 106 nearest = -1 114 if nearest == -1 or distance < nearest: 115 nearest = distance 262 r, g, b = (1, 1, 128) # nearest to navy 263 r, g, b = (145, 238, 144) # nearest to lightgreen variable 265 print('finding nearest t 100 def nearest(self, red, green, blue): member in class:ColorDB [all...] |
H A D | ChipViewer.py | 4 ChipWidgets, one for the selected color and one for the nearest color. The 6 nearest color is the named color from the X11 database that is closest to the 8 nearest one is the first one found. 10 Clicking on the nearest color chip selects that named color. 13 selected and nearest ChipWidgets. 92 # create the chip that will display the nearest real X11 color 101 # Selected always shows the #rrggbb name of the color, nearest always 102 # shows the name of the nearest color in the database. BAW: should 110 # find the nearest 111 nearest [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/ |
H A D | PolynomialFunctionLagrangeForm.java | 166 int nearest = 0; 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/libpng/intel/ |
H A D | filter_sse2_intrinsics.c | 251 * The Paeth function predicts d to be whichever of a, b, or c is nearest to 272 __m128i pa,pb,pc,smallest,nearest; local 293 nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, 298 d = _mm_add_epi8(d, nearest); 309 __m128i pa,pb,pc,smallest,nearest; local 329 nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, 334 d = _mm_add_epi8(d, nearest); 350 * The Paeth function predicts d to be whichever of a, b, or c is nearest to 361 __m128i pa,pb,pc,smallest,nearest; local 391 nearest [all...] |
/external/libpng/contrib/intel/ |
H A D | filter_sse2_intrinsics.c | 232 * The Paeth function predicts d to be whichever of a, b, or c is nearest to 270 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, local 275 d = _mm_add_epi8(d, nearest); 305 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, local 310 d = _mm_add_epi8(d, nearest); 326 * The Paeth function predicts d to be whichever of a, b, or c is nearest to 364 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, local 369 d = _mm_add_epi8(d, nearest);
|
/external/pdfium/third_party/libpng16/contrib/intel/ |
H A D | filter_sse2_intrinsics.c | 232 * The Paeth function predicts d to be whichever of a, b, or c is nearest to 270 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, local 275 d = _mm_add_epi8(d, nearest); 305 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, local 310 d = _mm_add_epi8(d, nearest); 326 * The Paeth function predicts d to be whichever of a, b, or c is nearest to 364 __m128i nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, local 369 d = _mm_add_epi8(d, nearest);
|
/external/libvpx/libvpx/vp8/common/ |
H A D | findnearmv.c | 23 void vp8_find_near_mvs(MACROBLOCKD *xd, const MODE_INFO *here, int_mv *nearest, argument 100 /* Swap near and nearest if necessary */ 118 nearest->as_int = near_mvs[CNT_NEAREST].as_int;
|
H A D | findnearmv.h | 72 void vp8_find_near_mvs(MACROBLOCKD *xd, const MODE_INFO *here, int_mv *nearest,
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
H A D | KMeansPlusPlusClusterer.java | 174 // the nearest center that has already been chosen. 178 final Cluster<T> nearest = getNearestCluster(resultSet, p); 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
|
/external/python/cpython2/Demo/tkinter/guido/ |
H A D | kill.py | 45 e.widget.select_set(e.widget.nearest(e.y)) 49 self.kill(e.widget.get(e.widget.nearest(e.y)))
|
H A D | mbox.py | 206 itop = scanbox.nearest(0) 225 itop = scanbox.nearest(0)
|
H A D | svkill.py | 58 e.widget.select_set(e.widget.nearest(e.y)) 62 self.kill(e.widget.get(e.widget.nearest(e.y)))
|
/external/eigen/Eigen/src/Core/ |
H A D | GlobalFunctions.h | 84 EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(round,scalar_round_op,nearest integer,\sa Eigen::floor DOXCOMMA Eigen::ceil DOXCOMMA ArrayBase::round) 85 EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(floor,scalar_floor_op,nearest integer not greater than the giben value,\sa Eigen::ceil DOXCOMMA ArrayBase::floor) 86 EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(ceil,scalar_ceil_op,nearest integer not less than the giben value,\sa Eigen::floor DOXCOMMA ArrayBase::ceil)
|
/external/tensorflow/tensorflow/examples/tutorials/word2vec/ |
H A D | word2vec_basic.py | 169 # We pick a random validation set to sample nearest neighbors. Here we limit the 291 top_k = 8 # number of nearest neighbors 292 nearest = (-sim[i, :]).argsort()[1:top_k + 1] variable 295 close_word = reverse_dictionary[nearest[k]]
|
/external/python/cpython2/Lib/idlelib/ |
H A D | AutoCompleteWindow.py | 323 jump = self.listbox.nearest(self.listbox.winfo_height()) - \ 324 self.listbox.nearest(0)
|
/external/python/cpython3/Lib/idlelib/ |
H A D | autocomplete_w.py | 324 jump = self.listbox.nearest(self.listbox.winfo_height()) - \ 325 self.listbox.nearest(0)
|
/external/webrtc/webrtc/modules/audio_coding/neteq/test/delay_tool/ |
H A D | plot_neteq_delay.m | 159 delaypoints,'nearest',NaN);
|
/external/python/cpython2/Lib/lib-tk/ |
H A D | Tix.py | 1036 def nearest(self, y): member in class:HList 1037 return self.tk.call(self._w, 'nearest', y) 1494 def nearest(self, x, y): member in class:TList 1495 return self.tk.call(self._w, 'nearest', x, y) 1803 # edit, entryconfigure, format, geometryinfo, info, index, move, nearest, 1875 def nearest(self, x, y): member in class:Grid 1876 "Return coordinate of cell nearest pixel coordinate (x,y)" 1877 return self._getints(self.tk.call(self, 'nearest', x, y))
|
/external/python/cpython3/Lib/tkinter/ |
H A D | tix.py | 1030 def nearest(self, y): member in class:HList 1031 return self.tk.call(self._w, 'nearest', y) 1487 def nearest(self, x, y): member in class:TList 1488 return self.tk.call(self._w, 'nearest', x, y) 1795 # edit, entryconfigure, format, geometryinfo, info, index, move, nearest, 1867 def nearest(self, x, y): member in class:Grid 1868 "Return coordinate of cell nearest pixel coordinate (x,y)" 1869 return self._getints(self.tk.call(self, 'nearest', x, y))
|
/external/ImageMagick/www/api/ |
H A D | 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>
|