FilterImpl filter = (FilterImpl) iter.next(); FilterKey key = new FilterKey( filter.getName(), filter.getParameters(), filter.getFilterDefinition().getParameterTypes(), entityMode ); result.add(key);
if ( persister.hasCache() ) { final CacheKey ck = new CacheKey( id, persister.getIdentifierType(), persister.getRootEntityName(), source.getEntityMode(), source.getFactory() ); persister.getCacheAccessStrategy().evict( ck ); }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/cache/FilterKey.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/event/def/DefaultRefreshEventListener.java
Method name: Set createFilterKeys(Map, EntityMode) Method name: void onRefresh(RefreshEvent, Map)
Number of AST nodes: 3 Number of AST nodes: 3
1
FilterImpl filter = (FilterImpl) iter.next();
2
			Filter
1
if ( persister.hasCache() ) {
3
Key key = new FilterKey(
2
			final CacheKey ck = new CacheKey(
4
					filter.getName(), 
3
					
5
					filter.getParameters
4
id,
6
(), 
5
					persister.getIdentifierType(),
7
					filter.getFilterDefinition().getParameterTypes(), 
6
					persister.getRootEntityName(),
8
					entityMode
7
					source.getEntityMode(), 
9
				);
8
				
10
			result.add(key);
9
	source.getFactory()
10
			);
11
			persister.getCacheAccessStrategy().evict( ck );
12
		}
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 comparisons6