if ( persister.hasCache() ) { final CacheKey ck = new CacheKey( id, persister.getIdentifierType(), persister.getRootEntityName(), source.getEntityMode(), source.getFactory() ); persister.getCacheAccessStrategy().evict( ck ); }
while ( iter.hasNext() ) { Map.Entry me = (Map.Entry) iter.next(); list.add( new IdentityMapEntry( ( (IdentityKey) me.getKey() ).key, me.getValue() ) ); }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/event/def/DefaultRefreshEventListener.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/IdentityMap.java
Method name: void onRefresh(RefreshEvent, Map) Method name: List entryList()
Number of AST nodes: 3 Number of AST nodes: 3
1
if ( persister.hasCache() ) {
1
while ( iter.hasNext() ) {
2
			final CacheKey ck = new CacheKey(
2
			
3
					id,
4
					persister.getIdentifierType(),
3
Map.Entry me = (Map.Entry) iter.next();
5
					persister.getRootEntityName(),
4
			
6
					source.getEntityMode(), 
7
					source.getFactory()
8
			);
9
			persister.getCacheAccessStrategy().evict( ck );
5
list.add( new IdentityMapEntry( ( (IdentityKey) me.getKey() ).key, me.getValue() ) );
10
		}
6
		}
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones locationClones are in different classes
Number of node comparisons1