while ( itr.hasNext() ) { // find john final Person p = ( Person ) itr.next(); if ( p.getName().equals( "John Doe" ) ) { Employee john = ( Employee ) p; assertEquals( "Incorrect fecthed minions count", 1, john.getMinions().size() ); break;
while ( itr.hasNext() ) { // find john final Person p = ( Person ) itr.next(); if ( p.getName().equals( "John Doe" ) ) { Employee john = ( Employee ) p; assertEquals( "Incorrect fecthed minions count", 1, john.getMinions().size() ); break;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/subclassfilter/DiscrimSubclassFilterTest.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/subclassfilter/DiscrimSubclassFilterTest.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
while ( itr.hasNext() ) {
1
while ( itr.hasNext() ) {
2
			// find john
2
			// find john
3
			final Person p = ( Person ) itr.next();
3
			final Person p = ( Person ) itr.next();
4
			if ( p.getName().equals( "John Doe" ) ) {
4
			if ( p.getName().equals( "John Doe" ) ) {
5
				Employee john = ( Employee ) p;
5
				Employee john = ( Employee ) p;
6
				assertEquals( "Incorrect fecthed minions count", 1, john.getMinions().size() );
6
				assertEquals( "Incorrect fecthed minions count", 1, john.getMinions().size() );
7
				break;
7
				break;
8
			
8
			
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