switch(c)
{
case 'n':
buf.append('\n');
break;
case 't':
buf.append('\t');
break;
default:
buf.append(c);
break;
}
break;
switch(ch)
{
case 'n':
buf.append('\n');
break;
case 't':
buf.append('\t');
break;
default:
buf.append(ch);
break;
}
break;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/MiscUtilities.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/search/SearchAndReplace.java
|
Method name: String escapesToChars(String)
|
|
Method name: String regexpReplace(SearchMatcher.Match, String)
|
Number of AST nodes: 11
|
|
Number of AST nodes: 11
|
|
1 | switch(c)↵ | | 1 | switch(ch)↵
|
2 | {↵ | | 2 | {↵
|
3 | case 'n':↵ | | 3 | case 'n':↵
|
4 | buf.append('\n');↵ | | 4 | buf.append('\n');↵
|
5 | break;↵ | | 5 | break;↵
|
6 | case 't':↵ | | 6 | case 't':↵
|
7 | buf.append('\t');↵ | | 7 | buf.append('\t');↵
|
8 | break;↵ | | 8 | break;↵
|
9 | default:↵ | | 9 | default:↵
|
10 | buf.append(c);↵ | | 10 | buf.append(ch);↵
|
11 | break;↵ | | 11 | break;↵
|
12 | }↵ | | 12 | }↵
|
13 | break; | | 13 | break;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 58 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 11 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 2.6 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
10 | switch (c) | | 24 | switch (ch) |
11 | | | 25 | |
12 | | | 26 | |
13 | | | 27 | |
14 | | | 28 | |
15 | | | 29 | |
16 | | | 30 | |
17 | | | 31 | |
18 | | | 32 | |
19 | | | 33 | |
20 | break; | | 34 | break; |
Precondition Violations (0)
Row |
Violation |