Home
last modified time | relevance | path

Searched refs:ALPHABET_SIZE (Results 1 – 3 of 3) sorted by relevance

/external/libdivsufsort/include/
Ddivsufsort_private.h89 #if defined(ALPHABET_SIZE) && (ALPHABET_SIZE < 1)
90 # undef ALPHABET_SIZE
92 #if !defined(ALPHABET_SIZE)
93 # define ALPHABET_SIZE (UINT8_MAX + 1) macro
96 #define BUCKET_A_SIZE (ALPHABET_SIZE)
97 #define BUCKET_B_SIZE (ALPHABET_SIZE * ALPHABET_SIZE)
182 #if ALPHABET_SIZE == 256
186 #define BUCKET_B(_c0, _c1) (bucket_B[(_c1) * ALPHABET_SIZE + (_c0)])
187 #define BUCKET_BSTAR(_c0, _c1) (bucket_B[(_c0) * ALPHABET_SIZE + (_c1)])
/external/libdivsufsort/lib/
Ddivsufsort.c81 for(c0 = 0, i = 0, j = 0; c0 < ALPHABET_SIZE; ++c0) { in sort_typeBstar()
85 for(c1 = c0 + 1; c1 < ALPHABET_SIZE; ++c1) { in sort_typeBstar()
106 c0 = ALPHABET_SIZE - 2, c1 = ALPHABET_SIZE - 1, j = m; in sort_typeBstar()
120 d1 = ALPHABET_SIZE - 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()
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()
175 for(c1 = ALPHABET_SIZE - 1; c0 < c1; --c1) { in sort_typeBstar()
205 for(c1 = ALPHABET_SIZE - 2; 0 <= c1; --c1) { in construct_SA()
[all …]
Dutils.c114 saidx_t C[ALPHABET_SIZE]; in inverse_bw_transform()
115 sauchar_t D[ALPHABET_SIZE]; in inverse_bw_transform()
133 for(c = 0; c < ALPHABET_SIZE; ++c) { C[c] = 0; } in inverse_bw_transform()
135 for(c = 0, d = 0, i = 0; c < ALPHABET_SIZE; ++c) { in inverse_bw_transform()
163 saidx_t C[ALPHABET_SIZE]; in sufcheck()
205 for(i = 0; i < ALPHABET_SIZE; ++i) { C[i] = 0; } in sufcheck()
207 for(i = 0, p = 0; i < ALPHABET_SIZE; ++i) { in sufcheck()