switch(ch) { case '\n': buf.append("\\n"); break; case '\t': buf.append("\\t"); break; case '\\': buf.append("\\\\"); break; default: buf.append(ch); break; }
switch(ch) { case '\n': buf.append("\\n"); break; case '\t': buf.append("\\t"); break; case '\\': buf.append("\\\\"); break; default: buf.append(ch); break; }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/AbbrevEditor.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/AbbrevEditor.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
switch(ch)
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
			case '\\':
9
				case '\\':
10
				buf.append("\\\\");
10
					buf.append("\\\\");
11
				break;
11
					break;
12
			default:
12
				default:
13
				buf.append(ch);
13
					buf.append(ch);
14
				break;
14
					break;
15
			}
15
				}
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