Metrics for Data.Random.Dice:roll from dice-0.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%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample553.0ms (56.7%)

Memory

31.7MiB live, 550.3MiB allocated; 135ms collecting garbage

Samples

239.0ms

8 256×

valid

Precisions

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

ival-mult!: 49.0ms (65.4% of total)

ival-sub!: 24.0ms (32.1% of total)

adjust: 1.0ms (1.3% of total)

Bogosity

preprocess85.0ms (8.8%)

Memory

-6.6MiB live, 38.1MiB allocated; 19ms collecting garbage

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	8	16
1	30	16
2	76	16
3	180	16
4	897	15

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(abs x)

Compiler

Compiled 8 to 8 computations (0% saved)

series2.0ms (0.2%)

Memory

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

Counts

4 → 5

Calls

Call 1

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

Outputs
#s(approx (- (* x x) 1) #s(hole binary64 -1))
#s(approx (- (* x x) 1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (- (* x x) 1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))

Calls

3 calls:

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

rewrite129.0ms (13.2%)

Memory

-43.6MiB live, 72.4MiB allocated; 53ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	55
0	19	53
1	71	53
0	496	48

Stop Event

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

Counts

9 → 62

Calls

Call 1

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

Outputs
(*.f64 (+.f64 (fabs.f64 x) #s(literal 1 binary64)) (-.f64 (fabs.f64 x) #s(literal 1 binary64)))
(*.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (-.f64 (neg.f64 x) #s(literal 1 binary64)))
(*.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal -1 binary64)))
(*.f64 (-.f64 x #s(literal -1 binary64)) (-.f64 x #s(literal 1 binary64)))
(/.f64 (neg.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal -1 binary64))) (neg.f64 (fma.f64 x x #s(literal 1 binary64))))
(/.f64 (neg.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) #s(literal -1 binary64))) (neg.f64 (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))))
(/.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal -1 binary64)) (fma.f64 x x #s(literal 1 binary64)))
(/.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) #s(literal -1 binary64)) (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64))))
(fma.f64 (.f64 (fabs.f64 x) #s(literal 1 binary64)) (.f64 (fabs.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 (neg.f64 x) #s(literal 1 binary64)) (.f64 (neg.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 x #s(literal 1 binary64)) (.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) #s(literal -1 binary64))
(fma.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (*.f64 (fabs.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (fabs.f64 x) #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (*.f64 (neg.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (neg.f64 x) #s(literal -1 binary64))
(fma.f64 (*.f64 x x) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (*.f64 x x) #s(literal -1 binary64))
(fma.f64 x (*.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 x x #s(literal -1 binary64))
(expm1.f64 (fma.f64 (log.f64 x) #s(literal 2 binary64) #s(literal 0 binary64)))
(expm1.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(-.f64 (/.f64 (.f64 (.f64 (*.f64 x x) x) x) (fma.f64 x x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 x x #s(literal 1 binary64))))
(-.f64 (/.f64 (.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x)) (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 (.f64 (*.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))))
(-.f64 (*.f64 x x) #s(literal 1 binary64))
(+.f64 (*.f64 x x) #s(literal -1 binary64))
(.f64 (.f64 (fabs.f64 x) #s(literal 1 binary64)) (*.f64 (fabs.f64 x) #s(literal 1 binary64)))
(.f64 (.f64 (neg.f64 x) #s(literal 1 binary64)) (*.f64 (neg.f64 x) #s(literal 1 binary64)))
(.f64 (.f64 x #s(literal 1 binary64)) (*.f64 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 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(.f64 (fabs.f64 x) (.f64 (fabs.f64 x) #s(literal 1 binary64)))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(.f64 (neg.f64 x) (.f64 (neg.f64 x) #s(literal 1 binary64)))
(*.f64 (neg.f64 x) (neg.f64 x))
(.f64 (.f64 x x) #s(literal 1 binary64))
(.f64 #s(literal 1 binary64) (.f64 x x))
(.f64 x (.f64 x #s(literal 1 binary64)))
(*.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 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 x #s(literal 2 binary64))
(/.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(fabs.f64 (*.f64 x x))
(exp.f64 (fma.f64 (log.f64 x) #s(literal 2 binary64) #s(literal 0 binary64)))
(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))))
x
#s(literal 1 binary64)
#s(approx (- (* x x) 1) #s(literal -1 binary64))
#s(approx (- (* x x) 1) (fma.f64 x x #s(literal -1 binary64)))
#s(approx (* x x) (*.f64 x x))
#s(approx x x)
#s(approx (- (* x x) 1) (.f64 (.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) x) x))

eval5.0ms (0.5%)

Memory: 9.7MiB live, 9.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 274 to 136 computations (50.4% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	56	2	58
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	57	2	59

Accuracy

100.0%

Counts

59 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 9 to 9 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

4 → 5

Calls

Call 1

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

Outputs
#s(approx (- (* x x) 1) #s(hole binary64 -1))
#s(approx (- (* x x) 1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx x #s(hole binary64 x))
#s(approx (- (* x x) 1) #s(hole binary64 (pow x 2)))
#s(approx (- (* x x) 1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))

Calls

3 calls:

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

rewrite70.0ms (7.1%)

Memory

8.9MiB live, 53.4MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	60
0	18	52
1	78	52
0	615	52

Stop Event

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

Counts

9 → 48

Calls

Call 1

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

Outputs
#s(approx (- (* x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
(*.f64 (+.f64 (fabs.f64 x) #s(literal -1 binary64)) (-.f64 (fabs.f64 x) #s(literal -1 binary64)))
(*.f64 (+.f64 (neg.f64 x) #s(literal -1 binary64)) (-.f64 (neg.f64 x) #s(literal -1 binary64)))
(*.f64 (+.f64 (fabs.f64 x) #s(literal 1 binary64)) (-.f64 (fabs.f64 x) #s(literal 1 binary64)))
(*.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (-.f64 (neg.f64 x) #s(literal 1 binary64)))
(*.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal -1 binary64)))
(*.f64 (-.f64 x #s(literal -1 binary64)) (-.f64 x #s(literal 1 binary64)))
(/.f64 (-.f64 #s(literal 1 binary64) (.f64 (.f64 (.f64 x x) x) x)) (-.f64 #s(literal -1 binary64) (.f64 x x)))
(/.f64 (neg.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal -1 binary64))) (neg.f64 (fma.f64 x x #s(literal 1 binary64))))
(/.f64 (neg.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) #s(literal -1 binary64))) (neg.f64 (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))))
(/.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal -1 binary64)) (fma.f64 x x #s(literal 1 binary64)))
(/.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) #s(literal -1 binary64)) (+.f64 #s(literal 1 binary64) (-.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 (neg.f64 x) x))))
(/.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) #s(literal -1 binary64)) (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64))))
(fma.f64 (.f64 (fabs.f64 x) #s(literal -1 binary64)) (.f64 (fabs.f64 x) #s(literal -1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 (fabs.f64 x) #s(literal 1 binary64)) (.f64 (fabs.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 (neg.f64 x) #s(literal -1 binary64)) (.f64 (neg.f64 x) #s(literal -1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 (neg.f64 x) #s(literal 1 binary64)) (.f64 (neg.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 x #s(literal -1 binary64)) (.f64 x #s(literal -1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 x #s(literal 1 binary64)) (.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) #s(literal -1 binary64))
(fma.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)) #s(literal -1 binary64))
(fma.f64 (*.f64 (neg.f64 x) x) #s(literal -1 binary64) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (*.f64 (fabs.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (fabs.f64 x) #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (*.f64 (neg.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (neg.f64 x) #s(literal -1 binary64))
(fma.f64 (*.f64 x x) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (*.f64 x x) #s(literal -1 binary64))
(fma.f64 x (*.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 x x #s(literal -1 binary64))
(expm1.f64 (fma.f64 (log.f64 x) #s(literal 2 binary64) #s(literal 0 binary64)))
(expm1.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(-.f64 (/.f64 (.f64 (.f64 (*.f64 x x) x) x) (fma.f64 x x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 x x #s(literal 1 binary64))))
(-.f64 (/.f64 (.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x)) (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 (.f64 (*.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))))
(-.f64 (*.f64 x x) #s(literal 1 binary64))
(-.f64 #s(literal -1 binary64) (*.f64 (neg.f64 x) x))
(+.f64 (/.f64 (.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x)) (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))) (/.f64 #s(literal -1 binary64) (fma.f64 (.f64 (*.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))))
(+.f64 (*.f64 x x) #s(literal -1 binary64))
(+.f64 #s(literal -1 binary64) (*.f64 x x))
x
#s(approx (- (* x x) 1) #s(literal -1 binary64))
#s(approx (- (* x x) 1) (fma.f64 x x #s(literal -1 binary64)))
#s(approx x x)
#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) (*.f64 x x))) x) x))

eval4.0ms (0.4%)

Memory: 10.9MiB live, 10.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 229 to 104 computations (54.6% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

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

Accuracy

100.0%

Counts

45 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 15 to 15 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

3 → 5

Calls

Call 1

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

Outputs
#s(approx (- (* x x) 1) #s(hole binary64 -1))
#s(approx (- (* x x) 1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (- (* x x) 1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))

Calls

3 calls:

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

rewrite64.0ms (6.6%)

Memory

-24.0MiB live, 74.4MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	58
0	19	56
1	70	56
0	495	51

Stop Event

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

Counts

8 → 33

Calls

Call 1

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

Outputs
#s(approx (- (* x x) 1) (*.f64 x x))
(.f64 (.f64 (fabs.f64 x) #s(literal 1 binary64)) (*.f64 (fabs.f64 x) #s(literal 1 binary64)))
(.f64 (.f64 (neg.f64 x) #s(literal 1 binary64)) (*.f64 (neg.f64 x) #s(literal 1 binary64)))
(.f64 (.f64 x #s(literal 1 binary64)) (*.f64 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 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(.f64 (fabs.f64 x) (.f64 (fabs.f64 x) #s(literal 1 binary64)))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(.f64 (neg.f64 x) (.f64 (neg.f64 x) #s(literal 1 binary64)))
(*.f64 (neg.f64 x) (neg.f64 x))
(.f64 (.f64 x x) #s(literal 1 binary64))
(.f64 #s(literal 1 binary64) (.f64 x x))
(.f64 x (.f64 x #s(literal 1 binary64)))
(*.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 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 x #s(literal 2 binary64))
(/.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(fabs.f64 (*.f64 x x))
(exp.f64 (fma.f64 (log.f64 x) #s(literal 2 binary64) #s(literal 0 binary64)))
(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))))
x
#s(approx (- (* x x) 1) #s(literal -1 binary64))
#s(approx (- (* x x) 1) (fma.f64 x x #s(literal -1 binary64)))
#s(approx (* x x) (*.f64 x x))
#s(approx x x)
#s(approx (- (* x x) 1) (.f64 (.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) x) x))

eval3.0ms (0.3%)

Memory: 8.3MiB live, 8.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 137 to 87 computations (36.5% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

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

Accuracy

100.0%

Counts

32 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 29 to 26 computations (10.3% saved)

regimes8.0ms (0.8%)

Memory

-29.0MiB live, 14.7MiB allocated; 5ms collecting garbage

Counts

4 → 1

Calls

Call 1

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

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

Calls

3 calls:

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

Results

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

Compiler

Compiled 7 to 7 computations (0% saved)

regimes4.0ms (0.4%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

3 calls:

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

Results

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

Compiler

Compiled 7 to 7 computations (0% saved)

regimes3.0ms (0.3%)

Memory

8.8MiB live, 8.8MiB 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) #s(literal -1 binary64))

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

Calls

3 calls:

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

Results

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

Compiler

Compiled 7 to 7 computations (0% saved)

bsearch6.0ms (0.6%)

Memory

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

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
5.0ms	0.34498008249308554	3.209844473617946

Samples

2.0ms

96×

valid

Compiler

Compiled 80 to 92 computations (-15% saved)

Precisions

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

ival-mult!: 1.0ms (136.2% of total)

ival-sub!: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

derivations10.0ms (1%)

Memory

-33.2MiB live, 13.4MiB allocated; 3ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 14 to 12 computations (14.3% saved)

preprocess22.0ms (2.3%)

Memory: 6.7MiB live, 52.5MiB allocated; 4ms collecting garbage
Remove: (abs x)
Compiler: Compiled 62 to 56 computations (9.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample553.0ms (56.7%)

preprocess85.0ms (8.8%)

series2.0ms (0.2%)

rewrite129.0ms (13.2%)

eval5.0ms (0.5%)

prune2.0ms (0.2%)

series1.0ms (0.1%)

rewrite70.0ms (7.1%)

eval4.0ms (0.4%)

prune2.0ms (0.2%)

series1.0ms (0.1%)

rewrite64.0ms (6.6%)

eval3.0ms (0.3%)

prune2.0ms (0.2%)

regimes8.0ms (0.8%)

regimes4.0ms (0.4%)

regimes3.0ms (0.3%)

bsearch6.0ms (0.6%)

derivations10.0ms (1%)

preprocess22.0ms (2.3%)

end0.0ms (0%)

Profiling