- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 1,262 for log2 (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
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/util/concurrent/Striped.java
return size; } } /** A bit mask were all bits are set. */ private static final int ALL_SET = ~0; private static int ceilToPowerOfTwo(int x) { return 1 << IntMath.log2(x, RoundingMode.CEILING); } /* * This method was written by Doug Lea with assistance from members of JCP JSR-166 Expert Group * and released to the public domain, as explained at
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 10 20:55:18 GMT 2023 - 20.3K bytes - Viewed (1) -
android/guava/src/com/google/common/io/BaseEncoding.java
import static com.google.common.base.Preconditions.checkPositionIndexes; import static com.google.common.base.Preconditions.checkState; import static com.google.common.math.IntMath.divide; import static com.google.common.math.IntMath.log2; import static java.math.RoundingMode.CEILING; import static java.math.RoundingMode.FLOOR; import static java.math.RoundingMode.UNNECESSARY; import com.google.common.annotations.GwtCompatible;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Mar 15 16:33:32 GMT 2024 - 41.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
* * <p>If this returns false, then no query can take more than O(log n). * * <p>Note that for a RegularImmutableSet with elements with truly random hash codes, contains * operations take expected O(1) time but with high probability take O(log n) for at least some * element. (https://en.wikipedia.org/wiki/Linear_probing#Analysis) *
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) -
src/main/webapp/images/logo.png
logo.png...
PNG Image - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Fri Oct 30 11:04:53 GMT 2015 - 2.3K bytes - Viewed (0) -
.github/logo.svg
logo.svg...
SVG Image - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed Oct 23 05:59:13 GMT 2019 - 978 bytes - Viewed (0) -
docs/en/docs/img/logo-teal.svg
logo-teal.svg...
SVG Image - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Sun Feb 04 20:56:59 GMT 2024 - 2K bytes - Viewed (0) -
docs/assets/images/logo-square.png
logo-square.png...
PNG Image - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Sun Feb 06 02:19:09 GMT 2022 - 3.7K bytes - Viewed (0) -
src/main/webapp/images/logo-top.png
logo-top.png...
PNG Image - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Fri Oct 30 11:23:45 GMT 2015 - 1.5K bytes - Viewed (0) -
src/main/config/es/fess_log_search_log.json
Json - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Fri Apr 12 15:00:27 GMT 2019 - 2K bytes - Viewed (0)