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.5MiB live, 0.5MiB 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)

sample1.7s (80.7%)

Memory

-180.7MiB live, 961.2MiB allocated; 1.4s collecting garbage

Samples

1.1s	4 200×	0	valid
163.0ms	2 902×	1	valid
88.0ms	1 154×	2	valid

Precisions

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

adjust: 71.0ms (50.8% of total)

ival-add!: 40.0ms (28.6% of total)

ival-sub!: 29.0ms (20.7% of total)

Bogosity

explain85.0ms (4%)

Memory

-32.6MiB live, 117.1MiB allocated; 56ms collecting garbage

FPErrors

Click to see full error table

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

Confusion

	Predicted +	Predicted -
+	119	0
-	0	137

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	119	0	0
-	0	0	137

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	137
1	119

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

9.0ms	76×	2	valid
8.0ms	160×	1	valid
7.0ms	276×	0	valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

adjust: 7.0ms (61.1% of total)

ival-add!: 2.0ms (17.4% of total)

ival-sub!: 2.0ms (17.4% of total)

preprocess39.0ms (1.8%)

Memory

-12.3MiB live, 35.7MiB allocated; 9ms 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
▶	57.2%	(-.f64 (+.f64 x y) x)

Symmetry

(abs x)

(negabs y)

Compiler

Compiled 10 to 8 computations (20% saved)

series2.0ms (0.1%)

Memory

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

rewrite74.0ms (3.5%)

Memory

19.7MiB live, 104.0MiB allocated; 23ms 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: 6.2MiB live, 6.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 470 to 114 computations (75.7% saved)

prune1.0ms (0.1%)

Memory

2.2MiB live, 2.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%	#s(approx (- (+ x y) x) y)

Compiler

Compiled 7 to 5 computations (28.6% saved)

series1.0ms (0%)

Memory

1.3MiB live, 1.3MiB 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	y	@	0	((- (+ x y) x) y)
0.0ms	x	@	0	((- (+ x y) x) y)
0.0ms	x	@	-inf	((- (+ x y) x) y)

rewrite171.0ms (8.1%)

Memory

-20.4MiB live, 166.3MiB allocated; 39ms 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.5MiB live, 0.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 23 to 7 computations (69.6% saved)

prune1.0ms (0%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	3	0	3
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	3	1	4

Accuracy

100.0%

Counts

4 → 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.2%)

Memory

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

Accuracy

Total -27.4b remaining (-∞%)

Threshold costs -27.4b (-∞%)

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)

derivations5.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 7 to 5 computations (28.6% saved)

preprocess23.0ms (1.1%)

Memory

-19.3MiB live, 33.2MiB allocated; 9ms collecting garbage

Remove

(negabs y)

(abs x)

Compiler

Compiled 58 to 46 computations (20.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample1.7s (80.7%)

explain85.0ms (4%)

preprocess39.0ms (1.8%)

series2.0ms (0.1%)

rewrite74.0ms (3.5%)

eval3.0ms (0.2%)

prune1.0ms (0.1%)

series1.0ms (0%)

rewrite171.0ms (8.1%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes4.0ms (0.2%)

derivations5.0ms (0.2%)

preprocess23.0ms (1.1%)

end0.0ms (0%)

Profiling