Metrics for Graphics.Rendering.Chart.Drawing:drawTextsR from Chart-1.5.3

analyze0.0ms (0%)

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 13 to 9 computations (30.8% saved)

Precisions

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

Operation ival-sub, time spent: 0.0ms, 0.0% of total-time

Operation ival-add, time spent: 0.0ms, 0.0% of total-time

Operation ival-mult, time spent: 0.0ms, 0.0% of total-time

Operation const, time spent: 0.0ms, 0.0% of total-time

sample1.5s (63.7%)

Results

1.0s	6526×	256	valid
153.0ms	1729×	256	infinite
0.0ms	1×	256	infinite

Precisions

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

Operation ival-mult, time spent: 151.0ms, 56.0% of total-time

Operation ival-sub, time spent: 53.0ms, 20.0% of total-time

Operation ival-add, time spent: 51.0ms, 19.0% of total-time

Operation const, time spent: 14.0ms, 5.0% of total-time

Bogosity

preprocess493.0ms (21.5%)

Algorithm

1×	egg-herbie

Rules

1071×	`fma-neg`
570×	`fma-define`
209×	`distribute-rgt-in`
189×	`unsub-neg`
126×	`sub-neg`

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
6	-	-	`(+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) z))`
0	-	-	`(*.f64 x y)`
0	-	-	`x`
0	-	-	`z`
0	-	-	`#s(literal 1 binary64)`
0	-	-	`y`
0	-	-	`(-.f64 x #s(literal 1 binary64))`
0	-	-	`(*.f64 (-.f64 x #s(literal 1 binary64)) z)`

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	40	399
1	100	391
2	228	381
3	636	353
4	1606	329
5	3164	329
6	3531	329
7	3594	329
8	3602	329
9	3602	329
10	4062	329
11	4062	329

Stop Event

1×

saturated

Calls

Call 1

Inputs
(+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) z))
(+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) z))
(+.f64 (.f64 (neg.f64 x) y) (.f64 (-.f64 (neg.f64 x) #s(literal 1 binary64)) z))
(+.f64 (.f64 x (neg.f64 y)) (.f64 (-.f64 x #s(literal 1 binary64)) z))
(+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) (neg.f64 z)))
(neg.f64 (+.f64 (.f64 (neg.f64 x) y) (.f64 (-.f64 (neg.f64 x) #s(literal 1 binary64)) z)))
(neg.f64 (+.f64 (.f64 x (neg.f64 y)) (.f64 (-.f64 x #s(literal 1 binary64)) z)))
(neg.f64 (+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) (neg.f64 z))))
(+.f64 (.f64 y x) (.f64 (-.f64 y #s(literal 1 binary64)) z))
(+.f64 (.f64 z y) (.f64 (-.f64 z #s(literal 1 binary64)) x))
(+.f64 (.f64 x z) (.f64 (-.f64 x #s(literal 1 binary64)) y))

Outputs
(+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) z))
(fma.f64 x y (*.f64 (+.f64 x #s(literal -1 binary64)) z))
(fma.f64 (+.f64 x #s(literal -1 binary64)) z (*.f64 x y))
(-.f64 (*.f64 x (+.f64 z y)) z)
(-.f64 (*.f64 x (+.f64 y z)) z)
(+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) z))
(fma.f64 x y (*.f64 (+.f64 x #s(literal -1 binary64)) z))
(fma.f64 (+.f64 x #s(literal -1 binary64)) z (*.f64 x y))
(-.f64 (*.f64 x (+.f64 z y)) z)
(-.f64 (*.f64 x (+.f64 y z)) z)
(+.f64 (.f64 (neg.f64 x) y) (.f64 (-.f64 (neg.f64 x) #s(literal 1 binary64)) z))
(fma.f64 (neg.f64 x) y (*.f64 z (+.f64 (neg.f64 x) #s(literal -1 binary64))))
(-.f64 (.f64 z (fma.f64 #s(literal -1 binary64) x #s(literal -1 binary64))) (.f64 x y))
(-.f64 (.f64 z (-.f64 #s(literal -1 binary64) x)) (.f64 x y))
(-.f64 (*.f64 (neg.f64 x) (+.f64 y z)) z)
(neg.f64 (fma.f64 x (+.f64 y z) z))
(+.f64 (.f64 x (neg.f64 y)) (.f64 (-.f64 x #s(literal 1 binary64)) z))
(fma.f64 x (neg.f64 y) (*.f64 (+.f64 x #s(literal -1 binary64)) z))
(fma.f64 (+.f64 x #s(literal -1 binary64)) z (*.f64 x (neg.f64 y)))
(-.f64 (*.f64 (neg.f64 x) (-.f64 y z)) z)
(neg.f64 (fma.f64 x (-.f64 y z) z))
(+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) (neg.f64 z)))
(fma.f64 x y (*.f64 (+.f64 x #s(literal -1 binary64)) (neg.f64 z)))
(-.f64 (.f64 x y) (.f64 (+.f64 x #s(literal -1 binary64)) z))
(fma.f64 x y (fma.f64 x (neg.f64 z) z))
(+.f64 z (*.f64 x (-.f64 y z)))
(fma.f64 x (-.f64 y z) z)
(neg.f64 (+.f64 (.f64 (neg.f64 x) y) (.f64 (-.f64 (neg.f64 x) #s(literal 1 binary64)) z)))
(neg.f64 (fma.f64 (neg.f64 x) y (*.f64 z (+.f64 (neg.f64 x) #s(literal -1 binary64)))))
(-.f64 (.f64 x y) (.f64 z (fma.f64 #s(literal -1 binary64) x #s(literal -1 binary64))))
(fma.f64 z (+.f64 x #s(literal 1 binary64)) (*.f64 x y))
(+.f64 z (*.f64 x (+.f64 z y)))
(fma.f64 x (+.f64 y z) z)
(neg.f64 (+.f64 (.f64 x (neg.f64 y)) (.f64 (-.f64 x #s(literal 1 binary64)) z)))
(fma.f64 x y (*.f64 (+.f64 x #s(literal -1 binary64)) (neg.f64 z)))
(-.f64 (.f64 x y) (.f64 (+.f64 x #s(literal -1 binary64)) z))
(fma.f64 x y (fma.f64 x (neg.f64 z) z))
(+.f64 z (*.f64 x (-.f64 y z)))
(fma.f64 x (-.f64 y z) z)
(neg.f64 (+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) (neg.f64 z))))
(fma.f64 x (neg.f64 y) (*.f64 (+.f64 x #s(literal -1 binary64)) z))
(fma.f64 (+.f64 x #s(literal -1 binary64)) z (*.f64 x (neg.f64 y)))
(-.f64 (*.f64 (neg.f64 x) (-.f64 y z)) z)
(neg.f64 (fma.f64 x (-.f64 y z) z))
(+.f64 (.f64 y x) (.f64 (-.f64 y #s(literal 1 binary64)) z))
(fma.f64 y x (*.f64 z (+.f64 y #s(literal -1 binary64))))
(fma.f64 x y (*.f64 z (+.f64 y #s(literal -1 binary64))))
(fma.f64 z (+.f64 y #s(literal -1 binary64)) (*.f64 x y))
(-.f64 (*.f64 y (+.f64 x z)) z)
(fma.f64 y (+.f64 x z) (neg.f64 z))
(+.f64 (.f64 z y) (.f64 (-.f64 z #s(literal 1 binary64)) x))
(fma.f64 z y (*.f64 x (+.f64 z #s(literal -1 binary64))))
(fma.f64 x (+.f64 z #s(literal -1 binary64)) (*.f64 y z))
(-.f64 (*.f64 z (+.f64 y x)) x)
(fma.f64 z (+.f64 x y) (neg.f64 x))
(+.f64 (.f64 x z) (.f64 (-.f64 x #s(literal 1 binary64)) y))
(fma.f64 x z (*.f64 y (+.f64 x #s(literal -1 binary64))))
(fma.f64 y (+.f64 x #s(literal -1 binary64)) (*.f64 x z))
(-.f64 (*.f64 x (+.f64 z y)) y)
(fma.f64 x (+.f64 y z) (neg.f64 y))

Results

192.0ms	394×	256	valid
17.0ms	117×	256	infinite
0.0ms	1×	256	infinite

Compiler

Compiled 68 to 38 computations (44.1% saved)

Precisions

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

Operation ival-add, time spent: 70.0ms, 49.0% of total-time

Operation ival-mult, time spent: 62.0ms, 44.0% of total-time

Operation ival-sub, time spent: 9.0ms, 6.0% of total-time

Operation const, time spent: 2.0ms, 1.0% of total-time

eval1.0ms (0%)

Compiler: Compiled 33 to 17 computations (48.5% saved)

prune1.0ms (0%)

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 6 computations (40% saved)

localize35.0ms (1.5%)

Results

18.0ms	197×	256	valid
5.0ms	58×	256	infinite
0.0ms	1×	256	infinite

Compiler

Compiled 22 to 7 computations (68.2% saved)

Precisions

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

Operation ival-sub, time spent: 2.0ms, 33.0% of total-time

Operation ival-add, time spent: 2.0ms, 33.0% of total-time

Operation ival-mult, time spent: 2.0ms, 33.0% of total-time

Operation const, time spent: 0.0ms, 0.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 3 to 3 computations (0% saved)

prune1.0ms (0.1%)

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%	(-.f64 (*.f64 x (+.f64 z y)) z)

Compiler

Compiled 29 to 17 computations (41.4% saved)

regimes7.0ms (0.3%)

Accuracy

Total -1.5b remaining (-∞%)

Threshold costs -1.5b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(-.f64 (*.f64 x (+.f64 z y)) z)
(+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) z))

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

Calls

4 calls:

2.0ms	z
1.0ms	(+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) z))
1.0ms	x
1.0ms	y

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`z`
100.0%	1	`(+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) z))`

Compiler

Compiled 24 to 17 computations (29.2% saved)

simplify2.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

3×	`+-commutative`
2×	`sub-neg`
2×	`*-commutative`
1×	`neg-sub0`
1×	`neg-mul-1`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	31
1	17	31
2	22	31
3	24	31
4	25	31

Stop Event

1×	done
1×	saturated

Calls

Call 1

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

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

Compiler

Compiled 10 to 6 computations (40% saved)

soundness271.0ms (11.8%)

Rules

1071×	`fma-neg`
570×	`fma-define`
209×	`distribute-rgt-in`
189×	`unsub-neg`
126×	`sub-neg`

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	40	399
1	100	391
2	228	381
3	636	353
4	1606	329
5	3164	329
6	3531	329
7	3594	329
8	3602	329
9	3602	329
10	4062	329
11	4062	329

Stop Event

1×

saturated

Compiler

Compiled 99 to 38 computations (61.6% saved)

end0.0ms (0%)

preprocess21.0ms (0.9%)

Compiler: Compiled 44 to 28 computations (36.4% saved)

analyze0.0ms (0%)

sample1.5s (63.7%)

preprocess493.0ms (21.5%)

eval1.0ms (0%)

prune1.0ms (0%)

localize35.0ms (1.5%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes7.0ms (0.3%)

simplify2.0ms (0.1%)

soundness271.0ms (11.8%)

end0.0ms (0%)

preprocess21.0ms (0.9%)

Profiling