while ( itr.hasNext() ) {
Map.Entry entry = ( Map.Entry ) itr.next();
oos.writeObject( entry.getKey() );
( ( EntityEntry ) entry.getValue() ).serialize( oos );
}
while ( iter.hasNext() ) {
Map.Entry me = (Map.Entry) iter.next();
map.put( ( (CacheKey) me.getKey() ).getKey(), me.getValue() );
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/engine/StatefulPersistenceContext.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/stat/SecondLevelCacheStatistics.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | while ( itr.hasNext() ) {↵ | | 1 | while ( iter.hasNext() ) {↵
|
2 | Map.Entry entry = ( Map.Entry ) itr.next();↵ | | 2 | Map.Entry me = (Map.Entry) iter.next();↵
|
3 | oos.writeObject( entry.getKey() );↵ | | 3 | ↵
|
4 | ( ( EntityEntry ) entry.getValue() ).serialize( oos );↵ | | 4 | map.put( ( (CacheKey) me.getKey() ).getKey(), me.getValue() );↵
|
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 |