- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,184 for Clements (0.22 sec)
-
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();
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 9.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Lists.java
Iterable<? extends E> elements) { checkNotNull(elements); // for GWT // Let ArrayList's sizing logic work, if possible return (elements instanceof Collection) ? new ArrayList<>((Collection<? extends E>) elements) : newArrayList(elements.iterator()); } /** * Creates a <i>mutable</i> {@code ArrayList} instance containing the given elements; a very thin
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 16:48:36 GMT 2024 - 41.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableSortedSet.java
public E floor(E element) { int index = headIndex(element, true) - 1; return (index == -1) ? null : elements.get(index); } @Override @CheckForNull public E ceiling(E element) { int index = tailIndex(element, true); return (index == size()) ? null : elements.get(index); } @Override @CheckForNull public E higher(E element) { int index = tailIndex(element, false);
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/EvictingQueue.java
/** * 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). * * <p>An evicting queue must be configured with a maximum size. Each time an element is added to a
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri May 12 17:52:55 GMT 2023 - 4.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
if (newLength > elements.length) { elements = Arrays.copyOf(elements, newLength); } } elements[n++] = element; return this; } /** * Adds each element of {@code elements} to the {@code ImmutableSortedSet}, ignoring duplicate * elements (only the first duplicate element is added). * * @param elements the elements to add
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 38.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
public Builder<E> add(E element) { super.add(element); return this; } /** * Adds each element of {@code elements} to the {@code ImmutableSortedSet}, ignoring duplicate * elements (only the first duplicate element is added). * * @param elements the elements to add * @return this {@code Builder} object * @throws NullPointerException if {@code elements} contains a null element
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) -
android/guava/src/com/google/common/collect/Multisets.java
/** * Returns the expected number of distinct elements given the specified elements. The number of * distinct elements is only computed if {@code elements} is an instance of {@code Multiset}; * otherwise the default value of 11 is returned. */ static int inferDistinctElements(Iterable<?> elements) { if (elements instanceof Multiset) { return ((Multiset<?>) elements).elementSet().size(); }
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/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)))} *
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/collect/ImmutableSortedMultiset.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 35.7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* elements FIFO (first-in-first-out). The head of the queue is that element that has been * on the queue the longest time. The tail of the queue is that element that has been on * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue * retrieval operations obtain elements at the head of the queue. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0)