- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 3,440 for greatest (0.29 sec)
-
android/guava-tests/test/com/google/common/primitives/DoublesTest.java
new double[] {LEAST, (double) 1}, new double[] {(double) 1}, new double[] {(double) 1, LEAST}, new double[] {GREATEST, Double.MAX_VALUE}, new double[] {GREATEST, GREATEST}, new double[] {GREATEST, GREATEST, GREATEST}); Comparator<double[]> comparator = Doubles.lexicographicalComparator(); Helpers.testComparator(comparator, ordered); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 29 15:43:06 UTC 2024 - 31.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* #removeLast} are also provided, to act on the <i>greatest</i> element in the queue instead. * * <p>A min-max priority queue can be configured with a maximum size. If so, each time the size of * the queue exceeds that value, the queue automatically removes its greatest element according to * its comparator (which might be the element that was just added). This is different from
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 39.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/TopKSelectorTest.java
} try { TopKSelector.<String>greatest(-1); fail(); } catch (IllegalArgumentException expected) { } try { TopKSelector.least(-1, Ordering.natural()); fail(); } catch (IllegalArgumentException expected) { } try { TopKSelector.greatest(-1, Ordering.natural()); fail(); } catch (IllegalArgumentException expected) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Mar 07 18:34:03 UTC 2024 - 3.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* #removeLast} are also provided, to act on the <i>greatest</i> element in the queue instead. * * <p>A min-max priority queue can be configured with a maximum size. If so, each time the size of * the queue exceeds that value, the queue automatically removes its greatest element according to * its comparator (which might be the element that was just added). This is different from
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (0) -
src/cmd/go/testdata/script/cover_swig.txt
[!cgo] skip go test -v -count=1 -coverprofile=foo.p stdout 'coverage: 100.0% of statements' -- go.mod -- module simple go 1.21 -- main.c -- /* A global variable */ double Foo = 3.0; /* Compute the greatest common divisor of positive integers */ int gcd(int x, int y) { int g; g = y; while (x > 0) { g = x; x = y % x; y = g; } return g; } -- main.go -- package main
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 05 21:29:51 UTC 2024 - 1.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
/** * Returns a {@code Collector} that returns the {@code k} greatest (relative to the specified * {@code Comparator}) input elements, in descending order, as an unmodifiable {@code List}. Ties * are broken arbitrarily. * * <p>For example: * * <pre>{@code * Stream.of("foo", "quux", "banana", "elephant") * .collect(greatest(2, comparingInt(String::length))) * // returns {"elephant", "banana"}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 10.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/Comparators.java
/** * Returns a {@code Collector} that returns the {@code k} greatest (relative to the specified * {@code Comparator}) input elements, in descending order, as an unmodifiable {@code List}. Ties * are broken arbitrarily. * * <p>For example: * * <pre>{@code * Stream.of("foo", "quux", "banana", "elephant") * .collect(greatest(2, comparingInt(String::length))) * // returns {"elephant", "banana"}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Apr 11 08:42:51 UTC 2024 - 10.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/DiscreteDomain.java
/** * Returns the unique greatest value of type {@code C} that is less than {@code value}, or {@code * null} if none exists. Inverse operation to {@link #next}. * * @param value any value of type {@code C} * @return the greatest value less than {@code value}, or {@code null} if {@code value} is {@code * minValue()} */ @CheckForNull public abstract C previous(C value); /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
} }); // To start, fill up the cache. // Each miss both increments the counter and causes the map to grow by one, // so until evictions begin, the size of the map is the greatest return // value seen so far while (cache.getUnchecked(nextRandomKey()) < maximumSize) {} requests.set(0); misses.set(0); } @Benchmark int time(int reps) { int dummy = 0;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 3.4K bytes - Viewed (0)