| /external/libdivsufsort/android_include/ |
| D | divsufsort.h | 55 typedef int32_t saidx_t; typedef
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 */,
112 saidx_t n, saidx_t *idx);
126 saidx_t *A /* can NULL */,
127 saidx_t n, saidx_t idx);
139 sufcheck(const sauchar_t *T, const saidx_t *SA, saidx_t n, saint_t verbose);
153 saidx_t
[all …]
|
| /external/libdivsufsort/lib/ |
| D | sssort.c | 47 ss_ilg(saidx_t n) { in ss_ilg()
107 saidx_t
108 ss_isqrt(saidx_t x) { in ss_isqrt()
109 saidx_t y, e; in ss_isqrt()
142 const saidx_t *p1, const saidx_t *p2, in ss_compare()
143 saidx_t depth) { in ss_compare()
167 ss_insertionsort(const sauchar_t *T, const saidx_t *PA, in ss_insertionsort()
168 saidx_t *first, saidx_t *last, saidx_t depth) { in ss_insertionsort()
169 saidx_t *i, *j; in ss_insertionsort()
170 saidx_t t; in ss_insertionsort()
[all …]
|
| D | trsort.c | 45 tr_ilg(saidx_t n) { in tr_ilg()
79 tr_insertionsort(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { in tr_insertionsort()
80 saidx_t *a, *b; in tr_insertionsort()
81 saidx_t t, r; in tr_insertionsort()
98 tr_fixdown(const saidx_t *ISAd, saidx_t *SA, saidx_t i, saidx_t size) { in tr_fixdown()
99 saidx_t j, k; in tr_fixdown()
100 saidx_t v; in tr_fixdown()
101 saidx_t c, d, e; in tr_fixdown()
114 tr_heapsort(const saidx_t *ISAd, saidx_t *SA, saidx_t size) { in tr_heapsort()
115 saidx_t i, m; in tr_heapsort()
[all …]
|
| D | divsufsort.c | 37 saidx_t
38 sort_typeBstar(const sauchar_t *T, saidx_t *SA, in sort_typeBstar()
39 saidx_t *bucket_A, saidx_t *bucket_B, in sort_typeBstar()
40 saidx_t n) { in sort_typeBstar()
41 saidx_t *PAb, *ISAb, *buf; in sort_typeBstar()
43 saidx_t *curbuf; in sort_typeBstar()
44 saidx_t l; in sort_typeBstar()
46 saidx_t i, j, k, t, m, bufsize; in sort_typeBstar()
195 construct_SA(const sauchar_t *T, saidx_t *SA, in construct_SA()
196 saidx_t *bucket_A, saidx_t *bucket_B, in construct_SA()
[all …]
|
| D | utils.c | 34 saidx_t
35 binarysearch_lower(const saidx_t *A, saidx_t size, saidx_t value) { in binarysearch_lower()
36 saidx_t half, i; in binarysearch_lower()
53 bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *SA, in bw_transform()
54 saidx_t n, saidx_t *idx) { in bw_transform()
55 saidx_t *A, i, j, p, t; in bw_transform()
112 inverse_bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *A, in inverse_bw_transform()
113 saidx_t n, saidx_t idx) { in inverse_bw_transform()
114 saidx_t C[ALPHABET_SIZE]; in inverse_bw_transform()
116 saidx_t *B; in inverse_bw_transform()
[all …]
|
| /external/libdivsufsort/include/ |
| D | divsufsort_private.h | 65 # define saidx_t saidx64_t macro
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);
200 trsort(saidx_t *ISA, saidx_t *SA, saidx_t n, saidx_t depth);
|
| /external/libdivsufsort/examples/ |
| D | sasearch.c | 72 saidx_t *SA;
75 saidx_t i, size, left;
113 SA = (saidx_t *)malloc((size_t)n * sizeof(saidx_t));
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);
|
| D | 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); }
|
| D | bwt.c | 60 write_int(FILE *fp, saidx_t n) { in write_int()
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));
|
| D | 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) {
|
| D | unbwt.c | 60 read_int(FILE *fp, saidx_t *n) { in read_int()
85 saidx_t *A;
88 saidx_t pidx;
155 A = (saidx_t *)malloc(blocksize * sizeof(saidx_t));
|
| /external/bsdiff/ |
| D | suffix_array_index.cc | 19 int CallDivSufSort(const uint8_t* text, saidx_t* sa, size_t n) { in CallDivSufSort()
26 saidx_t CallSaSearch(const uint8_t* text, in CallSaSearch()
30 const saidx_t* sa, in CallSaSearch()
32 saidx_t* left) { in CallSaSearch()
154 const size_t kMaxSaidxSize = std::numeric_limits<saidx_t>::max() - 16; in CreateSuffixArrayIndex()
163 SuffixArrayIndex<saidx_t>* sa_ptr = new SuffixArrayIndex<saidx_t>(); in CreateSuffixArrayIndex()
|
| /external/libdivsufsort/ |
| D | README.md | 50 typedef int32_t saidx_t;
61 divsufsort(const sauchar_t *T, saidx_t *SA, saidx_t n);
71 saidx_t
72 divbwt(const sauchar_t *T, sauchar_t *U, saidx_t *A, saidx_t n);
|
| /external/brotli/research/ |
| D | durchschlag.cc | 392 saidx_t saTotal = static_cast<saidx_t>(total); in durchschlag_index()
|