Metrics for Main:bigenough1 from B

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 5 computations (28.6% saved)

sample524.0ms (46.8%)

Memory

6.1MiB live, 446.1MiB allocated; 139ms collecting garbage

Samples

293.0ms

8 256×

valid

Precisions

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

ival-mult!: 48.0ms (70.3% of total)

ival-add!: 18.0ms (26.4% of total)

adjust: 1.0ms (1.5% of total)

Bogosity

preprocess156.0ms (13.9%)

Memory

-30.3MiB live, 60.5MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	7	18
1	38	15
2	132	15
3	209	15
4	484	15
5	3288	15

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(+.f64 x (*.f64 x x))

Compiler

Compiled 6 to 6 computations (0% saved)

series2.0ms (0.2%)

Memory

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

Counts

3 → 4

Calls

Call 1

Inputs
(+.f64 x (*.f64 x x))
x
(*.f64 x x)

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

Calls

3 calls:

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

rewrite63.0ms (5.6%)

Memory

45.5MiB live, 88.2MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	49
0	18	49
1	99	47
0	836	41
1	3126	41

Stop Event

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

Counts

7 → 57

Calls

Call 1

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

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

eval19.0ms (1.7%)

Memory: -28.2MiB live, 23.9MiB allocated; 15ms collecting garbage
Compiler: Compiled 223 to 108 computations (51.6% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	52	2	54
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	53	2	55

Accuracy

100.0%

Counts

55 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 x x x)
▶	51.9%	#s(approx (+ x (* x x)) x)

Compiler

Compiled 6 to 6 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

3 → 4

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)
x
(fma.f64 x x x)

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

Calls

3 calls:

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

rewrite68.0ms (6.1%)

Memory

-5.1MiB live, 84.9MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	54
0	17	48
1	106	46
0	909	45
1	3806	45

Stop Event

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

Counts

7 → 48

Calls

Call 1

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

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

eval4.0ms (0.3%)

Memory: 15.2MiB live, 15.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 202 to 67 computations (66.8% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	43	1	44
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	43	3	46

Accuracy

100.0%

Counts

46 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x x x)
▶	50.6%	#s(approx (+ x (* x x)) (*.f64 x x))
✓	51.9%	#s(approx (+ x (* x x)) x)

Compiler

Compiled 11 to 11 computations (0% saved)

series4.0ms (0.4%)

Memory

-42.2MiB live, 4.5MiB allocated; 3ms collecting garbage

Counts

3 → 4

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) (*.f64 x x))
(*.f64 x x)
x

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

Calls

3 calls:

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

rewrite105.0ms (9.3%)

Memory

26.7MiB live, 79.4MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	53
0	18	53
1	99	51
0	835	45
1	3126	45

Stop Event

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

Counts

7 → 34

Calls

Call 1

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

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

eval3.0ms (0.2%)

Memory: 4.3MiB live, 4.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 139 to 81 computations (41.7% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

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

Accuracy

100.0%

Counts

33 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x x x)
✓	50.6%	#s(approx (+ x (* x x)) (*.f64 x x))
✓	51.9%	#s(approx (+ x (* x x)) x)

Compiler

Compiled 22 to 19 computations (13.6% saved)

regimes4.0ms (0.3%)

Memory

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

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)
#s(approx (+ x (* x x)) (*.f64 x x))
(fma.f64 x x x)
(+.f64 x (*.f64 x x))

Outputs
(fma.f64 x x x)

Calls

2 calls:

2.0ms	x
2.0ms	(+.f64 x (*.f64 x x))

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 x (*.f64 x x))`
100.0%	1	`x`

Compiler

Compiled 4 to 4 computations (0% saved)

regimes51.0ms (4.5%)

Memory

-35.0MiB live, 11.3MiB allocated; 3ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)
#s(approx (+ x (* x x)) (*.f64 x x))

Outputs
#s(approx (+ x (* x x)) x)
#s(approx (+ x (* x x)) (*.f64 x x))

Calls

2 calls:

49.0ms	x
1.0ms	(+.f64 x (*.f64 x x))

Results

Accuracy	Segments	Branch
97.9%	2	`(+.f64 x (*.f64 x x))`
97.9%	3	`x`

Compiler

Compiled 4 to 4 computations (0% saved)

regimes2.0ms (0.2%)

Memory

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

Outputs
#s(approx (+ x (* x x)) x)

Calls

2 calls:

1.0ms	x
1.0ms	(+.f64 x (*.f64 x x))

Results

Accuracy	Segments	Branch
51.9%	1	`x`
51.9%	1	`(+.f64 x (*.f64 x x))`

Compiler

Compiled 4 to 4 computations (0% 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.07388935418330655	28506339.26719386

Compiler

Compiled 6 to 7 computations (-16.7% saved)

derivations14.0ms (1.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 14 to 11 computations (21.4% saved)

preprocess95.0ms (8.5%)

Memory: 4.2MiB live, 49.2MiB allocated; 4ms collecting garbage
Compiler: Compiled 17 to 14 computations (17.6% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample524.0ms (46.8%)

preprocess156.0ms (13.9%)

series2.0ms (0.2%)

rewrite63.0ms (5.6%)

eval19.0ms (1.7%)

prune2.0ms (0.2%)

series1.0ms (0.1%)

rewrite68.0ms (6.1%)

eval4.0ms (0.3%)

prune2.0ms (0.2%)

series4.0ms (0.4%)

rewrite105.0ms (9.3%)

eval3.0ms (0.2%)

prune2.0ms (0.2%)

regimes4.0ms (0.3%)

regimes51.0ms (4.5%)

regimes2.0ms (0.2%)

bsearch0.0ms (0%)

derivations14.0ms (1.3%)

preprocess95.0ms (8.5%)

end0.0ms (0%)

Profiling