- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 450 for cbits (0.3 sec)
-
src/math/bits/bits.go
// To rotate x right by k bits, call RotateLeft8(x, -k). // // This function's execution time does not depend on the inputs. func RotateLeft8(x uint8, k int) uint8 { const n = 8 s := uint(k) & (n - 1) return x<<s | x>>(n-s) } // RotateLeft16 returns the value of x rotated left by (k mod 16) bits. // To rotate x right by k bits, call RotateLeft16(x, -k). //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 17.9K bytes - Viewed (0) -
src/math/big/float.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 15:46:54 UTC 2024 - 44.5K bytes - Viewed (0) -
src/image/jpeg/writer.go
} // emit emits the least significant nBits bits of bits to the bit-stream. // The precondition is bits < 1<<nBits && nBits <= 16. func (e *encoder) emit(bits, nBits uint32) { nBits += e.nBits bits <<= 32 - nBits bits |= e.bits for nBits >= 8 { b := uint8(bits >> 24) e.writeByte(b) if b == 0xff { e.writeByte(0x00) } bits <<= 8 nBits -= 8 } e.bits, e.nBits = bits, nBits }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 17.1K bytes - Viewed (0) -
src/compress/flate/huffman_bit_writer.go
if w.err != nil { return } w.bits |= uint64(b) << w.nbits w.nbits += nb if w.nbits >= 48 { bits := w.bits w.bits >>= 48 w.nbits -= 48 n := w.nbytes bytes := w.bytes[n : n+6] bytes[0] = byte(bits) bytes[1] = byte(bits >> 8) bytes[2] = byte(bits >> 16) bytes[3] = byte(bits >> 24) bytes[4] = byte(bits >> 32) bytes[5] = byte(bits >> 40) n += 6 if n >= bufferFlushSize {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 29 22:59:14 UTC 2022 - 18.4K bytes - Viewed (0) -
src/runtime/mgcsweep.go
if traceAllocFreeEnabled() || debug.clobberfree != 0 || raceenabled || msanenabled || asanenabled { // Find all newly freed objects. mbits := s.markBitsForBase() abits := s.allocBitsForIndex(0) for i := uintptr(0); i < uintptr(s.nelems); i++ { if !mbits.isMarked() && (abits.index < uintptr(s.freeindex) || abits.isMarked()) { x := s.base() + i*s.elemsize if traceAllocFreeEnabled() { trace := traceAcquire()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:52:18 UTC 2024 - 32.9K bytes - Viewed (0) -
src/math/big/natconv.go
nbits -= shift } // convert any partial leading digit and advance to next word if nbits == 0 { // no partial digit remaining, just advance w = x[k] nbits = _W } else { // partial digit in current word w (== x[k-1]) and next word x[k] w |= x[k] << nbits i-- s[i] = digits[w&mask] // advance w = x[k] >> (shift - nbits)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 14.6K bytes - Viewed (0) -
src/runtime/pinner.go
atomic.And8(v.bytep, ^mask) } } // pinnerBits is the same type as gcBits but has different methods. type pinnerBits gcBits // ofObject returns the pinState of the n'th object. // nosplit, because it's called by isPinned, which is nosplit // //go:nosplit func (p *pinnerBits) ofObject(n uintptr) pinState { bytep, mask := (*gcBits)(p).bitp(n * 2) byteVal := atomic.Load8(bytep) return pinState{bytep, byteVal, mask}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:29:45 UTC 2024 - 11K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AtomicDoubleArray.java
* from {@link Double#equals}, as if implemented by: * * <pre>{@code * static boolean bitEquals(double x, double y) { * long xBits = Double.doubleToRawLongBits(x); * long yBits = Double.doubleToRawLongBits(y); * return xBits == yBits; * } * }</pre> * * @author Doug Lea * @author Martin Buchholz * @since 11.0 */ @GwtIncompatible @J2ktIncompatible
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 04 09:45:04 UTC 2023 - 10.2K bytes - Viewed (0) -
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)