File path: /jruby-1.4.0/src/org/jruby/RubyRegexp.java | File path: /jruby-1.4.0/src/org/jruby/RubyRegexp.java | |||
Method name: RubyString regsub19(RubyString, RubyString, Matcher, Regex)
|
Method name: RubyString regsub(RubyString, RubyString, Matcher, Encoding)
|
|||
Number of AST nodes: 5 | Number of AST nodes: 5 | |||
1 | no = regs.numRegs - 1;↵ | 1 | no = regs.numRegs - 1;↵ | |
2 | while (regs.beg[no] == -1 && no > 0) no--;↵ | 2 | while (regs.beg[no] == -1 && no > 0) no--;↵ | |
3 | if (no == 0) continue; | 3 |
| |
See real code fragment | See real code fragment |
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.5 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 19 |
Number of mapped statements | 5 |
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) | 1.3 |
Clone type | Type 1 |
ID | Statement | ID | Statement | |||||||
---|---|---|---|---|---|---|---|---|---|---|
97 | no = regs.numRegs - 1; | 51 | no = regs.numRegs - 1; | |||||||
98 | while (regs.beg[no] == -1 && no > 0) | 52 | while (regs.beg[no] == -1 && no > 0) | |||||||
99 | no--; | 53 | no--; | |||||||
100 | if (no == 0) | 54 | if (no == 0) | |||||||
101 | continue; |
| 55 | continue; |
Row | Violation |
---|---|
1 | Statement continue; without innermost loop |
2 | Statement continue; without innermost loop |