for (int i = 1; i <= alphaSize; i++) { parent[i] = -1; nHeap++; heap[nHeap] = i; int zz = nHeap; int tmp = heap[zz]; while (weight[tmp] < weight[heap[zz >> 1]]) { heap[zz] = heap[zz >> 1]; zz >>= 1; } heap[zz] = tmp; }
for (int i = 1; i <= alphaSize; i++) { parent[i] = -1; nHeap++; heap[nHeap] = i; int zz = nHeap; int tmp = heap[zz]; while (weight[tmp] < weight[heap[zz >> 1]]) { heap[zz] = heap[zz >> 1]; zz >>= 1; } heap[zz] = tmp; }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2OutputStream.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
for (int i = 1; i <= alphaSize; i++) {
1
for (int i = 1; i <= alphaSize; i++) {
2
                parent[i] = -1;
2
                parent[i] = -1;
3
                nHeap++;
3
                nHeap++;
4
                heap[nHeap] = i;
4
                heap[nHeap] = i;
5
                int zz = nHeap;
5
                int zz = nHeap;
6
                int tmp = heap[zz];
6
                int tmp = heap[zz];
7
                while (weight[tmp] < weight[heap[zz >> 1]]) {
7
                while (weight[tmp] < weight[heap[zz >> 1]]) {
8
                    heap[zz] = heap[zz >> 1];
8
                    heap[zz] = heap[zz >> 1];
9
                    zz >>= 1;
9
                    zz >>= 1;
10
                }
10
                }
11
                heap[zz] = tmp;
11
                heap[zz] = tmp;
12
            }
12
            }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0