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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample629.0ms (84.7%)

Memory

71.5MiB live, 664.9MiB allocated; 276ms collecting garbage

Samples

416.0ms	7 649×	0	valid
13.0ms	274×	1	valid
12.0ms	154×	3	valid
11.0ms	179×	2	valid

Precisions

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

ival-mult!: 160.0ms (78.3% of total)

ival-sub!: 31.0ms (15.2% of total)

adjust: 13.0ms (6.4% of total)

Bogosity

preprocess39.0ms (5.3%)

Memory

-3.4MiB live, 41.0MiB allocated; 6ms 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

Stop Event

1×	node-limit

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)

series9.0ms (1.2%)

Memory

13.4MiB live, 13.4MiB 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
1.0ms	y	inf
1.0ms	y	-inf
1.0ms	x	-inf
0.0ms	x	inf
0.0ms	y	0

rewrite15.0ms (2%)

Memory

-36.4MiB live, 13.3MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	13
0	11	13
1	20	13
2	34	13
3	55	13
4	75	13
0	75	12

Stop Event

1×	iter-limit
1×	saturated
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

eval2.0ms (0.3%)

Memory: 4.2MiB live, 4.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 214 to 66 computations (69.2% saved)

prune1.0ms (0.2%)

Memory

2.2MiB live, 2.1MiB 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)
▶	49.3%	#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))

Compiler

Compiled 15 to 14 computations (6.7% saved)

series4.0ms (0.6%)

Memory

6.8MiB live, 6.8MiB 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
0.0ms	y	-inf
0.0ms	y	inf
0.0ms	x	-inf
0.0ms	x	inf
0.0ms	y	0

rewrite7.0ms (1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	19
0	15	18
1	26	18
2	43	18
3	71	18
4	86	18
0	86	18

Stop Event

1×	iter-limit
1×	saturated
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.3%)

Memory: 3.7MiB live, 3.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 207 to 64 computations (69.1% saved)

prune1.0ms (0.2%)

Memory

2.5MiB live, 2.5MiB allocated; 0ms 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)
✓	49.3%	#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))

Compiler

Compiled 15 to 14 computations (6.7% saved)

regimes13.0ms (1.8%)

Memory

-22.0MiB live, 23.9MiB allocated; 3ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

3 → 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))

Call 2

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

8 calls:

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

Results

Accuracy	Segments	Branch
49.3%	1	`(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)`
49.3%	1	`(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))`
49.3%	1	`x`
49.3%	1	`y`
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 50 to 50 computations (0% saved)

derivations2.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 15 to 11 computations (26.7% saved)

preprocess16.0ms (2.2%)

Memory: -15.6MiB live, 29.3MiB allocated; 4ms collecting garbage
Compiler: Compiled 22 to 18 computations (18.2% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample629.0ms (84.7%)

preprocess39.0ms (5.3%)

series9.0ms (1.2%)

rewrite15.0ms (2%)

eval2.0ms (0.3%)

prune1.0ms (0.2%)

series4.0ms (0.6%)

rewrite7.0ms (1%)

eval2.0ms (0.3%)

prune1.0ms (0.2%)

regimes13.0ms (1.8%)

derivations2.0ms (0.3%)

preprocess16.0ms (2.2%)

end0.0ms (0%)

Profiling