- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 125 for shuffled (0.22 sec)
-
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]
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 31 14:48:50 UTC 2024 - 15.1K bytes - Viewed (0) -
staging/src/k8s.io/api/flowcontrol/v1beta2/types.go
Queues int32 `json:"queues" protobuf:"varint,1,opt,name=queues"` // `handSize` is a small positive number that configures the // shuffle sharding of requests into queues. When enqueuing a request // at this priority level the request's flow identifier (a string // pair) is hashed and the hash value is used to shuffle the list // of queues and deal a hand of the size specified here. The // request is put into one of the shortest queues in that hand.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Sep 17 09:27:57 UTC 2023 - 31.2K bytes - Viewed (0) -
tensorflow/cc/gradients/nn_grad_test.cc
// a reasonable amount apart T cur = 0; for (size_t i = 0; i < tensor->NumElements(); i++) { tensor_flat(i) = cur; cur += 5e-2; } // Fischer-Yates shuffle the array for (size_t i = tensor->NumElements() - 1; i >= 1; i--) { // j <- random integer 0 <= j <= i size_t j = random::New64() % (i + 1); // swap values at i, j T tmp = tensor_flat(i);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 22 20:45:22 UTC 2022 - 15K bytes - Viewed (0) -
staging/src/k8s.io/api/flowcontrol/v1beta1/types.go
Queues int32 `json:"queues" protobuf:"varint,1,opt,name=queues"` // `handSize` is a small positive number that configures the // shuffle sharding of requests into queues. When enqueuing a request // at this priority level the request's flow identifier (a string // pair) is hashed and the hash value is used to shuffle the list // of queues and deal a hand of the size specified here. The // request is put into one of the shortest queues in that hand.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Sep 17 09:27:57 UTC 2023 - 31.2K bytes - Viewed (0) -
api/go1.10.txt
pkg math, func RoundToEven(float64) float64 pkg math/big, const MaxBase = 62 pkg math/big, method (*Float) Sqrt(*Float) *Float pkg math/big, method (*Int) CmpAbs(*Int) int pkg math/rand, func Shuffle(int, func(int, int)) pkg math/rand, method (*Rand) Shuffle(int, func(int, int)) pkg net, method (*TCPListener) SyscallConn() (syscall.RawConn, error) pkg net, method (*UnixListener) SyscallConn() (syscall.RawConn, error)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 06 05:00:01 UTC 2018 - 30.1K bytes - Viewed (0) -
staging/src/k8s.io/api/flowcontrol/v1/types.go
Queues int32 `json:"queues" protobuf:"varint,1,opt,name=queues"` // `handSize` is a small positive number that configures the // shuffle sharding of requests into queues. When enqueuing a request // at this priority level the request's flow identifier (a string // pair) is hashed and the hash value is used to shuffle the list // of queues and deal a hand of the size specified here. The // request is put into one of the shortest queues in that hand.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 23 17:42:49 UTC 2024 - 31.1K 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) -
staging/src/k8s.io/api/flowcontrol/v1beta3/types.go
Queues int32 `json:"queues" protobuf:"varint,1,opt,name=queues"` // `handSize` is a small positive number that configures the // shuffle sharding of requests into queues. When enqueuing a request // at this priority level the request's flow identifier (a string // pair) is hashed and the hash value is used to shuffle the list // of queues and deal a hand of the size specified here. The // request is put into one of the shortest queues in that hand.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Oct 30 22:22:51 UTC 2023 - 31.9K bytes - Viewed (0) -
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) -
src/vendor/golang.org/x/crypto/chacha20/chacha_generic.go
const ( j0 uint32 = 0x61707865 // expa j1 uint32 = 0x3320646e // nd 3 j2 uint32 = 0x79622d32 // 2-by j3 uint32 = 0x6b206574 // te k ) const blockSize = 64 // quarterRound is the core of ChaCha20. It shuffles the bits of 4 state words. // It's executed 4 times for each of the 20 ChaCha20 rounds, operating on all 16 // words each round, in columnar or diagonal groups of 4 at a time.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 26 00:11:50 UTC 2022 - 13.9K bytes - Viewed (0)