for ( Iterator it = s.createQuery( "from Parent" ).iterate(); it.hasNext(); ) { i++; if (i % 2 == 0) { s.flush(); s.clear(); } Parent p = (Parent) it.next(); assertEquals( 1, p.getChildren().size() ); }
for (Iterator it = s.createQuery( "from Parent" ).iterate(); it.hasNext(); ) { Parent p = (Parent) it.next(); assertEquals( 1, p.getChildren().size() ); i++; if (i % 2 == 0) { s.flush(); s.clear();
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/reattachment/ProxyReattachmentTest.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/reattachment/ProxyReattachmentTest.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for ( Iterator it = s.createQuery( "from Parent" ).iterate(); it.hasNext(); ) {
1
for (Iterator it = s.createQuery( "from Parent" ).iterate(); it.hasNext(); ) {
2
			i++;
2
			
3
			if (i % 2 == 0) {
4
				s.flush();
5
				s.clear();
6
			}
7
			Parent p = (Parent) it.next();
3
Parent p = (Parent) it.next();
8
			assertEquals( 1, p.getChildren().size() );
4
			assertEquals( 1, p.getChildren().size() );
9
		}
5
			i++;
6
			if (i % 2 == 0) {
7
				s.flush();
8
				s.clear();
9
			
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