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

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

sample435.0ms (55.6%)

Memory

10.4MiB live, 577.4MiB allocated; 53ms collecting garbage

Samples

254.0ms

8 256×

valid

Precisions

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

ival-add!: 54.0ms (72.3% of total)

ival-sub!: 19.0ms (25.4% of total)

adjust: 1.0ms (1.3% of total)

Bogosity

preprocess129.0ms (16.5%)

Memory

-28.3MiB live, 64.1MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	19	16
2	34	16
3	78	16
4	385	15
5	3647	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.3%)

Memory

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

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

rewrite89.0ms (11.3%)

Memory

-28.6MiB live, 110.3MiB allocated; 81ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	66
0	23	65
0	98	65

Stop Event

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

Counts

10 → 17

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

eval1.0ms (0.2%)

Memory: 5.5MiB live, 5.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 72 to 51 computations (29.2% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

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

Accuracy

100.0%

Counts

14 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 10 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

2 → 5

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#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) 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
0.0ms	x	@	inf	((- (+ x x) 1) -1)
0.0ms	x	@	-inf	((- (+ x x) 1) -1)
0.0ms	x	@	0	((- (+ x x) 1) -1)

rewrite35.0ms (4.5%)

Memory

-36.1MiB live, 65.5MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	63
0	19	62
0	93	62

Stop Event

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

Counts

7 → 7

Calls

Call 1

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

eval0.0ms (0.1%)

Memory: 1.7MiB live, 1.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 26 to 18 computations (30.8% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	3	1	4
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	3	3	6

Accuracy

100.0%

Counts

6 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 16 to 16 computations (0% saved)

series1.0ms (0.1%)

Memory

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

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

Calls

3 calls:

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

rewrite24.0ms (3.1%)

Memory

4.9MiB live, 51.1MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	69
0	23	68
0	98	68

Stop Event

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

Counts

9 → 13

Calls

Call 1

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

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

eval1.0ms (0.1%)

Memory: 2.5MiB live, 2.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 52 to 37 computations (28.8% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

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

Accuracy

100.0%

Counts

12 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 29 to 26 computations (10.3% saved)

regimes5.0ms (0.6%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

Calls

3 calls:

2.0ms	(+.f64 x x)
1.0ms	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)

regimes10.0ms (1.3%)

Memory

-31.1MiB live, 17.2MiB allocated; 6ms 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:

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

Results

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

Compiler

Compiled 7 to 7 computations (0% saved)

regimes3.0ms (0.4%)

Memory

12.0MiB live, 12.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
50.7%	1	`(+.f64 x x)`
50.7%	1	`(-.f64 (+.f64 x x) #s(literal 1 binary64))`
50.7%	1	`x`

Compiler

Compiled 7 to 7 computations (0% saved)

bsearch19.0ms (2.5%)

Memory

-0.6MiB live, 45.4MiB allocated; 3ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
12.0ms	4.182360863534742e-14	1419473.429342071
6.0ms	-11.828174551821451	-0.0526262095230234

Samples

9.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% of total)

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

adjust: 0.0ms (0% of total)

derivations2.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 19 to 16 computations (15.8% saved)

preprocess22.0ms (2.7%)

Memory: 16.0MiB live, 61.4MiB allocated; 6ms collecting garbage
Compiler: Compiled 23 to 20 computations (13% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample435.0ms (55.6%)

preprocess129.0ms (16.5%)

series2.0ms (0.3%)

rewrite89.0ms (11.3%)

eval1.0ms (0.2%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite35.0ms (4.5%)

eval0.0ms (0.1%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite24.0ms (3.1%)

eval1.0ms (0.1%)

prune1.0ms (0.2%)

regimes5.0ms (0.6%)

regimes10.0ms (1.3%)

regimes3.0ms (0.4%)

bsearch19.0ms (2.5%)

derivations2.0ms (0.3%)

preprocess22.0ms (2.7%)

end0.0ms (0%)

Profiling