Lines Matching refs:saidx_t
34 saidx_t
35 binarysearch_lower(const saidx_t *A, saidx_t size, saidx_t value) {
36 saidx_t half, i;
53 bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *SA,
54 saidx_t n, saidx_t *idx) {
55 saidx_t *A, i, j, p, t;
112 inverse_bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *A,
113 saidx_t n, saidx_t idx) {
114 saidx_t C[ALPHABET_SIZE];
116 saidx_t *B;
117 saidx_t i, p;
128 /* Allocate n*sizeof(saidx_t) bytes of memory. */
129 if((B = (saidx_t *)malloc((size_t)n * sizeof(saidx_t))) == NULL) { return -2; }
161 sufcheck(const sauchar_t *T, const saidx_t *SA,
162 saidx_t n, saint_t verbose) {
163 saidx_t C[ALPHABET_SIZE];
164 saidx_t i, p, q, t;
246 _compare(const sauchar_t *T, saidx_t Tsize,
247 const sauchar_t *P, saidx_t Psize,
248 saidx_t suf, saidx_t *match) {
249 saidx_t i, j;
258 saidx_t
259 sa_search(const sauchar_t *T, saidx_t Tsize,
260 const sauchar_t *P, saidx_t Psize,
261 const saidx_t *SA, saidx_t SAsize,
262 saidx_t *idx) {
263 saidx_t size, lsize, rsize, half;
264 saidx_t match, lmatch, rmatch;
265 saidx_t llmatch, lrmatch, rlmatch, rrmatch;
266 saidx_t i, j, k;
328 saidx_t
329 sa_simplesearch(const sauchar_t *T, saidx_t Tsize,
330 const saidx_t *SA, saidx_t SAsize,
331 saint_t c, saidx_t *idx) {
332 saidx_t size, lsize, rsize, half;
333 saidx_t i, j, k, p;
