| /external/libdivsufsort/android_include/ |
| divsufsort.h | 45 #ifndef SAUCHAR_T
46 #define SAUCHAR_T
47 typedef uint8_t sauchar_t; typedef
48 #endif /* SAUCHAR_T */
76 divsufsort(const sauchar_t *T, saidx_t *SA, saidx_t n);
88 divbwt(const sauchar_t *T, sauchar_t *U, saidx_t *A, saidx_t n);
110 bw_transform(const sauchar_t *T, sauchar_t *U,
125 inverse_bw_transform(const sauchar_t *T, sauchar_t *U
[all...] |
| divsufsort64.h | 45 #ifndef SAUCHAR_T
46 #define SAUCHAR_T
47 typedef uint8_t sauchar_t; typedef
48 #endif /* SAUCHAR_T */
76 divsufsort64(const sauchar_t *T, saidx64_t *SA, saidx64_t n);
88 divbwt64(const sauchar_t *T, sauchar_t *U, saidx64_t *A, saidx64_t n);
110 bw_transform64(const sauchar_t *T, sauchar_t *U,
125 inverse_bw_transform64(const sauchar_t *T, sauchar_t *U
[all...] |
| /external/libdivsufsort/include/ |
| divsufsort.h.cmake | 45 #ifndef SAUCHAR_T
46 #define SAUCHAR_T
47 typedef @SAUCHAR_TYPE@ sauchar_t;
48 #endif /* SAUCHAR_T */
76 divsufsort@W64BIT@(const sauchar_t *T, saidx@W64BIT@_t *SA, saidx@W64BIT@_t n);
88 divbwt@W64BIT@(const sauchar_t *T, sauchar_t *U, saidx@W64BIT@_t *A, saidx@W64BIT@_t n);
110 bw_transform@W64BIT@(const sauchar_t *T, sauchar_t *U,
125 inverse_bw_transform@W64BIT@(const sauchar_t *T, sauchar_t *U
[all...] |
| divsufsort_private.h | 194 sssort(const sauchar_t *Td, const saidx_t *PA,
|
| /external/libdivsufsort/examples/ |
| sasearch.c | 71 sauchar_t *T;
112 T = (sauchar_t *)malloc((size_t)n * sizeof(sauchar_t));
120 if(fread(T, sizeof(sauchar_t), (size_t)n, fp) != (size_t)n) {
154 (const sauchar_t *)P, (saidx_t)Psize,
|
| suftest.c | 72 sauchar_t *T;
128 T = (sauchar_t *)malloc((size_t)n * sizeof(sauchar_t));
136 if(fread(T, sizeof(sauchar_t), (size_t)n, fp) != (size_t)n) {
|
| unbwt.c | 84 sauchar_t *T;
154 T = (sauchar_t *)malloc(blocksize * sizeof(sauchar_t));
165 if((m != 4) || ((m = fread(T, sizeof(sauchar_t), blocksize, fp)) == 0)) {
183 if(fwrite(T, sizeof(sauchar_t), m, ofp) != m) {
|
| mksary.c | 72 sauchar_t *T;
152 T = (sauchar_t *)malloc((size_t)n * sizeof(sauchar_t));
160 if(fread(T, sizeof(sauchar_t), (size_t)n, fp) != (size_t)n) {
|
| bwt.c | 82 sauchar_t *T;
168 T = (sauchar_t *)malloc(blocksize * sizeof(sauchar_t));
184 for(n = 0; 0 < (m = fread(T, sizeof(sauchar_t), blocksize, fp)); n += m) {
196 (fwrite(T, sizeof(sauchar_t), m, ofp) != m)) {
|
| /external/libdivsufsort/lib/ |
| utils.c | 53 bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *SA,
80 U[j] = (j <= p) ? T[p] : (sauchar_t)A[p];
90 U[j] = (j <= p) ? T[p] : (sauchar_t)A[p];
112 inverse_bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *A,
115 sauchar_t D[ALPHABET_SIZE];
139 D[d++] = (sauchar_t)c;
161 sufcheck(const sauchar_t *T, const saidx_t *SA,
246 _compare(const sauchar_t *T, saidx_t Tsize
[all...] |
| divsufsort.c | 38 sort_typeBstar(const sauchar_t *T, saidx_t *SA,
195 construct_SA(const sauchar_t *T, saidx_t *SA,
259 construct_BWT(const sauchar_t *T, saidx_t *SA,
332 divsufsort(const sauchar_t *T, saidx_t *SA, saidx_t n) {
361 divbwt(const sauchar_t *T, sauchar_t *U, saidx_t *A, saidx_t n) {
381 for(i = 0; i < pidx; ++i) { U[i + 1] = (sauchar_t)B[i]; }
382 for(i += 1; i < n; ++i) { U[i] = (sauchar_t)B[i]; }
|
| sssort.c | 141 ss_compare(const sauchar_t *T,
144 const sauchar_t *U1, *U2, *U1n, *U2n;
167 ss_insertionsort(const sauchar_t *T, const saidx_t *PA,
192 ss_fixdown(const sauchar_t *Td, const saidx_t *PA,
209 ss_heapsort(const sauchar_t *Td, const saidx_t *PA, saidx_t *SA, saidx_t size) {
234 ss_median3(const sauchar_t *Td, const saidx_t *PA,
248 ss_median5(const sauchar_t *Td, const saidx_t *PA,
263 ss_pivot(const sauchar_t *Td, const saidx_t *PA, saidx_t *first, saidx_t *last) {
310 ss_mintrosort(const sauchar_t *T, const saidx_t *PA,
315 const sauchar_t *Td
[all...] |
