for ( int i = 0; i < args.size(); i++ ) { buf.append( args.get( i ) ); if ( i < args.size() - 1 ) { buf.append( ", " );
for ( int i = 0; i < args.size(); i++ ) { buf.append( args.get( i ) ); if ( i < args.size() - 1 ) { buf.append( ", " );
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/dialect/function/ConditionalParenthesisFunction.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/dialect/function/StandardSQLFunction.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for ( int i = 0; i < args.size(); i++ ) {
1
for ( int i = 0; i < args.size(); i++ ) {
2
	
3
			buf.append( args.get( i ) );
2
			buf.append( args.get( i ) );
4
	
5
			if ( i < args.size() - 1 ) {
3
			if ( i < args.size() - 1 ) {
6
	
7
				buf.append( ", " );
4
				buf.append( ", " );
8
	
9
			
5
			
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