- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 69 for Search (0.17 sec)
-
android/guava/src/com/google/common/collect/SortedLists.java
@ParametricNullness E key, List<? extends E> list, int foundIndex) { // Of course, we have to use binary search to find the precise // breakpoint... int lower = 0; int upper = foundIndex; // Of course, we have to use binary search to find the precise breakpoint... // Everything between lower and upper inclusive compares at <= 0. while (lower < upper) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
static double getMinValue(double[] array, int from) { // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the // method signature: we always search to the end of the array. int min = from; for (int i = from + 1; i < array.length; i++) { if (array[min] > array[i]) { min = i; } } return array[min]; }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
static double getMinValue(double[] array, int from) { // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the // method signature: we always search to the end of the array. int min = from; for (int i = from + 1; i < array.length; i++) { if (array[min] > array[i]) { min = i; } } return array[min]; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableSortedSet.java
} catch (ClassCastException e) { return false; } } @Override public boolean containsAll(Collection<?> targets) { // TODO(jlevy): For optimal performance, use a binary search when // targets.size() < size() / log(size()) // TODO(kevinb): see if we can share code with OrderedIterator after it // graduates from labs. if (targets instanceof Multiset) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 9K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of * colliding threads. Because search is random, and collisions * only become known via CAS failures, convergence can be slow,
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Table.java
* * @param rowKey key of row to search for * @param columnKey key of column to search for */ boolean contains( @CompatibleWith("R") @CheckForNull Object rowKey, @CompatibleWith("C") @CheckForNull Object columnKey); /** * Returns {@code true} if the table contains a mapping with the specified row key. * * @param rowKey key of row to search for */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 10.7K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of * colliding threads. Because search is random, and collisions * only become known via CAS failures, convergence can be slow,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
return new ScaleAndIndex(scale, index); } /** * Specifies multiple quantile indexes to be calculated, each index being the k in the kth * q-quantile. * * @param indexes the quantile indexes, each of which must be in the inclusive range [0, q] for * q-quantiles; the order of the indexes is unimportant, duplicates will be ignored, and the
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* * <pre>{@code * Iterables.limit(Traverser.forGraph(graph).breadthFirst(node), maxNumberOfNodes); * }</pre> * * <p>See <a href="https://en.wikipedia.org/wiki/Breadth-first_search">Wikipedia</a> for more * info. * * @throws IllegalArgumentException if {@code startNode} is not an element of the graph */ public final Iterable<N> breadthFirst(N startNode) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Bytes.java
* i, i + target.length)} contains exactly the same elements as {@code target}. * * @param array the array to search for the sequence {@code target} * @param target the array to search for as a sub-sequence of {@code array} */ public static int indexOf(byte[] array, byte[] target) { checkNotNull(array, "array"); checkNotNull(target, "target");
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 14.9K bytes - Viewed (0)