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

analyze0.0ms (0%)

Memory

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

sample463.0ms (40.2%)

Memory

2.3MiB live, 475.8MiB allocated; 111ms collecting garbage

Samples

187.0ms

8 256×

valid

Precisions

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

ival-add!: 25.0ms (54.9% of total)

ival-sub!: 20.0ms (43.9% of total)

adjust: 1.0ms (2.2% of total)

Bogosity

preprocess278.0ms (24.1%)

Memory

-0.8MiB live, 45.8MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	17
1	31	15
2	91	15
3	210	15
4	790	15
5	5998	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.2%)

Memory

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

rewrite147.0ms (12.8%)

Memory

25.9MiB live, 78.7MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	22	66
0	23	60
1	115	34
0	795	34
1	1633	34

Stop Event

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

Counts

10 → 10

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

eval1.0ms (0.1%)

Memory: 1.8MiB live, 1.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 25 to 19 computations (24% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	5	2	7
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	5	3	8

Accuracy

100.0%

Counts

8 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 16 to 16 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

4 → 5

Calls

Call 1

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

rewrite82.0ms (7.2%)

Memory

-4.9MiB live, 83.1MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	20	71
0	20	65
1	111	35
0	790	35
1	1628	35

Stop Event

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

Counts

9 → 9

Calls

Call 1

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

eval0.0ms (0%)

Memory: 0.6MiB live, 0.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 13 to 11 computations (15.4% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	1	1	2
Fresh	0	0	0
Picked	1	1	2
Done	0	1	1
Total	2	3	5

Accuracy

100.0%

Counts

5 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 16 to 16 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

2 → 5

Calls

Call 1

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

rewrite81.0ms (7%)

Memory

14.4MiB live, 60.0MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	20	63
0	20	59
1	111	31
0	789	31
1	1627	31

Stop Event

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

Counts

7 → 7

Calls

Call 1

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

eval0.0ms (0%)

Memory: 0.4MiB live, 0.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 13 to 11 computations (15.4% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	2	0	2
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	2	3	5

Accuracy

100.0%

Counts

5 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 32 to 28 computations (12.5% saved)

regimes47.0ms (4.1%)

Memory

-30.0MiB live, 26.1MiB allocated; 6ms collecting garbage

Counts

4 → 1

Calls

Call 1

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

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

Calls

3 calls:

44.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 7 to 7 computations (0% saved)

regimes5.0ms (0.4%)

Memory

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

Accuracy

Total -32.2b remaining (-104.2%)

Threshold costs -32.2b (-104.2%)

Counts

3 → 1

Calls

Call 1

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

derivations3.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 9 to 9 computations (0% saved)

preprocess38.0ms (3.3%)

Memory: -20.4MiB live, 23.4MiB allocated; 6ms collecting garbage
Compiler: Compiled 13 to 13 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample463.0ms (40.2%)

preprocess278.0ms (24.1%)

series2.0ms (0.2%)

rewrite147.0ms (12.8%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite82.0ms (7.2%)

eval0.0ms (0%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite81.0ms (7%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes47.0ms (4.1%)

regimes5.0ms (0.4%)

derivations3.0ms (0.2%)

preprocess38.0ms (3.3%)

end0.0ms (0%)

Profiling