for ( int j=0; j<fkColumns.length; j++) {
/*if ( fkColumns[j].indexOf('.')<1 ) {
throw new AssertionFailure("missing alias");
}*/
buffer.append( fkColumns[j] )
.append('=')
.append(alias)
.append('.')
.append( pkColumns[j] );
if ( j<fkColumns.length-1 ) buffer.append(" and ");
}
for ( int i=0; i<lhs.length; i++ ) {
buf.append(tableAlias)
.append('.')
.append( lhs[i] )
.append(op)
.append( rhs[i] );
if (i<lhs.length-1) buf.append(" and ");
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/sql/ANSIJoinFragment.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/sql/ConditionFragment.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for ( int j=0; j<fkColumns.length; j++) {↵ | | 1 | for ( int i=0; i<lhs.length; i++↵
|
2 | /*if ( fkColumns[j].indexOf('.')<1 ) {↵ | | |
|
3 | throw new AssertionFailure("missing alias");↵ | | |
|
4 | }*/↵ | | |
|
5 | buffer.append( fkColumns[j] ↵ | | 2 | ) {↵
|
6 | )↵ | | 3 | buf.append(tableAlias)↵
|
7 | .append('=')↵ | | 4 | .append('.')↵
|
8 | .append(alias)↵ | | 5 | .append( lhs[i] )↵
|
9 | .append('.')↵ | | 6 | .append(op)↵
|
10 | .append( pkColumns[j] );↵ | | 7 | .append( rhs[i] );↵
|
11 | if ( j<fkColumns.length-1 ) buffer.append(" and ");↵ | | 8 | if (i<lhs.length-1) buf.append(" and ");↵
|
12 | } | | 9 | }
|
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 | |
Number of node comparisons | 0 |