Searched refs:candidate (Results 1 - 8 of 8) sorted by relevance

/libcore/luni/src/main/java/java/math/
H A DNativeBN.java127 public static native boolean BN_primality_test(long candidate, int checks, argument
129 // int BN_primality_test(int *is_probably_prime, const BIGNUM *candidate, int checks,
H A DBigInteger.java169 int candidate;
171 candidate = random.nextInt() & ((1 << bitLength) - 1);
172 candidate |= (1 << (bitLength - 1)); // Set top bit.
174 candidate |= 1; // Any prime longer than 2 bits must have the bottom bit set.
176 } while (!isSmallPrime(candidate));
178 prime.putULongInt(candidate, false);
/libcore/ojluni/src/main/java/java/lang/
H A DRuntime.java1025 String candidate = directory + filename;
1026 candidates.add(candidate);
1028 if (IoUtils.canOpenReadOnly(candidate)) {
1029 String error = doLoad(candidate, loader);
/libcore/ojluni/src/main/java/java/util/
H A DCollections.java638 T candidate = i.next();
642 if (next.compareTo(candidate) < 0)
643 candidate = next;
645 return candidate;
677 T candidate = i.next();
681 if (comp.compare(next, candidate) < 0)
682 candidate = next;
684 return candidate;
711 T candidate = i.next();
715 if (next.compareTo(candidate) >
[all...]
H A DLinkedHashMap.java684 Node<K,V> candidate = getNode(hash(key), key);
685 return candidate != null && candidate.equals(e);
H A DWeakHashMap.java978 Entry<K,V> candidate = getEntry(e.getKey());
979 return candidate != null && candidate.equals(e);
H A DHashMap.java1022 Node<K,V> candidate = getNode(hash(key), key);
1023 return candidate != null && candidate.equals(e);
/libcore/luni/src/main/native/
H A Djava_math_NativeBN.cpp514 static jboolean NativeBN_BN_primality_test(JNIEnv* env, jclass, jlong candidate, int checks, argument
516 if (!oneValidHandle(env, candidate)) return JNI_FALSE;
519 if (!BN_primality_test(&is_probably_prime, toBigNum(candidate), checks, ctx.get(),

Completed in 225 milliseconds