void testTextElement() {
expectLogContaining(
"textelement", "Hello world");
}
public void testTextTrim() {
expectLogContaining(
"text.trim", "[Hello world]");
}
public void testDuplicateTextName() {
expectBuildException(
"duplicatetextname",
"the name \"text\" is already used as an attribute");
}
void testDuplicateTextName() {
expectBuildException(
"duplicatetextname",
"the name \"text\" is already used as an attribute");
}
public void testDuplicateTextName2() {
expectBuildException(
"duplicatetextname2",
"the attribute name \"text\" has already been used by the text element");
}
public void testEscape() {
expectLog(
"escape",
"a@b or a@b is avalue@bvalue");
}
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/taskdefs/MacroDefTest.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | void testTextElement() {↵ | | 1 | void testDuplicateTextName() {↵
|
2 | expectLogContaining(↵ | | 2 | expectBuildException(↵
|
3 | "textelement", "Hello world");↵ | | 3 | "↵
|
| | | 4 | duplicatetextname",↵
|
4 | }↵ | | 5 | ↵
|
|
5 | public void testTextTrim() {↵ | | 6 | ↵
|
6 | expectLogContaining(↵ | | |
|
7 | "text.trim", "[Hello world]");↵ | | 7 | "the name \"text\" is already used as an attribute");↵
|
8 | }↵ | | 8 | }↵
|
|
9 | public void testDuplicateTextName() {↵ | | 9 | public void testDuplicateTextName2() {↵
|
10 | expectBuildException(↵ | | 10 | expectBuildException(↵
|
11 | "duplicatetextname",↵ | | 11 | "duplicatetextname2",↵
|
12 | "the name \"text\" is already used as an attribut↵ | | 12 | "the attribute name \"text\" has already been used by the text element");↵
|
| | | 13 | }↵
|
| | | 14 | public void testEscape() {↵
|
| | | 15 | expectLog(↵
|
| | | 16 | "escape",↵
|
13 | e");↵ | | 17 | "a@b or a@b is avalue@bvalue");↵
|
14 | } | | 18 | }
|
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 |