- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 910 for sbits (0.03 sec)
-
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) -
src/compress/bzip2/bit_reader.go
// least-significant places and masks off anything above. n = (br.n >> (br.bits - bits)) & ((1 << bits) - 1) br.bits -= bits return } func (br *bitReader) ReadBits(bits uint) (n int) { n64 := br.ReadBits64(bits) return int(n64) } func (br *bitReader) ReadBit() bool { n := br.ReadBits(1) return n != 0 } func (br *bitReader) Err() error { return br.err
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 23:20:03 UTC 2023 - 2K 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) -
src/cmd/vendor/golang.org/x/arch/ppc64/ppc64asm/field.go
panic(fmt.Sprintf("invalid bitfiled %v", b)) } return (i[b.Word] >> (32 - b.Offs - b.Bits)) & ((1 << b.Bits) - 1) } // ParseSigned extracts the bitfield b from i, and return it as a signed integer. // ParseSigned will panic if b is invalid. func (b BitField) ParseSigned(i [2]uint32) int32 { u := int32(b.Parse(i)) return u << (32 - b.Bits) >> (32 - b.Bits) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 10 18:59:52 UTC 2023 - 2.8K 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/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) -
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) -
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/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/cmd/internal/notsha256/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: Fri Apr 29 14:23:17 UTC 2022 - 2.5K bytes - Viewed (0)