Metrics for Graphics.Rasterific.Linear:$cquadrance from Rasterific-0.6.1

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

1.1MiB live, 1.1MiB 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 9 to 7 computations (22.2% saved)

sample831.0ms (49.9%)

Memory

42.9MiB live, 1 369.5MiB allocated; 197ms collecting garbage

Samples

529.0ms

8 256×

valid

Precisions

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

ival-mult: 208.0ms (78.9% of total)

ival-add: 45.0ms (17.1% of total)

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

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

adjust: 2.0ms (0.8% of total)

Bogosity

explain104.0ms (6.3%)

Memory

-2.7MiB live, 181.8MiB allocated; 64ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(+.f64 (.f64 x x) (.f64 y y))`
-	-	`y`
-	-	`(*.f64 y y)`
-	-	`(*.f64 x x)`
-	-	`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

50.0ms

512×

valid

Compiler

Compiled 41 to 19 computations (53.7% saved)

Precisions

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

ival-mult: 23.0ms (88.9% of total)

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

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

adjust: 0.0ms (0% of total)

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

preprocess29.0ms (1.7%)

Memory

-13.1MiB live, 30.4MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	44
1	43	44
2	91	44
3	115	44
4	147	44
0	5	7
0	8	7
1	19	7
2	58	7
3	115	7
4	152	7
0	152	6

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(+.f64 (.f64 x x) (.f64 y y))

Outputs
(+.f64 (.f64 x x) (.f64 y y))
(fma.f64 y y (*.f64 x x))

Symmetry

(abs x)

(abs y)

(sort x y)

Compiler

Compiled 7 to 5 computations (28.6% 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.7MiB live, 0.7MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(+.f64 (.f64 x x) (.f64 y y))

Compiler

Compiled 7 to 5 computations (28.6% saved)

simplify5.0ms (0.3%)

Memory

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

Localize:

Found 3 expressions of interest:

New	Metric	Score
cost-diff	0	(*.f64 y y)
cost-diff	0	(*.f64 x x)
cost-diff	1	(+.f64 (.f64 x x) (.f64 y y))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	15
0	8	15
1	19	15
2	58	15
3	115	15
4	152	15
0	152	14

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

Inputs
(+.f64 (.f64 x x) (.f64 y y))
(*.f64 x x)
x
(*.f64 y y)
y

Outputs
(+.f64 (.f64 x x) (.f64 y y))
(fma.f64 y y (*.f64 x x))
(*.f64 x x)
x
(*.f64 y y)
y

localize40.0ms (2.4%)

Memory

-16.9MiB live, 28.4MiB allocated; 8ms collecting garbage

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(+.f64 (.f64 x x) (.f64 y y))
accuracy	0.0	(*.f64 y y)
accuracy	0.0	(*.f64 x x)

Samples

34.0ms

256×

valid

Compiler

Compiled 17 to 7 computations (58.8% saved)

Precisions

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

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

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

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

adjust: 0.0ms (0% of total)

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

series3.0ms (0.2%)

Memory

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

Counts

3 → 7

Calls

Call 1

Inputs
(+.f64 (.f64 x x) (.f64 y y))
(*.f64 x x)
(*.f64 y y)

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

Calls

6 calls:

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

simplify192.0ms (11.5%)

Memory

17.6MiB live, 160.6MiB allocated; 56ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	93
1	56	93
2	269	93
3	2774	93
0	8296	85

Stop Event

1×	iter limit
1×	node limit

Counts

7 → 7

Calls

Call 1

Inputs
#s(approx (+ (* x x) (* y y)) #s(hole binary64 (pow y 2)))
#s(approx (+ (* x x) (* y y)) #s(hole binary64 (+ (pow x 2) (pow y 2))))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) (* y y)) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) (* y y)) #s(hole binary64 (* (pow x 2) (+ 1 (/ (pow y 2) (pow x 2))))))
#s(approx (* y y) #s(hole binary64 (pow y 2)))
#s(approx (+ (* x x) (* y y)) #s(hole binary64 (* (pow y 2) (+ 1 (/ (pow x 2) (pow y 2))))))

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

rewrite63.0ms (3.8%)

Memory

-9.9MiB live, 96.1MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	13
0	8	13
1	35	13
0	329	12

Stop Event

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

Counts

3 → 67

Calls

Call 1

Inputs
(+.f64 (.f64 x x) (.f64 y y))
(*.f64 x x)
(*.f64 y y)

Outputs
(/.f64 (-.f64 (pow.f64 y #s(literal 4 binary64)) (pow.f64 x #s(literal 4 binary64))) (-.f64 (.f64 y y) (.f64 x x)))
(/.f64 (-.f64 (pow.f64 x #s(literal 6 binary64)) (pow.f64 (.f64 (neg.f64 y) y) #s(literal 3 binary64))) (+.f64 (pow.f64 x #s(literal 4 binary64)) (+.f64 (pow.f64 y #s(literal 4 binary64)) (.f64 (.f64 x x) (.f64 (neg.f64 y) y)))))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) (pow.f64 y #s(literal 4 binary64)))) (neg.f64 (*.f64 (+.f64 x y) (-.f64 x y))))
(/.f64 (neg.f64 (+.f64 (pow.f64 y #s(literal 6 binary64)) (pow.f64 x #s(literal 6 binary64)))) (neg.f64 (+.f64 (-.f64 (pow.f64 y #s(literal 4 binary64)) (pow.f64 (*.f64 x y) #s(literal 2 binary64))) (pow.f64 x #s(literal 4 binary64)))))
(/.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) (pow.f64 y #s(literal 4 binary64))) (*.f64 (+.f64 x y) (-.f64 x y)))
(/.f64 (+.f64 (pow.f64 y #s(literal 6 binary64)) (pow.f64 x #s(literal 6 binary64))) (+.f64 (pow.f64 y #s(literal 4 binary64)) (-.f64 (pow.f64 x #s(literal 4 binary64)) (pow.f64 (*.f64 x y) #s(literal 2 binary64)))))
(/.f64 (+.f64 (pow.f64 y #s(literal 6 binary64)) (pow.f64 x #s(literal 6 binary64))) (+.f64 (-.f64 (pow.f64 y #s(literal 4 binary64)) (pow.f64 (*.f64 x y) #s(literal 2 binary64))) (pow.f64 x #s(literal 4 binary64))))
(fma.f64 (pow.f64 y #s(literal 1 binary64)) (pow.f64 y #s(literal 1 binary64)) (*.f64 x x))
(fma.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)) (*.f64 (neg.f64 (neg.f64 y)) y))
(fma.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)) (*.f64 y y))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) (*.f64 (neg.f64 (neg.f64 y)) y))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) (*.f64 y y))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) (*.f64 (neg.f64 (neg.f64 y)) y))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) (*.f64 y y))
(fma.f64 (neg.f64 (neg.f64 y)) (neg.f64 (neg.f64 y)) (*.f64 x x))
(fma.f64 (neg.f64 (fabs.f64 y)) (neg.f64 (fabs.f64 y)) (*.f64 x x))
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) (*.f64 (neg.f64 (neg.f64 y)) y))
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) (*.f64 y y))
(fma.f64 (fabs.f64 (fabs.f64 y)) (fabs.f64 (fabs.f64 y)) (*.f64 x x))
(fma.f64 (neg.f64 y) (neg.f64 y) (*.f64 x x))
(fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 (neg.f64 (neg.f64 y)) y))
(fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 y y))
(fma.f64 (fabs.f64 y) (fabs.f64 y) (*.f64 x x))
(fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 (neg.f64 (neg.f64 y)) y))
(fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 y y))
(fma.f64 y y (*.f64 x x))
(fma.f64 x x (*.f64 (neg.f64 (neg.f64 y)) y))
(fma.f64 x x (*.f64 y y))
(-.f64 (/.f64 (pow.f64 x #s(literal 4 binary64)) (.f64 (+.f64 x y) (-.f64 x y))) (/.f64 (pow.f64 y #s(literal 4 binary64)) (.f64 (+.f64 x y) (-.f64 x y))))
(-.f64 (.f64 y y) (.f64 (neg.f64 (neg.f64 x)) (neg.f64 x)))
(-.f64 (.f64 y y) (.f64 (neg.f64 (fabs.f64 x)) (fabs.f64 x)))
(-.f64 (.f64 y y) (.f64 (neg.f64 x) x))
(-.f64 (.f64 y y) (.f64 x (neg.f64 x)))
(-.f64 (.f64 x x) (.f64 (neg.f64 (neg.f64 y)) (neg.f64 y)))
(-.f64 (.f64 x x) (.f64 (neg.f64 (fabs.f64 y)) (fabs.f64 y)))
(-.f64 (.f64 x x) (.f64 (neg.f64 y) y))
(+.f64 (/.f64 (pow.f64 x #s(literal 6 binary64)) (+.f64 (-.f64 (pow.f64 y #s(literal 4 binary64)) (pow.f64 (.f64 x y) #s(literal 2 binary64))) (pow.f64 x #s(literal 4 binary64)))) (/.f64 (pow.f64 y #s(literal 6 binary64)) (+.f64 (-.f64 (pow.f64 y #s(literal 4 binary64)) (pow.f64 (.f64 x y) #s(literal 2 binary64))) (pow.f64 x #s(literal 4 binary64)))))
(+.f64 (.f64 y y) (.f64 x x))
(+.f64 (.f64 x x) (.f64 (neg.f64 (neg.f64 y)) y))
(+.f64 (.f64 x x) (.f64 y y))
(*.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(*.f64 x x)
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(neg.f64 (*.f64 x (neg.f64 x)))
(fabs.f64 (*.f64 x x))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(*.f64 (pow.f64 y #s(literal 1 binary64)) (pow.f64 y #s(literal 1 binary64)))
(*.f64 (neg.f64 (neg.f64 y)) (neg.f64 (neg.f64 y)))
(*.f64 (neg.f64 (fabs.f64 y)) (neg.f64 (fabs.f64 y)))
(*.f64 (fabs.f64 (fabs.f64 y)) (fabs.f64 (fabs.f64 y)))
(*.f64 (neg.f64 y) (neg.f64 y))
(*.f64 (fabs.f64 y) (fabs.f64 y))
(*.f64 y y)
(pow.f64 (neg.f64 y) #s(literal 2 binary64))
(pow.f64 (fabs.f64 y) #s(literal 2 binary64))
(pow.f64 y #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 y) y))
(fabs.f64 (*.f64 y y))
(exp.f64 (*.f64 (log.f64 y) #s(literal 2 binary64)))

eval7.0ms (0.4%)

Memory: 13.2MiB live, 13.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 827 to 173 computations (79.1% saved)

prune11.0ms (0.7%)

Memory

-41.2MiB live, 5.4MiB allocated; 2ms collecting garbage

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	73	1	74
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	74	1	75

Accuracy

100.0%

Counts

75 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 11 to 7 computations (36.4% saved)

simplify7.0ms (0.4%)

Memory

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

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 y y)
cost-diff	0	#s(approx (+ (* x x) (* y y)) (*.f64 y y))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	15
0	8	15
1	19	15
2	58	15
3	114	15
4	151	15
0	151	14

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize36.0ms (2.2%)

Memory

2.8MiB live, 49.5MiB allocated; 3ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(*.f64 y y)
accuracy	0.0	#s(approx (+ (* x x) (* y y)) (*.f64 y y))

Samples

10.0ms

256×

valid

Compiler

Compiled 13 to 7 computations (46.2% saved)

Precisions

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

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

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

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

adjust: 0.0ms (0% of total)

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

series2.0ms (0.1%)

Memory

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

Counts

2 → 6

Calls

Call 1

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

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

Calls

6 calls:

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

simplify189.0ms (11.3%)

Memory

6.1MiB live, 294.3MiB allocated; 66ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	86
1	54	86
2	267	86
3	2775	86
0	8314	78

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 6

Calls

Call 1

Inputs
#s(approx (+ (* x x) (* y y)) #s(hole binary64 (pow y 2)))
#s(approx (+ (* x x) (* y y)) #s(hole binary64 (+ (pow x 2) (pow y 2))))
#s(approx (+ (* x x) (* y y)) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) (* y y)) #s(hole binary64 (* (pow x 2) (+ 1 (/ (pow y 2) (pow x 2))))))
#s(approx (* y y) #s(hole binary64 (pow y 2)))
#s(approx (+ (* x x) (* y y)) #s(hole binary64 (* (pow y 2) (+ 1 (/ (pow x 2) (pow y 2))))))

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

rewrite59.0ms (3.5%)

Memory

-20.1MiB live, 72.5MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	14
0	8	14
1	35	14
0	329	13

Stop Event

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

Counts

2 → 14

Calls

Call 1

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

Outputs
#s(approx (+ (* x x) (* y y)) (*.f64 y y))
(*.f64 (pow.f64 y #s(literal 1 binary64)) (pow.f64 y #s(literal 1 binary64)))
(*.f64 (neg.f64 (neg.f64 y)) (neg.f64 (neg.f64 y)))
(*.f64 (neg.f64 (fabs.f64 y)) (neg.f64 (fabs.f64 y)))
(*.f64 (fabs.f64 (fabs.f64 y)) (fabs.f64 (fabs.f64 y)))
(*.f64 (neg.f64 y) (neg.f64 y))
(*.f64 (fabs.f64 y) (fabs.f64 y))
(*.f64 y y)
(pow.f64 (neg.f64 y) #s(literal 2 binary64))
(pow.f64 (fabs.f64 y) #s(literal 2 binary64))
(pow.f64 y #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 y) y))
(fabs.f64 (*.f64 y y))
(exp.f64 (*.f64 (log.f64 y) #s(literal 2 binary64)))

eval4.0ms (0.2%)

Memory: 8.4MiB live, 8.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 261 to 58 computations (77.8% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	19	0	19
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	19	1	20

Accuracy

100.0%

Counts

20 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (+ (* x x) (* y y)) (*.f64 y y))

Compiler

Compiled 29 to 16 computations (44.8% saved)

regimes6.0ms (0.4%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

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

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

Calls

5 calls:

1.0ms	x
1.0ms	y
1.0ms	(*.f64 y y)
1.0ms	(+.f64 (.f64 x x) (.f64 y y))
1.0ms	(*.f64 x x)

Results

Accuracy	Segments	Branch
100.0%	1	`(*.f64 y y)`
100.0%	1	`(*.f64 x x)`
100.0%	1	`(+.f64 (.f64 x x) (.f64 y y))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 15 to 15 computations (0% saved)

simplify12.0ms (0.7%)

Memory

-16.0MiB live, 30.2MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	11
1	18	11
2	57	11
3	113	11
4	150	11

Stop Event

1×

saturated

Calls

Call 1

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

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

derivations35.0ms (2.1%)

Memory

-20.0MiB live, 34.3MiB allocated; 6ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 11 to 7 computations (36.4% saved)

preprocess30.0ms (1.8%)

Memory: 13.4MiB live, 59.0MiB allocated; 5ms collecting garbage
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%)

sample831.0ms (49.9%)

explain104.0ms (6.3%)

preprocess29.0ms (1.7%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify5.0ms (0.3%)

localize40.0ms (2.4%)

series3.0ms (0.2%)

simplify192.0ms (11.5%)

rewrite63.0ms (3.8%)

eval7.0ms (0.4%)

prune11.0ms (0.7%)

simplify7.0ms (0.4%)

localize36.0ms (2.2%)

series2.0ms (0.1%)

simplify189.0ms (11.3%)

rewrite59.0ms (3.5%)

eval4.0ms (0.2%)

prune1.0ms (0.1%)

regimes6.0ms (0.4%)

simplify12.0ms (0.7%)

derivations35.0ms (2.1%)

preprocess30.0ms (1.8%)

end0.0ms (0%)

Profiling