Return an evenly stepped range ordered from largest to smallest
A release dashboard lists build numbers newest first, and a chart draws its y-axis labels from the top down. Both need the same thing: the values of an evenly spaced range, ordered from largest to smallest.
Implement descendingRange(start, end, step). It returns every number start + k * step (for k = 0, 1, 2, …) that is less than end, ordered from the largest value to the smallest.
descendingRange(end) // same as descendingRange(0, end)
descendingRange(start, end)
descendingRange(start, end, step) // => number[]
end and start is 0. If end is undefined, the first argument is treated as end.step defaults to 1. Passing undefined explicitly also uses 1.step must be a positive, finite number. Otherwise (for example 0, -2, NaN, or Infinity), throw a RangeError.start is included and end is never included. If end is not greater than start, return [].start, not to end. The largest value is the last start + k * step below end, not always end - 1.start + k * step. Adding step to a running total drifts with fractional steps (adding 0.1 ten times gives 0.9999999999999999, which is still below 1).reverse or toReversed.descendingRange(5);
// => [4, 3, 2, 1, 0]
descendingRange(-3, 2);
// => [1, 0, -1, -2, -3]
descendingRange(2, 10, 3);
// => [8, 5, 2] (2, 5, 8 are below 10; 11 is not)
descendingRange(0, 1, 0.25);
// => [0.75, 0.5, 0.25, 0]
descendingRange(8, 2);
// => []
descendingRange(0, 5, 0);
// throws RangeError