Home
last modified time | relevance | path

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

/external/libdivsufsort/lib/
Ddivsufsort.c69 ++BUCKET_B(c0, c1); in sort_typeBstar()
84 i = t + BUCKET_B(c0, c0); in sort_typeBstar()
88 i += BUCKET_B(c0, c1); in sort_typeBstar()
172 BUCKET_B(ALPHABET_SIZE - 1, ALPHABET_SIZE - 1) = n; /* end point */ in sort_typeBstar()
176 t = i - BUCKET_B(c0, c1); in sort_typeBstar()
177 BUCKET_B(c0, c1) = i; /* end point */ 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()
219 if(0 <= c2) { BUCKET_B(c2, c1) = k - SA; } in construct_SA()
220 k = SA + BUCKET_B(c2 = c0, c1); in construct_SA()
[all …]
/external/libdivsufsort/include/
Ddivsufsort_private.h183 #define BUCKET_B(_c0, _c1) (bucket_B[((_c1) << 8) | (_c0)]) macro
186 #define BUCKET_B(_c0, _c1) (bucket_B[(_c1) * ALPHABET_SIZE + (_c0)])
/external/zstd/lib/dictBuilder/
Ddivsufsort.c130 #define BUCKET_B(_c0, _c1) (bucket_B[((_c1) << 8) | (_c0)]) macro
133 #define BUCKET_B(_c0, _c1) (bucket_B[(_c1) * ALPHABET_SIZE + (_c0)]) macro
1472 ++BUCKET_B(c0, c1); in sort_typeBstar()
1487 i = t + BUCKET_B(c0, c0); in sort_typeBstar()
1491 i += BUCKET_B(c0, c1); in sort_typeBstar()
1590 BUCKET_B(ALPHABET_SIZE - 1, ALPHABET_SIZE - 1) = n; /* end point */ in sort_typeBstar()
1594 t = i - BUCKET_B(c0, c1); in sort_typeBstar()
1595 BUCKET_B(c0, c1) = i; /* end point */ in sort_typeBstar()
1602 BUCKET_BSTAR(c0, c0 + 1) = i - BUCKET_B(c0, c0) + 1; /* start point */ in sort_typeBstar()
1603 BUCKET_B(c0, c0) = i; /* end point */ in sort_typeBstar()
[all …]