} else if (this.getMin() >= 0 && this.getMax() >= 0) { ret = this.child.toString(options)+"{"+this.getMin()+","+this.getMax()+"}"; } else if (this.getMin() >= 0 && this.getMax() < 0) { ret = this.child.toString(options)+"{"+this.getMin()+",}"; } else throw new RuntimeException("Token#toString(): CLOSURE " +this.getMin()+", "+this.getMax());
} else if (this.getMin() >= 0 && this.getMax() >= 0) { ret = this.child.toString(options)+"{"+this.getMin()+","+this.getMax()+"}?"; } else if (this.getMin() >= 0 && this.getMax() < 0) { ret = this.child.toString(options)+"{"+this.getMin()+",}?"; } else throw new RuntimeException("Token#toString(): NONGREEDYCLOSURE " + this.getMin() + ", " + this.getMax());
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
} else if (this.getMin() >= 0 && this.getMax() >= 0) {
1
} else if (this.getMin() >= 0 && this.getMax() >= 0) {
2
                      ret = this.child.toString(options)+"{"+this.getMin()+","+this.getMax()+"}";
2
                      ret = this.child.toString(options)+"{"+this.getMin()+","+this.getMax()+"}?";
3
                  } else if (this.getMin() >= 0 && this.getMax() < 0) {
3
                  } else if (this.getMin() >= 0 && this.getMax() < 0) {
4
                      ret = this.child.toString(options)+"{"+this.getMin()+",}";
4
                      ret = this.child.toString(options)+"{"+this.getMin()+",}?";
5
                  } else
5
                  } else
6
                      throw new RuntimeException("Token#toString(): CLOSURE "
6
                      throw new RuntimeException("Token#toString(): NONGREEDYCLOSURE "
7
                                                 +this.getMin()+", "+this.getMax());
7
                                                 + this.getMin() + ", " + this.getMax());
8
              
8
        
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