char ch; for (int i = 0; i < str.length(); i++) { switch (str.charAt(i)) { case 0 : continue; case '\b': retval.append("\\b"); continue; case '\t': retval.append("\\t"); continue; case '\n': retval.append("\\n"); continue; case '\f': retval.append("\\f"); continue; case '\r': retval.append("\\r"); continue; case '\"': retval.append("\\\""); continue; case '\'': retval.append("\\\'"); continue; case '\\': retval.append("\\\\"); continue; default: if ((ch = str.charAt(i)) < 0x20 || ch > 0x7e) { String s = "0000" + Integer.toString(ch, 16); retval.append("\\u" + s.substring(s.length() - 4, s.length())); } else { retval.append(ch); }
for (int i = 0; i < str.length(); i++) { switch (str.charAt(i)) { case 0 : continue; case '\b': retval.append("\\b"); continue; case '\t': retval.append("\\t"); continue; case '\n': retval.append("\\n"); continue; case '\f': retval.append("\\f"); continue; case '\r': retval.append("\\r"); continue; case '\"': retval.append("\\\""); continue; case '\'': retval.append("\\\'"); continue; case '\\': retval.append("\\\\"); continue; default: if ((ch = str.charAt(i)) < 0x20 || ch > 0x7e) { String s = "0000" + Integer.toString(ch, 16); retval.append("\\u" + s.substring(s.length() - 4, s.length())); } else { retval.append(ch); } continue;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/bsh/ParseException.java File path: /jEdit-4.2/src/bsh/TokenMgrError.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
char ch;
2
      for (int i = 0; i < str.length(); i++) {
1
for (int i = 0; i < str.length(); i++) {
3
        switch (str.charAt(i))
2
        switch (str.charAt(i))
4
        {
3
        {
5
           case 0 :
4
           case 0 :
6
              continue;
5
              continue;
7
           case '\b':
6
           case '\b':
8
              retval.append("\\b");
7
              retval.append("\\b");
9
              continue;
8
              continue;
10
           case '\t':
9
           case '\t':
11
              retval.append("\\t");
10
              retval.append("\\t");
12
              continue;
11
              continue;
13
           case '\n':
12
           case '\n':
14
              retval.append("\\n");
13
              retval.append("\\n");
15
              continue;
14
              continue;
16
           case '\f':
15
           case '\f':
17
              retval.append("\\f");
16
              retval.append("\\f");
18
              continue;
17
              continue;
19
           case '\r':
18
           case '\r':
20
              retval.append("\\r");
19
              retval.append("\\r");
21
              continue;
20
              continue;
22
           case '\"':
21
           case '\"':
23
              retval.append("\\\"");
22
              retval.append("\\\"");
24
              continue;
23
              continue;
25
           case '\'':
24
           case '\'':
26
              retval.append("\\\'");
25
              retval.append("\\\'");
27
              continue;
26
              continue;
28
           case '\\':
27
           case '\\':
29
              retval.append("\\\\");
28
              retval.append("\\\\");
30
              continue;
29
              continue;
31
           default:
30
           default:
32
              if ((ch = str.charAt(i)) < 0x20 || ch > 0x7e) {
31
              if ((ch = str.charAt(i)) < 0x20 || ch > 0x7e) {
33
                 String s = "0000" + Integer.toString(ch, 16);
32
                 String s = "0000" + Integer.toString(ch, 16);
34
                 retval.append("\\u" + s.substring(s.length() - 4, s.length()));
33
                 retval.append("\\u" + s.substring(s.length() - 4, s.length()));
35
              } else {
34
              } else {
36
                 retval.append(ch);
35
                 retval.append(ch);
37
              }
36
              }
38
              
37
              continue;
38
        
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