- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 51 for SHUFFLE (0.1 sec)
-
src/crypto/sha256/sha256block_amd64.s
VMOVDQU state1, (1*16)(digestPtr) done: RET // shuffle byte order from LE to BE DATA flip_mask<>+0x00(SB)/8, $0x0405060700010203 DATA flip_mask<>+0x08(SB)/8, $0x0c0d0e0f08090a0b DATA flip_mask<>+0x10(SB)/8, $0x0405060700010203 DATA flip_mask<>+0x18(SB)/8, $0x0c0d0e0f08090a0b GLOBL flip_mask<>(SB), 8, $32 // shuffle xBxA -> 00BA DATA shuff_00BA<>+0x00(SB)/8, $0x0b0a090803020100
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 47.3K 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
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 16K bytes - Viewed (0) -
src/sort/sort_test.go
sizes := []int{100, 1023, 1024, 1025} if testing.Short() { sizes = []int{100, 127, 128, 129} } dists := []string{"sawtooth", "rand", "stagger", "plateau", "shuffle"} modes := []string{"copy", "reverse", "reverse1", "reverse2", "sort", "dither"} var tmp1, tmp2 [1025]int for _, n := range sizes { for m := 1; m < 2*n; m *= 2 { for dist := 0; dist < _NDist; dist++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 19:41:04 UTC 2024 - 16.9K 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")
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 17:15:24 UTC 2024 - 29.4K bytes - Viewed (0) -
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")
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 17:15:24 UTC 2024 - 29.4K bytes - Viewed (0) -
pkg/apis/flowcontrol/validation/validation.go
if queuing.QueueLengthLimit <= 0 { allErrs = append(allErrs, field.Invalid(fldPath.Child("queueLengthLimit"), queuing.QueueLengthLimit, "must be positive")) } // validate input arguments for shuffle-sharding if queuing.Queues <= 0 { allErrs = append(allErrs, field.Invalid(fldPath.Child("queues"), queuing.Queues, "must be positive")) } else if queuing.Queues > priorityLevelConfigurationQueuingMaxQueues {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Oct 30 22:22:51 UTC 2023 - 26.7K 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 {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sun Jan 02 17:15:06 UTC 2022 - 31.6K 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
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
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.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Jun 07 22:18:44 UTC 2024 - 30.4K bytes - Viewed (0) -
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
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0)