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

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB 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%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 7 computations (0% saved)

sample468.0ms (56.9%)

Memory

9.9MiB live, 469.2MiB allocated; 165ms collecting garbage

Samples

336.0ms

8 256×

valid

Precisions

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

ival-sub!: 69.0ms (98.2% of total)

adjust: 2.0ms (2.8% of total)

Bogosity

preprocess93.0ms (11.2%)

Memory

-45.4MiB live, 52.9MiB allocated; 28ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	9	11
1	19	11
2	38	9
3	64	9
4	149	9
5	785	9
6	3595	9

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) #s(literal 3 binary64)))

Compiler

Compiled 10 to 10 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

5 → 6

Calls

Call 1

Inputs
(-.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))
x
(/.f64 #s(literal 1 binary64) #s(literal 3 binary64))
#s(literal 1 binary64)
#s(literal 3 binary64)

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

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((- x (/ 1 3)) x (/ 1 3) 1 3)
0.0ms	x	@	inf	((- x (/ 1 3)) x (/ 1 3) 1 3)
0.0ms	x	@	0	((- x (/ 1 3)) x (/ 1 3) 1 3)

rewrite72.0ms (8.7%)

Memory

20.7MiB live, 107.4MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	55
0	25	49
1	86	49
0	560	49

Stop Event

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

Counts

11 → 21

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 5.0MiB live, 5.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 77 to 53 computations (31.2% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	14	3	17
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	15	3	18

Accuracy

100.0%

Counts

18 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 x #s(literal 1/3 binary64))
▶	45.7%	#s(approx (- x (/ 1 3)) x)
▶	55.7%	#s(approx (- x (/ 1 3)) #s(literal -1/3 binary64))

Compiler

Compiled 16 to 16 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

6 → 11

Calls

Call 1

Inputs
#s(approx (- x (/ 1 3)) #s(literal -1/3 binary64))
#s(literal -1/3 binary64)
#s(approx (- x (/ 1 3)) x)
x
(-.f64 x #s(literal 1/3 binary64))
#s(literal 1/3 binary64)

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

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((- x (/ 1 3)) -1/3 (- x (/ 1 3)) x (- x 1/3) 1/3)
0.0ms	x	@	inf	((- x (/ 1 3)) -1/3 (- x (/ 1 3)) x (- x 1/3) 1/3)
0.0ms	x	@	0	((- x (/ 1 3)) -1/3 (- x (/ 1 3)) x (- x 1/3) 1/3)

rewrite68.0ms (8.2%)

Memory

2.7MiB live, 107.8MiB allocated; 16ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	109
0	22	97
1	83	97
0	557	97

Stop Event

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

Counts

17 → 27

Calls

Call 1

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

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

eval1.0ms (0.2%)

Memory: 4.3MiB live, 4.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 71 to 50 computations (29.6% 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	14	0	14
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	14	3	17

Accuracy

100.0%

Counts

17 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 x #s(literal 1/3 binary64))
✓	45.7%	#s(approx (- x (/ 1 3)) x)
✓	55.7%	#s(approx (- x (/ 1 3)) #s(literal -1/3 binary64))

Compiler

Compiled 32 to 30 computations (6.3% saved)

regimes7.0ms (0.8%)

Memory

-34.6MiB live, 11.3MiB allocated; 3ms collecting garbage

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (- x (/ 1 3)) #s(literal -1/3 binary64))
#s(approx (- x (/ 1 3)) x)
(-.f64 x #s(literal 1/3 binary64))
(-.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))

Outputs
(-.f64 x #s(literal 1/3 binary64))

Calls

2 calls:

5.0ms	x
2.0ms	(-.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))

Results

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

Compiler

Compiled 6 to 6 computations (0% saved)

regimes3.0ms (0.3%)

Memory

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

Counts

2 → 3

Calls

Call 1

Inputs
#s(approx (- x (/ 1 3)) #s(literal -1/3 binary64))
#s(approx (- x (/ 1 3)) x)

Outputs
#s(approx (- x (/ 1 3)) x)
#s(approx (- x (/ 1 3)) #s(literal -1/3 binary64))
#s(approx (- x (/ 1 3)) x)

Calls

2 calls:

1.0ms	x
1.0ms	(-.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))

Results

Accuracy	Segments	Branch
97.8%	3	`(-.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))`
97.8%	3	`x`

Compiler

Compiled 6 to 6 computations (0% saved)

regimes2.0ms (0.3%)

Memory

7.6MiB live, 7.6MiB 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 3)) #s(literal -1/3 binary64))

Outputs
#s(approx (- x (/ 1 3)) #s(literal -1/3 binary64))

Calls

2 calls:

1.0ms	x
1.0ms	(-.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))

Results

Accuracy	Segments	Branch
55.7%	1	`(-.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))`
55.7%	1	`x`

Compiler

Compiled 6 to 6 computations (0% saved)

bsearch60.0ms (7.3%)

Memory

-13.3MiB live, 33.9MiB allocated; 2ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
52.0ms	0.1222663318691893	32419.52813906679
7.0ms	-14.527637404932506	-1.3126338322330427e-6

Samples

5.0ms

288×

valid

Compiler

Compiled 242 to 279 computations (-15.3% saved)

Precisions

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

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

adjust: 0.0ms (0% of total)

derivations6.0ms (0.7%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 18 to 16 computations (11.1% saved)

preprocess37.0ms (4.5%)

Memory: 2.4MiB live, 49.2MiB allocated; 4ms collecting garbage
Compiler: Compiled 23 to 21 computations (8.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample468.0ms (56.9%)

preprocess93.0ms (11.2%)

series1.0ms (0.1%)

rewrite72.0ms (8.7%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite68.0ms (8.2%)

eval1.0ms (0.2%)

prune2.0ms (0.2%)

regimes7.0ms (0.8%)

regimes3.0ms (0.3%)

regimes2.0ms (0.3%)

bsearch60.0ms (7.3%)

derivations6.0ms (0.7%)

preprocess37.0ms (4.5%)

end0.0ms (0%)

Profiling