StringBuffer checksumSb = new StringBuffer(); for (int i = 0; i < fileDigest.length; i++) { String hexStr = Integer.toHexString(0x00ff & fileDigest[i]); if (hexStr.length() < 2) { checksumSb.append("0"); } checksumSb.append(hexStr); } return checksumSb.toString();
DirectoryScanner ds = getDirectoryScanner(getProject()); String[] dirs = ds.getIncludedDirectories(); StringBuffer sb = new StringBuffer(); for (int i = 0; i < dirs.length; i++) { if (i > 0) { sb.append(';'); } sb.append(dirs[i]); } return sb.toString();
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Checksum.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/DirSet.java
Method name: String createDigestString(byte[]) Method name: String toString()
Number of AST nodes: 7 Number of AST nodes: 8
1
StringBuffer checksumSb = new StringBuffer();
1
DirectoryScanner ds = getDirectoryScanner(getProject());
2
        for (int i = 0; i < fileDigest.length; i++) {
2
        String[] dirs = ds.getIncludedDirectories();
3
            String hexStr = Integer.toHexString(0x00ff & fileDigest[i]);
3
        StringBuffer sb = new StringBuffer();
4
            if (hexStr.length() &l
4
        for (int i = 0; i < dirs.length; i++) {
5
t; 2) {
5
            if (i &gt; 0) {
6
                checksumSb.append("0");
6
                sb.append(';');
7
            }
7
            }
8
            checksumSb.append(hexStr);
8
            sb.append(dirs[i]);
9
        }
9
        }
10
        return checksumSb.toString();
10
        return sb.toString();
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.1
Clones locationClones are in different classes having the same super class
Number of node comparisons1