Searched refs:ss_compare (Results 1 – 2 of 2) sorted by relevance
| /external/libdivsufsort/lib/ |
| D | sssort.c | 141 ss_compare(const sauchar_t *T, in ss_compare() function
174 for(t = *i, j = i + 1; 0 < (r = ss_compare(T, PA + t, PA + *j, depth));) { in ss_insertionsort()
518 q = ss_compare(T, PA + ((0 <= *b) ? *b : ~*b), p, depth); in ss_inplacemerge()
556 r = ss_compare(T, PA + *b, PA + *c, depth); in ss_mergeforward()
613 r = ss_compare(T, p1, p2, depth); in ss_mergebackward()
662 (((c) & 2) && (ss_compare(T, PA + GETIDX(*((a) - 1)), PA + *(a), depth) == 0))) {\ in ss_swapmerge()
665 if(((c) & 4) && ((ss_compare(T, PA + GETIDX(*((b) - 1)), PA + *(b), depth) == 0))) {\ in ss_swapmerge()
697 if(ss_compare(T, PA + GETIDX(*(middle + m + half)), in ss_swapmerge()
728 if(ss_compare(T, PA + GETIDX(*(middle - 1)), PA + *middle, depth) == 0) { in ss_swapmerge()
809 (a < last) && ((*a < 0) || (0 < ss_compare(T, &(PAi[0]), PA + *a, depth))); in sssort()
|
| /external/zstd/lib/dictBuilder/ |
| D | divsufsort.c | 231 ss_compare(const unsigned char *T, in ss_compare() function
264 for(t = *i, j = i + 1; 0 < (r = ss_compare(T, PA + t, PA + *j, depth));) { in ss_insertionsort()
608 q = ss_compare(T, PA + ((0 <= *b) ? *b : ~*b), p, depth); in ss_inplacemerge()
646 r = ss_compare(T, PA + *b, PA + *c, depth); in ss_mergeforward()
703 r = ss_compare(T, p1, p2, depth); in ss_mergebackward()
752 (((c) & 2) && (ss_compare(T, PA + GETIDX(*((a) - 1)), PA + *(a), depth) == 0))) {\ in ss_swapmerge()
755 if(((c) & 4) && ((ss_compare(T, PA + GETIDX(*((b) - 1)), PA + *(b), depth) == 0))) {\ in ss_swapmerge()
787 if(ss_compare(T, PA + GETIDX(*(middle + m + half)), in ss_swapmerge()
818 if(ss_compare(T, PA + GETIDX(*(middle - 1)), PA + *middle, depth) == 0) { in ss_swapmerge()
898 (a < last) && ((*a < 0) || (0 < ss_compare(T, &(PAi[0]), PA + *a, depth))); in sssort()
|