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");
void testTrimignore() throws IOException {
expectLogContaining("trimignore", "Hello-World");
}
public void testStringTokenizer() throws IOException {
expectLogContaining(
"stringtokenizer", "#This#is#a#number#of#words#");
}
public void testUnixLineOutput() throws IOException {
expectFileContains(
"unixlineoutput", "result/unixlineoutput",
"\nThis\nis\na\nnumber\nof\nwords\n");
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/JavaTest.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/filters/TokenFilterTest.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | void testExcepting() {↵ | | 1 | void testTrimignore() throws IOException {↵
|
2 | expectLogContaining("testExcepting",↵ | | 2 | expectLogContaining("t↵
|
3 | "Exception raised inside called program");↵ | | 3 | rimignore", "Hello-World");↵
|
4 | }↵ | | 4 | }↵
|
|
5 | public void testExceptingFork() {↵ | | 5 | public void test↵
|
6 | expectLogContaining("testExceptingFork",↵ | | |
|
7 | "Java Result:↵ | | 6 | StringTokenizer() throws IOException {↵
|
| | | 7 | expectLogContaining(↵
|
8 | ");↵ | | 8 | "stringtokenizer", "#This#is#a#number#of#words#");↵
|
9 | }↵ | | 9 | }↵
|
|
10 | public void testExceptingFoe() {↵ | | 10 | public void testUnixLineOutput() throws IOException {↵
|
11 | expectBuildExceptionContaining("testExceptingFoe",↵ | | 11 | expect↵
|
12 | "passes exception through",↵ | | |
|
13 | "Exception raised inside called program↵ | | 12 | FileContains(↵
|
| | | 13 | "unixlineoutput", "result/unixlineoutput",↵
|
14 | ");↵ | | 14 | "\nThis\nis\na\nnumber\nof\nwords\n");↵
|
15 | | | 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 |