@milaboratories/pl-tree 1.5.1 → 1.5.3

package/dist/index.mjs

@@ -1,28 +1,33 @@
 var W = Object.defineProperty;
-var M = (o, e, t) => e in o ? W(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t;
-var d = (o, e, t) => M(o, typeof e != "symbol" ? e + "" : e, t);
+var M = (n, e, t) => e in n ? W(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t;
+var d = (n, e, t) => M(n, typeof e != "symbol" ? e + "" : e, t);
 import { resourceIdToString as R, resourceTypesEqual as A, resourceTypeToString as U, isNotNullResourceId as g, NullResourceId as T, isNullResourceId as b, stringifyWithResourceId as D, isTimeoutOrCancelError as J } from "@milaboratories/pl-client";
 import { ChangeSource as m, PollingComputableHooks as q } from "@milaboratories/computable";
 import { parsePlError as V } 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 ae(o, e) {
-  if (o !== void 0)
-    return P(o, e);
+function ae(n, e) {
+  if (n !== void 0)
+    return P(n, e);
 }
-function P(o, e) {
+function P(n, e) {
   const t = {};
-  return o.value !== void 0 && (t.value = e(o.value)), o.error !== void 0 && (t.error = e(o.error)), t;
+  return n.value !== void 0 && (t.value = e(n.value)), n.error !== void 0 && (t.error = e(n.error)), t;
 }
-function ne(o) {
-  return typeof o == "object" && o !== null && o.__pl_tree_type_marker__ === "PlTreeEntry";
+class ne extends Error {
+  constructor(e) {
+    super(e);
+  }
 }
-function oe(o) {
-  return typeof o == "object" && o !== null && o.__pl_tree_type_marker__ === "PlTreeEntryAccessor";
+function oe(n) {
+  return typeof n == "object" && n !== null && n.__pl_tree_type_marker__ === "PlTreeEntry";
 }
-function ue(o) {
-  return typeof o == "object" && o !== null && o.__pl_tree_type_marker__ === "PlTreeNodeAccessor";
+function ue(n) {
+  return typeof n == "object" && n !== null && n.__pl_tree_type_marker__ === "PlTreeEntryAccessor";
+}
+function de(n) {
+  return typeof n == "object" && n !== null && n.__pl_tree_type_marker__ === "PlTreeNodeAccessor";
 }
 class C {
   constructor(e, t) {
@@ -42,23 +47,24 @@ class C {
     return `[ENTRY:${R(this.rid)}]`;
   }
 }
-function N(o, e, t, r, s) {
-  const n = new Y(
-    o,
+function N(n, e, t, r, s) {
+  const o = new Y(
+    n,
     e,
     e.get(t.ctx.watcher, r),
     t
   );
   if (!s.ignoreError) {
-    const a = n.getError();
+    const a = o.getError();
     if (a !== void 0)
-      throw V(p(a.getDataAsString()), n.id, n.resourceType);
+      throw V(p(a.getDataAsString()), o.id, o.resourceType);
   }
-  if (s.assertResourceType !== void 0 && (Array.isArray(s.assertResourceType) ? s.assertResourceType.findIndex((a) => A(a, n.resourceType)) === -1 : !A(s.assertResourceType, n.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 ${U(n.resourceType)} but expected ${s.assertResourceType}`
+      // eslint-disable-next-line @typescript-eslint/no-base-to-string
+      `wrong resource type ${U(o.resourceType)} but expected ${s.assertResourceType}`
     );
-  return n;
+  return o;
 }
 class E {
   constructor(e, t, r, s) {
@@ -69,8 +75,8 @@ class 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 de(o, e) {
-  return o instanceof C ? e.accessor(o).node().resourceInfo : o;
+function ce(n, e) {
+  return n instanceof C ? e.accessor(n).node().resourceInfo : n;
 }
 class Y {
   constructor(e, t, r, s) {
@@ -111,13 +117,13 @@ class Y {
   traverseOrErrorWithCommon(e, ...t) {
     let r = this;
     for (const s of t) {
-      const n = typeof s == "string" ? {
+      const o = typeof s == "string" ? {
         ...e,
         field: s
       } : { ...e, ...s }, a = r.getField(s);
-      if (a === void 0 || n.pureFieldErrorToUndefined && a.value === void 0 && a.error !== void 0)
+      if (a === void 0 || o.pureFieldErrorToUndefined && a.value === void 0 && a.error !== void 0)
         return;
-      if ((!n.ignoreError || a.value === void 0) && a.error !== void 0)
+      if ((!o.ignoreError || a.value === void 0) && a.error !== void 0)
         return {
           ok: !1,
           // FIXME: in next tickets we'll allow Errors to be thrown.
@@ -125,16 +131,16 @@ class Y {
             p(a.error.getDataAsString()),
             r.id,
             r.resourceType,
-            n.field
+            o.field
           )
         };
       if (a.value === void 0) {
-        if (n.errorIfFieldNotSet)
+        if (o.errorIfFieldNotSet)
           return {
             ok: !1,
-            error: `field have no assigned value ${n.field} of ${R(r.id)}`
+            error: new Error(`field have no assigned value ${o.field} of ${R(r.id)}`)
           };
-        this.onUnstableLambda("unpopulated_field:" + n.field);
+        this.onUnstableLambda("unpopulated_field:" + o.field);
         return;
       }
       r = a.value;
@@ -229,9 +235,9 @@ class S extends Error {
   }
 }
 class $ {
-  constructor(e, t, r, s, n, a, i) {
+  constructor(e, t, r, s, o, a, i) {
     d(this, "change", new m());
-    this.name = e, this.type = t, this.value = r, this.error = s, this.status = n, this.valueIsFinal = a, this.resourceVersion = i;
+    this.name = e, this.type = t, this.value = r, this.error = s, this.status = o, this.valueIsFinal = a, this.resourceVersion = i;
   }
   get state() {
     return {
@@ -300,8 +306,8 @@ class G {
   getField(e, t, r = () => {
   }) {
     var a, i, f;
-    const s = typeof t == "string" ? { field: t } : t, n = this.fieldsMap.get(s.field);
-    if (n === void 0) {
+    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 ${R(this.id)}`
@@ -321,12 +327,12 @@ class G {
       (f = this.dynamicFieldListChanged) == null || f.attachWatcher(e), !this._finalState && !s.stableIfNotFound && r("field_not_found:" + s.field);
       return;
     } else {
-      if (s.assertFieldType !== void 0 && n.type !== s.assertFieldType)
+      if (s.assertFieldType !== void 0 && o.type !== s.assertFieldType)
         throw new Error(
-          `Unexpected field type: expected ${s.assertFieldType} but got ${n.type} for the field name ${s.field}`
+          `Unexpected field type: expected ${s.assertFieldType} but got ${o.type} for the field name ${s.field}`
         );
       const l = {};
-      return g(n.value) && (l.value = n.value), g(n.error) && (l.error = n.error), l.value === void 0 && l.error === void 0 && r("field_not_resolved:" + s.field), n.change.attachWatcher(e), l;
+      return g(o.value) && (l.value = o.value), g(o.error) && (l.error = o.error), l.value === void 0 && l.error === void 0 && r("field_not_resolved:" + s.field), o.change.attachWatcher(e), l;
     }
   }
   getInputsLocked(e) {
@@ -359,22 +365,22 @@ class G {
   listInputFields(e) {
     var r;
     const t = [];
-    return this.fieldsMap.forEach((s, n) => {
-      (s.type === "Input" || s.type === "Service") && t.push(n);
+    return this.fieldsMap.forEach((s, o) => {
+      (s.type === "Input" || s.type === "Service") && t.push(o);
     }), this.inputsLocked || (r = this.inputAndServiceFieldListChanged) == null || r.attachWatcher(e), t;
   }
   listOutputFields(e) {
     var r;
     const t = [];
-    return this.fieldsMap.forEach((s, n) => {
-      s.type === "Output" && t.push(n);
+    return this.fieldsMap.forEach((s, o) => {
+      s.type === "Output" && t.push(o);
     }), this.outputsLocked || (r = this.outputFieldListChanged) == null || r.attachWatcher(e), t;
   }
   listDynamicFields(e) {
     var r;
     const t = [];
-    return this.fieldsMap.forEach((s, n) => {
-      s.type !== "Input" && s.type !== "Output" && t.push(n);
+    return this.fieldsMap.forEach((s, o) => {
+      s.type !== "Input" && s.type !== "Output" && t.push(o);
     }), (r = this.dynamicFieldListChanged) == null || r.attachWatcher(e), t;
   }
   getKeyValue(e, t) {
@@ -425,8 +431,8 @@ class G {
   }
   /** Used for invalidation */
   markAllChanged() {
-    var e, t, r, s, n, a, i;
-    this.fieldsMap.forEach((f) => f.change.markChanged()), (e = this.finalChanged) == null || e.markChanged(), (t = this.resourceStateChange) == null || t.markChanged(), (r = this.lockedChange) == null || r.markChanged(), (s = this.inputAndServiceFieldListChanged) == null || s.markChanged(), (n = this.outputFieldListChanged) == null || n.markChanged(), (a = this.dynamicFieldListChanged) == null || a.markChanged(), (i = this.kvChanged) == null || i.markChanged(), this.resourceRemoved.markChanged();
+    var e, t, r, s, o, a, i;
+    this.fieldsMap.forEach((f) => f.change.markChanged()), (e = this.finalChanged) == null || e.markChanged(), (t = this.resourceStateChange) == null || t.markChanged(), (r = this.lockedChange) == null || r.markChanged(), (s = this.inputAndServiceFieldListChanged) == null || s.markChanged(), (o = this.outputFieldListChanged) == null || o.markChanged(), (a = this.dynamicFieldListChanged) == null || a.markChanged(), (i = this.kvChanged) == null || i.markChanged(), this.resourceRemoved.markChanged();
   }
 }
 class O {
@@ -534,10 +540,10 @@ class O {
         throw this.invalidateTree(), new S(`orphan resource ${a}`);
       i.refCount++;
     }
-    let n = s;
-    for (; n.length > 0; ) {
+    let o = s;
+    for (; o.length > 0; ) {
       const a = [];
-      for (const i of n) {
+      for (const i of o) {
         const f = this.resources.get(i);
         if (!f)
           throw this.invalidateTree(), new S(`orphan resource ${i}`);
@@ -545,7 +551,7 @@ class O {
           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(i));
       }
-      n = a;
+      o = a;
     }
     if (!t) {
       for (const a of e)
@@ -569,11 +575,11 @@ class O {
     return Array.from(this.resources.values()).map((e) => e.extendedState);
   }
 }
-function Q(o, e) {
+function Q(n, e) {
   const t = [], r = /* @__PURE__ */ new Set();
-  return o.forEachResource((s) => {
+  return n.forEachResource((s) => {
     s.finalState ? r.add(s.id) : t.push(s.id);
-  }), t.length === 0 && r.size === 0 && t.push(o.root), { seedResources: t, finalResources: r, pruningFunction: e };
+  }), t.length === 0 && r.size === 0 && t.push(n.root), { seedResources: t, finalResources: r, pruningFunction: e };
 }
 function F() {
   return {
@@ -589,33 +595,33 @@ function F() {
     millisSpent: 0
   };
 }
-function ce(o) {
-  let e = `Requests: ${o.requests}
+function he(n) {
+  let e = `Requests: ${n.requests}
 `;
-  return e += `Total time: ${z(o.millisSpent)}
-`, e += `Round-trips: ${o.roundTrips}
-`, e += `Resources: ${o.retrievedResources}
-`, e += `Fields: ${o.retrievedFields}
-`, e += `KV: ${o.retrievedKeyValues}
-`, e += `Data Bytes: ${o.retrievedResourceDataBytes}
-`, e += `KV Bytes: ${o.retrievedKeyValueBytes}
-`, e += `Pruned fields: ${o.prunedFields}
-`, e += `Final resources skipped: ${o.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(o, e, t) {
+async function X(n, e, t) {
   var c;
   const r = Date.now();
   t && t.requests++;
-  const { seedResources: s, finalResources: n, pruningFunction: a } = e, i = new H();
+  const { seedResources: s, finalResources: o, pruningFunction: a } = e, i = new H();
   let f = !0, l = 0;
   const h = /* @__PURE__ */ new Set(), k = (v) => {
     if (b(v) || h.has(v)) return;
-    if (n.has(v)) {
+    if (o.has(v)) {
       t && t.finalResourcesSkipped++;
       return;
     }
     h.add(v);
-    const y = o.getResourceDataIfExists(v, !0), w = o.listKeyValuesIfResourceExists(v), B = f;
+    const y = n.getResourceDataIfExists(v, !0), w = n.listKeyValuesIfResourceExists(v), B = f;
     f && (f = !1), i.push(
       (async () => {
         const [I, _] = await Promise.all([y, w]);
@@ -650,13 +656,13 @@ async function X(o, e, t) {
   }
   return t && (t.millisSpent += Date.now() - r, t.roundTrips += l), u;
 }
-function he(o) {
-  return o;
+function le(n) {
+  return n;
 }
-function le(o, e, t) {
+function fe(n, e, t) {
   var a;
-  const r = o instanceof C ? p(t).accessor(o).node() : o instanceof E ? o.node() : o, n = { ...r.resourceInfo };
-  if (e.data !== void 0 && (e.data === "raw" ? n.data = r.getData() : n.data = e.data.parse(r.getDataAsJson())), e.fields !== void 0) {
+  const r = n instanceof C ? p(t).accessor(n).node() : n instanceof E ? n.node() : n, o = { ...r.resourceInfo };
+  if (e.data !== void 0 && (e.data === "raw" ? o.data = r.getData() : o.data = e.data.parse(r.getDataAsJson())), e.fields !== void 0) {
     const i = {};
     for (const [f, l] of Object.entries(e.fields))
       i[f] = (a = r.traverse({
@@ -664,7 +670,7 @@ function le(o, e, t) {
         errorIfFieldNotSet: l,
         stableIfNotFound: !l
       })) == null ? void 0 : a.id;
-    n.fields = i;
+    o.fields = i;
   }
   if (e.kv !== void 0) {
     const i = {};
@@ -674,13 +680,13 @@ function le(o, e, t) {
         throw new Error(`Key not found ${f}`);
       l === "raw" ? i[f] = h : i[f] = l.parse(JSON.parse(Buffer.from(h).toString("utf-8")));
     }
-    n.kv = i;
+    o.kv = i;
   }
-  return n;
+  return o;
 }
-function fe(o, e, t) {
-  if (o instanceof C) {
-    const r = t.accessor(o).node(), s = r.resourceInfo, n = e.map((a) => {
+function ge(n, e, t) {
+  if (n instanceof C) {
+    const r = t.accessor(n).node(), s = r.resourceInfo, o = e.map((a) => {
       var i, f;
       return [
         a,
@@ -689,18 +695,18 @@ function fe(o, e, t) {
     });
     return {
       ...s,
-      fields: new Map(n),
+      fields: new Map(o),
       data: r.getData() ?? new Uint8Array()
     };
   }
-  return o;
+  return n;
 }
-function ge(o, e, t) {
-  if (!(o instanceof C)) return o;
-  const r = t.accessor(o).node(), s = r.resourceInfo, n = e.map((a) => [a, r.getKeyValue(a)]);
+function pe(n, e, t) {
+  if (!(n instanceof C)) return n;
+  const r = t.accessor(n).node(), s = r.resourceInfo, o = e.map((a) => [a, r.getKeyValue(a)]);
   return {
     ...s,
-    metadata: Object.fromEntries(n)
+    metadata: Object.fromEntries(o)
   };
 }
 class K {
@@ -720,8 +726,8 @@ class K {
     /** If true this tree state is permanently terminaed. */
     d(this, "terminated", !1);
     this.pl = e, this.root = t, this.logger = s;
-    const { finalPredicateOverride: n, pruning: a, pollingInterval: i, stopPollingDelay: f, logStat: l } = r;
-    this.pruning = a, this.pollingInterval = i, this.finalPredicate = n ?? e.finalPredicate, this.logStat = l, this.state = new O(t, this.finalPredicate), this.hooks = new q(
+    const { finalPredicateOverride: o, pruning: a, pollingInterval: i, stopPollingDelay: f, logStat: l } = r;
+    this.pruning = a, this.pollingInterval = i, this.finalPredicate = o ?? e.finalPredicate, this.logStat = l, this.state = new O(t, this.finalPredicate), this.hooks = new q(
       () => this.startUpdating(),
       () => this.stopUpdating(),
       { stopDebounce: f },
@@ -757,7 +763,7 @@ class K {
   /** Executed from the main loop, and initialization procedure. */
   async refresh(e, t) {
     if (this.terminated) throw new Error("tree synchronization is terminated");
-    const r = Q(this.state, this.pruning), s = await this.pl.withReadTx("ReadingTree", async (n) => await X(n, r, e), t);
+    const r = Q(this.state, this.pruning), s = await this.pl.withReadTx("ReadingTree", async (o) => await X(o, r, e), t);
     this.state.updateFromResourceData(s, !0);
   }
   async mainLoop() {
@@ -767,19 +773,19 @@ class K {
       let s;
       this.scheduledOnNextState.length > 0 && (s = this.scheduledOnNextState, this.scheduledOnNextState = []);
       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 n of s) n.resolve();
-      } catch (n) {
-        if (e && this.logger && this.logger.info(`Tree stat (error): ${JSON.stringify(e)}`), s !== void 0) for (const a of s) a.reject(n);
-        if (n instanceof S) {
-          (t = this.logger) == null || t.error(n), this.state.invalidateTree("stat update error"), this.state = new O(this.root, this.finalPredicate);
+        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 a of s) a.reject(o);
+        if (o instanceof S) {
+          (t = this.logger) == null || t.error(o), this.state.invalidateTree("stat update error"), this.state = new O(this.root, this.finalPredicate);
           continue;
-        } else (r = this.logger) == null || r.warn(n);
+        } else (r = this.logger) == null || r.warn(o);
       }
       if (!this.keepRunning || this.terminated) break;
       try {
         await j.setTimeout(this.pollingInterval, this.abortController.signal);
-      } catch (n) {
-        if (!J(n)) throw new Error("Unexpected error", { cause: n });
+      } catch (o) {
+        if (!J(o)) throw new Error("Unexpected error", { cause: o });
         break;
       }
     }
@@ -804,10 +810,10 @@ class K {
     this.currentLoop !== void 0 && await this.currentLoop;
   }
   static async init(e, t, r, s) {
-    const n = new K(e, t, r, s);
-    let a = r.logStat ? F() : void 0, i = !1;
+    const o = new K(e, t, r, s), a = r.logStat ? F() : void 0;
+    let i = !1;
     try {
-      await n.refresh(a, {
+      await o.refresh(a, {
         timeout: r.initialTreeLoadingTimeout
       }), i = !0;
     } finally {
@@ -815,10 +821,10 @@ class K {
         `Tree stat (initial load, ${i ? "success" : "failure"}): ${JSON.stringify(a)}`
       );
     }
-    return n;
+    return o;
   }
 }
-function pe(o) {
+function ve(n) {
   var t;
   const e = {
     total: {
@@ -831,7 +837,7 @@ function pe(o) {
     },
     byResourceType: {}
   };
-  for (const r of o) {
+  for (const r of n) {
     const s = `${r.type.name}/${r.type.version}`;
     e.byResourceType[s] || (e.byResourceType[s] = {
       count: 0,
@@ -841,23 +847,24 @@ function pe(o) {
       kvCount: 0,
       kvBytes: 0
     });
-    const n = e.byResourceType[s];
-    n.count++, e.total.count++;
+    const o = e.byResourceType[s];
+    o.count++, e.total.count++;
     for (const a of r.fields)
-      n.fieldNameBytes += a.name.length, n.fieldsCount++, e.total.fieldNameBytes += a.name.length, e.total.fieldsCount++;
+      o.fieldNameBytes += a.name.length, o.fieldsCount++, e.total.fieldNameBytes += a.name.length, e.total.fieldsCount++;
     if (r.data) {
       const a = ((t = r.data) == null ? void 0 : t.length) ?? 0;
-      n.dataBytes += a, e.total.dataBytes += a;
+      o.dataBytes += a, e.total.dataBytes += a;
     }
-    n.kvCount += r.kv.length, e.total.kvCount += r.kv.length;
+    o.kvCount += r.kv.length, e.total.kvCount += r.kv.length;
     for (const a of r.kv) {
       const i = a.key.length + a.value.length;
-      n.kvBytes += i, e.total.kvBytes += i;
+      o.kvBytes += i, e.total.kvBytes += i;
     }
   }
   return e;
 }
 export {
+  ne as PlError,
   C as PlTreeEntry,
   E as PlTreeEntryAccessor,
   Y as PlTreeNodeAccessor,
@@ -866,19 +873,19 @@ export {
   K as SynchronizedTreeState,
   S as TreeStateUpdateError,
   Q as constructTreeLoadingRequest,
-  ce as formatTreeLoadingStat,
+  he as formatTreeLoadingStat,
   F as initialTreeLoadingStat,
-  ne as isPlTreeEntry,
-  oe as isPlTreeEntryAccessor,
-  ue as isPlTreeNodeAccessor,
+  oe as isPlTreeEntry,
+  ue as isPlTreeEntryAccessor,
+  de as isPlTreeNodeAccessor,
   X as loadTreeState,
-  le as makeResourceSnapshot,
+  fe as makeResourceSnapshot,
   P as mapValueAndError,
   ae as mapValueAndErrorIfDefined,
-  he as rsSchema,
-  pe as treeDumpStats,
-  de as treeEntryToResourceInfo,
-  fe as treeEntryToResourceWithData,
-  ge as treeEntryToResourceWithMetadata
+  le as rsSchema,
+  ve as treeDumpStats,
+  ce as treeEntryToResourceInfo,
+  ge as treeEntryToResourceWithData,
+  pe as treeEntryToResourceWithMetadata
 };
 //# sourceMappingURL=index.mjs.map