- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 131 for Hi (0.2 sec)
-
src/math/rand/v2/pcg.go
) // state = state * mul + inc hi, lo = bits.Mul64(p.lo, mulLo) hi += p.hi*mulLo + p.lo*mulHi lo, c := bits.Add64(lo, incLo, 0) hi, _ = bits.Add64(hi, incHi, c) p.lo = lo p.hi = hi return hi, lo } // Uint64 return a uniformly-distributed random uint64 value. func (p *PCG) Uint64() uint64 { hi, lo := p.next() // XSL-RR would be // hi, lo := p.next()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 2.9K bytes - Viewed (0) -
src/crypto/internal/bigmod/_asm/nat_amd64_asm.go
XORQ(carry, carry) // zero out carry for i := 0; i < bits/64; i++ { Comment("Iteration " + strconv.Itoa(i)) hi, lo := RDX, RAX // implicit MULQ inputs and outputs MOVQ(x.Offset(i*8), lo) MULQ(y) ADDQ(z.Offset(i*8), lo) ADCQ(Imm(0), hi) ADDQ(carry, lo) ADCQ(Imm(0), hi) MOVQ(hi, carry) MOVQ(lo, z.Offset(i*8)) } Store(carry, ReturnIndex(0)) RET() Label("adx")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 24 22:37:58 UTC 2023 - 2.5K bytes - Viewed (0) -
src/net/netip/uint128.go
// its eq alg's generated code. func (u uint128) isZero() bool { return u.hi|u.lo == 0 } // and returns the bitwise AND of u and m (u&m). func (u uint128) and(m uint128) uint128 { return uint128{u.hi & m.hi, u.lo & m.lo} } // xor returns the bitwise XOR of u and m (u^m). func (u uint128) xor(m uint128) uint128 { return uint128{u.hi ^ m.hi, u.lo ^ m.lo} } // or returns the bitwise OR of u and m (u|m).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 07 21:28:44 UTC 2022 - 2.2K bytes - Viewed (0) -
src/vendor/golang.org/x/net/idna/trie.go
func (t *sparseBlocks) lookup(n uint32, b byte) uint16 { offset := t.offset[n] header := t.values[offset] lo := offset + 1 hi := lo + uint16(header.lo) for lo < hi { m := lo + (hi-lo)/2 r := t.values[m] if r.lo <= b && b <= r.hi { return r.value + uint16(b-r.lo)*header.value } if b < r.lo { hi = m } else { lo = m + 1 } } return 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 13 21:37:23 UTC 2023 - 1.3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/unicode/norm/trie.go
func (t *sparseBlocks) lookup(n uint32, b byte) uint16 { offset := t.offset[n] header := t.values[offset] lo := offset + 1 hi := lo + uint16(header.lo) for lo < hi { m := lo + (hi-lo)/2 r := t.values[m] if r.lo <= b && b <= r.hi { return r.value + uint16(b-r.lo)*header.value } if b < r.lo { hi = m } else { lo = m + 1 } } return 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 1.2K bytes - Viewed (0) -
src/compress/lzw/reader.go
r.o += copy(r.output[r.o:], r.output[i:]) if r.last != decoderInvalidCode { // Save what the hi code expands to. r.suffix[r.hi] = uint8(c) r.prefix[r.hi] = r.last } default: r.err = errors.New("lzw: invalid code") break loop } r.last, r.hi = code, r.hi+1 if r.hi >= r.overflow { if r.hi > r.overflow { panic("unreachable") } if r.width == maxWidth {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 12 14:39:39 UTC 2023 - 8K bytes - Viewed (0) -
src/runtime/pprof/vminfo_darwin_test.go
} } func useVMMapWithRetry(t *testing.T) (hi, lo uint64, err error) { var retryable bool for { hi, lo, retryable, err = useVMMap(t) if err == nil { return hi, lo, nil } if !retryable { return 0, 0, err } t.Logf("retrying vmmap after error: %v", err) } } func useVMMap(t *testing.T) (hi, lo uint64, retryable bool, err error) { pid := strconv.Itoa(os.Getpid())
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 16 19:59:50 UTC 2024 - 5.5K bytes - Viewed (0) -
src/math/exp.go
// computed as r = hi - lo for extra precision. var k int switch { case x > 0: k = int(x + 0.5) case x < 0: k = int(x - 0.5) } t := x - float64(k) hi := t * Ln2Hi lo := -t * Ln2Lo // compute return expmulti(hi, lo, k) } // exp1 returns e**r × 2**k where r = hi - lo and |r| ≤ ln(2)/2. func expmulti(hi, lo float64, k int) float64 { const (
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 5.4K bytes - Viewed (0) -
src/vendor/golang.org/x/text/unicode/norm/trie.go
func (t *sparseBlocks) lookup(n uint32, b byte) uint16 { offset := t.offset[n] header := t.values[offset] lo := offset + 1 hi := lo + uint16(header.lo) for lo < hi { m := lo + (hi-lo)/2 r := t.values[m] if r.lo <= b && b <= r.hi { return r.value + uint16(b-r.lo)*header.value } if b < r.lo { hi = m } else { lo = m + 1 } } return 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 10 16:32:44 UTC 2023 - 1.2K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_generic.go
type uint128 struct { lo, hi uint64 } func mul64(a, b uint64) uint128 { hi, lo := bits.Mul64(a, b) return uint128{lo, hi} } func add128(a, b uint128) uint128 { lo, c := bits.Add64(a.lo, b.lo, 0) hi, c := bits.Add64(a.hi, b.hi, c) if c != 0 { panic("poly1305: unexpected overflow") } return uint128{lo, hi} } func shiftRightBy2(a uint128) uint128 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 19:00:13 UTC 2024 - 9.6K bytes - Viewed (0)