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)

sample590.0ms (43%)

Memory

22.6MiB live, 1 122.4MiB allocated; 166ms collecting garbage

Samples

296.0ms	7 607×	0	valid
69.0ms	218×	2	valid
12.0ms	295×	1	valid
9.0ms	136×	3	valid

Precisions

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

ival-mult!: 146.0ms (72.4% of total)

ival-sub!: 44.0ms (21.8% of total)

adjust: 12.0ms (5.9% of total)

Bogosity

preprocess115.0ms (8.4%)

Memory

-47.7MiB live, 53.1MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	17	34
1	61	30
2	193	30
3	562	30
4	1295	30
5	5187	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Compiler

Compiled 14 to 14 computations (0% saved)

series7.0ms (0.5%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	38	106

Stop Event

1×	iter-limit

Counts

7 → 10

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

rewrite271.0ms (19.8%)

Memory

31.5MiB live, 268.8MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	13
0	11	13
1	36	13
2	93	13
3	161	13
4	289	13
5	616	13
6	3293	13
0	8192	12
1	13922	12

Stop Event

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

Counts

7 → 19

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

eval3.0ms (0.2%)

Memory: -38.4MiB live, 8.7MiB allocated; 2ms collecting garbage
Compiler: Compiled 105 to 66 computations (37.1% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	23	2	25
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	24	2	26

Accuracy

100.0%

Counts

26 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 14 to 14 computations (0% saved)

series5.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	39	98

Stop Event

1×	iter-limit

Counts

6 → 9

Calls

Call 1

Inputs
#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)
x

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

Calls

6 calls:

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

rewrite281.0ms (20.4%)

Memory

14.6MiB live, 250.1MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	19
0	15	18
1	55	18
2	126	18
3	239	18
4	337	18
5	653	18
6	3330	18
0	8229	18
1	13959	18

Stop Event

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

Counts

6 → 18

Calls

Call 1

Inputs
#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)
x

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

eval2.0ms (0.2%)

Memory: 8.7MiB live, 8.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 91 to 64 computations (29.7% saved)

prune34.0ms (2.5%)

Memory

-71.3MiB live, 17.6MiB allocated; 49ms collecting garbage

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	21	0	21
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	21	2	23

Accuracy

100.0%

Counts

23 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 30 to 30 computations (0% saved)

regimes7.0ms (0.5%)

Memory

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

Counts

3 → 1

Calls

Call 1

Inputs
#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	y
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)
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)

regimes8.0ms (0.5%)

Memory

-31.4MiB live, 16.6MiB 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)) (*.f64 #s(literal -3/8 binary64) y))

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 14 to 17 computations (-21.4% saved)

derivations33.0ms (2.4%)

Memory

2.2MiB live, 47.7MiB allocated; 4ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 11 to 11 computations (0% saved)

preprocess17.0ms (1.2%)

Memory: 1.2MiB live, 46.8MiB allocated; 5ms collecting garbage
Compiler: Compiled 18 to 18 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample590.0ms (43%)

preprocess115.0ms (8.4%)

series7.0ms (0.5%)

rewrite271.0ms (19.8%)

eval3.0ms (0.2%)

prune1.0ms (0.1%)

series5.0ms (0.4%)

rewrite281.0ms (20.4%)

eval2.0ms (0.2%)

prune34.0ms (2.5%)

regimes7.0ms (0.5%)

regimes8.0ms (0.5%)

derivations33.0ms (2.4%)

preprocess17.0ms (1.2%)

end0.0ms (0%)

Profiling