initialize( true );
Iterator itr = puts.entrySet().iterator();
while ( itr.hasNext() ) {
Map.Entry entry = ( Entry ) itr.next();
put( entry.getKey(), entry.getValue() );
}
AST and = create( AND, "{and}" );
AST currentFirstChild = statement.getWhereClause().getFirstChild();
and.setFirstChild( discrimNode );
and.addChild( currentFirstChild );
statement.getWhereClause().setFirstChild( and );
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentMap.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/ast/util/SyntheticAndFactory.java
|
Method name: void putAll(Map)
|
|
Method name: void addDiscriminatorWhereFragment(RestrictableStatement, Queryable, Map, String)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | initialize( true );↵ | | |
|
2 | Iterator itr = puts.entrySet().iterator();↵ | | |
|
3 | w↵ | | 1 | AST and = create( AND, "{and}" );↵
|
| | | 2 | AST currentFirstChild = statement.getWhereClause().getFirstChild();↵
|
4 | hile ( itr.hasNext() ) {↵ | | 3 | and.setFirstChil↵
|
5 | Map.Entry entry = ( Entry ) itr.next();↵ | | |
|
6 | put( ↵ | | 4 | d( discrimNode );↵
|
| | | 5 | and.addChild( currentFirstChild );↵
|
7 | entry.getKey(), entry.getValue() );↵ | | 6 | statement.get↵
|
8 | } | | 7 | WhereClause().setFirstChild( and );
|
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 | Clones are in different classes |
Number of node comparisons | 15 |