| diagramIceberg(Context, double) |  | 0% | | 0% | 2 | 2 | 11 | 11 | 1 | 1 |
| recursiveDiagramIceberg(Concept, ClosureSystem, int) | | 0% | | 0% | 4 | 4 | 13 | 13 | 1 | 1 |
| makeEdgeValuation() |  | 20% | | 25% | 4 | 5 | 10 | 13 | 0 | 1 |
| getIrreduciblesReduction() | | 84% | | 85% | 4 | 14 | 6 | 34 | 0 | 1 |
| initialiseSetAForJoin() | | 34% | | 25% | 4 | 5 | 7 | 11 | 0 | 1 |
| initialiseSetBForMeet() | | 34% | | 25% | 4 | 5 | 7 | 11 | 0 | 1 |
| removeAllSetA() | | 50% | | 50% | 2 | 3 | 4 | 7 | 0 | 1 |
| removeAllSetB() | | 50% | | 50% | 2 | 3 | 4 | 7 | 0 | 1 |
| getMeetReduction() | | 95% | | 78% | 4 | 10 | 3 | 27 | 0 | 1 |
| iceberg(float) | | 94% | | 86% | 2 | 8 | 1 | 21 | 0 | 1 |
| makeInclusionReduction() | | 94% | | 72% | 4 | 10 | 2 | 27 | 0 | 1 |
| getJoinReduction() | | 97% | | 81% | 3 | 9 | 2 | 25 | 0 | 1 |
| containsAllSetA() | | 83% | | 67% | 2 | 4 | 2 | 7 | 0 | 1 |
| idealLattice(DAGraph) | | 99% | | 94% | 1 | 9 | 1 | 29 | 0 | 1 |
| containsAllSetB() | | 92% | | 83% | 1 | 4 | 1 | 7 | 0 | 1 |
| immediateSuccessors(Node, ClosureSystem) | | 100% | | 100% | 0 | 23 | 0 | 70 | 0 | 1 |
| clone() | | 100% | | 100% | 0 | 3 | 0 | 15 | 0 | 1 |
| completeLattice(ClosureSystem) | | 100% | | 100% | 0 | 5 | 0 | 12 | 0 | 1 |
| makeIrreduciblesReduction() | | 100% | | 88% | 2 | 9 | 0 | 11 | 0 | 1 |
| recursiveDiagramLattice(Concept, ClosureSystem) | | 100% | | 100% | 0 | 3 | 0 | 11 | 0 | 1 |
| diagramLattice(ClosureSystem) | | 100% | | 100% | 0 | 2 | 0 | 10 | 0 | 1 |
| getConcept(ComparableSet, ComparableSet) | | 100% | | 83% | 1 | 4 | 0 | 7 | 0 | 1 |
| ConceptLattice(Lattice) | | 100% | | 100% | 0 | 2 | 0 | 6 | 0 | 1 |
| containsConcepts() | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| isConceptLattice() | | 100% | | 75% | 1 | 3 | 0 | 1 | 0 | 1 |
| save(String) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| ConceptLattice(TreeSet) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| ConceptLattice() | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |