| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 7 | 2 | 4 | 0.956 | statement_sequence[2] |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 7 | 53 | plugins/org.eclipse.jdt.ui/core refactoring/org/eclipse/jdt/internal/corext/refactoring/typeconstraints/typesets/ArraySuperTypeSet.java |
| 2 | 7 | 150 | plugins/org.eclipse.jdt.ui/core refactoring/org/eclipse/jdt/internal/corext/refactoring/typeconstraints/typesets/SuperTypesSet.java |
| ||||
for (Iterator iter = fElemTypeSet.iterator(); iter.hasNext();) {
TType elemType = (TType) iter.next();
if (TTypes.canAssignTo(elemType, atElemType))
return true;
}
return false;
|
| ||||
// Find the "lower frontier", i.e. the lower bound, and see whether
// the given type 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))
return true;
}
return false;
|
| |||
// Find the "lower frontier", i.e. the lower bound, and see whether
// the given type is a supertype of any of those.
for (Iterator [[#variablea14e19c0]]= [[#variablea14e1940]]
/*.lowerBound() */
.iterator(); [[#variablea14e19c0]].hasNext();) {
TType [[#variablea14e10e0]]= (TType) [[#variablea14e19c0]].next();
if (TTypes.canAssignTo( [[#variablea14e10e0]], [[#variablea14e1880]]))
return true;
}
return false;
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#a14e19c0]] | lbIter |
| 1 | 2 | [[#a14e19c0]] | iter |
| 2 | 1 | [[#a14e1940]] | fLowerBounds |
| 2 | 2 | [[#a14e1940]] | fElemTypeSet |
| 3 | 1 | [[#a14e10e0]] | lb |
| 3 | 2 | [[#a14e10e0]] | elemType |
| 4 | 1 | [[#a14e1880]] | t |
| 4 | 2 | [[#a14e1880]] | atElemType |