void testEscape() {
expectLog(
"escape",
"a@b or a@b is avalue@bvalue");
}
public void testAttributeDescription() {
expectLog(
"attribute.description",
"description is hello world");
}
public void testOverrideDefault() {
expectLog(
"override.default",
"value is new");
}
public void testImplicit() {
expectLog(
"implicit", "Before implicitIn implicitAfter implicit");
void testFileSet() {
expectLogContaining("fileset", "types.FileSet");
}
public 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");
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/MacroDefTest.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/types/PolyTest.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | void testEscape() {↵ | | 1 | void testFileSet() {↵
|
2 | expectLog(↵ | | 2 | expectLog↵
|
3 | "escape",↵ | | |
|
4 | "a@b or a@b is avalue@bvalue");↵ | | 3 | Containing("fileset", "types.FileSet");↵
|
5 | }↵ | | 4 | }↵
|
|
6 | public void testAttributeDescription() {↵ | | 5 | public void testFileSetAntType() {↵
|
7 | expectLog(↵ | | 6 | expectLog↵
|
8 | "attribute.description",↵ | | |
|
9 | "description is hello world");↵ | | 7 | Containing("fileset-ant-type", "types.PolyTest$MyFileSet");↵
|
10 | }↵ | | 8 | }↵
|
|
11 | public void testOverrideDefault() {↵ | | 9 | public void testPath() {↵
|
12 | expectLog(↵ | | 10 | expectLog↵
|
13 | "override.default",↵ | | |
|
14 | "value is new");↵ | | 11 | Containing("path", "types.Path");↵
|
15 | }↵ | | 12 | }↵
|
|
16 | public void testImplicit() {↵ | | 13 | public void testPathAntType() {↵
|
17 | expectLog(↵ | | 14 | expectLog↵
|
18 | "implicit", "Before implicitIn implicitAfter implicit");↵ | | 15 | Containing("path-ant-type", "types.PolyTest$MyPath");↵
|
19 | | | 16 |
|
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 |