if (childrenNames != null) { Iterator iter = childrenNames.iterator(); while ( iter.hasNext() ) { Object key = iter.next(); result.put( key, cache.get( new Fqn( regionFqn, key ), ITEM ) ); } }
while ( iter.hasNext() ) { Object test = iter.next(); Object oldValue = sn.get(test); if ( oldValue!=null && elementType.isDirty( test, oldValue, getSession() ) ) { // the element has changed deletes.add(oldValue); } }
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/collection/PersistentSet.java
Method name: Map toMap() Method name: Iterator getDeletes(CollectionPersister, boolean)
Number of AST nodes: 5 Number of AST nodes: 5
1
if (childrenNames != null) {
2
				Iterator iter = childrenNames.iterator();
3
				while ( iter.hasNext() ) {
1
while ( iter.hasNext() ) {
4
					Object key = iter.next();
2
			Object test = iter.next();
5
					result.put(
3
			
6
							key,
7
					        cache.get( new Fqn( regionFqn, key ), ITEM )
8
						
4
Object oldValue = sn.get(test);
5
			if ( oldValue!=null && elementType.isDirty( test, oldValue, getSession() ) ) {
6
				// the element has changed
9
);
7
				deletes.add(oldValue);
10
				}
8
			}
11
			}
9
		}
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