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)

sample489.0ms (54.8%)

Memory

4.1MiB live, 709.9MiB allocated; 144ms collecting garbage

Samples

304.0ms

8 256×

valid

Precisions

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

ival-mult!: 54.0ms (72.2% of total)

ival-sub!: 20.0ms (26.8% of total)

adjust: 1.0ms (1.3% of total)

Bogosity

explain49.0ms (5.5%)

Memory

6.3MiB live, 105.2MiB allocated; 11ms 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: 4.0ms

ival-mult!: 3.0ms (68.6% of total)

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

adjust: 0.0ms (0% of total)

preprocess15.0ms (1.6%)

Memory

-13.8MiB live, 31.8MiB allocated; 3ms 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

1.4MiB live, 1.4MiB 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.5%)

Memory

9.2MiB live, 9.2MiB 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)

rewrite95.0ms (10.6%)

Memory

5.4MiB live, 139.3MiB allocated; 65ms 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: 8.3MiB live, 8.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 264 to 60 computations (77.3% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	21	2	23
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	21	3	24

Accuracy

100.0%

Counts

24 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (*.f64 x y) x)
▶	51.8%	#s(approx (- (* x y) x) (*.f64 y x))
▶	51.4%	#s(approx (- (* x y) x) (neg.f64 x))

Compiler

Compiled 22 to 16 computations (27.3% saved)

series3.0ms (0.3%)

Memory

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

Counts

6 → 11

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

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

rewrite61.0ms (6.8%)

Memory

-24.9MiB live, 63.3MiB allocated; 21ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	37	130
0	39	123
1	144	120
0	1047	120

Stop Event

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

Counts

17 → 20

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) #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 (- (* 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
#s(approx (- (* x y) x) (neg.f64 x))
(*.f64 #s(literal -1 binary64) x)
(*.f64 x #s(literal -1 binary64))
(neg.f64 x)
x
#s(approx (- (* x y) x) (*.f64 y x))
(*.f64 y x)
(*.f64 x y)
y
#s(approx (- (* x y) x) (*.f64 (-.f64 y #s(literal 1 binary64)) x))
#s(approx (neg x) (neg.f64 x))
#s(approx x x)
#s(approx (* y x) (*.f64 y x))
#s(approx (- (* x y) x) (*.f64 (-.f64 #s(literal 1 binary64) y) (neg.f64 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 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: 3.9MiB live, 3.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 204 to 46 computations (77.5% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

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

Accuracy

100.0%

Counts

23 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (*.f64 x y) x)
✓	51.8%	#s(approx (- (* x y) x) (*.f64 y x))
✓	51.4%	#s(approx (- (* x y) x) (neg.f64 x))

Compiler

Compiled 44 to 26 computations (40.9% saved)

regimes5.0ms (0.6%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

Calls

3 calls:

2.0ms	x
2.0ms	y
1.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)

regimes4.0ms (0.5%)

Memory

11.9MiB live, 11.9MiB allocated; 0ms 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:

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

Results

Accuracy	Segments	Branch
68.9%	3	`(-.f64 (*.f64 x y) x)`
61.6%	4	`x`
99.1%	3	`y`

Compiler

Compiled 7 to 8 computations (-14.3% saved)

regimes5.0ms (0.6%)

Memory

-37.4MiB live, 9.4MiB allocated; 3ms 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:

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

Results

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

Compiler

Compiled 7 to 8 computations (-14.3% saved)

bsearch36.0ms (4.1%)

Memory

2.3MiB live, 55.5MiB allocated; 16ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
26.0ms	4.245320653628836e-12	21038116999809.72
9.0ms	-1685547.7015484837	-0.01146326320996233

Samples

24.0ms

320×

valid

Compiler

Compiled 348 to 289 computations (17% saved)

Precisions

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

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

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

adjust: 0.0ms (0% of total)

simplify49.0ms (5.5%)

Memory

0.4MiB live, 48.9MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	39
1	26	39
2	30	39
3	38	39
4	61	39
5	234	39
6	2129	39
7	5232	39

Stop Event

1×	node limit

Calls

Call 1

Inputs

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

derivations6.0ms (0.7%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 39 to 17 computations (56.4% saved)

preprocess62.0ms (7%)

Memory: -15.7MiB live, 30.5MiB allocated; 3ms collecting garbage
Compiler: Compiled 88 to 42 computations (52.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample489.0ms (54.8%)

explain49.0ms (5.5%)

preprocess15.0ms (1.6%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.5%)

rewrite95.0ms (10.6%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

series3.0ms (0.3%)

rewrite61.0ms (6.8%)

eval2.0ms (0.2%)

prune2.0ms (0.3%)

regimes5.0ms (0.6%)

regimes4.0ms (0.5%)

regimes5.0ms (0.6%)

bsearch36.0ms (4.1%)

simplify49.0ms (5.5%)

derivations6.0ms (0.7%)

preprocess62.0ms (7%)

end0.0ms (0%)

Profiling