while ( props.hasNext() ) { if ( ( (Property) props.next() ).isNaturalIdentifier() ) { return true; } }
for (Iterator it = node.getChildren().iterator(); it.hasNext(); ) { if (((Node) it.next()).isValid()) { result++; } }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/mapping/PersistentClass.java File path: /hibernate-distribution-3.3.2.GA/project/cache-jbosscache2/src/test/java/org/hibernate/test/cache/jbc2/entity/AbstractEntityRegionAccessStrategyTestCase.java
Method name: boolean hasNaturalId() Method name: int getValidChildrenCount(Node)
Number of AST nodes: 3 Number of AST nodes: 3
1
while ( props.hasNext() ) {
1
for (Iterator it = node.getChildren().iterator(); it.hasNext(); ) {
2
			if ( ( (Property) props.next() ).isNaturalIdentifier() ) {
2
           if (((Node) it.next()).isValid()) {
3
				return true;
4
			}
5
		
3
              result++;
4
           }
6
}
5
        }
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.2
Clones locationClones are in different classes
Number of node comparisons1