Metrics for Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, H

start0.0ms (0%)

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

sample483.0ms (59.6%)

Memory

10.0MiB live, 525.7MiB allocated; 67ms collecting garbage

Samples

303.0ms

8 256×

valid

Precisions

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

ival-mult!: 64.0ms (62.4% of total)

ival-sub!: 37.0ms (36.1% of total)

adjust: 1.0ms (1% of total)

Bogosity

explain42.0ms (5.2%)

Memory

-1.0MiB live, 89.3MiB allocated; 11ms collecting garbage

FPErrors

Click to see full error table

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

18.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-sub!: 2.0ms (46.8% of total)

ival-mult!: 2.0ms (46.8% of total)

adjust: 0.0ms (0% of total)

preprocess65.0ms (8%)

Memory

-23.5MiB live, 39.1MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 5 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	28	34
2	37	34
3	61	34
4	154	31
5	665	30
6	5931	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(negabs x)

Compiler

Compiled 10 to 10 computations (0% saved)

series4.0ms (0.5%)

Memory

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

Counts

5 → 13

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite61.0ms (7.5%)

Memory

19.7MiB live, 66.0MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	40	136
0	41	128
1	168	125
0	1240	125

Stop Event

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

Counts

18 → 43

Calls

Call 1

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

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

eval4.0ms (0.5%)

Memory: 6.4MiB live, 6.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 421 to 118 computations (72% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	40	3	43
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	40	4	44

Accuracy

100.0%

Counts

44 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 x (-.f64 #s(literal 1 binary64) y))
▶	54.4%	(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
▶	100.0%	#s(approx (* x (- 1 y)) (-.f64 x (*.f64 y x)))
▶	48.3%	#s(approx (* x (- 1 y)) x)

Compiler

Compiled 31 to 26 computations (16.1% saved)

series6.0ms (0.7%)

Memory

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

Counts

9 → 22

Calls

Call 1

Inputs
#s(approx (* x (- 1 y)) x)
x
#s(approx (* x (- 1 y)) (-.f64 x (*.f64 y x)))
(-.f64 x (*.f64 y x))
(*.f64 y x)
y
(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
#s(approx (- 1 y) (neg.f64 y))
(neg.f64 y)

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

Calls

6 calls:

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

rewrite55.0ms (6.8%)

Memory

-19.8MiB live, 26.8MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	62	269
0	67	251
1	241	246
0	1699	246

Stop Event

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

Counts

31 → 66

Calls

Call 1

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

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

eval6.0ms (0.7%)

Memory: 6.0MiB live, 6.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 872 to 181 computations (79.2% saved)

prune4.0ms (0.5%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	63	0	63
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	63	4	67

Accuracy

100.0%

Counts

67 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 x (-.f64 #s(literal 1 binary64) y))
✓	54.4%	(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
✓	100.0%	#s(approx (* x (- 1 y)) (-.f64 x (*.f64 y x)))
✓	48.3%	#s(approx (* x (- 1 y)) x)

Compiler

Compiled 62 to 41 computations (33.9% saved)

regimes7.0ms (0.9%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

Outputs
#s(approx (* x (- 1 y)) (-.f64 x (*.f64 y x)))

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes19.0ms (2.4%)

Memory

-38.9MiB live, 7.8MiB allocated; 3ms collecting garbage

Counts

2 → 3

Calls

Call 1

Inputs
#s(approx (* x (- 1 y)) x)
(*.f64 x #s(approx (- 1 y) (neg.f64 y)))

Outputs
(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
#s(approx (* x (- 1 y)) x)
(*.f64 x #s(approx (- 1 y) (neg.f64 y)))

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
98.8%	3	`(-.f64 #s(literal 1 binary64) y)`
78.7%	3	`(*.f64 x (-.f64 #s(literal 1 binary64) y))`
60.2%	4	`x`
98.8%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.5%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (* x (- 1 y)) x)

Outputs
#s(approx (* x (- 1 y)) x)

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch1.0ms (0.1%)

Memory

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

Algorithm

2×	left-value

Steps

Time	Left	Right
0.0ms	1.0000000039359893	10793862.771890968
0.0ms	-106798650.4735127	0.9999999995853726

Compiler

Compiled 8 to 10 computations (-25% saved)

derivations12.0ms (1.5%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 53 to 20 computations (62.3% saved)

preprocess35.0ms (4.4%)

Memory: -8.6MiB live, 37.3MiB allocated; 11ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 222 to 112 computations (49.5% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample483.0ms (59.6%)

explain42.0ms (5.2%)

preprocess65.0ms (8%)

series4.0ms (0.5%)

rewrite61.0ms (7.5%)

eval4.0ms (0.5%)

prune2.0ms (0.2%)

series6.0ms (0.7%)

rewrite55.0ms (6.8%)

eval6.0ms (0.7%)

prune4.0ms (0.5%)

regimes7.0ms (0.9%)

regimes19.0ms (2.4%)

regimes4.0ms (0.5%)

bsearch1.0ms (0.1%)

derivations12.0ms (1.5%)

preprocess35.0ms (4.4%)

end0.0ms (0%)

Profiling