Home
last modified time | relevance | path

Searched refs:sauchar_t (Results 1 – 14 of 14) sorted by relevance

/external/libdivsufsort/android_include/
Ddivsufsort.h47 typedef uint8_t sauchar_t; typedef
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,
139 sufcheck(const sauchar_t *T, const saidx_t *SA, saidx_t n, saint_t verbose);
154 sa_search(const sauchar_t *T, saidx_t Tsize,
155 const sauchar_t *P, saidx_t Psize,
171 sa_simplesearch(const sauchar_t *T, saidx_t Tsize,
Ddivsufsort64.h47 typedef uint8_t sauchar_t; typedef
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,
139 sufcheck64(const sauchar_t *T, const saidx64_t *SA, saidx64_t n, saint_t verbose);
154 sa_search64(const sauchar_t *T, saidx64_t Tsize,
155 const sauchar_t *P, saidx64_t Psize,
171 sa_simplesearch64(const sauchar_t *T, saidx64_t Tsize,
/external/libdivsufsort/lib/
Dutils.c53 bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *SA, in bw_transform()
80 U[j] = (j <= p) ? T[p] : (sauchar_t)A[p]; in bw_transform()
90 U[j] = (j <= p) ? T[p] : (sauchar_t)A[p]; in bw_transform()
112 inverse_bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *A, in inverse_bw_transform()
115 sauchar_t D[ALPHABET_SIZE]; in inverse_bw_transform()
139 D[d++] = (sauchar_t)c; in inverse_bw_transform()
161 sufcheck(const sauchar_t *T, const saidx_t *SA, in sufcheck()
246 _compare(const sauchar_t *T, saidx_t Tsize, in _compare()
247 const sauchar_t *P, saidx_t Psize, in _compare()
259 sa_search(const sauchar_t *T, saidx_t Tsize, in sa_search()
[all …]
Ddivsufsort.c38 sort_typeBstar(const sauchar_t *T, saidx_t *SA, in sort_typeBstar()
195 construct_SA(const sauchar_t *T, saidx_t *SA, in construct_SA()
259 construct_BWT(const sauchar_t *T, saidx_t *SA, in construct_BWT()
332 divsufsort(const sauchar_t *T, saidx_t *SA, saidx_t n) { in divsufsort()
361 divbwt(const sauchar_t *T, sauchar_t *U, saidx_t *A, saidx_t n) { in divbwt()
381 for(i = 0; i < pidx; ++i) { U[i + 1] = (sauchar_t)B[i]; } in divbwt()
382 for(i += 1; i < n; ++i) { U[i] = (sauchar_t)B[i]; } in divbwt()
Dsssort.c141 ss_compare(const sauchar_t *T, in ss_compare()
144 const sauchar_t *U1, *U2, *U1n, *U2n; in ss_compare()
167 ss_insertionsort(const sauchar_t *T, const saidx_t *PA, in ss_insertionsort()
192 ss_fixdown(const sauchar_t *Td, const saidx_t *PA, in ss_fixdown()
209 ss_heapsort(const sauchar_t *Td, const saidx_t *PA, saidx_t *SA, saidx_t size) { in ss_heapsort()
234 ss_median3(const sauchar_t *Td, const saidx_t *PA, in ss_median3()
248 ss_median5(const sauchar_t *Td, const saidx_t *PA, in ss_median5()
263 ss_pivot(const sauchar_t *Td, const saidx_t *PA, saidx_t *first, saidx_t *last) { in ss_pivot()
310 ss_mintrosort(const sauchar_t *T, const saidx_t *PA, in ss_mintrosort()
315 const sauchar_t *Td; in ss_mintrosort()
[all …]
/external/libdivsufsort/include/
Ddivsufsort.h.cmake47 typedef @SAUCHAR_TYPE@ 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,
139 sufcheck@W64BIT@(const sauchar_t *T, const saidx@W64BIT@_t *SA, saidx@W64BIT@_t n, saint_t verbose);
154 sa_search@W64BIT@(const sauchar_t *T, saidx@W64BIT@_t Tsize,
155 const sauchar_t *P, saidx@W64BIT@_t Psize,
171 sa_simplesearch@W64BIT@(const sauchar_t *T, saidx@W64BIT@_t Tsize,
Ddivsufsort_private.h194 sssort(const sauchar_t *Td, const saidx_t *PA,
DCMakeLists.txt59 # sauchar_t (8bit)
/external/libdivsufsort/examples/
Dsasearch.c71 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,
Dunbwt.c84 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) {
Dbwt.c82 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)) {
Dsuftest.c72 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) {
Dmksary.c72 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) {
/external/libdivsufsort/
DREADME.md51 typedef uint8_t sauchar_t;
61 divsufsort(const sauchar_t *T, saidx_t *SA, saidx_t n);
72 divbwt(const sauchar_t *T, sauchar_t *U, saidx_t *A, saidx_t n);