if ( source.getPersistenceContext().getEntry( old ).getStatus() == Status.DELETED ) {
source.forceFlush( source.getPersistenceContext().getEntry( old ) );
}
else {
throw new NonUniqueObjectException( id, persister.getEntityName() );
}
if ( log.isDebugEnabled() ) {
log.debug(
"result set contains (possibly empty) collection: " +
MessageHelper.collectionInfoString( persister, optionalKey, getFactory() )
);
}
persistenceContext.getLoadContexts()
.getCollectionLoadContext( rs )
.getLoadingCollection( persister, optionalKey );
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/event/def/AbstractSaveEventListener.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/loader/Loader.java
|
Method name: Serializable performSave(Object, Serializable, EntityPersister, boolean, Object, EventSource, boolean)
|
|
Method name: void readCollectionElement(Object, Serializable, CollectionPersister, CollectionAliases, ResultSet, SessionImplementor)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | if ( source.getPersistenceContext().getEntry( old ).getStatus() == Status.DELETED ) {↵ | | 1 | if ( ↵
|
2 | source.forceFlush( source.getP↵ | | 2 | log.isDebugEnabled() ) {↵
|
| | | 3 | log.debug( ↵
|
| | | 4 | "result set contains (possibly empty) collection: " +↵
|
| | | 5 | MessageHelper.collectionInfoString( persister, optionalKey, getFactory() ) ↵
|
| | | 6 | );↵
|
| | | 7 | }↵
|
|
3 | ersistenceContext().getEntry( old ) );↵ | | 8 | persistenceContext.get↵
|
4 | }↵ | | |
|
5 | else {↵ | | |
|
6 | throw new NonUniqueObjectException( id, persister.getEntityName() );↵ | | |
|
7 | } | | 9 | LoadContexts()↵
|
| | | 10 | .getCollectionLoadContext( rs )↵
|
| | | 11 | .getLoadingCollection( persister, optionalKey );
|
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 |