if (childrenNames != null) { Iterator iter = childrenNames.iterator(); while ( iter.hasNext() ) { Object key = iter.next(); result.put( key, cache.get( new Fqn( regionFqn, key ), ITEM ) ); } }
if ( e != null ) { 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/OptimisticTreeCache.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: 5 Number of AST nodes: 5
1
if (childrenNames != null) {
1
if ( e != null ) {
2
				Iterator iter = childrenNames.iterator();
2
			
3
				while ( iter.hasNext() ) {
3
EntityKey key = new EntityKey( id, persister, source.getEntityMode() );
4
					Object key = iter.next();
4
			
5
					result.put(
6
							key,
5
source.getPersistenceContext().removeEntity(key);
7
					        cache.get( new Fqn( regionFqn, key ), ITEM )
6
			
8
						);
9
				}
10
	
7
if ( persister.hasCollections() ) new EvictVisitor( source ).process(object, persister);
11
		}
8
		}
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.2
Clones locationClones are in different classes
Number of node comparisons1