- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 1,219 for elements (0.19 sec)
-
guava-tests/test/com/google/common/collect/Collections2Test.java
@Override public Collection<@Nullable String> create(@Nullable String[] elements) { List<@Nullable String> list = newArrayList(); for (String element : elements) { list.add((element == null) ? null : "q" + element); } return Collections2.transform(
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Feb 21 10:16:44 GMT 2024 - 19.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/Collections2Test.java
@Override public Collection<@Nullable String> create(@Nullable String[] elements) { List<@Nullable String> list = newArrayList(); for (String element : elements) { list.add((element == null) ? null : "q" + element); } return Collections2.transform(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 10:16:44 GMT 2024 - 19.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsTest.java
} // TODO b/327389044 - `Set<? extends Object> elements` should be enough but J2KT needs the <E> private static <E> void assertPowerSetHashCode(int expected, Set<E> elements) { assertEquals(expected, powerSet(elements).hashCode()); } private static void assertPowerSetSize(int i, Object... elements) { assertEquals(i, powerSet(newHashSet(elements)).size()); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 49.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/Comparators.java
return new LexicographicalOrdering<S>(checkNotNull(comparator)); } /** * Returns {@code true} if each element in {@code iterable} after the first is greater than or * equal to the element that preceded it, according to the specified comparator. Note that this is * always true when the iterable has fewer than two elements. */ public static <T extends @Nullable Object> boolean isInOrder(
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 10.7K bytes - Viewed (0) -
src/main/java/org/codelibs/core/collection/ArrayUtil.java
return elements; } /** * {@literal byte}の配列を返します。 * * @param elements * 配列の要素 * @return 配列 */ public static byte[] asByteArray(final byte... elements) { return elements; } /** * {@literal short}の配列を返します。 * * @param elements * 配列の要素 * @return 配列 */
Java - Registered: Fri May 03 20:58:11 GMT 2024 - Last Modified: Thu Mar 07 01:59:08 GMT 2024 - 42.6K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
/** * Inserts the specified element into this priority queue. * * @param e the element to add * @return {@code true} (as specified by {@link Queue#offer}) * @throws ClassCastException if the specified element cannot be compared with elements currently * in the priority queue according to the priority queue's ordering * @throws NullPointerException if the specified element is null */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/TestMapEntrySetGenerator.java
public SampleElements<Entry<K, V>> samples() { return SampleElements.mapEntries(keys, values); } @Override public Set<Entry<K, V>> create(Object... elements) { Entry<K, V>[] entries = createArray(elements.length); System.arraycopy(elements, 0, entries, 0, elements.length); return createFromEntries(entries); } public abstract Set<Entry<K, V>> createFromEntries(Entry<K, V>[] entries); @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 2.1K 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)))} *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashMultiset.java
/** * Creates a new {@code HashMultiset} 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> HashMultiset<E> create( Iterable<? extends E> elements) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 2.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultiset.java
* according to when the first occurrence of the element was added. When the multiset contains * multiple instances of an element, those instances are consecutive in the iteration order. If all * occurrences of an element are removed, after which that element is added to the multiset, the * element will appear at the end of the iteration. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 3K bytes - Viewed (0)