Home
last modified time | relevance | path

Searched refs:bucket_B (Results 1 – 2 of 2) sorted by relevance

/external/libdivsufsort/lib/
Ddivsufsort.c39 saidx_t *bucket_A, saidx_t *bucket_B, in sort_typeBstar() argument
55 for(i = 0; i < BUCKET_B_SIZE; ++i) { bucket_B[i] = 0; } in sort_typeBstar()
196 saidx_t *bucket_A, saidx_t *bucket_B, in construct_SA() argument
260 saidx_t *bucket_A, saidx_t *bucket_B, in construct_BWT() argument
333 saidx_t *bucket_A, *bucket_B; in divsufsort() local
344 bucket_B = (saidx_t *)malloc(BUCKET_B_SIZE * sizeof(saidx_t)); in divsufsort()
347 if((bucket_A != NULL) && (bucket_B != NULL)) { in divsufsort()
348 m = sort_typeBstar(T, SA, bucket_A, bucket_B, n); in divsufsort()
349 construct_SA(T, SA, bucket_A, bucket_B, n, m); in divsufsort()
354 free(bucket_B); in divsufsort()
[all …]
/external/libdivsufsort/include/
Ddivsufsort_private.h183 #define BUCKET_B(_c0, _c1) (bucket_B[((_c1) << 8) | (_c0)])
184 #define BUCKET_BSTAR(_c0, _c1) (bucket_B[((_c0) << 8) | (_c1)])
186 #define BUCKET_B(_c0, _c1) (bucket_B[(_c1) * ALPHABET_SIZE + (_c0)])
187 #define BUCKET_BSTAR(_c0, _c1) (bucket_B[(_c0) * ALPHABET_SIZE + (_c1)])