String s = Integer.toHexString(ch);
int nzeros = 5 - s.length();
char[] result = new char[6];
result[0] = '_';
for (int i = 1; i <= nzeros; i++) {
result[i] = '0';
}
String s = Integer.toHexString(ch);
int nzeros = 5 - s.length();
char[] result = new char[6];
result[0] = '_';
for (int i = 1; i <= nzeros; ++i) {
result[i] = '0';
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/jsp/Jasper41Mangler.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/jsp/JspNameMangler.java
|
Method name: String mangleChar(char)
|
|
Method name: String mangleChar(char)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | String s = Integer.toHexString(ch);↵ | | 1 | String s = Integer.toHexString(ch);↵
|
2 | int nzeros = 5 - s.length();↵ | | 2 | int nzeros = 5 - s.length();↵
|
3 | char[] result = new char[6];↵ | | 3 | char[] result = new char[6];↵
|
4 | result[0] = '_';↵ | | 4 | result[0] = '_';↵
|
5 | for (int i = 1; i <= nzeros; i++) {↵ | | 5 | for (int i = 1; i <= nzeros; ++i) {↵
|
6 | result[i] = '0';↵ | | 6 | result[i] = '0';↵
|
7 | } | | 7 | }
|
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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |