Metrics for Data.Colour.RGB:hslsv from colour-2.3.3, A

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample663.0ms (58%)

Memory

15.9MiB live, 812.8MiB allocated; 144ms collecting garbage

Samples

385.0ms

8 256×

valid

Precisions

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

ival-div: 74.0ms (52.7% of total)

ival-add: 57.0ms (40.6% of total)

exact: 5.0ms (3.6% of total)

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

adjust: 2.0ms (1.4% of total)

Bogosity

explain75.0ms (6.6%)

Memory

7.3MiB live, 53.9MiB allocated; 4ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(/.f64 (+.f64 x y) #s(literal 2 binary64))`
-	-	`y`
-	-	`#s(literal 2 binary64)`
-	-	`(+.f64 x y)`
-	-	`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

52.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-add: 36.0ms (88.8% of total)

ival-div: 3.0ms (7.4% 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)

preprocess236.0ms (20.6%)

Memory

10.3MiB live, 151.7MiB allocated; 22ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	34
1	35	34
2	65	34
3	99	34
4	155	34
5	372	30
6	1603	30
7	5470	30
0	5	5
0	7	5
1	13	5
2	17	5
3	25	5
4	51	5
5	165	5
6	935	5
7	5449	5
0	8357	5

Stop Event

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

Calls

Call 1

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

Outputs

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

(*.f64 (*.f64 (/.f64 (/.f64 (*.f64 (+.f64 y x) #s(literal -1 binary64)) #s(literal 2 binary64)) #s(literal -2 binary64)) #s(literal -1 binary64)) #s(literal -2 binary64))

Symmetry

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

series4.0ms (0.3%)

Memory

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

Counts

5 → 16

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite81.0ms (7.1%)

Memory

11.0MiB live, 58.3MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	58	181
0	59	173
1	258	173
0	1962	169

Stop Event

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

Counts

21 → 41

Calls

Call 1

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

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

eval4.0ms (0.4%)

Memory: 7.1MiB live, 7.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 568 to 148 computations (73.9% saved)

prune34.0ms (2.9%)

Memory

-33.6MiB live, 20.6MiB allocated; 6ms collecting garbage

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	41	0	41
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	41	1	42

Accuracy

100.0%

Counts

42 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 10 computations (0% saved)

simplify36.0ms (3.1%)

Memory

-0.7MiB live, 45.5MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	5
1	7	5
2	10	5
3	16	5
4	48	5
5	368	5
6	3458	5

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 5 to 5 computations (0% saved)

preprocess10.0ms (0.9%)

Memory: 26.6MiB live, 26.6MiB allocated; 0ms collecting garbage
Remove: (sort x y)
Compiler: Compiled 40 to 40 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample663.0ms (58%)

explain75.0ms (6.6%)

preprocess236.0ms (20.6%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.3%)

rewrite81.0ms (7.1%)

eval4.0ms (0.4%)

prune34.0ms (2.9%)

simplify36.0ms (3.1%)

derivations0.0ms (0%)

preprocess10.0ms (0.9%)

end0.0ms (0%)

Profiling