FilterSet fs = new FilterSet();
fs.addFilter("test", "@test1@");
fs.addFilter("test1","@test2@");
fs.addFilter("test2", "it works");
FilterSet fs = new FilterSet();
fs.addFilter("test", "@test1@");
fs.addFilter("test1","@test2@");
fs.addFilter("test2", "@test@");
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/types/FilterSetTest.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/types/FilterSetTest.java
|
Method name: void testRecursive()
|
|
Method name: void testInfinite()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | FilterSet fs = new FilterSet();↵ | | 1 | FilterSet fs = new FilterSet();↵
|
2 | fs.addFilter("test", "@test1@");↵ | | 2 | fs.addFilter("test", "@test1@");↵
|
3 | fs.addFilter("test1","@test2@");↵ | | 3 | fs.addFilter("test1","@test2@");↵
|
4 | fs.addFilter("test2", "it works"); | | 4 | fs.addFilter("test2", "@test@");
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 16 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 4 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
3 | FilterSet fs = new FilterSet(); | | 3 | FilterSet fs = new FilterSet(); |
4 | fs.addFilter("test", "@test1@"); | | 4 | fs.addFilter("test", "@test1@"); |
5 | fs.addFilter("test1", "@test2@"); | | 5 | fs.addFilter("test1", "@test2@"); |
6 | fs.addFilter("test2", "it works"); | | 6 | fs.addFilter("test2", "@test@"); |
Precondition Violations (0)
Row |
Violation |