- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 44 for welcome (6.72 sec)
-
android/guava/src/com/google/common/primitives/Chars.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Shorts.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 25.1K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Shorts.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 25.1K bytes - Viewed (0) -
android/guava/src/com/google/common/net/InternetDomainName.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 20:47:23 UTC 2024 - 28K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
if (parentIndex != 0) { /* * This is a guard for the case of the childless aunt node. Since the end of the array is * actually the middle of the heap, a smaller childless aunt node can become a child of x * when we bubble up alternate levels, violating the invariant. */ int grandparentIndex = getParentIndex(parentIndex); int auntIndex = getRightChildIndex(grandparentIndex);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 29.7K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/testers/CollectionIteratorTester.java
public void testIterator_removeAffectsBackingCollection() { int originalSize = collection.size(); Iterator<E> iterator = collection.iterator(); Object element = iterator.next(); // If it's an Entry, it may become invalid once it's removed from the Map. Copy it. if (element instanceof Entry) { Entry<?, ?> entry = (Entry<?, ?>) element; element = mapEntry(entry.getKey(), entry.getValue()); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 5.9K bytes - Viewed (0) -
guava/src/com/google/common/hash/Striped64.java
* colliding threads. Because search is random, and collisions * only become known via CAS failures, convergence can be slow, * and because threads are typically not bound to CPUS forever, * may not occur at all. However, despite these limitations, * observed contention rates are typically low in these cases. * * It is possible for a Cell to become unused when threads that * once hashed to it terminate, as well as in the case where
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/Monitor.java
* includes exceptional exits, so all control paths involving signalling must be protected by a * finally block. * * Further optimizations of this algorithm become increasingly subtle. A wait that terminates * without the guard being satisfied (due to timeout, but not interrupt) can then immediately exit
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Dec 04 18:22:01 UTC 2023 - 42.5K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Bytes.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 14.9K bytes - Viewed (0)