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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
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)

sample928.0ms (68.3%)

Memory

-24.1MiB live, 944.4MiB allocated; 311ms collecting garbage

Samples

375.0ms	2 941×	1	valid
143.0ms	4 205×	0	valid
135.0ms	1 110×	2	valid

Precisions

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

adjust: 177.0ms (54.3% of total)

ival-add: 85.0ms (26.1% of total)

ival-sub: 61.0ms (18.7% of total)

ival-assert: 3.0ms (0.9% of total)

Bogosity

explain66.0ms (4.9%)

Memory

19.7MiB live, 112.6MiB allocated; 11ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
125	-	-	`(-.f64 (+.f64 x y) x)`
0	-	-	`y`
0	-	-	`(+.f64 x y)`
0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`-.f64`	`(-.f64 (+.f64 x y) x)`	cancellation	125	0

Confusion

	Predicted +	Predicted -
+	125	0
-	0	131

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	125	0	0
-	0	0	131

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	131
1	125

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	0

Precision?

1.0

Recall?

1.0

Samples

14.0ms	182×	1	valid
12.0ms	66×	2	valid
9.0ms	264×	0	valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

adjust: 12.0ms (57.6% of total)

ival-add: 5.0ms (24% of total)

ival-sub: 4.0ms (19.2% of total)

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

preprocess189.0ms (13.9%)

Memory

-8.1MiB live, 139.3MiB allocated; 19ms collecting garbage

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	25	32
2	41	20
3	60	8
4	100	8
5	982	8
6	2009	8
7	3896	8
0	4	5
0	6	5
1	9	5
2	12	3
3	15	1
4	17	1
5	67	1
6	210	1
7	793	1
8	1433	1
9	4272	1
0	9065	1

Stop Event

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

Calls

Call 1

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

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

Symmetry

(abs x)

(negabs y)

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 4 computations (20% saved)

series2.0ms (0.2%)

Memory

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

Counts

4 → 10

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 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))
#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 y #s(hole binary64 y))
#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:

Time	Variable		Point	Expression
1.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)

rewrite64.0ms (4.7%)

Memory

-18.9MiB live, 72.1MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	32	92
0	33	88
1	140	88
0	1099	86

Stop Event

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

Counts

14 → 34

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 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))
#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 y #s(hole binary64 y))
#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
(/.f64 (-.f64 (.f64 x x) (.f64 (-.f64 y x) (-.f64 y x))) (-.f64 x (-.f64 y x)))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (-.f64 y x) #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 (-.f64 y x) (-.f64 y x)) (.f64 x (-.f64 y x)))))
(/.f64 (neg.f64 (-.f64 (pow.f64 (+.f64 y x) #s(literal 2 binary64)) (*.f64 x x))) (neg.f64 (+.f64 (+.f64 y x) x)))
(/.f64 (neg.f64 (-.f64 (pow.f64 (+.f64 y x) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x (+.f64 (+.f64 y x) x) (pow.f64 (+.f64 y x) #s(literal 2 binary64)))))
(/.f64 (-.f64 (pow.f64 (+.f64 y x) #s(literal 2 binary64)) (*.f64 x x)) (+.f64 (+.f64 y x) x))
(/.f64 (-.f64 (pow.f64 (+.f64 y x) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x (+.f64 (+.f64 y x) x) (pow.f64 (+.f64 y x) #s(literal 2 binary64))))
(-.f64 (/.f64 (pow.f64 (+.f64 y x) #s(literal 2 binary64)) (+.f64 (+.f64 y x) x)) (/.f64 (*.f64 x x) (+.f64 (+.f64 y x) x)))
(-.f64 (/.f64 (pow.f64 (+.f64 y x) #s(literal 3 binary64)) (fma.f64 x (+.f64 (+.f64 y x) x) (pow.f64 (+.f64 y x) #s(literal 2 binary64)))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x (+.f64 (+.f64 y x) x) (pow.f64 (+.f64 y x) #s(literal 2 binary64)))))
(-.f64 (+.f64 y x) x)
(+.f64 (-.f64 y x) x)
(+.f64 y (-.f64 x x))
(+.f64 x (-.f64 y x))
(/.f64 (-.f64 (.f64 y y) (.f64 x x)) (-.f64 y x))
(/.f64 (neg.f64 (*.f64 (+.f64 y x) (-.f64 x y))) (neg.f64 (-.f64 x y)))
(/.f64 (neg.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 y (-.f64 y x) (*.f64 x x))))
(/.f64 (*.f64 (+.f64 y x) (-.f64 x 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 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 y (-.f64 y x) (*.f64 x x)))
(-.f64 (/.f64 (.f64 x x) (-.f64 x y)) (/.f64 (.f64 y y) (-.f64 x y)))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 y (-.f64 y x) (.f64 x x))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y (-.f64 y x) (.f64 x x))))
(+.f64 y x)
(+.f64 x y)
x
y
#s(approx (- (+ x y) x) y)
#s(approx (+ x y) y)
#s(approx (+ x y) (+.f64 y x))
#s(approx x x)
#s(approx (+ x y) x)
#s(approx (+ x y) (fma.f64 (/.f64 y x) x x))
#s(approx (+ x y) (*.f64 (neg.f64 x) (fma.f64 #s(literal -1 binary64) (/.f64 y x) #s(literal -1 binary64))))
#s(approx y y)
#s(approx (+ x y) (fma.f64 (/.f64 x y) y y))
#s(approx (+ x y) (*.f64 (neg.f64 y) (fma.f64 (/.f64 x y) #s(literal -1 binary64) #s(literal -1 binary64))))

eval3.0ms (0.2%)

Memory: 7.6MiB live, 7.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 470 to 114 computations (75.7% saved)

prune5.0ms (0.3%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	35	1	36
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	36	1	37

Accuracy

100.0%

Counts

37 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 4 computations (20% saved)

series1.0ms (0.1%)

Memory

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

Counts

4 → 4

Calls

Call 1

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

Outputs
#s(approx (+ y (- x x)) #s(hole binary64 y))
#s(approx (- x x) #s(hole binary64 0))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
0.0ms	y	@	-inf	((+ y (- x x)) y (- x x) x)
0.0ms	y	@	inf	((+ y (- x x)) y (- x x) x)
0.0ms	x	@	-inf	((+ y (- x x)) y (- x x) x)
0.0ms	x	@	inf	((+ y (- x x)) y (- x x) x)
0.0ms	x	@	0	((+ y (- x x)) y (- x x) x)

rewrite51.0ms (3.7%)

Memory

-4.4MiB live, 46.4MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	11	28
0	13	20
1	44	16
0	320	16

Stop Event

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

Counts

8 → 8

Calls

Call 1

Inputs
(+.f64 y (-.f64 x x))
y
(-.f64 x x)
x
#s(approx (+ y (- x x)) #s(hole binary64 y))
#s(approx (- x x) #s(hole binary64 0))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Outputs
y
y
#s(literal 0 binary64)
x
#s(approx (+ y (- x x)) y)
#s(approx (- x x) #s(literal 0 binary64))
#s(approx x x)
#s(approx (+ y (- x x)) y)

eval1.0ms (0.1%)

Memory: 1.2MiB live, 1.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 42 to 16 computations (61.9% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	8	0	8
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	8	1	9

Accuracy

100.0%

Counts

9 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 y (-.f64 x x))

Compiler

Compiled 15 to 10 computations (33.3% saved)

regimes4.0ms (0.3%)

Memory

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

Accuracy

Total -29.6b remaining (-∞%)

Threshold costs -29.6b (-∞%)

Counts

2 → 1

Calls

Call 1

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

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

Calls

3 calls:

1.0ms	y
1.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 7 to 8 computations (-14.3% saved)

simplify16.0ms (1.2%)

Memory

-34.8MiB live, 11.9MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	4	5
1	7	3
2	13	1
3	14	1

Stop Event

1×

saturated

Calls

Call 1

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

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

derivations3.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 1 to 2 computations (-100% saved)

preprocess23.0ms (1.7%)

Memory

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

Remove

(negabs y)

(abs x)

Compiler

Compiled 26 to 36 computations (-38.5% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample928.0ms (68.3%)

explain66.0ms (4.9%)

preprocess189.0ms (13.9%)

eval0.0ms (0%)

prune0.0ms (0%)

series2.0ms (0.2%)

rewrite64.0ms (4.7%)

eval3.0ms (0.2%)

prune5.0ms (0.3%)

series1.0ms (0.1%)

rewrite51.0ms (3.7%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

regimes4.0ms (0.3%)

simplify16.0ms (1.2%)

derivations3.0ms (0.2%)

preprocess23.0ms (1.7%)

end0.0ms (0%)

Profiling