if (childrenNames != null) { Iterator iter = childrenNames.iterator(); while ( iter.hasNext() ) { Object key = iter.next(); result.put( key, cache.get( new Fqn( regionFqn, key ), ITEM ) ); } }
Iterator ukiter = getUniqueKeyIterator(); while ( ukiter.hasNext() ) { UniqueKey uk = (UniqueKey) ukiter.next(); String constraint = uk.sqlConstraintString( dialect ); if ( constraint != null ) { buf.append( ", " ).append( constraint ); } }
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/mapping/Table.java
Method name: Map toMap() Method name: String sqlCreateString(Dialect, Mapping, String, String)
Number of AST nodes: 5 Number of AST nodes: 6
1
if (childrenNames != null) {
2
				Iterator iter = childrenNames.iterator();
1
Iterator ukiter = getUniqueKeyIterator();
3
				while ( iter.hasNext() ) {
2
			while ( ukiter.hasNext() ) {
4
					Object key = iter.next();
3
				
5
					result.put(
6
							key,
7
					        cache.get( new Fqn( regionFqn, key ), ITEM )
8
						
4
UniqueKey uk = (UniqueKey) ukiter.next();
5
				String constraint = uk.sqlConstraintString( dialect );
6
				if ( constraint != null ) {
9
);
7
					buf.append( ", " ).append( constraint );
10
				}
8
				}
11
			}
9
			}
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