- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 229 for Hafner (0.16 sec)
-
android/guava/src/com/google/common/collect/TreeMultiset.java
} @Override public Entry<E> next() { if (!hasNext()) { throw new NoSuchElementException(); } // requireNonNull is safe because current is only nulled out after iteration is complete. Entry<E> result = wrapEntry(requireNonNull(current)); prevEntry = result; if (current.succ() == header) { current = null; } else {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/MapInterfaceTest.java
iterator.remove(); assertEquals(initialSize - 1, map.size()); // Use "entryCopy" instead of "entry" because "entry" might be invalidated after // iterator.remove(). assertFalse(entrySet.contains(entryCopy)); assertInvariants(map); try { iterator.remove(); fail("Expected IllegalStateException.");
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 45.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableSortedSet.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
extends ImmutableEntry<K, V> implements ValueSetLink<K, V> { final int smearedValueHash; @CheckForNull ValueEntry<K, V> nextInValueBucket; /* * The *InValueSet and *InMultimap fields below are null after construction, but we almost * always call succeedsIn*() to initialize them immediately thereafter. * * The exception is the *InValueSet fields of multimapHeaderEntry, which are never set. (That
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) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* @return a new {@code CompactLinkedHashSet} containing those elements (minus duplicates) */ @SafeVarargs @SuppressWarnings("nullness") // TODO: b/316358623 - Remove after checker fix. public static <E extends @Nullable Object> CompactLinkedHashSet<E> create(E... elements) { CompactLinkedHashSet<E> set = createWithExpectedSize(elements.length); Collections.addAll(set, elements);
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
*/ public static HashFunction fingerprint2011() { return Fingerprint2011.FINGERPRINT_2011; } /** * Assigns to {@code hashCode} a "bucket" in the range {@code [0, buckets)}, in a uniform manner * that minimizes the need for remapping as {@code buckets} grows. That is, {@code * consistentHash(h, n)} equals: * * <ul> * <li>{@code n - 1}, with approximate probability {@code 1/n}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableRangeMap.java
return this; } int lowerIndex = SortedLists.binarySearch( ranges, Range::upperBound, range.lowerBound, KeyPresentBehavior.FIRST_AFTER, KeyAbsentBehavior.NEXT_HIGHER); int upperIndex = SortedLists.binarySearch( ranges, Range::lowerBound, range.upperBound,
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 14.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
} /** * Returns an iterable whose iterators cycle indefinitely over the elements of {@code iterable}. * * <p>That iterator supports {@code remove()} if {@code iterable.iterator()} does. After {@code * remove()} is called, subsequent cycles omit the removed element, which is no longer in {@code * iterable}. The iterator's {@code hasNext()} method returns {@code true} until {@code iterable} * is empty. *
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) -
guava/src/com/google/common/collect/ImmutableList.java
public static <E> ImmutableList<E> of( E e1, E e2, E e3, E e4, E e5, E e6, E e7, E e8, E e9, E e10, E e11) { return construct(e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11); } // These go up to eleven. After that, you just get the varargs form, and // whatever warnings might come along with it. :( /** * Returns an immutable list containing the given elements, in order. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 30K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/Multisets.java
} laterCount--; canRemove = true; /* * requireNonNull is safe because laterCount starts at 0, forcing us to initialize * currentEntry above. After that, we never clear it. */ return requireNonNull(currentEntry).getElement(); } @Override public void remove() { checkRemove(canRemove); if (totalCount == 1) {
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)