@entropic-bond/firebase 1.13.10 → 1.13.11

package/lib/entropic-bond-firebase.js

@@ -2097,10 +2097,10 @@ var _h, Ir, yh, Ss, Mo, Eh, Th, wh;
         for (let J = 0; J < z.length; J++) {
           var fe = z[J].split("=");
           if (fe.length > 1) {
-            const me = fe[0];
+            const ge = fe[0];
             fe = fe[1];
-            const et = me.split("_");
-            O = et.length >= 2 && et[1] == "type" ? O + (me + "=" + fe + "&") : O + (me + "=redacted&");
+            const et = ge.split("_");
+            O = et.length >= 2 && et[1] == "type" ? O + (ge + "=" + fe + "&") : O + (ge + "=redacted&");
           }
         }
       } else O = null;
@@ -2228,14 +2228,14 @@ var _h, Ir, yh, Ss, Mo, Eh, Th, wh;
             }
             if (this.R) {
               o = !0;
-              let me;
-              for (; !this.K && this.C < h.length; ) if (me = Rp(this, h), me == Xi) {
+              let ge;
+              for (; !this.K && this.C < h.length; ) if (ge = Rp(this, h), ge == Xi) {
                 z == 4 && (this.m = 4, ke(14), o = !1), vn(this.i, this.l, null, "[Incomplete Response]");
                 break;
-              } else if (me == Sc) {
+              } else if (ge == Sc) {
                 this.m = 4, ke(15), vn(this.i, this.l, h, "[Invalid Chunk]"), o = !1;
                 break;
-              } else vn(this.i, this.l, me, null), Zi(this, me);
+              } else vn(this.i, this.l, ge, null), Zi(this, ge);
               if (kc(this) && this.C != 0 && (this.h.g = this.h.g.slice(this.C), this.C = 0), z != 4 || h.length != 0 || this.h.h || (this.m = 1, ke(16), o = !1), this.o = this.o && o, !o) vn(
                 this.i,
                 this.l,
@@ -2327,8 +2327,8 @@ var _h, Ir, yh, Ss, Mo, Eh, Th, wh;
           } else nn(h, 11);
         } else if ((o.L || h.g == o) && ms(h), !_(u)) for (v = h.Ba.g.parse(u), u = 0; u < v.length; u++) {
           let J = v[u];
-          const me = J[0];
-          if (!(me <= h.K)) if (h.K = me, J = J[1], h.I == 2) if (J[0] == "c") {
+          const ge = J[0];
+          if (!(ge <= h.K)) if (h.K = ge, J = J[1], h.I == 2) if (J[0] == "c") {
             h.M = J[1], h.ba = J[2];
             const et = J[3];
             et != null && (h.ka = et, h.j.info("VER=" + h.ka));
@@ -2920,10 +2920,10 @@ var _h, Ir, yh, Ss, Mo, Eh, Th, wh;
         const fe = ["count=" + h];
         z == -1 ? h > 0 ? (z = v[0].g, fe.push("ofs=" + z)) : z = 0 : fe.push("ofs=" + z);
         let J = !0;
-        for (let me = 0; me < h; me++) {
-          var b = v[me].g;
-          const et = v[me].map;
-          if (b -= z, b < 0) z = Math.max(0, v[me].g - 100), J = !1;
+        for (let ge = 0; ge < h; ge++) {
+          var b = v[ge].g;
+          const et = v[ge].map;
+          if (b -= z, b < 0) z = Math.max(0, v[ge].g - 100), J = !1;
           else try {
             b = "req" + b + "_" || "";
             try {
@@ -4533,7 +4533,7 @@ class {
     return 0;
   }
 }();
-class pe {
+class me {
   constructor(e) {
     this.comparator = e, this.data = new se(this.comparator);
   }
@@ -4602,7 +4602,7 @@ class pe {
     }), t;
   }
   isEqual(e) {
-    if (!(e instanceof pe) || this.size !== e.size) return !1;
+    if (!(e instanceof me) || this.size !== e.size) return !1;
     const t = this.data.getIterator(), r = e.data.getIterator();
     for (; t.hasNext(); ) {
       const s = t.getNext().key, i = r.getNext().key;
@@ -4621,7 +4621,7 @@ class pe {
     return this.forEach((t) => e.push(t)), "SortedSet(" + e.toString() + ")";
   }
   copy(e) {
-    const t = new pe(this.comparator);
+    const t = new me(this.comparator);
     return t.data = e, t;
   }
 }
@@ -4650,7 +4650,7 @@ class Fe {
    * fields paths to this field mask.
    */
   unionWith(e) {
-    let t = new pe(we.comparator);
+    let t = new me(we.comparator);
     for (const r of this.fields) t = t.add(r);
     for (const r of e) t = t.add(r);
     return new Fe(t.toArray());
@@ -5603,7 +5603,7 @@ function Dn(n) {
     for (const i of e.explicitOrderBy) e.Ie.push(i), t.add(i.field.canonicalString());
     const r = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc";
     (function(a) {
-      let c = new pe(we.comparator);
+      let c = new me(we.comparator);
       return a.filters.forEach((l) => {
         l.getFlattenedFilters().forEach((d) => {
           d.isInequality() && (c = c.add(d.field));
@@ -5785,13 +5785,13 @@ function Gh() {
 function Sr() {
   return new Tn((n) => n.toString(), (n, e) => n.isEqual(e));
 }
-const l_ = new se(L.comparator), h_ = new pe(L.comparator);
+const l_ = new se(L.comparator), h_ = new me(L.comparator);
 function G(...n) {
   let e = h_;
   for (const t of n) e = e.add(t);
   return e;
 }
-const d_ = new pe(W);
+const d_ = new me(W);
 function f_() {
   return d_;
 }
@@ -5947,7 +5947,7 @@ function Zh(n, e) {
   if (e === null) return n.isNoDocument() ? new vi(n.key, $e.none()) : new Wr(n.key, n.data, $e.none());
   {
     const t = n.data, r = Me.empty();
-    let s = new pe(we.comparator);
+    let s = new me(we.comparator);
     for (let i of e.fields) if (!s.has(i)) {
       let a = t.field(i);
       a === null && i.length > 1 && (i = i.popLast(), a = t.field(i)), a === null ? r.delete(i) : r.set(i, a), s = s.add(i);
@@ -6689,11 +6689,11 @@ class C_ {
   }
   dt(e) {
     let t = this.He.get(e);
-    return t || (t = new pe(W), this.He = this.He.insert(e, t)), t;
+    return t || (t = new me(W), this.He = this.He.insert(e, t)), t;
   }
   It(e) {
     let t = this.Je.get(e);
-    return t || (t = new pe(W), this.Je = this.Je.insert(e, t)), t;
+    return t || (t = new me(W), this.Je = this.Je.insert(e, t)), t;
   }
   /**
    * Verifies that the user is still interested in this target (by calling
@@ -7364,7 +7364,7 @@ class X_ {
   }
   // Returns false if the entry already existed.
   add(e) {
-    const t = e.lastSegment(), r = e.popLast(), s = this.index[t] || new pe(Z.comparator), i = !s.has(r);
+    const t = e.lastSegment(), r = e.popLast(), s = this.index[t] || new me(Z.comparator), i = !s.has(r);
     return this.index[t] = s.add(r), i;
   }
   has(e) {
@@ -7372,7 +7372,7 @@ class X_ {
     return s && s.has(r);
   }
   getEntries(e) {
-    return (this.index[e] || new pe(Z.comparator)).toArray();
+    return (this.index[e] || new me(Z.comparator)).toArray();
   }
 }
 const Qu = {
@@ -7411,7 +7411,7 @@ function Yu([n, e], [t, r]) {
 }
 class J_ {
   constructor(e) {
-    this.Ir = e, this.buffer = new pe(Yu), this.Er = 0;
+    this.Ir = e, this.buffer = new me(Yu), this.Er = 0;
   }
   dr() {
     return ++this.Er;
@@ -7880,8 +7880,8 @@ class ay {
 }
 class ya {
   constructor() {
-    this.Qr = new pe(ye.$r), // A set of outstanding references to a document sorted by target id.
-    this.Ur = new pe(ye.Kr);
+    this.Qr = new me(ye.$r), // A set of outstanding references to a document sorted by target id.
+    this.Ur = new me(ye.Kr);
   }
   /** Returns true if the reference set contains no references. */
   isEmpty() {
@@ -7955,7 +7955,7 @@ class cy {
      */
     this.mutationQueue = [], /** Next value to use when assigning sequential IDs to each mutation batch. */
     this.tr = 1, /** An ordered mapping between documents and the mutations batch IDs. */
-    this.Zr = new pe(ye.$r);
+    this.Zr = new me(ye.$r);
   }
   checkEmpty(e) {
     return S.resolve(this.mutationQueue.length === 0);
@@ -7989,7 +7989,7 @@ class cy {
     }), S.resolve(i);
   }
   getAllMutationBatchesAffectingDocumentKeys(e, t) {
-    let r = new pe(W);
+    let r = new me(W);
     return t.forEach((s) => {
       const i = new ye(s, 0), a = new ye(s, Number.POSITIVE_INFINITY);
       this.Zr.forEachInRange([i, a], (c) => {
@@ -8002,7 +8002,7 @@ class cy {
     let i = r;
     L.isDocumentKey(i) || (i = i.child(""));
     const a = new ye(new L(i), 0);
-    let c = new pe(W);
+    let c = new me(W);
     return this.Zr.forEachWhile((l) => {
       const d = l.key.path;
       return !!r.isPrefixOf(d) && // Rows with document keys more than one segment longer than the query
@@ -8538,7 +8538,7 @@ class py {
   }
   /** Applies the query filter and sorting to the provided documents.  */
   Ds(e, t) {
-    let r = new pe(zh(e));
+    let r = new me(zh(e));
     return t.forEach((s, i) => {
       Ti(e, i) && (r = r.add(i));
     }), r;
@@ -13244,8 +13244,8 @@ var nT = Object.defineProperty, rT = (n, e, t, r) => {
   for (var s = void 0, i = n.length - 1, a; i >= 0; i--)
     (a = n[i]) && (s = a(e, t, s) || s);
   return s && nT(e, t, s), s;
-}, ge;
-const Gd = (ge = class {
+}, _e;
+const Gd = (_e = class {
   /**
    * Registers a class to be used by the persistence engine.
    * @param className the name of the class to be registered
@@ -13306,7 +13306,7 @@ const Gd = (ge = class {
    * @see registerFactory
    */
   static annotations(n) {
-    if (n instanceof ge ? n = n.className : typeof n == "string" || (n = new n().className), !this._factoryMap[n]) throw new Error(`You should register class ${n} prior to use.`);
+    if (n instanceof _e ? n = n.className : typeof n == "string" || (n = new n().className), !this._factoryMap[n]) throw new Error(`You should register class ${n} prior to use.`);
     return this._factoryMap[n].annotation;
   }
   /**
@@ -13442,7 +13442,7 @@ const Gd = (ge = class {
     if (!this.className) throw new Error(`You should register \`${this.constructor.name || this.toString() || "this"}\` class prior to streaming it.`);
     return this._persistentProperties.forEach((t) => {
       const r = this[t.name], s = this.removeUnderscore(t);
-      r != null && (t.isReference ? e[s] = this.toReferenceObj(t, n) : e[s] = this.toDeepObj(r, n), t.searchableArray && (e[ge.searchableArrayNameFor(s)] = r.map((i) => i.id)));
+      r != null && (t.isReference ? e[s] = this.toReferenceObj(t, n) : e[s] = this.toDeepObj(r, n), t.searchableArray && (e[_e.searchableArrayNameFor(s)] = r.map((i) => i.id)));
     }), e.__className = this.className, e;
   }
   static searchableArrayNameFor(n) {
@@ -13453,11 +13453,11 @@ const Gd = (ge = class {
     if (Array.isArray(n))
       return n.map((e) => this.fromDeepObject(e));
     if (n.__documentReference) {
-      const e = n, t = ge.createInstance(e);
+      const e = n, t = _e.createInstance(e);
       return t.__documentReference = n.__documentReference, t;
     }
     if (n.__className)
-      return ge.createInstance(n);
+      return _e.createInstance(n);
     if (typeof n == "object") {
       const e = {};
       return Object.entries(n).forEach(
@@ -13471,7 +13471,7 @@ const Gd = (ge = class {
       if (Array.isArray(n))
         return n.map((t) => this.toDeepObj(t, e));
       if (n.__documentReference) return n;
-      if (n instanceof ge)
+      if (n instanceof _e)
         return n.toObj(e);
       if (typeof n == "object") {
         const t = {};
@@ -13488,7 +13488,7 @@ const Gd = (ge = class {
   }
   toReferenceObj(n, e) {
     const t = this[n.name];
-    return Array.isArray(t) ? t.map((r) => (n.isPureReference || this.pushDocument(e, ge.collectionPath(r, n), r), this.buildRefObject(r, ge.collectionPath(r, n), n.cachedPropsConfig?.cachedProps))) : (n.isPureReference || this.pushDocument(e, ge.collectionPath(t, n), t), this.buildRefObject(t, ge.collectionPath(t, n), n.cachedPropsConfig?.cachedProps));
+    return Array.isArray(t) ? t.map((r) => (n.isPureReference || this.pushDocument(e, _e.collectionPath(r, n), r), this.buildRefObject(r, _e.collectionPath(r, n), n.cachedPropsConfig?.cachedProps))) : (n.isPureReference || this.pushDocument(e, _e.collectionPath(t, n), t), this.buildRefObject(t, _e.collectionPath(t, n), n.cachedPropsConfig?.cachedProps));
   }
   buildRefObject(n, e, t) {
     const r = t?.reduce((s, i) => (n[i] !== void 0 && (s[i] = n[i]), s), {});
@@ -13511,14 +13511,14 @@ const Gd = (ge = class {
     return n.name.slice(1);
   }
   static createReference(n) {
-    const e = ge.createInstance(n);
+    const e = _e.createInstance(n);
     return e.__documentReference = n.__documentReference || { storedInCollection: e.className }, e;
   }
   static createInstance(n) {
     if (typeof n == "string")
-      return new (ge.classFactory(n))();
+      return new (_e.classFactory(n))();
     try {
-      return new (ge.classFactory(n.__className))().fromObject(n);
+      return new (_e.classFactory(n.__className))().fromObject(n);
     } catch (e) {
       const t = Object.entries(n).filter(([r, s]) => s != null && typeof s != "function").map(([r, s]) => `${r}: ${s}`).join(`,
 	`);
@@ -13531,25 +13531,25 @@ const Gd = (ge = class {
     }
   }
   static propInfo(n, e) {
-    return ge.createInstance(n).getPropInfo(e);
+    return _e.createInstance(n).getPropInfo(e);
   }
   /**
    * Retrieves a collection of references with the properties that are stored in the reference object
    * @returns the references collection
    */
   static getSystemRegisteredReferencesWithCachedProps() {
-    return ge.registeredClassesAndLegacyNames().reduce((n, e) => {
-      const t = ge.createInstance(e).getPersistentProperties().filter(
+    return _e.registeredClassesAndLegacyNames().reduce((n, e) => {
+      const t = _e.createInstance(e).getPersistentProperties().filter(
         (r) => r.cachedPropsConfig?.cachedProps
       );
       return t.length > 0 && (n[e] = t), n;
     }, {});
   }
-}, ge._factoryMap = {}, ge);
+}, _e._factoryMap = {}, _e);
 rT([
   Zn
 ], Gd.prototype, "_id");
-let _e = Gd;
+let pe = Gd;
 function Zn(n, e) {
   return sT()(n, e);
 }
@@ -13565,16 +13565,16 @@ function sT(n) {
 }
 function iT(n, e) {
   return (t) => {
-    _e.registerFactory(n, t, e), t.prototype.__className = n;
+    pe.registerFactory(n, t, e), t.prototype.__className = n;
   };
 }
 const Kd = class Qd {
   constructor(e, t, r) {
     if (r) {
-      if (!(t instanceof _e)) throw new Error(Qd.error.persistentNeedForSubCollection);
+      if (!(t instanceof pe)) throw new Error(Qd.error.persistentNeedForSubCollection);
       this.collectionName = `${t.className}/${t.id}/${r}`;
     } else
-      this.collectionName = t instanceof _e ? t.className : t;
+      this.collectionName = t instanceof pe ? t.className : t;
     this._stream = e;
   }
   /**
@@ -13589,7 +13589,7 @@ const Kd = class Qd {
   findById(e, t) {
     return new Promise((r, s) => {
       this._stream.findById(e, this.collectionName).then((i) => {
-        i ? (t ? t.fromObject(i) : t = _e.createInstance(i), r(t)) : r(void 0);
+        i ? (t ? t.fromObject(i) : t = pe.createInstance(i), r(t)) : r(void 0);
       }).catch((i) => s(i));
     });
   }
@@ -13631,7 +13631,7 @@ const Kd = class Qd {
    */
   query(e = {}, t) {
     if (t) {
-      const r = t instanceof _e ? t.className : t;
+      const r = t instanceof pe ? t.className : t;
       e.operations || (e.operations = []), e.operations.push(
         { property: "__className", operator: "==", value: r }
       );
@@ -13668,14 +13668,14 @@ const Kd = class Qd {
     return this._stream.onCollectionChange(
       e.getQueryObject(),
       this.collectionName,
-      (r) => t(this.toPersistentChangeObject(r))
+      (r) => t(r.map((s) => pe.createInstance(s)))
     );
   }
   toPersistentChangeObject(e) {
     return {
       ...e,
-      before: e.before && _e.createInstance(e.before),
-      after: e.after && _e.createInstance(e.after)
+      before: e.before && pe.createInstance(e.before),
+      after: e.after && pe.createInstance(e.after)
     };
   }
   // /**
@@ -13690,7 +13690,7 @@ const Kd = class Qd {
   mapToInstance(e) {
     return new Promise((t, r) => {
       e().then((s) => t(
-        s.map((i) => _e.createInstance(i))
+        s.map((i) => pe.createInstance(i))
       )).catch((s) => r(s));
     });
   }
@@ -13706,15 +13706,15 @@ const Kd = class Qd {
     if (Object.values(e).length === 0) return e;
     const t = e.operations?.map((r) => {
       const s = r.value[0] ?? r.value;
-      return ln.isArrayOperator(r.operator) && s instanceof _e ? {
-        property: _e.searchableArrayNameFor(r.property),
+      return ln.isArrayOperator(r.operator) && s instanceof pe ? {
+        property: pe.searchableArrayNameFor(r.property),
         operator: r.operator,
         value: Array.isArray(r.value) ? r.value.map((i) => i.id) : s.id,
         aggregate: r.aggregate
       } : {
         property: r.property,
         operator: r.operator,
-        value: r.value instanceof _e ? { id: r.value.id } : r.value,
+        value: r.value instanceof pe ? { id: r.value.id } : r.value,
         aggregate: r.aggregate
       };
     }) ?? [];
@@ -13880,7 +13880,7 @@ class oT {
    * query.instanceOf( Person ).where( 'age', '>', 18 )
    */
   instanceOf(e) {
-    const t = e instanceof _e ? e.className : e;
+    const t = e instanceof pe ? e.className : e;
     return this.queryObject.operations?.push({
       property: "__className",
       operator: "==",
@@ -14022,10 +14022,10 @@ let aT = Xd;
 class ln {
   installCachedPropsUpdaters(e = {}) {
     ln.onUpdate = e.onUpdate;
-    const t = _e.getSystemRegisteredReferencesWithCachedProps(), r = {};
+    const t = pe.getSystemRegisteredReferencesWithCachedProps(), r = {};
     Object.entries(t).forEach(([i, a]) => {
       a.forEach((c) => {
-        const l = _e.collectionPath(_e.createInstance(i), c);
+        const l = pe.collectionPath(pe.createInstance(i), c);
         r[l] || (r[l] = []), r[l].push({
           prop: c,
           collectionPropOwner: i
@@ -14034,10 +14034,10 @@ class ln {
     });
     const s = [];
     return Object.entries(r).forEach(([i, a]) => {
-      const c = this.subscribeToDocumentChangeListerner(i, (l) => ln.processDocumentChange(l, a));
+      const c = this.subscribeToDocumentChangeListener(i, (l) => ln.processDocumentChange(l, a));
       if (c)
         s.push(c);
-      else if (e.noThrowOnNonImplementedListener) throw new Error("The method documentChangeListerner has not been implemented in the concrete data source");
+      else if (e.noThrowOnNonImplementedListener) throw new Error("The method documentChangeListener has not been implemented in the concrete data source");
     }), s;
   }
   /**
@@ -14048,9 +14048,9 @@ class ln {
    * @param props the properties to be watched in the collection
    * @param listener the listener to be called when a document is changed
    * @returns a function that uninstalls the listener. If the returned value is undefined
-   * the method documentChangeListerner has not been implemented in the concrete data source
+   * the method documentChangeListener has not been implemented in the concrete data source
    */
-  subscribeToDocumentChangeListerner(e, t) {
+  subscribeToDocumentChangeListener(e, t) {
   }
   /**
    * Utility method to convert a query object to a property path query object
@@ -14066,9 +14066,9 @@ class ln {
    */
   static toPropertyPathOperations(e) {
     return e ? e.map((t) => {
-      if (ln.isArrayOperator(t.operator) && t.value[0] instanceof _e)
+      if (ln.isArrayOperator(t.operator) && t.value[0] instanceof pe)
         return {
-          property: _e.searchableArrayNameFor(t.property),
+          property: pe.searchableArrayNameFor(t.property),
           operator: t.operator,
           value: t.value.map((i) => i.id),
           aggregate: t.aggregate
@@ -14203,7 +14203,7 @@ var uT = Object.defineProperty, lT = Object.getOwnPropertyDescriptor, er = (n, e
     (a = n[i]) && (s = (r ? a(e, t, s) : a(s)) || s);
   return r && s && uT(e, t, s), s;
 };
-let mn = class extends _e {
+let mn = class extends pe {
   constructor() {
     super(...arguments), this._onChange = new Wd();
   }
@@ -20371,14 +20371,8 @@ class yA extends ln {
   onCollectionChange(e, t, r) {
     const s = this.queryObjectToQueryConstraints(e, t);
     return vl(s, (i) => {
-      i.docChanges().forEach((a) => {
-        r({
-          type: a.type === "added" ? "create" : a.type === "modified" ? "update" : "delete",
-          after: a.doc.data(),
-          before: void 0,
-          params: {}
-        });
-      });
+      const a = i.docChanges().map((c) => c.doc.data());
+      r(a);
     });
   }
   onDocumentChange(e, t, r) {