1

Author: selfrefactor

CHANGELOG.md

@@ -1,3 +1,7 @@
+11.1.1
+
+- Fix `R.range`/`R.rangeDescending` when start and end match
+
 11.1.0
 
 - Add `R.filterMap` - similar to Ruby `filter_map`

source/range.js

@@ -1,7 +1,8 @@
 export function range(a, b) {
   const start = b === undefined ? 0 : a
   const end = b === undefined ? a : b
-  if (end<=  start) {
+  if (end ===  start) return [start]
+  if (end <  start) {
 		return []
   }
   const len = end - start

source/range.spec.js

@@ -2,7 +2,10 @@ import { range } from './range.js'
 
 test('happy', () => {
   expect(range(5)).toEqual([0, 1, 2, 3, 4, 5])
-  expect(range(3,5)).toEqual([3, 4, 5])
-  expect(range(5,3)).toEqual([])
-	expect(range(0)).toEqual([])
+  expect(range(3, 5)).toEqual([3, 4, 5])
+  expect(range(5, 3)).toEqual([])
+  expect(range(5, 5)).toEqual([5])
+  expect(range(0)).toEqual([0])
+  expect(range(1)).toEqual([0, 1])
+  expect(range(2)).toEqual([0, 1, 2])
 })

source/rangeDescending.js

@@ -1,6 +1,7 @@
 export function rangeDescending(start, b) {
 	const end = b === undefined ? 0 : b
-	if (start <= end) {
+	if (start === end) return [start]
+	if (start < end) {
 		return []
 	}
   const len = start - end

source/rangeDescending.spec.js

@@ -2,7 +2,10 @@ import { rangeDescending } from './rangeDescending.js'
 
 test('happy', () => {
   expect(rangeDescending(5)).toEqual([5, 4, 3, 2, 1, 0])
-	expect(rangeDescending(7,3)).toEqual([7, 6, 5, 4,3])
-	expect(rangeDescending(5, 7)).toEqual([])
-	expect(rangeDescending(5, 5)).toEqual([])
+  expect(rangeDescending(7, 3)).toEqual([7, 6, 5, 4, 3])
+  expect(rangeDescending(0)).toEqual([0])
+  expect(rangeDescending(1)).toEqual([1, 0])
+  expect(rangeDescending(2)).toEqual([2, 1, 0])
+  expect(rangeDescending(5, 7)).toEqual([])
+  expect(rangeDescending(5, 5)).toEqual([5])
 })