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 (int propIndex = 0 ; propIndex < propertySize ; propIndex++) {
if ( ( (String) propertyNames.get(propIndex) ).startsWith( follower ) ) {
return propIndex;
}
}
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/core/src/main/java/org/hibernate/cfg/ResultSetMappingBinder.java
|
Method name: String cleanAlias(String)
|
|
Method name: int getIndexOfFirstMatchingProperty(List, String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for ( int i = 1; i < chars.length; i++ ) {↵ | | 1 | for (int propIndex = 0 ; propIndex < propertySize ; propIndex++) {↵
|
2 | // as soon as we encounter our first letter, return the substring↵ | | 2 | ↵
|
3 | // from that position↵ | | |
|
4 | if ( Character.isLetter( chars[i] ) ) {↵ | | 3 | if ( ( (String) propertyNames.get(propIndex) ).startsWith( follower ) ) {↵
|
5 | return alias.substring( i );↵ | | 4 | return propIndex;↵
|
6 | }↵ | | 5 | }↵
|
7 | } | | 6 | }
|
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 |