- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 41 for Shuffle (0.21 sec)
-
android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
for (int attempts = 0; attempts < reduceIterationsIfGwt(1000); attempts++) { ArrayList<Integer> elements = createOrderedList(10); Collections.shuffle(elements, random); MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create(elements); Collections.shuffle(elements, random); for (Integer element : elements) { assertThat(queue.remove(element)).isTrue(); assertIntact(queue);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesTest.java
indexes.add(index); expectedBuilder.put(index, expectedLargeDatasetPercentile(index)); } Random random = new Random(770683168895677741L); Collections.shuffle(indexes, random); assertThat(percentiles().indexes(Ints.toArray(indexes)).compute(PSEUDORANDOM_DATASET)) .comparingValuesUsing(QUANTILE_CORRESPONDENCE) .containsExactlyEntriesIn(expectedBuilder.buildOrThrow());
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 29.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesTest.java
indexes.add(index); expectedBuilder.put(index, expectedLargeDatasetPercentile(index)); } Random random = new Random(770683168895677741L); Collections.shuffle(indexes, random); assertThat(percentiles().indexes(Ints.toArray(indexes)).compute(PSEUDORANDOM_DATASET)) .comparingValuesUsing(QUANTILE_CORRESPONDENCE) .containsExactlyEntriesIn(expectedBuilder.buildOrThrow());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 29.7K bytes - Viewed (0) -
cmd/global-heal.go
if len(disks) < er.setDriveCount/2 { return fmt.Errorf("not enough drives (found=%d, healing=%d, total=%d) are available to heal `%s`", len(disks), healing, er.setDriveCount, tracker.disk.String()) } rand.Shuffle(len(disks), func(i, j int) { disks[i], disks[j] = disks[j], disks[i] }) expectedDisks := len(disks)/2 + 1 fallbackDisks := disks[expectedDisks:] disks = disks[:expectedDisks]
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 26 06:32:14 GMT 2024 - 15K bytes - Viewed (1) -
guava-tests/benchmark/com/google/common/base/EnumsBenchmark.java
misses.add("INVALID"); } List<String> sampleDataList = new ArrayList<>(); sampleDataList.addAll(hits); sampleDataList.addAll(misses); Collections.shuffle(sampleDataList); sampleData = sampleDataList.toArray(new String[sampleDataList.size()]); } // Since we can't pass a concrete SomeEnum.class directly, we need to use a raw type. @SuppressWarnings("unchecked")
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 29.4K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/EnumsBenchmark.java
misses.add("INVALID"); } List<String> sampleDataList = new ArrayList<>(); sampleDataList.addAll(hits); sampleDataList.addAll(misses); Collections.shuffle(sampleDataList); sampleData = sampleDataList.toArray(new String[sampleDataList.size()]); } // Since we can't pass a concrete SomeEnum.class directly, we need to use a raw type. @SuppressWarnings("unchecked")
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 29.4K bytes - Viewed (0) -
cmd/erasure.go
NextCycle: oldCache.Info.NextCycle, }, Cache: make(map[string]dataUsageEntry, len(oldCache.Cache)), } // Put all buckets into channel. bucketCh := make(chan BucketInfo, len(buckets)) // Shuffle buckets to ensure total randomness of buckets, being scanned. // Otherwise same set of buckets get scanned across erasure sets always. // at any given point in time. This allows different buckets to be scanned
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 26 06:32:14 GMT 2024 - 16K bytes - Viewed (1) -
cmd/metacache-set.go
askDisks = len(disks) // use all available drives } // However many we ask, versions must exist on ~50% listingQuorum := (askDisks + 1) / 2 if askDisks > 0 && len(disks) > askDisks { rand.Shuffle(len(disks), func(i, j int) { disks[i], disks[j] = disks[j], disks[i] }) fallbackDisks = disks[askDisks:] disks = disks[:askDisks] } // How to resolve results.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed May 01 17:59:08 GMT 2024 - 30.4K 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) -
cmd/metacache-entries_test.go
// Run for a number of times, shuffling the input to ensure that output is consistent. for i := 0; i < 10; i++ { t.Run(fmt.Sprintf("test-%d-%s-run-%d", testID, tt.name, i), func(t *testing.T) { if i > 0 { rng.Shuffle(len(tt.m), func(i, j int) { tt.m[i], tt.m[j] = tt.m[j], tt.m[i] }) } gotSelected, gotOk := tt.m.resolve(&tt.r) if gotOk != tt.wantOk {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Jan 02 17:15:06 GMT 2022 - 31.6K bytes - Viewed (0)