HomeSort by relevance Sort by last modified time
    Searched defs:divisors (Results 1 - 14 of 14) sorted by null

  /prebuilts/go/darwin-x86/src/math/big/
natconv.go 309 table := divisors(len(x), b, ndigits, bb)
335 // by nat/nat division using tabulated divisors. Otherwise, it is converted iteratively using
431 table [64]divisor // cached divisors for base 10
440 func divisors(m int, b Word, ndigits int, bb Word) []divisor { func
452 // reuse and extend existing table of divisors or create new table as appropriate
  /prebuilts/go/linux-x86/src/math/big/
natconv.go 309 table := divisors(len(x), b, ndigits, bb)
335 // by nat/nat division using tabulated divisors. Otherwise, it is converted iteratively using
431 table [64]divisor // cached divisors for base 10
440 func divisors(m int, b Word, ndigits int, bb Word) []divisor { func
452 // reuse and extend existing table of divisors or create new table as appropriate
  /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/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:__anon28551
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/libjpeg-turbo/
jcdctmgr.c 38 typedef void (*quantize_method_ptr) (JCOEFPTR coef_block, DCTELEM *divisors,
41 FAST_FLOAT *divisors,
54 /* The actual post-DCT divisors --- not identical to the quant table
58 DCTELEM *divisors[NUM_QUANT_TBLS]; member in struct:__anon23341
252 /* Compute divisors for this quant table */
257 /* For LL&M IDCT method, divisors are equal to raw quantization
260 if (fdct->divisors[qtblno] == NULL) {
261 fdct->divisors[qtblno] = (DCTELEM *)
265 dtbl = fdct->divisors[qtblno];
280 /* For AA&N IDCT method, divisors are equal to quantizatio
498 DCTELEM *divisors = fdct->divisors[compptr->quant_tbl_no]; local
588 FAST_FLOAT *divisors = fdct->float_divisors[compptr->quant_tbl_no]; local
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/text/
CompactDecimalDataCache.java 58 * of one array and two hashmaps. The index of the divisors array as well
61 * index of the arrays should be used. Divisors contain the number to divide
62 * by before doing formatting. In the case of english, <code>divisors[4]</code>
76 long[] divisors; field in class:CompactDecimalDataCache.Data
80 Data(long[] divisors, Map<String, DecimalFormat.Unit[]> units)
82 this.divisors = divisors;
228 // Silently ignore divisors that are too big.
254 if (destination.divisors[log10Value] != 0L
255 && destination.divisors[log10Value] != divisor)
    [all...]
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/format/
CompactDecimalFormatTest.java 275 long[] divisors = new long[] { local
287 checkCore(affixes, null, divisors, TestACoreCompactFormatList);
288 checkCore(affixes, currencyAffixes, divisors, TestACoreCompactFormatListCurrency);
298 private void checkCore(Map<String, String[][]> affixes, Map<String, String[]> currencyAffixes, long[] divisors, Object[][] testItems) {
304 divisors, affixes, currencyAffixes,
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
CompactDecimalDataCache.java 57 * of one array and two hashmaps. The index of the divisors array as well
60 * index of the arrays should be used. Divisors contain the number to divide
61 * by before doing formatting. In the case of english, <code>divisors[4]</code>
75 long[] divisors; field in class:CompactDecimalDataCache.Data
79 Data(long[] divisors, Map<String, DecimalFormat.Unit[]> units)
81 this.divisors = divisors;
227 // Silently ignore divisors that are too big.
253 if (destination.divisors[log10Value] != 0L
254 && destination.divisors[log10Value] != divisor)
    [all...]
  /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/
CompactDecimalFormatTest.java 274 long[] divisors = new long[] { local
286 checkCore(affixes, null, divisors, TestACoreCompactFormatList);
287 checkCore(affixes, currencyAffixes, divisors, TestACoreCompactFormatListCurrency);
297 private void checkCore(Map<String, String[][]> affixes, Map<String, String[]> currencyAffixes, long[] divisors, Object[][] testItems) {
303 divisors, affixes, currencyAffixes,
  /external/icu/icu4c/source/i18n/
compactdecimalformat.cpp 90 double divisors[MAX_DIGITS]; member in class:CDFLocaleStyleData
93 // first compute log10(x). Compute displayNum = (x / divisors[log10(x)]).
104 uprv_memset(divisors, 0, sizeof(divisors));
176 const double* divisors,
178 : DecimalFormat(decimalFormat), _unitsByVariant(unitsByVariant), _divisors(divisors), _pluralRules(pluralRules) {
201 new CompactDecimalFormat(*decfmt, data->unitsByVariant, data->divisors, pluralRules.getAlias());
654 // Silently ignore divisors that are too big.
683 if (destination->divisors[log10Value] != 0.0
684 && destination->divisors[log10Value] != divisor)
    [all...]
  /prebuilts/misc/common/icu4j/
icu4j.jar 
  /prebuilts/misc/common/robolectric/lib/
icu4j-53.1.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 

Completed in 310 milliseconds