Metrics for Data.HyperLogLog.Config:hll from hyperloglog-0.3.4

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample560.0ms (44.3%)

Memory

22.9MiB live, 982.4MiB allocated; 173ms collecting garbage

Samples

347.0ms

8 256×

valid

Precisions

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

ival-mult!: 91.0ms (98.5% of total)

adjust: 2.0ms (2.2% of total)

Bogosity

preprocess142.0ms (11.2%)

Memory

-34.0MiB live, 52.8MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	37	32
2	83	32
3	149	32
4	243	32
5	506	32
6	2148	32
7	5072	32

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.8%	(.f64 (.f64 x y) y)

Symmetry

(abs y)

(negabs x)

Compiler

Compiled 8 to 8 computations (0% saved)

series9.0ms (0.7%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	24

Stop Event

1×	iter-limit

Counts

4 → 4

Calls

Call 1

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

Outputs
#s(approx (* (* x y) y) (*.f64 x (pow.f64 y #s(literal 2 binary64))))
#s(approx (* x y) (*.f64 x y))
#s(approx x x)
#s(approx y y)

Calls

6 calls:

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

rewrite305.0ms (24.2%)

Memory

14.1MiB live, 191.3MiB allocated; 56ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	10	10
2	17	10
3	48	10
4	144	10
5	359	10
6	1755	10
7	6793	10
0	8055	10
1	10459	10

Stop Event

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

Counts

4 → 20

Calls

Call 1

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

Outputs
(.f64 (neg.f64 x) (.f64 (neg.f64 y) y))
(.f64 (.f64 (neg.f64 x) (fabs.f64 y)) (neg.f64 (fabs.f64 y)))
(.f64 (.f64 (fabs.f64 y) x) (fabs.f64 y))
(.f64 (.f64 (neg.f64 y) x) (neg.f64 y))
(.f64 (.f64 (neg.f64 y) y) (neg.f64 x))
(.f64 (neg.f64 (fabs.f64 y)) (.f64 (neg.f64 x) (fabs.f64 y)))
(.f64 (fabs.f64 y) (.f64 (fabs.f64 y) x))
(.f64 (neg.f64 y) (.f64 (neg.f64 y) x))
(.f64 (.f64 y y) x)
(.f64 (.f64 y x) y)
(.f64 y (.f64 y x))
(.f64 x (.f64 y y))
(neg.f64 (.f64 (.f64 (neg.f64 y) x) y))
(*.f64 (neg.f64 x) (neg.f64 y))
(*.f64 (neg.f64 y) (neg.f64 x))
(*.f64 y x)
(*.f64 x y)
(neg.f64 (*.f64 (neg.f64 y) x))
x
y

eval2.0ms (0.1%)

Memory: 3.8MiB live, 3.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 81 to 47 computations (42% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	20	1	21
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	20	2	22

Accuracy

99.9%

Counts

22 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	87.4%	(.f64 (.f64 y y) x)
✓	99.8%	(.f64 (.f64 x y) y)

Compiler

Compiled 8 to 8 computations (0% saved)

series4.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	24

Stop Event

1×	iter-limit

Counts

4 → 4

Calls

Call 1

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

Outputs
#s(approx (* (* y y) x) (*.f64 x (pow.f64 y #s(literal 2 binary64))))
#s(approx x x)
#s(approx (* y y) (pow.f64 y #s(literal 2 binary64)))
#s(approx y y)

Calls

6 calls:

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

rewrite216.0ms (17.1%)

Memory

-14.4MiB live, 134.8MiB allocated; 31ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	15	10
2	49	10
3	145	10
4	363	10
5	1753	10
6	6795	10
0	8057	10
1	10461	10

Stop Event

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

Counts

4 → 33

Calls

Call 1

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

Outputs
(.f64 (neg.f64 x) (.f64 (neg.f64 y) y))
(.f64 (.f64 (neg.f64 x) (fabs.f64 y)) (neg.f64 (fabs.f64 y)))
(.f64 (.f64 (fabs.f64 y) x) (fabs.f64 y))
(.f64 (.f64 (neg.f64 y) x) (neg.f64 y))
(.f64 (.f64 (neg.f64 y) y) (neg.f64 x))
(.f64 (neg.f64 (fabs.f64 y)) (.f64 (neg.f64 x) (fabs.f64 y)))
(.f64 (.f64 x y) y)
(.f64 (fabs.f64 y) (.f64 (fabs.f64 y) x))
(.f64 (neg.f64 y) (.f64 (neg.f64 y) x))
(.f64 x (.f64 y y))
(.f64 (.f64 y y) x)
(.f64 y (.f64 x y))
(neg.f64 (.f64 (.f64 (neg.f64 y) x) y))
(*.f64 (neg.f64 (fabs.f64 y)) (neg.f64 (fabs.f64 y)))
(*.f64 (fabs.f64 y) (fabs.f64 y))
(*.f64 (neg.f64 y) (neg.f64 y))
(*.f64 y y)
(pow.f64 (pow.f64 y #s(literal 16 binary64)) #s(literal 1/8 binary64))
(pow.f64 (pow.f64 y #s(literal 8 binary64)) #s(literal 1/4 binary64))
(pow.f64 (.f64 (.f64 (*.f64 y y) y) y) #s(literal 1/2 binary64))
(pow.f64 (neg.f64 (fabs.f64 y)) #s(literal 2 binary64))
(pow.f64 (fabs.f64 y) #s(literal 2 binary64))
(pow.f64 (neg.f64 y) #s(literal 2 binary64))
(pow.f64 (*.f64 y y) #s(literal 1 binary64))
(pow.f64 y #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 y) y))
(sqrt.f64 (.f64 (.f64 (*.f64 y y) y) y))
(fabs.f64 (*.f64 (fabs.f64 y) (neg.f64 y)))
(fabs.f64 (*.f64 (fabs.f64 y) y))
(fabs.f64 (*.f64 (neg.f64 y) y))
(fabs.f64 (*.f64 y y))
y
x

eval3.0ms (0.2%)

Memory: 9.0MiB live, 9.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 134 to 82 computations (38.8% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	32	0	32
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	32	2	34

Accuracy

99.9%

Counts

34 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	87.4%	(.f64 (.f64 y y) x)
✓	99.8%	(.f64 (.f64 x y) y)

Compiler

Compiled 14 to 14 computations (0% saved)

regimes6.0ms (0.4%)

Memory

-31.5MiB live, 13.2MiB allocated; 4ms collecting garbage

Accuracy

Total -8.0b remaining (-7571.5%)

Threshold costs -8b (-7571.5%)

Counts

2 → 1

Calls

Call 1

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

Outputs
(.f64 (.f64 x y) y)

Calls

3 calls:

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

Results

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

Compiler

Compiled 6 to 8 computations (-33.3% saved)

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 4 to 4 computations (0% saved)

preprocess12.0ms (1%)

Memory

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

Remove

(negabs x)

(abs y)

Compiler

Compiled 24 to 24 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample560.0ms (44.3%)

preprocess142.0ms (11.2%)

series9.0ms (0.7%)

rewrite305.0ms (24.2%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series4.0ms (0.4%)

rewrite216.0ms (17.1%)

eval3.0ms (0.2%)

prune2.0ms (0.1%)

regimes6.0ms (0.4%)

derivations0.0ms (0%)

preprocess12.0ms (1%)

end0.0ms (0%)

Profiling