- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 37 for Pearce (0.17 sec)
-
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 Apr 26 12:43:10 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 Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
*/ private static void selectInPlace(int required, double[] array, int from, int to) { // If we are looking for the least element in the range, we can just do a linear search for it. // (We will hit this whenever we are doing quantile interpolation: our first selection finds // the lower value, our second one finds the upper value by looking for the next least element.)
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) -
guava/src/com/google/common/collect/HashBiMap.java
* * <p>Due to the property that values in a BiMap are unique, this will tend to execute in * faster-than-linear time. * * @param value the object to search for in the values of this BiMap * @return true if a mapping exists from a key to the specified value */ @Override public boolean containsValue(@CheckForNull Object value) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 24.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
* * <p>Due to the property that values in a BiMap are unique, this will tend to execute in * faster-than-linear time. * * @param value the object to search for in the values of this BiMap * @return true if a mapping exists from a key to the specified value */ @Override public boolean containsValue(@CheckForNull Object value) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
of the players to be executed for having missed their turns, and she did not like the look of things at all, as the game was in such confusion that she never knew whether it was her turn or not. So she went in search of her hedgehog. The hedgehog was engaged in a fight with another hedgehog, which seemed to Alice an excellent opportunity for croqueting one of them with the other: the only difficulty was, that her
Plain Text - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 29 21:35:03 GMT 2012 - 145.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Booleans.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(boolean[] array, boolean[] 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 - 19.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Shorts.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(short[] array, short[] 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 - 25.1K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Crc32cHashFunction.java
0x9c221d09, 0x6e2e10f7, 0x7dd67004, 0x8fda7dfa, }, }; // Value x picked so computeForWord(x) == ~0, found by exhaustive search. static final int INVERSE_COMPUTE_FOR_WORD_OF_ALL_1S = 0xeee3ddcd; static int computeForWord(int word) { return STRIDE_TABLE[3][word & 0xFF] ^ STRIDE_TABLE[2][(word >>> 8) & 0xFF]
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 20 18:43:59 GMT 2021 - 21.3K bytes - Viewed (0)