- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 119 for leash (0.16 sec)
-
guava-tests/test/com/google/common/primitives/UnsignedIntsTest.java
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 16:10:08 GMT 2024 - 12.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/ShortsTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 26.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/FloatsTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 29.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
@Beta // TODO: b/288085449 - Remove. public static <T extends @Nullable Object> Collector<T, ?, List<T>> least( int k, Comparator<? super T> comparator) { checkNonnegative(k, "k"); checkNotNull(comparator); return Collector.of( () -> TopKSelector.<T>least(k, comparator), TopKSelector::offer, TopKSelector::combine, TopKSelector::topK,
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/Multimap.java
*/ boolean isEmpty(); /** * Returns {@code true} if this multimap contains at least one key-value pair with the key {@code * key}. */ boolean containsKey(@CompatibleWith("K") @CheckForNull Object key); /** * Returns {@code true} if this multimap contains at least one key-value pair with the value * {@code value}. */
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/base/Ascii.java
/** * File Separator: These four information separators may be used within data in optional fashion, * except that their hierarchical relationship shall be: FS is the most inclusive, then GS, then * RS, and US is least inclusive. (The content and length of a File, Group, Record, or Unit are * not specified.) * * @since 8.0 */ public static final byte FS = 28; /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jul 19 15:43:07 GMT 2021 - 21.6K 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()} */
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) -
guava/src/com/google/common/base/Strings.java
*/ public static boolean isNullOrEmpty(@CheckForNull String string) { return Platform.stringIsNullOrEmpty(string); } /** * Returns a string, of length at least {@code minLength}, consisting of {@code string} prepended * with as many copies of {@code padChar} as are necessary to reach that length. For example, * * <ul>
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Sep 17 20:47:03 GMT 2021 - 12.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
// If we are looking for the least element in the range, we can just do a linear search for it. // (We will hit this whenever we are doing quantile interpolation: our first selection finds // the lower value, our second one finds the upper value by looking for the next least element.) if (required == from) { int min = from;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* have the same bit length */ public static HashCode combineOrdered(Iterable<HashCode> hashCodes) { Iterator<HashCode> iterator = hashCodes.iterator(); checkArgument(iterator.hasNext(), "Must be at least 1 hash code to combine."); int bits = iterator.next().bits(); byte[] resultBytes = new byte[bits / 8]; for (HashCode hashCode : hashCodes) { byte[] nextBytes = hashCode.asBytes(); checkArgument(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0)