boolean res = m.find(); if (res) { m.appendReplacement(sb, argument); m.appendTail(sb); } else { sb.append(input); }
if (isWarning) { task.handleErrorOutput(output); } else { task.handleOutput(output); }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/regexp/Jdk14RegexpRegexp.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/Project.java
Method name: String substitute(String, String, int) Method name: void demuxOutput(String, boolean)
Number of AST nodes: 5 Number of AST nodes: 3
1
boolean res = m.find();
2
            if (res) {
3
                m.appendReplacement(sb, argument);
4
                m.appendTail(sb
1
if (isWarning) {
5
);
2
                task.handleErrorOutput(output);
6
            } else {
3
            } else {
7
                sb.append(input);
4
                task.handleOutput(output);
8
            }
5
            }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.1
Clones locationClones are in different classes
Number of node comparisons13
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements1
    Number of unmapped statements in the first code fragment4
    Number of unmapped statements in the second code fragment2
    Time elapsed for statement mapping (ms)1.0
    Clone typeType 3
    Mapped Statements
    ID Statement ID Statement
    23
    boolean res = m.find();
                                                      
    24
    if (res)
    24
    if (res)
    4
    if (isWarning)
    Differences
    Expression1Expression2Difference
    resisWarningVARIABLE_NAME_MISMATCH
    4
    if (isWarning)
                                                                        
    5
    task.handleErrorOutput(output);
    25
    m.appendReplacement(sb, argument);
                                                                              
    26
    m.appendTail(sb);
                                              
    else
            
                                                              
    6
    task.handleOutput(output);
    27
    sb.append(input);
                                              
    Precondition Violations (0)
    Row Violation