File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/StringTokenizer.java | File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2InputStream.java | |||
Method name: boolean isDelim(char)
|
Method name: void hbCreateDecodeTables(int[], int[], int[], char[], int, int, int)
|
|||
Number of AST nodes: 3 | Number of AST nodes: 3 | |||
1 | for (int i = 0; i < delims.length; ++i) {↵ | 1 | for (int j = 0; j < alphaSize; j++) {↵ | |
2 | if (delims[i] == ch) {↵ | 2 | if (length[j] == i) {↵ | |
3 | return true;↵ | 3 | ↵ | |
4 | perm[pp++] = j;↵ | |||
4 | }↵ | 5 | }↵ | |
5 | } | 6 | } | |
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 | 6 |
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 0.5 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4 | if (delims[i] == ch) |
| 3 | if (length[j] == i) | ||||||||||||||||||||
| 4 | perm[pp++] = j; | ||||||||||||||||||||||
5 | return true; |
| |
Row | Violation |
---|---|
1 | Type char of variable ch does not match with type int of variable i |
2 | Unmatched return true; |