HomeSort by relevance Sort by last modified time
    Searched full:radix (Results 26 - 50 of 372) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/icu4c/common/
util_props.cpp 29 int8_t radix = 10; local
34 radix = 16;
39 radix = 8;
44 int32_t d = u_digit(rule.charAt(p++), radix);
50 int32_t v = (value * radix) + d;
177 * @param radix the radix in which to parse; must be >= 2 and <=
185 int32_t& pos, int8_t radix) {
187 // assert(radix >= 2);
188 // assert(radix <= 36)
    [all...]
  /external/dropbear/libtommath/mtest/
mpi-types.h 15 #define RADIX (MP_DIGIT_MAX+1)
  /libcore/luni/src/main/java/java/lang/
Byte.java 200 * radix. The ASCII character \u002d ('-') is recognized as the minus sign.
204 * @param radix
205 * the radix to use when parsing.
207 * {@code radix}.
210 * {@code radix < Character.MIN_RADIX ||
211 * radix > Character.MAX_RADIX}.
213 public static byte parseByte(String string, int radix) throws NumberFormatException {
214 int intValue = Integer.parseInt(string, radix);
269 * radix.
273 * @param radix
    [all...]
Integer.java 337 * radix. The ASCII character \u002d ('-') is recognized as the minus sign.
341 * @param radix
342 * the radix to use when parsing.
344 * {@code radix}.
347 * or {@code radix < Character.MIN_RADIX ||
348 * radix > Character.MAX_RADIX}.
350 public static int parseInt(String string, int radix) throws NumberFormatException {
351 if (radix < Character.MIN_RADIX || radix > Character.MAX_RADIX) {
352 throw new NumberFormatException("Invalid radix: " + radix)
    [all...]
Long.java 324 * radix. The ASCII character \u002d ('-') is recognized as the minus sign.
328 * @param radix
329 * the radix to use when parsing.
331 * {@code radix}.
334 * {@code radix < Character.MIN_RADIX ||
335 * radix > Character.MAX_RADIX}.
337 public static long parseLong(String string, int radix) throws NumberFormatException {
338 if (radix < Character.MIN_RADIX || radix > Character.MAX_RADIX) {
339 throw new NumberFormatException("Invalid radix: " + radix)
    [all...]
  /libcore/luni/src/main/java/java/util/
Scanner.java 93 // Default radix.
628 * {@code BigInteger} in the default radix.
641 * {@code BigInteger} in the specified radix.
643 * @param radix
644 * the radix used to translate the token into a
651 public boolean hasNextBigInteger(int radix) {
652 Pattern integerPattern = getIntegerPattern(radix);
658 cacheHasNextValue = new BigInteger(intString, radix);
682 * {@code byte} value in the default radix.
695 * {@code byte} value in the specified radix
1553 public int radix() { method in class:Scanner
    [all...]
  /external/srec/srec/include/
sp_fft.h 30 // DESCRIPTION: Split-Radix FFT
44 >>>>> Floating and Fixed Point plit-Radix FFT -- The Fastest FFT <<<<<<<<
46 The split-radix FFT improves the efficiency of the FFT implementation
47 by mixing a radix-2 and a radix-4 FFT algorithms. Specifically,
48 the radix-2 decomposes one Fourier transform into two half-sized Fourier
51 power-of-two FFT, The radix-4 decomposes one Fourier transform into
53 efficient than the radix-2 FFT, but it requires a power-of-four as the data length.
54 By combining the radix-2 and the radix-4 algorithms, one not onl
    [all...]
  /external/guava/guava-tests/test/com/google/common/primitives/
UnsignedIntegerTest.java 73 for (int radix = Character.MIN_RADIX; radix <= Character.MAX_RADIX; radix++) {
76 assertEquals(value.bigIntegerValue().toString(radix), value.toString(radix));
83 for (int radix : radices) {
86 assertEquals(value.bigIntegerValue().toString(radix), value.toString(radix));
UnsignedLongTest.java 76 for (int radix = Character.MIN_RADIX; radix <= Character.MAX_RADIX; radix++) {
79 assertEquals(value.bigIntegerValue().toString(radix), value.toString(radix));
86 for (int radix : radices) {
89 assertEquals(value.bigIntegerValue().toString(radix), value.toString(radix));
  /external/icu4c/io/
ufmt_cmn.c 52 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;
  /external/llvm/test/CodeGen/X86/
2007-11-30-LoadFolding-Bug.ll 7 define fastcc void @mp_sqrt(i32 %n, i32 %radix, i32* %in, i32* %out, i32* %tmp1, i32* %tmp2, i32 %nfft, double* %tmp1fft, double* %tmp2fft, i32* %ip, double* %w) nounwind {
42 %tmp4.i19.i = icmp slt i32 %tmp1.i18.i, %radix ; <i1> [#uses=1]
63 tail call fastcc void @mp_mul_d2i( i32 0, i32 %radix, i32 0, double* %tmp1fft, i32* %tmp2 )
70 tail call fastcc void @mp_round( i32 0, i32 %radix, i32 0, i32* %out )
71 tail call fastcc void @mp_add( i32 0, i32 %radix, i32* %tmp1, i32* %tmp2, i32* %tmp1 )
72 tail call fastcc void @mp_sub( i32 0, i32 %radix, i32* %in, i32* %tmp2, i32* %tmp2 )
73 tail call fastcc void @mp_round( i32 0, i32 %radix, i32 0, i32* %tmp1 )
74 tail call fastcc void @mp_mul_d2i( i32 0, i32 %radix, i32 %tmp7.i3, double* %tmp2fft, i32* %tmp2 )
  /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_2/Exceptions/
number-001.js 6 If the radix is the number 10 or not supplied, then this number value is
10 If the radix is supplied and is an integer from 2 to 36, but not 10, the
  /external/webkit/Source/JavaScriptCore/runtime/
NumberPrototype.cpp 211 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/icu4c/i18n/
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,
numsys.cpp 39 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;
  /external/guava/guava/src/com/google/common/primitives/
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) {
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) {
240 return UnsignedLongs.toString(value, radix);
    [all...]
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) {
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 to use while working with {@code x
    [all...]
UnsignedInteger.java 97 * as an unsigned {@code int} value in the specified radix.
102 public static UnsignedInteger valueOf(String string, int radix) {
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) {
234 return UnsignedInts.toString(value, radix);
  /external/srec/portable/src/
LCHAR.c 250 * @param radix Base of value; must be in the range 2 - 36
252 static void pxtoa(unsigned long val, LCHAR *buf, unsigned radix, int is_neg)
272 digval = (unsigned)(val % radix);
273 val /= radix; /* get next digit */
302 ESR_ReturnCode litostr(int value, LCHAR *string, size_t *len, int radix)
311 if (radix == 10 && value < 0)
312 pxtoa((unsigned long) value, buffer, radix, 1);
314 pxtoa((unsigned long) value, buffer, radix, 0);
331 ESR_ReturnCode lultostr(unsigned long value, LCHAR *string, size_t *len, int radix)
339 pxtoa(value, buffer, radix, 0)
    [all...]
  /external/elfutils/src/
size.c 72 { "radix", OPT_RADIX, "RADIX", 0, N_("Use RADIX for printing symbol values"),
74 { NULL, 'd', NULL, 0, N_("Same as `--radix=10'"), 0 },
75 { NULL, 'o', NULL, 0, N_("Same as `--radix=8'"), 0 },
76 { NULL, 'x', NULL, 0, N_("Same as `--radix=16'"), 0 },
132 /* Radix for printed numbers. */
138 } radix; variable in typeref:enum:__anon6358
141 /* Mapping of radix and binary class to length. */
236 radix = radix_decimal
    [all...]
  /external/icu4c/i18n/unicode/
numsys.h 93 * 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/v8/src/
conversions-inl.h 133 // Parsing integers with radix 2, 4, 8, 16, 32. Assumes current != end.
150 const int radix = (1 << radix_log_2); local
154 if (*current >= '0' && *current <= '9' && *current < '0' + radix) {
156 } else if (radix > 10 && *current >= 'a' && *current < 'a' + radix - 10) {
158 } else if (radix > 10 && *current >= 'A' && *current < 'A' + radix - 10) {
169 number = number * radix + digit;
188 if (current == end || !isDigit(*current, radix)) break;
241 int radix) {
    [all...]
conversions.h 48 inline bool isDigit(int x, int radix) {
49 return (x >= '0' && x <= '9' && x < '0' + radix)
50 || (radix > 10 && x >= 'a' && x < 'a' + radix - 10)
51 || (radix > 10 && x >= 'A' && x < 'A' + radix - 10);
144 char* DoubleToRadixCString(double value, int radix);
  /external/apache-harmony/math/src/test/java/org/apache/harmony/tests/java/math/
BigIntegerConstructorsTest.java 30 * BigInteger(String val, int radix)
571 * Create a number from a string value and radix.
572 * Verify an exception thrown if a radix is out of range
576 int radix = 45; local
578 new BigInteger(value, radix);
585 * Create a number from a string value and radix.
590 int radix = 10; local
592 new BigInteger(value, radix);
599 * Create a number from a string value and radix.
604 int radix = 34 local
618 int radix = 20; local
631 int radix = 2; local
647 int radix = 8; local
663 int radix = 10; local
679 int radix = 16; local
695 int radix = 36; local
711 int radix = 36; local
727 int radix = 10; local
    [all...]
  /external/icu4c/tools/genrb/
rbutil.c 66 itostr(char * buffer, int32_t i, uint32_t radix, int32_t pad)
82 digit = (int)(i % radix);
84 i=i/radix;

Completed in 690 milliseconds

12 3 4 5 6 7 8 91011>>