Iterator iter = childrenNames.iterator(); while ( iter.hasNext() ) { Object key = iter.next(); result.put( key, cache.get( new Fqn( regionFqn, key ), ITEM ) ); }
Iterator subIter = table.getForeignKeyIterator(); while ( subIter.hasNext() ) { ForeignKey fk = (ForeignKey) subIter.next(); if ( fk.isPhysicalConstraint() ) { script.add( fk.sqlDropString( dialect, defaultCatalog, defaultSchema ) ); } }
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[] generateDropSchemaScript(Dialect)
Number of AST nodes: 4 Number of AST nodes: 5
1
Iterator iter = childrenNames.iterator();
1
Iterator subIter = table.getForeignKeyIterator();
2
				while ( iter.hasNext() ) {
2
					while ( subIter.hasNext() ) {
3
					Object key = iter.next();
3
					
4
					result.put(
5
							key
4
	ForeignKey fk = (ForeignKey) subIter.next();
5
						if ( fk.isPhysicalConstraint() ) {
6
							script.add(
7
									fk.sqlDropString(
6
,
8
											dialect,
7
					        cache.get( new Fqn( regionFqn, key ), ITEM )
9
						
8
						);
10
					defaultCatalog,
11
											defaultSchema
12
										)
13
								);
14
						}
9
				}
15
					}
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