Metrics for System.Random.MWC.Distributions:standard from mwc-random-0.13.3.2

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 8 computations (11.1% saved)

sample743.0ms (67%)

Memory

32.3MiB live, 455.2MiB allocated; 167ms collecting garbage

Samples

428.0ms	8 254×	0	valid
0.0ms	2×	2	valid

Precisions

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

ival-mult!: 109.0ms (68.5% of total)

ival-sub!: 49.0ms (30.8% of total)

adjust: 1.0ms (0.6% of total)

Bogosity

preprocess83.0ms (7.5%)

Memory

-20.0MiB live, 26.4MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	42
1	58	42
2	195	42
3	454	42
4	977	42
5	3471	42

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(abs x)

Compiler

Compiled 12 to 12 computations (0% saved)

series4.0ms (0.4%)

Memory

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

Counts

6 → 15

Calls

Call 1

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

Outputs
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* -1/2 y)))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (+ (* -1/2 y) (* 1/2 (pow x 2)))))
#s(approx (- (* x x) y) #s(hole binary64 (* -1 y)))
#s(approx (- (* x x) y) #s(hole binary64 (- (pow x 2) y)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* 1/2 (pow x 2))))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* -1/2 (/ y (pow x 2)))))))
#s(approx (- (* x x) y) #s(hole binary64 (* (pow x 2) (+ 1 (* -1 (/ y (pow x 2)))))))
#s(approx (- (* x x) y) #s(hole binary64 (+ (* -1 y) (pow x 2))))
#s(approx y #s(hole binary64 y))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* y (- (* 1/2 (/ (pow x 2) y)) 1/2))))
#s(approx (- (* x x) y) #s(hole binary64 (* y (- (/ (pow x 2) y) 1))))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* -1 (* y (+ 1/2 (* -1/2 (/ (pow x 2) y)))))))
#s(approx (- (* x x) y) #s(hole binary64 (* -1 (* y (+ 1 (* -1 (/ (pow x 2) y)))))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((* 1/2 (- (* x x) y)) 1/2 (- (* x x) y) (* x x) x y)
1.0ms	x	@	-inf	((* 1/2 (- (* x x) y)) 1/2 (- (* x x) y) (* x x) x y)
1.0ms	x	@	0	((* 1/2 (- (* x x) y)) 1/2 (- (* x x) y) (* x x) x y)
1.0ms	y	@	0	((* 1/2 (- (* x x) y)) 1/2 (- (* x x) y) (* x x) x y)
1.0ms	y	@	-inf	((* 1/2 (- (* x x) y)) 1/2 (- (* x x) y) (* x x) x y)

rewrite268.0ms (24.1%)

Memory

4.5MiB live, 191.8MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	56	219
0	59	209
1	298	206
2	2018	206

Stop Event

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

Counts

21 → 11

Calls

Call 1

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

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

eval0.0ms (0%)

Memory: 1.2MiB live, 1.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 23 to 19 computations (17.4% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	4	0	4
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	4	1	5

Accuracy

100.0%

Counts

5 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(.f64 #s(literal 1/2 binary64) (-.f64 (.f64 x x) y))

Compiler

Compiled 12 to 12 computations (0% saved)

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 6 to 6 computations (0% saved)

preprocess9.0ms (0.8%)

Memory: 26.6MiB live, 26.6MiB allocated; 0ms collecting garbage
Remove: (abs x)
Compiler: Compiled 24 to 24 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample743.0ms (67%)

preprocess83.0ms (7.5%)

series4.0ms (0.4%)

rewrite268.0ms (24.1%)

eval0.0ms (0%)

prune1.0ms (0.1%)

derivations0.0ms (0%)

preprocess9.0ms (0.8%)

end0.0ms (0%)

Profiling