for ( int i = 1; i < chars.length; i++ ) { // as soon as we encounter our first letter, return the substring // from that position if ( Character.isLetter( chars[i] ) ) { return alias.substring( i ); } }
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/util/StringHelper.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/persister/entity/AbstractEntityPersister.java
Method name: String cleanAlias(String) Method name: boolean isAllNull(Object[], int)
Number of AST nodes: 3 Number of AST nodes: 3
1
for ( int i = 1; i < chars.length; i++ ) {
1
for ( int i = 0; i < array.length; i++ ) {
2
				// as soon as we encounter our first letter, return the substring
2
			
3
				// from that position
4
				if ( Character.isLetter( chars[i] ) ) {
3
if ( isPropertyOfTable( i, tableNumber ) && array[i] != null ) {
5
					return alias.substring( i );
4
				return false;
6
				}
5
			}
7
			}
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