for (int i=b; i<e; i++) {
if (input.charAt(mymatch.index+i-b) != input.charAt(i)) {
return false;
}
}
if(Character.toUpperCase(checkRule.hashChar)
!= Character.toUpperCase(line.array[pos]))
{
return false;
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/gnu/regexp/RETokenBackRef.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/syntax/TokenMarker.java
|
Method name: boolean match(CharIndexed, REMatch)
|
|
Method name: boolean handleRule(ParserRule, boolean)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 2
|
|
1 | for (int i=b; i<e; i++) {↵ | | |
|
2 | if (input.charAt(mymatch.index+i-b) != input.charAt(i)) {↵ | | |
|
| | | 1 | if(Character.toUpperCase(checkRule.hashChar)↵
|
| | | 2 | != Character.toUpperCase(line.array[pos]))↵
|
| | | 3 | {↵
|
3 | return false;↵ | | 4 | return false;↵
|
4 | }↵ | | 5 | ↵
|
5 | } | | 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.3 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |