Metrics for Numeric.Log:$cexpm1 from log-domain-0.10.2.1, A

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-mult, time spent: 0.0ms, 0.0% of total-time

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

sample901.0ms (78.6%)

Results

487.0ms	6168×	256	valid
208.0ms	2088×	256	infinite

Precisions

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

Operation ival-mult, time spent: 201.0ms, 94.0% of total-time

Operation const, time spent: 14.0ms, 7.0% of total-time

Bogosity

preprocess180.0ms (15.7%)

Algorithm

1×	egg-herbie

Rules

52×	`fma-define`
22×	`distribute-lft-neg-in`
16×	`fma-neg`
16×	`associate-r`
16×	`distribute-lft-in`

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`x`
-	-	`(*.f64 x #s(literal 2 binary64))`
-	-	`#s(literal 2 binary64)`
-	-	`(.f64 (.f64 x #s(literal 2 binary64)) x)`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	88
1	32	76
2	73	76
3	168	76
4	243	76
5	301	76

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 2 binary64)) x)
(.f64 (.f64 x #s(literal 2 binary64)) x)
(.f64 (.f64 (neg.f64 x) #s(literal 2 binary64)) (neg.f64 x))
(neg.f64 (.f64 (.f64 (neg.f64 x) #s(literal 2 binary64)) (neg.f64 x)))

Outputs
(.f64 (.f64 x #s(literal 2 binary64)) x)
(.f64 x (.f64 x #s(literal 2 binary64)))
(.f64 (.f64 x #s(literal 2 binary64)) x)
(.f64 x (.f64 x #s(literal 2 binary64)))
(.f64 (.f64 (neg.f64 x) #s(literal 2 binary64)) (neg.f64 x))
(.f64 x (.f64 x #s(literal 2 binary64)))
(neg.f64 (.f64 (.f64 (neg.f64 x) #s(literal 2 binary64)) (neg.f64 x)))
(.f64 (.f64 #s(literal 2 binary64) (neg.f64 x)) (neg.f64 (neg.f64 x)))
(.f64 x (.f64 x #s(literal -2 binary64)))
(.f64 #s(literal -2 binary64) (.f64 x x))

Symmetry

(abs x)

Results

64.0ms	360×	256	valid
13.0ms	152×	256	infinite

Compiler

Compiled 30 to 20 computations (33.3% saved)

Precisions

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

Operation ival-mult, time spent: 44.0ms, 97.0% of total-time

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

eval0.0ms (0%)

Compiler: Compiled 6 to 4 computations (33.3% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(.f64 (.f64 x #s(literal 2 binary64)) x)

Compiler

Compiled 6 to 4 computations (33.3% saved)

localize30.0ms (2.6%)

Results

15.0ms	180×	256	valid
7.0ms	76×	256	infinite

Compiler

Compiled 12 to 8 computations (33.3% saved)

Precisions

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

Operation ival-mult, time spent: 6.0ms, 85.0% of total-time

Operation const, time spent: 1.0ms, 14.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 #s(literal 2 binary64)) x)

Compiler

Compiled 12 to 8 computations (33.3% saved)

simplify2.0ms (0.2%)

Algorithm

1×	egg-herbie

Rules

2×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	19
1	10	19

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 2 binary64)) x)

Outputs
(.f64 (.f64 x #s(literal 2 binary64)) x)
(.f64 x (.f64 x #s(literal 2 binary64)))

Compiler

Compiled 6 to 4 computations (33.3% saved)

soundness0.0ms (0%)

end0.0ms (0%)

preprocess31.0ms (2.7%)

Remove: (abs x)
Compiler: Compiled 60 to 40 computations (33.3% saved)

analyze0.0ms (0%)

sample901.0ms (78.6%)

preprocess180.0ms (15.7%)

eval0.0ms (0%)

prune1.0ms (0.1%)

localize30.0ms (2.6%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify2.0ms (0.2%)

soundness0.0ms (0%)

end0.0ms (0%)

preprocess31.0ms (2.7%)

Profiling