Map.Entry e = (Map.Entry) iter.next(); final Object copy = persister.getElementType() .deepCopy( e.getValue(), entityMode, persister.getFactory() ); clonedMap.put( e.getKey(), copy );
Iterator iter = lockModes.entrySet().iterator(); while ( iter.hasNext() ) { Map.Entry me = ( Map.Entry ) iter.next(); nameLockModes.put( getAliasName( ( String ) me.getKey() ), me.getValue() ); }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentMap.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/classic/QueryTranslatorImpl.java
Method name: Serializable getSnapshot(CollectionPersister) Method name: LockMode[] getLockModes(Map)
Number of AST nodes: 3 Number of AST nodes: 4
1
Map.Entry e = (Map.Entry) iter.next();
2
			final Object copy = persister.getElementType
1
Iterator iter = lockModes.entrySet().iterator();
2
			while ( iter.hasNext() ) {
3
()
3
				Map.Entry me = ( Map.Entry ) iter.next();
4
				.deepCopy( e.getValue(), entityMode, persister.getFactory() );
4
				nameLockModes.put( getAliasName( ( String ) me.getKey() ),
5
			clonedMap.put( e.getKey(), copy );
5
						me.getValue() );
6
			}
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 comparisons10