Searched refs:candidate (Results 1 – 6 of 6) sorted by relevance
| /libcore/ojluni/src/main/java/java/math/ |
| D | BitSieve.java | 201 BigInteger candidate = initValue.add( in retrieve() local
203 if (candidate.primeToCertainty(certainty, random)) in retrieve()
204 return candidate; in retrieve()
|
| D | BigInteger.java | 765 BigInteger candidate = searchSieve.retrieve(p, certainty, rnd); in largePrime() local
767 while ((candidate == null) || (candidate.bitLength() != bitLength)) { in largePrime()
773 candidate = searchSieve.retrieve(p, certainty, rnd); in largePrime()
775 return candidate; in largePrime()
840 BigInteger candidate = searchSieve.retrieve(result, in nextProbablePrime() local
842 if (candidate != null) in nextProbablePrime()
843 return candidate; in nextProbablePrime()
|
| /libcore/ojluni/src/main/java/java/util/ |
| D | Collections.java | 643 T candidate = i.next(); in min() local
647 if (next.compareTo(candidate) < 0) in min()
648 candidate = next; in min()
650 return candidate; in min()
682 T candidate = i.next(); in min() local
686 if (comp.compare(next, candidate) < 0) in min()
687 candidate = next; in min()
689 return candidate; in min()
716 T candidate = i.next(); in max() local
720 if (next.compareTo(candidate) > 0) in max()
[all …]
|
| D | LinkedHashMap.java | 687 Node<K,V> candidate = getNode(hash(key), key); in contains() local
688 return candidate != null && candidate.equals(e); in contains()
|
| D | WeakHashMap.java | 978 Entry<K,V> candidate = getEntry(e.getKey()); in contains() local
979 return candidate != null && candidate.equals(e); in contains()
|
| D | HashMap.java | 1022 Node<K,V> candidate = getNode(hash(key), key); in contains() local
1023 return candidate != null && candidate.equals(e); in contains()
|