- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 62 for Dover (0.16 sec)
-
android/guava/src/com/google/common/collect/ImmutableBiMap.java
* convenient. * * <p>By default, a {@code Builder} will generate bimaps that iterate over entries in the order * 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
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) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
* specified is included. To create a copy of a {@code SortedSet} that preserves the comparator, * call {@link #copyOfSorted} instead. This method iterates over {@code elements} at most once. * * <p>Note that if {@code s} is a {@code Set<String>}, then {@code ImmutableSortedSet.copyOf(s)} * returns an {@code ImmutableSortedSet<String>} containing each of the strings in {@code s},
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 38.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
} /** * Returns an unmodifiable <b>view</b> of the union of two sets. The returned set contains all * elements that are contained in either backing set. Iterating over the returned set iterates * first over all the elements of {@code set1}, then over each element of {@code set2}, in order, * that is not contained in {@code set1}. * * <p>Results are undefined if {@code set1} and {@code set2} are sets based on different
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/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/Collections2.java
return fromCollection.size(); } } /** * Returns {@code true} if the collection {@code self} contains all of the elements in the * collection {@code c}. * * <p>This method iterates over the specified collection {@code c}, checking each element returned * by the iterator in turn to see if it is contained in the specified collection {@code self}. If
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/OrderingTest.java
; abstract <T extends @Nullable Object> Scenario<?> mutate(Scenario<T> scenario); } /** * A dummy object we create so that we can have something meaningful to have a compound ordering * over. */ private static class Composite<T extends @Nullable Object> implements Comparable<Composite<T>> { final T value; final int rank; Composite(T value, int rank) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/OrderingTest.java
; abstract <T extends @Nullable Object> Scenario<?> mutate(Scenario<T> scenario); } /** * A dummy object we create so that we can have something meaningful to have a compound ordering * over. */ private static class Composite<T extends @Nullable Object> implements Comparable<Composite<T>> { final T value; final int rank; Composite(T value, int rank) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
* reached, but not the other, the shorter iterable is considered to be less than the longer one. * For example, a lexicographical natural ordering over integers considers {@code [] < [1] < [1, * 1] < [1, 2] < [2]}. * * <p>Note that {@code Collections.reverseOrder(lexicographical(comparator))} is not equivalent to
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/Iterables.java
return ((Set<?>) iterable).contains(element) ? 1 : 0; } return Iterators.frequency(iterable.iterator(), element); } /** * Returns an iterable whose iterators cycle indefinitely over the elements of {@code iterable}. * * <p>That iterator supports {@code remove()} if {@code iterable.iterator()} does. After {@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0) -
guava/src/com/google/common/base/Throwables.java
throwable.printStackTrace(new PrintWriter(stringWriter)); return stringWriter.toString(); } /** * Returns the stack trace of {@code throwable}, possibly providing slower iteration over the full * trace but faster iteration over parts of the trace. Here, "slower" and "faster" are defined in * comparison to the normal way to access the stack trace, {@link Throwable#getStackTrace()
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0)