if (childrenNames != null) { Iterator iter = childrenNames.iterator(); while ( iter.hasNext() ) { Object key = iter.next(); result.put( key, cache.get( new Fqn( regionFqn, key ), ITEM ) ); } }
while ( subIter.hasNext() ) { UniqueKey uk = (UniqueKey) subIter.next(); String constraintString = uk.sqlCreateString( dialect, mapping, defaultCatalog, defaultSchema ); if (constraintString != null) script.add( constraintString ); }
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/cfg/Configuration.java
Method name: Map toMap() Method name: String[] generateSchemaCreationScript(Dialect)
Number of AST nodes: 5 Number of AST nodes: 5
1
if (childrenNames != null) {
2
				Iterator iter = childrenNames.iterator();
3
				while ( iter.hasNext() ) {
1
while ( subIter.hasNext() ) {
4
					Object key = iter.next();
2
						UniqueKey uk = (UniqueKey) subIter.next();
5
					result.put(
3
						
6
							key,
7
					        cache.get( new Fqn( regionFqn, key ), ITEM )
4
String constraintString = uk.sqlCreateString( dialect, mapping, defaultCatalog, defaultSchema );
8
						);
5
						if (constraintString != null) script.add( constraintString );
9
				}
6
				
10
			}
7
	}
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