- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 22 for and (0.17 sec)
-
android/guava/src/com/google/common/collect/ImmutableTable.java
* ordering of all views in the returned table. Note that some views of the original table and the * copied table may have different iteration orders. For more control over the ordering, create a * {@link Builder} and call {@link Builder#orderRowsBy}, {@link Builder#orderColumnsBy}, and * {@link Builder#putAll} *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 17.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* convenience for creating an empty set and then calling {@link Iterators#addAll}. * * <p><b>Note:</b> if mutability is not required and the elements are non-null, use {@link * ImmutableSet#copyOf(Iterator)} instead. * * <p><b>Note:</b> if {@code E} is an {@link Enum} type, you should create an {@link EnumSet} * instead. * * <p>Overall, this method is not very useful and will likely be deprecated in the future.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableBiMap.java
* they were inserted into the builder. For example, in the above example, {@code * WORD_TO_INT.entrySet()} is guaranteed to iterate over the entries in the order {@code "one"=1, * "two"=2, "three"=3}, and {@code keySet()} and {@code values()} respect the same order. If you * want a different order, consider using {@link #orderEntriesByValue(Comparator)}, which changes * this builder to sort entries by value. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
* // returns {"foo", "quux"} * }</pre> * * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log * k)), as opposed to e.g. {@code Stream.sorted(comparator).limit(k)}, which currently takes O(n * log n) time and O(n) space. * * @throws IllegalArgumentException if {@code k < 0} * @since 33.2.0 (available since 22.0 in guava-jre) */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
* * <p>The resulting multiset's iterators, and those of its {@code entrySet()} and {@code * elementSet()}, do not support {@code remove()}. However, all other multiset methods supported * by {@code unfiltered} are supported by the returned multiset. When given an element that * doesn't satisfy the predicate, the multiset's {@code add()} and {@code addAll()} methods throw
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/ImmutableSetMultimap.java
} /** * Returns a {@code Collector} accumulating entries into an {@code ImmutableSetMultimap}. Each * input element is mapped to a key and a stream of values, each of which are put into the * resulting {@code Multimap}, in the encounter order of the stream and the encounter order of the * streams of values. * * <p>Example: * * <pre>{@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 23.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
* doesn't need this suppression, but we keep it to minimize diffs.) Generally be more clear * about when we have an Object[] vs. a Comparable[] or other array type in internalArray? If we * used Object[], we might be able to optimize toArray() to use clone() sometimes. (See * cl/592273615 and cl/592273683.) */ @SuppressWarnings("unchecked")
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/ImmutableSortedMap.java
Object value = entry.getValue(); checkEntryNotNull(key, value); keys[i] = key; values[i] = value; } } else { // Need to sort and check for nulls and dupes. // Inline the Comparator implementation rather than transforming with a Function // to save code size. Arrays.sort( entryArray, 0,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 53.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
return result; } /** * Determines whether two iterators contain equal elements in the same order. More specifically, * this method returns {@code true} if {@code iterator1} and {@code iterator2} contain the same * number of elements and every element of {@code iterator1} is equal to the corresponding element * of {@code iterator2}. *
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) -
android/guava/src/com/google/common/collect/ImmutableSortedMultiset.java
* * @since 12.0 */ public static class Builder<E> extends ImmutableMultiset.Builder<E> { /* * We keep an array of elements and counts. Periodically -- when we need more room in the * array, or when we're building, or the like -- we sort, deduplicate, and combine the counts. * Negative counts indicate a setCount operation with ~counts[i]. */ private final Comparator<? super E> comparator;
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)