int matchEnd = this. matchCharArray (con, this.operations, con.start, 1, this.options); //System.err.println("DEBUG: matchEnd="+matchEnd); if (matchEnd == con.limit) { if (con.match != null) { con.match.setBeginning(0, con.start); con.match.setEnd(0, matchEnd); } con.inuse = false; return true; } return false;
int matchEnd = this. matchCharacterIterator (con, this.operations, con.start, 1, this.options); //System.err.println("DEBUG: matchEnd="+matchEnd); if (matchEnd == con.limit) { if (con.match != null) { con.match.setBeginning(0, con.start); con.match.setEnd(0, matchEnd); } con.inuse = false; return true; } 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
int matchEnd = this. matchCharArray (con, this.operations, con.start, 1, this.options);
1
int matchEnd = this. matchCharacterIterator (con, this.operations, con.start, 1, this.options);
2
              //System.err.println("DEBUG: matchEnd="+matchEnd);
2
              //System.err.println("DEBUG: matchEnd="+matchEnd);
3
              if (matchEnd == con.limit) {
3
              if (matchEnd == con.limit) {
4
                  if (con.match != null) {
4
                  if (con.match != null) {
5
                      con.match.setBeginning(0, con.start);
5
                      con.match.setBeginning(0, con.start);
6
                      con.match.setEnd(0, matchEnd);
6
                      con.match.setEnd(0, matchEnd);
7
                  }
7
                  }
8
                  con.inuse = false;
8
                  con.inuse = false;
9
                  return true;
9
                  return true;
10
              }
10
              }
11
              return false;
11
              return false;
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