Metrics for Linear.Matrix:fromQuaternion from linear-1.19.1.3, B

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 12 to 8 computations (33.3% saved)

sample1.4s (73.1%)

Results

1.0s	6005×	body	256	valid
382.0ms	2251×	body	256	infinite

Bogosity

preprocess206.0ms (10.4%)

Algorithm

1×	egg-herbie

Rules

2644×	`fma-def`
286×	`unsub-neg`
228×	`distribute-lft-neg-in`
208×	`distribute-lft-in`
200×	`distribute-rgt-in`

Problems

242×	No Errors
14×	`(+.f64 (.f64 x x) (.f64 x y))`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	28	212
1	95	196
2	276	196
3	788	196
4	1499	196
5	2594	196
6	2987	196
7	3105	196
8	3137	196
9	3147	196
10	3148	196

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 2 (+.f64 (.f64 x x) (*.f64 x y)))
(.f64 2 (+.f64 (.f64 x x) (*.f64 x y)))
(.f64 2 (+.f64 (.f64 (neg.f64 x) (neg.f64 x)) (*.f64 (neg.f64 x) y)))
(.f64 2 (+.f64 (.f64 x x) (*.f64 x (neg.f64 y))))
(neg.f64 (.f64 2 (+.f64 (.f64 (neg.f64 x) (neg.f64 x)) (*.f64 (neg.f64 x) y))))
(neg.f64 (.f64 2 (+.f64 (.f64 x x) (*.f64 x (neg.f64 y)))))
(.f64 2 (+.f64 (.f64 y y) (*.f64 y x)))

Outputs
(.f64 2 (+.f64 (.f64 x x) (*.f64 x y)))
(.f64 2 (.f64 x (+.f64 x y)))
(.f64 (+.f64 x y) (.f64 2 x))
(.f64 2 (+.f64 (.f64 x x) (*.f64 x y)))
(.f64 2 (.f64 x (+.f64 x y)))
(.f64 (+.f64 x y) (.f64 2 x))
(.f64 2 (+.f64 (.f64 (neg.f64 x) (neg.f64 x)) (*.f64 (neg.f64 x) y)))
(.f64 2 (.f64 x (+.f64 x (neg.f64 y))))
(.f64 2 (.f64 x (-.f64 x y)))
(.f64 (-.f64 y x) (.f64 x -2))
(.f64 2 (+.f64 (.f64 x x) (*.f64 x (neg.f64 y))))
(.f64 2 (.f64 x (+.f64 x (neg.f64 y))))
(.f64 2 (.f64 x (-.f64 x y)))
(.f64 (-.f64 y x) (.f64 x -2))
(neg.f64 (.f64 2 (+.f64 (.f64 (neg.f64 x) (neg.f64 x)) (*.f64 (neg.f64 x) y))))
(.f64 -2 (.f64 x (+.f64 x (neg.f64 y))))
(.f64 (.f64 x (-.f64 x y)) -2)
(.f64 2 (.f64 x (-.f64 y x)))
(neg.f64 (.f64 2 (+.f64 (.f64 x x) (*.f64 x (neg.f64 y)))))
(.f64 -2 (.f64 x (+.f64 x (neg.f64 y))))
(.f64 (.f64 x (-.f64 x y)) -2)
(.f64 2 (.f64 x (-.f64 y x)))
(.f64 2 (+.f64 (.f64 y y) (*.f64 y x)))
(.f64 2 (.f64 y (+.f64 y x)))
(.f64 2 (.f64 y (+.f64 x y)))

Compiler

Compiled 39 to 16 computations (59% saved)

eval0.0ms (0%)

Compiler: Compiled 16 to 9 computations (43.8% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

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

Compiler

Compiled 18 to 12 computations (33.3% saved)

localize34.0ms (1.7%)

Compiler: Compiled 19 to 10 computations (47.4% saved)

eval0.0ms (0%)

Compiler: Compiled 2 to 2 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 y) (.f64 2 x))

Compiler

Compiled 27 to 17 computations (37% saved)

regimes10.0ms (0.5%)

Accuracy

Total -3.5b remaining (-∞%)

Threshold costs -3.5b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(.f64 (+.f64 x y) (.f64 2 x))
(.f64 2 (+.f64 (.f64 x x) (*.f64 x y)))

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

Calls

4 calls:

2.0ms	x
2.0ms	(.f64 2 (+.f64 (.f64 x x) (*.f64 x y)))
2.0ms	y
2.0ms	(+.f64 (.f64 x x) (.f64 x y))

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`(.f64 2 (+.f64 (.f64 x x) (*.f64 x y)))`
100.0%	1	`(+.f64 (.f64 x x) (.f64 x y))`

Compiler

Compiled 44 to 27 computations (38.6% saved)

simplify3.0ms (0.2%)

Algorithm

1×	egg-herbie

Rules

4×	`*-commutative`
2×	`+-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	28
1	14	28

Stop Event

1×	done
1×	saturated

Calls

Call 1

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

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

Compiler

Compiled 9 to 6 computations (33.3% saved)

soundness187.0ms (9.5%)

Rules

2644×	`fma-def`
286×	`unsub-neg`
228×	`distribute-lft-neg-in`
208×	`distribute-lft-in`
200×	`distribute-rgt-in`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	28	212
1	95	196
2	276	196
3	788	196
4	1499	196
5	2594	196
6	2987	196
7	3105	196
8	3137	196
9	3147	196
10	3148	196

Stop Event

1×

saturated

Compiler

Compiled 46 to 24 computations (47.8% saved)

end0.0ms (0%)

preprocess88.0ms (4.4%)

Compiler: Compiled 58 to 38 computations (34.5% saved)

analyze0.0ms (0%)

sample1.4s (73.1%)

preprocess206.0ms (10.4%)

eval0.0ms (0%)

prune1.0ms (0.1%)

localize34.0ms (1.7%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes10.0ms (0.5%)

simplify3.0ms (0.2%)

soundness187.0ms (9.5%)

end0.0ms (0%)

preprocess88.0ms (4.4%)

Profiling