rangedSort (original) (raw)

Arrange a range of values in order.

Alternatives: rangedSort, rangedSort$.
Similar: sort, rangedSort, partialSort, rangedPartialSort.

function rangedSort(x, i, I, fc, fm, fs) // x: an array // i: begin index // I: end index (exclusive) // fc: compare function (a, b) // fm: map function (v, i, x) // fs: swap function (x, i, j)

const xarray = require('extra-array');

// Sort a range of values (index 0 to 2). var x = [4, -3, 1, -2]; xarray.rangedSort(x, 0, 2); // → [ -3, 4, 1, -2 ] (compares numbers)

// Sort a range of values (index 0 to 3). xarray.rangedSort(x, 0, 2); // → [ -3, 1, 4, -2 ]

// Sort using absolute values. xarray.rangedSort(x, 0, 3, null, v => Math.abs(v)); // → [ 1, -3, 4, -2 ]

References

• Data.Sort.sortBy() : Haskell
• Array.prototype.sort() : MDN Web Docs
• std::list::sort() : cppreference.com
• Array.sortBy() : Sugar.js
• immutable-array-prototype : @azu