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() ); } }
while( itr.hasNext() ) { Map.Entry entry = ( Map.Entry ) itr.next(); Tuplizer tuplizer = ( Tuplizer ) entry.getValue(); if ( tuplizer.isInstance( object ) ) { return ( EntityMode ) entry.getKey(); } }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/loader/custom/sql/SQLQueryReturnProcessor.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/tuple/EntityModeToTuplizerMapping.java
Method name: Map filter(Map) Method name: EntityMode guessEntityMode(Object)
Number of AST nodes: 5 Number of AST nodes: 5
1
while ( iter.hasNext() ) {
1
while( itr.hasNext() ) {
2
			Map.Entry element = ( Map.Entry ) iter.next();
2
			Map.Entry entry = ( Map.Entry ) itr.next();
3
			String path = ( String ) element.getKey();
3
			
4
			if ( path.startsWith( keyPrefix ) ) {
5
				result.put( path.substring( keyPrefix.length()
4
Tuplizer tuplizer = ( Tuplizer ) entry.getValue();
5
			if ( tuplizer.isInstance( object ) ) {
6
 ), element.getValue() );
6
				return ( EntityMode ) entry.getKey();
7
			}
7
			}
8
		}
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.1
Clones locationClones are in different classes
Number of node comparisons1