Lines Matching defs:size
46 static void heap_sift(HeapElem *h, int root, int size)
48 while (root * 2 + 1 < size) {
50 if (child < size - 1 && h[child].val > h[child+1].val)
67 int size = 0;
78 map[size++] = i;
82 for (i=0; i < size; i++) {
86 for (i = size / 2 - 1; i >= 0; i--)
87 heap_sift(h, i, size);
89 for (next = size; next < size * 2 - 1; next++) {
94 heap_sift(h, 0, size);
98 heap_sift(h, 0, size);
101 len[2 * size - 2] = 0;
102 for (i = 2 * size - 3; i >= size; i--)
104 for (i = 0; i < size; i++) {
108 if (i==size) break;
156 * nodes size must be 2*nb_codes