- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 234 for torrent (0.16 sec)
-
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
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) -
guava/src/com/google/common/cache/CacheBuilderSpec.java
checkArgument( keyAndValue.size() <= 2, "key-value pair %s with more than one equals sign", keyValuePair); // Find the ValueParser for the current key. String key = keyAndValue.get(0); ValueParser valueParser = VALUE_PARSERS.get(key); checkArgument(valueParser != null, "unknown key %s", key);
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Aug 22 14:27:44 GMT 2022 - 18.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
private final Iterator<Entry<E>> entryIterator; @CheckForNull private Entry<E> currentEntry; /** Count of subsequent elements equal to current element */ private int laterCount; /** Count of all elements equal to current element */ private int totalCount; private boolean canRemove; MultisetIteratorImpl(Multiset<E> multiset, Iterator<Entry<E>> entryIterator) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 41.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMultiset.java
/** * A {@link Multiset} whose contents will never change, with many other important properties * detailed at {@link ImmutableCollection}. * * <p><b>Grouped iteration.</b> In all current implementations, duplicate elements always appear * consecutively when iterating. Elements iterate in order by the <i>first</i> appearance of that * element when the multiset was created. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 20.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
limiter.acquire(); } assertEvents("R0.00", "R1.00", "R1.00", "R1.00", "R1.00"); } /** * Make sure that bursts can never go above 1-second-worth-of-work for the current rate, even when * we change the rate. */ public void testWeNeverGetABurstMoreThanOneSec() { RateLimiter limiter = RateLimiter.create(1.0, stopwatch); int[] rates = {1000, 1, 10, 1000000, 10, 1};
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/TypeResolver.java
* other type variables, in which case these type variables will be further resolved if * corresponding mappings exist in the current {@code TypeResolver} instance. */ public TypeResolver where(Type formal, Type actual) { Map<TypeVariableKey, Type> mappings = Maps.newHashMap();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 24.2K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/FreshValueGenerator.java
T proxy = newProxy(interfaceType); freshness.incrementAndGet(); return proxy; } /** * Generates an instance for {@code type} using the current {@link #freshness}. The generated * instance may or may not be unique across different calls. */ private @Nullable Object generate(TypeToken<?> type) { Class<?> rawType = type.getRawType();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 28K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* * <p><b>Warning:</b> a new random seed for these functions is chosen each time the {@code * Hashing} class is loaded. <b>Do not use this method</b> if hash codes may escape the current * process in any way, for example being sent over RPC, or saved to disk. For a general-purpose, * non-cryptographic hash function that will never change behavior, we suggest {@link * #murmur3_128}. *
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) -
guava-tests/test/com/google/common/collect/SetsTest.java
new EqualsTester().addEqualityGroup(forward, reverse).testEquals(); } /** * Test that a hash code miscomputed by "input.hashCode() * tooFarValue / 2" is correct under our * {@code hashCode} implementation. */ public void testPowerSetHashCode_inputHashCodeTimesTooFarValueIsZero() { Set<Object> sumToEighthMaxIntElements =
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 49.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
* <p>Iterators returned by the returned iterable do not support the {@link Iterator#remove()} * method. The returned lists implement {@link RandomAccess}, whether or not the input list does. * * <p><b>Note:</b> The current implementation eagerly allocates storage for {@code size} elements. * As a consequence, passing values like {@code Integer.MAX_VALUE} can lead to {@link * OutOfMemoryError}. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0)