- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for approxInvCumulativeSum (0.33 sec)
-
src/internal/trace/mud_test.go
t.Fatalf("want mass %g, got %g", mass, hmass) } // Check inverse cumulative sum approximations. for j := 0.0; j < mass; j += mass * 0.099 { mud.setTrackMass(j) l, u, ok := mud.approxInvCumulativeSum() inv, ok2 := mud.invCumulativeSum(j) if !ok || !ok2 { t.Fatalf("inverse cumulative sum failed: approx %v, exact %v", ok, ok2) } if !(l <= inv && inv < u) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 2.5K bytes - Viewed (0) -
src/internal/trace/mud.go
} d.trackBucket = len(d.hist) d.trackSum = sum } // approxInvCumulativeSum is like invCumulativeSum, but specifically // operates on the tracked mass and returns an upper and lower bound // approximation of the inverse cumulative sum. // // The true inverse cumulative sum will be in the range [lower, upper). func (d *mud) approxInvCumulativeSum() (float64, float64, bool) { if d.trackBucket == len(d.hist) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 5.7K bytes - Viewed (0) -
src/internal/trace/gc.go
if acc.lastTime != math.MaxInt64 { // Update distribution. acc.mud.add(acc.lastMU, mu, float64(time-acc.lastTime)) } acc.lastTime, acc.lastMU = time, mu if _, mudBound, ok := acc.mud.approxInvCumulativeSum(); ok { acc.bound = math.Max(acc.bound, mudBound) } else { // We haven't accumulated enough total precise // mass yet to even reach our goal, so keep // accumulating. acc.bound = 1 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 26K bytes - Viewed (0)