Searched defs:bits (Results 1 - 14 of 14) sorted by relevance

/libcore/luni/src/main/native/
H A Djava_lang_Double.cpp28 uint64_t bits; member in union:Double
35 return d.bits;
40 d.bits = val;
H A Djava_lang_Float.cpp28 unsigned int bits; member in union:Float
35 return f.bits;
40 f.bits = val;
H A Djava_math_NativeBN.cpp546 static void NativeBN_BN_generate_prime_ex(JNIEnv* env, jclass, jlong ret, int bits, argument
549 BN_generate_prime_ex(toBigNum(ret), bits, safe, toBigNum(add), toBigNum(rem),
/libcore/luni/src/main/java/java/util/
H A DRandom.java87 * the number of bits specified by the argument {@code bits} as
96 protected synchronized int next(int bits) { argument
98 return (int) (seed >>> (48 - bits));
187 int bits, val;
189 bits = next(31);
190 val = bits % n;
191 } while (bits - val + (n - 1) < 0);
H A DHugeEnumSet.java30 private long[] bits; field in class:HugeEnumSet
44 bits = new long[(enums.length + BIT_IN_LONG - 1) / BIT_IN_LONG];
50 * The bits yet to be returned for the long in bits[index]. As values from the current index
51 * are returned, their bits are zeroed out. When this reaches zero, the index must be
54 private long currentBits = bits[0];
57 * The index into HugeEnumSet.bits of the next value to return.
83 } else if (++index < bits.length) {
84 currentBits = bits[index];
126 long oldBits = bits[inde
[all...]
H A DMiniEnumSet.java31 private long bits; field in class:MiniEnumSet
48 * The bits yet to be returned for bits. As values from the current index are returned,
49 * their bits are zeroed out.
51 private long currentBits = bits;
103 bits = 0;
110 long oldBits = bits;
113 bits = newBits;
130 long oldBits = bits;
131 long newBits = oldBits | miniSet.bits;
[all...]
H A DBitSet.java40 * The bits. Access bit n thus:
42 * boolean bit = (bits[n / 64] | (1 << n)) != 0;
49 private long[] bits; field in class:BitSet
52 * The number of elements of 'bits' that are actually in use (non-zero). Amongst other
58 * Updates 'longCount' by inspecting 'bits'. Assumes that the new longCount is <= the current
67 while (i >= 0 && bits[i] == 0) {
74 * Creates a new {@code BitSet} with size equal to 64 bits.
90 this.bits = arrayForBits(bitCount);
94 private BitSet(long[] bits) { argument
95 this.bits
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DRandomTest.java259 protected int next(int bits) { argument
261 return super.next(bits);
/libcore/luni/src/main/java/java/util/concurrent/
H A DThreadLocalRandom.java99 protected int next(int bits) { argument
101 return (int) (rnd >>> (48-bits));
139 int bits = next(2);
141 long nextn = ((bits & 2) == 0) ? half : n - half;
142 if ((bits & 1) == 0)
/libcore/luni/src/main/java/java/lang/
H A DDouble.java108 * Constant for the number of bits needed to represent a {@code double} in
169 * Returns an integer corresponding to the bits of the given
183 * Returns an integer corresponding to the bits of the given
282 * double precision float corresponding to the given {@code bits}.
284 public static native double longBitsToDouble(long bits); argument
424 // mask exponent bits and shift down
426 // mask significand bits and shift up
442 // significand is 52-bits, so there can be 13 hex digits
464 // significand is 52-bits, so there can be 13 hex digits
H A DFloat.java105 * Constant for the number of bits needed to represent a {@code float} in
197 * Returns an integer corresponding to the bits of the given
211 * Returns an integer corresponding to the bits of the given
235 * single precision float corresponding to the given {@code bits}.
237 public static native float intBitsToFloat(int bits); argument
431 // mask exponent bits and shift down
433 // mask significand bits and shift up
434 // significand is 23-bits, so we shift to treat it like 24-bits
450 // significand is 23-bits, s
[all...]
H A DMath.java1033 int bits = Float.floatToRawIntBits(f);
1034 bits = (bits & Float.EXPONENT_MASK) >> Float.MANTISSA_BITS;
1035 return bits - Float.EXPONENT_BIAS;
1043 long bits = Double.doubleToRawLongBits(d);
1044 bits = (bits & Double.EXPONENT_MASK) >> Double.MANTISSA_BITS;
1045 return (int) bits - Double.EXPONENT_BIAS;
1152 long bits = Double.doubleToLongBits(d);
1154 long sign = bits
1251 shiftIntBits(int bits, int digits) argument
1277 shiftLongBits(long bits, long digits) argument
[all...]
H A DStrictMath.java1016 long bits = Double.doubleToLongBits(d);
1018 long sign = bits & Double.SIGN_MASK;
1020 long factor = (int) ((bits & Double.EXPONENT_MASK) >> Double.MANTISSA_BITS)
1024 int subNormalFactor = Long.numberOfLeadingZeros(bits & ~Double.SIGN_MASK)
1044 result = shiftLongBits(bits & Double.MANTISSA_MASK, digits);
1047 result = shiftLongBits(bits & Double.MANTISSA_MASK | 0x0010000000000000L, digits - 1);
1053 | (bits & Double.MANTISSA_MASK);
1057 | ((bits << (subNormalFactor + 1)) & Double.MANTISSA_MASK);
1071 int bits = Float.floatToIntBits(d);
1072 int sign = bits
1117 shiftIntBits(int bits, int digits) argument
1136 shiftLongBits(long bits, long digits) argument
[all...]
/libcore/luni/src/main/java/java/math/
H A DNativeBN.java122 public static native void BN_generate_prime_ex(long ret, int bits, boolean safe, argument
124 // int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe,

Completed in 176 milliseconds