Metrics for Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, F

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

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

sample573.0ms (44%)

Memory

31.5MiB live, 679.4MiB allocated; 124ms collecting garbage

Samples

329.0ms

8 256×

valid

Precisions

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

ival-div: 67.0ms (45.5% of total)

ival-add: 67.0ms (45.5% of total)

exact: 8.0ms (5.4% of total)

ival-assert: 3.0ms (2% of total)

adjust: 2.0ms (1.4% of total)

Bogosity

explain76.0ms (5.9%)

Memory

-6.4MiB live, 94.3MiB allocated; 36ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`#s(literal 1 binary64)`
-	-	`#s(literal 3 binary64)`
-	-	`(/.f64 #s(literal 1 binary64) #s(literal 3 binary64))`
-	-	`(+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

22.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-div: 4.0ms (51.5% of total)

ival-add: 2.0ms (25.7% of total)

exact: 1.0ms (12.9% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess337.0ms (25.9%)

Memory

-36.9MiB live, 211.5MiB allocated; 45ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	12
1	17	10
2	29	10
3	42	10
4	109	10
5	630	9
6	5765	9
0	5	3
0	8	3
1	11	3
2	14	3
3	22	3
4	48	3
5	184	3
6	1427	3
7	4378	3
0	8048	3

Stop Event

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

Calls

Call 1

Inputs
(+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))

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

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))

Compiler

Compiled 5 to 5 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

5 → 5

Calls

Call 1

Inputs
(+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))
x
(/.f64 #s(literal 1 binary64) #s(literal 3 binary64))
#s(literal 1 binary64)
#s(literal 3 binary64)

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

Calls

3 calls:

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

rewrite68.0ms (5.2%)

Memory

10.1MiB live, 56.2MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	40
0	20	38
1	78	38
0	497	37

Stop Event

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

Counts

10 → 24

Calls

Call 1

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

Outputs
(/.f64 (neg.f64 (fma.f64 x x #s(literal -1/9 binary64))) (neg.f64 (-.f64 x #s(literal 1/3 binary64))))
(/.f64 (neg.f64 (-.f64 #s(literal 1/9 binary64) (*.f64 x x))) (neg.f64 (-.f64 #s(literal 1/3 binary64) x)))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1/27 binary64))) (neg.f64 (fma.f64 x x (-.f64 #s(literal 1/9 binary64) (*.f64 #s(literal 1/3 binary64) x)))))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1/27 binary64))) (neg.f64 (fma.f64 x (-.f64 x #s(literal 1/3 binary64)) #s(literal 1/9 binary64))))
(/.f64 (fma.f64 x x #s(literal -1/9 binary64)) (-.f64 x #s(literal 1/3 binary64)))
(/.f64 (-.f64 #s(literal 1/9 binary64) (*.f64 x x)) (-.f64 #s(literal 1/3 binary64) x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1/27 binary64)) (fma.f64 x x (-.f64 #s(literal 1/9 binary64) (*.f64 #s(literal 1/3 binary64) x))))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1/27 binary64)) (fma.f64 x (-.f64 x #s(literal 1/3 binary64)) #s(literal 1/9 binary64)))
(-.f64 (/.f64 (*.f64 x x) (-.f64 x #s(literal 1/3 binary64))) (/.f64 #s(literal 1/9 binary64) (-.f64 x #s(literal 1/3 binary64))))
(-.f64 (/.f64 #s(literal 1/9 binary64) (-.f64 #s(literal 1/3 binary64) x)) (/.f64 (*.f64 x x) (-.f64 #s(literal 1/3 binary64) x)))
(-.f64 x #s(literal -1/3 binary64))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x (-.f64 #s(literal 1/9 binary64) (.f64 #s(literal 1/3 binary64) x)))) (/.f64 #s(literal 1/27 binary64) (fma.f64 x x (-.f64 #s(literal 1/9 binary64) (.f64 #s(literal 1/3 binary64) x)))))
(+.f64 (/.f64 #s(literal 1/27 binary64) (fma.f64 x (-.f64 x #s(literal 1/3 binary64)) #s(literal 1/9 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x (-.f64 x #s(literal 1/3 binary64)) #s(literal 1/9 binary64))))
(+.f64 #s(literal 1/3 binary64) x)
(+.f64 x #s(literal 1/3 binary64))
x
#s(literal 1/3 binary64)
#s(literal 1 binary64)
#s(literal 3 binary64)
#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))
#s(approx (+ x (/ 1 3)) (-.f64 x #s(literal -1/3 binary64)))
#s(approx x x)
#s(approx (+ x (/ 1 3)) x)
#s(approx (+ x (/ 1 3)) (fma.f64 (/.f64 #s(literal 1/3 binary64) x) x x))

eval2.0ms (0.2%)

Memory: 1.8MiB live, 1.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 231 to 63 computations (72.7% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	21	3	24
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	22	3	25

Accuracy

100.0%

Counts

25 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 x #s(literal -1/3 binary64))
▶	51.0%	#s(approx (+ x (/ 1 3)) x)
▶	50.8%	#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))

Compiler

Compiled 17 to 16 computations (5.9% saved)

series1.0ms (0.1%)

Memory

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

Counts

6 → 9

Calls

Call 1

Inputs
#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))
#s(literal 1/3 binary64)
#s(approx (+ x (/ 1 3)) x)
x
(-.f64 x #s(literal -1/3 binary64))
#s(literal -1/3 binary64)

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

Calls

3 calls:

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

rewrite70.0ms (5.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	79
0	23	75
1	91	75
0	581	73

Stop Event

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

Counts

15 → 32

Calls

Call 1

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

Outputs
#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))
#s(literal 1/3 binary64)
#s(approx (+ x (/ 1 3)) x)
x
(/.f64 (neg.f64 (-.f64 #s(literal 1/9 binary64) (*.f64 x x))) (neg.f64 (-.f64 #s(literal 1/3 binary64) x)))
(/.f64 (neg.f64 (+.f64 #s(literal 1/27 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x (-.f64 x #s(literal 1/3 binary64)) #s(literal 1/9 binary64))))
(/.f64 (neg.f64 (+.f64 #s(literal 1/27 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x (-.f64 #s(literal 1/9 binary64) (*.f64 #s(literal 1/3 binary64) x)))))
(/.f64 (neg.f64 (fma.f64 x x #s(literal -1/9 binary64))) (neg.f64 (-.f64 x #s(literal 1/3 binary64))))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal -1/27 binary64))) (neg.f64 (fma.f64 x x (fma.f64 #s(literal -1/3 binary64) x #s(literal 1/9 binary64)))))
(/.f64 (-.f64 #s(literal 1/9 binary64) (*.f64 x x)) (-.f64 #s(literal 1/3 binary64) x))
(/.f64 (fma.f64 x x #s(literal -1/9 binary64)) (-.f64 x #s(literal 1/3 binary64)))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal -1/27 binary64)) (fma.f64 x x (fma.f64 #s(literal -1/3 binary64) x #s(literal 1/9 binary64))))
(/.f64 (+.f64 #s(literal 1/27 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x (-.f64 x #s(literal 1/3 binary64)) #s(literal 1/9 binary64)))
(/.f64 (+.f64 #s(literal 1/27 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x (-.f64 #s(literal 1/9 binary64) (*.f64 #s(literal 1/3 binary64) x))))
(-.f64 (/.f64 #s(literal 1/9 binary64) (-.f64 #s(literal 1/3 binary64) x)) (/.f64 (*.f64 x x) (-.f64 #s(literal 1/3 binary64) x)))
(-.f64 (/.f64 (*.f64 x x) (-.f64 x #s(literal 1/3 binary64))) (/.f64 #s(literal 1/9 binary64) (-.f64 x #s(literal 1/3 binary64))))
(-.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x (fma.f64 #s(literal -1/3 binary64) x #s(literal 1/9 binary64)))) (/.f64 #s(literal -1/27 binary64) (fma.f64 x x (fma.f64 #s(literal -1/3 binary64) x #s(literal 1/9 binary64)))))
(-.f64 x #s(literal -1/3 binary64))
(+.f64 (/.f64 #s(literal 1/27 binary64) (fma.f64 x (-.f64 x #s(literal 1/3 binary64)) #s(literal 1/9 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x (-.f64 x #s(literal 1/3 binary64)) #s(literal 1/9 binary64))))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x (-.f64 #s(literal 1/9 binary64) (.f64 #s(literal 1/3 binary64) x)))) (/.f64 #s(literal 1/27 binary64) (fma.f64 x x (-.f64 #s(literal 1/9 binary64) (.f64 #s(literal 1/3 binary64) x)))))
(+.f64 #s(literal 1/3 binary64) x)
(+.f64 x #s(literal 1/3 binary64))
#s(literal -1/3 binary64)
#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))
#s(approx (+ x (/ 1 3)) (-.f64 x #s(literal -1/3 binary64)))
#s(approx x x)
#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))
#s(approx (+ x (/ 1 3)) (-.f64 x #s(literal -1/3 binary64)))
#s(approx (+ x (/ 1 3)) x)
#s(approx (+ x (/ 1 3)) (fma.f64 (/.f64 #s(literal 1/3 binary64) x) x x))
#s(approx (+ x (/ 1 3)) x)
#s(approx (+ x (/ 1 3)) (fma.f64 (/.f64 #s(literal 1/3 binary64) x) x x))

eval3.0ms (0.2%)

Memory: 3.8MiB live, 3.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 289 to 72 computations (75.1% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	28	0	28
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	28	3	31

Accuracy

100.0%

Counts

31 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 x #s(literal -1/3 binary64))
✓	51.0%	#s(approx (+ x (/ 1 3)) x)
✓	50.8%	#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))

Compiler

Compiled 39 to 30 computations (23.1% saved)

regimes35.0ms (2.6%)

Memory

-27.7MiB live, 23.3MiB allocated; 9ms collecting garbage

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))
#s(approx (+ x (/ 1 3)) x)
(-.f64 x #s(literal -1/3 binary64))
(+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))

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

Calls

2 calls:

32.0ms	x
2.0ms	(+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))`
100.0%	1	`x`

Compiler

Compiled 6 to 6 computations (0% saved)

regimes3.0ms (0.2%)

Memory

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

Counts

2 → 3

Calls

Call 1

Inputs
#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))
#s(approx (+ x (/ 1 3)) x)

Outputs
#s(approx (+ x (/ 1 3)) x)
#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))
#s(approx (+ x (/ 1 3)) x)

Calls

2 calls:

1.0ms	x
1.0ms	(+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))

Results

Accuracy	Segments	Branch
98.4%	3	`(+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))`
98.4%	3	`x`

Compiler

Compiled 6 to 6 computations (0% saved)

regimes2.0ms (0.2%)

Memory

4.6MiB live, 4.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 (/ 1 3)) #s(literal 1/3 binary64))

Outputs
#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))

Calls

2 calls:

1.0ms	x
1.0ms	(+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))

Results

Accuracy	Segments	Branch
50.8%	1	`(+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)))`
50.8%	1	`x`

Compiler

Compiled 6 to 6 computations (0% saved)

bsearch29.0ms (2.2%)

Memory

-5.7MiB live, 37.0MiB allocated; 7ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
16.0ms	3.3862716131579187e-10	456872564.0656754
10.0ms	-3616.8788720455555	-0.00018304646780511715

Samples

10.0ms

304×

valid

Compiler

Compiled 274 to 294 computations (-7.3% saved)

Precisions

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

ival-div: 2.0ms (45.1% of total)

ival-add: 1.0ms (22.6% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

simplify64.0ms (4.9%)

Memory

-0.3MiB live, 43.4MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	27
1	24	27
2	31	27
3	43	27
4	74	27
5	281	27
6	2798	27
7	8000	27

Stop Event

1×	node limit

Calls

Call 1

Inputs

(-.f64 x #s(literal -1/3 binary64))

(if (<=.f64 x #s(literal -5944751508129055/18014398509481984 binary64)) #s(approx (+ x (/ 1 3)) x) (if (<=.f64 x #s(literal 5944751508129055/18014398509481984 binary64)) #s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64)) #s(approx (+ x (/ 1 3)) x)))

#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))

Outputs

(-.f64 x #s(literal -1/3 binary64))

(if (<=.f64 x #s(literal -5944751508129055/18014398509481984 binary64)) #s(approx (+ x (/ 1 3)) x) (if (<=.f64 x #s(literal 5944751508129055/18014398509481984 binary64)) #s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64)) #s(approx (+ x (/ 1 3)) x)))

#s(approx (+ x (/ 1 3)) #s(literal 1/3 binary64))

derivations5.0ms (0.4%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 39 to 16 computations (59% saved)

preprocess30.0ms (2.3%)

Memory: -12.5MiB live, 32.7MiB allocated; 5ms collecting garbage
Compiler: Compiled 88 to 42 computations (52.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample573.0ms (44%)

explain76.0ms (5.9%)

preprocess337.0ms (25.9%)

eval0.0ms (0%)

prune0.0ms (0%)

series1.0ms (0.1%)

rewrite68.0ms (5.2%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite70.0ms (5.4%)

eval3.0ms (0.2%)

prune2.0ms (0.2%)

regimes35.0ms (2.6%)

regimes3.0ms (0.2%)

regimes2.0ms (0.2%)

bsearch29.0ms (2.2%)

simplify64.0ms (4.9%)

derivations5.0ms (0.4%)

preprocess30.0ms (2.3%)

end0.0ms (0%)

Profiling