boolean found = false; for (int j = 0; j < selIndices.length; j++) { if(i == selIndices[j]) { found = true; break; } } if(false == found) { remainEntries.add(m_dlg.lstExtraClasspath.getModel().getElementAt(i)); }
boolean found = false; for (int j = 0; j < selFormats.length; j++) { if(_formats[i] == selFormats[j]) { found = true; break; } } if(false == found) { remainFormats.add(_formats[i]); }
Clone fragments detected by clone detection tool
File path: /sql12/plugins/userscript/src/net/sourceforge/squirrel_sql/plugins/userscript/kernel/ScriptListController.java File path: /sql12/plugins/graph/src/net/sourceforge/squirrel_sql/plugins/graph/FormatController.java
Method name: void onCpRemove() Method name: void onDeleteSeletedListItems()
Number of AST nodes: 7 Number of AST nodes: 7
1
boolean found = false;
1
boolean found = false;
2
			for (int j = 0; j < selIndices.length; j++)
2
         for (int j = 0; j < selFormats.length; j++)
3
			{
4
				if(i == selIndices[j])
5
				{
6
					found = true;
7
					break;
8
				}
9
			}
10
			if(false == found)
11
			{
12
				remainEntries.add(m_dlg.lstExtraClasspath.getModel().getElementAt(i));
13
			
3
         {
4
            if(_formats[i] == selFormats[j])
5
            {
6
               found = true;
7
               break;
8
            }
9
         }
10
         if(false == found)
11
         {
12
            remainFormats.add(_formats[i]);
14
}
13
         }
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.2
Clones locationClones are in different classes
Number of node comparisons1