- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 125 for Every (0.17 sec)
-
android/guava/src/com/google/common/hash/HashFunction.java
* stateless, and therefore thread-safe. * <li><b>collision-averse:</b> while it can't be helped that a hash function will sometimes * produce the same hash code for distinct inputs (a "collision"), every hash function strives * to <i>some</i> degree to make this unlikely. (Without this condition, a function that * always returns zero could be called a hash function. It is not.) * </ul> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 25 18:22:59 GMT 2021 - 10.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/GeneratedMonitorTest.java
// launched by this test is either: // // (a) Blocked attempting to enter the monitor. // (b) Waiting for the single guard to become satisfied. // (c) Occupying the monitor and awaiting the tearDownLatch. // // Except for (c), every thread should occupy the monitor very briefly, and every thread leaves
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 17 14:48:57 GMT 2023 - 26.1K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/UnmodifiableCollectionTests.java
} // Test #entries() assertCollectionIsUnmodifiable(multimap.entries(), Maps.immutableEntry(sampleKey, sampleValue)); assertMultimapRemainsUnmodified(multimap, originalEntries); // Iterate over every element in the entry set for (Entry<K, V> entry : multimap.entries()) { assertMapEntryIsUnmodifiable(entry); } assertMultimapRemainsUnmodified(multimap, originalEntries); // Test #keys()
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 14.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* * <p>The behavior of this method is undefined if the nodes, or the topology of the graph, change * while iteration is in progress. * * <p>The returned {@code Iterable} can be iterated over multiple times. Every iterator will * compute its next element on the fly. It is thus possible to limit the traversal to a certain * number of nodes as follows: * * <pre>{@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
public ReentrantLock newReentrantLock(E rank, boolean fair) { return policy == Policies.DISABLED ? new ReentrantLock(fair) // requireNonNull is safe because createNodes inserts an entry for every E. // (If the caller passes `null` for the `rank` parameter, this will throw, but that's OK.) : new CycleDetectingReentrantLock(requireNonNull(lockGraphNodes.get(rank)), fair); }
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) -
android/guava/src/com/google/common/primitives/UnsignedInts.java
* * @param array a <i>nonempty</i> array of unsigned {@code int} values * @return the value present in {@code array} that is less than or equal to every other value in * the array according to {@link #compare} * @throws IllegalArgumentException if {@code array} is empty */ public static int min(int... array) { checkArgument(array.length > 0);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 13.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ArrayTable.java
* it requires that the complete universe of rows and columns be specified at construction time. * Second, it is always backed by an array large enough to hold a value for every possible * combination of row and column keys. (This is rarely optimal unless the table is extremely dense.) * Finally, every possible combination of row and column keys is always considered to have a value
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 26.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
* spread over each second. When the incoming request rate exceeds {@code permitsPerSecond} the * rate limiter will release one permit every {@code (1.0 / permitsPerSecond)} seconds. When the * rate limiter is unused, bursts of up to {@code permitsPerSecond} permits will be allowed, with
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 18.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
* Returns the least value present in {@code array}, treating values as unsigned. * * @param array a <i>nonempty</i> array of {@code byte} values * @return the value present in {@code array} that is less than or equal to every other value in * the array according to {@link #compare} * @throws IllegalArgumentException if {@code array} is empty */ public static byte min(byte... array) { checkArgument(array.length > 0);
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-tests/test/com/google/common/cache/EmptyCachesTest.java
checkEmpty(entrySet); checkEmpty(cache); } } /* ---------------- Local utilities -------------- */ /** Most of the tests in this class run against every one of these caches. */ private Iterable<LoadingCache<Object, Object>> caches() { // lots of different ways to configure a LoadingCache CacheBuilderFactory factory = cacheFactory(); return Iterables.transform(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 11.5K bytes - Viewed (0)