- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 154 for smallest (0.82 sec)
-
android/guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
allEntries.addAll(normalValues); SortedSet<E> set = delegate.create(allEntries.toArray()); return createSubSet(set, firstExclusive, lastExclusive); } /** Calls the smallest subSet overload that filters out the extreme values. */ SortedSet<E> createSubSet(SortedSet<E> set, E firstExclusive, E lastExclusive) { if (from == Bound.NO_BOUND && to == Bound.EXCLUSIVE) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 18.2K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/SortedMultisetTestSuiteBuilder.java
allEntries.addAll(normalValues); SortedMultiset<E> multiset = (SortedMultiset<E>) delegate.create(allEntries.toArray()); // call the smallest subMap overload that filters out the extreme // values if (from == Bound.INCLUSIVE) { multiset = multiset.tailMultiset(firstInclusive, BoundType.CLOSED);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 11.9K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/SortedMultisetTestSuiteBuilder.java
allEntries.addAll(normalValues); SortedMultiset<E> multiset = (SortedMultiset<E>) delegate.create(allEntries.toArray()); // call the smallest subMap overload that filters out the extreme // values if (from == Bound.INCLUSIVE) { multiset = multiset.tailMultiset(firstInclusive, BoundType.CLOSED);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 11.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/LongMathTest.java
// long overflows. } int k = LongMath.biggestBinomials.length; assertFalse(fitsInLong(BigIntegerMath.binomial(2 * k, k))); // 2 * k is the smallest value for which we don't replace k with (n-k). } @GwtIncompatible // TODO public void testConstantsBiggestSimpleBinomials() { for (int k = 0; k < LongMath.biggestSimpleBinomials.length; k++) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/LongMathTest.java
// long overflows. } int k = LongMath.biggestBinomials.length; assertFalse(fitsInLong(BigIntegerMath.binomial(2 * k, k))); // 2 * k is the smallest value for which we don't replace k with (n-k). } @GwtIncompatible // TODO public void testConstantsBiggestSimpleBinomials() { for (int k = 0; k < LongMath.biggestSimpleBinomials.length; k++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
cmd/erasure.go
func getStorageInfo(disks []StorageAPI, endpoints []Endpoint, metrics bool) StorageInfo { disksInfo := getDisksInfo(disks, endpoints, metrics) // Sort so that the first element is the smallest. sort.Slice(disksInfo, func(i, j int) bool { return disksInfo[i].TotalSpace < disksInfo[j].TotalSpace }) storageInfo := StorageInfo{ Disks: disksInfo, }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 26 06:32:14 GMT 2024 - 16K bytes - Viewed (1) -
guava/src/com/google/common/collect/Comparators.java
return false; } prev = next; } } return true; } /** * Returns a {@code Collector} that returns the {@code k} smallest (relative to the specified * {@code Comparator}) input elements, in ascending order, as an unmodifiable {@code List}. Ties * are broken arbitrarily. * * <p>For example: * * <pre>{@code
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 10.7K bytes - Viewed (0) -
android/guava/src/com/google/common/io/Closer.java
public static Closer create() { return new Closer(SUPPRESSOR); } @VisibleForTesting final Suppressor suppressor; // only need space for 2 elements in most cases, so try to use the smallest array possible private final Deque<Closeable> stack = new ArrayDeque<>(4); @CheckForNull private Throwable thrown; @VisibleForTesting Closer(Suppressor suppressor) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 06 15:15:46 GMT 2024 - 11.9K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/connection/RealCall.kt
* layer primitives: connections, requests, responses, and streams. * * This class supports [asynchronous canceling][cancel]. This is intended to have the smallest * blast radius possible. If an HTTP/2 stream is active, canceling will cancel that stream but not * the other streams sharing its connection. But if the TLS handshake is still in progress then
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Sat Apr 20 17:03:43 GMT 2024 - 17.9K bytes - Viewed (2) -
android/guava/src/com/google/common/collect/Comparators.java
return false; } prev = next; } } return true; } /** * Returns a {@code Collector} that returns the {@code k} smallest (relative to the specified * {@code Comparator}) input elements, in ascending order, as an unmodifiable {@code List}. Ties * are broken arbitrarily. * * <p>For example: * * <pre>{@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 10.2K bytes - Viewed (0)