while ( it.hasNext() ) {
ForeignKeyMetadata existingFk = ( ForeignKeyMetadata ) it.next();
if ( existingFk.matches( fk ) ) {
return existingFk;
}
}
while ( iterator.hasNext() ) {
Property prop = (Property) iterator.next();
if ( prop.getName().equals( StringHelper.root(propertyName) ) ) {
return prop;
}
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/tool/hbm2ddl/TableMetadata.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/mapping/PersistentClass.java
|
Method name: ForeignKeyMetadata getForeignKeyMetadata(ForeignKey)
|
|
Method name: Property getProperty(String, Iterator)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | while ( it.hasNext() ) {↵ | | 1 | while ( iterator.hasNext() ) {↵
|
2 | ForeignKeyMetadata existingFk = ( ForeignKeyMetadata ) it.next();↵ | | 2 | ↵
|
3 | if ( existingFk.matches( fk↵ | | 3 | Property prop = (Property) iterator.next();↵
|
4 | ) ) {↵ | | 4 | if ( prop.getName().equals( StringHelper.root(propertyName) ) ) {↵
|
5 | return existingFk;↵ | | 5 | return prop;↵
|
6 | }↵ | | 6 | }↵
|
7 | } | | 7 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |