initialize( true ); Iterator itr = puts.entrySet().iterator(); while ( itr.hasNext() ) { Map.Entry entry = ( Entry ) itr.next(); put( entry.getKey(), entry.getValue() ); }
while ( elements.hasNext() ) { final String element = ( String ) elements.next(); buffer.append( elementTransformer.transform( element ) ); if ( elements.hasNext() ) { buffer.append( template.getSeparator() ); } }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentMap.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/dialect/function/DerbyConcatFunction.java
Method name: void putAll(Map) Method name: String join(Iterator, StringTransformer, StringJoinTemplate)
Number of AST nodes: 5 Number of AST nodes: 5
1
initialize( true );
2
			Iterator itr = puts.entrySet().iterator();
3
			while ( itr.hasNext() ) {
4
				Map.Entry entry = ( Entry ) itr.next();
5
				put( entry.getKey(), entry.getValue
1
while ( elements.hasNext() ) {
2
			final String element = ( String ) elements.next();
3
			buffer.append( elementTransformer.transform( element ) );
4
			if ( elements.hasNext() ) {
6
() );
5
				buffer.append( template.getSeparator() );
7
			}
6
			}
7
		}
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