Iterator iter = childrenNames.iterator(); while ( iter.hasNext() ) { Object key = iter.next(); result.put( key, cache.get( new Fqn( regionFqn, key ), ITEM ) ); }
Serializable idOfOld = ForeignKeys.getEntityIdentifierIfNotUnsaved(entityName, iter.next(), session); if ( idType.isEqual( idOfCurrent, idOfOld, session.getEntityMode(), session.getFactory() ) ) { iter.remove(); break; }
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/AbstractPersistentCollection.java
Method name: Map toMap() Method name: void identityRemove(Collection, Object, String, SessionImplementor)
Number of AST nodes: 4 Number of AST nodes: 4
1
Iterator iter = childrenNames.iterator();
2
				while ( iter.hasNext() ) {
3
					Object key = iter.next();
4
					result.put(
5
							key,
6
					        cache.get( new Fqn( regionFqn, key ), ITEM )
7
						)
1
Serializable idOfOld = ForeignKeys.getEntityIdentifierIfNotUnsaved(entityName, iter.next(), session);
2
				if ( idType.isEqual( idOfCurrent, idOfOld, session.getEntityMode(), session.getFactory() ) ) {
3
					iter.remove();
8
;
4
					break;
9
				}
5
				}
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.1
Clones locationClones are in different classes
Number of node comparisons1