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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.7MiB live, 0.7MiB 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)

sample556.0ms (67%)

Memory

12.6MiB live, 761.1MiB allocated; 196ms collecting garbage

Samples

339.0ms	8 252×	0	valid
0.0ms	2×	3	valid
0.0ms	1×	2	valid
0.0ms	1×	1	valid

Precisions

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

ival-add!: 79.0ms (98% of total)

adjust: 2.0ms (2.5% of total)

Bogosity

preprocess17.0ms (2%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	22	55
1	63	50
2	193	50
3	305	50

Stop Event

1×

saturated

Alt Table

Click to see full alt table

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

Symmetry

(sort x y z)

Compiler

Compiled 10 to 10 computations (0% saved)

series45.0ms (5.5%)

Memory

-32.5MiB live, 24.6MiB allocated; 68ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	69	207

Stop Event

1×	iter-limit

Counts

5 → 17

Calls

Call 1

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

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

Calls

9 calls:

Time	Variable	Point
37.0ms	x	inf
1.0ms	x	-inf
0.0ms	y	-inf
0.0ms	z	-inf
0.0ms	y	inf

rewrite10.0ms (1.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	15	11
2	44	11
3	96	11
4	112	11
0	112	11

Stop Event

1×	iter-limit
1×	saturated
1×	iter-limit

Counts

5 → 21

Calls

Call 1

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

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

eval8.0ms (0.9%)

Memory: -39.2MiB live, 9.1MiB allocated; 11ms collecting garbage
Compiler: Compiled 324 to 108 computations (66.7% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	32	2	34
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	32	3	35

Accuracy

100.0%

Counts

35 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 (+.f64 x y) z)
▶	49.2%	(+.f64 #s(approx (+ x y) y) z)
▶	98.6%	#s(approx (+ (+ x y) z) (+.f64 x z))

Compiler

Compiled 21 to 18 computations (14.3% saved)

series6.0ms (0.7%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	85	259

Stop Event

1×	iter-limit

Counts

7 → 21

Calls

Call 1

Inputs
#s(approx (+ (+ x y) z) (+.f64 x z))
(+.f64 x z)
x
z
(+.f64 #s(approx (+ x y) y) z)
#s(approx (+ x y) y)
y

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

Calls

9 calls:

Time	Variable	Point
0.0ms	x	-inf
0.0ms	z	-inf
0.0ms	y	-inf
0.0ms	x	inf
0.0ms	z	inf

rewrite8.0ms (1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	27
0	11	27
1	23	27
2	57	27
3	115	27
4	137	27
0	137	27

Stop Event

1×	iter-limit
1×	saturated
1×	iter-limit

Counts

7 → 16

Calls

Call 1

Inputs
#s(approx (+ (+ x y) z) (+.f64 x z))
(+.f64 x z)
x
z
(+.f64 #s(approx (+ x y) y) z)
#s(approx (+ x y) y)
y

Outputs
#s(approx (+ (+ x y) z) (+.f64 z x))
(neg.f64 (-.f64 (neg.f64 x) z))
(-.f64 z (neg.f64 x))
(-.f64 x (neg.f64 z))
(+.f64 z x)
(+.f64 x z)
x
z
(neg.f64 (-.f64 (neg.f64 z) #s(approx (+ x y) y)))
(-.f64 #s(approx (+ x y) y) (neg.f64 z))
(-.f64 z (neg.f64 #s(approx (+ x y) y)))
(+.f64 #s(approx (+ x y) y) z)
(+.f64 z #s(approx (+ x y) y))
#s(approx (+ x y) y)
(neg.f64 (neg.f64 #s(approx (+ x y) y)))
y

eval6.0ms (0.8%)

Memory: -35.2MiB live, 9.6MiB allocated; 6ms collecting garbage
Compiler: Compiled 398 to 119 computations (70.1% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	29	1	30
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	29	4	33

Accuracy

100.0%

Counts

33 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 (+.f64 x y) z)
✓	49.2%	(+.f64 #s(approx (+ x y) y) z)
✓	98.6%	#s(approx (+ (+ x y) z) (+.f64 x z))
▶	47.5%	#s(approx (+ (+ x y) z) #s(approx (+ x z) z))

Compiler

Compiled 32 to 26 computations (18.8% saved)

series5.0ms (0.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	69	215

Stop Event

1×	iter-limit

Counts

3 → 17

Calls

Call 1

Inputs
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
#s(approx (+ x z) z)
z

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

Calls

9 calls:

Time	Variable	Point
0.0ms	z	-inf
0.0ms	z	inf
0.0ms	x	-inf
0.0ms	x	inf
0.0ms	y	inf

rewrite8.0ms (0.9%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	17
0	8	17
1	18	17
2	47	17
3	98	17
4	115	17
0	115	17

Stop Event

1×	iter-limit
1×	saturated
1×	saturated

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
#s(approx (+ x z) z)
z

Outputs
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
#s(approx (+ x z) z)
z

eval6.0ms (0.7%)

Memory: -38.1MiB live, 6.2MiB allocated; 9ms collecting garbage
Compiler: Compiled 240 to 75 computations (68.8% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

6 alts after pruning (3 fresh and 3 done)

	Pruned	Kept	Total
New	13	3	16
Fresh	0	0	0
Picked	0	1	1
Done	1	2	3
Total	14	6	20

Accuracy

100.0%

Counts

20 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	49.2%	(+.f64 #s(approx (+ x y) y) z)
✓	98.6%	#s(approx (+ (+ x y) z) (+.f64 x z))
▶	53.4%	#s(approx (+ (+ x y) z) (+.f64 x y))
✓	47.5%	#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
▶	4.4%	#s(approx (+ (+ x y) z) y)
▶	52.1%	#s(approx (+ (+ x y) z) x)

Compiler

Compiled 50 to 40 computations (20% saved)

series5.0ms (0.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	69	211

Stop Event

1×	iter-limit

Counts

6 → 17

Calls

Call 1

Inputs
#s(approx (+ (+ x y) z) x)
x
#s(approx (+ (+ x y) z) y)
y
#s(approx (+ (+ x y) z) (+.f64 x y))
(+.f64 x y)

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

Calls

9 calls:

Time	Variable	Point
0.0ms	x	-inf
0.0ms	y	-inf
0.0ms	x	inf
0.0ms	y	inf
0.0ms	z	inf

rewrite8.0ms (0.9%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	28
0	10	28
1	18	28
2	47	28
3	98	28
4	116	28
0	116	28

Stop Event

1×	iter-limit
1×	saturated
1×	iter-limit

Counts

6 → 10

Calls

Call 1

Inputs
#s(approx (+ (+ x y) z) x)
x
#s(approx (+ (+ x y) z) y)
y
#s(approx (+ (+ x y) z) (+.f64 x y))
(+.f64 x y)

Outputs
#s(approx (+ (+ x y) z) x)
x
#s(approx (+ (+ x y) z) y)
y
#s(approx (+ (+ x y) z) (+.f64 y x))
(neg.f64 (-.f64 (neg.f64 x) y))
(-.f64 y (neg.f64 x))
(-.f64 x (neg.f64 y))
(+.f64 y x)
(+.f64 x y)

eval2.0ms (0.2%)

Memory: 5.5MiB live, 5.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 304 to 89 computations (70.7% saved)

prune28.0ms (3.4%)

Memory

-43.2MiB live, 7.2MiB allocated; 16ms collecting garbage

Pruning

6 alts after pruning (0 fresh and 6 done)

	Pruned	Kept	Total
New	22	0	22
Fresh	0	0	0
Picked	0	3	3
Done	0	3	3
Total	22	6	28

Accuracy

100.0%

Counts

28 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	49.2%	(+.f64 #s(approx (+ x y) y) z)
✓	98.6%	#s(approx (+ (+ x y) z) (+.f64 x z))
✓	53.4%	#s(approx (+ (+ x y) z) (+.f64 x y))
✓	47.5%	#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
✓	4.4%	#s(approx (+ (+ x y) z) y)
✓	52.1%	#s(approx (+ (+ x y) z) x)

Compiler

Compiled 50 to 40 computations (20% saved)

regimes67.0ms (8%)

Memory

0.4MiB live, 138.3MiB allocated; 14ms collecting garbage

Accuracy

Total -31.2b remaining (-91%)

Threshold costs -31.2b (-91%)

Counts

2 → 1

3 → 2

4 → 2

6 → 1

7 → 1

Calls

Call 1

Inputs
#s(approx (+ (+ x y) z) x)
#s(approx (+ (+ x y) z) y)

Outputs
#s(approx (+ (+ x y) z) x)

Call 2

Inputs
#s(approx (+ (+ x y) z) x)
#s(approx (+ (+ x y) z) y)
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))

Outputs
#s(approx (+ (+ x y) z) x)
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))

Call 3

Inputs
#s(approx (+ (+ x y) z) x)
#s(approx (+ (+ x y) z) y)
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
#s(approx (+ (+ x y) z) (+.f64 x y))

Outputs
#s(approx (+ (+ x y) z) (+.f64 x y))
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))

Call 4

Inputs
#s(approx (+ (+ x y) z) x)
#s(approx (+ (+ x y) z) y)
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
#s(approx (+ (+ x y) z) (+.f64 x y))
#s(approx (+ (+ x y) z) (+.f64 x z))
(+.f64 #s(approx (+ x y) y) z)

Outputs
#s(approx (+ (+ x y) z) (+.f64 x z))

Call 5

Inputs
#s(approx (+ (+ x y) z) x)
#s(approx (+ (+ x y) z) y)
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
#s(approx (+ (+ x y) z) (+.f64 x y))
#s(approx (+ (+ x y) z) (+.f64 x z))
(+.f64 #s(approx (+ x y) y) z)
(+.f64 (+.f64 x y) z)

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

Calls

21 calls:

22.0ms	z
4.0ms	x
2.0ms	z
2.0ms	y
2.0ms	x

Results

Accuracy	Segments	Branch
52.1%	1	`y`
52.1%	1	`z`
52.1%	1	`x`
52.1%	1	`(+.f64 x y)`
52.1%	1	`(+.f64 (+.f64 x y) z)`
97.6%	2	`(+.f64 (+.f64 x y) z)`
83.6%	2	`(+.f64 x y)`
98.2%	2	`(+.f64 (+.f64 x y) z)`
82.5%	2	`x`
77.2%	2	`y`
77.6%	2	`z`
98.6%	1	`(+.f64 x y)`
98.6%	1	`(+.f64 (+.f64 x y) z)`
98.6%	1	`x`
98.6%	1	`y`
98.6%	1	`z`
100.0%	1	`(+.f64 x y)`
100.0%	1	`(+.f64 (+.f64 x y) z)`
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`z`

Compiler

Compiled 104 to 94 computations (9.6% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-3.218102399777338e-153	1.2480256047585474e-145

Compiler

Compiled 8 to 11 computations (-37.5% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-3.218102399777338e-153	1.2480256047585474e-145

Compiler

Compiled 8 to 11 computations (-37.5% saved)

derivations2.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 75 to 18 computations (76% saved)

preprocess38.0ms (4.6%)

Memory: 10.5MiB live, 110.0MiB allocated; 12ms collecting garbage
Compiler: Compiled 230 to 115 computations (50% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample556.0ms (67%)

preprocess17.0ms (2%)

series45.0ms (5.5%)

rewrite10.0ms (1.2%)

eval8.0ms (0.9%)

prune2.0ms (0.2%)

series6.0ms (0.7%)

rewrite8.0ms (1%)

eval6.0ms (0.8%)

prune2.0ms (0.2%)

series5.0ms (0.6%)

rewrite8.0ms (0.9%)

eval6.0ms (0.7%)

prune1.0ms (0.2%)

series5.0ms (0.6%)

rewrite8.0ms (0.9%)

eval2.0ms (0.2%)

prune28.0ms (3.4%)

regimes67.0ms (8%)

bsearch0.0ms (0%)

bsearch0.0ms (0%)

derivations2.0ms (0.3%)

preprocess38.0ms (4.6%)

end0.0ms (0%)

Profiling