158-153-214

for (int i = 0; i < thread.length && thread[i] != null; i++) { try { managingTask.log(thread[i].toString(), Project.MSG_DEBUG); } catch (NullPointerException enPeaEx) { // Ignore exception } }
if (null != usersFile) { try { userList.load(new FileInputStream(usersFile)); } catch (final IOException ioe) { throw new BuildException(ioe.toString(), ioe); } }

Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Redirector.java |  | File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/cvslib/ChangeLogTask.java
Method name: `void complete()` |  | Method name: `void loadUserlist(Properties)`
Number of AST nodes: 3 |  | Number of AST nodes: 3

1

    for (int i = 0; i < thread.length && thread[i] != null; i++) {↵

1

    if (null != usersFile) {↵

2

                        try {↵

2

                try {↵

3

                            managingTask.log(thread[i].toString(), Project.MSG_DEBUG);↵

3

                    ↵

4

          ↵

4

    userList.load(new FileInputStream(usersFile));↵

5

                  } catch (NullPointerException enPeaEx) {↵

5

                } catch (↵

6

                            // Ignore exception↵

7

            ↵

6

    final IOException ioe) {↵

7

                    throw new BuildException(ioe.toString(), ioe);↵

8

                }↵

8

                }↵

9

                    }

9

            }

See real code fragment |  | See real code fragment

Summary
Number of common nesting structure subtrees | 0
Number of refactorable cases | 0
Number of non-refactorable cases | 0
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0
Clones location | Clones are in different classes
Number of node comparisons | 1