sort_level
add_to_sublevel(struct sort_level *sl, struct sort_list_item *item, size_t indx)
struct sort_level *ssl;
ssl = sort_calloc(1, sizeof(struct sort_level));
add_leaf(struct sort_level *sl, struct sort_list_item *item)
place_item(struct sort_level *sl, size_t item)
free_sort_level(struct sort_level *sl)
struct sort_level *slc;
run_sort_level_next(struct sort_level *sl)
struct sort_level *slc;
struct sort_level *slc;
run_top_sort_level(struct sort_level *sl)
struct sort_level *slc;
struct sort_level *sl;
sl = sort_calloc(1, sizeof(struct sort_level));
static const size_t slsz = 256 * sizeof(struct sort_level *);
struct sort_level **sublevels;
struct sort_level *sl;
push_ls(struct sort_level *sl)
static inline struct sort_level *
struct sort_level *sl;