if (sub >= start.length) return -1;
int x = start[sub];
return (x == -1) ? x : offset + x;
if (sub >= start.length) return -1;
int x = start[sub];
return (x == -1) ? x : offset + x;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/gnu/regexp/REMatch.java
|
|
File path: /jEdit-4.2/src/gnu/regexp/REMatch.java
|
Method name: int getStartIndex(int)
|
|
Method name: int getSubStartIndex(int)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | if (sub >= start.length) return -1;↵ | | 1 | if (sub >= start.length) return -1;↵
|
2 | int x = start[sub];↵ | | 2 | int x = start[sub];↵
|
3 | return (x == -1) ? x : offset + x; | | 3 | return (x == -1) ? x : offset + x;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 8 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 4 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.9 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | if (sub >= start.length) | | 1 | if (sub >= start.length) |
2 | | | 2 | |
3 | int x = start[sub]; | | 3 | int x = start[sub]; |
4 | return (x == -1) ? x : offset + x; | | 4 | return (x == -1) ? x : offset + x; |
Precondition Violations (0)
Row |
Violation |