listobject.c - OpenGrok cross reference for /third_party/python/Objects/listobject.c

Lines Matching defs:ssa
1623 /* Merge the na elements starting at ssa with the nb elements starting at
1624  * ssb.keys = ssa.keys + na in a stable way, in-place.  na and nb must be > 0.
1625  * Must also have that ssa.keys[na-1] belongs at the end of the merge, and
1630 merge_lo(MergeState *ms, sortslice ssa, Py_ssize_t na,
1638     assert(ms && ssa.keys && ssb.keys && na > 0 && nb > 0);
1639     assert(ssa.keys + na == ssb.keys);
1642     sortslice_memcpy(&ms->a, 0, &ssa, 0, na);
1643     dest = ssa;
1644     ssa = ms->a;
1663             k = ISLT(ssb.keys[0], ssa.keys[0]);
1677                 sortslice_copy_incr(&dest, &ssa);
1698             k = gallop_right(ms, ssb.keys[0], ssa.keys, na, 0);
1703                 sortslice_memcpy(&dest, 0, &ssa, 0, k);
1705                 sortslice_advance(&ssa, k);
1721             k = gallop_left(ms, ssa.keys[0], ssb.keys, nb, 0);
1733             sortslice_copy_incr(&dest, &ssa);
1745         sortslice_memcpy(&dest, 0, &ssa, 0, na);
1749     /* The last element of ssa belongs at the end of the merge. */
1751     sortslice_copy(&dest, nb, &ssa, 0);
1756  * ssb.keys = ssa.keys + na in a stable way, in-place.  na and nb must be > 0.
1757  * Must also have that ssa.keys[na-1] belongs at the end of the merge, and
1762 merge_hi(MergeState *ms, sortslice ssa, Py_ssize_t na,
1770     assert(ms && ssa.keys && ssb.keys && na > 0 && nb > 0);
1771     assert(ssa.keys + na == ssb.keys);
1777     basea = ssa;
1782     sortslice_advance(&ssa, na - 1);
1784     sortslice_copy_decr(&dest, &ssa);
1801             k = ISLT(ssb.keys[0], ssa.keys[0]);
1805                 sortslice_copy_decr(&dest, &ssa);
1843                 sortslice_advance(&ssa, -k);
1844                 sortslice_memmove(&dest, 1, &ssa, 1, k);
1854             k = gallop_left(ms, ssa.keys[0], baseb.keys, nb, nb-1);
1873             sortslice_copy_decr(&dest, &ssa);
1890     sortslice_memmove(&dest, 1-na, &ssa, 1-na, na);
1892     sortslice_advance(&ssa, -na);
1903     sortslice ssa, ssb;
1912     ssa = ms->pending[i].base;
1917     assert(ssa.keys + na == ssb.keys);
1931     k = gallop_right(ms, *ssb.keys, ssa.keys, na, 0);
1934     sortslice_advance(&ssa, k);
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);