for (Iterator it = node.getChildren().iterator(); it.hasNext(); ) { if (((Node) it.next()).isValid()) { result++; } }
for ( int i = 0; i < array.length; i++ ) { if ( isPropertyOfTable( i, tableNumber ) && array[i] != null ) { return false; } }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/cache-jbosscache2/src/test/java/org/hibernate/test/cache/jbc2/entity/AbstractEntityRegionAccessStrategyTestCase.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/persister/entity/AbstractEntityPersister.java
Method name: int getValidChildrenCount(Node) Method name: boolean isAllNull(Object[], int)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (Iterator it = node.getChildren().iterator(); it.hasNext(); ) {
1
for ( int i = 
2
           if (((Node) it.next()).isValid()) {
3
              result++;
4
           }
5
        
2
0; i < array.length; i++ ) {
3
			if ( isPropertyOfTable( i, tableNumber ) && array[i] != null ) {
4
				return false;
5
			}
6
}
6
		}
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.1
Clones locationClones are in different classes
Number of node comparisons1