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.6MiB live, 0.6MiB 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)

sample725.0ms (64.5%)

Memory

-23.0MiB live, 938.2MiB allocated; 234ms collecting garbage

Samples

487.0ms

8 256×

valid

Precisions

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

ival-mult: 72.0ms (63.4% of total)

ival-sub: 37.0ms (32.6% of total)

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

adjust: 2.0ms (1.8% of total)

Bogosity

explain48.0ms (4.3%)

Memory

17.6MiB live, 112.6MiB allocated; 7ms collecting garbage

FPErrors

Click to see full error table

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

20.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 (60.2% of total)

ival-sub: 2.0ms (30.1% of total)

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

adjust: 0.0ms (0% of total)

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

preprocess36.0ms (3.2%)

Memory

-18.7MiB live, 28.4MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	38
1	19	38
0	4	5
0	6	5
1	7	5
0	7	5

Stop Event

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

Calls

Call 1

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

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

Compiler

Compiled 5 to 4 computations (20% saved)

series4.0ms (0.4%)

Memory

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

Counts

4 → 10

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 (* x 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)

rewrite52.0ms (4.6%)

Memory

15.3MiB live, 65.6MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	32	110
0	34	104
1	139	101
0	1044	101

Stop Event

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

Counts

14 → 21

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 (* x 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 (neg.f64 (-.f64 (pow.f64 (.f64 y x) #s(literal 2 binary64)) (.f64 x x))) (neg.f64 (fma.f64 y x x)))
(/.f64 (neg.f64 (-.f64 (pow.f64 (.f64 y x) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x (fma.f64 y x x) (pow.f64 (.f64 y x) #s(literal 2 binary64)))))
(/.f64 (-.f64 (pow.f64 (.f64 y x) #s(literal 2 binary64)) (.f64 x x)) (fma.f64 y x x))
(/.f64 (-.f64 (pow.f64 (.f64 y x) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x (fma.f64 y x x) (pow.f64 (.f64 y x) #s(literal 2 binary64))))
(-.f64 (/.f64 (pow.f64 (.f64 y x) #s(literal 2 binary64)) (fma.f64 y x x)) (/.f64 (.f64 x x) (fma.f64 y x x)))
(-.f64 (/.f64 (pow.f64 (.f64 y x) #s(literal 3 binary64)) (fma.f64 x (fma.f64 y x x) (pow.f64 (.f64 y x) #s(literal 2 binary64)))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x (fma.f64 y x x) (pow.f64 (*.f64 y x) #s(literal 2 binary64)))))
(-.f64 (*.f64 y x) x)
(*.f64 y x)
(*.f64 x y)
x
y
#s(approx (- (* x y) x) (*.f64 (-.f64 y #s(literal 1 binary64)) x))
#s(approx (* x y) (*.f64 y x))
#s(approx x x)
#s(approx (- (* x y) x) (*.f64 (neg.f64 x) (-.f64 #s(literal 1 binary64) y)))
#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 y x))
#s(approx (- (* x y) x) (*.f64 (-.f64 x (/.f64 x y)) y))
#s(approx (- (* x y) x) (*.f64 (-.f64 (/.f64 x y) x) (neg.f64 y)))

eval2.0ms (0.2%)

Memory: 6.5MiB live, 6.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 264 to 60 computations (77.3% saved)

prune6.0ms (0.5%)

Memory

-39.5MiB live, 7.3MiB allocated; 5ms collecting garbage

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	20	3	23
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	20	4	24

Accuracy

100.0%

Counts

24 → 4

Alt Table

Click to see full alt table

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

Compiler

Compiled 33 to 24 computations (27.3% saved)

series6.0ms (0.5%)

Memory

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

Counts

10 → 22

Calls

Call 1

Inputs
#s(approx (- (* x y) x) (neg.f64 x))
(neg.f64 x)
x
#s(approx (- (* x y) x) (*.f64 y x))
(*.f64 y x)
y
#s(approx (- (* x y) x) (*.f64 (-.f64 y #s(literal 1 binary64)) x))
(*.f64 (-.f64 y #s(literal 1 binary64)) x)
(-.f64 y #s(literal 1 binary64))
#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 (* y x) #s(hole binary64 (* x y)))
#s(approx (* (- y 1) x) #s(hole binary64 (* x (- y 1))))
#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 (* (- y 1) x) #s(hole binary64 (* -1 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 (- (* 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) x) #s(hole binary64 (* x y)))
#s(approx (* (- y 1) x) #s(hole binary64 (* y (+ x (* -1 (/ x y))))))
#s(approx (- y 1) #s(hole binary64 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) 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
1.0ms	x	@	-inf	((- (* x y) x) (neg x) x (- (* x y) x) (* y x) y (- (* x y) x) (* (- y 1) x) (- y 1) 1)
1.0ms	y	@	0	((- (* x y) x) (neg x) x (- (* x y) x) (* y x) y (- (* x y) x) (* (- y 1) x) (- y 1) 1)
1.0ms	y	@	-inf	((- (* x y) x) (neg x) x (- (* x y) x) (* y x) y (- (* x y) x) (* (- y 1) x) (- y 1) 1)
1.0ms	x	@	inf	((- (* x y) x) (neg x) x (- (* x y) x) (* y x) y (- (* x y) x) (* (- y 1) x) (- y 1) 1)
1.0ms	y	@	inf	((- (* x y) x) (neg x) x (- (* x y) x) (* y x) y (- (* x y) x) (* (- y 1) x) (- y 1) 1)

rewrite57.0ms (5.1%)

Memory

-8.2MiB live, 85.7MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	59	265
0	63	251
1	207	246
0	1458	246

Stop Event

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

Counts

32 → 72

Calls

Call 1

Inputs
#s(approx (- (* x y) x) (neg.f64 x))
(neg.f64 x)
x
#s(approx (- (* x y) x) (*.f64 y x))
(*.f64 y x)
y
#s(approx (- (* x y) x) (*.f64 (-.f64 y #s(literal 1 binary64)) x))
(*.f64 (-.f64 y #s(literal 1 binary64)) x)
(-.f64 y #s(literal 1 binary64))
#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 (* y x) #s(hole binary64 (* x y)))
#s(approx (* (- y 1) x) #s(hole binary64 (* x (- y 1))))
#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 (* (- y 1) x) #s(hole binary64 (* -1 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 (- (* 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) x) #s(hole binary64 (* x y)))
#s(approx (* (- y 1) x) #s(hole binary64 (* y (+ x (* -1 (/ x y))))))
#s(approx (- y 1) #s(hole binary64 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) 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 (* (- y 1) x) (neg.f64 x))
(*.f64 #s(literal -1 binary64) x)
(*.f64 x #s(literal -1 binary64))
(neg.f64 x)
x
#s(approx (* (- y 1) x) (*.f64 y x))
(*.f64 y x)
(*.f64 x y)
y
#s(approx (* (- y 1) x) (-.f64 (*.f64 y x) x))
(*.f64 (-.f64 y #s(literal 1 binary64)) x)
(*.f64 x (+.f64 #s(literal -1 binary64) y))
(*.f64 x (-.f64 y #s(literal 1 binary64)))
(/.f64 (*.f64 (fma.f64 y y #s(literal -1 binary64)) x) (-.f64 y #s(literal -1 binary64)))
(/.f64 (*.f64 (-.f64 (pow.f64 y #s(literal 3 binary64)) #s(literal 1 binary64)) x) (fma.f64 y y (-.f64 y #s(literal -1 binary64))))
(/.f64 (*.f64 x (fma.f64 y y #s(literal -1 binary64))) (-.f64 y #s(literal -1 binary64)))
(/.f64 (*.f64 x (-.f64 (pow.f64 y #s(literal 3 binary64)) #s(literal 1 binary64))) (fma.f64 y y (-.f64 y #s(literal -1 binary64))))
(/.f64 (-.f64 (.f64 x x) (pow.f64 (.f64 y x) #s(literal 2 binary64))) (*.f64 x (-.f64 #s(literal -1 binary64) y)))
(/.f64 (-.f64 (pow.f64 (neg.f64 x) #s(literal 3 binary64)) (pow.f64 (.f64 (neg.f64 y) x) #s(literal 3 binary64))) (fma.f64 x x (+.f64 (pow.f64 (.f64 y x) #s(literal 2 binary64)) (.f64 (neg.f64 x) (.f64 (neg.f64 y) x)))))
(/.f64 (neg.f64 (-.f64 (pow.f64 (.f64 y x) #s(literal 2 binary64)) (.f64 x x))) (neg.f64 (fma.f64 y x x)))
(/.f64 (neg.f64 (-.f64 (pow.f64 (.f64 y x) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x (fma.f64 y x x) (pow.f64 (.f64 y x) #s(literal 2 binary64)))))
(/.f64 (neg.f64 (-.f64 (.f64 x x) (pow.f64 (.f64 y x) #s(literal 2 binary64)))) (neg.f64 (*.f64 x (-.f64 #s(literal -1 binary64) y))))
(/.f64 (neg.f64 (fma.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal -1 binary64) (pow.f64 (.f64 y x) #s(literal 3 binary64)))) (neg.f64 (fma.f64 (.f64 y x) (-.f64 (.f64 y x) (neg.f64 x)) (.f64 x x))))
(/.f64 (-.f64 (pow.f64 (.f64 y x) #s(literal 2 binary64)) (.f64 x x)) (-.f64 (*.f64 y x) (neg.f64 x)))
(/.f64 (-.f64 (pow.f64 (.f64 y x) #s(literal 2 binary64)) (.f64 x x)) (fma.f64 y x x))
(/.f64 (-.f64 (pow.f64 (.f64 y x) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x (fma.f64 y x x) (pow.f64 (.f64 y x) #s(literal 2 binary64))))
(/.f64 (fma.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal -1 binary64) (pow.f64 (.f64 y x) #s(literal 3 binary64))) (fma.f64 (.f64 y x) (-.f64 (.f64 y x) (neg.f64 x)) (.f64 x x)))
(/.f64 (fma.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal -1 binary64) (pow.f64 (.f64 y x) #s(literal 3 binary64))) (fma.f64 x (fma.f64 y x x) (pow.f64 (.f64 y x) #s(literal 2 binary64))))
(fma.f64 #s(literal -1 binary64) x (*.f64 y x))
(fma.f64 y x (neg.f64 x))
(fma.f64 x #s(literal -1 binary64) (*.f64 y x))
(fma.f64 x y (neg.f64 x))
(-.f64 (/.f64 (pow.f64 (.f64 y x) #s(literal 2 binary64)) (fma.f64 y x x)) (/.f64 (.f64 x x) (fma.f64 y x x)))
(-.f64 (/.f64 (pow.f64 (.f64 y x) #s(literal 3 binary64)) (fma.f64 x (fma.f64 y x x) (pow.f64 (.f64 y x) #s(literal 2 binary64)))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x (fma.f64 y x x) (pow.f64 (*.f64 y x) #s(literal 2 binary64)))))
(-.f64 (/.f64 (.f64 x x) (.f64 x (-.f64 #s(literal -1 binary64) y))) (/.f64 (pow.f64 (.f64 y x) #s(literal 2 binary64)) (.f64 x (-.f64 #s(literal -1 binary64) y))))
(-.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 (pow.f64 (neg.f64 x) #s(literal 3 binary64)) (fma.f64 (.f64 y x) (-.f64 (.f64 y x) (neg.f64 x)) (.f64 x x))) (/.f64 (pow.f64 (.f64 y x) #s(literal 3 binary64)) (fma.f64 (.f64 y x) (-.f64 (.f64 y x) (neg.f64 x)) (*.f64 x x))))
(+.f64 (neg.f64 x) (*.f64 y x))
(+.f64 (*.f64 y x) (neg.f64 x))
(/.f64 (neg.f64 (fma.f64 y y #s(literal -1 binary64))) (neg.f64 (-.f64 y #s(literal -1 binary64))))
(/.f64 (neg.f64 (-.f64 (pow.f64 y #s(literal 3 binary64)) #s(literal 1 binary64))) (neg.f64 (fma.f64 y y (-.f64 y #s(literal -1 binary64)))))
(/.f64 (fma.f64 y y #s(literal -1 binary64)) (-.f64 y #s(literal -1 binary64)))
(/.f64 (-.f64 (pow.f64 y #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 y y (-.f64 y #s(literal -1 binary64))))
(-.f64 (/.f64 (*.f64 y y) (-.f64 y #s(literal -1 binary64))) (/.f64 #s(literal 1 binary64) (-.f64 y #s(literal -1 binary64))))
(-.f64 (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y (-.f64 y #s(literal -1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 y y (-.f64 y #s(literal -1 binary64)))))
(-.f64 y #s(literal 1 binary64))
(+.f64 y #s(literal -1 binary64))
#s(literal 1 binary64)
#s(approx (* (- y 1) x) (-.f64 (*.f64 y x) x))
#s(approx (neg x) (neg.f64 x))
#s(approx x x)
#s(approx (* y x) (*.f64 y x))
#s(approx (* (- y 1) x) (-.f64 (*.f64 y x) x))
#s(approx (* (- y 1) x) (*.f64 (-.f64 #s(literal 1 binary64) y) (neg.f64 x)))
#s(approx (* (- y 1) x) (neg.f64 x))
#s(approx (* (- y 1) x) (-.f64 (*.f64 y x) x))
#s(approx y y)
#s(approx (* (- y 1) x) (neg.f64 x))
#s(approx (* (- y 1) 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 1) x) (*.f64 y x))
#s(approx (* (- y 1) x) (*.f64 (-.f64 x (/.f64 x y)) y))
#s(approx (* (- y 1) x) (*.f64 y x))
#s(approx (* (- y 1) x) (*.f64 (-.f64 x (/.f64 x y)) y))
#s(approx (- y 1) y)
#s(approx (- y 1) (*.f64 (-.f64 #s(literal 1 binary64) (pow.f64 y #s(literal -1 binary64))) y))
#s(approx (* (- y 1) x) (*.f64 (-.f64 (/.f64 x y) x) (neg.f64 y)))
#s(approx (* (- y 1) x) (*.f64 (-.f64 (/.f64 x y) x) (neg.f64 y)))
#s(approx (- y 1) (*.f64 (-.f64 (pow.f64 y #s(literal -1 binary64)) #s(literal 1 binary64)) (neg.f64 y)))

eval6.0ms (0.6%)

Memory: 20.0MiB live, 20.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 1 114 to 215 computations (80.7% saved)

prune5.0ms (0.4%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	68	0	68
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	68	4	72

Accuracy

100.0%

Counts

72 → 4

Alt Table

Click to see full alt table

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

Compiler

Compiled 66 to 38 computations (42.4% saved)

regimes15.0ms (1.3%)

Memory

-18.8MiB live, 33.9MiB allocated; 8ms 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))
#s(approx (- (* x y) x) (*.f64 (-.f64 y #s(literal 1 binary64)) x))
(-.f64 (*.f64 x y) x)

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

Calls

3 calls:

10.0ms	y
2.0ms	x
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 7 to 8 computations (-14.3% saved)

regimes13.0ms (1.1%)

Memory

-24.9MiB live, 17.3MiB allocated; 10ms 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:

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

Results

Accuracy	Segments	Branch
66.0%	3	`(-.f64 (*.f64 x y) x)`
58.5%	4	`x`
96.5%	3	`y`

Compiler

Compiled 7 to 8 computations (-14.3% saved)

regimes3.0ms (0.3%)

Memory

15.3MiB live, 15.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
50.9%	1	`x`
50.9%	1	`(-.f64 (*.f64 x y) x)`
50.9%	1	`y`

Compiler

Compiled 7 to 8 computations (-14.3% saved)

bsearch37.0ms (3.3%)

Memory

-2.0MiB live, 79.6MiB allocated; 20ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
10.0ms	0.00010902196842585223	907.888955851329
20.0ms	-40525.24778716111	-3.453775850943408e-10

Samples

19.0ms

304×

valid

Compiler

Compiled 331 to 275 computations (16.9% saved)

Precisions

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

ival-mult: 2.0ms (49% of total)

ival-sub: 1.0ms (24.5% of total)

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

adjust: 0.0ms (0% of total)

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

simplify70.0ms (6.2%)

Memory

18.2MiB live, 68.1MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	45
1	28	45
2	35	45
3	49	45
4	84	45
5	317	45
6	2763	45
7	6541	45

Stop Event

1×	node limit

Calls

Call 1

Inputs

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

(if (<=.f64 y #s(literal -1 binary64)) #s(approx (- (* x y) x) (*.f64 y x)) (if (<=.f64 y #s(literal 1 binary64)) #s(approx (- (* x y) x) (neg.f64 x)) #s(approx (- (* x y) x) (*.f64 y x))))

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

Outputs
#s(approx (- (* x y) x) (*.f64 (-.f64 y #s(literal 1 binary64)) x))
(if (<=.f64 y #s(literal -1 binary64)) #s(approx (- (* x y) x) (.f64 y x)) (if (<=.f64 y #s(literal 1 binary64)) #s(approx (- ( x y) x) (neg.f64 x)) #s(approx (- (* x y) x) (*.f64 y x))))
(if (or (<=.f64 y #s(literal -1 binary64)) (not (<=.f64 y #s(literal 1 binary64)))) #s(approx (- (* x y) x) (.f64 y x)) #s(approx (- ( x y) x) (neg.f64 x)))
#s(approx (- (* x y) x) (neg.f64 x))

derivations10.0ms (0.9%)

Memory

22.3MiB live, 22.4MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 45 to 18 computations (60% saved)

preprocess28.0ms (2.5%)

Memory: 17.3MiB live, 52.6MiB allocated; 15ms collecting garbage
Compiler: Compiled 100 to 44 computations (56% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample725.0ms (64.5%)

explain48.0ms (4.3%)

preprocess36.0ms (3.2%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.4%)

rewrite52.0ms (4.6%)

eval2.0ms (0.2%)

prune6.0ms (0.5%)

series6.0ms (0.5%)

rewrite57.0ms (5.1%)

eval6.0ms (0.6%)

prune5.0ms (0.4%)

regimes15.0ms (1.3%)

regimes13.0ms (1.1%)

regimes3.0ms (0.3%)

bsearch37.0ms (3.3%)

simplify70.0ms (6.2%)

derivations10.0ms (0.9%)

preprocess28.0ms (2.5%)

end0.0ms (0%)

Profiling