while ( elements.hasNext() ) { final String element = ( String ) elements.next(); buffer.append( elementTransformer.transform( element ) ); if ( elements.hasNext() ) { buffer.append( template.getSeparator() ); } }
while ( titer.hasNext() ) { Table table = (Table) titer.next(); if ( !table.isAbstractUnionTable() ) { Iterator citer = table.getColumnIterator(); while ( citer.hasNext() ) columns.add( citer.next() ); } }
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/persister/entity/UnionSubclassEntityPersister.java
Method name: String join(Iterator, StringTransformer, StringJoinTemplate) Method name: String generateSubquery(PersistentClass, Mapping)
Number of AST nodes: 5 Number of AST nodes: 6
1
while ( elements.hasNext() ) {
1
while ( titer.hasNext() ) {
2
			final String element = ( String ) elements.next();
2
			
3
			buffer.append( elementTransformer.transform( element ) );
4
			if ( elements.hasNext() ) {
5
				buffer.append( template.getSeparator
3
Table table = (Table) titer.next();
4
			if ( !table.isAbstractUnionTable() ) {
5
				Iterator citer = table.getColumnIterator();
6
() );
6
				while ( citer.hasNext() ) columns.add( citer.next() );
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