- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for Forst (0.18 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 Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Apr 11 08:42:51 GMT 2024 - 10K 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/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) -
CHANGELOG/CHANGELOG-1.30.md
- Previously, the scheduling queue didn't notice any extenders' failures, potentially resulting in missed cluster events and Pods rejected by Extenders being stuck in the unschedulable pod pool for up to 5 minutes in the worst-case scenario. Now, the scheduling queue notices extenders' failures and requeues Pods rejected by Extenders appropriately. ([#122022](https://github.com/kubernetes/kubernetes/pull/122022), [@sanposhiho](https://github.com/sanposhiho))
Plain Text - Registered: Fri Apr 26 09:05:10 GMT 2024 - Last Modified: Wed Apr 17 17:56:15 GMT 2024 - 227.9K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.27.md
Plain Text - Registered: Fri Apr 26 09:05:10 GMT 2024 - Last Modified: Tue Apr 16 15:20:21 GMT 2024 - 434.3K bytes - Viewed (1) -
CHANGELOG/CHANGELOG-1.28.md
Plain Text - Registered: Fri Apr 26 09:05:10 GMT 2024 - Last Modified: Tue Apr 16 20:44:48 GMT 2024 - 385.1K bytes - Viewed (0)