| /external/stlport/test/unit/ |
| complete_digits.h | 8 complete_digits(std::string &digits)
10 complete_digits(string &digits)
13 while (digits.size() < 2)
15 digits.insert(digits.begin(), '0');
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| complete_digits.h | 8 complete_digits(std::string &digits)
10 complete_digits(string &digits)
13 while (digits.size() < 2)
15 digits.insert(digits.begin(), '0');
|
| /ndk/tests/device/test-stlport/unit/ |
| complete_digits.h | 8 complete_digits(std::string &digits)
10 complete_digits(string &digits)
13 while (digits.size() < 2)
15 digits.insert(digits.begin(), '0');
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| JavaScriptTarget.java | 65 private void writeHexWithPadding(StringBuffer buf, String digits) {
66 digits = digits.toUpperCase();
67 int padding = 8 - digits.length();
72 buf.append(digits);
|
| /libcore/luni/src/main/java/java/math/ |
| Logical.java | 51 if (val.digits[val.numberLength - 1] != -1) {
52 for (i = 0; val.digits[i] == -1; i++) {
56 for (i = 0; (i < val.numberLength) && (val.digits[i] == -1); i++) {
67 for (i = 0; val.digits[i] == 0; i++) {
73 resDigits[i] = val.digits[i] + val.sign;
76 resDigits[i] = val.digits[i];
122 resDigits[i] = val.digits[i] & that.digits[i];
135 // the positive digits
145 resDigits[i] = -negative.digits[i] & positive.digits[i]
[all...] |
| BigInteger.java | 54 transient int[] digits; field in class:BigInteger
58 * digits.length().
113 * @param digits a reference of some array created before.
115 BigInteger(int sign, int numberLength, int[] digits) {
116 setJavaRepresentation(sign, numberLength, digits);
136 int[] digits = new int[numberLength]; local
138 digits[i] = random.nextInt();
141 digits[numberLength - 1] >>>= (-numBits) & 31;
142 setJavaRepresentation(sign, numberLength, digits);
207 * non-empty sequence of decimal digits. Digits are interpreted as if b
358 int[] digits = (sign != 0) ? bigInt.littleEndianIntsMagnitude() : new int[] { 0 }; local
1188 int[] digits = new int[bigRadixDigitsLength]; local
[all...] |
| /external/dropbear/libtommath/ |
| bn_mp_rand.c | 20 mp_rand (mp_int * a, int digits)
26 if (digits <= 0) {
39 while (--digits > 0) {
|
| /external/chromium_org/third_party/libxslt/libxslt/ |
| extra.c | 175 char digits[5]; local
202 memset(digits, 0, sizeof(digits));
203 strncpy(digits, str+7, 4);
204 field = strtol(digits, NULL, 10);
207 memset(digits, 0, sizeof(digits));
208 strncpy(digits, str+12, 2);
209 field = strtol(digits, NULL, 10);
212 memset(digits, 0, sizeof(digits))
[all...] |
| /external/libxslt/libxslt/ |
| extra.c | 175 char digits[5]; local
202 memset(digits, 0, sizeof(digits));
203 strncpy(digits, str+7, 4);
204 field = strtol(digits, NULL, 10);
207 memset(digits, 0, sizeof(digits));
208 strncpy(digits, str+12, 2);
209 field = strtol(digits, NULL, 10);
212 memset(digits, 0, sizeof(digits))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/language.support/support.limits/limits/numeric.limits.members/ |
| digits.pass.cpp | 12 // digits
21 static_assert(std::numeric_limits<T>::digits == expected, "digits test 1");
22 static_assert(std::numeric_limits<const T>::digits == expected, "digits test 2");
23 static_assert(std::numeric_limits<volatile T>::digits == expected, "digits test 3");
24 static_assert(std::numeric_limits<const volatile T>::digits == expected, "digits test 4");
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_strtod.py | 108 # exact halfway cases with a small number of significant digits
119 # with small number of significant digits.
128 # until n * 2**p2 has more than 20 significant digits.
129 digits, exponent = n, e
130 while digits < 10**20:
131 s = '{}e{}'.format(digits, exponent)
134 s = '{}e{}'.format(digits * 10**40, exponent - 40)
136 digits *= 2
140 digits, exponent = n, e
141 while digits < 10**20
[all...] |
| test_fpformat.py | 17 # digits instead of 2.
23 def checkFix(self, n, digits):
24 result = fix(n, digits)
27 expected = "%.*f" % (digits, float(n))
31 def checkSci(self, n, digits):
32 result = sci(n, digits)
35 expected = "%.*e" % (digits, float(n))
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_strtod.py | 108 # exact halfway cases with a small number of significant digits
119 # with small number of significant digits.
128 # until n * 2**p2 has more than 20 significant digits.
129 digits, exponent = n, e
130 while digits < 10**20:
131 s = '{}e{}'.format(digits, exponent)
134 s = '{}e{}'.format(digits * 10**40, exponent - 40)
136 digits *= 2
140 digits, exponent = n, e
141 while digits < 10**20
[all...] |
| test_fpformat.py | 17 # digits instead of 2.
23 def checkFix(self, n, digits):
24 result = fix(n, digits)
27 expected = "%.*f" % (digits, float(n))
31 def checkSci(self, n, digits):
32 result = sci(n, digits)
35 expected = "%.*e" % (digits, float(n))
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLFontElement.cpp | 96 StringBuilder digits;
97 digits.reserveCapacity(16);
101 digits.append(*position++);
105 if (digits.isEmpty())
111 if (digits.is8Bit())
112 value = charactersToIntStrict(digits.characters8(), digits.length());
114 value = charactersToIntStrict(digits.characters16(), digits.length());
|
| /external/v8/src/ |
| utils.cc | 69 int digits = 1; local
70 for (uint32_t factor = 10; digits < 10; digits++, factor *= 10) {
73 position_ += digits;
74 for (int i = 1; i <= digits; i++) {
|
| /external/stlport/src/ |
| num_get.cpp | 78 bool _STLP_CALL __get_fdigit(wchar_t& c, const wchar_t* digits) {
79 const wchar_t* p = find(digits, digits + 10, c);
80 if (p != digits + 10) {
81 c = (char)('0' + (p - digits));
89 const wchar_t * digits) {
95 return __get_fdigit(c, digits);
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| FixASCIIControlsReader.java | 40 /** count the digits of the sequence */
41 private int digits = 0; field in class:FixASCIIControlsReader
138 digits = 0;
144 digits = 1;
157 digits++;
158 if (digits <= 5)
184 digits++;
185 if (digits <= 4)
|
| /ndk/sources/cxx-stl/stlport/src/ |
| num_get.cpp | 78 bool _STLP_CALL __get_fdigit(wchar_t& c, const wchar_t* digits) {
79 const wchar_t* p = find(digits, digits + 10, c);
80 if (p != digits + 10) {
81 c = (char)('0' + (p - digits));
89 const wchar_t * digits) {
95 return __get_fdigit(c, digits);
|
| /external/chromium_org/v8/src/ |
| utils.cc | 70 int digits = 1; local
71 for (uint32_t factor = 10; digits < 10; digits++, factor *= 10) {
74 position_ += digits;
75 for (int i = 1; i <= digits; i++) {
|
| /external/icu4c/i18n/ |
| digitlst.cpp | 50 * This is the zero digit. The base for the digits returned by getDigit()
75 fContext.digits = fStorage.getCapacity();
112 // Always reset the fContext.digits, even if fDecNumber was not reallocated,
114 fContext.digits = fStorage.getCapacity();
146 c.digits = 1;
162 int32_t savedDigits = fContext.digits;
163 fContext.digits = 1;
165 fContext.digits = savedDigits;
179 // Reduce - remove trailing zero digits.
187 // trim - remove trailing fraction zero digits
[all...] |
| decNumber.c | 60 /* precision (up to 999,999,999 digits) and arbitrary exponent */
64 /* tightly: digits, emax, and -emin in the context must be <= */
69 /* be finite, positive, have an exponent of zero, and all digits */
70 /* must be either 0 or 1. The result will only contain digits */
150 /* 6. The digits count is allowed to rise to a multiple of DECDPUN */
152 /* accounting of digits is not needed. The correct digits value */
154 /* This must be called before any rounding if the number of digits */
158 /* numbers up to four digits, using appropriate constants. This */
216 /* round-for-reround digits */
7810 Int digits=(len-1)*DECDPUN+1; \/* possible digits excluding msu *\/ local
8000 Int ae, d, digits; \/* .. *\/ local
[all...] |
| /external/chromium_org/third_party/icu/source/i18n/ |
| digitlst.cpp | 49 * This is the zero digit. The base for the digits returned by getDigit()
83 fContext.digits = fStorage.getCapacity();
121 // Always reset the fContext.digits, even if fDecNumber was not reallocated,
123 fContext.digits = fStorage.getCapacity();
144 c.digits = 1;
160 int32_t savedDigits = fContext.digits;
161 fContext.digits = 1;
163 fContext.digits = savedDigits;
177 // Reduce - remove trailing zero digits.
185 // trim - remove trailing fraction zero digits
[all...] |
| decNumber.c | 60 /* precision (up to 999,999,999 digits) and arbitrary exponent */
64 /* tightly: digits, emax, and -emin in the context must be <= */
69 /* be finite, positive, have an exponent of zero, and all digits */
70 /* must be either 0 or 1. The result will only contain digits */
150 /* 6. The digits count is allowed to rise to a multiple of DECDPUN */
152 /* accounting of digits is not needed. The correct digits value */
154 /* This must be called before any rounding if the number of digits */
158 /* numbers up to four digits, using appropriate constants. This */
321 /* complement of digits (where appropriate -- this is not the case *
7778 Int digits=(len-1)*DECDPUN+1; \/* possible digits excluding msu *\/ local
7968 Int ae, d, digits; \/* .. *\/ local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
| HTMLParserIdioms.cpp | 176 StringBuilder digits;
180 digits.append(*position++);
185 if (digits.is8Bit())
186 value = sign * charactersToIntStrict(digits.characters8(), digits.length(), &ok);
188 value = sign * charactersToIntStrict(digits.characters16(), digits.length(), &ok);
236 StringBuilder digits;
240 digits.append(*position++);
245 if (digits.is8Bit()
[all...] |
