- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 1,182 for Clements (0.18 sec)
-
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 Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 41.6K bytes - Viewed (0) -
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 Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ImmutableList.java
@JsMethod(name = "of") static <E> ImmutableList<E> jsOf(E... elements) { return copyOf(elements); } public static <E> ImmutableList<E> copyOf(Iterable<? extends E> elements) { checkNotNull(elements); // for GWT return (elements instanceof Collection) ? copyOf((Collection<? extends E>) elements) : copyOf(elements.iterator()); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 27 19:19:19 GMT 2024 - 11K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractContainerTester.java
E[] elements = createSamplesArray(); E duplicate = elements[(elements.length / 2) - 1]; elements[(elements.length / 2) + 1] = duplicate; return new ArrayWithDuplicate<>(elements, duplicate); } // Helper methods to improve readability of derived classes protected int getNumElements() { return getSubjectGenerator().getCollectionSize().getNumElements(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 8.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/FluentIterable.java
* Returns a fluent iterable whose iterators traverse first the elements of this fluent iterable, * followed by {@code elements}. * * <p><b>{@code Stream} equivalent:</b> {@code Stream.concat(thisStream, Stream.of(elements))}. * * @since 18.0 */ public final FluentIterable<E> append(E... elements) { return FluentIterable.concat(getDelegate(), Arrays.asList(elements)); } /**
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jan 30 00:14:39 GMT 2024 - 35.3K 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 Apr 26 12:43:10 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/AtomicDoubleArray.java
* * @param length the length of the array */ public AtomicDoubleArray(int length) { this.longs = new AtomicLongArray(length); } /** * Creates a new {@code AtomicDoubleArray} with the same length as, and all elements copied from, * the given array. * * @param array the array to copy elements from
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 8K bytes - Viewed (0) -
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 Apr 05 12:43:09 GMT 2024 - Last Modified: Fri May 12 17:52:55 GMT 2023 - 4.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ConcurrentHashMultiset.java
* default initial capacity, load factor, and concurrency settings. * * <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> ConcurrentHashMultiset<E> create(Iterable<? extends E> elements) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 20.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ForwardingList.java
@Override protected abstract List<E> delegate(); @Override public void add(int index, @ParametricNullness E element) { delegate().add(index, element); } @CanIgnoreReturnValue @Override public boolean addAll(int index, Collection<? extends E> elements) { return delegate().addAll(index, elements); } @Override @ParametricNullness public E get(int index) { return delegate().get(index);
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri May 12 15:26:39 GMT 2023 - 7.9K bytes - Viewed (0)