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.4MiB live, 0.4MiB 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)

sample612.0ms (45.8%)

Memory

43.5MiB live, 747.3MiB allocated; 156ms collecting garbage

Samples

420.0ms

8 256×

valid

Precisions

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

ival-log: 146.0ms (69.1% of total)

ival-mult!: 52.0ms (24.6% of total)

adjust: 13.0ms (6.1% of total)

Bogosity

preprocess73.0ms (5.5%)

Memory

-32.7MiB live, 64.6MiB allocated; 17ms 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)

series64.0ms (4.8%)

Memory

16.3MiB live, 106.9MiB allocated; 9ms 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
x
(log.f64 x)
(*.f64 x (log.f64 x))

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

Calls

3 calls:

Time	Variable	Point
32.0ms	x	0
13.0ms	x	inf
7.0ms	x	-inf

rewrite123.0ms (9.2%)

Memory

7.8MiB live, 146.3MiB allocated; 21ms 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
x
(log.f64 x)
(*.f64 x (log.f64 x))

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

eval1.0ms (0.1%)

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

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

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

Accuracy

99.6%

Counts

9 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 6 computations (25.0% saved)

series37.0ms (2.7%)

Memory

23.4MiB live, 68.3MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	78	239

Stop Event

1×	iter-limit

Counts

3 → 10

Calls

Call 1

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

Outputs
#s(approx x x)
#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 (+.f64 (.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 (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 (+.f64 (.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 (+.f64 (.f64 #s(literal 1/6 binary64) (.f64 x (+.f64 (.f64 #s(literal -3 binary64) (pow.f64 (log.f64 x) #s(literal 3 binary64))) (+.f64 (.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) (+.f64 (.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 (+.f64 (.f64 #s(literal 1/2 binary64) (+.f64 (.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 (+.f64 (.f64 #s(literal 1/24 binary64) (.f64 x (+.f64 (.f64 #s(literal -6 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64))) (+.f64 (.f64 #s(literal -4 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64))) (+.f64 (.f64 #s(literal -3 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64))) (+.f64 (.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) (+.f64 (.f64 #s(literal -3 binary64) (pow.f64 (log.f64 x) #s(literal 3 binary64))) (+.f64 (.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) (pow.f64 x x))

Calls

3 calls:

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

rewrite118.0ms (8.9%)

Memory

4.9MiB live, 246.9MiB allocated; 39ms 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
x
(pow.f64 x x)
(log.f64 (pow.f64 x x))

Outputs
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))
(*.f64 x (log.f64 x))
(log.f64 (pow.f64 x x))

eval3.0ms (0.3%)

Memory: -37.7MiB live, 11.8MiB allocated; 3ms collecting garbage
Compiler: Compiled 275 to 94 computations (65.8% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

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

Accuracy

99.6%

Counts

16 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(*.f64 x (log.f64 x))
✓	7.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)

series20.0ms (1.5%)

Memory

24.0MiB live, 71.2MiB allocated; 1ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	77	236

Stop Event

1×	iter-limit

Counts

3 → 9

Calls

Call 1

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

Outputs
#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 (+.f64 (.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 (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 (+.f64 (.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 (+.f64 (.f64 #s(literal 1/6 binary64) (.f64 x (+.f64 (.f64 #s(literal -3 binary64) (pow.f64 (log.f64 x) #s(literal 3 binary64))) (+.f64 (.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) (+.f64 (.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 (+.f64 (.f64 #s(literal 1/2 binary64) (+.f64 (.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 (+.f64 (.f64 #s(literal 1/24 binary64) (.f64 x (+.f64 (.f64 #s(literal -6 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64))) (+.f64 (.f64 #s(literal -4 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64))) (+.f64 (.f64 #s(literal -3 binary64) (pow.f64 (log.f64 x) #s(literal 4 binary64))) (+.f64 (.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) (+.f64 (.f64 #s(literal -3 binary64) (pow.f64 (log.f64 x) #s(literal 3 binary64))) (+.f64 (.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) (pow.f64 x x))

Calls

3 calls:

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

rewrite244.0ms (18.3%)

Memory

-22.1MiB live, 115.9MiB allocated; 16ms 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
#s(literal 1 binary64)
#s(approx (pow x x) #s(literal 1 binary64))
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))

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

eval1.0ms (0.1%)

Memory: 2.7MiB live, 2.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 241 to 83 computations (65.6% 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	9	0	9
Fresh	0	0	0
Picked	1	0	1
Done	-1	3	2
Total	9	3	12

Accuracy

99.6%

Counts

12 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(*.f64 x (log.f64 x))
✓	7.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)

regimes7.0ms (0.5%)

Memory

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

derivations17.0ms (1.3%)

Memory

-29.2MiB live, 16.6MiB allocated; 4ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 10 to 7 computations (30.0% saved)

preprocess13.0ms (1.0%)

Memory: 22.3MiB live, 22.3MiB 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%)

sample612.0ms (45.8%)

preprocess73.0ms (5.5%)

series64.0ms (4.8%)

rewrite123.0ms (9.2%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series37.0ms (2.7%)

rewrite118.0ms (8.9%)

eval3.0ms (0.3%)

prune1.0ms (0.1%)

series20.0ms (1.5%)

rewrite244.0ms (18.3%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

regimes7.0ms (0.5%)

derivations17.0ms (1.3%)

preprocess13.0ms (1.0%)

end0.0ms (0.0%)

Profiling