Searched refs:ISAd (Results 1 – 2 of 2) sorted by relevance
| /external/libdivsufsort/lib/ |
| D | trsort.c | 79 tr_insertionsort(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { in tr_insertionsort() argument
84 for(t = *a, b = a - 1; 0 > (r = ISAd[t] - ISAd[*b]);) { in tr_insertionsort()
98 tr_fixdown(const saidx_t *ISAd, saidx_t *SA, saidx_t i, saidx_t size) { in tr_fixdown() argument
103 for(v = SA[i], c = ISAd[v]; (j = 2 * i + 1) < size; SA[i] = SA[k], i = k) { in tr_fixdown()
104 d = ISAd[SA[k = j++]]; in tr_fixdown()
105 if(d < (e = ISAd[SA[j]])) { k = j; d = e; } in tr_fixdown()
114 tr_heapsort(const saidx_t *ISAd, saidx_t *SA, saidx_t size) { in tr_heapsort() argument
121 if(ISAd[SA[m / 2]] < ISAd[SA[m]]) { SWAP(SA[m], SA[m / 2]); } in tr_heapsort()
124 for(i = m / 2 - 1; 0 <= i; --i) { tr_fixdown(ISAd, SA, i, m); } in tr_heapsort()
125 if((size % 2) == 0) { SWAP(SA[0], SA[m]); tr_fixdown(ISAd, SA, 0, m); } in tr_heapsort()
[all …]
|
| /external/archive-patcher/generator/src/main/java/com/google/archivepatcher/generator/bsdiff/ |
| D | DivSuffixSorter.java | 1311 int ISAd; in trSort() local
1314 for (ISAd = ISA + depth; -n < readSuffixArray(0); ISAd += ISAd - ISA) { in trSort()
1333 trIntroSort(ISA, ISAd, first, last, budget); in trSort()
1355 int ISAd, int first, int middle, int last, int v) throws IOException { in trPartition() argument
1360 (++b < last) && ((x = readSuffixArray(ISAd + readSuffixArray(b))) == v); in trPartition()
1363 for (; (++b < last) && ((x = readSuffixArray(ISAd + readSuffixArray(b))) <= v); ) { in trPartition()
1370 for (c = last; (b < --c) && ((x = readSuffixArray(ISAd + readSuffixArray(c))) == v); ) {} in trPartition()
1372 for (; (b < --c) && ((x = readSuffixArray(ISAd + readSuffixArray(c))) >= v); ) { in trPartition()
1381 for (; (++b < c) && ((x = readSuffixArray(ISAd + readSuffixArray(b))) <= v); ) { in trPartition()
1387 for (; (b < --c) && ((x = readSuffixArray(ISAd + readSuffixArray(c))) >= v); ) { in trPartition()
[all …]
|