Iterator iter = childrenNames.iterator(); while ( iter.hasNext() ) { Object key = iter.next(); result.put( key, cache.get( new Fqn( regionFqn, key ), ITEM ) ); }
while ( itr.hasNext() ) { Map.Entry entry = ( Map.Entry ) itr.next(); String alias = ( String ) entry.getKey(); if ( alias.equalsIgnoreCase( specifiedAlias ) ) { return ( FromElement ) entry.getValue(); } }
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/hql/ast/tree/FromClause.java
Method name: Map toMap() Method name: FromElement findIntendedAliasedFromElementBasedOnCrazyJPARequirements(String)
Number of AST nodes: 4 Number of AST nodes: 5
1
Iterator iter = childrenNames.iterator();
2
				while ( iter.hasNext() ) {
1
while ( itr.hasNext() ) {
3
					Object key = iter.next();
2
			Map.Entry entry = ( Map.Entry ) itr.next();
4
					result.put(
3
			
5
							key,
6
					        cache.get( new Fqn( regionFqn, key ), ITEM )
7
						
4
String alias = ( String ) entry.getKey();
5
			if ( alias.equalsIgnoreCase( specifiedAlias ) ) {
8
);
6
				return ( FromElement ) entry.getValue();
9
			
7
			}
10
	}
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