logo

Back to index

LCOM

Min: 1.0000, max: 83.0000, yellow zone: [15.0000 .. 5.0000].

Elements: 40, μ: 16.6750, σ: 24.0680, Var: 579.2694, defects: 18%.

Packages: 10, classes: 162.

Green: 142, yellow: 7, red: 13.

Class LCOM methods pairs empty nonempty
o.t.i.covertree.C..$KNNIterator 0 3 3 0 3
o.t.i.covertree.Point 0 4 6 1 5
o.t.i.covertree.C..$CTStats 0 1 0 0 0
o.t.i.covertree.CoverTreeQueryKnn 0 4 6 3 3
o.t.i.covertree.Node 0 0 0 0 0
o.t.i.covertree.CoverTree 83 18 153 118 35
o.t.i.covertree.PointDist 0 3 3 0 3
o.t.i.kdtree.K..$RemoveResult 0 0 0 0 0
o.t.i.kdtree.K..$IteratorPos 0 0 0 0 0
o.t.i.kdtree.KDEntryDist 1 3 3 2 1
o.t.i.kdtree.K..$IteratorStack 0 1 0 0 0
o.t.i.kdtree.Node 3 3 3 3 0
o.t.i.kdtree.K..$KDStats 0 0 0 0 0
o.t.i.kdtree.K..$QEntryComparator 0 1 0 0 0
o.t.i.kdtree.KDIterator 0 3 3 0 3
o.t.i.kdtree.KDTree 69 19 171 120 51
o.t.i.kdtree.K..$KDQueryIteratorKNN 0 3 3 0 3
o.t.i.rtree.R..$IterPos 0 1 0 0 0
o.t.i.rtree.R..$EDPair 0 1 0 0 0
o.t.i.rtree.R..$RTreeNodeWrapper 6 8 28 17 11
o.t.i.rtree.RTreeIterator 1 3 3 2 1
o.t.i.rtree.RTreeMixedQuery2 4 4 6 5 1
o.t.i.rtree.STRLoader 2 5 10 6 4
o.t.i.rtree.S..$CenterComp 0 1 0 0 0
o.t.i.rtree.R..$IterPos 0 0 0 0 0
o.t.i.rtree.R..$RTreeNodeWrapper 6 8 28 17 11
o.t.i.rtree.R..$DEComparator 0 1 0 0 0
o.t.i.rtree.R..$RTreeEntryWrapper 0 0 0 0 0
o.t.i.rtree.R..$IteratorStack 0 0 0 0 0
o.t.i.rtree.R..$IteratorStack 0 0 0 0 0
o.t.i.rtree.R..$IterPos 0 0 0 0 0
o.t.i.rtree.R..$SortByAxisDes 0 2 1 0 1
o.t.i.rtree.Entry 0 10 45 9 36
o.t.i.rtree.R..$RTreeStats 0 0 0 0 0
o.t.i.rtree.R..$DEComparator 0 1 0 0 0
o.t.i.rtree.F..$UnionFilter 1 3 3 2 1
o.t.i.rtree.RTreeMixedQuery 4 5 10 7 3
o.t.i.rtree.RTreeNodeDir 0 9 36 0 36
o.t.i.rtree.RStarTreeLogic 6 4 6 6 0
o.t.i.rtree.R..$NDPair 1 2 1 1 0
o.t.i.rtree.F..$RectangleIntersectFilter 0 1 0 0 0
o.t.i.rtree.RTreeNodeLeaf 0 6 15 0 15
o.t.i.rtree.RTreeNode 60 13 78 69 9
o.t.i.rtree.RTreeQueryKnnOld 0 4 6 3 3
o.t.i.rtree.KnnResult 1 3 3 2 1
o.t.i.rtree.DistEntry 0 3 3 0 3
o.t.i.rtree.RTree 211 23 253 232 21
o.t.i.rtree.RTreeQueryKnn 0 4 6 3 3
o.t.i.rtree.R..$SortByAxisAsc 0 2 1 0 1
o.t.i.rtree.RTreeQuery1NN 0 1 0 0 0
o.t.i.rtree.K..$KnnResultIterator 0 2 1 0 1
o.t.i.rtree.TestDraw 0 1 0 0 0
o.t.i.rtree.R..$DEComparator 0 1 0 0 0
o.t.i.rtree.R..$IteratorStack 0 0 0 0 0
o.t.i.phtree.EntryP 0 3 3 1 2
o.t.i.phtree.P..$QueryIteratorKnnPH 0 3 3 0 3
o.t.i.phtree.P..$IteratorPH 1 3 3 2 1
o.t.i.phtree.P..$QueryIteratorPH 0 3 3 0 3
o.t.i.phtree.PHStats 0 1 0 0 0
o.t.i.phtree.P..$IteratorPH 1 3 3 2 1
o.t.i.phtree.DistEntryP 0 2 1 0 1
o.t.i.phtree.DistEntryR 0 2 1 0 1
o.t.i.phtree.P..$QueryIteratorPH 0 3 3 0 3
o.t.i.phtree.P..$QueryIteratorKnnPH 0 3 3 0 3
o.t.i.phtree.EntryR 0 5 10 3 7
o.t.i.phtree.PHTreeR 0 14 91 0 91
o.t.i.phtree.PHTreeP 0 14 91 0 91
o.t.i.qthypercube2.Q..$KnnTemp 0 0 0 0 0
o.t.i.qthypercube2.Q..$StackEntry 0 1 0 0 0
o.t.i.qthypercube2.Q..$IteratorStack 0 1 0 0 0
o.t.i.qthypercube2.Q..$QEntryComparator 0 1 0 0 0
o.t.i.qthypercube2.Q..$IteratorStack 0 1 0 0 0
o.t.i.qthypercube2.Q..$StackEntry 0 0 0 0 0
o.t.i.qthypercube2.Q..$QStats 0 2 1 0 1
o.t.i.qthypercube2.Q..$IteratorStack 0 1 0 0 0
o.t.i.qthypercube2.QIterator2 0 3 3 0 3
o.t.i.qthypercube2.QEntry 0 7 21 5 16
o.t.i.qthypercube2.Q..$QQueryIteratorKNN 0 3 3 0 3
o.t.i.qthypercube2.QEntryDist 0 1 0 0 0
o.t.i.qthypercube2.Q..$StackEntry 0 1 0 0 0
o.t.i.qthypercube2.QIterator1 0 3 3 0 3
o.t.i.qthypercube2.QUtil 0 0 0 0 0
o.t.i.qthypercube2.QIterator0 0 3 3 0 3
o.t.i.qthypercube2.QNode 1 2 1 1 0
o.t.i.qthypercube2.QuadTreeKD2 16 17 136 76 60
o.t.index.P..$PointW 1 2 1 1 0
o.t.index.P..$PointDistW 0 1 0 0 0
o.t.index.PointIndexWrapper 0 16 120 0 120
o.t.index.P..$PointDIter 0 3 3 0 3
o.t.index.R..$RectangleDist 0 1 0 0 0
o.t.index.R..$FarthestNeighbor 0 2 1 0 1
o.t.index.Stats 43 11 55 49 6
o.t.index.P..$PointIter 0 3 3 0 3
o.t.i.critbit.C..$Node 0 0 0 0 0
o.t.i.critbit.C..$QueryIterator 9 6 15 12 3
o.t.i.critbit.C..$Entry 1 2 1 1 0
o.t.i.critbit.C..$QueryIteratorWithMask 1 6 15 8 7
o.t.i.critbit.C..$Entry 1 2 1 1 0
o.t.i.critbit.Examples 0 0 0 0 0
o.t.i.critbit.C..$QueryIteratorKD 2 5 10 6 4
o.t.i.critbit.C..$CheckEmptyWithMask 0 1 0 0 0
o.t.i.critbit.C..$QueryIterator 1 6 15 8 7
o.t.i.critbit.C..$QueryIteratorMask 9 6 15 12 3
o.t.i.critbit.C..$Node 0 0 0 0 0
o.t.i.critbit.C..$AtomicInfo 0 0 0 0 0
o.t.i.critbit.C..$CBIterator 3 6 15 9 6
o.t.i.critbit.C..$FullIterator 2 5 10 6 4
o.t.i.critbit.BitTools 0 0 0 0 0
o.t.i.critbit.CritBit64 13 11 55 34 21
o.t.i.critbit.CritBit 73 15 105 89 16
o.t.i.critbit.CritBit64COW 0 9 36 8 28
o.t.i.qtplain.Q..$QEntryComparator 0 1 0 0 0
o.t.i.qtplain.QUtil 0 0 0 0 0
o.t.i.qtplain.Q..$QQueryIteratorKNN 0 3 3 0 3
o.t.i.qtplain.QNode 0 1 0 0 0
o.t.i.qtplain.Q..$QStats 0 0 0 0 0
o.t.i.qtplain.QEntry 0 7 21 5 16
o.t.i.qtplain.Q..$QIterator 0 3 3 0 3
o.t.i.qtplain.Q..$QRIterator 0 3 3 0 3
o.t.i.qtplain.QEntryDist 0 1 0 0 0
o.t.i.qtplain.QREntryDist 0 1 0 0 0
o.t.i.qtplain.Q..$QEntryComparator 0 1 0 0 0
o.t.i.qtplain.QREntry 0 7 21 6 15
o.t.i.qtplain.Q..$ArrayIterator 0 2 1 0 1
o.t.i.qtplain.Q..$QRQueryIteratorKNN 0 3 3 0 3
o.t.i.qtplain.QuadTreeRKD0 40 17 136 88 48
o.t.i.qtplain.QRNode 0 1 0 0 0
o.t.i.qtplain.QuadTreeKD0 18 17 136 77 59
o.t.i.qthypercube.Q..$StackEntry 0 0 0 0 0
o.t.i.qthypercube.Q..$IteratorStack 0 1 0 0 0
o.t.i.qthypercube.Q..$QEntryComparator 0 1 0 0 0
o.t.i.qthypercube.Q..$QEntryComparator 0 1 0 0 0
o.t.i.qthypercube.Q..$IteratorStack 0 1 0 0 0
o.t.i.qthypercube.Q..$StackEntry 0 1 0 0 0
o.t.i.qthypercube.QUtil 0 0 0 0 0
o.t.i.qthypercube.Q..$QRQueryIteratorKNN 0 3 3 0 3
o.t.i.qthypercube.Q..$IteratorStack 0 1 0 0 0
o.t.i.qthypercube.Q..$StackEntry 0 1 0 0 0
o.t.i.qthypercube.QREntry 0 7 21 6 15
o.t.i.qthypercube.QIterator1 0 3 3 0 3
o.t.i.qthypercube.Q..$IteratorStack 0 1 0 0 0
o.t.i.qthypercube.QIterator2 0 3 3 0 3
o.t.i.qthypercube.QEntryDist 0 1 0 0 0
o.t.i.qthypercube.Q..$StackEntry 0 1 0 0 0
o.t.i.qthypercube.QIterator0 0 3 3 0 3
o.t.i.qthypercube.Q..$QQueryIteratorKNN 0 3 3 0 3
o.t.i.qthypercube.QRIterator 0 3 3 0 3
o.t.i.qthypercube.Q..$QStats 0 1 0 0 0
o.t.i.qthypercube.QREntryDist 0 1 0 0 0
o.t.i.qthypercube.QuadTreeRKD 38 17 136 87 49
o.t.i.qthypercube.QNode 0 1 0 0 0
o.t.i.qthypercube.QEntry 0 7 21 5 16
o.t.i.qthypercube.QuadTreeKD 16 17 136 76 60
o.t.i.qthypercube.QRNode 0 1 0 0 0
o.t.i.array.P..$AQueryIteratorKNN 0 3 3 0 3
o.t.i.array.R..$KnnEntry 5 6 15 10 5
o.t.i.array.P..$KnnEntry 2 5 10 6 4
o.t.i.array.P..$AQueryIterator 0 3 3 0 3
o.t.i.array.R..$AQueryIterator 0 3 3 0 3
o.t.i.array.R..$AQueryIteratorKNN 0 3 3 0 3
o.t.i.array.PointArray 61 15 105 83 22
o.t.i.array.RectArray 61 15 105 83 22

Download XML.