- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for rank (0.45 sec)
-
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) -
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 May 03 12:43:13 GMT 2024 - Last Modified: Sun Jun 20 14:22:42 GMT 2021 - 2K 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 May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
guava-testlib/test/com/google/common/testing/TearDownStackTest.java
} }; final SimpleTearDown tearDownTwo = new SimpleTearDown(callback); stack.addTearDown(tearDownTwo); assertEquals(false, tearDownOne.ran); assertEquals(false, tearDownTwo.ran); stack.runTearDown(); assertEquals("tearDownOne should have run", true, tearDownOne.ran);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 17 15:19:38 GMT 2023 - 4.6K bytes - Viewed (0) -
android/guava-testlib/test/com/google/common/testing/TearDownStackTest.java
} }; final SimpleTearDown tearDownTwo = new SimpleTearDown(callback); stack.addTearDown(tearDownTwo); assertEquals(false, tearDownOne.ran); assertEquals(false, tearDownTwo.ran); stack.runTearDown(); assertEquals("tearDownOne should have run", true, tearDownOne.ran);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 17 15:19:38 GMT 2023 - 4.6K bytes - Viewed (0) -
android/guava/src/com/google/common/io/ReaderInputStream.java
// If encoder underflows, it means either: // a) the final flush() succeeded; next drain (then done) // b) we encoded all of the input; next flush // c) we ran of out input to encode; next read more input if (doneEncoding) { // (a) doneFlushing = true; startDraining(false); continue DRAINING; } else if (endOfInput) { // (b)
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 28 20:13:02 GMT 2023 - 9.3K bytes - Viewed (0)