- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 1,081 for cbits (0.07 sec)
-
src/math/bits/example_test.go
// Output: // 00001111 // 00111100 // 11000011 } func ExampleRotateLeft16() { fmt.Printf("%016b\n", 15) fmt.Printf("%016b\n", bits.RotateLeft16(15, 2)) fmt.Printf("%016b\n", bits.RotateLeft16(15, -2)) // Output: // 0000000000001111 // 0000000000111100 // 1100000000000011 } func ExampleRotateLeft32() { fmt.Printf("%032b\n", 15)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 18:16:09 UTC 2019 - 5.3K bytes - Viewed (0) -
src/cmd/internal/gcprog/gcprog.go
// // The GC program encodes a sequence of 0 and 1 bits indicating scalar or pointer words in an object. // The encoding is a simple Lempel-Ziv program, with codes to emit literal bits and to repeat the // last n bits c times. // // The possible codes are: // // 00000000: stop // 0nnnnnnn: emit n bits copied from the next (n+7)/8 bytes, least significant bit first // 10000000 n c: repeat the previous n bits c times; n, c are varints
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 7.4K bytes - Viewed (0) -
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: Thu Feb 22 22:01:56 UTC 2024 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleUtils.java
static long getSignificand(double d) { checkArgument(isFinite(d), "not a normal value"); int exponent = getExponent(d); long bits = doubleToRawLongBits(d); bits &= SIGNIFICAND_MASK; return (exponent == MIN_EXPONENT - 1) ? bits << 1 : bits | IMPLICIT_BIT; } static boolean isFinite(double d) { return getExponent(d) <= MAX_EXPONENT; } static boolean isNormal(double d) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 28 15:37:52 UTC 2021 - 5.1K bytes - Viewed (0) -
src/math/floor.go
const halfMinusULP = (1 << (shift - 1)) - 1 e -= bias bits += (halfMinusULP + (bits>>(shift-e))&1) >> e bits &^= fracMask >> e } else if e == bias-1 && bits&fracMask != 0 { // Round 0.5 < abs(x) < 1. bits = bits&signMask | uvone // +-1 } else { // Round abs(x) <= 0.5 including denormals. bits &= signMask // +-0 } return Float64frombits(bits)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 3.3K bytes - Viewed (0) -
src/compress/flate/huffman_code.go
code := uint16(0) for n, bits := range bitCount { code <<= 1 if n == 0 || bits == 0 { continue } // The literals list[len(list)-bits] .. list[len(list)-bits] // are encoded using "bits" bits, and get the values // code, code + 1, .... The code values are // assigned in literal order (not frequency order). chunk := list[len(list)-int(bits):] h.lns.sort(chunk)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 9.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) -
src/internal/zstd/huff.go
package zstd import ( "io" "math/bits" ) // maxHuffmanBits is the largest possible Huffman table bits. const maxHuffmanBits = 11 // readHuff reads Huffman table from data starting at off into table. // Each entry in a Huffman table is a pair of bytes. // The high byte is the encoded value. The low byte is the number // of bits used to encode that value. We index into the table
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 18 20:34:13 UTC 2023 - 4.7K bytes - Viewed (0) -
src/runtime/mpallocbits.go
b.set(i) return } // Set bits [i, j]. j := i + n - 1 if i/64 == j/64 { b[i/64] |= ((uint64(1) << n) - 1) << (i % 64) return } _ = b[j/64] // Set leading bits. b[i/64] |= ^uint64(0) << (i % 64) for k := i/64 + 1; k < j/64; k++ { b[k] = ^uint64(0) } // Set trailing bits. b[j/64] |= (uint64(1) << (j%64 + 1)) - 1 } // setAll sets all the bits of b. func (b *pageBits) setAll() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 15:13:43 UTC 2024 - 12.5K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/sys/unix/fdset.go
// Set adds fd to the set fds. func (fds *FdSet) Set(fd int) { fds.Bits[fd/NFDBITS] |= (1 << (uintptr(fd) % NFDBITS)) } // Clear removes fd from the set fds. func (fds *FdSet) Clear(fd int) { fds.Bits[fd/NFDBITS] &^= (1 << (uintptr(fd) % NFDBITS)) } // IsSet returns whether fd is in the set fds. func (fds *FdSet) IsSet(fd int) bool { return fds.Bits[fd/NFDBITS]&(1<<(uintptr(fd)%NFDBITS)) != 0 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 781 bytes - Viewed (0)