File path: /jEdit-4.2/src/installer/TarBuffer.java | File path: /jEdit-4.2/src/installer/TarBuffer.java | |||
Method name: void writeRecord(byte[])
|
Method name: void writeRecord(byte[], int)
|
|||
Number of AST nodes: 4 | Number of AST nodes: 4 | |||
1 | if ( this.currRecIdx >= this.recsPerBlock )↵ | 1 | if ( this.currRecIdx >= this.recsPerBlock )↵ | |
2 | {↵ | 2 | {↵ | |
3 | this.writeBlock();↵ | 3 | this.writeBlock();↵ | |
4 | }↵ | 4 | }↵ | |
5 | System.arraycopy(↵ | 5 | System.arraycopy(↵ | |
6 | record, 0,↵ | 6 | buf, offset,↵ | |
7 | this.blockBuffer, (this.currRecIdx * this.recordSize),↵ | 7 | this.blockBuffer, (this.currRecIdx * this.recordSize),↵ | |
8 | this.recordSize );↵ | 8 | this.recordSize );↵ | |
9 | this.currRecIdx++; | 9 |
| |
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 declared in the same class |
Number of node comparisons | 6 |
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) | 1.3 |
Clone type | Type 2 |
ID | Statement | ID | Statement | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
7 | if (this.currRecIdx >= this.recsPerBlock) | 7 | if (this.currRecIdx >= this.recsPerBlock) | ||||||||||||||
8 | this.writeBlock(); | 8 | this.writeBlock(); | ||||||||||||||
9 | System.arraycopy(record, 0, this.blockBuffer, (this.currRecIdx * this.recordSize), this.recordSize); |
| 9 | System.arraycopy(buf, offset, this.blockBuffer, (this.currRecIdx * this.recordSize), this.recordSize); | |||||||||||||
10 | this.currRecIdx++; | 10 | this.currRecIdx++; |
Row | Violation |
---|