Lines Matching refs:ISA
264 tr_copy(saidx_t *ISA, const saidx_t *SA,
274 if((0 <= (s = *c - depth)) && (ISA[s] == v)) {
276 ISA[s] = d - SA;
280 if((0 <= (s = *c - depth)) && (ISA[s] == v)) {
282 ISA[s] = d - SA;
289 tr_partialcopy(saidx_t *ISA, const saidx_t *SA,
299 if((0 <= (s = *c - depth)) && (ISA[s] == v)) {
301 rank = ISA[s + depth];
303 ISA[s] = newrank;
309 rank = ISA[*e];
311 if(newrank != rank) { ISA[*e] = newrank; }
316 if((0 <= (s = *c - depth)) && (ISA[s] == v)) {
318 rank = ISA[s + depth];
320 ISA[s] = newrank;
327 tr_introsort(saidx_t *ISA, const saidx_t *ISAd,
335 saidx_t incr = ISAd - ISA;
348 for(c = first, v = a - SA - 1; c < a; ++c) { ISA[*c] = v; }
351 for(c = a, v = b - SA - 1; c < b; ++c) { ISA[*c] = v; }
383 tr_copy(ISA, SA, first, a, b, last, ISAd - ISA);
386 tr_partialcopy(ISA, SA, first, a, b, last, ISAd - ISA);
393 do { ISA[*a] = a - SA; } while((++a < last) && (0 <= *a));
398 next = (ISA[*a] != ISAd[*a]) ? tr_ilg(a - first + 1) : -1;
399 if(++a < last) { for(b = first, v = a - SA - 1; b < a; ++b) { ISA[*b] = v; } }
452 next = (ISA[*a] != v) ? tr_ilg(b - a) : -1;
455 for(c = first, v = a - SA - 1; c < a; ++c) { ISA[*c] = v; }
456 if(b < last) { for(c = a, v = b - SA - 1; c < b; ++c) { ISA[*c] = v; } }
555 trsort(saidx_t *ISA, saidx_t *SA, saidx_t n, saidx_t depth) {
563 for(ISAd = ISA + depth; -n < *SA; ISAd += ISAd - ISA) {
571 last = SA + ISA[t] + 1;
574 tr_introsort(ISA, ISAd, SA, first, last, &budget);
