void testsubstitiuteEmail3() { String input = "test09_+@mail.com"; assertEquals(("<A HREF=\"mailto:" + input +"\">"+ input + "</A>").toLowerCase(), HtmlParser.substituteEmailAddress(input) ); } public void testsubstitiuteEmail4() { String input = "test09_+@mail.af.two.three.four.five.com"; assertEquals(("<A HREF=\"mailto:" + input +"\">"+ input + "</A>").toLowerCase(), HtmlParser.substituteEmailAddress(input) );
void testsubstitiuteEmail1() { String input = "test@mail.com"; assertEquals(("<A HREF=\"mailto:" + input +"\">"+ input + "</A>").toLowerCase(), HtmlParser.substituteEmailAddress(input) ); } public void testsubstitiuteEmail2() { String input = "te+st09@mail.com"; assertEquals(("<A HREF=\"mailto:" + input +"\">"+ input + "</A>").toLowerCase(), HtmlParser.substituteEmailAddress(input) );
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/test/java/org/columba/mail/parser/text/HtmlParserTest.java File path: /columba-1.4-src/mail/src/test/java/org/columba/mail/parser/text/HtmlParserTest.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
void testsubstitiuteEmail3() {
1
void testsubstitiuteEmail1() {
2
    	String input = "test09_+@mail.com";
2
    	String input = "test@mail.com";
3
    	
3
    	
4
    	assertEquals(("<A HREF=\"mailto:" + input +"\">"+ input + "</A>").toLowerCase(), HtmlParser.substituteEmailAddress(input) );
4
    	assertEquals(("<A HREF=\"mailto:" + input +"\">"+ input + "</A>").toLowerCase(), HtmlParser.substituteEmailAddress(input) );
5
    }
5
    }
6
    public void testsubstitiuteEmail4() {
6
    public void testsubstitiuteEmail2() {
7
    	String input = "test09_+@mail.af.two.three.four.five.com";
7
    	String input = "te+st09@mail.com";
8
    	
8
    	
9
    	assertEquals(("<A HREF=\"mailto:" + input +"\">"+ input + "</A>").toLowerCase(), HtmlParser.substituteEmailAddress(input) );
9
    	assertEquals(("<A HREF=\"mailto:" + input +"\">"+ input + "</A>").toLowerCase(), HtmlParser.substituteEmailAddress(input) );
10
    
10
    
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