while ( rs.hasNext() ) { count++; Object[] row = (Object[]) rs.next(); assertTrue( row[0] instanceof Long ); assertTrue( row[1] instanceof String ); assertTrue( row[2] instanceof Foo ); assertTrue( row[3] instanceof Foo ); }
while ( rs.hasNext() ) { count++; Object[] row = (Object[]) rs.next(); assertTrue( row[0] instanceof Long ); assertTrue( row[1] instanceof FooComponent ); assertTrue( row[2] instanceof Foo ); assertTrue( row[3] instanceof Foo ); }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/legacy/FooBarTest.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/legacy/FooBarTest.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
while ( rs.hasNext() ) {
1
while ( rs.hasNext() ) {
2
			count++;
2
			count++;
3
			Object[] row = (Object[]) rs.next();
3
			Object[] row = (Object[]) rs.next();
4
			assertTrue( row[0] instanceof Long );
4
			assertTrue( row[0] instanceof Long );
5
			assertTrue( row[1] instanceof String );
5
			assertTrue( row[1] instanceof FooComponent );
6
			assertTrue( row[2] instanceof Foo );
6
			assertTrue( row[2] instanceof Foo );
7
			assertTrue( row[3] instanceof Foo );
7
			assertTrue( row[3] instanceof Foo );
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