if (matchEnd >= 0) { if (con.match != null) { con.match.setBeginning(0, matchStart); con.match.setEnd(0, matchEnd); } con.inuse = false; return true; } else { con.inuse = false; return false; }
if (matchEnd >= 0) { if (con.match != null) { con.match.setBeginning(0, matchStart); con.match.setEnd(0, matchEnd); } con.inuse = false; return true; } else { con.inuse = false; return false; }
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/RegEx.java File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/RegEx.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (matchEnd >= 0) {
1
if (matchEnd >= 0) {
2
              if (con.match != null) {
2
              if (con.match != null) {
3
                  con.match.setBeginning(0, matchStart);
3
                  con.match.setBeginning(0, matchStart);
4
                  con.match.setEnd(0, matchEnd);
4
                  con.match.setEnd(0, matchEnd);
5
              }
5
              }
6
              con.inuse = false;
6
              con.inuse = false;
7
              return true;
7
              return true;
8
          } else {
8
          } else {
9
              con.inuse = false;
9
              con.inuse = false;
10
              return false;
10
              return false;
11
          }
11
          }
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