void run() { try { InputStreamReader isr = new InputStreamReader(is); BufferedReader br = new BufferedReader(isr); String line = null; while ((line = br.readLine()) != null) { LOG.info(">" + line); //$NON-NLS-1$ buf.append(line + "\n"); //$NON-NLS-1$ } } catch (IOException ioe) { ioe.printStackTrace(); } } public String getBuffer() { return buf.toString(); }
void run() { try { InputStreamReader isr = new InputStreamReader(is); BufferedReader br = new BufferedReader(isr); String line = null; while ((line = br.readLine()) != null) { LOG.info(">" + line); //$NON-NLS-1$ buf.append(line + "\n"); } } catch (IOException ioe) { ioe.printStackTrace(); } } public String getBuffer() { return buf.toString(); }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/main/java/org/columba/core/base/IPCHelper.java File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/spam/spamassassin/IPCHelper.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
void run() {
1
void run() {
2
	    try {
2
            try {
3
		InputStreamReader isr = new InputStreamReader(is);
3
                InputStreamReader isr = new InputStreamReader(is);
4
		BufferedReader br = new BufferedReader(isr);
4
                BufferedReader br = new BufferedReader(isr);
5
		String line = null;
5
                String line = null;
6
		while ((line = br.readLine()) != null) {
6
                while ((line = br.readLine()) != null) {
7
		    LOG.info(">" + line); //$NON-NLS-1$
7
                    LOG.info(">" + line); //$NON-NLS-1$
8
		    buf.append(line + "\n"); //$NON-NLS-1$
8
                    buf.append(line + "\n");
9
		}
10
	
9
                }
11
    } catch (IOException ioe) {
10
            } catch (IOException ioe) {
12
		ioe.printStackTrace();
11
                ioe.printStackTrace();
13
	    }
14
	}
15
	
12
            }
13
        }
16
public String getBuffer() {
14
        public String getBuffer() {
17
	    return buf.toString();
15
            return buf.toString();
18
	}
16
        }
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