filter.setUp(criteria);
// execute filter
boolean result = filter.process(getSourceFolder(), uid);
assertEquals("filter result", true, result);
filter.setUp(criteria);
// execute filter
boolean result = filter.process(getSourceFolder(), uid);
assertEquals("filter result", true, result);
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/test/java/org/columba/mail/filter/plugins/PriorityFilterTest.java
|
|
File path: /columba-1.4-src/mail/src/test/java/org/columba/mail/filter/plugins/PriorityFilterTest.java
|
Method name: void testNormal()
|
|
Method name: void testLowest()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | filter.setUp(criteria);↵ | | 1 | filter.setUp(criteria);↵
|
|
2 | // execute filter↵ | | 2 | // execute filter↵
|
3 | boolean result = filter.process(getSourceFolder(), uid);↵ | | 3 | boolean result = filter.process(getSourceFolder(), uid);↵
|
4 | assertEquals("filter result", true, result); | | 4 | assertEquals("filter result", true, result);
|
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 |
5 | filter.setUp(criteria); | | 5 | filter.setUp(criteria); |
6 | boolean result = filter.process(getSourceFolder(), uid); | | 6 | boolean result = filter.process(getSourceFolder(), uid); |
7 | assertEquals("filter result", true, result); | | 7 | assertEquals("filter result", true, result); |
Precondition Violations (0)
Row |
Violation |