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

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB 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)

sample573.0ms (40.1%)

Memory

-15.8MiB live, 789.9MiB allocated; 153ms collecting garbage

Samples

370.0ms	8 088×	0	valid
5.0ms	83×	1	valid
3.0ms	40×	3	valid
3.0ms	45×	2	valid

Precisions

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

ival-sub!: 66.0ms (54.8% of total)

ival-mult!: 50.0ms (41.5% of total)

adjust: 5.0ms (4.2% of total)

Bogosity

preprocess16.0ms (1.1%)

Memory

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

series9.0ms (0.7%)

Memory

-27.4MiB live, 17.6MiB allocated; 5ms 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	Expression
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	x	@	-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)

rewrite319.0ms (22.3%)

Memory

34.5MiB live, 262.9MiB allocated; 34ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	29	11
2	72	11
3	198	11
4	458	11
5	965	11
6	3656	11
0	8309	11
1	14089	11

Stop Event

1×	saturated
1×	node-limit
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.2%)

Memory: 9.3MiB live, 9.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 151 to 101 computations (33.1% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	33	3	36
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	33	4	37

Accuracy

100.0%

Counts

37 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	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))
▶	47.7%	#s(approx (* 200 (- x y)) (*.f64 #s(literal 200 binary64) x))
▶	53.8%	#s(approx (* 200 (- x y)) (*.f64 #s(literal -200 binary64) y))

Compiler

Compiled 27 to 27 computations (0% saved)

series62.0ms (4.3%)

Memory

-44.5MiB live, 20.0MiB allocated; 36ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	35	98

Stop Event

1×	iter-limit

Counts

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

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	Expression
52.0ms	y	@	0	((* 200 (- x y)) (* -200 y) -200 y (* 200 (- x y)) (* 200 x) 200 x (+ (* x 200) (* -200 y)))
5.0ms	y	@	inf	((* 200 (- x y)) (* -200 y) -200 y (* 200 (- x y)) (* 200 x) 200 x (+ (* x 200) (* -200 y)))
1.0ms	x	@	-inf	((* 200 (- x y)) (* -200 y) -200 y (* 200 (- x y)) (* 200 x) 200 x (+ (* x 200) (* -200 y)))
1.0ms	x	@	inf	((* 200 (- x y)) (* -200 y) -200 y (* 200 (- x y)) (* 200 x) 200 x (+ (* x 200) (* -200 y)))
1.0ms	y	@	-inf	((* 200 (- x y)) (* -200 y) -200 y (* 200 (- x y)) (* 200 x) 200 x (+ (* x 200) (* -200 y)))

rewrite290.0ms (20.3%)

Memory

6.6MiB live, 278.8MiB allocated; 54ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	11	34
0	15	34
1	60	33
2	167	33
3	372	33
4	549	33
5	876	33
6	3556	33
0	8209	33
1	13988	33

Stop Event

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

Counts

9 → 33

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

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

eval3.0ms (0.2%)

Memory: 10.5MiB live, 10.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 137 to 85 computations (38% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	38	0	38
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	38	4	42

Accuracy

100.0%

Counts

42 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	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))
✓	47.7%	#s(approx (* 200 (- x y)) (*.f64 #s(literal 200 binary64) x))
✓	53.8%	#s(approx (* 200 (- x y)) (*.f64 #s(literal -200 binary64) y))

Compiler

Compiled 44 to 41 computations (6.8% saved)

regimes11.0ms (0.7%)

Memory

-18.5MiB live, 26.9MiB allocated; 6ms 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) (*.f64 #s(literal -200 binary64) y))

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

Calls

4 calls:

4.0ms	(-.f64 x y)
2.0ms	x
2.0ms	y
2.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)

regimes7.0ms (0.5%)

Memory

23.2MiB live, 23.1MiB 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:

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

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)

regimes6.0ms (0.4%)

Memory

20.4MiB live, 20.4MiB 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:

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

Results

Accuracy	Segments	Branch
68.2%	6	`(-.f64 x y)`
68.2%	6	`(*.f64 #s(literal 200 binary64) (-.f64 x y))`
78.6%	3	`x`
75.0%	3	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes9.0ms (0.6%)

Memory

-37.7MiB live, 16.8MiB allocated; 10ms 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:

5.0ms	x
1.0ms	(*.f64 #s(literal 200 binary64) (-.f64 x y))
1.0ms	(-.f64 x y)
1.0ms	y

Results

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

Compiler

Compiled 10 to 12 computations (-20% saved)

bsearch17.0ms (1.2%)

Memory

-1.2MiB live, 44.3MiB allocated; 5ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
8.0ms	1.4119933670497648e-44	1.4593922898677714e-43
8.0ms	-1.5373561189422857e+83	-2.2062701639438287e+79

Samples

8.0ms	223×	0	valid
0.0ms	1×	1	valid

Compiler

Compiled 232 to 262 computations (-12.9% saved)

Precisions

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

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

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

adjust: 0.0ms (0% of total)

derivations32.0ms (2.2%)

Memory

-5.2MiB live, 41.2MiB allocated; 4ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 23 to 20 computations (13% saved)

preprocess68.0ms (4.8%)

Memory: 16.1MiB live, 61.8MiB allocated; 5ms collecting garbage
Compiler: Compiled 28 to 25 computations (10.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample573.0ms (40.1%)

preprocess16.0ms (1.1%)

series9.0ms (0.7%)

rewrite319.0ms (22.3%)

eval3.0ms (0.2%)

prune2.0ms (0.1%)

series62.0ms (4.3%)

rewrite290.0ms (20.3%)

eval3.0ms (0.2%)

prune3.0ms (0.2%)

regimes11.0ms (0.7%)

regimes7.0ms (0.5%)

regimes6.0ms (0.4%)

regimes9.0ms (0.6%)

bsearch17.0ms (1.2%)

derivations32.0ms (2.2%)

preprocess68.0ms (4.8%)

end0.0ms (0%)

Profiling