Metrics for Numeric.Integration.TanhSinh:nonNegative from integration-0.2.1

start0.0ms (0%)

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

analyze1.0ms (0.1%)

Memory

1.2MiB live, 1.2MiB 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
50%	50%	50%	0%	0%	0%	0%	2
75%	75%	25%	0%	0%	0%	0%	3
87.5%	87.5%	12.5%	0%	0%	0%	0%	4
93.8%	93.7%	6.2%	0%	0%	0%	0%	5
96.9%	96.8%	3.1%	0%	0%	0%	0%	6
98.4%	98.4%	1.6%	0%	0%	0%	0%	7
99.2%	99.2%	0.8%	0%	0%	0%	0%	8
99.6%	99.6%	0.4%	0%	0%	0%	0%	9
99.8%	99.8%	0.2%	0%	0%	0%	0%	10
99.9%	99.9%	0.1%	0%	0%	0%	0%	11
100%	99.9%	0%	0%	0%	0%	0%	12

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample423.0ms (32.9%)

Memory

-30.9MiB live, 396.4MiB allocated; 105ms collecting garbage

Samples

231.0ms

8 256×

valid

Precisions

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

ival-div!: 46.0ms (52.4% of total)

ival-sub!: 40.0ms (45.5% of total)

adjust: 1.0ms (1.1% of total)

Bogosity

preprocess94.0ms (7.3%)

Memory

-9.7MiB live, 40.5MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	31	16
2	95	15
3	242	15
4	2032	15

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 8 computations (20% saved)

series130.0ms (10.1%)

Memory

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

Counts

4 → 14

Calls

Call 1

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

Outputs
#s(approx (/ x (- 1 x)) x)
#s(approx (/ x (- 1 x)) (*.f64 x (+.f64 #s(literal 1 binary64) x)))
#s(approx (/ x (- 1 x)) (.f64 x (+.f64 #s(literal 1 binary64) (.f64 x (+.f64 #s(literal 1 binary64) x)))))
#s(approx (/ x (- 1 x)) (.f64 x (+.f64 #s(literal 1 binary64) (.f64 x (+.f64 #s(literal 1 binary64) (*.f64 x (+.f64 #s(literal 1 binary64) x)))))))
#s(approx (- 1 x) #s(literal 1 binary64))
#s(approx (- 1 x) (+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1 binary64) x)))
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(approx (/ x (- 1 x)) (*.f64 #s(literal -1 binary64) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x))))
#s(approx (/ x (- 1 x)) (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) x)) #s(literal 1 binary64)))
#s(approx (/ x (- 1 x)) (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) (pow.f64 x #s(literal 2 binary64)))) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x))))
#s(approx (- 1 x) (*.f64 #s(literal -1 binary64) x))
#s(approx (- 1 x) (*.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64))))
#s(approx (/ x (- 1 x)) (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 (+.f64 #s(literal 1 binary64) (+.f64 (/.f64 #s(literal 1 binary64) x) (/.f64 #s(literal 1 binary64) (pow.f64 x #s(literal 2 binary64))))) x)) #s(literal 1 binary64)))
#s(approx (- 1 x) (.f64 #s(literal -1 binary64) (.f64 x (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)))))

Calls

3 calls:

Time	Variable	Point
1.0ms	x	-inf
0.0ms	x	inf
0.0ms	x	0

rewrite200.0ms (15.6%)

Memory

-20.1MiB live, 74.7MiB allocated; 4ms collecting garbage

Counts

4 → 10

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 4.5MiB live, 4.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 228 to 73 computations (68% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	17	3	20
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	17	4	21

Accuracy

100.0%

Counts

21 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(/.f64 x (-.f64 #s(literal 1 binary64) x))
▶	47.6%	#s(approx (/ x (- 1 x)) (*.f64 x (+.f64 #s(literal 1 binary64) x)))
▶	48.4%	#s(approx (/ x (- 1 x)) x)
▶	53.1%	#s(approx (/ x (- 1 x)) #s(literal -1 binary64))

Compiler

Compiled 30 to 23 computations (23.3% saved)

series127.0ms (9.9%)

Memory

3.4MiB live, 50.3MiB allocated; 7ms collecting garbage

Counts

8 → 14

Calls

Call 1

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

Outputs
#s(approx (/ x (- 1 x)) x)
#s(approx (/ x (- 1 x)) (*.f64 x (+.f64 #s(literal 1 binary64) x)))
#s(approx (/ x (- 1 x)) (.f64 x (+.f64 #s(literal 1 binary64) (.f64 x (+.f64 #s(literal 1 binary64) x)))))
#s(approx (/ x (- 1 x)) (.f64 x (+.f64 #s(literal 1 binary64) (.f64 x (+.f64 #s(literal 1 binary64) (*.f64 x (+.f64 #s(literal 1 binary64) x)))))))
#s(approx (+ 1 x) #s(literal 1 binary64))
#s(approx (+ 1 x) (+.f64 #s(literal 1 binary64) x))
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(approx (/ x (- 1 x)) (*.f64 #s(literal -1 binary64) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x))))
#s(approx (/ x (- 1 x)) (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) x)) #s(literal 1 binary64)))
#s(approx (/ x (- 1 x)) (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) (pow.f64 x #s(literal 2 binary64)))) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x))))
#s(approx (* x (+ 1 x)) (pow.f64 x #s(literal 2 binary64)))
#s(approx (* x (+ 1 x)) (*.f64 (pow.f64 x #s(literal 2 binary64)) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x))))
#s(approx (+ 1 x) (*.f64 x (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x))))
#s(approx (/ x (- 1 x)) (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 (+.f64 #s(literal 1 binary64) (+.f64 (/.f64 #s(literal 1 binary64) x) (/.f64 #s(literal 1 binary64) (pow.f64 x #s(literal 2 binary64))))) x)) #s(literal 1 binary64)))

Calls

3 calls:

Time	Variable	Point
1.0ms	x	-inf
0.0ms	x	inf
0.0ms	x	0

rewrite268.0ms (20.8%)

Memory

-47.4MiB live, 76.8MiB allocated; 198ms collecting garbage

Counts

8 → 17

Calls

Call 1

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

Outputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (/ x (- 1 x)) x)
x
#s(approx (/ x (- 1 x)) (*.f64 x (+.f64 #s(literal 1 binary64) x)))
(*.f64 x (+.f64 #s(literal 1 binary64) x))
(*.f64 (+.f64 #s(literal 1 binary64) x) x)
(+.f64 (.f64 #s(literal 1 binary64) x) (.f64 x x))
(+.f64 (.f64 x #s(literal 1 binary64)) (.f64 x x))
(fma.f64 #s(literal 1 binary64) x (*.f64 x x))
(fma.f64 x #s(literal 1 binary64) (*.f64 x x))
(+.f64 #s(literal 1 binary64) x)
(+.f64 x #s(literal 1 binary64))
(-.f64 #s(literal 1 binary64) (neg.f64 x))
#s(literal 1 binary64)
(cosh.f64 #s(literal 0 binary64))
(exp.f64 #s(literal 0 binary64))

eval2.0ms (0.2%)

Memory: 3.3MiB live, 3.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 301 to 81 computations (73.1% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	20	0	20
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	20	4	24

Accuracy

100.0%

Counts

24 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(/.f64 x (-.f64 #s(literal 1 binary64) x))
✓	47.6%	#s(approx (/ x (- 1 x)) (*.f64 x (+.f64 #s(literal 1 binary64) x)))
✓	48.4%	#s(approx (/ x (- 1 x)) x)
✓	53.1%	#s(approx (/ x (- 1 x)) #s(literal -1 binary64))

Compiler

Compiled 30 to 23 computations (23.3% saved)

regimes11.0ms (0.8%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

2 → 2

3 → 2

4 → 1

Calls

Call 1

Inputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))

Outputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))

Call 2

Inputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(approx (/ x (- 1 x)) x)

Outputs
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))
#s(approx (/ x (- 1 x)) x)

Call 3

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

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

Call 4

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

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

Calls

7 calls:

2.0ms	x
2.0ms	x
1.0ms	(/.f64 x (-.f64 #s(literal 1 binary64) x))
1.0ms	(/.f64 x (-.f64 #s(literal 1 binary64) x))
1.0ms	(/.f64 x (-.f64 #s(literal 1 binary64) x))

Results

Accuracy	Segments	Branch
53.1%	1	`x`
53.1%	1	`(/.f64 x (-.f64 #s(literal 1 binary64) x))`
98.4%	2	`(/.f64 x (-.f64 #s(literal 1 binary64) x))`
98.7%	2	`(/.f64 x (-.f64 #s(literal 1 binary64) x))`
98.7%	3	`x`
100.0%	1	`(/.f64 x (-.f64 #s(literal 1 binary64) x))`
100.0%	1	`x`

Compiler

Compiled 53 to 32 computations (39.6% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-0.9677480079364417	-5.824083847703265e-6

Compiler

Compiled 8 to 8 computations (0% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-0.9677480079364417	-5.824083847703265e-6

Compiler

Compiled 8 to 8 computations (0% saved)

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 60 to 17 computations (71.7% saved)

preprocess23.0ms (1.8%)

Memory: -12.5MiB live, 34.5MiB allocated; 2ms collecting garbage
Compiler: Compiled 65 to 21 computations (67.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze1.0ms (0.1%)

sample423.0ms (32.9%)

preprocess94.0ms (7.3%)

series130.0ms (10.1%)

rewrite200.0ms (15.6%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

series127.0ms (9.9%)

rewrite268.0ms (20.8%)

eval2.0ms (0.2%)

prune2.0ms (0.1%)

regimes11.0ms (0.8%)

bsearch0.0ms (0%)

bsearch0.0ms (0%)

derivations1.0ms (0.1%)

preprocess23.0ms (1.8%)

end0.0ms (0%)

Profiling