Lines Matching +full:1 +full:c0
47 saint_t c0, c1; in sort_typeBstar() local
60 for(i = n - 1, m = n, c0 = T[n - 1]; 0 <= i;) { in sort_typeBstar()
62 do { ++BUCKET_A(c1 = c0); } while((0 <= --i) && ((c0 = T[i]) >= c1)); in sort_typeBstar()
65 ++BUCKET_BSTAR(c0, c1); in sort_typeBstar()
68 for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) <= c1); --i, c1 = c0) { in sort_typeBstar()
69 ++BUCKET_B(c0, c1); in sort_typeBstar()
81 for(c0 = 0, i = 0, j = 0; c0 < ALPHABET_SIZE; ++c0) { in sort_typeBstar()
82 t = i + BUCKET_A(c0); in sort_typeBstar()
83 BUCKET_A(c0) = i + j; /* start point */ in sort_typeBstar()
84 i = t + BUCKET_B(c0, c0); in sort_typeBstar()
85 for(c1 = c0 + 1; c1 < ALPHABET_SIZE; ++c1) { in sort_typeBstar()
86 j += BUCKET_BSTAR(c0, c1); in sort_typeBstar()
87 BUCKET_BSTAR(c0, c1) = j; /* end point */ in sort_typeBstar()
88 i += BUCKET_B(c0, c1); in sort_typeBstar()
96 t = PAb[i], c0 = T[t], c1 = T[t + 1]; in sort_typeBstar()
97 SA[--BUCKET_BSTAR(c0, c1)] = i; in sort_typeBstar()
99 t = PAb[m - 1], c0 = T[t], c1 = T[t + 1]; in sort_typeBstar()
100 SA[--BUCKET_BSTAR(c0, c1)] = m - 1; in sort_typeBstar()
106 c0 = ALPHABET_SIZE - 2, c1 = ALPHABET_SIZE - 1, j = m; in sort_typeBstar()
116 d0 = c0, d1 = c1; in sort_typeBstar()
120 d1 = ALPHABET_SIZE - 1; in sort_typeBstar()
123 } while(((l - k) <= 1) && (0 < (l = k))); in sort_typeBstar()
124 c0 = d0, c1 = d1, j = k; in sort_typeBstar()
129 curbuf, bufsize, 2, n, *(SA + k) == (m - 1)); in sort_typeBstar()
134 for(c0 = ALPHABET_SIZE - 2, j = m; 0 < j; --c0) { in sort_typeBstar()
135 for(c1 = ALPHABET_SIZE - 1; c0 < c1; j = i, --c1) { in sort_typeBstar()
136 i = BUCKET_BSTAR(c0, c1); in sort_typeBstar()
137 if(1 < (j - i)) { in sort_typeBstar()
139 buf, bufsize, 2, n, *(SA + i) == (m - 1)); in sort_typeBstar()
146 for(i = m - 1; 0 <= i; --i) { in sort_typeBstar()
150 SA[i + 1] = i - j; in sort_typeBstar()
159 trsort(ISAb, SA, m, 1); in sort_typeBstar()
162 for(i = n - 1, j = m, c0 = T[n - 1]; 0 <= i;) { in sort_typeBstar()
163 for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) >= c1); --i, c1 = c0) { } in sort_typeBstar()
166 for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) <= c1); --i, c1 = c0) { } in sort_typeBstar()
167 SA[ISAb[--j]] = ((t == 0) || (1 < (t - i))) ? t : ~t; in sort_typeBstar()
172 BUCKET_B(ALPHABET_SIZE - 1, ALPHABET_SIZE - 1) = n; /* end point */ in sort_typeBstar()
173 for(c0 = ALPHABET_SIZE - 2, k = m - 1; 0 <= c0; --c0) { in sort_typeBstar()
174 i = BUCKET_A(c0 + 1) - 1; in sort_typeBstar()
175 for(c1 = ALPHABET_SIZE - 1; c0 < c1; --c1) { in sort_typeBstar()
176 t = i - BUCKET_B(c0, c1); in sort_typeBstar()
177 BUCKET_B(c0, c1) = i; /* end point */ in sort_typeBstar()
180 for(i = t, j = BUCKET_BSTAR(c0, c1); in sort_typeBstar()
184 BUCKET_BSTAR(c0, c0 + 1) = i - BUCKET_B(c0, c0) + 1; /* start point */ in sort_typeBstar()
185 BUCKET_B(c0, c0) = i; /* end point */ in sort_typeBstar()
200 saint_t c0, c1, c2; in construct_SA() local
207 for(i = SA + BUCKET_BSTAR(c1, c1 + 1), in construct_SA()
208 j = SA + BUCKET_A(c1 + 1) - 1, k = NULL, c2 = -1; in construct_SA()
213 assert(((s + 1) < n) && (T[s] <= T[s + 1])); in construct_SA()
214 assert(T[s - 1] <= T[s]); in construct_SA()
216 c0 = T[--s]; in construct_SA()
217 if((0 < s) && (T[s - 1] > c0)) { s = ~s; } in construct_SA()
218 if(c0 != c2) { in construct_SA()
220 k = SA + BUCKET_B(c2 = c0, c1); in construct_SA()
234 k = SA + BUCKET_A(c2 = T[n - 1]); in construct_SA()
235 *k++ = (T[n - 2] < c2) ? ~(n - 1) : (n - 1); in construct_SA()
239 assert(T[s - 1] >= T[s]); in construct_SA()
240 c0 = T[--s]; in construct_SA()
241 if((s == 0) || (T[s - 1] < c0)) { s = ~s; } in construct_SA()
242 if(c0 != c2) { in construct_SA()
244 k = SA + BUCKET_A(c2 = c0); in construct_SA()
264 saint_t c0, c1, c2; in construct_BWT() local
271 for(i = SA + BUCKET_BSTAR(c1, c1 + 1), in construct_BWT()
272 j = SA + BUCKET_A(c1 + 1) - 1, k = NULL, c2 = -1; in construct_BWT()
277 assert(((s + 1) < n) && (T[s] <= T[s + 1])); in construct_BWT()
278 assert(T[s - 1] <= T[s]); in construct_BWT()
279 c0 = T[--s]; in construct_BWT()
280 *j = ~((saidx_t)c0); in construct_BWT()
281 if((0 < s) && (T[s - 1] > c0)) { s = ~s; } in construct_BWT()
282 if(c0 != c2) { in construct_BWT()
284 k = SA + BUCKET_B(c2 = c0, c1); in construct_BWT()
301 k = SA + BUCKET_A(c2 = T[n - 1]); in construct_BWT()
302 *k++ = (T[n - 2] < c2) ? ~((saidx_t)T[n - 2]) : (n - 1); in construct_BWT()
306 assert(T[s - 1] >= T[s]); in construct_BWT()
307 c0 = T[--s]; in construct_BWT()
308 *i = c0; in construct_BWT()
309 if((0 < s) && (T[s - 1] < c0)) { s = ~((saidx_t)T[s - 1]); } in construct_BWT()
310 if(c0 != c2) { in construct_BWT()
312 k = SA + BUCKET_A(c2 = c0); in construct_BWT()
338 if((T == NULL) || (SA == NULL) || (n < 0)) { return -1; } in divsufsort()
340 else if(n == 1) { SA[0] = 0; return 0; } in divsufsort()
341 else if(n == 2) { m = (T[0] < T[1]); SA[m ^ 1] = 0, SA[m] = 1; return 0; } in divsufsort()
367 if((T == NULL) || (U == NULL) || (n < 0)) { return -1; } in divbwt()
368 else if(n <= 1) { if(n == 1) { U[0] = T[0]; } return n; } in divbwt()
370 if((B = A) == NULL) { B = (saidx_t *)malloc((size_t)(n + 1) * sizeof(saidx_t)); } in divbwt()
380 U[0] = T[n - 1]; in divbwt()
381 for(i = 0; i < pidx; ++i) { U[i + 1] = (sauchar_t)B[i]; } in divbwt()
382 for(i += 1; i < n; ++i) { U[i] = (sauchar_t)B[i]; } in divbwt()
383 pidx += 1; in divbwt()