while ( children.hasNext() ) { FromClause child = ( FromClause ) children.next(); if ( child.findJoinByPathLocal( path ) != null ) { return child; } }
while ( it.hasNext() ) { ForeignKeyMetadata existingFk = ( ForeignKeyMetadata ) it.next(); if ( existingFk.matches( fk ) ) { return existingFk; } }
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/tool/hbm2ddl/TableMetadata.java
Method name: FromClause locateChildFromClauseWithJoinByPath(String) Method name: ForeignKeyMetadata getForeignKeyMetadata(ForeignKey)
Number of AST nodes: 4 Number of AST nodes: 4
1
while ( children.hasNext() ) {
1
while ( it.hasNext() ) {
2
				FromClause child = ( FromClause ) children.next();
2
			ForeignKeyMetadata existingFk = ( ForeignKeyMetadata ) it.next();
3
				if ( child.findJoinByPathLocal( path ) != null ) {
3
			if ( existingFk.matches( fk ) ) {
4
					return child;
4
				return existingFk;
5
				}
5
			}
6
			}
6
		}
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