| /external/chromium_org/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]);
206 for (var j = 0; j < divisors.length; j++) {
207 mod_func = this.eval("(function(left) { return left % " + divisors[j]+ "; })");
208 assertEquals((mod_func)(left_operands[i]), left_operands[i] % divisors[j]);
209 assertEquals((mod_func)(-left_operands[i]), -left_operands[i] % divisors[j]);
|
| /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]);
206 for (var j = 0; j < divisors.length; j++) {
207 mod_func = this.eval("(function(left) { return left % " + divisors[j]+ "; })");
208 assertEquals((mod_func)(left_operands[i]), left_operands[i] % divisors[j]);
209 assertEquals((mod_func)(-left_operands[i]), -left_operands[i] % divisors[j]);
|
| /external/jpeg/ |
| jcdctmgr.c | 28 /* The actual post-DCT divisors --- not identical to the quant table
32 DCTELEM * divisors[NUM_QUANT_TBLS]; member in struct:__anon21401
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/qemu/distrib/jpeg-6b/ |
| jcdctmgr.c | 28 /* The actual post-DCT divisors --- not identical to the quant table
32 DCTELEM * divisors[NUM_QUANT_TBLS]; member in struct:__anon26630
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/icu4c/i18n/ |
| compactdecimalformat.cpp | 90 double divisors[MAX_DIGITS]; member in class:CDFLocaleStyleData
93 // first compute log10(x). Compute displayNum = (x / divisors[log10(x)]).
170 const double* divisors,
172 : DecimalFormat(decimalFormat), _unitsByVariant(unitsByVariant), _divisors(divisors), _pluralRules(pluralRules) {
195 new CompactDecimalFormat(*decfmt, data->unitsByVariant, data->divisors, pluralRules.getAlias());
701 // Silently ignore divisors that are too big.
754 result->divisors[log10Value] = divisor;
865 result->divisors[i] = lastDivisor;
868 lastDivisor = result->divisors[i];
|
| /prebuilts/misc/common/icu4j/ |
| icu4j.jar | |
