Lines Matching full:ak
128 const u_char **ak, *r; in r_sort_a() local
147 for (ak = a; ak < an;) { in r_sort_a()
148 c = tr[(*ak++)[i]]; in r_sort_a()
182 top[0] = ak = a + count[0]; in r_sort_a()
184 ak = a; in r_sort_a()
195 push(ak, *cp, i+1); in r_sort_a()
197 top[cp-count] = ak += *cp; in r_sort_a()
207 * ak = top[r[i]] = location to put the next element. in r_sort_a()
210 * Once the 1st disordered bin is done, ie. aj >= ak, in r_sort_a()
215 for (r = *aj; aj < (ak = --top[c = tr[r[i]]]);) in r_sort_a()
216 swap(*ak, r, t); in r_sort_a()
227 const u_char **ak, **ai; in r_sort_b() local
243 for (ak = a + n; --ak >= a;) { in r_sort_b()
244 c = tr[(*ak)[i]]; in r_sort_b()
260 top[0] = ak = a + count[0]; in r_sort_b()
263 ak = a; in r_sort_b()
275 push(ak, c, i+1); in r_sort_b()
277 top[cp-count] = ak += c; in r_sort_b()
283 for (ak = ta + n, ai = a+n; ak > ta;) /* Copy to temp. */ in r_sort_b()
284 *--ak = *--ai; in r_sort_b()
285 for (ak = ta+n; --ak >= ta;) /* Deal to piles. */ in r_sort_b()
286 *--top[tr[(*ak)[i]]] = *ak; in r_sort_b()
295 const u_char **ak, **ai, *s, *t; in simplesort() local
297 for (ak = a+1; --n >= 1; ak++) in simplesort()
298 for (ai = ak; ai > a; ai--) { in simplesort()