/external/v8/test/mjsunit/asm/ |
int32mod.js | 19 var divisors = [-2147483648, -32 * 1024, -1000, -16, -7, -2, -1, 0, variable 21 for (var i in divisors) { 22 var divisor = divisors[i];
|
int32modb.js | 19 var divisors = [-2147483648, -32 * 1024, -1000, -16, -7, -2, -1, 0, variable 21 for (var i = 0; i < divisors.length; i++) { 22 var divisor = divisors[i];
|
uint32mod.js | 19 var divisors = [0, 1, 3, 4, 10, 42, 64, 100, 1024, 2147483647, 4294967295]; variable 20 for (var i in divisors) { 21 var divisor = divisors[i];
|
int32div.js | 25 var divisors = [-2147483648, -32 * 1024, -1000, -16, -7, -2, -1, 0, variable 27 for (var i in divisors) { 28 var divisor = divisors[i];
|
int32mod-constant.js | 25 var divisors = [-2147483648, -32 * 1024, -1000, -16, -7, -2, -1, 0, variable 27 for (var i in divisors) { 28 var divisor = divisors[i];
|
uint32div.js | 22 var divisors = [0, 1, 3, 4, 10, 42, 64, 100, 1024, 2147483647, 4294967295]; variable 23 for (var i in divisors) { 24 var divisor = divisors[i]; 39 for (var i in divisors) { 40 var divisor = divisors[i];
|
uint32mod-constant.js | 22 var divisors = [0, 1, 3, 4, 10, 42, 64, 100, 1024, 2147483647, 4294967295]; variable 23 for (var i in divisors) { 24 var divisor = divisors[i];
|
/external/v8/test/mjsunit/ |
div-mod.js | 69 var divisors = [ variable 88 for (var i = 0; i < divisors.length; i++) { 89 run_tests_for(divisors[i]); 212 for (var j = 0; j < divisors.length; j++) { 213 mod_func = this.eval("(function(left) { return left % " + divisors[j]+ "; })"); 214 assertEquals((mod_func)(left_operands[i]), left_operands[i] % divisors[j]); 215 assertEquals((mod_func)(-left_operands[i]), -left_operands[i] % divisors[j]);
|
/external/guava/guava-tests/benchmark/com/google/common/primitives/ |
UnsignedLongsBenchmark.java | 34 private static final long[] divisors = new long[ARRAY_SIZE]; field in class:UnsignedLongsBenchmark 44 divisors[i] = randomDivisor(longs[i]); 56 tmp += UnsignedLongs.divide(longs[j], divisors[j]); 65 tmp += UnsignedLongs.remainder(longs[j], divisors[j]);
|
/external/opencv3/3rdparty/libjpeg/ |
jcdctmgr.c | 28 /* The actual post-DCT divisors --- not identical to the quant table 32 DCTELEM * divisors[NUM_QUANT_TBLS]; member in struct:__anon20921 74 DCTELEM * divisors = fdct->divisors[compptr->quant_tbl_no]; local 90 qval = divisors[i]; 137 FAST_FLOAT * divisors = fdct->float_divisors[compptr->quant_tbl_no]; local 154 temp = workspace[i] * divisors[i]; 355 /* Compute divisors for this quant table */ 360 /* For LL&M IDCT method, divisors are equal to raw quantization 363 if (fdct->divisors[qtblno] == NULL) [all...] |
/external/pdfium/third_party/libjpeg/ |
fpdfapi_jcdctmgr.c | 28 /* The actual post-DCT divisors --- not identical to the quant table 32 DCTELEM * divisors[NUM_QUANT_TBLS]; member in struct:__anon22197 70 /* Compute divisors for this quant table */ 75 /* For LL&M IDCT method, divisors are equal to raw quantization 78 if (fdct->divisors[qtblno] == NULL) { 79 fdct->divisors[qtblno] = (DCTELEM *) 83 dtbl = fdct->divisors[qtblno]; 92 /* For AA&N IDCT method, divisors are equal to quantization 112 if (fdct->divisors[qtblno] == NULL) { 113 fdct->divisors[qtblno] = (DCTELEM * 189 DCTELEM * divisors = fdct->divisors[compptr->quant_tbl_no]; local 279 FAST_FLOAT * divisors = fdct->float_divisors[compptr->quant_tbl_no]; local [all...] |
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/format/ |
CompactDecimalFormatTest.java | 221 long[] divisors = new long[] { local 227 checkCore(affixes, null, divisors, TestACoreCompactFormatList); 228 checkCore(affixes, currencyAffixes, divisors, TestACoreCompactFormatListCurrency); 231 private void checkCore(Map<String, String[][]> affixes, Map<String, String[]> currencyAffixes, long[] divisors, Object[][] testItems) { 237 divisors, affixes, currencyAffixes,
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/ |
CompactDecimalFormatTest.java | 217 long[] divisors = new long[] { local 223 checkCore(affixes, null, divisors, TestACoreCompactFormatList); 224 checkCore(affixes, currencyAffixes, divisors, TestACoreCompactFormatListCurrency); 227 private void checkCore(Map<String, String[][]> affixes, Map<String, String[]> currencyAffixes, long[] divisors, Object[][] testItems) { 233 divisors, affixes, currencyAffixes,
|
/external/libjpeg-turbo/ |
jcdctmgr.c | 37 typedef void (*quantize_method_ptr) (JCOEFPTR coef_block, DCTELEM * divisors, 40 FAST_FLOAT * divisors, 53 /* The actual post-DCT divisors --- not identical to the quant table 57 DCTELEM * divisors[NUM_QUANT_TBLS]; member in struct:__anon15814 247 /* Compute divisors for this quant table */ 252 /* For LL&M IDCT method, divisors are equal to raw quantization 255 if (fdct->divisors[qtblno] == NULL) { 256 fdct->divisors[qtblno] = (DCTELEM *) 260 dtbl = fdct->divisors[qtblno]; 275 /* For AA&N IDCT method, divisors are equal to quantizatio 493 DCTELEM * divisors = fdct->divisors[compptr->quant_tbl_no]; local 583 FAST_FLOAT * divisors = fdct->float_divisors[compptr->quant_tbl_no]; local [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
CompactDecimalDataCache.java | 48 * of one array and two hashmaps. The index of the divisors array as well 51 * index of the arrays should be used. Divisors contain the number to divide 52 * by before doing formatting. In the case of english, <code>divisors[4]</code> 66 long[] divisors; field in class:CompactDecimalDataCache.Data 69 Data(long[] divisors, Map<String, DecimalFormat.Unit[]> units) { 70 this.divisors = divisors; 270 // Silently ignore divisors that are too big. 326 result.divisors[thisIndex] = divisor; 432 for (int i = 0; i < result.divisors.length; i++) [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
CompactDecimalDataCache.java | 47 * of one array and two hashmaps. The index of the divisors array as well 50 * index of the arrays should be used. Divisors contain the number to divide 51 * by before doing formatting. In the case of english, <code>divisors[4]</code> 65 long[] divisors; field in class:CompactDecimalDataCache.Data 68 Data(long[] divisors, Map<String, DecimalFormat.Unit[]> units) { 69 this.divisors = divisors; 269 // Silently ignore divisors that are too big. 325 result.divisors[thisIndex] = divisor; 431 for (int i = 0; i < result.divisors.length; i++) [all...] |
/external/icu/icu4c/source/i18n/ |
compactdecimalformat.cpp | 88 double divisors[MAX_DIGITS]; member in class:CDFLocaleStyleData 91 // first compute log10(x). Compute displayNum = (x / divisors[log10(x)]). 168 const double* divisors, 170 : DecimalFormat(decimalFormat), _unitsByVariant(unitsByVariant), _divisors(divisors), _pluralRules(pluralRules) { 193 new CompactDecimalFormat(*decfmt, data->unitsByVariant, data->divisors, pluralRules.getAlias()); 747 // Silently ignore divisors that are too big. 800 result->divisors[log10Value] = divisor; 911 result->divisors[i] = lastDivisor; 914 lastDivisor = result->divisors[i];
|
/prebuilts/misc/common/icu4j/ |
icu4j.jar | |
/prebuilts/tools/common/m2/repository/com/ibm/icu/icu4j/53.1/ |
icu4j-53.1.jar | |
/prebuilts/tools/common/m2/repository/com/ibm/icu/icu4j/54.1.1/ |
icu4j-54.1.1.jar | |