117 void completeSort(alias less = "a < b", SwapStrategy ss = SwapStrategy.unstable,
400 Range partition(alias predicate, SwapStrategy ss, Range)(Range r)
401 if (ss == SwapStrategy.stable && isRandomAccessRange!(Range) && hasLength!Range &&
415     alias recurse = .partition!(pred, ss, Range);
423 Range partition(alias predicate, SwapStrategy ss = SwapStrategy.unstable, Range)(Range r)
424 if (ss != SwapStrategy.stable && isInputRange!Range && hasSwappableElements!Range)
429     static if (ss == SwapStrategy.semistable)
832 auto partition3(alias less = "a < b", SwapStrategy ss = SwapStrategy.unstable, Range, E)
834 if (ss == SwapStrategy.unstable && isRandomAccessRange!Range
970     SwapStrategy ss = SwapStrategy.unstable,
986     sort!((a, b) => binaryFun!less(*a, *b), ss)(index);
993     SwapStrategy ss = SwapStrategy.unstable,
1020     sort!((a, b) => binaryFun!less(r[cast(size_t) a], r[cast(size_t) b]), ss)
1512             enum ss = less[$ - 1];  in multiSort()  local
1517             enum ss = SwapStrategy.unstable;  in multiSort()  local
1525             return sort!(funs[0], ss, Range)(r);  in multiSort()
1528             multiSortImpl!(Range, ss, funs)(r);  in multiSort()
1556 private void multiSortImpl(Range, SwapStrategy ss, funs...)(Range r)  in multiSortImpl()  argument
1565             auto t = partition3!(funs[0], ss)(r, r[p]);  in multiSortImpl()
1568                 multiSortImpl!(Range, ss, funs)(t[0]);  in multiSortImpl()
1569                 multiSortImpl!(Range, ss, funs[1 .. $])(t[1]);  in multiSortImpl()
1574                 multiSortImpl!(Range, ss, funs[1 .. $])(t[1]);  in multiSortImpl()
1575                 multiSortImpl!(Range, ss, funs)(t[2]);  in multiSortImpl()
1582         sort!(lessFun, ss)(r);  in multiSortImpl()
1925 sort(alias less = "a < b", SwapStrategy ss = SwapStrategy.unstable,
1927 if (((ss == SwapStrategy.unstable && (hasSwappableElements!Range ||
1929     (ss != SwapStrategy.unstable && hasAssignableElements!Range)) &&
1944         static if (ss == SwapStrategy.unstable)
3094         SwapStrategy ss = SwapStrategy.unstable, R)(R r)
3177     zip(xform, r).sort!((a, b) => binaryFun!less(a[0], b[0]), ss)();
3182 auto schwartzSort(alias transform, SwapStrategy ss, R)(R r)
3185     return schwartzSort!(transform, "a < b", ss, R)(r);
3344 void partialSort(alias less = "a < b", SwapStrategy ss = SwapStrategy.unstable,
3348     partialSort!(less, ss)(r[0 .. n], r[n .. $]);
3369 void partialSort(alias less = "a < b", SwapStrategy ss = SwapStrategy.unstable,
3375     topN!(less, ss)(r1, r2);
3376     sort!(less, ss)(r1);
3423         SwapStrategy ss = SwapStrategy.unstable,
3428     static assert(ss == SwapStrategy.unstable,
3897         SwapStrategy ss = SwapStrategy.unstable,
3905     static assert(ss == SwapStrategy.unstable,
4103 void topNIndex(alias less = "a < b", SwapStrategy ss = SwapStrategy.unstable,
4110     static assert(ss == SwapStrategy.unstable,