Lines Matching refs:ssb
1624 * ssb.keys = ssa.keys + na in a stable way, in-place. na and nb must be > 0.
1631 sortslice ssb, Py_ssize_t nb)
1638 assert(ms && ssa.keys && ssb.keys && na > 0 && nb > 0);
1639 assert(ssa.keys + na == ssb.keys);
1646 sortslice_copy_incr(&dest, &ssb);
1663 k = ISLT(ssb.keys[0], ssa.keys[0]);
1667 sortslice_copy_incr(&dest, &ssb);
1698 k = gallop_right(ms, ssb.keys[0], ssa.keys, na, 0);
1716 sortslice_copy_incr(&dest, &ssb);
1721 k = gallop_left(ms, ssa.keys[0], ssb.keys, nb, 0);
1726 sortslice_memmove(&dest, 0, &ssb, 0, k);
1728 sortslice_advance(&ssb, k);
1750 sortslice_memmove(&dest, 0, &ssb, 0, nb);
1756 * ssb.keys = ssa.keys + na in a stable way, in-place. na and nb must be > 0.
1763 sortslice ssb, Py_ssize_t nb)
1770 assert(ms && ssa.keys && ssb.keys && na > 0 && nb > 0);
1771 assert(ssa.keys + na == ssb.keys);
1774 dest = ssb;
1776 sortslice_memcpy(&ms->a, 0, &ssb, 0, nb);
1779 ssb.keys = ms->a.keys + nb - 1;
1780 if (ssb.values != NULL)
1781 ssb.values = ms->a.values + nb - 1;
1801 k = ISLT(ssb.keys[0], ssa.keys[0]);
1815 sortslice_copy_decr(&dest, &ssb);
1836 k = gallop_right(ms, ssb.keys[0], basea.keys, na, na-1);
1849 sortslice_copy_decr(&dest, &ssb);
1861 sortslice_advance(&ssb, -k);
1862 sortslice_memcpy(&dest, 1, &ssb, 1, k);
1889 /* The first element of ssb belongs at the front of the merge. */
1893 sortslice_copy(&dest, 0, &ssb, 0);
1903 sortslice ssa, ssb;
1914 ssb = ms->pending[i+1].base;
1917 assert(ssa.keys + na == ssb.keys);
1931 k = gallop_right(ms, *ssb.keys, ssa.keys, na, 0);
1942 nb = gallop_left(ms, ssa.keys[na-1], ssb.keys, nb, nb-1);
1950 return merge_lo(ms, ssa, na, ssb, nb);
1952 return merge_hi(ms, ssa, na, ssb, nb);