if (beg >= len) raiseIndexOutOfString(beg);
if (beg < 0) {
if (-beg > len) raiseIndexOutOfString(beg);
beg += len;
}
return beg;
if (beg > len) raiseIndexOutOfString(beg);
if (beg < 0) {
if (-beg > len) raiseIndexOutOfString(beg);
beg += len;
}
return beg;
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/RubyString.java
|
|
File path: /jruby-1.4.0/src/org/jruby/RubyString.java
|
Method name: int checkIndexForRef(int, int)
|
|
Method name: int checkIndex(int, int)
|
Number of AST nodes: 7
|
|
Number of AST nodes: 7
|
|
1 | if (beg >= len) raiseIndexOutOfString(beg);↵ | | 1 | if (beg > len) raiseIndexOutOfString(beg);↵
|
2 | if (beg < 0) {↵ | | 2 | if (beg < 0) {↵
|
3 | if (-beg > len) raiseIndexOutOfString(beg);↵ | | 3 | if (-beg > len) raiseIndexOutOfString(beg);↵
|
4 | beg += len;↵ | | 4 | beg += len;↵
|
5 | }↵ | | 5 | }↵
|
6 | return beg; | | 6 | return beg;
|
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.4 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 9 |
-
{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 |
3 | if (beg < 0) | | 3 | if (beg < 0) |
4 | | | 4 | |
5 | raiseIndexOutOfString(beg); | | 5 | raiseIndexOutOfString(beg); |
6 | | | 6 | |
Precondition Violations (0)
Row |
Violation |