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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample513.0ms (53.1%)

Memory

26.6MiB live, 844.6MiB allocated; 159ms collecting garbage

Samples

273.0ms

8 256×

valid

Precisions

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

ival-mult!: 46.0ms (64.8% of total)

ival-add!: 23.0ms (32.4% of total)

adjust: 2.0ms (2.8% of total)

Bogosity

explain60.0ms (6.2%)

Memory

2.9MiB live, 86.0MiB allocated; 24ms collecting garbage

FPErrors

Click to see full error table

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

28.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-mult!: 16.0ms (91.9% of total)

ival-add!: 2.0ms (11.5% of total)

adjust: 0.0ms (0% of total)

preprocess98.0ms (10.1%)

Memory

-1.8MiB live, 37.6MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	32
1	41	30
2	101	30
3	181	30
4	338	30
5	472	30
6	1241	30
7	3217	30
8	7707	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 x (+.f64 y y))

Symmetry

(negabs x)

(negabs y)

(sort x y)

Compiler

Compiled 10 to 8 computations (20% saved)

series6.0ms (0.6%)

Memory

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

Counts

4 → 4

Calls

Call 1

Inputs
(*.f64 x (+.f64 y y))
x
(+.f64 y y)
y

Outputs
#s(approx (* x (+ y y)) #s(hole binary64 (* 2 (* x y))))
#s(approx x #s(hole binary64 x))
#s(approx (+ y y) #s(hole binary64 (* 2 y)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	-inf	((* x (+ y y)) x (+ y y) y)
1.0ms	x	@	inf	((* x (+ y y)) x (+ y y) y)
1.0ms	x	@	-inf	((* x (+ y y)) x (+ y y) y)
1.0ms	y	@	inf	((* x (+ y y)) x (+ y y) y)
1.0ms	y	@	0	((* x (+ y y)) x (+ y y) y)

rewrite79.0ms (8.1%)

Memory

1.6MiB live, 104.4MiB allocated; 47ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	34
0	15	34
1	36	22
0	169	22

Stop Event

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

Counts

8 → 29

Calls

Call 1

Inputs
(*.f64 x (+.f64 y y))
x
(+.f64 y y)
y
#s(approx (* x (+ y y)) #s(hole binary64 (* 2 (* x y))))
#s(approx x #s(hole binary64 x))
#s(approx (+ y y) #s(hole binary64 (* 2 y)))
#s(approx y #s(hole binary64 y))

Outputs
(.f64 (.f64 #s(literal 2 binary64) x) y)
(.f64 (.f64 y x) #s(literal 2 binary64))
(.f64 #s(literal 2 binary64) (.f64 y x))
(*.f64 #s(literal 2 binary64) x)
(.f64 y (.f64 #s(literal 2 binary64) x))
(*.f64 x #s(literal 2 binary64))
(/.f64 (*.f64 #s(literal 0 binary64) x) #s(literal 0 binary64))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64))) x) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 (*.f64 x #s(literal 0 binary64)) #s(literal 0 binary64))
(/.f64 (.f64 x (.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 (-.f64 (.f64 (.f64 y x) (.f64 y x)) (.f64 (.f64 y x) (.f64 y x))) (-.f64 (.f64 y x) (.f64 y x)))
(/.f64 (+.f64 (pow.f64 (.f64 y x) #s(literal 3 binary64)) (pow.f64 (.f64 y x) #s(literal 3 binary64))) (fma.f64 (.f64 y x) (.f64 y x) (-.f64 (.f64 (.f64 y x) (.f64 y x)) (.f64 (.f64 y x) (.f64 y x)))))
(fma.f64 #s(literal 1 binary64) (.f64 y x) (.f64 #s(literal 1 binary64) (*.f64 y x)))
(fma.f64 (.f64 y x) #s(literal 1 binary64) (.f64 (*.f64 y x) #s(literal 1 binary64)))
(fma.f64 y x (*.f64 y x))
(fma.f64 x y (*.f64 y x))
(-.f64 (.f64 y x) (.f64 (neg.f64 y) x))
(-.f64 (.f64 y x) (.f64 (neg.f64 x) y))
(+.f64 (.f64 #s(literal 1 binary64) (.f64 y x)) (.f64 #s(literal 1 binary64) (.f64 y x)))
(+.f64 (.f64 (.f64 y x) #s(literal 1 binary64)) (.f64 (.f64 y x) #s(literal 1 binary64)))
(+.f64 (.f64 y x) (.f64 y x))
(+.f64 x x)
x
#s(literal 2 binary64)
y
#s(approx (* x (+ y y)) (*.f64 #s(literal 2 binary64) x))
#s(approx x x)
#s(approx (+ y y) #s(literal 2 binary64))
#s(approx y y)

eval13.0ms (1.3%)

Memory: -31.2MiB live, 13.7MiB allocated; 10ms collecting garbage
Compiler: Compiled 252 to 62 computations (75.4% saved)

prune1.0ms (0.1%)

Memory

4.1MiB live, 4.2MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	30	1	31
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	30	2	32

Accuracy

100.0%

Counts

32 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	5.7%	(+.f64 x x)
✓	100.0%	(*.f64 x (+.f64 y y))

Compiler

Compiled 8 to 7 computations (12.5% saved)

series1.0ms (0.1%)

Memory

3.3MiB live, 3.2MiB allocated; 0ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs
(+.f64 x x)
x

Outputs
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))

Calls

6 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((+ x x) x)
0.0ms	x	@	inf	((+ x x) x)
0.0ms	x	@	0	((+ x x) x)
0.0ms	y	@	0	((+ x x) x)
0.0ms	y	@	inf	((+ x x) x)

rewrite34.0ms (3.5%)

Memory

-0.4MiB live, 43.6MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	7	14
0	7	14
1	20	8
0	114	8

Stop Event

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

Counts

4 → 4

Calls

Call 1

Inputs
(+.f64 x x)
x
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))

Outputs
#s(literal 2 binary64)
x
#s(approx (+ x x) #s(literal 2 binary64))
#s(approx x x)

eval1.0ms (0.1%)

Memory: 2.3MiB live, 2.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 22 to 9 computations (59.1% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	5	1	6
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	5	3	8

Accuracy

100.0%

Counts

8 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	5.7%	(+.f64 x x)
✓	100.0%	(*.f64 x (+.f64 y y))
▶	5.0%	#s(approx (+ x x) #s(literal 2 binary64))

Compiler

Compiled 13 to 12 computations (7.7% saved)

series1.0ms (0.1%)

Memory

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

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (+ x x) #s(literal 2 binary64))
#s(literal 2 binary64)

Outputs
#s(approx (+ x x) #s(hole binary64 (* 2 x)))

Calls

6 calls:

Time	Variable		Point	Expression
0.0ms	x	@	inf	((+ x x) 2)
0.0ms	x	@	-inf	((+ x x) 2)
0.0ms	x	@	0	((+ x x) 2)
0.0ms	y	@	0	((+ x x) 2)
0.0ms	y	@	inf	((+ x x) 2)

rewrite22.0ms (2.2%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	6	13
0	6	11
1	19	7
0	113	7

Stop Event

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

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (+ x x) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (+ x x) #s(hole binary64 (* 2 x)))

Outputs
#s(approx (+ x x) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (+ x x) #s(literal 2 binary64))

eval0.0ms (0%)

Memory: 0.5MiB live, 0.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 10 to 5 computations (50% saved)

prune38.0ms (3.9%)

Memory

-41.3MiB live, 7.7MiB allocated; 38ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

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

Accuracy

100.0%

Counts

5 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	5.7%	(+.f64 x x)
✓	100.0%	(*.f64 x (+.f64 y y))
✓	5.0%	#s(approx (+ x x) #s(literal 2 binary64))

Compiler

Compiled 26 to 20 computations (23.1% saved)

regimes7.0ms (0.7%)

Memory

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

Counts

3 → 1

Calls

Call 1

Inputs
#s(approx (+ x x) #s(literal 2 binary64))
(+.f64 x x)
(*.f64 x (+.f64 y y))

Outputs
(*.f64 x (+.f64 y y))

Calls

4 calls:

2.0ms	y
2.0ms	x
2.0ms	(+.f64 y y)
1.0ms	(*.f64 x (+.f64 y y))

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 y y)`
100.0%	1	`(*.f64 x (+.f64 y y))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 10 to 11 computations (-10% saved)

regimes5.0ms (0.6%)

Memory

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

Counts

2 → 1

Calls

Call 1

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

Outputs
(+.f64 x x)

Calls

4 calls:

1.0ms	x
1.0ms	(+.f64 y y)
1.0ms	y
1.0ms	(*.f64 x (+.f64 y y))

Results

Accuracy	Segments	Branch
5.7%	1	`(+.f64 y y)`
5.7%	1	`(*.f64 x (+.f64 y y))`
5.7%	1	`x`
5.7%	1	`y`

Compiler

Compiled 10 to 11 computations (-10% saved)

regimes7.0ms (0.7%)

Memory

-37.1MiB live, 13.4MiB allocated; 4ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (+ x x) #s(literal 2 binary64))

Outputs
#s(approx (+ x x) #s(literal 2 binary64))

Calls

4 calls:

3.0ms	(+.f64 y y)
1.0ms	y
1.0ms	x
1.0ms	(*.f64 x (+.f64 y y))

Results

Accuracy	Segments	Branch
5.0%	1	`(+.f64 y y)`
5.0%	1	`(*.f64 x (+.f64 y y))`
5.0%	1	`y`
5.0%	1	`x`

Compiler

Compiled 10 to 11 computations (-10% saved)

derivations3.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 13 to 8 computations (38.5% saved)

preprocess77.0ms (7.9%)

Memory: 40.1MiB live, 132.3MiB allocated; 9ms collecting garbage
Remove: (sort x y)
Compiler: Compiled 146 to 128 computations (12.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample513.0ms (53.1%)

explain60.0ms (6.2%)

preprocess98.0ms (10.1%)

series6.0ms (0.6%)

rewrite79.0ms (8.1%)

eval13.0ms (1.3%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite34.0ms (3.5%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite22.0ms (2.2%)

eval0.0ms (0%)

prune38.0ms (3.9%)

regimes7.0ms (0.7%)

regimes5.0ms (0.6%)

regimes7.0ms (0.7%)

derivations3.0ms (0.3%)

preprocess77.0ms (7.9%)

end0.0ms (0%)

Profiling