for ( int i = 0; i < dialectClasses.length; i++ ) {
if ( dialectClasses[i].isInstance( getDialect() ) ) {
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/testing/src/main/java/org/hibernate/junit/functional/FunctionalTestCase.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/StringHelper.java
|
Method name: boolean dialectIsOneOf(Class[])
|
|
Method name: String cleanAlias(String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for ( int i = 0; i < dialectClasses.length; i++ ) {
↵ | | 1 | for ( int i = 1; i < chars.length; i++ ) {↵
|
2 | if ( dialectClasses[i].isInstance( getDialect()↵ | | 2 | // as soon as we encounter our first letter, return the substring↵
|
| | | 3 | // from that position↵
|
3 | ) ) {
↵ | | 4 | if ( Character.isLetter( chars[i] ) ) {↵
|
4 | return true;↵ | | 5 | return ↵
|
| | | 6 | alias.substring( i );↵
|
5 | }
↵ | | 7 | }↵
|
6 | } | | 8 | }
|
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 |