HomeSort by relevance Sort by last modified time
    Searched refs:ALPHABET_SIZE (Results 1 - 3 of 3) sorted by null

  /external/libdivsufsort/include/
divsufsort_private.h 89 #if defined(ALPHABET_SIZE) && (ALPHABET_SIZE < 1)
90 # undef ALPHABET_SIZE
92 #if !defined(ALPHABET_SIZE)
93 # define ALPHABET_SIZE (UINT8_MAX + 1)
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)]
    [all...]
  /external/libdivsufsort/lib/
divsufsort.c 81 for(c0 = 0, i = 0, j = 0; c0 < ALPHABET_SIZE; ++c0) {
85 for(c1 = c0 + 1; c1 < ALPHABET_SIZE; ++c1) {
106 c0 = ALPHABET_SIZE - 2, c1 = ALPHABET_SIZE - 1, j = m;
120 d1 = ALPHABET_SIZE - 1;
134 for(c0 = ALPHABET_SIZE - 2, j = m; 0 < j; --c0) {
135 for(c1 = ALPHABET_SIZE - 1; c0 < c1; j = i, --c1) {
172 BUCKET_B(ALPHABET_SIZE - 1, ALPHABET_SIZE - 1) = n; /* end point */
173 for(c0 = ALPHABET_SIZE - 2, k = m - 1; 0 <= c0; --c0)
    [all...]
utils.c 114 saidx_t C[ALPHABET_SIZE];
115 sauchar_t D[ALPHABET_SIZE];
133 for(c = 0; c < ALPHABET_SIZE; ++c) { C[c] = 0; }
135 for(c = 0, d = 0, i = 0; c < ALPHABET_SIZE; ++c) {
163 saidx_t C[ALPHABET_SIZE];
205 for(i = 0; i < ALPHABET_SIZE; ++i) { C[i] = 0; }
207 for(i = 0, p = 0; i < ALPHABET_SIZE; ++i) {

Completed in 109 milliseconds