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

analyze9.0ms (1.5%)

Memory

-43.7MiB live, 0.5MiB allocated; 11ms 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 (69.3%)

Memory

46.2MiB live, 618.7MiB allocated; 122ms collecting garbage

Samples

249.0ms

8 256×

valid

Precisions

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

ival-sub!: 26.0ms (51.7% of total)

ival-add!: 23.0ms (45.7% of total)

adjust: 1.0ms (2% of total)

Bogosity

preprocess50.0ms (8%)

Memory

-39.2MiB live, 54.7MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 5 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	18	16
2	32	16
3	63	16
4	186	16
5	879	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

3.6MiB live, 3.6MiB 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 (5.3%)

Memory

19.7MiB live, 64.6MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	75
0	24	74
0	100	74

Stop Event

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

Counts

11 → 18

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)))))
(-.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 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: 3.7MiB live, 3.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 78 to 54 computations (30.8% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

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

Accuracy

100.0%

Counts

16 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 16 to 16 computations (0% saved)

series1.0ms (0.2%)

Memory

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

Counts

5 → 7

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

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
0.0ms	x	@	-inf	((- (+ x x) 1) -1 (- (+ x x) 1) (+ x x) x)
0.0ms	x	@	inf	((- (+ x x) 1) -1 (- (+ x x) 1) (+ x x) x)
0.0ms	x	@	0	((- (+ x x) 1) -1 (- (+ x x) 1) (+ x x) x)

rewrite26.0ms (4.1%)

Memory

-10.0MiB live, 33.5MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	86
0	24	85
0	99	85

Stop Event

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

Counts

12 → 16

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
#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
#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 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 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.8MiB live, 2.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 54 to 39 computations (27.8% saved)

prune1.0ms (0.2%)

Memory

3.9MiB live, 3.9MiB 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	2	2
Done	0	1	1
Total	10	3	13

Accuracy

100.0%

Counts

13 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 29 to 26 computations (10.3% saved)

regimes5.0ms (0.8%)

Memory

14.7MiB live, 14.7MiB 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	x
1.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)

regimes6.0ms (1%)

Memory

-29.7MiB live, 16.2MiB allocated; 3ms 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:

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

Results

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

Compiler

Compiled 7 to 7 computations (0% saved)

regimes3.0ms (0.5%)

Memory

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

Compiler

Compiled 7 to 7 computations (0% saved)

bsearch28.0ms (4.5%)

Memory

9.7MiB live, 61.7MiB allocated; 8ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
20.0ms	9.589315031204647e-8	937432012908.1792
7.0ms	-7.2840277671398885	-0.0012558313354053528

Samples

12.0ms

288×

valid

Compiler

Compiled 224 to 260 computations (-16.1% saved)

Precisions

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

ival-sub!: 6.0ms (82.7% of total)

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

adjust: 0.0ms (0% of total)

derivations2.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 19 to 16 computations (15.8% saved)

preprocess21.0ms (3.4%)

Memory: 7.1MiB live, 54.5MiB allocated; 1ms 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%)

analyze9.0ms (1.5%)

sample435.0ms (69.3%)

preprocess50.0ms (8%)

series2.0ms (0.3%)

rewrite34.0ms (5.3%)

eval1.0ms (0.2%)

prune1.0ms (0.2%)

series1.0ms (0.2%)

rewrite26.0ms (4.1%)

eval1.0ms (0.1%)

prune1.0ms (0.2%)

regimes5.0ms (0.8%)

regimes6.0ms (1%)

regimes3.0ms (0.5%)

bsearch28.0ms (4.5%)

derivations2.0ms (0.3%)

preprocess21.0ms (3.4%)

end0.0ms (0%)

Profiling