- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 1,081 for cbits (0.04 sec)
-
src/debug/dwarf/buf.go
} // Read a varint, which is 7 bits per byte, little endian. // the 0x80 bit means read another byte. func (b *buf) varint() (c uint64, bits uint) { for i := 0; i < len(b.data); i++ { byte := b.data[i] c |= uint64(byte&0x7F) << bits bits += 7 if byte&0x80 == 0 { b.off += Offset(i + 1) b.data = b.data[i+1:] return c, bits } } return 0, 0 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 21 17:14:08 UTC 2022 - 3.7K bytes - Viewed (0) -
test/fixedbugs/issue9604b.go
r := big.NewInt(1) a = append(a, r.Lsh(r, t.bits-1).Sub(r, big.NewInt(1))) r = big.NewInt(1) a = append(a, r.Lsh(r, t.bits-1).Sub(r, big.NewInt(2))) r = big.NewInt(1) a = append(a, r.Lsh(r, t.bits-1).Neg(r)) r = big.NewInt(1) a = append(a, r.Lsh(r, t.bits-1).Neg(r).Add(r, big.NewInt(1))) } else { r := big.NewInt(1) a = append(a, r.Lsh(r, t.bits).Sub(r, big.NewInt(1))) r = big.NewInt(1)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:25 UTC 2023 - 4.8K bytes - Viewed (0) -
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/os/types.go
// A FileMode represents a file's mode and permission bits. // The bits have the same definition on all systems, so that // information about files can be moved from one system // to another portably. Not all bits apply to all systems. // The only required bit is [ModeDir] for directories. type FileMode = fs.FileMode // The defined file mode bits are the most significant bits of the [FileMode].
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 15 20:52:06 UTC 2024 - 2.9K bytes - Viewed (0) -
pkg/util/iptree/iptree.go
// in a subnet to 1. // network 192.168.0.0/24 : subnet bits 24 host bits 32 - 24 = 8 // broadcast address 192.168.0.255 func broadcastAddress(subnet netip.Prefix) (netip.Addr, error) { base := subnet.Masked().Addr() bytes := base.AsSlice() // get all the host bits from the subnet n := 8*len(bytes) - subnet.Bits() // set all the host bits to 1
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 31 21:05:04 UTC 2023 - 17.7K bytes - Viewed (0) -
src/math/big/arith.go
t1, t0 := bits.Mul(uint(m), uint(x1)) _, c := bits.Add(t0, uint(x0), 0) t1, _ = bits.Add(t1, uint(x1), c) // The quotient is either t1, t1+1, or t1+2. // We'll try t1 and adjust if needed. qq := t1 // compute remainder r=x-d*q. dq1, dq0 := bits.Mul(d, qq) r0, b := bits.Sub(uint(x0), dq0, 0) r1, _ := bits.Sub(uint(x1), dq1, b)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 28 20:09:27 UTC 2022 - 8.3K bytes - Viewed (0) -
src/crypto/internal/mlkem768/mlkem768_test.go
if c >= 1<<bits { t.Fatalf("compress(%d, %d) = %d >= 2^bits", a, bits, c) } got := decompress(c, bits) diff := min(a-got, got-a, a-got+q, got-a+q) ceil := q / (1 << bits) if diff > fieldElement(ceil) { t.Fatalf("decompress(compress(%d, %d), %d) = %d (diff %d, max diff %d)", a, bits, bits, got, diff, ceil) } } } } func CompressRat(x fieldElement, d uint8) uint16 { if x >= q {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 06 15:27:18 UTC 2024 - 10.3K bytes - Viewed (0) -
guava/src/com/google/common/hash/Hashing.java
public static HashFunction goodFastHash(int minimumBits) { int bits = checkPositiveAndMakeMultipleOf32(minimumBits); if (bits == 32) { return Murmur3_32HashFunction.GOOD_FAST_HASH_32; } if (bits <= 128) { return Murmur3_128HashFunction.GOOD_FAST_HASH_128; } // Otherwise, join together some 128-bit murmur3s int hashFunctionsNeeded = (bits + 127) / 128;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 09 00:37:15 UTC 2024 - 32.3K bytes - Viewed (0) -
src/internal/fuzz/coverage.go
b |= b >> 4 b -= b >> 1 coverageSnapshot[i] = b } } // diffCoverage returns a set of bits set in snapshot but not in base. // If there are no new bits set, diffCoverage returns nil. func diffCoverage(base, snapshot []byte) []byte { if len(base) != len(snapshot) { panic(fmt.Sprintf("the number of coverage bits changed: before=%d, after=%d", len(base), len(snapshot))) } found := false for i := range snapshot {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 18:23:49 UTC 2024 - 2.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/allocators.go
package ssa import ( "internal/unsafeheader" "math/bits" "sync" "unsafe" ) var poolFreeValueSlice [27]sync.Pool func (c *Cache) allocValueSlice(n int) []*Value { var s []*Value n2 := n if n2 < 32 { n2 = 32 } b := bits.Len(uint(n2 - 1)) v := poolFreeValueSlice[b-5].Get() if v == nil { s = make([]*Value, 1<<b) } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 15 23:00:54 UTC 2023 - 7.4K bytes - Viewed (0)