while ( elements.hasNext() ) { final String element = ( String ) elements.next(); buffer.append( elementTransformer.transform( element ) ); if ( elements.hasNext() ) { buffer.append( template.getSeparator() ); } }
while ( itr.hasNext() ) { Map.Entry entry = ( Map.Entry ) itr.next(); ( ( EntityKey ) 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/dialect/function/DerbyConcatFunction.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/engine/StatefulPersistenceContext.java
Method name: String join(Iterator, StringTransformer, StringJoinTemplate) Method name: void serialize(ObjectOutputStream)
Number of AST nodes: 5 Number of AST nodes: 4
1
while ( elements.hasNext() ) {
1
while ( itr.hasNext() ) {
2
			final String element = ( String ) elements.next();
2
			
3
			buffer.append( elementTransformer.transform( element ) );
4
			if ( elements.hasNext() ) {
5
				buffer.append( template.getSeparator() );
6
			}
3
Map.Entry entry = ( Map.Entry ) itr.next();
4
			( ( EntityKey ) entry.getKey() ).serialize( oos );
5
			oos.writeObject( entry.getValue() );
7
		}
6
		}
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 locationClones are in different classes
Number of node comparisons1