- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 21 for Forst (0.13 sec)
-
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) -
android/guava/src/com/google/common/collect/Comparators.java
* .collect(least(2, comparingInt(String::length))) * // returns {"foo", "quux"} * }</pre> * * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log * k)), as opposed to e.g. {@code Stream.sorted(comparator).limit(k)}, which currently takes O(n * log n) time and O(n) space. * * @throws IllegalArgumentException if {@code k < 0}
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/src/com/google/common/collect/Comparators.java
* .collect(least(2, comparingInt(String::length))) * // returns {"foo", "quux"} * }</pre> * * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log * k)), as opposed to e.g. {@code Stream.sorted(comparator).limit(k)}, which currently takes O(n * log n) time and O(n) space. * * @throws IllegalArgumentException if {@code k < 0} * @since 22.0
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) -
guava/src/com/google/common/collect/ForwardingSortedMap.java
protected class StandardKeySet extends Maps.SortedKeySet<K, V> { /** Constructor for use by subclasses. */ public StandardKeySet() { super(ForwardingSortedMap.this); } } // unsafe, but worst case is a CCE or NPE is thrown, which callers will be expecting @SuppressWarnings({"unchecked", "nullness"}) static int unsafeCompare(
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri May 12 15:26:39 GMT 2023 - 5.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularContiguousSet.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 8.4K 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/collect/ForwardingSortedMap.java
protected class StandardKeySet extends Maps.SortedKeySet<K, V> { /** Constructor for use by subclasses. */ public StandardKeySet() { super(ForwardingSortedMap.this); } } // unsafe, but worst case is a CCE or NPE is thrown, which callers will be expecting @SuppressWarnings({"unchecked", "nullness"}) static int unsafeCompare(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri May 12 15:26:39 GMT 2023 - 5.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* dataset contains no finite values). * * <h3>Performance</h3> * * <p>The average time complexity of the computation is O(N) in the size of the dataset. There is a * worst case time complexity of O(N^2). You are extremely unlikely to hit this quadratic case on * randomly ordered data (the probability decreases faster than exponentially in N), but if you are
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K 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/collect/CompactHashSet.java
* simply switch over to use the JDK implementation wholesale if probable hash flooding is * detected, sacrificing the compactness guarantee in very rare cases in exchange for much * more reliable worst-case behavior. * <li>null, if no entries have yet been added to the map * </ul> */ @CheckForNull private transient Object table; /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0)