if ( lockModes != null ) { Iterator iter = lockModes.entrySet().iterator(); while ( iter.hasNext() ) { Map.Entry me = ( Map.Entry ) iter.next(); nameLockModes.put( getAliasName( ( String ) me.getKey() ), me.getValue() ); } }
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/hql/classic/QueryTranslatorImpl.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/loader/custom/sql/SQLQueryReturnProcessor.java
Method name: LockMode[] getLockModes(Map) Method name: Map filter(Map)
Number of AST nodes: 5 Number of AST nodes: 5
1
if ( lockModes != null ) {
2
			Iterator iter = lockModes.entrySet().iterator();
3
			while ( iter.hasNext() ) {
1
while ( iter.hasNext() ) {
4
				Map.Entry me = ( Map.Entry ) iter.next();
2
			Map.Entry element = ( Map.Entry ) iter.next();
5
				nameLockModes.put( getAliasName( ( String ) me.getKey() ),
3
			String path = ( String ) element.getKey()
6
						me
4
;
5
			if ( path.startsWith( keyPrefix ) ) {
7
.getValue() );
6
				result.put( path.substring( keyPrefix.length() ), element.getValue() );
8
			}
7
			}
9
		}
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.0
Clones locationClones are in different classes
Number of node comparisons1