for ( int i = 0; i < includedPackages.length; i++ ) { if ( className.startsWith( includedPackages[i] ) ) { return true; } }
for ( int i = 0; i < xvalues.length; i++ ) { if ( propertyTypes[i].isDirty( xvalues[i], yvalues[i], session ) ) { return true; } }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/bytecode/util/BasicClassFilter.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/type/ComponentType.java
Method name: boolean isInIncludedPackage(String) Method name: boolean isDirty(Object, Object, SessionImplementor)
Number of AST nodes: 3 Number of AST nodes: 3
1
for ( int i = 0; i < includedPackages.length; i++ ) {
1
for ( int i = 0; i < xvalues.length; i++ ) {
2
	
3
			if ( className.startsWith( includedPackages[i] ) ) {
2
			if ( propertyTypes[i].isDirty( xvalues[i], yvalues[i], session ) ) {
4
					return true;
3
				return true;
5
	
6
			}
4
			}
7
	
8
		}
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
Number of node comparisons1