currentLineWidth += newString.length(); LOOP: for (int i = newString.length() - 1; i >= 0; --i) { switch (newString.charAt(i)) { case '\n': case '\r': { currentLineWidth = newString.length() - i; break LOOP;
currentLineWidth += newString.length(); 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
currentLineWidth += newString.length();
1
currentLineWidth += newString.length();
2
      LOOP: for (int i = newString.length() - 1; i >= 0; --i)
2
      LOOP: for (int i = newString.length() - 1; i >= 0; --i)
3
      {
3
      {
4
        switch (newString.charAt(i))
4
        switch (newString.charAt(i))
5
        {
5
        {
6
          case '\n':
6
          case '\n':
7
          case '\r':
7
          case '\r':
8
          {
8
          {
9
            currentLineWidth = newString.length() - i;
9
            currentLineWidth = newString.length() - i;
10
            break LOOP;
10
            break LOOP;
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