| /external/libdivsufsort/android_include/ |
| divsufsort.h | 53 #ifndef SAIDX_T
54 #define SAIDX_T
55 typedef int32_t saidx_t; typedef
56 #endif /* SAIDX_T */
76 divsufsort(const sauchar_t *T, saidx_t *SA, saidx_t n);
87 saidx_t
88 divbwt(const sauchar_t *T, sauchar_t *U, saidx_t *A, saidx_t n);
111 saidx_t *SA /* can NULL */
[all...] |
| /external/libdivsufsort/lib/ |
| sssort.c | 47 ss_ilg(saidx_t n) {
107 saidx_t
108 ss_isqrt(saidx_t x) {
109 saidx_t y, e;
142 const saidx_t *p1, const saidx_t *p2,
143 saidx_t depth) {
167 ss_insertionsort(const sauchar_t *T, const saidx_t *PA,
168 saidx_t *first, saidx_t *last, saidx_t depth)
[all...] |
| divsufsort.c | 37 saidx_t
38 sort_typeBstar(const sauchar_t *T, saidx_t *SA,
39 saidx_t *bucket_A, saidx_t *bucket_B,
40 saidx_t n) {
41 saidx_t *PAb, *ISAb, *buf;
43 saidx_t *curbuf;
44 saidx_t l;
46 saidx_t i, j, k, t, m, bufsize;
195 construct_SA(const sauchar_t *T, saidx_t *SA
[all...] |
| utils.c | 34 saidx_t
35 binarysearch_lower(const saidx_t *A, saidx_t size, saidx_t value) {
36 saidx_t half, i;
53 bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *SA,
54 saidx_t n, saidx_t *idx) {
55 saidx_t *A, i, j, p, t;
112 inverse_bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *A
[all...] |
| trsort.c | 45 tr_ilg(saidx_t n) {
79 tr_insertionsort(const saidx_t *ISAd, saidx_t *first, saidx_t *last) {
80 saidx_t *a, *b;
81 saidx_t t, r;
98 tr_fixdown(const saidx_t *ISAd, saidx_t *SA, saidx_t i, saidx_t size)
[all...] |
| /external/libdivsufsort/include/ |
| divsufsort_private.h | 63 # ifndef SAIDX_T
64 # define SAIDX_T
65 # define saidx_t saidx64_t macro
66 # endif /* SAIDX_T */
194 sssort(const sauchar_t *Td, const saidx_t *PA,
195 saidx_t *first, saidx_t *last,
196 saidx_t *buf, saidx_t bufsize,
197 saidx_t depth, saidx_t n, saint_t lastsuffix)
[all...] |
| /external/libdivsufsort/examples/ |
| sasearch.c | 72 saidx_t *SA;
75 saidx_t i, size, left;
113 SA = (saidx_t *)malloc((size_t)n * sizeof(saidx_t));
141 /* Read n * sizeof(saidx_t) bytes of data. */
142 if(fread(SA, sizeof(saidx_t), (size_t)n, fp) != (size_t)n) {
153 size = sa_search(T, (saidx_t)n,
154 (const sauchar_t *)P, (saidx_t)Psize,
155 SA, (saidx_t)n, &left);
|
| suftest.c | 73 saidx_t *SA;
129 SA = (saidx_t *)malloc((size_t)n * sizeof(saidx_t));
149 if(divsufsort(T, SA, (saidx_t)n) != 0) {
157 if(sufcheck(T, SA, (saidx_t)n, 1) != 0) { exit(EXIT_FAILURE); }
|
| mksary.c | 73 saidx_t *SA;
153 SA = (saidx_t *)malloc((size_t)n * sizeof(saidx_t));
173 if(divsufsort(T, SA, (saidx_t)n) != 0) {
181 if(fwrite(SA, sizeof(saidx_t), (size_t)n, ofp) != (size_t)n) {
|
| unbwt.c | 60 read_int(FILE *fp, saidx_t *n) {
85 saidx_t *A;
88 saidx_t pidx;
155 A = (saidx_t *)malloc(blocksize * sizeof(saidx_t));
|
| bwt.c | 60 write_int(FILE *fp, saidx_t n) {
83 saidx_t *SA;
86 saidx_t pidx;
164 if((blocksize == 0) || (n < blocksize)) { blocksize = (saidx_t)n; }
169 SA = (saidx_t *)malloc(blocksize * sizeof(saidx_t));
|
| /external/bsdiff/ |
| suffix_array_index.cc | 19 int CallDivSufSort(const uint8_t* text, saidx_t* sa, size_t n) {
26 saidx_t CallSaSearch(const uint8_t* text,
30 const saidx_t* sa,
32 saidx_t* left) {
49 // The SAIDX template type must be either saidx_t or saidx64_t, which will
151 // saidx_t type. We limit this to something a bit smaller (16 bytes smaller)
154 const size_t kMaxSaidxSize = std::numeric_limits<saidx_t>::max() - 16;
163 SuffixArrayIndex<saidx_t>* sa_ptr = new SuffixArrayIndex<saidx_t>();
|
