- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 1,081 for nbits (0.03 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) -
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) -
src/math/bits/example_math_test.go
package bits_test import ( "fmt" "math/bits" ) func ExampleAdd32() { // First number is 33<<32 + 12 n1 := []uint32{33, 12} // Second number is 21<<32 + 23 n2 := []uint32{21, 23} // Add them together without producing carry. d1, carry := bits.Add32(n1[1], n2[1], 0) d0, _ := bits.Add32(n1[0], n2[0], carry) nsum := []uint32{d0, d1}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 11 21:27:05 UTC 2021 - 6.3K bytes - Viewed (0) -
src/crypto/sha1/sha1block.go
for ; i < 16; i++ { f := b&c | (^b)&d t := bits.RotateLeft32(a, 5) + f + e + w[i&0xf] + _K0 a, b, c, d, e = t, a, bits.RotateLeft32(b, 30), c, d } for ; i < 20; i++ { tmp := w[(i-3)&0xf] ^ w[(i-8)&0xf] ^ w[(i-14)&0xf] ^ w[(i)&0xf] w[i&0xf] = bits.RotateLeft32(tmp, 1) f := b&c | (^b)&d t := bits.RotateLeft32(a, 5) + f + e + w[i&0xf] + _K0 a, b, c, d, e = t, a, bits.RotateLeft32(b, 30), c, d }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 03 21:27:16 UTC 2023 - 2.3K 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) -
android/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: Tue Apr 20 18:43:59 UTC 2021 - 2.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
LockFreeBitArray bits) { long bitSize = bits.bitSize(); long hash64 = Hashing.murmur3_128().hashObject(object, funnel).asLong(); int hash1 = (int) hash64; int hash2 = (int) (hash64 >>> 32); boolean bitsChanged = false; for (int i = 1; i <= numHashFunctions; i++) { int combinedHash = hash1 + (i * hash2); // Flip all the bits if it's negative (guaranteed positive number)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 10.7K bytes - Viewed (0) -
src/crypto/sha512/sha512block.go
v1 := w[i-2] t1 := bits.RotateLeft64(v1, -19) ^ bits.RotateLeft64(v1, -61) ^ (v1 >> 6) v2 := w[i-15] t2 := bits.RotateLeft64(v2, -1) ^ bits.RotateLeft64(v2, -8) ^ (v2 >> 7) w[i] = t1 + w[i-7] + t2 + w[i-16] } a, b, c, d, e, f, g, h := h0, h1, h2, h3, h4, h5, h6, h7 for i := 0; i < 80; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 03 21:17:08 UTC 2023 - 3.3K 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) -
src/crypto/sha256/sha256block.go
v1 := w[i-2] t1 := (bits.RotateLeft32(v1, -17)) ^ (bits.RotateLeft32(v1, -19)) ^ (v1 >> 10) v2 := w[i-15] t2 := (bits.RotateLeft32(v2, -7)) ^ (bits.RotateLeft32(v2, -18)) ^ (v2 >> 3) w[i] = t1 + w[i-7] + t2 + w[i-16] } a, b, c, d, e, f, g, h := h0, h1, h2, h3, h4, h5, h6, h7 for i := 0; i < 64; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 03 21:21:42 UTC 2023 - 2.4K bytes - Viewed (0)