@thi.ng/arrays 2.9.4 → 2.9.6

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2024-04-20T14:42:45Z
+- **Last updated**: 2024-05-08T18:24:31Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.

package/blit.js

@@ -1,7 +1,6 @@
 function blit1d(dest, x, src, mask) {
   const [sx, sw, dx, dw] = __clip(0, src.length, x, dest.length);
-  if (sw < 1 || dx >= dw)
-    return dest;
+  if (sw < 1 || dx >= dw) return dest;
   for (let i = 0; i < sw; i++) {
     const val = src[sx + i];
     val !== mask && (dest[dx + i] = val);
@@ -10,8 +9,7 @@ function blit1d(dest, x, src, mask) {
 }
 function blitPred1d(dest, x, src, pred) {
   const [sx, sw, dx, dw] = __clip(0, src.length, x, dest.length);
-  if (sw < 1 || dx >= dw)
-    return dest;
+  if (sw < 1 || dx >= dw) return dest;
   for (let i = 0; i < sw; i++) {
     const val = pred(src[sx + i], dest[dx + i], sx + i);
     val !== void 0 && (dest[dx + i] = val);
@@ -21,8 +19,7 @@ function blitPred1d(dest, x, src, pred) {
 function blit2d(dest, dpos, dsize, src, ssize, mask) {
   const [sx, sw, dx, dw] = __clip(0, ssize[0], dpos[0], dsize[0]);
   const [sy, sh, dy, dh] = __clip(0, ssize[1], dpos[1], dsize[1]);
-  if (sw < 1 || sh < 1 || dx >= dw || dy >= dh)
-    return dest;
+  if (sw < 1 || sh < 1 || dx >= dw || dy >= dh) return dest;
   const sstride = ssize[0];
   const dstride = dsize[0];
   for (let y = 0; y < sh; y++) {

package/ends-with.js

@@ -2,8 +2,7 @@ import { equiv as _eq } from "@thi.ng/equiv";
 const endsWith = (buf, needle, equiv = _eq) => {
   let i = buf.length;
   let j = needle.length;
-  if (i < j)
-    return false;
+  if (i < j) return false;
   while (--i, j-- > 0 && equiv(buf[i], needle[j])) {
   }
   return j < 0;

package/fill-range.js

@@ -1,10 +1,8 @@
 const fillRange = (buf, index = 0, start = 0, end = buf.length, step = end > start ? 1 : -1) => {
   if (step > 0) {
-    for (; start < end; start += step)
-      buf[index++] = start;
+    for (; start < end; start += step) buf[index++] = start;
   } else {
-    for (; start > end; start += step)
-      buf[index++] = start;
+    for (; start > end; start += step) buf[index++] = start;
   }
   return buf;
 };

package/find-sequence.js

@@ -2,12 +2,10 @@ function findSequence(buf, needle, start = 0) {
   const m = buf.length;
   const n = needle.length;
   const max = m - n;
-  if (max < 0)
-    return -1;
+  if (max < 0) return -1;
   while (start < m) {
     const idx = buf.indexOf(needle[0], start);
-    if (idx < 0 || idx > max)
-      return -1;
+    if (idx < 0 || idx > max) return -1;
     let j = n;
     while (j-- > 1) {
       if (buf[idx + j] !== needle[j]) {
@@ -15,8 +13,7 @@ function findSequence(buf, needle, start = 0) {
         break;
       }
     }
-    if (j === 0)
-      return idx;
+    if (j === 0) return idx;
   }
   return -1;
 }

package/find.js

@@ -5,8 +5,7 @@ const find = (buf, x, equiv = _equiv) => {
 };
 const findIndex = (buf, x, equiv = _equiv) => {
   for (let i = buf.length; i-- > 0; ) {
-    if (equiv(x, buf[i]))
-      return i;
+    if (equiv(x, buf[i])) return i;
   }
   return -1;
 };

package/floyd-rivest.js

@@ -20,16 +20,13 @@ function floydRivest(buf, k = 1, cmp = compare, left = 0, right = buf.length - 1
     let i = left;
     let j = right;
     swap(buf, left, k);
-    if (cmp(buf[right], t) > 0)
-      swap(buf, right, left);
+    if (cmp(buf[right], t) > 0) swap(buf, right, left);
     while (i < j) {
       swap(buf, i, j);
       i++;
       j--;
-      while (compare(buf[i], t) < 0)
-        i++;
-      while (compare(buf[j], t) > 0)
-        j--;
+      while (compare(buf[i], t) < 0) i++;
+      while (compare(buf[j], t) > 0) j--;
     }
     if (compare(buf[left], t) === 0) {
       swap(buf, left, j);
@@ -37,10 +34,8 @@ function floydRivest(buf, k = 1, cmp = compare, left = 0, right = buf.length - 1
       j++;
       swap(buf, j, right);
     }
-    if (j <= k)
-      left = j + 1;
-    if (k <= j)
-      right = j - 1;
+    if (j <= k) left = j + 1;
+    if (k <= j) right = j - 1;
   }
   return buf;
 }

package/fuzzy-match.js

@@ -8,16 +8,15 @@ const fuzzyMatch = (domain, query, equiv = _eq) => {
   if (nq === nd) {
     return equiv(query, domain);
   }
-  next:
-    for (let i = 0, j = 0; i < nq; i++) {
-      const q = query[i];
-      while (j < nd) {
-        if (equiv(domain[j++], q)) {
-          continue next;
-        }
+  next: for (let i = 0, j = 0; i < nq; i++) {
+    const q = query[i];
+    while (j < nd) {
+      if (equiv(domain[j++], q)) {
+        continue next;
       }
-      return false;
     }
+    return false;
+  }
   return true;
 };
 export {

package/insert.js

@@ -1,8 +1,7 @@
 const insert = (buf, x, i, k = Infinity) => i < 0 || i >= k || k < 1 ? buf : insertUnsafe(buf, x, i, k);
 const insertUnsafe = (buf, x, i, k = Infinity) => {
   let j = buf.length < k ? buf.length + 1 : k;
-  for (; --j > i; )
-    buf[j] = buf[j - 1];
+  for (; --j > i; ) buf[j] = buf[j - 1];
   buf[i] = x;
   return buf;
 };

package/into.js

@@ -1,7 +1,6 @@
 const into = (dest, src, max = Infinity) => {
   for (let x of src) {
-    if (--max < 0)
-      break;
+    if (--max < 0) break;
     dest.push(x);
   }
   return dest;

package/is-sorted.js

@@ -3,8 +3,7 @@ const isSorted = (arr, cmp = compare, start = 0, end = arr.length) => {
   let prev = arr[start];
   while (++start < end) {
     const curr = arr[start];
-    if (cmp(prev, curr) > 0)
-      return false;
+    if (cmp(prev, curr) > 0) return false;
     prev = curr;
   }
   return true;

package/iterator.js

@@ -1,6 +1,5 @@
 function* arrayIterator(buf, start = 0, end) {
-  if (!buf)
-    return;
+  if (!buf) return;
   end === void 0 && (end = buf.length);
   const step = start <= end ? 1 : -1;
   for (; start !== end; start += step) {

package/levenshtein.js

@@ -67,8 +67,7 @@ const levenshtein = (a, b, maxDist = Infinity, equiv = eqStrict) => {
       d1 = d0;
       d0 = dy;
     }
-    if (minDist > maxDist)
-      return Infinity;
+    if (minDist > maxDist) return Infinity;
   }
   for (; x < lb; ) {
     bx0 = b[offset + (d0 = x)];
@@ -80,8 +79,7 @@ const levenshtein = (a, b, maxDist = Infinity, equiv = eqStrict) => {
       dd < minDist && (minDist = dd);
       d0 = dy;
     }
-    if (minDist > maxDist)
-      return Infinity;
+    if (minDist > maxDist) return Infinity;
   }
   return dd;
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/arrays",
-  "version": "2.9.4",
+  "version": "2.9.6",
   "description": "Array / Arraylike utilities",
   "type": "module",
   "module": "./index.js",
@@ -27,7 +27,7 @@
     "build": "yarn build:esbuild && yarn build:decl",
     "build:decl": "tsc --declaration --emitDeclarationOnly",
     "build:esbuild": "esbuild --format=esm --platform=neutral --target=es2022 --tsconfig=tsconfig.json --outdir=. src/**/*.ts",
-    "clean": "rimraf --glob '*.js' '*.d.ts' '*.map' doc",
+    "clean": "bun ../../tools/src/clean-package.ts",
     "doc": "typedoc --excludePrivate --excludeInternal --out doc src/index.ts",
     "doc:ae": "mkdir -p .ae/doc .ae/temp && api-extractor run --local --verbose",
     "doc:readme": "bun ../../tools/src/module-stats.ts && bun ../../tools/src/readme.ts",
@@ -36,19 +36,18 @@
     "tool:tangle": "../../node_modules/.bin/tangle src/**/*.ts"
   },
   "dependencies": {
-    "@thi.ng/api": "^8.11.0",
-    "@thi.ng/checks": "^3.6.2",
-    "@thi.ng/compare": "^2.3.3",
-    "@thi.ng/equiv": "^2.1.56",
-    "@thi.ng/errors": "^2.5.5",
-    "@thi.ng/random": "^3.7.4"
+    "@thi.ng/api": "^8.11.2",
+    "@thi.ng/checks": "^3.6.4",
+    "@thi.ng/compare": "^2.3.5",
+    "@thi.ng/equiv": "^2.1.58",
+    "@thi.ng/errors": "^2.5.7",
+    "@thi.ng/random": "^3.8.0"
   },
   "devDependencies": {
-    "@microsoft/api-extractor": "^7.43.0",
-    "esbuild": "^0.20.2",
-    "rimraf": "^5.0.5",
-    "typedoc": "^0.25.12",
-    "typescript": "^5.4.3"
+    "@microsoft/api-extractor": "^7.43.2",
+    "esbuild": "^0.21.1",
+    "typedoc": "^0.25.13",
+    "typescript": "^5.4.5"
   },
   "keywords": [
     "aos",
@@ -169,5 +168,5 @@
   "thi.ng": {
     "year": 2018
   },
-  "gitHead": "8339d05ecc857e529c7325a9839c0063b89e728d\n"
+  "gitHead": "df34b4a9e650cc7323575356de207d78933bdcf3\n"
 }

package/quicksort.js

@@ -12,8 +12,7 @@ function quickSort(arr, _cmp = compare, _swap = swap, start = 0, end = arr.lengt
       do {
         e--;
       } while (_cmp(arr[e], pivot) > 0);
-      if (s >= e)
-        break;
+      if (s >= e) break;
       _swap(arr, s, e);
     }
     quickSort(arr, _cmp, _swap, start, e);

package/rotate.js

@@ -1,6 +1,5 @@
 const rotate = (buf, num) => {
-  if (!(num = __distance(buf, num)))
-    return buf;
+  if (!(num = __distance(buf, num))) return buf;
   if (num < 0) {
     buf.push(...buf.splice(0, -num));
   } else {
@@ -9,8 +8,7 @@ const rotate = (buf, num) => {
   return buf;
 };
 const rotateTyped = (buf, num) => {
-  if (!(num = __distance(buf, num)))
-    return buf;
+  if (!(num = __distance(buf, num))) return buf;
   if (num < 0) {
     const tmp = buf.slice(0, -num);
     buf.copyWithin(0, -num);

package/starts-with.js

@@ -2,8 +2,7 @@ import { equiv as _eq } from "@thi.ng/equiv";
 const startsWith = (buf, needle, equiv = _eq) => {
   let i = buf.length;
   let j = needle.length;
-  if (i < j)
-    return false;
+  if (i < j) return false;
   while (-j >= 0 && equiv(buf[j], needle[j])) {
   }
   return j < 0;

package/swap.js

@@ -30,8 +30,7 @@ const multiSwap = (...xs) => {
     default:
       return (a, x, y) => {
         swap(a, x, y);
-        for (let i = n; i-- > 0; )
-          swap(xs[i], x, y);
+        for (let i = n; i-- > 0; ) swap(xs[i], x, y);
       };
   }
 };

package/topo-sort.js

@@ -3,20 +3,16 @@ const topoSort = (nodes, deps) => {
   const cycles = {};
   const topology = [];
   const sort = (id, path) => {
-    if (cycles[id])
-      illegalState(`dependency cycle: ${path.join(" -> ")}`);
+    if (cycles[id]) illegalState(`dependency cycle: ${path.join(" -> ")}`);
     cycles[id] = true;
     const nodeDeps = deps(nodes[id]);
     if (nodeDeps) {
-      for (let d of nodeDeps)
-        sort(d, [...path, d]);
+      for (let d of nodeDeps) sort(d, [...path, d]);
     }
     cycles[id] = false;
-    if (!topology.includes(id))
-      topology.push(id);
+    if (!topology.includes(id)) topology.push(id);
   };
-  for (let id in nodes)
-    sort(id, [id]);
+  for (let id in nodes) sort(id, [id]);
   return topology;
 };
 export {