while ( iter.hasNext() ) { Map.Entry e = (Map.Entry) iter.next(); final Object copy = persister.getElementType() .deepCopy( e.getValue(), entityMode, persister.getFactory() ); clonedMap.put( e.getKey(), copy ); }
while ( iter.hasNext() ) { Map.Entry element = ( Map.Entry ) iter.next(); String path = ( String ) element.getKey(); if ( path.startsWith( keyPrefix ) ) { result.put( path.substring( keyPrefix.length() ), element.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/loader/custom/sql/SQLQueryReturnProcessor.java
Method name: Serializable getSnapshot(CollectionPersister) Method name: Map filter(Map)
Number of AST nodes: 4 Number of AST nodes: 5
1
while ( iter.hasNext() ) {
1
while ( iter.hasNext() ) {
2
			Map.Entry e = (Map.Entry) iter.next();
2
			Map.Entry element = ( Map.Entry ) iter.next();
3
			final Object copy = persister.getElementType()
3
			
4
				.deepCopy( e.getValue(), entityMode, persister.getFactory() );
5
			clonedMap.put( e.getKey(), copy );
4
String path = ( String ) element.getKey();
5
			if ( path.startsWith( keyPrefix ) ) {
6
				result.put( path.substring( keyPrefix.length() ), element.getValue() );
7
			}
6
		}
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