File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/TokenFilter.java | File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/DOMElementWriter.java | |||
Method name: String filter(String)
|
Method name: String encodedata(String)
|
|||
Number of AST nodes: 4 | Number of AST nodes: 4 | |||
1 | for (int i = 0; i < string.length(); ++i) {↵ | 1 | for (int i = 0; i < len; ++i) {↵ | |
2 | char ch = string.charAt(i);↵ | 2 | char c = value.charAt(i);↵ | |
3 | if (!(isDeleteCharacter(ch))) {↵ | 3 | if (isLegalCharacter(c)) {↵ | |
4 | output.append(ch);↵ | 4 | sb.append(c);↵ | |
5 | }↵ | 5 | ↵ | |
6 | ↵ | 6 | }↵ | |
7 | } | 7 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 8 |
Number of mapped statements | 4 |
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) | 0.7 |
Clone type | Type 2 |
ID | Statement | ID | Statement | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2 | for (int i = 0; i < string.length(); ++i) |
| 3 | for (int i = 0; i < len; ++i) | |||||||||||||
3 | char ch = string.charAt(i); |
| 4 | char c = value.charAt(i); | |||||||||||||
4 | if (!(isDeleteCharacter(ch))) |
| 5 | if (isLegalCharacter(c)) | |||||||||||||
5 | output.append(ch); |
| 6 | sb.append(c); |
Row | Violation |
---|---|
1 | Expression !(isDeleteCharacter(ch)) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression isLegalCharacter(c) cannot be parameterized, because it has dependencies to/from statements that will be extracted |