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

start0.0ms (0%)

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

analyze0.0ms (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%	100%	0%	0%	0%	0%	0
0%	0%	100%	0%	0%	0%	0%	1
100%	50%	0%	0%	0%	50%	0%	2

Compiler

Compiled 6 to 5 computations (16.7% saved)

sample1.3s (80.9%)

Memory

-30.0MiB live, 1 128.8MiB allocated; 1.0s collecting garbage

Samples

1.0s

8 256×

valid

Precisions

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

ival-mult: 465.0ms (66.1% of total)

ival-log: 226.0ms (32.1% of total)

ival-true: 6.0ms (0.9% of total)

adjust: 3.0ms (0.4% of total)

ival-assert: 3.0ms (0.4% of total)

Bogosity

explain87.0ms (5.4%)

Memory

6.1MiB live, 58.5MiB allocated; 28ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(log.f64 x)`
-	-	`(*.f64 x (log.f64 x))`
-	-	`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

66.0ms

512×

valid

Compiler

Compiled 22 to 13 computations (40.9% saved)

Precisions

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

ival-log: 6.0ms (56% of total)

ival-mult: 4.0ms (37.3% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess36.0ms (2.2%)

Memory

-28.3MiB live, 18.2MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	13
1	12	11
2	17	11
3	22	11
4	27	11
0	3	4
0	5	4
1	6	4
0	6	4

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

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

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

Compiler

Compiled 4 to 3 computations (25% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 4 to 3 computations (25% saved)

simplify3.0ms (0.2%)

Memory

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

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(log.f64 x)
cost-diff	0	(*.f64 x (log.f64 x))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	7
0	5	7
1	6	7
0	6	7

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize15.0ms (0.9%)

Memory

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

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(log.f64 x)
accuracy	0.2421875	(*.f64 x (log.f64 x))

Samples

10.0ms

256×

valid

Compiler

Compiled 9 to 5 computations (44.4% saved)

Precisions

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

ival-log: 3.0ms (57.7% of total)

ival-mult: 2.0ms (38.5% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series85.0ms (5.2%)

Memory

-13.2MiB live, 74.2MiB allocated; 17ms collecting garbage

Counts

2 → 6

Calls

Call 1

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

Outputs
(* x (log x))
(log x)
(* -1 (* x (log (/ 1 x))))
(* -1 (log (/ 1 x)))
(* x (+ (log -1) (* -1 (log (/ -1 x)))))
(+ (log -1) (* -1 (log (/ -1 x))))

Calls

3 calls:

Time	Variable		Point	Expression
39.0ms	x	@	-inf	((* x (log x)) (log x))
38.0ms	x	@	0	((* x (log x)) (log x))
7.0ms	x	@	inf	((* x (log x)) (log x))

simplify10.0ms (0.6%)

Memory

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

Iterations

Useful iterations: 6 (0.0ms)

Iter	Nodes	Cost
0	16	30
1	40	28
2	78	28
3	139	28
4	188	28
5	283	28
6	400	26
7	436	26
0	436	26

Stop Event

1×	iter limit
1×	saturated

Counts

6 → 6

Calls

Call 1

Inputs
(* x (log x))
(log x)
(* -1 (* x (log (/ 1 x))))
(* -1 (log (/ 1 x)))
(* x (+ (log -1) (* -1 (log (/ -1 x)))))
(+ (log -1) (* -1 (log (/ -1 x))))

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

rewrite43.0ms (2.7%)

Memory

-5.3MiB live, 45.1MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	6
0	5	6
1	8	6
2	13	6
3	44	6
0	230	6

Stop Event

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

Counts

2 → 14

Calls

Call 1

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

Outputs
(.f64 (.f64 (/.f64 x #s(literal 2 binary64)) #s(literal 2 binary64)) (log.f64 x))
(.f64 (/.f64 x #s(literal 2 binary64)) (log.f64 (.f64 x x)))
(*.f64 #s(literal 2 binary64) (log.f64 (sqrt.f64 (pow.f64 x x))))
(*.f64 (log.f64 x) (log.f64 (exp.f64 x)))
(*.f64 (log.f64 x) x)
(*.f64 x (log.f64 x))
(/.f64 (-.f64 (.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x)))) (.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x))))) (-.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x)))))
(/.f64 (+.f64 (pow.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) #s(literal 3 binary64)) (pow.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) #s(literal 3 binary64))) (fma.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x))) (-.f64 (.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x)))) (.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x)))))))
(fma.f64 (/.f64 x #s(literal 2 binary64)) (log.f64 x) (log.f64 (sqrt.f64 (pow.f64 x x))))
(fma.f64 (log.f64 x) (/.f64 x #s(literal 2 binary64)) (log.f64 (sqrt.f64 (pow.f64 x x))))
(+.f64 (log.f64 (neg.f64 (sqrt.f64 (pow.f64 x x)))) (log.f64 (neg.f64 (sqrt.f64 (pow.f64 x x)))))
(+.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x))))
(log.f64 (pow.f64 x x))
(log.f64 x)

eval2.0ms (0.1%)

Memory: 3.1MiB live, 3.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 216 to 48 computations (77.8% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	18	0	18
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	18	1	19

Accuracy

99.6%

Counts

19 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 6 computations (25% saved)

simplify9.0ms (0.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	4

Stop Event

1×

saturated

Calls

Call 1

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

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

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 4 to 3 computations (25% saved)

preprocess17.0ms (1%)

Memory: -24.0MiB live, 19.8MiB allocated; 12ms collecting garbage
Compiler: Compiled 16 to 12 computations (25% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample1.3s (80.9%)

explain87.0ms (5.4%)

preprocess36.0ms (2.2%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify3.0ms (0.2%)

localize15.0ms (0.9%)

series85.0ms (5.2%)

simplify10.0ms (0.6%)

rewrite43.0ms (2.7%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

simplify9.0ms (0.6%)

derivations0.0ms (0%)

preprocess17.0ms (1%)

end0.0ms (0%)

Profiling