Searched refs:ak (Results 1 - 1 of 1) sorted by relevance

/haiku/src/system/libroot/posix/stdlib/
H A Dradixsort.c132 const u_char **ak, *r; local
151 for (ak = a; ak < an;) {
152 c = tr[(*ak++)[i]];
186 top[0] = ak = a + count[0];
188 ak = a;
199 push(ak, *cp, i+1);
201 top[cp-count] = ak += *cp;
211 * ak = top[r[i]] = location to put the next element.
214 * Once the 1st disordered bin is done, ie. aj >= ak,
231 const u_char **ak, **ai; local
299 const u_char **ak, **ai, *s, *t; local
[all...]

Completed in 30 milliseconds