Metrics for Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, C

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample538.0ms (55.7%)

Memory

30.4MiB live, 815.4MiB allocated; 153ms collecting garbage

Samples

346.0ms

8 256×

valid

Precisions

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

ival-mult!: 47.0ms (67.3% of total)

ival-sub!: 22.0ms (31.5% of total)

adjust: 1.0ms (1.4% of total)

Bogosity

preprocess102.0ms (10.6%)

Memory

-11.3MiB live, 78.1MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	34	30
2	92	30
3	272	30
4	633	30
5	3108	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 10 computations (0% saved)

series4.0ms (0.4%)

Memory

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

Counts

5 → 10

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite96.0ms (9.9%)

Memory

-20.9MiB live, 132.2MiB allocated; 58ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	39	119
0	40	112
1	205	110
0	1523	108
1	4783	108

Stop Event

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

Counts

15 → 36

Calls

Call 1

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

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

eval3.0ms (0.3%)

Memory: 9.6MiB live, 9.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 100 to 68 computations (32% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	27	2	29
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	28	2	30

Accuracy

100.0%

Counts

30 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 (+.f64 x x) y)
▶	52.2%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 11 to 11 computations (0% saved)

series2.0ms (0.2%)

Memory

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

Counts

6 → 10

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite69.0ms (7.2%)

Memory

10.1MiB live, 101.1MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	42	128
0	45	121
1	235	87
0	1755	87
1	4803	87

Stop Event

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

Counts

16 → 33

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 9.6MiB live, 9.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 81 to 59 computations (27.2% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

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

Accuracy

100.0%

Counts

28 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) y)
▶	42.0%	(-.f64 #s(approx (+ x x) #s(literal 2 binary64)) y)
✓	52.2%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 17 to 17 computations (0% saved)

series15.0ms (1.6%)

Memory

-33.0MiB live, 18.3MiB allocated; 11ms collecting garbage

Counts

4 → 9

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite71.0ms (7.3%)

Memory

24.5MiB live, 115.3MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	38	119
0	39	110
1	229	80
0	1844	80
1	5179	80

Stop Event

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

Counts

13 → 19

Calls

Call 1

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

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

eval1.0ms (0.1%)

Memory: 3.6MiB live, 3.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 52 to 30 computations (42.3% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	11	0	11
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	11	3	14

Accuracy

100.0%

Counts

14 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) y)
✓	42.0%	(-.f64 #s(approx (+ x x) #s(literal 2 binary64)) y)
✓	52.2%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 33 to 32 computations (3% saved)

regimes10.0ms (1.1%)

Memory

-20.1MiB live, 25.9MiB allocated; 5ms collecting garbage

Counts

4 → 1

Calls

Call 1

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

Outputs
(-.f64 (+.f64 x x) y)

Calls

4 calls:

5.0ms	y
2.0ms	(-.f64 (*.f64 x #s(literal 2 binary64)) y)
2.0ms	(*.f64 x #s(literal 2 binary64))
2.0ms	x

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes5.0ms (0.5%)

Memory

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

Accuracy

Total -6.8b remaining (-22.2%)

Threshold costs -6.8b (-22.2%)

Counts

2 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

derivations24.0ms (2.4%)

Memory

-39.8MiB live, 11.1MiB allocated; 9ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 9 to 9 computations (0% saved)

preprocess20.0ms (2%)

Memory: 9.7MiB live, 55.2MiB allocated; 5ms collecting garbage
Compiler: Compiled 14 to 14 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample538.0ms (55.7%)

preprocess102.0ms (10.6%)

series4.0ms (0.4%)

rewrite96.0ms (9.9%)

eval3.0ms (0.3%)

prune1.0ms (0.1%)

series2.0ms (0.2%)

rewrite69.0ms (7.2%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

series15.0ms (1.6%)

rewrite71.0ms (7.3%)

eval1.0ms (0.1%)

prune2.0ms (0.2%)

regimes10.0ms (1.1%)

regimes5.0ms (0.5%)

derivations24.0ms (2.4%)

preprocess20.0ms (2%)

end0.0ms (0%)

Profiling