Metrics for Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendOutside from plot-0.2.3.4, A

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.5MiB live, 0.5MiB 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 6 computations (14.3% saved)

sample521.0ms (45.2%)

Memory

-0.9MiB live, 542.4MiB allocated; 203ms collecting garbage

Samples

322.0ms

8 256×

valid

Precisions

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

ival-add!: 50.0ms (98.2% of total)

adjust: 1.0ms (2% of total)

Bogosity

preprocess128.0ms (11.1%)

Memory

4.3MiB live, 48.3MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	43	30
2	113	30
3	167	30
4	191	30
5	221	30
6	310	30
7	555	30
8	3113	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 8 computations (0% saved)

series3.0ms (0.2%)

Memory

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

Counts

4 → 13

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite103.0ms (9%)

Memory

19.2MiB live, 118.1MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	51	161
0	52	147
1	274	147
0	2184	132
1	6902	132

Stop Event

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

Counts

17 → 37

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 6.2MiB live, 6.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 103 to 65 computations (36.9% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	27	3	30
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	28	3	31

Accuracy

100.0%

Counts

31 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 x #s(literal 2 binary64) y)
▶	48.2%	#s(approx (+ (+ x y) x) (+.f64 x x))
▶	52.3%	#s(approx (+ (+ x y) x) y)

Compiler

Compiled 15 to 15 computations (0% saved)

series3.0ms (0.2%)

Memory

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

Counts

7 → 8

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite68.0ms (5.9%)

Memory

-31.7MiB live, 59.0MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	37	116
0	40	111
1	217	79
0	1800	75
1	5048	75

Stop Event

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

Counts

15 → 32

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 5.5MiB live, 5.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 78 to 51 computations (34.6% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

5 alts after pruning (2 fresh and 3 done)

	Pruned	Kept	Total
New	23	2	25
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	23	5	28

Accuracy

100.0%

Counts

28 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x #s(literal 2 binary64) y)
▶	42.2%	(-.f64 y #s(literal -2 binary64))
✓	48.2%	#s(approx (+ (+ x y) x) (+.f64 x x))
▶	3.4%	#s(approx (+ (+ x y) x) #s(approx (+ x x) #s(literal 2 binary64)))
✓	52.3%	#s(approx (+ (+ x y) x) y)

Compiler

Compiled 26 to 27 computations (-3.8% saved)

series2.0ms (0.2%)

Memory

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

Counts

6 → 10

Calls

Call 1

Inputs
#s(approx (+ (+ x y) x) #s(approx (+ x x) #s(literal 2 binary64)))
#s(approx (+ x x) #s(literal 2 binary64))
#s(literal 2 binary64)
(-.f64 y #s(literal -2 binary64))
y
#s(literal -2 binary64)

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

Calls

6 calls:

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

rewrite129.0ms (11.2%)

Memory

-5.5MiB live, 140.0MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	45	134
0	45	116
1	259	78
2	2230	78
0	9417	78
1	21310	78

Stop Event

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

Counts

16 → 53

Calls

Call 1

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

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

eval3.0ms (0.3%)

Memory: 8.9MiB live, 8.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 116 to 74 computations (36.2% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

5 alts after pruning (0 fresh and 5 done)

	Pruned	Kept	Total
New	39	0	39
Fresh	0	0	0
Picked	0	2	2
Done	0	3	3
Total	39	5	44

Accuracy

100.0%

Counts

44 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x #s(literal 2 binary64) y)
✓	42.2%	(-.f64 y #s(literal -2 binary64))
✓	48.2%	#s(approx (+ (+ x y) x) (+.f64 x x))
✓	3.4%	#s(approx (+ (+ x y) x) #s(approx (+ x x) #s(literal 2 binary64)))
✓	52.3%	#s(approx (+ (+ x y) x) y)

Compiler

Compiled 44 to 43 computations (2.3% saved)

regimes7.0ms (0.6%)

Memory

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

Counts

6 → 1

Calls

Call 1

Inputs
#s(approx (+ (+ x y) x) y)
#s(approx (+ (+ x y) x) #s(approx (+ x x) #s(literal 2 binary64)))
(-.f64 y #s(literal -2 binary64))
#s(approx (+ (+ x y) x) (+.f64 x x))
(fma.f64 x #s(literal 2 binary64) y)
(+.f64 (+.f64 x y) x)

Outputs
(fma.f64 x #s(literal 2 binary64) y)

Calls

3 calls:

2.0ms	(+.f64 (+.f64 x y) x)
2.0ms	y
2.0ms	x

Results

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

Compiler

Compiled 6 to 8 computations (-33.3% saved)

regimes9.0ms (0.8%)

Memory

-36.0MiB live, 10.3MiB allocated; 4ms collecting garbage

Counts

4 → 3

Calls

Call 1

Inputs
#s(approx (+ (+ x y) x) y)
#s(approx (+ (+ x y) x) #s(approx (+ x x) #s(literal 2 binary64)))
(-.f64 y #s(literal -2 binary64))
#s(approx (+ (+ x y) x) (+.f64 x x))

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

Calls

3 calls:

5.0ms	x
2.0ms	(+.f64 (+.f64 x y) x)
2.0ms	y

Results

Accuracy	Segments	Branch
59.9%	3	`(+.f64 (+.f64 x y) x)`
73.6%	3	`x`
79.8%	3	`y`

Compiler

Compiled 6 to 8 computations (-33.3% saved)

regimes5.0ms (0.4%)

Memory

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

Accuracy

Total -31.7b remaining (-103.7%)

Threshold costs -31.7b (-103.7%)

Counts

3 → 1

Calls

Call 1

Inputs
#s(approx (+ (+ x y) x) y)
#s(approx (+ (+ x y) x) #s(approx (+ x x) #s(literal 2 binary64)))
(-.f64 y #s(literal -2 binary64))

Outputs
#s(approx (+ (+ x y) x) y)

Calls

3 calls:

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

Results

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

Compiler

Compiled 6 to 8 computations (-33.3% saved)

bsearch17.0ms (1.5%)

Memory

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

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
8.0ms	2765.362990813451	858017372.318526
8.0ms	-8.320166682201512e-80	-1.2937046624963888e-85

Samples

6.0ms

288×

valid

Compiler

Compiled 206 to 243 computations (-18% saved)

Precisions

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

ival-add!: 1.0ms (68.2% of total)

adjust: 0.0ms (0% of total)

derivations114.0ms (9.9%)

Memory

-43.9MiB live, 28.2MiB allocated; 153ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 17 to 15 computations (11.8% saved)

preprocess29.0ms (2.5%)

Memory: -13.4MiB live, 39.1MiB allocated; 18ms collecting garbage
Compiler: Compiled 21 to 19 computations (9.5% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample521.0ms (45.2%)

preprocess128.0ms (11.1%)

series3.0ms (0.2%)

rewrite103.0ms (9%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

series3.0ms (0.2%)

rewrite68.0ms (5.9%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

series2.0ms (0.2%)

rewrite129.0ms (11.2%)

eval3.0ms (0.3%)

prune3.0ms (0.2%)

regimes7.0ms (0.6%)

regimes9.0ms (0.8%)

regimes5.0ms (0.4%)

bsearch17.0ms (1.5%)

derivations114.0ms (9.9%)

preprocess29.0ms (2.5%)

end0.0ms (0%)

Profiling