- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 451 for nbits (0.04 sec)
-
src/math/big/nat.go
// That is, we can throw away all but the bottom logM-1 bits of y. // Instead of allocating a new y, we start reading y at the right word // and truncate it appropriately at the start of the loop. i := len(y) - 1 mtop := int((logM - 2) / _W) // -2 because the top word of N bits is the (N-1)/W'th word. mmask := ^Word(0) if mbits := (logM - 1) & (_W - 1); mbits != 0 { mmask = (1 << mbits) - 1 } if i > mtop { i = mtop
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 31.7K bytes - Viewed (0) -
src/crypto/internal/nistec/fiat/p224_fiat64.go
var x39 uint64 var x40 uint64 x39, x40 = bits.Add64(x17, x30, uint64(p224Uint1(x38))) var x41 uint64 var x42 uint64 x41, x42 = bits.Add64(x19, x32, uint64(p224Uint1(x40))) var x43 uint64 var x44 uint64 x44, x43 = bits.Mul64(x1, arg2[3]) var x45 uint64 var x46 uint64 x46, x45 = bits.Mul64(x1, arg2[2]) var x47 uint64 var x48 uint64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 05 21:53:03 UTC 2022 - 43.2K bytes - Viewed (0) -
src/crypto/internal/nistec/fiat/p256_fiat64.go
x37, x38 = bits.Add64(x19, x21, uint64(p256Uint1(x36))) var x39 uint64 var x40 uint64 x40, x39 = bits.Mul64(x1, arg2[3]) var x41 uint64 var x42 uint64 x42, x41 = bits.Mul64(x1, arg2[2]) var x43 uint64 var x44 uint64 x44, x43 = bits.Mul64(x1, arg2[1]) var x45 uint64 var x46 uint64 x46, x45 = bits.Mul64(x1, arg2[0]) var x47 uint64 var x48 uint64 x47, x48 = bits.Add64(x46, x43, uint64(0x0))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 05 21:53:03 UTC 2022 - 41.2K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/keccakf.go
bc4 = bits.RotateLeft64(t, 18) t = a[1] ^ d1 bc0 = bits.RotateLeft64(t, 1) t = a[7] ^ d2 bc1 = bits.RotateLeft64(t, 6) t = a[13] ^ d3 bc2 = bits.RotateLeft64(t, 25) t = a[19] ^ d4 bc3 = bits.RotateLeft64(t, 8) a[20] = bc0 ^ (bc2 &^ bc1) a[1] = bc1 ^ (bc3 &^ bc2) a[7] = bc2 ^ (bc4 &^ bc3) a[13] = bc3 ^ (bc0 &^ bc4) a[19] = bc4 ^ (bc1 &^ bc0) t = a[5] ^ d0
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/crypto/internal/edwards25519/scalar_fiat.go
x71, x70 = bits.Mul64(x66, 0x14def9dea2f79cd6) var x72 uint64 var x73 uint64 x73, x72 = bits.Mul64(x66, 0x5812631a5cf5d3ed) var x74 uint64 var x75 uint64 x74, x75 = bits.Add64(x73, x70, uint64(0x0)) var x77 uint64 _, x77 = bits.Add64(x60, x72, uint64(0x0)) var x78 uint64 var x79 uint64 x78, x79 = bits.Add64(x62, x74, uint64(fiatScalarUint1(x77))) var x80 uint64 var x81 uint64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 10 18:45:00 UTC 2022 - 35.6K bytes - Viewed (0) -
test/codegen/mathbits.go
// ppc64x: -"ADDC", "ADDE", -"ADDZE" r[2], c = bits.Add64(p[2], p[2], c) } func Add64MSaveC(p, q, r, c *[2]uint64) { // ppc64x: "ADDC\tR", "ADDZE" r[0], c[0] = bits.Add64(p[0], q[0], 0) // ppc64x: "ADDC\t[$]-1", "ADDE", "ADDZE" r[1], c[1] = bits.Add64(p[1], q[1], c[0]) } func Add64PanicOnOverflowEQ(a, b uint64) uint64 { r, c := bits.Add64(a, b, 0) // s390x:"BRC\t[$]3,",-"ADDE"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:51:17 UTC 2024 - 19.6K bytes - Viewed (0) -
api/go1.9.txt
pkg math/bits (windows-amd64), const UintSize = 64 pkg math/bits, const UintSize ideal-int pkg math/bits, func LeadingZeros(uint) int pkg math/bits, func LeadingZeros16(uint16) int pkg math/bits, func LeadingZeros32(uint32) int pkg math/bits, func LeadingZeros64(uint64) int pkg math/bits, func LeadingZeros8(uint8) int pkg math/bits, func Len(uint) int pkg math/bits, func Len16(uint16) int pkg math/bits, func Len32(uint32) int
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 04 20:20:20 UTC 2021 - 10.7K bytes - Viewed (0) -
pkg/kubelet/cm/topologymanager/bitmask/bitmask_test.go
}, { name: "Get bits of mask 01", bits: []int{0}, expectedBits: []int{0}, }, { name: "Get bits of mask 11", bits: []int{0, 1}, expectedBits: []int{0, 1}, }, } for _, tc := range tcases { mask, _ := NewBitMask(tc.bits...) bits := mask.GetBits() if !reflect.DeepEqual(bits, tc.expectedBits) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Nov 03 09:45:09 UTC 2022 - 16.2K 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/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)