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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample624.0ms (71.9%)

Memory

27.8MiB live, 901.7MiB allocated; 197ms collecting garbage

Samples

399.0ms

8 256×

valid

Precisions

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

ival-sub: 98.0ms (49.2% of total)

ival-div: 88.0ms (44.2% of total)

exact: 7.0ms (3.5% of total)

ival-assert: 3.0ms (1.5% of total)

adjust: 2.0ms (1% of total)

Bogosity

explain57.0ms (6.5%)

Memory

3.1MiB live, 93.5MiB allocated; 13ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`y`
-	-	`#s(literal 200 binary64)`
-	-	`(-.f64 x (/.f64 y #s(literal 200 binary64)))`
-	-	`(/.f64 y #s(literal 200 binary64))`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

20.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-div: 4.0ms (49.6% of total)

ival-sub: 3.0ms (37.2% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess20.0ms (2.3%)

Memory

-32.5MiB live, 20.0MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	36
1	15	34
2	18	34
0	5	5
0	7	5
0	7	5

Stop Event

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

Calls

Call 1

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

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

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

series4.0ms (0.4%)

Memory

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

Counts

5 → 11

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite63.0ms (7.2%)

Memory

14.1MiB live, 58.9MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	41	124
0	43	121
1	173	120
0	1343	116

Stop Event

1×	iter limit
1×	iter limit
1×	node limit
1×	iter limit

Counts

16 → 26

Calls

Call 1

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

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

eval3.0ms (0.3%)

Memory: 4.4MiB live, 4.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 290 to 77 computations (73.4% saved)

prune4.0ms (0.5%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	24	1	25
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	24	2	26

Accuracy

100.0%

Counts

26 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 x (/.f64 y #s(literal 200 binary64)))
▶	99.9%	(-.f64 x #s(approx (/ y 200) (*.f64 #s(literal 1/200 binary64) y)))

Compiler

Compiled 14 to 13 computations (7.1% saved)

series2.0ms (0.3%)

Memory

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

Counts

6 → 12

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite56.0ms (6.5%)

Memory

-0.6MiB live, 44.7MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	43	142
0	44	139
1	184	138
0	1434	134

Stop Event

1×	iter limit
1×	iter limit
1×	node limit
1×	iter limit

Counts

18 → 26

Calls

Call 1

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

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

eval2.0ms (0.3%)

Memory: 4.3MiB live, 4.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 396 to 74 computations (81.3% saved)

prune8.0ms (1%)

Memory

-37.0MiB live, 9.2MiB allocated; 5ms collecting garbage

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	24	0	24
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	24	2	26

Accuracy

100.0%

Counts

26 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 x (/.f64 y #s(literal 200 binary64)))
✓	99.9%	(-.f64 x #s(approx (/ y 200) (*.f64 #s(literal 1/200 binary64) y)))

Compiler

Compiled 28 to 24 computations (14.3% saved)

regimes5.0ms (0.6%)

Memory

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

Accuracy

Total -0.1b remaining (-1400%)

Threshold costs -0.1b (-1400%)

Counts

2 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

simplify9.0ms (1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	5
1	7	5
2	16	5
3	23	5
4	25	5

Stop Event

1×

saturated

Calls

Call 1

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

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

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 5 to 5 computations (0% saved)

preprocess9.0ms (1%)

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

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample624.0ms (71.9%)

explain57.0ms (6.5%)

preprocess20.0ms (2.3%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.4%)

rewrite63.0ms (7.2%)

eval3.0ms (0.3%)

prune4.0ms (0.5%)

series2.0ms (0.3%)

rewrite56.0ms (6.5%)

eval2.0ms (0.3%)

prune8.0ms (1%)

regimes5.0ms (0.6%)

simplify9.0ms (1%)

derivations0.0ms (0%)

preprocess9.0ms (1%)

end0.0ms (0%)

Profiling