- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 44 for Horsts (0.22 sec)
-
android/guava/src/com/google/common/collect/Comparators.java
* * @since 21.0 * @author Louis Wasserman */ @GwtCompatible @ElementTypesAreNonnullByDefault public final class Comparators { private Comparators() {} /** * Returns a new comparator which sorts iterables by comparing corresponding elements pairwise * until a nonzero result is found; imposes "dictionary order." If the end of one iterable is
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) -
guava-testlib/src/com/google/common/collect/testing/TestEnumSetGenerator.java
} return create(array); } protected abstract Set<AnEnum> create(AnEnum[] elements); @Override public AnEnum[] createArray(int length) { return new AnEnum[length]; } /** Sorts the enums according to their natural ordering. */ @Override public List<AnEnum> order(List<AnEnum> insertionOrder) { Collections.sort(insertionOrder); return insertionOrder; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 1.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
limiter.setRate(1.0); for (int i = 0; i < 5; i++) { limiter.acquire(); } assertEvents("R0.00", "R1.00", "R1.00", "R1.00", "R1.00"); } /** * Make sure that bursts can never go above 1-second-worth-of-work for the current rate, even when * we change the rate. */ public void testWeNeverGetABurstMoreThanOneSec() { RateLimiter limiter = RateLimiter.create(1.0, stopwatch);
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
* offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log * k). In benchmarks, this implementation performs at least as well as either implementation, and * degrades more gracefully for worst-case input. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 11.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/AbstractHashFloodingTest.java
import java.util.function.Supplier; import junit.framework.TestCase; import org.checkerframework.checker.nullness.qual.Nullable; /** * Abstract superclass for tests that hash flooding a collection has controlled worst-case * performance. */ @GwtIncompatible public abstract class AbstractHashFloodingTest<T> extends TestCase { private final List<Construction<T>> constructions;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Oct 03 21:01:39 GMT 2023 - 8.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ListenableFuture.java
* could in principle cause problems for some users. Still, we expect that the benefits of the * nullness annotations in particular will outweigh the costs. (And it's worth noting that we have * released multiple ListenableFuture.class files that are not byte-for-byte compatible even from * the beginning, thanks to using different `-source -target` values for compiling our `-jre` and
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 21:13:41 GMT 2023 - 8K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
// Raising this number slows the worst-case contains behavior, speeds up hashFloodingDetected, // and reduces the false-positive probability. static final int MAX_RUN_MULTIPLIER = 13; /** * Checks the whole hash table for poor hash distribution. Takes O(n) in the worst case, O(n / * log n) on average. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.4K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Converter.java
* `Function<@Nullable A, @Nullable B>` already had to find a workaround. Still, there is a *ton* of * fallout from trying to switch. I would be shocked if the switch would offer benefits to anywhere * near enough users to justify the costs. * * Fortunately, if anyone does want to use a Converter as a `Function<@Nullable A, @Nullable B>`, * it's easy to get one: `converter::convert`. * * [*] In annotating this class, we're ignoring LegacyConverter.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 23K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
} } } /** * Marks the given node as 'deleted' (null waiter) and then scans the list to unlink all deleted * nodes. This is an O(n) operation in the common case (and O(n^2) in the worst), but we are saved * by two things. * * <ul> * <li>This is only called when a waiting thread times out or is interrupted. Both of which * should be rare.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedInts.java
return "UnsignedInts.lexicographicalComparator()"; } } /** * Sorts the array, treating its elements as unsigned 32-bit integers. * * @since 23.1 */ public static void sort(int[] array) { checkNotNull(array); sort(array, 0, array.length); } /** * Sorts the array between {@code fromIndex} inclusive and {@code toIndex} exclusive, treating its
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 13.4K bytes - Viewed (0)