Metrics for Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, H

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

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

Compiler

Compiled 7 to 7 computations (0% saved)

sample630.0ms (59.5%)

Memory

34.0MiB live, 1 070.6MiB allocated; 200ms collecting garbage

Samples

399.0ms	8 255×	0	valid
0.0ms	1×	1	valid

Precisions

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

ival-mult!: 79.0ms (72.8% of total)

ival-sub!: 28.0ms (25.8% of total)

adjust: 1.0ms (0.9% of total)

Bogosity

preprocess66.0ms (6.2%)

Memory

-42.9MiB live, 57.1MiB allocated; 16ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	40	30
2	130	30
3	341	30
4	2027	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(negabs x)

Compiler

Compiled 10 to 10 computations (0% saved)

series4.0ms (0.3%)

Memory

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

Counts

5 → 12

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite62.0ms (5.9%)

Memory

29.3MiB live, 77.1MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	39	129
0	41	118
1	191	115
0	1361	115
1	4105	115

Stop Event

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

Counts

17 → 48

Calls

Call 1

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

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

eval51.0ms (4.8%)

Memory: -36.1MiB live, 11.1MiB allocated; 2ms collecting garbage
Compiler: Compiled 143 to 83 computations (42% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	38	3	41
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	38	4	42

Accuracy

100.0%

Counts

42 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 x (-.f64 #s(literal 1 binary64) y))
▶	50.0%	(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
▶	52.3%	(*.f64 x #s(approx (- 1 y) #s(literal 1 binary64)))
▶	100.0%	#s(approx (* x (- 1 y)) (-.f64 x (*.f64 y x)))

Compiler

Compiled 27 to 27 computations (0% saved)

series6.0ms (0.5%)

Memory

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

Counts

11 → 16

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite74.0ms (7%)

Memory

-1.0MiB live, 93.8MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	57	219
0	62	197
1	274	197
0	1743	197
1	4926	197

Stop Event

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

Counts

27 → 54

Calls

Call 1

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

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

eval3.0ms (0.3%)

Memory: 10.7MiB live, 10.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 166 to 116 computations (30.1% saved)

prune3.0ms (0.3%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	39	0	39
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	39	4	43

Accuracy

100.0%

Counts

43 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 x (-.f64 #s(literal 1 binary64) y))
✓	50.0%	(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
✓	52.3%	(*.f64 x #s(approx (- 1 y) #s(literal 1 binary64)))
✓	100.0%	#s(approx (* x (- 1 y)) (-.f64 x (*.f64 y x)))

Compiler

Compiled 45 to 43 computations (4.4% saved)

regimes9.0ms (0.8%)

Memory

-24.6MiB live, 21.8MiB allocated; 2ms collecting garbage

Counts

4 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes5.0ms (0.5%)

Memory

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

Counts

2 → 3

Calls

Call 1

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

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
98.1%	3	`(-.f64 #s(literal 1 binary64) y)`
82.7%	3	`(*.f64 x (-.f64 #s(literal 1 binary64) y))`
59.7%	4	`x`
98.1%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.4%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch19.0ms (1.8%)

Memory

-3.7MiB live, 42.4MiB allocated; 3ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
7.0ms	0.0012926992439201914	70.93892073714684
10.0ms	-3970.244196212695	-0.4218799617492567

Samples

7.0ms

256×

valid

Compiler

Compiled 232 to 266 computations (-14.7% saved)

Precisions

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

ival-sub!: 1.0ms (51.6% of total)

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

adjust: 0.0ms (0% of total)

derivations16.0ms (1.5%)

Memory

-17.8MiB live, 28.6MiB allocated; 3ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 22 to 19 computations (13.6% saved)

preprocess106.0ms (10.1%)

Memory: -32.6MiB live, 59.2MiB allocated; 98ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 91 to 84 computations (7.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample630.0ms (59.5%)

preprocess66.0ms (6.2%)

series4.0ms (0.3%)

rewrite62.0ms (5.9%)

eval51.0ms (4.8%)

prune2.0ms (0.2%)

series6.0ms (0.5%)

rewrite74.0ms (7%)

eval3.0ms (0.3%)

prune3.0ms (0.3%)

regimes9.0ms (0.8%)

regimes5.0ms (0.5%)

regimes4.0ms (0.4%)

bsearch19.0ms (1.8%)

derivations16.0ms (1.5%)

preprocess106.0ms (10.1%)

end0.0ms (0%)

Profiling