Metrics for Data.Colour.CIE:cieLAB from colour-2.3.3, C

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB 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)

sample600.0ms (63.6%)

Memory

-6.8MiB live, 804.1MiB allocated; 234ms collecting garbage

Samples

406.0ms

8 256×

valid

Precisions

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

ival-div!: 122.0ms (72.3% of total)

ival-add!: 45.0ms (26.7% of total)

adjust: 1.0ms (0.6% of total)

Bogosity

preprocess8.0ms (0.8%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	24	32
2	32	32
3	42	32
4	52	32
5	57	32

Stop Event

1×

saturated

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 10 computations (0% saved)

series19.0ms (2%)

Memory

-43.2MiB live, 7.0MiB allocated; 7ms collecting garbage

Counts

5 → 10

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite62.0ms (6.6%)

Memory

41.5MiB live, 86.4MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	38	113
0	40	110
1	158	110
0	1152	107

Stop Event

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

Counts

15 → 28

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 5.2MiB live, 5.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 166 to 84 computations (49.4% saved)

prune5.0ms (0.5%)

Memory

-40.1MiB live, 4.5MiB allocated; 4ms collecting garbage

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	20	3	23
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	20	4	24

Accuracy

100.0%

Counts

24 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 x (/.f64 y #s(literal 500 binary64)))
▶	99.9%	#s(approx (+ x (/ y 500)) (fma.f64 #s(literal 1/500 binary64) y x))
▶	49.1%	#s(approx (+ x (/ y 500)) (*.f64 #s(literal 1/500 binary64) y))
▶	51.5%	#s(approx (+ x (/ y 500)) x)

Compiler

Compiled 27 to 27 computations (0% saved)

series3.0ms (0.3%)

Memory

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

Counts

8 → 17

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite50.0ms (5.3%)

Memory

37.2MiB live, 83.6MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	48	220
0	49	212
1	175	212
0	1231	208

Stop Event

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

Counts

25 → 44

Calls

Call 1

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

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

eval41.0ms (4.3%)

Memory: -37.2MiB live, 18.8MiB allocated; 37ms collecting garbage
Compiler: Compiled 286 to 131 computations (54.2% saved)

prune3.0ms (0.3%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	35	0	35
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	35	4	39

Accuracy

100.0%

Counts

39 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 x (/.f64 y #s(literal 500 binary64)))
✓	99.9%	#s(approx (+ x (/ y 500)) (fma.f64 #s(literal 1/500 binary64) y x))
✓	49.1%	#s(approx (+ x (/ y 500)) (*.f64 #s(literal 1/500 binary64) y))
✓	51.5%	#s(approx (+ x (/ y 500)) x)

Compiler

Compiled 45 to 41 computations (8.9% saved)

regimes13.0ms (1.3%)

Memory

-23.5MiB live, 24.9MiB allocated; 7ms collecting garbage

Counts

4 → 1

Calls

Call 1

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

Outputs
(+.f64 x (/.f64 y #s(literal 500 binary64)))

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes7.0ms (0.7%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes5.0ms (0.6%)

Memory

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

Counts

2 → 3

Calls

Call 1

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

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
75.5%	3	`(/.f64 y #s(literal 500 binary64))`
55.7%	3	`(+.f64 x (/.f64 y #s(literal 500 binary64)))`
78.2%	3	`x`
75.5%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes7.0ms (0.8%)

Memory

-32.4MiB live, 14.1MiB allocated; 3ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (+ x (/ y 500)) x)

Outputs
#s(approx (+ x (/ y 500)) x)

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch19.0ms (2%)

Memory

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

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
10.0ms	43.93571732932443	49648196105005060.0
8.0ms	-7.175210272014691e+26	-1.4189466200290415e+24

Samples

8.0ms

288×

valid

Compiler

Compiled 260 to 298 computations (-14.6% saved)

Precisions

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

ival-div!: 2.0ms (82% of total)

ival-add!: 1.0ms (41% of total)

adjust: 0.0ms (0% of total)

derivations59.0ms (6.2%)

Memory

-32.6MiB live, 14.2MiB allocated; 4ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 24 to 20 computations (16.7% saved)

preprocess42.0ms (4.4%)

Memory: -1.9MiB live, 49.2MiB allocated; 6ms collecting garbage
Compiler: Compiled 29 to 25 computations (13.8% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample600.0ms (63.6%)

preprocess8.0ms (0.8%)

series19.0ms (2%)

rewrite62.0ms (6.6%)

eval2.0ms (0.2%)

prune5.0ms (0.5%)

series3.0ms (0.3%)

rewrite50.0ms (5.3%)

eval41.0ms (4.3%)

prune3.0ms (0.3%)

regimes13.0ms (1.3%)

regimes7.0ms (0.7%)

regimes5.0ms (0.6%)

regimes7.0ms (0.8%)

bsearch19.0ms (2%)

derivations59.0ms (6.2%)

preprocess42.0ms (4.4%)

end0.0ms (0%)

Profiling