if (isReference()) { return getRef(p).mergePatterns(p); } PatternSet ps = (PatternSet) defaultPatterns.clone(); final int count = additionalPatterns.size(); for (int i = 0; i < count; i++) { Object o = additionalPatterns.elementAt(i); ps.append((PatternSet) o, p); } return ps;
if (isReference()) { return getRef().mergePatterns(p); } PatternSet ps = new PatternSet(); ps.append(defaultPatterns, p); final int count = additionalPatterns.size(); for (int i = 0; i < count; i++) { Object o = additionalPatterns.elementAt(i); ps.append((PatternSet) o, p); } return ps;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/AbstractFileSet.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/resources/Files.java
Method name: PatternSet mergePatterns(Project) Method name: PatternSet mergePatterns(Project)
Number of AST nodes: 8 Number of AST nodes: 9
1
if (isReference()) {
1
if (isReference()) {
2
            return getRef(p).mergePatterns(p);
2
            return getRef().mergePatterns(p);
3
        }
3
        }
4
        PatternSet ps = (PatternSet) 
4
        PatternSet ps = new PatternSet();
5
defaultPatterns.clone();
5
        ps.append(defaultPatterns, p);
6
        final int count = additionalPatterns.size();
6
        final int count = additionalPatterns.size();
7
        for (int i = 0; i < count; i++) {
7
        for (int i = 0; i < count; i++) {
8
            Object o = additionalPatterns.elementAt(i);
8
            Object o = additionalPatterns.elementAt(i);
9
            ps.append((PatternSet) o, p);
9
            ps.append((PatternSet) o, p);
10
        }
10
        }
11
        return ps;
11
        return ps;
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.2
Clones locationClones are in different classes having the same super class
Number of node comparisons32
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements8
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment1
    Time elapsed for statement mapping (ms)1.2
    Clone typeType 3
    Mapped Statements
    ID Statement ID Statement
    1
    if (isReference())
    1
    if (isReference())
    2
    return getRef(p).mergePatterns(p);
    2
    return getRef(p).mergePatterns(p);
    2
    return getRef().mergePatterns(p);
    Differences
    Expression1Expression2Difference
    getRef(p)getRef()ARGUMENT_NUMBER_MISMATCH
    2
    return getRef().mergePatterns(p);
    3
    PatternSet ps = (PatternSet)defaultPatterns.clone();
    3
    PatternSet ps = (PatternSet)defaultPatterns.clone();
    3
    PatternSet ps = new PatternSet();
    Differences
    Expression1Expression2Difference
    (PatternSet)defaultPatterns.clone()new PatternSet()TYPE_COMPATIBLE_REPLACEMENT
    3
    PatternSet ps = new PatternSet();
                                                                    
    4
    ps.append(defaultPatterns, p);
    Preondition Violations
    Unmatched statement ps.append(defaultPatterns,p); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    4
    ps.append(defaultPatterns, p);
    4
    final int count = additionalPatterns.size();
    5
    final int count = additionalPatterns.size();
    5
    for (int i = 0; i < count; i++)
    6
    for (int i = 0; i < count; i++)
    6
    Object o = additionalPatterns.elementAt(i);
    7
    Object o = additionalPatterns.elementAt(i);
    7
    ps.append((PatternSet)o, p);
    8
    ps.append((PatternSet)o, p);
    8
    return ps;
    9
    return ps;
    Precondition Violations (2)
    Row Violation
    1Unmatched statement ps.append(defaultPatterns,p); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    2Clone fragment #1 returns variables , while Clone fragment #2 returns variables ps