initialize( true ); Iterator itr = puts.entrySet().iterator(); while ( itr.hasNext() ) { Map.Entry entry = ( Entry ) itr.next(); put( entry.getKey(), entry.getValue() ); }
for ( Iterator iter = beings.iterator(); iter.hasNext(); ) { Being b = (Being) iter.next(); assertNotNull( b.getLocation() ); assertNotNull( b.getIdentity() ); assertNotNull( b.getSpecies() ); }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentMap.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/subselect/SubselectTest.java
Method name: void putAll(Map) Method name: void testEntitySubselect()
Number of AST nodes: 5 Number of AST nodes: 5
1
initialize( true );
2
			Iterator itr = puts.entrySet().iterator();
1
for ( Iterator iter = beings.iterator();
3
			while ( itr.hasNext() ) {
2
 iter.hasNext(); ) {
4
				Map.Entry entry = ( Entry ) itr.next();
3
			Being b = (Being) iter.next();
5
				put( entry.getKey(), entry.getValue
4
			assertNotNull( b.getLocation() );
5
			assertNotNull( b.getIdentity() );
6
() );
6
			assertNotNull( b.getSpecies() );
7
			}
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