if (infos[i].upperCaseCompletionStringEquals(upperCaseTableNamePat)) { toReturn = infos[i]; break; }
for (int i = 0; i < _booleans.length; i++) { if(_booleans[i].productMatches(md)) { return _booleans[i].getBooleanValue(orig); } }
Clone fragments detected by clone detection tool
File path: /sql12/plugins/codecompletion/src/net/sourceforge/squirrel_sql/plugins/codecompletion/StandardCompletorModel.java File path: /sql12/fw/src/net/sourceforge/squirrel_sql/fw/datasetviewer/cellcomponent/DatabaseSpecificBooleanValue.java
Method name: ArrayList getColumnsForName(String, String, String, String, int) Method name: String getBooleanValue(String, ISQLDatabaseMetaData)
Number of AST nodes: 3 Number of AST nodes: 3
1
if (infos[i].upperCaseCompletionStringEquals(upperCaseTableNamePat))
1
for (in
2
				{
3
					toReturn = infos[i];
4
					break;
5
				
2
t i = 0; i < _booleans.length; i++) {
3
            if(_booleans[i].productMatches(md)) {
4
                return _booleans[i].getBooleanValue(orig);
5
            }
6
}
6
        }
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