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

start0.0ms (0%)

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

analyze7.0ms (0.7%)

Memory

-43.5MiB live, 1.5MiB allocated; 7ms 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)

sample680.0ms (74%)

Memory

65.0MiB live, 897.7MiB allocated; 291ms collecting garbage

Samples

418.0ms

8 256×

valid

Precisions

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

ival-mult!: 70.0ms (58.2% of total)

ival-sub!: 49.0ms (40.8% of total)

adjust: 2.0ms (1.7% of total)

Bogosity

preprocess76.0ms (8.3%)

Memory

-23.8MiB live, 63.6MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	20	32
2	43	32
3	109	32
4	271	30
5	1879	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

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

rewrite71.0ms (7.7%)

Memory

0.5MiB live, 101.1MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	39	119
0	40	113
1	178	112
0	1304	110

Stop Event

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

Counts

15 → 51

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

eval4.0ms (0.4%)

Memory: 9.4MiB live, 9.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 637 to 136 computations (78.6% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	44	2	46
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	45	2	47

Accuracy

100.0%

Counts

47 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 13 to 11 computations (15.4% saved)

series2.0ms (0.2%)

Memory

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

rewrite33.0ms (3.6%)

Memory

-12.9MiB live, 31.7MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	42	128
0	45	123
0	204	121

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

16 → 25

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

eval2.0ms (0.2%)

Memory: 4.3MiB live, 4.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 222 to 75 computations (66.2% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	19	0	19
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	19	2	21

Accuracy

100.0%

Counts

21 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 31 to 23 computations (25.8% saved)

regimes6.0ms (0.7%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

regimes9.0ms (1%)

Memory

-32.8MiB live, 12.9MiB allocated; 6ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

derivations9.0ms (1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 13 to 9 computations (30.8% saved)

preprocess13.0ms (1.4%)

Memory: 24.1MiB live, 24.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 18 to 14 computations (22.2% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze7.0ms (0.7%)

sample680.0ms (74%)

preprocess76.0ms (8.3%)

series4.0ms (0.4%)

rewrite71.0ms (7.7%)

eval4.0ms (0.4%)

prune2.0ms (0.2%)

series2.0ms (0.2%)

rewrite33.0ms (3.6%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

regimes6.0ms (0.7%)

regimes9.0ms (1%)

derivations9.0ms (1%)

preprocess13.0ms (1.4%)

end0.0ms (0%)

Profiling