@thi.ng/zipper 2.1.100 → 2.1.102

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2024-04-23T07:02:19Z
+- **Last updated**: 2024-06-21T19:34:38Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.
@@ -9,6 +9,13 @@ 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.1.102](https://github.com/thi-ng/umbrella/tree/@thi.ng/zipper@2.1.102) (2024-06-21)
+
+#### ♻️ Refactoring
+
+- rename various rest args to be more semantically meaningful ([8088a56](https://github.com/thi-ng/umbrella/commit/8088a56))
+- enforce uniform naming convention of internal functions ([56992b2](https://github.com/thi-ng/umbrella/commit/56992b2))
+
 ### [2.1.99](https://github.com/thi-ng/umbrella/tree/@thi.ng/zipper@2.1.99) (2024-04-20)
 
 #### ♻️ Refactoring

package/README.md

@@ -7,7 +7,7 @@
 [![Mastodon Follow](https://img.shields.io/mastodon/follow/109331703950160316?domain=https%3A%2F%2Fmastodon.thi.ng&style=social)](https://mastodon.thi.ng/@toxi)
 
 > [!NOTE]
-> This is one of 192 standalone projects, maintained as part
+> This is one of 193 standalone projects, maintained as part
 > of the [@thi.ng/umbrella](https://github.com/thi-ng/umbrella/) monorepo
 > and anti-framework.
 >

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/zipper",
-  "version": "2.1.100",
+  "version": "2.1.102",
   "description": "Functional tree editing, manipulation & navigation",
   "type": "module",
   "module": "./index.js",
@@ -10,7 +10,7 @@
     "type": "git",
     "url": "https://github.com/thi-ng/umbrella.git"
   },
-  "homepage": "https://github.com/thi-ng/umbrella/tree/develop/packages/zipper#readme",
+  "homepage": "https://thi.ng/zipper",
   "funding": [
     {
       "type": "github",
@@ -36,16 +36,16 @@
     "tool:tangle": "../../node_modules/.bin/tangle src/**/*.ts"
   },
   "dependencies": {
-    "@thi.ng/api": "^8.11.1",
-    "@thi.ng/arrays": "^2.9.5",
-    "@thi.ng/checks": "^3.6.3",
-    "@thi.ng/errors": "^2.5.6"
+    "@thi.ng/api": "^8.11.3",
+    "@thi.ng/arrays": "^2.9.7",
+    "@thi.ng/checks": "^3.6.5",
+    "@thi.ng/errors": "^2.5.8"
   },
   "devDependencies": {
-    "@microsoft/api-extractor": "^7.43.0",
-    "esbuild": "^0.20.2",
-    "typedoc": "^0.25.12",
-    "typescript": "^5.4.3"
+    "@microsoft/api-extractor": "^7.47.0",
+    "esbuild": "^0.21.5",
+    "typedoc": "^0.25.13",
+    "typescript": "^5.5.2"
   },
   "keywords": [
     "adjacency",
@@ -94,5 +94,5 @@
     ],
     "year": 2015
   },
-  "gitHead": "5dd66c18a3862a3af69a5b2f49563f7cbdd960c2\n"
+  "gitHead": "154c95cf9d6bab32174498ec3b5b5d87e42be7f9\n"
 }

package/zipper.d.ts

@@ -24,7 +24,7 @@ export declare class Location<T> {
     get prev(): Maybe<Location<T>>;
     get next(): Maybe<Location<T>>;
     replace(x: T): Location<T>;
-    update(fn: FnO<T, T>, ...xs: any[]): Location<T>;
+    update(fn: FnO<T, T>, ...args: any[]): Location<T>;
     insertLeft(x: T): Location<T>;
     insertRight(x: T): Location<T>;
     insertChild(x: T): Location<T>;

package/zipper.js

@@ -1,14 +1,14 @@
 import { peek } from "@thi.ng/arrays/peek";
 import { isArray } from "@thi.ng/checks/is-array";
 import { assert } from "@thi.ng/errors/assert";
-const newPath = (l, r, path, nodes, changed = false) => ({
+const __newPath = (l, r, path, nodes, changed = false) => ({
   l,
   r,
   path,
   nodes,
   changed
 });
-const changedPath = (path) => path ? { ...path, changed: true } : void 0;
+const __changedPath = (path) => path ? { ...path, changed: true } : void 0;
 class Location {
   _node;
   _ops;
@@ -57,7 +57,7 @@ class Location {
     return lefts && lefts.length ? new Location(
       peek(lefts),
       this._ops,
-      newPath(
+      __newPath(
         lefts.slice(0, lefts.length - 1),
         [this._node].concat(path.r || []),
         path.path,
@@ -69,13 +69,12 @@ class Location {
   get right() {
     const path = this._path;
     const rights = path && path.r;
-    if (!rights)
-      return;
+    if (!rights) return;
     const r = rights.slice(1);
     return new Location(
       rights[0],
       this._ops,
-      newPath(
+      __newPath(
         (path.l || []).concat([this._node]),
         r.length ? r : void 0,
         path.path,
@@ -90,7 +89,7 @@ class Location {
     return lefts && lefts.length ? new Location(
       lefts[0],
       this._ops,
-      newPath(
+      __newPath(
         void 0,
         lefts.slice(1).concat([this._node], path.r || []),
         path.path,
@@ -105,7 +104,7 @@ class Location {
     return rights ? new Location(
       peek(rights),
       this._ops,
-      newPath(
+      __newPath(
         (path.l || []).concat(
           [this._node],
           rights.slice(0, rights.length - 1)
@@ -118,17 +117,15 @@ class Location {
     ) : this;
   }
   get down() {
-    if (!this.isBranch)
-      return;
+    if (!this.isBranch) return;
     const children = this.children;
-    if (!children)
-      return;
+    if (!children) return;
     const path = this._path;
     const r = children.slice(1);
     return new Location(
       children[0],
       this._ops,
-      newPath(
+      __newPath(
         void 0,
         r.length ? r : void 0,
         path,
@@ -139,8 +136,7 @@ class Location {
   get up() {
     let path = this._path;
     const pnodes = path && path.nodes;
-    if (!pnodes)
-      return;
+    if (!pnodes) return;
     const pnode = peek(pnodes);
     if (path.changed) {
       return new Location(
@@ -149,7 +145,7 @@ class Location {
           (path.l || []).concat([this._node], path.r || [])
         ),
         this._ops,
-        changedPath(path.path)
+        __changedPath(path.path)
       );
     } else {
       return new Location(pnode, this._ops, path.path);
@@ -161,37 +157,31 @@ class Location {
   }
   get prev() {
     let node = this.left;
-    if (!node)
-      return this.up;
+    if (!node) return this.up;
     while (true) {
       const child = node.isBranch ? node.down : void 0;
-      if (!child)
-        return node;
+      if (!child) return node;
       node = child.rightmost;
     }
   }
   get next() {
-    if (this.isBranch)
-      return this.down;
+    if (this.isBranch) return this.down;
     let right = this.right;
-    if (right)
-      return right;
+    if (right) return right;
     let loc = this;
     while (true) {
       const up = loc.up;
-      if (!up)
-        return;
+      if (!up) return;
       right = up.right;
-      if (right)
-        return right;
+      if (right) return right;
       loc = up;
     }
   }
   replace(x) {
-    return new Location(x, this._ops, changedPath(this._path));
+    return new Location(x, this._ops, __changedPath(this._path));
   }
-  update(fn, ...xs) {
-    return this.replace(fn(this._node, ...xs));
+  update(fn, ...args) {
+    return this.replace(fn(this._node, ...args));
   }
   insertLeft(x) {
     this.ensureNotRoot();
@@ -199,7 +189,7 @@ class Location {
     return new Location(
       this._node,
       this._ops,
-      newPath(
+      __newPath(
         path.l ? path.l.concat([x]) : [x],
         path.r,
         path.path,
@@ -214,7 +204,7 @@ class Location {
     return new Location(
       this._node,
       this._ops,
-      newPath(
+      __newPath(
         path.l,
         [x].concat(path.r || []),
         path.path,
@@ -241,7 +231,7 @@ class Location {
       let loc = new Location(
         peek(lefts),
         this._ops,
-        newPath(
+        __newPath(
           lefts.slice(0, lefts.length - 1),
           path.r,
           path.path,
@@ -251,15 +241,14 @@ class Location {
       );
       while (true) {
         const child = loc.isBranch ? loc.down : void 0;
-        if (!child)
-          return loc;
+        if (!child) return loc;
         loc = child.rightmost;
       }
     }
     return new Location(
       this.newNode(peek(path.nodes), path.r || []),
       this._ops,
-      changedPath(path.path)
+      __changedPath(path.path)
     );
   }
   newNode(node, children) {