for ( int i=0; i<lhs.length; i++ ) {
addCondition( lhs[i], op, rhs[i] );
}
return this;
for (int i=0; i<columnNames.length; i++) {
if ( columnNames[i]!=null ) addColumn( tableAlias, columnNames[i], columnAliases[i] );
}
return this;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/sql/SimpleSelect.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/sql/SelectFragment.java
|
Method name: SimpleSelect addCondition(String[], String, String[])
|
|
Method name: SelectFragment addColumns(String, String[], String[])
|
Number of AST nodes: 3
|
|
Number of AST nodes: 4
|
|
1 | for ( int i=0; i<lhs.length; i++ ) {↵ | | 1 | for (int i=0; i<columnNames.length; i++) {↵
|
2 | addCondition( lhs[i], op, rhs[i] );↵ | | 2 | if ( columnNames[i]!=null ) addColumn( tableAlias, columnNames[i], columnAliases[i] );↵
|
3 | }↵ | | 3 | }↵
|
4 | return this; | | 4 | return this;
|
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.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |