Lines Matching refs:from
61 * 3. merge the 2 symbols of least score and put them in list(i+1), and remove them from list(i). The new score will be the sum of the 2 scores
79 PackageMergerList list_a, list_b, *to = &list_a, *from = &list_b, *temp;
90 from->nitems = 0;
92 from->item_idx[0] = 0;
105 while (i < size || j + 1 < from->nitems) {
109 (j + 1 >= from->nitems ||
111 from->probability[j] + from->probability[j + 1])) {
116 for (k = from->item_idx[j]; k < from->item_idx[j + 2]; k++) {
117 to->items[to->item_idx[to->nitems]++] = from->items[k];
120 from->probability[j] + from->probability[j + 1];
125 to = from;
126 from = temp;
129 min = (size - 1 < from->nitems) ? size - 1 : from->nitems;
130 for (i = 0; i < from->item_idx[min]; i++) {
131 nbits[from->items[i]]++;