- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 451 for nbits (0.06 sec)
-
src/cmd/internal/objabi/reloctype.go
// R_ARM64_LDST8 sets a LD/ST immediate value to bits [11:0] of a local address. R_ARM64_LDST8 // R_ARM64_LDST16 sets a LD/ST immediate value to bits [11:1] of a local address. R_ARM64_LDST16 // R_ARM64_LDST32 sets a LD/ST immediate value to bits [11:2] of a local address. R_ARM64_LDST32 // R_ARM64_LDST64 sets a LD/ST immediate value to bits [11:3] of a local address. R_ARM64_LDST64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 27 17:26:07 UTC 2024 - 17.3K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe.go
return nil, errors.New("edwards25519: invalid field element input size") } // Bits 0:51 (bytes 0:8, bits 0:64, shift 0, mask 51). v.l0 = byteorder.LeUint64(x[0:8]) v.l0 &= maskLow51Bits // Bits 51:102 (bytes 6:14, bits 48:112, shift 3, mask 51). v.l1 = byteorder.LeUint64(x[6:14]) >> 3 v.l1 &= maskLow51Bits // Bits 102:153 (bytes 12:20, bits 96:160, shift 6, mask 51). v.l2 = byteorder.LeUint64(x[12:20]) >> 6
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 11.8K bytes - Viewed (0) -
src/compress/flate/flate_test.go
) // The following test should not panic. func TestIssue5915(t *testing.T) { bits := []int{4, 0, 0, 6, 4, 3, 2, 3, 3, 4, 4, 5, 0, 0, 0, 0, 5, 5, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 8, 6, 0, 11, 0, 8, 0, 6, 6, 10, 8} var h huffmanDecoder if h.init(bits) { t.Fatalf("Given sequence of bits is bad, and should not succeed.") } } // The following test should not panic.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 20 18:41:18 UTC 2020 - 11K bytes - Viewed (1) -
android/guava/src/com/google/common/hash/HashCode.java
public abstract class HashCode { HashCode() {} /** Returns the number of bits in this hash code; a positive multiple of 8. */ public abstract int bits(); /** * Returns the first four bytes of {@linkplain #asBytes() this hashcode's bytes}, converted to an * {@code int} value in little-endian order. * * @throws IllegalStateException if {@code bits() < 32} */ public abstract int asInt(); /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 12.6K bytes - Viewed (0) -
src/math/big/rat.go
} // SetFloat64 sets z to exactly f and returns z. // If f is not finite, SetFloat returns nil. func (z *Rat) SetFloat64(f float64) *Rat { const expMask = 1<<11 - 1 bits := math.Float64bits(f) mantissa := bits & (1<<52 - 1) exp := int((bits >> 52) & expMask) switch exp { case expMask: // non-finite return nil case 0: // denormal exp -= 1022 default: // normal mantissa |= 1 << 52 exp -= 1023 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 13.5K bytes - Viewed (0) -
api/go1.12.txt
pkg log, method (*Logger) Writer() io.Writer pkg math/bits, func Add(uint, uint, uint) (uint, uint) pkg math/bits, func Add32(uint32, uint32, uint32) (uint32, uint32) pkg math/bits, func Add64(uint64, uint64, uint64) (uint64, uint64) pkg math/bits, func Div(uint, uint, uint) (uint, uint) pkg math/bits, func Div32(uint32, uint32, uint32) (uint32, uint32) pkg math/bits, func Div64(uint64, uint64, uint64) (uint64, uint64)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 02 21:21:53 UTC 2019 - 13.5K bytes - Viewed (0) -
src/strconv/atof.go
overflow: // ±Inf mant = 0 exp = 1<<flt.expbits - 1 + flt.bias overflow = true out: // Assemble bits. bits := mant & (uint64(1)<<flt.mantbits - 1) bits |= uint64((exp-flt.bias)&(1<<flt.expbits-1)) << flt.mantbits if d.neg { bits |= 1 << flt.mantbits << flt.expbits } return bits, overflow } // Exact powers of 10. var float64pow10 = []float64{
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 06 18:50:50 UTC 2022 - 15.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/internal/bisect/bisect.go
} fallthrough case '0', '1': bits <<= wid bits |= uint64(c - '0') case 'a', 'b', 'c', 'd', 'e', 'f', 'A', 'B', 'C', 'D', 'E', 'F': if wid != 4 { return nil, &parseError{"invalid pattern syntax: " + pattern} } bits <<= 4 bits |= uint64(c&^0x20 - 'A' + 10) case 'y': if i+1 < len(p) && (p[i+1] == '0' || p[i+1] == '1') {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 22 18:11:19 UTC 2023 - 15.4K bytes - Viewed (0) -
src/index/suffixarray/suffixarray_test.go
name = fmt.Sprintf("%dM", size/1e6) } b.Run("size="+name, func(b *testing.B) { for _, bits := range []int{32, 64} { if ^uint(0) == 0xffffffff && bits == 64 { continue } b.Run(fmt.Sprintf("bits=%d", bits), func(b *testing.B) { cleanup := setBits(bits) defer cleanup() b.SetBytes(int64(len(data))) b.ReportAllocs()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 14.1K bytes - Viewed (0) -
src/runtime/hash_test.go
// There's not enough bits in the hash output, so we // expect a nontrivial number of collisions, and it is // often quite a bit higher than expected. See issue 43130. t.Skip("Flaky on 32-bit systems") } if testing.Short() { t.Skip("Skipping in short mode") } const BITS = 16 for r := 0; r < k.bits(); r++ { for i := 0; i < 1<<BITS; i++ { k.clear()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 06 17:50:18 UTC 2024 - 18.4K bytes - Viewed (0)