for (int i = 0; i < foldingPoints.size(); i++) { drawFoldingPoint(g, foldingPoints.get(i)); }
for (int i = 0; i < node.getChildCount(); i++) { fillAllAliasesFrom((DefaultMutableTreeNode) node.getChildAt(i), toFill); }
Clone fragments detected by clone detection tool
File path: /sql12/plugins/graph/src/net/sourceforge/squirrel_sql/plugins/graph/ConstraintView.java File path: /sql12/app/src/net/sourceforge/squirrel_sql/client/gui/db/JTreeAliasesListImpl.java
Method name: void paint(Graphics, boolean) Method name: void fillAllAliasesFrom(DefaultMutableTreeNode, ArrayList)
Number of AST nodes: 2 Number of AST nodes: 2
1
for (int i = 0; i < foldingPoints.size(); i++)
1
for (int i = 0; i < node.getChildCount(); i++)
2
         {
2
         {
3
            drawFoldingPoint(g, foldingPoints.get(i));
3
              fillAllAliasesFrom((DefaultMutableTreeNode) node.getChildAt(i), toFill);
4
         }
4
         }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.4
Clones locationClones are in different classes
Number of node comparisons1