LOOP: for (int i = newString.length() - 1; i >= 0; --i) { switch (newString.charAt(i)) { case '\n': case '\r': { currentLineWidth = newString.length() - i; break LOOP;
LOOP: for (int i = newString.length() - 1; i >= 0; --i) { switch (newString.charAt(i)) { case '\n': case '\r': { currentLineWidth = newString.length() - i; break LOOP;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xmi/impl/XMLString.java File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xmi/impl/XMLString.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
LOOP: for (int i = newString.length() - 1; i >= 0; --i)
1
LOOP: for (int i = newString.length() - 1; i >= 0; --i)
2
      {
2
      {
3
        switch (newString.charAt(i))
3
        switch (newString.charAt(i))
4
        {
4
        {
5
          case '\n':
5
          case '\n':
6
          case '\r':
6
          case '\r':
7
          {
7
          {
8
            currentLineWidth = newString.length() - i;
8
            currentLineWidth = newString.length() - i;
9
            break LOOP;
9
            break LOOP;
10
          
10
          
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