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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample528.0ms (77.1%)

Memory

10.1MiB live, 1 106.3MiB allocated; 188ms collecting garbage

Samples

319.0ms	8 118×	0	valid
8.0ms	37×	3	valid
3.0ms	60×	1	valid
3.0ms	41×	2	valid

Precisions

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

ival-mult!: 42.0ms (47.9% of total)

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

adjust: 7.0ms (8% of total)

Bogosity

preprocess18.0ms (2.6%)

Memory

-0.0MiB live, 46.8MiB allocated; 3ms 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)

series24.0ms (3.5%)

Memory

-30.4MiB live, 32.9MiB allocated; 21ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	57	175

Stop Event

1×	iter-limit

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
1.0ms	x	inf
1.0ms	y	inf
1.0ms	x	-inf
0.0ms	y	-inf
0.0ms	x	0

rewrite13.0ms (2%)

Memory

-16.4MiB live, 31.1MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	12	11
2	28	11
3	67	11
4	124	11
5	149	11
0	149	11

Stop Event

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

Counts

5 → 25

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 y x))
(*.f64 (-.f64 y x) #s(literal -200 binary64))
(*.f64 (-.f64 x y) #s(literal 200 binary64))
(*.f64 #s(literal 200 binary64) (-.f64 x y))
(neg.f64 (*.f64 #s(literal -200 binary64) (-.f64 x y)))
(fma.f64 #s(literal -200 binary64) (neg.f64 x) (*.f64 #s(literal -200 binary64) y))
(fma.f64 #s(literal -200 binary64) y (*.f64 x #s(literal 200 binary64)))
(fma.f64 (neg.f64 x) #s(literal -200 binary64) (*.f64 #s(literal -200 binary64) y))
(fma.f64 (neg.f64 y) #s(literal 200 binary64) (*.f64 x #s(literal 200 binary64)))
(fma.f64 y #s(literal -200 binary64) (*.f64 x #s(literal 200 binary64)))
(fma.f64 x #s(literal 200 binary64) (*.f64 #s(literal -200 binary64) y))
(fma.f64 #s(literal 200 binary64) (neg.f64 y) (*.f64 x #s(literal 200 binary64)))
(fma.f64 #s(literal 200 binary64) x (*.f64 #s(literal -200 binary64) y))
(-.f64 (.f64 #s(literal -200 binary64) y) (.f64 #s(literal -200 binary64) x))
(-.f64 (.f64 x #s(literal 200 binary64)) (.f64 y #s(literal 200 binary64)))
(+.f64 (.f64 #s(literal -200 binary64) y) (.f64 x #s(literal 200 binary64)))
(+.f64 (.f64 x #s(literal 200 binary64)) (.f64 #s(literal -200 binary64) y))
#s(literal 200 binary64)
(neg.f64 (-.f64 y x))
(-.f64 (neg.f64 y) (neg.f64 x))
(-.f64 x y)
(+.f64 (neg.f64 y) x)
(+.f64 x (neg.f64 y))
x
y

eval3.0ms (0.5%)

Memory: 8.9MiB live, 8.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 323 to 101 computations (68.7% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

5 alts after pruning (4 fresh and 1 done)

	Pruned	Kept	Total
New	32	4	36
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	32	5	37

Accuracy

100.0%

Counts

37 → 5

Alt Table

Click to see full alt table

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

Compiler

Compiled 35 to 33 computations (5.7% saved)

series7.0ms (1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	35	98

Stop Event

1×	iter-limit

Counts

11 → 9

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) (*.f64 #s(literal -200 binary64) y))
(fma.f64 y #s(literal -200 binary64) (*.f64 x #s(literal 200 binary64)))
(*.f64 x #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 (* 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 (* 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
1.0ms	y	0
1.0ms	x	inf
1.0ms	x	-inf
1.0ms	y	-inf
1.0ms	y	inf

rewrite10.0ms (1.5%)

Memory

-28.7MiB live, 17.1MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	43
0	19	43
1	38	41
2	87	41
3	127	41
4	128	41
0	128	41

Stop Event

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

Counts

11 → 55

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) (*.f64 #s(literal -200 binary64) y))
(fma.f64 y #s(literal -200 binary64) (*.f64 x #s(literal 200 binary64)))
(*.f64 x #s(literal 200 binary64))

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

eval4.0ms (0.5%)

Memory: 8.6MiB live, 8.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 346 to 87 computations (74.9% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

5 alts after pruning (0 fresh and 5 done)

	Pruned	Kept	Total
New	39	0	39
Fresh	0	0	0
Picked	0	4	4
Done	0	1	1
Total	39	5	44

Accuracy

100.0%

Counts

44 → 5

Alt Table

Click to see full alt table

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

Compiler

Compiled 35 to 33 computations (5.7% saved)

regimes28.0ms (4.1%)

Memory

-15.8MiB live, 78.5MiB allocated; 7ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

2 → 3

3 → 1

5 → 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))

Call 2

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))

Call 3

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))

Call 4

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) (*.f64 #s(literal -200 binary64) y))
(fma.f64 y #s(literal -200 binary64) (*.f64 x #s(literal 200 binary64)))

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

Calls

16 calls:

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

Results

Accuracy	Segments	Branch
49.4%	1	`(-.f64 x y)`
49.4%	1	`(*.f64 #s(literal 200 binary64) (-.f64 x y))`
49.4%	1	`y`
49.4%	1	`x`
59.5%	4	`(-.f64 x y)`
59.5%	4	`(*.f64 #s(literal 200 binary64) (-.f64 x y))`
80.3%	3	`x`
76.7%	3	`y`
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`
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 75 to 64 computations (14.7% saved)

bsearch15.0ms (2.2%)

Memory

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

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
6.0ms	2.947696631502676e-31	1.3776605609317334e-30
8.0ms	-1.630774519693039e-37	-8.935741676280243e-41

Samples

6.0ms	220×	0	valid
0.0ms	2×	2	valid
0.0ms	2×	1	valid

Compiler

Compiled 260 to 262 computations (-0.8% saved)

Precisions

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

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

ival-mult!: 1.0ms (48.1% of total)

adjust: 0.0ms (0% of total)

derivations4.0ms (0.5%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 55 to 20 computations (63.6% saved)

preprocess26.0ms (3.9%)

Memory: -16.9MiB live, 73.2MiB allocated; 7ms collecting garbage
Compiler: Compiled 60 to 25 computations (58.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample528.0ms (77.1%)

preprocess18.0ms (2.6%)

series24.0ms (3.5%)

rewrite13.0ms (2%)

eval3.0ms (0.5%)

prune2.0ms (0.3%)

series7.0ms (1%)

rewrite10.0ms (1.5%)

eval4.0ms (0.5%)

prune2.0ms (0.3%)

regimes28.0ms (4.1%)

bsearch15.0ms (2.2%)

derivations4.0ms (0.5%)

preprocess26.0ms (3.9%)

end0.0ms (0%)

Profiling