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

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)

sample497.0ms (54.4%)

Memory

4.3MiB live, 766.5MiB allocated; 101ms collecting garbage

Samples

292.0ms	8 255×	0	valid
0.0ms	1×	1	valid

Precisions

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

ival-sub!: 47.0ms (50.2% of total)

ival-mult!: 45.0ms (48.1% of total)

adjust: 1.0ms (1.1% of total)

Bogosity

preprocess41.0ms (4.5%)

Memory

-9.9MiB live, 37.1MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	38	31
2	120	30
3	280	30
4	874	30
5	2958	30

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.6MiB live, 9.6MiB allocated; 0ms collecting garbage

Counts

5 → 13

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))
#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)
1.0ms	y	@	-inf	((* x (- 1 y)) x (- 1 y) 1 y)
0.0ms	x	@	0	((* x (- 1 y)) x (- 1 y) 1 y)

rewrite64.0ms (7%)

Memory

19.5MiB live, 66.5MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	40	136
0	42	126
1	178	123
0	1351	123

Stop Event

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

Counts

18 → 63

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

eval5.0ms (0.5%)

Memory: 9.3MiB live, 9.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 250 to 136 computations (45.6% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	55	2	57
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	55	3	58

Accuracy

100.0%

Counts

58 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 18 to 18 computations (0% saved)

series27.0ms (3%)

Memory

-41.3MiB live, 5.5MiB allocated; 2ms collecting garbage

Counts

6 → 14

Calls

Call 1

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

rewrite165.0ms (18%)

Memory

21.2MiB live, 74.1MiB allocated; 110ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	43	156
0	45	145
1	182	142
0	1354	142

Stop Event

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

Counts

20 → 26

Calls

Call 1

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

eval2.0ms (0.2%)

Memory: 3.3MiB live, 3.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 87 to 62 computations (28.7% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	18	0	18
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	18	3	21

Accuracy

100.0%

Counts

21 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 31 to 30 computations (3.2% saved)

regimes38.0ms (4.2%)

Memory

-41.2MiB live, 14.0MiB allocated; 12ms collecting garbage

Counts

3 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

regimes6.0ms (0.6%)

Memory

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

Counts

2 → 3

Calls

Call 1

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

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
98.0%	3	`(-.f64 #s(literal 1 binary64) y)`
81.2%	3	`(*.f64 x (-.f64 #s(literal 1 binary64) y))`
58.4%	4	`x`
98.0%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.4%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (* x (- 1 y)) x)

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch20.0ms (2.2%)

Memory

-2.3MiB live, 44.2MiB allocated; 3ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
12.0ms	7.52265048994515e-15	3.3793760736611294
7.0ms	-5.401810617443803	-0.027465365957478102

Samples

7.0ms

272×

valid

Compiler

Compiled 229 to 265 computations (-15.7% saved)

Precisions

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

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

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

adjust: 0.0ms (0% of total)

derivations10.0ms (1.1%)

Memory

-24.5MiB live, 22.6MiB allocated; 2ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 19 to 17 computations (10.5% saved)

preprocess27.0ms (3%)

Memory: 24.3MiB live, 67.8MiB allocated; 8ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 78 to 74 computations (5.1% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample497.0ms (54.4%)

preprocess41.0ms (4.5%)

series4.0ms (0.4%)

rewrite64.0ms (7%)

eval5.0ms (0.5%)

prune2.0ms (0.2%)

series27.0ms (3%)

rewrite165.0ms (18%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

regimes38.0ms (4.2%)

regimes6.0ms (0.6%)

regimes4.0ms (0.4%)

bsearch20.0ms (2.2%)

derivations10.0ms (1.1%)

preprocess27.0ms (3%)

end0.0ms (0%)

Profiling