Metrics for Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, C

start0.0ms (0%)

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

analyze20.0ms (2.7%)

Memory

-31.1MiB live, 12.6MiB allocated; 11ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
50%	50%	50%	0.1%	0%	0%	0%	3
50%	50%	50%	0.1%	0%	0%	0%	4
75%	74.9%	25%	0.1%	0%	0%	0%	5
75%	74.9%	25%	0.1%	0%	0%	0%	6
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	7
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	8
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	9
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	10
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	11
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	12

Compiler

Compiled 7 to 7 computations (0% saved)

sample516.0ms (69.9%)

Memory

35.9MiB live, 613.9MiB allocated; 153ms collecting garbage

Samples

295.0ms

8 256×

valid

Precisions

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

ival-div!: 58.0ms (56.9% of total)

ival-mult!: 42.0ms (41.2% of total)

adjust: 2.0ms (2% of total)

Bogosity

preprocess24.0ms (3.3%)

Memory

-25.2MiB live, 23.3MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	38	30
2	92	30
3	148	30
4	154	30

Stop Event

1×

saturated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(/.f64 x (*.f64 y #s(literal 3 binary64)))

Symmetry

(negabs x)

(negabs y)

Compiler

Compiled 10 to 10 computations (0% saved)

series6.0ms (0.8%)

Memory

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

Counts

5 → 4

Calls

Call 1

Inputs
(/.f64 x (*.f64 y #s(literal 3 binary64)))
x
(*.f64 y #s(literal 3 binary64))
y
#s(literal 3 binary64)

Outputs
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* y 3) #s(hole binary64 (* 3 y)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
2.0ms	y	@	inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	x	@	-inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	x	@	inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	y	@	-inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	y	@	0	((/ x (* y 3)) x (* y 3) y 3)

rewrite19.0ms (2.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	35
0	16	35
1	26	35
2	57	35
3	125	35
4	154	35
5	160	35
0	160	35

Stop Event

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

Counts

9 → 19

Calls

Call 1

Inputs
(/.f64 x (*.f64 y #s(literal 3 binary64)))
x
(*.f64 y #s(literal 3 binary64))
y
#s(literal 3 binary64)
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* y 3) #s(hole binary64 (* 3 y)))
#s(approx y #s(hole binary64 y))

Outputs
(/.f64 (/.f64 x #s(literal -3 binary64)) (neg.f64 y))
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 (/.f64 (neg.f64 x) y) #s(literal -3 binary64))
(/.f64 (neg.f64 x) (*.f64 #s(literal -3 binary64) y))
(/.f64 (/.f64 x y) #s(literal 3 binary64))
(/.f64 x (*.f64 #s(literal 3 binary64) y))
(neg.f64 (/.f64 x (*.f64 #s(literal -3 binary64) y)))
x
(*.f64 #s(literal -3 binary64) (neg.f64 y))
(*.f64 (neg.f64 y) #s(literal -3 binary64))
(*.f64 #s(literal 3 binary64) y)
(*.f64 y #s(literal 3 binary64))
(neg.f64 (*.f64 #s(literal -3 binary64) y))
y
#s(literal 3 binary64)
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx x x)
#s(approx (* y 3) (*.f64 #s(literal 3 binary64) y))
#s(approx y y)

eval7.0ms (0.9%)

Memory: -44.5MiB live, 1.7MiB allocated; 5ms collecting garbage
Compiler: Compiled 96 to 40 computations (58.3% saved)

prune3.0ms (0.4%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	12	3	15
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	12	4	16

Accuracy

100.0%

Counts

16 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
▶	99.7%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
✓	99.7%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
▶	99.5%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))

Compiler

Compiled 26 to 24 computations (7.7% saved)

series5.0ms (0.6%)

Memory

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

Counts

10 → 5

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(/.f64 x y)
x
y
#s(literal 1/3 binary64)
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x #s(literal 3 binary64))
#s(literal 3 binary64)
(/.f64 (/.f64 x y) #s(literal 3 binary64))

Outputs
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x y) #s(hole binary64 (/ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((/ x (* y 3)) (* (/ x y) 1/3) (/ x y) x y 1/3 (/ (/ x 3) y) (/ x 3) 3 (/ (/ x y) 3))
1.0ms	x	@	inf	((/ x (* y 3)) (* (/ x y) 1/3) (/ x y) x y 1/3 (/ (/ x 3) y) (/ x 3) 3 (/ (/ x y) 3))
1.0ms	y	@	-inf	((/ x (* y 3)) (* (/ x y) 1/3) (/ x y) x y 1/3 (/ (/ x 3) y) (/ x 3) 3 (/ (/ x y) 3))
1.0ms	x	@	0	((/ x (* y 3)) (* (/ x y) 1/3) (/ x y) x y 1/3 (/ (/ x 3) y) (/ x 3) 3 (/ (/ x y) 3))
1.0ms	y	@	inf	((/ x (* y 3)) (* (/ x y) 1/3) (/ x y) x y 1/3 (/ (/ x 3) y) (/ x 3) 3 (/ (/ x y) 3))

rewrite12.0ms (1.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	21	67
0	27	67
1	44	67
2	87	67
3	144	67
4	166	67
5	170	67
0	170	67

Stop Event

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

Counts

15 → 41

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(/.f64 x y)
x
y
#s(literal 1/3 binary64)
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x #s(literal 3 binary64))
#s(literal 3 binary64)
(/.f64 (/.f64 x y) #s(literal 3 binary64))
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x y) #s(hole binary64 (/ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx y #s(hole binary64 y))

Outputs
#s(approx (/ x (* y 3)) (*.f64 #s(literal 1/3 binary64) (/.f64 x y)))
(*.f64 (/.f64 #s(literal -1/3 binary64) y) (neg.f64 x))
(*.f64 #s(literal -1/3 binary64) (/.f64 (neg.f64 x) y))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(*.f64 (/.f64 (neg.f64 x) y) #s(literal -1/3 binary64))
(*.f64 (neg.f64 x) (/.f64 #s(literal -1/3 binary64) y))
(*.f64 #s(literal 1/3 binary64) (/.f64 x y))
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(*.f64 x (/.f64 #s(literal 1/3 binary64) y))
(/.f64 (*.f64 #s(literal -1/3 binary64) x) (neg.f64 y))
(/.f64 (*.f64 #s(literal 1/3 binary64) x) y)
(neg.f64 (*.f64 #s(literal -1/3 binary64) (/.f64 x y)))
(/.f64 (neg.f64 x) (neg.f64 y))
(/.f64 x y)
(neg.f64 (/.f64 (neg.f64 x) y))
x
y
#s(literal 1/3 binary64)
(/.f64 (/.f64 (neg.f64 x) y) #s(literal -3 binary64))
(/.f64 (/.f64 x #s(literal -3 binary64)) (neg.f64 y))
(/.f64 (neg.f64 x) (*.f64 #s(literal -3 binary64) y))
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 (/.f64 x y) #s(literal 3 binary64))
(/.f64 x (*.f64 #s(literal 3 binary64) y))
(neg.f64 (/.f64 x (*.f64 #s(literal -3 binary64) y)))
(/.f64 (neg.f64 x) #s(literal -3 binary64))
(/.f64 x #s(literal 3 binary64))
(neg.f64 (/.f64 x #s(literal -3 binary64)))
#s(literal 3 binary64)
(/.f64 (/.f64 (neg.f64 x) y) #s(literal -3 binary64))
(/.f64 (/.f64 x #s(literal -3 binary64)) (neg.f64 y))
(/.f64 (neg.f64 x) (*.f64 #s(literal -3 binary64) y))
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 (/.f64 x y) #s(literal 3 binary64))
(/.f64 x (*.f64 #s(literal 3 binary64) y))
(neg.f64 (/.f64 x (*.f64 #s(literal -3 binary64) y)))
#s(approx (/ x (* y 3)) (*.f64 #s(literal 1/3 binary64) (/.f64 x y)))
#s(approx (/ x y) (/.f64 x y))
#s(approx x x)
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
#s(approx y y)

eval3.0ms (0.3%)

Memory: 5.4MiB live, 5.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 295 to 81 computations (72.5% saved)

prune3.0ms (0.4%)

Memory

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

Pruning

6 alts after pruning (2 fresh and 4 done)

	Pruned	Kept	Total
New	29	2	31
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	29	6	35

Accuracy

100.0%

Counts

35 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.7%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
✓	99.7%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
▶	99.6%	(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
✓	99.7%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
✓	99.5%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
▶	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Compiler

Compiled 46 to 41 computations (10.9% saved)

series4.0ms (0.5%)

Memory

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

Counts

9 → 5

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(/.f64 #s(literal 1/3 binary64) y)
#s(literal 1/3 binary64)
y
x
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
(*.f64 #s(literal 1/3 binary64) x)

Outputs
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx (/ 1/3 y) #s(hole binary64 (/ 1/3 y)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((/ x (* y 3)) (* (/ 1/3 y) x) (/ 1/3 y) 1/3 y x (/ (/ x 3) y) (/ x 3) (* 1/3 x))
1.0ms	x	@	-inf	((/ x (* y 3)) (* (/ 1/3 y) x) (/ 1/3 y) 1/3 y x (/ (/ x 3) y) (/ x 3) (* 1/3 x))
1.0ms	y	@	-inf	((/ x (* y 3)) (* (/ 1/3 y) x) (/ 1/3 y) 1/3 y x (/ (/ x 3) y) (/ x 3) (* 1/3 x))
1.0ms	y	@	inf	((/ x (* y 3)) (* (/ 1/3 y) x) (/ 1/3 y) 1/3 y x (/ (/ x 3) y) (/ x 3) (* 1/3 x))
1.0ms	x	@	0	((/ x (* y 3)) (* (/ 1/3 y) x) (/ 1/3 y) 1/3 y x (/ (/ x 3) y) (/ x 3) (* 1/3 x))

rewrite11.0ms (1.5%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	72
0	25	72
1	44	72
2	92	72
3	187	72
4	200	72
5	200	72
0	200	72

Stop Event

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

Counts

14 → 34

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(/.f64 #s(literal 1/3 binary64) y)
#s(literal 1/3 binary64)
y
x
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
(*.f64 #s(literal 1/3 binary64) x)
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx (/ 1/3 y) #s(hole binary64 (/ 1/3 y)))
#s(approx y #s(hole binary64 y))

Outputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 #s(literal -1/3 binary64) y) (neg.f64 x))
(*.f64 (/.f64 (neg.f64 x) y) #s(literal -1/3 binary64))
(*.f64 #s(literal -1/3 binary64) (/.f64 (neg.f64 x) y))
(*.f64 (neg.f64 x) (/.f64 #s(literal -1/3 binary64) y))
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(*.f64 #s(literal 1/3 binary64) (/.f64 x y))
(*.f64 x (/.f64 #s(literal 1/3 binary64) y))
(/.f64 (*.f64 #s(literal -1/3 binary64) x) (neg.f64 y))
(/.f64 (*.f64 #s(literal 1/3 binary64) x) y)
(neg.f64 (*.f64 (/.f64 #s(literal -1/3 binary64) y) x))
(/.f64 #s(literal -1/3 binary64) (neg.f64 y))
(/.f64 #s(literal 1/3 binary64) y)
(neg.f64 (/.f64 #s(literal -1/3 binary64) y))
#s(literal 1/3 binary64)
y
x
(/.f64 (neg.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))) (neg.f64 y))
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
(neg.f64 (/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) (neg.f64 y)))
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
(neg.f64 (neg.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))))
(*.f64 #s(literal -1/3 binary64) (neg.f64 x))
(*.f64 (neg.f64 x) #s(literal -1/3 binary64))
(*.f64 #s(literal 1/3 binary64) x)
(*.f64 x #s(literal 1/3 binary64))
(neg.f64 (*.f64 #s(literal -1/3 binary64) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx x x)
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
(neg.f64 (neg.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))))
#s(approx (/ 1/3 y) (/.f64 #s(literal 1/3 binary64) y))
#s(approx y y)

eval7.0ms (1%)

Memory: -42.0MiB live, 4.8MiB allocated; 2ms collecting garbage
Compiler: Compiled 264 to 76 computations (71.2% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

6 alts after pruning (0 fresh and 6 done)

	Pruned	Kept	Total
New	23	0	23
Fresh	0	0	0
Picked	0	2	2
Done	0	4	4
Total	23	6	29

Accuracy

100.0%

Counts

29 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.7%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
✓	99.7%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
✓	99.6%	(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
✓	99.7%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
✓	99.5%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
✓	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Compiler

Compiled 46 to 41 computations (10.9% saved)

regimes39.0ms (5.3%)

Memory

2.7MiB live, 50.0MiB allocated; 1ms collecting garbage

Accuracy

Total -0.1b remaining (-19%)

Threshold costs -0.1b (-19%)

Counts

2 → 1

4 → 1

6 → 1

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))

Outputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Call 2

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(/.f64 x (*.f64 y #s(literal 3 binary64)))
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)

Outputs
(/.f64 x (*.f64 y #s(literal 3 binary64)))

Call 3

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(/.f64 x (*.f64 y #s(literal 3 binary64)))
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 (/.f64 x y) #s(literal 3 binary64))

Outputs
(/.f64 (/.f64 x #s(literal 3 binary64)) y)

Calls

12 calls:

19.0ms	y
2.0ms	x
2.0ms	y
2.0ms	(*.f64 y #s(literal 3 binary64))
2.0ms	(/.f64 x (*.f64 y #s(literal 3 binary64)))

Results

Accuracy	Segments	Branch
99.6%	1	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
99.6%	1	`(*.f64 y #s(literal 3 binary64))`
99.6%	1	`y`
99.6%	1	`x`
99.7%	1	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
99.7%	1	`(*.f64 y #s(literal 3 binary64))`
99.7%	1	`y`
99.7%	1	`x`
99.7%	1	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
99.7%	1	`(*.f64 y #s(literal 3 binary64))`
99.7%	1	`y`
99.7%	1	`x`

Compiler

Compiled 76 to 61 computations (19.7% saved)

derivations4.0ms (0.6%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 21 to 14 computations (33.3% saved)

preprocess54.0ms (7.3%)

Memory

13.1MiB live, 62.0MiB allocated; 7ms collecting garbage

Remove

(negabs y)

(negabs x)

Compiler

Compiled 110 to 95 computations (13.6% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze20.0ms (2.7%)

sample516.0ms (69.9%)

preprocess24.0ms (3.3%)

series6.0ms (0.8%)

rewrite19.0ms (2.6%)

eval7.0ms (0.9%)

prune3.0ms (0.4%)

series5.0ms (0.6%)

rewrite12.0ms (1.6%)

eval3.0ms (0.3%)

prune3.0ms (0.4%)

series4.0ms (0.5%)

rewrite11.0ms (1.5%)

eval7.0ms (1%)

prune2.0ms (0.3%)

regimes39.0ms (5.3%)

derivations4.0ms (0.6%)

preprocess54.0ms (7.3%)

end0.0ms (0%)

Profiling