for (int i = 0; i < read; ++i, ++index) {
if (buffer1[i] != buffer2[i]) {
System.out.println("Bytes mismatch:" + name1 + ", " + name2 +
" at byte " + index);
return false;
for (int i = 0; i < read; ++i, ++index) {
if (buffer1[i] != buffer2[i]) {
System.out.println("Bytes mismatch:" + name1 + ", " + name2 +
" at byte " + index);
return false;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/optional/i18n/TranslateTest.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/types/FilterSetTest.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for (int i = 0; i < read; ++i, ++index) {↵ | | 1 | for (int i = 0; i < read; ++i, ++index) {↵
|
2 | if (buffer1[i] != buffer2[i]) {↵ | | 2 | if (buffer1[i] != buffer2[i]) {↵
|
3 | System.out.println("Bytes mismatch:" + name1 + ", " + name2 +↵ | | 3 | System.out.println("Bytes mismatch:" + name1 + ", " + name2 +↵
|
4 | " at byte " + index);↵ | | 4 | " at byte " + index);↵
|
5 | return false;↵ | | 5 | return false;↵
|
6 | | | 6 |
|
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 |