Lines Matching +full:6 +full:b
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()
230 if(((a = b) < last) && (x < v)) { in tr_partition()
231 for(; (++b < last) && ((x = ISAd[*b]) <= v);) { in tr_partition()
232 if(x == v) { SWAP(*b, *a); ++a; } in tr_partition()
235 for(c = last; (b < --c) && ((x = ISAd[*c]) == v);) { } in tr_partition()
236 if((b < (d = c)) && (x > v)) { in tr_partition()
237 for(; (b < --c) && ((x = ISAd[*c]) >= v);) { in tr_partition()
241 for(; b < c;) { in tr_partition()
242 SWAP(*b, *c); in tr_partition()
243 for(; (++b < c) && ((x = ISAd[*b]) <= v);) { in tr_partition()
244 if(x == v) { SWAP(*b, *a); ++a; } in tr_partition()
246 for(; (b < --c) && ((x = ISAd[*c]) >= v);) { in tr_partition()
252 c = b - 1; in tr_partition()
253 if((s = a - first) > (t = b - a)) { s = t; } in tr_partition()
254 for(e = first, f = b - s; 0 < s; --s, ++e, ++f) { SWAP(*e, *f); } in tr_partition()
256 for(e = b, f = last - s; 0 < s; --s, ++e, ++f) { SWAP(*e, *f); } in tr_partition()
257 first += (b - a), last -= (d - c); in tr_partition()
265 saidx_t *first, saidx_t *a, saidx_t *b, saidx_t *last, in tr_copy() argument
272 v = b - SA - 1; in tr_copy()
279 for(c = last - 1, e = d + 1, d = b; e < d; --c) { in tr_copy()
290 saidx_t *first, saidx_t *a, saidx_t *b, saidx_t *last, in tr_partialcopy() argument
296 v = b - SA - 1; in tr_partialcopy()
315 for(c = last - 1, e = d + 1, d = b; e < d; --c) { in tr_partialcopy()
331 struct { const saidx_t *a; saidx_t *b, *c; saint_t d, e; }stack[STACK_SIZE]; in tr_introsort() member
332 saidx_t *a, *b, *c; in tr_introsort() local
344 tr_partition(ISAd - incr, first, first, last, &a, &b, last - SA - 1); in tr_introsort()
350 if(b < last) { in tr_introsort()
351 for(c = a, v = b - SA - 1; c < b; ++c) { ISA[*c] = v; } in tr_introsort()
355 if(1 < (b - a)) { in tr_introsort()
356 STACK_PUSH5(NULL, a, b, 0, 0); in tr_introsort()
360 if((a - first) <= (last - b)) { in tr_introsort()
362 STACK_PUSH5(ISAd, b, last, tr_ilg(last - b), trlink); in tr_introsort()
364 } else if(1 < (last - b)) { in tr_introsort()
365 first = b, limit = tr_ilg(last - b); in tr_introsort()
370 if(1 < (last - b)) { in tr_introsort()
372 first = b, limit = tr_ilg(last - b); in tr_introsort()
381 a = stack[--ssize].b, b = stack[ssize].c; in tr_introsort()
383 tr_copy(ISA, SA, first, a, b, last, ISAd - ISA); in tr_introsort()
386 tr_partialcopy(ISA, SA, first, a, b, last, ISAd - ISA); in tr_introsort()
399 if(++a < last) { for(b = first, v = a - SA - 1; b < a; ++b) { ISA[*b] = v; } } in tr_introsort()
437 for(a = last - 1; first < a; a = b) { in tr_introsort()
438 for(x = ISAd[*a], b = a - 1; (first <= b) && (ISAd[*b] == x); --b) { *b = ~*b; } in tr_introsort()
450 tr_partition(ISAd, first, first + 1, last, &a, &b, v); in tr_introsort()
451 if((last - first) != (b - a)) { in tr_introsort()
452 next = (ISA[*a] != v) ? tr_ilg(b - a) : -1; in tr_introsort()
456 if(b < last) { for(c = a, v = b - SA - 1; c < b; ++c) { ISA[*c] = v; } } in tr_introsort()
459 if((1 < (b - a)) && (trbudget_check(budget, b - a))) { in tr_introsort()
460 if((a - first) <= (last - b)) { in tr_introsort()
461 if((last - b) <= (b - a)) { in tr_introsort()
463 STACK_PUSH5(ISAd + incr, a, b, next, trlink); in tr_introsort()
464 STACK_PUSH5(ISAd, b, last, limit, trlink); in tr_introsort()
466 } else if(1 < (last - b)) { in tr_introsort()
467 STACK_PUSH5(ISAd + incr, a, b, next, trlink); in tr_introsort()
468 first = b; in tr_introsort()
470 ISAd += incr, first = a, last = b, limit = next; in tr_introsort()
472 } else if((a - first) <= (b - a)) { in tr_introsort()
474 STACK_PUSH5(ISAd, b, last, limit, trlink); in tr_introsort()
475 STACK_PUSH5(ISAd + incr, a, b, next, trlink); in tr_introsort()
478 STACK_PUSH5(ISAd, b, last, limit, trlink); in tr_introsort()
479 ISAd += incr, first = a, last = b, limit = next; in tr_introsort()
482 STACK_PUSH5(ISAd, b, last, limit, trlink); in tr_introsort()
484 ISAd += incr, first = a, last = b, limit = next; in tr_introsort()
487 if((a - first) <= (b - a)) { in tr_introsort()
488 if(1 < (last - b)) { in tr_introsort()
489 STACK_PUSH5(ISAd + incr, a, b, next, trlink); in tr_introsort()
491 first = b; in tr_introsort()
493 STACK_PUSH5(ISAd + incr, a, b, next, trlink); in tr_introsort()
496 ISAd += incr, first = a, last = b, limit = next; in tr_introsort()
498 } else if((last - b) <= (b - a)) { in tr_introsort()
499 if(1 < (last - b)) { in tr_introsort()
501 STACK_PUSH5(ISAd + incr, a, b, next, trlink); in tr_introsort()
502 first = b; in tr_introsort()
505 ISAd += incr, first = a, last = b, limit = next; in tr_introsort()
509 STACK_PUSH5(ISAd, b, last, limit, trlink); in tr_introsort()
510 ISAd += incr, first = a, last = b, limit = next; in tr_introsort()
514 if((1 < (b - a)) && (0 <= trlink)) { stack[trlink].d = -1; } in tr_introsort()
515 if((a - first) <= (last - b)) { in tr_introsort()
517 STACK_PUSH5(ISAd, b, last, limit, trlink); in tr_introsort()
519 } else if(1 < (last - b)) { in tr_introsort()
520 first = b; in tr_introsort()
525 if(1 < (last - b)) { in tr_introsort()
527 first = b; in tr_introsort()