void testSplit3() { String in = "a,bc,,"; // Test ignore trailing split characters String out[] = JOrphanUtils.split(in, ",",true);// Ignore adjacent delimiters assertEquals(2, out.length); assertEquals("a", out[0]); assertEquals("bc", out[1]); out = JOrphanUtils.split(in, ",",false); assertEquals("Should detect the trailing split chars; ", 4, out.length); assertEquals("a", out[0]); assertEquals("bc", out[1]); assertEquals("", out[2]); assertEquals("", out[3]); } public void testSplit4() { String in = " , ,a ,bc"; // Test leading split characters String out[] = JOrphanUtils.split(in, " ,",true); assertEquals(2, out.length); assertEquals("a", out[0]); assertEquals("bc", out[1]); out = JOrphanUtils.split(in, " ,",false); assertEquals("Should detect the leading split chars; ", 4, out.length); assertEquals("", out[0]); assertEquals("", out[1]); assertEquals("a", out[2]); assertEquals("bc", out[3]); }
void testSplit1() { String in = "a,bc,,"; // Test ignore trailing split characters String out[] = JOrphanUtils.split(in, ",",true);// Ignore adjacent delimiters assertEquals(2, out.length); assertEquals("a", out[0]); assertEquals("bc", out[1]); out = JOrphanUtils.split(in, ",",false); assertEquals("Should detect the trailing split chars; ", 4, out.length); assertEquals("a", out[0]); assertEquals("bc", out[1]); assertEquals("", out[2]); assertEquals("", out[3]); } public void testSplit2() { String in = ",,a,bc"; // Test leading split characters String out[] = JOrphanUtils.split(in, ",",true); assertEquals(2, out.length); assertEquals("a", out[0]); assertEquals("bc", out[1]); out = JOrphanUtils.split(in, ",",false); assertEquals("Should detect the leading split chars; ", 4, out.length); assertEquals("", out[0]); assertEquals("", out[1]); assertEquals("a", out[2]); assertEquals("bc", out[3]); }
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/test/src/org/apache/jorphan/util/TestJorphanUtils.java File path: /jakarta-jmeter-2.3.2/test/src/org/apache/jorphan/util/TestJorphanUtils.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
void testSplit3() {
1
void testSplit1() {
2
        String in = "a,bc,,"; // Test ignore trailing split characters
2
        String in = "a,bc,,"; // Test ignore trailing split characters
3
        String out[] = JOrphanUtils.split(in, ",",true);// Ignore adjacent delimiters
3
        String out[] = JOrphanUtils.split(in, ",",true);// Ignore adjacent delimiters
4
        assertEquals(2, out.length);
4
        assertEquals(2, out.length);
5
        assertEquals("a", out[0]);
5
        assertEquals("a", out[0]);
6
        assertEquals("bc", out[1]);
6
        assertEquals("bc", out[1]);
7
        out = JOrphanUtils.split(in, ",",false);
7
        out = JOrphanUtils.split(in, ",",false);
8
        assertEquals("Should detect the trailing split chars; ", 4, out.length);
8
        assertEquals("Should detect the trailing split chars; ", 4, out.length);
9
        assertEquals("a", out[0]);
9
        assertEquals("a", out[0]);
10
        assertEquals("bc", out[1]);
10
        assertEquals("bc", out[1]);
11
        assertEquals("", out[2]);
11
        assertEquals("", out[2]);
12
        assertEquals("", out[3]);
12
        assertEquals("", out[3]);
13
    }
13
    }
14
    public void testSplit4() {
14
    public void testSplit2() {
15
        String in = " , ,a ,bc"; // Test leading split characters
15
        String in = ",,a,bc"; // Test leading split characters
16
        String out[] = JOrphanUtils.split(in, " ,",true);
16
        String out[] = JOrphanUtils.split(in, ",",true);
17
        assertEquals(2, out.length);
17
        assertEquals(2, out.length);
18
        assertEquals("a", out[0]);
18
        assertEquals("a", out[0]);
19
        assertEquals("bc", out[1]);
19
        assertEquals("bc", out[1]);
20
        out = JOrphanUtils.split(in, " ,",false);
20
        out = JOrphanUtils.split(in, ",",false);
21
        assertEquals("Should detect the leading split chars; ", 4, out.length);
21
        assertEquals("Should detect the leading split chars; ", 4, out.length);
22
        assertEquals("", out[0]);
22
        assertEquals("", out[0]);
23
        assertEquals("", out[1]);
23
        assertEquals("", out[1]);
24
        assertEquals("a", out[2]);
24
        assertEquals("a", out[2]);
25
        assertEquals("bc", out[3]);
25
        assertEquals("bc", out[3]);
26
    }
26
    }
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