for (int i = 0; i < foldingPoints.size(); i++)
{
drawFoldingPoint(g, foldingPoints.get(i));
}
for (int rowIdx = 0; rowIdx < classUnderTest.getRowCount(); rowIdx++) {
for (int colIdx = 0; colIdx < classUnderTest.getColumnCount(); colIdx++) {
assertNotNull(classUnderTest.getValueAt(rowIdx, colIdx));
}
}
Clone fragments detected by clone detection tool
File path: /sql12/plugins/graph/src/net/sourceforge/squirrel_sql/plugins/graph/ConstraintView.java
|
|
File path: /sql12/test/src/net/sourceforge/squirrel_sql/client/update/gui/AbstractTableModelTest.java
|
Method name: void paint(Graphics, boolean)
|
|
Method name: void testGetValueAt()
|
Number of AST nodes: 2
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < foldingPoints.size(); i++)↵ | | 1 | for (int ↵
|
2 | {↵ | | |
|
3 | drawFoldingPoint(g, foldingPoints.get(i↵ | | 2 | rowIdx = 0; rowIdx < classUnderTest.getRowCount(); rowIdx++) {↵
|
| | | 3 | for (int colIdx = 0; colIdx < classUnderTest.getColumnCount(); colIdx++) {↵
|
4 | ));↵ | | 4 | assertNotNull(classUnderTest.getValueAt(rowIdx, colIdx));↵
|
5 | ↵ | | 5 | }↵
|
6 | } | | 6 | }
|
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.3 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |