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

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

sample6.2s (92.5%)

Results

738.0ms	8254×	0	valid-sollya
1.7s	8254×	0	valid-rival

Bogosity

preprocess413.0ms (6.2%)

Algorithm

1×	egg-herbie

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

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

Compiler

Compiled 12 to 8 computations (33.3% saved)

eval1.0ms (0%)

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

prune3.0ms (0%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
	98.4%	(+.f64 (.f64 x y) (.f64 (-.f64 x #s(literal 1 binary64)) z))

Compiler

Compiled 24 to 16 computations (33.3% saved)

simplify6.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

3×	`1-exp`
3×	`*-commutative`
3×	`+-commutative`
2×	`unsub-neg`
2×	`sub-neg`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	37
1	25	37
2	29	37
3	32	37
4	35	37
5	38	37

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness2.0ms (0%)

Stop Event

1×

fuel

Compiler

Compiled 12 to 8 computations (33.3% saved)

preprocess76.0ms (1.1%)

Compiler: Compiled 48 to 32 computations (33.3% saved)

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

analyze1.0ms (0%)

sample6.2s (92.5%)

preprocess413.0ms (6.2%)

eval1.0ms (0%)

prune3.0ms (0%)

simplify6.0ms (0.1%)

soundness2.0ms (0%)

preprocess76.0ms (1.1%)

end0.0ms (0%)

Profiling