private int last;
/**
* Index in zptr[] of original string after sorting.
*/
private int origPtr;
/**
* always: in the range 0 .. 9.
* The current block size is 100000 * this number.
*/
private int blockSize100k;
private boolean blockRandomised;
private int bsBuff;
private int bsLive;
private final CRC crc = new CRC();
private int nInUse;
private int last;
/**
* Index in fmap[] of original string after sorting.
*/
private int origPtr;
/**
Always: in the range 0 .. 9.
The current block size is 100000 * this number.
*/
private final int blockSize100k;
private boolean blockRandomised;
private int bsBuff;
private int bsLive;
private final CRC crc = new CRC();
private int nInUse;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2InputStream.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2OutputStream.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | private int last;↵ | | 1 | private int last;↵
|
|
2 | /**↵ | | 2 | /**↵
|
3 | * Index in zptr[] of original string after sorting.↵ | | 3 | * Index in fmap[] of original string after sorting.↵
|
4 | */↵ | | 4 | */↵
|
5 | private int origPtr;↵ | | 5 | private int origPtr;↵
|
|
6 | /**↵ | | 6 | /**↵
|
7 | * always: in the range 0 .. 9.↵ | | 7 | Always: in the range 0 .. 9.↵
|
8 | * The current block size is 100000 * this number.↵ | | 8 | The current block size is 100000 * this number.↵
|
9 | */↵ | | 9 | */↵
|
10 | private int blockSize100k;↵ | | 10 | private final int blockSize100k;↵
|
|
11 | private boolean blockRandomised;↵ | | 11 | private boolean blockRandomised;↵
|
|
12 | private int bsBuff;↵ | | 12 | private int bsBuff;↵
|
13 | private int bsLive;↵ | | 13 | private int bsLive;↵
|
14 | private final CRC crc = new CRC();↵ | | 14 | private final CRC crc = new CRC();↵
|
|
15 | private int nInUse; | | 15 | private int nInUse;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |