Metrics for Optimisation.CirclePacking:place from circle-packing-0.1.0.4, C

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 8 to 6 computations (25% saved)

sample1.6s (93.1%)

Results

1.6s

8256×

body

256

valid

Bogosity

preprocess20.0ms (1.1%)

Algorithm

1×	egg-herbie

Rules

130×	`fma-def`
34×	`sub-neg`
22×	`distribute-lft-neg-in`
22×	`cancel-sign-sub-inv`
22×	`cancel-sign-sub`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	19	83
1	34	75
2	72	75
3	157	75
4	223	75
5	251	75
6	255	75

Stop Event

1×

saturated

Calls

Call 1

Inputs
(sqrt.f64 (fabs.f64 (-.f64 x y)))
(sqrt.f64 (fabs.f64 (-.f64 x y)))
(sqrt.f64 (fabs.f64 (-.f64 (neg.f64 x) y)))
(sqrt.f64 (fabs.f64 (-.f64 x (neg.f64 y))))
(sqrt.f64 (fabs.f64 (-.f64 y x)))

Outputs
(sqrt.f64 (fabs.f64 (-.f64 x y)))
(sqrt.f64 (fabs.f64 (-.f64 y x)))
(sqrt.f64 (fabs.f64 (-.f64 x y)))
(sqrt.f64 (fabs.f64 (-.f64 y x)))
(sqrt.f64 (fabs.f64 (-.f64 (neg.f64 x) y)))
(sqrt.f64 (fabs.f64 (-.f64 y (neg.f64 x))))
(sqrt.f64 (fabs.f64 (+.f64 x y)))
(sqrt.f64 (fabs.f64 (-.f64 x (neg.f64 y))))
(sqrt.f64 (fabs.f64 (-.f64 y (neg.f64 x))))
(sqrt.f64 (fabs.f64 (+.f64 x y)))
(sqrt.f64 (fabs.f64 (-.f64 y x)))
(sqrt.f64 (fabs.f64 (-.f64 x y)))

Compiler

Compiled 7 to 5 computations (28.6% saved)

eval0.0ms (0%)

Compiler: Compiled 7 to 5 computations (28.6% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(sqrt.f64 (fabs.f64 (-.f64 y x)))
▶	100.0%	(sqrt.f64 (fabs.f64 (-.f64 y x)))

Compiler

Compiled 14 to 10 computations (28.6% saved)

localize62.0ms (3.5%)

Compiler: Compiled 17 to 6 computations (64.7% 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%	(sqrt.f64 (fabs.f64 (-.f64 y x)))

Compiler

Compiled 19 to 13 computations (31.6% saved)

regimes13.0ms (0.8%)

Accuracy

Total 0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

Inputs
(sqrt.f64 (fabs.f64 (-.f64 x y)))
(sqrt.f64 (fabs.f64 (-.f64 y x)))

Outputs
(sqrt.f64 (fabs.f64 (-.f64 x y)))

Calls

5 calls:

3.0ms	(sqrt.f64 (fabs.f64 (-.f64 x y)))
3.0ms	(-.f64 x y)
3.0ms	(fabs.f64 (-.f64 x y))
2.0ms	y
2.0ms	x

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`(sqrt.f64 (fabs.f64 (-.f64 x y)))`
100.0%	1	`(fabs.f64 (-.f64 x y))`
100.0%	1	`(-.f64 x y)`

Compiler

Compiled 36 to 24 computations (33.3% saved)

simplify5.0ms (0.3%)

Algorithm

1×	egg-herbie

Rules

8×	`sub-neg`
8×	`+-commutative`
4×	`neg-mul-1`
4×	`*-commutative`
4×	`neg-sub0`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	15
1	12	15
2	19	15
3	24	15
4	27	15
5	28	15

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(sqrt.f64 (fabs.f64 (-.f64 x y)))

Outputs
(sqrt.f64 (fabs.f64 (-.f64 x y)))

Compiler

Compiled 7 to 5 computations (28.6% saved)

soundness0.0ms (0%)

end0.0ms (0%)

preprocess18.0ms (1%)

Compiler: Compiled 28 to 20 computations (28.6% saved)

analyze1.0ms (0%)

sample1.6s (93.1%)

preprocess20.0ms (1.1%)

eval0.0ms (0%)

prune1.0ms (0.1%)

localize62.0ms (3.5%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes13.0ms (0.8%)

simplify5.0ms (0.3%)

soundness0.0ms (0%)

end0.0ms (0%)

preprocess18.0ms (1%)

Profiling