- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 32 for describe (0.17 sec)
-
android/guava/src/com/google/common/base/Throwables.java
? jlaStackTrace(throwable) : unmodifiableList(asList(throwable.getStackTrace())); } /** * Returns whether {@link #lazyStackTrace} will use the special implementation described in its * documentation. * * @since 19.0 * @deprecated This method always returns false on JDK versions past JDK 8 and on all Android * versions. */ @Deprecated @J2ktIncompatible
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* * (The index actually stored is the index of the key in alternatingKeysAndValues, which is * double the index of the entry in entrySet.asList.) * * The basic data structure is described in https://en.wikipedia.org/wiki/Open_addressing. * The pointer to a key is stored in hashTable[Hashing.smear(key.hashCode()) % table.length],
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultimap.java
* order described in the <a href="#iteration">class documentation</a>. */ public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1, K k2, V v2, K k3, V v3) { return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3); } /** * Returns an immutable multimap containing the given entries, in the "key-grouped" insertion * order described in the <a href="#iteration">class documentation</a>.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 24.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMultimap.java
* order described in the <a href="#iteration">class documentation</a>. */ public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1, K k2, V v2, K k3, V v3) { return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3); } /** * Returns an immutable multimap containing the given entries, in the "key-grouped" insertion * order described in the <a href="#iteration">class documentation</a>.
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 25.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
/** * Returns a {@link Collection} of all the permutations of the specified {@link Iterable}. * * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
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) -
android/guava/src/com/google/common/collect/RangeMap.java
* value that are {@linkplain Range#isConnected connected} to this range. * * <p>The behavior of {@link #get(Comparable) get(k)} after calling this method is identical to * the behavior described in {@link #put(Range, Object) put(range, value)}, however the ranges * returned from {@link #asMapOfRanges} will be different if there were existing entries which * connect to the given range and value. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/DiscreteDomain.java
* and {@code distance(end, start) == -3}. As well, {@code distance(a, a)} is always zero. * * <p>Note that this function is necessarily well-defined for any discrete type. * * @return the distance as described above, or {@link Long#MIN_VALUE} or {@link Long#MAX_VALUE} if * the distance is too small or too large, respectively. */ public abstract long distance(C start, C end); /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
} /** * Tries to move {@code toTrickle} from a min to a max level and bubble up there. If it moved * before {@code removeIndex} this method returns a pair as described in {@link #removeAt}. */ @CheckForNull MoveDesc<E> tryCrossOverAndBubbleUp(int removeIndex, int vacated, E toTrickle) { int crossOver = crossOver(vacated, toTrickle); if (crossOver == vacated) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractTransformFuture.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 10.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ListsImplTest.java
/** Tests the package level *impl methods directly using various types of lists. */ @GwtCompatible(emulated = true) @ElementTypesAreNonnullByDefault public class ListsImplTest extends TestCase { /** Describes how a list is modifiable */ public enum Modifiability { NONE, // immutable lists BY_ELEMENT, // elements can change (set), but not structure
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 16:35:21 GMT 2024 - 10.6K bytes - Viewed (0)