Previous CloneSet | Next CloneSet | Back to Main Report |
Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
---|---|---|---|---|
21 | 2 | 5 | 0.977 | statement_sequence[3] |
Clone Abstraction | Parameter Bindings |
Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
---|---|---|---|
1 | 21 | 164 | plugins/org.eclipse.jdt.ui/core refactoring/org/eclipse/jdt/internal/corext/refactoring/typeconstraints/typesets/SubTypesSet.java |
2 | 21 | 169 | plugins/org.eclipse.jdt.ui/core refactoring/org/eclipse/jdt/internal/corext/refactoring/typeconstraints/typesets/SuperTypesSet.java |
| ||||
if (fUpperBounds.containsAll(s)) return true; // Make sure all elements of s are contained in this set for (Iterator sIter = s.iterator(); sIter.hasNext();) { TType t = (TType) sIter.next(); boolean found = false; // Scan the "upper frontier", i.e. the upper bound set, and see whether // 't' is a subtype of any of those. for (Iterator ubIter = fUpperBounds /*.upperBound() */ .iterator(); ubIter.hasNext();) { TType ub = (TType) ubIter.next(); if (TTypes.canAssignTo(t, ub)) { found = true; break; } } if ( !found) return false; } return true; |
| ||||
if (fLowerBounds.containsAll(s)) return true; // Make sure all elements of s are contained in this set for (Iterator sIter = s.iterator(); sIter.hasNext();) { TType t = (TType) sIter.next(); boolean found = false; // Scan the "lower frontier", i.e. the lower bound set, and see whether // 't' is a supertype of any of those. for (Iterator lbIter = fLowerBounds /*.lowerBound()*/ .iterator(); lbIter.hasNext();) { TType lb = (TType) lbIter.next(); if (TTypes.canAssignTo(lb, t)) { found = true; break; } } if ( !found) return false; } return true; |
| |||
if ( [[#variablec0a4da80]].containsAll(s)) return true; // Make sure all elements of s are contained in this set for (Iterator sIter = s.iterator(); sIter.hasNext();) { TType t = (TType) sIter.next(); boolean found = false; // Scan the "upper frontier", i.e. the upper bound set, and see whether // 't' is a subtype of any of those. // Scan the "lower frontier", i.e. the lower bound set, and see whether // 't' is a supertype of any of those. for (Iterator [[#variablec1c4c760]]= [[#variablec0a4da80]] /*.upperBound() */ /*.lowerBound()*/ .iterator(); [[#variablec1c4c760]].hasNext();) { TType [[#variable55adf020]]= (TType) [[#variablec1c4c760]].next(); if (TTypes.canAssignTo( [[#variable97b01500]], [[#variablec0a4da40]])) { found = true; break; } } if ( !found) return false; } return true; |
CloneAbstraction |
Parameter Index | Clone Instance | Parameter Name | Value |
---|---|---|---|
1 | 1 | [[#c0a4da80]] | fUpperBounds |
1 | 2 | [[#c0a4da80]] | fLowerBounds |
2 | 1 | [[#c1c4c760]] | ubIter |
2 | 2 | [[#c1c4c760]] | lbIter |
3 | 1 | [[#55adf020]] | ub |
3 | 2 | [[#55adf020]] | lb |
4 | 1 | [[#97b01500]] | t |
4 | 2 | [[#97b01500]] | lb |
5 | 1 | [[#c0a4da40]] | ub |
5 | 2 | [[#c0a4da40]] | t |