for( v = 0; v < alphaSize; v++ )
{
len[ t ][ v ] = (char)GREATER_ICOST;
}
for( v = 0; v < alphaSize; v++ )
{
rfreq[ t ][ v ] = 0;
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/installer/CBZip2OutputStream.java
|
|
File path: /jEdit-4.2/src/installer/CBZip2OutputStream.java
|
Method name: void sendMTFValues()
|
|
Method name: void sendMTFValues()
|
Number of AST nodes: 2
|
|
Number of AST nodes: 2
|
|
1 | for( v = 0; v < alphaSize; v++ )↵ | | 1 | for( v = 0; v < alphaSize; v++ )↵
|
2 | {↵ | | 2 | {↵
|
3 | len[ t ][ v ] = (char)GREATER_ICOST;↵ | | 3 | rfreq[ t ][ v ] = ↵
|
| | | 4 | 0;↵
|
4 | } | | 5 | }
|
See real code fragment |
|
See real code fragment |
Summary
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.3 |
Clones location | Clones are in the same method |
Number of node comparisons | 10 |
-
{Non-refactorable}
Mapping Summary
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) | 1.0 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
19 | for (v = 0; v < alphaSize; v++) | | 63 | for (v = 0; v < alphaSize; v++) |
20 | len[t][v] = (char)GREATER_ICOST; | | | |
| | | 64 | |
Precondition Violations (2)
Row |
Violation |
1 | Unmatched statement len[t][v]=(char)GREATER_ICOST; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
2 | Unmatched statement rfreq[t][v]=0; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |