for ( int i = 0; i < subtypes.length; i++ ) {
if ( indicatesCollection( subtypes[i] ) ) {
return true;
}
}
for ( int j=0; j<tables.length; j++ ) {
if ( tableName.equals( tables[j] ) ) {
return j;
}
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/tuple/entity/EntityMetamodel.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/persister/entity/JoinedSubclassEntityPersister.java
|
Method name: boolean indicatesCollection(Type)
|
|
Method name: int getTableId(String, String[])
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for ( int i = 0; i < subtypes.length; i++ ) {↵ | | 1 | for ( int j=0; j<tables.length; j++ ) {↵
|
2 | ↵ | | |
|
3 | if ( indicatesCollection( subtypes[i] ) ) {↵ | | 2 | if ( tableName.equals( tables[j] ) ) {↵
|
4 | ↵ | | |
|
5 | return true;↵ | | 3 | return ↵
|
6 | ↵ | | 4 | j;↵
|
7 | }↵ | | 5 | }↵
|
8 | ↵ | | |
|
9 | } | | 6 | }
|
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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |