while ( elements.hasNext() ) { final String element = ( String ) elements.next(); buffer.append( elementTransformer.transform( element ) ); if ( elements.hasNext() ) { buffer.append( template.getSeparator() ); } }
while ( iter.hasNext() ) { cols.clear(); Join join = (Join) iter.next(); checkColumnDuplication( cols, join.getKey().getColumnIterator() ); checkPropertyColumnDuplication( cols, join.getPropertyIterator() ); }
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/mapping/PersistentClass.java
Method name: String join(Iterator, StringTransformer, StringJoinTemplate) Method name: void checkColumnDuplication()
Number of AST nodes: 5 Number of AST nodes: 5
1
while ( elements.hasNext() ) {
1
while ( iter.hasNext() ) {
2
			final String element = ( String ) elements.next();
2
			
3
			buffer.append( elementTransformer.transform( element ) );
4
			if ( elements.hasNext
3
cols.clear();
4
			Join join = (Join) iter.next();
5
() ) {
5
			checkColumnDuplication( cols, join.getKey().getColumnIterator() );
6
				buffer.append( template.getSeparator() );
6
			checkPropertyColumnDuplication( cols, join.getPropertyIterator() );
7
			}
7
		
8
		}
8
}
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