Lines Matching defs:slot
80 int s, slot = 0;
84 // Keep track of the nearest neighbour 'slot'
85 while (slot < num_levels - 1 &&
86 2 * s > inv_q_level[slot] + inv_q_level[slot + 1]) {
87 ++slot;
90 q_sum[slot] += s * freq[s];
91 q_count[slot] += freq[s];
93 q_level[s] = slot;
98 for (slot = 1; slot < num_levels - 1; ++slot) {
99 const double count = q_count[slot];
101 inv_q_level[slot] = q_sum[slot] / count;
122 // once for all before remapping. We also perform the data[] -> slot
128 const int slot = q_level[s];
129 map[s] = (uint8_t)(inv_q_level[slot] + .5);
