if ( nonCacheable!=null && nonCacheable[i] ) {
disassembled[i] = LazyPropertyInitializer.UNFETCHED_PROPERTY;
}
else if ( row[i] == LazyPropertyInitializer.UNFETCHED_PROPERTY || row[i] == BackrefPropertyAccessor.UNKNOWN ) {
disassembled[i] = (Serializable) row[i];
}
else {
disassembled[i] = types[i].disassemble( row[i], session, owner );
}
for ( int i = 0; i < types.length; i++ ) {
if ( original[i] == LazyPropertyInitializer.UNFETCHED_PROPERTY
|| original[i] == BackrefPropertyAccessor.UNKNOWN ) {
copied[i] = target[i];
}
else {
copied[i] = types[i].replace( original[i], target[i], session, owner, copyCache, foreignKeyDirection );
}
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/type/TypeFactory.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/type/TypeFactory.java
|
Method name: Serializable[] disassemble(Object[], Type[], boolean[], SessionImplementor, Object)
|
|
Method name: Object[] replace(Object[], Object[], Type[], SessionImplementor, Object, Map, ForeignKeyDirection)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 4
|
|
1 | if ( nonCacheable!=null && nonCacheable[i] ) {↵ | | |
|
2 | disassembled↵ | | 1 | for ( int i = 0; i < types.length; i++ ) {↵
|
3 | [i] = LazyPropertyInitializer.UNFETCHED_PROPERTY;↵ | | 2 | if ( original[i] == LazyPropertyInitializer.UNFETCHED_PROPERTY↵
|
4 | }↵ | | 3 | ↵
|
5 | else if ( row[i] == LazyPropertyInitializer.UNFETCHED_PROPERTY || row[i] == BackrefPropertyAccessor.UNKNOWN ) {↵ | | 4 | || original[i] == BackrefPropertyAccessor.UNKNOWN ) {↵
|
6 | disassembled[i] = (Serializable) row[i];↵ | | 5 | copied[i] = target[i];↵
|
7 | }↵ | | 6 | }↵
|
8 | else {↵ | | 7 | else {↵
|
9 | disassembled[i] = types[i].disassemble( row[i], session, owner );↵ | | 8 | copied[i] = types[i].replace( original[i], target[i], session, owner, copyCache, foreignKeyDirection );↵
|
10 | } | | 9 | }↵
|
| | | 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.5 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 2 |