Home
last modified time | relevance | path

Searched refs:candidate (Results 1 – 7 of 7) sorted by relevance

/libcore/luni/src/main/java/java/math/
DBigInteger.java171 int candidate; in BigInteger() local
173 candidate = random.nextInt() & ((1 << bitLength) - 1); in BigInteger()
174 candidate |= (1 << (bitLength - 1)); // Set top bit. in BigInteger()
176 candidate |= 1; // Any prime longer than 2 bits must have the bottom bit set. in BigInteger()
178 } while (!isSmallPrime(candidate)); in BigInteger()
180 prime.putULongInt(candidate, false); in BigInteger()
DNativeBN.java127 public static native boolean BN_primality_test(long candidate, int checks, in BN_primality_test() argument
/libcore/luni/src/main/java/libcore/timezone/
DCountryTimeZones.java346 for (TimeZone candidate : candidates) { in isDefaultOkForCountryTimeZoneDetection()
347 if (candidate == countryDefault) { in isDefaultOkForCountryTimeZoneDetection()
351 int candidateOffset = candidate.getOffset(whenMillis); in isDefaultOkForCountryTimeZoneDetection()
/libcore/ojluni/src/main/java/java/util/
DLinkedHashMap.java684 Node<K,V> candidate = getNode(hash(key), key); in contains() local
685 return candidate != null && candidate.equals(e); in contains()
DWeakHashMap.java978 Entry<K,V> candidate = getEntry(e.getKey()); in contains() local
979 return candidate != null && candidate.equals(e); in contains()
DHashMap.java1022 Node<K,V> candidate = getNode(hash(key), key); in contains() local
1023 return candidate != null && candidate.equals(e); in contains()
/libcore/luni/src/main/native/
Djava_math_NativeBN.cpp516 static jboolean NativeBN_BN_primality_test(JNIEnv* env, jclass, jlong candidate, int checks, in NativeBN_BN_primality_test() argument
518 if (!oneValidHandle(env, candidate)) return JNI_FALSE; in NativeBN_BN_primality_test()
521 if (!BN_primality_test(&is_probably_prime, toBigNum(candidate), checks, ctx.get(), in NativeBN_BN_primality_test()