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.5MiB live, 0.5MiB 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)

sample506.0ms (59.5%)

Memory

37.8MiB live, 704.7MiB allocated; 55ms collecting garbage

Samples

339.0ms

8 256×

valid

Precisions

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

ival-mult!: 69.0ms (74.2% of total)

ival-sub!: 22.0ms (23.7% of total)

adjust: 1.0ms (1.1% of total)

Bogosity

explain66.0ms (7.8%)

Memory

6.8MiB live, 108.6MiB allocated; 31ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
-	-	`(*.f64 x #s(literal 2 binary64))`
-	-	`#s(literal 2 binary64)`
-	-	`y`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

16.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult!: 3.0ms (67.4% of total)

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

adjust: 0.0ms (0% of total)

preprocess77.0ms (9%)

Memory

-44.9MiB live, 49.9MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	20	32
2	42	32
3	94	32
4	213	30
5	826	30
6	4648	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

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

rewrite64.0ms (7.6%)

Memory

2.9MiB live, 99.6MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	40	128
0	42	122
1	180	121
0	1320	119

Stop Event

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

Counts

16 → 52

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

eval4.0ms (0.5%)

Memory: 11.8MiB live, 11.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 597 to 139 computations (76.7% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	44	2	46
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	44	3	47

Accuracy

100.0%

Counts

47 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 22 to 20 computations (9.1% saved)

series2.0ms (0.3%)

Memory

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

Counts

7 → 12

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (neg.f64 y))
(neg.f64 y)
y
#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) #s(hole binary64 (* -1 y)))
#s(approx (- (* x 2) y) #s(hole binary64 (- (* 2 x) y)))
#s(approx (* 2 x) #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 (neg y) #s(hole binary64 (* -1 y)))
#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) (neg y) y (- (* x 2) y) (* 2 x) 2 x)
0.0ms	x	@	inf	((- (* x 2) y) (neg y) y (- (* x 2) y) (* 2 x) 2 x)
0.0ms	y	@	-inf	((- (* x 2) y) (neg y) y (- (* x 2) y) (* 2 x) 2 x)
0.0ms	y	@	inf	((- (* x 2) y) (neg y) y (- (* x 2) y) (* 2 x) 2 x)
0.0ms	x	@	0	((- (* x 2) y) (neg y) y (- (* x 2) y) (* 2 x) 2 x)

rewrite49.0ms (5.7%)

Memory

-29.4MiB live, 65.2MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	44	148
0	45	141
1	181	140
0	1321	138

Stop Event

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

Counts

19 → 30

Calls

Call 1

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

eval2.0ms (0.2%)

Memory: 4.9MiB live, 4.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 249 to 72 computations (71.1% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	20	0	20
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
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 #s(literal 2 binary64)) y)
✓	51.4%	#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
✓	49.6%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 44 to 32 computations (27.3% saved)

regimes7.0ms (0.8%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

regimes11.0ms (1.3%)

Memory

-22.1MiB live, 27.6MiB allocated; 3ms collecting garbage

Counts

2 → 3

Calls

Call 1

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
74.0%	3	`(*.f64 x #s(literal 2 binary64))`
55.5%	2	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
74.0%	3	`x`
75.8%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.5%)

Memory

15.9MiB live, 15.9MiB 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 (*.f64 x #s(literal 2 binary64)) y)
1.0ms	y
1.0ms	(*.f64 x #s(literal 2 binary64))
1.0ms	x

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch18.0ms (2.1%)

Memory

-8.8MiB live, 38.8MiB allocated; 1ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
7.0ms	102.75499939414571	24186.703111370298
10.0ms	-0.0018232370071143754	-2.35425741145949e-9

Samples

7.0ms

256×

valid

Compiler

Compiled 280 to 282 computations (-0.7% saved)

Precisions

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

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

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

adjust: 0.0ms (0% of total)

derivations9.0ms (1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 46 to 18 computations (60.9% saved)

preprocess23.0ms (2.7%)

Memory: -36.1MiB live, 58.1MiB allocated; 3ms collecting garbage
Compiler: Compiled 102 to 46 computations (54.9% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample506.0ms (59.5%)

explain66.0ms (7.8%)

preprocess77.0ms (9%)

series4.0ms (0.5%)

rewrite64.0ms (7.6%)

eval4.0ms (0.5%)

prune2.0ms (0.2%)

series2.0ms (0.3%)

rewrite49.0ms (5.7%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

regimes7.0ms (0.8%)

regimes11.0ms (1.3%)

regimes4.0ms (0.5%)

bsearch18.0ms (2.1%)

derivations9.0ms (1%)

preprocess23.0ms (2.7%)

end0.0ms (0%)

Profiling