for ( int j=0; j<tables.length; j++ ) { if ( tableName.equals( tables[j] ) ) { return j; } }
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/core/src/main/java/org/hibernate/persister/entity/JoinedSubclassEntityPersister.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/persister/entity/AbstractEntityPersister.java
Method name: int getTableId(String, String[]) Method name: boolean isAllNull(Object[], int)
Number of AST nodes: 3 Number of AST nodes: 3
1
for ( int j=0; j<tables.length; j++ ) {
1
for ( int i = 0; i < array.length; i++ ) {
2
			if ( tableName.equals( tables[j] ) ) {
2
			if ( isPropertyOfTable( i, tableNumber ) && array[i] != null ) {
3
				return j;
3
				return false;
4
			}
4
			}
5
		}
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.1
Clones locationClones are in different classes having the same super class
Number of node comparisons1