Metrics for Data.Random.Distribution.T:$ccdf from random-fu-0.2.6.2

start0.0ms (0%)

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

analyze33.0ms (1.5%)

Memory

-5.4MiB live, 41.9MiB allocated; 7ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
50%	50%	50%	0.1%	0%	0%	0%	3
50%	50%	50%	0.1%	0%	0%	0%	4
75%	74.9%	25%	0.1%	0%	0%	0%	5
75%	74.9%	25%	0.1%	0%	0%	0%	6
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	7
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	8
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	9
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	10
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	11
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	12

Compiler

Compiled 9 to 7 computations (22.2% saved)

sample619.0ms (27.8%)

Memory

7.4MiB live, 907.8MiB allocated; 167ms collecting garbage

Samples

358.0ms

8 256×

valid

Precisions

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

ival-div!: 101.0ms (62.4% of total)

ival-add!: 59.0ms (36.4% of total)

adjust: 1.0ms (0.6% of total)

Bogosity

preprocess33.0ms (1.5%)

Memory

-10.9MiB live, 34.8MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	17	48
1	73	42
2	313	42
3	1748	42

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Compiler

Compiled 14 to 10 computations (28.6% saved)

series9.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	49	147

Stop Event

1×	iter-limit

Counts

5 → 13

Calls

Call 1

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

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

Calls

6 calls:

Time	Variable	Point
1.0ms	y	inf
1.0ms	x	-inf
1.0ms	y	-inf
1.0ms	x	inf
1.0ms	y	0

rewrite27.0ms (1.2%)

Memory

-18.2MiB live, 24.0MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	15
0	8	15
0	50	15

Stop Event

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

Counts

5 → 19

Calls

Call 1

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

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

eval3.0ms (0.1%)

Memory: 6.7MiB live, 6.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 352 to 105 computations (70.2% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	25	3	28
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	25	4	29

Accuracy

100.0%

Counts

29 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(/.f64 (+.f64 x y) (+.f64 y y))
▶	100.0%	#s(approx (/ (+ x y) (+ y y)) (+.f64 #s(literal 1/2 binary64) (*.f64 #s(literal 1/2 binary64) (/.f64 x y))))
▶	44.5%	#s(approx (/ (+ x y) (+ y y)) (*.f64 #s(literal 1/2 binary64) (/.f64 x y)))
▶	56.2%	#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Compiler

Compiled 44 to 31 computations (29.5% saved)

series10.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	31	104

Stop Event

1×	iter-limit

Counts

9 → 9

Calls

Call 1

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

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

Calls

6 calls:

Time	Variable	Point
2.0ms	y	-inf
2.0ms	y	inf
1.0ms	x	-inf
1.0ms	x	inf
1.0ms	x	0

rewrite28.0ms (1.3%)

Memory

-8.2MiB live, 32.6MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	55
0	15	55
0	89	53

Stop Event

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

Counts

9 → 22

Calls

Call 1

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

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

eval3.0ms (0.1%)

Memory: 9.6MiB live, 9.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 559 to 108 computations (80.7% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	31	1	32
Fresh	0	0	0
Picked	1	2	3
Done	1	0	1
Total	33	3	36

Accuracy

100.0%

Counts

36 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 x y) #s(literal 1/2 binary64) #s(literal 1/2 binary64)))
✓	44.5%	#s(approx (/ (+ x y) (+ y y)) (*.f64 #s(literal 1/2 binary64) (/.f64 x y)))
✓	56.2%	#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Status

Accuracy

Program

▶

100.0%

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

✓

44.5%

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

✓

56.2%

#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Compiler

Compiled 36 to 25 computations (30.6% saved)

series5.0ms (0.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	33	105

Stop Event

1×	iter-limit

Counts

6 → 9

Calls

Call 1

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

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

Calls

6 calls:

Time	Variable	Point
1.0ms	x	-inf
1.0ms	x	inf
1.0ms	y	-inf
1.0ms	y	inf
1.0ms	x	0

rewrite1.4s (61.4%)

Memory

-171.7MiB live, 173.1MiB allocated; 1.9s collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	26
0	12	26
0	85	26

Stop Event

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

Counts

6 → 17

Calls

Call 1

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

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

eval2.0ms (0.1%)

Memory: 4.1MiB live, 4.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 355 to 82 computations (76.9% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

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

Accuracy

100.0%

Counts

22 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 x y) #s(literal 1/2 binary64) #s(literal 1/2 binary64)))
✓	44.5%	#s(approx (/ (+ x y) (+ y y)) (*.f64 #s(literal 1/2 binary64) (/.f64 x y)))
✓	56.2%	#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Status

Accuracy

Program

✓

100.0%

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

✓

44.5%

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

✓

56.2%

#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Compiler

Compiled 36 to 25 computations (30.6% saved)

regimes41.0ms (1.8%)

Memory

-30.9MiB live, 30.1MiB allocated; 21ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

2 → 3

5 → 1

Calls

Call 1

Inputs
#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Outputs
#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Call 2

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

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

Outputs

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

#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

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

Call 3

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

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

Calls

9 calls:

4.0ms	y
2.0ms	y
2.0ms	x
2.0ms	(/.f64 (+.f64 x y) (+.f64 y y))
1.0ms	x

Results

Accuracy	Segments	Branch
56.2%	1	`x`
56.2%	1	`y`
56.2%	1	`(/.f64 (+.f64 x y) (+.f64 y y))`
97.5%	3	`(/.f64 (+.f64 x y) (+.f64 y y))`
76.4%	3	`x`
78.0%	3	`y`
100.0%	1	`(/.f64 (+.f64 x y) (+.f64 y y))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 85 to 44 computations (48.2% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

2×	left-value

Steps

Time	Left	Right
0.0ms	0.5000000000425083	151083.59586152114
0.0ms	-1.2426852147572796	0.49267203384915115

Compiler

Compiled 10 to 10 computations (0% saved)

derivations3.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 78 to 21 computations (73.1% saved)

preprocess38.0ms (1.7%)

Memory: -14.0MiB live, 29.1MiB allocated; 8ms collecting garbage
Compiler: Compiled 85 to 26 computations (69.4% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze33.0ms (1.5%)

sample619.0ms (27.8%)

preprocess33.0ms (1.5%)

series9.0ms (0.4%)

rewrite27.0ms (1.2%)

eval3.0ms (0.1%)

prune2.0ms (0.1%)

series10.0ms (0.4%)

rewrite28.0ms (1.3%)

eval3.0ms (0.1%)

prune2.0ms (0.1%)

series5.0ms (0.2%)

rewrite1.4s (61.4%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

regimes41.0ms (1.8%)

bsearch0.0ms (0%)

derivations3.0ms (0.1%)

preprocess38.0ms (1.7%)

end0.0ms (0%)

Profiling