Metrics for Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, 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)

sample514.0ms (63.3%)

Memory

-8.3MiB live, 571.5MiB allocated; 196ms collecting garbage

Samples

344.0ms

8 256×

valid

Precisions

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

ival-mult!: 103.0ms (82% of total)

ival-sub!: 21.0ms (16.7% of total)

adjust: 1.0ms (0.8% of total)

Bogosity

preprocess79.0ms (9.7%)

Memory

-31.9MiB live, 19.7MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	33	30
2	83	30
3	210	30
4	443	30
5	1135	30
6	4854	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)

series4.0ms (0.5%)

Memory

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

Counts

5 → 11

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

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((- (* x 2) y) (* x 2) x 2 y)
1.0ms	x	@	inf	((- (* x 2) y) (* x 2) x 2 y)
0.0ms	x	@	0	((- (* x 2) y) (* x 2) x 2 y)
0.0ms	y	@	-inf	((- (* x 2) y) (* x 2) x 2 y)
0.0ms	y	@	inf	((- (* x 2) y) (* x 2) x 2 y)

rewrite69.0ms (8.5%)

Memory

35.2MiB live, 82.2MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	40	128
0	41	121
1	191	119
0	1439	117

Stop Event

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

Counts

16 → 54

Calls

Call 1

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

Outputs
(/.f64 (-.f64 (.f64 (.f64 y y) (neg.f64 y)) (pow.f64 (.f64 #s(literal -2 binary64) x) #s(literal 3 binary64))) (fma.f64 y y (fma.f64 (.f64 x x) #s(literal 4 binary64) (.f64 (neg.f64 y) (.f64 #s(literal -2 binary64) x)))))
(/.f64 (-.f64 (.f64 y y) (.f64 (*.f64 x x) #s(literal 4 binary64))) (neg.f64 (fma.f64 #s(literal 2 binary64) x y)))
(/.f64 (-.f64 (.f64 y y) (.f64 (*.f64 x x) #s(literal 4 binary64))) (-.f64 (-.f64 (neg.f64 y) x) x))
(/.f64 (neg.f64 (-.f64 (.f64 (.f64 (.f64 x x) #s(literal 4 binary64)) (+.f64 x x)) (.f64 (.f64 y y) y))) (neg.f64 (fma.f64 (.f64 x x) #s(literal 4 binary64) (*.f64 y (fma.f64 #s(literal 2 binary64) x y)))))
(/.f64 (neg.f64 (-.f64 (.f64 (.f64 (.f64 x x) #s(literal 4 binary64)) (+.f64 x x)) (.f64 (.f64 y y) y))) (neg.f64 (fma.f64 (+.f64 x x) (-.f64 (+.f64 x x) (neg.f64 y)) (.f64 y y))))
(/.f64 (-.f64 (.f64 (.f64 x x) #s(literal 4 binary64)) (*.f64 y y)) (-.f64 (+.f64 x x) (neg.f64 y)))
(/.f64 (-.f64 (.f64 (.f64 x x) #s(literal 4 binary64)) (*.f64 y y)) (neg.f64 (-.f64 (-.f64 (neg.f64 y) x) x)))
(/.f64 (-.f64 (.f64 (.f64 x x) #s(literal 4 binary64)) (*.f64 y y)) (fma.f64 #s(literal 2 binary64) x y))
(/.f64 (-.f64 (.f64 (.f64 (.f64 x x) #s(literal 4 binary64)) (+.f64 x x)) (.f64 (.f64 y y) y)) (fma.f64 (.f64 x x) #s(literal 4 binary64) (-.f64 (.f64 y y) (.f64 (+.f64 x x) (neg.f64 y)))))
(/.f64 (-.f64 (.f64 (.f64 (.f64 x x) #s(literal 4 binary64)) (+.f64 x x)) (.f64 (.f64 y y) y)) (fma.f64 (.f64 x x) #s(literal 4 binary64) (*.f64 y (fma.f64 #s(literal 2 binary64) x y))))
(/.f64 (-.f64 (.f64 (.f64 (.f64 x x) #s(literal 4 binary64)) (+.f64 x x)) (.f64 (.f64 y y) y)) (fma.f64 (+.f64 x x) (-.f64 (+.f64 x x) (neg.f64 y)) (.f64 y y)))
(neg.f64 (-.f64 (*.f64 #s(literal -2 binary64) x) (neg.f64 y)))
(neg.f64 (-.f64 (-.f64 y x) x))
(fma.f64 #s(literal -1 binary64) y (+.f64 x x))
(fma.f64 y #s(literal -1 binary64) (+.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 (.f64 x x) #s(literal 4 binary64)) (fma.f64 #s(literal 2 binary64) x y)) (/.f64 (*.f64 y y) (fma.f64 #s(literal 2 binary64) x y)))
(-.f64 (/.f64 (.f64 y y) (-.f64 (-.f64 (neg.f64 y) x) x)) (/.f64 (.f64 (*.f64 x x) #s(literal 4 binary64)) (-.f64 (-.f64 (neg.f64 y) x) x)))
(-.f64 (/.f64 (.f64 (.f64 (.f64 x x) #s(literal 4 binary64)) (+.f64 x x)) (fma.f64 (.f64 x x) #s(literal 4 binary64) (.f64 y (fma.f64 #s(literal 2 binary64) x y)))) (/.f64 (.f64 (.f64 y y) y) (fma.f64 (.f64 x x) #s(literal 4 binary64) (*.f64 y (fma.f64 #s(literal 2 binary64) x y)))))
(-.f64 (+.f64 x x) (*.f64 (neg.f64 y) #s(literal -1 binary64)))
(-.f64 (+.f64 x x) y)
(-.f64 (neg.f64 y) (*.f64 (neg.f64 x) #s(literal 2 binary64)))
(-.f64 (neg.f64 y) (*.f64 #s(literal -2 binary64) x))
(+.f64 (+.f64 (neg.f64 y) x) x)
(+.f64 (/.f64 (.f64 (.f64 y y) (neg.f64 y)) (fma.f64 (+.f64 x x) (-.f64 (+.f64 x x) (neg.f64 y)) (.f64 y y))) (/.f64 (.f64 (.f64 (.f64 x x) #s(literal 4 binary64)) (+.f64 x x)) (fma.f64 (+.f64 x x) (-.f64 (+.f64 x x) (neg.f64 y)) (*.f64 y y))))
(+.f64 (+.f64 x x) (neg.f64 y))
(+.f64 (neg.f64 y) (+.f64 x x))
(+.f64 x (-.f64 x y))
(+.f64 x (+.f64 x (neg.f64 y)))
(*.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))))
(neg.f64 (*.f64 #s(literal -2 binary64) 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 (.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
#s(approx (- (* x 2) y) (neg.f64 y))
#s(approx (- (* x 2) y) (-.f64 (+.f64 x x) y))
#s(approx (* x 2) (+.f64 x x))
#s(approx x x)
#s(approx (- (* x 2) y) (+.f64 x x))
#s(approx (- (* x 2) y) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 y x)) x))
#s(approx (- (* x 2) y) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 y x)) x))
#s(approx (- (* x 2) y) (-.f64 (+.f64 x x) y))
#s(approx y y)
#s(approx (- (* x 2) y) (*.f64 (fma.f64 (/.f64 x y) #s(literal 2 binary64) #s(literal -1 binary64)) y))
#s(approx (- (* x 2) y) (*.f64 (fma.f64 (/.f64 x y) #s(literal 2 binary64) #s(literal -1 binary64)) y))

eval8.0ms (1%)

Memory: -32.2MiB live, 11.4MiB allocated; 5ms collecting garbage
Compiler: Compiled 303 to 132 computations (56.4% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	44	3	47
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	45	3	48

Accuracy

100.0%

Counts

48 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 18 to 18 computations (0% saved)

series3.0ms (0.3%)

Memory

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

Counts

7 → 20

Calls

Call 1

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

Outputs
#s(approx (- (* x 2) y) #s(hole binary64 (* -1 y)))
#s(approx (- (* x 2) y) #s(hole binary64 (- (* 2 x) y)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- (+ x x) y) #s(hole binary64 (* -1 y)))
#s(approx (- (+ x x) y) #s(hole binary64 (- (* 2 x) y)))
#s(approx (- (* x 2) y) #s(hole binary64 (* 2 x)))
#s(approx (- (* x 2) y) #s(hole binary64 (* x (+ 2 (* -1 (/ y x))))))
#s(approx (- (+ x x) y) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) y) #s(hole binary64 (* x (+ 2 (* -1 (/ y x))))))
#s(approx (- (* x 2) y) #s(hole binary64 (* -1 (* x (- (/ y x) 2)))))
#s(approx (- (+ x x) y) #s(hole binary64 (* -1 (* x (- (/ y x) 2)))))
#s(approx (- (* x 2) y) #s(hole binary64 (+ (* -1 y) (* 2 x))))
#s(approx (neg y) #s(hole binary64 (* -1 y)))
#s(approx y #s(hole binary64 y))
#s(approx (- (+ x x) y) #s(hole binary64 (+ (* -1 y) (* 2 x))))
#s(approx (- (* x 2) y) #s(hole binary64 (* y (- (* 2 (/ x y)) 1))))
#s(approx (- (+ x x) y) #s(hole binary64 (* y (- (* 2 (/ x y)) 1))))
#s(approx (- (* x 2) y) #s(hole binary64 (* -1 (* y (+ 1 (* -2 (/ x y)))))))
#s(approx (- (+ x x) y) #s(hole binary64 (* -1 (* y (+ 1 (* -2 (/ x y)))))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((- (* x 2) y) (neg y) y (- (* x 2) y) (+ x x) x (- (+ x x) y))
0.0ms	x	@	inf	((- (* x 2) y) (neg y) y (- (* x 2) y) (+ x x) x (- (+ x x) y))
0.0ms	y	@	-inf	((- (* x 2) y) (neg y) y (- (* x 2) y) (+ x x) x (- (+ x x) y))
0.0ms	y	@	inf	((- (* x 2) y) (neg y) y (- (* x 2) y) (+ x x) x (- (+ x x) y))
0.0ms	x	@	0	((- (* x 2) y) (neg y) y (- (* x 2) y) (+ x x) x (- (+ x x) y))

rewrite39.0ms (4.8%)

Memory

15.8MiB live, 53.0MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	55	256
0	58	243
0	234	239

Stop Event

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

Counts

27 → 46

Calls

Call 1

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

Outputs
#s(approx (- (* x 2) y) (neg.f64 y))
(*.f64 #s(literal -1 binary64) y)
(*.f64 y #s(literal -1 binary64))
(neg.f64 y)
y
#s(approx (- (* x 2) y) (+.f64 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 x)
x
(/.f64 (-.f64 (.f64 (+.f64 x x) (+.f64 x x)) (.f64 y y)) (fma.f64 #s(literal 2 binary64) x y))
(/.f64 (-.f64 (.f64 (neg.f64 y) (neg.f64 y)) (.f64 (+.f64 x x) (+.f64 x x))) (-.f64 (neg.f64 y) (+.f64 x x)))
(/.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))))
(/.f64 (+.f64 (pow.f64 (neg.f64 y) #s(literal 3 binary64)) (pow.f64 (+.f64 x x) #s(literal 3 binary64))) (fma.f64 (neg.f64 y) (neg.f64 y) (-.f64 (.f64 (+.f64 x x) (+.f64 x x)) (.f64 (neg.f64 y) (+.f64 x x)))))
(neg.f64 (-.f64 y (+.f64 x x)))
(fma.f64 #s(literal -1 binary64) y (+.f64 x x))
(fma.f64 y #s(literal -1 binary64) (+.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 x x) y)
(-.f64 (neg.f64 y) (*.f64 #s(literal -2 binary64) x))
(+.f64 (+.f64 x x) (neg.f64 y))
(+.f64 (neg.f64 y) (+.f64 x x))
(+.f64 x (-.f64 x y))
#s(approx (- (* x 2) y) (neg.f64 y))
#s(approx (- (* x 2) y) (-.f64 (+.f64 x x) y))
#s(approx (+ x x) (+.f64 x x))
#s(approx x x)
#s(approx (- (* x 2) y) (neg.f64 y))
#s(approx (- (* x 2) y) (-.f64 (+.f64 x x) y))
#s(approx (- (* x 2) y) (+.f64 x x))
#s(approx (- (* x 2) y) (*.f64 (+.f64 (/.f64 (neg.f64 y) x) #s(literal 2 binary64)) x))
#s(approx (- (* x 2) y) (+.f64 x x))
#s(approx (- (* x 2) y) (*.f64 (+.f64 (/.f64 (neg.f64 y) x) #s(literal 2 binary64)) x))
#s(approx (- (* x 2) y) (neg.f64 (*.f64 (-.f64 (/.f64 y x) #s(literal 2 binary64)) x)))
#s(approx (- (* x 2) y) (neg.f64 (*.f64 (-.f64 (/.f64 y x) #s(literal 2 binary64)) x)))
#s(approx (- (* x 2) y) (-.f64 (+.f64 x x) y))
#s(approx (neg y) (neg.f64 y))
#s(approx y y)
#s(approx (- (* x 2) y) (-.f64 (+.f64 x x) y))
#s(approx (- (* x 2) y) (*.f64 (fma.f64 (/.f64 x y) #s(literal 2 binary64) #s(literal -1 binary64)) y))
#s(approx (- (* x 2) y) (*.f64 (fma.f64 (/.f64 x y) #s(literal 2 binary64) #s(literal -1 binary64)) y))
#s(approx (- (* x 2) y) (*.f64 (neg.f64 y) (fma.f64 #s(literal -2 binary64) (/.f64 x y) #s(literal 1 binary64))))
#s(approx (- (* x 2) y) (*.f64 (neg.f64 y) (fma.f64 #s(literal -2 binary64) (/.f64 x y) #s(literal 1 binary64))))

eval3.0ms (0.4%)

Memory: 6.2MiB live, 6.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 183 to 104 computations (43.2% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	37	0	37
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	37	3	40

Accuracy

100.0%

Counts

40 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 34 to 31 computations (8.8% saved)

regimes7.0ms (0.9%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

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

Calls

4 calls:

2.0ms	(-.f64 (*.f64 x #s(literal 2 binary64)) y)
2.0ms	y
2.0ms	(*.f64 x #s(literal 2 binary64))
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)

regimes27.0ms (3.3%)

Memory

-36.9MiB live, 17.9MiB allocated; 22ms collecting garbage

Counts

2 → 3

Calls

Call 1

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

23.0ms	y
1.0ms	(-.f64 (*.f64 x #s(literal 2 binary64)) y)
1.0ms	x
1.0ms	(*.f64 x #s(literal 2 binary64))

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.5%)

Memory

12.3MiB live, 12.3MiB 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:

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

Results

Accuracy	Segments	Branch
48.3%	1	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
48.3%	1	`(*.f64 x #s(literal 2 binary64))`
48.3%	1	`x`
48.3%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch18.0ms (2.2%)

Memory

-21.7MiB live, 26.1MiB allocated; 4ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
10.0ms	3.141837040409787e+120	1.3252122850546145e+124
7.0ms	-5.401810617443803	-0.027465365957478102

Samples

9.0ms

240×

valid

Compiler

Compiled 218 to 250 computations (-14.7% saved)

Precisions

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

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

ival-mult!: 1.0ms (54.6% of total)

adjust: 0.0ms (0% of total)

derivations13.0ms (1.6%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 19 to 16 computations (15.8% saved)

preprocess20.0ms (2.5%)

Memory: -2.3MiB live, 43.1MiB allocated; 6ms 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%)

sample514.0ms (63.3%)

preprocess79.0ms (9.7%)

series4.0ms (0.5%)

rewrite69.0ms (8.5%)

eval8.0ms (1%)

prune2.0ms (0.2%)

series3.0ms (0.3%)

rewrite39.0ms (4.8%)

eval3.0ms (0.4%)

prune2.0ms (0.3%)

regimes7.0ms (0.9%)

regimes27.0ms (3.3%)

regimes4.0ms (0.5%)

bsearch18.0ms (2.2%)

derivations13.0ms (1.6%)

preprocess20.0ms (2.5%)

end0.0ms (0%)

Profiling