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

start0.0ms (0%)

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

analyze1.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%	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)

sample888.0ms (40.6%)

Memory

48.6MiB live, 1 178.7MiB allocated; 255ms collecting garbage

Samples

520.0ms

8 256×

valid

Precisions

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

ival-add: 163.0ms (65.5% of total)

ival-mult: 69.0ms (27.7% of total)

ival-true: 6.0ms (2.4% of total)

exact: 5.0ms (2% of total)

adjust: 3.0ms (1.2% of total)

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

Bogosity

explain52.0ms (2.4%)

Memory

0.2MiB live, 91.1MiB allocated; 14ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(+.f64 y #s(literal 1 binary64))`
-	-	`y`
-	-	`#s(literal 1 binary64)`
-	-	`(*.f64 x (+.f64 y #s(literal 1 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: 10.0ms

ival-add: 5.0ms (50.8% of total)

ival-mult: 3.0ms (30.5% 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)

preprocess232.0ms (10.6%)

Memory

-11.0MiB live, 280.9MiB allocated; 77ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	31
1	48	29
2	146	26
3	283	25
4	985	25
5	3989	25
0	5	5
0	7	5
1	17	5
2	34	5
3	82	5
4	382	5
5	1905	5
0	8551	4

Stop Event

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

Calls

Call 1

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

Outputs
(*.f64 x (+.f64 y #s(literal 1 binary64)))
(fma.f64 y x x)

Symmetry

(negabs x)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

series4.0ms (0.2%)

Memory

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

Counts

5 → 10

Calls

Call 1

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

Outputs
(* x (+ 1 y))
x
(+ x (* x y))
1
(+ 1 y)
y
(* x y)
(* y (+ x (/ x y)))
(* y (+ 1 (/ 1 y)))
(* -1 (* y (+ (* -1 x) (* -1 (/ x y)))))

Calls

6 calls:

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

simplify200.0ms (9.1%)

Memory

13.6MiB live, 153.4MiB allocated; 23ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	32
1	69	32
2	186	32
3	505	32
4	2300	32
5	6932	32
0	8049	28

Stop Event

1×	iter limit
1×	node limit

Counts

10 → 8

Calls

Call 1

Inputs
(* x (+ 1 y))
x
(+ x (* x y))
1
(+ 1 y)
y
(* x y)
(* y (+ x (/ x y)))
(* y (+ 1 (/ 1 y)))
(* -1 (* y (+ (* -1 x) (* -1 (/ x y)))))

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

rewrite46.0ms (2.1%)

Memory

-5.3MiB live, 39.7MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	31	11
0	212	10

Stop Event

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

Counts

5 → 28

Calls

Call 1

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

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

eval3.0ms (0.1%)

Memory: 7.4MiB live, 7.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 313 to 85 computations (72.8% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	29	3	32
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
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 y x x)
▶	54.7%	(*.f64 x #s(approx (+ y 1) #s(literal 1 binary64)))
▶	47.1%	#s(approx (* x (+ y 1)) (*.f64 y x))

Compiler

Compiled 20 to 17 computations (15% saved)

series5.0ms (0.2%)

Memory

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

Counts

8 → 11

Calls

Call 1

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

Outputs
(* x (+ 1 y))
(* x y)
x
(* -1 (* x (- (* -1 y) 1)))
(+ x (* x y))
y
1
(+ 1 y)
(* y (+ x (/ x y)))
(* y (+ 1 (/ 1 y)))
(* -1 (* y (+ (* -1 x) (* -1 (/ x y)))))

Calls

6 calls:

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

simplify199.0ms (9.1%)

Memory

-23.9MiB live, 165.0MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	37
1	78	37
2	194	37
3	506	37
4	2216	37
5	5199	37
0	8702	32

Stop Event

1×	iter limit
1×	node limit

Counts

11 → 9

Calls

Call 1

Inputs
(* x (+ 1 y))
(* x y)
x
(* -1 (* x (- (* -1 y) 1)))
(+ x (* x y))
y
1
(+ 1 y)
(* y (+ x (/ x y)))
(* y (+ 1 (/ 1 y)))
(* -1 (* y (+ (* -1 x) (* -1 (/ x y)))))

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

rewrite62.0ms (2.8%)

Memory

2.6MiB live, 46.1MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	31
0	13	30
1	51	30
0	335	30

Stop Event

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

Counts

8 → 31

Calls

Call 1

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

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

eval4.0ms (0.2%)

Memory: 6.8MiB live, 6.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 410 to 84 computations (79.5% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	39	0	39
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	39	3	42

Accuracy

100.0%

Counts

42 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 y x x)
✓	54.7%	(*.f64 x #s(approx (+ y 1) #s(literal 1 binary64)))
✓	47.1%	#s(approx (* x (+ y 1)) (*.f64 y x))

Compiler

Compiled 45 to 30 computations (33.3% saved)

regimes8.0ms (0.3%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

Outputs
(fma.f64 y x x)

Calls

4 calls:

2.0ms	(*.f64 x (+.f64 y #s(literal 1 binary64)))
2.0ms	x
2.0ms	y
2.0ms	(+.f64 y #s(literal 1 binary64))

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes35.0ms (1.6%)

Memory

-28.4MiB live, 15.9MiB allocated; 10ms collecting garbage

Counts

2 → 3

Calls

Call 1

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

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
97.8%	3	`(+.f64 y #s(literal 1 binary64))`
79.2%	3	`(*.f64 x (+.f64 y #s(literal 1 binary64)))`
62.3%	4	`x`
97.8%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.2%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch124.0ms (5.6%)

Memory

-15.0MiB live, 61.2MiB allocated; 103ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
92.0ms	0.13677341589256478	2.021225033378225
10.0ms	-2.049364059582504	-5.167653268742867e-7

Samples

8.0ms

240×

valid

Compiler

Compiled 248 to 250 computations (-0.8% saved)

Precisions

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

ival-mult: 2.0ms (60.1% of total)

ival-add: 1.0ms (30% 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)

simplify108.0ms (4.9%)

Memory

-21.0MiB live, 76.1MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	38
1	28	38
2	44	38
3	104	38
4	624	38
5	4275	38

Stop Event

1×	node limit

Calls

Call 1

Inputs

(fma.f64 y x x)

(if (<=.f64 y #s(literal -1 binary64)) #s(approx (* x (+ y 1)) (*.f64 y x)) (if (<=.f64 y #s(literal 1 binary64)) (*.f64 x #s(approx (+ y 1) #s(literal 1 binary64))) #s(approx (* x (+ y 1)) (*.f64 y x))))

#s(approx (* x (+ y 1)) (*.f64 y x))

Outputs
(fma.f64 y x x)
(if (<=.f64 y #s(literal -1 binary64)) #s(approx (* x (+ y 1)) (.f64 y x)) (if (<=.f64 y #s(literal 1 binary64)) (.f64 x #s(approx (+ y 1) #s(literal 1 binary64))) #s(approx (* x (+ y 1)) (*.f64 y x))))
(if (or (<=.f64 y #s(literal -1 binary64)) (not (<=.f64 y #s(literal 1 binary64)))) #s(approx (* x (+ y 1)) (.f64 y x)) (.f64 x #s(approx (+ y 1) #s(literal 1 binary64))))
#s(approx (* x (+ y 1)) (*.f64 y x))

derivations134.0ms (6.1%)

Memory

-6.1MiB live, 96.4MiB allocated; 6ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 38 to 17 computations (55.3% saved)

preprocess77.0ms (3.5%)

Memory: 21.2MiB live, 68.6MiB allocated; 3ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 104 to 58 computations (44.2% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze1.0ms (0%)

sample888.0ms (40.6%)

explain52.0ms (2.4%)

preprocess232.0ms (10.6%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.2%)

simplify200.0ms (9.1%)

rewrite46.0ms (2.1%)

eval3.0ms (0.1%)

prune2.0ms (0.1%)

series5.0ms (0.2%)

simplify199.0ms (9.1%)

rewrite62.0ms (2.8%)

eval4.0ms (0.2%)

prune3.0ms (0.1%)

regimes8.0ms (0.3%)

regimes35.0ms (1.6%)

regimes4.0ms (0.2%)

bsearch124.0ms (5.6%)

simplify108.0ms (4.9%)

derivations134.0ms (6.1%)

preprocess77.0ms (3.5%)

end0.0ms (0%)

Profiling