- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for predictable (0.22 sec)
-
android/guava-testlib/src/com/google/common/collect/testing/features/CollectionSize.java
this.numElements = numElements; } CollectionSize(Feature<? super Collection>... implied) { // Keep the order here, so that PerCollectionSizeTestSuiteBuilder // gives a predictable order of test suites. this.implied = Helpers.copyToSet(implied); this.numElements = null; } @Override public Set<Feature<? super Collection>> getImpliedFeatures() { return implied; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 3.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultiset.java
*/ package com.google.common.collect; import com.google.common.annotations.GwtCompatible; import org.checkerframework.checker.nullness.qual.Nullable; /** * A {@code Multiset} implementation with predictable iteration order. Its iterator orders elements * according to when the first occurrence of the element was added. When the multiset contains
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 3K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/features/CollectionSize.java
this.numElements = numElements; } CollectionSize(Feature<? super Collection>... implied) { // Keep the order here, so that PerCollectionSizeTestSuiteBuilder // gives a predictable order of test suites. this.implied = Helpers.copyToSet(implied); this.numElements = null; } @Override public Set<Feature<? super Collection>> getImpliedFeatures() { return implied; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 3.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
import java.util.Collections; import java.util.Set; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * CompactLinkedHashSet is an implementation of a Set, which a predictable iteration order that * matches the insertion order. All optional operations (adding and removing) are supported. All * elements, including {@code null}, are permitted. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
import java.util.Spliterators; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * CompactLinkedHashSet is an implementation of a Set, which a predictable iteration order that * matches the insertion order. All optional operations (adding and removing) are supported. All * elements, including {@code null}, are permitted. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/internal/connection/FastFallbackExchangeFinderTest.kt
* * This test uses [TaskFaker] to deterministically test racy code. Each function in this test has * the same structure: * * * prepare a set of plans, each with a predictable connect delay * * attempt to find a connection * * step through time, asserting that the expected side effects are performed. */ internal class FastFallbackExchangeFinderTest { private val taskFaker = TaskFaker()
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Wed Apr 24 04:40:49 GMT 2024 - 20.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/OrderingTest.java
@Override int identityHashCode(Object object) { return ((Integer) object) % 5; // fake tons of collisions! } }; // Don't let the elements be in such a predictable order list = shuffledCopy(list, new Random(1)); Collections.sort(list, arbitrary); // Now we don't care what order it's put the list in, only that
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/OrderingTest.java
@Override int identityHashCode(Object object) { return ((Integer) object) % 5; // fake tons of collisions! } }; // Don't let the elements be in such a predictable order list = shuffledCopy(list, new Random(1)); Collections.sort(list, arbitrary); // Now we don't care what order it's put the list in, only that
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
cmd/object-multipart-handlers.go
s2c, cb := newS2CompressReader(actualReader, actualSize, wantEncryption) idxCb = cb defer s2c.Close() reader = etag.Wrap(s2c, actualReader) size = -1 // Since compressed size is un-predictable. md5hex = "" // Do not try to verify the content. sha256hex = "" } var forceMD5 []byte // Optimization: If SSE-KMS and SSE-C did not request Content-Md5. Use uuid as etag. Optionally enable this also
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Mar 28 17:44:56 GMT 2024 - 39K bytes - Viewed (0) -
cmd/object-handlers.go
s2c, idxCb = newS2CompressReader(actualReader, actualSize, wantEncryption) defer s2c.Close() reader = etag.Wrap(s2c, actualReader) size = -1 // Since compressed size is un-predictable. md5hex = "" // Do not try to verify the content. sha256hex = "" } var forceMD5 []byte // Optimization: If SSE-KMS and SSE-C did not request Content-Md5. Use uuid as etag. Optionally enable this also
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Mon Apr 22 17:49:30 GMT 2024 - 125K bytes - Viewed (0)