File path: /jEdit-4.2/src/installer/CBZip2InputStream.java | File path: /jEdit-4.2/src/installer/CBZip2InputStream.java | |||
Method name: void hbCreateDecodeTables(int[], int[], int[], char[], int, int, int)
|
Method name: void hbCreateDecodeTables(int[], int[], int[], char[], int, int, int)
|
|||
Number of AST nodes: 2 | Number of AST nodes: 2 | |||
1 | for( int i = 0; i < MAX_CODE_LEN; i++ )↵ | 1 | for( int i = 0; i < MAX_CODE_LEN; i++ )↵ | |
2 | {↵ | 2 | {↵ | |
3 | base[ i ] = 0;↵ | 3 | limit[ i ] = 0;↵ | |
4 | } | 4 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 4 |
Number of mapped statements | 2 |
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.5 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
7 | for (int i = 0; i < MAX_CODE_LEN; i++) | 13 | for (int i = 0; i < MAX_CODE_LEN; i++) | |||||||||||
8 | base[i] = 0; |
| 14 | limit[i] = 0; |
Row | Violation |
---|