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

/haiku/src/system/libroot/posix/stdlib/
H A Dradixsort.c135 const u_char **an, *t, **aj, **top[256]; local
208 * before aj, and in bin[c], items from top[c] on.
212 * aj = bottom of 1st disordered bin.
214 * Once the 1st disordered bin is done, ie. aj >= ak,
215 * aj<-aj + count[c] connects the bins in a linked list;
218 for (aj = a; aj < an; *aj = r, aj
[all...]

Completed in 30 milliseconds