- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 101 for Aigner (0.19 sec)
-
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
} @VisibleForTesting @WeakOuter final class ValueSet extends Sets.ImprovedAbstractSet<V> implements ValueSetLink<K, V> { /* * We currently use a fixed load factor of 1.0, a bit higher than normal to reduce memory * consumption. */ @ParametricNullness private final K key; @VisibleForTesting @Nullable ValueEntry<K, V>[] hashTable; private int size = 0;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
@VisibleForTesting static final long MAX_SIGNED_POWER_OF_TWO = 1L << (Long.SIZE - 2); /** * Returns the smallest power of two greater than or equal to {@code x}. This is equivalent to * {@code checkedPow(2, log2(x, CEILING))}. * * @throws IllegalArgumentException if {@code x <= 0} * @throws ArithmeticException of the next-higher power of two is not representable as a {@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* deadlock situation, and the appropriate Policy is executed. * </ul> * * <p>Note that detection of potential deadlock does not necessarily indicate that deadlock will * happen, as it is possible that higher level application logic prevents the cyclic lock * acquisition from occurring. One example of a false positive is: * * <pre> * LockA -> LockB -> LockC * LockA -> LockC -> LockB * </pre> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
// centerFloor and centerFloor + 1. int centerFloor = (from + to) >>> 1; // Do a binary search until we're down to the range of two which encloses centerFloor (unless // all values are lower or higher than centerFloor, in which case we find the two highest or // lowest respectively). If centerFloor is in allRequired, we will definitely find it. If not,
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) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
* been interrupted and is waiting to reacquire the lock while still registered in activeGuards, * in which case the signal is a no-op, and the bigger-picture signal is lost unless interrupted * threads take special action by participating in the signal-passing game. */ /* * Timeout handling is intricate, especially given our ambitious goals:
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
public E ceiling(E e) { return Iterables.<@Nullable E>getFirst(tailSet(e, true), null); } /** @since 12.0 */ @GwtIncompatible // NavigableSet @Override @CheckForNull public E higher(E e) { return Iterables.<@Nullable E>getFirst(tailSet(e, false), null); } @Override public E first() { return iterator().next(); } @Override public E last() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 36.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsTest.java
checkHashCode(Sets.cartesianProduct(set(1, num), set(2, num - 1))); checkHashCode(Sets.cartesianProduct(set(1, num), set(2, num - 1), set(3, num + 1))); // a bigger one checkHashCode( Sets.cartesianProduct(set(1, num, num + 1), set(2), set(3, num + 2), set(4, 5, 6, 7, 8))); } public void testPowerSetEmpty() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 49.3K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
@VisibleForTesting static final int MAX_SIGNED_POWER_OF_TWO = 1 << (Integer.SIZE - 2); /** * Returns the smallest power of two greater than or equal to {@code x}. This is equivalent to * {@code checkedPow(2, log2(x, CEILING))}. * * @throws IllegalArgumentException if {@code x <= 0} * @throws ArithmeticException of the next-higher power of two is not representable as an {@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/testers/NavigableSetNavigationTester.java
} @CollectionSize.Require(SEVERAL) public void testHigherHole() { resetWithHole(); assertEquals(c, navigableSet.higher(a)); assertEquals(c, navigableSet.higher(b)); assertEquals(null, navigableSet.higher(c)); } /* * TODO(cpovirk): make "too small" and "too large" elements available for better navigation
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 8.3K bytes - Viewed (0) -
android/guava/src/com/google/common/io/ReaderInputStream.java
private static CharBuffer grow(CharBuffer buf) { char[] copy = Arrays.copyOf(buf.array(), buf.capacity() * 2); CharBuffer bigger = CharBuffer.wrap(copy); Java8Compatibility.position(bigger, buf.position()); Java8Compatibility.limit(bigger, buf.limit()); return bigger; } /** Handle the case of underflow caused by needing more input characters. */ private void readMoreChars() throws IOException {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 28 20:13:02 GMT 2023 - 9.3K bytes - Viewed (0)