Iterator iter = childrenNames.iterator(); while ( iter.hasNext() ) { Object key = iter.next(); result.put( key, cache.get( new Fqn( regionFqn, key ), ITEM ) ); }
EntityKey key = new EntityKey( id, persister, source.getEntityMode() ); source.getPersistenceContext().removeEntity(key); if ( persister.hasCollections() ) new EvictVisitor( source ).process(object, persister);
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/cache-jbosscache/src/main/java/org/hibernate/cache/TreeCache.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/event/def/DefaultRefreshEventListener.java
Method name: Map toMap() Method name: void onRefresh(RefreshEvent, Map)
Number of AST nodes: 4 Number of AST nodes: 4
1
Iterator iter = childrenNames.iterator();
2
				while ( iter.hasNext() ) {
1
EntityKey key = new EntityKey( id, persister, source.getEntityMode() );
3
					Object key = iter.next();
2
			
4
					result.put( 
5
							key, 
3
source.getPersistenceContext().removeEntity(key);
6
							cache.get( new Fqn( regionFqn, key ), ITEM )
4
			
7
						);
8
				}
5
if ( persister.hasCollections() ) new EvictVisitor( source ).process(object, persister);
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