78    int i,j,k,used;  in vq_nbest()  local
92          for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)  in vq_nbest()
94             best_dist[k]=best_dist[k-1];  in vq_nbest()
95             nbest[k] = nbest[k-1];  in vq_nbest()
97          best_dist[k]=dist;  in vq_nbest()
98          nbest[k]=i;  in vq_nbest()
112    int i,j,k, sign, used;  in vq_nbest_sign()  local
134          for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)  in vq_nbest_sign()
136             best_dist[k]=best_dist[k-1];  in vq_nbest_sign()
137             nbest[k] = nbest[k-1];  in vq_nbest_sign()
139          best_dist[k]=dist;  in vq_nbest_sign()
140          nbest[k]=i;  in vq_nbest_sign()
143             nbest[k]+=entries;  in vq_nbest_sign()