- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for Fortin (0.16 sec)
-
android/guava/src/com/google/common/collect/Sets.java
return standardToArray(array); } @Override public String toString() { return standardToString(); } } /** * Returns a view of the portion of {@code set} whose elements are contained by {@code range}. * * <p>This method delegates to the appropriate methods of {@link NavigableSet} (namely {@link
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/ImmutableMap.java
} localAlternatingKeysAndValues = alternatingKeysAndValues; if (!throwIfDuplicateKeys) { // We want to retain only the last-put value for any given key, before sorting. // This could be improved, but orderEntriesByValue is rather rarely used anyway. localAlternatingKeysAndValues = lastEntryForEachKey(localAlternatingKeysAndValues, 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/ImmutableList.java
? ImmutableList.<E>of() : ImmutableList.<E>construct(elements.clone()); } /** * Returns an immutable list containing the given elements, sorted according to their natural * order. The sorting algorithm used is stable, so elements that compare as equal will stay in the * order in which they appear in the input. * * <p>If your data has no duplicates, or you wish to deduplicate elements, use {@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 27.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Maps.java
int i = 0; for (E e : list) { builder.put(e, i++); } return builder.buildOrThrow(); } /** * Returns a view of the portion of {@code map} whose keys are contained by {@code range}. * * <p>This method delegates to the appropriate methods of {@link NavigableMap} (namely {@link
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 159.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
* from least to greatest. If there are fewer than {@code k} elements present, all will be * included. * * <p>The implementation does not necessarily use a <i>stable</i> sorting algorithm; when multiple * elements are equivalent, it is undefined which will come first. * * <p><b>Java 8+ users:</b> Use {@code Streams.stream(iterable).collect(Comparators.least(k, * thisComparator))} instead.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
} /** * An iterator that performs a lazy N-way merge, calculating the next value each time the iterator * is polled. This amortizes the sorting cost over the iteration and requires less memory than * sorting all elements at once. * * <p>Retrieving a single element takes approximately O(log(M)) time, where M is the number of
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)