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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample826.0ms (66.7%)

Memory

27.9MiB live, 737.4MiB allocated; 492ms collecting garbage

Samples

638.0ms

8 256×

valid

Precisions

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

ival-div!: 44.0ms (59.1% of total)

ival-add!: 28.0ms (37.6% of total)

adjust: 2.0ms (2.7% of total)

Bogosity

explain54.0ms (4.4%)

Memory

-12.1MiB live, 80.1MiB allocated; 18ms 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

20.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-div!: 3.0ms (64.6% of total)

ival-add!: 2.0ms (43.1% of total)

adjust: 0.0ms (0% of total)

preprocess92.0ms (7.4%)

Memory

-5.4MiB live, 41.6MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 5 (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

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(sort x y)

Compiler

Compiled 10 to 10 computations (0% saved)

series3.0ms (0.3%)

Memory

6.0MiB live, 6.0MiB 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	x	@	inf	((/ (+ x y) 2) (+ x y) x y 2)
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	y	@	-inf	((/ (+ x y) 2) (+ x y) x y 2)
0.0ms	x	@	0	((/ (+ x y) 2) (+ x y) x y 2)

rewrite93.0ms (7.5%)

Memory

5.6MiB live, 119.4MiB allocated; 28ms 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 x #s(literal 2 binary64)) (/.f64 x #s(literal 2 binary64))) (.f64 (/.f64 y #s(literal 2 binary64)) (/.f64 y #s(literal 2 binary64)))) (-.f64 (/.f64 x #s(literal 2 binary64)) (/.f64 y #s(literal 2 binary64))))
(/.f64 (+.f64 (pow.f64 (/.f64 x #s(literal 2 binary64)) #s(literal 3 binary64)) (pow.f64 (/.f64 y #s(literal 2 binary64)) #s(literal 3 binary64))) (fma.f64 (/.f64 x #s(literal 2 binary64)) (/.f64 x #s(literal 2 binary64)) (-.f64 (.f64 (/.f64 y #s(literal 2 binary64)) (/.f64 y #s(literal 2 binary64))) (.f64 (/.f64 x #s(literal 2 binary64)) (/.f64 y #s(literal 2 binary64))))))
(/.f64 (neg.f64 (neg.f64 (+.f64 y 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 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (.f64 (fma.f64 y (-.f64 y x) (.f64 x x)) #s(literal 2 binary64)))
(/.f64 (neg.f64 (+.f64 y x)) #s(literal -2 binary64))
(/.f64 (+.f64 y x) #s(literal 2 binary64))
(neg.f64 (/.f64 (neg.f64 (+.f64 y x)) #s(literal 2 binary64)))
(neg.f64 (/.f64 (+.f64 y x) #s(literal -2 binary64)))
(+.f64 (/.f64 y #s(literal 2 binary64)) (/.f64 x #s(literal 2 binary64)))
(+.f64 (/.f64 x #s(literal 2 binary64)) (/.f64 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 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 y (-.f64 y x) (*.f64 x x))))
(/.f64 (*.f64 (+.f64 y x) (-.f64 x y)) (-.f64 x y))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 y y (-.f64 (.f64 x x) (.f64 y x))))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 y (-.f64 y x) (*.f64 x 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 y (-.f64 y x) (.f64 x x))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y (-.f64 y x) (.f64 x 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) (fma.f64 (/.f64 y x) x x))
#s(approx (/ (+ x y) 2) (.f64 (neg.f64 x) (-.f64 (.f64 #s(literal -1/2 binary64) (/.f64 y x)) #s(literal 1/2 binary64))))
#s(approx (+ x y) (*.f64 (neg.f64 x) (fma.f64 #s(literal -1 binary64) (/.f64 y 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) (fma.f64 (/.f64 x y) y y))
#s(approx (/ (+ x y) 2) (.f64 (neg.f64 y) (-.f64 (.f64 (/.f64 x y) #s(literal -1/2 binary64)) #s(literal 1/2 binary64))))
#s(approx (+ x y) (*.f64 (neg.f64 y) (fma.f64 (/.f64 x y) #s(literal -1 binary64) #s(literal -1 binary64))))

eval4.0ms (0.3%)

Memory: 7.7MiB live, 7.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 464 to 132 computations (71.6% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	34	2	36
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	34	3	37

Accuracy

100.0%

Counts

37 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 19 to 17 computations (10.5% saved)

series2.0ms (0.2%)

Memory

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

Counts

7 → 16

Calls

Call 1

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

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
0.0ms	x	@	-inf	((/ (+ x y) 2) (+ x y) x 2 (/ (+ x y) 2) (+ x y) y)
0.0ms	y	@	-inf	((/ (+ x y) 2) (+ x y) x 2 (/ (+ x y) 2) (+ x y) y)
0.0ms	x	@	inf	((/ (+ x y) 2) (+ x y) x 2 (/ (+ x y) 2) (+ x y) y)
0.0ms	y	@	inf	((/ (+ x y) 2) (+ x y) x 2 (/ (+ x y) 2) (+ x y) y)
0.0ms	x	@	0	((/ (+ x y) 2) (+ x y) x 2 (/ (+ x y) 2) (+ x y) y)

rewrite94.0ms (7.6%)

Memory

-9.6MiB live, 83.3MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	58	197
0	60	189
1	263	189
0	1980	185

Stop Event

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

Counts

23 → 31

Calls

Call 1

Inputs
(/.f64 #s(approx (+ x y) x) #s(literal 2 binary64))
#s(approx (+ x y) x)
x
#s(literal 2 binary64)
(/.f64 #s(approx (+ x y) y) #s(literal 2 binary64))
#s(approx (+ x y) y)
y
#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 (neg.f64 (neg.f64 #s(approx (+ x y) x))) #s(literal 2 binary64))
(/.f64 (neg.f64 #s(approx (+ x y) x)) #s(literal -2 binary64))
(/.f64 #s(approx (+ x y) x) #s(literal 2 binary64))
(neg.f64 (/.f64 (neg.f64 #s(approx (+ x y) x)) #s(literal 2 binary64)))
(neg.f64 (/.f64 #s(approx (+ x y) x) #s(literal -2 binary64)))
#s(approx (+ x y) x)
x
#s(literal 2 binary64)
(/.f64 (neg.f64 (neg.f64 #s(approx (+ x y) y))) #s(literal 2 binary64))
(/.f64 (neg.f64 #s(approx (+ x y) y)) #s(literal -2 binary64))
(/.f64 #s(approx (+ x y) y) #s(literal 2 binary64))
(neg.f64 (/.f64 (neg.f64 #s(approx (+ x y) y)) #s(literal 2 binary64)))
(neg.f64 (/.f64 #s(approx (+ x y) y) #s(literal -2 binary64)))
#s(approx (+ x y) y)
y
#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) (fma.f64 (/.f64 y x) x x))
#s(approx (/ (+ x y) 2) (.f64 (neg.f64 x) (-.f64 (.f64 #s(literal -1/2 binary64) (/.f64 y x)) #s(literal 1/2 binary64))))
#s(approx (+ x y) (*.f64 (neg.f64 x) (fma.f64 #s(literal -1 binary64) (/.f64 y 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) (fma.f64 (/.f64 x y) y y))
#s(approx (/ (+ x y) 2) (.f64 (neg.f64 y) (-.f64 (.f64 (/.f64 x y) #s(literal -1/2 binary64)) #s(literal 1/2 binary64))))
#s(approx (+ x y) (*.f64 (neg.f64 y) (fma.f64 (/.f64 x y) #s(literal -1 binary64) #s(literal -1 binary64))))

eval2.0ms (0.2%)

Memory: 5.6MiB live, 5.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 238 to 75 computations (68.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	22	0	22
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	22	3	25

Accuracy

100.0%

Counts

25 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 38 to 27 computations (28.9% saved)

regimes15.0ms (1.2%)

Memory

-27.5MiB live, 18.6MiB allocated; 8ms collecting garbage

Counts

3 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes5.0ms (0.4%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
97.5%	2	`(+.f64 x y)`
97.5%	2	`(/.f64 (+.f64 x y) #s(literal 2 binary64))`
83.1%	2	`x`
82.4%	2	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes4.0ms (0.4%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 12 computations (-20% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-2.9989392952098706e-238	5.153888723852779e-296

Compiler

Compiled 8 to 10 computations (-25% saved)

derivations15.0ms (1.2%)

Memory

-32.5MiB live, 13.9MiB allocated; 2ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 34 to 13 computations (61.8% saved)

preprocess24.0ms (2%)

Memory: 19.6MiB live, 63.1MiB allocated; 8ms collecting garbage
Compiler: Compiled 146 to 84 computations (42.5% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample826.0ms (66.7%)

explain54.0ms (4.4%)

preprocess92.0ms (7.4%)

series3.0ms (0.3%)

rewrite93.0ms (7.5%)

eval4.0ms (0.3%)

prune2.0ms (0.1%)

series2.0ms (0.2%)

rewrite94.0ms (7.6%)

eval2.0ms (0.2%)

prune2.0ms (0.1%)

regimes15.0ms (1.2%)

regimes5.0ms (0.4%)

regimes4.0ms (0.4%)

bsearch0.0ms (0%)

derivations15.0ms (1.2%)

preprocess24.0ms (2%)

end0.0ms (0%)

Profiling