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.0MiB live, 1.0MiB 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)

sample438.0ms (51.5%)

Memory

2.5MiB live, 670.1MiB allocated; 193ms collecting garbage

Samples

276.0ms

8 256×

valid

Precisions

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

ival-add!: 114.0ms (84% of total)

ival-sub!: 21.0ms (15.5% of total)

adjust: 1.0ms (0.7% of total)

Bogosity

explain45.0ms (5.3%)

Memory

8.0MiB live, 101.0MiB allocated; 11ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(+.f64 x x)`
-	-	`#s(literal 1 binary64)`
-	-	`(-.f64 (+.f64 x x) #s(literal 1 binary64))`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

18.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

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

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

adjust: 0.0ms (0% of total)

preprocess56.0ms (6.5%)

Memory

-5.7MiB live, 33.6MiB 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 10 to 8 computations (20% saved)

series2.0ms (0.2%)

Memory

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

rewrite107.0ms (12.5%)

Memory

12.7MiB live, 110.1MiB allocated; 78ms 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 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x)) #s(literal 1 binary64)) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))
(/.f64 (-.f64 (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 (.f64 #s(literal 2 binary64) x) (.f64 #s(literal 2 binary64) x) (+.f64 #s(literal 1 binary64) (.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)))))
(-.f64 (*.f64 #s(literal 2 binary64) 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 #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 #s(literal 2 binary64) x))
#s(approx (- (+ x x) 1) (*.f64 (-.f64 #s(literal 2 binary64) (pow.f64 x #s(literal -1 binary64))) x))
#s(approx (- (+ x x) 1) (neg.f64 (*.f64 (-.f64 (pow.f64 x #s(literal -1 binary64)) #s(literal 2 binary64)) x)))

eval2.0ms (0.2%)

Memory: 4.1MiB live, 4.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 166 to 52 computations (68.7% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	14	2	16
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	14	3	17

Accuracy

100.0%

Counts

17 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 17 computations (19% saved)

series2.0ms (0.2%)

Memory

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

Counts

6 → 7

Calls

Call 1

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

rewrite40.0ms (4.7%)

Memory

-2.4MiB live, 40.2MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	87
0	23	86
0	97	86

Stop Event

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

Counts

13 → 17

Calls

Call 1

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

eval1.0ms (0.1%)

Memory: 3.0MiB live, 3.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 121 to 40 computations (66.9% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	8	1	9
Fresh	0	0	0
Picked	1	1	2
Done	0	1	1
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))
▶	52.4%	#s(approx (- (+ x x) 1) (+.f64 x x))
✓	49.9%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 21 to 16 computations (23.8% saved)

series1.0ms (0.1%)

Memory

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

Counts

3 → 7

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

rewrite44.0ms (5.1%)

Memory

22.6MiB live, 58.0MiB allocated; 21ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	78
0	24	77
0	99	77

Stop Event

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

Counts

10 → 14

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

eval15.0ms (1.8%)

Memory: -36.1MiB live, 8.0MiB allocated; 13ms collecting garbage
Compiler: Compiled 141 to 39 computations (72.3% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

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

Accuracy

100.0%

Counts

14 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 51 to 29 computations (43.1% saved)

regimes5.0ms (0.6%)

Memory

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

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes5.0ms (0.5%)

Memory

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

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes47.0ms (5.5%)

Memory

-44.6MiB live, 12.6MiB allocated; 48ms 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:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch17.0ms (2%)

Memory

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

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
7.0ms	3.6863610841665176e-7	0.7230844297704999
8.0ms	-731563.5952644432	-2.910292793914227e-10

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 (74.9% of total)

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

adjust: 0.0ms (0% of total)

derivations3.0ms (0.4%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 45 to 16 computations (64.4% saved)

preprocess18.0ms (2.1%)

Memory: -26.3MiB live, 23.2MiB allocated; 8ms collecting garbage
Compiler: Compiled 100 to 40 computations (60% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample438.0ms (51.5%)

explain45.0ms (5.3%)

preprocess56.0ms (6.5%)

series2.0ms (0.2%)

rewrite107.0ms (12.5%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

series2.0ms (0.2%)

rewrite40.0ms (4.7%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite44.0ms (5.1%)

eval15.0ms (1.8%)

prune2.0ms (0.2%)

regimes5.0ms (0.6%)

regimes5.0ms (0.5%)

regimes47.0ms (5.5%)

bsearch17.0ms (2%)

derivations3.0ms (0.4%)

preprocess18.0ms (2.1%)

end0.0ms (0%)

Profiling