- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for manveru (0.8 sec)
-
guava/src/com/google/common/hash/Hashing.java
*/ public static HashFunction fingerprint2011() { return Fingerprint2011.FINGERPRINT_2011; } /** * Assigns to {@code hashCode} a "bucket" in the range {@code [0, buckets)}, in a uniform manner * that minimizes the need for remapping as {@code buckets} grows. That is, {@code * consistentHash(h, n)} equals: * * <ul> * <li>{@code n - 1}, with approximate probability {@code 1/n}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 09 00:37:15 UTC 2024 - 32.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/JSR166TestCase.java
/** Waits out termination of a thread pool or fails doing so. */ void joinPool(ExecutorService exec) { try { exec.shutdown(); assertTrue( "ExecutorService did not terminate in a timely manner", exec.awaitTermination(2 * LONG_DELAY_MS, MILLISECONDS)); } catch (SecurityException ok) { // Allowed in case test doesn't have privs } catch (InterruptedException ie) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jun 10 19:21:11 UTC 2024 - 37.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/MapMakerInternalMap.java
final int concurrencyLevel; /** Strategy for comparing keys. */ final Equivalence<Object> keyEquivalence; /** Strategy for handling entries and segments in a type-safe and efficient manner. */ final transient InternalEntryHelper<K, V, E, S> entryHelper; /** * Creates a new, empty map with the specified strategy, initial capacity and concurrency level. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/Ordering.java
* Returns a new ordering on {@code F} which orders elements by first applying a function to them, * then comparing those results using {@code this}. For example, to compare objects by their * string forms, in a case-insensitive manner, use: * * <pre>{@code * Ordering.from(String.CASE_INSENSITIVE_ORDER) * .onResultOf(Functions.toStringFunction()) * }</pre> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixPatterns.java
* determining whether a given domain name is an effective top-level domain (public suffix). * * <p>Because this class is used in GWT, the data members are stored in a space-efficient manner. * See {@link TrieParser}. * * @since 16.0 */ @GwtCompatible @Beta public final class PublicSuffixPatterns { private PublicSuffixPatterns() {}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Mar 21 21:04:43 UTC 2024 - 72.4K bytes - Viewed (0) -
guava/src/com/google/thirdparty/publicsuffix/PublicSuffixPatterns.java
* determining whether a given domain name is an effective top-level domain (public suffix). * * <p>Because this class is used in GWT, the data members are stored in a space-efficient manner. * See {@link TrieParser}. * * @since 16.0 */ @GwtCompatible @Beta public final class PublicSuffixPatterns { private PublicSuffixPatterns() {}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Mar 21 21:04:43 UTC 2024 - 72.4K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/LittleEndianByteArray.java
/** The instance that actually does the work; delegates to Unsafe or a pure-Java fallback. */ private static final LittleEndianBytes byteArray; /** * Load 8 bytes into long in a little endian manner, from the substring between position and * position + 8. The array must have at least 8 bytes from offset (inclusive). * * @param input the input bytes * @param offset the offset into the array at which to start
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 9.7K bytes - Viewed (0) -
guava/src/com/google/common/base/Equivalence.java
import org.checkerframework.checker.nullness.qual.Nullable; /** * A strategy for determining whether two instances are considered equivalent, and for computing * hash codes in a manner consistent with that equivalence. Two examples of equivalences are the * {@linkplain #identity() identity equivalence} and the {@linkplain #equals "equals" equivalence}. * * @author Bob Lee * @author Ben Yu
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 14.1K bytes - Viewed (0) -
guava/src/com/google/common/hash/LittleEndianByteArray.java
/** The instance that actually does the work; delegates to Unsafe or a pure-Java fallback. */ private static final LittleEndianBytes byteArray; /** * Load 8 bytes into long in a little endian manner, from the substring between position and * position + 8. The array must have at least 8 bytes from offset (inclusive). * * @param input the input bytes * @param offset the offset into the array at which to start
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 9.8K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
*/ public static HashFunction fingerprint2011() { return Fingerprint2011.FINGERPRINT_2011; } /** * Assigns to {@code hashCode} a "bucket" in the range {@code [0, buckets)}, in a uniform manner * that minimizes the need for remapping as {@code buckets} grows. That is, {@code * consistentHash(h, n)} equals: * * <ul> * <li>{@code n - 1}, with approximate probability {@code 1/n}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 09 00:37:15 UTC 2024 - 29.2K bytes - Viewed (0)