Map.Entry me = (Map.Entry) iter.next(); buf.append(" casewhen(") .append( me.getKey() ) .append(" is not null") .append(", ") .append( me.getValue() ) .append(", "); buf2.append(")");
Map.Entry me = (Map.Entry) iter.next(); buf.append(" if(") .append( me.getKey() ) .append(" is not null") .append(", ") .append( me.getValue() ) .append(", "); buf2.append(")");
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/sql/HSQLCaseFragment.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/sql/MckoiCaseFragment.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
Map.Entry me = (Map.Entry) iter.next();
1
Map.Entry me = (Map.Entry) iter.next();
2
			buf.append(" casewhen(")
2
			buf.append(" if(")
3
				.append( me.getKey() )
3
				.append( me.getKey() )
4
				.append(" is not null")
4
				.append(" is not null")
5
				.append(", ")
5
				.append(", ")
6
				.append( me.getValue() )
6
				.append( me.getValue() )
7
				.append(", ");
7
				.append(", ");
8
			buf2.append(")");
8
			buf2.append(")");
9
		
9
		
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