for ( int i = 0; i < spaces.length; i++ ) { if ( tablespaces.contains( spaces[i] ) ) { if ( log.isDebugEnabled() ) { log.debug( "changes must be flushed to space: " + spaces[i] ); } return true; } }
if ( !Character.isLetter( chars[0] ) ) { 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 ); } } }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/engine/ActionQueue.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/StringHelper.java
Method name: boolean areTablesToUpdated(List, Set) Method name: String cleanAlias(String)
Number of AST nodes: 5 Number of AST nodes: 4
1
if ( !Character.isLetter( chars[0] ) ) {
1
for ( int i = 0; i < spaces.length; i++ ) {
2
			for ( int i = 1; i < chars.length; i++ ) {
2
				if ( tablespaces.contains( spaces[i] ) ) {
3
				// as soon as we encount
3
					if ( log.isDebugEnabled() ) {
4
						log.debug( "changes must be flushed to space: " + spaces[i] );
5
					}
6
					return true
4
er our first letter, return the substring
5
				// from that position
6
				if ( Character.isLetter( chars[i] ) ) {
7
;
7
					return alias.substring( i );
8
				}
8
				}
9
			}
9
			}
10
		}
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