Metrics for Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, C

start0.0ms (0%)

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

analyze15.0ms (2%)

Memory

-31.4MiB live, 13.3MiB allocated; 7ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
50%	50%	50%	0.1%	0%	0%	0%	3
50%	50%	50%	0.1%	0%	0%	0%	4
75%	74.9%	25%	0.1%	0%	0%	0%	5
75%	74.9%	25%	0.1%	0%	0%	0%	6
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	7
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	8
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	9
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	10
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	11
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	12

Compiler

Compiled 7 to 7 computations (0% saved)

sample475.0ms (65.5%)

Memory

0.1MiB live, 715.7MiB allocated; 105ms collecting garbage

Samples

247.0ms

8 256×

valid

Precisions

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

ival-div!: 52.0ms (53.2% of total)

ival-mult!: 44.0ms (45% of total)

adjust: 1.0ms (1% of total)

Bogosity

preprocess123.0ms (17%)

Memory

5.3MiB live, 51.7MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	47	30
2	172	30
3	470	30
4	1211	30
5	4530	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(negabs x)

(negabs y)

Compiler

Compiled 10 to 10 computations (0% saved)

series8.0ms (1.1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	24

Stop Event

1×	iter-limit

Counts

5 → 4

Calls

Call 1

Inputs
(/.f64 x (*.f64 y #s(literal 2 binary64)))
x
(*.f64 y #s(literal 2 binary64))
y
#s(literal 2 binary64)

Outputs
#s(approx (/ x (* y 2)) (*.f64 #s(literal 1/2 binary64) (/.f64 x y)))
#s(approx x x)
#s(approx (* y 2) (*.f64 #s(literal 2 binary64) y))
#s(approx y y)

Calls

6 calls:

Time	Variable	Point
1.0ms	y	inf
1.0ms	x	-inf
1.0ms	x	inf
1.0ms	y	-inf
1.0ms	y	0

rewrite23.0ms (3.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	19	11
0	92	11

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

5 → 29

Calls

Call 1

Inputs
(/.f64 x (*.f64 y #s(literal 2 binary64)))
x
(*.f64 y #s(literal 2 binary64))
y
#s(literal 2 binary64)

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

eval28.0ms (3.9%)

Memory: -38.0MiB live, 15.1MiB allocated; 35ms collecting garbage
Compiler: Compiled 201 to 68 computations (66.2% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	28	1	29
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	29	1	30

Accuracy

100.0%

Counts

30 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(/.f64 x (+.f64 y y))

Compiler

Compiled 5 to 4 computations (20% saved)

series4.0ms (0.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	24

Stop Event

1×	iter-limit

Counts

4 → 4

Calls

Call 1

Inputs
(/.f64 x (+.f64 y y))
x
(+.f64 y y)
y

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

Calls

6 calls:

Time	Variable	Point
1.0ms	y	-inf
1.0ms	y	inf
0.0ms	x	inf
0.0ms	x	-inf
0.0ms	y	0

rewrite16.0ms (2.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
0	30	10

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

4 → 12

Calls

Call 1

Inputs
(/.f64 x (+.f64 y y))
x
(+.f64 y y)
y

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

eval8.0ms (1.1%)

Memory: -42.0MiB live, 5.4MiB allocated; 9ms collecting garbage
Compiler: Compiled 110 to 45 computations (59.1% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	12	0	12
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	12	1	13

Accuracy

100.0%

Counts

13 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(/.f64 x (+.f64 y y))

Compiler

Compiled 5 to 4 computations (20% saved)

regimes5.0ms (0.7%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

Inputs
(/.f64 x (+.f64 y y))
(/.f64 x (*.f64 y #s(literal 2 binary64)))

Outputs
(/.f64 x (+.f64 y y))

Calls

4 calls:

1.0ms	(*.f64 y #s(literal 2 binary64))
1.0ms	y
1.0ms	x
1.0ms	(/.f64 x (*.f64 y #s(literal 2 binary64)))

Results

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

Compiler

Compiled 20 to 20 computations (0% saved)

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 5 to 4 computations (20% saved)

preprocess17.0ms (2.3%)

Memory

-7.7MiB live, 38.0MiB allocated; 6ms collecting garbage

Remove

(negabs y)

(negabs x)

Compiler

Compiled 30 to 25 computations (16.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze15.0ms (2%)

sample475.0ms (65.5%)

preprocess123.0ms (17%)

series8.0ms (1.1%)

rewrite23.0ms (3.2%)

eval28.0ms (3.9%)

prune1.0ms (0.1%)

series4.0ms (0.6%)

rewrite16.0ms (2.2%)

eval8.0ms (1.1%)

prune1.0ms (0.1%)

regimes5.0ms (0.7%)

derivations1.0ms (0.1%)

preprocess17.0ms (2.3%)

end0.0ms (0%)

Profiling