if ( !options.isAllowProxyCreation() ) {
impl = load( event, persister, keyToLoad, options );
if ( impl == null ) {
event.getSession().getFactory().getEntityNotFoundDelegate().handleEntityNotFound( persister.getEntityName(), keyToLoad.getIdentifier());
}
}
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/DefaultLoadEventListener.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/loader/Loader.java
|
Method name: Object returnNarrowedProxy(LoadEvent, EntityPersister, EntityKey, LoadEventListener.LoadType, PersistenceContext, Object)
|
|
Method name: void readCollectionElement(Object, Serializable, CollectionPersister, CollectionAliases, ResultSet, SessionImplementor)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 3
|
|
1 | if ( !options.isAllowProxyCreation() ) {↵ | | 1 | if ( ↵
|
2 | impl = load( event, persister, keyToLoad, options );↵ | | |
|
3 | if ( impl == null ) {↵ | | |
|
4 | event.getSession().getFactory().getEntityNotFoundDelegate().handleEntityNotFound( persister.getEntityName(), keyToLoad.getIdentifier());↵ | | |
|
5 | }↵ | | |
|
6 | } | | 2 | log.isDebugEnabled() ) {↵
|
| | | 3 | log.debug( ↵
|
| | | 4 | "result set contains (possibly empty) collection: " +↵
|
| | | 5 | MessageHelper.collectionInfoString( persister, optionalKey, getFactory() ) ↵
|
| | | 6 | );↵
|
| | | 7 | }↵
|
|
| | | 8 | persistenceContext.getLoadContexts()↵
|
| | | 9 | .getCollectionLoadContext( rs )↵
|
| | | 10 | .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 |