public String toWhereClause() { StringBuffer buf = new StringBuffer( whereTokens.size() * 5 ); Iterator iter = whereTokens.iterator(); while ( iter.hasNext() ) { buf.append( iter.next() ); if ( iter.hasNext() ) buf.append(' '); } return buf.toString();
private String keyString() { StringBuffer buff = new StringBuffer(); Iterator itr = subProperties.keySet().iterator(); while ( itr.hasNext() ) { buff.append( itr.next() ); if ( itr.hasNext() ) { buff.append( ", " ); } } return buff.toString();
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/sql/SimpleSelect.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/any/ComplexPropertyValue.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public String toWhereClause() {
1
private String keyString() {
2
		StringBuffer buf = new StringBuffer( whereTokens.size() * 5 );
2
		StringBuffer buff = new StringBuffer();
3
		Iterator iter = whereTokens.iterator();
3
		Iterator itr = subProperties.keySet().iterator();
4
		while ( iter.hasNext() ) {
4
		while ( itr.hasNext() ) {
5
			buf.append( iter.next() );
5
			buff.append( itr.next() );
6
			if ( iter.hasNext() ) 
6
			if ( itr.hasNext() ) {
7
buf.append(' ');
7
				buff.append( ", " );
8
		}
8
			}
9
		}
9
		return buf.toString();
10
		return buff.toString();
10
	
11
	
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 location
Number of node comparisons0