Graphics.Rendering.Chart.Plot.Pie:renderPie from Chart-1.5.3

Time bar (total: 1.3s)

start0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory
0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%99.9%0.1%0%0%0%0
100%99.9%0%0.1%0%0%0%1
Compiler

Compiled 7 to 6 computations (14.3% saved)

sample664.0ms (50.5%)

Memory
62.7MiB live, 997.7MiB allocated; 262ms collecting garbage
Samples
205.0ms4 195×0valid
171.0ms2 871×1valid
93.0ms1 190×2valid
Precisions
Click to see histograms. Total time spent on operations: 191.0ms
adjust: 92.0ms (48% of total)
ival-add!: 71.0ms (37.1% of total)
ival-sub!: 29.0ms (15.1% of total)
Bogosity

preprocess51.0ms (3.9%)

Memory
9.7MiB live, 54.5MiB allocated; 7ms collecting garbage
Iterations

Useful iterations: 3 (0.0ms)

IterNodesCost
01430
14530
212218
31858
42268
59688
645548
Stop Event
1×node-limit
Alt Table
Click to see full alt table
StatusAccuracyProgram
▶56.8%
(-.f64 (+.f64 x y) x)
Symmetry

(abs x)

(negabs y)

Compiler

Compiled 8 to 8 computations (0% saved)

series4.0ms (0.3%)

Memory
-42.5MiB live, 3.3MiB allocated; 5ms collecting garbage
Counts
4 → 7
Calls
Call 1
Inputs
(-.f64 (+.f64 x y) x)
(+.f64 x y)
x
y
Outputs
#s(approx (- (+ x y) x) #s(hole binary64 y))
#s(approx (+ x y) #s(hole binary64 (+ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (+ x y) #s(hole binary64 (* x (+ 1 (/ y x)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))
Calls

6 calls:

TimeVariablePointExpression
2.0ms
y
@-inf
((- (+ x y) x) (+ x y) x y)
1.0ms
x
@-inf
((- (+ x y) x) (+ x y) x y)
0.0ms
x
@inf
((- (+ x y) x) (+ x y) x y)
0.0ms
y
@inf
((- (+ x y) x) (+ x y) x y)
0.0ms
x
@0
((- (+ x y) x) (+ x y) x y)

rewrite185.0ms (14.1%)

Memory
26.8MiB live, 161.7MiB allocated; 35ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
02979
03055
116055
2124555
0830855
12975255
Stop Event
1×saturated
1×node-limit
1×iter-limit
Counts
11 → 74
Calls
Call 1
Inputs
(-.f64 (+.f64 x y) x)
(+.f64 x y)
x
y
#s(approx (- (+ x y) x) #s(hole binary64 y))
#s(approx (+ x y) #s(hole binary64 (+ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (+ x y) #s(hole binary64 (* x (+ 1 (/ y x)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))
Outputs
(neg.f64 (-.f64 (-.f64 x y) x))
(fma.f64 (*.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) (/.f64 y x))) x (neg.f64 x))
(fma.f64 (*.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) (/.f64 x y))) y (neg.f64 x))
(fma.f64 (neg.f64 (+.f64 y x)) #s(literal -1 binary64) (neg.f64 x))
(fma.f64 (neg.f64 y) (-.f64 #s(literal -1 binary64) (/.f64 x y)) (neg.f64 x))
(fma.f64 (neg.f64 x) (-.f64 #s(literal -1 binary64) (/.f64 y x)) (neg.f64 x))
(fma.f64 (-.f64 #s(literal -1 binary64) (/.f64 x y)) (neg.f64 y) (neg.f64 x))
(fma.f64 (-.f64 (/.f64 x y) #s(literal -1 binary64)) y (neg.f64 x))
(fma.f64 (-.f64 #s(literal -1 binary64) (/.f64 y x)) (neg.f64 x) (neg.f64 x))
(fma.f64 #s(literal -1 binary64) (neg.f64 (+.f64 y x)) (neg.f64 x))
(fma.f64 #s(literal -1 binary64) x (+.f64 y x))
(fma.f64 (-.f64 (/.f64 y x) #s(literal -1 binary64)) x (neg.f64 x))
(fma.f64 y (*.f64 (-.f64 #s(literal -1 binary64) (/.f64 x y)) #s(literal -1 binary64)) (neg.f64 x))
(fma.f64 y (-.f64 (/.f64 x y) #s(literal -1 binary64)) (neg.f64 x))
(fma.f64 x (*.f64 (-.f64 #s(literal -1 binary64) (/.f64 y x)) #s(literal -1 binary64)) (neg.f64 x))
(fma.f64 x #s(literal -1 binary64) (+.f64 y x))
(fma.f64 x (-.f64 (/.f64 y x) #s(literal -1 binary64)) (neg.f64 x))
(-.f64 (+.f64 y x) (neg.f64 (neg.f64 x)))
(-.f64 (+.f64 y x) x)
(-.f64 x (-.f64 (neg.f64 y) (neg.f64 x)))
(-.f64 x (+.f64 (neg.f64 y) x))
(-.f64 x (-.f64 x y))
(+.f64 (-.f64 y x) x)
(+.f64 (neg.f64 x) (+.f64 y x))
(+.f64 (+.f64 y x) (neg.f64 x))
(+.f64 y (+.f64 x (neg.f64 x)))
(+.f64 y (-.f64 x x))
(+.f64 x (-.f64 y x))
(*.f64 (*.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) (/.f64 y x))) x)
(*.f64 (*.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) (/.f64 x y))) y)
(*.f64 (neg.f64 (+.f64 y x)) #s(literal -1 binary64))
(*.f64 (neg.f64 y) (-.f64 #s(literal -1 binary64) (/.f64 x y)))
(*.f64 (neg.f64 x) (-.f64 #s(literal -1 binary64) (/.f64 y x)))
(*.f64 (-.f64 #s(literal -1 binary64) (/.f64 x y)) (neg.f64 y))
(*.f64 (-.f64 (/.f64 x y) #s(literal -1 binary64)) y)
(*.f64 (-.f64 #s(literal -1 binary64) (/.f64 y x)) (neg.f64 x))
(*.f64 #s(literal -1 binary64) (neg.f64 (+.f64 y x)))
(*.f64 (-.f64 (/.f64 y x) #s(literal -1 binary64)) x)
(*.f64 y (*.f64 (-.f64 #s(literal -1 binary64) (/.f64 x y)) #s(literal -1 binary64)))
(*.f64 y (-.f64 (/.f64 x y) #s(literal -1 binary64)))
(*.f64 x (*.f64 (-.f64 #s(literal -1 binary64) (/.f64 y x)) #s(literal -1 binary64)))
(*.f64 x (-.f64 (/.f64 y x) #s(literal -1 binary64)))
(neg.f64 (*.f64 #s(literal 1 binary64) (neg.f64 (+.f64 y x))))
(neg.f64 (*.f64 (neg.f64 x) (-.f64 (/.f64 y x) #s(literal -1 binary64))))
(neg.f64 (*.f64 (neg.f64 y) (-.f64 (/.f64 x y) #s(literal -1 binary64))))
(neg.f64 (*.f64 (neg.f64 (+.f64 y x)) #s(literal 1 binary64)))
(neg.f64 (-.f64 (neg.f64 y) x))
(neg.f64 (neg.f64 (+.f64 y x)))
(fma.f64 (neg.f64 y) (/.f64 (neg.f64 x) y) (*.f64 (neg.f64 y) #s(literal -1 binary64)))
(fma.f64 (neg.f64 x) (/.f64 (neg.f64 y) x) (*.f64 (neg.f64 x) #s(literal -1 binary64)))
(fma.f64 (/.f64 (neg.f64 x) y) (neg.f64 y) (*.f64 #s(literal -1 binary64) (neg.f64 y)))
(fma.f64 (/.f64 (neg.f64 y) x) (neg.f64 x) (*.f64 #s(literal -1 binary64) (neg.f64 x)))
(-.f64 y (*.f64 (neg.f64 y) (/.f64 x y)))
(-.f64 y (*.f64 (/.f64 (neg.f64 x) y) y))
(-.f64 y (neg.f64 x))
(-.f64 x (*.f64 (neg.f64 x) (/.f64 y x)))
(-.f64 x (*.f64 (/.f64 (neg.f64 y) x) x))
(-.f64 x (neg.f64 y))
(+.f64 (*.f64 (neg.f64 x) (/.f64 (neg.f64 y) x)) (*.f64 (neg.f64 x) #s(literal -1 binary64)))
(+.f64 (*.f64 (neg.f64 y) (/.f64 (neg.f64 x) y)) (*.f64 (neg.f64 y) #s(literal -1 binary64)))
(+.f64 (*.f64 (/.f64 (neg.f64 y) x) (neg.f64 x)) (*.f64 #s(literal -1 binary64) (neg.f64 x)))
(+.f64 (*.f64 (/.f64 (neg.f64 x) y) (neg.f64 y)) (*.f64 #s(literal -1 binary64) (neg.f64 y)))
(+.f64 y x)
(+.f64 x (neg.f64 (neg.f64 y)))
(+.f64 x y)
x
y
#s(approx (- (+ x y) x) y)
#s(approx (+ x y) (+.f64 y x))
#s(approx x x)
#s(approx (+ x y) (+.f64 y x))
#s(approx (+ x y) (+.f64 y x))
#s(approx (+ x y) (+.f64 y x))
#s(approx (+ x y) (+.f64 y x))

eval6.0ms (0.4%)

Memory
10.1MiB live, 10.1MiB allocated; 0ms collecting garbage
Compiler

Compiled 302 to 152 computations (49.7% saved)

prune2.0ms (0.2%)

Memory
3.3MiB live, 3.3MiB allocated; 0ms collecting garbage
Pruning

1 alts after pruning (1 fresh and 0 done)

PrunedKeptTotal
New66167
Fresh000
Picked101
Done000
Total67168
Accuracy
100.0%
Counts
68 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
#s(approx (- (+ x y) x) y)
Compiler

Compiled 5 to 5 computations (0% saved)

series1.0ms (0.1%)

Memory
1.2MiB live, 1.2MiB allocated; 0ms collecting garbage
Counts
2 → 1
Calls
Call 1
Inputs
#s(approx (- (+ x y) x) y)
y
Outputs
#s(approx (- (+ x y) x) #s(hole binary64 y))
Calls

6 calls:

TimeVariablePointExpression
0.0ms
y
@-inf
((- (+ x y) x) y)
0.0ms
y
@inf
((- (+ x y) x) y)
0.0ms
x
@0
((- (+ x y) x) y)
0.0ms
y
@0
((- (+ x y) x) y)
0.0ms
x
@inf
((- (+ x y) x) y)

rewrite357.0ms (27.2%)

Memory
20.7MiB live, 250.4MiB allocated; 59ms collecting garbage
Iterations

Useful iterations: 2 (0.0ms)

IterNodesCost
0515
0515
13715
229411
3261211
0885311
15652311
Stop Event
1×saturated
1×node-limit
1×saturated
Counts
3 → 3
Calls
Call 1
Inputs
#s(approx (- (+ x y) x) y)
y
#s(approx (- (+ x y) x) #s(hole binary64 y))
Outputs
#s(approx (- (+ x y) x) y)
y
#s(approx (- (+ x y) x) y)

eval0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler

Compiled 0 to 2 computations (-∞% saved)

prune1.0ms (0%)

Memory
0.5MiB live, 0.5MiB allocated; 0ms collecting garbage
Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New000
Fresh000
Picked011
Done000
Total011
Accuracy
100.0%
Counts
1 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
#s(approx (- (+ x y) x) y)
Compiler

Compiled 12 to 12 computations (0% saved)

regimes4.0ms (0.3%)

Memory
4.2MiB live, 4.2MiB allocated; 0ms collecting garbage
Accuracy

Total -27.7b remaining (-∞%)

Threshold costs -27.7b (-∞%)

Counts
2 → 1
Calls
Call 1
Inputs
#s(approx (- (+ x y) x) y)
(-.f64 (+.f64 x y) x)
Outputs
#s(approx (- (+ x y) x) y)
Calls

3 calls:

1.0ms
x
1.0ms
y
1.0ms
(-.f64 (+.f64 x y) x)
Results
AccuracySegmentsBranch
100.0%1(-.f64 (+.f64 x y) x)
100.0%1x
100.0%1y
Compiler

Compiled 6 to 8 computations (-33.3% saved)

derivations28.0ms (2.1%)

Memory
-45.6MiB live, 0.9MiB allocated; 2ms collecting garbage
Stop Event
1×done
Compiler

Compiled 5 to 5 computations (0% saved)

preprocess12.0ms (0.9%)

Memory
17.4MiB live, 17.4MiB allocated; 0ms collecting garbage
Remove

(negabs y)

(abs x)

Compiler

Compiled 29 to 29 computations (0% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

Profiling

Loading profile data...