Metrics for Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, A

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 9 to 9 computations (0% saved)

sample516.0ms (59.8%)

Memory

37.6MiB live, 640.1MiB allocated; 121ms collecting garbage

Samples

249.0ms	7 599×	0	valid
12.0ms	284×	1	valid
12.0ms	217×	2	valid
10.0ms	156×	3	valid

Precisions

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

ival-mult!: 48.0ms (50.8% of total)

ival-sub!: 34.0ms (36% of total)

adjust: 12.0ms (12.7% of total)

Bogosity

preprocess14.0ms (1.7%)

Memory

-15.3MiB live, 29.0MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	17	34
1	36	32
2	78	32
3	141	32
4	193	32
5	201	32

Stop Event

1×

saturated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.9%	(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))

Compiler

Compiled 14 to 14 computations (0% saved)

series4.0ms (0.4%)

Memory

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

Counts

7 → 11

Calls

Call 1

Inputs
(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))
x
(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)
(/.f64 #s(literal 3 binary64) #s(literal 8 binary64))
#s(literal 3 binary64)
#s(literal 8 binary64)
y

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

Calls

6 calls:

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

rewrite166.0ms (19.3%)

Memory

-25.9MiB live, 88.7MiB allocated; 146ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	42	126
0	46	123
1	162	122
0	1219	109

Stop Event

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

Counts

18 → 37

Calls

Call 1

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

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

eval3.0ms (0.3%)

Memory: 5.7MiB live, 5.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 220 to 97 computations (55.9% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	29	3	32
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	30	3	33

Accuracy

100.0%

Counts

33 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 y #s(literal -3/8 binary64) x)
▶	49.3%	#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
▶	51.2%	#s(approx (- x (* (/ 3 8) y)) x)

Compiler

Compiled 22 to 22 computations (0% saved)

series3.0ms (0.3%)

Memory

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

Counts

7 → 18

Calls

Call 1

Inputs
#s(approx (- x (* (/ 3 8) y)) x)
x
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
(*.f64 #s(literal -3/8 binary64) y)
#s(literal -3/8 binary64)
y
(fma.f64 y #s(literal -3/8 binary64) x)

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

Calls

6 calls:

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

rewrite63.0ms (7.3%)

Memory

1.9MiB live, 48.3MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	51	221
0	51	202
1	182	200
0	1303	196

Stop Event

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

Counts

25 → 48

Calls

Call 1

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

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

eval8.0ms (0.9%)

Memory: -35.7MiB live, 8.9MiB allocated; 5ms collecting garbage
Compiler: Compiled 259 to 104 computations (59.8% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	33	0	33
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	33	3	36

Accuracy

100.0%

Counts

36 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 y #s(literal -3/8 binary64) x)
✓	49.3%	#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
✓	51.2%	#s(approx (- x (* (/ 3 8) y)) x)

Compiler

Compiled 42 to 39 computations (7.1% saved)

regimes8.0ms (0.9%)

Memory

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

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (- x (* (/ 3 8) y)) x)
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
(fma.f64 y #s(literal -3/8 binary64) x)
(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))

Outputs
(fma.f64 y #s(literal -3/8 binary64) x)

Calls

4 calls:

2.0ms	(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))
2.0ms	(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)
2.0ms	x
2.0ms	y

Results

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

Compiler

Compiled 14 to 17 computations (-21.4% saved)

regimes5.0ms (0.6%)

Memory

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

Counts

2 → 3

Calls

Call 1

Inputs
#s(approx (- x (* (/ 3 8) y)) x)
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))

Outputs
#s(approx (- x (* (/ 3 8) y)) x)
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
#s(approx (- x (* (/ 3 8) y)) x)

Calls

4 calls:

1.0ms	(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)
1.0ms	x
1.0ms	(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))
1.0ms	y

Results

Accuracy	Segments	Branch
75.4%	3	`(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)`
61.3%	4	`(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))`
78.3%	3	`x`
75.4%	3	`y`

Compiler

Compiled 14 to 17 computations (-21.4% saved)

regimes12.0ms (1.4%)

Memory

-31.0MiB live, 19.7MiB allocated; 6ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- x (* (/ 3 8) y)) x)

Outputs
#s(approx (- x (* (/ 3 8) y)) x)

Calls

4 calls:

5.0ms	(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)
4.0ms	y
1.0ms	(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))
1.0ms	x

Results

Accuracy	Segments	Branch
51.2%	1	`(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))`
51.2%	1	`(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)`
51.2%	1	`y`
51.2%	1	`x`

Compiler

Compiled 14 to 17 computations (-21.4% saved)

bsearch21.0ms (2.4%)

Memory

-5.2MiB live, 41.1MiB allocated; 2ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
11.0ms	43.93571732932443	49648196105005060.0
8.0ms	-7.175210272014691e+26	-1.4189466200290415e+24

Samples

7.0ms	267×	0	valid
1.0ms	13×	2	valid
0.0ms	8×	1	valid

Compiler

Compiled 334 to 372 computations (-11.4% saved)

Precisions

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

ival-sub!: 1.0ms (38.5% of total)

ival-mult!: 1.0ms (38.5% of total)

adjust: 0.0ms (0% of total)

derivations12.0ms (1.4%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 21 to 18 computations (14.3% saved)

preprocess24.0ms (2.7%)

Memory: 11.5MiB live, 56.7MiB allocated; 6ms collecting garbage
Compiler: Compiled 28 to 25 computations (10.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample516.0ms (59.8%)

preprocess14.0ms (1.7%)

series4.0ms (0.4%)

rewrite166.0ms (19.3%)

eval3.0ms (0.3%)

prune2.0ms (0.2%)

series3.0ms (0.3%)

rewrite63.0ms (7.3%)

eval8.0ms (0.9%)

prune2.0ms (0.2%)

regimes8.0ms (0.9%)

regimes5.0ms (0.6%)

regimes12.0ms (1.4%)

bsearch21.0ms (2.4%)

derivations12.0ms (1.4%)

preprocess24.0ms (2.7%)

end0.0ms (0%)

Profiling