Location l = (Location) iter.next(); assertNotNull( l.getName() ); Iterator iter2 = l.getBeings().iterator(); while ( iter2.hasNext() ) { count++; assertSame( ( (Being) iter2.next() ).getLocation(), l ); }
Location l = (Location) iter.next(); assertNotNull( l.getName() ); Iterator iter2 = l.getBeings().iterator(); while ( iter2.hasNext() ) { count++; assertSame( ( (Being) iter2.next() ).getLocation(), l ); }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/unionsubclass/UnionSubclassTest.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/unionsubclass/UnionSubclassTest.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
Location l = (Location) iter.next();
1
Location l = (Location) iter.next();
2
			assertNotNull( l.getName() );
2
			assertNotNull( l.getName() );
3
			Iterator iter2 = l.getBeings().iterator();
3
			Iterator iter2 = l.getBeings().iterator();
4
			while ( iter2.hasNext() ) {
4
			while ( iter2.hasNext() ) {
5
				count++;
5
				count++;
6
				assertSame( ( (Being) iter2.next() ).getLocation(), l );
6
				assertSame( ( (Being) iter2.next() ).getLocation(), l );
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 location
Number of node comparisons0