- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for Towers (1.84 sec)
-
android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
static AtomicLong requests = new AtomicLong(0); static AtomicLong misses = new AtomicLong(0); @BeforeExperiment void setUp() { // random integers will be generated in this range, then raised to the // power of (1/concentration) and floor()ed max = Ints.checkedCast((long) Math.pow(distinctKeys, concentration)); cache = CacheBuilder.newBuilder() .concurrencyLevel(segments)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 3.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleUtils.java
static boolean isFinite(double d) { return getExponent(d) <= MAX_EXPONENT; } static boolean isNormal(double d) { return getExponent(d) >= MIN_EXPONENT; } /* * Returns x scaled by a power of 2 such that it is in the range [1, 2). Assumes x is positive, * normal, and finite. */ static double scaleNormalize(double x) { long significand = doubleToRawLongBits(x) & SIGNIFICAND_MASK;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 28 15:37:52 UTC 2021 - 5.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashing.java
} else { ((int[]) table)[index] = entry; } } /** * Returns a larger power of 2 hashtable size given the current mask. * * <p>For hashtable sizes less than or equal to 32, the returned power of 2 is 4x the current * hashtable size to reduce expensive rehashing. Otherwise the returned power of 2 is 2x the * current hashtable size. */ static int newCapacity(int mask) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Aug 02 21:41:22 UTC 2021 - 7.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/ForwardingNavigableSet.java
@Override @CheckForNull public E lower(@ParametricNullness E e) { return delegate().lower(e); } /** * A sensible definition of {@link #lower} in terms of the {@code descendingIterator} method of * {@link #headSet(Object, boolean)}. If you override {@link #headSet(Object, boolean)}, you may * wish to override {@link #lower} to forward to this implementation. */ @CheckForNull
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 15:26:39 UTC 2023 - 9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedMultisets.java
implements NavigableSet<E> { NavigableElementSet(SortedMultiset<E> multiset) { super(multiset); } @Override @CheckForNull public E lower(@ParametricNullness E e) { return getElementOrNull(multiset().headMultiset(e, OPEN).lastEntry()); } @Override @CheckForNull public E floor(@ParametricNullness E e) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 01 17:18:04 UTC 2021 - 5.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ForwardingNavigableSet.java
@Override @CheckForNull public E lower(@ParametricNullness E e) { return delegate().lower(e); } /** * A sensible definition of {@link #lower} in terms of the {@code descendingIterator} method of * {@link #headSet(Object, boolean)}. If you override {@link #headSet(Object, boolean)}, you may * wish to override {@link #lower} to forward to this implementation. */ @CheckForNull
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 15:26:39 UTC 2023 - 9K bytes - Viewed (0) -
guava/src/com/google/common/collect/Hashing.java
} private static final int MAX_TABLE_SIZE = Ints.MAX_POWER_OF_TWO; static int closedTableSize(int expectedEntries, double loadFactor) { // Get the recommended table size. // Round down to the nearest power of 2. expectedEntries = Math.max(expectedEntries, 2); int tableSize = Integer.highestOneBit(expectedEntries); // Check to make sure that we will not exceed the maximum load factor.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Aug 05 00:40:25 UTC 2021 - 2.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/MathBenchmarking.java
return RANDOM_SOURCE.nextBoolean() ? result : result.negate(); } /** * Chooses a number in (-2^numBits, 2^numBits) at random, with density concentrated in numbers of * lower magnitude. */ static BigInteger randomBigInteger(int numBits) { while (true) { if (RANDOM_SOURCE.nextBoolean()) { return randomNonNegativeBigInteger(numBits); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 4.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ForwardingNavigableSetTest.java
} @Override public SortedSet<T> subSet(T fromElement, T toElement) { return standardSubSet(fromElement, toElement); } @Override public @Nullable T lower(T e) { return standardLower(e); } @Override public @Nullable T floor(T e) { return standardFloor(e); } @Override public @Nullable T ceiling(T e) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 19 19:24:36 UTC 2023 - 6.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/RegularImmutableSortedSet.java
} @Override public E last() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(size() - 1); } @Override @CheckForNull public E lower(E element) { int index = headIndex(element, false) - 1; return (index == -1) ? null : elements.get(index); } @Override @CheckForNull public E floor(E element) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 9.2K bytes - Viewed (0)