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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample705.0ms (63.6%)

Memory

10.7MiB live, 592.4MiB allocated; 141ms collecting garbage

Samples

403.0ms

8 256×

valid

Precisions

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

ival-add!: 41.0ms (51.4% of total)

ival-sub!: 37.0ms (46.4% of total)

adjust: 2.0ms (2.5% of total)

Bogosity

preprocess98.0ms (8.8%)

Memory

-36.9MiB live, 61.6MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	17
1	31	15
2	85	15
3	209	15
4	974	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)

series5.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	56

Stop Event

1×	iter-limit

Counts

4 → 6

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

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)

rewrite26.0ms (2.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
0	47	9

Stop Event

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

Counts

4 → 17

Calls

Call 1

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

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

eval33.0ms (3%)

Memory: -37.9MiB live, 8.0MiB allocated; 9ms collecting garbage
Compiler: Compiled 91 to 63 computations (30.8% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	17	2	19
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	18	2	20

Accuracy

100.0%

Counts

20 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 10 computations (0% saved)

series4.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	58

Stop Event

1×	iter-limit

Counts

5 → 6

Calls

Call 1

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

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

Calls

3 calls:

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

rewrite40.0ms (3.6%)

Memory

3.5MiB live, 49.3MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	14
0	10	13
0	75	13

Stop Event

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

Counts

5 → 18

Calls

Call 1

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

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

eval4.0ms (0.3%)

Memory: 6.4MiB live, 6.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 88 to 57 computations (35.2% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	17	1	18
Fresh	0	0	0
Picked	0	2	2
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 #s(literal 2 binary64) x #s(literal -1 binary64))
▶	52.3%	#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
✓	49.2%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 17 to 17 computations (0% saved)

series5.0ms (0.5%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	56

Stop Event

1×	iter-limit

Counts

4 → 6

Calls

Call 1

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

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

Calls

3 calls:

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

rewrite44.0ms (4%)

Memory

-11.4MiB live, 41.6MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	14
0	8	14
0	50	13

Stop Event

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

Counts

4 → 10

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 2.7MiB live, 2.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 64 to 47 computations (26.6% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	11	1	12
Fresh	0	0	0
Picked	1	0	1
Done	0	2	2
Total	12	3	15

Accuracy

100.0%

Counts

15 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 16 to 16 computations (0% saved)

series5.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	56

Stop Event

1×	iter-limit

Counts

3 → 6

Calls

Call 1

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

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

Calls

3 calls:

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

rewrite38.0ms (3.4%)

Memory

-23.7MiB live, 23.2MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	13
0	7	13
0	48	12

Stop Event

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

Counts

3 → 8

Calls

Call 1

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

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

eval4.0ms (0.3%)

Memory: 2.0MiB live, 2.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 58 to 42 computations (27.6% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	10	0	10
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	10	3	13

Accuracy

100.0%

Counts

13 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 33 to 30 computations (9.1% saved)

regimes9.0ms (0.8%)

Memory

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

Counts

5 → 1

Calls

Call 1

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

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

Calls

3 calls:

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

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)

regimes9.0ms (0.8%)

Memory

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

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) 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:

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

Results

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

Compiler

Compiled 7 to 7 computations (0% saved)

regimes6.0ms (0.5%)

Memory

7.2MiB live, 7.2MiB 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:

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

Results

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

Compiler

Compiled 7 to 7 computations (0% saved)

bsearch26.0ms (2.4%)

Memory

-22.7MiB live, 22.0MiB allocated; 5ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
9.0ms	2.392015036366733e-20	4.047920404007436
15.0ms	-30.922400745989005	-1.4816144486072554e-5

Samples

7.0ms

320×

valid

Compiler

Compiled 248 to 288 computations (-16.1% saved)

Precisions

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

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

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

adjust: 0.0ms (0% of total)

derivations3.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 18 to 16 computations (11.1% saved)

preprocess36.0ms (3.3%)

Memory: 13.0MiB live, 58.9MiB allocated; 7ms 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%)

sample705.0ms (63.6%)

preprocess98.0ms (8.8%)

series5.0ms (0.4%)

rewrite26.0ms (2.4%)

eval33.0ms (3%)

prune2.0ms (0.2%)

series4.0ms (0.4%)

rewrite40.0ms (3.6%)

eval4.0ms (0.3%)

prune2.0ms (0.2%)

series5.0ms (0.5%)

rewrite44.0ms (4%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

series5.0ms (0.4%)

rewrite38.0ms (3.4%)

eval4.0ms (0.3%)

prune2.0ms (0.2%)

regimes9.0ms (0.8%)

regimes9.0ms (0.8%)

regimes6.0ms (0.5%)

bsearch26.0ms (2.4%)

derivations3.0ms (0.2%)

preprocess36.0ms (3.3%)

end0.0ms (0%)

Profiling