radashi 12.3.0 → 12.3.2

package/dist/radashi.cjs

@@ -464,6 +464,9 @@ async function map(array, asyncMapFunc) {
 
 // src/async/parallel.ts
 async function parallel(options, array, func) {
+  if (!array.length) {
+    return [];
+  }
   const work = array.map((item, index) => ({
     index,
     item
@@ -1314,11 +1317,11 @@ function random(min2, max2) {
 // src/random/shuffle.ts
 function shuffle(array, random2 = random) {
   const newArray = array.slice();
-  for (let idx = 0, randomIdx, item; idx < array.length; idx++) {
-    randomIdx = random2(0, array.length - 1);
-    item = newArray[randomIdx];
-    newArray[randomIdx] = newArray[idx];
-    newArray[idx] = item;
+  for (let idx = array.length - 1, randomIdx, item; idx > 0; idx--) {
+    randomIdx = random2(0, idx);
+    item = newArray[idx];
+    newArray[idx] = newArray[randomIdx];
+    newArray[randomIdx] = item;
   }
   return newArray;
 }

package/dist/radashi.d.cts

@@ -2112,7 +2112,9 @@ declare function draw<const T extends readonly any[]>(array: T): T extends reado
 declare function random(min: number, max: number): number;
 
 /**
- * Clone an array and shuffle its items randomly.
+ * Create a new array with the items of the given array but in a random order.
+ * The randomization is done using the [Fisher-Yates algorithm](https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle),
+ * which is mathematically proven to be unbiased (i.e. all permutations are equally likely).
  *
  * @see https://radashi.js.org/reference/random/shuffle
  * @example
@@ -2125,7 +2127,26 @@ declare function random(min: number, max: number): number;
  * ```
  * @version 12.1.0
  */
-declare function shuffle<T>(array: readonly T[], random?: (min: number, max: number) => number): T[];
+declare function shuffle<T>(
+/**
+ * The array to shuffle.
+ */
+array: readonly T[], 
+/**
+ * You can provide a custom random function to make the shuffle more or less
+ * random. The custom random function takes minimum and maximum values and
+ * returns a random number between them.
+ *
+ * @default _.random
+ * @example
+ *
+ * ```ts
+ * const array = [1, 2, 3, 4, 5]
+ * const customRandom = (min, max) => Math.floor(Math.random() * (max - min + 1)) + min
+ * _.shuffle(array, customRandom)
+ * ```
+ */
+random?: (min: number, max: number) => number): T[];
 
 /**
  * Generate a random string of a given length.

package/dist/radashi.d.ts

@@ -2112,7 +2112,9 @@ declare function draw<const T extends readonly any[]>(array: T): T extends reado
 declare function random(min: number, max: number): number;
 
 /**
- * Clone an array and shuffle its items randomly.
+ * Create a new array with the items of the given array but in a random order.
+ * The randomization is done using the [Fisher-Yates algorithm](https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle),
+ * which is mathematically proven to be unbiased (i.e. all permutations are equally likely).
  *
  * @see https://radashi.js.org/reference/random/shuffle
  * @example
@@ -2125,7 +2127,26 @@ declare function random(min: number, max: number): number;
  * ```
  * @version 12.1.0
  */
-declare function shuffle<T>(array: readonly T[], random?: (min: number, max: number) => number): T[];
+declare function shuffle<T>(
+/**
+ * The array to shuffle.
+ */
+array: readonly T[], 
+/**
+ * You can provide a custom random function to make the shuffle more or less
+ * random. The custom random function takes minimum and maximum values and
+ * returns a random number between them.
+ *
+ * @default _.random
+ * @example
+ *
+ * ```ts
+ * const array = [1, 2, 3, 4, 5]
+ * const customRandom = (min, max) => Math.floor(Math.random() * (max - min + 1)) + min
+ * _.shuffle(array, customRandom)
+ * ```
+ */
+random?: (min: number, max: number) => number): T[];
 
 /**
  * Generate a random string of a given length.

package/dist/radashi.js

@@ -462,6 +462,9 @@ async function map(array, asyncMapFunc) {
 
 // src/async/parallel.ts
 async function parallel(options, array, func) {
+  if (!array.length) {
+    return [];
+  }
   const work = array.map((item, index) => ({
     index,
     item
@@ -1312,11 +1315,11 @@ function random(min2, max2) {
 // src/random/shuffle.ts
 function shuffle(array, random2 = random) {
   const newArray = array.slice();
-  for (let idx = 0, randomIdx, item; idx < array.length; idx++) {
-    randomIdx = random2(0, array.length - 1);
-    item = newArray[randomIdx];
-    newArray[randomIdx] = newArray[idx];
-    newArray[idx] = item;
+  for (let idx = array.length - 1, randomIdx, item; idx > 0; idx--) {
+    randomIdx = random2(0, idx);
+    item = newArray[idx];
+    newArray[idx] = newArray[randomIdx];
+    newArray[randomIdx] = item;
   }
   return newArray;
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "radashi",
-  "version": "12.3.0",
+  "version": "12.3.2",
   "type": "module",
   "description": "The modern, community-first TypeScript toolkit with all of the fast, readable, and minimal utility functions you need. Type-safe, dependency-free, tree-shakeable, fully tested.",
   "repository": {
@@ -12,7 +12,7 @@
     "Ray Epps"
   ],
   "license": "MIT",
-  "packageManager": "pnpm@9.1.3",
+  "packageManager": "pnpm@9.15.0",
   "engines": {
     "node": ">=16.0.0"
   },