char ch = str.charAt(i); switch(ch) { case '<': buf.append("<"); break; case '>': buf.append(">"); break; case '&': buf.append("&"); break; default: buf.append(ch); break; }
char ch = afterCaretText.charAt(i); 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/MiscUtilities.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
char ch = str.charAt(i);
1
char ch = afterCaretText.charAt(i);
2
			switch(ch)
2
				switch(ch)
3
			{
3
				{
4
			case '<':
4
				case '\n':
5
				buf.append("<");
5
					buf.append("\\n");
6
				break;
6
					break;
7
			case '>':
7
				case '\t':
8
				buf.append(">");
8
					buf.append("\\t");
9
				break;
9
					break;
10
			case '&':
10
				case '\\':
11
				buf.append("&");
11
					buf.append("\\\\");
12
				break;
12
					break;
13
			default:
13
				default:
14
				buf.append(ch);
14
					buf.append(ch);
15
				break;
15
					break;
16
			}
16
				}
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