- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 876 for nbits (0.04 sec)
-
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) -
src/image/jpeg/huffman.go
} return err } d.bits.a = d.bits.a<<8 | uint32(c) d.bits.n += 8 if d.bits.m == 0 { d.bits.m = 1 << 7 } else { d.bits.m <<= 8 } if d.bits.n >= n { break } } return nil } // receiveExtend is the composition of RECEIVE and EXTEND, specified in section // F.2.2.1. func (d *decoder) receiveExtend(t uint8) (int32, error) { if d.bits.n < int32(t) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 11 17:08:05 UTC 2024 - 6.3K 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/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/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/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)