Metrics for Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, C

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample725.0ms (59.4%)

Memory

-22.4MiB live, 1 451.1MiB allocated; 263ms collecting garbage

Samples

472.0ms

8 256×

valid

Precisions

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

ival-sub!: 113.0ms (50.5% of total)

ival-mult!: 109.0ms (48.7% of total)

adjust: 2.0ms (0.9% of total)

Bogosity

preprocess128.0ms (10.5%)

Memory

4.5MiB live, 91.9MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	34	30
2	90	30
3	257	30
4	602	30
5	2829	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 (*.f64 x #s(literal 2 binary64)) y)

Compiler

Compiled 10 to 10 computations (0% saved)

series7.0ms (0.6%)

Memory

31.3MiB live, 31.4MiB allocated; 0ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	37	107

Stop Event

1×	iter-limit

Counts

5 → 10

Calls

Call 1

Inputs
(-.f64 (*.f64 x #s(literal 2 binary64)) y)
(*.f64 x #s(literal 2 binary64))
x
#s(literal 2 binary64)
y

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

Calls

6 calls:

Time	Variable	Point
1.0ms	x	inf
1.0ms	x	-inf
0.0ms	x	0
0.0ms	y	-inf
0.0ms	y	inf

rewrite56.0ms (4.6%)

Memory

-27.9MiB live, 117.1MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	30	11
0	266	11

Stop Event

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

Counts

5 → 33

Calls

Call 1

Inputs
(-.f64 (*.f64 x #s(literal 2 binary64)) y)
(*.f64 x #s(literal 2 binary64))
x
#s(literal 2 binary64)
y

Outputs
(.f64 (.f64 (-.f64 #s(literal 1 binary64) (/.f64 y (+.f64 x x))) #s(literal 2 binary64)) x)
(.f64 (.f64 (-.f64 #s(literal 1 binary64) (/.f64 y (+.f64 x x))) x) #s(literal 2 binary64))
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 (neg.f64 y) (+.f64 x x))) (+.f64 x x))
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 y (+.f64 x x))) (+.f64 x x))
(.f64 (-.f64 (.f64 #s(literal 4 binary64) (.f64 x x)) (.f64 y y)) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 2 binary64) x y)))
(.f64 (-.f64 (.f64 (.f64 #s(literal 4 binary64) (.f64 x x)) (+.f64 x x)) (.f64 (.f64 y y) y)) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 4 binary64) (.f64 x x) (.f64 y (fma.f64 #s(literal 2 binary64) x y)))))
(*.f64 (+.f64 x x) (-.f64 #s(literal 1 binary64) (/.f64 y (+.f64 x x))))
(/.f64 (fma.f64 (.f64 #s(literal 4 binary64) (.f64 x x)) (+.f64 x x) (pow.f64 (neg.f64 y) #s(literal 3 binary64))) (fma.f64 #s(literal 4 binary64) (.f64 x x) (-.f64 (.f64 y y) (*.f64 (+.f64 x x) (neg.f64 y)))))
(/.f64 (neg.f64 (-.f64 (.f64 #s(literal 4 binary64) (.f64 x x)) (*.f64 y y))) (neg.f64 (fma.f64 #s(literal 2 binary64) x y)))
(/.f64 (neg.f64 (-.f64 (.f64 (.f64 #s(literal 4 binary64) (.f64 x x)) (+.f64 x x)) (.f64 (.f64 y y) y))) (neg.f64 (fma.f64 #s(literal 4 binary64) (.f64 x x) (*.f64 y (fma.f64 #s(literal 2 binary64) x y)))))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 #s(literal 2 binary64) x y) (-.f64 (.f64 #s(literal 4 binary64) (.f64 x x)) (*.f64 y y))))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 #s(literal 4 binary64) (.f64 x x) (.f64 y (fma.f64 #s(literal 2 binary64) x y))) (-.f64 (.f64 (.f64 #s(literal 4 binary64) (.f64 x x)) (+.f64 x x)) (.f64 (*.f64 y y) y))))
(/.f64 (-.f64 (.f64 #s(literal 4 binary64) (.f64 x x)) (*.f64 y y)) (fma.f64 #s(literal 2 binary64) x y))
(/.f64 (-.f64 (.f64 (.f64 #s(literal 4 binary64) (.f64 x x)) (+.f64 x x)) (.f64 (.f64 y y) y)) (fma.f64 #s(literal 4 binary64) (.f64 x x) (*.f64 y (fma.f64 #s(literal 2 binary64) x y))))
(neg.f64 (-.f64 y (+.f64 x x)))
(fma.f64 #s(literal 2 binary64) x (neg.f64 y))
(fma.f64 x #s(literal 2 binary64) (neg.f64 y))
(-.f64 (/.f64 (.f64 #s(literal 4 binary64) (.f64 x x)) (fma.f64 #s(literal 2 binary64) x y)) (/.f64 (*.f64 y y) (fma.f64 #s(literal 2 binary64) x y)))
(-.f64 (/.f64 (.f64 (.f64 #s(literal 4 binary64) (.f64 x x)) (+.f64 x x)) (fma.f64 #s(literal 4 binary64) (.f64 x x) (.f64 y (fma.f64 #s(literal 2 binary64) x y)))) (/.f64 (.f64 (.f64 y y) y) (fma.f64 #s(literal 4 binary64) (.f64 x x) (*.f64 y (fma.f64 #s(literal 2 binary64) x y)))))
(-.f64 (+.f64 x x) (neg.f64 (neg.f64 y)))
(-.f64 (+.f64 x x) y)
(+.f64 (neg.f64 y) (+.f64 x x))
(+.f64 (+.f64 x x) (neg.f64 y))
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))
(fma.f64 #s(literal 1 binary64) x (*.f64 #s(literal 1 binary64) x))
(fma.f64 x #s(literal 1 binary64) (*.f64 x #s(literal 1 binary64)))
(+.f64 (.f64 x #s(literal 1 binary64)) (.f64 x #s(literal 1 binary64)))
(+.f64 (.f64 #s(literal 1 binary64) x) (.f64 #s(literal 1 binary64) x))
(+.f64 x x)
x
#s(literal 2 binary64)
y

eval4.0ms (0.3%)

Memory: 18.6MiB live, 18.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 520 to 115 computations (77.9% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	37	2	39
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	38	2	40

Accuracy

100.0%

Counts

40 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 (+.f64 x x) y)
▶	49.4%	#s(approx (- (* x 2) y) (*.f64 #s(literal -1 binary64) y))

Compiler

Compiled 14 to 12 computations (14.3% saved)

series40.0ms (3.3%)

Memory

-29.6MiB live, 15.1MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	38	107

Stop Event

1×	iter-limit

Counts

7 → 10

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (*.f64 #s(literal -1 binary64) y))
(*.f64 #s(literal -1 binary64) y)
#s(literal -1 binary64)
y
(-.f64 (+.f64 x x) y)
(+.f64 x x)
x

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

Calls

6 calls:

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

rewrite27.0ms (2.2%)

Memory

17.2MiB live, 60.5MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	23
0	13	21
0	73	21

Stop Event

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

Counts

7 → 24

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (*.f64 #s(literal -1 binary64) y))
(*.f64 #s(literal -1 binary64) y)
#s(literal -1 binary64)
y
(-.f64 (+.f64 x x) y)
(+.f64 x x)
x

Outputs
#s(approx (- (* x 2) y) (neg.f64 y))
(*.f64 #s(literal -1 binary64) y)
(*.f64 y #s(literal -1 binary64))
(neg.f64 y)
#s(literal -1 binary64)
y
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 y (+.f64 x x))) (+.f64 x x))
(/.f64 (-.f64 (.f64 (+.f64 x x) (+.f64 x x)) (.f64 y y)) (fma.f64 #s(literal 2 binary64) x y))
(/.f64 (-.f64 (pow.f64 (+.f64 x x) #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64))) (fma.f64 (+.f64 x x) (+.f64 x x) (fma.f64 y y (*.f64 (+.f64 x x) y))))
(neg.f64 (-.f64 y (+.f64 x x)))
(fma.f64 (+.f64 #s(literal 1 binary64) (/.f64 x x)) x (neg.f64 y))
(fma.f64 #s(literal 2 binary64) x (neg.f64 y))
(fma.f64 x #s(literal 2 binary64) (neg.f64 y))
(-.f64 (+.f64 x x) y)
(+.f64 (+.f64 x x) (neg.f64 y))
(+.f64 x (-.f64 x y))
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 x x)) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))
(/.f64 (-.f64 (.f64 x x) (.f64 x x)) (-.f64 x x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 x x) (.f64 x x))))
(-.f64 x (neg.f64 x))
(+.f64 x x)
x

eval3.0ms (0.2%)

Memory: 13.9MiB live, 13.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 292 to 91 computations (68.8% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	27	1	28
Fresh	0	0	0
Picked	1	1	2
Done	0	0	0
Total	28	2	30

Accuracy

100.0%

Counts

30 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) y)
▶	49.4%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 13 to 11 computations (15.4% saved)

series4.0ms (0.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	36	106

Stop Event

1×	iter-limit

Counts

3 → 9

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (neg.f64 y))
(neg.f64 y)
y

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

Calls

6 calls:

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

rewrite50.0ms (4.1%)

Memory

-28.5MiB live, 81.5MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	11
0	8	11
1	30	11
0	266	11

Stop Event

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

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (neg.f64 y))
(neg.f64 y)
y

Outputs
#s(approx (- (* x 2) y) (neg.f64 y))
(neg.f64 y)
y

eval1.0ms (0.1%)

Memory: 4.9MiB live, 4.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 113 to 39 computations (65.5% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	8	1	9
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	8	3	11

Accuracy

100.0%

Counts

11 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) y)
▶	51.6%	#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
✓	49.4%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 22 to 19 computations (13.6% saved)

series7.0ms (0.6%)

Memory

-25.7MiB live, 18.2MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	36	104

Stop Event

1×	iter-limit

Counts

4 → 9

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x

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

Calls

6 calls:

Time	Variable	Point
1.0ms	x	-inf
0.0ms	x	inf
0.0ms	x	0
0.0ms	y	inf
0.0ms	y	-inf

rewrite50.0ms (4.1%)

Memory

21.6MiB live, 124.5MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	14
0	8	14
1	32	14
0	290	14

Stop Event

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

Counts

4 → 14

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x

Outputs
#s(approx (- (* x 2) y) (+.f64 x x))
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 x x)) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))
(/.f64 (-.f64 (.f64 x x) (.f64 x x)) (-.f64 x x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 x x) (.f64 x x))))
(fma.f64 #s(literal 1 binary64) x (*.f64 #s(literal 1 binary64) x))
(fma.f64 x #s(literal 1 binary64) (*.f64 x #s(literal 1 binary64)))
(-.f64 x (neg.f64 x))
(+.f64 (.f64 x #s(literal 1 binary64)) (.f64 x #s(literal 1 binary64)))
(+.f64 (.f64 #s(literal 1 binary64) x) (.f64 #s(literal 1 binary64) x))
(+.f64 x x)
#s(literal 2 binary64)
x

eval2.0ms (0.2%)

Memory: 7.6MiB live, 7.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 259 to 73 computations (71.8% saved)

prune4.0ms (0.3%)

Memory

-40.4MiB live, 5.4MiB allocated; 3ms collecting garbage

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	19	1	20
Fresh	0	0	0
Picked	1	0	1
Done	0	2	2
Total	20	3	23

Accuracy

100.0%

Counts

23 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) y)
	51.6%	#s(approx (- (* x 2) y) (+.f64 x x))
✓	49.4%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 22 to 18 computations (18.2% saved)

regimes28.0ms (2.3%)

Memory

16.5MiB live, 105.2MiB allocated; 6ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

4 → 3

6 → 1

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (neg.f64 y))

Outputs
#s(approx (- (* x 2) y) (neg.f64 y))

Call 2

Inputs
#s(approx (- (* x 2) y) (neg.f64 y))
#s(approx (- (* x 2) y) (+.f64 x x))
#s(approx (- (* x 2) y) (*.f64 #s(literal -1 binary64) y))
#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))

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

Call 3

Inputs
#s(approx (- (* x 2) y) (neg.f64 y))
#s(approx (- (* x 2) y) (+.f64 x x))
#s(approx (- (* x 2) y) (*.f64 #s(literal -1 binary64) y))
#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
(-.f64 (+.f64 x x) y)
(-.f64 (*.f64 x #s(literal 2 binary64)) y)

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

Calls

12 calls:

5.0ms	(*.f64 x #s(literal 2 binary64))
3.0ms	(*.f64 x #s(literal 2 binary64))
2.0ms	(-.f64 (*.f64 x #s(literal 2 binary64)) y)
2.0ms	y
2.0ms	x

Results

Accuracy	Segments	Branch
49.4%	1	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
49.4%	1	`y`
49.4%	1	`(*.f64 x #s(literal 2 binary64))`
49.4%	1	`x`
80.3%	3	`(*.f64 x #s(literal 2 binary64))`
59.5%	4	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
80.3%	3	`x`
76.6%	3	`y`
100.0%	1	`(*.f64 x #s(literal 2 binary64))`
100.0%	1	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 75 to 57 computations (24% saved)

bsearch19.0ms (1.5%)

Memory

0.6MiB live, 56.6MiB allocated; 6ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
10.0ms	2.947696631502676e-31	1.3776605609317334e-30
8.0ms	-1.630774519693039e-37	-8.935741676280243e-41

Samples

7.0ms

224×

valid

Compiler

Compiled 246 to 234 computations (4.9% saved)

Precisions

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

ival-mult!: 2.0ms (79.1% of total)

ival-sub!: 1.0ms (39.5% of total)

adjust: 0.0ms (0% of total)

derivations5.0ms (0.4%)

Memory

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

Stop Event

1×

fuel

Compiler

Compiled 47 to 16 computations (66% saved)

preprocess57.0ms (4.7%)

Memory: -15.6MiB live, 72.4MiB allocated; 11ms collecting garbage
Compiler: Compiled 52 to 21 computations (59.6% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample725.0ms (59.4%)

preprocess128.0ms (10.5%)

series7.0ms (0.6%)

rewrite56.0ms (4.6%)

eval4.0ms (0.3%)

prune2.0ms (0.1%)

series40.0ms (3.3%)

rewrite27.0ms (2.2%)

eval3.0ms (0.2%)

prune1.0ms (0.1%)

series4.0ms (0.3%)

rewrite50.0ms (4.1%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series7.0ms (0.6%)

rewrite50.0ms (4.1%)

eval2.0ms (0.2%)

prune4.0ms (0.3%)

regimes28.0ms (2.3%)

bsearch19.0ms (1.5%)

derivations5.0ms (0.4%)

preprocess57.0ms (4.7%)

end0.0ms (0%)

Profiling