2
* CopyPolicy: GNU Public License 2 applies
3
* Copyright (C) by Monty (xiphmont@mit.edu)
9
typedef struct sort_link{
10
struct sort_link *next;
13
typedef struct sort_info{
14
int16_t *vector; /* vector (storage doesn't belong to us) */
16
long *abspos; /* pointer for side effects */
17
long size; /* vector size */
19
long maxsize; /* maximum vector size */
21
long sortbegin; /* range of contiguous sorted area */
22
long lo,hi; /* current post, overlap range */
23
int val; /* ...and val */
26
sort_link **head; /* sort buckets (65536) */
28
long *bucketusage; /* of used buckets (65536) */
34
extern sort_info *sort_alloc(long size);
35
extern void sort_unsortall(sort_info *i);
36
extern void sort_setup(sort_info *i,int16_t *vector,long *abspos,long size,
37
long sortlo, long sorthi);
38
extern void sort_free(sort_info *i);
39
extern sort_link *sort_getmatch(sort_info *i,long post,long overlap,int value);
40
extern sort_link *sort_nextmatch(sort_info *i,sort_link *prev);
42
#define is(i) (i->size)
43
#define ib(i) (*i->abspos)
44
#define ie(i) (i->size+*i->abspos)
45
#define iv(i) (i->vector)
46
#define ipos(i,l) (l-i->revindex)