if ( isPropertyOfTable( i, j ) && versionability[i] ) {
// this property belongs to the table and it is not specifically
// excluded from optimistic locking by optimistic-lock="false"
boolean[] settable = types[i].toColumnNullness( loadedState[i], getFactory() );
types[i].nullSafeSet( delete, loadedState[i], index, settable, session );
index += ArrayHelper.countTrue( settable );
}
if ( include ) {
boolean[] settable = types[i].toColumnNullness( oldFields[i], getFactory() );
types[i].nullSafeSet(
update,
oldFields[i],
index,
settable,
session
);
index += ArrayHelper.countTrue(settable);
}
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: void delete(Serializable, Object, int, Object, String, SessionImplementor, Object[])
|
|
Method name: boolean update(Serializable, Object[], Object[], Object, boolean[], int, Object, Object, String, SessionImplementor)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | if ( isPropertyOfTable( i, j ) && versionability[i] ) {↵ | | 1 | if ( i↵
|
2 | // this property belongs to the table and it is not specifically↵ | | |
|
3 | // excluded from optimistic locking by optimistic-lock="false"↵ | | 2 | nclude ) {↵
|
4 | boolean[] settable = types[i].toColumnNullness( loadedState[i], getFactory() );↵ | | 3 | boolean[] settable = types[i].toColumnNullness( oldFields[i], getFactory() );↵
|
5 | types[i].nullSafeSet( delete, loadedState[i], index, settable, session ↵ | | 4 | types[i].nullSafeSet(↵
|
| | | 5 | update,↵
|
| | | 6 | oldFields[i],↵
|
| | | 7 | index,↵
|
| | | 8 | settable,↵
|
| | | 9 | session↵
|
6 | );↵ | | 10 | );↵
|
7 | index += ArrayHelper.countTrue( settable );↵ | | 11 | index += ArrayHelper.countTrue(settable);↵
|
8 | } | | 12 | }
|
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.1 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 1 |