public int handleInput(byte[] buffer, int offset, int length) throws IOException { if (newProject != null) { return newProject.demuxInput(buffer, offset, length); } return super.handleInput(buffer, offset, length);
public int handleInput(byte[] buffer, int offset, int length) throws IOException { if (ant != null) { return ant.handleInput(buffer, offset, length); } else { return super.handleInput(buffer, offset, length);
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Ant.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/SubAnt.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public int handleInput(byte[] buffer, int offset, int length)
1
public int handleInput(byte[] buffer, int offset, int length)
2
        throws IOException {
2
        throws IOException {
3
        if (newProject != null) {
3
        if (ant != null) {
4
            return newProject.demuxInput(buffer, offset, length);
4
            return ant.handleInput(buffer, offset, length);
5
        }
5
        }
6
 else {
6
        return super.handleInput(buffer, offset, length);
7
            return super.handleInput(buffer, offset, length);
7
    
8
        
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0