for ( int j=0; j<tables.length; j++ ) { if ( tableName.equals( tables[j] ) ) { return j; } }
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/persister/entity/JoinedSubclassEntityPersister.java File path: /hibernate-distribution-3.3.2.GA/project/cache-jbosscache2/src/test/java/org/hibernate/test/cache/jbc2/collection/AbstractCollectionRegionAccessStrategyTestCase.java
Method name: int getTableId(String, String[]) Method name: int getValidChildrenCount(Node)
Number of AST nodes: 3 Number of AST nodes: 3
1
for ( int j=0; j<tables.length; j++ ) {
1
for (Iterator it 
2
			if ( tableName.equals( tables[j] ) ) {
3
				return j;
4
			}
5
		
2
= node.getChildren().iterator(); it.hasNext(); ) {
3
           if (((Node) it.next()).isValid()) {
4
              result++;
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