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");
}
void testIsfalseNot() {
expectPropertySet("isfalse-not","isfalse-not");
}
public void testIsfalseFalse() {
expectPropertySet("isfalse-false","isfalse-false");
}
public void testIsfalseIncomplete1() {
expectSpecificBuildException("isfalse-incomplete",
"Missing attribute",
"Nothing to test for falsehood");
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/filters/TokenFilterTest.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/ConditionTest.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | void testTrimignore() throws IOException {↵ | | 1 | void test↵
|
2 | expectLogContaining("trimignore", "Hello-World");↵ | | |
|
3 | }↵ | | |
|
|
4 | public void testStringTokenizer() throws IOException {↵ | | |
|
5 | expectLogContaining(↵ | | |
|
6 | "stringtokenizer", "#This#is#a#number#of#words#↵ | | 2 | IsfalseNot() {↵
|
| | | 3 | expectPropertySet("isfalse-not","isfalse-not");↵
|
| | | 4 | }↵
|
|
| | | 5 | public void testIsfalseFalse() {↵
|
7 | ");↵ | | 6 | expectPropertySet("isfalse-false","isfalse-false");↵
|
8 | }↵ | | 7 | }↵
|
|
|
9 | public void testUnixLineOutput() throws IOException {↵ | | 8 | public void test↵
|
10 | expectFileContains(↵ | | |
|
11 | "unixlineoutput", "result/unixlineoutput",↵ | | |
|
12 | "\nThis\nis\na\nnumber\nof\nwords\n↵ | | 9 | IsfalseIncomplete1() {↵
|
| | | 10 | expectSpecificBuildException("isfalse-incomplete",↵
|
| | | 11 | "Missing attribute",↵
|
13 | ");↵ | | 12 | "Nothing to test for falsehood");↵
|
14 | } | | 13 | }
|
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 |