/external/chromium_org/third_party/icu/source/i18n/unicode/ |
H A D | numsys.h | 47 * positional numbering system with a specified radix (typically 10). 95 * Create a numbering system using the specified radix, type, and description. 96 * @param radix The radix (base) for this numbering system. 103 static NumberingSystem* U_EXPORT2 createInstance(int32_t radix, UBool isAlgorithmic, const UnicodeString& description, UErrorCode& status ); 128 * Returns the radix of this numbering system. Simple positional numbering systems 129 * typically have radix 10, but might have a radix of e.g. 16 for hexadecimal. The 130 * radix is less well-defined for non-positional algorithmic systems. 145 * the radix), 183 int32_t radix; member in class:NumberingSystem [all...] |
/external/icu/icu4c/source/i18n/unicode/ |
H A D | numsys.h | 47 * positional numbering system with a specified radix (typically 10). 95 * Create a numbering system using the specified radix, type, and description. 96 * @param radix The radix (base) for this numbering system. 103 static NumberingSystem* U_EXPORT2 createInstance(int32_t radix, UBool isAlgorithmic, const UnicodeString& description, UErrorCode& status ); 128 * Returns the radix of this numbering system. Simple positional numbering systems 129 * typically have radix 10, but might have a radix of e.g. 16 for hexadecimal. The 130 * radix is less well-defined for non-positional algorithmic systems. 148 * the radix), 186 int32_t radix; member in class:NumberingSystem [all...] |
/external/chromium_org/third_party/icu/source/common/ |
H A D | ustrfmt.c | 13 * 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 D | util_props.cpp | 30 int8_t radix = 10; local 35 radix = 16; 40 radix = 8; 45 int32_t d = u_digit(rule.charAt(p++), radix); 51 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 D | cstring.c | 149 * Takes a int32_t and fills in a char* string with that number "radix"-based. 155 T_CString_integerToString(char* buffer, int32_t v, int32_t radix) argument 163 U_ASSERT(radix>=2 && radix<=16); 165 if(v<0 && radix == 10) { 174 digit = (uint8_t)(uval % radix); 176 uval = uval / radix; 188 * Takes a int64_t and fills in a char* string with that number "radix"-based. 193 T_CString_int64ToString(char* buffer, int64_t v, uint32_t radix) argument 201 U_ASSERT(radix> 225 T_CString_stringToInteger(const char *integerString, int32_t radix) argument [all...] |
H A D | util.cpp | 35 int32_t radix, int32_t minDigits) { 36 if (radix < 2 || radix > 36) { 37 // Bogus radix 48 while (nn >= radix) { 49 nn /= radix; 50 r *= radix; 61 r /= radix; 34 appendNumber(UnicodeString& result, int32_t n, int32_t radix, int32_t minDigits) argument
|
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | esctrn.h | 25 * 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 D | nfrule.h | 62 double getDivisor() const { return uprv_pow(radix, exponent); } 96 int32_t radix; member in class:NFRule
|
/external/guava/guava/src/com/google/common/primitives/ |
H A D | AndroidInteger.java | 41 static Integer tryParse(String string, int radix) { argument 43 checkArgument(radix >= Character.MIN_RADIX, 44 "Invalid radix %s, min radix is %s", radix, Character.MIN_RADIX); 45 checkArgument(radix <= Character.MAX_RADIX, 46 "Invalid radix %s, max radix is %s", radix, Character.MAX_RADIX); 55 return tryParse(string, i, radix, negativ 59 tryParse(String string, int offset, int radix, boolean negative) argument [all...] |
H A D | UnsignedInteger.java | 97 * as an unsigned {@code int} value in the specified radix. 102 public static UnsignedInteger valueOf(String string, int radix) { argument 103 return asUnsigned(UnsignedInts.parseUnsignedInt(string, radix)); 229 * Returns a string representation of the {@code UnsignedInteger} value, in base {@code radix}. 230 * If {@code radix < Character.MIN_RADIX} or {@code radix > Character.MAX_RADIX}, the radix 233 public String toString(int radix) { argument 234 return UnsignedInts.toString(value, radix);
|
H A D | UnsignedInts.java | 204 * Returns the unsigned {@code int} value represented by a string with the given radix. 207 * @param radix the radix to use while parsing {@code s}; must be between 210 * if supplied radix is invalid. 212 public static int parseUnsignedInt(String string, int radix) { argument 214 long result = Long.parseLong(string, radix); 216 throw new NumberFormatException("Input " + string + " in base " + radix 230 * Returns a string representation of {@code x} for the given radix, where {@code x} is treated 234 * @param radix the radix t 238 toString(int x, int radix) argument [all...] |
H A D | UnsignedLong.java | 94 * an unsigned {@code long} value in the specified radix. 97 * value, or {@code radix} is not between {@link Character#MIN_RADIX} and 100 public static UnsignedLong valueOf(String string, int radix) { argument 101 return asUnsigned(UnsignedLongs.parseUnsignedLong(string, radix)); 235 * Returns a string representation of the {@code UnsignedLong} value, in base {@code radix}. If 236 * {@code radix < Character.MIN_RADIX} or {@code radix > Character.MAX_RADIX}, the radix 239 public String toString(int radix) { argument 240 return UnsignedLongs.toString(value, radix); [all...] |
H A D | UnsignedLongs.java | 248 * Returns the unsigned {@code long} value represented by a string with the given radix. 251 * @param radix the radix to use while parsing {@code s} 253 * with the given radix, or if {@code radix} is not between {@link Character#MIN_RADIX} 256 public static long parseUnsignedLong(String s, int radix) { argument 261 if (radix < Character.MIN_RADIX || radix > Character.MAX_RADIX) { 262 throw new NumberFormatException("illegal radix:" + radix); 287 overflowInParse(long current, int digit, int radix) argument 319 toString(long x, int radix) argument [all...] |
/external/icu/icu4c/source/common/ |
H A D | ustrfmt.c | 13 * 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 D | util_props.cpp | 30 int8_t radix = 10; local 35 radix = 16; 40 radix = 8; 45 int32_t d = u_digit(rule.charAt(p++), radix); 51 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 D | cstring.c | 149 * Takes a int32_t and fills in a char* string with that number "radix"-based. 155 T_CString_integerToString(char* buffer, int32_t v, int32_t radix) argument 163 U_ASSERT(radix>=2 && radix<=16); 165 if(v<0 && radix == 10) { 174 digit = (uint8_t)(uval % radix); 176 uval = uval / radix; 188 * Takes a int64_t and fills in a char* string with that number "radix"-based. 193 T_CString_int64ToString(char* buffer, int64_t v, uint32_t radix) argument 201 U_ASSERT(radix> 225 T_CString_stringToInteger(const char *integerString, int32_t radix) argument [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | esctrn.h | 25 * 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 D | nfrule.h | 62 double getDivisor() const { return uprv_pow(radix, exponent); } 96 int32_t radix; member in class:NFRule
|
/external/chromium_org/third_party/icu/source/tools/genrb/ |
H A D | rbutil.c | 66 itostr(char * buffer, int32_t i, uint32_t radix, int32_t pad) argument 82 digit = (int)(i % radix); 84 i=i/radix;
|
/external/icu/icu4c/source/tools/genrb/ |
H A D | rbutil.c | 66 itostr(char * buffer, int32_t i, uint32_t radix, int32_t pad) argument 82 digit = (int)(i % radix); 84 i=i/radix;
|
/external/chromium_org/v8/src/ |
H A D | conversions-inl.h | 128 // Parsing integers with radix 2, 4, 8, 16, 32. Assumes current != end. 145 const int radix = (1 << radix_log_2); local 149 if (*current >= '0' && *current <= '9' && *current < '0' + radix) { 151 } else if (radix > 10 && *current >= 'a' && *current < 'a' + radix - 10) { 153 } else if (radix > 10 && *current >= 'A' && *current < 'A' + radix - 10) { 164 number = number * radix + digit; 183 if (current == end || !isDigit(*current, radix)) break; 234 int radix) { [all...] |
H A D | conversions.h | 30 inline bool isDigit(int x, int radix) { argument 31 return (x >= '0' && x <= '9' && x < '0' + radix) 32 || (radix > 10 && x >= 'a' && x < 'a' + radix - 10) 33 || (radix > 10 && x >= 'A' && x < 'A' + radix - 10); 128 int radix); 133 int radix); 151 char* DoubleToRadixCString(double value, int radix);
|
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/preprocs/nasm/ |
H A D | nasmlib.c | 23 long radix; local 53 radix = 16, r += 2; 55 radix = 16, r++; 57 radix = 16 , q--; 59 radix = 8 , q--; 61 radix = 2 , q--; 63 radix = 10; 76 /* Check for valid number of that radix */ 79 if (*p<'0' || (*p>'9' && *p<'A') || (digit = numvalue(*p)) >= radix) 90 switch (radix) { [all...] |
/external/eigen/unsupported/Eigen/src/Polynomials/ |
H A D | Companion.h | 24 T radix(){ return 2; } function in namespace:Eigen::internal 27 T radix2(){ return radix<T>()*radix<T>(); } 148 //To find the balancing coefficients, if the radix is 2, 153 rowB = rowNorm / radix<Scalar>(); 159 colB *= radix<Scalar>(); 163 rowB = rowNorm * radix<Scalar>(); 167 colB /= radix<Scalar>();
|
/external/fio/lib/ |
H A D | prio_tree.c | 8 * Based on the radix priority search tree proposed by Edward M. McCreight 20 * A clever mix of heap and radix trees forms a radix priority search tree (PST) 32 * is designed for storing intervals with unique radix indices, i.e., each 44 unsigned long *radix, unsigned long *heap) 46 *radix = node->start; 159 * Insert a prio_tree_node @node into a radix priority search tree @root. The 241 * Remove a prio_tree_node @node from a radix priority search tree @root. The 43 get_index(const struct prio_tree_node *node, unsigned long *radix, unsigned long *heap) argument
|