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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample839.0ms (73.6%)

Memory

-77.6MiB live, 734.4MiB allocated; 200ms collecting garbage

Samples

424.0ms	7 622×	0	valid
67.0ms	278×	1	valid
19.0ms	204×	2	valid
18.0ms	152×	3	valid

Precisions

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

ival-div: 104.0ms (31.3% of total)

ival-mult: 104.0ms (31.3% of total)

ival-sub: 93.0ms (28% of total)

adjust: 19.0ms (5.7% of total)

exact: 10.0ms (3% of total)

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

Bogosity

explain76.0ms (6.7%)

Memory

40.5MiB live, 133.6MiB allocated; 15ms collecting garbage

FPErrors

Click to see full error table

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

28.0ms	470×	0	valid
2.0ms	22×	1	valid
2.0ms	14×	2	valid
1.0ms	6×	3	valid

Compiler

Compiled 49 to 25 computations (49% saved)

Precisions

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

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

ival-mult: 3.0ms (25% of total)

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

adjust: 1.0ms (8.3% of total)

exact: 1.0ms (8.3% of total)

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

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

preprocess21.0ms (1.8%)

Memory

-18.1MiB live, 27.9MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	34
1	36	32
2	78	32
3	141	32
4	193	32
5	201	32
0	7	5
0	11	5
1	16	5
2	23	5
3	31	5
4	39	5
0	39	4

Stop Event

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

Calls

Call 1

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

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

Compiler

Compiled 7 to 7 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
▶	99.9%	(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))

Compiler

Compiled 7 to 7 computations (0% saved)

series4.0ms (0.3%)

Memory

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

rewrite63.0ms (5.5%)

Memory

-0.2MiB live, 52.5MiB allocated; 13ms 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 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 2 binary64)) (.f64 x x)) (-.f64 (*.f64 #s(literal -3/8 binary64) y) x))
(/.f64 (neg.f64 (*.f64 (fma.f64 #s(literal 3/8 binary64) y x) (fma.f64 #s(literal -3/8 binary64) y x))) (neg.f64 (fma.f64 #s(literal 3/8 binary64) y x)))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 #s(literal 3/8 binary64) y) #s(literal 3 binary64)))) (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 #s(literal -27/512 binary64) (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (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 (fma.f64 #s(literal 3/8 binary64) y x) (fma.f64 #s(literal -3/8 binary64) y x)) (fma.f64 #s(literal 3/8 binary64) y x))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 #s(literal 3/8 binary64) y) #s(literal 3 binary64))) (fma.f64 (.f64 #s(literal 3/8 binary64) y) (fma.f64 #s(literal 3/8 binary64) y x) (*.f64 x x)))
(/.f64 (fma.f64 #s(literal -27/512 binary64) (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (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 #s(literal -27/512 binary64) (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (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 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 2 binary64)) (fma.f64 #s(literal 3/8 binary64) y x)))
(-.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 (.f64 #s(literal 3/8 binary64) y) (fma.f64 #s(literal 3/8 binary64) y x) (.f64 x x))) (/.f64 (pow.f64 (.f64 #s(literal 3/8 binary64) y) #s(literal 3 binary64)) (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 (pow.f64 x #s(literal 3 binary64)) (fma.f64 (.f64 #s(literal -3/8 binary64) y) (-.f64 (.f64 #s(literal -3/8 binary64) y) x) (.f64 x x))) (/.f64 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 3 binary64)) (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: 8.3MiB live, 8.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 452 to 101 computations (77.7% saved)

prune12.0ms (1%)

Memory

-31.7MiB live, 14.3MiB allocated; 6ms collecting garbage

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	35	1	36
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	36	1	37

Accuracy

100.0%

Counts

37 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 4 to 4 computations (0% saved)

series2.0ms (0.2%)

Memory

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

Counts

4 → 9

Calls

Call 1

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

Outputs
#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 #s(hole binary64 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 (+ (* y -3/8) x) #s(hole binary64 (* -1 (* x (- (* 3/8 (/ y x)) 1)))))
#s(approx y #s(hole binary64 y))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (* y (- (/ x y) 3/8))))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (* -1 (* y (+ 3/8 (* -1 (/ x y)))))))

Calls

6 calls:

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

rewrite56.0ms (4.9%)

Memory

35.7MiB live, 79.6MiB allocated; 19ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	35	95
0	35	91
1	158	90
0	1185	88

Stop Event

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

Counts

13 → 31

Calls

Call 1

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

Outputs
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 #s(literal 3/8 binary64) y) #s(literal 3 binary64))) (fma.f64 x x (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (.f64 x (.f64 #s(literal 3/8 binary64) y)))))
(/.f64 (neg.f64 (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (.f64 (neg.f64 x) x))) (neg.f64 (-.f64 (*.f64 #s(literal -3/8 binary64) y) x)))
(/.f64 (neg.f64 (-.f64 (.f64 x x) (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 2 binary64)))) (neg.f64 (-.f64 x (*.f64 #s(literal -3/8 binary64) y))))
(/.f64 (neg.f64 (fma.f64 (pow.f64 y #s(literal 3 binary64)) #s(literal -27/512 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (.f64 x (-.f64 x (*.f64 #s(literal -3/8 binary64) y))))))
(/.f64 (neg.f64 (fma.f64 (pow.f64 y #s(literal 3 binary64)) #s(literal -27/512 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (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 y y) #s(literal 9/64 binary64) (.f64 (neg.f64 x) x)) (-.f64 (*.f64 #s(literal -3/8 binary64) y) x))
(/.f64 (-.f64 (.f64 x x) (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 2 binary64))) (-.f64 x (*.f64 #s(literal -3/8 binary64) y)))
(/.f64 (fma.f64 (pow.f64 y #s(literal 3 binary64)) #s(literal -27/512 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (.f64 x (-.f64 x (*.f64 #s(literal -3/8 binary64) y)))))
(/.f64 (fma.f64 (pow.f64 y #s(literal 3 binary64)) #s(literal -27/512 binary64) (pow.f64 x #s(literal 3 binary64))) (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 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 2 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 x x) (-.f64 x (.f64 #s(literal -3/8 binary64) y))) (/.f64 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 2 binary64)) (-.f64 x (.f64 #s(literal -3/8 binary64) y))))
(-.f64 x (*.f64 (neg.f64 y) #s(literal -3/8 binary64)))
(-.f64 x (*.f64 #s(literal 3/8 binary64) y))
(+.f64 (/.f64 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 3 binary64)) (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (.f64 x (-.f64 x (.f64 #s(literal -3/8 binary64) y))))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (.f64 x (-.f64 x (*.f64 #s(literal -3/8 binary64) y))))))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 (.f64 #s(literal -3/8 binary64) y) (-.f64 (.f64 #s(literal -3/8 binary64) y) x) (.f64 x x))) (/.f64 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 3 binary64)) (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 #s(literal -3/8 binary64) y))
y
#s(literal -3/8 binary64)
x
#s(approx (+ (* y -3/8) x) (*.f64 #s(literal -3/8 binary64) y))
#s(approx (+ (* y -3/8) x) (fma.f64 #s(literal -3/8 binary64) y x))
#s(approx x x)
#s(approx (+ (* y -3/8) x) x)
#s(approx (+ (* y -3/8) x) (*.f64 (fma.f64 (/.f64 y x) #s(literal -3/8 binary64) #s(literal 1 binary64)) x))
#s(approx (+ (* y -3/8) x) (*.f64 (neg.f64 x) (fma.f64 #s(literal 3/8 binary64) (/.f64 y x) #s(literal -1 binary64))))
#s(approx y y)
#s(approx (+ (* y -3/8) x) (*.f64 (-.f64 (/.f64 x y) #s(literal 3/8 binary64)) y))
#s(approx (+ (* y -3/8) x) (*.f64 (neg.f64 y) (-.f64 #s(literal 3/8 binary64) (/.f64 x y))))

eval3.0ms (0.3%)

Memory: 6.0MiB live, 6.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 422 to 93 computations (78% saved)

prune16.0ms (1.4%)

Memory

-34.3MiB live, 8.9MiB allocated; 18ms collecting garbage

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	31	0	31
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	31	1	32

Accuracy

100.0%

Counts

32 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 15 to 13 computations (13.3% saved)

regimes5.0ms (0.4%)

Memory

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

Accuracy

Total -0.1b remaining (-∞%)

Threshold costs -0.1b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(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:

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

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)

simplify9.0ms (0.7%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	4

Stop Event

1×

saturated

Calls

Call 1

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

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

derivations4.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 4 to 4 computations (0% saved)

preprocess26.0ms (2.3%)

Memory: -34.4MiB live, 20.2MiB allocated; 21ms collecting garbage
Compiler: Compiled 22 to 22 computations (0% saved)

end0.0ms (0%)

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

Iter	Nodes	Cost
0	17	34
1	36	32
2	78	32
3	141	32
4	193	32
5	201	32
0	7	5
0	11	5
1	16	5
2	23	5
3	31	5
4	39	5
0	39	4

Iter	Nodes	Cost
0	17	34
1	36	32
2	78	32
3	141	32
4	193	32
5	201	32
0	7	5
0	11	5
1	16	5
2	23	5
3	31	5
4	39	5
0	39	4

start0.0ms (0%)

analyze0.0ms (0%)

sample839.0ms (73.6%)

explain76.0ms (6.7%)

preprocess21.0ms (1.8%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.3%)

rewrite63.0ms (5.5%)

eval3.0ms (0.3%)

prune12.0ms (1%)

series2.0ms (0.2%)

rewrite56.0ms (4.9%)

eval3.0ms (0.3%)

prune16.0ms (1.4%)

regimes5.0ms (0.4%)

simplify9.0ms (0.7%)

derivations4.0ms (0.3%)

preprocess26.0ms (2.3%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	17	34
1	36	32
2	78	32
3	141	32
4	193	32
5	201	32
0	7	5
0	11	5
1	16	5
2	23	5
3	31	5
4	39	5
0	39	4