void testOrboth() {
expectPropertySet("orboth","orboth");
}
public void testFilesmatchIdentical() {
expectPropertySet("filesmatch-identical","filesmatch-identical");
}
public void testFilesmatchIncomplete() {
expectSpecificBuildException("filesmatch-incomplete",
"Missing file2 attribute",
"both file1 and file2 are required in filesmatch");
void testExcepting() {
expectLogContaining("testExcepting",
"Exception raised inside called program");
}
public void testExceptingFork() {
expectLogContaining("testExceptingFork",
"Java Result:");
}
public void testExceptingFoe() {
expectBuildExceptionContaining("testExceptingFoe",
"passes exception through",
"Exception raised inside called program");
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/ConditionTest.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/JavaTest.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | void testOrboth() {↵ | | 1 | void testExcepting() {↵
|
2 | expectPropertySet("orboth","orboth↵ | | 2 | expectLogContaining("testExcepting",↵
|
3 | ");↵ | | 3 | "Exception raised inside called program");↵
|
4 | }↵ | | 4 | }↵
|
|
5 | public void testFilesmatchIdentical() {↵ | | 5 | public void test↵
|
6 | expectPropertySet("filesmatch-identical","filesmatch-identical↵ | | 6 | ExceptingFork() {↵
|
| | | 7 | expectLogContaining("testExceptingFork",↵
|
7 | ");↵ | | 8 | "Java Result:");↵
|
8 | }↵ | | 9 | }↵
|
|
|
9 | public void testFilesmatchIncomplete() {↵ | | 10 | public void testExceptingFoe() {↵
|
10 | expectSpecificBuildException("filesmatch-incomplete",↵ | | 11 | expectBuildException↵
|
11 | "Missing file2 attribute",↵ | | |
|
12 | "both file1 and file2 are required in filesmatch↵ | | 12 | Containing("testExceptingFoe",↵
|
| | | 13 | "passes exception through",↵
|
13 | ");↵ | | 14 | "Exception raised inside called program");↵
|
14 | | | 15 |
|
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 |