Searched defs:bits (Results 1 - 9 of 9) sorted by relevance
/libcore/ojluni/src/main/java/sun/security/util/ |
H A D | BitArray.java | 49 private static int position(int idx) { // bits big-endian in each unit 93 2. zero out extra bits in the last byte 103 * Create a BitArray whose bits are those of the given array 106 public BitArray(boolean[] bits) { argument 107 length = bits.length; 111 set(i, bits[i]); 165 * will be contain zeros in any bits that do not have corresponding 166 * bits in the BitArray. (This matters only if the BitArray's size 191 boolean[] bits = new boolean[length]; 194 bits[ [all...] |
H A D | DerOutputStream.java | 235 * @param bits the bit string, MSB first 237 public void putBitString(byte[] bits) throws IOException { argument 239 putLength(bits.length + 1); 241 write(bits); 248 * @param bits the bit string, MSB first 251 byte[] bits = ba.toByteArray(); 254 putLength(bits.length + 1); 255 write(bits.length*8 - ba.length()); // excess bits in last octet 256 write(bits); [all...] |
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | RandomTest.java | 272 protected int next(int bits) { argument 274 return super.next(bits);
|
/libcore/luni/src/main/java/java/math/ |
H A D | NativeBN.java | 122 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,
|
/libcore/ojluni/src/main/java/java/lang/ |
H A D | Double.java | 119 * The number of bits used to represent a {@code double} value. 306 // Isolate significand bits and OR in a high-order bit 759 long bits = doubleToLongBits(value); 760 return (int)(bits ^ (bits >>> 32)); 816 * 62-52 (the bits that are selected by the mask 818 * (the bits that are selected by the mask 838 * @return the bits that represent the floating-point number. 859 * 62-52 (the bits that are selected by the mask 861 * (the bits tha 950 longBitsToDouble(long bits) argument [all...] |
H A D | Float.java | 118 * The number of bits used to represent a {@code float} value. 722 * Bits 30-23 (the bits that are selected by the mask 724 * Bits 22-0 (the bits that are selected by the mask 743 * @return the bits that represent the floating-point number. 764 * Bits 30-23 (the bits that are selected by the mask 766 * Bits 22-0 (the bits that are selected by the mask 788 * @return the bits that represent the floating-point number. 819 * int s = ((bits >> 31) == 0) ? 1 : -1; 820 * int e = ((bits >> 23) & 0xff); 822 * (bits 852 intBitsToFloat(int bits) argument [all...] |
/libcore/ojluni/src/main/java/java/util/ |
H A D | Random.java | 57 * up to 32 pseudorandomly generated bits. 162 * happens to use only 48 bits of the given seed. In general, however, 163 * an overriding method may use all 64 bits of the {@code long} 178 * {@code int} value and if the argument {@code bits} is between 180 * bits of the returned value will be (approximately) independently 186 * <pre>{@code (int)(seed >>> (48 - bits))}.</pre> 193 * @param bits random bits 198 protected int next(int bits) { argument 205 return (int)(nextseed >>> (48 - bits)); [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ThreadLocalRandom.java | 168 protected int next(int bits) { argument 169 return (int)(mix64(nextSeed()) >>> (64 - bits));
|
/libcore/luni/src/main/native/ |
H A D | java_math_NativeBN.cpp | 566 static void NativeBN_BN_generate_prime_ex(JNIEnv* env, jclass, jlong ret, int bits, argument 569 BN_generate_prime_ex(toBigNum(ret), bits, safe, toBigNum(add), toBigNum(rem),
|
Completed in 371 milliseconds