- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 122 for HI (0.02 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/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) -
platforms/documentation/docs/src/snippets/customPlugins/customPlugin/groovy/other.gradle
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Apr 05 22:35:53 UTC 2024 - 287 bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadstore.go
} if hi < sr.lo() || lo > sr.hi() { // The two regions don't overlap or abut, so we would // have to keep track of multiple disjoint ranges. // Because we can only keep one, keep the larger one. if sr.hi()-sr.lo() >= hi-lo { return sr } return shadowRange(lo + hi<<16) } // Regions overlap or abut - compute the union. return shadowRange(min(lo, sr.lo()) + max(hi, sr.hi())<<16) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 20:07:26 UTC 2024 - 11K bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/customPlugins/customPlugin/kotlin/other.gradle.kts
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Apr 05 22:35:53 UTC 2024 - 283 bytes - Viewed (0) -
src/compress/lzw/writer.go
var errOutOfCodes = errors.New("lzw: out of codes") // incHi increments e.hi and checks for both overflow and running out of // unused codes. In the latter case, incHi sends a clear code, resets the // writer state and returns errOutOfCodes. func (w *Writer) incHi() error { w.hi++ if w.hi == w.overflow { w.width++ w.overflow <<= 1 } if w.hi == maxCode { clear := uint32(1) << w.litWidth
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:32:40 UTC 2024 - 7.9K bytes - Viewed (0) -
src/cmd/internal/obj/util.go
// hi exclusive (valid registers are lo through hi-1). func RegisterRegister(lo, hi int, Rconv func(int) string) { regSpace = append(regSpace, regSet{lo, hi, Rconv}) } func Rconv(reg int) string { if reg == REG_NONE { return "NONE" } for i := range regSpace { rs := ®Space[i] if rs.lo <= reg && reg < rs.hi { return rs.Rconv(reg) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 17.5K bytes - Viewed (0) -
src/runtime/stack.go
fillstack(new, 0xfd) } if stackDebug >= 1 { print("copystack gp=", gp, " [", hex(old.lo), " ", hex(old.hi-used), " ", hex(old.hi), "]", " -> [", hex(new.lo), " ", hex(new.hi-used), " ", hex(new.hi), "]/", newsize, "\n") } // Compute adjustment. var adjinfo adjustinfo adjinfo.old = old adjinfo.delta = new.hi - old.hi // Adjust sudogs, synchronizing with channel ops if necessary. ncopy := used
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 41.1K bytes - Viewed (0) -
src/math/rand/v2/rand.go
lo1a, lo0 := bits.Mul32(uint32(x), n) hi, lo1b := bits.Mul32(uint32(x>>32), n) lo1, c := bits.Add32(lo1a, lo1b, 0) hi += c if lo1 == 0 && lo0 < uint32(n) { n64 := uint64(n) thresh := uint32(-n64 % n64) for lo1 == 0 && lo0 < thresh { x := r.Uint64() lo1a, lo0 = bits.Mul32(uint32(x), n) hi, lo1b = bits.Mul32(uint32(x>>32), n) lo1, c = bits.Add32(lo1a, lo1b, 0) hi += c } } return hi }
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/internal/godebugs/table.go
} // Lookup returns the Info with the given name. func Lookup(name string) *Info { // binary search, avoiding import of sort. lo := 0 hi := len(All) for lo < hi { m := int(uint(lo+hi) >> 1) mid := All[m].Name if name == mid { return &All[m] } if name < mid { hi = m } else { lo = m + 1 } } return nil
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:58:43 UTC 2024 - 3.6K bytes - Viewed (0)