Metrics for Data.Colour.CIE:lightness from colour-2.3.3

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample580.0ms (44%)

Memory

42.4MiB live, 1 030.0MiB allocated; 293ms collecting garbage

Samples

358.0ms	8 193×	0	valid
6.0ms	39×	1	valid
1.0ms	24×	2	valid

Precisions

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

ival-sub!: 93.0ms (52.8% of total)

ival-mult!: 80.0ms (45.4% of total)

adjust: 3.0ms (1.7% of total)

Bogosity

preprocess20.0ms (1.5%)

Memory

-9.9MiB live, 32.7MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	9	17
1	20	15
2	42	15
3	77	15

Stop Event

1×

saturated

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 10 computations (0% saved)

series2.0ms (0.2%)

Memory

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

Counts

5 → 6

Calls

Call 1

Inputs
(-.f64 (*.f64 x #s(literal 116 binary64)) #s(literal 16 binary64))
(*.f64 x #s(literal 116 binary64))
x
#s(literal 116 binary64)
#s(literal 16 binary64)

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

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((- (* x 116) 16) (* x 116) x 116 16)
1.0ms	x	@	inf	((- (* x 116) 16) (* x 116) x 116 16)
0.0ms	x	@	0	((- (* x 116) 16) (* x 116) x 116 16)

rewrite193.0ms (14.6%)

Memory

12.2MiB live, 199.9MiB allocated; 23ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	25	71
0	26	61
1	113	61
2	586	61
3	4789	61
0	8165	53
1	25295	53

Stop Event

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

Counts

11 → 36

Calls

Call 1

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

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

eval3.0ms (0.2%)

Memory: 7.7MiB live, 7.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 87 to 57 computations (34.5% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

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

Accuracy

100.0%

Counts

31 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 x #s(literal 116 binary64) #s(literal -16 binary64))
▶	51.6%	#s(approx (- (* x 116) 16) #s(literal -16 binary64))

Compiler

Compiled 11 to 11 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

5 → 6

Calls

Call 1

Inputs
#s(approx (- (* x 116) 16) #s(literal -16 binary64))
#s(literal -16 binary64)
(fma.f64 x #s(literal 116 binary64) #s(literal -16 binary64))
x
#s(literal 116 binary64)

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

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((- (* x 116) 16) -16 (+ (* x 116) -16) x 116)
0.0ms	x	@	inf	((- (* x 116) 16) -16 (+ (* x 116) -16) x 116)
0.0ms	x	@	0	((- (* x 116) 16) -16 (+ (* x 116) -16) x 116)

rewrite108.0ms (8.2%)

Memory

-6.7MiB live, 97.9MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	24	76
0	25	63
1	123	63
0	661	63
1	1810	63

Stop Event

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

Counts

11 → 19

Calls

Call 1

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

Outputs
#s(approx (- (* x 116) 16) #s(literal -16 binary64))
#s(literal -16 binary64)
(neg.f64 (-.f64 #s(literal 16 binary64) (*.f64 #s(literal 116 binary64) x)))
(fma.f64 #s(literal 116 binary64) x #s(literal -16 binary64))
(fma.f64 x #s(literal 116 binary64) #s(literal -16 binary64))
(-.f64 #s(literal -16 binary64) (*.f64 #s(literal -116 binary64) x))
(-.f64 #s(literal -16 binary64) (*.f64 (neg.f64 x) #s(literal 116 binary64)))
(-.f64 #s(literal -16 binary64) (neg.f64 (*.f64 #s(literal 116 binary64) x)))
(-.f64 (*.f64 #s(literal 116 binary64) x) #s(literal 16 binary64))
(+.f64 #s(literal -16 binary64) (*.f64 #s(literal 116 binary64) x))
(+.f64 (*.f64 #s(literal 116 binary64) x) #s(literal -16 binary64))
x
#s(literal 116 binary64)
#s(approx (- (* x 116) 16) #s(literal -16 binary64))
#s(approx (- (* x 116) 16) (fma.f64 #s(literal 116 binary64) x #s(literal -16 binary64)))
#s(approx x x)
#s(approx (- (* x 116) 16) (*.f64 #s(literal 116 binary64) x))
#s(approx (- (* x 116) 16) (*.f64 (-.f64 #s(literal 116 binary64) (/.f64 #s(literal 16 binary64) x)) x))
#s(approx (- (* x 116) 16) (*.f64 (-.f64 #s(literal 116 binary64) (/.f64 #s(literal 16 binary64) x)) x))

eval1.0ms (0.1%)

Memory: 3.1MiB live, 3.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 41 to 31 computations (24.4% saved)

prune3.0ms (0.3%)

Memory

-42.4MiB live, 3.4MiB allocated; 2ms collecting garbage

Pruning

3 alts after pruning (1 fresh and 2 done)

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

Accuracy

100.0%

Counts

14 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x #s(literal 116 binary64) #s(literal -16 binary64))
▶	49.8%	#s(approx (- (* x 116) 16) (*.f64 #s(literal 116 binary64) x))
✓	51.6%	#s(approx (- (* x 116) 16) #s(literal -16 binary64))

Compiler

Compiled 19 to 19 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

4 → 6

Calls

Call 1

Inputs
#s(approx (- (* x 116) 16) (*.f64 #s(literal 116 binary64) x))
(*.f64 #s(literal 116 binary64) x)
#s(literal 116 binary64)
x

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

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((- (* x 116) 16) (* 116 x) 116 x)
0.0ms	x	@	inf	((- (* x 116) 16) (* 116 x) 116 x)
0.0ms	x	@	0	((- (* x 116) 16) (* 116 x) 116 x)

rewrite188.0ms (14.2%)

Memory

12.2MiB live, 240.7MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	25	74
0	26	64
1	112	64
2	585	64
3	4795	64
0	8173	56
1	25304	56

Stop Event

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

Counts

10 → 16

Calls

Call 1

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

Outputs
#s(approx (- (* x 116) 16) (*.f64 #s(literal 116 binary64) x))
(.f64 (.f64 #s(literal -116 binary64) x) #s(literal -1 binary64))
(*.f64 #s(literal -116 binary64) (neg.f64 x))
(*.f64 (neg.f64 x) #s(literal -116 binary64))
(.f64 #s(literal -1 binary64) (.f64 #s(literal -116 binary64) x))
(*.f64 #s(literal 116 binary64) x)
(*.f64 x #s(literal 116 binary64))
(neg.f64 (*.f64 #s(literal -116 binary64) x))
#s(literal 116 binary64)
x
#s(approx (- (* x 116) 16) #s(literal -16 binary64))
#s(approx (- (* x 116) 16) (fma.f64 #s(literal 116 binary64) x #s(literal -16 binary64)))
#s(approx (* 116 x) (*.f64 #s(literal 116 binary64) x))
#s(approx x x)
#s(approx (- (* x 116) 16) (fma.f64 #s(literal 116 binary64) x #s(literal -16 binary64)))
#s(approx (- (* x 116) 16) (fma.f64 #s(literal 116 binary64) x #s(literal -16 binary64)))

eval1.0ms (0.1%)

Memory: 2.2MiB live, 2.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 37 to 32 computations (13.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	9	0	9
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	9	3	12

Accuracy

100.0%

Counts

12 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x #s(literal 116 binary64) #s(literal -16 binary64))
✓	49.8%	#s(approx (- (* x 116) 16) (*.f64 #s(literal 116 binary64) x))
✓	51.6%	#s(approx (- (* x 116) 16) #s(literal -16 binary64))

Compiler

Compiled 35 to 33 computations (5.7% saved)

regimes5.0ms (0.4%)

Memory

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

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (- (* x 116) 16) #s(literal -16 binary64))
#s(approx (- (* x 116) 16) (*.f64 #s(literal 116 binary64) x))
(fma.f64 x #s(literal 116 binary64) #s(literal -16 binary64))
(-.f64 (*.f64 x #s(literal 116 binary64)) #s(literal 16 binary64))

Outputs
(fma.f64 x #s(literal 116 binary64) #s(literal -16 binary64))

Calls

3 calls:

2.0ms	(*.f64 x #s(literal 116 binary64))
2.0ms	x
2.0ms	(-.f64 (*.f64 x #s(literal 116 binary64)) #s(literal 16 binary64))

Results

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

Compiler

Compiled 9 to 9 computations (0% saved)

regimes4.0ms (0.3%)

Memory

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

Counts

2 → 3

Calls

Call 1

Inputs
#s(approx (- (* x 116) 16) #s(literal -16 binary64))
#s(approx (- (* x 116) 16) (*.f64 #s(literal 116 binary64) x))

Outputs
#s(approx (- (* x 116) 16) (*.f64 #s(literal 116 binary64) x))
#s(approx (- (* x 116) 16) #s(literal -16 binary64))
#s(approx (- (* x 116) 16) (*.f64 #s(literal 116 binary64) x))

Calls

3 calls:

1.0ms	x
1.0ms	(*.f64 x #s(literal 116 binary64))
1.0ms	(-.f64 (*.f64 x #s(literal 116 binary64)) #s(literal 16 binary64))

Results

Accuracy	Segments	Branch
97.9%	3	`(*.f64 x #s(literal 116 binary64))`
97.9%	3	`(-.f64 (*.f64 x #s(literal 116 binary64)) #s(literal 16 binary64))`
97.9%	3	`x`

Compiler

Compiled 9 to 9 computations (0% saved)

regimes3.0ms (0.2%)

Memory

10.6MiB live, 10.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 116) 16) #s(literal -16 binary64))

Outputs
#s(approx (- (* x 116) 16) #s(literal -16 binary64))

Calls

3 calls:

1.0ms	x
1.0ms	(*.f64 x #s(literal 116 binary64))
1.0ms	(-.f64 (*.f64 x #s(literal 116 binary64)) #s(literal 16 binary64))

Results

Accuracy	Segments	Branch
51.6%	1	`(*.f64 x #s(literal 116 binary64))`
51.6%	1	`(-.f64 (*.f64 x #s(literal 116 binary64)) #s(literal 16 binary64))`
51.6%	1	`x`

Compiler

Compiled 9 to 9 computations (0% saved)

bsearch106.0ms (8.1%)

Memory

-69.3MiB live, 56.9MiB allocated; 119ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
16.0ms	0.06911277808823318	5338.632843186603
89.0ms	-457139.86456327466	-0.0014840855855492608

Samples

8.0ms

288×

valid

Compiler

Compiled 278 to 315 computations (-13.3% saved)

Precisions

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

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

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

adjust: 0.0ms (0% of total)

derivations71.0ms (5.4%)

Memory

5.0MiB live, 94.9MiB allocated; 8ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 19 to 17 computations (10.5% saved)

preprocess23.0ms (1.8%)

Memory: -3.8MiB live, 50.9MiB allocated; 8ms collecting garbage
Compiler: Compiled 24 to 22 computations (8.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample580.0ms (44%)

preprocess20.0ms (1.5%)

series2.0ms (0.2%)

rewrite193.0ms (14.6%)

eval3.0ms (0.2%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite108.0ms (8.2%)

eval1.0ms (0.1%)

prune3.0ms (0.3%)

series1.0ms (0.1%)

rewrite188.0ms (14.2%)

eval1.0ms (0.1%)

prune2.0ms (0.1%)

regimes5.0ms (0.4%)

regimes4.0ms (0.3%)

regimes3.0ms (0.2%)

bsearch106.0ms (8.1%)

derivations71.0ms (5.4%)

preprocess23.0ms (1.8%)

end0.0ms (0%)

Profiling