while ( itr.hasNext() ) {
Map.Entry entry = ( Map.Entry ) itr.next();
oos.writeObject( entry.getKey() );
( ( EntityEntry ) entry.getValue() ).serialize( oos );
}
final Map.Entry e = (Map.Entry) iter.next();
if ( conditionsAppended ) {
buf.append( " and " );
}
buf.append( e.getKey() ).append( e.getValue() );
conditionsAppended = true;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/engine/StatefulPersistenceContext.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/sql/Update.java
|
Method name: void serialize(ObjectOutputStream)
|
|
Method name: String toStatementString()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 5
|
|
1 | while ( itr.hasNext() ) {↵ | | |
|
2 | Map.Entry entry = ( Map.Entry ) itr.next();↵ | | 1 | final Map.Entry e = (Map.Entry) iter.next();↵
|
3 | oos.writeObject( entry.getKey() );↵ | | 2 | ↵
|
4 | ( ( EntityEntry ) entry.getValue() ).serialize( oos );↵ | | |
|
5 | } | | 3 | if ( conditionsAppended ) {↵
|
| | | 4 | buf.append( " and " );↵
|
| | | 5 | }↵
|
| | | 6 | buf.append( e.getKey() ).append( e.getValue() );↵
|
| | | 7 | conditionsAppended = true;
|
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.3 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |