- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 691 for Code (0.24 sec)
-
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* all "null" (UNSET). * * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list, * and a node with "next" pointer equal to {@code ENDPOINT} is the last node. */ @CheckForNull @VisibleForTesting transient long[] links; /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */ private transient int firstEntry;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
} throw new AssertionError(); } /** * Returns the result of dividing {@code p} by {@code q}, rounding using the specified {@code * RoundingMode}. * * @throws ArithmeticException if {@code q == 0}, or if {@code mode == UNNECESSARY} and {@code a} * is not an integer multiple of {@code b} */ @GwtIncompatible // TODO @SuppressWarnings("fallthrough")
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
/** * Checks the acquisition-ordering between {@code this}, which is about to be acquired, and the * specified {@code acquiredLock}. * * <p>When this method returns, the {@code acquiredLock} should be in either the {@code * preAcquireLocks} map, for the case in which it is safe to acquire {@code this} after the * {@code acquiredLock}, or in the {@code disallowedPriorLocks} map, in which case it is not * safe.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* matches the insertion order. All optional operations (adding and removing) are supported. All * elements, including {@code null}, are permitted. * * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized) * constant time operations. Expected in the hashtable sense (depends on the hash function doing a
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedListMultimap.java
*/ private void removeNode(Node<K, V> node) { if (node.previous != null) { node.previous.next = node.next; } else { // node was head head = node.next; } if (node.next != null) { node.next.previous = node.previous; } else { // node was tail tail = node.previous; } if (node.previousSibling == null && node.nextSibling == null) { /*
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 27.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
* 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 * remove()} is called, subsequent cycles omit the removed element, which is no longer in {@code * iterable}. The iterator's {@code hasNext()} method returns {@code true} until {@code iterable} * is empty. *
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) -
android/guava/src/com/google/common/collect/Multimap.java
* <i>implemented</i>, the design of the {@code Multimap} API is based on the <i>second</i> form. * So, using the multimap shown above as an example, the {@link #size} is {@code 3}, not {@code 2}, * and the {@link #values} collection is {@code [1, 2, 3]}, not {@code [[1, 2], [3]]}. For those * times when the first style is more useful, use the multimap's {@link #asMap} view (or create a * {@code Map<K, Collection<V>>} in the first place). *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 15.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
} /** * Constructs an {@code ImmutableSortedSet} from the first {@code n} elements of {@code contents}. * If {@code k} is the size of the returned {@code ImmutableSortedSet}, then the sorted unique * elements are in the first {@code k} positions of {@code contents}, and {@code contents[i] == * null} for {@code k <= i < n}. * * <p>This method takes ownership of {@code contents}; do not modify {@code contents} after this
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) -
guava/src/com/google/common/collect/DiscreteDomain.java
return current; } /** * Returns the unique least value of type {@code C} that is greater than {@code value}, or {@code * null} if none exists. Inverse operation to {@link #previous}. * * @param value any value of type {@code C} * @return the least value greater than {@code value}, or {@code null} if {@code value} is {@code * maxValue()} */ @CheckForNull public abstract C next(C value);
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Joiner.java
* Multimap} entries in two distinct modes: * * <ul> * <li>To output a separate entry for each key-value pair, pass {@code multimap.entries()} to a * {@code MapJoiner} method that accepts entries as input, and receive output of the form * {@code key1=A&key1=B&key2=C}. * <li>To output a single entry for each key, pass {@code multimap.asMap()} to a {@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 18.6K bytes - Viewed (0)