81 long int size,
long int sortlo,
long int sorthi);
120#define is(i) (i->size)
128#define ib(i) (*i->abspos)
136#define ie(i) (i->size+*i->abspos)
143#define iv(i) (i->vector)
158#define ipos(i,l) (l-i->revindex)
struct sort_link sort_link_t
struct sort_info sort_info_t
sort_link_t * sort_nextmatch(sort_info_t *i, sort_link_t *prev)
Definition: isort.c:289
void sort_free(sort_info_t *i)
Definition: isort.c:118
sort_info_t * sort_alloc(long int size)
sort_link_t * sort_getmatch(sort_info_t *i, long post, long overlap, int value)
Definition: isort.c:232
void sort_unsortall(sort_info_t *i)
Definition: isort.c:85
void sort_setup(sort_info_t *i, int16_t *vector, long int *abspos, long int size, long int sortlo, long int sorthi)
Definition: isort.c:199
long lo
Definition: isort.h:37
long sortbegin
Definition: isort.h:36
int val
Definition: isort.h:38
long * abspos
Definition: isort.h:31
int16_t * vector
Definition: isort.h:29
sort_link_t * revindex
Definition: isort.h:45
long maxsize
Definition: isort.h:34
sort_link_t ** head
Definition: isort.h:41
long size
Definition: isort.h:32
long lastbucket
Definition: isort.h:44
long * bucketusage
Definition: isort.h:43
long hi
Definition: isort.h:37
struct sort_link * next
Definition: isort.h:25