throwLazyInitializationExceptionIfNotConnected();
CollectionEntry entry = session.getPersistenceContext().getCollectionEntry(this);
CollectionPersister persister = entry.getLoadedPersister();
if ( persister.isExtraLazy() ) {
if ( hasQueuedOperations() ) {
session.flush();
}
return new Boolean( persister.indexExists( entry.getLoadedKey(), index, session ) );
}
throwLazyInitializationExceptionIfNotConnected();
CollectionEntry entry = session.getPersistenceContext().getCollectionEntry(this);
CollectionPersister persister = entry.getLoadedPersister();
if ( persister.isExtraLazy() ) {
if ( hasQueuedOperations() ) {
session.flush();
}
return persister.getElementByIndex( entry.getLoadedKey(), index, session, owner );
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/AbstractPersistentCollection.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/AbstractPersistentCollection.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | throwLazyInitializationExceptionIfNotConnected();↵ | | 1 | throwLazyInitializationExceptionIfNotConnected();↵
|
2 | CollectionEntry entry = session.getPersistenceContext().getCollectionEntry(this);↵ | | 2 | CollectionEntry entry = session.getPersistenceContext().getCollectionEntry(this);↵
|
3 | CollectionPersister persister = entry.getLoadedPersister();↵ | | 3 | CollectionPersister persister = entry.getLoadedPersister();↵
|
4 | if ( persister.isExtraLazy() ) {↵ | | 4 | if ( persister.isExtraLazy() ) {↵
|
5 | if ( hasQueuedOperations() ) {↵ | | 5 | if ( hasQueuedOperations() ) {↵
|
6 | session.flush();↵ | | 6 | session.flush();↵
|
7 | }↵ | | 7 | }↵
|
8 | return new Boolean( persister.indexExists( entry.getLoadedKey(), index, session ) );↵ | | 8 | return persister.getElementByIndex( entry.getLoadedKey(), index, session, owner );↵
|
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 |