Lines Matching +full:6 +full:a
6 * obtaining a copy of this software and associated documentation
19 * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
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
83 for(a = first + 1; a < last; ++a) { in tr_insertionsort()
84 for(t = *a, b = a - 1; 0 > (r = ISAd[t] - ISAd[*b]);) { in tr_insertionsort()
225 saidx_t *a, *b, *c, *d, *e, *f; in tr_partition() local
230 if(((a = b) < last) && (x < v)) { in tr_partition()
232 if(x == v) { SWAP(*b, *a); ++a; } in tr_partition()
244 if(x == v) { SWAP(*b, *a); ++a; } in tr_partition()
251 if(a <= d) { in tr_partition()
253 if((s = a - first) > (t = b - a)) { s = t; } 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
273 for(c = first, d = a - 1; c <= d; ++c) { in tr_copy()
290 saidx_t *first, saidx_t *a, saidx_t *b, saidx_t *last, in tr_partialcopy() argument
298 for(c = first, d = a - 1; c <= 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()
347 if(a < last) { in tr_introsort()
348 for(c = first, v = a - SA - 1; c < a; ++c) { ISA[*c] = v; } 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()
361 if(1 < (a - first)) { in tr_introsort()
363 last = a, limit = tr_ilg(a - first); in tr_introsort()
371 STACK_PUSH5(ISAd, first, a, tr_ilg(a - first), trlink); in tr_introsort()
373 } else if(1 < (a - first)) { in tr_introsort()
374 last = a, limit = tr_ilg(a - first); 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()
392 a = first; in tr_introsort()
393 do { ISA[*a] = a - SA; } while((++a < last) && (0 <= *a)); in tr_introsort()
394 first = a; in tr_introsort()
397 a = first; do { *a = ~*a; } while(*++a < 0); in tr_introsort()
398 next = (ISA[*a] != ISAd[*a]) ? tr_ilg(a - first + 1) : -1; in tr_introsort()
399 if(++a < last) { for(b = first, v = a - SA - 1; b < a; ++b) { ISA[*b] = v; } } in tr_introsort()
402 if(trbudget_check(budget, a - first)) { in tr_introsort()
403 if((a - first) <= (last - a)) { in tr_introsort()
404 STACK_PUSH5(ISAd, a, last, -3, trlink); in tr_introsort()
405 ISAd += incr, last = a, limit = next; in tr_introsort()
407 if(1 < (last - a)) { in tr_introsort()
408 STACK_PUSH5(ISAd + incr, first, a, next, trlink); in tr_introsort()
409 first = a, limit = -3; in tr_introsort()
411 ISAd += incr, last = a, limit = next; in tr_introsort()
416 if(1 < (last - a)) { in tr_introsort()
417 first = a, limit = -3; 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()
445 a = tr_pivot(ISAd, first, last); in tr_introsort()
446 SWAP(*first, *a); 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()
455 for(c = first, v = a - SA - 1; c < a; ++c) { ISA[*c] = v; } 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()
462 if(1 < (a - first)) { in tr_introsort()
463 STACK_PUSH5(ISAd + incr, a, b, next, trlink); in tr_introsort()
465 last = a; in tr_introsort()
467 STACK_PUSH5(ISAd + incr, a, b, next, trlink); 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()
473 if(1 < (a - first)) { in tr_introsort()
475 STACK_PUSH5(ISAd + incr, a, b, next, trlink); in tr_introsort()
476 last = a; in tr_introsort()
479 ISAd += incr, first = a, last = b, limit = next; in tr_introsort()
483 STACK_PUSH5(ISAd, first, a, 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()
489 STACK_PUSH5(ISAd + incr, a, b, next, trlink); in tr_introsort()
490 STACK_PUSH5(ISAd, first, a, limit, trlink); in tr_introsort()
492 } else if(1 < (a - first)) { in tr_introsort()
493 STACK_PUSH5(ISAd + incr, a, b, next, trlink); in tr_introsort()
494 last = a; 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()
500 STACK_PUSH5(ISAd, first, a, limit, trlink); in tr_introsort()
501 STACK_PUSH5(ISAd + incr, a, b, next, trlink); in tr_introsort()
504 STACK_PUSH5(ISAd, first, a, limit, trlink); in tr_introsort()
505 ISAd += incr, first = a, last = b, limit = next; in tr_introsort()
508 STACK_PUSH5(ISAd, first, a, 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()
516 if(1 < (a - first)) { in tr_introsort()
518 last = a; in tr_introsort()
526 STACK_PUSH5(ISAd, first, a, limit, trlink); in tr_introsort()
528 } else if(1 < (a - first)) { in tr_introsort()
529 last = a; in tr_introsort()