while ( itr.hasNext() ) { Map.Entry entry = ( Map.Entry ) itr.next(); ( ( EntityUniqueKey ) entry.getKey() ).serialize( oos ); oos.writeObject( entry.getValue() ); }
while ( itr.hasNext() ) { Map.Entry entry = ( Map.Entry ) itr.next(); ( ( CollectionKey ) entry.getKey() ).serialize( oos ); oos.writeObject( entry.getValue() ); }
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/engine/StatefulPersistenceContext.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
while ( itr.hasNext() ) {
1
while ( itr.hasNext() ) {
2
			Map.Entry entry = ( Map.Entry ) itr.next();
2
			Map.Entry entry = ( Map.Entry ) itr.next();
3
			( ( EntityUniqueKey ) entry.getKey() ).serialize( oos );
3
			( ( CollectionKey ) entry.getKey() ).serialize( oos );
4
			oos.writeObject( entry.getValue() );
4
			oos.writeObject( entry.getValue() );
5
		}
5
		}
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0