Map.Entry entry = ( Map.Entry ) itr.next();
String alias = ( String ) entry.getKey();
if ( alias.equalsIgnoreCase( specifiedAlias ) ) {
return ( FromElement ) entry.getValue();
}
Map.Entry entry = ( Map.Entry ) itr.next();
Tuplizer tuplizer = ( Tuplizer ) entry.getValue();
if ( tuplizer.isInstance( object ) ) {
return ( EntityMode ) entry.getKey();
}
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/tuple/EntityModeToTuplizerMapping.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | Map.Entry entry = ( Map.Entry ) itr.next();↵ | | 1 | Map.Entry entry = ( Map.Entry ) itr.next();
↵
|
2 | String alias = ( String ) entry.getKey();↵ | | 2 | Tuplizer tuplizer = ( Tuplizer ) entry.getValue();
↵
|
3 | if ( alias.equalsIgnoreCase( specifiedAlias ) ) {↵ | | 3 | if ( tuplizer.isInstance( object ) ) {
↵
|
4 | return ( FromElement ) entry.getValue();↵ | | 4 | return ( EntityMode ) entry.getKey();
↵
|
5 | } | | 5 | }
|
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.0 |
Clones location | |
Number of node comparisons | 0 |