int ch = -1; if (pushed != -2) { ch = pushed; pushed = -2; } else { ch = in.read(); } if (ch == -1) { return null; }
int ch = -1; if (pushed != -2) { ch = pushed; pushed = -2; } else { ch = in.read(); } if (ch == -1) { return null; }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/LineTokenizer.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/StringTokenizer.java
Method name: String getToken(Reader) Method name: String getToken(Reader)
Number of AST nodes: 7 Number of AST nodes: 7
1
int ch = -1;
1
int ch = -1;
2
        if (pushed != -2) {
2
        if (pushed != -2) {
3
            ch = pushed;
3
            ch = pushed;
4
            pushed = -2;
4
            pushed = -2;
5
        } else {
5
        } else {
6
            ch = in.read();
6
            ch = in.read();
7
        }
7
        }
8
        if (ch == -1) {
8
        if (ch == -1) {
9
            return null;
9
            return null;
10
        }
10
        }
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.3
Clones locationClones are in different classes having the same super class
Number of node comparisons30
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements7
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)1.7
    Clone typeType 1
    Mapped Statements
    ID Statement ID Statement
    1
    int ch = -1;
    1
    int ch = -1;
    2
    if (pushed != -2)
    2
    if (pushed != -2)
    3
    ch = pushed;
    3
    ch = pushed;
    4
    pushed = -2;
    4
    pushed = -2;
    else
    else
    5
    ch = in.read();
    5
    ch = in.read();
    6
    if (ch == -1)
    6
    if (ch == -1)
    7
    return null;
    7
    return null;
    Precondition Violations (0)
    Row Violation