Metrics for Data.Colour.CIE:cieLABView from colour-2.3.3, C

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample460.0ms (6.6%)

Memory

11.7MiB live, 342.3MiB allocated; 64ms collecting garbage

Samples

277.0ms	8 123×	0	valid
3.0ms	64×	1	valid
3.0ms	45×	2	valid
2.0ms	24×	3	valid

Precisions

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

ival-mult!: 51.0ms (54.2% of total)

ival-sub!: 39.0ms (41.5% of total)

adjust: 4.0ms (4.3% of total)

Bogosity

preprocess41.0ms (0.6%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	15	32
1	39	30
2	99	30
3	219	30
4	235	30

Stop Event

1×

saturated

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 10 computations (0% saved)

series84.0ms (1.2%)

Memory

-15.4MiB live, 30.1MiB allocated; 14ms collecting garbage

Counts

5 → 16

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite3.0s (43.1%)

Memory

-72.2MiB live, 1 994.5MiB allocated; 1.7s collecting garbage

Counts

5 → 28

Calls

Call 1

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

Outputs
(*.f64 #s(literal 200 binary64) (-.f64 x y))
(*.f64 (-.f64 y x) (neg.f64 #s(literal 200 binary64)))
(*.f64 (-.f64 x y) #s(literal 200 binary64))
(*.f64 (neg.f64 #s(literal 200 binary64)) (-.f64 y x))
(+.f64 (neg.f64 (.f64 y #s(literal 200 binary64))) (.f64 x #s(literal 200 binary64)))
(+.f64 (.f64 x #s(literal 200 binary64)) (neg.f64 (.f64 y #s(literal 200 binary64))))
(-.f64 (.f64 x #s(literal 200 binary64)) (.f64 y #s(literal 200 binary64)))
(-.f64 (neg.f64 (.f64 y #s(literal 200 binary64))) (neg.f64 (.f64 x #s(literal 200 binary64))))
(fma.f64 (neg.f64 #s(literal 200 binary64)) y (*.f64 x #s(literal 200 binary64)))
(fma.f64 (neg.f64 y) #s(literal 200 binary64) (*.f64 x #s(literal 200 binary64)))
(fma.f64 #s(literal 200 binary64) (neg.f64 y) (*.f64 x #s(literal 200 binary64)))
(fma.f64 y (neg.f64 #s(literal 200 binary64)) (*.f64 x #s(literal 200 binary64)))
(fma.f64 x #s(literal 200 binary64) (neg.f64 (*.f64 y #s(literal 200 binary64))))
(fma.f64 #s(literal 200 binary64) x (neg.f64 (*.f64 y #s(literal 200 binary64))))
(fma.f64 (neg.f64 x) (neg.f64 #s(literal 200 binary64)) (neg.f64 (*.f64 y #s(literal 200 binary64))))
(fma.f64 (neg.f64 #s(literal 200 binary64)) (neg.f64 x) (neg.f64 (*.f64 y #s(literal 200 binary64))))
(neg.f64 (*.f64 (-.f64 y x) #s(literal 200 binary64)))
#s(literal 200 binary64)
(neg.f64 (neg.f64 #s(literal 200 binary64)))
(+.f64 (neg.f64 y) x)
(+.f64 x (neg.f64 y))
(-.f64 x y)
(-.f64 (neg.f64 y) (neg.f64 x))
(neg.f64 (-.f64 y x))
x
(neg.f64 (neg.f64 x))
y
(neg.f64 (neg.f64 y))

eval4.0ms (0.1%)

Memory: 5.5MiB live, 5.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 177 to 111 computations (37.3% saved)

prune2.0ms (0%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	36	3	39
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	36	4	40

Accuracy

100.0%

Counts

40 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 x #s(literal 200 binary64) (neg.f64 (*.f64 y #s(literal 200 binary64))))
✓	100.0%	(*.f64 #s(literal 200 binary64) (-.f64 x y))
▶	53.1%	#s(approx (* 200 (- x y)) (*.f64 #s(literal 200 binary64) x))
▶	49.1%	#s(approx (* 200 (- x y)) (*.f64 #s(literal -200 binary64) y))

Compiler

Compiled 27 to 27 computations (0% saved)

series90.0ms (1.3%)

Memory

1.0MiB live, 51.4MiB allocated; 2ms collecting garbage

Counts

11 → 11

Calls

Call 1

Inputs
#s(approx (* 200 (- x y)) (*.f64 #s(literal -200 binary64) y))
(*.f64 #s(literal -200 binary64) y)
#s(literal -200 binary64)
y
#s(approx (* 200 (- x y)) (*.f64 #s(literal 200 binary64) x))
(*.f64 #s(literal 200 binary64) x)
#s(literal 200 binary64)
x
(fma.f64 x #s(literal 200 binary64) (neg.f64 (*.f64 y #s(literal 200 binary64))))
(neg.f64 (*.f64 y #s(literal 200 binary64)))
(*.f64 y #s(literal 200 binary64))

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

Calls

6 calls:

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

rewrite3.1s (44.1%)

Memory

46.8MiB live, 2 114.4MiB allocated; 568ms collecting garbage

Counts

11 → 46

Calls

Call 1

Inputs
#s(approx (* 200 (- x y)) (*.f64 #s(literal -200 binary64) y))
(*.f64 #s(literal -200 binary64) y)
#s(literal -200 binary64)
y
#s(approx (* 200 (- x y)) (*.f64 #s(literal 200 binary64) x))
(*.f64 #s(literal 200 binary64) x)
#s(literal 200 binary64)
x
(fma.f64 x #s(literal 200 binary64) (neg.f64 (*.f64 y #s(literal 200 binary64))))
(neg.f64 (*.f64 y #s(literal 200 binary64)))
(*.f64 y #s(literal 200 binary64))

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

eval6.0ms (0.1%)

Memory: 5.1MiB live, 5.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 213 to 132 computations (38% saved)

prune12.0ms (0.2%)

Memory

-45.5MiB live, 5.8MiB allocated; 11ms collecting garbage

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	49	0	49
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	49	4	53

Accuracy

100.0%

Counts

53 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x #s(literal 200 binary64) (neg.f64 (*.f64 y #s(literal 200 binary64))))
✓	100.0%	(*.f64 #s(literal 200 binary64) (-.f64 x y))
✓	53.1%	#s(approx (* 200 (- x y)) (*.f64 #s(literal 200 binary64) x))
✓	49.1%	#s(approx (* 200 (- x y)) (*.f64 #s(literal -200 binary64) y))

Compiler

Compiled 45 to 43 computations (4.4% saved)

regimes15.0ms (0.2%)

Memory

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

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (* 200 (- x y)) (*.f64 #s(literal -200 binary64) y))
#s(approx (* 200 (- x y)) (*.f64 #s(literal 200 binary64) x))
(*.f64 #s(literal 200 binary64) (-.f64 x y))
(fma.f64 x #s(literal 200 binary64) (neg.f64 (*.f64 y #s(literal 200 binary64))))

Outputs
(fma.f64 x #s(literal 200 binary64) (neg.f64 (*.f64 y #s(literal 200 binary64))))

Calls

4 calls:

4.0ms	y
4.0ms	x
3.0ms	(-.f64 x y)
3.0ms	(*.f64 #s(literal 200 binary64) (-.f64 x y))

Results

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

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes33.0ms (0.5%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

Calls

4 calls:

23.0ms	x
4.0ms	(-.f64 x y)
3.0ms	(*.f64 #s(literal 200 binary64) (-.f64 x y))
3.0ms	y

Results

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

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes12.0ms (0.2%)

Memory

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

Counts

2 → 3

Calls

Call 1

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

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

Calls

4 calls:

3.0ms	y
3.0ms	x
2.0ms	(-.f64 x y)
2.0ms	(*.f64 #s(literal 200 binary64) (-.f64 x y))

Results

Accuracy	Segments	Branch
61.5%	4	`(-.f64 x y)`
61.5%	4	`(*.f64 #s(literal 200 binary64) (-.f64 x y))`
79.7%	3	`x`
74.9%	3	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes10.0ms (0.1%)

Memory

-31.2MiB live, 14.8MiB allocated; 2ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

3.0ms	x
2.0ms	(*.f64 #s(literal 200 binary64) (-.f64 x y))
2.0ms	y
2.0ms	(-.f64 x y)

Results

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

Compiler

Compiled 10 to 12 computations (-20% saved)

bsearch48.0ms (0.7%)

Memory

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

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
8.0ms	1.6946352021564596e-74	2.0017280268277264e-73
37.0ms	-0.09156991921974329	-1.0563321003009562e-14

Samples

31.0ms	253×	0	valid
0.0ms	3×	2	valid

Compiler

Compiled 264 to 298 computations (-12.9% saved)

Precisions

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

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

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

adjust: 0.0ms (0% of total)

derivations1.0ms (0%)

Memory

1.1MiB live, 1.0MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 24 to 22 computations (8.3% saved)

preprocess72.0ms (1%)

Memory: 7.4MiB live, 54.0MiB allocated; 3ms collecting garbage
Compiler: Compiled 29 to 27 computations (6.9% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample460.0ms (6.6%)

preprocess41.0ms (0.6%)

series84.0ms (1.2%)

rewrite3.0s (43.1%)

eval4.0ms (0.1%)

prune2.0ms (0%)

series90.0ms (1.3%)

rewrite3.1s (44.1%)

eval6.0ms (0.1%)

prune12.0ms (0.2%)

regimes15.0ms (0.2%)

regimes33.0ms (0.5%)

regimes12.0ms (0.2%)

regimes10.0ms (0.1%)

bsearch48.0ms (0.7%)

derivations1.0ms (0%)

preprocess72.0ms (1%)

end0.0ms (0%)

Profiling