- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 581 for Klemens (0.31 sec)
-
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/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 May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
for (int i = 0; i < 100; i++) { Element element = Element.values()[random.nextInt(range)]; elements.add(element); queue.add(element); } Iterator<Element> queueIterator = queue.iterator(); int remaining = queue.size(); while (queueIterator.hasNext()) { Element element = queueIterator.next(); remaining--;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
* elements. */ @SafeVarargs public static <T extends @Nullable Object> Iterator<T> cycle(T... elements) { return cycle(Lists.newArrayList(elements)); } /** * Returns an Iterator that walks the specified array, nulling out elements behind it. This can * avoid memory leaks when an element is no longer necessary. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 18:43:01 GMT 2024 - 51.1K bytes - Viewed (0) -
src/main/java/org/codelibs/core/collection/LruHashSet.java
/** * Returns an iterator over the elements in this set. The elements are * returned in no particular order. * * @return an Iterator over the elements in this set. * @see ConcurrentModificationException */ @Override public Iterator<E> iterator() { return map.keySet().iterator(); } /** * Returns the number of elements in this set (its cardinality). *
Java - Registered: Fri May 03 20:58:11 GMT 2024 - Last Modified: Thu Mar 07 01:59:08 GMT 2024 - 3.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/PeekingIteratorTest.java
assertEquals("Should be able to peek() at first element", "A", peekingIterator.peek()); assertEquals( "Should be able to peek() first element multiple times", "A", peekingIterator.peek()); assertEquals( "next() should still return first element after peeking", "A", peekingIterator.next()); assertEquals("Should be able to peek() at middle element", "B", peekingIterator.peek()); assertEquals(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 9K bytes - Viewed (0) -
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-testlib/src/com/google/common/collect/testing/testers/CollectionIteratorTester.java
if (element instanceof Entry) { Entry<?, ?> entry = (Entry<?, ?>) element; element = mapEntry(entry.getKey(), entry.getValue()); } assertTrue(collection.contains(element)); // sanity check iterator.remove(); assertFalse(collection.contains(element)); assertEquals(originalSize - 1, collection.size()); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 5.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
for (int i = 0; i < 100; i++) { Element element = Element.values()[random.nextInt(range)]; elements.add(element); queue.add(element); } Iterator<Element> queueIterator = queue.iterator(); int remaining = queue.size(); while (queueIterator.hasNext()) { Element element = queueIterator.next(); remaining--;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K 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
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24.9K bytes - Viewed (0)