- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 25 for Next (0.14 sec)
-
android/guava/src/com/google/common/collect/Comparators.java
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) -
android/guava/src/com/google/common/collect/Multisets.java
* counts are converted to strings as by {@code String.valueOf}. */ @Override public String toString() { String text = String.valueOf(getElement()); int n = getCount(); return (n == 1) ? text : (text + " x " + n); } } /** An implementation of {@link Multiset#equals}. */ static boolean equalsImpl(Multiset<?> multiset, @CheckForNull Object object) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 41.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionList.java
final Runnable runnable; final Executor executor; @CheckForNull RunnableExecutorPair next; RunnableExecutorPair( Runnable runnable, Executor executor, @CheckForNull RunnableExecutorPair next) { this.runnable = runnable; this.executor = executor; this.next = next; } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
checkNotNull(predicate); Iterator<T> iterator = removeFrom.iterator(); while (iterator.hasNext()) { T next = iterator.next(); if (predicate.apply(next)) { iterator.remove(); return next; } } return null; } /** * Determines whether two iterables contain equal elements in the same order. More specifically,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// also be recursive and create StackOverflowErrors future.afterDone(); // push the current set of listeners onto next next = future.clearListeners(next); future = null; while (next != null) { Listener curr = next; next = next.next; /* * requireNonNull is safe because the listener stack never contains TOMBSTONE until after * clearListeners.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeSet.java
import static com.google.common.base.Preconditions.checkNotNull; import static com.google.common.collect.SortedLists.KeyAbsentBehavior.NEXT_HIGHER; import static com.google.common.collect.SortedLists.KeyAbsentBehavior.NEXT_LOWER; import static com.google.common.collect.SortedLists.KeyPresentBehavior.ANY_PRESENT; import static java.util.Objects.requireNonNull; import com.google.common.annotations.Beta;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 27.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ListsTest.java
assertTrue(iterator.hasNext()); assertEquals("1", iterator.next()); assertTrue(iterator.hasNext()); assertEquals("2", iterator.next()); assertTrue(iterator.hasNext()); assertEquals("3", iterator.next()); assertTrue(iterator.hasNext()); assertEquals("4", iterator.next()); assertFalse(iterator.hasNext()); try { iterator.next(); fail("did not detect end of list");
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 35.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/IteratorsTest.java
assertTrue(cycle.hasNext()); assertEquals("a", cycle.next()); cycle.remove(); assertEquals(Collections.singletonList("b"), iterable); assertTrue(cycle.hasNext()); assertEquals("b", cycle.next()); assertTrue(cycle.hasNext()); assertEquals("b", cycle.next()); cycle.remove(); assertEquals(Collections.emptyList(), iterable); assertFalse(cycle.hasNext()); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 18:43:01 GMT 2024 - 56.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeMap.java
range.lowerBound, KeyPresentBehavior.FIRST_AFTER, KeyAbsentBehavior.NEXT_HIGHER); int upperIndex = SortedLists.binarySearch( ranges, Range::lowerBound, range.upperBound, KeyPresentBehavior.ANY_PRESENT, KeyAbsentBehavior.NEXT_HIGHER); if (lowerIndex >= upperIndex) { return ImmutableRangeMap.of(); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 14.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* The pointer to a key is stored in hashTable[Hashing.smear(key.hashCode()) % table.length], * save that if that location is already full, we try the next index, and the next, until we * find an empty table position. Since the table has a power-of-two size, we use * & (table.length - 1) instead of % table.length, though. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0)