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

0.8MiB live, 0.8MiB 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)

sample571.0ms (43.7%)

Memory

47.5MiB live, 1 141.7MiB allocated; 281ms collecting garbage

Samples

335.0ms

8 256×

valid

Precisions

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

ival-sub!: 59.0ms (55.3% of total)

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

adjust: 1.0ms (0.9% of total)

Bogosity

preprocess239.0ms (18.3%)

Memory

-34.0MiB live, 58.5MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	8	20
1	29	16
2	91	15
3	222	15
4	816	15
5	5974	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 8 to 8 computations (0% saved)

series2.0ms (0.1%)

Memory

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

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

Calls

3 calls:

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

rewrite231.0ms (17.7%)

Memory

10.5MiB live, 156.2MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	26	93
0	28	78
1	100	78
2	424	78
3	2896	78

Stop Event

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

Counts

13 → 11

Calls

Call 1

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

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

eval0.0ms (0%)

Memory: 0.6MiB live, 0.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 20 to 16 computations (20% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

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

Accuracy

100.0%

Counts

5 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 10 computations (0% saved)

series1.0ms (0.1%)

Memory

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

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

Calls

3 calls:

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

rewrite201.0ms (15.4%)

Memory

8.3MiB live, 105.3MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	25	97
0	26	82
1	99	82
2	423	82
3	2910	82

Stop Event

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

Counts

13 → 6

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

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

eval0.0ms (0%)

Memory: 0.2MiB live, 0.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 7 to 7 computations (0% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

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

Accuracy

100.0%

Counts

3 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 19 to 19 computations (0% saved)

regimes3.0ms (0.2%)

Memory

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

Counts

2 → 1

Calls

Call 1

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

2 calls:

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

Results

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

Compiler

Compiled 5 to 5 computations (0% saved)

regimes2.0ms (0.2%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 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)))

Calls

2 calls:

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

Results

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

Compiler

Compiled 5 to 5 computations (0% saved)

derivations40.0ms (3.1%)

Memory

-38.5MiB live, 8.1MiB allocated; 3ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 9 to 9 computations (0% saved)

preprocess13.0ms (1%)

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

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample571.0ms (43.7%)

preprocess239.0ms (18.3%)

series2.0ms (0.1%)

rewrite231.0ms (17.7%)

eval0.0ms (0%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite201.0ms (15.4%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes3.0ms (0.2%)

regimes2.0ms (0.2%)

derivations40.0ms (3.1%)

preprocess13.0ms (1%)

end0.0ms (0%)

Profiling