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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample426.0ms (61.4%)

Memory

28.3MiB live, 778.7MiB allocated; 150ms collecting garbage

Samples

220.0ms

8 256×

valid

Precisions

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

ival-sub!: 39.0ms (55.6% of total)

ival-add!: 30.0ms (42.8% of total)

adjust: 1.0ms (1.4% of total)

Bogosity

preprocess61.0ms (8.8%)

Memory

-37.1MiB live, 56.0MiB allocated; 7ms 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 10 to 8 computations (20% saved)

series5.0ms (0.7%)

Memory

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

rewrite36.0ms (5.2%)

Memory

-4.6MiB live, 46.3MiB allocated; 13ms 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)

eval2.0ms (0.3%)

Memory: 4.3MiB live, 4.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 192 to 63 computations (67.2% saved)

prune1.0ms (0.1%)

Memory

2.3MiB live, 2.3MiB 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))
▶	45.7%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 11 to 10 computations (9.1% saved)

series2.0ms (0.3%)

Memory

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

rewrite23.0ms (3.3%)

Memory

-7.8MiB live, 39.6MiB allocated; 3ms 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

eval2.0ms (0.3%)

Memory: 5.0MiB live, 5.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 187 to 57 computations (69.5% saved)

prune1.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))
▶	55.6%	#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
✓	45.7%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 20 to 17 computations (15% saved)

series3.0ms (0.4%)

Memory

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

rewrite22.0ms (3.2%)

Memory

-12.5MiB live, 33.8MiB allocated; 3ms 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

eval1.0ms (0.2%)

Memory: 3.3MiB live, 3.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 154 to 47 computations (69.5% saved)

prune1.0ms (0.2%)

Memory

3.0MiB live, 3.0MiB 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))
▶	55.6%	#s(approx (- (+ x x) 1) (+.f64 x x))
✓	45.7%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 20 to 16 computations (20% saved)

series2.0ms (0.3%)

Memory

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

rewrite22.0ms (3.2%)

Memory

-16.5MiB live, 29.2MiB allocated; 4ms 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

eval1.0ms (0.1%)

Memory: 3.1MiB live, 3.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 138 to 42 computations (69.6% saved)

prune1.0ms (0.2%)

Memory

2.3MiB live, 2.3MiB 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))
✓	55.6%	#s(approx (- (+ x x) 1) (+.f64 x x))
✓	45.7%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 20 to 16 computations (20% saved)

regimes36.0ms (5.2%)

Memory

-7.7MiB live, 49.0MiB allocated; 26ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

3 → 3

5 → 1

Calls

Call 1

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

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

Call 2

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

Call 3

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

9 calls:

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

Results

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

Compiler

Compiled 61 to 35 computations (42.6% saved)

bsearch18.0ms (2.5%)

Memory

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

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
8.0ms	1.4988946835734236e-5	35738.28451454678
8.0ms	-139.02102573805203	-1.5576240530372018e-16

Samples

6.0ms

304×

valid

Compiler

Compiled 312 to 274 computations (12.2% saved)

Precisions

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

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

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

adjust: 0.0ms (0% of total)

derivations6.0ms (0.9%)

Memory

-42.4MiB live, 5.0MiB allocated; 6ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 44 to 16 computations (63.6% saved)

preprocess21.0ms (3%)

Memory: 7.3MiB live, 53.1MiB allocated; 4ms collecting garbage
Compiler: Compiled 49 to 20 computations (59.2% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample426.0ms (61.4%)

preprocess61.0ms (8.8%)

series5.0ms (0.7%)

rewrite36.0ms (5.2%)

eval2.0ms (0.3%)

prune1.0ms (0.1%)

series2.0ms (0.3%)

rewrite23.0ms (3.3%)

eval2.0ms (0.3%)

prune1.0ms (0.2%)

series3.0ms (0.4%)

rewrite22.0ms (3.2%)

eval1.0ms (0.2%)

prune1.0ms (0.2%)

series2.0ms (0.3%)

rewrite22.0ms (3.2%)

eval1.0ms (0.1%)

prune1.0ms (0.2%)

regimes36.0ms (5.2%)

bsearch18.0ms (2.5%)

derivations6.0ms (0.9%)

preprocess21.0ms (3%)

end0.0ms (0%)

Profiling