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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB 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)

sample956.0ms (48.1%)

Memory

-31.6MiB live, 1 034.7MiB allocated; 302ms collecting garbage

Samples

568.0ms

8 256×

valid

Precisions

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

ival-sub: 76.0ms (46.5% of total)

ival-mult: 73.0ms (44.7% of total)

ival-true: 5.0ms (3.1% of total)

exact: 5.0ms (3.1% of total)

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

adjust: 2.0ms (1.2% of total)

Bogosity

explain71.0ms (3.6%)

Memory

14.1MiB live, 107.3MiB allocated; 7ms collecting garbage

FPErrors

Click to see full error table

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

45.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-sub: 3.0ms (39.3% of total)

ival-mult: 3.0ms (39.3% of total)

ival-true: 1.0ms (13.1% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

preprocess227.0ms (11.4%)

Memory

14.7MiB live, 252.8MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	31
1	27	29
2	37	29
3	61	29
4	154	26
5	665	25
6	5933	25
0	5	5
0	7	5
1	10	5
2	13	5
3	23	5
4	62	5
5	302	5
6	2755	5
7	6681	5
0	8265	5

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) y))

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

Symmetry

(negabs x)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

series4.0ms (0.2%)

Memory

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

Counts

5 → 13

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))
#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	x	@	0	((* x (- 1 y)) x (- 1 y) 1 y)
1.0ms	y	@	-inf	((* x (- 1 y)) x (- 1 y) 1 y)

simplify126.0ms (6.4%)

Memory

-24.2MiB live, 165.1MiB allocated; 21ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	38	102
1	84	99
2	178	99
3	447	99
4	2037	99
5	5618	99
0	8011	99

Stop Event

1×	iter limit
1×	node limit

Counts

13 → 13

Calls

Call 1

Inputs
#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))
#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
#s(approx (* x (- 1 y)) #s(hole binary64 (* x (- 1 y))))
#s(approx (* x (- 1 y)) (*.f64 (-.f64 #s(literal 1 binary64) y) x))
#s(approx x #s(hole binary64 x))
#s(approx x x)
#s(approx (* x (- 1 y)) #s(hole binary64 x))
#s(approx (* x (- 1 y)) x)
#s(approx (* x (- 1 y)) #s(hole binary64 (+ x (* -1 (* x y)))))
#s(approx (* x (- 1 y)) (*.f64 (-.f64 #s(literal 1 binary64) y) x))
#s(approx (- 1 y) #s(hole binary64 1))
#s(approx (- 1 y) #s(literal 1 binary64))
#s(approx (- 1 y) #s(hole binary64 (+ 1 (* -1 y))))
#s(approx (- 1 y) (-.f64 #s(literal 1 binary64) y))
#s(approx y #s(hole binary64 y))
#s(approx y y)
#s(approx (* x (- 1 y)) #s(hole binary64 (* -1 (* x y))))
#s(approx (* x (- 1 y)) (*.f64 (neg.f64 x) y))
#s(approx (* x (- 1 y)) #s(hole binary64 (* y (+ (* -1 x) (/ x y)))))
#s(approx (* x (- 1 y)) (*.f64 (-.f64 #s(literal 1 binary64) y) x))
#s(approx (- 1 y) #s(hole binary64 (* -1 y)))
#s(approx (- 1 y) (neg.f64 y))
#s(approx (- 1 y) #s(hole binary64 (* y (- (/ 1 y) 1))))
#s(approx (- 1 y) (-.f64 #s(literal 1 binary64) y))
#s(approx (* x (- 1 y)) #s(hole binary64 (* -1 (* y (+ x (* -1 (/ x y)))))))
#s(approx (* x (- 1 y)) (*.f64 (-.f64 #s(literal 1 binary64) y) x))
#s(approx (- 1 y) #s(hole binary64 (* -1 (* y (- 1 (/ 1 y))))))
#s(approx (- 1 y) (-.f64 #s(literal 1 binary64) y))

rewrite58.0ms (2.9%)

Memory

19.0MiB live, 64.6MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	24	11
0	148	11

Stop Event

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

Counts

5 → 16

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
(*.f64 (-.f64 #s(literal 1 binary64) y) x)
(*.f64 x (-.f64 #s(literal 1 binary64) y))
(/.f64 (.f64 (-.f64 #s(literal 1 binary64) (.f64 y y)) x) (+.f64 y #s(literal 1 binary64)))
(/.f64 (*.f64 (-.f64 #s(literal 1 binary64) (pow.f64 y #s(literal 3 binary64))) x) (+.f64 (fma.f64 y y y) #s(literal 1 binary64)))
(/.f64 (.f64 x (-.f64 #s(literal 1 binary64) (.f64 y y))) (+.f64 y #s(literal 1 binary64)))
(/.f64 (*.f64 x (-.f64 #s(literal 1 binary64) (pow.f64 y #s(literal 3 binary64)))) (+.f64 (fma.f64 y y y) #s(literal 1 binary64)))
x
(/.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 y y))) (neg.f64 (+.f64 y #s(literal 1 binary64))))
(/.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (pow.f64 y #s(literal 3 binary64)))) (neg.f64 (+.f64 (fma.f64 y y y) #s(literal 1 binary64))))
(/.f64 (-.f64 #s(literal 1 binary64) (*.f64 y y)) (+.f64 y #s(literal 1 binary64)))
(/.f64 (-.f64 #s(literal 1 binary64) (pow.f64 y #s(literal 3 binary64))) (+.f64 (fma.f64 y y y) #s(literal 1 binary64)))
(-.f64 (/.f64 #s(literal 1 binary64) (+.f64 y #s(literal 1 binary64))) (/.f64 (*.f64 y y) (+.f64 y #s(literal 1 binary64))))
(-.f64 (/.f64 #s(literal 1 binary64) (+.f64 (fma.f64 y y y) #s(literal 1 binary64))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (+.f64 (fma.f64 y y y) #s(literal 1 binary64))))
(-.f64 #s(literal 1 binary64) y)
#s(literal 1 binary64)
y

eval2.0ms (0.1%)

Memory: 6.7MiB live, 6.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 236 to 62 computations (73.7% saved)

prune2.0ms (0.1%)

Memory

4.8MiB live, 4.7MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	22	2	24
Fresh	0	0	0
Picked	0	1	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 (-.f64 #s(literal 1 binary64) y))
▶	51.3%	(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
▶	51.7%	#s(approx (* x (- 1 y)) x)

Compiler

Compiled 20 to 18 computations (10% saved)

series14.0ms (0.7%)

Memory

-36.1MiB live, 7.6MiB allocated; 7ms collecting garbage

Counts

6 → 14

Calls

Call 1

Inputs
#s(approx (* x (- 1 y)) x)
x
(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
#s(approx (- 1 y) (neg.f64 y))
(neg.f64 y)
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))
#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 (neg y) #s(hole binary64 (* -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
12.0ms	y	@	-inf	((* x (- 1 y)) x (* x (- 1 y)) (- 1 y) (neg y) y)
1.0ms	x	@	-inf	((* x (- 1 y)) x (* x (- 1 y)) (- 1 y) (neg y) y)
0.0ms	x	@	inf	((* x (- 1 y)) x (* x (- 1 y)) (- 1 y) (neg y) y)
0.0ms	y	@	inf	((* x (- 1 y)) x (* x (- 1 y)) (- 1 y) (neg y) y)
0.0ms	x	@	0	((* x (- 1 y)) x (* x (- 1 y)) (- 1 y) (neg y) y)

simplify173.0ms (8.7%)

Memory

56.2MiB live, 189.6MiB allocated; 71ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	40	107
1	86	104
2	180	104
3	449	104
4	2045	104
5	5641	104
0	8034	104

Stop Event

1×	iter limit
1×	node limit

Counts

14 → 14

Calls

Call 1

Inputs
#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))
#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 (neg y) #s(hole binary64 (* -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
#s(approx (* x (- 1 y)) #s(hole binary64 (* x (- 1 y))))
#s(approx (* x (- 1 y)) (*.f64 (-.f64 #s(literal 1 binary64) y) x))
#s(approx x #s(hole binary64 x))
#s(approx x x)
#s(approx (* x (- 1 y)) #s(hole binary64 x))
#s(approx (* x (- 1 y)) x)
#s(approx (* x (- 1 y)) #s(hole binary64 (+ x (* -1 (* x y)))))
#s(approx (* x (- 1 y)) (*.f64 (-.f64 #s(literal 1 binary64) y) x))
#s(approx (- 1 y) #s(hole binary64 1))
#s(approx (- 1 y) #s(literal 1 binary64))
#s(approx (- 1 y) #s(hole binary64 (+ 1 (* -1 y))))
#s(approx (- 1 y) (-.f64 #s(literal 1 binary64) y))
#s(approx (neg y) #s(hole binary64 (* -1 y)))
#s(approx (neg y) (neg.f64 y))
#s(approx y #s(hole binary64 y))
#s(approx y y)
#s(approx (* x (- 1 y)) #s(hole binary64 (* -1 (* x y))))
#s(approx (* x (- 1 y)) (*.f64 (neg.f64 x) y))
#s(approx (* x (- 1 y)) #s(hole binary64 (* y (+ (* -1 x) (/ x y)))))
#s(approx (* x (- 1 y)) (*.f64 (-.f64 #s(literal 1 binary64) y) x))
#s(approx (- 1 y) #s(hole binary64 (* -1 y)))
#s(approx (- 1 y) (neg.f64 y))
#s(approx (- 1 y) #s(hole binary64 (* y (- (/ 1 y) 1))))
#s(approx (- 1 y) (-.f64 #s(literal 1 binary64) y))
#s(approx (* x (- 1 y)) #s(hole binary64 (* -1 (* y (+ x (* -1 (/ x y)))))))
#s(approx (* x (- 1 y)) (*.f64 (-.f64 #s(literal 1 binary64) y) x))
#s(approx (- 1 y) #s(hole binary64 (* -1 (* y (- 1 (/ 1 y))))))
#s(approx (- 1 y) (-.f64 #s(literal 1 binary64) y))

rewrite42.0ms (2.1%)

Memory

3.7MiB live, 49.0MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	25
0	11	25
1	29	25
0	152	25

Stop Event

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

Counts

6 → 7

Calls

Call 1

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

Outputs
#s(approx (* x (- 1 y)) x)
x
(*.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))
(neg.f64 y)
y

eval10.0ms (0.5%)

Memory: -34.6MiB live, 8.8MiB allocated; 10ms collecting garbage
Compiler: Compiled 139 to 32 computations (77% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	16	0	16
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	16	3	19

Accuracy

100.0%

Counts

19 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 40 to 30 computations (25% saved)

regimes6.0ms (0.3%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

Calls

4 calls:

2.0ms	x
2.0ms	(*.f64 x (-.f64 #s(literal 1 binary64) y))
2.0ms	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)

regimes22.0ms (1.1%)

Memory

-35.6MiB live, 15.8MiB allocated; 27ms collecting garbage

Counts

2 → 3

Calls

Call 1

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

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
98.9%	3	`(-.f64 #s(literal 1 binary64) y)`
84.5%	3	`(*.f64 x (-.f64 #s(literal 1 binary64) y))`
59.8%	4	`x`
98.9%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.2%)

Memory

12.3MiB live, 12.3MiB 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 y)) x)

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch30.0ms (1.5%)

Memory

6.4MiB live, 53.5MiB allocated; 9ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
16.0ms	0.6840908804372486	13750693789501344.0
11.0ms	-11031636135507784.0	-0.013808049885825312

Samples

16.0ms

320×

valid

Compiler

Compiled 308 to 310 computations (-0.6% saved)

Precisions

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

ival-sub: 7.0ms (72.8% of total)

ival-mult: 2.0ms (20.8% 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)

simplify57.0ms (2.9%)

Memory

-0.7MiB live, 44.5MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	36
1	26	36
2	30	36
3	40	36
4	72	36
5	292	36
6	2746	36
7	7697	36

Stop Event

1×	node limit

Calls

Call 1

Inputs

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

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

#s(approx (* x (- 1 y)) x)

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

derivations66.0ms (3.3%)

Memory

29.0MiB live, 75.8MiB allocated; 3ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 36 to 18 computations (50% saved)

preprocess113.0ms (5.7%)

Memory: -15.5MiB live, 36.5MiB allocated; 12ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 102 to 66 computations (35.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample956.0ms (48.1%)

explain71.0ms (3.6%)

preprocess227.0ms (11.4%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.2%)

simplify126.0ms (6.4%)

rewrite58.0ms (2.9%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

series14.0ms (0.7%)

simplify173.0ms (8.7%)

rewrite42.0ms (2.1%)

eval10.0ms (0.5%)

prune3.0ms (0.1%)

regimes6.0ms (0.3%)

regimes22.0ms (1.1%)

regimes4.0ms (0.2%)

bsearch30.0ms (1.5%)

simplify57.0ms (2.9%)

derivations66.0ms (3.3%)

preprocess113.0ms (5.7%)

end0.0ms (0%)

Profiling