Metrics for Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, H

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample611.0ms (60%)

Memory

34.0MiB live, 974.2MiB allocated; 187ms collecting garbage

Samples

339.0ms

8 256×

valid

Precisions

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

ival-mult!: 67.0ms (54.8% of total)

ival-sub!: 53.0ms (43.3% of total)

adjust: 2.0ms (1.6% of total)

Bogosity

preprocess102.0ms (10%)

Memory

-14.9MiB live, 30.7MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	29	34
2	42	34
3	81	34
4	333	31
5	2857	31

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 x (-.f64 #s(literal 1 binary64) y))

Symmetry

(negabs x)

Compiler

Compiled 10 to 10 computations (0% saved)

series4.0ms (0.4%)

Memory

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

Counts

5 → 12

Calls

Call 1

Inputs
(*.f64 x (-.f64 #s(literal 1 binary64) y))
x
(-.f64 #s(literal 1 binary64) y)
#s(literal 1 binary64)
y

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

Calls

6 calls:

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

rewrite87.0ms (8.6%)

Memory

-2.5MiB live, 98.3MiB allocated; 46ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	39	129
0	41	121
1	168	118
0	1221	118

Stop Event

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

Counts

17 → 42

Calls

Call 1

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

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

eval3.0ms (0.3%)

Memory: 9.0MiB live, 9.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 191 to 115 computations (39.8% saved)

prune2.0ms (0.2%)

Memory

5.5MiB live, 5.6MiB allocated; 0ms collecting garbage

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	34	3	37
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	34	4	38

Accuracy

100.0%

Counts

38 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 x (-.f64 #s(literal 1 binary64) y))
▶	50.7%	(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
▶	51.9%	(*.f64 x #s(approx (- 1 y) #s(literal 1 binary64)))
▶	100.0%	#s(approx (* x (- 1 y)) (-.f64 x (*.f64 y x)))

Compiler

Compiled 27 to 27 computations (0% saved)

series6.0ms (0.6%)

Memory

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

Counts

11 → 16

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite62.0ms (6.1%)

Memory

-34.4MiB live, 107.1MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	57	219
0	62	205
1	238	200
0	1679	200

Stop Event

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

Counts

27 → 63

Calls

Call 1

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

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

eval5.0ms (0.4%)

Memory: 13.7MiB live, 13.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 314 to 174 computations (44.6% saved)

prune3.0ms (0.3%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	50	0	50
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	50	4	54

Accuracy

100.0%

Counts

54 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 x (-.f64 #s(literal 1 binary64) y))
✓	50.7%	(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
✓	51.9%	(*.f64 x #s(approx (- 1 y) #s(literal 1 binary64)))
✓	100.0%	#s(approx (* x (- 1 y)) (-.f64 x (*.f64 y x)))

Compiler

Compiled 45 to 43 computations (4.4% saved)

regimes12.0ms (1.2%)

Memory

-20.3MiB live, 29.4MiB allocated; 5ms collecting garbage

Counts

4 → 1

Calls

Call 1

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

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

Calls

4 calls:

7.0ms	(*.f64 x (-.f64 #s(literal 1 binary64) y))
2.0ms	x
2.0ms	y
2.0ms	(-.f64 #s(literal 1 binary64) y)

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes5.0ms (0.5%)

Memory

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

Counts

2 → 3

Calls

Call 1

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

Outputs
(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
(*.f64 x #s(approx (- 1 y) #s(literal 1 binary64)))
(*.f64 x #s(approx (- 1 y) (neg.f64 y)))

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
98.6%	3	`(-.f64 #s(literal 1 binary64) y)`
83.0%	3	`(*.f64 x (-.f64 #s(literal 1 binary64) y))`
58.5%	3	`x`
98.6%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.4%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

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

Outputs
(*.f64 x #s(approx (- 1 y) #s(literal 1 binary64)))

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch25.0ms (2.4%)

Memory

-38.4MiB live, 54.0MiB allocated; 6ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
10.0ms	2.569938962245874e-6	178864.0475729291
12.0ms	-189214463477.30582	-9.652993898889455e-15

Samples

10.0ms

336×

valid

Compiler

Compiled 302 to 346 computations (-14.6% saved)

Precisions

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

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

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

adjust: 0.0ms (0% of total)

derivations13.0ms (1.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 22 to 19 computations (13.6% saved)

preprocess75.0ms (7.3%)

Memory: 9.5MiB live, 55.5MiB allocated; 3ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 91 to 84 computations (7.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample611.0ms (60%)

preprocess102.0ms (10%)

series4.0ms (0.4%)

rewrite87.0ms (8.6%)

eval3.0ms (0.3%)

prune2.0ms (0.2%)

series6.0ms (0.6%)

rewrite62.0ms (6.1%)

eval5.0ms (0.4%)

prune3.0ms (0.3%)

regimes12.0ms (1.2%)

regimes5.0ms (0.5%)

regimes4.0ms (0.4%)

bsearch25.0ms (2.4%)

derivations13.0ms (1.2%)

preprocess75.0ms (7.3%)

end0.0ms (0%)

Profiling