for (int i=0; i<l1.length; i++) { if (!l1[i].equals(l2[i])) { assertTrue(msg, !shouldBeEqual); } }
for (int i = 0; i < DEFAULT_TRACE_FILTERS.length; i++) { if (line.indexOf(DEFAULT_TRACE_FILTERS[i]) != -1) { return true; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/AntTest.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/junit/JUnitTestRunner.java
Method name: void targetStarted(BuildEvent) Method name: boolean filterLine(String)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i=0; i<l1.length; i++) {
1
for (int i = 0; i < DEFAULT_TRACE_FILTERS.length; i++) {
2
                                    if (!l1[i].equals(l2[i])) {
2
            
3
                                        assertTrue(msg, !shouldBeEqual);
4
                                    }
5
                        
3
if (line.indexOf(DEFAULT_TRACE_FILTERS[i]) != -1) {
4
                return true;
5
            }
6
        }
6
        }
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
Number of node comparisons1