int[] dirtyProperties;
if ( event.hasDatabaseSnapshot() ) {
dirtyProperties = persister.findModified( event.getDatabaseSnapshot(), values, entity, session );
}
else {
dirtyProperties = persister.findDirty( values, entry.getLoadedState(), entity, session );
}
event.setDirtyProperties(dirtyProperties);
if ( CollectionPropertyNames.COLLECTION_ELEMENTS.equals( propertyName ) ) {
handleElements( collectionNode, propertyName );
}
else {
// Not elements(x)
fromElement = collectionNode.getFromElement();
setDataType( fromElement.getPropertyType( propertyName, propertyName ) );
selectColumns = fromElement.toColumns( fromElement.getTableAlias(), propertyName, inSelect );
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/event/def/DefaultFlushEntityEventListener.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/ast/tree/MethodNode.java
|
Method name: boolean handleInterception(FlushEntityEvent)
|
|
Method name: void resolveCollectionProperty(AST)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | int[] dirtyProperties;↵ | | 1 | i↵
|
2 | if ( event.hasDatabaseSnapshot() ) {↵ | | |
|
3 | dirtyProperties = persister.findModified( event.getDatabaseSnapshot(), values, entity, session );↵ | | |
|
4 | }↵ | | |
|
5 | else {↵ | | |
|
6 | dirtyProperties = persister.findDirty( values, ↵ | | 2 | f ( CollectionPropertyNames.COLLECTION_ELEMENTS.equals( propertyName ) ) {↵
|
| | | 3 | handleElements( collectionNode, propertyName );↵
|
| | | 4 | }↵
|
| | | 5 | else {↵
|
| | | 6 | // Not elements(x)↵
|
| | | 7 | fromElement = collectionNode.getFromElement();↵
|
7 | entry.getLoadedState(), entity, session );↵ | | 8 | setDataType( fromElement.get↵
|
8 | }↵ | | |
|
9 | event.setDirtyProperties(dirtyProperties); | | 9 | PropertyType( propertyName, propertyName ) );↵
|
| | | 10 | selectColumns = fromElement.toColumns( fromElement.getTableAlias(), propertyName, inSelect );↵
|
| | | 11 | }
|
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 in different classes |
Number of node comparisons | 1 |