Metrics for Data.Histogram.Bin.LogBinD:$cbinSizeN from histogram-fill-0.8.4.1

start0.0ms (0%)

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

sample559.0ms (44.9%)

Memory

19.8MiB live, 647.0MiB allocated; 100ms collecting garbage

Samples

335.0ms

8 256×

valid

Precisions

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

ival-mult!: 48.0ms (69.9% of total)

ival-sub!: 19.0ms (27.7% of total)

adjust: 1.0ms (1.5% of total)

Bogosity

preprocess306.0ms (24.6%)

Memory

-36.8MiB live, 54.8MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	14	33
1	37	31
2	81	31
3	159	30
4	210	30
5	358	30
6	1688	30
7	7510	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(negabs x)

Compiler

Compiled 8 to 8 computations (0% saved)

series4.0ms (0.3%)

Memory

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

Counts

4 → 9

Calls

Call 1

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

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

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

rewrite71.0ms (5.7%)

Memory

-11.6MiB live, 131.4MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	31	101
0	32	92
1	155	90
0	1154	90
1	3324	90

Stop Event

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

Counts

13 → 51

Calls

Call 1

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

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

eval4.0ms (0.3%)

Memory: 16.8MiB live, 16.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 175 to 77 computations (56% saved)

prune2.0ms (0.2%)

Memory

10.1MiB live, 10.3MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	43	2	45
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	43	3	46

Accuracy

100.0%

Counts

46 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 15 to 15 computations (0% saved)

series6.0ms (0.5%)

Memory

-26.6MiB live, 20.2MiB allocated; 2ms collecting garbage

Counts

7 → 14

Calls

Call 1

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

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

Calls

6 calls:

Time	Variable		Point	Expression
2.0ms	y	@	-inf	((- (* x y) x) (neg x) x (* (- y 1) x) (- y 1) y 1)
1.0ms	x	@	-inf	((- (* x y) x) (neg x) x (* (- y 1) x) (- y 1) y 1)
1.0ms	y	@	0	((- (* x y) x) (neg x) x (* (- y 1) x) (- y 1) y 1)
1.0ms	x	@	inf	((- (* x y) x) (neg x) x (* (- y 1) x) (- y 1) y 1)
1.0ms	x	@	0	((- (* x y) x) (neg x) x (* (- y 1) x) (- y 1) y 1)

rewrite77.0ms (6.2%)

Memory

37.2MiB live, 135.6MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	47	160
0	50	147
1	221	145
0	1561	145
1	4494	145

Stop Event

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

Counts

21 → 64

Calls

Call 1

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

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

eval7.0ms (0.6%)

Memory: -29.5MiB live, 15.9MiB allocated; 6ms collecting garbage
Compiler: Compiled 205 to 101 computations (50.7% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	52	1	53
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	52	4	56

Accuracy

100.0%

Counts

56 → 4

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 21 computations (0% saved)

series3.0ms (0.2%)

Memory

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

Counts

4 → 9

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite61.0ms (4.9%)

Memory

-4.9MiB live, 85.4MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	32	105
0	33	96
1	157	94
0	1154	94
1	3325	94

Stop Event

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

Counts

13 → 14

Calls

Call 1

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

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

eval1.0ms (0%)

Memory: 2.3MiB live, 2.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 27 to 22 computations (18.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	6	0	6
Fresh	0	0	0
Picked	0	1	1
Done	0	3	3
Total	6	4	10

Accuracy

100.0%

Counts

10 → 4

Alt Table

Click to see full alt table

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

Compiler

Compiled 36 to 34 computations (5.6% saved)

regimes6.0ms (0.4%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

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

Calls

3 calls:

2.0ms	x
2.0ms	y
2.0ms	(-.f64 (*.f64 x y) 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)

regimes17.0ms (1.3%)

Memory

-26.7MiB live, 26.3MiB allocated; 9ms collecting garbage

Counts

2 → 3

Calls

Call 1

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

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

Calls

3 calls:

14.0ms	x
1.0ms	y
1.0ms	(-.f64 (*.f64 x y) x)

Results

Accuracy	Segments	Branch
82.7%	3	`(-.f64 (*.f64 x y) x)`
58.4%	3	`x`
97.5%	3	`y`

Compiler

Compiled 6 to 8 computations (-33.3% saved)

regimes3.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 y) x) (neg.f64 x))

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

Calls

3 calls:

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

Results

Accuracy	Segments	Branch
48.2%	1	`x`
48.2%	1	`(-.f64 (*.f64 x y) x)`
48.2%	1	`y`

Compiler

Compiled 6 to 8 computations (-33.3% saved)

bsearch42.0ms (3.4%)

Memory

-5.1MiB live, 41.4MiB allocated; 3ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
7.0ms	0.10003494722849415	93.38689057677414
34.0ms	-249.02731976862125	-0.03459771979788544

Samples

33.0ms

256×

valid

Compiler

Compiled 200 to 233 computations (-16.5% saved)

Precisions

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

ival-mult!: 2.0ms (90.1% of total)

ival-sub!: 1.0ms (45.1% of total)

adjust: 0.0ms (0% of total)

derivations19.0ms (1.5%)

Memory

-5.2MiB live, 40.3MiB allocated; 5ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 19 to 16 computations (15.8% saved)

preprocess56.0ms (4.5%)

Memory: 25.5MiB live, 71.7MiB allocated; 4ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 77 to 70 computations (9.1% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample559.0ms (44.9%)

preprocess306.0ms (24.6%)

series4.0ms (0.3%)

rewrite71.0ms (5.7%)

eval4.0ms (0.3%)

prune2.0ms (0.2%)

series6.0ms (0.5%)

rewrite77.0ms (6.2%)

eval7.0ms (0.6%)

prune2.0ms (0.2%)

series3.0ms (0.2%)

rewrite61.0ms (4.9%)

eval1.0ms (0%)

prune2.0ms (0.1%)

regimes6.0ms (0.4%)

regimes17.0ms (1.3%)

regimes3.0ms (0.2%)

bsearch42.0ms (3.4%)

derivations19.0ms (1.5%)

preprocess56.0ms (4.5%)

end0.0ms (0%)

Profiling