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

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

sample821.0ms (55.8%)

Memory

65.2MiB live, 1 185.4MiB allocated; 306ms collecting garbage

Samples

534.0ms

8 256×

valid

Precisions

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

ival-mult!: 149.0ms (77.2% of total)

ival-sub!: 42.0ms (21.7% of total)

adjust: 2.0ms (1% of total)

Bogosity

preprocess153.0ms (10.4%)

Memory

-34.8MiB live, 60.4MiB allocated; 25ms 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)

series12.0ms (0.8%)

Memory

28.0MiB live, 28.0MiB 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	Expression
2.0ms	x	@	-inf	((- (* x 2) y) (* x 2) x 2 y)
2.0ms	x	@	inf	((- (* x 2) y) (* x 2) x 2 y)
1.0ms	x	@	0	((- (* x 2) y) (* x 2) x 2 y)
1.0ms	y	@	-inf	((- (* x 2) y) (* x 2) x 2 y)
1.0ms	y	@	inf	((- (* x 2) y) (* x 2) x 2 y)

rewrite68.0ms (4.6%)

Memory

-3.9MiB live, 86.0MiB allocated; 13ms 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

eval3.0ms (0.2%)

Memory: 7.7MiB live, 7.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 244 to 115 computations (52.9% saved)

prune2.0ms (0.1%)

Memory

3.3MiB live, 3.3MiB 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)
▶	50.3%	#s(approx (- (* x 2) y) (*.f64 #s(literal -1 binary64) y))

Compiler

Compiled 12 to 12 computations (0% saved)

series4.0ms (0.3%)

Memory

8.9MiB live, 8.9MiB allocated; 0ms 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	Expression
1.0ms	x	@	-inf	((- (* x 2) y) (* -1 y) -1 y (- (+ x x) y) (+ x x) x)
0.0ms	y	@	inf	((- (* x 2) y) (* -1 y) -1 y (- (+ x x) y) (+ x x) x)
0.0ms	y	@	-inf	((- (* x 2) y) (* -1 y) -1 y (- (+ x x) y) (+ x x) x)
0.0ms	x	@	inf	((- (* x 2) y) (* -1 y) -1 y (- (+ x x) y) (+ x x) x)
0.0ms	y	@	0	((- (* x 2) y) (* -1 y) -1 y (- (+ x x) y) (+ x x) x)

rewrite31.0ms (2.1%)

Memory

-6.1MiB live, 39.8MiB allocated; 4ms 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

eval5.0ms (0.3%)

Memory: 7.8MiB live, 7.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 136 to 91 computations (33.1% saved)

prune2.0ms (0.2%)

Memory

3.6MiB live, 3.6MiB 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)
▶	50.3%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 11 to 11 computations (0% saved)

series33.0ms (2.2%)

Memory

-55.1MiB live, 23.1MiB allocated; 21ms 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	Expression
1.0ms	y	@	-inf	((- (* x 2) y) (neg y) y)
1.0ms	y	@	inf	((- (* x 2) y) (neg y) y)
0.0ms	x	@	inf	((- (* x 2) y) (neg y) y)
0.0ms	x	@	-inf	((- (* x 2) y) (neg y) y)
0.0ms	y	@	0	((- (* x 2) y) (neg y) y)

rewrite63.0ms (4.3%)

Memory

6.5MiB live, 97.9MiB allocated; 8ms 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

eval2.0ms (0.1%)

Memory: 4.1MiB live, 4.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 59 to 39 computations (33.9% saved)

prune2.0ms (0.1%)

Memory

5.9MiB live, 5.9MiB 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)
▶	50.7%	#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
✓	50.3%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 19 to 19 computations (0% saved)

series6.0ms (0.4%)

Memory

14.3MiB live, 14.3MiB allocated; 0ms 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	Expression
1.0ms	x	@	-inf	((- (* x 2) y) (* 2 x) 2 x)
1.0ms	x	@	inf	((- (* x 2) y) (* 2 x) 2 x)
0.0ms	x	@	0	((- (* x 2) y) (* 2 x) 2 x)
0.0ms	y	@	inf	((- (* x 2) y) (* 2 x) 2 x)
0.0ms	y	@	-inf	((- (* x 2) y) (* 2 x) 2 x)

rewrite146.0ms (9.9%)

Memory

-16.2MiB live, 130.0MiB allocated; 8ms 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

eval3.0ms (0.2%)

Memory: 7.9MiB live, 7.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 104 to 73 computations (29.8% saved)

prune3.0ms (0.2%)

Memory

6.1MiB live, 6.1MiB allocated; 0ms 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)
	50.7%	#s(approx (- (* x 2) y) (+.f64 x x))
✓	50.3%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 42 to 36 computations (14.3% saved)

regimes18.0ms (1.2%)

Memory

-15.8MiB live, 29.7MiB allocated; 4ms collecting garbage

Counts

6 → 1

Calls

Call 1

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

4 calls:

6.0ms	y
4.0ms	(*.f64 x #s(literal 2 binary64))
4.0ms	(-.f64 (*.f64 x #s(literal 2 binary64)) y)
2.0ms	x

Results

Accuracy	Segments	Branch
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 10 to 13 computations (-30% saved)

regimes17.0ms (1.2%)

Memory

-12.8MiB live, 33.2MiB allocated; 3ms collecting garbage

Counts

4 → 3

Calls

Call 1

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) (neg.f64 y))
#s(approx (- (* x 2) y) (+.f64 x x))
#s(approx (- (* x 2) y) (neg.f64 y))

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
76.4%	3	`(*.f64 x #s(literal 2 binary64))`
65.5%	6	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
76.4%	3	`x`
79.9%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes8.0ms (0.6%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

2.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
50.3%	1	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
50.3%	1	`(*.f64 x #s(literal 2 binary64))`
50.3%	1	`x`
50.3%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch31.0ms (2.1%)

Memory

-7.5MiB live, 43.6MiB allocated; 5ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
8.0ms	5.510088589939509e-5	0.00013264467278326469
20.0ms	-1.5867804295831535e-55	-4.44197703827641e-61

Samples

11.0ms

224×

valid

Compiler

Compiled 204 to 234 computations (-14.7% saved)

Precisions

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

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

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

adjust: 0.0ms (0% of total)

derivations7.0ms (0.5%)

Memory

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

Stop Event

1×

fuel

Compiler

Compiled 19 to 16 computations (15.8% saved)

preprocess28.0ms (1.9%)

Memory: -20.6MiB live, 69.9MiB allocated; 7ms collecting garbage
Compiler: Compiled 24 to 21 computations (12.5% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample821.0ms (55.8%)

preprocess153.0ms (10.4%)

series12.0ms (0.8%)

rewrite68.0ms (4.6%)

eval3.0ms (0.2%)

prune2.0ms (0.1%)

series4.0ms (0.3%)

rewrite31.0ms (2.1%)

eval5.0ms (0.3%)

prune2.0ms (0.2%)

series33.0ms (2.2%)

rewrite63.0ms (4.3%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

series6.0ms (0.4%)

rewrite146.0ms (9.9%)

eval3.0ms (0.2%)

prune3.0ms (0.2%)

regimes18.0ms (1.2%)

regimes17.0ms (1.2%)

regimes8.0ms (0.6%)

bsearch31.0ms (2.1%)

derivations7.0ms (0.5%)

preprocess28.0ms (1.9%)

end0.0ms (0%)

Profiling