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 );
}
}
while ( it.hasNext() ) {
if ( !map.containsKey( it.next() ) ) {
return false;
}
}
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/util/IdentitySet.java
|
Method name: String cleanAlias(String)
|
|
Method name: boolean containsAll(Collection)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for ( int i = 1; i < chars.length; i++ ) {↵ | | 1 | while ( it.hasNext() ) {↵
|
2 | // as soon as we encounter our first letter, return the substring↵ | | 2 | if ( !map.cont↵
|
3 | // from that position↵ | | |
|
4 | if ( Character.isLetter( chars[i] ) ) {↵ | | 3 | ainsKey( it.next() ) ) {↵
|
5 | return alias.substring( i );↵ | | 4 | return false;↵
|
6 | }↵ | | 5 | }↵
|
7 | } | | 6 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 5 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 0.4 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
4 | if (Character.isLetter(chars[i])) | | 3 | if (!map.containsKey(it.next())) |
| | | 4 | |
5 | return alias.substring(i); | | | |
Precondition Violations (2)
Row |
Violation |
1 | Unmatched return false; |
2 | Unmatched return alias.substring(i); |