if ( proxy != null ) {
return returnNarrowedProxy( event, persister, keyToLoad, options, persistenceContext, proxy );
}
else {
if ( options.isAllowProxyCreation() ) {
return createProxyIfNecessary( event, persister, keyToLoad, options, persistenceContext );
}
else {
// return a newly loaded object
return load(event, persister, keyToLoad, options);
if ( isDefaultFetchMode(fetchMode) ) {
return super.getJoinType(
type,
config,
path,
lhsTable,
lhsColumns,
nullable,
currentDepth, cascadeStyle
);
}
else {
if ( fetchMode==FetchMode.JOIN ) {
isDuplicateAssociation(lhsTable, lhsColumns, type); //deliberately ignore return value!
return getJoinType(nullable, currentDepth);
}
else {
return -1;
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/criteria/CriteriaJoinWalker.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if ( proxy != null ) {↵ | | 1 | if ( isDefaultFetchMode(fetchMode) ) {↵
|
2 | return returnNarrowedProxy( event, persister, keyToLoad, options, persistenceContext, proxy ↵ | | 2 | return super.getJoinType(↵
|
| | | 3 | type, ↵
|
| | | 4 | config, ↵
|
| | | 5 | path, ↵
|
| | | 6 | lhsTable, ↵
|
| | | 7 | lhsColumns, ↵
|
| | | 8 | nullable,↵
|
| | | 9 | currentDepth, cascadeStyle↵
|
3 | );↵ | | 10 | );↵
|
4 | }↵ | | 11 | }↵
|
5 | else {↵ | | 12 | else {↵
|
6 | if ( options.isAllowProxyCreation() ) {↵ | | 13 | if ( ↵
|
7 | return createProxyIfNecessary( event, persister, keyToLoad, options, persistenceContext ↵ | | 14 | fetchMode==FetchMode.JOIN ) {↵
|
| | | 15 | isDuplicateAssociation(lhsTable, lhsColumns, type); //deliberately ignore return value!↵
|
8 | );↵ | | 16 | return getJoinType(nullable, currentDepth);↵
|
9 | }↵ | | 17 | }↵
|
10 | else {↵ | | 18 | else {↵
|
11 | // return a newly loaded object↵ | | 19 | ↵
|
12 | return load(event, persister, keyToLoad, options);↵ | | 20 | return -1;↵
|
13 | | | 21 |
|
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 |