Metrics for Statistics.Distribution.Binomial:directEntropy from math-functions-0.1.5.2

start0.0ms (0.0%)

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

analyze0.0ms (0.0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0.0%	0.0%	100.0%	0.0%	0.0%	0.0%	0.0%	0
0.0%	0.0%	100.0%	0.0%	0.0%	0.0%	0.0%	1
100.0%	50.0%	0.0%	0.0%	0.0%	50.0%	0.0%	2

Compiler

Compiled 6 to 5 computations (16.7% saved)

sample575.0ms (46.0%)

Memory

-1.8MiB live, 784.4MiB allocated; 225ms collecting garbage

Samples

411.0ms

8 256×

valid

Precisions

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

ival-log: 133.0ms (74.2% of total)

ival-mult!: 45.0ms (25.1% of total)

adjust: 1.0ms (0.6% of total)

Bogosity

preprocess63.0ms (5.1%)

Memory

-13.9MiB live, 31.0MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 6 (0.0ms)

Iter	Nodes	Cost
0	7	14
1	19	14
2	34	14
3	66	14
4	120	14
5	371	14
6	2434	13

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.6%	(*.f64 x (log.f64 x))

Symmetry

(negabs x)

Compiler

Compiled 8 to 6 computations (25.0% saved)

sample0.0ms (0.0%)

Memory

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

Calls

Call 1

Inputs

Outputs

series66.0ms (5.3%)

Memory

38.5MiB live, 137.5MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	39

Stop Event

1×	iter-limit

Counts

3 → 5

Calls

Call 1

Inputs
(*.f64 x (log.f64 x))
x
(log.f64 x)

Outputs
#s(approx (* x (log x)) (*.f64 x (log.f64 x)))
#s(approx x x)
#s(approx (log x) (log.f64 x))
#s(approx (* x (log x)) (.f64 #s(literal -1 binary64) (.f64 x (log.f64 (/.f64 #s(literal 1 binary64) x)))))
#s(approx (log x) (*.f64 #s(literal -1 binary64) (log.f64 (/.f64 #s(literal 1 binary64) x))))

Calls

3 calls:

Time	Variable	Point
37.0ms	x	0
16.0ms	x	inf
7.0ms	x	-inf

rewrite113.0ms (9.1%)

Memory

-15.9MiB live, 174.2MiB allocated; 42ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	7
0	5	7
1	8	7
2	16	7
3	18	7
4	37	7
5	64	7
6	166	7
7	740	7
0	4065	7

Stop Event

1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

3 → 5

Calls

Call 1

Inputs
(*.f64 x (log.f64 x))
x
(log.f64 x)

Outputs
(*.f64 (log.f64 x) x)
(*.f64 x (log.f64 x))
(log.f64 (pow.f64 x x))
x
(log.f64 x)

eval1.0ms (0.1%)

Memory: 2.0MiB live, 2.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 56 to 24 computations (57.1% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

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

Accuracy

99.6%

Counts

8 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(*.f64 x (log.f64 x))
▶	8.4%	(log.f64 (pow.f64 x x))

Compiler

Compiled 8 to 6 computations (25.0% saved)

sample0.0ms (0.0%)

Memory

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

Calls

Call 1

Inputs

Outputs

series37.0ms (3.0%)

Memory

-23.0MiB live, 67.8MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	78	224

Stop Event

1×	iter-limit

Counts

3 → 10

Calls

Call 1

Inputs
(log.f64 (pow.f64 x x))
(pow.f64 x x)
x

Outputs
#s(approx (log (pow x x)) (*.f64 x (log.f64 x)))
#s(approx (log (pow x x)) (.f64 x (+.f64 (log.f64 x) (.f64 #s(literal 1/2 binary64) (*.f64 x (fma.f64 #s(literal -1 binary64) (pow.f64 (log.f64 x) #s(literal 2 binary64)) (pow.f64 (log.f64 x) #s(literal 2 binary64))))))))
#s(approx (log (pow x x)) (.f64 x (+.f64 (log.f64 x) (.f64 x (fma.f64 #s(literal 1/6 binary64) (.f64 x (fma.f64 #s(literal -3 binary64) (pow.f64 (log.f64 x) #s(literal 3 binary64)) (fma.f64 #s(literal 2 binary64) (pow.f64 (log.f64 x) #s(literal 3 binary64)) (pow.f64 (log.f64 x) #s(literal 3 binary64))))) (.f64 #s(literal 1/2 binary64) (fma.f64 #s(literal -1 binary64) (pow.f64 (log.f64 x) #s(literal 2 binary64)) (pow.f64 (log.f64 x) #s(literal 2 binary64)))))))))
#s(approx (log (pow x x)) (.f64 x (+.f64 (log.f64 x) (.f64 x (fma.f64 #s(literal 1/2 binary64) (fma.f64 #s(literal -1 binary64) (pow.f64 (log.f64 x) #s(literal 2 binary64)) (pow.f64 (log.f64 x) #s(literal 2 binary64))) (.f64 x (fma.f64 #s(literal 1/24 binary64) (.f64 x (fma.f64 #s(literal -6 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64)) (fma.f64 #s(literal -4 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64)) (fma.f64 #s(literal -3 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64)) (fma.f64 #s(literal 12 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64)) (pow.f64 (log.f64 x) #s(literal 4 binary64))))))) (*.f64 #s(literal 1/6 binary64) (fma.f64 #s(literal -3 binary64) (pow.f64 (log.f64 x) #s(literal 3 binary64)) (fma.f64 #s(literal 2 binary64) (pow.f64 (log.f64 x) #s(literal 3 binary64)) (pow.f64 (log.f64 x) #s(literal 3 binary64))))))))))))
#s(approx (pow x x) #s(literal 1 binary64))
#s(approx (pow x x) (+.f64 #s(literal 1 binary64) (*.f64 x (log.f64 x))))
#s(approx (pow x x) (+.f64 #s(literal 1 binary64) (.f64 x (+.f64 (log.f64 x) (.f64 #s(literal 1/2 binary64) (*.f64 x (pow.f64 (log.f64 x) #s(literal 2 binary64))))))))
#s(approx (pow x x) (+.f64 #s(literal 1 binary64) (.f64 x (+.f64 (log.f64 x) (.f64 x (fma.f64 #s(literal 1/6 binary64) (.f64 x (pow.f64 (log.f64 x) #s(literal 3 binary64))) (.f64 #s(literal 1/2 binary64) (pow.f64 (log.f64 x) #s(literal 2 binary64)))))))))
#s(approx x x)
#s(approx (pow x x) (pow.f64 x x))

Calls

3 calls:

Time	Variable	Point
16.0ms	x	inf
14.0ms	x	-inf
1.0ms	x	0

rewrite110.0ms (8.8%)

Memory

26.1MiB live, 127.1MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	8
0	5	8
1	13	8
2	15	8
3	34	8
4	61	8
5	163	8
6	737	8
0	4062	8

Stop Event

1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

3 → 6

Calls

Call 1

Inputs
(log.f64 (pow.f64 x x))
(pow.f64 x x)
x

Outputs
(*.f64 x (log.f64 x))
(log.f64 (pow.f64 x x))
(*.f64 (pow.f64 x (/.f64 x #s(literal 2 binary64))) (pow.f64 x (/.f64 x #s(literal 2 binary64))))
(pow.f64 x x)
(exp.f64 (*.f64 (log.f64 x) x))
x

eval2.0ms (0.1%)

Memory: 8.3MiB live, 8.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 252 to 83 computations (67.1% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

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

Accuracy

99.6%

Counts

14 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(*.f64 x (log.f64 x))
✓	8.4%	(log.f64 (pow.f64 x x))
▶	3.7%	(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))

Compiler

Compiled 14 to 11 computations (21.4% saved)

sample0.0ms (0.0%)

Memory

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

Calls

Call 1

Inputs
1

Outputs
#s(literal 1 binary64)

Samples

0.0ms

1×

valid

Compiler

Compiled 3 to 3 computations (0.0% saved)

Precisions

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

adjust: 0.0ms (0.0% of total)

series18.0ms (1.4%)

Memory

-3.4MiB live, 41.6MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	77	221

Stop Event

1×	iter-limit

Counts

3 → 9

Calls

Call 1

Inputs
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))
#s(approx (pow x x) #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
#s(approx (log (pow x x)) (*.f64 x (log.f64 x)))
#s(approx (log (pow x x)) (.f64 x (+.f64 (log.f64 x) (.f64 #s(literal 1/2 binary64) (*.f64 x (fma.f64 #s(literal -1 binary64) (pow.f64 (log.f64 x) #s(literal 2 binary64)) (pow.f64 (log.f64 x) #s(literal 2 binary64))))))))
#s(approx (log (pow x x)) (.f64 x (+.f64 (log.f64 x) (.f64 x (fma.f64 #s(literal 1/6 binary64) (.f64 x (fma.f64 #s(literal -3 binary64) (pow.f64 (log.f64 x) #s(literal 3 binary64)) (fma.f64 #s(literal 2 binary64) (pow.f64 (log.f64 x) #s(literal 3 binary64)) (pow.f64 (log.f64 x) #s(literal 3 binary64))))) (.f64 #s(literal 1/2 binary64) (fma.f64 #s(literal -1 binary64) (pow.f64 (log.f64 x) #s(literal 2 binary64)) (pow.f64 (log.f64 x) #s(literal 2 binary64)))))))))
#s(approx (log (pow x x)) (.f64 x (+.f64 (log.f64 x) (.f64 x (fma.f64 #s(literal 1/2 binary64) (fma.f64 #s(literal -1 binary64) (pow.f64 (log.f64 x) #s(literal 2 binary64)) (pow.f64 (log.f64 x) #s(literal 2 binary64))) (.f64 x (fma.f64 #s(literal 1/24 binary64) (.f64 x (fma.f64 #s(literal -6 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64)) (fma.f64 #s(literal -4 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64)) (fma.f64 #s(literal -3 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64)) (fma.f64 #s(literal 12 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64)) (pow.f64 (log.f64 x) #s(literal 4 binary64))))))) (*.f64 #s(literal 1/6 binary64) (fma.f64 #s(literal -3 binary64) (pow.f64 (log.f64 x) #s(literal 3 binary64)) (fma.f64 #s(literal 2 binary64) (pow.f64 (log.f64 x) #s(literal 3 binary64)) (pow.f64 (log.f64 x) #s(literal 3 binary64))))))))))))
#s(approx (pow x x) #s(literal 1 binary64))
#s(approx (pow x x) (+.f64 #s(literal 1 binary64) (*.f64 x (log.f64 x))))
#s(approx (pow x x) (+.f64 #s(literal 1 binary64) (.f64 x (+.f64 (log.f64 x) (.f64 #s(literal 1/2 binary64) (*.f64 x (pow.f64 (log.f64 x) #s(literal 2 binary64))))))))
#s(approx (pow x x) (+.f64 #s(literal 1 binary64) (.f64 x (+.f64 (log.f64 x) (.f64 x (fma.f64 #s(literal 1/6 binary64) (.f64 x (pow.f64 (log.f64 x) #s(literal 3 binary64))) (.f64 #s(literal 1/2 binary64) (pow.f64 (log.f64 x) #s(literal 2 binary64)))))))))
#s(approx (pow x x) (pow.f64 x x))

Calls

3 calls:

Time	Variable	Point
8.0ms	x	inf
6.0ms	x	-inf
0.0ms	x	0

rewrite219.0ms (17.5%)

Memory

-29.4MiB live, 159.4MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	12
0	6	12
1	16	12
2	22	12
3	80	12
4	396	12
5	3074	12
0	4212	12

Stop Event

1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

3 → 3

Calls

Call 1

Inputs
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))
#s(approx (pow x x) #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))
#s(approx (pow x x) #s(literal 1 binary64))
#s(literal 1 binary64)

eval1.0ms (0.1%)

Memory: 4.0MiB live, 4.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 220 to 71 computations (67.7% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

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

Accuracy

99.6%

Counts

11 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(*.f64 x (log.f64 x))
✓	8.4%	(log.f64 (pow.f64 x x))
✓	3.7%	(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))

Compiler

Compiled 14 to 11 computations (21.4% saved)

regimes8.0ms (0.6%)

Memory

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

Counts

1 → 1

3 → 1

Calls

Call 1

Inputs
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))

Outputs
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))

Call 2

Inputs
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))
(*.f64 x (log.f64 x))
(log.f64 (pow.f64 x x))

Outputs
(*.f64 x (log.f64 x))

Calls

4 calls:

2.0ms	(*.f64 x (log.f64 x))
2.0ms	x
1.0ms	(*.f64 x (log.f64 x))
1.0ms	x

Results

Accuracy	Segments	Branch
3.7%	1	`(*.f64 x (log.f64 x))`
3.7%	1	`x`
99.6%	1	`(*.f64 x (log.f64 x))`
99.6%	1	`x`

Compiler

Compiled 24 to 17 computations (29.2% saved)

derivations18.0ms (1.5%)

Memory

-34.9MiB live, 10.8MiB allocated; 5ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 10 to 7 computations (30.0% saved)

preprocess14.0ms (1.1%)

Memory: 43.7MiB live, 43.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 34 to 26 computations (23.5% saved)

end0.0ms (0.0%)

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

start0.0ms (0.0%)

analyze0.0ms (0.0%)

sample575.0ms (46.0%)

preprocess63.0ms (5.1%)

sample0.0ms (0.0%)

series66.0ms (5.3%)

rewrite113.0ms (9.1%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

sample0.0ms (0.0%)

series37.0ms (3.0%)

rewrite110.0ms (8.8%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

sample0.0ms (0.0%)

series18.0ms (1.4%)

rewrite219.0ms (17.5%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

regimes8.0ms (0.6%)

derivations18.0ms (1.5%)

preprocess14.0ms (1.1%)

end0.0ms (0.0%)

Profiling