private void initialize() { Parameter[] params = getParameters(); if (params != null) { for (int i = 0; i < params.length; i++) { if (LINES_KEY.equals(params[i].getName())) { lines = new Long(params[i].getValue()).longValue(); continue; } if (SKIP_KEY.equals(params[i].getName())) { skip = new Long(params[i].getValue()).longValue(); continue;
private void initialize() { Parameter[] params = getParameters(); if (params != null) { for (int i = 0; i < params.length; i++) { if (LINES_KEY.equals(params[i].getName())) { setLines(new Long(params[i].getValue()).longValue()); continue; } if (SKIP_KEY.equals(params[i].getName())) { skip = new Long(params[i].getValue()).longValue(); continue;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/HeadFilter.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/TailFilter.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
private void initialize() {
1
private void initialize() {
2
        Parameter[] params = getParameters();
2
        Parameter[] params = getParameters();
3
        if (params != null) {
3
        if (params != null) {
4
            for (int i = 0; i < params.length; i++) {
4
            for (int i = 0; i < params.length; i++) {
5
                if (LINES_KEY.equals(params[i].getName())) {
5
                if (LINES_KEY.equals(params[i].getName())) {
6
                    lines = new Long(params[i].getValue()).longValue();
6
                    setLines(new Long(params[i].getValue()).longValue());
7
                    continue;
7
                    continue;
8
                }
8
                }
9
                if (SKIP_KEY.equals(params[i].getName())) {
9
                if (SKIP_KEY.equals(params[i].getName())) {
10
                    skip = new Long(params[i].getValue()).longValue();
10
                    skip = new Long(params[i].getValue()).longValue();
11
                    continue;
11
                    continue;
12
                
12
                
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