for ( int i=0; i<rowKeys.length; i++ ) {
if ( rowKeys[i]!=null && loadables[i].hasSubselectLoadableCollections() ) {
SubselectFetch subselectFetch = new SubselectFetch(
//getSQLString(),
aliases[i],
loadables[i],
queryParameters,
keySets[i],
namedParameterLocMap
);
session.getPersistenceContext()
.getBatchFetchQueue()
.addSubselect( rowKeys[i], subselectFetch );
}
}
for ( int i=0; i<types.length; i++ ) {
if ( !names[i].startsWith("_") ) {
String strValue = values[i]==LazyPropertyInitializer.UNFETCHED_PROPERTY ?
values[i].toString() :
types[i].toLoggableString( values[i], factory );
result.put( names[i], strValue );
}
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/loader/Loader.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/pretty/Printer.java
|
Method name: void createSubselects(List, QueryParameters, SessionImplementor)
|
|
Method name: String toString(Object, EntityMode)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for ( int i=0; i<rowKeys.length; i++ ) {↵ | | 1 | for ( int i=0; i<types.length; i++ ) {↵
|
2 | ↵ | | 2 | ↵
|
3 | if ( rowKeys[i]!=null && loadables[i].hasSubselectLoadableCollections() ) {↵ | | |
|
4 | ↵ | | |
|
5 | SubselectFetch subselectFetch = new SubselectFetch( ↵ | | |
|
6 | //getSQLString(), ↵ | | |
|
7 | aliases[i], ↵ | | |
|
8 | loadables[i], ↵ | | |
|
9 | queryParameters, ↵ | | |
|
10 | keySets[i],↵ | | |
|
11 | namedParameterLocMap↵ | | |
|
12 | );↵ | | |
|
13 | ↵ | | |
|
14 | session.getPersistenceContext()↵ | | |
|
15 | .getBatchFetchQueue()↵ | | |
|
16 | .addSubselect( rowKeys[i], subselectFetch↵ | | 3 | if ( !names[i].startsWith("_") ) {↵
|
| | | 4 | String strValue = values[i]==LazyPropertyInitializer.UNFETCHED_PROPERTY ?↵
|
| | | 5 | values[i].toString() :↵
|
| | | 6 | types[i].toLoggableString( values[i], factory );↵
|
17 | );↵ | | 7 | result.put( names[i], strValue );↵
|
18 | }↵ | | 8 | }↵
|
19 | ↵ | | 9 | ↵
|
20 | } | | 10 | }
|
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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |