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

Time bar (total: 768.0ms)

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory
0.7MiB live, 0.7MiB allocated; 0ms collecting garbage
Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
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)

sample457.0ms (59.5%)

Memory
30.9MiB live, 1 033.5MiB allocated; 108ms collecting garbage
Samples
284.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 118.0ms
ival-sub!: 75.0ms (63.7% of total)
ival-mult!: 42.0ms (35.7% of total)
adjust: 1.0ms (0.8% of total)
Bogosity

preprocess108.0ms (14.1%)

Memory
-20.8MiB live, 71.1MiB allocated; 12ms collecting garbage
Iterations

Useful iterations: 4 (0.0ms)

IterNodesCost
0820
11918
23118
36618
425416
5225516
Stop Event
node-limit
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(*.f64 x (-.f64 x #s(literal 1 binary64)))
Compiler

Compiled 8 to 8 computations (0% saved)

series2.0ms (0.2%)

Memory
4.9MiB live, 4.9MiB 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:

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

rewrite79.0ms (10.2%)

Memory
-0.2MiB live, 106.1MiB allocated; 28ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
02693
02891
18291
052891
Stop Event
iter-limit
iter-limit
iter-limit
unsound
iter-limit
Counts
13 → 25
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 (-.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))))
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 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 (*.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 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) (/.f64 #s(literal 1 binary64) x)) x) x))
#s(approx (- x 1) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) x))
#s(approx (- x 1) (*.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)) (neg.f64 x)))

eval2.0ms (0.2%)

Memory
4.4MiB live, 4.4MiB allocated; 0ms collecting garbage
Compiler

Compiled 113 to 66 computations (41.6% saved)

prune1.0ms (0.2%)

Memory
4.4MiB live, 4.4MiB allocated; 0ms collecting garbage
Pruning

4 alts after pruning (3 fresh and 1 done)

PrunedKeptTotal
New18321
Fresh000
Picked011
Done000
Total18422
Accuracy
100.0%
Counts
22 → 4
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(*.f64 x (-.f64 x #s(literal 1 binary64)))
99.8%
(*.f64 x #s(approx (- x 1) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) x)))
50.5%
#s(approx (* x (- x 1)) (*.f64 x x))
52.2%
#s(approx (* x (- x 1)) (neg.f64 x))
Compiler

Compiled 25 to 25 computations (0% saved)

series3.0ms (0.4%)

Memory
8.2MiB live, 8.2MiB allocated; 0ms collecting garbage
Counts
11 → 14
Calls
Call 1
Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
(neg.f64 x)
x
#s(approx (* x (- x 1)) (*.f64 x x))
(*.f64 x x)
(*.f64 x #s(approx (- x 1) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) x)))
#s(approx (- x 1) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) x))
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) x)
(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x))
#s(literal 1 binary64)
(/.f64 #s(literal 1 binary64) 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 x #s(hole binary64 x))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (- x 1) #s(hole binary64 -1))
#s(approx (- x 1) #s(hole binary64 (- x 1)))
#s(approx (- 1 (/ 1 x)) #s(hole binary64 (/ -1 x)))
#s(approx (- 1 (/ 1 x)) #s(hole binary64 (/ (- x 1) x)))
#s(approx (/ 1 x) #s(hole binary64 (/ 1 x)))
#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 (- 1 (/ 1 x)) #s(hole binary64 1))
#s(approx (- 1 (/ 1 x)) #s(hole binary64 (- 1 (/ 1 x))))
#s(approx (- x 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 1)))))
Calls

3 calls:

TimeVariablePointExpression
1.0ms
x
@-inf
((* x (- x 1)) (neg x) x (* x (- x 1)) (* x x) (* x (- x 1)) (- x 1) (* (- 1 (/ 1 x)) x) (- 1 (/ 1 x)) 1 (/ 1 x))
1.0ms
x
@0
((* x (- x 1)) (neg x) x (* x (- x 1)) (* x x) (* x (- x 1)) (- x 1) (* (- 1 (/ 1 x)) x) (- 1 (/ 1 x)) 1 (/ 1 x))
1.0ms
x
@inf
((* x (- x 1)) (neg x) x (* x (- x 1)) (* x x) (* x (- x 1)) (- x 1) (* (- 1 (/ 1 x)) x) (- 1 (/ 1 x)) 1 (/ 1 x))

rewrite66.0ms (8.6%)

Memory
4.7MiB live, 98.2MiB allocated; 4ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
041189
049187
1111187
0630187
Stop Event
iter-limit
iter-limit
iter-limit
unsound
iter-limit
Counts
25 → 87
Calls
Call 1
Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
(neg.f64 x)
x
#s(approx (* x (- x 1)) (*.f64 x x))
(*.f64 x x)
(*.f64 x #s(approx (- x 1) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) x)))
#s(approx (- x 1) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) x))
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) x)
(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x))
#s(literal 1 binary64)
(/.f64 #s(literal 1 binary64) x)
#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 x) #s(hole binary64 (pow x 2)))
#s(approx (- x 1) #s(hole binary64 -1))
#s(approx (- x 1) #s(hole binary64 (- x 1)))
#s(approx (- 1 (/ 1 x)) #s(hole binary64 (/ -1 x)))
#s(approx (- 1 (/ 1 x)) #s(hole binary64 (/ (- x 1) x)))
#s(approx (/ 1 x) #s(hole binary64 (/ 1 x)))
#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 (- 1 (/ 1 x)) #s(hole binary64 1))
#s(approx (- 1 (/ 1 x)) #s(hole binary64 (- 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
#s(approx (* x (- x 1)) (*.f64 x x))
(*.f64 (*.f64 (neg.f64 x) #s(literal -1 binary64)) x)
(*.f64 (*.f64 (neg.f64 x) x) #s(literal -1 binary64))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(*.f64 #s(literal -1 binary64) (*.f64 x (neg.f64 x)))
(*.f64 (*.f64 x x) #s(literal 1 binary64))
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 #s(literal 1 binary64) (*.f64 x x))
(*.f64 x (*.f64 #s(literal -1 binary64) (neg.f64 x)))
(*.f64 x x)
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64))
(pow.f64 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(neg.f64 (*.f64 x (neg.f64 x)))
(fabs.f64 (*.f64 x x))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(+.f64 (cosh.f64 (*.f64 (log.f64 x) #s(literal 2 binary64))) (sinh.f64 (*.f64 (log.f64 x) #s(literal 2 binary64))))
(*.f64 #s(approx (- x 1) (*.f64 (/.f64 (-.f64 x #s(literal 1 binary64)) x) x)) x)
(*.f64 x #s(approx (- x 1) (*.f64 (/.f64 (-.f64 x #s(literal 1 binary64)) x) x)))
#s(approx (- x 1) (*.f64 (/.f64 (-.f64 x #s(literal 1 binary64)) x) x))
(*.f64 (/.f64 (-.f64 x #s(literal 1 binary64)) x) x)
(*.f64 x (/.f64 (-.f64 x #s(literal 1 binary64)) x))
(/.f64 (*.f64 x (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x)))) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))
(/.f64 (*.f64 x (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 (*.f64 x x) x)))) (fma.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) #s(literal 1 binary64)))
(/.f64 (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))
(/.f64 (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 (*.f64 x x) x))) x) (fma.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) #s(literal 1 binary64)))
(/.f64 (/.f64 (neg.f64 (-.f64 x #s(literal 1 binary64))) #s(literal -1 binary64)) x)
(/.f64 (/.f64 (neg.f64 (-.f64 x #s(literal 1 binary64))) x) #s(literal -1 binary64))
(/.f64 (-.f64 (*.f64 x x) x) (*.f64 x x))
(/.f64 (-.f64 (*.f64 #s(literal 2 binary64) (neg.f64 x)) #s(literal -2 binary64)) (*.f64 #s(literal 2 binary64) (neg.f64 x)))
(/.f64 (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) (*.f64 #s(literal 2 binary64) x))
(/.f64 (-.f64 (*.f64 x (neg.f64 x)) (neg.f64 x)) (*.f64 x (neg.f64 x)))
(/.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x)))) (neg.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64))))
(/.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 (*.f64 x x) x)))) (neg.f64 (fma.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) #s(literal 1 binary64))))
(/.f64 (neg.f64 (neg.f64 (-.f64 x #s(literal 1 binary64)))) x)
(/.f64 (fma.f64 x x #s(literal -1 binary64)) (*.f64 (-.f64 x #s(literal -1 binary64)) x))
(/.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))
(/.f64 (fma.f64 (*.f64 x x) x #s(literal -1 binary64)) (*.f64 (fma.f64 x x (-.f64 x #s(literal -1 binary64))) x))
(/.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 (*.f64 x x) x))) (fma.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) #s(literal 1 binary64)))
(/.f64 (neg.f64 (-.f64 x #s(literal 1 binary64))) (neg.f64 x))
(/.f64 (-.f64 x #s(literal 1 binary64)) x)
(neg.f64 (/.f64 (-.f64 x #s(literal 1 binary64)) (neg.f64 x)))
(neg.f64 (/.f64 (neg.f64 (-.f64 x #s(literal 1 binary64))) x))
(-.f64 (/.f64 #s(literal 1 binary64) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64))) (/.f64 (/.f64 #s(literal 1 binary64) (*.f64 x x)) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64))))
(-.f64 (/.f64 #s(literal 1 binary64) (fma.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) #s(literal 1 binary64))) (/.f64 (/.f64 #s(literal 1 binary64) (*.f64 (*.f64 x x) x)) (fma.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) #s(literal 1 binary64))))
(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x))
#s(literal 1 binary64)
(*.f64 (pow.f64 x #s(literal -1/2 binary64)) (pow.f64 x #s(literal -1/2 binary64)))
(*.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x))
(pow.f64 x #s(literal -1 binary64))
(/.f64 (*.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64)) #s(literal 2 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)) #s(literal 2 binary64))
(/.f64 (/.f64 #s(literal -1 binary64) x) #s(literal -1 binary64))
(/.f64 #s(literal -2 binary64) (*.f64 (neg.f64 x) #s(literal 2 binary64)))
(/.f64 #s(literal -2 binary64) (*.f64 #s(literal 2 binary64) (neg.f64 x)))
(/.f64 #s(literal 2 binary64) (*.f64 x #s(literal 2 binary64)))
(/.f64 #s(literal 2 binary64) (*.f64 #s(literal 2 binary64) x))
(/.f64 #s(literal -1 binary64) (neg.f64 x))
(/.f64 #s(literal 1 binary64) x)
(neg.f64 (/.f64 #s(literal -1 binary64) x))
(exp.f64 (*.f64 (log.f64 x) #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 x) (*.f64 x x))
#s(approx (- x 1) #s(literal -1 binary64))
#s(approx (- x 1) (-.f64 x #s(literal 1 binary64)))
#s(approx (- 1 (/ 1 x)) (/.f64 #s(literal -1 binary64) x))
#s(approx (- 1 (/ 1 x)) (/.f64 (-.f64 x #s(literal 1 binary64)) x))
#s(approx (/ 1 x) (/.f64 #s(literal 1 binary64) x))
#s(approx (* x (- x 1)) (*.f64 (/.f64 (-.f64 x #s(literal 1 binary64)) x) (*.f64 x x)))
#s(approx (- x 1) (*.f64 (/.f64 (-.f64 x #s(literal 1 binary64)) x) x))
#s(approx (- 1 (/ 1 x)) #s(literal 1 binary64))
#s(approx (- 1 (/ 1 x)) (/.f64 (-.f64 x #s(literal 1 binary64)) x))
#s(approx (- x 1) (*.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)) (neg.f64 x)))

eval15.0ms (1.9%)

Memory
-11.7MiB live, 37.6MiB allocated; 4ms collecting garbage
Compiler

Compiled 505 to 320 computations (36.6% saved)

prune3.0ms (0.4%)

Memory
10.6MiB live, 10.6MiB allocated; 0ms collecting garbage
Pruning

4 alts after pruning (0 fresh and 4 done)

PrunedKeptTotal
New78078
Fresh000
Picked033
Done011
Total78482
Accuracy
100.0%
Counts
82 → 4
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(*.f64 x (-.f64 x #s(literal 1 binary64)))
99.8%
(*.f64 x #s(approx (- x 1) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) x)))
50.5%
#s(approx (* x (- x 1)) (*.f64 x x))
52.2%
#s(approx (* x (- x 1)) (neg.f64 x))
Compiler

Compiled 44 to 41 computations (6.8% saved)

regimes5.0ms (0.7%)

Memory
-32.4MiB live, 14.1MiB allocated; 1ms collecting garbage
Counts
4 → 1
Calls
Call 1
Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
#s(approx (* x (- x 1)) (*.f64 x x))
(*.f64 x (-.f64 x #s(literal 1 binary64)))
(*.f64 x #s(approx (- x 1) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)) x)))
Outputs
(*.f64 x (-.f64 x #s(literal 1 binary64)))
Calls

2 calls:

3.0ms
(*.f64 x (-.f64 x #s(literal 1 binary64)))
2.0ms
x
Results
AccuracySegmentsBranch
100.0%1(*.f64 x (-.f64 x #s(literal 1 binary64)))
100.0%1x
Compiler

Compiled 5 to 5 computations (0% saved)

regimes3.0ms (0.3%)

Memory
9.8MiB live, 9.8MiB allocated; 0ms collecting garbage
Counts
2 → 2
Calls
Call 1
Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
#s(approx (* x (- x 1)) (*.f64 x x))
Outputs
#s(approx (* x (- x 1)) (neg.f64 x))
#s(approx (* x (- x 1)) (*.f64 x x))
Calls

2 calls:

1.0ms
(*.f64 x (-.f64 x #s(literal 1 binary64)))
1.0ms
x
Results
AccuracySegmentsBranch
97.9%2(*.f64 x (-.f64 x #s(literal 1 binary64)))
97.9%3x
Compiler

Compiled 5 to 5 computations (0% saved)

regimes2.0ms (0.3%)

Memory
7.2MiB live, 7.2MiB 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
x
1.0ms
(*.f64 x (-.f64 x #s(literal 1 binary64)))
Results
AccuracySegmentsBranch
52.2%1x
52.2%1(*.f64 x (-.f64 x #s(literal 1 binary64)))
Compiler

Compiled 5 to 5 computations (0% saved)

bsearch0.0ms (0%)

Memory
0.6MiB live, 0.6MiB allocated; 0ms collecting garbage
Algorithm
left-value
Steps
TimeLeftRight
0.0ms
0.5205971809202532
988.2023388890404
Compiler

Compiled 7 to 8 computations (-14.3% saved)

derivations4.0ms (0.5%)

Memory
8.7MiB live, 8.7MiB allocated; 0ms collecting garbage
Stop Event
done
Compiler

Compiled 16 to 13 computations (18.8% saved)

preprocess18.0ms (2.3%)

Memory
0.9MiB live, 47.8MiB allocated; 3ms collecting garbage
Compiler

Compiled 20 to 17 computations (15% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...