public void testEOFMulti1() throws Exception { InputStream master = new ByteArrayInputStream(test); CloneStreamMaster model = new CloneStreamMaster(master); CloneInputStream clone1 = model.getClone(); byte[] buffer = new byte[50]; int lastRead = clone1.read(buffer); int pos = lastRead; while (lastRead != -1) { lastRead = clone1.read(buffer); pos += lastRead; } assertTrue(pos == 19999);
public void testEOFMulti2() throws Exception { InputStream master = new ByteArrayInputStream(test); CloneStreamMaster model = new CloneStreamMaster(master); CloneInputStream clone1 = model.getClone(); byte[] buffer = new byte[30]; int lastRead = clone1.read(buffer); int pos = lastRead; while (lastRead == 30) { lastRead = clone1.read(buffer); pos += lastRead; } assertTrue(pos == 20000);
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/test/java/org/columba/core/io/CloneInputStreamTest.java File path: /columba-1.4-src/core/src/test/java/org/columba/core/io/CloneInputStreamTest.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public void testEOFMulti1() throws Exception {
1
public void testEOFMulti2() throws Exception {
2
        InputStream master = new ByteArrayInputStream(test);
2
        InputStream master = new ByteArrayInputStream(test);
3
        CloneStreamMaster model = new CloneStreamMaster(master);
3
        CloneStreamMaster model = new CloneStreamMaster(master);
4
        CloneInputStream clone1 = model.getClone();
4
        CloneInputStream clone1 = model.getClone();
5
        byte[] buffer = new byte[50];
5
        byte[] buffer = new byte[30];
6
        int lastRead = clone1.read(buffer);
6
        int lastRead = clone1.read(buffer);
7
        int pos = lastRead;
7
        int pos = lastRead;
8
        while (lastRead != -1) {
8
        while (lastRead == 30) {
9
            lastRead = clone1.read(buffer);
9
            lastRead = clone1.read(buffer);
10
            pos += lastRead;
10
            pos += lastRead;
11
        }
11
        }
12
        assertTrue(pos == 19999);
12
        assertTrue(pos == 20000);
13
    
13
    
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