final int[] heap = new int[MAX_ALPHA_SIZE * 2]; final int[] weight = new int[MAX_ALPHA_SIZE * 2]; final int[] parent = new int[MAX_ALPHA_SIZE * 2]; for (int i = alphaSize; --i >= 0;) { weight[i + 1] = (freq[i] == 0 ? 1 : freq[i]) << 8; } for (boolean tooLong = true; tooLong;) { tooLong = false; int nNodes = alphaSize; int nHeap = 0; heap[0] = 0; weight[0] = 0; parent[0] = -2; 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; } // assert (nHeap < (MAX_ALPHA_SIZE + 2)) : nHeap; while (nHeap > 1) { int n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; int yy = 0; int zz = 1; int tmp = heap[1]; while (true) { yy = zz << 1; if (yy > nHeap) { break; } if ((yy < nHeap) && (weight[heap[yy + 1]] < weight[heap[yy]])) { yy++; } if (weight[tmp] < weight[heap[yy]]) { break; } heap[zz] = heap[yy]; zz = yy; } heap[zz] = tmp; int n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; yy = 0; zz = 1; tmp = heap[1]; while (true) { yy = zz << 1; if (yy > nHeap) { break; } if ((yy < nHeap) && (weight[heap[yy + 1]] < weight[heap[yy]])) { yy++; } if (weight[tmp] < weight[heap[yy]]) { break; } heap[zz] = heap[yy]; zz = yy; } heap[zz] = tmp; nNodes++; parent[n1] = parent[n2] = nNodes; final int weight_n1 = weight[n1]; final int weight_n2 = weight[n2]; weight[nNodes] = (((weight_n1 & 0xffffff00) + (weight_n2 & 0xffffff00)) | (1 + (((weight_n1 & 0x000000ff) > (weight_n2 & 0x000000ff)) ? (weight_n1 & 0x000000ff) : (weight_n2 & 0x000000ff)))); parent[nNodes] = -1; nHeap++; heap[nHeap] = nNodes; tmp = 0; zz = nHeap; tmp = heap[zz]; final int weight_tmp = weight[tmp]; while (weight_tmp < weight[heap[zz >> 1]]) { heap[zz] = heap[zz >> 1]; zz >>= 1; } heap[zz] = tmp; } // assert (nNodes < (MAX_ALPHA_SIZE * 2)) : nNodes; for (int i = 1; i <= alphaSize; i++) { int j = 0; int k = i; for (int parent_k; (parent_k = parent[k]) >= 0;) { k = parent_k; j++; } len[i - 1] = (char) j; if (j > maxLen) { tooLong = true; } } if (tooLong) { for (int i = 1; i < alphaSize; i++) { int j = weight[i] >> 8; j = 1 + (j >> 1); weight[i] = j << 8; } } }
final int[] heap = dat.heap; final int[] weight = dat.weight; final int[] parent = dat.parent; for (int i = alphaSize; --i >= 0;) { weight[i + 1] = (freq[i] == 0 ? 1 : freq[i]) << 8; } for (boolean tooLong = true; tooLong;) { tooLong = false; int nNodes = alphaSize; int nHeap = 0; heap[0] = 0; weight[0] = 0; parent[0] = -2; 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; } while (nHeap > 1) { int n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; int yy = 0; int zz = 1; int tmp = heap[1]; while (true) { yy = zz << 1; if (yy > nHeap) { break; } if ((yy < nHeap) && (weight[heap[yy + 1]] < weight[heap[yy]])) { yy++; } if (weight[tmp] < weight[heap[yy]]) { break; } heap[zz] = heap[yy]; zz = yy; } heap[zz] = tmp; int n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; yy = 0; zz = 1; tmp = heap[1]; while (true) { yy = zz << 1; if (yy > nHeap) { break; } if ((yy < nHeap) && (weight[heap[yy + 1]] < weight[heap[yy]])) { yy++; } if (weight[tmp] < weight[heap[yy]]) { break; } heap[zz] = heap[yy]; zz = yy; } heap[zz] = tmp; nNodes++; parent[n1] = parent[n2] = nNodes; final int weight_n1 = weight[n1]; final int weight_n2 = weight[n2]; weight[nNodes] = ((weight_n1 & 0xffffff00) + (weight_n2 & 0xffffff00)) | (1 + (((weight_n1 & 0x000000ff) > (weight_n2 & 0x000000ff)) ? (weight_n1 & 0x000000ff) : (weight_n2 & 0x000000ff))); parent[nNodes] = -1; nHeap++; heap[nHeap] = nNodes; tmp = 0; zz = nHeap; tmp = heap[zz]; final int weight_tmp = weight[tmp]; while (weight_tmp < weight[heap[zz >> 1]]) { heap[zz] = heap[zz >> 1]; zz >>= 1; } heap[zz] = tmp; } for (int i = 1; i <= alphaSize; i++) { int j = 0; int k = i; for (int parent_k; (parent_k = parent[k]) >= 0;) { k = parent_k; j++; } len[i - 1] = (byte) j; if (j > maxLen) { tooLong = true; } } if (tooLong) { for (int i = 1; i < alphaSize; i++) { int j = weight[i] >> 8; j = 1 + (j >> 1); weight[i] = j << 8; } } }
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: void hbMakeCodeLengths(char[], int[], int, int) Method name: void hbMakeCodeLengths(byte[], int[], Data, int, int)
Number of AST nodes: 87 Number of AST nodes: 87
1
final int[] heap    = new int[MAX_ALPHA_SIZE * 2];↵
1
final int[] heap    = dat.heap;↵
2
        final int[] weight  = new int[MAX_ALPHA_SIZE * 2];↵
2
        final int[] weight  = dat.weight;↵
3
        final int[] parent  = new int[MAX_ALPHA_SIZE * 2];↵
3
        final int[] parent  = dat.parent;↵
4
        for (int i = alphaSize; --i >= 0;) {↵
4
        for (int i = alphaSize; --i >= 0;) {↵
5
            weight[i + 1] = (freq[i] == 0 ? 1 : freq[i]) << 8;↵
5
            weight[i + 1] = (freq[i] == 0 ? 1 : freq[i]) << 8;↵
6
        }↵
6
        }↵
7
        for (boolean tooLong = true; tooLong;) {↵
7
        for (boolean tooLong = true; tooLong;) {↵
8
            tooLong = false;↵
8
            tooLong = false;↵
9
            int nNodes = alphaSize;↵
9
            int nNodes = alphaSize;↵
10
            int nHeap = 0;↵
10
            int nHeap = 0;↵
11
            heap[0] = 0;↵
11
            heap[0] = 0;↵
12
            weight[0] = 0;↵
12
            weight[0] = 0;↵
13
            parent[0] = -2;↵
13
            parent[0] = -2;↵
14
            for (int i = 1; i <= alphaSize; i++) {↵
14
            for (int i = 1; i <= alphaSize; i++) {↵
15
                parent[i] = -1;↵
15
                parent[i] = -1;↵
16
                nHeap++;↵
16
                nHeap++;↵
17
                heap[nHeap] = i;↵
17
                heap[nHeap] = i;↵
18
                int zz = nHeap;↵
18
                int zz = nHeap;↵
19
                int tmp = heap[zz];↵
19
                int tmp = heap[zz];↵
20
                while (weight[tmp] < weight[heap[zz >> 1]]) {↵
20
                while (weight[tmp] < weight[heap[zz >> 1]]) {↵
21
                    heap[zz] = heap[zz >> 1];↵
21
                    heap[zz] = heap[zz >> 1];↵
22
                    zz >>= 1;↵
22
                    zz >>= 1;↵
23
                }↵
23
                }↵
24
                heap[zz] = tmp;↵
24
                heap[zz] = tmp;↵
25
            }↵
25
            }↵
26
            // assert (nHeap < (MAX_ALPHA_SIZE + 2)) : nHeap;↵


27
            while (nHeap > 1) {↵
26
            while (nHeap > 1) {↵


28
                int n1 = heap[1];↵
27
                int n1 = heap[1];↵


29
                heap[1] = heap[nHeap];↵
28
                heap[1] = heap[nHeap];↵


30
                nHeap--;↵
29
                nHeap--;↵


31
                int yy = 0;↵
30
                int yy = 0;↵


32
                int zz = 1;↵
31
                int zz = 1;↵


33
                int tmp = heap[1];↵
32
                int tmp = heap[1];↵


34
                while (true) {↵
33
                while (true) {↵


35
                    yy = zz << 1;↵
34
                    yy = zz << 1;↵


36
                    if (yy > nHeap) {↵
35
                    if (yy > nHeap) {↵


37
                        break;↵
36
                        break;↵


38
                    }↵
37
                    }↵


39
                    if ((yy < nHeap)↵
38
                    if ((yy < nHeap)↵


40
                        && (weight[heap[yy + 1]] < weight[heap[yy]])) {↵
39
                        && (weight[heap[yy + 1]] < weight[heap[yy]])) {↵


41
                        yy++;↵
40
                        yy++;↵


42
                    }↵
41
                    }↵


43
                    if (weight[tmp] < weight[heap[yy]]) {↵
42
                    if (weight[tmp] < weight[heap[yy]]) {↵


44
                        break;↵
43
                        break;↵


45
                    }↵
44
                    }↵


46
                    heap[zz] = heap[yy];↵
45
                    heap[zz] = heap[yy];↵


47
                    zz = yy;↵
46
                    zz = yy;↵


48
                }↵
47
                }↵


49
                heap[zz] = tmp;↵
48
                heap[zz] = tmp;↵


50
                int n2 = heap[1];↵
49
                int n2 = heap[1];↵


51
                heap[1] = heap[nHeap];↵
50
                heap[1] = heap[nHeap];↵


52
                nHeap--;↵
51
                nHeap--;↵


53
                yy = 0;↵
52
                yy = 0;↵


54
                zz = 1;↵
53
                zz = 1;↵


55
                tmp = heap[1];↵
54
                tmp = heap[1];↵


56
                while (true) {↵
55
                while (true) {↵


57
                    yy = zz << 1;↵
56
                    yy = zz << 1;↵


58
                    if (yy > nHeap) {↵
57
                    if (yy > nHeap) {↵


59
                        break;↵
58
                        break;↵


60
                    }↵
59
                    }↵


61
                    if ((yy < nHeap)↵
60
                    if ((yy < nHeap)↵


62
                        && (weight[heap[yy + 1]] < weight[heap[yy]])) {↵
61
                        && (weight[heap[yy + 1]] < weight[heap[yy]])) {↵


63
                        yy++;↵
62
                        yy++;↵


64
                    }↵
63
                    }↵


65
                    if (weight[tmp] < weight[heap[yy]]) {↵
64
                    if (weight[tmp] < weight[heap[yy]]) {↵


66
                        break;↵
65
                        break;↵


67
                    }↵
66
                    }↵


68
                    heap[zz] = heap[yy];↵
67
                    heap[zz] = heap[yy];↵


69
                    zz = yy;↵
68
                    zz = yy;↵


70
                }↵
69
                }↵


71
                heap[zz] = tmp;↵
70
                heap[zz] = tmp;↵


72
                nNodes++;↵
71
                nNodes++;↵


73
                parent[n1] = parent[n2] = nNodes;↵
72
                parent[n1] = parent[n2] = nNodes;↵


74
                final int weight_n1 = weight[n1];↵
73
                final int weight_n1 = weight[n1];↵


75
                final int weight_n2 = weight[n2];↵
74
                final int weight_n2 = weight[n2];↵


76
                weight[nNodes] = (((weight_n1 & 0xffffff00)↵
75
                weight[nNodes] = ((weight_n1 & 0xffffff00)↵


77
                                   + (weight_n2 & 0xffffff00))↵
76
                                  + (weight_n2 & 0xffffff00))↵


78
                                  | (1 + (((weight_n1 & 0x000000ff)↵
77
                    | (1 + (((weight_n1 & 0x000000ff)↵


79
                                           > (weight_n2 & 0x000000ff))↵
78
                             > (weight_n2 & 0x000000ff))↵


80
                                          ? (weight_n1 & 0x000000ff)↵
79
                            ? (weight_n1 & 0x000000ff)↵


81
                                          : (weight_n2 & 0x000000ff))));↵
80
                            : (weight_n2 & 0x000000ff)));↵


82
                ↵


83
                parent[nNodes] = -1;↵
81
                parent[nNodes] = -1;↵


84
                nHeap++;↵
82
                nHeap++;↵


85
                heap[nHeap] = nNodes;↵
83
                heap[nHeap] = nNodes;↵


86
                tmp = 0;↵
84
                tmp = 0;↵


87
                zz = nHeap;↵
85
                zz = nHeap;↵


88
                tmp = heap[zz];↵
86
                tmp = heap[zz];↵


89
                final int weight_tmp = weight[tmp];↵
87
                final int weight_tmp = weight[tmp];↵


90
                while (weight_tmp < weight[heap[zz >> 1]]) {↵
88
                while (weight_tmp < weight[heap[zz >> 1]]) {↵


91
                    heap[zz] = heap[zz >> 1];↵
89
                    heap[zz] = heap[zz >> 1];↵


92
                    zz >>= 1;↵
90
                    zz >>= 1;↵


93
                }↵
91
                }↵


94
                heap[zz] = tmp;↵
92
                heap[zz] = tmp;↵


95
            }↵
93
            }↵


96
            // assert (nNodes < (MAX_ALPHA_SIZE * 2)) : nNodes;↵


97
            for (int i = 1; i <= alphaSize; i++) {↵
94
            for (int i = 1; i <= alphaSize; i++) {↵


98
                int j = 0;↵
95
                int j = 0;↵


99
                int k = i;↵
96
                int k = i;↵


100
                for (int parent_k; (parent_k = parent[k]) >= 0;) {↵
97
                for (int parent_k; (parent_k = parent[k]) >= 0;) {↵


101
                    k = parent_k;↵
98
                    k = parent_k;↵


102
                    j++;↵
99
                    j++;↵


103
                }↵
100
                }↵


104
                len[i - 1] = (char) j;↵
101
                len[i - 1] = (byte) j;↵


105
                if (j > maxLen) {↵
102
                if (j > maxLen) {↵


106
                    tooLong = true;↵
103
                    tooLong = true;↵


107
                }↵
104
                }↵


108
            }↵
105
            }↵


109
            if (tooLong) {↵
106
            if (tooLong) {↵


110
                for (int i = 1; i < alphaSize; i++) {↵
107
                for (int i = 1; i < alphaSize; i++) {↵


111
                    int j = weight[i] >> 8;↵
108
                    int j = weight[i] >> 8;↵


112
                    j = 1 + (j >> 1);↵
109
                    j = 1 + (j >> 1);↵


113
                    weight[i] = j << 8;↵
110
                    weight[i] = j << 8;↵


114
                }↵
111
                }↵


115
            }↵
112
            }↵


116
        }
113
        }


					
					
						

							See real code fragment
							
							See real code fragment
						
					
					
				

			

			

			

				

					Summary
					

						

							Number of common nesting structure subtrees1
						

						

							Number of refactorable cases0
						

						

							Number of non-refactorable cases1
						

						

							Time elapsed for finding largest common nesting structure subtrees (ms)88.1 
						

						

							Clones locationClones are declared in the same class 
						

						

							Number of node comparisons1235 
						

					
				
	
			

			

			
    
			
			

			
    
			
			
  1. 
				
    
					{Non-refactorable}
				
    
				
    
					
    
						
    
							Mapping Summary
							
								
    
									Number of mapped statements86
								
    
								
    
									Number of unmapped statements in the first code fragment1
								
    
								
    
									Number of unmapped statements in the second code fragment1
								
    
								
    
									Time elapsed for statement mapping (ms)593.7
								
    
							
    
								Clone typeType 2
							
    
						    			
						
    
					
				
    
			
    
			
    
				Mapped Statements
				
					
    
						ID
						Statement
						
						ID
						Statement
					
    
					
    1
    final int[] heap = new int[MAX_ALPHA_SIZE * 2];
    1
    final int[] heap = new int[MAX_ALPHA_SIZE * 2];
    1
    final int[] heap = dat.heap;
    Differences
    Expression1Expression2Difference
    new int[MAX_ALPHA_SIZE * 2]dat.heapTYPE_COMPATIBLE_REPLACEMENT
    		1
    final int[] heap = dat.heap;
    2
    final int[] weight = new int[MAX_ALPHA_SIZE * 2];
    2
    final int[] weight = new int[MAX_ALPHA_SIZE * 2];
    2
    final int[] weight = dat.weight;
    Differences
    Expression1Expression2Difference
    new int[MAX_ALPHA_SIZE * 2]dat.weightTYPE_COMPATIBLE_REPLACEMENT
    		2
    final int[] weight = dat.weight;
    3
    final int[] parent = new int[MAX_ALPHA_SIZE * 2];
    3
    final int[] parent = new int[MAX_ALPHA_SIZE * 2];
    3
    final int[] parent = dat.parent;
    Differences
    Expression1Expression2Difference
    new int[MAX_ALPHA_SIZE * 2]dat.parentTYPE_COMPATIBLE_REPLACEMENT
    		3
    final int[] parent = dat.parent;
    4
    for (int i = alphaSize; --i >= 0; )
    		4
    for (int i = alphaSize; --i >= 0; )
    5
    weight[i + 1] = (freq[i] == 0 ? 1 : freq[i]) << 8;
    		5
    weight[i + 1] = (freq[i] == 0 ? 1 : freq[i]) << 8;
    6
    for (boolean tooLong = true; tooLong; )
    		6
    for (boolean tooLong = true; tooLong; )
    7
    tooLong = false;
    		7
    tooLong = false;
    8
    int nNodes = alphaSize;
    		8
    int nNodes = alphaSize;
    9
    int nHeap = 0;
    		9
    int nHeap = 0;
    10
    heap[0] = 0;
    		10
    heap[0] = 0;
    11
    weight[0] = 0;
    		11
    weight[0] = 0;
    12
    parent[0] = -2;
    		12
    parent[0] = -2;
    13
    for (int i = 1; i <= alphaSize; i++)
    		13
    for (int i = 1; i <= alphaSize; i++)
    14
    parent[i] = -1;
    		14
    parent[i] = -1;
    15
    nHeap++;
    		15
    nHeap++;
    16
    heap[nHeap] = i;
    		16
    heap[nHeap] = i;
    17
    int zz = nHeap;
    		17
    int zz = nHeap;
    18
    int tmp = heap[zz];
    		18
    int tmp = heap[zz];
    19
    while (weight[tmp] < weight[heap[zz >> 1]])
    		19
    while (weight[tmp] < weight[heap[zz >> 1]])
    20
    heap[zz] = heap[zz >> 1];
    		20
    heap[zz] = heap[zz >> 1];
    21
    zz >>= 1;
    		21
    zz >>= 1;
    22
    heap[zz] = tmp;
    		22
    heap[zz] = tmp;
    23
    while (nHeap > 1)
    		23
    while (nHeap > 1)
    24
    int n1 = heap[1];
    		24
    int n1 = heap[1];
    25
    heap[1] = heap[nHeap];
    		25
    heap[1] = heap[nHeap];
    26
    nHeap--;
    		26
    nHeap--;
    27
    int yy = 0;
    		27
    int yy = 0;
    28
    int zz = 1;
    		28
    int zz = 1;
    29
    int tmp = heap[1];
    		29
    int tmp = heap[1];
    30
    while (true)
    		30
    while (true)
    31
    yy = zz << 1;
    		31
    yy = zz << 1;
    32
    if (yy > nHeap)
    		32
    if (yy > nHeap)
    33
    break;
    		33
    break;
    34
    if ((yy < nHeap) && (weight[heap[yy + 1]] < weight[heap[yy]]))
    		34
    if ((yy < nHeap) && (weight[heap[yy + 1]] < weight[heap[yy]]))
    35
    yy++;
    		35
    yy++;
    36
    if (weight[tmp] < weight[heap[yy]])
    		36
    if (weight[tmp] < weight[heap[yy]])
    37
    break;
    		37
    break;
    38
    heap[zz] = heap[yy];
    		38
    heap[zz] = heap[yy];
    39
    zz = yy;
    		39
    zz = yy;
    40
    heap[zz] = tmp;
    		40
    heap[zz] = tmp;
    41
    int n2 = heap[1];
    		41
    int n2 = heap[1];
    42
    heap[1] = heap[nHeap];
    		42
    heap[1] = heap[nHeap];
    43
    nHeap--;
    		43
    nHeap--;
    44
    yy = 0;
    		44
    yy = 0;
    45
    zz = 1;
    		45
    zz = 1;
    46
    tmp = heap[1];
    		46
    tmp = heap[1];
    47
    while (true)
    		47
    while (true)
    48
    yy = zz << 1;
    		48
    yy = zz << 1;
    49
    if (yy > nHeap)
    		49
    if (yy > nHeap)
    50
    break;
    		50
    break;
    51
    if ((yy < nHeap) && (weight[heap[yy + 1]] < weight[heap[yy]]))
    		51
    if ((yy < nHeap) && (weight[heap[yy + 1]] < weight[heap[yy]]))
    52
    yy++;
    		52
    yy++;
    53
    if (weight[tmp] < weight[heap[yy]])
    		53
    if (weight[tmp] < weight[heap[yy]])
    54
    break;
    		54
    break;
    55
    heap[zz] = heap[yy];
    		55
    heap[zz] = heap[yy];
    56
    zz = yy;
    		56
    zz = yy;
    57
    heap[zz] = tmp;
    		57
    heap[zz] = tmp;
    58
    nNodes++;
    		58
    nNodes++;
    59
    parent[n1] = parent[n2] = nNodes;
    		59
    parent[n1] = parent[n2] = nNodes;
    60
    final int weight_n1 = weight[n1];
    		60
    final int weight_n1 = weight[n1];
    61
    final int weight_n2 = weight[n2];
    		61
    final int weight_n2 = weight[n2];
    62
    weight[nNodes] = (((weight_n1 & 0xffffff00) + (weight_n2 & 0xffffff00)) | (1 + (((weight_n1 & 0x000000ff) > (weight_n2 & 0x000000ff)) ? (weight_n1 & 0x000000ff) : (weight_n2 & 0x000000ff))));
    62
    weight[nNodes] = (((weight_n1 & 0xffffff00) + (weight_n2 & 0xffffff00)) | (1 + (((weight_n1 & 0x000000ff) > (weight_n2 & 0x000000ff)) ? (weight_n1 & 0x000000ff) : (weight_n2 & 0x000000ff))));
    62
    weight[nNodes] = ((weight_n1 & 0xffffff00) + (weight_n2 & 0xffffff00)) | (1 + (((weight_n1 & 0x000000ff) > (weight_n2 & 0x000000ff)) ? (weight_n1 & 0x000000ff) : (weight_n2 & 0x000000ff)));
    Differences
    Expression1Expression2Difference
    (((weight_n1 & 0xffffff00) + (weight_n2 & 0xffffff00)) | (1 + (((weight_n1 & 0x000000ff) > (weight_n2 & 0x000000ff)) ? (weight_n1 & 0x000000ff) : (weight_n2 & 0x000000ff))))((weight_n1 & 0xffffff00) + (weight_n2 & 0xffffff00)) | (1 + (((weight_n1 & 0x000000ff) > (weight_n2 & 0x000000ff)) ? (weight_n1 & 0x000000ff) : (weight_n2 & 0x000000ff)))TYPE_COMPATIBLE_REPLACEMENT
    Preondition Violations
    Expression (((weight_n1 & 0xffffff00) + (weight_n2 & 0xffffff00)) | (1 + (((weight_n1 & 0x000000ff) > (weight_n2 & 0x000000ff)) ? (weight_n1 & 0x000000ff) : (weight_n2 & 0x000000ff)))) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression ((weight_n1 & 0xffffff00) + (weight_n2 & 0xffffff00)) | (1 + (((weight_n1 & 0x000000ff) > (weight_n2 & 0x000000ff)) ? (weight_n1 & 0x000000ff) : (weight_n2 & 0x000000ff))) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    		62
    weight[nNodes] = ((weight_n1 & 0xffffff00) + (weight_n2 & 0xffffff00)) | (1 + (((weight_n1 & 0x000000ff) > (weight_n2 & 0x000000ff)) ? (weight_n1 & 0x000000ff) : (weight_n2 & 0x000000ff)));
    63
    parent[nNodes] = -1;
    		63
    parent[nNodes] = -1;
    64
    nHeap++;
    		64
    nHeap++;
    65
    heap[nHeap] = nNodes;
    		65
    heap[nHeap] = nNodes;
    66
    tmp = 0;
    		66
    tmp = 0;
    67
    zz = nHeap;
    		67
    zz = nHeap;
    68
    tmp = heap[zz];
    		68
    tmp = heap[zz];
    69
    final int weight_tmp = weight[tmp];
    		69
    final int weight_tmp = weight[tmp];
    70
    while (weight_tmp < weight[heap[zz >> 1]])
    		70
    while (weight_tmp < weight[heap[zz >> 1]])
    71
    heap[zz] = heap[zz >> 1];
    		71
    heap[zz] = heap[zz >> 1];
    72
    zz >>= 1;
    		72
    zz >>= 1;
    73
    heap[zz] = tmp;
    		73
    heap[zz] = tmp;
    74
    for (int i = 1; i <= alphaSize; i++)
    		74
    for (int i = 1; i <= alphaSize; i++)
    75
    int j = 0;
    		75
    int j = 0;
    76
    int k = i;
    		76
    int k = i;
    77
    for (int parent_k; (parent_k = parent[k]) >= 0; )
    		77
    for (int parent_k; (parent_k = parent[k]) >= 0; )
    78
    k = parent_k;
    		78
    k = parent_k;
    79
    j++;
    		79
    j++;
                                                  
    80
    len[i - 1] = (byte)j;
    Preondition Violations
    Unmatched statement len[i - 1]=(byte)j; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    		80
    len[i - 1] = (byte)j;
    80
    len[i - 1] = (char)j;
    80
    len[i - 1] = (char)j;
    Preondition Violations
    Unmatched statement len[i - 1]=(char)j; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
                                                  
    81
    if (j > maxLen)
    		81
    if (j > maxLen)
    82
    tooLong = true;
    		82
    tooLong = true;
    83
    if (tooLong)
    		83
    if (tooLong)
    84
    for (int i = 1; i < alphaSize; i++)
    		84
    for (int i = 1; i < alphaSize; i++)
    85
    int j = weight[i] >> 8;
    		85
    int j = weight[i] >> 8;
    86
    j = 1 + (j >> 1);
    		86
    j = 1 + (j >> 1);
    87
    weight[i] = j << 8;
    		87
    weight[i] = j << 8;
    
				    
			
    
			
    
				Precondition Violations (5)
				
					
    
						Row
						Violation
					
    
					
    1Expression (((weight_n1 & 0xffffff00) + (weight_n2 & 0xffffff00)) | (1 + (((weight_n1 & 0x000000ff) > (weight_n2 & 0x000000ff)) ? (weight_n1 & 0x000000ff) : (weight_n2 & 0x000000ff)))) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    2Expression ((weight_n1 & 0xffffff00) + (weight_n2 & 0xffffff00)) | (1 + (((weight_n1 & 0x000000ff) > (weight_n2 & 0x000000ff)) ? (weight_n1 & 0x000000ff) : (weight_n2 & 0x000000ff))) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    3Unmatched statement len[i - 1]=(byte)j; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    4Unmatched statement len[i - 1]=(char)j; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    5Clone fragment #1 returns variables i, j , while Clone fragment #2 returns variables i, j
    
				    
			
    
			
    2.