@milaboratories/pl-tree 1.4.31 → 1.4.33

package/dist/index.mjs

@@ -1,32 +1,28 @@
-var U = Object.defineProperty;
-var J = (a, e, t) => e in a ? U(a, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : a[e] = t;
-var d = (a, e, t) => J(a, typeof e != "symbol" ? e + "" : e, t);
-import { resourceIdToString as C, resourceTypeToString as A, resourceTypesEqual as $, isNotNullResourceId as g, NullResourceId as D, isNullResourceId as P, stringifyWithResourceId as L, isTimeoutOrCancelError as q } from "@milaboratories/pl-client";
+var M = Object.defineProperty;
+var U = (n, e, t) => e in n ? M(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t;
+var d = (n, e, t) => U(n, typeof e != "symbol" ? e + "" : e, t);
+import { resourceIdToString as S, resourceTypesEqual as A, resourceTypeToString as J, isNotNullResourceId as g, NullResourceId as D, isNullResourceId as V, stringifyWithResourceId as T, isTimeoutOrCancelError as q } from "@milaboratories/pl-client";
 import { ChangeSource as m, PollingComputableHooks as B } from "@milaboratories/computable";
-import { notEmpty as y, msToHumanReadable as z } from "@milaboratories/ts-helpers";
+import { parsePlError as P } from "@milaboratories/pl-errors";
+import { notEmpty as p, msToHumanReadable as z } from "@milaboratories/ts-helpers";
 import H from "denque";
 import * as j from "node:timers/promises";
-function se(a, e) {
-  if (a !== void 0)
-    return b(a, e);
+function ae(n, e) {
+  if (n !== void 0)
+    return b(n, e);
 }
-function b(a, e) {
+function b(n, e) {
   const t = {};
-  return a.value !== void 0 && (t.value = e(a.value)), a.error !== void 0 && (t.error = e(a.error)), t;
+  return n.value !== void 0 && (t.value = e(n.value)), n.error !== void 0 && (t.error = e(n.error)), t;
 }
-class N extends Error {
-  constructor(e) {
-    super(e);
-  }
+function ne(n) {
+  return typeof n == "object" && n !== null && n.__pl_tree_type_marker__ === "PlTreeEntry";
 }
-function ae(a) {
-  return typeof a == "object" && a !== null && a.__pl_tree_type_marker__ === "PlTreeEntry";
+function oe(n) {
+  return typeof n == "object" && n !== null && n.__pl_tree_type_marker__ === "PlTreeEntryAccessor";
 }
-function ne(a) {
-  return typeof a == "object" && a !== null && a.__pl_tree_type_marker__ === "PlTreeEntryAccessor";
-}
-function oe(a) {
-  return typeof a == "object" && a !== null && a.__pl_tree_type_marker__ === "PlTreeNodeAccessor";
+function ue(n) {
+  return typeof n == "object" && n !== null && n.__pl_tree_type_marker__ === "PlTreeNodeAccessor";
 }
 class R {
   constructor(e, t) {
@@ -43,26 +39,24 @@ class R {
     return this.toString();
   }
   toString() {
-    return `[ENTRY:${C(this.rid)}]`;
+    return `[ENTRY:${S(this.rid)}]`;
   }
 }
-function K(a, e, t, i, s) {
+function N(n, e, t, i, s) {
   const o = new Y(
-    a,
+    n,
     e,
     e.get(t.ctx.watcher, i),
     t
   );
   if (!s.ignoreError) {
-    const n = o.getError();
-    if (n !== void 0)
-      throw new N(
-        `error encountered on resource ${C(o.id)} (${A(o.resourceType)}): ${n.getDataAsString()}`
-      );
+    const a = o.getError();
+    if (a !== void 0)
+      throw P(p(a.getDataAsString()), o.id, o.resourceType);
   }
-  if (s.assertResourceType !== void 0 && (Array.isArray(s.assertResourceType) ? s.assertResourceType.findIndex((n) => $(n, o.resourceType)) === -1 : !$(s.assertResourceType, o.resourceType)))
+  if (s.assertResourceType !== void 0 && (Array.isArray(s.assertResourceType) ? s.assertResourceType.findIndex((a) => A(a, o.resourceType)) === -1 : !A(s.assertResourceType, o.resourceType)))
     throw new Error(
-      `wrong resource type ${A(o.resourceType)} but expected ${s.assertResourceType}`
+      `wrong resource type ${J(o.resourceType)} but expected ${s.assertResourceType}`
     );
   return o;
 }
@@ -72,11 +66,11 @@ class E {
     this.accessorData = e, this.tree = t, this.rid = i, this.instanceData = s;
   }
   node(e = {}) {
-    return this.instanceData.guard(), this.accessorData.hooks !== void 0 && this.instanceData.ctx.attacheHooks(this.accessorData.hooks), K(this.accessorData, this.tree, this.instanceData, this.rid, e);
+    return this.instanceData.guard(), this.accessorData.hooks !== void 0 && this.instanceData.ctx.attacheHooks(this.accessorData.hooks), N(this.accessorData, this.tree, this.instanceData, this.rid, e);
   }
 }
-function ue(a, e) {
-  return a instanceof R ? e.accessor(a).node().resourceInfo : a;
+function de(n, e) {
+  return n instanceof R ? e.accessor(n).node().resourceInfo : n;
 }
 class Y {
   constructor(e, t, i, s) {
@@ -99,7 +93,7 @@ class Y {
     return { id: this.id, type: this.resourceType };
   }
   getResourceFromTree(e, t) {
-    return K(this.accessorData, this.tree, this.instanceData, e, t);
+    return N(this.accessorData, this.tree, this.instanceData, e, t);
   }
   traverse(...e) {
     return this.traverseWithCommon({}, ...e);
@@ -110,7 +104,7 @@ class Y {
   traverseWithCommon(e, ...t) {
     const i = this.traverseOrErrorWithCommon(e, ...t);
     if (i !== void 0) {
-      if (!i.ok) throw new N(i.error);
+      if (!i.ok) throw i.error;
       return i.value;
     }
   }
@@ -120,24 +114,30 @@ class Y {
       const o = typeof s == "string" ? {
         ...e,
         field: s
-      } : { ...e, ...s }, n = i.getField(s);
-      if (n === void 0 || o.pureFieldErrorToUndefined && n.value === void 0 && n.error !== void 0)
+      } : { ...e, ...s }, a = i.getField(s);
+      if (a === void 0 || o.pureFieldErrorToUndefined && a.value === void 0 && a.error !== void 0)
         return;
-      if ((!o.ignoreError || n.value === void 0) && n.error !== void 0)
+      if ((!o.ignoreError || a.value === void 0) && a.error !== void 0)
         return {
           ok: !1,
-          error: `error in field ${o.field} of ${C(i.id)}: ${n.error.getDataAsString()}`
+          // FIXME: in next tickets we'll allow Errors to be thrown.
+          error: P(
+            p(a.error.getDataAsString()),
+            i.id,
+            i.resourceType,
+            o.field
+          )
         };
-      if (n.value === void 0) {
+      if (a.value === void 0) {
         if (o.errorIfFieldNotSet)
           return {
             ok: !1,
-            error: `field have no assigned value ${o.field} of ${C(i.id)}`
+            error: `field have no assigned value ${o.field} of ${S(i.id)}`
           };
         this.onUnstableLambda("unpopulated_field:" + o.field);
         return;
       }
-      i = n.value;
+      i = a.value;
     }
     return { ok: !0, value: i };
   }
@@ -223,26 +223,26 @@ class Y {
     return new R(this.accessorData, this.resource.id);
   }
 }
-class S extends Error {
+class C extends Error {
   constructor(e) {
     super(e);
   }
 }
-class x {
-  constructor(e, t, i, s, o, n, r) {
+class $ {
+  constructor(e, t, i, s, o, a, r) {
     d(this, "change", new m());
-    this.name = e, this.type = t, this.value = i, this.error = s, this.status = o, this.valueIsFinal = n, this.resourceVersion = r;
+    this.name = e, this.type = t, this.value = i, this.error = s, this.status = o, this.valueIsFinal = a, this.resourceVersion = r;
   }
 }
-const T = 0, O = new TextDecoder();
+const L = 0, x = new TextDecoder();
 class G {
   constructor(e, t) {
     /** Tracks number of other resources referencing this resource. Used to perform garbage collection in tree patching procedure */
     d(this, "refCount", 0);
     /** Increments each time resource is checked for difference with new state */
-    d(this, "version", T);
+    d(this, "version", L);
     /** Set to resource version when resource state, or it's fields have changed */
-    d(this, "dataVersion", T);
+    d(this, "dataVersion", L);
     d(this, "fieldsMap", /* @__PURE__ */ new Map());
     d(this, "kv", /* @__PURE__ */ new Map());
     d(this, "resourceRemoved", new m());
@@ -289,14 +289,14 @@ class G {
   }
   getField(e, t, i = () => {
   }) {
-    var n, r, f;
+    var a, r, f;
     const s = typeof t == "string" ? { field: t } : t, o = this.fieldsMap.get(s.field);
     if (o === void 0) {
       if (s.errorIfFieldNotFound || s.errorIfFieldNotSet)
         throw new Error(
-          `Field "${s.field}" not found in resource ${C(this.id)}`
+          `Field "${s.field}" not found in resource ${S(this.id)}`
         );
-      if (!this.inputsLocked) (n = this.inputAndServiceFieldListChanged) == null || n.attachWatcher(e);
+      if (!this.inputsLocked) (a = this.inputAndServiceFieldListChanged) == null || a.attachWatcher(e);
       else if (s.assertFieldType === "Service" || s.assertFieldType === "Input") {
         if (s.allowPermanentAbsence)
           return;
@@ -340,7 +340,7 @@ class G {
   }
   getError(e) {
     var t;
-    if (P(this.error)) {
+    if (V(this.error)) {
       (t = this.resourceStateChange) == null || t.attachWatcher(e);
       return;
     } else
@@ -374,11 +374,11 @@ class G {
   getKeyValueString(e, t) {
     const i = this.getKeyValue(e, t);
     if (i !== void 0)
-      return O.decode(i);
+      return x.decode(i);
   }
   getDataAsString() {
     if (this.data !== void 0)
-      return this.dataAsString === void 0 && (this.dataAsString = O.decode(this.data)), this.dataAsString;
+      return this.dataAsString === void 0 && (this.dataAsString = x.decode(this.data)), this.dataAsString;
   }
   getDataAsJson() {
     if (this.data !== void 0)
@@ -386,7 +386,7 @@ class G {
   }
   verifyReadyState() {
     if (this.resourceReady && !this.inputsLocked)
-      throw new Error(`ready without input or output lock: ${L(this.state)}`);
+      throw new Error(`ready without input or output lock: ${T(this.state)}`);
   }
   get state() {
     return {
@@ -404,15 +404,15 @@ class G {
   }
   /** Called when {@link FinalResourceDataPredicate} returns true for the state. */
   markFinal() {
-    this._finalState || (this._finalState = !0, y(this.finalChanged).markChanged(), this.finalChanged = void 0, this.resourceStateChange = void 0, this.dynamicFieldListChanged = void 0, this.inputAndServiceFieldListChanged = void 0, this.outputFieldListChanged = void 0, this.lockedChange = void 0);
+    this._finalState || (this._finalState = !0, p(this.finalChanged).markChanged(), this.finalChanged = void 0, this.resourceStateChange = void 0, this.dynamicFieldListChanged = void 0, this.inputAndServiceFieldListChanged = void 0, this.outputFieldListChanged = void 0, this.lockedChange = void 0);
   }
   /** Used for invalidation */
   markAllChanged() {
-    var e, t, i, s, o, n, r;
-    this.fieldsMap.forEach((f) => f.change.markChanged()), (e = this.finalChanged) == null || e.markChanged(), (t = this.resourceStateChange) == null || t.markChanged(), (i = this.lockedChange) == null || i.markChanged(), (s = this.inputAndServiceFieldListChanged) == null || s.markChanged(), (o = this.outputFieldListChanged) == null || o.markChanged(), (n = this.dynamicFieldListChanged) == null || n.markChanged(), (r = this.kvChanged) == null || r.markChanged(), this.resourceRemoved.markChanged();
+    var e, t, i, s, o, a, r;
+    this.fieldsMap.forEach((f) => f.change.markChanged()), (e = this.finalChanged) == null || e.markChanged(), (t = this.resourceStateChange) == null || t.markChanged(), (i = this.lockedChange) == null || i.markChanged(), (s = this.inputAndServiceFieldListChanged) == null || s.markChanged(), (o = this.outputFieldListChanged) == null || o.markChanged(), (a = this.dynamicFieldListChanged) == null || a.markChanged(), (r = this.kvChanged) == null || r.markChanged(), this.resourceRemoved.markChanged();
   }
 }
-class V {
+class O {
   constructor(e, t) {
     /** resource heap */
     d(this, "resources", /* @__PURE__ */ new Map());
@@ -433,33 +433,33 @@ class V {
     this.checkValid();
     const i = this.resources.get(t);
     if (i === void 0)
-      throw this.resourcesAdded.attachWatcher(e), new Error(`resource ${C(t)} not found in the tree`);
+      throw this.resourcesAdded.attachWatcher(e), new Error(`resource ${S(t)} not found in the tree`);
     return i.resourceRemoved.attachWatcher(e), i;
   }
   updateFromResourceData(e, t = !1) {
     this.checkValid();
     const i = [], s = [];
-    for (const n of e) {
-      let r = this.resources.get(n.id);
+    for (const a of e) {
+      let r = this.resources.get(a.id);
       const f = r == null ? void 0 : r.state, l = (h) => {
-        const { fields: k, ...u } = n;
-        throw this.invalidateTree(), new S(
-          `Unexpected resource state transition (${h}): ${L(
+        const { fields: k, ...u } = a;
+        throw this.invalidateTree(), new C(
+          `Unexpected resource state transition (${h}): ${T(
             u
-          )} -> ${L(f)}`
+          )} -> ${T(f)}`
         );
       };
       if (r !== void 0) {
         r.finalState && l("resource state can	 be updated after it is marked as final");
         let h = !1;
-        r.version += 1, r.originalResourceId !== n.originalResourceId && (r.originalResourceId !== D && l("originalResourceId can't change after it is set"), r.originalResourceId = n.originalResourceId, y(r.resourceStateChange).markChanged(), h = !0), r.error !== n.error && (g(r.error) && l("resource can't change attached error after it is set"), r.error = n.error, i.push(r.error), y(r.resourceStateChange).markChanged(), h = !0);
-        for (const u of n.fields) {
+        r.version += 1, r.originalResourceId !== a.originalResourceId && (r.originalResourceId !== D && l("originalResourceId can't change after it is set"), r.originalResourceId = a.originalResourceId, p(r.resourceStateChange).markChanged(), h = !0), r.error !== a.error && (g(r.error) && l("resource can't change attached error after it is set"), r.error = a.error, i.push(r.error), p(r.resourceStateChange).markChanged(), h = !0);
+        for (const u of a.fields) {
           let c = r.fieldsMap.get(u.name);
-          c ? (c.type !== u.type && (c.type !== "Dynamic" && l(`field changed type ${c.type} -> ${u.type}`), y(r.dynamicFieldListChanged).markChanged(), (c.type === "Input" || c.type === "Service") && (r.inputsLocked && l(
+          c ? (c.type !== u.type && (c.type !== "Dynamic" && l(`field changed type ${c.type} -> ${u.type}`), p(r.dynamicFieldListChanged).markChanged(), (c.type === "Input" || c.type === "Service") && (r.inputsLocked && l(
             `adding input field "${u.name}", while corresponding list is locked`
-          ), y(r.inputAndServiceFieldListChanged).markChanged()), c.type === "Output" && (r.outputsLocked && l(
+          ), p(r.inputAndServiceFieldListChanged).markChanged()), c.type === "Output" && (r.outputsLocked && l(
             `adding output field "${u.name}", while corresponding list is locked`
-          ), y(r.outputFieldListChanged).markChanged()), c.type = u.type, c.change.markChanged(), h = !0), c.value !== u.value && (g(c.value) && s.push(c.value), c.value = u.value, g(u.value) && i.push(u.value), c.change.markChanged(), h = !0), c.error !== u.error && (g(c.error) && s.push(c.error), c.error = u.error, g(u.error) && i.push(u.error), c.change.markChanged(), h = !0), c.status !== u.status && (c.status = u.status, c.change.markChanged(), h = !0), c.valueIsFinal !== u.valueIsFinal && (c.valueIsFinal = u.valueIsFinal, c.change.markChanged(), h = !0), c.resourceVersion = r.version) : (c = new x(
+          ), p(r.outputFieldListChanged).markChanged()), c.type = u.type, c.change.markChanged(), h = !0), c.value !== u.value && (g(c.value) && s.push(c.value), c.value = u.value, g(u.value) && i.push(u.value), c.change.markChanged(), h = !0), c.error !== u.error && (g(c.error) && s.push(c.error), c.error = u.error, g(u.error) && i.push(u.error), c.change.markChanged(), h = !0), c.status !== u.status && (c.status = u.status, c.change.markChanged(), h = !0), c.valueIsFinal !== u.valueIsFinal && (c.valueIsFinal = u.valueIsFinal, c.change.markChanged(), h = !0), c.resourceVersion = r.version) : (c = new $(
             u.name,
             u.type,
             u.value,
@@ -469,71 +469,71 @@ class V {
             r.version
           ), g(u.value) && i.push(u.value), g(u.error) && i.push(u.error), u.type === "Input" || u.type === "Service" ? (r.inputsLocked && l(
             `adding ${u.type} (${u.name}) field while inputs locked`
-          ), y(r.inputAndServiceFieldListChanged).markChanged()) : u.type === "Output" ? (r.outputsLocked && l(
+          ), p(r.inputAndServiceFieldListChanged).markChanged()) : u.type === "Output" ? (r.outputsLocked && l(
             `adding ${u.type} (${u.name}) field while outputs locked`
-          ), y(r.outputFieldListChanged).markChanged()) : y(r.dynamicFieldListChanged).markChanged(), r.fieldsMap.set(u.name, c), h = !0);
+          ), p(r.outputFieldListChanged).markChanged()) : p(r.dynamicFieldListChanged).markChanged(), r.fieldsMap.set(u.name, c), h = !0);
         }
-        if (r.fieldsMap.forEach((u, c, p) => {
-          u.resourceVersion !== r.version && ((u.type === "Input" || u.type === "Service" || u.type === "Output") && l(`removal of ${u.type} field ${c}`), u.change.markChanged(), p.delete(c), g(u.value) && s.push(u.value), g(u.error) && s.push(u.error), y(r.dynamicFieldListChanged).markChanged());
-        }), r.inputsLocked !== n.inputsLocked && (r.inputsLocked && l("inputs unlocking is not permitted"), r.inputsLocked = n.inputsLocked, y(r.lockedChange).markChanged(), h = !0), r.outputsLocked !== n.outputsLocked && (r.outputsLocked && l("outputs unlocking is not permitted"), r.outputsLocked = n.outputsLocked, y(r.lockedChange).markChanged(), h = !0), r.resourceReady !== n.resourceReady) {
+        if (r.fieldsMap.forEach((u, c, v) => {
+          u.resourceVersion !== r.version && ((u.type === "Input" || u.type === "Service" || u.type === "Output") && l(`removal of ${u.type} field ${c}`), u.change.markChanged(), v.delete(c), g(u.value) && s.push(u.value), g(u.error) && s.push(u.error), p(r.dynamicFieldListChanged).markChanged());
+        }), r.inputsLocked !== a.inputsLocked && (r.inputsLocked && l("inputs unlocking is not permitted"), r.inputsLocked = a.inputsLocked, p(r.lockedChange).markChanged(), h = !0), r.outputsLocked !== a.outputsLocked && (r.outputsLocked && l("outputs unlocking is not permitted"), r.outputsLocked = a.outputsLocked, p(r.lockedChange).markChanged(), h = !0), r.resourceReady !== a.resourceReady) {
           const u = r.resourceReady;
-          r.resourceReady = n.resourceReady, r.verifyReadyState(), r.isReadyOrError || l(
+          r.resourceReady = a.resourceReady, r.verifyReadyState(), r.isReadyOrError || l(
             `resource can't lose it's ready or error state (ready state before ${u})`
-          ), y(r.resourceStateChange).markChanged(), h = !0;
+          ), p(r.resourceStateChange).markChanged(), h = !0;
         }
         let k = !1;
-        for (const u of n.kv) {
+        for (const u of a.kv) {
           const c = r.kv.get(u.key);
           (c === void 0 || Buffer.compare(c, u.value) !== 0) && (r.kv.set(u.key, u.value), k = !0);
         }
-        if (r.kv.size > n.kv.length) {
-          const u = new Set(n.kv.map((c) => c.key));
-          r.kv.forEach((c, p, v) => {
-            u.has(p) || v.delete(p);
+        if (r.kv.size > a.kv.length) {
+          const u = new Set(a.kv.map((c) => c.key));
+          r.kv.forEach((c, v, y) => {
+            u.has(v) || y.delete(v);
           }), k = !0;
         }
-        k && y(r.kvChanged).markChanged(), h && (r.dataVersion = r.version, this.isFinalPredicate(r) && r.markFinal());
+        k && p(r.kvChanged).markChanged(), h && (r.dataVersion = r.version, this.isFinalPredicate(r) && r.markFinal());
       } else {
-        r = new G(n), r.verifyReadyState(), g(r.error) && i.push(r.error);
-        for (const h of n.fields) {
-          const k = new x(
+        r = new G(a), r.verifyReadyState(), g(r.error) && i.push(r.error);
+        for (const h of a.fields) {
+          const k = new $(
             h.name,
             h.type,
             h.value,
             h.error,
             h.status,
             h.valueIsFinal,
-            T
+            L
           );
           g(h.value) && i.push(h.value), g(h.error) && i.push(h.error), r.fieldsMap.set(h.name, k);
         }
-        for (const h of n.kv) r.kv.set(h.key, h.value);
+        for (const h of a.kv) r.kv.set(h.key, h.value);
         this.isFinalPredicate(r) && r.markFinal(), this.resources.set(r.id, r), this.resourcesAdded.markChanged();
       }
     }
-    for (const n of i) {
-      const r = this.resources.get(n);
+    for (const a of i) {
+      const r = this.resources.get(a);
       if (!r)
-        throw this.invalidateTree(), new S(`orphan resource ${n}`);
+        throw this.invalidateTree(), new C(`orphan resource ${a}`);
       r.refCount++;
     }
     let o = s;
     for (; o.length > 0; ) {
-      const n = [];
+      const a = [];
       for (const r of o) {
         const f = this.resources.get(r);
         if (!f)
-          throw this.invalidateTree(), new S(`orphan resource ${r}`);
+          throw this.invalidateTree(), new C(`orphan resource ${r}`);
         f.refCount--, f.refCount === 0 && f.id !== this.root && (f.fieldsMap.forEach((l) => {
-          g(l.value) && n.push(l.value), g(l.error) && n.push(l.error), l.change.markChanged();
-        }), g(f.error) && n.push(f.error), f.resourceRemoved.markChanged(), this.resources.delete(r));
+          g(l.value) && a.push(l.value), g(l.error) && a.push(l.error), l.change.markChanged();
+        }), g(f.error) && a.push(f.error), f.resourceRemoved.markChanged(), this.resources.delete(r));
       }
-      o = n;
+      o = a;
     }
     if (!t) {
-      for (const n of e)
-        if (!this.resources.has(n.id))
-          throw this.invalidateTree(), new S(`orphan input resource ${n.id}`);
+      for (const a of e)
+        if (!this.resources.has(a.id))
+          throw this.invalidateTree(), new C(`orphan input resource ${a.id}`);
     }
   }
   /** @deprecated use "entry" instead */
@@ -549,11 +549,11 @@ class V {
     });
   }
 }
-function Q(a, e) {
+function Q(n, e) {
   const t = [], i = /* @__PURE__ */ new Set();
-  return a.forEachResource((s) => {
+  return n.forEachResource((s) => {
     s.finalState ? i.add(s.id) : t.push(s.id);
-  }), t.length === 0 && i.size === 0 && t.push(a.root), { seedResources: t, finalResources: i, pruningFunction: e };
+  }), t.length === 0 && i.size === 0 && t.push(n.root), { seedResources: t, finalResources: i, pruningFunction: e };
 }
 function F() {
   return {
@@ -569,81 +569,81 @@ function F() {
     millisSpent: 0
   };
 }
-function de(a) {
-  let e = `Requests: ${a.requests}
+function ce(n) {
+  let e = `Requests: ${n.requests}
 `;
-  return e += `Total time: ${z(a.millisSpent)}
-`, e += `Round-trips: ${a.roundTrips}
-`, e += `Resources: ${a.retrievedResources}
-`, e += `Fields: ${a.retrievedFields}
-`, e += `KV: ${a.retrievedKeyValues}
-`, e += `Data Bytes: ${a.retrievedResourceDataBytes}
-`, e += `KV Bytes: ${a.retrievedKeyValueBytes}
-`, e += `Pruned fields: ${a.prunedFields}
-`, e += `Final resources skipped: ${a.finalResourcesSkipped}`, e;
+  return e += `Total time: ${z(n.millisSpent)}
+`, e += `Round-trips: ${n.roundTrips}
+`, e += `Resources: ${n.retrievedResources}
+`, e += `Fields: ${n.retrievedFields}
+`, e += `KV: ${n.retrievedKeyValues}
+`, e += `Data Bytes: ${n.retrievedResourceDataBytes}
+`, e += `KV Bytes: ${n.retrievedKeyValueBytes}
+`, e += `Pruned fields: ${n.prunedFields}
+`, e += `Final resources skipped: ${n.finalResourcesSkipped}`, e;
 }
-async function X(a, e, t) {
+async function X(n, e, t) {
   var c;
   const i = Date.now();
   t && t.requests++;
-  const { seedResources: s, finalResources: o, pruningFunction: n } = e, r = new H();
+  const { seedResources: s, finalResources: o, pruningFunction: a } = e, r = new H();
   let f = !0, l = 0;
-  const h = /* @__PURE__ */ new Set(), k = (p) => {
-    if (P(p) || h.has(p)) return;
-    if (o.has(p)) {
+  const h = /* @__PURE__ */ new Set(), k = (v) => {
+    if (V(v) || h.has(v)) return;
+    if (o.has(v)) {
       t && t.finalResourcesSkipped++;
       return;
     }
-    h.add(p);
-    const v = a.getResourceDataIfExists(p, !0), w = a.listKeyValuesIfResourceExists(p), M = f;
+    h.add(v);
+    const y = n.getResourceDataIfExists(v, !0), w = n.listKeyValuesIfResourceExists(v), W = f;
     f && (f = !1), r.push(
       (async () => {
-        const [I, _] = await Promise.all([v, w]);
-        if (M && (l++, f = !0), I !== void 0) {
+        const [I, _] = await Promise.all([y, w]);
+        if (W && (l++, f = !0), I !== void 0) {
           if (_ === void 0) throw new Error("Inconsistent replies");
           return { ...I, kv: _ };
         }
       })()
     );
   };
-  s.forEach((p) => k(p));
+  s.forEach((v) => k(v));
   const u = [];
   for (; ; ) {
-    const p = r.shift();
-    if (p === void 0)
+    const v = r.shift();
+    if (v === void 0)
       break;
-    let v = await p;
-    if (v !== void 0) {
-      if (n !== void 0) {
-        const w = n(v);
-        t && (t.prunedFields += v.fields.length - w.length), v = { ...v, fields: w };
+    let y = await v;
+    if (y !== void 0) {
+      if (a !== void 0) {
+        const w = a(y);
+        t && (t.prunedFields += y.fields.length - w.length), y = { ...y, fields: w };
       }
-      k(v.error);
-      for (const w of v.fields)
+      k(y.error);
+      for (const w of y.fields)
         k(w.value), k(w.error);
       if (t) {
-        t.retrievedResources++, t.retrievedFields += v.fields.length, t.retrievedKeyValues += v.kv.length, t.retrievedResourceDataBytes += ((c = v.data) == null ? void 0 : c.length) ?? 0;
-        for (const w of v.kv) t.retrievedKeyValueBytes += w.value.length;
+        t.retrievedResources++, t.retrievedFields += y.fields.length, t.retrievedKeyValues += y.kv.length, t.retrievedResourceDataBytes += ((c = y.data) == null ? void 0 : c.length) ?? 0;
+        for (const w of y.kv) t.retrievedKeyValueBytes += w.value.length;
       }
-      u.push(v);
+      u.push(y);
     }
   }
   return t && (t.millisSpent += Date.now() - i, t.roundTrips += l), u;
 }
-function ce(a) {
-  return a;
+function he(n) {
+  return n;
 }
-function he(a, e, t) {
-  var n;
-  const i = a instanceof R ? y(t).accessor(a).node() : a instanceof E ? a.node() : a, o = { ...i.resourceInfo };
+function le(n, e, t) {
+  var a;
+  const i = n instanceof R ? p(t).accessor(n).node() : n instanceof E ? n.node() : n, o = { ...i.resourceInfo };
   if (e.data !== void 0 && (e.data === "raw" ? o.data = i.getData() : o.data = e.data.parse(i.getDataAsJson())), e.fields !== void 0) {
     const r = {};
     for (const [f, l] of Object.entries(e.fields))
-      r[f] = (n = i.traverse({
+      r[f] = (a = i.traverse({
         field: f,
         errorIfFieldNotSet: l,
         stableIfNotFound: !l
-      })) == null ? void 0 : n.id;
+      })) == null ? void 0 : a.id;
     o.fields = r;
   }
   if (e.kv !== void 0) {
@@ -658,13 +658,13 @@ function he(a, e, t) {
   }
   return o;
 }
-function le(a, e, t) {
-  if (a instanceof R) {
-    const i = t.accessor(a).node(), s = i.resourceInfo, o = e.map((n) => {
+function fe(n, e, t) {
+  if (n instanceof R) {
+    const i = t.accessor(n).node(), s = i.resourceInfo, o = e.map((a) => {
       var r, f;
       return [
-        n,
-        (f = (r = i.getField(n)) == null ? void 0 : r.value) == null ? void 0 : f.id
+        a,
+        (f = (r = i.getField(a)) == null ? void 0 : r.value) == null ? void 0 : f.id
       ];
     });
     return {
@@ -673,17 +673,17 @@ function le(a, e, t) {
       data: i.getData() ?? new Uint8Array()
     };
   }
-  return a;
+  return n;
 }
-function fe(a, e, t) {
-  if (!(a instanceof R)) return a;
-  const i = t.accessor(a).node(), s = i.resourceInfo, o = e.map((n) => [n, i.getKeyValue(n)]);
+function ge(n, e, t) {
+  if (!(n instanceof R)) return n;
+  const i = t.accessor(n).node(), s = i.resourceInfo, o = e.map((a) => [a, i.getKeyValue(a)]);
   return {
     ...s,
     metadata: Object.fromEntries(o)
   };
 }
-class W {
+class K {
   constructor(e, t, i, s) {
     d(this, "finalPredicate");
     d(this, "state");
@@ -700,8 +700,8 @@ class W {
     /** If true this tree state is permanently terminaed. */
     d(this, "terminated", !1);
     this.pl = e, this.root = t, this.logger = s;
-    const { finalPredicateOverride: o, pruning: n, pollingInterval: r, stopPollingDelay: f, logStat: l } = i;
-    this.pruning = n, this.pollingInterval = r, this.finalPredicate = o ?? e.finalPredicate, this.logStat = l, this.state = new V(t, this.finalPredicate), this.hooks = new B(
+    const { finalPredicateOverride: o, pruning: a, pollingInterval: r, stopPollingDelay: f, logStat: l } = i;
+    this.pruning = a, this.pollingInterval = r, this.finalPredicate = o ?? e.finalPredicate, this.logStat = l, this.state = new O(t, this.finalPredicate), this.hooks = new B(
       () => this.startUpdating(),
       () => this.stopUpdating(),
       { stopDebounce: f },
@@ -749,9 +749,9 @@ class W {
       try {
         if (this.logStat === "per-request" && (e = F()), await this.refresh(e), e && this.logger && this.logger.info(`Tree stat (success): ${JSON.stringify(e)}`), s !== void 0) for (const o of s) o.resolve();
       } catch (o) {
-        if (e && this.logger && this.logger.info(`Tree stat (error): ${JSON.stringify(e)}`), s !== void 0) for (const n of s) n.reject(o);
-        if (o instanceof S) {
-          (t = this.logger) == null || t.error(o), this.state.invalidateTree("stat update error"), this.state = new V(this.root, this.finalPredicate);
+        if (e && this.logger && this.logger.info(`Tree stat (error): ${JSON.stringify(e)}`), s !== void 0) for (const a of s) a.reject(o);
+        if (o instanceof C) {
+          (t = this.logger) == null || t.error(o), this.state.invalidateTree("stat update error"), this.state = new O(this.root, this.finalPredicate);
           continue;
         } else (i = this.logger) == null || i.warn(o);
       }
@@ -777,40 +777,39 @@ class W {
     this.currentLoop !== void 0 && await this.currentLoop;
   }
   static async init(e, t, i, s) {
-    const o = new W(e, t, i, s);
-    let n = i.logStat ? F() : void 0, r = !1;
+    const o = new K(e, t, i, s);
+    let a = i.logStat ? F() : void 0, r = !1;
     try {
-      await o.refresh(n), r = !0;
+      await o.refresh(a), r = !0;
     } finally {
-      n && s && s.info(
-        `Tree stat (initial load, ${r ? "success" : "failure"}): ${JSON.stringify(n)}`
+      a && s && s.info(
+        `Tree stat (initial load, ${r ? "success" : "failure"}): ${JSON.stringify(a)}`
       );
     }
     return o;
   }
 }
 export {
-  N as PlError,
   R as PlTreeEntry,
   E as PlTreeEntryAccessor,
   Y as PlTreeNodeAccessor,
   G as PlTreeResource,
-  V as PlTreeState,
-  W as SynchronizedTreeState,
-  S as TreeStateUpdateError,
+  O as PlTreeState,
+  K as SynchronizedTreeState,
+  C as TreeStateUpdateError,
   Q as constructTreeLoadingRequest,
-  de as formatTreeLoadingStat,
+  ce as formatTreeLoadingStat,
   F as initialTreeLoadingStat,
-  ae as isPlTreeEntry,
-  ne as isPlTreeEntryAccessor,
-  oe as isPlTreeNodeAccessor,
+  ne as isPlTreeEntry,
+  oe as isPlTreeEntryAccessor,
+  ue as isPlTreeNodeAccessor,
   X as loadTreeState,
-  he as makeResourceSnapshot,
+  le as makeResourceSnapshot,
   b as mapValueAndError,
-  se as mapValueAndErrorIfDefined,
-  ce as rsSchema,
-  ue as treeEntryToResourceInfo,
-  le as treeEntryToResourceWithData,
-  fe as treeEntryToResourceWithMetadata
+  ae as mapValueAndErrorIfDefined,
+  he as rsSchema,
+  de as treeEntryToResourceInfo,
+  fe as treeEntryToResourceWithData,
+  ge as treeEntryToResourceWithMetadata
 };
 //# sourceMappingURL=index.mjs.map