while ( children.hasNext() ) { FromClause child = ( FromClause ) children.next(); if ( child.findJoinByPathLocal( path ) != null ) { return child; } }
while ( itr.hasPrevious() ) { AuxiliaryDatabaseObject object = (AuxiliaryDatabaseObject) itr.previous(); if ( object.appliesToDialect( dialect ) ) { script.add( object.sqlDropString( dialect, defaultCatalog, defaultSchema ) ); } }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/ast/tree/FromClause.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/cfg/Configuration.java
Method name: FromClause locateChildFromClauseWithJoinByPath(String) Method name: String[] generateDropSchemaScript(Dialect)
Number of AST nodes: 4 Number of AST nodes: 4
1
while ( children.hasNext() ) {
1
while ( 
2
				FromClause child = ( FromClause ) children.next
2
itr.hasPrevious() ) {
3
();
3
			AuxiliaryDatabaseObject object = (AuxiliaryDatabaseObject) itr.previous();
4
				if ( child.findJoinByPathLocal( path ) != null ) {
4
			if ( 
5
					return child
5
object.appliesToDialect( dialect ) ) {
6
;
6
				script.add( object.sqlDropString( dialect, defaultCatalog, defaultSchema ) );
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.1
Clones locationClones are in different classes
Number of node comparisons1