| /cts/tests/tests/display/src/android/display/cts/ |
| DisplayTest.java | 161 Point smallest = new Point(); local
163 display.getCurrentSizeRange(smallest, largest);
165 assertEquals(SECONDARY_DISPLAY_WIDTH, smallest.x);
166 assertEquals(SECONDARY_DISPLAY_HEIGHT, smallest.y);
|
| /frameworks/base/core/java/com/android/internal/database/ |
| SortCursor.java | 73 String smallest = ""; local
78 if (mCursor == null || current.compareToIgnoreCase(smallest) < 0) {
79 smallest = current;
155 String smallest = ""; local
162 if (smallestIdx < 0 || current.compareToIgnoreCase(smallest) < 0) {
163 smallest = current;
|
| /packages/apps/Music/src/com/android/music/ |
| SortCursor.java | 73 String smallest = ""; local
78 if (mCursor == null || current.compareToIgnoreCase(smallest) < 0) {
79 smallest = current;
155 String smallest = ""; local
162 if (smallestIdx < 0 || current.compareToIgnoreCase(smallest) < 0) {
163 smallest = current;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/configuration/ |
| VaryingConfiguration.java | 249 double smallest = 100; local
259 if (size <= smallest) {
260 smallest = size;
265 double inchesPerBucket = (biggest - smallest) / bucketCount;
268 int overriddenBucket = (int) ((overriddenSize - smallest) / inchesPerBucket);
270 double from = inchesPerBucket * bucket + smallest;
|
| /external/speex/libspeex/ |
| stereo.c | 151 spx_word32_t largest, smallest; local
178 smallest = e_right;
182 smallest = e_left;
189 smallest = VSHR32(smallest, shift);
190 balance = DIV32(largest, ADD32(smallest, 1));
195 balance=(largest+1.)/(smallest+1.);
216 /*fprintf (stderr, "%d %d %d %d\n", largest, smallest, balance_id, e_ratio);*/
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/ |
| GridLayoutConverter.java | 936 int smallest = iterator.next().mY1; local
947 int smallest = iterator.next().mX1; local
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/video/ |
| SDL_pixels.c | 316 unsigned int smallest; local
322 smallest = ~0;
328 if ( distance < smallest ) {
333 smallest = distance;
|
| /external/v8/test/mjsunit/regress/ |
| regress-326.js | 35 assertEquals(37, nonArray[0], "sort smallest first");
|
| /external/libvorbis/doc/ |
| 02-bitpacking.tex | 25 smallest integer storage representation offered by a platform. On
30 size that is a grouped multiple of this smallest size.
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| dfa.rb | 69 The smallest value of the next input symbol that has
|
| /external/v8/test/mjsunit/ |
| array-sort.js | 195 assertEquals(37, obj[0], "objsort smallest number");
|
| unicode-test.js | [all...] |
| /external/bison/data/ |
| yacc.c | 117 # Return the smallest int type able to handle numbers ranging from
[all...] |
| /external/chromium/chrome/browser/resources/bookmark_manager/js/ |
| main.js | 130 // picked as the smallest time a human perceives as instant.
[all...] |
| /external/ceres-solver/docs/ |
| solving.tex | 77 For all but the smallest problems the solution of~\eqref{eq:simple} in each iteration of the Levenberg-Marquardt algorithm is the dominant computational cost in Ceres. Ceres provides a number of different options for solving~\eqref{eq:simple}. There are two major classes of methods - factorization and iterative.
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tree.pas | 516 /// What is the smallest token index (indexing from 0) for this node
590 /// What is the smallest token index (indexing from 0) for this node
[all...] |
| /prebuilts/tools/common/m2/internal/xalan/xalan/2.6.0/ |
| xalan-2.6.0.jar | |
