if (no >= 0) { if (no >= regs.numRegs || regs.beg[no] == -1) continue; val.cat(srcbs.bytes, srcbs.begin + regs.beg[no], regs.end[no] - regs.beg[no], srcEnc); }
if (no >= 0) { if (no >= regs.numRegs || regs.beg[no] == -1) continue; val.append(srcbs.bytes, srcbs.begin + regs.beg[no], regs.end[no] - regs.beg[no]); }
Clone fragments detected by clone detection tool
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: 4 Number of AST nodes: 4
1
if (no >= 0) {
1
if (no >= 0) {
2
                    if (no >= regs.numRegs || regs.beg[no] == -1) continue;
2
                    if (no >= regs.numRegs || regs.beg[no] == -1) continue;
3
                    val.cat(srcbs.bytes, srcbs.begin + regs.beg[no], regs.end[no] - regs.beg[no], srcEnc);
3
                    val.append(srcbs.bytes, srcbs.begin + regs.beg[no], regs.end[no] - regs.beg[no]);
4
                }
4
                }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)0.4
Clones locationClones are declared in the same class
Number of node comparisons11
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements3
    Number of unmapped statements in the first code fragment1
    Number of unmapped statements in the second code fragment1
    Time elapsed for statement mapping (ms)1.2
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    110
    if (no >= 0)
    64
    if (no >= 0)
    111
    if (no >= regs.numRegs || regs.beg[no] == -1)
    65
    if (no >= regs.numRegs || regs.beg[no] == -1)
    112
    continue;
    112
    continue;
    66
    continue;
    Preondition Violations
    Statement continue; without innermost loop
    Statement continue; without innermost loop
    66
    continue;
                                                                                                                                                                          
    67
    val.append(srcbs.bytes, srcbs.begin + regs.beg[no], regs.end[no] - regs.beg[no]);
    Preondition Violations
    Unmatched statement val.append(srcbs.bytes,srcbs.begin + regs.beg[no],regs.end[no] - regs.beg[no]); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted
    67
    val.append(srcbs.bytes, srcbs.begin + regs.beg[no], regs.end[no] - regs.beg[no]);
    113
    val.cat(srcbs.bytes, srcbs.begin + regs.beg[no], regs.end[no] - regs.beg[no], srcEnc);
    113
    val.cat(srcbs.bytes, srcbs.begin + regs.beg[no], regs.end[no] - regs.beg[no], srcEnc);
    Preondition Violations
    Unmatched statement val.cat(srcbs.bytes,srcbs.begin + regs.beg[no],regs.end[no] - regs.beg[no],srcEnc); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted
                                                                                                                                                                                    
    Precondition Violations (4)
    Row Violation
    1Statement continue; without innermost loop
    2Statement continue; without innermost loop
    3Unmatched statement val.append(srcbs.bytes,srcbs.begin + regs.beg[no],regs.end[no] - regs.beg[no]); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted
    4Unmatched statement val.cat(srcbs.bytes,srcbs.begin + regs.beg[no],regs.end[no] - regs.beg[no],srcEnc); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted