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

start0.0ms (0.0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze0.0ms (0.0%)

Memory

1.0MiB live, 1.0MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0.0%	0.0%	99.9%	0.1%	0.0%	0.0%	0.0%	0
100.0%	99.9%	0.0%	0.1%	0.0%	0.0%	0.0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample727.0ms (65.8%)

Memory

43.3MiB live, 1 567.9MiB allocated; 247ms collecting garbage

Samples

158.0ms	2 852×	1	valid
150.0ms	4 253×	0	valid
149.0ms	1 151×	2	valid

Precisions

Click to see histograms. Total time spent on operations: 184.0ms

adjust: 101.0ms (55.0% of total)

ival-add!: 48.0ms (26.1% of total)

ival-sub!: 35.0ms (19.1% of total)

Bogosity

preprocess67.0ms (6.1%)

Memory

-66.1MiB live, 59.1MiB allocated; 75ms collecting garbage

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	14	30
1	45	30
2	120	18
3	168	8
4	211	8
5	945	8

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	53.3%	(-.f64 (+.f64 x y) x)

Symmetry

(abs x)

(negabs y)

Compiler

Compiled 10 to 8 computations (20.0% saved)

sample0.0ms (0.0%)

Memory

0.2MiB live, 0.2MiB allocated; 0ms collecting garbage

Calls

Call 1

Inputs

Outputs

series7.0ms (0.7%)

Memory

30.9MiB live, 30.9MiB allocated; 0ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	27	69

Stop Event

1×	iter-limit

Counts

4 → 7

Calls

Call 1

Inputs
(-.f64 (+.f64 x y) x)
(+.f64 x y)
x
y

Outputs
#s(approx (- (+ x y) x) y)
#s(approx (+ x y) (+.f64 x y))
#s(approx x x)
#s(approx (+ x y) (*.f64 x (+.f64 #s(literal 1 binary64) (/.f64 y x))))
#s(approx (+ x y) (.f64 #s(literal -1 binary64) (.f64 x (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 y x)) #s(literal 1 binary64)))))
#s(approx (+ x y) (*.f64 y (+.f64 #s(literal 1 binary64) (/.f64 x y))))
#s(approx (+ x y) (.f64 #s(literal -1 binary64) (.f64 y (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 x y)) #s(literal 1 binary64)))))

Calls

6 calls:

Time	Variable	Point
1.0ms	y	-inf
0.0ms	x	-inf
0.0ms	x	inf
0.0ms	y	inf
0.0ms	x	0

rewrite130.0ms (11.8%)

Memory

-17.7MiB live, 255.4MiB allocated; 41ms collecting garbage

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	14
1	45	14
2	145	10
3	475	6
4	746	6
5	2224	6
0	4006	6

Stop Event

1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

4 → 48

Calls

Call 1

Inputs
(-.f64 (+.f64 x y) x)
(+.f64 x y)
x
y

Outputs
y
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (neg.f64 x) y)) y)
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 x y)) y)
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (neg.f64 y) x)) x)
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 y x)) x)
(/.f64 (-.f64 (.f64 y y) (.f64 (neg.f64 x) (neg.f64 x))) (-.f64 y x))
(/.f64 (-.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 (neg.f64 x) #s(literal 3 binary64))) (fma.f64 y y (fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 y (neg.f64 x)))))
(/.f64 (-.f64 (.f64 y y) (.f64 x x)) (-.f64 y x))
(/.f64 (-.f64 (.f64 x x) (.f64 (neg.f64 y) (neg.f64 y))) (-.f64 x y))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 y y (-.f64 (.f64 x x) (.f64 y x))))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (neg.f64 y) #s(literal 3 binary64))) (fma.f64 x x (fma.f64 (neg.f64 y) (neg.f64 y) (*.f64 x (neg.f64 y)))))
(/.f64 (-.f64 (.f64 x x) (.f64 y y)) (-.f64 x y))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 y y) (.f64 x y))))
(neg.f64 (-.f64 (neg.f64 x) y))
(-.f64 (+.f64 x (+.f64 y x)) x)
(-.f64 (+.f64 x x) (-.f64 x y))
(-.f64 (+.f64 x #s(literal 0 binary64)) (neg.f64 y))
(-.f64 (-.f64 x (-.f64 (neg.f64 x) y)) x)
(-.f64 (-.f64 x #s(literal 0 binary64)) (neg.f64 y))
(-.f64 (-.f64 x (neg.f64 x)) (-.f64 x y))
(-.f64 #s(literal 0 binary64) (-.f64 (neg.f64 x) y))
(-.f64 (-.f64 y x) (+.f64 (neg.f64 x) (neg.f64 x)))
(-.f64 (-.f64 y x) (-.f64 (neg.f64 x) x))
(-.f64 (neg.f64 x) (-.f64 (-.f64 (neg.f64 x) y) x))
(-.f64 (neg.f64 x) (+.f64 (-.f64 (neg.f64 x) y) (neg.f64 x)))
(-.f64 (+.f64 y x) #s(literal 0 binary64))
(-.f64 y (+.f64 #s(literal 0 binary64) (neg.f64 x)))
(-.f64 y (-.f64 #s(literal 0 binary64) x))
(-.f64 y (neg.f64 x))
(-.f64 x (neg.f64 y))
(+.f64 (+.f64 x (+.f64 y x)) (neg.f64 x))
(+.f64 (+.f64 x x) (-.f64 y x))
(+.f64 (+.f64 x #s(literal 0 binary64)) y)
(+.f64 (-.f64 x (-.f64 (neg.f64 x) y)) (neg.f64 x))
(+.f64 (-.f64 x #s(literal 0 binary64)) y)
(+.f64 (-.f64 x (neg.f64 x)) (-.f64 y x))
(+.f64 #s(literal 0 binary64) (+.f64 y x))
(+.f64 (-.f64 y x) (+.f64 x x))
(+.f64 (-.f64 y x) (-.f64 x (neg.f64 x)))
(+.f64 (neg.f64 x) (-.f64 (+.f64 y x) (neg.f64 x)))
(+.f64 (neg.f64 x) (+.f64 (+.f64 y x) x))
(+.f64 (+.f64 y x) #s(literal 0 binary64))
(+.f64 y (+.f64 #s(literal 0 binary64) x))
(+.f64 y (-.f64 #s(literal 0 binary64) (neg.f64 x)))
(+.f64 y x)
(+.f64 x y)
x
y

eval5.0ms (0.5%)

Memory: 20.5MiB live, 20.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 541 to 178 computations (67.1% saved)

prune2.0ms (0.2%)

Memory

7.1MiB live, 7.1MiB allocated; 0ms collecting garbage

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	51	1	52
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	52	1	53

Accuracy

100.0%

Counts

53 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (- (+ x y) x) y)

Compiler

Compiled 7 to 5 computations (28.6% saved)

sample0.0ms (0.0%)

Memory

0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

Calls

Call 1

Inputs

Outputs

series2.0ms (0.2%)

Memory

8.3MiB live, 8.3MiB allocated; 0ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	7

Stop Event

1×	iter-limit

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (- (+ x y) x) y)
y

Outputs
#s(approx (- (+ x y) x) y)

Calls

6 calls:

Time	Variable	Point
0.0ms	y	-inf
0.0ms	y	inf
0.0ms	y	0
0.0ms	x	0
0.0ms	x	inf

rewrite148.0ms (13.4%)

Memory

-26.1MiB live, 207.3MiB allocated; 44ms collecting garbage

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	5	8
1	44	8
2	144	6
3	474	4
4	746	4
5	2224	4
0	4006	4

Stop Event

1×	iter-limit
1×	node-limit
1×	saturated

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- (+ x y) x) y)
y

Outputs
#s(approx (- (+ x y) x) y)
y

eval0.0ms (0.0%)

Memory: 0.3MiB live, 0.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0.0%)

Memory

1.5MiB live, 1.6MiB allocated; 0ms collecting garbage

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (- (+ x y) x) y)

Compiler

Compiled 7 to 5 computations (28.6% saved)

regimes5.0ms (0.5%)

Memory

22.7MiB live, 22.7MiB allocated; 0ms collecting garbage

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:

2.0ms	y
2.0ms	x
1.0ms	(-.f64 (+.f64 x y) x)

Results

Accuracy	Segments	Branch
100.0%	1	`(-.f64 (+.f64 x y) x)`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 19 to 15 computations (21.1% saved)

derivations1.0ms (0.1%)

Memory

2.9MiB live, 2.9MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 7 to 5 computations (28.6% saved)

preprocess9.0ms (0.8%)

Memory: -17.3MiB live, 28.2MiB allocated; 6ms collecting garbage
Compiler: Compiled 40 to 29 computations (27.5% saved)

end0.0ms (0.0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

start0.0ms (0.0%)

analyze0.0ms (0.0%)

sample727.0ms (65.8%)

preprocess67.0ms (6.1%)

sample0.0ms (0.0%)

series7.0ms (0.7%)

rewrite130.0ms (11.8%)

eval5.0ms (0.5%)

prune2.0ms (0.2%)

sample0.0ms (0.0%)

series2.0ms (0.2%)

rewrite148.0ms (13.4%)

eval0.0ms (0.0%)

prune0.0ms (0.0%)

regimes5.0ms (0.5%)

derivations1.0ms (0.1%)

preprocess9.0ms (0.8%)

end0.0ms (0.0%)

Profiling