Metrics for Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, A

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%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample525.0ms (37.8%)

Memory

5.7MiB live, 888.6MiB allocated; 183ms collecting garbage

Samples

301.0ms

8 256×

valid

Precisions

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

ival-mult: 97.0ms (64.3% of total)

ival-add: 39.0ms (25.8% of total)

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

exact: 5.0ms (3.3% of total)

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

adjust: 2.0ms (1.3% of total)

Bogosity

explain62.0ms (4.5%)

Memory

-7.4MiB live, 89.0MiB allocated; 33ms collecting garbage

FPErrors

Click to see full error table

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

23.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-mult: 4.0ms (54.5% of total)

ival-add: 2.0ms (27.3% 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)

preprocess238.0ms (17.2%)

Memory

6.8MiB live, 236.6MiB allocated; 66ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	16
1	26	16
2	54	15
3	80	15
4	148	15
5	380	15
6	2661	15
7	6163	15
0	4	5
0	6	5
1	13	5
2	35	5
3	75	5
4	134	5
5	340	5
6	2378	5
7	5935	5
0	8175	4

Stop Event

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

Calls

Call 1

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

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

Symmetry

(abs x)

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 4 computations (20% saved)

series2.0ms (0.1%)

Memory

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

Counts

4 → 6

Calls

Call 1

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

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

Calls

3 calls:

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

simplify94.0ms (6.8%)

Memory

1.6MiB live, 152.9MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	48
1	34	48
2	112	48
3	1237	48
0	9508	42

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 6

Calls

Call 1

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

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

rewrite94.0ms (6.7%)

Memory

-13.3MiB live, 187.2MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	29	10
0	229	9

Stop Event

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

Counts

4 → 54

Calls

Call 1

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

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

eval5.0ms (0.4%)

Memory: 21.6MiB live, 21.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 506 to 126 computations (75.1% saved)

prune3.0ms (0.2%)

Memory

-36.3MiB live, 10.7MiB allocated; 1ms collecting garbage

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	58	3	61
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	59	3	62

Accuracy

100.0%

Counts

62 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 x x #s(literal 1 binary64))
▶	49.8%	#s(approx (+ (* x x) 1) (*.f64 x x))
▶	53.6%	#s(approx (+ (* x x) 1) #s(literal 1 binary64))

Compiler

Compiled 20 to 15 computations (25% saved)

series2.0ms (0.1%)

Memory

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

Counts

6 → 6

Calls

Call 1

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

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

Calls

3 calls:

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

simplify66.0ms (4.8%)

Memory

42.2MiB live, 88.9MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	48
1	34	48
2	112	48
3	1237	48
0	9508	42

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 6

Calls

Call 1

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

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

rewrite69.0ms (5%)

Memory

-30.3MiB live, 69.7MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	23
0	9	23
1	32	23
0	232	23

Stop Event

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

Counts

6 → 56

Calls

Call 1

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

Outputs
#s(approx (+ (* x x) 1) #s(literal 1 binary64))
#s(literal 1 binary64)
#s(approx (+ (* x x) 1) (*.f64 x x))
(.f64 (.f64 (neg.f64 x) #s(literal 1 binary64)) (*.f64 (neg.f64 x) #s(literal 1 binary64)))
(.f64 (.f64 (fabs.f64 x) #s(literal 1 binary64)) (*.f64 (fabs.f64 x) #s(literal 1 binary64)))
(.f64 (.f64 x #s(literal 1 binary64)) (*.f64 x #s(literal 1 binary64)))
(*.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) (.f64 (neg.f64 x) #s(literal 1 binary64)))
(*.f64 (neg.f64 x) (neg.f64 x))
(.f64 (fabs.f64 x) (.f64 (fabs.f64 x) #s(literal 1 binary64)))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(.f64 (.f64 x x) #s(literal 1 binary64))
(.f64 #s(literal 1 binary64) (.f64 x x))
(.f64 x (.f64 x #s(literal 1 binary64)))
(*.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)))
x
(/.f64 (-.f64 #s(literal 1 binary64) (pow.f64 x #s(literal 4 binary64))) (-.f64 #s(literal 1 binary64) (*.f64 x x)))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64))) (neg.f64 (fma.f64 x x #s(literal -1 binary64))))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 6 binary64)) #s(literal -1 binary64))) (neg.f64 (-.f64 (+.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64)) (*.f64 x x))))
(/.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64)) (fma.f64 x x #s(literal -1 binary64)))
(/.f64 (-.f64 (pow.f64 x #s(literal 6 binary64)) #s(literal -1 binary64)) (+.f64 #s(literal 1 binary64) (-.f64 (pow.f64 x #s(literal 4 binary64)) (*.f64 x x))))
(/.f64 (-.f64 (pow.f64 x #s(literal 6 binary64)) #s(literal -1 binary64)) (-.f64 (+.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64)) (*.f64 x x)))
(fma.f64 (.f64 (neg.f64 x) #s(literal 1 binary64)) (.f64 (neg.f64 x) #s(literal 1 binary64)) #s(literal 1 binary64))
(fma.f64 (.f64 (fabs.f64 x) #s(literal 1 binary64)) (.f64 (fabs.f64 x) #s(literal 1 binary64)) #s(literal 1 binary64))
(fma.f64 (.f64 x #s(literal 1 binary64)) (.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))
(fma.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) #s(literal 1 binary64))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) #s(literal 1 binary64))
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) #s(literal 1 binary64))
(fma.f64 (neg.f64 x) (*.f64 (neg.f64 x) #s(literal 1 binary64)) #s(literal 1 binary64))
(fma.f64 (neg.f64 x) (neg.f64 x) #s(literal 1 binary64))
(fma.f64 (fabs.f64 x) (*.f64 (fabs.f64 x) #s(literal 1 binary64)) #s(literal 1 binary64))
(fma.f64 (fabs.f64 x) (fabs.f64 x) #s(literal 1 binary64))
(fma.f64 (*.f64 x x) #s(literal 1 binary64) #s(literal 1 binary64))
(fma.f64 #s(literal 1 binary64) (*.f64 x x) #s(literal 1 binary64))
(fma.f64 x (*.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))
(fma.f64 x x #s(literal 1 binary64))
(-.f64 (/.f64 (pow.f64 x #s(literal 4 binary64)) (fma.f64 x x #s(literal -1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 x x #s(literal -1 binary64))))
(-.f64 (*.f64 x x) #s(literal -1 binary64))
(-.f64 #s(literal 1 binary64) (*.f64 (neg.f64 (neg.f64 x)) (neg.f64 x)))
(-.f64 #s(literal 1 binary64) (*.f64 (neg.f64 (fabs.f64 x)) (fabs.f64 x)))
(-.f64 #s(literal 1 binary64) (*.f64 (neg.f64 x) x))
(-.f64 #s(literal 1 binary64) (*.f64 x (neg.f64 x)))
(+.f64 (/.f64 (pow.f64 x #s(literal 6 binary64)) (-.f64 (+.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64)) (.f64 x x))) (/.f64 #s(literal 1 binary64) (-.f64 (+.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64)) (.f64 x x))))
(+.f64 (*.f64 x x) #s(literal 1 binary64))
(+.f64 #s(literal 1 binary64) (*.f64 x x))

eval6.0ms (0.4%)

Memory: 18.1MiB live, 18.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 640 to 128 computations (80% saved)

prune27.0ms (1.9%)

Memory

-32.9MiB live, 11.8MiB allocated; 5ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	66	0	66
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	66	3	69

Accuracy

100.0%

Counts

69 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 45 to 25 computations (44.4% saved)

regimes5.0ms (0.4%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

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

Calls

3 calls:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes4.0ms (0.3%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

3 calls:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes3.0ms (0.2%)

Memory

7.3MiB live, 7.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 x) 1) #s(literal 1 binary64))

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

Calls

3 calls:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch8.0ms (0.6%)

Memory

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

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
7.0ms	0.08037239229293605	1.6971900387362353

Samples

4.0ms

112×

valid

Compiler

Compiled 120 to 106 computations (11.7% saved)

Precisions

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

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

ival-mult: 1.0ms (67% 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)

simplify72.0ms (5.2%)

Memory

-16.4MiB live, 74.1MiB allocated; 31ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	31
1	17	31
2	39	31
3	80	31
4	130	31
5	334	31
6	2629	31
7	6695	31

Stop Event

1×	node limit

Calls

Call 1

Inputs

(fma.f64 x x #s(literal 1 binary64))

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

#s(approx (+ (* x x) 1) #s(literal 1 binary64))

Outputs

(fma.f64 x x #s(literal 1 binary64))

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

#s(approx (+ (* x x) 1) #s(literal 1 binary64))

derivations61.0ms (4.4%)

Memory

35.9MiB live, 77.6MiB allocated; 14ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 31 to 11 computations (64.5% saved)

preprocess41.0ms (3%)

Memory: -20.0MiB live, 23.8MiB allocated; 14ms collecting garbage
Remove: (abs x)
Compiler: Compiled 80 to 36 computations (55% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample525.0ms (37.8%)

explain62.0ms (4.5%)

preprocess238.0ms (17.2%)

eval0.0ms (0%)

prune0.0ms (0%)

series2.0ms (0.1%)

simplify94.0ms (6.8%)

rewrite94.0ms (6.7%)

eval5.0ms (0.4%)

prune3.0ms (0.2%)

series2.0ms (0.1%)

simplify66.0ms (4.8%)

rewrite69.0ms (5%)

eval6.0ms (0.4%)

prune27.0ms (1.9%)

regimes5.0ms (0.4%)

regimes4.0ms (0.3%)

regimes3.0ms (0.2%)

bsearch8.0ms (0.6%)

simplify72.0ms (5.2%)

derivations61.0ms (4.4%)

preprocess41.0ms (3%)

end0.0ms (0%)

Profiling