assertEquals("no link", expect.length, b.length);
for (int i=0; i<expect.length; i++) {
assertEquals("no link, byte "+i, expect[i], b[i]);
}
assertEquals("no link", expect.length, b.length);
for (int i=0; i<expect.length; i++) {
assertEquals("no link, byte "+i, expect[i], b[i]);
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/zip/AsiExtraFieldTest.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/zip/AsiExtraFieldTest.java
|
Method name: void testContent()
|
|
Method name: void testContent()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | assertEquals("no link", expect.length, b.length);↵ | | 1 | assertEquals("no link", expect.length, b.length);↵
|
2 | for (int i=0; i<expect.length; i++) {↵ | | 2 | for (int i=0; i<expect.length; i++) {↵
|
3 | assertEquals("no link, byte "+i, expect[i], b[i]);↵ | | 3 | assertEquals("no link, byte "+i, expect[i], b[i]);↵
|
4 | } | | 4 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 5 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.7 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
7 | assertEquals("no link", expect.length, b.length); | | 13 | assertEquals("no link", expect.length, b.length); |
8 | for (int i = 0; i < expect.length; i++) | | 14 | for (int i = 0; i < expect.length; i++) |
9 | assertEquals("no link, byte " + i, expect[i], b[i]); | | 15 | assertEquals("no link, byte " + i, expect[i], b[i]); |
Precondition Violations (0)
Row |
Violation |