- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for Frank (0.16 sec)
-
android/guava/src/com/google/common/collect/ExplicitOrdering.java
this.rankMap = rankMap; } @Override public int compare(T left, T right) { return rank(left) - rank(right); // safe because both are nonnegative } private int rank(T value) { Integer rank = rankMap.get(value); if (rank == null) { throw new IncomparableValueException(value); } return rank; } @Override public boolean equals(@CheckForNull Object object) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sun Jun 20 14:22:42 GMT 2021 - 2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
} /** Equivalent to {@code newReentrantReadWriteLock(rank, false)}. */ public ReentrantReadWriteLock newReentrantReadWriteLock(E rank) { return newReentrantReadWriteLock(rank, false); } /** * Creates a {@link ReentrantReadWriteLock} with the given fairness policy and rank. The values
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
abstract Map<Integer, Double> multipleQuantiles( Collection<Integer> indexes, int scale, double[] dataset); 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]) {
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
abstract Map<Integer, Double> multipleQuantiles( Collection<Integer> indexes, int scale, double[] dataset); 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]) {
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) -
guava/src/com/google/common/collect/ExplicitOrdering.java
this.rankMap = rankMap; } @Override public int compare(T left, T right) { return rank(left) - rank(right); // safe because both are nonnegative } private int rank(T value) { Integer rank = rankMap.get(value); if (rank == null) { throw new IncomparableValueException(value); } return rank; } @Override public boolean equals(@CheckForNull Object object) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Sun Jun 20 14:22:42 GMT 2021 - 2K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/OrderingTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/OrderingTest.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0)