@thi.ng/arrays 2.11.2 → 2.13.0

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2025-06-09T17:24:08Z
+- **Last updated**: 2025-06-18T12:01:21Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.
@@ -11,6 +11,23 @@ See [Conventional Commits](https://conventionalcommits.org/) for commit guidelin
 **Note:** Unlisted _patch_ versions only involve non-code or otherwise excluded changes
 and/or version bumps of transitive dependencies.
 
+## [2.13.0](https://github.com/thi-ng/umbrella/tree/@thi.ng/arrays@2.13.0) (2025-06-18)
+
+#### 🚀 Features
+
+- add filterAll() ([91791ba](https://github.com/thi-ng/umbrella/commit/91791ba))
+  - add docs & code example
+
+## [2.12.0](https://github.com/thi-ng/umbrella/tree/@thi.ng/arrays@2.12.0) (2025-06-14)
+
+#### 🚀 Features
+
+- add lookup() / lookupUnsafe() fns ([deb2b37](https://github.com/thi-ng/umbrella/commit/deb2b37))
+
+#### ♻️ Refactoring
+
+- minor update swizzle() ([84d3aba](https://github.com/thi-ng/umbrella/commit/84d3aba))
+
 ## [2.11.0](https://github.com/thi-ng/umbrella/tree/@thi.ng/arrays@2.11.0) (2025-04-30)
 
 #### 🚀 Features

package/README.md

@@ -60,7 +60,7 @@ For Node.js REPL:
 const arr = await import("@thi.ng/arrays");
 ```
 
-Package sizes (brotli'd, pre-treeshake): ESM: 3.05 KB
+Package sizes (brotli'd, pre-treeshake): ESM: 3.17 KB
 
 ## Dependencies
 

package/filter-all.d.ts

@@ -0,0 +1,36 @@
+import type { Predicate } from "@thi.ng/api";
+/**
+ * Similar to JS native `filter()`, but for filtering multiple arrays at once.
+ * All arrays are assumed to have the same length as the first. Applies given
+ * predicate `pred` to first array ONLY. If predicate is truthy for the current
+ * index, the values for that index in all arrays will be copied to their
+ * filtered results. Function returns result arrays as tuple.
+ *
+ * @example
+ * ```ts tangle:../export/filter-all.ts
+ * import { filterAll } from "@thi.ng/arrays";
+ *
+ * const [a, b, c] = filterAll(
+ *   (x) => x==="a",
+ *   // the predicate is applied to this array
+ *   ["a", "b", "a"],
+ *   // any number of additional arrays...
+ *   [1, 2, 3],
+ *   [{ id: 123 }, { id: 456 }, { id: 789 }]
+ * );
+ *
+ * console.log("a", a);
+ * // [ "a", "a" ]
+ *
+ * console.log("b", b);
+ * // [ 1, 3 ]
+ *
+ * console.log("c", c);
+ * // [{ id: 123 }, { id: 789 }]
+ * ```
+ *
+ * @param pred
+ * @param xs
+ */
+export declare const filterAll: <A, Xs extends [A[], ...any[][]]>(pred: Predicate<A>, ...xs: Xs) => Xs;
+//# sourceMappingURL=filter-all.d.ts.map

package/filter-all.js

@@ -0,0 +1,13 @@
+const filterAll = (pred, ...xs) => {
+  const res = new Array(xs.length + 1).fill(0).map(() => []);
+  const a = xs[0];
+  for (let i = 0, n = a.length, m = xs.length; i < n; i++) {
+    if (pred(a[i])) {
+      for (let j = 0; j < m; j++) res[j].push(xs[j][i]);
+    }
+  }
+  return res;
+};
+export {
+  filterAll
+};

package/index.d.ts

@@ -8,6 +8,7 @@ export * from "./ends-with.js";
 export * from "./ensure-array.js";
 export * from "./ensure-iterable.js";
 export * from "./fill-range.js";
+export * from "./filter-all.js";
 export * from "./find.js";
 export * from "./find-sequence.js";
 export * from "./floyd-rivest.js";
@@ -17,6 +18,7 @@ export * from "./insert.js";
 export * from "./into.js";
 export * from "./iterator.js";
 export * from "./levenshtein.js";
+export * from "./lookup.js";
 export * from "./peek.js";
 export * from "./permutation.js";
 export * from "./quicksort.js";

package/index.js

@@ -8,6 +8,7 @@ export * from "./ends-with.js";
 export * from "./ensure-array.js";
 export * from "./ensure-iterable.js";
 export * from "./fill-range.js";
+export * from "./filter-all.js";
 export * from "./find.js";
 export * from "./find-sequence.js";
 export * from "./floyd-rivest.js";
@@ -17,6 +18,7 @@ export * from "./insert.js";
 export * from "./into.js";
 export * from "./iterator.js";
 export * from "./levenshtein.js";
+export * from "./lookup.js";
 export * from "./peek.js";
 export * from "./permutation.js";
 export * from "./quicksort.js";

package/lookup.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Similar to {@link swizzle}, but immediate and bounds-checked. Takes an array
+ * of `table` values and an array of indices `ids`. Returns an array of
+ * looked-up values for given IDs, ensuring each index is valid (otherwise
+ * throws an error).
+ *
+ * @example
+ * ```ts tangle:../export/lookup.ts
+ * import { lookup } from "@thi.ng/arrays";
+ *
+ * console.log(lookup([10,20,30], [2,2,0,1,1]));
+ * // [30, 30, 10, 20, 20]
+ *
+ * console.log(lookup([10,20,30], [3]));
+ * // error: index out of bounds: 3
+ * ```
+ *
+ * @param table
+ * @param ids
+ */
+export declare const lookup: <T>(table: ArrayLike<T>, ids: number[]) => T[];
+/**
+ * Non-bounds-checked version of {@link lookup}.
+ *
+ * @param table
+ * @param ids
+ */
+export declare const lookupUnsafe: <T>(table: ArrayLike<T>, ids: number[]) => T[];
+//# sourceMappingURL=lookup.d.ts.map

package/lookup.js

@@ -0,0 +1,7 @@
+import { ensureIndex } from "@thi.ng/errors/out-of-bounds";
+const lookup = (table, ids) => ids.map((i) => (ensureIndex(i, 0, table.length), table[i]));
+const lookupUnsafe = (table, ids) => ids.map((i) => table[i]);
+export {
+  lookup,
+  lookupUnsafe
+};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/arrays",
-  "version": "2.11.2",
+  "version": "2.13.0",
   "description": "Array / Arraylike utilities",
   "type": "module",
   "module": "./index.js",
@@ -56,11 +56,18 @@
     "array",
     "binary",
     "distance",
+    "fill",
+    "floyd-rivest",
     "fuzzy",
     "levenshtein",
+    "lookup",
+    "permutation",
+    "range",
     "search",
+    "sequence",
     "shuffle",
     "sort",
+    "swap",
     "swizzle",
     "topology",
     "typescript"
@@ -109,6 +116,9 @@
     "./fill-range": {
       "default": "./fill-range.js"
     },
+    "./filter-all": {
+      "default": "./filter-all.js"
+    },
     "./find-sequence": {
       "default": "./find-sequence.js"
     },
@@ -136,6 +146,9 @@
     "./levenshtein": {
       "default": "./levenshtein.js"
     },
+    "./lookup": {
+      "default": "./lookup.js"
+    },
     "./peek": {
       "default": "./peek.js"
     },
@@ -174,5 +187,5 @@
     "tag": "array",
     "year": 2018
   },
-  "gitHead": "93cdcd8db4d4669561a7f0ebc47697bdbfd04214\n"
+  "gitHead": "b076434a497b291ad33e81b1a15f6a71e2c82cc2\n"
 }

package/swizzle.js

@@ -21,10 +21,9 @@ const swizzle = (order) => {
       return (x) => [x[a], x[b], x[c], x[d], x[e], x[f], x[g], x[h]];
     default:
       return (x) => {
-        const res = [];
-        for (let i = order.length; i-- > 0; ) {
-          res[i] = x[order[i]];
-        }
+        let n = order.length;
+        const res = new Array(n);
+        for (; n-- > 0; ) res[n] = x[order[n]];
         return res;
       };
   }