fs.setBeginToken("@");
fs.setEndToken("@");
assertEquals(result, fs.replaceTokens(line));
fs.setBeginToken("@");
fs.setEndToken("@");
assertEquals(result, fs.replaceTokens(line));
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: 3
|
|
Number of AST nodes: 3
|
|
1 | fs.setBeginToken("@");↵ | | 1 | fs.setBeginToken("@");↵
|
2 | fs.setEndToken("@");↵ | | 2 | fs.setEndToken("@");↵
|
3 | assertEquals(result, fs.replaceTokens(line)); | | 3 | assertEquals(result, fs.replaceTokens(line));
|
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 | 9 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
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 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
7 | fs.setBeginToken("@"); | | 8 | fs.setBeginToken("@"); |
8 | fs.setEndToken("@"); | | 9 | fs.setEndToken("@"); |
9 | assertEquals(result, fs.replaceTokens(line)); | | 10 | assertEquals(result, fs.replaceTokens(line)); |
Precondition Violations (0)
Row |
Violation |