- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for predictable (0.21 sec)
-
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-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/util/concurrent/InterruptibleTask.java
* interrupting thread. In theory, interruptTask() should be very fast, but due to * InterruptibleChannel and JavaLangAccess.blockedOn(Thread, Interruptible), it isn't * predictable what work might be done. (e.g., close a file and flush buffers to disk). To * protect ourselves from this, we park ourselves and tell our interrupter that we did so. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Sep 29 21:34:48 GMT 2023 - 9.9K 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) -
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-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) -
android/guava/src/com/google/common/math/Quantiles.java
* randomly ordered data (the probability decreases faster than exponentially in N), but if you are * passing in unsanitized user data then a malicious user could force it. A light shuffle of the * data using an unpredictable seed should normally be enough to thwart this attack. * * <p>The time taken to compute multiple quantiles on the same dataset using {@link Scale#indexes
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) -
guava-tests/benchmark/com/google/common/io/CharStreamsCopyBenchmark.java
String data; @BeforeExperiment public void setUp() { // precalculate some random strings of ascii characters. StringBuilder sb = new StringBuilder(); Random random = new Random(0xdeadbeef); // for unpredictable but reproducible behavior sb.ensureCapacity(size); for (int k = 0; k < size; k++) { // [9-127) includes all ascii non-control characters sb.append((char) (random.nextInt(127 - 9) + 9)); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 23 18:59:54 GMT 2023 - 3.2K bytes - Viewed (0)