- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 2,740 for bkts (0.05 sec)
-
src/math/big/bits_test.go
var p Bits for _, x := range x { for _, y := range y { p = append(p, x+y) } } return p } func TestMulBits(t *testing.T) { for _, test := range []struct { x, y, want Bits }{ {nil, nil, nil}, {Bits{}, Bits{}, nil}, {Bits{0}, Bits{0}, Bits{0}}, {Bits{0}, Bits{1}, Bits{1}}, {Bits{1}, Bits{1, 2, 3}, Bits{2, 3, 4}}, {Bits{-1}, Bits{1}, Bits{0}},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 5.1K bytes - Viewed (0) -
cmd/storage-datatypes_gen.go
} bts, err = z.ReplicationState.UnmarshalMsg(bts) if err != nil { err = msgp.WrapError(err, "ReplicationState") return } if msgp.IsNil(bts) { bts = bts[1:] z.Data = nil } else { z.Data, bts, err = msgp.ReadBytesBytes(bts, z.Data) if err != nil { err = msgp.WrapError(err, "Data") return } } z.NumVersions, bts, err = msgp.ReadIntBytes(bts)
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 15:51:27 UTC 2024 - 130.6K bytes - Viewed (0) -
src/crypto/md5/md5block.go
d = a + bits.RotateLeft32((a^b^c)+d+x4+0x4bdecfa9, 11) c = d + bits.RotateLeft32((d^a^b)+c+x7+0xf6bb4b60, 16) b = c + bits.RotateLeft32((c^d^a)+b+xa+0xbebfbc70, 23) a = b + bits.RotateLeft32((b^c^d)+a+xd+0x289b7ec6, 4) d = a + bits.RotateLeft32((a^b^c)+d+x0+0xeaa127fa, 11) c = d + bits.RotateLeft32((d^a^b)+c+x3+0xd4ef3085, 16) b = c + bits.RotateLeft32((c^d^a)+b+x6+0x04881d05, 23)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 5.2K bytes - Viewed (0) -
test/inline_math_bits_rotate.go
// Test that inlining of math/bits.RotateLeft* treats those calls as intrinsics. package p import "math/bits" var ( x8 uint8 x16 uint16 x32 uint32 x64 uint64 x uint ) func f() { // ERROR "can inline f" x8 = bits.RotateLeft8(x8, 1) x16 = bits.RotateLeft16(x16, 1) x32 = bits.RotateLeft32(x32, 1) x64 = bits.RotateLeft64(x64, 1) x = bits.RotateLeft(x, 1)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:25 UTC 2023 - 571 bytes - Viewed (0) -
build-logic/kotlin-dsl/src/main/kotlin/gradlebuild.kotlin-dsl-dependencies-embedded.gradle.kts
kotlinMainSourceSet.srcDir(apiExtensionsFileCollection) // Workaround for https://github.com/gradle/gradle/issues/24131 // See gradlebuild.unittest-and-compile.gradle.kts configurations["transitiveSourcesElements"].outgoing.artifact(apiExtensionsOutputDir) { builtBy(generateKotlinDependencyExtensions) } processResources {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sat May 25 22:44:42 UTC 2024 - 3.7K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_generic.go
} // uint128 holds a 128-bit number as two 64-bit limbs, for use with the // bits.Mul64 and bits.Add64 intrinsics. type uint128 struct { lo, hi uint64 } func mul64(a, b uint64) uint128 { hi, lo := bits.Mul64(a, b) return uint128{lo, hi} } func add128(a, b uint128) uint128 { lo, c := bits.Add64(a.lo, b.lo, 0) hi, c := bits.Add64(a.hi, b.hi, c) if c != 0 { panic("poly1305: unexpected overflow") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 19:00:13 UTC 2024 - 9.6K bytes - Viewed (0) -
src/crypto/rand/util.go
// Prime will return error for any error returned by [rand.Read] or if bits < 2. func Prime(rand io.Reader, bits int) (*big.Int, error) { if bits < 2 { return nil, errors.New("crypto/rand: prime size must be at least 2-bit") } randutil.MaybeReadByte(rand) b := uint(bits % 8) if b == 0 { b = 8 } bytes := make([]byte, (bits+7)/8) p := new(big.Int) for {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 17:09:47 UTC 2023 - 2.4K bytes - Viewed (0) -
guava/src/com/google/common/hash/ChecksumHashFunction.java
private final int bits; private final String toString; ChecksumHashFunction( ImmutableSupplier<? extends Checksum> checksumSupplier, int bits, String toString) { this.checksumSupplier = checkNotNull(checksumSupplier); checkArgument(bits == 32 || bits == 64, "bits (%s) must be either 32 or 64", bits); this.bits = bits; this.toString = checkNotNull(toString); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 22:01:56 UTC 2024 - 4.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/magic.go
// So RotRight(x, k) == ⎣x/(2^k)⎦ <= ⎣a/(2^k)⎦ // // If x does not end in k zero bits, then RotRight(x, k) // has some non-zero bits in the k highest bits. // ⎣x/(2^k)⎦ has all zeroes in the k highest bits, // so RotRight(x, k) > ⎣x/(2^k)⎦ // // Finally, if x > a and has k trailing zero bits, then RotRight(x, k) == ⎣x/(2^k)⎦
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:25 UTC 2024 - 15.8K bytes - Viewed (0) -
src/runtime/mpallocbits.go
b.set(i) return } // Set bits [i, j]. j := i + n - 1 if i/64 == j/64 { b[i/64] |= ((uint64(1) << n) - 1) << (i % 64) return } _ = b[j/64] // Set leading bits. b[i/64] |= ^uint64(0) << (i % 64) for k := i/64 + 1; k < j/64; k++ { b[k] = ^uint64(0) } // Set trailing bits. b[j/64] |= (uint64(1) << (j%64 + 1)) - 1 } // setAll sets all the bits of b. func (b *pageBits) setAll() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 15:13:43 UTC 2024 - 12.5K bytes - Viewed (0)