Searched defs:radix (Results 1 - 25 of 42) sorted by relevance

12

/external/icu4c/i18n/unicode/
H A Dnumsys.h93 * Create a numbering system using the specified radix, type, and description.
94 * @param radix The radix (base) for this numbering system.
101 static NumberingSystem* U_EXPORT2 createInstance(int32_t radix, UBool isAlgorithmic, const UnicodeString& description, UErrorCode& status );
120 * Returns the radix of this numbering system.
169 int32_t radix; member in class:NumberingSystem
173 void setRadix(int32_t radix);
/external/dropbear/libtommath/
H A Dbn_mp_fread.c19 int mp_fread(mp_int *a, int radix, FILE *stream) argument
36 /* find y in the radix map */
37 for (y = 0; y < radix; y++) {
42 if (y == radix) {
47 if ((err = mp_mul_d(a, radix, a)) != MP_OKAY) {
H A Dbn_mp_fwrite.c18 int mp_fwrite(mp_int *a, int radix, FILE *stream) argument
23 if ((err = mp_radix_size(a, radix, &len)) != MP_OKAY) {
32 if ((err = mp_toradix(a, buf, radix)) != MP_OKAY) {
H A Dbn_mp_radix_size.c19 int mp_radix_size (mp_int * a, int radix, int *size) argument
28 if (radix == 2) {
33 /* make sure the radix is in range */
34 if (radix < 2 || radix > 64) {
61 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
H A Dbn_mp_read_radix.c18 /* read a string [ASCII] in a given radix */
19 int mp_read_radix (mp_int * a, const char *str, int radix) argument
27 /* make sure the radix is ok */
28 if (radix < 2 || radix > 64) {
47 /* if the radix < 36 the conversion is case insensitive
51 ch = (char) ((radix < 36) ? toupper (*str) : *str);
59 * and is less than the given radix add it
62 if (y < radix) {
63 if ((res = mp_mul_d (a, (mp_digit) radix,
[all...]
H A Dbn_mp_toradix.c18 /* stores a bignum as a ASCII string in a given radix (2..64) */
19 int mp_toradix (mp_int * a, char *str, int radix) argument
26 /* check range of the radix */
27 if (radix < 2 || radix > 64) {
51 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
H A Dbn_mp_toradix_n.c18 /* stores a bignum as a ASCII string in a given radix (2..64)
22 int mp_toradix_n(mp_int * a, char *str, int radix, int maxlen) argument
29 /* check range of the maxlen, radix */
30 if (maxlen < 2 || radix < 2 || radix > 64) {
64 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
/external/icu4c/common/
H A Dustrfmt.c13 * Fills in a UChar* string with the radix-based representation of a
20 * @param radix the radix from 2..36
29 uint32_t i, uint32_t radix, int32_t minwidth)
37 digit = (int)(i % radix);
39 i=i/radix;
28 uprv_itou(UChar * buffer, int32_t capacity, uint32_t i, uint32_t radix, int32_t minwidth) argument
H A Dutil_props.cpp28 int8_t radix = 10; local
33 radix = 16;
38 radix = 8;
43 int32_t d = u_digit(rule.charAt(p++), radix);
49 int32_t v = (value * radix) + d;
178 * @param radix the radix in which to parse; must be >= 2 and <=
186 int32_t& pos, int8_t radix) {
188 // assert(radix >= 2);
189 // assert(radix <
185 parseNumber(const UnicodeString& text, int32_t& pos, int8_t radix) argument
[all...]
H A Dcstring.c138 * Takes a int32_t and fills in a char* string with that number "radix"-based.
144 T_CString_integerToString(char* buffer, int32_t v, int32_t radix) argument
152 U_ASSERT(radix>=2 && radix<=16);
154 if(v<0 && radix == 10) {
163 digit = (uint8_t)(uval % radix);
165 uval = uval / radix;
177 * Takes a int64_t and fills in a char* string with that number "radix"-based.
182 T_CString_int64ToString(char* buffer, int64_t v, uint32_t radix) argument
190 U_ASSERT(radix>
214 T_CString_stringToInteger(const char *integerString, int32_t radix) argument
[all...]
H A Dutil.cpp34 int32_t radix, int32_t minDigits) {
35 if (radix < 2 || radix > 36) {
36 // Bogus radix
47 while (nn >= radix) {
48 nn /= radix;
49 r *= radix;
60 r /= radix;
33 appendNumber(UnicodeString& result, int32_t n, int32_t radix, int32_t minDigits) argument
/external/icu4c/i18n/
H A Desctrn.h25 * empty, a radix, typically 16 or 10, a minimum digit count,
59 * The radix to display the number in. Typically 16 or 10. Must
62 int32_t radix; member in class:EscapeTransliterator
80 * prefix, suffix, radix, and minDigits of this object are used
99 int32_t radix, int32_t minDigits,
H A Dnfrule.h62 double getDivisor() const { return uprv_pow(radix, exponent); }
96 int32_t radix; member in class:NFRule
H A Dnumsys.cpp39 static const char gRadix[] = "radix";
53 radix = 10;
150 int32_t radix = 10; local
160 radix = ures_getInt(nsCurrent,&status);
178 NumberingSystem* ns = NumberingSystem::createInstance(radix,isAlgorithmic,nsd,status);
191 return radix;
203 radix = r;
H A Dunesctrn.cpp186 int8_t radix = (int8_t) spec[ipat++]; local
228 int32_t digit = u_digit(ch, radix);
233 u = (u * radix) + digit;
/external/icu4c/tools/genrb/
H A Drbutil.c66 itostr(char * buffer, int32_t i, uint32_t radix, int32_t pad) argument
82 digit = (int)(i % radix);
84 i=i/radix;
/external/v8/src/
H A Dconversions.cc123 static bool isDigit(int x, int radix) { argument
124 return (x >= '0' && x <= '9' && x < '0' + radix)
125 || (radix > 10 && x >= 'a' && x < 'a' + radix - 10)
126 || (radix > 10 && x >= 'A' && x < 'A' + radix - 10);
135 // Parsing integers with radix 2, 4, 8, 16, 32. Assumes current != end.
152 const int radix = (1 << radix_log_2); local
156 if (*current >= '0' && *current <= '9' && *current < '0' + radix) {
158 } else if (radix > 1
[all...]
/external/webkit/Source/JavaScriptCore/runtime/
H A DNumberPrototype.cpp211 int radix; local
213 radix = radixValue.asInt32();
215 radix = 10;
217 radix = static_cast<int>(radixValue.toInteger(exec)); // nan -> 0
219 if (radix == 10)
225 if (radix == 36) {
235 if (radix < 2 || radix > 36)
236 return throwVMError(exec, createRangeError(exec, "toString() radix argument must be between 2 and 36"));
238 // INT_MAX results in 1024 characters left of the dot with radix
[all...]
/external/chromium/googleurl/src/
H A Durl_canon_internal.cc388 int _itoa_s(int value, char* buffer, size_t size_in_chars, int radix) { argument
390 if (radix == 10)
392 else if (radix == 16)
405 int _itow_s(int value, char16* buffer, size_t size_in_chars, int radix) { argument
406 if (radix != 10)
H A Durl_canon_internal.h429 int _itoa_s(int value, char* buffer, size_t size_in_chars, int radix);
430 int _itow_s(int value, char16* buffer, size_t size_in_chars, int radix);
434 inline int _itoa_s(int value, char (&buffer)[N], int radix) { argument
435 return _itoa_s(value, buffer, N, radix);
439 inline int _itow_s(int value, char16 (&buffer)[N], int radix) { argument
440 return _itow_s(value, buffer, N, radix);
/external/clang/include/clang/Lex/
H A DLiteralSupport.h37 /// determines the radix of the value and can convert it to a useful value.
46 unsigned radix; member in class:clang::NumericLiteralParser
71 unsigned getRadix() const { return radix; }
/external/dropbear/libtomcrypt/src/math/
H A Dgmp_desc.c142 static int read_radix(void *a, const char *b, int radix) argument
146 mpz_set_str(a, b, radix);
151 static int write_radix(void *a, char *b, int radix) argument
155 mpz_get_str(b, radix, a);
H A Dltm_desc.c168 static int read_radix(void *a, const char *b, int radix) argument
172 return mpi_to_ltc_error(mp_read_radix(a, b, radix));
176 static int write_radix(void *a, char *b, int radix) argument
180 return mpi_to_ltc_error(mp_toradix(a, b, radix));
/external/icu4c/io/
H A Dufmt_cmn.c52 int32_t radix)
56 return (UBool)(digitVal < radix && digitVal >= 0);
66 uint8_t radix,
75 digit = (uint32_t)(value % radix);
76 value = value / radix;
134 int8_t radix)
147 while(ufmt_isdigit(*buffer, radix) && buffer < limit) {
150 result *= radix;
51 ufmt_isdigit(UChar c, int32_t radix) argument
63 ufmt_64tou(UChar *buffer, int32_t *len, uint64_t value, uint8_t radix, UBool uselower, int32_t minDigits) argument
132 ufmt_uto64(const UChar *buffer, int32_t *len, int8_t radix) argument
/external/opencv/cxcore/src/
H A Dcxdxt.cpp223 int digits[34], radix[34]; local
258 // radix[] is initialized from index 'nf' down to zero
260 radix[nf] = 1;
265 radix[nf-i-1] = radix[nf-i]*factors[nf-i-1];
273 int a = radix[1], na2 = n*a>>1, na4 = na2 >> 1;
311 for( i = n, j = radix[2]; i < n0; )
317 j += radix[2];
321 j += radix[k+2] - radix[
[all...]

Completed in 6191 milliseconds

12