for (int i = patIdxStart; i <= patIdxEnd; i++) { if (patArr[i] != '*') { return false; } }
while ((line = br.readLine()) != null) { if (!filterLine(line)) { pw.println(line); } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/selectors/SelectorUtils.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/junit/JUnitTestRunner.java
Method name: boolean match(String, String, boolean) Method name: String filterStack(String)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = patIdxStart; i <= patIdxEnd; i++) {
1
while ((line = br.readLine()) != null) {
2
            if (patArr[i] != '*') {
2
                if (!filterLine(line)) {
3
                return false;
3
                    pw.println(line);
4
            }
4
             
5
   }
5
        }
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