for (int i = 0; i < foldingPoints.size(); i++)
{
drawFoldingPoint(g, foldingPoints.get(i));
}
for (int row = 0; row < tbl.getRowCount(); row++)
{
tbl.setValueAt(mark, row, col);
}
Clone fragments detected by clone detection tool
File path: /sql12/plugins/graph/src/net/sourceforge/squirrel_sql/plugins/graph/ConstraintView.java
|
|
File path: /sql12/plugins/smarttools/src/net/sourceforge/squirrel_sql/plugins/smarttools/SmarttoolsHelper.java
|
Method name: void paint(Graphics, boolean)
|
|
Method name: void markAllRows(JTable, int, boolean)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 2
|
|
1 | for (int i = 0; i < foldingPoints.size(); i++)↵ | | 1 | for (int row = 0; row < tbl.getRowCount(); row++)↵
|
2 | {↵ | | |
|
3 | drawFoldingPoint(g, foldingPoints.get(i));↵ | | |
|
4 | ↵ | | 2 | {↵
|
| | | 3 | tbl.setValueAt(mark, row, col);↵
|
5 | } | | 4 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.5 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |