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

analyze0.0ms (0%)

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 5 computations (28.6% saved)

Precisions

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

Operation ival-sub, time spent: 0.0ms, 0.0% of total-time

Operation ival-add, time spent: 0.0ms, 0.0% of total-time

Operation const, time spent: 0.0ms, 0.0% of total-time

sample1.1s (87.2%)

Results

1.0s	8251×	valid
0.0ms	4×	infinite
0.0ms	1×	valid

Precisions

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

Operation ival-add, time spent: 163.0ms, 70.0% of total-time

Operation ival-sub, time spent: 51.0ms, 22.0% of total-time

Operation const, time spent: 13.0ms, 6.0% of total-time

Operation backward-pass, time spent: 4.0ms, 2.0% of total-time

Bogosity

preprocess110.0ms (8.8%)

Algorithm

1×	egg-herbie

Rules

148×	`fma-neg`
32×	`fma-define`
32×	`sub-neg`
31×	`cancel-sign-sub-inv`
24×	`associate-+l-`

FPErrors

Click to see full error table

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

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	13	76
1	35	60
2	94	52
3	211	48
4	361	48
5	488	48
6	525	48
7	542	48
8	544	48

Stop Event

1×

saturated

Calls

Call 1

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

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

Compiler

Compiled 30 to 16 computations (46.7% saved)

Precisions

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

Operation ival-sub, time spent: 5.0ms, 55.0% of total-time

Operation ival-add, time spent: 3.0ms, 33.0% of total-time

Operation const, time spent: 1.0ms, 11.0% of total-time

eval1.0ms (0.1%)

Compiler: Compiled 14 to 11 computations (21.4% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

localize24.0ms (2%)

Compiler: Compiled 12 to 6 computations (50% saved)
Precisions: Click to see histograms. Total time spent on operations: 6.0ms
Operation ival-sub, time spent: 3.0ms, 48.0% of total-time
Operation ival-add, time spent: 3.0ms, 48.0% of total-time
Operation const, time spent: 0.0ms, 0.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 1 to 1 computations (0% saved)

prune1.0ms (0.1%)

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 12 to 8 computations (33.3% saved)

simplify3.0ms (0.2%)

Algorithm

1×	egg-herbie

Rules

3×	`1-exp`
2×	`unsub-neg`
2×	`sub-neg`
2×	`neg-mul-1`
2×	`+-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	19
1	16	19
2	20	19
3	23	19
4	26	19
5	29	19

Stop Event

1×	done
1×	saturated

Calls

Call 1

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

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

soundness0.0ms (0%)

end0.0ms (0%)

preprocess21.0ms (1.6%)

Compiler: Compiled 24 to 16 computations (33.3% saved)

analyze0.0ms (0%)

sample1.1s (87.2%)

preprocess110.0ms (8.8%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

localize24.0ms (2%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify3.0ms (0.2%)

soundness0.0ms (0%)

end0.0ms (0%)

preprocess21.0ms (1.6%)

Profiling