- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 1,081 for cbits (0.04 sec)
-
src/net/netip/netip.go
// It does not allocate. Unlike [Addr.Prefix], [PrefixFrom] does not mask // off the host bits of ip. // // If bits is less than zero or greater than ip.BitLen, [Prefix.Bits] // will return an invalid value -1. func PrefixFrom(ip Addr, bits int) Prefix { var bitsPlusOne uint8 if !ip.isZero() && bits >= 0 && bits <= ip.BitLen() { bitsPlusOne = uint8(bits) + 1 } return Prefix{ ip: ip.withoutZone(),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 17:10:01 UTC 2024 - 43.2K bytes - Viewed (0) -
src/internal/cpu/cpu_s390x.go
// call. Bits are numbered in big endian order so the // leftmost bit (the MSB) is at index 0. type queryResult struct { bits [2]uint64 } // Has reports whether the given functions are present. func (q *queryResult) Has(fns ...function) bool { if len(fns) == 0 { panic("no function codes provided") } for _, f := range fns { if !bitIsSet(q.bits[:], uint(f)) { return false } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 22 17:11:03 UTC 2020 - 5.9K bytes - Viewed (0) -
src/runtime/internal/sys/intrinsics.go
const m1 = 0x3333333333333333 // 00110011 ... const m2 = 0x0f0f0f0f0f0f0f0f // 00001111 ... // OnesCount64 returns the number of one bits ("population count") in x. func OnesCount64(x uint64) int { // Implementation: Parallel summing of adjacent bits. // See "Hacker's Delight", Chap. 5: Counting Bits. // The following pattern shows the general approach: // // x = x>>1&(m0&m) + x&(m0&m) // x = x>>2&(m1&m) + x&(m1&m)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 14 08:10:45 UTC 2023 - 7.4K bytes - Viewed (0) -
src/vendor/golang.org/x/sys/cpu/cpu_s390x.go
// Bits are numbered in big endian order so the // leftmost bit (the MSB) is at index 0. type facilityList struct { bits [4]uint64 } // Has reports whether the given facilities are present. func (s *facilityList) Has(fs ...facility) bool { if len(fs) == 0 { panic("no facility bits provided") } for _, f := range fs { if !bitIsSet(s.bits[:], uint(f)) { return false } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 02 15:41:00 UTC 2020 - 4.9K bytes - Viewed (0) -
src/net/ip.go
return p } // CIDRMask returns an [IPMask] consisting of 'ones' 1 bits // followed by 0s up to a total length of 'bits' bits. // For a mask of this form, CIDRMask is the inverse of [IPMask.Size]. func CIDRMask(ones, bits int) IPMask { if bits != 8*IPv4len && bits != 8*IPv6len { return nil } if ones < 0 || ones > bits { return nil } l := bits / 8 m := make(IPMask, l) n := uint(ones) for i := 0; i < l; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 03:13:26 UTC 2024 - 13.9K bytes - Viewed (0) -
src/math/rand/v2/rand.go
// // We want to compute // hi, lo := bits.Mul64(r.Uint64(), n) // In terms of 32-bit halves, this is: // x1:x0 := r.Uint64() // 0:hi, lo1:lo0 := bits.Mul64(x1:x0, 0:n) // Writing out the multiplication in terms of bits.Mul32 allows // using direct hardware instructions and avoiding // the computations involving these zeros. x := r.Uint64() lo1a, lo0 := bits.Mul32(uint32(x), n)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 02:25:49 UTC 2024 - 12.8K bytes - Viewed (0) -
src/compress/flate/inflate.go
fixedOnce.Do(func() { // These come from the RFC section 3.2.6. var bits [288]int for i := 0; i < 144; i++ { bits[i] = 8 } for i := 144; i < 256; i++ { bits[i] = 9 } for i := 256; i < 280; i++ { bits[i] = 7 } for i := 280; i < 288; i++ { bits[i] = 8 } fixedHuffmanDecoder.init(bits[:]) }) } func (f *decompressor) Reset(r io.Reader, dict []byte) error {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 23:20:03 UTC 2023 - 20.4K bytes - Viewed (0) -
src/net/netip/netip_test.go
if err != nil { t.Fatal(err) } if prefix.Addr() != test.ip { t.Errorf("IP=%s, want %s", prefix.Addr(), test.ip) } if prefix.Bits() != test.bits { t.Errorf("bits=%d, want %d", prefix.Bits(), test.bits) } for _, ip := range test.contains { if !prefix.Contains(ip) { t.Errorf("does not contain %s", ip) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 17:10:01 UTC 2024 - 54.3K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/ACE.java
* the operation and the desired access bits are compared to the SID * and access mask of each ACE. If the SID matches, the allow/deny flags * and access mask are considered. If the ACE is a "deny" * ACE and <i>any</i> of the desired access bits match bits in the access * mask of the ACE, the whole access check fails. If the ACE is an "allow" * ACE and <i>all</i> of the bits in the desired access bits match bits in
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Fri Mar 22 21:10:40 UTC 2019 - 7.2K bytes - Viewed (0) -
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)