Lines Matching defs:ak
153 const u_char **ak, *r;
175 for (ak = a; ak < an;) {
176 c = tr[(*ak++)[i]];
199 top[0] = ak = a + count[0];
201 ak = a;
212 push(ak, *cp, i+1);
214 top[cp-count] = ak += *cp;
224 * ak = top[r[i]] = location to put the next element.
227 * Once the 1st disordered bin is done, ie. aj >= ak,
232 for (r = *aj; aj < (ak = --top[c = tr[r[i]]]);)
233 swap(*ak, r, t);
244 const u_char **ak, **ai;
264 for (ak = a + n; --ak >= a;) {
265 c = tr[(*ak)[i]];
281 top[0] = ak = a + count[0];
284 ak = a;
296 push(ak, c, i+1);
298 top[cp-count] = ak += c;
304 for (ak = ta + n, ai = a+n; ak > ta;) /* Copy to temp. */
305 *--ak = *--ai;
306 for (ak = ta+n; --ak >= ta;) /* Deal to piles. */
307 *--top[tr[(*ak)[i]]] = *ak;
316 const u_char **ak, **ai, *s, *t;
321 for (ak = a+1; --n >= 1; ak++)
322 for (ai = ak; ai > a; ai--) {
Indexes created Mon Sep 29 21:09:56 GMT 2025