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);
protected int handleInput(byte[] buffer, int offset, int length)
throws IOException {
if (runner != null) {
return runner.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/SubAnt.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/junit/JUnitTask.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 | protected int handleInput(byte[] buffer, int offset, int length)↵
|
2 | throws IOException {↵ | | 2 | throws IOException {↵
|
3 | if (ant != null) {↵ | | 3 | if (runner != null) {↵
|
4 | return ant.handleInput(buffer, offset, length);↵ | | 4 | return runner.handleInput(buffer, offset, length);↵
|
5 | } else {↵ | | 5 | } else {↵
|
6 | return super.handleInput(buffer, offset, length);↵ | | 6 | return super.handleInput(buffer, offset, length);↵
|
7 | | | 7 |
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |