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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample762.0ms (44.8%)

Memory

37.9MiB live, 968.1MiB allocated; 300ms collecting garbage

Samples

503.0ms

8 256×

valid

Precisions

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

ival-div!: 135.0ms (70.8% of total)

ival-add!: 55.0ms (28.8% of total)

adjust: 1.0ms (0.5% of total)

Bogosity

preprocess87.0ms (5.1%)

Memory

-39.2MiB live, 60.5MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	43	30
2	104	30
3	191	30
4	420	30
5	2965	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(+.f64 x (/.f64 y #s(literal 500 binary64)))

Compiler

Compiled 10 to 10 computations (0% saved)

series3.0ms (0.2%)

Memory

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

Counts

5 → 8

Calls

Call 1

Inputs
(+.f64 x (/.f64 y #s(literal 500 binary64)))
x
(/.f64 y #s(literal 500 binary64))
y
#s(literal 500 binary64)

Outputs
#s(approx (+ x (/ y 500)) #s(hole binary64 (* 1/500 y)))
#s(approx (+ x (/ y 500)) #s(hole binary64 (+ x (* 1/500 y))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* x (+ 1 (* 1/500 (/ y x))))))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* -1 (* x (- (* -1/500 (/ y x)) 1)))))
#s(approx y #s(hole binary64 y))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* y (+ 1/500 (/ x y)))))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1/500)))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	inf	((+ x (/ y 500)) x (/ y 500) y 500)
1.0ms	y	@	-inf	((+ x (/ y 500)) x (/ y 500) y 500)
1.0ms	x	@	-inf	((+ x (/ y 500)) x (/ y 500) y 500)
0.0ms	x	@	inf	((+ x (/ y 500)) x (/ y 500) y 500)
0.0ms	y	@	0	((+ x (/ y 500)) x (/ y 500) y 500)

rewrite201.0ms (11.8%)

Memory

29.3MiB live, 166.8MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	36	99
0	37	89
1	194	89
2	1084	89

Stop Event

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

Counts

13 → 11

Calls

Call 1

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

Outputs
(+.f64 x (/.f64 y #s(literal 500 binary64)))
x
(/.f64 y #s(literal 500 binary64))
y
#s(literal 500 binary64)
#s(approx (+ x (/ y 500)) (/.f64 y #s(literal 500 binary64)))
#s(approx (+ x (/ y 500)) (+.f64 x (/.f64 y #s(literal 500 binary64))))
#s(approx x x)
#s(approx y y)
#s(approx (+ x (/ y 500)) (+.f64 x (/.f64 y #s(literal 500 binary64))))
#s(approx (+ x (/ y 500)) (+.f64 x (/.f64 y #s(literal 500 binary64))))

eval0.0ms (0%)

Memory: 1.3MiB live, 1.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 19 to 15 computations (21.1% saved)

prune1.0ms (0%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	3	1	4
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	3	2	5

Accuracy

100.0%

Counts

5 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 x (/.f64 y #s(literal 500 binary64)))
▶	50.4%	#s(approx (+ x (/ y 500)) (/.f64 y #s(literal 500 binary64)))

Compiler

Compiled 13 to 13 computations (0% saved)

series2.0ms (0.1%)

Memory

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

Counts

4 → 8

Calls

Call 1

Inputs
#s(approx (+ x (/ y 500)) (/.f64 y #s(literal 500 binary64)))
(/.f64 y #s(literal 500 binary64))
y
#s(literal 500 binary64)

Outputs
#s(approx (+ x (/ y 500)) #s(hole binary64 (* 1/500 y)))
#s(approx (+ x (/ y 500)) #s(hole binary64 (+ x (* 1/500 y))))
#s(approx (+ x (/ y 500)) #s(hole binary64 x))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* x (+ 1 (* 1/500 (/ y x))))))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* -1 (* x (- (* -1/500 (/ y x)) 1)))))
#s(approx y #s(hole binary64 y))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* y (+ 1/500 (/ x y)))))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1/500)))))

Calls

6 calls:

Time	Variable		Point	Expression
0.0ms	y	@	-inf	((+ x (/ y 500)) (/ y 500) y 500)
0.0ms	y	@	inf	((+ x (/ y 500)) (/ y 500) y 500)
0.0ms	y	@	0	((+ x (/ y 500)) (/ y 500) y 500)
0.0ms	x	@	-inf	((+ x (/ y 500)) (/ y 500) y 500)
0.0ms	x	@	inf	((+ x (/ y 500)) (/ y 500) y 500)

rewrite139.0ms (8.2%)

Memory

-8.8MiB live, 174.5MiB allocated; 22ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	36	106
0	37	96
1	193	96
2	1083	96

Stop Event

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

Counts

12 → 7

Calls

Call 1

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

Outputs
#s(approx (+ x (/ y 500)) (/.f64 y #s(literal 500 binary64)))
(/.f64 y #s(literal 500 binary64))
y
#s(literal 500 binary64)
#s(approx (+ x (/ y 500)) (/.f64 y #s(literal 500 binary64)))
#s(approx (+ x (/ y 500)) x)
#s(approx y y)

eval0.0ms (0%)

Memory: 1.3MiB live, 1.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 12 to 10 computations (16.7% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	1	1	2
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	1	3	4

Accuracy

100.0%

Counts

4 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 x (/.f64 y #s(literal 500 binary64)))
✓	50.4%	#s(approx (+ x (/ y 500)) (/.f64 y #s(literal 500 binary64)))
▶	51.5%	#s(approx (+ x (/ y 500)) x)

Compiler

Compiled 19 to 19 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

2 → 7

Calls

Call 1

Inputs
#s(approx (+ x (/ y 500)) x)
x

Outputs
#s(approx (+ x (/ y 500)) #s(hole binary64 (* 1/500 y)))
#s(approx (+ x (/ y 500)) #s(hole binary64 (+ x (* 1/500 y))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* x (+ 1 (* 1/500 (/ y x))))))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* -1 (* x (- (* -1/500 (/ y x)) 1)))))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* y (+ 1/500 (/ x y)))))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1/500)))))

Calls

6 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((+ x (/ y 500)) x)
0.0ms	x	@	inf	((+ x (/ y 500)) x)
0.0ms	y	@	-inf	((+ x (/ y 500)) x)
0.0ms	y	@	inf	((+ x (/ y 500)) x)
0.0ms	x	@	0	((+ x (/ y 500)) x)

rewrite392.0ms (23%)

Memory

-65.2MiB live, 171.4MiB allocated; 188ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	34	93
0	34	83
1	190	83
2	1080	83

Stop Event

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

Counts

9 → 3

Calls

Call 1

Inputs
#s(approx (+ x (/ y 500)) x)
x
#s(approx (+ x (/ y 500)) #s(hole binary64 (* 1/500 y)))
#s(approx (+ x (/ y 500)) #s(hole binary64 (+ x (* 1/500 y))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* x (+ 1 (* 1/500 (/ y x))))))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* -1 (* x (- (* -1/500 (/ y x)) 1)))))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* y (+ 1/500 (/ x y)))))
#s(approx (+ x (/ y 500)) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1/500)))))

Outputs
#s(approx (+ x (/ y 500)) x)
x
#s(approx x x)

eval0.0ms (0%)

Memory: 0.4MiB live, 0.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 7 to 7 computations (0% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	1	0	1
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	1	3	4

Accuracy

100.0%

Counts

4 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 x (/.f64 y #s(literal 500 binary64)))
✓	50.4%	#s(approx (+ x (/ y 500)) (/.f64 y #s(literal 500 binary64)))
✓	51.5%	#s(approx (+ x (/ y 500)) x)

Compiler

Compiled 32 to 29 computations (9.4% saved)

regimes6.0ms (0.4%)

Memory

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

Counts

3 → 1

Calls

Call 1

Inputs
#s(approx (+ x (/ y 500)) x)
#s(approx (+ x (/ y 500)) (/.f64 y #s(literal 500 binary64)))
(+.f64 x (/.f64 y #s(literal 500 binary64)))

Outputs
(+.f64 x (/.f64 y #s(literal 500 binary64)))

Calls

4 calls:

2.0ms	(+.f64 x (/.f64 y #s(literal 500 binary64)))
2.0ms	x
1.0ms	y
1.0ms	(/.f64 y #s(literal 500 binary64))

Results

Accuracy	Segments	Branch
100.0%	1	`(/.f64 y #s(literal 500 binary64))`
100.0%	1	`(+.f64 x (/.f64 y #s(literal 500 binary64)))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes5.0ms (0.3%)

Memory

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

Counts

2 → 3

Calls

Call 1

Inputs
#s(approx (+ x (/ y 500)) x)
#s(approx (+ x (/ y 500)) (/.f64 y #s(literal 500 binary64)))

Outputs
#s(approx (+ x (/ y 500)) x)
#s(approx (+ x (/ y 500)) (/.f64 y #s(literal 500 binary64)))
#s(approx (+ x (/ y 500)) x)

Calls

4 calls:

1.0ms	y
1.0ms	(+.f64 x (/.f64 y #s(literal 500 binary64)))
1.0ms	x
1.0ms	(/.f64 y #s(literal 500 binary64))

Results

Accuracy	Segments	Branch
75.1%	3	`(/.f64 y #s(literal 500 binary64))`
62.6%	5	`(+.f64 x (/.f64 y #s(literal 500 binary64)))`
80.8%	3	`x`
75.1%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes32.0ms (1.9%)

Memory

-36.7MiB live, 58.8MiB allocated; 11ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (+ x (/ y 500)) x)

Outputs
#s(approx (+ x (/ y 500)) x)

Calls

4 calls:

26.0ms	x
4.0ms	y
1.0ms	(/.f64 y #s(literal 500 binary64))
1.0ms	(+.f64 x (/.f64 y #s(literal 500 binary64)))

Results

Accuracy	Segments	Branch
51.5%	1	`(+.f64 x (/.f64 y #s(literal 500 binary64)))`
51.5%	1	`(/.f64 y #s(literal 500 binary64))`
51.5%	1	`y`
51.5%	1	`x`

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch15.0ms (0.9%)

Memory

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

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
7.0ms	1.0177900553812953e-32	3.7349546920096394e-31
7.0ms	-1.1034104456567895e+40	-4.668711528440479e+38

Samples

6.0ms

224×

valid

Compiler

Compiled 204 to 234 computations (-14.7% saved)

Precisions

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

ival-div!: 1.0ms (50.4% of total)

adjust: 0.0ms (0% of total)

ival-add!: 0.0ms (0% of total)

derivations29.0ms (1.7%)

Memory

-41.6MiB live, 50.1MiB allocated; 6ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 19 to 16 computations (15.8% saved)

preprocess22.0ms (1.3%)

Memory: 7.3MiB live, 62.4MiB allocated; 5ms collecting garbage
Compiler: Compiled 24 to 21 computations (12.5% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample762.0ms (44.8%)

preprocess87.0ms (5.1%)

series3.0ms (0.2%)

rewrite201.0ms (11.8%)

eval0.0ms (0%)

prune1.0ms (0%)

series2.0ms (0.1%)

rewrite139.0ms (8.2%)

eval0.0ms (0%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite392.0ms (23%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes6.0ms (0.4%)

regimes5.0ms (0.3%)

regimes32.0ms (1.9%)

bsearch15.0ms (0.9%)

derivations29.0ms (1.7%)

preprocess22.0ms (1.3%)

end0.0ms (0%)

Profiling