if (className.startsWith(includedClasses[i]))
{
return true;
}
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/cache-jbosscache2/src/test/java/org/hibernate/test/util/SelectedClassnameClassLoader.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/StringHelper.java
|
Method name: boolean isIncluded(String)
|
|
Method name: String cleanAlias(String)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 3
|
|
1 | if (className.startsWith(includedClasses[i]))↵ | | |
|
2 | {↵ | | |
|
3 | return true;↵ | | |
|
4 | ↵ | | 1 | for ( int i = 1; i < chars.length; i++ ) {↵
|
| | | 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 | }↵
|
5 | } | | 7 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |