@milaboratories/pl-tree 1.5.5 → 1.5.7

package/dist/index.mjs

@@ -4,10 +4,10 @@ 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(n, e) {
+import { notEmpty as p, deepFreeze as z, msToHumanReadable as H } from "@milaboratories/ts-helpers";
+import j from "denque";
+import * as Y from "node:timers/promises";
+function ne(n, e) {
   if (n !== void 0)
     return P(n, e);
 }
@@ -15,18 +15,18 @@ function P(n, e) {
   const t = {};
   return n.value !== void 0 && (t.value = e(n.value)), n.error !== void 0 && (t.error = e(n.error)), t;
 }
-class ne extends Error {
+class oe extends Error {
   constructor(e) {
     super(e);
   }
 }
-function oe(n) {
+function ue(n) {
   return typeof n == "object" && n !== null && n.__pl_tree_type_marker__ === "PlTreeEntry";
 }
-function ue(n) {
+function de(n) {
   return typeof n == "object" && n !== null && n.__pl_tree_type_marker__ === "PlTreeEntryAccessor";
 }
-function de(n) {
+function ce(n) {
   return typeof n == "object" && n !== null && n.__pl_tree_type_marker__ === "PlTreeNodeAccessor";
 }
 class C {
@@ -48,7 +48,7 @@ class C {
   }
 }
 function N(n, e, t, r, s) {
-  const o = new Y(
+  const o = new G(
     n,
     e,
     e.get(t.ctx.watcher, r),
@@ -75,10 +75,10 @@ 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 ce(n, e) {
+function he(n, e) {
   return n instanceof C ? e.accessor(n).node().resourceInfo : n;
 }
-class Y {
+class G {
   constructor(e, t, r, s) {
     d(this, "__pl_tree_type_marker__", "PlTreeNodeAccessor");
     d(this, "onUnstableLambda", (e) => {
@@ -251,7 +251,7 @@ class $ {
   }
 }
 const L = 0, x = new TextDecoder();
-class G {
+class Q {
   constructor(e, t) {
     /** Tracks number of other resources referencing this resource. Used to perform garbage collection in tree patching procedure */
     d(this, "refCount", 0);
@@ -398,7 +398,7 @@ class G {
   }
   getDataAsJson() {
     if (this.data !== void 0)
-      return this.dataAsJson === void 0 && (this.dataAsJson = JSON.parse(this.getDataAsString())), this.dataAsJson;
+      return this.dataAsJson === void 0 && (this.dataAsJson = z(JSON.parse(this.getDataAsString()))), this.dataAsJson;
   }
   verifyReadyState() {
     if (this.resourceReady && !this.inputsLocked)
@@ -517,7 +517,7 @@ class O {
         }
         k && p(i.kvChanged).markChanged(), h && (i.dataVersion = i.version, this.isFinalPredicate(i) && i.markFinal());
       } else {
-        i = new G(a), i.verifyReadyState(), g(i.error) && r.push(i.error);
+        i = new Q(a), i.verifyReadyState(), g(i.error) && r.push(i.error);
         for (const h of a.fields) {
           const k = new $(
             h.name,
@@ -575,7 +575,7 @@ class O {
     return Array.from(this.resources.values()).map((e) => e.extendedState);
   }
 }
-function Q(n, e) {
+function X(n, e) {
   const t = [], r = /* @__PURE__ */ new Set();
   return n.forEachResource((s) => {
     s.finalState ? r.add(s.id) : t.push(s.id);
@@ -595,10 +595,10 @@ function F() {
     millisSpent: 0
   };
 }
-function he(n) {
+function le(n) {
   let e = `Requests: ${n.requests}
 `;
-  return e += `Total time: ${z(n.millisSpent)}
+  return e += `Total time: ${H(n.millisSpent)}
 `, e += `Round-trips: ${n.roundTrips}
 `, e += `Resources: ${n.retrievedResources}
 `, e += `Fields: ${n.retrievedFields}
@@ -608,11 +608,11 @@ function he(n) {
 `, e += `Pruned fields: ${n.prunedFields}
 `, e += `Final resources skipped: ${n.finalResourcesSkipped}`, e;
 }
-async function X(n, e, t) {
+async function Z(n, e, t) {
   var c;
   const r = Date.now();
   t && t.requests++;
-  const { seedResources: s, finalResources: o, pruningFunction: a } = e, i = new H();
+  const { seedResources: s, finalResources: o, pruningFunction: a } = e, i = new j();
   let f = !0, l = 0;
   const h = /* @__PURE__ */ new Set(), k = (v) => {
     if (b(v) || h.has(v)) return;
@@ -656,10 +656,10 @@ async function X(n, e, t) {
   }
   return t && (t.millisSpent += Date.now() - r, t.roundTrips += l), u;
 }
-function le(n) {
+function fe(n) {
   return n;
 }
-function fe(n, e, t) {
+function ge(n, e, t) {
   var a;
   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) {
@@ -684,7 +684,7 @@ function fe(n, e, t) {
   }
   return o;
 }
-function ge(n, e, t) {
+function pe(n, e, t) {
   if (n instanceof C) {
     const r = t.accessor(n).node(), s = r.resourceInfo, o = e.map((a) => {
       var i, f;
@@ -701,7 +701,7 @@ function ge(n, e, t) {
   }
   return n;
 }
-function pe(n, e, t) {
+function ve(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 {
@@ -763,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 (o) => await X(o, r, e), t);
+    const r = X(this.state, this.pruning), s = await this.pl.withReadTx("ReadingTree", async (o) => await Z(o, r, e), t);
     this.state.updateFromResourceData(s, !0);
   }
   async mainLoop() {
@@ -783,7 +783,7 @@ class K {
       }
       if (!this.keepRunning || this.terminated) break;
       try {
-        await j.setTimeout(this.pollingInterval, this.abortController.signal);
+        await Y.setTimeout(this.pollingInterval, this.abortController.signal);
       } catch (o) {
         if (!J(o)) throw new Error("Unexpected error", { cause: o });
         break;
@@ -824,7 +824,7 @@ class K {
     return o;
   }
 }
-function ve(n) {
+function ye(n) {
   var t;
   const e = {
     total: {
@@ -864,28 +864,28 @@ function ve(n) {
   return e;
 }
 export {
-  ne as PlError,
+  oe as PlError,
   C as PlTreeEntry,
   E as PlTreeEntryAccessor,
-  Y as PlTreeNodeAccessor,
-  G as PlTreeResource,
+  G as PlTreeNodeAccessor,
+  Q as PlTreeResource,
   O as PlTreeState,
   K as SynchronizedTreeState,
   S as TreeStateUpdateError,
-  Q as constructTreeLoadingRequest,
-  he as formatTreeLoadingStat,
+  X as constructTreeLoadingRequest,
+  le as formatTreeLoadingStat,
   F as initialTreeLoadingStat,
-  oe as isPlTreeEntry,
-  ue as isPlTreeEntryAccessor,
-  de as isPlTreeNodeAccessor,
-  X as loadTreeState,
-  fe as makeResourceSnapshot,
+  ue as isPlTreeEntry,
+  de as isPlTreeEntryAccessor,
+  ce as isPlTreeNodeAccessor,
+  Z as loadTreeState,
+  ge as makeResourceSnapshot,
   P as mapValueAndError,
-  ae as mapValueAndErrorIfDefined,
-  le as rsSchema,
-  ve as treeDumpStats,
-  ce as treeEntryToResourceInfo,
-  ge as treeEntryToResourceWithData,
-  pe as treeEntryToResourceWithMetadata
+  ne as mapValueAndErrorIfDefined,
+  fe as rsSchema,
+  ye as treeDumpStats,
+  he as treeEntryToResourceInfo,
+  pe as treeEntryToResourceWithData,
+  ve as treeEntryToResourceWithMetadata
 };
 //# sourceMappingURL=index.mjs.map