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.4MiB live, 0.4MiB 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)

sample830.0ms (46.9%)

Memory

28.7MiB live, 977.2MiB allocated; 172ms collecting garbage

Samples

602.0ms

8 256×

valid

Precisions

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

ival-mult: 187.0ms (76.1% of total)

ival-add: 48.0ms (19.5% of total)

ival-true: 5.0ms (2% of total)

adjust: 3.0ms (1.2% of total)

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

Bogosity

explain87.0ms (4.9%)

Memory

-18.5MiB live, 80.0MiB allocated; 21ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
1	-	-	`(*.f64 x (+.f64 y y))`
0	-	-	`(+.f64 y y)`
0	-	-	`y`
0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`*.f64`	`(*.f64 x (+.f64 y y))`	*no**	1	0

Confusion

	Predicted +	Predicted -
+	1	0
-	0	255

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	255

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	255
1	1

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	0

Precision?

1.0

Recall?

1.0

Samples

46.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

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

ival-add: 3.0ms (42.6% of total)

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

adjust: 0.0ms (0% of total)

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

preprocess259.0ms (14.6%)

Memory

51.7MiB live, 274.1MiB allocated; 65ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	33
1	40	25
2	99	25
3	184	25
4	348	25
5	482	25
6	1397	25
7	3373	25
8	7876	25
0	4	5
0	6	5
1	13	5
2	29	5
3	57	5
4	124	5
5	240	5
6	941	5
7	4190	5
0	8541	5

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

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

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

Symmetry

(negabs y)

(negabs x)

(sort x y)

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 4 computations (20% saved)

series10.0ms (0.6%)

Memory

-29.7MiB live, 16.2MiB allocated; 9ms collecting garbage

Counts

4 → 4

Calls

Call 1

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

Outputs
(* 2 (* x y))
x
(* 2 y)
y

Calls

6 calls:

Time	Variable		Point	Expression
5.0ms	x	@	inf	((* x (+ y y)) x (+ y y) y)
1.0ms	y	@	-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)

simplify211.0ms (12%)

Memory

7.0MiB live, 161.3MiB allocated; 50ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	10
1	15	10
2	39	10
3	96	10
4	230	10
5	795	10
6	4700	10
0	8101	10

Stop Event

1×	iter limit
1×	node limit

Counts

4 → 2

Calls

Call 1

Inputs
(* 2 (* x y))
x
(* 2 y)
y

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

rewrite62.0ms (3.5%)

Memory

-11.2MiB live, 34.1MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	22	10
0	137	10

Stop Event

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

Counts

4 → 26

Calls

Call 1

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

Outputs
(.f64 (.f64 x #s(literal 2 binary64)) y)
(.f64 #s(literal 2 binary64) (.f64 y x))
(.f64 (.f64 #s(literal 2 binary64) y) x)
(*.f64 y (+.f64 x x))
(.f64 x (.f64 #s(literal 2 binary64) y))
(/.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 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 y x) (.f64 y x))
x
(*.f64 #s(literal 2 binary64) y)
(*.f64 y #s(literal 2 binary64))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (neg.f64 (fma.f64 y y #s(literal 0 binary64))))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64))) (fma.f64 y y #s(literal 0 binary64)))
(-.f64 (/.f64 (.f64 y y) #s(literal 0 binary64)) (/.f64 (.f64 y y) #s(literal 0 binary64)))
(+.f64 (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y #s(literal 0 binary64))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y #s(literal 0 binary64))))
(+.f64 y y)
y

eval2.0ms (0.1%)

Memory: 5.3MiB live, 5.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 264 to 67 computations (74.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	28	1	29
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	29	1	30

Accuracy

100.0%

Counts

30 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 4 computations (20% saved)

series3.0ms (0.2%)

Memory

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

Counts

4 → 4

Calls

Call 1

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

Outputs
(* 2 (* x y))
(* 2 x)
x
y

Calls

6 calls:

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

simplify182.0ms (10.3%)

Memory

1.8MiB live, 189.8MiB allocated; 33ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	10
1	14	10
2	39	10
3	98	10
4	232	10
5	800	10
6	4710	10
0	8226	10

Stop Event

1×	iter limit
1×	node limit

Counts

4 → 2

Calls

Call 1

Inputs
(* 2 (* x y))
(* 2 x)
x
y

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

rewrite46.0ms (2.6%)

Memory

-24.0MiB live, 74.7MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	22	10
0	137	10

Stop Event

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

Counts

4 → 26

Calls

Call 1

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

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

eval2.0ms (0.1%)

Memory: 7.5MiB live, 7.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 264 to 67 computations (74.6% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	29	0	29
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	29	1	30

Accuracy

100.0%

Counts

30 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 15 to 10 computations (33.3% saved)

regimes5.0ms (0.3%)

Memory

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

Counts

2 → 1

Calls

Call 1

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

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

Calls

4 calls:

1.0ms	x
1.0ms	y
1.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)

regimes7.0ms (0.4%)

Memory

-25.3MiB live, 18.3MiB allocated; 5ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 11 computations (-10% saved)

simplify11.0ms (0.6%)

Memory

-11.2MiB live, 33.8MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	10

Stop Event

1×

saturated

Calls

Call 1

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

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

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 10 to 6 computations (40% saved)

preprocess46.0ms (2.6%)

Memory

-5.7MiB live, 97.0MiB allocated; 11ms collecting garbage

Remove

(sort x y)

(negabs x)

(negabs y)

Compiler

Compiled 90 to 68 computations (24.4% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample830.0ms (46.9%)

explain87.0ms (4.9%)

preprocess259.0ms (14.6%)

eval0.0ms (0%)

prune0.0ms (0%)

series10.0ms (0.6%)

simplify211.0ms (12%)

rewrite62.0ms (3.5%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series3.0ms (0.2%)

simplify182.0ms (10.3%)

rewrite46.0ms (2.6%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

regimes5.0ms (0.3%)

regimes7.0ms (0.4%)

simplify11.0ms (0.6%)

derivations1.0ms (0.1%)

preprocess46.0ms (2.6%)

end0.0ms (0%)

Profiling