Metrics for Data.Colour.RGB:hslsv from colour-2.3.3, A

start0.0ms (0%)

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

analyze164.0ms (15.6%)

Memory

-74.4MiB live, 0.4MiB allocated; 125ms 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)

sample522.0ms (49.4%)

Memory

28.3MiB live, 646.6MiB allocated; 112ms collecting garbage

Samples

306.0ms

8 256×

valid

Precisions

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

ival-add!: 46.0ms (50.7% of total)

ival-div!: 44.0ms (48.5% of total)

adjust: 1.0ms (1.1% of total)

Bogosity

preprocess45.0ms (4.2%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	15	32
1	53	30
2	169	30
3	522	30
4	3501	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(sort x y)

Compiler

Compiled 10 to 10 computations (0% saved)

series3.0ms (0.3%)

Memory

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

Counts

5 → 14

Calls

Call 1

Inputs
(/.f64 (+.f64 x y) #s(literal 2 binary64))
(+.f64 x y)
x
y
#s(literal 2 binary64)

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

Calls

6 calls:

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

rewrite105.0ms (10%)

Memory

-16.7MiB live, 76.1MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	56	173
0	57	159
1	292	159
0	2332	151
1	7214	151

Stop Event

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

Counts

19 → 48

Calls

Call 1

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

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

eval3.0ms (0.3%)

Memory: 7.5MiB live, 7.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 143 to 87 computations (39.2% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	37	3	40
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	38	3	41

Accuracy

100.0%

Counts

41 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 21 computations (0% saved)

series4.0ms (0.3%)

Memory

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

Counts

9 → 14

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite111.0ms (10.5%)

Memory

-36.1MiB live, 158.2MiB allocated; 51ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	61	195
0	65	181
1	314	181
0	2417	173
1	7469	173

Stop Event

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

Counts

23 → 60

Calls

Call 1

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

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

eval4.0ms (0.4%)

Memory: 14.6MiB live, 14.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 167 to 111 computations (33.5% saved)

prune3.0ms (0.3%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	47	0	47
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	47	3	50

Accuracy

100.0%

Counts

50 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
✓	50.8%	#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) y))
✓	49.7%	#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))

Compiler

Compiled 38 to 36 computations (5.3% saved)

regimes21.0ms (1.9%)

Memory

-37.6MiB live, 18.2MiB allocated; 7ms collecting garbage

Counts

4 → 1

Calls

Call 1

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

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

Calls

4 calls:

2.0ms	(/.f64 (+.f64 x y) #s(literal 2 binary64))
2.0ms	y
2.0ms	x
2.0ms	(+.f64 x y)

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 x y)`
100.0%	1	`(/.f64 (+.f64 x y) #s(literal 2 binary64))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes9.0ms (0.8%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

4 calls:

5.0ms	y
1.0ms	(/.f64 (+.f64 x y) #s(literal 2 binary64))
1.0ms	x
1.0ms	(+.f64 x y)

Results

Accuracy	Segments	Branch
96.9%	2	`(+.f64 x y)`
96.9%	2	`(/.f64 (+.f64 x y) #s(literal 2 binary64))`
84.8%	2	`x`
84.3%	2	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes4.0ms (0.4%)

Memory

13.9MiB live, 13.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 y) 2) (*.f64 #s(literal 1/2 binary64) x))

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

Calls

4 calls:

1.0ms	(/.f64 (+.f64 x y) #s(literal 2 binary64))
1.0ms	(+.f64 x y)
1.0ms	x
1.0ms	y

Results

Accuracy	Segments	Branch
49.7%	1	`y`
49.7%	1	`x`
49.7%	1	`(+.f64 x y)`
49.7%	1	`(/.f64 (+.f64 x y) #s(literal 2 binary64))`

Compiler

Compiled 10 to 12 computations (-20% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-2.0671215326787926e-268	7.230485200123353e-279

Compiler

Compiled 8 to 10 computations (-25% saved)

derivations35.0ms (3.3%)

Memory

-18.8MiB live, 28.7MiB allocated; 2ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 20 to 18 computations (10% saved)

preprocess22.0ms (2.1%)

Memory: 31.3MiB live, 31.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 87 to 81 computations (6.9% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze164.0ms (15.6%)

sample522.0ms (49.4%)

preprocess45.0ms (4.2%)

series3.0ms (0.3%)

rewrite105.0ms (10%)

eval3.0ms (0.3%)

prune2.0ms (0.2%)

series4.0ms (0.3%)

rewrite111.0ms (10.5%)

eval4.0ms (0.4%)

prune3.0ms (0.3%)

regimes21.0ms (1.9%)

regimes9.0ms (0.8%)

regimes4.0ms (0.4%)

bsearch0.0ms (0%)

derivations35.0ms (3.3%)

preprocess22.0ms (2.1%)

end0.0ms (0%)

Profiling