| H A D | trsort.c | 35 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
36 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
80 saidx_t *a, *b; in tr_insertionsort() local
84 for(t = *a, b = a - 1; 0 > (r = ISAd[t] - ISAd[*b]);) { in tr_insertionsort()
85 do { *(b + 1) = *b; } while((first <= --b) && (*b < 0)); in tr_insertionsort()
86 if(b < first) { break; } in tr_insertionsort()
88 if(r == 0) { *b = ~*b; } in tr_insertionsort()
89 *(b + 1) = t; in tr_insertionsort()
225 saidx_t *a, *b, *c, *d, *e, *f; in tr_partition() local
229 for(b = middle - 1; (++b < last) && ((x = ISAd[*b]) == v);) { } in tr_partition()
[all …]
|