- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 236 for rounds (0.1 sec)
-
staging/src/k8s.io/apiserver/pkg/storage/feature/feature_support_checker_test.go
expectedResult bool expectedError error } tests := []struct { testName string rounds []testCase }{ { testName: "Disabled - default disabled", rounds: []testCase{{expectedResult: false}}, }, { testName: "Enabled - supported versions bound", rounds: []testCase{ {endpointsVersion: []mockEndpointVersion{ {Version: "3.4.31", Endpoint: "localhost:2390"}},
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 10 11:56:42 UTC 2024 - 8.3K bytes - Viewed (0) -
src/crypto/aes/block.go
_ = src[15] // early bounds check s0 := byteorder.BeUint32(src[0:4]) s1 := byteorder.BeUint32(src[4:8]) s2 := byteorder.BeUint32(src[8:12]) s3 := byteorder.BeUint32(src[12:16]) // First round just XORs input with key. s0 ^= xk[0] s1 ^= xk[1] s2 ^= xk[2] s3 ^= xk[3] // Middle rounds shuffle using tables. // Number of rounds is set by length of expanded key.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 6.4K bytes - Viewed (0) -
src/crypto/aes/asm_ppc64x.s
MOVD key+24(FP), KEYP MOVD iv+32(FP), IVP MOVD enc+40(FP), ENC MOVD nr+48(FP), ROUNDS #ifdef NEEDS_ESPERM MOVD $·rcon(SB), R11 LVX (R11), ESPERM // Permute value for P8_ macros. #endif // Assume len > 0 && len % blockSize == 0. CMPW ENC, $0 P8_LXVB16X(IVP, R0, IVEC) CMPU ROUNDS, $10, CR1 CMPU ROUNDS, $12, CR2 // Only sizes 10/12/14 are supported.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 18:05:32 UTC 2024 - 18.6K bytes - Viewed (0) -
src/strconv/ctoa.go
// license that can be found in the LICENSE file. package strconv // FormatComplex converts the complex number c to a string of the // form (a+bi) where a and b are the real and imaginary parts, // formatted according to the format fmt and precision prec. // // The format fmt and precision prec have the same meaning as in [FormatFloat]. // It rounds the result assuming that the original was obtained from a complex
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:21:28 UTC 2024 - 1K bytes - Viewed (0) -
src/go/types/named_test.go
T.AddMethod(m) } // check method order if i == 0 { // first round: collect methods in given order methods = make([]string, T.NumMethods()) for j := range methods { methods[j] = T.Method(j).Name() } } else { // successive rounds: methods must appear in the same order if got := T.NumMethods(); got != len(methods) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 05 16:29:58 UTC 2024 - 3.9K bytes - Viewed (0) -
src/cmd/compile/internal/types2/named_test.go
T.AddMethod(m) } // check method order if i == 0 { // first round: collect methods in given order methods = make([]string, T.NumMethods()) for j := range methods { methods[j] = T.Method(j).Name() } } else { // successive rounds: methods must appear in the same order if got := T.NumMethods(); got != len(methods) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 16 21:06:56 UTC 2024 - 3.6K bytes - Viewed (0) -
src/crypto/internal/mlkem768/mlkem768_test.go
// FloatString rounds halves away from 0, and our result should always be positive, // so it should work as we expect. (There's no direct way to round a Rat.) rounded, err := strconv.ParseInt(precise.FloatString(0), 10, 64) if err != nil { panic(err) } // If we rounded up, `rounded` may be equal to 2ᵈ, so we perform a final reduction. return uint16(rounded % (1 << d)) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 06 15:27:18 UTC 2024 - 10.3K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/keccakf.go
// in the keccak reference code. var t, bc0, bc1, bc2, bc3, bc4, d0, d1, d2, d3, d4 uint64 for i := 0; i < 24; i += 4 { // Combines the 5 steps in each round into 2 steps. // Unrolls 4 rounds per loop and spreads some steps across rounds. // Round 1 bc0 = a[0] ^ a[5] ^ a[10] ^ a[15] ^ a[20] bc1 = a[1] ^ a[6] ^ a[11] ^ a[16] ^ a[21] bc2 = a[2] ^ a[7] ^ a[12] ^ a[17] ^ a[22]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 10 16:37:53 UTC 2024 - 10.3K bytes - Viewed (0) -
src/strconv/ftoa.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:21:28 UTC 2024 - 13.9K bytes - Viewed (0) -
src/crypto/des/block.go
// Row is determined by the 1st and 6th bit. // Column is the middle four bits. row := uint8(((i & 2) << 4) | i&1) col := uint8(j << 1) t := row | col // The rotation was performed in the feistel rounds, being factored out and now mixed into the feistelBox. f = (f << 1) | (f >> 31) feistelBox[s][t] = uint32(f) } } } } // permuteInitialBlock is equivalent to the permutation defined
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 6.5K bytes - Viewed (0)