String[] propertyColumnNames = getPropertyColumnNames( i );
boolean[] propertyNullness = types[i].toColumnNullness( oldFields[i], getFactory() );
for ( int k=0; k<propertyNullness.length; k++ ) {
if ( propertyNullness[k] ) {
update.addWhereColumn( propertyColumnNames[k] );
}
else {
update.addWhereColumn( propertyColumnNames[k], " is null" );
String[] propertyColumnNames = getPropertyColumnNames( i );
boolean[] propertyNullness = types[i].toColumnNullness( loadedState[i], getFactory() );
for ( int k = 0; k < propertyNullness.length; k++ ) {
if ( propertyNullness[k] ) {
delete.addWhereFragment( propertyColumnNames[k] + " = ?" );
}
else {
delete.addWhereFragment( propertyColumnNames[k] + " is null" );
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/persister/entity/AbstractEntityPersister.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/persister/entity/AbstractEntityPersister.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | String[] propertyColumnNames = getPropertyColumnNames( i );↵ | | 1 | String[] propertyColumnNames = getPropertyColumnNames( i );↵
|
2 | boolean[] propertyNullness = types[i].toColumnNullness( oldFields[i], getFactory() );↵ | | 2 | boolean[] propertyNullness = types[i].toColumnNullness( loadedState[i], getFactory() );↵
|
3 | for ( int k=0; k<propertyNullness.length; k++ ) {↵ | | 3 | for ( int k = 0; k < propertyNullness.length; k++ ) {↵
|
4 | if ( propertyNullness[k] ) {↵ | | 4 | if ( propertyNullness[k] ) {↵
|
5 | update.addWhereColumn( propertyColumnNames[k] );↵ | | 5 | delete.addWhereFragment( propertyColumnNames[k] + " = ?" );↵
|
6 | }↵ | | 6 | }↵
|
7 | else {↵ | | 7 | else {↵
|
8 | update.addWhereColumn( propertyColumnNames[k], " is null" );↵ | | 8 | delete.addWhereFragment( propertyColumnNames[k] + " is null" );↵
|
9 | | | 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 |