void testReply3() { String s = "Re:Subject"; String result = MessageBuilderHelper.createReplySubject(s); assertEquals("Re:Subject", result); } /** * Check if "Fwd:" is only prepended if not already found in string * <p> * Note, the missing space * */ public void testForward3() { String s = "Fwd:Subject"; String result = MessageBuilderHelper.createForwardSubject(s); assertEquals("Fwd:Subject", result); }
void testReply() { String s = "Subject"; String result = MessageBuilderHelper.createReplySubject(s); assertEquals("Re: Subject", result); } /** * Check if "Fwd: " is correctly prepended * */ public void testForward() { String s = "Subject"; String result = MessageBuilderHelper.createForwardSubject(s); assertEquals("Fwd: Subject", result); }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/test/java/org/columba/mail/composer/SubjectTest.java File path: /columba-1.4-src/mail/src/test/java/org/columba/mail/composer/SubjectTest.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
void testReply3() {
1
void testReply() {
2
        String s = "Re:Subject";
2
        String s = "Subject";
3
        String result = MessageBuilderHelper.createReplySubject(s);
3
        String result = MessageBuilderHelper.createReplySubject(s);
4
        assertEquals("Re:Subject", result);
4
        assertEquals("Re: Subject", result);
5
    }
5
    }
6
    /**
6
    /**
7
 * Check if "Fwd:" is only prepended if not already found in string
7
 * Check if "Fwd: " is correctly prepended
8
 * <p>
9
 * Note, the missing space
10
 *
8
 *
11
 */
9
 */
12
    public void testForward3() {
10
    public void testForward() {
13
        String s = "Fwd:Subject";
11
        String s = "Subject";
14
        String result = MessageBuilderHelper.createForwardSubject(s);
12
        String result = MessageBuilderHelper.createForwardSubject(s);
15
        assertEquals("Fwd:Subject", result);
13
        assertEquals("Fwd: Subject", result);
16
    }
14
    }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0