for ( int dp_indx = 0; dp_indx < nestedDataPointCount; dp_indx++ ) { DataPoint dp = new DataPoint(); dp.setDescription( "data-point [" + c_indx + ", " + dp_indx + "]" ); // more HSQLDB fun... // dp.setX( new BigDecimal( c_indx ) ); dp.setX( new BigDecimal( c_indx + dp_indx ) ); dp.setY( new BigDecimal( dp_indx ) ); container.getDataPoints().add( dp ); }
Parent p = new Parent( String.valueOf( i + 100 ) ); Child child = new Child( "child" + i ); child.setParent( p ); p.getChildren().add( child ); s.save( p ); parents.add(p);
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/proxy/ProxyTest.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/reattachment/ProxyReattachmentTest.java
Method name: void testFullyLoadedPCSerialization() Method name: void testIterateWithEvictTopOfLoop()
Number of AST nodes: 6 Number of AST nodes: 6
1
for ( int dp_indx = 0; dp_indx < nestedDataPointCount; dp_indx++ ) {
2
				DataPoint dp = new DataPoint();
3
				dp.setDescription( "data-point [" + c_indx + ", " + dp_indx + "]" );
4
// more HSQLDB fun...
5
//				dp.setX( new BigDecimal( c_indx )
1
Parent p = new Parent( String.valueOf( i + 100 ) );
2
			Child child = new Child( "child" + i );
6
 );
3
			child.setParent( p );
7
				dp.setX( new BigDecimal( c_indx + dp_indx ) );
4
			p.getChildren().add( child );
8
				dp.setY( new BigDecimal( dp_indx ) );
5
			s.save( p );
9
				container.getDataPoints().add( dp );
6
			parents.add(
10
			}
7
p);
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 having the same super class
Number of node comparisons30