Metrics for Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

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 6 computations (14.3% saved)

sample490.0ms (74.7%)

Memory

-9.1MiB live, 657.3MiB allocated; 171ms collecting garbage

Samples

319.0ms

8 256×

valid

Precisions

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

ival-sub!: 83.0ms (65.7% of total)

ival-mult!: 42.0ms (33.2% of total)

adjust: 2.0ms (1.6% of total)

Bogosity

preprocess54.0ms (8.2%)

Memory

-22.6MiB live, 21.6MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	8	20
1	27	16
2	81	15
3	217	15
4	978	15

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 8 computations (20% saved)

series5.0ms (0.7%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	24	83

Stop Event

1×	iter-limit

Counts

4 → 9

Calls

Call 1

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

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

Calls

3 calls:

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

rewrite38.0ms (5.9%)

Memory

-0.3MiB live, 44.2MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	31	10
0	247	10

Stop Event

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

Counts

4 → 37

Calls

Call 1

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

Outputs
(.f64 (/.f64 (-.f64 x #s(literal 1 binary64)) x) (.f64 x x))
(*.f64 (-.f64 x #s(literal 1 binary64)) x)
(*.f64 x (-.f64 x #s(literal 1 binary64)))
(/.f64 (*.f64 x (fma.f64 x x #s(literal -1 binary64))) (-.f64 x #s(literal -1 binary64)))
(/.f64 (.f64 x (fma.f64 (.f64 x x) x #s(literal -1 binary64))) (fma.f64 x x (-.f64 x #s(literal -1 binary64))))
(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
(/.f64 (.f64 (fma.f64 (.f64 x x) x #s(literal -1 binary64)) x) (fma.f64 x x (-.f64 x #s(literal -1 binary64))))
(neg.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) x))
(neg.f64 (*.f64 x (-.f64 #s(literal 1 binary64) x)))
(fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 #s(literal -1 binary64) x))
(fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 x #s(literal -1 binary64)))
(fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 #s(literal -1 binary64) x))
(fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 x #s(literal -1 binary64)))
(fma.f64 x x (*.f64 #s(literal -1 binary64) x))
(fma.f64 x x (*.f64 x #s(literal -1 binary64)))
(+.f64 (.f64 x x) (.f64 #s(literal -1 binary64) x))
(+.f64 (.f64 x x) (.f64 x #s(literal -1 binary64)))
x
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 #s(literal -1 binary64) x)) x)
(*.f64 (/.f64 (-.f64 x #s(literal 1 binary64)) x) x)
(*.f64 (fma.f64 x x #s(literal -1 binary64)) (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal -1 binary64))))
(.f64 (fma.f64 (.f64 x x) x #s(literal -1 binary64)) (/.f64 #s(literal 1 binary64) (fma.f64 x x (-.f64 x #s(literal -1 binary64)))))
(*.f64 x (/.f64 (-.f64 x #s(literal 1 binary64)) x))
(/.f64 (neg.f64 (fma.f64 x x #s(literal -1 binary64))) (neg.f64 (-.f64 x #s(literal -1 binary64))))
(/.f64 (neg.f64 (fma.f64 (*.f64 x x) x #s(literal -1 binary64))) (neg.f64 (fma.f64 x x (-.f64 x #s(literal -1 binary64)))))
(/.f64 (fma.f64 x x #s(literal -1 binary64)) (-.f64 x #s(literal -1 binary64)))
(/.f64 (fma.f64 (.f64 x x) x #s(literal -1 binary64)) (fma.f64 x x (-.f64 #s(literal 1 binary64) (.f64 x #s(literal -1 binary64)))))
(/.f64 (fma.f64 (*.f64 x x) x #s(literal -1 binary64)) (fma.f64 x x (-.f64 x #s(literal -1 binary64))))
(/.f64 #s(literal 1 binary64) (/.f64 (-.f64 x #s(literal -1 binary64)) (fma.f64 x x #s(literal -1 binary64))))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 x x (-.f64 x #s(literal -1 binary64))) (fma.f64 (*.f64 x x) x #s(literal -1 binary64))))
(neg.f64 (-.f64 #s(literal 1 binary64) x))
(-.f64 (/.f64 (*.f64 x x) (-.f64 x #s(literal -1 binary64))) (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal -1 binary64))))
(-.f64 (/.f64 (.f64 (.f64 x x) x) (fma.f64 x x (-.f64 x #s(literal -1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 x x (-.f64 x #s(literal -1 binary64)))))
(-.f64 x #s(literal 1 binary64))
(+.f64 #s(literal -1 binary64) x)
(+.f64 x #s(literal -1 binary64))
#s(literal 1 binary64)

eval4.0ms (0.5%)

Memory: 6.9MiB live, 6.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 441 to 114 computations (74.1% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	41	1	42
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	41	2	43

Accuracy

100.0%

Counts

43 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 x (-.f64 x #s(literal 1 binary64)))
▶	46.1%	(*.f64 x #s(approx (- x 1) #s(literal -1 binary64)))

Compiler

Compiled 12 to 10 computations (16.7% saved)

series3.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	24	83

Stop Event

1×	iter-limit

Counts

4 → 9

Calls

Call 1

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

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

Calls

3 calls:

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

rewrite38.0ms (5.9%)

Memory

-3.4MiB live, 48.6MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	14
0	7	14
1	31	14
0	229	14

Stop Event

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

Counts

4 → 5

Calls

Call 1

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

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

eval1.0ms (0.1%)

Memory: 2.2MiB live, 2.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 97 to 32 computations (67% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	9	0	9
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	9	2	11

Accuracy

100.0%

Counts

11 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 x (-.f64 x #s(literal 1 binary64)))
✓	46.1%	(*.f64 x #s(approx (- x 1) #s(literal -1 binary64)))

Compiler

Compiled 12 to 10 computations (16.7% saved)

regimes5.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 → 1

Calls

Call 1

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

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

Call 2

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 24 to 19 computations (20.8% saved)

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 12 to 9 computations (25% saved)

preprocess15.0ms (2.3%)

Memory: -19.5MiB live, 26.7MiB allocated; 3ms collecting garbage
Compiler: Compiled 17 to 13 computations (23.5% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample490.0ms (74.7%)

preprocess54.0ms (8.2%)

series5.0ms (0.7%)

rewrite38.0ms (5.9%)

eval4.0ms (0.5%)

prune2.0ms (0.3%)

series3.0ms (0.4%)

rewrite38.0ms (5.9%)

eval1.0ms (0.1%)

prune1.0ms (0.2%)

regimes5.0ms (0.8%)

derivations1.0ms (0.1%)

preprocess15.0ms (2.3%)

end0.0ms (0%)

Profiling