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 (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/util/StringHelper.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: String cleanAlias(String) Method name: int getValidChildrenCount(Node)
Number of AST nodes: 3 Number of AST nodes: 3
1
for ( int i = 1; i < chars.length; i++ ) {
1
for (Iterator it 
2
				// as soon as we encounter our first letter, return the substring
3
				// from that position
4
				if ( Character.isLetter( chars[i] ) ) {
5
					return alias.substring( i );
6
				}
7
			
2
= node.getChildren().iterator(); it.hasNext(); ) {
3
           if (((Node) it.next()).isValid()) {
4
              result++;
5
           }
8
}
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