if (lineWidth != Integer.MAX_VALUE)
{
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;
if (lineWidth != Integer.MAX_VALUE)
{
currentLineWidth += data.length();
LOOP:
for (int i = data.length() - 1; i >= 0; --i)
{
switch (data.charAt(i))
{
case '\n':
case '\r':
{
currentLineWidth = data.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 | if (lineWidth != Integer.MAX_VALUE)↵ | | 1 | if (lineWidth != Integer.MAX_VALUE)↵
|
2 | {↵ | | 2 | ↵
|
| | | 3 | {↵
|
3 | currentLineWidth += newString.length();↵ | | 4 | currentLineWidth += data.length();↵
|
4 | LOOP: ↵ | | 5 | LOOP: ↵
|
5 | for (int i = newString.length() - 1; i >= 0; --i)↵ | | 6 | for (int i = data.length() - 1; i >= 0; --i)↵
|
6 | {↵ | | 7 | {↵
|
7 | switch (newString.charAt(i))↵ | | 8 | switch (data.charAt(i))↵
|
8 | {↵ | | 9 | {↵
|
9 | case '\n':↵ | | 10 | case '\n':↵
|
10 | case '\r':↵ | | 11 | case '\r':↵
|
11 | {↵ | | 12 | ↵
|
| | | 13 | {↵
|
12 | currentLineWidth = newString.length() - i;↵ | | 14 | currentLineWidth = data.length() - i;↵
|
13 | break LOOP;↵ | | 15 | break LOOP;↵
|
14 | | | 16 |
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |