if (isChecked()) { return; } if (isReference()) { super.dieOnCircularReference(stk, p); } else { if (union != null) { stk.push(union); invokeCircularReferenceCheck(union, stk, p); stk.pop(); } setChecked(true); }
if (isChecked()) { return; } if (isReference()) { super.dieOnCircularReference(stk, p); } else { if (tokenizer instanceof DataType) { stk.push(tokenizer); invokeCircularReferenceCheck((DataType) tokenizer, stk, p); } setChecked(true); }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/Path.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/resources/Tokens.java
Method name: void dieOnCircularReference(Stack, Project) Method name: void dieOnCircularReference(Stack, Project)
Number of AST nodes: 9 Number of AST nodes: 8
1
if (isChecked()) {
1
if (isChecked()) {
2
            return;
2
            return;
3
        }
3
        }
4
        if (isReference()) {
4
        if (isReference()) {
5
            super.dieOnCircularReference(stk, p);
5
            super.dieOnCircularReference(stk, p);
6
        } else {
6
        } else {
7
            if (union != null) {
7
            if (tokenizer instanceof DataType) {
8
                stk.push(union);
8
                stk.push(tokenizer);
9
                invokeCircularReferenceCheck(union, stk, p);
9
                invokeCircularReferenceCheck(
10
                stk.pop();
10
(DataType) tokenizer, stk, p);
11
            }
11
            }
12
            setChecked(true);
12
            setChecked(true);
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.1
Clones locationClones are in different classes having the same super class
Number of node comparisons1