StringBuffer columns = new StringBuffer(); Iterator iter = val.getColumnIterator(); while ( iter.hasNext() ) { columns.append( ( (Selectable) iter.next() ).getText() ); if ( iter.hasNext() ) columns.append( ", " ); } return columns.toString();
StringBuffer buffer = new StringBuffer(); Iterator itr = paramSpecs.iterator(); while ( itr.hasNext() ) { buffer.append( ( ( ParameterSpecification ) itr.next() ).renderDisplayInfo() ); } return buffer.toString();
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/cfg/CollectionSecondPass.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/ast/tree/IndexNode.java
Method name: String columns(Value) Method name: String collectDisplayInfo()
Number of AST nodes: 7 Number of AST nodes: 5
1
StringBuffer columns = new StringBuffer();
1
StringBuffer buffer = new StringBuffer();
2
		Iterator iter = val.getColumnIterator();
2
			Iterator itr = paramSpecs.iterator();
3
		while ( iter.hasNext() ) {
3
			while ( itr.hasNext() ) {
4
			columns.append( ( (Selectable) iter.next() ).getText() );
4
				buffer.append( ( ( ParameterSpecification ) itr.next() ).
5
			if ( iter.hasNext() ) columns.append( ", " );
5
renderDisplayInfo() );
6
		}
6
			}
7
		return columns.toString();
7
			return buffer.toString();
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