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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.8MiB live, 0.8MiB 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)

sample903.0ms (69.6%)

Memory

60.4MiB live, 1 132.8MiB allocated; 391ms collecting garbage

Samples

310.0ms	2 859×	1	valid
275.0ms	4 220×	0	valid
102.0ms	1 177×	2	valid

Precisions

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

adjust: 95.0ms (55.7% of total)

ival-add!: 45.0ms (26.4% of total)

ival-sub!: 30.0ms (17.6% of total)

Bogosity

explain76.0ms (5.9%)

Memory

-19.0MiB live, 79.8MiB allocated; 13ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
127	-	-	`(-.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	127	0

Confusion

	Predicted +	Predicted -
+	127	0
-	0	129

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	127	0	0
-	0	0	129

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	129
1	127

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

12.0ms	258×	0	valid
9.0ms	174×	1	valid
6.0ms	80×	2	valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-sub!: 7.0ms (49.7% of total)

adjust: 5.0ms (35.5% of total)

ival-add!: 3.0ms (21.3% of total)

preprocess34.0ms (2.7%)

Memory

-24.6MiB live, 22.3MiB allocated; 2ms 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

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(abs x)

(negabs y)

Compiler

Compiled 10 to 8 computations (20% saved)

series2.0ms (0.2%)

Memory

4.9MiB live, 4.9MiB 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)

rewrite54.0ms (4.1%)

Memory

33.9MiB live, 78.4MiB allocated; 6ms 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 (fma.f64 (.f64 x x) x (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 (+.f64 (+.f64 y x) x) (-.f64 (+.f64 y x) x))) (neg.f64 (+.f64 (+.f64 y x) x)))
(/.f64 (neg.f64 (-.f64 (.f64 (.f64 (+.f64 y x) (+.f64 y x)) (+.f64 y x)) (.f64 (.f64 x x) x))) (neg.f64 (fma.f64 (+.f64 y x) (+.f64 y x) (*.f64 x (+.f64 (+.f64 y x) x)))))
(/.f64 (*.f64 (+.f64 (+.f64 y x) x) (-.f64 (+.f64 y x) x)) (+.f64 (+.f64 y x) x))
(/.f64 (-.f64 (.f64 (.f64 (+.f64 y x) (+.f64 y x)) (+.f64 y x)) (.f64 (.f64 x x) x)) (fma.f64 (+.f64 y x) (+.f64 y x) (*.f64 x (+.f64 (+.f64 y x) x))))
(-.f64 (/.f64 (.f64 (+.f64 y x) (+.f64 y x)) (+.f64 (+.f64 y x) x)) (/.f64 (.f64 x x) (+.f64 (+.f64 y x) x)))
(-.f64 (/.f64 (.f64 (.f64 (+.f64 y x) (+.f64 y x)) (+.f64 y x)) (fma.f64 (+.f64 y x) (+.f64 y x) (.f64 x (+.f64 (+.f64 y x) x)))) (/.f64 (.f64 (.f64 x x) x) (fma.f64 (+.f64 y x) (+.f64 y x) (.f64 x (+.f64 (+.f64 y x) x)))))
(-.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 (fma.f64 (.f64 y y) y (.f64 (.f64 x x) x))) (neg.f64 (fma.f64 y (-.f64 y x) (.f64 x x))))
(/.f64 (*.f64 (+.f64 y x) (-.f64 x y)) (-.f64 x y))
(/.f64 (fma.f64 (.f64 y y) y (.f64 (.f64 x x) x)) (fma.f64 y y (-.f64 (.f64 x x) (*.f64 y x))))
(/.f64 (fma.f64 (.f64 y y) y (.f64 (.f64 x x) x)) (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 (.f64 (.f64 x x) x) (fma.f64 y (-.f64 y x) (.f64 x x))) (/.f64 (.f64 (.f64 y y) y) (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) (-.f64 (/.f64 (neg.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) (-.f64 (/.f64 (neg.f64 x) y) #s(literal 1 binary64))))

eval3.0ms (0.2%)

Memory: 7.6MiB live, 7.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 497 to 115 computations (76.9% saved)

prune14.0ms (1.1%)

Memory

-38.2MiB live, 10.1MiB allocated; 14ms collecting garbage

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	30	1	31
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	31	1	32

Accuracy

100.0%

Counts

32 → 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)

series1.0ms (0.1%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite186.0ms (14.3%)

Memory

8.3MiB live, 243.5MiB allocated; 28ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	6	18
0	6	18
1	32	18
2	275	14
3	4361	14
0	8519	14

Stop Event

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

Counts

4 → 4

Calls

Call 1

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

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

eval0.0ms (0%)

Memory: 0.2MiB live, 0.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 9 to 6 computations (33.3% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

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

Accuracy

100.0%

Counts

2 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 19 to 12 computations (36.8% saved)

regimes4.0ms (0.3%)

Memory

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

Accuracy

Total -30.0b remaining (-∞%)

Threshold costs -30b (-∞%)

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	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)

derivations4.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 7 to 5 computations (28.6% saved)

preprocess15.0ms (1.2%)

Memory

-17.8MiB live, 27.6MiB allocated; 5ms collecting garbage

Remove

(negabs y)

(abs x)

Compiler

Compiled 52 to 38 computations (26.9% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample903.0ms (69.6%)

explain76.0ms (5.9%)

preprocess34.0ms (2.7%)

series2.0ms (0.2%)

rewrite54.0ms (4.1%)

eval3.0ms (0.2%)

prune14.0ms (1.1%)

series1.0ms (0.1%)

rewrite186.0ms (14.3%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes4.0ms (0.3%)

derivations4.0ms (0.3%)

preprocess15.0ms (1.2%)

end0.0ms (0%)

Profiling