@dcupl/bundle 2.0.0-beta.22 → 2.0.0-beta.23

package/dist/dcupl.bundle.js

@@ -521,7 +521,7 @@
     g$1.Request = Request;
     g$1.Response = Response;
   }
-  var xt$1 = typeof global == "object" && global && global.Object === Object && global, ur$1 = typeof self == "object" && self && self.Object === Object && self, M$2 = xt$1 || ur$1 || Function("return this")(), x$2 = M$2.Symbol, St$1 = Object.prototype, cr$1 = St$1.hasOwnProperty, fr$1 = St$1.toString, L$3 = x$2 ? x$2.toStringTag : void 0;
+  var xt$1 = typeof global == "object" && global && global.Object === Object && global, ur$1 = typeof self == "object" && self && self.Object === Object && self, $$2 = xt$1 || ur$1 || Function("return this")(), x$2 = $$2.Symbol, St$1 = Object.prototype, cr$1 = St$1.hasOwnProperty, fr$1 = St$1.toString, L$3 = x$2 ? x$2.toStringTag : void 0;
   function lr$1(r) {
     var e = cr$1.call(r, L$3), t = r[L$3];
     try {
@@ -537,29 +537,29 @@
     return hr$1.call(r);
   }
   var gr$1 = "[object Null]", yr$1 = "[object Undefined]", Re$2 = x$2 ? x$2.toStringTag : void 0;
-  function N$4(r) {
+  function N$3(r) {
     return r == null ? r === void 0 ? yr$1 : gr$1 : Re$2 && Re$2 in Object(r) ? lr$1(r) : pr$1(r);
   }
   function O$2(r) {
     return r != null && typeof r == "object";
   }
   var mr$1 = "[object Symbol]";
-  function F$2(r) {
-    return typeof r == "symbol" || O$2(r) && N$4(r) == mr$1;
+  function F$1(r) {
+    return typeof r == "symbol" || O$2(r) && N$3(r) == mr$1;
   }
   function z$4(r, e) {
     for (var t = -1, n = r == null ? 0 : r.length, s = Array(n); ++t < n; )
       s[t] = e(r[t], t, r);
     return s;
   }
-  var v$2 = Array.isArray, Fe$2 = x$2 ? x$2.prototype : void 0, ke$1 = Fe$2 ? Fe$2.toString : void 0;
+  var v$2 = Array.isArray, Fe$2 = x$2 ? x$2.prototype : void 0, Ge$3 = Fe$2 ? Fe$2.toString : void 0;
   function Tt(r) {
     if (typeof r == "string")
       return r;
     if (v$2(r))
       return z$4(r, Tt) + "";
-    if (F$2(r))
-      return ke$1 ? ke$1.call(r) : "";
+    if (F$1(r))
+      return Ge$3 ? Ge$3.call(r) : "";
     var e = r + "";
     return e == "0" && 1 / r == -1 / 0 ? "-0" : e;
   }
@@ -573,33 +573,33 @@
   function Ar$1(r) {
     return r && r.slice(0, vr$1(r) + 1).replace(wr$1, "");
   }
-  function E$3(r) {
+  function E$4(r) {
     var e = typeof r;
     return r != null && (e == "object" || e == "function");
   }
-  var Ge$2 = NaN, xr$1 = /^[-+]0x[0-9a-f]+$/i, Sr$1 = /^0b[01]+$/i, Tr$1 = /^0o[0-7]+$/i, Or$1 = parseInt;
-  function Mr$1(r) {
+  var ke$1 = NaN, xr$1 = /^[-+]0x[0-9a-f]+$/i, Sr$1 = /^0b[01]+$/i, Tr$1 = /^0o[0-7]+$/i, Or$1 = parseInt;
+  function $r$1(r) {
     if (typeof r == "number")
       return r;
-    if (F$2(r))
-      return Ge$2;
-    if (E$3(r)) {
+    if (F$1(r))
+      return ke$1;
+    if (E$4(r)) {
       var e = typeof r.valueOf == "function" ? r.valueOf() : r;
-      r = E$3(e) ? e + "" : e;
+      r = E$4(e) ? e + "" : e;
     }
     if (typeof r != "string")
       return r === 0 ? r : +r;
     r = Ar$1(r);
     var t = Sr$1.test(r);
-    return t || Tr$1.test(r) ? Or$1(r.slice(2), t ? 2 : 8) : xr$1.test(r) ? Ge$2 : +r;
+    return t || Tr$1.test(r) ? Or$1(r.slice(2), t ? 2 : 8) : xr$1.test(r) ? ke$1 : +r;
   }
-  var Le$2 = 1 / 0, $r$1 = 17976931348623157e292;
+  var Le$2 = 1 / 0, Mr$1 = 17976931348623157e292;
   function _r$1(r) {
     if (!r)
       return r === 0 ? r : 0;
-    if (r = Mr$1(r), r === Le$2 || r === -Le$2) {
+    if (r = $r$1(r), r === Le$2 || r === -Le$2) {
       var e = r < 0 ? -1 : 1;
-      return e * $r$1;
+      return e * Mr$1;
     }
     return r === r ? r : 0;
   }
@@ -610,14 +610,14 @@
   function ue$1(r) {
     return r;
   }
-  var Ir$1 = "[object AsyncFunction]", Dr$1 = "[object Function]", Er$1 = "[object GeneratorFunction]", Qr$1 = "[object Proxy]";
+  var Dr$1 = "[object AsyncFunction]", Ir$1 = "[object Function]", Er$1 = "[object GeneratorFunction]", Qr$1 = "[object Proxy]";
   function Ot$1(r) {
-    if (!E$3(r))
+    if (!E$4(r))
       return false;
-    var e = N$4(r);
-    return e == Dr$1 || e == Er$1 || e == Ir$1 || e == Qr$1;
+    var e = N$3(r);
+    return e == Ir$1 || e == Er$1 || e == Dr$1 || e == Qr$1;
   }
-  var he = M$2["__core-js_shared__"], ze$2 = (function() {
+  var he = $$2["__core-js_shared__"], ze$2 = (function() {
     var r = /[^.]+$/.exec(he && he.keys && he.keys.IE_PROTO || "");
     return r ? "Symbol(src)_1." + r : "";
   })();
@@ -638,11 +638,11 @@
     }
     return "";
   }
-  var Kr$1 = /[\\^$.*+?()[\]{}|]/g, Pr$1 = /^\[object .+?Constructor\]$/, Rr$1 = Function.prototype, Fr$1 = Object.prototype, kr$1 = Rr$1.toString, Gr$1 = Fr$1.hasOwnProperty, Lr$1 = RegExp(
-    "^" + kr$1.call(Gr$1).replace(Kr$1, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"
+  var Kr$1 = /[\\^$.*+?()[\]{}|]/g, Pr$1 = /^\[object .+?Constructor\]$/, Rr$1 = Function.prototype, Fr$1 = Object.prototype, Gr$1 = Rr$1.toString, kr$1 = Fr$1.hasOwnProperty, Lr$1 = RegExp(
+    "^" + Gr$1.call(kr$1).replace(Kr$1, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"
   );
   function zr$1(r) {
-    if (!E$3(r) || Nr$1(r))
+    if (!E$4(r) || Nr$1(r))
       return false;
     var e = Ot$1(r) ? Lr$1 : Pr$1;
     return e.test(j$2(r));
@@ -650,15 +650,15 @@
   function Br$1(r, e) {
     return r?.[e];
   }
-  function q(r, e) {
+  function q$1(r, e) {
     var t = Br$1(r, e);
     return zr$1(t) ? t : void 0;
   }
-  var ve$1 = q(M$2, "WeakMap"), Be$1 = Object.create, Ur$1 = /* @__PURE__ */ (function() {
+  var ve$1 = q$1($$2, "WeakMap"), Be$1 = Object.create, Ur$1 = /* @__PURE__ */ (function() {
     function r() {
     }
     return function(e) {
-      if (!E$3(e))
+      if (!E$4(e))
         return {};
       if (Be$1)
         return Be$1(e);
@@ -698,14 +698,14 @@
       return r;
     };
   }
-  var ie$1 = (function() {
+  var oe$1 = (function() {
     try {
-      var r = q(Object, "defineProperty");
+      var r = q$1(Object, "defineProperty");
       return r({}, "", {}), r;
     } catch {
     }
-  })(), Yr$1 = ie$1 ? function(r, e) {
-    return ie$1(r, "toString", {
+  })(), Yr$1 = oe$1 ? function(r, e) {
+    return oe$1(r, "toString", {
       configurable: true,
       enumerable: false,
       value: Xr$1(e),
@@ -717,10 +717,10 @@
       ;
     return r;
   }
-  function Mt$1(r, e, t, n) {
-    for (var s = r.length, i = t + -1; ++i < s; )
-      if (e(r[i], i, r))
-        return i;
+  function $t$1(r, e, t, n) {
+    for (var s = r.length, o = t + -1; ++o < s; )
+      if (e(r[o], o, r))
+        return o;
     return -1;
   }
   function rn$1(r) {
@@ -733,19 +733,19 @@
     return -1;
   }
   function sn$1(r, e, t) {
-    return e === e ? nn$1(r, e, t) : Mt$1(r, rn$1, t);
+    return e === e ? nn$1(r, e, t) : $t$1(r, rn$1, t);
   }
   function on$1(r, e) {
     var t = r == null ? 0 : r.length;
     return !!t && sn$1(r, e, 0) > -1;
   }
   var an$1 = 9007199254740991, un$1 = /^(?:0|[1-9]\d*)$/;
-  function $t$1(r, e) {
+  function Mt$1(r, e) {
     var t = typeof r;
     return e = e ?? an$1, !!e && (t == "number" || t != "symbol" && un$1.test(r)) && r > -1 && r % 1 == 0 && r < e;
   }
   function cn$1(r, e, t) {
-    e == "__proto__" && ie$1 ? ie$1(r, e, {
+    e == "__proto__" && oe$1 ? oe$1(r, e, {
       configurable: true,
       enumerable: true,
       value: t,
@@ -763,23 +763,23 @@
   var Ue$2 = Math.max;
   function hn$1(r, e, t) {
     return e = Ue$2(e === void 0 ? r.length - 1 : e, 0), function() {
-      for (var n = arguments, s = -1, i = Ue$2(n.length - e, 0), o = Array(i); ++s < i; )
-        o[s] = n[e + s];
+      for (var n = arguments, s = -1, o = Ue$2(n.length - e, 0), i = Array(o); ++s < o; )
+        i[s] = n[e + s];
       s = -1;
       for (var a = Array(e + 1); ++s < e; )
         a[s] = n[s];
-      return a[e] = t(o), Hr$1(r, this, a);
+      return a[e] = t(i), Hr$1(r, this, a);
     };
   }
   function pn$1(r, e) {
     return en$1(hn$1(r, e, ue$1), r + "");
   }
   var gn$1 = 9007199254740991;
-  function Ie$2(r) {
+  function De$2(r) {
     return typeof r == "number" && r > -1 && r % 1 == 0 && r <= gn$1;
   }
-  function G$1(r) {
-    return r != null && Ie$2(r.length) && !Ot$1(r);
+  function k$1(r) {
+    return r != null && De$2(r.length) && !Ot$1(r);
   }
   var yn$1 = Object.prototype;
   function _t$1(r) {
@@ -793,9 +793,9 @@
   }
   var bn$1 = "[object Arguments]";
   function He$3(r) {
-    return O$2(r) && N$4(r) == bn$1;
+    return O$2(r) && N$3(r) == bn$1;
   }
-  var Ct$1 = Object.prototype, vn$1 = Ct$1.hasOwnProperty, wn$1 = Ct$1.propertyIsEnumerable, De$2 = He$3(/* @__PURE__ */ (function() {
+  var Ct$1 = Object.prototype, vn$1 = Ct$1.hasOwnProperty, wn$1 = Ct$1.propertyIsEnumerable, Ie$2 = He$3(/* @__PURE__ */ (function() {
     return arguments;
   })()) ? He$3 : function(r) {
     return O$2(r) && vn$1.call(r, "callee") && !wn$1.call(r, "callee");
@@ -803,32 +803,32 @@
   function An$1() {
     return false;
   }
-  var It$1 = typeof exports == "object" && exports && !exports.nodeType && exports, We$2 = It$1 && typeof module == "object" && module && !module.nodeType && module, xn$1 = We$2 && We$2.exports === It$1, Ve$2 = xn$1 ? M$2.Buffer : void 0, Sn$1 = Ve$2 ? Ve$2.isBuffer : void 0, oe$1 = Sn$1 || An$1, Tn$1 = "[object Arguments]", On$1 = "[object Array]", Mn$1 = "[object Boolean]", $n$1 = "[object Date]", _n$1 = "[object Error]", Cn$1 = "[object Function]", In$1 = "[object Map]", Dn$1 = "[object Number]", En$1 = "[object Object]", Qn$1 = "[object RegExp]", Nn$1 = "[object Set]", jn$1 = "[object String]", qn$1 = "[object WeakMap]", Kn$1 = "[object ArrayBuffer]", Pn$1 = "[object DataView]", Rn$1 = "[object Float32Array]", Fn$1 = "[object Float64Array]", kn$1 = "[object Int8Array]", Gn$1 = "[object Int16Array]", Ln$1 = "[object Int32Array]", zn$1 = "[object Uint8Array]", Bn$1 = "[object Uint8ClampedArray]", Un$1 = "[object Uint16Array]", Hn$1 = "[object Uint32Array]", m = {};
-  m[Rn$1] = m[Fn$1] = m[kn$1] = m[Gn$1] = m[Ln$1] = m[zn$1] = m[Bn$1] = m[Un$1] = m[Hn$1] = true;
-  m[Tn$1] = m[On$1] = m[Kn$1] = m[Mn$1] = m[Pn$1] = m[$n$1] = m[_n$1] = m[Cn$1] = m[In$1] = m[Dn$1] = m[En$1] = m[Qn$1] = m[Nn$1] = m[jn$1] = m[qn$1] = false;
+  var Dt$1 = typeof exports == "object" && exports && !exports.nodeType && exports, We$2 = Dt$1 && typeof module == "object" && module && !module.nodeType && module, xn$1 = We$2 && We$2.exports === Dt$1, Ve$2 = xn$1 ? $$2.Buffer : void 0, Sn$1 = Ve$2 ? Ve$2.isBuffer : void 0, ie$1 = Sn$1 || An$1, Tn$1 = "[object Arguments]", On$1 = "[object Array]", $n$1 = "[object Boolean]", Mn$1 = "[object Date]", _n$1 = "[object Error]", Cn$1 = "[object Function]", Dn$1 = "[object Map]", In$1 = "[object Number]", En$1 = "[object Object]", Qn$1 = "[object RegExp]", Nn$1 = "[object Set]", jn$1 = "[object String]", qn$1 = "[object WeakMap]", Kn$1 = "[object ArrayBuffer]", Pn$1 = "[object DataView]", Rn$1 = "[object Float32Array]", Fn$1 = "[object Float64Array]", Gn$1 = "[object Int8Array]", kn$1 = "[object Int16Array]", Ln$1 = "[object Int32Array]", zn$1 = "[object Uint8Array]", Bn$1 = "[object Uint8ClampedArray]", Un$1 = "[object Uint16Array]", Hn$1 = "[object Uint32Array]", m = {};
+  m[Rn$1] = m[Fn$1] = m[Gn$1] = m[kn$1] = m[Ln$1] = m[zn$1] = m[Bn$1] = m[Un$1] = m[Hn$1] = true;
+  m[Tn$1] = m[On$1] = m[Kn$1] = m[$n$1] = m[Pn$1] = m[Mn$1] = m[_n$1] = m[Cn$1] = m[Dn$1] = m[In$1] = m[En$1] = m[Qn$1] = m[Nn$1] = m[jn$1] = m[qn$1] = false;
   function Wn$1(r) {
-    return O$2(r) && Ie$2(r.length) && !!m[N$4(r)];
+    return O$2(r) && De$2(r.length) && !!m[N$3(r)];
   }
   function J$2(r) {
     return function(e) {
       return r(e);
     };
   }
-  var Dt$1 = typeof exports == "object" && exports && !exports.nodeType && exports, B$3 = Dt$1 && typeof module == "object" && module && !module.nodeType && module, Vn$1 = B$3 && B$3.exports === Dt$1, pe$1 = Vn$1 && xt$1.process, k$1 = (function() {
+  var It$1 = typeof exports == "object" && exports && !exports.nodeType && exports, B$3 = It$1 && typeof module == "object" && module && !module.nodeType && module, Vn$1 = B$3 && B$3.exports === It$1, pe$1 = Vn$1 && xt$1.process, G$1 = (function() {
     try {
       var r = B$3 && B$3.require && B$3.require("util").types;
       return r || pe$1 && pe$1.binding && pe$1.binding("util");
     } catch {
     }
-  })(), Ze$2 = k$1 && k$1.isTypedArray, Et$1 = Ze$2 ? J$2(Ze$2) : Wn$1, Zn$1 = Object.prototype, Jn$1 = Zn$1.hasOwnProperty;
+  })(), Ze$2 = G$1 && G$1.isTypedArray, Et$1 = Ze$2 ? J$2(Ze$2) : Wn$1, Zn$1 = Object.prototype, Jn$1 = Zn$1.hasOwnProperty;
   function Xn$1(r, e) {
-    var t = v$2(r), n = !t && De$2(r), s = !t && !n && oe$1(r), i = !t && !n && !s && Et$1(r), o = t || n || s || i, a = o ? mn$1(r.length, String) : [], u = a.length;
+    var t = v$2(r), n = !t && Ie$2(r), s = !t && !n && ie$1(r), o = !t && !n && !s && Et$1(r), i = t || n || s || o, a = i ? mn$1(r.length, String) : [], u = a.length;
     for (var c in r)
-      (e || Jn$1.call(r, c)) && !(o && // Safari 9 has enumerable `arguments.length` in strict mode.
+      (e || Jn$1.call(r, c)) && !(i && // Safari 9 has enumerable `arguments.length` in strict mode.
       (c == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
       s && (c == "offset" || c == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
-      i && (c == "buffer" || c == "byteLength" || c == "byteOffset") || // Skip index properties.
-      $t$1(c, u))) && a.push(c);
+      o && (c == "buffer" || c == "byteLength" || c == "byteOffset") || // Skip index properties.
+      Mt$1(c, u))) && a.push(c);
     return a;
   }
   function Qt$1(r, e) {
@@ -846,29 +846,29 @@
     return e;
   }
   function ce$1(r) {
-    return G$1(r) ? Xn$1(r) : Nt$1(r);
+    return k$1(r) ? Xn$1(r) : Nt$1(r);
   }
   var rs$1 = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, ns$1 = /^\w*$/;
   function Ee$2(r, e) {
     if (v$2(r))
       return false;
     var t = typeof r;
-    return t == "number" || t == "symbol" || t == "boolean" || r == null || F$2(r) ? true : ns$1.test(r) || !rs$1.test(r) || e != null && r in Object(e);
+    return t == "number" || t == "symbol" || t == "boolean" || r == null || F$1(r) ? true : ns$1.test(r) || !rs$1.test(r) || e != null && r in Object(e);
   }
-  var U$3 = q(Object, "create");
+  var U$3 = q$1(Object, "create");
   function ss$1() {
     this.__data__ = U$3 ? U$3(null) : {}, this.size = 0;
   }
-  function is$1(r) {
+  function os$1(r) {
     var e = this.has(r) && delete this.__data__[r];
     return this.size -= e ? 1 : 0, e;
   }
-  var os$1 = "__lodash_hash_undefined__", as$1 = Object.prototype, us$1 = as$1.hasOwnProperty;
+  var is$1 = "__lodash_hash_undefined__", as$1 = Object.prototype, us$1 = as$1.hasOwnProperty;
   function cs$1(r) {
     var e = this.__data__;
     if (U$3) {
       var t = e[r];
-      return t === os$1 ? void 0 : t;
+      return t === is$1 ? void 0 : t;
     }
     return us$1.call(e, r) ? e[r] : void 0;
   }
@@ -882,18 +882,18 @@
     var t = this.__data__;
     return this.size += this.has(r) ? 0 : 1, t[r] = U$3 && e === void 0 ? hs$1 : e, this;
   }
-  function Q$4(r) {
+  function Q$3(r) {
     var e = -1, t = r == null ? 0 : r.length;
     for (this.clear(); ++e < t; ) {
       var n = r[e];
       this.set(n[0], n[1]);
     }
   }
-  Q$4.prototype.clear = ss$1;
-  Q$4.prototype.delete = is$1;
-  Q$4.prototype.get = cs$1;
-  Q$4.prototype.has = ds$1;
-  Q$4.prototype.set = ps$1;
+  Q$3.prototype.clear = ss$1;
+  Q$3.prototype.delete = os$1;
+  Q$3.prototype.get = cs$1;
+  Q$3.prototype.has = ds$1;
+  Q$3.prototype.set = ps$1;
   function gs$1() {
     this.__data__ = [], this.size = 0;
   }
@@ -922,24 +922,24 @@
     var t = this.__data__, n = fe$1(t, r);
     return n < 0 ? (++this.size, t.push([r, e])) : t[n][1] = e, this;
   }
-  function $$2(r) {
+  function M$3(r) {
     var e = -1, t = r == null ? 0 : r.length;
     for (this.clear(); ++e < t; ) {
       var n = r[e];
       this.set(n[0], n[1]);
     }
   }
-  $$2.prototype.clear = gs$1;
-  $$2.prototype.delete = bs$1;
-  $$2.prototype.get = vs$1;
-  $$2.prototype.has = ws$1;
-  $$2.prototype.set = As$1;
-  var H$1 = q(M$2, "Map");
+  M$3.prototype.clear = gs$1;
+  M$3.prototype.delete = bs$1;
+  M$3.prototype.get = vs$1;
+  M$3.prototype.has = ws$1;
+  M$3.prototype.set = As$1;
+  var H$1 = q$1($$2, "Map");
   function xs$1() {
     this.size = 0, this.__data__ = {
-      hash: new Q$4(),
-      map: new (H$1 || $$2)(),
-      string: new Q$4()
+      hash: new Q$3(),
+      map: new (H$1 || M$3)(),
+      string: new Q$3()
     };
   }
   function Ss$1(r) {
@@ -957,10 +957,10 @@
   function Os$1(r) {
     return le(this, r).get(r);
   }
-  function Ms$1(r) {
+  function $s$1(r) {
     return le(this, r).has(r);
   }
-  function $s$1(r, e) {
+  function Ms$1(r, e) {
     var t = le(this, r), n = t.size;
     return t.set(r, e), this.size += t.size == n ? 0 : 1, this;
   }
@@ -974,33 +974,33 @@
   _.prototype.clear = xs$1;
   _.prototype.delete = Ts$1;
   _.prototype.get = Os$1;
-  _.prototype.has = Ms$1;
-  _.prototype.set = $s$1;
+  _.prototype.has = $s$1;
+  _.prototype.set = Ms$1;
   var _s$1 = "Expected a function";
   function Qe$2(r, e) {
     if (typeof r != "function" || e != null && typeof e != "function")
       throw new TypeError(_s$1);
     var t = function() {
-      var n = arguments, s = e ? e.apply(this, n) : n[0], i = t.cache;
-      if (i.has(s))
-        return i.get(s);
-      var o = r.apply(this, n);
-      return t.cache = i.set(s, o) || i, o;
+      var n = arguments, s = e ? e.apply(this, n) : n[0], o = t.cache;
+      if (o.has(s))
+        return o.get(s);
+      var i = r.apply(this, n);
+      return t.cache = o.set(s, i) || o, i;
     };
     return t.cache = new (Qe$2.Cache || _)(), t;
   }
   Qe$2.Cache = _;
   var Cs$1 = 500;
-  function Is$1(r) {
+  function Ds$1(r) {
     var e = Qe$2(r, function(n) {
       return t.size === Cs$1 && t.clear(), n;
     }), t = e.cache;
     return e;
   }
-  var Ds$1 = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, Es$1 = /\\(\\)?/g, Qs$1 = Is$1(function(r) {
+  var Is$1 = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, Es$1 = /\\(\\)?/g, Qs$1 = Ds$1(function(r) {
     var e = [];
-    return r.charCodeAt(0) === 46 && e.push(""), r.replace(Ds$1, function(t, n, s, i) {
-      e.push(s ? i.replace(Es$1, "$1") : n || t);
+    return r.charCodeAt(0) === 46 && e.push(""), r.replace(Is$1, function(t, n, s, o) {
+      e.push(s ? o.replace(Es$1, "$1") : n || t);
     }), e;
   });
   function Ns$1(r) {
@@ -1010,7 +1010,7 @@
     return v$2(r) ? r : Ee$2(r, e) ? [r] : Qs$1(Ns$1(r));
   }
   function de$1(r) {
-    if (typeof r == "string" || F$2(r))
+    if (typeof r == "string" || F$1(r))
       return r;
     var e = r + "";
     return e == "0" && 1 / r == -1 / 0 ? "-0" : e;
@@ -1032,22 +1032,22 @@
   }
   var Je$3 = x$2 ? x$2.isConcatSpreadable : void 0;
   function js$1(r) {
-    return v$2(r) || De$2(r) || !!(Je$3 && r && r[Je$3]);
+    return v$2(r) || Ie$2(r) || !!(Je$3 && r && r[Je$3]);
   }
   function qs$1(r, e, t, n, s) {
-    var i = -1, o = r.length;
-    for (t || (t = js$1), s || (s = []); ++i < o; ) {
-      var a = r[i];
+    var o = -1, i = r.length;
+    for (t || (t = js$1), s || (s = []); ++o < i; ) {
+      var a = r[o];
       t(a) && qt$1(s, a);
     }
     return s;
   }
-  var Ks$1 = Qt$1(Object.getPrototypeOf, Object), Ps$1 = "\\ud800-\\udfff", Rs$1 = "\\u0300-\\u036f", Fs$1 = "\\ufe20-\\ufe2f", ks$1 = "\\u20d0-\\u20ff", Gs$1 = Rs$1 + Fs$1 + ks$1, Ls$1 = "\\ufe0e\\ufe0f", zs$1 = "\\u200d", Bs$1 = RegExp("[" + zs$1 + Ps$1 + Gs$1 + Ls$1 + "]");
+  var Ks$1 = Qt$1(Object.getPrototypeOf, Object), Ps$1 = "\\ud800-\\udfff", Rs$1 = "\\u0300-\\u036f", Fs$1 = "\\ufe20-\\ufe2f", Gs$1 = "\\u20d0-\\u20ff", ks$1 = Rs$1 + Fs$1 + Gs$1, Ls$1 = "\\ufe0e\\ufe0f", zs$1 = "\\u200d", Bs$1 = RegExp("[" + zs$1 + Ps$1 + ks$1 + Ls$1 + "]");
   function Us$1(r) {
     return Bs$1.test(r);
   }
   function Hs$1() {
-    this.__data__ = new $$2(), this.size = 0;
+    this.__data__ = new M$3(), this.size = 0;
   }
   function Ws$1(r) {
     var e = this.__data__, t = e.delete(r);
@@ -1062,7 +1062,7 @@
   var Js$1 = 200;
   function Xs$1(r, e) {
     var t = this.__data__;
-    if (t instanceof $$2) {
+    if (t instanceof M$3) {
       var n = t.__data__;
       if (!H$1 || n.length < Js$1 - 1)
         return n.push([r, e]), this.size = ++t.size, this;
@@ -1071,7 +1071,7 @@
     return t.set(r, e), this.size = t.size, this;
   }
   function T$2(r) {
-    var e = this.__data__ = new $$2(r);
+    var e = this.__data__ = new M$3(r);
     this.size = e.size;
   }
   T$2.prototype.clear = Hs$1;
@@ -1079,172 +1079,172 @@
   T$2.prototype.get = Vs$1;
   T$2.prototype.has = Zs$1;
   T$2.prototype.set = Xs$1;
-  var Kt$1 = typeof exports == "object" && exports && !exports.nodeType && exports, Xe$2 = Kt$1 && typeof module == "object" && module && !module.nodeType && module, Ys$1 = Xe$2 && Xe$2.exports === Kt$1, Ye$2 = Ys$1 ? M$2.Buffer : void 0, et$2 = Ye$2 ? Ye$2.allocUnsafe : void 0;
-  function ei(r, e) {
+  var Kt$1 = typeof exports == "object" && exports && !exports.nodeType && exports, Xe$2 = Kt$1 && typeof module == "object" && module && !module.nodeType && module, Ys$1 = Xe$2 && Xe$2.exports === Kt$1, Ye$2 = Ys$1 ? $$2.Buffer : void 0, et$2 = Ye$2 ? Ye$2.allocUnsafe : void 0;
+  function eo$1(r, e) {
     if (e)
       return r.slice();
     var t = r.length, n = et$2 ? et$2(t) : new r.constructor(t);
     return r.copy(n), n;
   }
-  function ti(r, e) {
-    for (var t = -1, n = r == null ? 0 : r.length, s = 0, i = []; ++t < n; ) {
-      var o = r[t];
-      e(o, t, r) && (i[s++] = o);
+  function to$1(r, e) {
+    for (var t = -1, n = r == null ? 0 : r.length, s = 0, o = []; ++t < n; ) {
+      var i = r[t];
+      e(i, t, r) && (o[s++] = i);
     }
-    return i;
+    return o;
   }
-  function ri() {
+  function ro$1() {
     return [];
   }
-  var ni = Object.prototype, si = ni.propertyIsEnumerable, tt$2 = Object.getOwnPropertySymbols, ii = tt$2 ? function(r) {
-    return r == null ? [] : (r = Object(r), ti(tt$2(r), function(e) {
-      return si.call(r, e);
+  var no$1 = Object.prototype, so$1 = no$1.propertyIsEnumerable, tt$2 = Object.getOwnPropertySymbols, oo$1 = tt$2 ? function(r) {
+    return r == null ? [] : (r = Object(r), to$1(tt$2(r), function(e) {
+      return so$1.call(r, e);
     }));
-  } : ri;
-  function oi(r, e, t) {
+  } : ro$1;
+  function io$1(r, e, t) {
     var n = e(r);
     return v$2(r) ? n : qt$1(n, t(r));
   }
   function we$2(r) {
-    return oi(r, ce$1, ii);
+    return io$1(r, ce$1, oo$1);
   }
-  var Ae$2 = q(M$2, "DataView"), xe$2 = q(M$2, "Promise"), Se$2 = q(M$2, "Set"), rt$2 = "[object Map]", ai = "[object Object]", nt$2 = "[object Promise]", st$2 = "[object Set]", it$2 = "[object WeakMap]", ot$2 = "[object DataView]", ui = j$2(Ae$2), ci = j$2(H$1), fi = j$2(xe$2), li = j$2(Se$2), di = j$2(ve$1), A$1 = N$4;
-  (Ae$2 && A$1(new Ae$2(new ArrayBuffer(1))) != ot$2 || H$1 && A$1(new H$1()) != rt$2 || xe$2 && A$1(xe$2.resolve()) != nt$2 || Se$2 && A$1(new Se$2()) != st$2 || ve$1 && A$1(new ve$1()) != it$2) && (A$1 = function(r) {
-    var e = N$4(r), t = e == ai ? r.constructor : void 0, n = t ? j$2(t) : "";
+  var Ae$2 = q$1($$2, "DataView"), xe$2 = q$1($$2, "Promise"), Se$2 = q$1($$2, "Set"), rt$2 = "[object Map]", ao$1 = "[object Object]", nt$2 = "[object Promise]", st$2 = "[object Set]", ot$2 = "[object WeakMap]", it$2 = "[object DataView]", uo$1 = j$2(Ae$2), co$1 = j$2(H$1), fo$1 = j$2(xe$2), lo$1 = j$2(Se$2), ho$1 = j$2(ve$1), A$1 = N$3;
+  (Ae$2 && A$1(new Ae$2(new ArrayBuffer(1))) != it$2 || H$1 && A$1(new H$1()) != rt$2 || xe$2 && A$1(xe$2.resolve()) != nt$2 || Se$2 && A$1(new Se$2()) != st$2 || ve$1 && A$1(new ve$1()) != ot$2) && (A$1 = function(r) {
+    var e = N$3(r), t = e == ao$1 ? r.constructor : void 0, n = t ? j$2(t) : "";
     if (n)
       switch (n) {
-        case ui:
-          return ot$2;
-        case ci:
+        case uo$1:
+          return it$2;
+        case co$1:
           return rt$2;
-        case fi:
+        case fo$1:
           return nt$2;
-        case li:
+        case lo$1:
           return st$2;
-        case di:
-          return it$2;
+        case ho$1:
+          return ot$2;
       }
     return e;
   });
-  var hi = Object.prototype, pi = hi.hasOwnProperty;
-  function gi(r) {
+  var po$1 = Object.prototype, go$1 = po$1.hasOwnProperty;
+  function yo$1(r) {
     var e = r.length, t = new r.constructor(e);
-    return e && typeof r[0] == "string" && pi.call(r, "index") && (t.index = r.index, t.input = r.input), t;
+    return e && typeof r[0] == "string" && go$1.call(r, "index") && (t.index = r.index, t.input = r.input), t;
   }
-  var ae$2 = M$2.Uint8Array;
+  var ae$2 = $$2.Uint8Array;
   function je$2(r) {
     var e = new r.constructor(r.byteLength);
     return new ae$2(e).set(new ae$2(r)), e;
   }
-  function yi(r, e) {
+  function mo$1(r, e) {
     var t = je$2(r.buffer);
     return new r.constructor(t, r.byteOffset, r.byteLength);
   }
-  var mi = /\w*$/;
-  function bi(r) {
-    var e = new r.constructor(r.source, mi.exec(r));
+  var bo$1 = /\w*$/;
+  function vo$1(r) {
+    var e = new r.constructor(r.source, bo$1.exec(r));
     return e.lastIndex = r.lastIndex, e;
   }
   var at$3 = x$2 ? x$2.prototype : void 0, ut$1 = at$3 ? at$3.valueOf : void 0;
-  function vi(r) {
+  function wo$1(r) {
     return ut$1 ? Object(ut$1.call(r)) : {};
   }
-  function wi(r, e) {
+  function Ao$1(r, e) {
     var t = e ? je$2(r.buffer) : r.buffer;
     return new r.constructor(t, r.byteOffset, r.length);
   }
-  var Ai = "[object Boolean]", xi = "[object Date]", Si = "[object Map]", Ti = "[object Number]", Oi = "[object RegExp]", Mi = "[object Set]", $i = "[object String]", _i = "[object Symbol]", Ci = "[object ArrayBuffer]", Ii = "[object DataView]", Di = "[object Float32Array]", Ei = "[object Float64Array]", Qi = "[object Int8Array]", Ni = "[object Int16Array]", ji = "[object Int32Array]", qi = "[object Uint8Array]", Ki = "[object Uint8ClampedArray]", Pi = "[object Uint16Array]", Ri = "[object Uint32Array]";
-  function Fi(r, e, t) {
+  var xo$1 = "[object Boolean]", So$1 = "[object Date]", To$1 = "[object Map]", Oo$1 = "[object Number]", $o$1 = "[object RegExp]", Mo = "[object Set]", _o$1 = "[object String]", Co$1 = "[object Symbol]", Do = "[object ArrayBuffer]", Io$1 = "[object DataView]", Eo$1 = "[object Float32Array]", Qo = "[object Float64Array]", No = "[object Int8Array]", jo$1 = "[object Int16Array]", qo = "[object Int32Array]", Ko = "[object Uint8Array]", Po$1 = "[object Uint8ClampedArray]", Ro$1 = "[object Uint16Array]", Fo$1 = "[object Uint32Array]";
+  function Go(r, e, t) {
     var n = r.constructor;
     switch (e) {
-      case Ci:
+      case Do:
         return je$2(r);
-      case Ai:
-      case xi:
+      case xo$1:
+      case So$1:
         return new n(+r);
-      case Ii:
-        return yi(r);
-      case Di:
-      case Ei:
-      case Qi:
-      case Ni:
-      case ji:
-      case qi:
-      case Ki:
-      case Pi:
-      case Ri:
-        return wi(r, t);
-      case Si:
+      case Io$1:
+        return mo$1(r);
+      case Eo$1:
+      case Qo:
+      case No:
+      case jo$1:
+      case qo:
+      case Ko:
+      case Po$1:
+      case Ro$1:
+      case Fo$1:
+        return Ao$1(r, t);
+      case To$1:
         return new n();
-      case Ti:
-      case $i:
+      case Oo$1:
+      case _o$1:
         return new n(r);
-      case Oi:
-        return bi(r);
-      case Mi:
+      case $o$1:
+        return vo$1(r);
+      case Mo:
         return new n();
-      case _i:
-        return vi(r);
+      case Co$1:
+        return wo$1(r);
     }
   }
-  function ki(r) {
+  function ko$1(r) {
     return typeof r.constructor == "function" && !_t$1(r) ? Ur$1(Ks$1(r)) : {};
   }
-  var Gi = "[object Map]";
-  function Li(r) {
-    return O$2(r) && A$1(r) == Gi;
+  var Lo$1 = "[object Map]";
+  function zo(r) {
+    return O$2(r) && A$1(r) == Lo$1;
   }
-  var ct$3 = k$1 && k$1.isMap, zi = ct$3 ? J$2(ct$3) : Li, Bi = "[object Set]";
-  function Ui(r) {
-    return O$2(r) && A$1(r) == Bi;
+  var ct$3 = G$1 && G$1.isMap, Bo = ct$3 ? J$2(ct$3) : zo, Uo = "[object Set]";
+  function Ho(r) {
+    return O$2(r) && A$1(r) == Uo;
   }
-  var ft$1 = k$1 && k$1.isSet, Hi = ft$1 ? J$2(ft$1) : Ui, Wi = 1, Pt$1 = "[object Arguments]", Vi = "[object Array]", Zi = "[object Boolean]", Ji = "[object Date]", Xi = "[object Error]", Rt$1 = "[object Function]", Yi = "[object GeneratorFunction]", eo$1 = "[object Map]", to$1 = "[object Number]", Ft$1 = "[object Object]", ro$1 = "[object RegExp]", no$1 = "[object Set]", so$1 = "[object String]", io$1 = "[object Symbol]", oo$1 = "[object WeakMap]", ao$1 = "[object ArrayBuffer]", uo$1 = "[object DataView]", co$1 = "[object Float32Array]", fo$1 = "[object Float64Array]", lo$1 = "[object Int8Array]", ho$1 = "[object Int16Array]", po$1 = "[object Int32Array]", go$1 = "[object Uint8Array]", yo$1 = "[object Uint8ClampedArray]", mo$1 = "[object Uint16Array]", bo$1 = "[object Uint32Array]", y$1 = {};
-  y$1[Pt$1] = y$1[Vi] = y$1[ao$1] = y$1[uo$1] = y$1[Zi] = y$1[Ji] = y$1[co$1] = y$1[fo$1] = y$1[lo$1] = y$1[ho$1] = y$1[po$1] = y$1[eo$1] = y$1[to$1] = y$1[Ft$1] = y$1[ro$1] = y$1[no$1] = y$1[so$1] = y$1[io$1] = y$1[go$1] = y$1[yo$1] = y$1[mo$1] = y$1[bo$1] = true;
-  y$1[Xi] = y$1[Rt$1] = y$1[oo$1] = false;
-  function se$1(r, e, t, n, s, i) {
-    var o, a = e & Wi;
-    if (o !== void 0)
-      return o;
-    if (!E$3(r))
+  var ft$1 = G$1 && G$1.isSet, Wo = ft$1 ? J$2(ft$1) : Ho, Vo$1 = 1, Pt$1 = "[object Arguments]", Zo = "[object Array]", Jo = "[object Boolean]", Xo = "[object Date]", Yo = "[object Error]", Rt$1 = "[object Function]", ei = "[object GeneratorFunction]", ti = "[object Map]", ri = "[object Number]", Ft$1 = "[object Object]", ni = "[object RegExp]", si = "[object Set]", oi = "[object String]", ii = "[object Symbol]", ai = "[object WeakMap]", ui = "[object ArrayBuffer]", ci = "[object DataView]", fi = "[object Float32Array]", li = "[object Float64Array]", di = "[object Int8Array]", hi = "[object Int16Array]", pi = "[object Int32Array]", gi = "[object Uint8Array]", yi = "[object Uint8ClampedArray]", mi = "[object Uint16Array]", bi = "[object Uint32Array]", y$1 = {};
+  y$1[Pt$1] = y$1[Zo] = y$1[ui] = y$1[ci] = y$1[Jo] = y$1[Xo] = y$1[fi] = y$1[li] = y$1[di] = y$1[hi] = y$1[pi] = y$1[ti] = y$1[ri] = y$1[Ft$1] = y$1[ni] = y$1[si] = y$1[oi] = y$1[ii] = y$1[gi] = y$1[yi] = y$1[mi] = y$1[bi] = true;
+  y$1[Yo] = y$1[Rt$1] = y$1[ai] = false;
+  function se$1(r, e, t, n, s, o) {
+    var i, a = e & Vo$1;
+    if (i !== void 0)
+      return i;
+    if (!E$4(r))
       return r;
     var u = v$2(r);
     if (u)
-      o = gi(r);
+      i = yo$1(r);
     else {
-      var c = A$1(r), f = c == Rt$1 || c == Yi;
-      if (oe$1(r))
-        return ei(r, a);
+      var c = A$1(r), f = c == Rt$1 || c == ei;
+      if (ie$1(r))
+        return eo$1(r, a);
       if (c == Ft$1 || c == Pt$1 || f && !s)
-        o = f ? {} : ki(r);
+        i = f ? {} : ko$1(r);
       else {
         if (!y$1[c])
           return s ? r : {};
-        o = Fi(r, c, a);
+        i = Go(r, c, a);
       }
     }
-    i || (i = new T$2());
-    var l = i.get(r);
+    o || (o = new T$2());
+    var l = o.get(r);
     if (l)
       return l;
-    i.set(r, o), Hi(r) ? r.forEach(function(p2) {
-      o.add(se$1(p2, e, t, p2, r, i));
-    }) : zi(r) && r.forEach(function(p2, g2) {
-      o.set(g2, se$1(p2, e, t, g2, r, i));
+    o.set(r, i), Wo(r) ? r.forEach(function(p2) {
+      i.add(se$1(p2, e, t, p2, r, o));
+    }) : Bo(r) && r.forEach(function(p2, g2) {
+      i.set(g2, se$1(p2, e, t, g2, r, o));
     });
     var d = we$2, h = u ? void 0 : d(r);
     return tn$1(h || r, function(p2, g2) {
-      h && (g2 = p2, p2 = r[g2]), dn$1(o, g2, se$1(p2, e, t, g2, r, i));
-    }), o;
+      h && (g2 = p2, p2 = r[g2]), dn$1(i, g2, se$1(p2, e, t, g2, r, o));
+    }), i;
   }
-  var vo$1 = 1, wo$1 = 4;
+  var vi = 1, wi = 4;
   function C$2(r) {
-    return se$1(r, vo$1 | wo$1);
+    return se$1(r, vi | wi);
   }
-  var Ao$1 = "__lodash_hash_undefined__";
-  function xo$1(r) {
-    return this.__data__.set(r, Ao$1), this;
+  var Ai = "__lodash_hash_undefined__";
+  function xi(r) {
+    return this.__data__.set(r, Ai), this;
   }
-  function So$1(r) {
+  function Si(r) {
     return this.__data__.has(r);
   }
   function V$1(r) {
@@ -1252,30 +1252,30 @@
     for (this.__data__ = new _(); ++e < t; )
       this.add(r[e]);
   }
-  V$1.prototype.add = V$1.prototype.push = xo$1;
-  V$1.prototype.has = So$1;
-  function To$1(r, e) {
+  V$1.prototype.add = V$1.prototype.push = xi;
+  V$1.prototype.has = Si;
+  function Ti(r, e) {
     for (var t = -1, n = r == null ? 0 : r.length; ++t < n; )
       if (e(r[t], t, r))
         return true;
     return false;
   }
-  function kt$1(r, e) {
+  function Gt$1(r, e) {
     return r.has(e);
   }
-  var Oo$1 = 1, Mo = 2;
-  function Gt$1(r, e, t, n, s, i) {
-    var o = t & Oo$1, a = r.length, u = e.length;
-    if (a != u && !(o && u > a))
+  var Oi = 1, $i = 2;
+  function kt$1(r, e, t, n, s, o) {
+    var i = t & Oi, a = r.length, u = e.length;
+    if (a != u && !(i && u > a))
       return false;
-    var c = i.get(r), f = i.get(e);
+    var c = o.get(r), f = o.get(e);
     if (c && f)
       return c == e && f == r;
-    var l = -1, d = true, h = t & Mo ? new V$1() : void 0;
-    for (i.set(r, e), i.set(e, r); ++l < a; ) {
+    var l = -1, d = true, h = t & $i ? new V$1() : void 0;
+    for (o.set(r, e), o.set(e, r); ++l < a; ) {
       var p2 = r[l], g2 = e[l];
       if (n)
-        var w = o ? n(g2, p2, l, e, r, i) : n(p2, g2, l, r, e, i);
+        var w = i ? n(g2, p2, l, e, r, o) : n(p2, g2, l, r, e, o);
       if (w !== void 0) {
         if (w)
           continue;
@@ -1283,89 +1283,89 @@
         break;
       }
       if (h) {
-        if (!To$1(e, function(I, D2) {
-          if (!kt$1(h, D2) && (p2 === I || s(p2, I, t, n, i)))
-            return h.push(D2);
+        if (!Ti(e, function(D2, I) {
+          if (!Gt$1(h, I) && (p2 === D2 || s(p2, D2, t, n, o)))
+            return h.push(I);
         })) {
           d = false;
           break;
         }
-      } else if (!(p2 === g2 || s(p2, g2, t, n, i))) {
+      } else if (!(p2 === g2 || s(p2, g2, t, n, o))) {
         d = false;
         break;
       }
     }
-    return i.delete(r), i.delete(e), d;
+    return o.delete(r), o.delete(e), d;
   }
-  function $o$1(r) {
+  function Mi(r) {
     var e = -1, t = Array(r.size);
     return r.forEach(function(n, s) {
       t[++e] = [s, n];
     }), t;
   }
-  function _o$1(r) {
+  function _i(r) {
     var e = -1, t = Array(r.size);
     return r.forEach(function(n) {
       t[++e] = n;
     }), t;
   }
-  var Co$1 = 1, Io$1 = 2, Do = "[object Boolean]", Eo$1 = "[object Date]", Qo = "[object Error]", No = "[object Map]", jo$1 = "[object Number]", qo = "[object RegExp]", Ko = "[object Set]", Po$1 = "[object String]", Ro$1 = "[object Symbol]", Fo$1 = "[object ArrayBuffer]", ko$1 = "[object DataView]", lt$3 = x$2 ? x$2.prototype : void 0, ge = lt$3 ? lt$3.valueOf : void 0;
-  function Go(r, e, t, n, s, i, o) {
+  var Ci = 1, Di = 2, Ii = "[object Boolean]", Ei = "[object Date]", Qi = "[object Error]", Ni = "[object Map]", ji = "[object Number]", qi = "[object RegExp]", Ki = "[object Set]", Pi = "[object String]", Ri = "[object Symbol]", Fi = "[object ArrayBuffer]", Gi = "[object DataView]", lt$3 = x$2 ? x$2.prototype : void 0, ge = lt$3 ? lt$3.valueOf : void 0;
+  function ki(r, e, t, n, s, o, i) {
     switch (t) {
-      case ko$1:
+      case Gi:
         if (r.byteLength != e.byteLength || r.byteOffset != e.byteOffset)
           return false;
         r = r.buffer, e = e.buffer;
-      case Fo$1:
-        return !(r.byteLength != e.byteLength || !i(new ae$2(r), new ae$2(e)));
-      case Do:
-      case Eo$1:
-      case jo$1:
+      case Fi:
+        return !(r.byteLength != e.byteLength || !o(new ae$2(r), new ae$2(e)));
+      case Ii:
+      case Ei:
+      case ji:
         return Ce$2(+r, +e);
-      case Qo:
+      case Qi:
         return r.name == e.name && r.message == e.message;
-      case qo:
-      case Po$1:
+      case qi:
+      case Pi:
         return r == e + "";
-      case No:
-        var a = $o$1;
-      case Ko:
-        var u = n & Co$1;
-        if (a || (a = _o$1), r.size != e.size && !u)
+      case Ni:
+        var a = Mi;
+      case Ki:
+        var u = n & Ci;
+        if (a || (a = _i), r.size != e.size && !u)
           return false;
-        var c = o.get(r);
+        var c = i.get(r);
         if (c)
           return c == e;
-        n |= Io$1, o.set(r, e);
-        var f = Gt$1(a(r), a(e), n, s, i, o);
-        return o.delete(r), f;
-      case Ro$1:
+        n |= Di, i.set(r, e);
+        var f = kt$1(a(r), a(e), n, s, o, i);
+        return i.delete(r), f;
+      case Ri:
         if (ge)
           return ge.call(r) == ge.call(e);
     }
     return false;
   }
-  var Lo$1 = 1, zo = Object.prototype, Bo = zo.hasOwnProperty;
-  function Uo(r, e, t, n, s, i) {
-    var o = t & Lo$1, a = we$2(r), u = a.length, c = we$2(e), f = c.length;
-    if (u != f && !o)
+  var Li = 1, zi = Object.prototype, Bi = zi.hasOwnProperty;
+  function Ui(r, e, t, n, s, o) {
+    var i = t & Li, a = we$2(r), u = a.length, c = we$2(e), f = c.length;
+    if (u != f && !i)
       return false;
     for (var l = u; l--; ) {
       var d = a[l];
-      if (!(o ? d in e : Bo.call(e, d)))
+      if (!(i ? d in e : Bi.call(e, d)))
         return false;
     }
-    var h = i.get(r), p2 = i.get(e);
+    var h = o.get(r), p2 = o.get(e);
     if (h && p2)
       return h == e && p2 == r;
     var g2 = true;
-    i.set(r, e), i.set(e, r);
-    for (var w = o; ++l < u; ) {
+    o.set(r, e), o.set(e, r);
+    for (var w = i; ++l < u; ) {
       d = a[l];
-      var I = r[d], D2 = e[d];
+      var D2 = r[d], I = e[d];
       if (n)
-        var Pe2 = o ? n(D2, I, d, e, r, i) : n(I, D2, d, r, e, i);
-      if (!(Pe2 === void 0 ? I === D2 || s(I, D2, t, n, i) : Pe2)) {
+        var Pe2 = i ? n(I, D2, d, e, r, o) : n(D2, I, d, r, e, o);
+      if (!(Pe2 === void 0 ? D2 === I || s(D2, I, t, n, o) : Pe2)) {
         g2 = false;
         break;
       }
@@ -1375,58 +1375,58 @@
       var ee2 = r.constructor, te2 = e.constructor;
       ee2 != te2 && "constructor" in r && "constructor" in e && !(typeof ee2 == "function" && ee2 instanceof ee2 && typeof te2 == "function" && te2 instanceof te2) && (g2 = false);
     }
-    return i.delete(r), i.delete(e), g2;
+    return o.delete(r), o.delete(e), g2;
   }
-  var Ho = 1, dt$3 = "[object Arguments]", ht = "[object Array]", re$2 = "[object Object]", Wo = Object.prototype, pt$1 = Wo.hasOwnProperty;
-  function Vo$1(r, e, t, n, s, i) {
-    var o = v$2(r), a = v$2(e), u = o ? ht : A$1(r), c = a ? ht : A$1(e);
+  var Hi = 1, dt$3 = "[object Arguments]", ht = "[object Array]", re$2 = "[object Object]", Wi = Object.prototype, pt$1 = Wi.hasOwnProperty;
+  function Vi(r, e, t, n, s, o) {
+    var i = v$2(r), a = v$2(e), u = i ? ht : A$1(r), c = a ? ht : A$1(e);
     u = u == dt$3 ? re$2 : u, c = c == dt$3 ? re$2 : c;
     var f = u == re$2, l = c == re$2, d = u == c;
-    if (d && oe$1(r)) {
-      if (!oe$1(e))
+    if (d && ie$1(r)) {
+      if (!ie$1(e))
         return false;
-      o = true, f = false;
+      i = true, f = false;
     }
     if (d && !f)
-      return i || (i = new T$2()), o || Et$1(r) ? Gt$1(r, e, t, n, s, i) : Go(r, e, u, t, n, s, i);
-    if (!(t & Ho)) {
+      return o || (o = new T$2()), i || Et$1(r) ? kt$1(r, e, t, n, s, o) : ki(r, e, u, t, n, s, o);
+    if (!(t & Hi)) {
       var h = f && pt$1.call(r, "__wrapped__"), p2 = l && pt$1.call(e, "__wrapped__");
       if (h || p2) {
         var g2 = h ? r.value() : r, w = p2 ? e.value() : e;
-        return i || (i = new T$2()), s(g2, w, t, n, i);
+        return o || (o = new T$2()), s(g2, w, t, n, o);
       }
     }
-    return d ? (i || (i = new T$2()), Uo(r, e, t, n, s, i)) : false;
+    return d ? (o || (o = new T$2()), Ui(r, e, t, n, s, o)) : false;
   }
   function X$2(r, e, t, n, s) {
-    return r === e ? true : r == null || e == null || !O$2(r) && !O$2(e) ? r !== r && e !== e : Vo$1(r, e, t, n, X$2, s);
+    return r === e ? true : r == null || e == null || !O$2(r) && !O$2(e) ? r !== r && e !== e : Vi(r, e, t, n, X$2, s);
   }
-  var Zo = 1, Jo = 2;
+  var Zi = 1, Ji = 2;
   function Lt$1(r, e, t, n) {
-    var s = t.length, i = s;
+    var s = t.length, o = s;
     if (r == null)
-      return !i;
+      return !o;
     for (r = Object(r); s--; ) {
-      var o = t[s];
-      if (o[2] ? o[1] !== r[o[0]] : !(o[0] in r))
+      var i = t[s];
+      if (i[2] ? i[1] !== r[i[0]] : !(i[0] in r))
         return false;
     }
-    for (; ++s < i; ) {
-      o = t[s];
-      var a = o[0], u = r[a], c = o[1];
-      if (o[2]) {
+    for (; ++s < o; ) {
+      i = t[s];
+      var a = i[0], u = r[a], c = i[1];
+      if (i[2]) {
         if (u === void 0 && !(a in r))
           return false;
       } else {
         var f = new T$2(), l;
-        if (!(l === void 0 ? X$2(c, u, Zo | Jo, n, f) : l))
+        if (!(l === void 0 ? X$2(c, u, Zi | Ji, n, f) : l))
           return false;
       }
     }
     return true;
   }
   function zt$1(r) {
-    return r === r && !E$3(r);
+    return r === r && !E$4(r);
   }
   function Bt$1(r) {
     for (var e = ce$1(r), t = e.length; t--; ) {
@@ -1440,27 +1440,27 @@
       return t == null ? false : t[r] === e && (e !== void 0 || r in Object(t));
     };
   }
-  function Xo(r) {
+  function Xi(r) {
     var e = Bt$1(r);
     return e.length == 1 && e[0][2] ? Ut$1(e[0][0], e[0][1]) : function(t) {
       return t === r || Lt$1(t, r, e);
     };
   }
-  function Yo(r, e) {
+  function Yi(r, e) {
     return r != null && e in Object(r);
   }
   function ea(r, e, t) {
     e = jt$1(e, r);
-    for (var n = -1, s = e.length, i = false; ++n < s; ) {
-      var o = de$1(e[n]);
-      if (!(i = r != null && t(r, o)))
+    for (var n = -1, s = e.length, o = false; ++n < s; ) {
+      var i = de$1(e[n]);
+      if (!(o = r != null && t(r, i)))
         break;
-      r = r[o];
+      r = r[i];
     }
-    return i || ++n != s ? i : (s = r == null ? 0 : r.length, !!s && Ie$2(s) && $t$1(o, s) && (v$2(r) || De$2(r)));
+    return o || ++n != s ? o : (s = r == null ? 0 : r.length, !!s && De$2(s) && Mt$1(i, s) && (v$2(r) || Ie$2(r)));
   }
   function ta(r, e) {
-    return r != null && ea(r, e, Yo);
+    return r != null && ea(r, e, Yi);
   }
   var ra = 1, na = 2;
   function sa(r, e) {
@@ -1474,22 +1474,22 @@
       return e?.[r];
     };
   }
-  function ia(r) {
+  function oa(r) {
     return function(e) {
       return Ne$2(e, r);
     };
   }
-  function oa(r) {
-    return Ee$2(r) ? Ht$1(de$1(r)) : ia(r);
+  function ia(r) {
+    return Ee$2(r) ? Ht$1(de$1(r)) : oa(r);
   }
   function Y$3(r) {
-    return typeof r == "function" ? r : r == null ? ue$1 : typeof r == "object" ? v$2(r) ? sa(r[0], r[1]) : Xo(r) : oa(r);
+    return typeof r == "function" ? r : r == null ? ue$1 : typeof r == "object" ? v$2(r) ? sa(r[0], r[1]) : Xi(r) : ia(r);
   }
   function aa(r) {
     return function(e, t, n) {
-      for (var s = -1, i = Object(e), o = n(e), a = o.length; a--; ) {
-        var u = o[++s];
-        if (t(i[u], u, i) === false)
+      for (var s = -1, o = Object(e), i = n(e), a = i.length; a--; ) {
+        var u = i[++s];
+        if (t(o[u], u, o) === false)
           break;
       }
       return e;
@@ -1503,32 +1503,32 @@
     return function(t, n) {
       if (t == null)
         return t;
-      if (!G$1(t))
+      if (!k$1(t))
         return r(t, n);
-      for (var s = t.length, i = -1, o = Object(t); ++i < s && n(o[i], i, o) !== false; )
+      for (var s = t.length, o = -1, i = Object(t); ++o < s && n(i[o], o, i) !== false; )
         ;
       return t;
     };
   }
   var Wt$1 = fa(ca);
   function ye(r) {
-    return O$2(r) && G$1(r);
+    return O$2(r) && k$1(r);
   }
   var la = 200;
   function da(r, e, t, n) {
-    var s = -1, i = on$1, o = true, a = r.length, u = [], c = e.length;
+    var s = -1, o = on$1, i = true, a = r.length, u = [], c = e.length;
     if (!a)
       return u;
-    t && (e = z$4(e, J$2(t))), e.length >= la && (i = kt$1, o = false, e = new V$1(e));
+    t && (e = z$4(e, J$2(t))), e.length >= la && (o = Gt$1, i = false, e = new V$1(e));
     e:
       for (; ++s < a; ) {
         var f = r[s], l = t == null ? f : t(f);
-        if (f = f !== 0 ? f : 0, o && l === l) {
+        if (f = f !== 0 ? f : 0, i && l === l) {
           for (var d = c; d--; )
             if (e[d] === l)
               continue e;
           u.push(f);
-        } else i(e, l, n) || u.push(f);
+        } else o(e, l, n) || u.push(f);
       }
     return u;
   }
@@ -1548,8 +1548,8 @@
   }
   function ga(r, e) {
     var t = true;
-    return Wt$1(r, function(n, s, i) {
-      return t = !!e(n, s, i), t;
+    return Wt$1(r, function(n, s, o) {
+      return t = !!e(n, s, o), t;
     }), t;
   }
   function Vt$1(r, e, t) {
@@ -1559,14 +1559,14 @@
   function ya(r) {
     return function(e, t, n) {
       var s = Object(e);
-      if (!G$1(e)) {
-        var i = Y$3(t);
+      if (!k$1(e)) {
+        var o = Y$3(t);
         e = ce$1(e), t = function(a) {
-          return i(s[a], a, s);
+          return o(s[a], a, s);
         };
       }
-      var o = r(e, t, n);
-      return o > -1 ? s[i ? e[o] : o] : void 0;
+      var i = r(e, t, n);
+      return i > -1 ? s[o ? e[i] : i] : void 0;
     };
   }
   var ma = Math.max;
@@ -1575,18 +1575,18 @@
     if (!n)
       return -1;
     var s = t == null ? 0 : Cr$1(t);
-    return s < 0 && (s = ma(n + s, 0)), Mt$1(r, Y$3(e), s);
+    return s < 0 && (s = ma(n + s, 0)), $t$1(r, Y$3(e), s);
   }
   var ba = ya(Te$2);
   function va(r, e) {
-    var t = -1, n = G$1(r) ? Array(r.length) : [];
-    return Wt$1(r, function(s, i, o) {
-      n[++t] = e(s, i, o);
+    var t = -1, n = k$1(r) ? Array(r.length) : [];
+    return Wt$1(r, function(s, o, i) {
+      n[++t] = e(s, o, i);
     }), n;
   }
   var wa = "[object String]";
   function Aa(r) {
-    return typeof r == "string" || !v$2(r) && O$2(r) && N$4(r) == wa;
+    return typeof r == "string" || !v$2(r) && O$2(r) && N$3(r) == wa;
   }
   function xa(r, e) {
     return X$2(r, e);
@@ -1607,17 +1607,17 @@
   }
   function Ta(r, e) {
     if (r !== e) {
-      var t = r !== void 0, n = r === null, s = r === r, i = F$2(r), o = e !== void 0, a = e === null, u = e === e, c = F$2(e);
-      if (!a && !c && !i && r > e || i && o && u && !a && !c || n && o && u || !t && u || !s)
+      var t = r !== void 0, n = r === null, s = r === r, o = F$1(r), i = e !== void 0, a = e === null, u = e === e, c = F$1(e);
+      if (!a && !c && !o && r > e || o && i && u && !a && !c || n && i && u || !t && u || !s)
         return 1;
-      if (!n && !i && !c && r < e || c && t && s && !n && !i || a && t && s || !o && s || !u)
+      if (!n && !o && !c && r < e || c && t && s && !n && !o || a && t && s || !i && s || !u)
         return -1;
     }
     return 0;
   }
   function Oa(r, e, t) {
-    for (var n = -1, s = r.criteria, i = e.criteria, o = s.length, a = t.length; ++n < o; ) {
-      var u = Ta(s[n], i[n]);
+    for (var n = -1, s = r.criteria, o = e.criteria, i = s.length, a = t.length; ++n < i; ) {
+      var u = Ta(s[n], o[n]);
       if (u) {
         if (n >= a)
           return u;
@@ -1627,59 +1627,59 @@
     }
     return r.index - e.index;
   }
-  function Ma(r, e, t) {
-    e.length ? e = z$4(e, function(i) {
-      return v$2(i) ? function(o) {
-        return Ne$2(o, i.length === 1 ? i[0] : i);
-      } : i;
+  function $a(r, e, t) {
+    e.length ? e = z$4(e, function(o) {
+      return v$2(o) ? function(i) {
+        return Ne$2(i, o.length === 1 ? o[0] : o);
+      } : o;
     }) : e = [ue$1];
     var n = -1;
     e = z$4(e, J$2(Y$3));
-    var s = va(r, function(i, o, a) {
+    var s = va(r, function(o, i, a) {
       var u = z$4(e, function(c) {
-        return c(i);
+        return c(o);
       });
-      return { criteria: u, index: ++n, value: i };
+      return { criteria: u, index: ++n, value: o };
     });
-    return Sa(s, function(i, o) {
-      return Oa(i, o, t);
+    return Sa(s, function(o, i) {
+      return Oa(o, i, t);
     });
   }
   function Ou(r, e, t, n) {
-    return r == null ? [] : (v$2(e) || (e = e == null ? [] : [e]), t = t, v$2(t) || (t = t == null ? [] : [t]), Ma(r, e, t));
+    return r == null ? [] : (v$2(e) || (e = e == null ? [] : [e]), t = t, v$2(t) || (t = t == null ? [] : [t]), $a(r, e, t));
   }
-  var $a = Ht$1("length"), Zt$1 = "\\ud800-\\udfff", _a = "\\u0300-\\u036f", Ca = "\\ufe20-\\ufe2f", Ia = "\\u20d0-\\u20ff", Da = _a + Ca + Ia, Ea = "\\ufe0e\\ufe0f", Qa = "[" + Zt$1 + "]", Oe$3 = "[" + Da + "]", Me$2 = "\\ud83c[\\udffb-\\udfff]", Na = "(?:" + Oe$3 + "|" + Me$2 + ")", Jt$1 = "[^" + Zt$1 + "]", Xt$1 = "(?:\\ud83c[\\udde6-\\uddff]){2}", Yt$1 = "[\\ud800-\\udbff][\\udc00-\\udfff]", ja = "\\u200d", er$1 = Na + "?", tr$1 = "[" + Ea + "]?", qa = "(?:" + ja + "(?:" + [Jt$1, Xt$1, Yt$1].join("|") + ")" + tr$1 + er$1 + ")*", Ka = tr$1 + er$1 + qa, Pa = "(?:" + [Jt$1 + Oe$3 + "?", Oe$3, Xt$1, Yt$1, Qa].join("|") + ")", mt = RegExp(Me$2 + "(?=" + Me$2 + ")|" + Pa + Ka, "g");
+  var Ma = Ht$1("length"), Zt$1 = "\\ud800-\\udfff", _a = "\\u0300-\\u036f", Ca = "\\ufe20-\\ufe2f", Da = "\\u20d0-\\u20ff", Ia = _a + Ca + Da, Ea = "\\ufe0e\\ufe0f", Qa = "[" + Zt$1 + "]", Oe$3 = "[" + Ia + "]", $e$2 = "\\ud83c[\\udffb-\\udfff]", Na = "(?:" + Oe$3 + "|" + $e$2 + ")", Jt$1 = "[^" + Zt$1 + "]", Xt$1 = "(?:\\ud83c[\\udde6-\\uddff]){2}", Yt$1 = "[\\ud800-\\udbff][\\udc00-\\udfff]", ja = "\\u200d", er$1 = Na + "?", tr$1 = "[" + Ea + "]?", qa = "(?:" + ja + "(?:" + [Jt$1, Xt$1, Yt$1].join("|") + ")" + tr$1 + er$1 + ")*", Ka = tr$1 + er$1 + qa, Pa = "(?:" + [Jt$1 + Oe$3 + "?", Oe$3, Xt$1, Yt$1, Qa].join("|") + ")", mt = RegExp($e$2 + "(?=" + $e$2 + ")|" + Pa + Ka, "g");
   function Ra(r) {
     for (var e = mt.lastIndex = 0; mt.test(r); )
       ++e;
     return e;
   }
   function Fa(r) {
-    return Us$1(r) ? Ra(r) : $a(r);
+    return Us$1(r) ? Ra(r) : Ma(r);
   }
-  var ka = "[object Map]", Ga = "[object Set]";
+  var Ga = "[object Map]", ka = "[object Set]";
   function La(r) {
     if (r == null)
       return 0;
-    if (G$1(r))
+    if (k$1(r))
       return Aa(r) ? Fa(r) : r.length;
     var e = A$1(r);
-    return e == ka || e == Ga ? r.size : Nt$1(r).length;
+    return e == Ga || e == ka ? r.size : Nt$1(r).length;
   }
-  function qe$3(r) {
-    const e = $e$2(r);
+  function qe$2(r) {
+    const e = Me$2(r);
     return za(e);
   }
-  function $e$2(r) {
+  function Me$2(r) {
     if (typeof r != "object" || r === null)
       return String(r);
     if (Array.isArray(r))
-      return "[" + r.map($e$2).join(",") + "]";
+      return "[" + r.map(Me$2).join(",") + "]";
     const e = Object.keys(r).sort();
     let t = "{";
     for (let n = 0; n < e.length; n++) {
       const s = e[n];
-      t += s + ":" + $e$2(r[s]), n < e.length - 1 && (t += ",");
+      t += s + ":" + Me$2(r[s]), n < e.length - 1 && (t += ",");
     }
     return t += "}", t;
   }
@@ -1708,7 +1708,7 @@
         return performance.getEntriesByType(r);
     }
   };
-  class Mu {
+  class $u {
     data;
     enabled = false;
     constructor() {
@@ -1736,9 +1736,9 @@
       const t = this.getKey(e.name, e.context), n = this.data.get(this.getKey(e.start, e.context)), s = this.data.get(this.getKey(e.end, e.context));
       if (!n || !s)
         return;
-      const i = s.value - n.value, o = Math.round(i * 100) / 100, a = this.data.get(t);
+      const o = s.value - n.value, i = Math.round(o * 100) / 100, a = this.data.get(t);
       if (a && e.sum) {
-        const c = a.value + o, f = {
+        const c = a.value + i, f = {
           ...a,
           value: c
         };
@@ -1747,7 +1747,7 @@
       const u = {
         name: e.name,
         type: "measure",
-        value: o,
+        value: i,
         createdAt: Date.now()
       };
       return e.detail && (u.detail = e.detail), this.data.set(t, u), u;
@@ -1781,7 +1781,7 @@
     getKey(e, t) {
       if (!t)
         return e;
-      const n = qe$3(t);
+      const n = qe$2(t);
       return e + "_" + n;
     }
   }
@@ -1865,10 +1865,10 @@
         if (t.has(s))
           return true;
         t.add(s);
-        const i = this.edges.get(s);
-        if (i) {
-          for (let o of i)
-            if (n(o))
+        const o = this.edges.get(s);
+        if (o) {
+          for (let i of o)
+            if (n(i))
               return true;
         }
         return t.delete(s), e.add(s), false;
@@ -1884,36 +1884,36 @@
      * @returns {hasCycle: boolean, path?: string[]} - hasCycle is true if a cycle exists, path contains the cycle nodes
      */
     validateNoCycles() {
-      const e = /* @__PURE__ */ new Set(), t = /* @__PURE__ */ new Set(), n = [], s = (i) => {
-        if (e.has(i))
+      const e = /* @__PURE__ */ new Set(), t = /* @__PURE__ */ new Set(), n = [], s = (o) => {
+        if (e.has(o))
           return null;
-        if (t.has(i)) {
-          const a = n.indexOf(i);
-          return n.slice(a).concat([i]);
-        }
-        t.add(i), n.push(i);
-        const o = this.edges.get(i);
-        if (o)
-          for (let a of o) {
+        if (t.has(o)) {
+          const a = n.indexOf(o);
+          return n.slice(a).concat([o]);
+        }
+        t.add(o), n.push(o);
+        const i = this.edges.get(o);
+        if (i)
+          for (let a of i) {
             const u = s(a);
             if (u)
               return u;
           }
-        return n.pop(), t.delete(i), e.add(i), null;
+        return n.pop(), t.delete(o), e.add(o), null;
       };
-      for (let i of this.nodes) {
-        const o = s(i);
-        if (o)
-          return { hasCycle: true, path: o };
+      for (let o of this.nodes) {
+        const i = s(o);
+        if (i)
+          return { hasCycle: true, path: i };
       }
       return { hasCycle: false };
     }
     order(e) {
-      const t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), s = [], i = e?.allowCycles ?? false, o = (a) => {
+      const t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), s = [], o = e?.allowCycles ?? false, i = (a) => {
         if (t.has(a))
           return;
         if (n.has(a)) {
-          if (i)
+          if (o)
             return;
           throw new Error("Graph has a cycle.");
         }
@@ -1921,11 +1921,11 @@
         const u = this.edges.get(a);
         if (u)
           for (let c of u)
-            o(c);
+            i(c);
         n.delete(a), t.add(a), s.push(a);
       };
       for (let a of this.nodes)
-        t.has(a) || o(a);
+        t.has(a) || i(a);
       return s;
     }
     clear() {
@@ -1993,30 +1993,30 @@
      */
     plan(e) {
       const t = /* @__PURE__ */ new Map();
-      for (const o of this.nodes) t.set(o, 0);
-      for (const o of this.edges.values())
-        for (const a of o) t.set(a, (t.get(a) || 0) + 1);
+      for (const i of this.nodes) t.set(i, 0);
+      for (const i of this.edges.values())
+        for (const a of i) t.set(a, (t.get(a) || 0) + 1);
       const n = [];
-      let s = Array.from(this.nodes).filter((o) => (t.get(o) || 0) === 0);
-      const i = /* @__PURE__ */ new Set();
+      let s = Array.from(this.nodes).filter((i) => (t.get(i) || 0) === 0);
+      const o = /* @__PURE__ */ new Set();
       for (; s.length > 0; ) {
-        const o = s.slice();
-        n.push(o), s = [];
-        for (const a of o) {
-          if (i.has(a)) continue;
-          i.add(a);
+        const i = s.slice();
+        n.push(i), s = [];
+        for (const a of i) {
+          if (o.has(a)) continue;
+          o.add(a);
           const u = this.edges.get(a);
           if (u)
             for (const c of u)
               t.set(c, (t.get(c) || 0) - 1), (t.get(c) || 0) === 0 && s.push(c);
         }
       }
-      if (i.size !== this.nodes.size)
+      if (o.size !== this.nodes.size)
         throw new Error("Graph has a cycle.");
       if (e?.filterKinds && e.filterKinds.length > 0) {
-        const o = new Set(e.filterKinds);
+        const i = new Set(e.filterKinds);
         return {
-          batches: n.map((a) => a.filter((u) => o.has(this.nodeKinds.get(u))))
+          batches: n.map((a) => a.filter((u) => i.has(this.nodeKinds.get(u))))
         };
       }
       return { batches: n };
@@ -2029,7 +2029,7 @@
      *  - 'both': union of upstream and downstream
      */
     getImpactedNodes(e, t = "downstream", n) {
-      const s = new Set(e), i = (c) => !n || n.length === 0 || n.includes(this.nodeKinds.get(c) ?? void 0), o = () => {
+      const s = new Set(e), o = (c) => !n || n.length === 0 || n.includes(this.nodeKinds.get(c) ?? void 0), i = () => {
         const c = /* @__PURE__ */ new Set(), f = Array.from(s);
         for (; f.length; ) {
           const l = f.shift();
@@ -2048,7 +2048,7 @@
         return c;
       };
       let u;
-      return t === "both" ? u = /* @__PURE__ */ new Set([...o(), ...a()]) : t === "upstream" ? u = a() : u = o(), Array.from(u).filter(i);
+      return t === "both" ? u = /* @__PURE__ */ new Set([...i(), ...a()]) : t === "upstream" ? u = a() : u = i(), Array.from(u).filter(o);
     }
     toJSON() {
       const e = Array.from(this.nodes).map((n) => ({
@@ -2067,15 +2067,15 @@
       return t;
     }
     diff(e) {
-      const t = new Set(this.getNodes()), n = new Set(e.getNodes()), s = Array.from(n).filter((l) => !t.has(l)), i = Array.from(t).filter((l) => !n.has(l)), o = new Set(this.getAllEdges().map((l) => l.join("→"))), a = new Set(e.getAllEdges().map((l) => l.join("→"))), u = Array.from(a).filter((l) => !o.has(l)).map((l) => l.split("→")), c = Array.from(o).filter((l) => !a.has(l)).map((l) => l.split("→")), f = [];
+      const t = new Set(this.getNodes()), n = new Set(e.getNodes()), s = Array.from(n).filter((l) => !t.has(l)), o = Array.from(t).filter((l) => !n.has(l)), i = new Set(this.getAllEdges().map((l) => l.join("→"))), a = new Set(e.getAllEdges().map((l) => l.join("→"))), u = Array.from(a).filter((l) => !i.has(l)).map((l) => l.split("→")), c = Array.from(i).filter((l) => !a.has(l)).map((l) => l.split("→")), f = [];
       for (const l of /* @__PURE__ */ new Set([...t, ...n])) {
         const d = this.nodeKinds.get(l), h = e.nodeKinds.get(l);
         d !== h && f.push({ name: l, from: d, to: h });
       }
-      return { addedNodes: s, removedNodes: i, addedEdges: u, removedEdges: c, kindChanges: f };
+      return { addedNodes: s, removedNodes: o, addedEdges: u, removedEdges: c, kindChanges: f };
     }
   };
-  class $u {
+  class Mu {
     graph;
     nodeIndex;
     constructor() {
@@ -2121,10 +2121,10 @@
      * @returns Array of all impacted attribute nodes (including the changed ones)
      */
     getImpactedAttributes(e) {
-      const t = e.map((o) => this.getNodeId(o.modelKey, o.attributeKey)), n = this.graph.getImpactedNodes(t, "downstream").map((o) => this.nodeIndex.get(o)).filter((o) => o !== void 0), s = [...e, ...n], i = /* @__PURE__ */ new Set();
-      return s.filter((o) => {
-        const a = this.getNodeId(o.modelKey, o.attributeKey);
-        return i.has(a) ? false : (i.add(a), true);
+      const t = e.map((i) => this.getNodeId(i.modelKey, i.attributeKey)), n = this.graph.getImpactedNodes(t, "downstream").map((i) => this.nodeIndex.get(i)).filter((i) => i !== void 0), s = [...e, ...n], o = /* @__PURE__ */ new Set();
+      return s.filter((i) => {
+        const a = this.getNodeId(i.modelKey, i.attributeKey);
+        return o.has(a) ? false : (o.add(a), true);
       });
     }
     /**
@@ -2135,12 +2135,12 @@
      * @returns Map<modelKey, Map<processingStep, Set<attributeKeys>>>
      */
     getProcessingOrder(e) {
-      const t = /* @__PURE__ */ new Map(), n = [...e].sort((s, i) => s.processingStep - i.processingStep);
+      const t = /* @__PURE__ */ new Map(), n = [...e].sort((s, o) => s.processingStep - o.processingStep);
       for (const s of n) {
-        const { modelKey: i, attributeKey: o, processingStep: a } = s;
-        t.has(i) || t.set(i, /* @__PURE__ */ new Map());
-        const u = t.get(i);
-        u.has(a) || u.set(a, /* @__PURE__ */ new Set()), u.get(a).add(o);
+        const { modelKey: o, attributeKey: i, processingStep: a } = s;
+        t.has(o) || t.set(o, /* @__PURE__ */ new Map());
+        const u = t.get(o);
+        u.has(a) || u.set(a, /* @__PURE__ */ new Set()), u.get(a).add(i);
       }
       return t;
     }
@@ -2195,14 +2195,14 @@
       const t = (n, s = /* @__PURE__ */ new Set()) => {
         if (s.has(n)) return 0;
         s.add(n);
-        const i = this.graph.getDependencies(n);
-        if (i.length === 0) return 1;
-        let o = 0;
-        for (const a of i) {
+        const o = this.graph.getDependencies(n);
+        if (o.length === 0) return 1;
+        let i = 0;
+        for (const a of o) {
           const u = t(a, new Set(s));
-          o = Math.max(o, u);
+          i = Math.max(i, u);
         }
-        return o + 1;
+        return i + 1;
       };
       for (const n of this.graph.getNodes()) {
         const s = t(n);
@@ -2221,9 +2221,9 @@
     validateCompleteness(e) {
       const t = [];
       for (const [n, s] of e)
-        for (const i of s) {
-          const o = this.getNodeId(n, i);
-          this.hasNode(o) || t.push({ modelKey: n, attributeKey: i });
+        for (const o of s) {
+          const i = this.getNodeId(n, o);
+          this.hasNode(i) || t.push({ modelKey: n, attributeKey: o });
         }
       return {
         isComplete: t.length === 0,
@@ -2334,19 +2334,19 @@
     }
     formatMessage(e) {
       if (this.config.format === "json") {
-        const o = {
+        const i = {
           timestamp: new Date(e.timestamp).toISOString(),
           level: e.level,
           message: e.message
         };
-        return e.prefix && (o.module = e.prefix), e.context && (o.context = e.context), e.error && (o.error = {
+        return e.prefix && (i.module = e.prefix), e.context && (i.context = e.context), e.error && (i.error = {
           name: e.error.name,
           message: e.error.message,
           stack: e.error.stack
-        }), JSON.stringify(o);
+        }), JSON.stringify(i);
       }
-      const t = new Date(e.timestamp).toISOString().substring(11, 23), n = e.prefix ? `[${e.prefix}]` : "", s = this.getLevelIcon(e.level), i = e.context ? ` ${JSON.stringify(e.context)}` : "";
-      return `${t} ${s} ${n} ${e.message}${i}`.trim();
+      const t = new Date(e.timestamp).toISOString().substring(11, 23), n = e.prefix ? `[${e.prefix}]` : "", s = this.getLevelIcon(e.level), o = e.context ? ` ${JSON.stringify(e.context)}` : "";
+      return `${t} ${s} ${n} ${e.message}${o}`.trim();
     }
     getLevelIcon(e) {
       switch (e) {
@@ -2365,7 +2365,7 @@
     log(e, t, n, s) {
       if (!this.shouldLog(e))
         return;
-      const i = {
+      const o = {
         level: e,
         message: t,
         timestamp: Date.now(),
@@ -2374,31 +2374,31 @@
         error: s
       };
       if (this.config.onLog) {
-        this.config.onLog(i);
+        this.config.onLog(o);
         return;
       }
-      const o = this.formatMessage(i);
+      const i = this.formatMessage(o);
       if (typeof console < "u")
         switch (e) {
           case "error":
-            s ? console.error(o, s) : console.error(o);
+            s ? console.error(i, s) : console.error(i);
             break;
           case "warn":
-            console.warn(o);
+            console.warn(i);
             break;
           case "debug":
-            console.debug ? console.debug(o) : console.log(o);
+            console.debug ? console.debug(i) : console.log(i);
             break;
           default:
-            console.log(o);
+            console.log(i);
         }
     }
     /**
      * Log an error message
      */
     error(e, t, n) {
-      const s = t instanceof Error ? t : void 0, i = t instanceof Error ? n : t;
-      this.log("error", e, i, s);
+      const s = t instanceof Error ? t : void 0, o = t instanceof Error ? n : t;
+      this.log("error", e, o, s);
     }
     /**
      * Log and track an error (integrates with QualityController)
@@ -2486,8 +2486,8 @@
     }
     set(e, t, n, s) {
       if (!this.enabled) return;
-      const i = this.getCacheName(e, t);
-      this.cache.set(i, n), s ? this.cacheDependencies.set(i, s) : this.log.debug(
+      const o = this.getCacheName(e, t);
+      this.cache.set(o, n), s ? this.cacheDependencies.set(o, s) : this.log.debug(
         `Cache entry '${e}' stored without dependencies. This prevents granular invalidation and may cause stale data.`
       );
     }
@@ -2505,21 +2505,21 @@
       if (!this.enabled) return;
       const t = [];
       for (const [n, s] of this.cacheDependencies) {
-        let i = false;
-        for (const [o, a] of e) {
-          if (s.models.has(o))
-            if (s.modelAttributes.has(o)) {
-              const u = s.modelAttributes.get(o);
+        let o = false;
+        for (const [i, a] of e) {
+          if (s.models.has(i))
+            if (s.modelAttributes.has(i)) {
+              const u = s.modelAttributes.get(i);
               for (const c of a)
                 if (u.has(c)) {
-                  i = true;
+                  o = true;
                   break;
                 }
             } else
-              i = true;
-          if (i) break;
+              o = true;
+          if (o) break;
         }
-        i && t.push(n);
+        o && t.push(n);
       }
       for (const n of t)
         this.cache.delete(n), this.cacheDependencies.delete(n);
@@ -2531,9 +2531,9 @@
     invalidateByModels(e) {
       if (!this.enabled) return;
       const t = new Set(e), n = [];
-      for (const [s, i] of this.cacheDependencies)
-        for (const o of t)
-          if (i.models.has(o)) {
+      for (const [s, o] of this.cacheDependencies)
+        for (const i of t)
+          if (o.models.has(i)) {
             n.push(s);
             break;
           }
@@ -2589,7 +2589,7 @@
       }
     }
     getCacheName(e, t) {
-      const n = qe$3(t);
+      const n = qe$2(t);
       return e + "_" + n;
     }
     /**
@@ -2653,9 +2653,9 @@
       };
     }
   }
-  const sr$1 = (r, e) => e ? typeof structuredClone < "u" ? structuredClone(r) : C$2(r) : r, vt = (r, e, t, n, s, i) => {
+  const sr$1 = (r, e) => e ? typeof structuredClone < "u" ? structuredClone(r) : C$2(r) : r, vt = (r, e, t, n, s, o) => {
     try {
-      const o = !!e.dcuplInitOptions.performance?.clone?.enabled && !!t.cloneResult, a = sr$1(i, o);
+      const i = !!e.dcuplInitOptions.performance?.clone?.enabled && !!t.cloneResult, a = sr$1(o, i);
       if (t.scope === "list" && (t.listKey = r.cdRef?.key || r.key, t.modelKey = r.model?.key || r.modelKey), t.type === "list_created" && t.args[0].listKey.startsWith("__global_list__") || t.listKey?.startsWith("__global_list__"))
         return a;
       const u = Z$3.now(), c = u - n, f = Math.round(c * 1e3) / 1e3;
@@ -2674,12 +2674,12 @@
         detail: l
       }), a;
     } catch {
-      return i;
+      return o;
     }
-  }, Iu = (r) => (e, t, n) => {
+  }, Du = (r) => (e, t, n) => {
     const s = n.value;
-    return n.value = function(...i) {
-      const o = Z$3.now(), a = this.cdRef, u = sr$1(r, true);
+    return n.value = function(...o) {
+      const i = Z$3.now(), a = this.cdRef, u = sr$1(r, true);
       u.key || (a.increaseCounter(), u.key = a.getCounter());
       const c = Ha();
       a.analyticsController.mark({
@@ -2688,42 +2688,42 @@
       });
       const f = this.model?.key;
       !u.originCdRefKey && a.key && (u.originCdRefKey = a.key), f && (u.modelKey = f);
-      const l = s.apply(this, i);
-      return u.method = t, u.args = i, l && typeof l == "object" && "then" in l ? l.then((d) => vt(this, a, u, o, c, d)) : vt(this, a, u, o, c, l);
+      const l = s.apply(this, o);
+      return u.method = t, u.args = o, l && typeof l == "object" && "then" in l ? l.then((d) => vt(this, a, u, i, c, d)) : vt(this, a, u, i, c, l);
     }, n;
   };
-  function Du(r, e, t, n) {
+  function Iu(r, e, t, n) {
     t.max || (t.max = 20);
-    const s = [], i = t.transform ? n.transformValue(t.value, t.transform) : t.value;
-    for (const [o, a] of e.entries()) {
-      const u = Array.from(a).some((f) => r.has(f)), c = t.transform ? n.transformValue(o, t.transform) : o;
-      if (!(t.excludeUndefineds && typeof o > "u") && !(t.excludeNulls && o === null)) {
-        if (u && (i === "" || i === "//")) {
+    const s = [], o = t.transform ? n.transformValue(t.value, t.transform) : t.value;
+    for (const [i, a] of e.entries()) {
+      const u = Array.from(a).some((f) => r.has(f)), c = t.transform ? n.transformValue(i, t.transform) : i;
+      if (!(t.excludeUndefineds && typeof i > "u") && !(t.excludeNulls && i === null)) {
+        if (u && (o === "" || o === "//")) {
           const f = {
-            value: o,
+            value: i,
             keys: t.calculateResultKeys ? Array.from(a) : []
           };
           s.push(f);
-        } else if (u && nr$1(i)) {
-          if (n.queryFind(c, i, "some", t.regexFlags)) {
+        } else if (u && nr$1(o)) {
+          if (n.queryFind(c, o, "some", t.regexFlags)) {
             const f = {
-              value: o,
+              value: i,
               keys: t.calculateResultKeys ? Array.from(a) : []
             };
             s.push(f);
           }
-        } else if (u && typeof i == "string") {
-          const f = String(c ?? ""), l = i;
+        } else if (u && typeof o == "string") {
+          const f = String(c ?? ""), l = o;
           if (f.toLowerCase().startsWith(l.toLowerCase())) {
             const d = {
-              value: o,
+              value: i,
               keys: t.calculateResultKeys ? Array.from(a) : []
             };
             s.push(d);
           }
-        } else if (u && n.queryFind(c, i, "some")) {
+        } else if (u && n.queryFind(c, o, "some")) {
           const f = {
-            value: o,
+            value: i,
             keys: t.calculateResultKeys ? Array.from(a) : []
           };
           s.push(f);
@@ -2759,19 +2759,19 @@
     let e = "^";
     const t = [];
     let n = r;
-    const s = Object.entries(Za).sort((i, o) => o[0].length - i[0].length);
+    const s = Object.entries(Za).sort((o, i) => i[0].length - o[0].length);
     for (; n.length > 0; ) {
-      let i = false;
-      for (const [o, a] of s)
-        if (n.startsWith(o)) {
-          e += a.regex, t.push({ type: a.type, pattern: o }), n = n.slice(o.length), i = true;
+      let o = false;
+      for (const [i, a] of s)
+        if (n.startsWith(i)) {
+          e += a.regex, t.push({ type: a.type, pattern: i }), n = n.slice(i.length), o = true;
           break;
         }
-      if (!i) {
-        const o = n[0];
-        if (!o)
+      if (!o) {
+        const i = n[0];
+        if (!i)
           break;
-        e += o.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"), n = n.slice(1);
+        e += i.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"), n = n.slice(1);
       }
     }
     return e += "$", { regex: new RegExp(e), tokenOrder: t };
@@ -2790,8 +2790,8 @@
       const s = r[n + 1];
       if (!s)
         continue;
-      const i = parseInt(s, 10), o = e[n];
-      o && (o.type === "year" && o.pattern === "yy" ? t.year = 2e3 + i : t[o.type] = i);
+      const o = parseInt(s, 10), i = e[n];
+      i && (i.type === "year" && i.pattern === "yy" ? t.year = 2e3 + o : t[i.type] = o);
     }
     return t;
   }
@@ -2828,11 +2828,11 @@
       const a = Number(r);
       return isNaN(a) ? /* @__PURE__ */ new Date(NaN) : new Date(a);
     }
-    const { regex: n, tokenOrder: s } = Ja(e), i = r.match(n);
-    if (!i)
+    const { regex: n, tokenOrder: s } = Ja(e), o = r.match(n);
+    if (!o)
       return /* @__PURE__ */ new Date(NaN);
-    const o = Xa(i, s);
-    return Ya(o);
+    const i = Xa(o, s);
+    return Ya(i);
   }
   class eu {
     cache;
@@ -2887,25 +2887,25 @@
     }
     hasCycle(e) {
       if (e.length === 0) return false;
-      const t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), s = (i) => {
-        t.add(i), n.add(i);
-        const o = this.graph.get(i);
-        if (o) {
-          for (const a of o)
+      const t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), s = (o) => {
+        t.add(o), n.add(o);
+        const i = this.graph.get(o);
+        if (i) {
+          for (const a of i)
             if (t.has(a)) {
               if (n.has(a))
                 return true;
             } else if (s(a))
               return true;
         }
-        return n.delete(i), false;
+        return n.delete(o), false;
       };
-      for (let i = 0; i < e.length - 1; i++) {
-        const o = e[i], a = e[i + 1];
-        o && a && this.addDependency(o, a);
+      for (let o = 0; o < e.length - 1; o++) {
+        const i = e[o], a = e[o + 1];
+        i && a && this.addDependency(i, a);
       }
-      for (const i of e)
-        if (!t.has(i) && s(i))
+      for (const o of e)
+        if (!t.has(o) && s(o))
           return true;
       return false;
     }
@@ -2944,11 +2944,11 @@
         return this.cacheHits++, this.parseCache.get(e);
       this.cacheMisses++;
       let t, n;
-      const s = e.includes("."), i = e.includes("["), o = s || i;
-      if (o) {
+      const s = e.includes("."), o = e.includes("["), i = s || o;
+      if (i) {
         n = e.split(/[.[]/)[0];
         const u = e.indexOf("."), c = e.indexOf("[");
-        if (i && (u === -1 || c < u)) {
+        if (o && (u === -1 || c < u)) {
           const f = e.indexOf("]");
           if (f > -1) {
             const l = e.indexOf(".", f + 1);
@@ -2958,7 +2958,7 @@
       }
       const a = {
         attribute: e,
-        isDeepQuery: o
+        isDeepQuery: i
       };
       return n && (a.reference = n), typeof t < "u" && t !== "" && (a.referenceAttribute = t), this.parseCache.set(e, a), a;
     }
@@ -3011,11 +3011,11 @@
       if (!e || e.trim().length === 0)
         return n.push("Attribute path cannot be empty"), { valid: false, errors: n };
       (e.startsWith(".") || e.endsWith(".")) && n.push(`Invalid path: Leading or trailing dots are not allowed: ${e}`), e.includes("..") && n.push(`Invalid path: Consecutive dots are not allowed: ${e}`);
-      const s = (e.match(/\[/g) || []).length, i = (e.match(/]/g) || []).length;
-      s !== i && n.push(`Invalid bracket notation: Mismatched brackets in ${e}`), e.includes("[]") && n.push(`Invalid bracket notation: Empty brackets not allowed: ${e}`);
-      const o = /\[([^\]]+)\]/g;
+      const s = (e.match(/\[/g) || []).length, o = (e.match(/]/g) || []).length;
+      s !== o && n.push(`Invalid bracket notation: Mismatched brackets in ${e}`), e.includes("[]") && n.push(`Invalid bracket notation: Empty brackets not allowed: ${e}`);
+      const i = /\[([^\]]+)\]/g;
       let a;
-      for (; (a = o.exec(e)) !== null; ) {
+      for (; (a = i.exec(e)) !== null; ) {
         const f = a[1];
         f && f !== "*" && !/^\d+$/.test(f) && n.push(`Invalid bracket content: Must be a number or '*', got '${f}' in ${e}`);
       }
@@ -3084,7 +3084,7 @@
   const S$2 = new ru();
   function K$2(r, e) {
     if (e.includes("[*]")) {
-      const i = e.indexOf("[*]"), o = e.substring(0, i), a = e.substring(i + 3), u = o ? W$2(r, o) : r;
+      const o = e.indexOf("[*]"), i = e.substring(0, o), a = e.substring(o + 3), u = i ? W$2(r, i) : r;
       if (!Array.isArray(u)) return [];
       const c = [];
       for (const f of u)
@@ -3093,27 +3093,27 @@
     }
     const t = e.split(".");
     let n = [r];
-    for (const i of t) {
-      const o = [];
+    for (const o of t) {
+      const i = [];
       for (const a of n)
         if (a != null)
           if (Array.isArray(a))
             for (const u of a) {
               if (u == null) continue;
-              const c = u[i];
-              c !== void 0 && o.push(c);
+              const c = u[o];
+              c !== void 0 && i.push(c);
             }
           else {
-            const u = a[i];
-            u !== void 0 && o.push(u);
+            const u = a[o];
+            u !== void 0 && i.push(u);
           }
-      if (n = o, n.length === 0) return [];
+      if (n = i, n.length === 0) return [];
     }
     const s = [];
-    for (const i of n)
-      if (Array.isArray(i))
-        for (const o of i) o !== void 0 && s.push(o);
-      else i !== void 0 && s.push(i);
+    for (const o of n)
+      if (Array.isArray(o))
+        for (const i of o) i !== void 0 && s.push(i);
+      else o !== void 0 && s.push(o);
     return s;
   }
   function be$1(r) {
@@ -3137,11 +3137,11 @@
       attribute: n,
       types: r.types
     };
-    let i;
-    (s.types.includes("sum") || s.types.includes("avg")) && (i = au(n, e));
     let o;
-    return (s.types.includes("min") || s.types.includes("max")) && (o = iu(n, e)), r.types.forEach((a) => {
-      a === "sum" ? s.sum = i?.sum : a === "avg" ? s.avg = i?.average : a === "count" ? s.count = su(n, e) : a === "min" ? s.min = o && o[0] : a === "max" ? s.max = o && o[1] : a === "distinct" ? s.distinct = uu(r, e, t) : a === "group" && (s.group = ou(r, e));
+    (s.types.includes("sum") || s.types.includes("avg")) && (o = au(n, e));
+    let i;
+    return (s.types.includes("min") || s.types.includes("max")) && (i = ou(n, e)), r.types.forEach((a) => {
+      a === "sum" ? s.sum = o?.sum : a === "avg" ? s.avg = o?.average : a === "count" ? s.count = su(n, e) : a === "min" ? s.min = i && i[0] : a === "max" ? s.max = i && i[1] : a === "distinct" ? s.distinct = uu(r, e, t) : a === "group" && (s.group = iu(r, e));
     }), s;
   }, su = (r, e) => {
     const t = S$2.parse(r).isDeepQuery;
@@ -3149,35 +3149,35 @@
     for (const s of e.values())
       if (s)
         if (t)
-          n += K$2(s, r).filter((i) => i != null).length;
+          n += K$2(s, r).filter((o) => o != null).length;
         else {
-          const i = s[r];
-          if (i == null) continue;
-          Array.isArray(i) ? n += i.filter((o) => o != null).length : n++;
+          const o = s[r];
+          if (o == null) continue;
+          Array.isArray(o) ? n += o.filter((i) => i != null).length : n++;
         }
     return n;
-  }, iu = (r, e) => {
+  }, ou = (r, e) => {
     let t, n;
     const s = S$2.parse(r).isDeepQuery;
-    for (const i of e.values()) {
-      if (!i) continue;
-      let o;
+    for (const o of e.values()) {
+      if (!o) continue;
+      let i;
       if (s)
-        o = K$2(i, r);
+        i = K$2(o, r);
       else {
-        const a = i[r];
-        a === void 0 ? o = [] : Array.isArray(a) ? o = a.filter((u) => u !== void 0) : o = [a];
+        const a = o[r];
+        a === void 0 ? i = [] : Array.isArray(a) ? i = a.filter((u) => u !== void 0) : i = [a];
       }
-      for (const a of o)
+      for (const a of i)
         a == null || typeof a == "object" || ((t === void 0 || a < t) && (t = a), (n === void 0 || a > n) && (n = a));
     }
     if (!(t === void 0 || n === void 0))
       return [t, n];
-  }, ou = (r, e) => {
+  }, iu = (r, e) => {
     const t = [];
-    r.groupOptions?.groups?.forEach((i) => {
+    r.groupOptions?.groups?.forEach((o) => {
       t.push({
-        option: i,
+        option: o,
         count: 0,
         keys: []
       });
@@ -3187,29 +3187,29 @@
       count: 0,
       keys: []
     }, s = S$2.parse(r.attribute).isDeepQuery;
-    for (const i of e.values()) {
-      let o;
-      s ? o = K$2(i, r.attribute) : o = [i[r.attribute]];
+    for (const o of e.values()) {
+      let i;
+      s ? i = K$2(o, r.attribute) : i = [o[r.attribute]];
       let a = false;
-      for (const u of o)
+      for (const u of i)
         for (const c of t)
-          (typeof c.option.value < "u" && c.option.value.includes(u) || typeof c.option.from < "u" && c.option.from < u && typeof c.option.to < "u" && c.option.to > u) && (c.keys.includes(i.key) || (c.count++, c.keys.push(i.key)), a = true);
-      !a && r?.groupOptions?.calculateNotFound && (n.count++, n.keys.push(i.key));
+          (typeof c.option.value < "u" && c.option.value.includes(u) || typeof c.option.from < "u" && c.option.from < u && typeof c.option.to < "u" && c.option.to > u) && (c.keys.includes(o.key) || (c.count++, c.keys.push(o.key)), a = true);
+      !a && r?.groupOptions?.calculateNotFound && (n.count++, n.keys.push(o.key));
     }
     return r?.groupOptions?.calculateNotFound && t.push(n), t;
   }, au = (r, e) => {
     let t = 0, n = 0;
     const s = S$2.parse(r).isDeepQuery;
-    for (const i of e.values()) {
-      if (!i) continue;
-      let o;
+    for (const o of e.values()) {
+      if (!o) continue;
+      let i;
       if (s)
-        o = K$2(i, r);
+        i = K$2(o, r);
       else {
-        const a = i[r];
-        a === void 0 ? o = [] : Array.isArray(a) ? o = a : o = [a];
+        const a = o[r];
+        a === void 0 ? i = [] : Array.isArray(a) ? i = a : i = [a];
       }
-      for (const a of o)
+      for (const a of i)
         if (Array.isArray(a))
           for (const u of a)
             typeof u == "number" && (t = wt(t, u, be$1([t, u])), n++);
@@ -3222,25 +3222,25 @@
     };
   }, uu = (r, e, t) => {
     const n = [];
-    for (const [s, i] of t)
-      if (!(r.excludeUndefineds && typeof s > "u") && Array.from(i).find((o) => e.has(o))) {
-        const o = {
+    for (const [s, o] of t)
+      if (!(r.excludeUndefineds && typeof s > "u") && Array.from(o).find((i) => e.has(i))) {
+        const i = {
           value: s,
-          count: i.size
+          count: o.size
         };
-        if (r.distinctOptions?.skipKeys || (o.keys = Array.from(i)), n.push(o), r.distinctOptions?.limit && n.length >= r.distinctOptions.limit)
+        if (r.distinctOptions?.skipKeys || (i.keys = Array.from(o)), n.push(i), r.distinctOptions?.limit && n.length >= r.distinctOptions.limit)
           break;
       }
     return n;
   };
-  let P$1 = class P extends Error {
+  class P extends Error {
     query;
     constructor(e, t) {
       const n = `Query Error: ${e} in ${JSON.stringify(t, null, 2)}`;
       super(n), this.query = t, this.name = "DcuplQueryError";
     }
-  };
-  let ir$1 = class ir {
+  }
+  let or$1 = class or {
     _defaultQueryOptions = {
       modelKey: "",
       groupKey: "root",
@@ -3294,6 +3294,57 @@
     getQueryGroup(e) {
       return this.currentQuery.queries.find((t) => this.isQueryGroup(t) && t.groupKey === e);
     }
+    /**
+     * Find the group with the given `groupKey` at any nesting depth (#294).
+     *
+     * Unlike {@link getQueryGroup}, which only looks at the top level, this also finds a
+     * keyed group that sits inside a keyless wrapper group — the shape
+     * `apply({ groupType: 'and', queries: [{ groupKey: 'plan', ... }] }, { mode: 'set' })`
+     * produces. Groups on one level are checked before their children, so a top-level
+     * match wins over a nested one; otherwise the first match in query order wins
+     * (groupKeys are expected to be unique).
+     *
+     * @param groupKey - Key of the group to find
+     * @param relevantQuery - Query to search (defaults to the current query)
+     * @returns The matching group, or undefined
+     */
+    findQueryGroup(e, t) {
+      const n = this.locateQueryGroup(e, (t ?? this.currentQuery).queries);
+      return n ? this.groupAtPath(n) : void 0;
+    }
+    /**
+     * Path from the root `queries` array down to a group: each step names the array that
+     * holds a node and the node's index in it; the last step is the group itself.
+     */
+    locateQueryGroup(e, t) {
+      const n = t.findIndex((s) => this.isQueryGroup(s) && s.groupKey === e);
+      if (n > -1)
+        return [{ queries: t, idx: n }];
+      for (const [s, o] of t.entries())
+        if (this.isQueryGroup(o)) {
+          const i = this.locateQueryGroup(e, o.queries);
+          if (i)
+            return [{ queries: t, idx: s }, ...i];
+        }
+    }
+    groupAtPath(e) {
+      const t = e[e.length - 1];
+      return t.queries[t.idx];
+    }
+    /**
+     * Walk a path upwards from its last group and splice every group that has no
+     * queries left, stopping at the first non-empty one. Mirrors the existing
+     * "remove the group when its queries are empty" behaviour for nested wrappers, so
+     * removing the only group inside a keyless wrapper also removes the wrapper.
+     */
+    pruneEmptyGroups(e) {
+      for (let t = e.length - 1; t >= 0; t--) {
+        const { queries: n, idx: s } = e[t];
+        if (n[s].queries.length > 0)
+          break;
+        n.splice(s, 1);
+      }
+    }
     getQuery() {
       return C$2(this.currentQuery);
     }
@@ -3331,8 +3382,20 @@
      * - {@link replaceQuery} - Replace complete query
      *
      * @param queryToApply - Query, condition, or array to apply
-     * @param options - Mode: 'add' (default) or 'set' (replace). In 'add' mode a group
-     * without `groupKey` is always appended as a new group, never merged into another.
+     * @param options - Mode: 'add' (default) or 'set'. `set` works per group, not per query:
+     * - Root group (`groupKey: 'root'`): replaces the whole query — all groups plus
+     *   `count`/`start`/`sort`/`projection` (the only input that does).
+     * - Keyed group, or an array of groups: each group replaces the group with the same
+     *   `groupKey`; every other group is kept. Same as {@link setGroup}.
+     * - Condition: replaces the conditions of the group keyed by its attribute.
+     *
+     * A group without `groupKey` is not the root, even if it carries a `queries` array:
+     * `apply({ groupType: 'and', queries: [...] }, { mode: 'set' })` stores it as a keyless
+     * wrapper group that replaces the first keyless top-level group, and the keyed groups
+     * inside it stay nested there. {@link removeQuery} and `fn.facets` still find them by
+     * `groupKey` at any depth (#294). To replace the whole query, pass `groupKey: 'root'`
+     * or use {@link replaceQuery}. In 'add' mode a group without `groupKey` is always
+     * appended as a new group, never merged into another.
      * @param relevantQuery - Target query (defaults to current)
      * @returns Updated query
      */
@@ -3344,11 +3407,11 @@
         e.groupType && (n.groupType = e.groupType), t?.mode === "set" ? n.queries = e.queries : n.queries = [...n.queries, ...e.queries], this.applyOptions(e, "set");
       else if (this.isQuery(e)) {
         const s = n.queries.findIndex(
-          (i) => this.isQueryGroup(i) && i.groupKey === e.attribute
+          (o) => this.isQueryGroup(o) && o.groupKey === e.attribute
         );
         if (s > -1) {
-          const i = n.queries[s];
-          t?.mode === "set" ? i.queries = [e] : i.queries.push(e);
+          const o = n.queries[s];
+          t?.mode === "set" ? o.queries = [e] : o.queries.push(e);
         } else
           n.queries.push({
             groupKey: e.attribute,
@@ -3357,11 +3420,11 @@
           });
       } else if (this.isQueryGroup(e)) {
         const s = e.groupKey === void 0 && t?.mode !== "set" ? -1 : n.queries.findIndex(
-          (i) => this.isQueryGroup(i) && i.groupKey === e.groupKey
+          (o) => this.isQueryGroup(o) && o.groupKey === e.groupKey
         );
         if (s > -1) {
-          const i = n.queries[s];
-          e.groupType && (i.groupType = e.groupType), t?.mode === "set" ? n.queries[s] = e : i.queries = [...i.queries, ...e.queries];
+          const o = n.queries[s];
+          e.groupType && (o.groupType = e.groupType), t?.mode === "set" ? n.queries[s] = e : o.queries = [...o.queries, ...e.queries];
         } else
           n.queries.push({
             groupKey: e.groupKey,
@@ -3384,33 +3447,39 @@
     /**
      * Remove a specific query or query group.
      *
+     * - A condition (`attribute` set) is removed from the group keyed by its attribute.
+     * - A group with `groupKey` but no `queries` is removed entirely.
+     * - A group with `groupKey` and `queries` has those conditions removed from it.
+     *
+     * The target group is looked up by `groupKey` at any nesting depth (see
+     * {@link findQueryGroup}), so a keyed group inside a keyless wrapper group is found
+     * too (#294). A group left without queries is removed, and so is every wrapper
+     * group that becomes empty as a result.
+     *
      * @param queryToRemove - Query or group to remove (partial match)
      * @param relevantQuery - Target query (defaults to current)
      * @returns Updated query
      */
     removeQuery(e, t) {
       if (t || (t = this.currentQuery), this.isQuery(e)) {
-        const n = t.queries.findIndex(
-          (s) => this.isQueryGroup(s) && s.groupKey === e.attribute
-        );
-        if (n > -1) {
-          const s = t.queries[n], i = Te$2(s.queries, e);
-          i > -1 && s.queries.splice(i, 1), s.queries.length === 0 && t.queries.splice(n, 1);
+        const n = this.locateQueryGroup(e.attribute, t.queries);
+        if (n) {
+          const s = this.groupAtPath(n), o = Te$2(s.queries, e);
+          o > -1 && s.queries.splice(o, 1), this.pruneEmptyGroups(n);
         }
       } else if (this.isQueryGroup(e)) {
-        const n = t.queries.findIndex(
-          (s) => this.isQueryGroup(s) && s.groupKey === e.groupKey
-        );
-        if (n > -1)
-          if (!e.queries)
-            t.queries.splice(n, 1);
-          else {
-            const s = t.queries[n];
-            for (const i of e.queries) {
-              const o = Te$2(s.queries, i);
-              o > -1 && s.queries.splice(o, 1);
+        const n = this.locateQueryGroup(e.groupKey, t.queries);
+        if (n)
+          if (e.queries) {
+            const s = this.groupAtPath(n);
+            for (const o of e.queries) {
+              const i = Te$2(s.queries, o);
+              i > -1 && s.queries.splice(i, 1);
             }
-            s.queries.length === 0 && t.queries.splice(n, 1);
+            this.pruneEmptyGroups(n);
+          } else {
+            const s = n[n.length - 1];
+            s.queries.splice(s.idx, 1), this.pruneEmptyGroups(n.slice(0, -1));
           }
       }
       return t;
@@ -3418,12 +3487,12 @@
     validateQuery(e) {
       const t = [];
       if (this.isQuery(e))
-        return e.attribute || t.push(new P$1("Missing attribute", e)), e.operator || t.push(new P$1("Missing operator", e)), typeof e.value > "u" && t.push(new P$1("Missing value", e)), e.operator === "find" && Array.isArray(e.value) && t.push(new P$1("find operator cannot have array value", e)), e.operator === "in" && typeof e.value < "u" && !Array.isArray(e.value) && t.push(new P$1("in operator needs an array value", e)), t.length > 0 ? { valid: false, errors: t } : { valid: true };
+        return e.attribute || t.push(new P("Missing attribute", e)), e.operator || t.push(new P("Missing operator", e)), typeof e.value > "u" && t.push(new P("Missing value", e)), e.operator === "find" && Array.isArray(e.value) && t.push(new P("find operator cannot have array value", e)), e.operator === "in" && typeof e.value < "u" && !Array.isArray(e.value) && t.push(new P("in operator needs an array value", e)), t.length > 0 ? { valid: false, errors: t } : { valid: true };
       if (this.isQueryGroup(e)) {
         const n = e.queries.map((s) => this.validateQuery(s)).filter((s) => !s.valid).map((s) => s.errors).flat();
         return n.length > 0 ? { valid: false, errors: n } : { valid: true };
       }
-      return t.push(new P$1("Invalid query definition", e)), { valid: false, errors: t };
+      return t.push(new P("Invalid query definition", e)), { valid: false, errors: t };
     }
     /**
      * Get all attribute names used in the query.
@@ -3433,9 +3502,9 @@
      * @returns Array of attribute names
      */
     getQueryAttributes(e) {
-      const t = [], n = /* @__PURE__ */ new Set(), s = (i) => {
-        for (const o of i)
-          this.isQuery(o) ? o.attribute && !n.has(o.attribute) && (t.push(o.attribute), n.add(o.attribute)) : this.isQueryGroup(o) && s(o.queries);
+      const t = [], n = /* @__PURE__ */ new Set(), s = (o) => {
+        for (const i of o)
+          this.isQuery(i) ? i.attribute && !n.has(i.attribute) && (t.push(i.attribute), n.add(i.attribute)) : this.isQueryGroup(i) && s(i.queries);
       };
       return s(e?.queries || this.currentQuery.queries), t;
     }
@@ -3447,14 +3516,14 @@
      * @returns Array of QueryAttributeEntry objects
      */
     extractQueryAttributes(e) {
-      const t = [], n = /* @__PURE__ */ new Set(), s = (i) => {
-        for (const o of i)
-          if (this.isQuery(o)) {
-            if (o.attribute && !n.has(o.attribute)) {
-              const a = this.getQueryAttributeForString(o.attribute);
-              t.push(a), n.add(o.attribute);
+      const t = [], n = /* @__PURE__ */ new Set(), s = (o) => {
+        for (const i of o)
+          if (this.isQuery(i)) {
+            if (i.attribute && !n.has(i.attribute)) {
+              const a = this.getQueryAttributeForString(i.attribute);
+              t.push(a), n.add(i.attribute);
             }
-          } else this.isQueryGroup(o) && s(o.queries);
+          } else this.isQueryGroup(i) && s(i.queries);
       };
       return s(e?.queries || this.currentQuery.queries), t;
     }
@@ -3495,9 +3564,9 @@
               t[n.reference] || (t[n.reference] = { $: true });
               const s = this.deepQueryService.parse(n.referenceAttribute);
               if (s.isDeepQuery && n.reference) {
-                const i = this.getProjectionForAttributeEntries([s]);
-                Object.keys(i).forEach((o) => {
-                  o !== "$" && n.reference && (t[n.reference][o] = i[o]);
+                const o = this.getProjectionForAttributeEntries([s]);
+                Object.keys(o).forEach((i) => {
+                  i !== "$" && n.reference && (t[n.reference][i] = o[i]);
                 });
               } else n.reference && (t[n.reference][n.referenceAttribute] = true);
             } else
@@ -3635,9 +3704,11 @@
       return this.applyQuery(e, { mode: "add" });
     }
     /**
-     * Replace query with new condition(s).
+     * Replace the conditions of an attribute group with new condition(s).
      * Accepts single condition or array of conditions.
-     * Each condition replaces all existing conditions for its attribute.
+     * Each condition replaces all existing conditions of the group keyed by its attribute
+     * (created if missing); groups for other attributes and the query options are kept.
+     * This does not replace the whole query — see {@link replaceQuery} for that.
      *
      * Clearer alternative to `applyQuery(condition, { mode: 'set' })`.
      *
@@ -3660,8 +3731,16 @@
       return this.applyQuery(e, { mode: "set" });
     }
     /**
-     * Replace a query group with new definition.
-     * If group exists, replaces it; otherwise creates new group.
+     * Replace one query group by key (per-group `set`).
+     * The group with the same `groupKey` is replaced by the given definition; if none exists
+     * the group is appended. All other groups and the query options (`count`, `start`,
+     * `sort`, `projection`) are kept. An unkeyed group replaces the first unkeyed top-level
+     * group. Only a group with `groupKey: 'root'` replaces the whole query — equivalent to
+     * `applyQuery(rootGroup, { mode: 'set' })` / {@link replaceQuery}.
+     *
+     * A group without `groupKey` whose `queries` hold keyed groups is stored as a keyless
+     * wrapper; the keyed groups inside it stay nested and are still found by `groupKey`
+     * via {@link findQueryGroup}, {@link removeQuery} and `fn.facets` (#294).
      *
      * @param group - Query group to set
      * @returns Updated query
@@ -3708,7 +3787,10 @@
     }
     /**
      * Replace the entire current query with a new query.
-     * Completely replaces all conditions, groups, and options.
+     * Replaces all conditions and groups, and the root `groupType` when given. The query
+     * options (`count`, `start`, `sort`, `projection`) are kept — use {@link applyOptions}
+     * or `applyQuery({ groupKey: 'root', ... }, { mode: 'set' })` to replace those too.
+     * To replace a single group by key, use {@link setGroup}.
      *
      * @param query - Complete query to replace with
      * @returns Updated query
@@ -3804,13 +3886,13 @@
       const t = (n) => {
         for (const s of n)
           if (this.isQuery(s)) {
-            let i = true;
-            for (const o in e)
-              if (s[o] !== e[o]) {
-                i = false;
+            let o = true;
+            for (const i in e)
+              if (s[i] !== e[i]) {
+                o = false;
                 break;
               }
-            if (i) return true;
+            if (o) return true;
           } else if (this.isQueryGroup(s) && t(s.queries))
             return true;
         return false;
@@ -3931,9 +4013,9 @@
       return e(this.currentQuery.queries);
     }
   };
-  const _e$2 = new ir$1();
-  function Qu(r, e, t, n, s, i, o) {
-    const a = t.excludeGroup ?? s, u = _e$2.removeQuery({ groupKey: a }, C$2(n)), c = o.queryData(r, u, false, i), f = e ? [...e.keys()] : [], l = new Set(f), d = i.get(s) ?? /* @__PURE__ */ new Map();
+  const _e$2 = new or$1();
+  function Qu(r, e, t, n, s, o, i) {
+    const a = t.excludeGroup ?? s, u = _e$2.removeQuery({ groupKey: a }, C$2(n)), c = i.queryData(r, u, false, o), f = e ? [...e.keys()] : [], l = new Set(f), d = o.get(s) ?? /* @__PURE__ */ new Map();
     if (!t.excludeUnresolved)
       for (const p2 of d.keys())
         l.add(p2);
@@ -3975,7 +4057,7 @@
     }
     return h;
   }
-  function At$1(r, e, t, n, s, i, o, a) {
+  function At$1(r, e, t, n, s, o, i, a) {
     const u = /* @__PURE__ */ new Map(), c = e.get(r) || /* @__PURE__ */ new Set();
     for (const f of c) {
       const l = t.get(f);
@@ -3985,7 +4067,7 @@
     return {
       key: String(r),
       value: r,
-      selected: fu(i, s, r, o),
+      selected: fu(o, s, r, i),
       enabled: u.size > 0,
       size: u.size,
       entry: n?.get(r),
@@ -4000,8 +4082,8 @@
     if (t !== n) return t < n ? -1 : 1;
     if (t === "number") return r - e;
     if (t === "string") return r.localeCompare(e);
-    const s = String(r), i = String(e);
-    return s < i ? -1 : s > i ? 1 : 0;
+    const s = String(r), o = String(e);
+    return s < o ? -1 : s > o ? 1 : 0;
   }
   function cu(r) {
     switch (r) {
@@ -4016,8 +4098,8 @@
     }
   }
   const fu = (r, e, t, n) => {
-    const s = n.queries.findIndex((i) => _e$2.isQueryGroup(i) && i.groupKey === r);
-    return s > -1 ? !!n.queries[s].queries.find((i) => _e$2.isQuery(i) ? i.attribute !== e ? false : (i.operator === "in" && Array.isArray(i.value) ? i.value : [i.value]).some((o) => (o?.key || o) === t) : false) : false;
+    const s = _e$2.findQueryGroup(r, n);
+    return s ? !!s.queries.find((o) => _e$2.isQuery(o) ? o.attribute !== e ? false : (o.operator === "in" && Array.isArray(o.value) ? o.value : [o.value]).some((i) => (i?.key || i) === t) : false) : false;
   };
   class lu {
     indexMap = /* @__PURE__ */ new Map();
@@ -4042,33 +4124,33 @@
       let n = this.dataMap.get(e);
       n || (n = /* @__PURE__ */ new Map(), this.dataMap.set(e, n));
       for (const s of t) {
-        let i;
+        let o;
         if (typeof s == "object" && s && s.key)
-          i = s.key;
+          o = s.key;
         else if (Array.isArray(s)) {
           for (const a of s)
             this.fillDataMap(e, [a]);
           return;
-        } else s instanceof Date ? i = s.toISOString() : i = s;
-        let o = n.get(i);
-        o || (o = { key: i }, this.dataMap.get(e)?.set(i, o));
+        } else s instanceof Date ? o = s.toISOString() : o = s;
+        let i = n.get(o);
+        i || (i = { key: o }, this.dataMap.get(e)?.set(o, i));
       }
     }
     fillInverseIndex(e, t, n) {
       if (!e || !t || !n || !Array.isArray(n))
         return;
       const s = this.indexMap.get(e) || /* @__PURE__ */ new Map();
-      for (const i of n) {
-        let o;
-        if (typeof i == "object" && i && i.key)
-          o = i.key;
-        else if (Array.isArray(i)) {
-          for (const u of i)
+      for (const o of n) {
+        let i;
+        if (typeof o == "object" && o && o.key)
+          i = o.key;
+        else if (Array.isArray(o)) {
+          for (const u of o)
             this.fillInverseIndex(e, t, [u]);
           return;
-        } else i instanceof Date ? o = i.toISOString() : o = i;
-        let a = s.get(o);
-        a || (a = /* @__PURE__ */ new Set(), s.set(o, a)), a.add(t);
+        } else o instanceof Date ? i = o.toISOString() : i = o;
+        let a = s.get(i);
+        a || (a = /* @__PURE__ */ new Set(), s.set(i, a)), a.add(t);
       }
       this.indexMap.set(e, s);
     }
@@ -4082,11 +4164,11 @@
     }
     getOrCreateIndex(e, t, n) {
       const s = this.getIndexName(e, n);
-      let i = this.getIndex(s);
-      const o = this.indexMetadata.get(s);
-      if (o)
-        o.lastAccessedAt = Date.now();
-      else if (!i) {
+      let o = this.getIndex(s);
+      const i = this.indexMetadata.get(s);
+      if (i)
+        i.lastAccessedAt = Date.now();
+      else if (!o) {
         const a = S$2.parse(e).isDeepQuery ?? false;
         this.indexMetadata.set(s, {
           createdAt: Date.now(),
@@ -4095,19 +4177,19 @@
           type: a ? "deep" : "shallow"
         });
       }
-      if (!i) {
+      if (!o) {
         this.reset(s), this.indexMap.set(s, /* @__PURE__ */ new Map());
         const a = S$2.parse(e).isDeepQuery;
         for (const u of t.values()) {
           let c;
           a ? (c = K$2(u, e), c.length === 0 && (c = [void 0])) : c = [u[e]], this.fillInverseIndex(s, u.key, c), this.fillDataMap(s, c);
         }
-        i = this.getIndex(s) || /* @__PURE__ */ new Map();
+        o = this.getIndex(s) || /* @__PURE__ */ new Map();
       }
-      return i;
+      return o;
     }
     getIndexName(e, t) {
-      return t ? e + "_" + qe$3(t) : e;
+      return t ? e + "_" + qe$2(t) : e;
     }
     // ========== PARTIAL UPDATE METHODS ==========
     /**
@@ -4119,17 +4201,17 @@
     removeFromInverseIndex(e, t, n) {
       const s = this.indexMap.get(e);
       if (s)
-        for (const i of n) {
-          let o;
-          if (typeof i == "object" && i && i.key)
-            o = i.key;
-          else if (Array.isArray(i)) {
-            for (const u of i)
+        for (const o of n) {
+          let i;
+          if (typeof o == "object" && o && o.key)
+            i = o.key;
+          else if (Array.isArray(o)) {
+            for (const u of o)
               this.removeFromInverseIndex(e, t, [u]);
             return;
-          } else i instanceof Date ? o = i.toISOString() : o = i;
-          const a = s.get(o);
-          a && (a.delete(t), a.size === 0 && s.delete(o));
+          } else o instanceof Date ? i = o.toISOString() : i = o;
+          const a = s.get(i);
+          a && (a.delete(t), a.size === 0 && s.delete(i));
         }
     }
     /**
@@ -4151,15 +4233,15 @@
       const n = this.dataMap.get(e);
       if (n)
         for (const s of t) {
-          let i;
+          let o;
           if (typeof s == "object" && s && s.key)
-            i = s.key;
+            o = s.key;
           else if (Array.isArray(s)) {
-            for (const o of s)
-              this.removeFromDataMap(e, [o]);
+            for (const i of s)
+              this.removeFromDataMap(e, [i]);
             return;
-          } else s instanceof Date ? i = s.toISOString() : i = s;
-          n.delete(i);
+          } else s instanceof Date ? o = s.toISOString() : o = s;
+          n.delete(o);
         }
     }
     /**
@@ -4251,8 +4333,8 @@
     cleanupStaleIndices(e = 300 * 1e3) {
       const t = Date.now();
       let n = 0;
-      for (const [s, i] of this.indexMetadata)
-        t - i.lastAccessedAt > e && (this.reset(s), n++);
+      for (const [s, o] of this.indexMetadata)
+        t - o.lastAccessedAt > e && (this.reset(s), n++);
       return n;
     }
     /**
@@ -4262,37 +4344,37 @@
     getStats() {
       const e = this.getIndexCount(), t = Date.now();
       let n = 0, s = 0;
-      for (const o of this.indexMetadata.values()) {
-        const a = t - o.createdAt;
+      for (const i of this.indexMetadata.values()) {
+        const a = t - i.createdAt;
         n += a, a > s && (s = a);
       }
-      const i = this.indexMetadata.size > 0 ? n / this.indexMetadata.size : 0;
+      const o = this.indexMetadata.size > 0 ? n / this.indexMetadata.size : 0;
       return {
         shallow: e.shallow,
         deep: e.deep,
         total: e.total,
         oldestAge: s,
-        avgAge: i
+        avgAge: o
       };
     }
   }
   const R$1 = "__";
-  function or$1(r, e, t = { key: "root" }, n = "root", s = new lu(), i) {
-    const o = i || r;
+  function ir$1(r, e, t = { key: "root" }, n = "root", s = new lu(), o) {
+    const i = o || r;
     for (const a of e.columns)
-      a.attribute && (S$2.parse(a.attribute), s.getOrCreateIndex(a.attribute, o));
+      a.attribute && (S$2.parse(a.attribute), s.getOrCreateIndex(a.attribute, i));
     for (const a of e.rows)
-      a.attribute && (S$2.parse(a.attribute), s.getOrCreateIndex(a.attribute, o));
+      a.attribute && (S$2.parse(a.attribute), s.getOrCreateIndex(a.attribute, i));
     for (const a of e.values)
-      a.attribute && (S$2.parse(a.attribute), s.getOrCreateIndex(a.attribute, o));
+      a.attribute && (S$2.parse(a.attribute), s.getOrCreateIndex(a.attribute, i));
     if (e.rows && e.rows.length > 0) {
       t.rows = t.rows || [];
-      const a = du(r, e.rows[0], e, s, n, i);
+      const a = du(r, e.rows[0], e, s, n, o);
       t.rows.push(a);
     }
     if (e.columns && e.columns.length > 0) {
       t.columns = t.columns || [];
-      const a = ar$1(r, e.columns[0], e, s, n, i);
+      const a = ar$1(r, e.columns[0], e, s, n, o);
       t.columns.push(a);
     }
     if (t.key === "root")
@@ -4304,10 +4386,10 @@
       }
     return t;
   }
-  function du(r, e, t, n, s = "", i) {
-    const o = { key: e.attribute }, a = n.getIndex(e.attribute);
+  function du(r, e, t, n, s = "", o) {
+    const i = { key: e.attribute }, a = n.getIndex(e.attribute);
     if (!a)
-      return o;
+      return i;
     for (const [u, c] of a.entries()) {
       const f = {
         key: u,
@@ -4322,15 +4404,15 @@
           const h = Ke$2(d, l, n.getIndex(d.attribute), d.attribute);
           f.values.push(h);
         }
-        if (o.rows = o.rows || [], o.rows.push(f), t.rows.length > 1) {
+        if (i.rows = i.rows || [], i.rows.push(f), t.rows.length > 1) {
           const d = { ...t, rows: t.rows.slice(1) };
-          or$1(
+          ir$1(
             l,
             d,
             f,
             s + R$1 + e.attribute + R$1 + u,
             n,
-            i
+            o
           );
         } else if (t.columns)
           for (const d of t.columns) {
@@ -4341,18 +4423,18 @@
               t,
               n,
               s + R$1 + e.attribute + R$1 + u,
-              i
+              o
             );
             f.columns.push(h);
           }
       }
     }
-    return o;
+    return i;
   }
-  function ar$1(r, e, t, n, s = "", i) {
-    const o = { key: e.attribute }, a = n.getIndex(e.attribute);
+  function ar$1(r, e, t, n, s = "", o) {
+    const i = { key: e.attribute }, a = n.getIndex(e.attribute);
     if (!a)
-      return o;
+      return i;
     for (const [u, c] of a.entries()) {
       const f = {
         key: u,
@@ -4367,32 +4449,32 @@
           const h = Ke$2(d, l, n.getIndex(d.attribute), d.attribute);
           f.values.push(h);
         }
-        if (o.columns = o.columns || [], o.columns.push(f), t.columns.length > 1) {
+        if (i.columns = i.columns || [], i.columns.push(f), t.columns.length > 1) {
           const d = { ...t, columns: t.columns.slice(1) };
-          or$1(
+          ir$1(
             l,
             d,
             f,
             s + R$1 + e.attribute + R$1 + u,
             n,
-            i
+            o
           );
         }
       }
     }
-    return o;
+    return i;
   }
   const hu = /^\d{4}-\d{2}-\d{2}(T\d{2}:\d{2}(:\d{2}(\.\d+)?)?(Z|[+-]\d{2}:\d{2})?)?$/, pu = /^-?\d+$/, gu = /^-?\d+\.\d+$/, yu = /^\d{1,2}([/.-])\d{1,2}\1\d{2,4}$/, mu = (r) => r === "true" || r === "false" ? "boolean" : pu.test(r) ? "int" : gu.test(r) ? "float" : hu.test(r) && !Number.isNaN(Date.parse(r)) ? "date" : "string", bu = (r) => yu.test(r), vu = (r) => r == null || r === "", wu = (r) => {
     const e = [...r];
     return e.length <= 1 ? { type: e[0] ?? "any", conflict: false } : e.every((t) => t === "int" || t === "float") ? { type: "float", conflict: false } : { type: "any", conflict: true };
   }, Au = (r, e = {}) => {
-    const t = e.deep ?? (e.sampleSize !== void 0 && e.sampleSize > 1) ? e.sampleSize ?? 1 / 0 : 1, n = e.coerceStrings ?? true, s = /* @__PURE__ */ new Map(), i = [], o = Math.min(r.length, t);
-    for (let c = 0; c < o; c++) {
+    const t = e.deep ?? (e.sampleSize !== void 0 && e.sampleSize > 1) ? e.sampleSize ?? 1 / 0 : 1, n = e.coerceStrings ?? true, s = /* @__PURE__ */ new Map(), o = [], i = Math.min(r.length, t);
+    for (let c = 0; c < i; c++) {
       const f = r[c];
       if (f)
         for (const [l, d] of Object.entries(f)) {
           let h = s.get(l);
-          if (h || (h = { observed: /* @__PURE__ */ new Set(), empty: 0, scanned: 0 }, s.set(l, h), i.push(l)), h.scanned++, vu(d)) {
+          if (h || (h = { observed: /* @__PURE__ */ new Set(), empty: 0, scanned: 0 }, s.set(l, h), o.push(l)), h.scanned++, vu(d)) {
             h.empty++;
             continue;
           }
@@ -4401,7 +4483,7 @@
         }
     }
     const a = [], u = [];
-    for (const c of i) {
+    for (const c of o) {
       const f = s.get(c), { type: l, conflict: d } = wu(f.observed.size ? f.observed : /* @__PURE__ */ new Set(["string"]));
       a.push({ key: c, type: l }), u.push({
         column: c,
@@ -4435,7 +4517,7 @@
     globalItemService;
     modelParser;
     registeredCustomOperator = /* @__PURE__ */ new Map();
-    queryBuilder = new ir$1();
+    queryBuilder = new or$1();
     registerCustomOperator(e, t) {
       this.registeredCustomOperator.set(e, t);
     }
@@ -4452,42 +4534,42 @@
       let n = e.value;
       const s = e.options?.arrayValueHandling || "some";
       Array.isArray(e.options?.transform) && e.options.transform.length > 0 && (n = this.transformValue(n, e.options.transform));
-      let i = this.getAttributeValue(t, e.attribute);
-      if (Array.isArray(e.options?.transform) && e.options.transform.length > 0 && (i = this.transformValue(i, e.options.transform)), (typeof i > "u" || i === null) && !["typeof", "isTruthy", "eq", "in"].includes(e.operator))
+      let o = this.getAttributeValue(t, e.attribute);
+      if (Array.isArray(e.options?.transform) && e.options.transform.length > 0 && (o = this.transformValue(o, e.options.transform)), (typeof o > "u" || o === null) && !["typeof", "isTruthy", "eq", "in"].includes(e.operator))
         return false;
-      let o;
+      let i;
       switch (e.operator) {
         case "eq":
-          o = this.queryEq(i, n, s);
+          i = this.queryEq(o, n, s);
           break;
         case "in":
-          o = this.queryIn(i, n, s);
+          i = this.queryIn(o, n, s);
           break;
         case "find":
-          o = this.queryFind(i, n, s, e.options?.regexFlags);
+          i = this.queryFind(o, n, s, e.options?.regexFlags);
           break;
         case "lt":
         case "gt":
         case "lte":
         case "gte": {
           const a = e.operator;
-          o = this.matchValues(
-            i,
+          i = this.matchValues(
+            o,
             s,
             (u) => this.compareValue(a, u, n)
           );
           break;
         }
         case "typeof":
-          o = this.matchValues(i, s, (a) => typeof a === n);
+          i = this.matchValues(o, s, (a) => typeof a === n);
           break;
         case "isTruthy": {
           const a = n === true;
-          o = this.matchValues(i, s, (u) => !!u === a);
+          i = this.matchValues(o, s, (u) => !!u === a);
           break;
         }
         case "size":
-          typeof i == "string" ? o = i.length === n : o = La(i) === n;
+          typeof o == "string" ? i = o.length === n : i = La(o) === n;
           break;
         default:
           if (this.scriptController.hasScript(e.operator))
@@ -4499,7 +4581,7 @@
           }
           return false;
       }
-      return e.options?.invert ? !o : o;
+      return e.options?.invert ? !i : i;
     }
     /** A missing value never compares — in JS `null >= 0` is true. */
     compareValue(e, t, n) {
@@ -4530,13 +4612,13 @@
         return W$2(e, t);
       const n = t.split(".");
       let s = e;
-      for (let i = 0; i < n.length; i++) {
-        const o = n[i];
+      for (let o = 0; o < n.length; o++) {
+        const i = n[o];
         if (s == null)
           return;
-        if (Array.isArray(s) && o !== "length" && !/^\d+$/.test(o))
-          return K$2(s, n.slice(i).join("."));
-        s = s[o];
+        if (Array.isArray(s) && i !== "length" && !/^\d+$/.test(i))
+          return K$2(s, n.slice(o).join("."));
+        s = s[i];
       }
       return s;
     }
@@ -4563,7 +4645,7 @@
       return !Array.isArray(t) || t.length === 0 ? false : this.matchValues(
         e,
         n,
-        (s) => t.some((i) => this.equalsQueryValue(s, i))
+        (s) => t.some((o) => this.equalsQueryValue(s, o))
       );
     }
     /**
@@ -4592,21 +4674,21 @@
       return e.options?.arrayValueHandling !== "every" && !e.options?.transform?.length;
     }
     evaluateEqOperator(e, t, n, s) {
-      const i = /* @__PURE__ */ new Map(), o = this.canUseIndex(t) ? s.get(t.attribute) : void 0;
-      if (o) {
+      const o = /* @__PURE__ */ new Map(), i = this.canUseIndex(t) ? s.get(t.attribute) : void 0;
+      if (i) {
         const a = this.getIndexKey(t.value);
         if (typeof a < "u") {
-          const u = o.get(a);
+          const u = i.get(a);
           if (u)
             if (u.forEach((c) => {
-              n.has(c) && i.set(c, n.get(c));
+              n.has(c) && o.set(c, n.get(c));
             }), t.options?.invert) {
-              const c = gt(Array.from(n.values()), Array.from(i.values()), "key"), f = /* @__PURE__ */ new Map();
+              const c = gt(Array.from(n.values()), Array.from(o.values()), "key"), f = /* @__PURE__ */ new Map();
               return c.forEach((l) => {
                 f.set(l.key, l);
               }), f;
             } else
-              return i;
+              return o;
         }
       }
       return this.scanDataset(e, t, n);
@@ -4618,46 +4700,46 @@
      * the result equals the scan's.
      */
     evaluateInOperator(e, t, n, s) {
-      const i = this.canUseIndex(t) ? s.get(t.attribute) : void 0;
-      if (!i)
+      const o = this.canUseIndex(t) ? s.get(t.attribute) : void 0;
+      if (!o)
         return this.scanDataset(e, t, n);
-      const o = /* @__PURE__ */ new Map(), a = [];
+      const i = /* @__PURE__ */ new Map(), a = [];
       for (const c of t.value) {
-        const f = this.getIndexKey(c), l = typeof f < "u" ? i.get(f) : void 0;
+        const f = this.getIndexKey(c), l = typeof f < "u" ? o.get(f) : void 0;
         if (!l) {
           a.push(c);
           continue;
         }
         l.forEach((d) => {
           const h = n.get(d);
-          h && o.set(d, h);
+          h && i.set(d, h);
         });
       }
       if (a.length > 0) {
         const c = /* @__PURE__ */ new Map();
         n.forEach((l, d) => {
-          o.has(d) || c.set(d, l);
+          i.has(d) || c.set(d, l);
         });
         const f = {
           ...t,
           value: a,
           options: { ...t.options, invert: false }
         };
-        this.scanDataset(e, f, c).forEach((l, d) => o.set(d, l));
+        this.scanDataset(e, f, c).forEach((l, d) => i.set(d, l));
       }
       if (!t.options?.invert)
-        return o;
+        return i;
       const u = /* @__PURE__ */ new Map();
       return n.forEach((c, f) => {
-        o.has(f) || u.set(f, c);
+        i.has(f) || u.set(f, c);
       }), u;
     }
     /** Evaluates `query` on each item, resolving a deep path's references first. */
     scanDataset(e, t, n) {
-      const s = /* @__PURE__ */ new Map(), i = this.queryBuilder.extractQueryAttributes({ queries: [t] }).filter((a) => a.isDeepQuery), o = i.length > 0 ? this.queryBuilder.getProjectionForAttributeEntries(i) : void 0;
+      const s = /* @__PURE__ */ new Map(), o = this.queryBuilder.extractQueryAttributes({ queries: [t] }).filter((a) => a.isDeepQuery), i = o.length > 0 ? this.queryBuilder.getProjectionForAttributeEntries(o) : void 0;
       for (let [a, u] of n)
-        o && (u = this.globalItemService.getProjectedData(
-          o,
+        i && (u = this.globalItemService.getProjectedData(
+          i,
           this.modelParser.models.get(e.modelKey),
           u
         )), this.evaluateQuery(t, u) && s.set(a, u);
@@ -4672,12 +4754,12 @@
           return false;
         }
       else return Array.isArray(e) ? !!e.find(
-        (i) => me$1(i, t, (o, a) => this.equalRegexFn(o, a, n))
+        (o) => me$1(o, t, (i, a) => this.equalRegexFn(i, a, n))
       ) : typeof t == "object" ? yt(e, t) : e === t;
     }
     queryFind(e, t, n, s) {
-      const i = (o, a) => this.equalRegexFn(o, a, s);
-      return Array.isArray(e) ? typeof t == "string" || typeof t == "number" || typeof t == "boolean" ? this.matchValues(e, n, (o) => me$1(o, t, i)) : t !== null && typeof t == "object" ? this.matchValues(e, n, (o) => yt(o, t)) : !!ba(e, t) : me$1(e, t, i);
+      const o = (i, a) => this.equalRegexFn(i, a, s);
+      return Array.isArray(e) ? typeof t == "string" || typeof t == "number" || typeof t == "boolean" ? this.matchValues(e, n, (i) => me$1(i, t, o)) : t !== null && typeof t == "object" ? this.matchValues(e, n, (i) => yt(i, t)) : !!ba(e, t) : me$1(e, t, o);
     }
     validateQuery(e) {
       if (this.queryBuilder.isQuery(e)) {
@@ -4695,9 +4777,9 @@
       }
     }
     getEvaluatedQueryDataset(e, t, n, s) {
-      const i = /* @__PURE__ */ new Map();
+      const o = /* @__PURE__ */ new Map();
       if (t.attribute.includes("[*]")) {
-        const o = t.options?.invert === true, a = /* @__PURE__ */ new Set();
+        const i = t.options?.invert === true, a = /* @__PURE__ */ new Set();
         for (let u of n.values()) {
           const c = this.queryBuilder.extractQueryAttributes({ queries: [t] });
           if (c.some((l) => l.isDeepQuery)) {
@@ -4718,13 +4800,13 @@
             f,
             t.options?.arrayValueHandling || "some",
             (l) => this.evaluateQuery(l, u)
-          ) && (a.add(u.key), o || i.set(u.key, u));
+          ) && (a.add(u.key), i || o.set(u.key, u));
         }
-        if (o)
+        if (i)
           for (const [u, c] of n)
-            a.has(u) || i.set(u, c);
+            a.has(u) || o.set(u, c);
       } else return t.operator === "eq" ? this.evaluateEqOperator(e, t, n, s) : t.operator === "in" ? this.evaluateInOperator(e, t, n, s) : this.scanDataset(e, t, n);
-      return i;
+      return o;
     }
     handleArrayStarQuery(e, t) {
       const n = e.attribute.indexOf("[*]"), s = {
@@ -4733,9 +4815,9 @@
         queries: []
       };
       if (n !== -1) {
-        const i = e.attribute.substring(0, n), o = i.includes(".") ? W$2(t, i) : t[i];
-        if (Array.isArray(o))
-          for (let a = 0; a < o.length; a++) {
+        const o = e.attribute.substring(0, n), i = o.includes(".") ? W$2(t, o) : t[o];
+        if (Array.isArray(i))
+          for (let a = 0; a < i.length; a++) {
             const u = e.attribute.replace("[*]", `[${a}]`);
             s.queries.push({
               attribute: u,
@@ -4747,30 +4829,31 @@
       }
       return s;
     }
-    evaluateQueryGroup(e, t, n, s, i) {
-      let o = /* @__PURE__ */ new Map(), a = n;
+    evaluateQueryGroup(e, t, n, s, o) {
+      let i = /* @__PURE__ */ new Map(), a = n;
       if (!t.queries || t.queries?.length === 0)
         return a;
-      for (const u of t.queries) {
-        let c = /* @__PURE__ */ new Map();
-        if (this.queryBuilder.isQuery(u) ? c = this.getEvaluatedQueryDataset(e, u, a, i) : c = this.evaluateQueryGroup(e, u, a, s, i), o.size === 0 && (o = c), t.groupType === "or")
-          c.forEach((f) => {
-            o.set(f.key, f);
-          });
+      const u = t.groupType === "or";
+      for (const c of t.queries) {
+        let f = /* @__PURE__ */ new Map();
+        if (this.queryBuilder.isQuery(c) ? f = this.getEvaluatedQueryDataset(e, c, a, o) : f = this.evaluateQueryGroup(e, c, a, s, o), i.size === 0 && (i = f), u)
+          f.forEach((l) => {
+            i.set(l.key, l);
+          }), a = n;
         else {
-          const f = gt(Array.from(o.values()), Array.from(c.values()), "key");
-          for (const l of f)
-            o.delete(l.key);
+          const l = gt(Array.from(i.values()), Array.from(f.values()), "key");
+          for (const d of l)
+            i.delete(d.key);
+          a = i;
         }
-        t.groupType === "and" ? a = o : a = n;
       }
-      return o;
+      return i;
     }
     queryData(e, t, n, s) {
       if (t.queries.length === 0)
         return e;
-      const i = new Map(e);
-      return t.groupKey || (t.groupKey = "root"), t.groupType || (t.groupType = "and"), t.queries || (t.queries = []), this.validateQuery(t), this.evaluateQueryGroup(t, t, i, n, s);
+      const o = new Map(e);
+      return t.groupKey || (t.groupKey = "root"), t.groupType || (t.groupType = "and"), t.queries || (t.queries = []), this.validateQuery(t), this.evaluateQueryGroup(t, t, o, n, s);
     }
     // public getRelevantQueryData(data: any, options: DcuplGlobalQueryOptions<any>, model: DcuplModel<ListItem>) {
     //   // detect if any of the query attributes are a deep query.
@@ -4841,8 +4924,8 @@
       const n = this.getScript(e);
       if (!n)
         throw new Error(`Script ${e} not found`);
-      const s = this.getWrapperScript(n), i = new Function("script_type", ...t, s);
-      return this.scriptFunctions.set(e, i), i;
+      const s = this.getWrapperScript(n), o = new Function("script_type", ...t, s);
+      return this.scriptFunctions.set(e, o), o;
     }
     getWrapperScript(e) {
       return `
@@ -4854,18 +4937,18 @@
       if (!this.getScript(e))
         throw new Error(`Script ${e} not found`);
       n.context || (n.context = n.options || {});
-      const s = Object.keys(n), i = Object.values(n);
-      return this.getScriptAsFn(e, s)(t, ...i);
+      const s = Object.keys(n), o = Object.values(n);
+      return this.getScriptAsFn(e, s)(t, ...o);
     }
   }
   const Pu = (r, e) => r ? (e || (e = {}), r.replace(/\$\{(.*?)\}/g, (t, n) => W$2(e, n.trim(), ""))) : "", Ru = (r) => {
     const e = /* @__PURE__ */ new Set();
     return r.replace(/\$\{(.*?)\}/g, (t, n) => (e.add(n.trim()), "")), { variables: Array.from(e).map((t) => ({ name: t })) };
   };
-  var U$2 = pn$1(function(A2, e) {
-    return ye(A2) ? da(A2, qs$1(e, 1, ye)) : [];
+  var U$2 = pn$1(function(M2, e) {
+    return ye(M2) ? da(M2, qs$1(e, 1, ye)) : [];
   });
-  let L$2 = class L {
+  let $$1 = class $ {
     constructor(e, t, r, i, n) {
       this.modelParser = e, this.cdRef = t, this.item = r, this.indicesController = i, this.queryManager = n, this.cacheCtrl = new _u(!!this.cdRef.dcuplInitOptions.performance?.cache?.enabled);
     }
@@ -4893,8 +4976,18 @@
      * Cache for projected data keyed by projection signature
      */
     projectionCache = /* @__PURE__ */ new Map();
+    /**
+     * The other models this list's current results were read through: every
+     * model on a dotted path (`memberships.user.daysInactive` on `project` reads
+     * `membership` and `user`) that a query, facet, aggregate, groupBy, pivot or
+     * suggestion resolved since the caches were last dropped. dcupl.update()
+     * treats the list as affected when any of them changes (#284). Cleared
+     * together with the caches: after that nothing cached can be stale, and the
+     * next read registers the paths it resolves again.
+     */
+    dependencyModels = /* @__PURE__ */ new Set();
     init(e, t) {
-      this.model = e, this.initialData = t, this.filteredData = this.initialData, this.queryBuilder = new ir$1(), this.queryBuilder.init({ modelKey: e.key }), this.initFilterItems({ skipProcessing: true });
+      this.model = e, this.initialData = t, this.filteredData = this.initialData, this.queryBuilder = new or$1(), this.queryBuilder.init({ modelKey: e.key }), this.initFilterItems({ skipProcessing: true });
     }
     /**
      * Checks if a deep query index depends on any of the changed attributes
@@ -4923,7 +5016,7 @@
      * @param changedAttributes - Optional set of changed attributes for granular invalidation
      */
     invalidateAllCaches(e) {
-      this.cacheCtrl.clear(), this.projectionCache.clear();
+      this.cacheCtrl.clear(), this.projectionCache.clear(), this.dependencyModels.clear();
       let t = 0;
       if (e && e.size > 0) {
         const i = this.indicesController.getDeepIndexKeys(), n = [];
@@ -4984,7 +5077,29 @@
       const t = this.getDeepQueryAttributes(e);
       if (t.length === 0) return null;
       const r = t.map((i) => S$2.parse(i));
-      return this.queryBuilder.getProjectionForAttributeEntries(r);
+      return this.projectionFor(r);
+    }
+    /**
+     * Builds the projection that resolves `entries` on this list's items and
+     * records the models it reads through in {@link dependencyModels}. Every
+     * deep-path read of this list goes through here, so the set is complete.
+     */
+    projectionFor(e) {
+      const t = this.queryBuilder.getProjectionForAttributeEntries(e);
+      return this.item.getProjectionModels(t, this.model, this.dependencyModels), t;
+    }
+    /** The models a path to `attribute` reads through (not this list's own). */
+    pathModels(e) {
+      const t = S$2.parse(e);
+      return t.isDeepQuery ? this.item.getProjectionModels(this.projectionFor([t]), this.model) : /* @__PURE__ */ new Set();
+    }
+    /**
+     * The models other than this list's own that its cached results depend on
+     * (see {@link dependencyModels}).
+     * @internal
+     */
+    getDependencyModels() {
+      return this.dependencyModels;
     }
     /**
      * Generate cache key from deep query attributes
@@ -5016,9 +5131,7 @@
     getProjectedInitialData(e) {
       const t = new Set(this.getDeepQueryAttributes(this.queryBuilder.getQuery()));
       t.add(e);
-      const r = Array.from(t).sort(), i = this.queryBuilder.getProjectionForAttributeEntries(
-        r.map((n) => S$2.parse(n))
-      );
+      const r = Array.from(t).sort(), i = this.projectionFor(r.map((n) => S$2.parse(n)));
       return this.getProjectedData(this.initialData, i, r.join("|"));
     }
     initFilterItems(e) {
@@ -5049,32 +5162,32 @@
         throw new Error("Attribute not found");
       let s = /* @__PURE__ */ new Map(), a;
       !i && n && (n.type === "singleValued" || n.type === "multiValued") && (a = this.modelParser.models.get(n.model));
-      const o = {}, l = this.getSortingProjectionForModel(e, this.model);
-      o.sort = l;
-      let u = this.item.getItemsAsMap(this.filteredData, this.model, o);
+      const c = {}, l = this.getSortingProjectionForModel(e, this.model);
+      c.sort = l;
+      let o = this.item.getItemsAsMap(this.filteredData, this.model, c);
       if (i) {
-        const d = this.queryBuilder.getProjectionForAttributeEntries([r]), g2 = /* @__PURE__ */ new Map();
-        for (const [y2, C2] of u) {
-          const b2 = this.item.getProjectedData(d, this.model, C2);
-          g2.set(y2, b2);
+        const d = this.projectionFor([r]), g2 = /* @__PURE__ */ new Map();
+        for (const [y2, C2] of o) {
+          const v2 = this.item.getProjectedData(d, this.model, C2);
+          g2.set(y2, v2);
         }
-        u = g2;
+        o = g2;
       }
-      const f = this.indicesController.getOrCreateIndex(`${e.attribute}`, u, {
+      const f = this.indicesController.getOrCreateIndex(`${e.attribute}`, o, {
         childLevelSorting: l,
         query: this.queryBuilder.getQuery()
-      }), c = this.getAggregate(
+      }), u = this.getAggregate(
         { attribute: e.attribute, types: ["distinct"], excludeUndefineds: true },
-        u,
+        o,
         f
       );
-      if (c.distinct)
-        for (const d of c.distinct) {
+      if (u.distinct)
+        for (const d of u.distinct) {
           let g2 = { key: d.value, value: d.value };
-          const y2 = d.keys.filter((b2) => u.has(b2));
+          const y2 = d.keys.filter((v2) => o.has(v2));
           if (a) {
-            const b2 = a.data.get(d.value);
-            b2 && (g2 = b2);
+            const v2 = a.data.get(d.value);
+            v2 && (g2 = v2);
           }
           const C2 = {
             ...g2,
@@ -5096,25 +5209,25 @@
         const d = this.getSortingProjectionForModel(e, a);
         h.sort = d;
       }
-      if (t._meta.currentSize = s.size, t._meta.initialSize = c.distinct.length, s = this.item.getItemsAsMap(s, a, h), Array.isArray(e?.aggregates) && s.forEach((d) => {
-        const g2 = c.distinct.find((C2) => C2.value === d.key), y2 = this.getDataByKeys(u, g2.keys);
+      if (t._meta.currentSize = s.size, t._meta.initialSize = u.distinct.length, s = this.item.getItemsAsMap(s, a, h), Array.isArray(e?.aggregates) && s.forEach((d) => {
+        const g2 = u.distinct.find((C2) => C2.value === d.key), y2 = this.getDataByKeys(o, g2.keys);
         d._aggregates = e.aggregates.map((C2) => {
-          const b2 = this.indicesController.getOrCreateIndex(`${C2.attribute}`, y2, {
+          const v2 = this.indicesController.getOrCreateIndex(`${C2.attribute}`, y2, {
             section: d.key,
             childLevelSorting: l,
             query: this.queryBuilder.getQuery()
           });
-          return this.getAggregate(C2, y2, b2);
+          return this.getAggregate(C2, y2, v2);
         });
       }), e?.items) {
         const d = e.items?.find((g2) => g2.key === "*");
         d ? s.forEach((g2) => {
-          const y2 = c.distinct.find((x2) => x2.value === g2.key), C2 = this.getDataByKeys(u, y2.keys), b2 = this.item.getItems(C2, this.model, d);
-          g2._items = b2;
+          const y2 = u.distinct.find((x2) => x2.value === g2.key), C2 = this.getDataByKeys(o, y2.keys), v2 = this.item.getItems(C2, this.model, d);
+          g2._items = v2;
         }) : s.forEach((g2) => {
           const y2 = e.items?.find((C2) => C2.key === g2.key);
           if (y2) {
-            const C2 = c.distinct.find((P2) => P2.value === g2.key), b2 = this.getDataByKeys(u, C2.keys), x2 = this.item.getItems(b2, this.model, y2);
+            const C2 = u.distinct.find((F2) => F2.value === g2.key), v2 = this.getDataByKeys(o, C2.keys), x2 = this.item.getItems(v2, this.model, y2);
             g2._items = x2;
           }
         });
@@ -5157,14 +5270,14 @@
       const a = this.model.properties.get(i);
       if (a)
         if (Array.isArray(a.filter)) {
-          a.filter.forEach((o) => {
-            const l = o?.comparisonType || "containsIgnoreCase";
-            this.updateFilterItemProperty(o.key, a.key, a.type, l, s);
+          a.filter.forEach((c) => {
+            const l = c?.comparisonType || "containsIgnoreCase";
+            this.updateFilterItemProperty(c.key, a.key, a.type, l, s);
           });
           return;
         } else {
-          const o = a.filter?.comparisonType || "containsIgnoreCase";
-          this.updateFilterItemProperty(a.key, a.key, a.type, o, s);
+          const c = a.filter?.comparisonType || "containsIgnoreCase";
+          this.updateFilterItemProperty(a.key, a.key, a.type, c, s);
           return;
         }
       if (e === "key") {
@@ -5190,36 +5303,36 @@
       this.filterItems.set(s.key, s);
     }
     updateFilterItemProperty(e, t, r, i, n) {
-      const s = this.getFilterTypeForPropertyType(r), a = this.queryBuilder.hasQueryGroup(e), o = {
+      const s = this.getFilterTypeForPropertyType(r), a = this.queryBuilder.hasQueryGroup(e), c = {
         key: e,
         attributeKey: t,
         enabled: true,
         selected: !!a,
         type: s
       };
-      if (o.type === "text" && (o.comparisonType = i), o.type === "boolean") {
-        const l = this.getFacets(o.attributeKey, void 0, n);
-        o.entries = l;
+      if (c.type === "text" && (c.comparisonType = i), c.type === "boolean") {
+        const l = this.getFacets(c.attributeKey, void 0, n);
+        c.entries = l;
       }
-      n.skipProcessing || (o.type === "number" && (o.range = this.getNumberRangesForFilterItem(o)), o.type === "date" && (o.range = this.getDateRangesForFilterItem(o))), this.filterItems.set(o.key, o);
+      n.skipProcessing || (c.type === "number" && (c.range = this.getNumberRangesForFilterItem(c)), c.type === "date" && (c.range = this.getDateRangesForFilterItem(c))), this.filterItems.set(c.key, c);
     }
     getNumberRange(e, t = e) {
       let r = 1 / 0, i = -1 / 0;
-      for (const o of this.filteredData.values()) {
-        const l = o[e];
+      for (const c of this.filteredData.values()) {
+        const l = c[e];
         if (!(typeof l > "u" || l === null))
           if (Array.isArray(l))
-            for (const u of l)
-              typeof u == "number" && (u < r && (r = u), u > i && (i = u));
+            for (const o of l)
+              typeof o == "number" && (o < r && (r = o), o > i && (i = o));
           else typeof l == "number" && (l < r && (r = l), l > i && (i = l));
       }
       let n = 1 / 0, s = -1 / 0;
-      for (const o of this.initialData.values()) {
-        const l = o[e];
+      for (const c of this.initialData.values()) {
+        const l = c[e];
         if (!(typeof l > "u" || l === null))
           if (Array.isArray(l))
-            for (const u of l)
-              typeof u == "number" && (u < n && (n = u), u > s && (s = u));
+            for (const o of l)
+              typeof o == "number" && (o < n && (n = o), o > s && (s = o));
           else typeof l == "number" && (l < n && (n = l), l > s && (s = l));
       }
       return r === 1 / 0 && (r = 0), i === -1 / 0 && (i = 0), n === 1 / 0 && (n = 0), s === -1 / 0 && (s = 0), {
@@ -5243,19 +5356,19 @@
     getDateRange(e, t = e) {
       let r = null, i = null;
       for (const l of this.filteredData.values()) {
-        const u = l[e];
-        if (typeof u > "u" || u === null) continue;
-        const f = Array.isArray(u) ? u : [u];
-        for (const c of f)
-          c instanceof Date && ((!r || c < r) && (r = c), (!i || c > i) && (i = c));
+        const o = l[e];
+        if (typeof o > "u" || o === null) continue;
+        const f = Array.isArray(o) ? o : [o];
+        for (const u of f)
+          u instanceof Date && ((!r || u < r) && (r = u), (!i || u > i) && (i = u));
       }
       let n = null, s = null;
       for (const l of this.initialData.values()) {
-        const u = l[e];
-        if (typeof u > "u" || u === null) continue;
-        const f = Array.isArray(u) ? u : [u];
-        for (const c of f)
-          c instanceof Date && ((!n || c < n) && (n = c), (!s || c > s) && (s = c));
+        const o = l[e];
+        if (typeof o > "u" || o === null) continue;
+        const f = Array.isArray(o) ? o : [o];
+        for (const u of f)
+          u instanceof Date && ((!n || u < n) && (n = u), (!s || u > s) && (s = u));
       }
       const a = /* @__PURE__ */ new Date();
       return r || (r = a), i || (i = a), n || (n = a), s || (s = a), {
@@ -5275,38 +5388,38 @@
       const s = this.cacheCtrl.generateContext({ attributeKey: e, query: this.queryBuilder.getQuery(), options: r }), a = this.cacheCtrl.get("facets", s);
       if (a)
         return a;
-      let o = /* @__PURE__ */ new Map();
-      n = this.indicesController.getIndex(e), t ? o = t.getData() : o = this.indicesController.getData(e);
+      let c = /* @__PURE__ */ new Map();
+      n = this.indicesController.getIndex(e), t ? c = t.getData() : c = this.indicesController.getData(e);
       let l = i || this.initialData;
       if (!i) {
-        const c = this.queryBuilder.getQueryAttributeForString(e);
-        if (c.isDeepQuery) {
-          const h = this.queryBuilder.getProjectionForAttributeEntries([c]);
+        const u = this.queryBuilder.getQueryAttributeForString(e);
+        if (u.isDeepQuery) {
+          const h = this.projectionFor([u]);
           l = this.item.getItemsAsMap(l, this.model, {
             projection: h
           });
         }
       }
-      if (!n || !o) {
+      if (!n || !c) {
         this.indicesController.reset(e);
-        const c = S$2.parse(e), h = c.isDeepQuery;
+        const u = S$2.parse(e), h = u.isDeepQuery;
         let d = l;
         if (h) {
-          const g2 = this.queryBuilder.getProjectionForAttributeEntries([c]);
+          const g2 = this.projectionFor([u]);
           d = /* @__PURE__ */ new Map();
           for (const [y2, C2] of l) {
-            const b2 = this.item.getProjectedData(g2, this.model, C2);
-            d.set(y2, b2);
+            const v2 = this.item.getProjectedData(g2, this.model, C2);
+            d.set(y2, v2);
           }
         }
         d.forEach((g2) => {
           let y2;
           h ? (y2 = K$2(g2, e), y2.length === 0 && (y2 = [void 0])) : y2 = [g2[e]], this.indicesController.fillInverseIndex(e, g2.key, y2), this.indicesController.fillDataMap(e, y2);
-        }), n = this.indicesController.getIndex(e), t || (o = this.indicesController.getData(e));
+        }), n = this.indicesController.getIndex(e), t || (c = this.indicesController.getData(e));
       }
       const f = Qu(
         l,
-        o,
+        c,
         r,
         this.queryBuilder.getQuery(),
         e,
@@ -5314,7 +5427,7 @@
         this.queryManager
       );
       return this.cacheCtrl.set("facets", s, f, {
-        models: /* @__PURE__ */ new Set([this.model.key]),
+        models: /* @__PURE__ */ new Set([this.model.key, ...this.pathModels(e)]),
         modelAttributes: /* @__PURE__ */ new Map([[this.model.key, /* @__PURE__ */ new Set([e])]])
       }), f;
     }
@@ -5382,19 +5495,20 @@
       const n = this.queryBuilder.getQuery(), s = this.getProjectionForQuery(n);
       let a;
       if (s) {
-        const o = this.getProjectionCacheKey(n), l = this.getProjectedData(e, s, o), u = this.queryManager.queryData(
-          l,
+        const l = this.getProjectionCacheKey(n), o = this.getProjectedData(e, s, l), f = this.queryManager.queryData(
+          o,
           n,
           t,
           this.indicesController.indexMap
         );
         a = /* @__PURE__ */ new Map();
-        for (const f of u.keys())
-          e.has(f) && a.set(f, e.get(f));
+        for (const u of f.keys())
+          e.has(u) && a.set(u, e.get(u));
       } else
         a = this.queryManager.queryData(e, n, t, this.indicesController.indexMap);
+      const c = s ? this.item.getProjectionModels(s, this.model) : /* @__PURE__ */ new Set();
       return this.cacheCtrl.set("data", r, a, {
-        models: /* @__PURE__ */ new Set([this.model.key]),
+        models: /* @__PURE__ */ new Set([this.model.key, ...c]),
         modelAttributes: /* @__PURE__ */ new Map()
         // Query may reference many attributes, track at model level
       }), a;
@@ -5413,7 +5527,7 @@
       return this.filterItems.has(e) && (t?.skipProcessing || this.updateFilterItem(e, t)), this.filterItems.get(e);
     }
   };
-  let z$3 = class z {
+  let L$2 = class L {
     constructor(e, t) {
       this.modelParser = e, this.scriptController = t;
     }
@@ -5426,10 +5540,10 @@
     getManyItems(e, t, r, i) {
       const n = [];
       for (const s of e) {
-        const a = i?.projection || { $: true }, o = t.get(s);
-        if (!o)
+        const a = i?.projection || { $: true }, c = t.get(s);
+        if (!c)
           continue;
-        const l = this.getProjectedData(a, r, o);
+        const l = this.getProjectedData(a, r, c);
         n.push(l);
       }
       return n;
@@ -5455,15 +5569,15 @@
       );
     }
     getSortedItems(e, t, r) {
-      const i = [...t.sort.attributes], n = Array.from(e.values()), s = (u, f, c) => {
-        const h = u[f];
-        return typeof h > "u" || h === null ? c : typeof h == "string" ? h.toLowerCase() : typeof h == "object" && typeof h?.key == "string" ? h.key.toLowerCase() : h;
-      }, a = i.map((u, f) => (c) => {
-        const h = t.sort.order.at(f), d = this.getUndefinedValueForSorting(u, h, r);
-        return s(c, u, d);
-      }), o = [...t.sort.order].map((u) => u.toLowerCase()), l = Ou(n, [...a], o);
+      const i = [...t.sort.attributes], n = Array.from(e.values()), s = (o, f, u) => {
+        const h = o[f];
+        return typeof h > "u" || h === null ? u : typeof h == "string" ? h.toLowerCase() : typeof h == "object" && typeof h?.key == "string" ? h.key.toLowerCase() : h;
+      }, a = i.map((o, f) => (u) => {
+        const h = t.sort.order.at(f), d = this.getUndefinedValueForSorting(o, h, r);
+        return s(u, o, d);
+      }), c = [...t.sort.order].map((o) => o.toLowerCase()), l = Ou(n, [...a], c);
       return new Map(
-        l.map((u) => [u.key, u])
+        l.map((o) => [o.key, o])
       );
     }
     getUndefinedValueForSorting(e, t, r) {
@@ -5490,18 +5604,18 @@
       const s = e.entries(), a = /* @__PURE__ */ new Map();
       if (t === 0 && r === e.size && i?.$ === true && Object.keys(i).length === 1)
         return e;
-      for (let o = 0; o < t + r; o++) {
-        if (o < t) {
+      for (let c = 0; c < t + r; c++) {
+        if (c < t) {
           s.next();
           continue;
         }
-        if (o > t + r)
+        if (c > t + r)
           break;
         const l = s.next().value;
         if (l)
           if (n && i && this.isValidProjection(i)) {
-            const u = this.getProjectedData(i, n, l[1]);
-            a.set(l[0], u);
+            const o = this.getProjectedData(i, n, l[1]);
+            a.set(l[0], o);
           } else
             a.set(l[0], l[1]);
       }
@@ -5529,24 +5643,24 @@
           return;
         }
         if (typeof a == "object") {
-          const o = t.references.get(s);
-          if (o) {
-            const l = this.modelParser.models.get(o.model);
+          const c = t.references.get(s);
+          if (c) {
+            const l = this.modelParser.models.get(c.model);
             if (l) {
-              if (o.type === "multiValued") {
-                const u = r[s] || [];
-                i[s] = u.map((f) => {
-                  const c = typeof f == "string" ? f : f.key, h = l.getEntry(c);
-                  return h ? this.getProjectedData(a, l, h) : this.modelParser.initOptions.referenceMetadata?.enabled ? { key: c, _dcupl_ref_: "miss" } : null;
+              if (c.type === "multiValued") {
+                const o = r[s] || [];
+                i[s] = o.map((f) => {
+                  const u = typeof f == "string" ? f : f.key, h = l.getEntry(u);
+                  return h ? this.getProjectedData(a, l, h) : this.modelParser.initOptions.referenceMetadata?.enabled ? { key: u, _dcupl_ref_: "miss" } : null;
                 }).filter(Boolean);
-              } else if (o.type === "singleValued") {
-                const u = r[s];
-                if (u) {
-                  const f = typeof u == "string" ? u : u.key, c = l?.getEntry(f);
-                  c ? i[s] = this.getProjectedData(
+              } else if (c.type === "singleValued") {
+                const o = r[s];
+                if (o) {
+                  const f = typeof o == "string" ? o : o.key, u = l?.getEntry(f);
+                  u ? i[s] = this.getProjectedData(
                     a,
                     l,
-                    c
+                    u
                   ) : this.modelParser.initOptions.referenceMetadata?.enabled ? i[s] = { key: f, _dcupl_ref_: "miss" } : delete i[s];
                 }
               }
@@ -5555,18 +5669,42 @@
         }
       }), i;
     }
+    /**
+     * The models a projection reads through: for every nested projection key
+     * that is a reference of `model`, the referenced model, recursively (the
+     * same walk {@link getProjectedData} takes). A list that projects
+     * `{ memberships: { user: { daysInactive: true } } }` on `project` reads
+     * `membership` and `user`, so a change on either can change its result
+     * (#284). Keys that are no reference (properties, `$`/`$$`, array indices)
+     * contribute nothing; the root model itself is not included.
+     */
+    getProjectionModels(e, t, r = /* @__PURE__ */ new Set()) {
+      if (!e || typeof e != "object")
+        return r;
+      for (const [i, n] of Object.entries(e)) {
+        if (i === "$" || i === "$$" || typeof n != "object" || n === null)
+          continue;
+        const s = t.references.get(i);
+        if (!s)
+          continue;
+        r.add(s.model);
+        const a = this.modelParser.models.get(s.model);
+        a && this.getProjectionModels(n, a, r);
+      }
+      return r;
+    }
   };
-  var K$1 = Object.defineProperty, $$1 = Object.getOwnPropertyDescriptor, D$2 = (A2, e, t, r) => {
-    for (var i = $$1(e, t), n = A2.length - 1, s; n >= 0; n--)
-      (s = A2[n]) && (i = s(e, t, i) || i);
-    return i && K$1(e, t, i), i;
+  var z$3 = Object.defineProperty, K$1 = Object.getOwnPropertyDescriptor, D$3 = (M2, e, t, r) => {
+    for (var i = K$1(e, t), n = M2.length - 1, s; n >= 0; n--)
+      (s = M2[n]) && (i = s(e, t, i) || i);
+    return i && z$3(e, t, i), i;
   };
   let p$2 = class p {
     constructor(e, t, r) {
-      this.dcuplApi = e, this.cdRef = t, this.indicesController = r, this.itemService = new z$3(
+      this.dcuplApi = e, this.cdRef = t, this.indicesController = r, this.itemService = new L$2(
         this.dcuplApi.modelParser,
         this.dcuplApi.scriptController
-      ), this.filter = new L$2(
+      ), this.filter = new $$1(
         this.dcuplApi.modelParser,
         this.cdRef,
         this.itemService,
@@ -5639,8 +5777,9 @@
        */
       addCondition: (e, t) => this.applyQuery(e, { mode: "add", skipProcessing: t?.skipProcessing }),
       /**
-       * Replace query with new condition(s).
-       * Accepts single condition or array of conditions.
+       * Replace the conditions of an attribute group with new condition(s).
+       * Accepts single condition or array of conditions. Each condition replaces the
+       * conditions of the group keyed by its attribute; other groups are kept.
        * Clearer alternative to `apply(condition, { mode: 'set' })`.
        *
        * @param condition - Single query condition or array of conditions to set
@@ -5688,7 +5827,11 @@
        */
       addGroup: (e, t) => this.applyQuery(e, { mode: "add", skipProcessing: t?.skipProcessing }),
       /**
-       * Replace query with a new group.
+       * Replace one query group by key (per-group `set`).
+       * The group with the same `groupKey` is replaced; other groups and the query options
+       * are kept. Only `apply({ groupKey: 'root', ... }, { mode: 'set' })` replaces the whole
+       * query. A keyed group passed inside a keyless wrapper group stays nested there and is
+       * still found by `groupKey` by `removeGroup` and `fn.facets` (#294).
        *
        * @param group - Query group to set
        * @param options - Optional processing options
@@ -5987,7 +6130,7 @@
       else if (e.relevantData === "filtered")
         s = this.filter.filteredData, a = this.filter.queryBuilder.getQuery();
       else if (e.relevantData === "excludeQuery" && e.excludeQuery) {
-        const f = new ir$1();
+        const f = new or$1();
         f.init(this.filter.queryBuilder.getQuery()), f.removeQuery(e.excludeQuery), a = f.getQuery(), s = this.dcuplApi.queryManager.queryData(
           this.filter.initialData,
           a,
@@ -5996,19 +6139,19 @@
         );
       } else
         s = this.filter.filteredData, a = this.filter.queryBuilder.getQuery();
-      let o = s;
+      let c = s;
       if (i) {
-        const f = S$2.parse(e.attribute), c = this.filter.queryBuilder.getProjectionForAttributeEntries([f]), h = /* @__PURE__ */ new Map();
+        const f = S$2.parse(e.attribute), u = this.filter.projectionFor([f]), h = /* @__PURE__ */ new Map();
         for (const [d, g2] of s) {
-          const y2 = this.filter.item.getProjectedData(c, this.model, g2);
+          const y2 = this.filter.item.getProjectedData(u, this.model, g2);
           h.set(d, y2);
         }
-        o = h;
+        c = h;
       }
-      const l = this.filter.indicesController.getOrCreateIndex(e.attribute, o, {
+      const l = this.filter.indicesController.getOrCreateIndex(e.attribute, c, {
         query: a
-      }), u = Du(o, l, e, this.dcuplApi.queryManager);
-      return this.filter.cacheCtrl.set("suggestions", t, u), u;
+      }), o = Iu(c, l, e, this.dcuplApi.queryManager);
+      return this.filter.cacheCtrl.set("suggestions", t, o), o;
     }
     _getFacets(e) {
       const t = this.filter.cacheCtrl.generateContext({
@@ -6055,12 +6198,12 @@
       const i = S$2.parse(e.attribute);
       let n = this.filter.filteredData;
       if (i.isDeepQuery) {
-        const a = this.filter.queryBuilder.getProjectionForAttributeEntries([i]), o = /* @__PURE__ */ new Map();
-        for (const [l, u] of this.filter.filteredData) {
-          const f = this.filter.item.getProjectedData(a, this.model, u);
-          o.set(l, f);
+        const a = this.filter.projectionFor([i]), c = /* @__PURE__ */ new Map();
+        for (const [l, o] of this.filter.filteredData) {
+          const f = this.filter.item.getProjectedData(a, this.model, o);
+          c.set(l, f);
         }
-        n = o;
+        n = c;
       }
       const s = this.filter.getAggregate(
         e,
@@ -6091,19 +6234,19 @@
       ].map((l) => S$2.parse(l)).filter((l) => l.isDeepQuery);
       let a;
       if (s.length > 0) {
-        const l = this.filter.queryBuilder.getProjectionForAttributeEntries(s);
+        const l = this.filter.projectionFor(s);
         a = /* @__PURE__ */ new Map();
-        for (const [u, f] of this.filter.filteredData) {
-          const c = this.filter.item.getProjectedData(l, this.model, f);
-          a.set(u, c);
+        for (const [o, f] of this.filter.filteredData) {
+          const u = this.filter.item.getProjectedData(l, this.model, f);
+          a.set(o, u);
         }
       }
-      const o = or$1(this.filter.filteredData, e, { key: "root" }, "root", i, a);
-      return this.filter.cacheCtrl.set("pivot", t, o), o;
+      const c = ir$1(this.filter.filteredData, e, { key: "root" }, "root", i, a);
+      return this.filter.cacheCtrl.set("pivot", t, c), c;
     }
   };
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "fn_metadata",
       cloneResult: true,
@@ -6111,8 +6254,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "_getMetadata");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "filter_many",
       cloneResult: true,
@@ -6120,8 +6263,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "_getFilters");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "filter_one",
       cloneResult: true,
@@ -6129,21 +6272,21 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "_getFilter");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "query_get",
       cloneResult: true
     })
   ], p$2.prototype, "getQuery");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "query_has"
     })
   ], p$2.prototype, "hasGroupOrQueryKey");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "query_apply",
       cloneResult: true,
@@ -6151,8 +6294,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "applyQuery");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "query_apply_options",
       cloneResult: true,
@@ -6160,8 +6303,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "applyOptions");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "query_remove",
       cloneResult: true,
@@ -6169,8 +6312,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "removeQuery");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "query_reset",
       cloneResult: true,
@@ -6178,8 +6321,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "resetQuery");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "query_execute",
       cloneResult: true,
@@ -6187,8 +6330,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "executeQuery");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "fn_groupBy",
       cloneResult: true,
@@ -6196,8 +6339,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "_getSections");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "query_one",
       cloneResult: true,
@@ -6205,8 +6348,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "_getItem");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "query_many",
       cloneResult: true,
@@ -6214,8 +6357,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "_getManyItems");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "fn_suggest",
       cloneResult: true,
@@ -6223,8 +6366,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "_getSuggestions");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "fn_facets",
       cloneResult: true,
@@ -6232,8 +6375,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "_getFacets");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "fn_aggregate",
       cloneResult: true,
@@ -6241,8 +6384,8 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "getAggregate");
-  D$2([
-    Iu({
+  D$3([
+    Du({
       scope: "list",
       type: "fn_pivot",
       cloneResult: true,
@@ -6250,7 +6393,7 @@
       connectMessageResult: true
     })
   ], p$2.prototype, "_getPivot");
-  let N$3 = class N extends p$2 {
+  let N$2 = class N extends p$2 {
     constructor(e, t, r) {
       super(e, t, r), this.dcuplApi = e, this.cdRef = t, this.indicesController = r;
     }
@@ -6281,12 +6424,12 @@
     return t;
   }
   function Ce$1(d, e, t) {
-    if (!E$3(t))
+    if (!E$4(t))
       return false;
     var s = typeof e;
-    return (s == "number" ? G$1(t) && $t$1(e, t.length) : s == "string" && e in t) ? Ce$2(t[e], d) : false;
+    return (s == "number" ? k$1(t) && Mt$1(e, t.length) : s == "string" && e in t) ? Ce$2(t[e], d) : false;
   }
-  function Ee$1(d) {
+  function Me$1(d) {
     return pn$1(function(e, t) {
       var s = -1, r = t.length, i = r > 1 ? t[r - 1] : void 0, o = r > 2 ? t[2] : void 0;
       for (i = d.length > 3 && typeof i == "function" ? (r--, i) : void 0, o && Ce$1(t[0], t[1], o) && (i = r < 3 ? void 0 : i, r = 1), e = Object(e); ++s < r; ) {
@@ -6296,7 +6439,7 @@
       return e;
     });
   }
-  function Me$1(d) {
+  function Ee$1(d) {
     var e = [];
     if (d != null)
       for (var t in Object(d))
@@ -6304,20 +6447,20 @@
     return e;
   }
   var Se$1 = Object.prototype, Ie$1 = Se$1.hasOwnProperty;
-  function Ge$1(d) {
-    if (!E$3(d))
-      return Me$1(d);
+  function Ge$2(d) {
+    if (!E$4(d))
+      return Ee$1(d);
     var e = _t$1(d), t = [];
     for (var s in d)
       s == "constructor" && (e || !Ie$1.call(d, s)) || t.push(s);
     return t;
   }
-  function Q$3(d) {
-    return G$1(d) ? Xn$1(d, true) : Ge$1(d);
+  function Q$2(d) {
+    return k$1(d) ? Xn$1(d, true) : Ge$2(d);
   }
   var xe$1 = "[object Object]", Te$1 = Function.prototype, Ke$1 = Object.prototype, z$2 = Te$1.toString, _e$1 = Ke$1.hasOwnProperty, we$1 = z$2.call(Object);
   function $e$1(d) {
-    if (!O$2(d) || N$4(d) != xe$1)
+    if (!O$2(d) || N$3(d) != xe$1)
       return false;
     var e = Ks$1(d);
     if (e === null)
@@ -6332,14 +6475,14 @@
     }
     return s;
   }
-  function qe$2(d, e, t, s) {
+  function qe$1(d, e, t, s) {
     return Wt$1(d, function(r, i, o) {
       e(s, r, t(r), o);
     }), s;
   }
   function Oe$2(d, e) {
     return function(t, s) {
-      var r = v$2(t) ? Fe$1 : qe$2, i = {};
+      var r = v$2(t) ? Fe$1 : qe$1, i = {};
       return r(t, d, Y$3(s), i);
     };
   }
@@ -6351,7 +6494,7 @@
       return d[e];
   }
   function Ue$1(d) {
-    return De$1(d, Q$3(d));
+    return De$1(d, Q$2(d));
   }
   function Ve$1(d, e, t, s, r, i, o) {
     var n = T$1(d, t), a = T$1(e, t), l = o.get(a);
@@ -6361,28 +6504,28 @@
     }
     var c = i ? i(n, a, t + "", d, e, o) : void 0, f = c === void 0;
     if (f) {
-      var u = v$2(a), y2 = !u && oe$1(a), h = !u && !y2 && Et$1(a);
-      c = a, u || y2 || h ? v$2(n) ? c = n : ye(n) ? c = Ae$1(n) : y2 ? (f = false, c = ei(a, true)) : h ? (f = false, c = wi(a, true)) : c = [] : $e$1(a) || De$2(a) ? (c = n, De$2(n) ? c = Ue$1(n) : (!E$3(n) || Ot$1(n)) && (c = ki(a))) : f = false;
+      var u = v$2(a), y2 = !u && ie$1(a), h = !u && !y2 && Et$1(a);
+      c = a, u || y2 || h ? v$2(n) ? c = n : ye(n) ? c = Ae$1(n) : y2 ? (f = false, c = eo$1(a, true)) : h ? (f = false, c = Ao$1(a, true)) : c = [] : $e$1(a) || Ie$2(a) ? (c = n, Ie$2(n) ? c = Ue$1(n) : (!E$4(n) || Ot$1(n)) && (c = ko$1(a))) : f = false;
     }
     f && (o.set(a, c), r(c, a, s, i, o), o.delete(a)), x$1(d, t, c);
   }
   function L$1(d, e, t, s, r) {
     d !== e && ua(e, function(i, o) {
-      if (r || (r = new T$2()), E$3(i))
+      if (r || (r = new T$2()), E$4(i))
         Ve$1(d, e, o, t, L$1, s, r);
       else {
         var n = s ? s(T$1(d, o), i, o + "", d, e, r) : void 0;
         n === void 0 && (n = i), x$1(d, o, n);
       }
-    }, Q$3);
+    }, Q$2);
   }
-  var Be = Object.prototype, Ne$1 = Be.hasOwnProperty, We$1 = Oe$2(function(d, e, t) {
-    Ne$1.call(d, t) ? d[t].push(e) : cn$1(d, t, [e]);
+  var Ne$1 = Object.prototype, Be = Ne$1.hasOwnProperty, We$1 = Oe$2(function(d, e, t) {
+    Be.call(d, t) ? d[t].push(e) : cn$1(d, t, [e]);
   }), Qe$1 = "[object Boolean]";
   function ze$1(d) {
-    return d === true || d === false || O$2(d) && N$4(d) == Qe$1;
+    return d === true || d === false || O$2(d) && N$3(d) == Qe$1;
   }
-  var O$1 = Ee$1(function(d, e, t) {
+  var O$1 = Me$1(function(d, e, t) {
     L$1(d, e, t);
   });
   const p$1 = (d, e, t) => ({
@@ -6584,7 +6727,7 @@
   function j$1(d, e, t = v$1) {
     return typeof e == "string" ? String(d[e]) : e.length === 1 ? String(d[e[0]]) : e.map((s) => String(d[s])).join(t);
   }
-  function M$1(d, e = v$1) {
+  function E$3(d, e = v$1) {
     if (d !== void 0)
       return typeof d == "string" ? d : d.join(e);
   }
@@ -7088,7 +7231,7 @@
       r && r.sourceColumns.length > 0 && this.emitUnknownColumnErrors(e, r.sourceColumns, t, s, i);
       for (let o of e.data) {
         if (o.key === void 0 || o.key === null) {
-          const l = e.keyProperty ?? this.keyProperty, c = e.keyPropertySeparator ?? this.keyPropertySeparator ?? v$1, f = M$1(l, c);
+          const l = e.keyProperty ?? this.keyProperty, c = e.keyPropertySeparator ?? this.keyPropertySeparator ?? v$1, f = E$3(l, c);
           this.setError({
             title: "Missing Key",
             type: "model",
@@ -7106,7 +7249,7 @@
             key: String(o.key)
           };
         else if (e.type === "set") {
-          const l = e.keyProperty ?? this.keyProperty, c = e.keyPropertySeparator ?? this.keyPropertySeparator ?? v$1, f = M$1(l, c), u = String(o.key);
+          const l = e.keyProperty ?? this.keyProperty, c = e.keyPropertySeparator ?? this.keyPropertySeparator ?? v$1, f = E$3(l, c), u = String(o.key);
           this.setError({
             title: "Non Unique Key",
             type: "model",
@@ -7190,7 +7333,7 @@
         const r = JSON.stringify(s.query);
         for (let i of e.data) {
           let o = this.data.get(String(i.key));
-          const n = Pu(r, { ...i }), a = JSON.parse(n), l = new ir$1();
+          const n = Pu(r, { ...i }), a = JSON.parse(n), l = new or$1();
           l.init({ modelKey: s.model }), l.applyQuery(a, { mode: "set" }), a.projection || l.applyOptions({ projection: { $: false } });
           const c = l.getQuery();
           if (c.queries.length > 0) {
@@ -7645,7 +7788,7 @@
       const s = this.getBasicProperties().filter((o) => t.has(o.key)), r = this.getBasicReferences().filter((o) => t.has(o.key)), i = this.modelParser.qualityController.dcupl?.getContainerSourceMetadata(e)?.origin ?? "inline";
       for (let o of e.data) {
         if (o.key === void 0 || o.key === null) {
-          const l = e.keyProperty ?? this.keyProperty, c = e.keyPropertySeparator ?? this.keyPropertySeparator ?? v$1, f = M$1(l, c);
+          const l = e.keyProperty ?? this.keyProperty, c = e.keyPropertySeparator ?? this.keyPropertySeparator ?? v$1, f = E$3(l, c);
           this.setError({
             title: "Missing Key",
             type: "model",
@@ -7738,7 +7881,7 @@
           for (let o of e.data) {
             let n = this.data.get(String(o.key));
             if (!n) continue;
-            const a = Pu(i, { ...o }), l = JSON.parse(a), c = new ir$1();
+            const a = Pu(i, { ...o }), l = JSON.parse(a), c = new or$1();
             c.init({ modelKey: r.model }), c.applyQuery(l, { mode: "set" }), l.projection || c.applyOptions({ projection: { $: false } });
             const f = c.getQuery();
             if (f.queries.length > 0) {
@@ -8137,7 +8280,7 @@
       (o = d[i]) && (r = o(e, t, r) || r);
     return r && ct$2(e, t, r), r;
   };
-  let E$2 = class E {
+  let M$2 = class M {
     constructor(e, t, s) {
       this.cdRef = e, this.qualityController = t, this.dcuplInstance = s, this.qualityController.modelParser = this;
     }
@@ -8214,7 +8357,7 @@ Models cannot have circular references as this leads to unpredictable behavior d
      * This enables partial updates by tracking which attributes depend on others.
      */
     buildAttributeDependencyGraph() {
-      this.attributeDependencyGraph = new $u(), this.models.forEach((e) => {
+      this.attributeDependencyGraph = new Mu(), this.models.forEach((e) => {
         const t = e.key;
         e.properties.forEach((s, r) => {
           if (s.expression)
@@ -9067,62 +9210,62 @@ These attributes will default to Step 1 processing which may be incorrect. This
     }
   };
   C$1([
-    Iu({
+    Du({
       scope: "global",
       type: "model_add",
       connectMessage: true
     })
-  ], E$2.prototype, "addModel");
+  ], M$2.prototype, "addModel");
   C$1([
-    Iu({
+    Du({
       scope: "global",
       type: "data_change",
       connectMessage: true
     })
-  ], E$2.prototype, "addData");
+  ], M$2.prototype, "addData");
   C$1([
-    Iu({
+    Du({
       scope: "global",
       type: "view_add",
       connectMessage: true
     })
-  ], E$2.prototype, "addView");
+  ], M$2.prototype, "addView");
   C$1([
-    Iu({
+    Du({
       scope: "global",
       type: "dcupl_handle_datacontainer"
     })
-  ], E$2.prototype, "handleDataContainer");
-  function z$1(n, e, t) {
-    return n === n && (t !== void 0 && (n = n <= t ? n : t), n = n >= e ? n : e), n;
+  ], M$2.prototype, "handleDataContainer");
+  function z$1(l, e, t) {
+    return l === l && (t !== void 0 && (l = l <= t ? l : t), l = l >= e ? l : e), l;
   }
-  function B$2(n, e, t) {
-    n = Ns$1(n), e = Tt(e);
-    var r = n.length;
+  function B$2(l, e, t) {
+    l = Ns$1(l), e = Tt(e);
+    var r = l.length;
     t = t === void 0 ? r : z$1(Cr$1(t), 0, r);
     var s = t;
-    return t -= e.length, t >= 0 && n.slice(t, s) == e;
+    return t -= e.length, t >= 0 && l.slice(t, s) == e;
   }
-  function W$1(n, e) {
+  function W$1(l, e) {
     return z$4(e, function(t) {
-      return n[t];
+      return l[t];
     });
   }
-  function Q$2(n) {
-    return n == null ? [] : W$1(n, ce$1(n));
+  function Q$1(l) {
+    return l == null ? [] : W$1(l, ce$1(l));
   }
   var j = Math.max;
-  function N$2(n, e, t, r) {
-    n = G$1(n) ? n : Q$2(n), t = t ? Cr$1(t) : 0;
-    var s = n.length;
-    return t < 0 && (t = j(s + t, 0)), Aa(n) ? t <= s && n.indexOf(e, t) > -1 : !!s && sn$1(n, e, t) > -1;
-  }
-  var H = Object.defineProperty, J = Object.getOwnPropertyDescriptor, C = (n, e, t, r) => {
-    for (var s = J(e, t), o = n.length - 1, i; o >= 0; o--)
-      (i = n[o]) && (s = i(e, t, s) || s);
+  function N$1(l, e, t, r) {
+    l = k$1(l) ? l : Q$1(l), t = t ? Cr$1(t) : 0;
+    var s = l.length;
+    return t < 0 && (t = j(s + t, 0)), Aa(l) ? t <= s && l.indexOf(e, t) > -1 : !!s && sn$1(l, e, t) > -1;
+  }
+  var H = Object.defineProperty, J = Object.getOwnPropertyDescriptor, C = (l, e, t, r) => {
+    for (var s = J(e, t), o = l.length - 1, i; o >= 0; o--)
+      (i = l[o]) && (s = i(e, t, s) || s);
     return s && H(e, t, s), s;
   };
-  let E$1 = class E {
+  let E$2 = class E {
     constructor(e, t) {
       this.dcuplApi = e, this.cdRef = t;
     }
@@ -9143,7 +9286,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
       if (!t)
         throw new Error(`Model with key ${e.modelKey} not found`);
       const r = this.getListItemKeys(e), s = this.getRelevantData(t, r), o = this.initIndicesController(r, t, s);
-      this.catalog ? this.catalog.filter.update(t, s, o) : (this.catalog = new N$3(this.dcuplApi, this.cdRef, o), this.catalog.init(this.modelKey, t, s));
+      this.catalog ? this.catalog.filter.update(t, s, o) : (this.catalog = new N$2(this.dcuplApi, this.cdRef, o), this.catalog.init(this.modelKey, t, s));
     }
     initIndicesController(e, t, r) {
       let s;
@@ -9210,6 +9353,15 @@ These attributes will default to Step 1 processing which may be incorrect. This
     invalidate() {
       this.catalog && (this.ownsIndicesController && this.catalog.filter.indicesController.reset(), this.catalog.filter.resetCache());
     }
+    /**
+     * The models other than this list's own that its cached results were read
+     * through (dotted paths in its query, facets, aggregates, …). dcupl.update()
+     * treats the list as affected when any of them changes (#284).
+     * @internal
+     */
+    getDependencyModels() {
+      return this.catalog ? this.catalog.filter.getDependencyModels() : /* @__PURE__ */ new Set();
+    }
     /**
      * Emits `result_updated` for this list. dcupl.update() calls it once per
      * affected list, after every affected list has been refreshed, so a
@@ -9237,26 +9389,26 @@ These attributes will default to Step 1 processing which may be incorrect. This
     }
   };
   C([
-    Iu({
+    Du({
       scope: "list",
       type: "list_destroyed",
       connectMessage: true
     })
-  ], E$1.prototype, "_destroy");
+  ], E$2.prototype, "_destroy");
   C([
-    Iu({
+    Du({
       scope: "list",
       type: "list_updated",
       action: "update",
       connectMessage: true
     })
-  ], E$1.prototype, "update");
-  var Z$2 = Object.defineProperty, Y$2 = Object.getOwnPropertyDescriptor, X$1 = (n, e, t, r) => {
-    for (var s = Y$2(e, t), o = n.length - 1, i; o >= 0; o--)
-      (i = n[o]) && (s = i(e, t, s) || s);
+  ], E$2.prototype, "update");
+  var Z$2 = Object.defineProperty, Y$2 = Object.getOwnPropertyDescriptor, X$1 = (l, e, t, r) => {
+    for (var s = Y$2(e, t), o = l.length - 1, i; o >= 0; o--)
+      (i = l[o]) && (s = i(e, t, s) || s);
     return s && Z$2(e, t, s), s;
   };
-  class P {
+  let D$2 = class D {
     constructor(e, t) {
       this.dcuplInstance = e, this.cdRef = t;
     }
@@ -9287,17 +9439,17 @@ These attributes will default to Step 1 processing which may be incorrect. This
         dcuplInitOptions: this.dcuplInstance.initOptions,
         analyticsController: this.dcuplInstance.analyticsController
       });
-      const r = new E$1(this.dcuplInstance, t);
+      const r = new E$2(this.dcuplInstance, t);
       return r.init(e), this.lists.push(r), r;
     }
-  }
+  };
   X$1([
-    Iu({
+    Du({
       scope: "global",
       type: "list_created",
       connectMessage: true
     })
-  ], P.prototype, "create");
+  ], D$2.prototype, "create");
   let ee$2 = class ee {
     constructor(e) {
       this.scriptsController = e;
@@ -9475,50 +9627,50 @@ These attributes will default to Step 1 processing which may be incorrect. This
       if (r) {
         const o = r.coercionFailureSamples ?? {};
         for (const i of Object.keys(o)) {
-          const l = o[i];
-          if (!l || l.count <= 0)
+          const a = o[i];
+          if (!a || a.count <= 0)
             continue;
           for (const d of this.getModelErrors(s))
             d.attribute === i && d.itemKey != null && (d.errorType === "UndefinedValue" || d.errorType === "WrongDataType") && this.removeError(d.key);
-          const a = e.properties.get(i)?.type ?? l.expected;
-          this.setError(this.buildColumnCoercionError(s, i, l.rawValue, a, l.count));
+          const n = e.properties.get(i)?.type ?? a.expected;
+          this.setError(this.buildColumnCoercionError(s, i, a.rawValue, n, a.count));
         }
         for (const [i] of e.properties) {
           if (o[i] || r.sourceColumns.includes(i))
             continue;
-          const l = this.getGroupCount(s, i, "UndefinedValue");
-          if (l > 0 && l === t.data.length) {
-            for (const a of this.getModelErrors(s))
-              a.attribute === i && a.itemKey != null && a.errorType === "UndefinedValue" && this.removeError(a.key);
+          const a = this.getGroupCount(s, i, "UndefinedValue");
+          if (a > 0 && a === t.data.length) {
+            for (const n of this.getModelErrors(s))
+              n.attribute === i && n.itemKey != null && n.errorType === "UndefinedValue" && this.removeError(n.key);
             this.setError(this.buildAbsentColumnError(s, i));
           }
         }
       } else {
         const o = new Set(
-          this.getModelErrors(s).filter((a) => a.errorType === "UndefinedValue" && a.attribute != null).map((a) => a.attribute)
+          this.getModelErrors(s).filter((n) => n.errorType === "UndefinedValue" && n.attribute != null).map((n) => n.attribute)
         );
-        for (const a of o) {
-          const d = this.getGroupCount(s, a, "UndefinedValue");
+        for (const n of o) {
+          const d = this.getGroupCount(s, n, "UndefinedValue");
           if (d > 0 && d === t.data.length) {
             for (const u of this.getModelErrors(s))
-              u.attribute === a && u.itemKey != null && u.errorType === "UndefinedValue" && this.removeError(u.key);
-            this.setError(this.buildAbsentColumnError(s, a));
+              u.attribute === n && u.itemKey != null && u.errorType === "UndefinedValue" && this.removeError(u.key);
+            this.setError(this.buildAbsentColumnError(s, n));
           }
         }
         const i = this.getModelErrors(s).filter(
-          (a) => a.errorType === "WrongDataType" && a.errorGroup === "PropertyDataError" && a.title === "Wrong Data Type" && a.itemKey != null
-        ), l = We$1(i, "attribute");
-        for (const a in l) {
-          const d = l[a];
+          (n) => n.errorType === "WrongDataType" && n.errorGroup === "PropertyDataError" && n.title === "Wrong Data Type" && n.itemKey != null
+        ), a = We$1(i, "attribute");
+        for (const n in a) {
+          const d = a[n];
           if (!d?.length)
             continue;
-          const u = d[0].meta, h = e.properties.get(a)?.type ?? u?.expected ?? "unknown";
+          const u = d[0].meta, h = e.properties.get(n)?.type ?? u?.expected ?? "unknown";
           for (const f of d)
             this.removeError(f.key);
           this.setError(
             this.buildColumnCoercionError(
               s,
-              a,
+              n,
               String(u?.rawValue ?? ""),
               h,
               d.length
@@ -9569,8 +9721,8 @@ These attributes will default to Step 1 processing which may be incorrect. This
     cleanUpErrorsForItems(e, t, r, s) {
       let o, i;
       typeof r == "string" ? i = r : r instanceof Set && (o = r, i = s);
-      const l = this.getModelErrors(e.key), a = i ? l.filter((d) => d.errorType === i) : l;
-      for (const d of a)
+      const a = this.getModelErrors(e.key), n = i ? a.filter((d) => d.errorType === i) : a;
+      for (const d of n)
         if (d.itemKey && t.has(d.itemKey)) {
           if (o && d.attribute && !o.has(d.attribute))
             continue;
@@ -9597,16 +9749,16 @@ These attributes will default to Step 1 processing which may be incorrect. This
       if (!e)
         return [];
       const s = [], o = e.getData(), i = e.getAttributes();
-      for (const l of i) {
-        if (!r.has(l.key))
+      for (const a of i) {
+        if (!r.has(a.key))
           continue;
-        const a = l.quality?.validators;
-        if (a)
+        const n = a.quality?.validators;
+        if (n)
           for (const d of t) {
             const u = o.get(d);
             if (!u)
               continue;
-            const h = u[l.key], f = this.validateAttribute(h, a, l.key);
+            const h = u[a.key], f = this.validateAttribute(h, n, a.key);
             for (const g2 of f)
               g2.model = e.key, g2.itemKey = u.key, s.push(g2);
           }
@@ -9825,10 +9977,10 @@ These attributes will default to Step 1 processing which may be incorrect. This
         const o = this.dcupl.modelParser.models.get(s);
         if (!o)
           return;
-        const i = o?.getBasicProperties() || [], l = o?.getBasicReferences() || [], a = i.length + l.length;
-        t += a;
+        const i = o?.getBasicProperties() || [], a = o?.getBasicReferences() || [], n = i.length + a.length;
+        t += n;
         const u = o.data?.size || 0;
-        e += u, r += a * u;
+        e += u, r += n * u;
       }), this.values.counts.rows = e, this.values.counts.attributes = t, this.values.counts.dataEntries = r;
     }
     calculateTiming() {
@@ -9869,16 +10021,16 @@ These attributes will default to Step 1 processing which may be incorrect. This
     calculateSizesForModels() {
       const t = this.dcupl.analyticsController.getByType("resource").filter((o) => o.value?.type === "data"), r = We$1(t, (o) => o.value?.model);
       return Object.keys(r).map((o) => {
-        const i = r[o]?.reduce((a, d) => {
+        const i = r[o]?.reduce((n, d) => {
           const u = d.value.encodedBodySize;
-          return a + u;
-        }, 0), l = r[o]?.reduce((a, d) => {
+          return n + u;
+        }, 0), a = r[o]?.reduce((n, d) => {
           const u = d.value.decodedBodySize;
-          return a + u;
+          return n + u;
         }, 0);
         return {
           model: o,
-          decodedBodySize: l,
+          decodedBodySize: a,
           encodedBodySize: i
         };
       });
@@ -9887,7 +10039,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
       const e = this.dcupl.models.keys();
       let t = 0;
       return e.forEach((r) => {
-        const s = this.dcupl.modelParser.unprocessedData.find((l) => l.model === r)?.data || [], o = this.getUnusedAttributesFromModel(this.dcupl, r);
+        const s = this.dcupl.modelParser.unprocessedData.find((a) => a.model === r)?.data || [], o = this.getUnusedAttributesFromModel(this.dcupl, r);
         if (!o.length)
           return;
         const i = this.getDataWithAttributes(s, o);
@@ -9903,10 +10055,10 @@ These attributes will default to Step 1 processing which may be incorrect. This
       });
     }
     getUnusedAttributesFromModel(e, t) {
-      const r = e.modelParser.models.get(t), s = r?.getBasicProperties() || [], o = r?.getBasicReferences() || [], i = r?.keyProperty, l = [...s, ...o].map((d) => d.key);
-      typeof i == "string" ? l.push(i) : Array.isArray(i) ? l.push(...i) : l.push("key"), l.push("key");
-      const a = e.modelParser.unprocessedData.find((d) => d.model === t)?.data || [];
-      return this.getUnusedAttributes(a, l);
+      const r = e.modelParser.models.get(t), s = r?.getBasicProperties() || [], o = r?.getBasicReferences() || [], i = r?.keyProperty, a = [...s, ...o].map((d) => d.key);
+      typeof i == "string" ? a.push(i) : Array.isArray(i) ? a.push(...i) : a.push("key"), a.push("key");
+      const n = e.modelParser.unprocessedData.find((d) => d.model === t)?.data || [];
+      return this.getUnusedAttributes(n, a);
     }
     getUnusedAttributes(e, t) {
       const r = /* @__PURE__ */ new Set();
@@ -9967,16 +10119,16 @@ These attributes will default to Step 1 processing which may be incorrect. This
       for (const o of t) {
         const i = o.quality?.validators;
         if (i && i.unique) {
-          const l = this.validateUnique(r, o.key, e);
-          s.push(...l);
+          const a = this.validateUnique(r, o.key, e);
+          s.push(...a);
         }
       }
       return s;
     }
     validateUnique(e, t, r) {
-      const s = [], o = /* @__PURE__ */ new Set(), l = r.attributeQualityConfigs?.get(t)?.validatorHandling !== "loose";
-      for (const a of e) {
-        const d = a[t];
+      const s = [], o = /* @__PURE__ */ new Set(), a = r.attributeQualityConfigs?.get(t)?.validatorHandling !== "loose";
+      for (const n of e) {
+        const d = n[t];
         if (o.has(d)) {
           const u = {
             title: "Validator Error - Unique",
@@ -9985,10 +10137,10 @@ These attributes will default to Step 1 processing which may be incorrect. This
             model: r.key,
             errorType: "InvalidValidator",
             attribute: t,
-            itemKey: a.key,
+            itemKey: n.key,
             description: `The value "${d}" is not unique`
           };
-          s.push(u), l && delete a[t];
+          s.push(u), a && delete n[t];
         } else
           o.add(d);
       }
@@ -10075,7 +10227,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
         };
     }
     validateIncludes(e, t, r) {
-      if (e != null && !N$2(e, t.value))
+      if (e != null && !N$1(e, t.value))
         return {
           title: "Validator Error - Includes",
           type: "model",
@@ -10135,20 +10287,20 @@ These attributes will default to Step 1 processing which may be incorrect. This
         }
     }
   };
-  var te = Object.defineProperty, re$1 = Object.getOwnPropertyDescriptor, y = (n, e, t, r) => {
-    for (var s = re$1(e, t), o = n.length - 1, i; o >= 0; o--)
-      (i = n[o]) && (s = i(e, t, s) || s);
+  var te = Object.defineProperty, re$1 = Object.getOwnPropertyDescriptor, y = (l, e, t, r) => {
+    for (var s = re$1(e, t), o = l.length - 1, i; o >= 0; o--)
+      (i = l[o]) && (s = i(e, t, s) || s);
     return s && te(e, t, s), s;
   };
   class p {
     cdRef = new Cu();
-    analyticsController = new Mu();
+    analyticsController = new $u();
     containerSourceMetadata = /* @__PURE__ */ new WeakMap();
     scriptController = new Ku();
     qualityController = new ee$2(this.scriptController);
     log = Ua.child({ prefix: "Dcupl" });
-    modelParser = new E$2(this.cdRef, this.qualityController, this);
-    globalItemService = new z$3(this.modelParser, this.scriptController);
+    modelParser = new M$2(this.cdRef, this.qualityController, this);
+    globalItemService = new L$2(this.modelParser, this.scriptController);
     queryManager = new ju(
       this.scriptController,
       this.globalItemService,
@@ -10157,7 +10309,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
       // Cast needed due to dist vs src type mismatch in monorepo
     );
     _loaders = /* @__PURE__ */ new Map();
-    rootQueryBuilder = new ir$1();
+    rootQueryBuilder = new or$1();
     _defaultInitOptions = {
       config: { projectId: void 0, apiKey: void 0, version: "draft" },
       errorTracking: {
@@ -10190,7 +10342,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
       }
     };
     initOptions;
-    lists = new P(this, this.cdRef);
+    lists = new D$2(this, this.cdRef);
     busy = false;
     // Set until the update queue is drained
     updateQueue = [];
@@ -10395,10 +10547,10 @@ These attributes will default to Step 1 processing which may be incorrect. This
         const o = new Set(t.get(s) ?? []);
         if (o.size === 0) {
           const i = this.modelParser.models.get(s);
-          for (const l of i?.properties.keys() ?? [])
-            o.add(l);
-          for (const l of i?.references.keys() ?? [])
-            o.add(l);
+          for (const a of i?.properties.keys() ?? [])
+            o.add(a);
+          for (const a of i?.references.keys() ?? [])
+            o.add(a);
         }
         r.set(s, o);
       }
@@ -10419,9 +10571,9 @@ These attributes will default to Step 1 processing which may be incorrect. This
       const s = this.modelParser.attributeDependencyGraph;
       if (s) {
         const o = [];
-        for (const [i, l] of e)
-          for (const a of l)
-            o.push({ modelKey: i, attributeKey: a, type: "property", processingStep: 1 });
+        for (const [i, a] of e)
+          for (const n of a)
+            o.push({ modelKey: i, attributeKey: n, type: "property", processingStep: 1 });
         for (const i of s.getImpactedAttributes(o))
           t.add(i.modelKey);
       }
@@ -10434,42 +10586,51 @@ These attributes will default to Step 1 processing which may be incorrect. This
      * @param autoUpdateOverride - Per-update auto-update override
      */
     updateFnLists(e, t) {
-      const r = this.initOptions.performance?.partialUpdates?.enableDetailedLogging ?? false, s = [];
-      for (const o of this.lists.getAll()) {
-        if (e && !this.isListAffectedByChanges(o, e.affectedModels)) {
+      const r = this.initOptions.performance?.partialUpdates?.enableDetailedLogging ?? false, s = [], o = e ? new Set(e.affectedModels) : null;
+      for (const i of this.lists.getAll()) {
+        if (o && !this.isListAffectedByChanges(i, o)) {
           r && this.log.debug("List skipped (not affected)", {
-            listKey: o.key,
-            modelKey: o.modelKey
+            listKey: i.key,
+            modelKey: i.modelKey
           });
           continue;
         }
         try {
-          this.shouldAutoUpdateList(o, t) ? (r && this.log.debug("List auto-updating", {
-            listKey: o.key,
-            modelKey: o.modelKey,
+          this.shouldAutoUpdateList(i, t) ? (r && this.log.debug("List auto-updating", {
+            listKey: i.key,
+            modelKey: i.modelKey,
             affectedModels: e?.affectedModels ?? "all"
-          }), o.update()) : (r && this.log.debug("List caches invalidated (auto-update disabled)", {
-            listKey: o.key,
-            modelKey: o.modelKey
-          }), o.invalidate()), s.push(o);
-        } catch (i) {
-          this.log.error(`List refresh failed for '${o.key}'`, i);
+          }), i.update()) : (r && this.log.debug("List caches invalidated (auto-update disabled)", {
+            listKey: i.key,
+            modelKey: i.modelKey
+          }), i.invalidate()), s.push(i);
+        } catch (a) {
+          this.log.error(`List refresh failed for '${i.key}'`, a);
         }
       }
-      for (const o of s)
-        if (!o.key.startsWith("__global_list__"))
+      for (const i of s)
+        if (!i.key.startsWith("__global_list__"))
           try {
-            o.emitResultUpdated();
-          } catch (i) {
-            this.log.error(`result_updated handler failed for list '${o.key}'`, i);
+            i.emitResultUpdated();
+          } catch (a) {
+            this.log.error(`result_updated handler failed for list '${i.key}'`, a);
           }
     }
     /**
-     * Determines if a list is affected by changes to specific models
+     * Determines if a list is affected by changes to specific models: its own
+     * model is affected, or one of the models its cached results were read
+     * through is. The model graph has no edges for resolved and derived
+     * references (they would make it cyclic), so a `project` list filtered on
+     * `memberships.user.daysInactive` is not downstream of `user` there — the
+     * list itself knows which models its dotted paths resolve (#284).
      */
     isListAffectedByChanges(e, t) {
-      const r = e.modelKey;
-      return t.includes(r);
+      if (t.has(e.modelKey))
+        return true;
+      for (const r of e.getDependencyModels())
+        if (t.has(r))
+          return true;
+      return false;
     }
     /**
      * Determines if auto-update should be enabled for a specific list.
@@ -10599,7 +10760,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
     }
   }
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "fn_pivot",
       cloneResult: true,
@@ -10608,7 +10769,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
     })
   ], p.prototype, "_pivot");
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "fn_aggregate",
       cloneResult: true,
@@ -10617,7 +10778,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
     })
   ], p.prototype, "_aggregate");
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "fn_suggest",
       cloneResult: true,
@@ -10626,7 +10787,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
     })
   ], p.prototype, "_suggest");
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "fn_groupBy",
       cloneResult: true,
@@ -10635,7 +10796,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
     })
   ], p.prototype, "_groupBy");
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "fn_facets",
       cloneResult: true,
@@ -10644,7 +10805,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
     })
   ], p.prototype, "_facets");
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "fn_metadata",
       cloneResult: true,
@@ -10653,14 +10814,14 @@ These attributes will default to Step 1 processing which may be incorrect. This
     })
   ], p.prototype, "_metadata");
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "dcupl_initialized",
       connectMessage: true
     })
   ], p.prototype, "init");
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "dcupl_updated_manually",
       action: "update",
@@ -10668,14 +10829,14 @@ These attributes will default to Step 1 processing which may be incorrect. This
     })
   ], p.prototype, "update");
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "dcupl_destroyed",
       connectMessage: true
     })
   ], p.prototype, "destroy");
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "query_one",
       cloneResult: true,
@@ -10684,7 +10845,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
     })
   ], p.prototype, "getItem");
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "query_many",
       cloneResult: true,
@@ -10693,7 +10854,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
     })
   ], p.prototype, "_getManyItems");
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "query_execute",
       cloneResult: true,
@@ -10702,7 +10863,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
     })
   ], p.prototype, "executeQuery");
   y([
-    Iu({
+    Du({
       scope: "global",
       type: "loader_removed",
       connectMessage: true
@@ -11504,46 +11665,46 @@ These attributes will default to Step 1 processing which may be incorrect. This
   function cloneDeep(value) {
     return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);
   }
-  function D$1(n) {
-    const e = N$1(n);
+  function D$1(i) {
+    const e = E$1(i);
     return Z$1(e);
   }
-  function N$1(n) {
-    if (typeof n != "object" || n === null)
-      return String(n);
-    if (Array.isArray(n))
-      return "[" + n.map(N$1).join(",") + "]";
-    const e = Object.keys(n).sort();
+  function E$1(i) {
+    if (typeof i != "object" || i === null)
+      return String(i);
+    if (Array.isArray(i))
+      return "[" + i.map(E$1).join(",") + "]";
+    const e = Object.keys(i).sort();
     let t = "{";
     for (let r = 0; r < e.length; r++) {
       const s = e[r];
-      t += s + ":" + N$1(n[s]), r < e.length - 1 && (t += ",");
+      t += s + ":" + E$1(i[s]), r < e.length - 1 && (t += ",");
     }
     return t += "}", t;
   }
-  function Z$1(n) {
+  function Z$1(i) {
     let e = 0;
-    for (let t = 0; t < n.length; t++) {
-      const r = n.charCodeAt(t);
+    for (let t = 0; t < i.length; t++) {
+      const r = i.charCodeAt(t);
       e = (e << 5) - e + r, e |= 0;
     }
     return e.toString(16);
   }
   const b = {
     now: () => typeof performance < "u" && performance.now ? performance.now() : (/* @__PURE__ */ new Date()).getTime(),
-    mark: (n) => {
-      typeof performance < "u" && performance.mark && performance.mark(n);
+    mark: (i) => {
+      typeof performance < "u" && performance.mark && performance.mark(i);
     },
-    measure: (n, e, t) => {
-      typeof performance < "u" && performance.measure && performance.measure(n, e, t);
+    measure: (i, e, t) => {
+      typeof performance < "u" && performance.measure && performance.measure(i, e, t);
     },
-    getEntriesByName(n) {
+    getEntriesByName(i) {
       if (typeof performance < "u" && performance.getEntriesByName)
-        return performance.getEntriesByName(n);
+        return performance.getEntriesByName(i);
     },
-    getEntriesByType(n) {
+    getEntriesByType(i) {
       if (typeof performance < "u" && performance.getEntriesByType)
-        return performance.getEntriesByType(n);
+        return performance.getEntriesByType(i);
     }
   };
   const R = {
@@ -11624,8 +11785,8 @@ These attributes will default to Step 1 processing which may be incorrect. This
           stack: e.error.stack
         }), JSON.stringify(o);
       }
-      const t = new Date(e.timestamp).toISOString().substring(11, 23), r = e.prefix ? `[${e.prefix}]` : "", s = this.getLevelIcon(e.level), i = e.context ? ` ${JSON.stringify(e.context)}` : "";
-      return `${t} ${s} ${r} ${e.message}${i}`.trim();
+      const t = new Date(e.timestamp).toISOString().substring(11, 23), r = e.prefix ? `[${e.prefix}]` : "", s = this.getLevelIcon(e.level), n = e.context ? ` ${JSON.stringify(e.context)}` : "";
+      return `${t} ${s} ${r} ${e.message}${n}`.trim();
     }
     getLevelIcon(e) {
       switch (e) {
@@ -11644,7 +11805,7 @@ These attributes will default to Step 1 processing which may be incorrect. This
     log(e, t, r, s) {
       if (!this.shouldLog(e))
         return;
-      const i = {
+      const n = {
         level: e,
         message: t,
         timestamp: Date.now(),
@@ -11653,10 +11814,10 @@ These attributes will default to Step 1 processing which may be incorrect. This
         error: s
       };
       if (this.config.onLog) {
-        this.config.onLog(i);
+        this.config.onLog(n);
         return;
       }
-      const o = this.formatMessage(i);
+      const o = this.formatMessage(n);
       if (typeof console < "u")
         switch (e) {
           case "error":
@@ -11676,8 +11837,8 @@ These attributes will default to Step 1 processing which may be incorrect. This
      * Log an error message
      */
     error(e, t, r) {
-      const s = t instanceof Error ? t : void 0, i = t instanceof Error ? r : t;
-      this.log("error", e, i, s);
+      const s = t instanceof Error ? t : void 0, n = t instanceof Error ? r : t;
+      this.log("error", e, n, s);
     }
     /**
      * Log and track an error (integrates with QualityController)
@@ -11746,10 +11907,10 @@ These attributes will default to Step 1 processing which may be incorrect. This
     }
   }
   const Y$1 = new g();
-  function ee$1(n = 10) {
+  function ee$1(i = 10) {
     let e = "";
     const t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
-    for (let r = 0; r < n; r++) e += t.charAt(Math.floor(Math.random() * t.length));
+    for (let r = 0; r < i; r++) e += t.charAt(Math.floor(Math.random() * t.length));
     return e;
   }
   let He$1 = class He {
@@ -11788,10 +11949,10 @@ These attributes will default to Step 1 processing which may be incorrect. This
       };
     }
   };
-  const B$1 = (n, e) => e ? typeof structuredClone < "u" ? structuredClone(n) : cloneDeep(n) : n, F$1 = (n, e, t, r, s, i) => {
+  const B$1 = (i, e) => e ? typeof structuredClone < "u" ? structuredClone(i) : cloneDeep(i) : i, q = (i, e, t, r, s, n) => {
     try {
-      const o = !!e.dcuplInitOptions.performance?.clone?.enabled && !!t.cloneResult, a = B$1(i, o);
-      if (t.scope === "list" && (t.listKey = n.cdRef?.key || n.key, t.modelKey = n.model?.key || n.modelKey), t.type === "list_created" && t.args[0].listKey.startsWith("__global_list__") || t.listKey?.startsWith("__global_list__"))
+      const o = !!e.dcuplInitOptions.performance?.clone?.enabled && !!t.cloneResult, a = B$1(n, o);
+      if (t.scope === "list" && (t.listKey = i.cdRef?.key || i.key, t.modelKey = i.model?.key || i.modelKey), t.type === "list_created" && t.args[0].listKey.startsWith("__global_list__") || t.listKey?.startsWith("__global_list__"))
         return a;
       const c = b.now(), u = c - r, f = Math.round(u * 1e3) / 1e3;
       t.duration = f, t.start = r, t.end = c;
@@ -11809,12 +11970,12 @@ These attributes will default to Step 1 processing which may be incorrect. This
         detail: d
       }), a;
     } catch {
-      return i;
+      return n;
     }
-  }, Je$1 = (n) => (t, r, s) => {
-    const i = s.value;
+  }, Je$1 = (i) => (t, r, s) => {
+    const n = s.value;
     return s.value = function(...o) {
-      const a = b.now(), c = this.cdRef, u = B$1(n, true);
+      const a = b.now(), c = this.cdRef, u = B$1(i, true);
       u.key || (c.increaseCounter(), u.key = c.getCounter());
       const f = ee$1();
       c.analyticsController.mark({
@@ -11823,8 +11984,8 @@ These attributes will default to Step 1 processing which may be incorrect. This
       });
       const d = this.model?.key;
       !u.originCdRefKey && c.key && (u.originCdRefKey = c.key), d && (u.modelKey = d);
-      const l = i.apply(this, o);
-      return u.method = r, u.args = o, l && typeof l == "object" && "then" in l ? l.then((h) => F$1(this, c, u, a, f, h)) : F$1(this, c, u, a, f, l);
+      const l = n.apply(this, o);
+      return u.method = r, u.args = o, l && typeof l == "object" && "then" in l ? l.then((h) => q(this, c, u, a, f, h)) : q(this, c, u, a, f, l);
     }, s;
   };
   const Oe$1 = /* @__PURE__ */ new Set([
@@ -11837,42 +11998,42 @@ These attributes will default to Step 1 processing which may be incorrect. This
     "manager-key",
     "sdk-key"
   ]);
-  function at$1(n) {
-    const e = n.indexOf("?");
-    if (e < 0) return n;
-    const t = n.slice(e + 1).split("&").map((r) => {
+  function at$1(i) {
+    const e = i.indexOf("?");
+    if (e < 0) return i;
+    const t = i.slice(e + 1).split("&").map((r) => {
       const s = r.indexOf("=");
       if (s < 0) return r;
-      const i = r.slice(0, s);
-      return Oe$1.has(i.toLowerCase()) ? `${i}=<redacted>` : r;
+      const n = r.slice(0, s);
+      return Oe$1.has(n.toLowerCase()) ? `${n}=<redacted>` : r;
     }).join("&");
-    return `${n.slice(0, e)}?${t}`;
+    return `${i.slice(0, e)}?${t}`;
   }
-  const qe$1 = "k:", Re$1 = "h:";
-  function Q$1(n, e = 0) {
-    if (n.key)
-      return `${qe$1}${n.key}`;
+  const Ge$1 = "k:", Re$1 = "h:";
+  function M$1(i, e = 0) {
+    if (i.key)
+      return `${Ge$1}${i.key}`;
     const t = D$1({
-      type: n.type,
-      url: n.rawUrl ?? n.url,
-      model: n.model ?? "",
+      type: i.type,
+      url: i.rawUrl ?? i.url,
+      model: i.model ?? "",
       occurrence: e
     });
     return `${Re$1}${t}`;
   }
-  function ct$1(n) {
+  function ct$1(i) {
     const e = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Set();
-    return n.map((r) => {
+    return i.map((r) => {
       const s = `${r.key ?? ""}|${r.type}|${r.rawUrl ?? r.url}|${r.model ?? ""}`;
-      let i = e.get(s) ?? 0, o = Q$1(r, i);
+      let n = e.get(s) ?? 0, o = M$1(r, n);
       for (; t.has(o); )
-        i += 1, o = r.key ? `${Q$1(r)}#${i}` : Q$1(r, i);
-      return e.set(s, i + 1), t.add(o), o;
+        n += 1, o = r.key ? `${M$1(r)}#${n}` : M$1(r, n);
+      return e.set(s, n + 1), t.add(o), o;
     });
   }
-  const dt$1 = (n, e) => n ? (e || (e = {}), n.replace(/\$\{(.*?)\}/g, (t, r) => get(e, r.trim(), ""))) : "", lt$1 = (n) => {
+  const dt$1 = (i, e) => i ? (e || (e = {}), i.replace(/\$\{(.*?)\}/g, (t, r) => get(e, r.trim(), ""))) : "", lt$1 = (i) => {
     const e = /* @__PURE__ */ new Set();
-    return n.replace(/\$\{(.*?)\}/g, (r, s) => (e.add(s.trim()), "")), { variables: Array.from(e).map((r) => ({ name: r })) };
+    return i.replace(/\$\{(.*?)\}/g, (r, s) => (e.add(s.trim()), "")), { variables: Array.from(e).map((r) => ({ name: r })) };
   };
   let ze = class {
     log = Y$1.child({ prefix: "DcuplCsvParser" });