| immediateSuccessors(ClosureSystem) |   | 90% |   | 76% | 8 | 22 | 7 | 80 | 0 | 1 |
| immediateSuccessorsLOA(Context) |   | 84% |   | 80% | 3 | 11 | 9 | 43 | 0 | 1 |
| equals(Object) |  | 95% |   | 80% | 2 | 6 | 1 | 7 | 0 | 1 |
| clone() |  | 100% |   | 90% | 1 | 6 | 0 | 11 | 0 | 1 |
| Concept(Concept) |  | 100% |  | 100% | 0 | 3 | 0 | 10 | 0 | 1 |
| toString() |  | 100% |   | 75% | 2 | 5 | 0 | 8 | 0 | 1 |
| Concept(boolean, boolean) |  | 100% |  | 100% | 0 | 3 | 0 | 8 | 0 | 1 |
| Concept(TreeSet, boolean) |  | 100% |  | 100% | 0 | 2 | 0 | 7 | 0 | 1 |
| Concept(boolean, TreeSet) |  | 100% |  | 100% | 0 | 2 | 0 | 7 | 0 | 1 |
| Concept(TreeSet, TreeSet) |  | 100% | | n/a | 0 | 1 | 0 | 6 | 0 | 1 |
| putSetB(ComparableSet) |  | 100% |  | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| putSetA(ComparableSet) |  | 100% |  | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| containsInA(Comparable) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| containsInB(Comparable) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| containsAllInA(TreeSet) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| containsAllInB(TreeSet) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| addToA(Comparable) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| addToB(Comparable) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| addAllToA(TreeSet) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| addAllToB(TreeSet) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| removeFromA(Comparable) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| removeFromB(Comparable) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| removeAllFromA(TreeSet) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| removeAllFromB(TreeSet) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| hasSetB() |  | 100% |  | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| hasSetA() |  | 100% |  | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| count(Context, TreeSet) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getSetA() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getSetB() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| hashCode() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |