- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 130 for leash (0.27 sec)
-
android/guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 13.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/ServiceManagerTest.java
assertThat(startupTimes).hasSize(2); assertThat(startupTimes.get(a)).isAtLeast(150); // Service b startup takes at least 353 millis, but starting the timer is delayed by at least // 150 milliseconds. so in a perfect world the timing would be 353-150=203ms, but since either // of our sleep calls can be arbitrarily delayed we should just assert that there is a time
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 02 17:20:27 GMT 2023 - 23.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
} } /** * Removes and returns the least element of this queue, or returns {@code null} if the queue is * empty. */ @CanIgnoreReturnValue @CheckForNull public E pollFirst() { return poll(); } /** * Removes and returns the least element of this queue. * * @throws NoSuchElementException if the queue is empty */
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/primitives/UnsignedBytes.java
* corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get * that least significant nonzero byte. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 18.3K bytes - Viewed (0) -
android/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()} */
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/Multiset.java
* * @param element the element to check for * @return {@code true} if this multiset contains at least one occurrence of the element */ @Override boolean contains(@CheckForNull Object element); /** * Returns {@code true} if this multiset contains at least one occurrence of each element in the * specified collection. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 19.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFuture.java
* setFuture called on it: Neither of those can happen until we've finished processing all * the completed inputs. And we're still processing at least one input, the one that * triggered handleException.) * * TODO(cpovirk): Think about whether we could/should use Verify to check the return value of * addCausalChain. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 15.4K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Bytes.java
* Returns the index of the first appearance of the value {@code target} in {@code array}. * * @param array an array of {@code byte} values, possibly empty * @param target a primitive {@code byte} value * @return the least index {@code i} for which {@code array[i] == target}, or {@code -1} if no * such index exists. */ public static int indexOf(byte[] array, byte target) { return indexOf(array, target, 0, array.length); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 14.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.java
* that this always returns {@code -1} when {@code target} is {@code NaN}. * * @param array an array of {@code float} values, possibly empty * @param target a primitive {@code float} value * @return the least index {@code i} for which {@code array[i] == target}, or {@code -1} if no * such index exists. */ public static int indexOf(float[] array, float target) { return indexOf(array, target, 0, array.length);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 25.2K bytes - Viewed (0) -
android/guava/src/com/google/common/net/InetAddresses.java
&& ipString.charAt(ipString.length() - 2) != IPV6_DELIMITER) { return null; // :$ requires ::$ } if (hasSkip && partsSkipped <= 0) { return null; // :: must expand to at least one '0' } if (!hasSkip && delimiterCount + 1 != IPV6_PART_COUNT) { return null; // Incorrect number of parts } ByteBuffer rawBytes = ByteBuffer.allocate(2 * IPV6_PART_COUNT); try {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 44K bytes - Viewed (1)