Metrics for Data.Random.Distribution.Normal:doubleStdNormalZ from random-fu-0.2.6.2

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample434.0ms (50.6%)

Memory

-32.7MiB live, 495.3MiB allocated; 103ms collecting garbage

Samples

218.0ms

8 256×

valid

Precisions

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

ival-add!: 28.0ms (53.5% of total)

ival-sub!: 23.0ms (43.9% of total)

adjust: 1.0ms (1.9% of total)

Bogosity

preprocess251.0ms (29.3%)

Memory

-7.8MiB live, 37.6MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	17
1	31	15
2	90	15
3	202	15
4	775	15
5	5798	15

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 8 computations (0% saved)

series2.0ms (0.2%)

Memory

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

Counts

4 → 7

Calls

Call 1

Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
x
#s(literal 1 binary64)

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

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((- (+ x x) 1) (+ x x) x 1)
1.0ms	x	@	-inf	((- (+ x x) 1) (+ x x) x 1)
0.0ms	x	@	0	((- (+ x x) 1) (+ x x) x 1)

rewrite34.0ms (3.9%)

Memory

4.7MiB live, 48.2MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	75
0	24	74
0	117	67

Stop Event

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

Counts

11 → 23

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 4.3MiB live, 4.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 85 to 59 computations (30.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	16	3	19
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	17	3	20

Accuracy

100.0%

Counts

20 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
▶	49.4%	#s(approx (- (+ x x) 1) (+.f64 x x))
▶	51.6%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 16 to 16 computations (0% saved)

series1.0ms (0.2%)

Memory

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

Counts

7 → 12

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
x
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
#s(literal 2 binary64)

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

Calls

3 calls:

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

rewrite67.0ms (7.8%)

Memory

-7.6MiB live, 45.2MiB allocated; 49ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	31	141
0	32	130
0	144	130

Stop Event

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

Counts

19 → 34

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 6.3MiB live, 6.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 102 to 66 computations (35.3% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	21	0	21
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	21	3	24

Accuracy

100.0%

Counts

24 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
✓	49.4%	#s(approx (- (+ x x) 1) (+.f64 x x))
✓	51.6%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 31 to 28 computations (9.7% saved)

regimes5.0ms (0.6%)

Memory

13.8MiB live, 13.7MiB allocated; 0ms collecting garbage

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
(-.f64 (+.f64 x x) #s(literal 1 binary64))

Outputs
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))

Calls

3 calls:

2.0ms	x
2.0ms	(+.f64 x x)
1.0ms	(-.f64 (+.f64 x x) #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 x x)`
100.0%	1	`(-.f64 (+.f64 x x) #s(literal 1 binary64))`
100.0%	1	`x`

Compiler

Compiled 7 to 7 computations (0% saved)

regimes8.0ms (0.9%)

Memory

-36.6MiB live, 11.7MiB allocated; 11ms collecting garbage

Counts

2 → 3

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))

Outputs
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))

Calls

3 calls:

5.0ms	(+.f64 x x)
1.0ms	x
1.0ms	(-.f64 (+.f64 x x) #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
97.5%	3	`(+.f64 x x)`
97.5%	3	`(-.f64 (+.f64 x x) #s(literal 1 binary64))`
97.5%	3	`x`

Compiler

Compiled 7 to 7 computations (0% saved)

regimes3.0ms (0.4%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Calls

3 calls:

1.0ms	x
1.0ms	(+.f64 x x)
1.0ms	(-.f64 (+.f64 x x) #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
51.6%	1	`(+.f64 x x)`
51.6%	1	`(-.f64 (+.f64 x x) #s(literal 1 binary64))`
51.6%	1	`x`

Compiler

Compiled 7 to 7 computations (0% saved)

bsearch16.0ms (1.9%)

Memory

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

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
7.0ms	0.0479137892428057	1457624.476431218
8.0ms	-1.6548406547324037	-4.5737287440714495e-8

Samples

6.0ms

288×

valid

Compiler

Compiled 224 to 260 computations (-16.1% saved)

Precisions

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

ival-sub!: 1.0ms (77.2% of total)

ival-add!: 1.0ms (77.2% of total)

adjust: 0.0ms (0% of total)

derivations6.0ms (0.7%)

Memory

-40.6MiB live, 5.6MiB allocated; 4ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 18 to 16 computations (11.1% saved)

preprocess22.0ms (2.6%)

Memory: 4.6MiB live, 49.6MiB allocated; 5ms collecting garbage
Compiler: Compiled 22 to 20 computations (9.1% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample434.0ms (50.6%)

preprocess251.0ms (29.3%)

series2.0ms (0.2%)

rewrite34.0ms (3.9%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

series1.0ms (0.2%)

rewrite67.0ms (7.8%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

regimes5.0ms (0.6%)

regimes8.0ms (0.9%)

regimes3.0ms (0.4%)

bsearch16.0ms (1.9%)

derivations6.0ms (0.7%)

preprocess22.0ms (2.6%)

end0.0ms (0%)

Profiling