void testFileSetAntType() {
expectLogContaining("fileset-ant-type", "types.PolyTest$MyFileSet");
}
public void testPath() {
expectLogContaining("path", "types.Path");
}
public void testPathAntType() {
expectLogContaining("path-ant-type", "types.PolyTest$MyPath");
void testRecreateZipfilesetWithoutUpdateAdditionalFiles() {
testRecreate("test4",
"testRecreateZipfilesetWithoutUpdateAdditionalFiles");
}
public void testRecreateZipfilesetWithUpdateAdditionalFiles() {
testRecreate("test4",
"testRecreateZipfilesetWithUpdateAdditionalFiles");
}
public void testRecreateZipfilesetWithoutUpdateNewerFile() {
testRecreate("testRecreateNewerFileSetup",
"testRecreateZipfilesetWithoutUpdateNewerFile");
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/types/PolyTest.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/JarTest.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | void testFileSetAntType() {↵ | | 1 | void testRecreateZipfileset↵
|
2 | expectLogContaining("fileset-ant-type", "types.PolyTest$My↵ | | 2 | WithoutUpdateAdditionalFiles() {↵
|
| | | 3 | testRecreate("test4",↵
|
3 | FileSet");↵ | | 4 | "testRecreateZipfilesetWithoutUpdateAdditionalFiles");↵
|
4 | }↵ | | 5 | }↵
|
|
5 | public void testPath() {↵ | | 6 | public void test↵
|
6 | expectLogContaining("path", "types.Path");↵ | | |
|
7 | }↵ | | |
|
|
8 | public void testPathAntType() {↵ | | |
|
9 | expectLogContaining("path-ant-type", "types.PolyTest$MyPath↵ | | 7 | RecreateZipfilesetWithUpdateAdditionalFiles() {↵
|
| | | 8 | testRecreate("test4",↵
|
| | | 9 | "testRecreateZipfilesetWithUpdateAdditionalFiles");↵
|
| | | 10 | }↵
|
|
| | | 11 | public void testRecreateZipfilesetWithoutUpdateNewerFile() {↵
|
| | | 12 | testRecreate("testRecreateNewerFileSetup",↵
|
10 | ");↵ | | 13 | "testRecreateZipfilesetWithoutUpdateNewerFile");↵
|
11 | | | 14 |
|
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 |