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.6MiB live, 0.6MiB 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)

sample626.0ms (52.7%)

Memory

3.9MiB live, 636.2MiB allocated; 209ms collecting garbage

Samples

412.0ms

8 256×

valid

Precisions

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

ival-mult!: 50.0ms (60.1% of total)

ival-sub!: 31.0ms (37.3% of total)

adjust: 1.0ms (1.2% of total)

Bogosity

explain46.0ms (3.9%)

Memory

-7.3MiB live, 38.3MiB allocated; 7ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(-.f64 #s(literal 1 binary64) y)`
-	-	`(*.f64 x (-.f64 #s(literal 1 binary64) y))`
-	-	`y`
-	-	`#s(literal 1 binary64)`
-	-	`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

25.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-sub!: 2.0ms (46% of total)

ival-mult!: 2.0ms (46% of total)

adjust: 0.0ms (0% of total)

preprocess213.0ms (17.9%)

Memory

-8.2MiB live, 230.9MiB allocated; 36ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	28	34
2	37	34
3	61	34
4	154	31
5	665	30
6	5931	30
0	5	5
0	7	5
1	10	5
2	13	5
3	23	5
4	62	5
5	302	5
6	2755	5
7	6681	5
0	8265	5

Stop Event

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

Calls

Call 1

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

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

Symmetry

(negabs x)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

series4.0ms (0.3%)

Memory

10.2MiB live, 10.2MiB 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	x	@	0	((* x (- 1 y)) x (- 1 y) 1 y)
0.0ms	y	@	-inf	((* x (- 1 y)) x (- 1 y) 1 y)

rewrite96.0ms (8%)

Memory

7.7MiB live, 99.9MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	40	136
0	41	128
1	168	125
0	1240	125

Stop Event

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

Counts

18 → 43

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

eval23.0ms (1.9%)

Memory: -36.6MiB live, 9.3MiB allocated; 5ms collecting garbage
Compiler: Compiled 421 to 118 computations (72% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	41	2	43
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	41	3	44

Accuracy

100.0%

Counts

44 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 20 to 18 computations (10% saved)

series2.0ms (0.2%)

Memory

6.5MiB live, 6.5MiB allocated; 0ms 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
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	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	x	@	0	((* x (- 1 y)) x (* x (- 1 y)) (- 1 y) (neg y) y)

rewrite61.0ms (5.1%)

Memory

-10.1MiB live, 87.8MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	43	156
0	45	147
1	173	144
0	1244	144

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

eval2.0ms (0.2%)

Memory: 6.7MiB live, 6.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 254 to 68 computations (73.2% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	26	0	26
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	26	3	29

Accuracy

100.0%

Counts

29 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 40 to 30 computations (25% saved)

regimes6.0ms (0.5%)

Memory

17.8MiB live, 17.9MiB allocated; 0ms 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:

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

regimes8.0ms (0.7%)

Memory

-26.7MiB live, 18.1MiB allocated; 3ms 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:

4.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
97.5%	3	`(-.f64 #s(literal 1 binary64) y)`
80.2%	3	`(*.f64 x (-.f64 #s(literal 1 binary64) y))`
59.2%	3	`x`
97.5%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.4%)

Memory

14.9MiB live, 14.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 (- 1 y)) x)

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch19.0ms (1.6%)

Memory

-2.5MiB live, 44.1MiB allocated; 3ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
10.0ms	0.013883611980915034	98724.0104938058
8.0ms	-7.12422363804405	-0.0020777035866611088

Samples

9.0ms

272×

valid

Compiler

Compiled 263 to 265 computations (-0.8% saved)

Precisions

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

ival-mult!: 2.0ms (85% of total)

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

adjust: 0.0ms (0% of total)

derivations11.0ms (0.9%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 43 to 17 computations (60.5% saved)

preprocess62.0ms (5.2%)

Memory: -4.1MiB live, 56.4MiB allocated; 12ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 182 to 96 computations (47.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample626.0ms (52.7%)

explain46.0ms (3.9%)

preprocess213.0ms (17.9%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.3%)

rewrite96.0ms (8%)

eval23.0ms (1.9%)

prune3.0ms (0.2%)

series2.0ms (0.2%)

rewrite61.0ms (5.1%)

eval2.0ms (0.2%)

prune3.0ms (0.2%)

regimes6.0ms (0.5%)

regimes8.0ms (0.7%)

regimes4.0ms (0.4%)

bsearch19.0ms (1.6%)

derivations11.0ms (0.9%)

preprocess62.0ms (5.2%)

end0.0ms (0%)

Profiling