com.tdunning.math.stats

Element	Missed Instructions	Cov.	Missed Branches	Cov.	Missed	Cxty	Missed	Lines	Missed	Methods	Missed	Classes
Total	17,457 of 17,457	0%	1,351 of 1,351	0%	1,002	1,002	2,867	2,867	306	306	30	30
Simple64		0%		0%	86	86	734	734	8	8	1	1
MergingDigest		0%		0%	148	148	379	379	31	31	1	1
ArrayDigest		0%		0%	129	129	318	318	30	30	1	1
AVLTreeDigest		0%		0%	77	77	210	210	19	19	1	1
IntAVLTree		0%		0%	132	132	251	251	32	32	1	1
GroupTree		0%		0%	76	76	178	178	22	22	1	1
TreeDigest		0%		0%	53	53	178	178	15	15	1	1
ArrayDigest.Page		0%		0%	41	41	78	78	7	7	1	1
Sort		0%		0%	38	38	92	92	7	7	1	1
FloatHistogram		0%		0%	23	23	78	78	13	13	1	1
AVLGroupTree		0%		0%	34	34	70	70	22	22	1	1
Centroid		0%		0%	28	28	61	61	20	20	1	1
AbstractTDigest		0%		0%	24	24	50	50	13	13	1	1
AVLGroupTree.new IntAVLTree() {...}		0%		0%	11	11	25	25	6	6	1	1
GroupTree.new Iterator() {...}		0%		0%	18	18	29	29	6	6	1	1
ArrayDigest.new Iterator() {...}		0%		0%	10	10	24	24	5	5	1	1
ArrayDigest.new Iterator() {...}		0%		0%	11	11	24	24	5	5	1	1
AVLGroupTree.new Iterator() {...}		0%		0%	7	7	12	12	4	4	1	1
ArrayDigest.1.new Iterator() {...}		0%		0%	6	6	11	11	4	4	1	1
MergingDigest.1.new Iterator() {...}		0%		0%	6	6	7	7	4	4	1	1
Histogram		0%		0%	6	6	10	10	1	1	1	1
IntAVLTree.NodeAllocator		0%		0%	9	9	12	12	5	5	1	1
IntAVLTree.IntStack		0%		0%	5	5	11	11	4	4	1	1
TDigest		0%		0%	9	9	14	14	8	8	1	1
ArrayDigest.Index		0%		n/a	3	3	6	6	3	3	1	1
MergingDigest.Encoding		0%		n/a	2	2	5	5	2	2	1	1
ArrayDigest.new AbstractCollection() {...}		0%		n/a	3	3	4	4	3	3	1	1
ArrayDigest.new Iterable() {...}		0%		n/a	2	2	2	2	2	2	1	1
MergingDigest.new AbstractCollection() {...}		0%		n/a	3	3	3	3	3	3	1	1
GroupTree.new Iterable() {...}		0%		n/a	2	2	2	2	2	2	1	1