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

start0.0ms (0%)

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

analyze1.0ms (0.1%)

Memory

1.5MiB live, 1.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
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)

sample454.0ms (46%)

Memory

27.0MiB live, 496.1MiB allocated; 140ms collecting garbage

Samples

290.0ms

8 256×

valid

Precisions

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

ival-div!: 42.0ms (55.2% of total)

ival-sub!: 33.0ms (43.3% of total)

adjust: 1.0ms (1.3% of total)

Bogosity

preprocess65.0ms (6.6%)

Memory

-9.1MiB live, 32.4MiB allocated; 16ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	31	15
2	99	15
3	236	15
4	1808	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 8 to 8 computations (0% saved)

series2.0ms (0.2%)

Memory

5.2MiB live, 5.2MiB 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)) #s(hole binary64 x))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 x))))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 (* x (+ 1 x))))))))
#s(approx (- 1 x) #s(hole binary64 1))
#s(approx (- 1 x) #s(hole binary64 (+ 1 (* -1 x))))
#s(approx (/ x (- 1 x)) #s(hole binary64 -1))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* -1 (+ 1 (/ 1 x)))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) x)) 1)))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) (pow x 2))) (+ 1 (/ 1 x)))))
#s(approx (- 1 x) #s(hole binary64 (* -1 x)))
#s(approx (- 1 x) #s(hole binary64 (* x (- (/ 1 x) 1))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (+ (/ 1 x) (/ 1 (pow x 2)))) x)) 1)))
#s(approx (- 1 x) #s(hole binary64 (* -1 (* x (- 1 (/ 1 x))))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((/ x (- 1 x)) x (- 1 x) 1)
1.0ms	x	@	inf	((/ x (- 1 x)) x (- 1 x) 1)
0.0ms	x	@	0	((/ x (- 1 x)) x (- 1 x) 1)

rewrite218.0ms (22.1%)

Memory

5.5MiB live, 192.2MiB allocated; 53ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	51	190
0	52	173
1	342	165
2	2286	165

Stop Event

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

Counts

18 → 10

Calls

Call 1

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

Outputs
(/.f64 x (-.f64 #s(literal 1 binary64) x))
x
(-.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
#s(approx (/ x (- 1 x)) 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 (- 1 x) (-.f64 #s(literal 1 binary64) x))
#s(approx (- 1 x) (-.f64 #s(literal 1 binary64) x))

eval0.0ms (0%)

Memory: 0.8MiB live, 0.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 17 to 13 computations (23.5% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	2	2	4
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	2	3	5

Accuracy

100.0%

Counts

5 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 15 to 15 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

4 → 9

Calls

Call 1

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

Outputs
#s(approx (/ x (- 1 x)) #s(hole binary64 x))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 x))))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 (* x (+ 1 x))))))))
#s(approx (/ x (- 1 x)) #s(hole binary64 -1))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* -1 (+ 1 (/ 1 x)))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) x)) 1)))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) (pow x 2))) (+ 1 (/ 1 x)))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (+ (/ 1 x) (/ 1 (pow x 2)))) x)) 1)))

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((/ x (- 1 x)) -1 (/ x (- 1 x)) x)
0.0ms	x	@	inf	((/ x (- 1 x)) -1 (/ x (- 1 x)) x)
0.0ms	x	@	0	((/ x (- 1 x)) -1 (/ x (- 1 x)) x)

rewrite190.0ms (19.2%)

Memory

1.0MiB live, 188.3MiB allocated; 31ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	37	151
0	37	147
1	278	139
2	2037	139

Stop Event

1×	iter-limit
1×	unsound
1×	node-limit
1×	saturated

Counts

13 → 6

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)) #s(hole binary64 x))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 x))))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* x (+ 1 (* x (+ 1 (* x (+ 1 x))))))))
#s(approx (/ x (- 1 x)) #s(hole binary64 -1))
#s(approx (/ x (- 1 x)) #s(hole binary64 (* -1 (+ 1 (/ 1 x)))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) x)) 1)))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (/ 1 x)) (pow x 2))) (+ 1 (/ 1 x)))))
#s(approx (/ x (- 1 x)) #s(hole binary64 (- (* -1 (/ (+ 1 (+ (/ 1 x) (/ 1 (pow x 2)))) x)) 1)))

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)) x)
#s(approx (/ x (- 1 x)) #s(literal -1 binary64))

eval0.0ms (0%)

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

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	2	2
Done	1	1
Total	3	3

Accuracy

100.0%

Counts

3 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(/.f64 x (-.f64 #s(literal 1 binary64) x))
✓	52.8%	#s(approx (/ x (- 1 x)) x)
✓	49.4%	#s(approx (/ x (- 1 x)) #s(literal -1 binary64))

Compiler

Compiled 27 to 25 computations (7.4% saved)

regimes3.0ms (0.3%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

Calls

2 calls:

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

Results

Accuracy	Segments	Branch
100.0%	1	`(/.f64 x (-.f64 #s(literal 1 binary64) x))`
100.0%	1	`x`

Compiler

Compiled 5 to 5 computations (0% saved)

regimes3.0ms (0.3%)

Memory

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

Counts

2 → 2

Calls

Call 1

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)

Calls

2 calls:

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

Results

Accuracy	Segments	Branch
98.5%	2	`(/.f64 x (-.f64 #s(literal 1 binary64) x))`
98.5%	3	`x`

Compiler

Compiled 5 to 5 computations (0% saved)

regimes2.0ms (0.2%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

2 calls:

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

Results

Accuracy	Segments	Branch
49.4%	1	`x`
49.4%	1	`(/.f64 x (-.f64 #s(literal 1 binary64) x))`

Compiler

Compiled 5 to 5 computations (0% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-0.9811488110751425	-2.872798077272092e-7

Compiler

Compiled 7 to 8 computations (-14.3% saved)

derivations28.0ms (2.9%)

Memory

-21.7MiB live, 24.0MiB allocated; 3ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 15 to 13 computations (13.3% saved)

preprocess18.0ms (1.8%)

Memory: 36.1MiB live, 36.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 19 to 17 computations (10.5% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze1.0ms (0.1%)

sample454.0ms (46%)

preprocess65.0ms (6.6%)

series2.0ms (0.2%)

rewrite218.0ms (22.1%)

eval0.0ms (0%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite190.0ms (19.2%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes3.0ms (0.3%)

regimes3.0ms (0.3%)

regimes2.0ms (0.2%)

bsearch0.0ms (0%)

derivations28.0ms (2.9%)

preprocess18.0ms (1.8%)

end0.0ms (0%)

Profiling