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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.5MiB live, 0.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
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample397.0ms (52.3%)

Memory

-31.5MiB live, 731.5MiB allocated; 79ms collecting garbage

Samples

229.0ms

8 256×

valid

Precisions

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

ival-mult!: 47.0ms (61.4% of total)

ival-sub!: 28.0ms (36.6% of total)

adjust: 2.0ms (2.6% of total)

Bogosity

explain35.0ms (4.7%)

Memory

32.8MiB live, 80.0MiB allocated; 3ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 x (-.f64 x #s(literal 1 binary64)))`
-	-	`(-.f64 x #s(literal 1 binary64))`
-	-	`#s(literal 1 binary64)`
-	-	`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

14.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-mult!: 3.0ms (68.4% of total)

ival-sub!: 2.0ms (45.6% of total)

adjust: 0.0ms (0% of total)

preprocess73.0ms (9.6%)

Memory

-31.2MiB live, 15.8MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 6 (0.0ms)

Iter	Nodes	Cost
0	8	20
1	18	18
2	26	18
3	45	18
4	88	18
5	298	18
6	2471	16
7	6405	16

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)

series2.0ms (0.3%)

Memory

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

Counts

4 → 10

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))
#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)

rewrite92.0ms (12.1%)

Memory

32.1MiB live, 133.9MiB allocated; 33ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	27	98
0	28	96
1	82	96
0	528	96

Stop Event

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

Counts

14 → 26

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))
#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 (-.f64 x #s(literal 1 binary64)) x)
(*.f64 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 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) x) (fma.f64 x 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 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64))) (fma.f64 x x (-.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 (-.f64 (pow.f64 x #s(literal 3 binary64)) #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 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 x x (-.f64 x #s(literal -1 binary64))))
(-.f64 (/.f64 (*.f64 x x) (-.f64 x #s(literal -1 binary64))) (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal -1 binary64))))
(-.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (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 x #s(literal -1 binary64))
#s(literal 1 binary64)
#s(approx (* x (- x 1)) (neg.f64 x))
#s(approx (* x (- x 1)) (*.f64 (-.f64 x #s(literal 1 binary64)) x))
#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 x))
#s(approx (* x (- x 1)) (.f64 (.f64 (-.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -1 binary64))) x) x))
#s(approx (- x 1) x)
#s(approx (- x 1) (*.f64 (-.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -1 binary64))) x))
#s(approx (- x 1) (*.f64 (-.f64 (pow.f64 x #s(literal -1 binary64)) #s(literal 1 binary64)) (neg.f64 x)))

eval13.0ms (1.7%)

Memory: -32.1MiB live, 7.2MiB allocated; 12ms collecting garbage
Compiler: Compiled 253 to 70 computations (72.3% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	21	2	23
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	21	3	24

Accuracy

100.0%

Counts

24 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 20 to 15 computations (25% saved)

series1.0ms (0.2%)

Memory

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

Counts

5 → 11

Calls

Call 1

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

Outputs
#s(approx (* x (- x 1)) #s(hole binary64 (* -1 x)))
#s(approx (* x (- x 1)) #s(hole binary64 (* x (- x 1))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#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))
#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)) (neg x) x (* x (- x 1)) (- x 1))
0.0ms	x	@	inf	((* x (- x 1)) (neg x) x (* x (- x 1)) (- x 1))
0.0ms	x	@	0	((* x (- x 1)) (neg x) x (* x (- x 1)) (- x 1))

rewrite108.0ms (14.3%)

Memory

1.5MiB live, 137.9MiB allocated; 62ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	30	117
0	32	114
1	86	114
0	532	114

Stop Event

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

Counts

16 → 19

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
(neg.f64 x)
x
(*.f64 x #s(approx (- x 1) x))
#s(approx (- x 1) x)
#s(approx (* x (- x 1)) #s(hole binary64 (* -1 x)))
#s(approx (* x (- x 1)) #s(hole binary64 (* x (- x 1))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#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))
#s(approx (- x 1) #s(hole binary64 (* x (- 1 (/ 1 x)))))
#s(approx (- x 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 1)))))

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

eval2.0ms (0.3%)

Memory: 5.0MiB live, 5.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 142 to 42 computations (70.4% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

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

Accuracy

100.0%

Counts

17 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 40 to 26 computations (35% saved)

regimes3.0ms (0.4%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

Calls

2 calls:

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

Results

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

Compiler

Compiled 6 to 5 computations (16.7% saved)

regimes3.0ms (0.4%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

2 calls:

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

Results

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

Compiler

Compiled 6 to 5 computations (16.7% saved)

regimes2.0ms (0.3%)

Memory

5.7MiB live, 5.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 (- x 1)) (neg.f64 x))

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

Calls

2 calls:

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

Results

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

Compiler

Compiled 6 to 5 computations (16.7% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	0.00032664589820156285	458.36371830281837

Compiler

Compiled 8 to 8 computations (0% saved)

derivations5.0ms (0.7%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 36 to 14 computations (61.1% saved)

preprocess19.0ms (2.4%)

Memory: -7.5MiB live, 39.7MiB allocated; 4ms collecting garbage
Compiler: Compiled 92 to 42 computations (54.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample397.0ms (52.3%)

explain35.0ms (4.7%)

preprocess73.0ms (9.6%)

series2.0ms (0.3%)

rewrite92.0ms (12.1%)

eval13.0ms (1.7%)

prune1.0ms (0.2%)

series1.0ms (0.2%)

rewrite108.0ms (14.3%)

eval2.0ms (0.3%)

prune2.0ms (0.2%)

regimes3.0ms (0.4%)

regimes3.0ms (0.4%)

regimes2.0ms (0.3%)

bsearch0.0ms (0%)

derivations5.0ms (0.7%)

preprocess19.0ms (2.4%)

end0.0ms (0%)

Profiling