Metrics for expm1 (example 3.7)

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	50%	50%	0%	0%	0%	0
100%	50%	0%	50%	0%	0%	0%	1

Compiler

Compiled 9 to 6 computations (33.3% saved)

sample337.0ms (40.8%)

Memory

33.8MiB live, 408.0MiB allocated; 89ms collecting garbage

Samples

183.0ms

8 256×

valid

Precisions

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

ival-expm1: 58.0ms (98.1% of total)

adjust: 2.0ms (3.4% of total)

Bogosity

preprocess36.0ms (4.3%)

Memory

-11.2MiB live, 36.3MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	14
1	29	14
2	94	14
3	554	14

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 8 computations (0% saved)

series1.0ms (0.2%)

Memory

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

Counts

4 → 10

Calls

Call 1

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

Outputs
#s(approx (- (exp x) 1) #s(hole binary64 x))
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* 1/2 x)))))
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* 1/6 x)))))))
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* x (+ 1/6 (* 1/24 x)))))))))
#s(approx (exp x) #s(hole binary64 1))
#s(approx (exp x) #s(hole binary64 (+ 1 x)))
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* 1/2 x))))))
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))))))
#s(approx (- (exp x) 1) #s(hole binary64 (- (exp x) 1)))
#s(approx (exp x) #s(hole binary64 (exp x)))

Calls

3 calls:

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

rewrite231.0ms (28%)

Memory

0.8MiB live, 183.0MiB allocated; 31ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	37	114
0	39	114
1	248	114
2	2212	114
0	8089	89
1	32787	89

Stop Event

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

Counts

14 → 56

Calls

Call 1

Inputs
(-.f64 (exp.f64 x) #s(literal 1 binary64))
(exp.f64 x)
x
#s(literal 1 binary64)
#s(approx (- (exp x) 1) #s(hole binary64 x))
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* 1/2 x)))))
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* 1/6 x)))))))
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* x (+ 1/6 (* 1/24 x)))))))))
#s(approx (exp x) #s(hole binary64 1))
#s(approx (exp x) #s(hole binary64 (+ 1 x)))
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* 1/2 x))))))
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))))))
#s(approx (- (exp x) 1) #s(hole binary64 (- (exp x) 1)))
#s(approx (exp x) #s(hole binary64 (exp x)))

Outputs
(neg.f64 (neg.f64 (expm1.f64 x)))
(fma.f64 (sqrt.f64 (exp.f64 x)) (sqrt.f64 (exp.f64 x)) #s(literal -1 binary64))
(fma.f64 (exp.f64 x) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (exp.f64 x) #s(literal -1 binary64))
(expm1.f64 (+.f64 (+.f64 x #s(literal 0 binary64)) #s(literal 0 binary64)))
(expm1.f64 (+.f64 #s(literal 0 binary64) (+.f64 x #s(literal 0 binary64))))
(expm1.f64 (/.f64 (+.f64 x x) #s(literal 2 binary64)))
(expm1.f64 (/.f64 (*.f64 x #s(literal 2 binary64)) #s(literal 2 binary64)))
(expm1.f64 (+.f64 #s(literal 0 binary64) x))
(expm1.f64 (+.f64 x #s(literal 0 binary64)))
(expm1.f64 x)
(-.f64 (exp.f64 x) #s(literal 1 binary64))
(+.f64 #s(literal -1 binary64) (exp.f64 x))
(+.f64 (cosh.f64 x) (+.f64 (sinh.f64 x) #s(literal -1 binary64)))
(+.f64 (cosh.f64 x) (-.f64 (sinh.f64 x) #s(literal 1 binary64)))
(+.f64 (exp.f64 x) #s(literal -1 binary64))
(*.f64 (sqrt.f64 (exp.f64 x)) (sqrt.f64 (exp.f64 x)))
(*.f64 (exp.f64 x) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (exp.f64 x))
(pow.f64 (exp.f64 #s(literal 1 binary64)) x)
(pow.f64 (exp.f64 (+.f64 x x)) #s(literal 1/2 binary64))
(pow.f64 (exp.f64 x) #s(literal 1 binary64))
(/.f64 (fma.f64 #s(literal 2 binary64) (sinh.f64 x) (*.f64 #s(literal 2 binary64) (cosh.f64 x))) #s(literal 2 binary64))
(/.f64 (fma.f64 #s(literal 2 binary64) (cosh.f64 x) (*.f64 #s(literal 2 binary64) (sinh.f64 x))) #s(literal 2 binary64))
(/.f64 (fma.f64 (.f64 #s(literal 2 binary64) (sinh.f64 x)) #s(literal 2 binary64) (.f64 #s(literal 2 binary64) (*.f64 #s(literal 2 binary64) (cosh.f64 x)))) #s(literal 4 binary64))
(/.f64 (fma.f64 (.f64 #s(literal 2 binary64) (cosh.f64 x)) #s(literal 2 binary64) (.f64 #s(literal 2 binary64) (*.f64 #s(literal 2 binary64) (sinh.f64 x)))) #s(literal 4 binary64))
(sqrt.f64 (exp.f64 (+.f64 x x)))
(-.f64 (cosh.f64 x) (sinh.f64 (neg.f64 x)))
(fabs.f64 (-.f64 (sinh.f64 (neg.f64 x)) (cosh.f64 x)))
(fabs.f64 (neg.f64 (neg.f64 (exp.f64 x))))
(fabs.f64 (*.f64 #s(literal 1 binary64) (neg.f64 (exp.f64 x))))
(fabs.f64 (*.f64 (neg.f64 (exp.f64 x)) #s(literal 1 binary64)))
(fabs.f64 (neg.f64 (exp.f64 x)))
(fabs.f64 (exp.f64 x))
(exp.f64 (+.f64 (+.f64 x #s(literal 0 binary64)) #s(literal 0 binary64)))
(exp.f64 (+.f64 #s(literal 0 binary64) (+.f64 x #s(literal 0 binary64))))
(exp.f64 (/.f64 (+.f64 x x) #s(literal 2 binary64)))
(exp.f64 (/.f64 (*.f64 x #s(literal 2 binary64)) #s(literal 2 binary64)))
(exp.f64 (+.f64 #s(literal 0 binary64) x))
(exp.f64 (+.f64 x #s(literal 0 binary64)))
(exp.f64 x)
(+.f64 (cosh.f64 (+.f64 x #s(literal 0 binary64))) (sinh.f64 (+.f64 x #s(literal 0 binary64))))
(+.f64 (sinh.f64 x) (cosh.f64 x))
(+.f64 (cosh.f64 x) (sinh.f64 x))
x
#s(literal 1 binary64)
#s(approx (- (exp x) 1) x)
#s(approx (- (exp x) 1) (*.f64 (fma.f64 #s(literal 1/2 binary64) x #s(literal 1 binary64)) x))
#s(approx (- (exp x) 1) (*.f64 (fma.f64 (fma.f64 #s(literal 1/6 binary64) x #s(literal 1/2 binary64)) x #s(literal 1 binary64)) x))
#s(approx (- (exp x) 1) (*.f64 (fma.f64 (fma.f64 (fma.f64 #s(literal 1/24 binary64) x #s(literal 1/6 binary64)) x #s(literal 1/2 binary64)) x #s(literal 1 binary64)) x))
#s(approx (exp x) #s(literal 1 binary64))
#s(approx (exp x) (-.f64 x #s(literal -1 binary64)))
#s(approx (exp x) (fma.f64 (fma.f64 #s(literal 1/2 binary64) x #s(literal 1 binary64)) x #s(literal 1 binary64)))
#s(approx (exp x) (fma.f64 (fma.f64 (fma.f64 #s(literal 1/6 binary64) x #s(literal 1/2 binary64)) x #s(literal 1 binary64)) x #s(literal 1 binary64)))
#s(approx (- (exp x) 1) (expm1.f64 x))
#s(approx (exp x) (exp.f64 x))

eval5.0ms (0.6%)

Memory: 8.5MiB live, 8.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 221 to 142 computations (35.7% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	49	3	52
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	50	3	53

Accuracy

100.0%

Counts

53 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	7.5%	(-.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal 1 binary64))
▶	100.0%	(expm1.f64 x)
▶	98.0%	#s(approx (- (exp x) 1) x)

Compiler

Compiled 14 to 14 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

8 → 11

Calls

Call 1

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

Outputs
#s(approx (- (exp x) 1) #s(hole binary64 x))
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* 1/2 x)))))
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* 1/6 x)))))))
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* x (+ 1/6 (* 1/24 x)))))))))
#s(approx (exp x) #s(hole binary64 1))
#s(approx (exp x) #s(hole binary64 (+ 1 x)))
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* 1/2 x))))))
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))))))
#s(approx (- (exp x) 1) #s(hole binary64 (- (exp x) 1)))
#s(approx (exp x) #s(hole binary64 (exp x)))
#s(approx (- x -1) #s(hole binary64 (* x (+ 1 (/ 1 x)))))

Calls

3 calls:

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

Time

Variable

Point

Expression

0.0ms

-inf

((- (exp x) 1) x (- (exp x) 1) (- (exp x) 1) (exp x) (- x -1) -1 1)

0.0ms

inf

((- (exp x) 1) x (- (exp x) 1) (- (exp x) 1) (exp x) (- x -1) -1 1)

0.0ms

((- (exp x) 1) x (- (exp x) 1) (- (exp x) 1) (exp x) (- x -1) -1 1)

rewrite97.0ms (11.8%)

Memory

-15.0MiB live, 75.5MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	45	131
0	47	131
1	304	127
0	2754	116
1	7911	116

Stop Event

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

Counts

19 → 52

Calls

Call 1

Inputs
#s(approx (- (exp x) 1) x)
x
(expm1.f64 x)
(-.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal 1 binary64))
#s(approx (exp x) (-.f64 x #s(literal -1 binary64)))
(-.f64 x #s(literal -1 binary64))
#s(literal -1 binary64)
#s(literal 1 binary64)
#s(approx (- (exp x) 1) #s(hole binary64 x))
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* 1/2 x)))))
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* 1/6 x)))))))
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* x (+ 1/6 (* 1/24 x)))))))))
#s(approx (exp x) #s(hole binary64 1))
#s(approx (exp x) #s(hole binary64 (+ 1 x)))
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* 1/2 x))))))
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))))))
#s(approx (- (exp x) 1) #s(hole binary64 (- (exp x) 1)))
#s(approx (exp x) #s(hole binary64 (exp x)))
#s(approx (- x -1) #s(hole binary64 (* x (+ 1 (/ 1 x)))))

Outputs
#s(approx (- (exp x) 1) x)
x
(neg.f64 (neg.f64 (expm1.f64 x)))
(fma.f64 (*.f64 (exp.f64 x) #s(literal -1 binary64)) #s(literal -1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (exp.f64 x) #s(literal -1 binary64))
(fma.f64 (exp.f64 x) #s(literal 1 binary64) #s(literal -1 binary64))
(expm1.f64 (+.f64 x #s(literal 0 binary64)))
(expm1.f64 x)
(-.f64 (exp.f64 x) #s(literal 1 binary64))
(+.f64 (cosh.f64 x) (+.f64 (sinh.f64 x) #s(literal -1 binary64)))
(+.f64 (cosh.f64 x) (-.f64 (sinh.f64 x) #s(literal 1 binary64)))
(+.f64 #s(literal -1 binary64) (exp.f64 x))
(+.f64 (exp.f64 x) #s(literal -1 binary64))
(neg.f64 (-.f64 #s(literal 1 binary64) #s(approx (exp x) (-.f64 x #s(literal -1 binary64)))))
(fma.f64 (*.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal -1 binary64)) #s(literal -1 binary64) #s(literal -1 binary64))
(fma.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal -1 binary64))
(-.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal 1 binary64))
(+.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal -1 binary64))
(+.f64 #s(literal -1 binary64) #s(approx (exp x) (-.f64 x #s(literal -1 binary64))))
(.f64 (.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal -1 binary64)) #s(literal -1 binary64))
(*.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) #s(approx (exp x) (-.f64 x #s(literal -1 binary64))))
#s(approx (exp x) (-.f64 x #s(literal -1 binary64)))
(neg.f64 (*.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal -1 binary64)))
(*.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) x)
(*.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))
(neg.f64 (-.f64 (neg.f64 x) #s(literal 1 binary64)))
(neg.f64 (-.f64 #s(literal -1 binary64) x))
(-.f64 #s(literal 1 binary64) (neg.f64 x))
(-.f64 x (*.f64 (neg.f64 x) (/.f64 #s(literal 1 binary64) x)))
(-.f64 x (*.f64 (/.f64 #s(literal -1 binary64) x) x))
(-.f64 x #s(literal -1 binary64))
(+.f64 #s(literal 1 binary64) x)
(+.f64 x #s(literal 1 binary64))
#s(literal -1 binary64)
#s(literal 1 binary64)
#s(approx (- (exp x) 1) x)
#s(approx (- (exp x) 1) (*.f64 (fma.f64 #s(literal 1/2 binary64) x #s(literal 1 binary64)) x))
#s(approx (- (exp x) 1) (*.f64 (fma.f64 (fma.f64 #s(literal 1/6 binary64) x #s(literal 1/2 binary64)) x #s(literal 1 binary64)) x))
#s(approx (- (exp x) 1) (*.f64 (fma.f64 (fma.f64 (fma.f64 #s(literal 1/24 binary64) x #s(literal 1/6 binary64)) x #s(literal 1/2 binary64)) x #s(literal 1 binary64)) x))
#s(approx (exp x) #s(literal 1 binary64))
(.f64 (.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal -1 binary64)) #s(literal -1 binary64))
(*.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) #s(approx (exp x) (-.f64 x #s(literal -1 binary64))))
#s(approx (exp x) (-.f64 x #s(literal -1 binary64)))
(neg.f64 (*.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal -1 binary64)))
#s(approx (exp x) (fma.f64 (fma.f64 #s(literal 1/2 binary64) x #s(literal 1 binary64)) x #s(literal 1 binary64)))
#s(approx (exp x) (fma.f64 (fma.f64 (fma.f64 #s(literal 1/6 binary64) x #s(literal 1/2 binary64)) x #s(literal 1 binary64)) x #s(literal 1 binary64)))
#s(approx (- (exp x) 1) (expm1.f64 x))
#s(approx (exp x) (exp.f64 x))
#s(approx (- x -1) (-.f64 x #s(literal -1 binary64)))

eval4.0ms (0.4%)

Memory: 6.3MiB live, 6.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 169 to 110 computations (34.9% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	38	0	38
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	38	3	41

Accuracy

100.0%

Counts

41 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	7.5%	(-.f64 #s(approx (exp x) (-.f64 x #s(literal -1 binary64))) #s(literal 1 binary64))
✓	100.0%	(expm1.f64 x)
✓	98.0%	#s(approx (- (exp x) 1) x)

Compiler

Compiled 28 to 27 computations (3.6% saved)

regimes4.0ms (0.5%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

Outputs
(expm1.f64 x)

Calls

3 calls:

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

Results

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

Compiler

Compiled 7 to 7 computations (0% saved)

regimes3.0ms (0.4%)

Memory

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

Accuracy

Total -57.9b remaining (-4468.2%)

Threshold costs -57.9b (-4468.2%)

Counts

2 → 1

Calls

Call 1

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

Outputs
#s(approx (- (exp x) 1) x)

Calls

3 calls:

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

Results

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

Compiler

Compiled 7 to 7 computations (0% saved)

derivations67.0ms (8.1%)

Memory

0.6MiB live, 46.2MiB allocated; 4ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 6 to 6 computations (0% saved)

preprocess36.0ms (4.3%)

Memory: -22.1MiB live, 27.9MiB allocated; 43ms collecting garbage
Compiler: Compiled 12 to 12 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample337.0ms (40.8%)

preprocess36.0ms (4.3%)

series1.0ms (0.2%)

rewrite231.0ms (28%)

eval5.0ms (0.6%)

prune2.0ms (0.2%)

series1.0ms (0.1%)

rewrite97.0ms (11.8%)

eval4.0ms (0.4%)

prune2.0ms (0.2%)

regimes4.0ms (0.5%)

regimes3.0ms (0.4%)

derivations67.0ms (8.1%)

preprocess36.0ms (4.3%)

end0.0ms (0%)

Profiling