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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB 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 7 computations (0% saved)

sample586.0ms (66.2%)

Memory

2.4MiB live, 878.8MiB allocated; 167ms collecting garbage

Samples

415.0ms

8 256×

valid

Precisions

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

ival-fabs: 89.0ms (49.6% of total)

ival-sqrt: 62.0ms (34.6% of total)

ival-sub!: 27.0ms (15% of total)

adjust: 1.0ms (0.6% of total)

Bogosity

preprocess88.0ms (10%)

Memory

-4.3MiB live, 50.2MiB allocated; 118ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	32
1	56	32
2	149	32
3	482	32
4	1931	32

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(sort x y)

Compiler

Compiled 10 to 10 computations (0% saved)

series4.0ms (0.4%)

Memory

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

Counts

5 → 15

Calls

Call 1

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

Outputs
#s(approx (sqrt (fabs (- x y))) #s(hole binary64 (sqrt (fabs (- x y)))))
#s(approx (fabs (- x y)) #s(hole binary64 (fabs (- x y))))
#s(approx (- x y) #s(hole binary64 (* -1 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 (+ 1 (* -1 (/ y x))))))
#s(approx (sqrt (fabs (- x y))) #s(hole binary64 (sqrt (fabs (neg (+ y (* -1 x)))))))
#s(approx (fabs (- x y)) #s(hole binary64 (fabs (neg (+ y (* -1 x))))))
#s(approx (- x y) #s(hole binary64 (* -1 (* x (- (/ y x) 1)))))
#s(approx (- x y) #s(hole binary64 (+ x (* -1 y))))
#s(approx y #s(hole binary64 y))
#s(approx (- x y) #s(hole binary64 (* y (- (/ x y) 1))))
#s(approx (sqrt (fabs (- x y))) #s(hole binary64 (sqrt (fabs (+ x (* -1 y))))))
#s(approx (fabs (- x y)) #s(hole binary64 (fabs (+ x (* -1 y)))))
#s(approx (- x y) #s(hole binary64 (* -1 (* y (+ 1 (* -1 (/ x y)))))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((sqrt (fabs (- x y))) (fabs (- x y)) (- x y) x y)
1.0ms	y	@	inf	((sqrt (fabs (- x y))) (fabs (- x y)) (- x y) x y)
1.0ms	x	@	inf	((sqrt (fabs (- x y))) (fabs (- x y)) (- x y) x y)
1.0ms	y	@	-inf	((sqrt (fabs (- x y))) (fabs (- x y)) (- x y) x y)
1.0ms	x	@	0	((sqrt (fabs (- x y))) (fabs (- x y)) (- x y) x y)

rewrite164.0ms (18.6%)

Memory

31.3MiB live, 169.6MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	48	165
0	52	146
1	237	144
2	1248	144
3	7748	144

Stop Event

1×	iter-limit
1×	unsound
1×	node-limit
1×	iter-limit

Counts

20 → 15

Calls

Call 1

Inputs
(sqrt.f64 (fabs.f64 (-.f64 x y)))
(fabs.f64 (-.f64 x y))
(-.f64 x y)
x
y
#s(approx (sqrt (fabs (- x y))) #s(hole binary64 (sqrt (fabs (- x y)))))
#s(approx (fabs (- x y)) #s(hole binary64 (fabs (- x y))))
#s(approx (- x y) #s(hole binary64 (* -1 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 (+ 1 (* -1 (/ y x))))))
#s(approx (sqrt (fabs (- x y))) #s(hole binary64 (sqrt (fabs (neg (+ y (* -1 x)))))))
#s(approx (fabs (- x y)) #s(hole binary64 (fabs (neg (+ y (* -1 x))))))
#s(approx (- x y) #s(hole binary64 (* -1 (* x (- (/ y x) 1)))))
#s(approx (- x y) #s(hole binary64 (+ x (* -1 y))))
#s(approx y #s(hole binary64 y))
#s(approx (- x y) #s(hole binary64 (* y (- (/ x y) 1))))
#s(approx (sqrt (fabs (- x y))) #s(hole binary64 (sqrt (fabs (+ x (* -1 y))))))
#s(approx (fabs (- x y)) #s(hole binary64 (fabs (+ x (* -1 y)))))
#s(approx (- x y) #s(hole binary64 (* -1 (* y (+ 1 (* -1 (/ x y)))))))

Outputs
(sqrt.f64 (fabs.f64 (-.f64 x y)))
(fabs.f64 (-.f64 x y))
(-.f64 x y)
x
y
#s(approx (sqrt (fabs (- x y))) (sqrt.f64 (fabs.f64 (-.f64 x y))))
#s(approx (fabs (- x y)) (fabs.f64 (-.f64 x y)))
#s(approx (- x y) (-.f64 x y))
#s(approx x x)
#s(approx (sqrt (fabs (- x y))) (sqrt.f64 (fabs.f64 (-.f64 x y))))
#s(approx (fabs (- x y)) (fabs.f64 (-.f64 x y)))
#s(approx (- x y) (-.f64 x y))
#s(approx y y)
#s(approx (sqrt (fabs (- x y))) (sqrt.f64 (fabs.f64 (-.f64 x y))))
#s(approx (fabs (- x y)) (fabs.f64 (-.f64 x y)))

eval0.0ms (0.1%)

Memory: 1.6MiB live, 1.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 28 to 22 computations (21.4% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	5	0	5
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	5	1	6

Accuracy

100.0%

Counts

6 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 10 computations (0% saved)

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 5 to 5 computations (0% saved)

preprocess41.0ms (4.6%)

Memory: -18.9MiB live, 76.4MiB allocated; 16ms collecting garbage
Remove: (sort x y)
Compiler: Compiled 20 to 20 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample586.0ms (66.2%)

preprocess88.0ms (10%)

series4.0ms (0.4%)

rewrite164.0ms (18.6%)

eval0.0ms (0.1%)

prune1.0ms (0.1%)

derivations0.0ms (0%)

preprocess41.0ms (4.6%)

end0.0ms (0%)

Profiling