for(int i = 0; i < abbrevsModel.getRowCount(); i++)
{
if(abbrevsModel.getValueAt(i,0).equals(oldAbbrev))
{
abbrevsModel.remove(i);
break;
}
}
for(int i = 0; i < abbrevsModel.getRowCount(); i++)
{
if(abbrevsModel.getValueAt(i,0).equals(abbrev))
{
abbrevsModel.remove(i);
break;
}
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/options/AbbrevsOptionPane.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/options/AbbrevsOptionPane.java
|
Method name: void edit()
|
|
Method name: void add(AbbrevsModel, String, String)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for(int i = 0; i < abbrevsModel.getRowCount(); i++)↵ | | 1 | for(int i = 0; i < abbrevsModel.getRowCount(); i++)↵
|
2 | {↵ | | 2 | {↵
|
3 | if(abbrevsModel.getValueAt(i,0).equals(oldAbbrev))↵ | | 3 | if(abbrevsModel.getValueAt(i,0).equals(abbrev))↵
|
4 | {↵ | | 4 | {↵
|
5 | abbrevsModel.remove(i);↵ | | 5 | abbrevsModel.remove(i);↵
|
6 | break;↵ | | 6 | break;↵
|
7 | }↵ | | 7 | }↵
|
8 | } | | 8 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.4 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 10 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 4 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 1.2 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
10 | for (int i = 0; i < abbrevsModel.getRowCount(); i++) | | 1 | for (int i = 0; i < abbrevsModel.getRowCount(); i++) |
11 | if (abbrevsModel.getValueAt(i, 0).equals(oldAbbrev)) | | 2 | if (abbrevsModel.getValueAt(i, 0).equals(abbrev)) |
12 | | | 3 | |
13 | | | 4 | |
Precondition Violations (0)
Row |
Violation |