- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 1,890 for elemEnds (0.25 sec)
-
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
set.addAll(collection); return set; } /** * Creates a {@code CompactLinkedHashSet} instance containing the given elements in unspecified * order. * * @param elements the elements that the set should contain * @return a new {@code CompactLinkedHashSet} containing those elements (minus duplicates) */ @SafeVarargs @SuppressWarnings("nullness") // TODO: b/316358623 - Remove after checker fix.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 21:38:59 UTC 2024 - 9.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/CompactHashSetTest.java
suite.addTest( SetTestSuiteBuilder.using( new TestStringSetGenerator() { @Override protected Set<String> create(String[] elements) { return CompactHashSet.create(Arrays.asList(elements)); } }) .named("CompactHashSet") .withFeatures(allFeatures) .createTestSuite()); suite.addTest(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 20:09:59 UTC 2024 - 4K bytes - Viewed (0) -
guava/src/com/google/common/collect/LinkedHashMultiset.java
/** * Creates a new {@code LinkedHashMultiset} containing the specified elements. * * <p>This implementation is highly efficient when {@code elements} is itself a {@link Multiset}. * * @param elements the elements that the multiset should contain */ public static <E extends @Nullable Object> LinkedHashMultiset<E> create( Iterable<? extends E> elements) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 4K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/internal/snapshot/impl/ListValueSnapshot.java
public static final ListValueSnapshot EMPTY = new ListValueSnapshot(ImmutableList.of()); public ListValueSnapshot(ImmutableList<ValueSnapshot> elements) { super(elements); } @Override public ValueSnapshot snapshot(Object value, ValueSnapshotter snapshotter) { return processList(value, snapshotter); }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 28 09:51:04 UTC 2023 - 2.9K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/MinimalIterable.java
/** Returns an iterable whose iterator returns the given elements in order. */ public static <E extends @Nullable Object> MinimalIterable<E> of(E... elements) { // Make sure to get an unmodifiable iterator return new MinimalIterable<>(Arrays.asList(elements).iterator()); } /** * Returns an iterable whose iterator returns the given elements in order. The elements are copied
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/EnumMultiset.java
* Creates a new {@code EnumMultiset} containing the specified elements. * * <p>This implementation is highly efficient when {@code elements} is itself a {@link Multiset}. * * @param elements the elements that the multiset should contain * @throws IllegalArgumentException if {@code elements} is empty */ public static <E extends Enum<E>> EnumMultiset<E> create(Iterable<E> elements) { Iterator<E> iterator = elements.iterator();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 9K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterables.java
* have been removed. * * <p><b>Warning:</b> Typical uses of the resulting iterator may produce an infinite loop. You * should use an explicit {@code break} or be certain that you will eventually remove all the * elements. * * <p>To cycle over the elements {@code n} times, use the following: {@code * Iterables.concat(Collections.nCopies(n, Arrays.asList(elements)))} *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 24 19:38:27 UTC 2024 - 42.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/EvictingQueue.java
import java.util.ArrayDeque; import java.util.Collection; import java.util.Queue; /** * A non-blocking queue which automatically evicts elements from the head of the queue when * attempting to add new elements onto the queue and it is full. This queue orders elements FIFO * (first-in-first-out). This data structure is logically equivalent to a circular buffer (i.e., * cyclic buffer or ring buffer). *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:52:55 UTC 2023 - 4.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
CompactHashSet<E> set = createWithExpectedSize(elements.length); Collections.addAll(set, elements); return set; } /** * Creates a {@code CompactHashSet} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without growth. * * @param expectedSize the number of elements you expect to add to the returned set
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 24.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/RegularImmutableSortedSet.java
private final transient ImmutableList<E> elements; RegularImmutableSortedSet(ImmutableList<E> elements, Comparator<? super E> comparator) { super(comparator); this.elements = elements; } @Override @CheckForNull Object[] internalArray() { return elements.internalArray(); } @Override int internalArrayStart() { return elements.internalArrayStart(); } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 9.2K bytes - Viewed (0)