@raphy-js/raph 1.0.0-dev.2 → 1.0.1-dev.20

package/dist/debug/path/RaphKernel.js

@@ -1,41 +1,43 @@
 var F = Object.defineProperty;
-var R = (f, e, t) => e in f ? F(f, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : f[e] = t;
-var p = (f, e, t) => R(f, typeof e != "symbol" ? e + "" : e, t);
-import { AdapterPathStore as b } from "./AdapterPathStore.js";
-import { DefaultDataAdapter as O } from "./data-adapter.js";
-import { parseDataPath as k, DataPath as W } from "./data-path.js";
-import { validateFullFilter as S, cloneMaterializedValue as z, validateFullCollection as K, collectionIndex as w, collectionError as M, indexesAreStale as P, validateIncrementalCollection as q, collectionKeys as C, keyedPath as A, filterError as I, validateIncrementalFilter as N } from "./derived-collection.js";
-import { DerivedRegistry as $ } from "./DerivedRegistry.js";
-import { MetaController as j } from "./MetaController.js";
-import { PathStore as L } from "./PathStore.js";
-import { RaphDerivedHandle as B, RaphDerivedTargetWriteError as H } from "./RaphDerivedHandle.js";
-const x = class x {
+var O = (_, e, t) => e in _ ? F(_, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : _[e] = t;
+var y = (_, e, t) => O(_, typeof e != "symbol" ? e + "" : e, t);
+import { parseDataPath as w } from "./data-path.utils.js";
+import { DataPath as T } from "./DataPath.js";
+import { validateFullFilter as S, cloneMaterializedValue as C, validateFullCollection as W, collectionIndex as k, collectionError as b, indexesAreStale as z, validateIncrementalCollection as B, collectionKeys as x, keyedPath as A, filterError as P, validateIncrementalFilter as K } from "./derived/derived-collection.utils.js";
+import { DerivedRegistry as q } from "./derived/DerivedRegistry.js";
+import { RaphDerivedHandle as N, RaphDerivedTargetWriteError as $ } from "./derived/RaphDerivedHandle.js";
+import { MetaController as j } from "./meta/MetaController.js";
+import { AdapterPathStore as R } from "./storage/AdapterPathStore.js";
+import { DefaultDataAdapter as L } from "./storage/DefaultDataAdapter.js";
+import { PathStore as H } from "./storage/PathStore.js";
+const M = class M {
   /**
    * Создаёт data/meta owner с независимым lifecycle и derived registry.
    */
   constructor(e = {}) {
     // Публикует стабильную identity data/meta owner.
-    p(this, "id");
+    y(this, "id");
     // Лениво создают независимые data, derived, runtime и metadata controllers.
-    p(this, "_paths");
-    p(this, "_derivedController");
-    p(this, "_runtimes");
-    p(this, "_metaController");
-    // Защищают transaction stabilization и записи в derived targets.
-    p(this, "_transactionDepth", 0);
-    p(this, "_stabilizing", !1);
-    p(this, "_derivedWriteDepth", 0);
-    if (this.id = e.id ?? `kernel-${x._kernelCounter++}`, e.adapter !== void 0) {
+    y(this, "_paths");
+    y(this, "_derivedController");
+    y(this, "_runtimes");
+    y(this, "_metaController");
+    // Защищают batch stabilization и записи в derived targets.
+    y(this, "_batchDepth", 0);
+    y(this, "_runtimeMutationDepth", 0);
+    y(this, "_stabilizing", !1);
+    y(this, "_derivedWriteDepth", 0);
+    if (this.id = e.id ?? `kernel-${M._kernelCounter++}`, e.adapter !== void 0) {
       if (e.initial !== void 0 || e.adapterOptions !== void 0)
         throw new TypeError("[Raph] A custom adapter cannot be combined with initial or adapterOptions.");
-      this._paths = new b(e.adapter);
+      this._paths = new R(e.adapter);
     } else if (e.adapterOptions !== void 0)
-      this._paths = new b(new O(
+      this._paths = new R(new L(
         e.initial,
         e.adapterOptions
       ));
     else {
-      const t = this._paths = new L();
+      const t = this._paths = new H();
       e.initial !== void 0 && t.set("", e.initial);
     }
   }
@@ -81,6 +83,10 @@ const x = class x {
    */
   set(e, t, r) {
     var s;
+    if (this._runtimeMutationDepth === 0 && this._runtimes !== void 0) {
+      this._withAttachedRuntimeBoundary(() => this.set(e, t, r));
+      return;
+    }
     this._assertWritablePath("set", e, t, r);
     const i = this._store;
     if ((((s = this._metaController) == null ? void 0 : s.size) ?? 0) === 0) {
@@ -100,6 +106,10 @@ const x = class x {
    */
   merge(e, t, r) {
     var s;
+    if (this._runtimeMutationDepth === 0 && this._runtimes !== void 0) {
+      this._withAttachedRuntimeBoundary(() => this.merge(e, t, r));
+      return;
+    }
     this._assertWritablePath("merge", e, t, r);
     const i = this._store;
     if ((((s = this._metaController) == null ? void 0 : s.size) ?? 0) === 0) {
@@ -119,6 +129,10 @@ const x = class x {
    */
   delete(e, t) {
     var i;
+    if (this._runtimeMutationDepth === 0 && this._runtimes !== void 0) {
+      this._withAttachedRuntimeBoundary(() => this.delete(e, t));
+      return;
+    }
     this._assertWritablePath("delete", e, void 0, t);
     const r = this._store;
     if ((((i = this._metaController) == null ? void 0 : i.size) ?? 0) === 0) {
@@ -136,36 +150,24 @@ const x = class x {
     });
   }
   /**
-   * Выполняет операцию в общей синхронной transaction boundary.
+   * Выполняет операцию в общей синхронной batch boundary.
    */
-  transaction(e) {
-    var c, l, v, _;
+  batch(e) {
+    var o;
+    if (this._runtimeMutationDepth === 0 && this._runtimes !== void 0)
+      return this._withAttachedRuntimeBoundary(() => this.batch(e));
     const t = this._store;
-    if (this._derivedController === void 0 && !((c = this._metaController) != null && c.hasWatchers))
-      return t.transaction(e);
-    const r = this._transactionDepth === 0 && ((l = this._metaController) != null && l.hasDeferredWatchers) && this._runtimes !== void 0 ? [...this._runtimes] : void 0;
-    if (r !== void 0)
-      for (const o of r)
-        (v = o._beginKernelTransaction) == null || v.call(o);
-    let i, s, a = !1;
+    if (this._derivedController === void 0 && !((o = this._metaController) != null && o.hasWatchers))
+      return t.batch(e);
+    let r, i, s = !1;
     try {
-      i = t.transaction(() => this._runDerivedTransaction(e));
-    } catch (o) {
-      a = !0, s = o;
+      r = t.batch(() => this._runDerivedBatch(e));
+    } catch (h) {
+      s = !0, i = h;
     }
-    const d = [];
-    if (a && d.push(s), r !== void 0)
-      for (const o of r)
-        try {
-          (_ = o._endKernelTransaction) == null || _.call(o);
-        } catch (m) {
-          d.push(m);
-        }
-    if (d.length === 1)
-      throw d[0];
-    if (d.length > 1)
-      throw new AggregateError(d, "[Raph] Kernel transaction execution failed.");
-    return i;
+    if (s)
+      throw i;
+    return r;
   }
   /**
    * Подписывает callback на подходящие изменения и возвращает disposer.
@@ -191,6 +193,10 @@ const x = class x {
    * Записывает metadata указанного data-owner.
    */
   setMeta(e, t, r, i) {
+    if (this._runtimeMutationDepth === 0 && this._runtimes !== void 0) {
+      this._withAttachedRuntimeBoundary(() => this.setMeta(e, t, r, i));
+      return;
+    }
     this._assertMetaNamespace(t);
     const s = this._exactMetaPath(e, i);
     this._assertMetaOwner(s), this._metadata.set(s, t, r, i);
@@ -199,6 +205,10 @@ const x = class x {
    * Объединяет metadata указанного data-owner.
    */
   mergeMeta(e, t, r, i) {
+    if (this._runtimeMutationDepth === 0 && this._runtimes !== void 0) {
+      this._withAttachedRuntimeBoundary(() => this.mergeMeta(e, t, r, i));
+      return;
+    }
     this._assertMetaNamespace(t);
     const s = this._exactMetaPath(e, i);
     this._assertMetaOwner(s), this._metadata.merge(s, t, r, i);
@@ -208,6 +218,10 @@ const x = class x {
    */
   deleteMeta(e, t, r) {
     var s;
+    if (this._runtimeMutationDepth === 0 && this._runtimes !== void 0) {
+      this._withAttachedRuntimeBoundary(() => this.deleteMeta(e, t, r));
+      return;
+    }
     t !== void 0 && this._assertMetaNamespace(t);
     const i = this._exactMetaPath(e, r);
     (s = this._metaController) == null || s.delete(i, t, r);
@@ -223,26 +237,26 @@ const x = class x {
    * Создаёт управляемое derived-представление source path в target path.
    */
   derive(e) {
-    var l, v, _;
+    var d, u, m;
     if (this._store, e.strategy !== void 0 && e.strategy.kind !== "full" && e.strategy.kind !== "collection-by-key" && e.strategy.kind !== "filter-by-key")
       throw new Error(`[Raph] Unsupported derived strategy "${String(e.strategy.kind)}".`);
-    if (e.id !== void 0 && ((l = this._derivedController) != null && l.has(e.id)))
+    if (e.id !== void 0 && ((d = this._derivedController) != null && d.has(e.id)))
       throw new Error(`[Raph] Duplicate derived id "${e.id}".`);
-    const t = k(e.from), r = k(e.to);
-    if (T(t, r))
+    const t = w(e.from), r = w(e.to);
+    if (E(t, r))
       throw new Error("[Raph] Derived source and target must not overlap.");
-    const i = this._derivedController ?? new $(), s = e.id ?? i.nextId(), a = {
+    const i = this._derivedController ?? new q(), s = e.id ?? i.nextId(), o = {
       ...e,
       from: t.canonical,
       to: r.canonical
-    }, d = new B(this, s, a), c = ((v = e.strategy) == null ? void 0 : v.kind) === "collection-by-key" || ((_ = e.strategy) == null ? void 0 : _.kind) === "filter-by-key" ? e.strategy : void 0;
-    this._derivedController = i, i.register(d, t, c);
+    }, h = new N(this, s, o), l = ((u = e.strategy) == null ? void 0 : u.kind) === "collection-by-key" || ((m = e.strategy) == null ? void 0 : m.kind) === "filter-by-key" ? e.strategy : void 0;
+    this._derivedController = i, i.register(h, t, l);
     try {
-      e.immediate !== !1 && d.recompute();
-    } catch (o) {
-      throw this._removeDerived(d), d._disposeFromKernel(), o;
+      e.immediate !== !1 && h.recompute();
+    } catch (a) {
+      throw this._removeDerived(h), h._disposeFromKernel(), a;
     }
-    return d;
+    return h;
   }
   /**
    * Регистрирует runtime, разделяющий этот Kernel.
@@ -309,21 +323,58 @@ const x = class x {
     return this._store, this._metaController ?? (this._metaController = new j(
       this,
       (e) => this.has(e),
-      () => this._transactionDepth !== 0 || this._stabilizing
+      () => this._batchDepth !== 0 || this._stabilizing
     ));
   }
+  /** Keeps every attached Runtime quiescent until one Kernel publication completes. */
+  _withAttachedRuntimeBoundary(e) {
+    var h, l, d;
+    const t = this._runtimes === void 0 ? [] : [...this._runtimes];
+    if (t.length === 0)
+      return e();
+    const r = [], i = [];
+    let s, o = !1;
+    this._runtimeMutationDepth++;
+    try {
+      for (const u of t)
+        (h = u._beginKernelBatch) == null || h.call(u), r.push(u);
+      try {
+        s = e();
+      } catch (u) {
+        o = !0, i.push(u);
+      }
+    } catch (u) {
+      o = !0, i.push(u);
+    } finally {
+      this._runtimeMutationDepth--;
+      for (let u = r.length - 1; u >= 0; u--)
+        try {
+          (d = (l = r[u])._endKernelBatch) == null || d.call(l);
+        } catch (m) {
+          i.push(m);
+        }
+    }
+    if (i.length === 1)
+      throw i[0];
+    if (i.length > 1)
+      throw new AggregateError(
+        i,
+        o ? "[Raph] Kernel mutation and Runtime publication failed." : "[Raph] Runtime publication failed after a Kernel mutation."
+      );
+    return s;
+  }
   _assertWritablePath(e, t, r, i) {
     const s = this._derivedController;
     if (s === void 0 || this._derivedWriteDepth !== 0)
       return;
-    const a = k(t, i);
-    for (const d of s.values()) {
-      const c = k(d.options.to);
-      if (!T(a, c))
+    const o = w(t, i);
+    for (const h of s.values()) {
+      const l = w(h.options.to);
+      if (!E(o, l))
         continue;
-      const l = a.segments.length < c.segments.length;
-      if (!(e === "merge" && l && !U(r, c.segments[a.segments.length])))
-        throw new H(a.canonical);
+      const d = o.segments.length < l.segments.length;
+      if (!(e === "merge" && d && !U(r, l.segments[o.segments.length])))
+        throw new $(o.canonical);
     }
   }
   _writeDerivedTarget(e, t) {
@@ -335,57 +386,57 @@ const x = class x {
     }
   }
   _mutateDerived(e, t, r, i, s) {
-    const a = k(r, s);
-    t === "delete" && !e.has(r, s) || e.transaction(() => {
-      t === "set" ? e.set(r, i, s) : t === "merge" ? e.merge(r, i, s) : e.delete(r, s), this._queueDerived(a), this._transactionDepth === 0 && !this._stabilizing && this._stabilizeDerived();
+    const o = w(r, s);
+    t === "delete" && !e.has(r, s) || e.batch(() => {
+      t === "set" ? e.set(r, i, s) : t === "merge" ? e.merge(r, i, s) : e.delete(r, s), this._queueDerived(o), this._batchDepth === 0 && !this._stabilizing && this._stabilizeDerived();
     });
   }
-  _runDerivedTransaction(e) {
-    var v;
-    let t = !1, r, i = !1, s, a = !1, d, c;
-    this._transactionDepth++;
+  _runDerivedBatch(e) {
+    var u;
+    let t = !1, r, i = !1, s, o = !1, h, l;
+    this._batchDepth++;
     try {
-      c = e();
-    } catch (_) {
-      t = !0, r = _;
+      l = e();
+    } catch (m) {
+      t = !0, r = m;
     } finally {
-      if (this._transactionDepth--, this._transactionDepth === 0) {
+      if (this._batchDepth--, this._batchDepth === 0) {
         if (!this._stabilizing)
           try {
             this._stabilizeDerived();
-          } catch (_) {
-            i = !0, s = _;
+          } catch (m) {
+            i = !0, s = m;
           }
         try {
-          (v = this._metaController) == null || v.publish();
-        } catch (_) {
-          a = !0, d = _;
+          (u = this._metaController) == null || u.publish();
+        } catch (m) {
+          o = !0, h = m;
         }
       }
     }
-    const l = [];
-    if (t && l.push(r), i && l.push(s), a && l.push(d), l.length > 1)
+    const d = [];
+    if (t && d.push(r), i && d.push(s), o && d.push(h), d.length > 1)
       throw new AggregateError(
-        l,
-        "[Raph] Kernel transaction publication failed."
+        d,
+        "[Raph] Kernel batch publication failed."
       );
-    if (l.length === 1)
-      throw l[0];
-    return c;
+    if (d.length === 1)
+      throw d[0];
+    return l;
   }
   _mutateWithMetaLifecycle(e) {
-    if (this._transactionDepth !== 0 || this._stabilizing) {
+    if (this._batchDepth !== 0 || this._stabilizing) {
       e();
       return;
     }
-    this.transaction(e);
+    this.batch(e);
   }
   _pruneMissingMetaOwners(e, t, r) {
     var i;
     (i = this._metaController) == null || i.pruneMissing(this._metaPath(e, r), t);
   }
   _metaPath(e, t) {
-    return W.from(e, t);
+    return T.from(e, t);
   }
   _exactMetaPath(e, t) {
     const r = this._metaPath(e, t);
@@ -410,7 +461,7 @@ const x = class x {
     (r = this._derivedController) == null || r.queueReplacement(e, t);
   }
   _replaceDerivedTarget(e, t, r) {
-    const i = k(e);
+    const i = w(e);
     this._store.set(i.canonical, t), this._queueDerivedReplacement(i, r);
   }
   _stabilizeDerived() {
@@ -448,61 +499,61 @@ const x = class x {
     t.kind === "filter-by-key" ? this._recomputeDerivedFilter(e, t) : this._recomputeDerivedCollection(e, t);
   }
   _recomputeDerivedFull(e) {
-    var c;
-    const t = (c = this._derivedController) == null ? void 0 : c.state(e);
+    var l;
+    const t = (l = this._derivedController) == null ? void 0 : l.state(e);
     t !== void 0 && (t.full = !0);
     const r = this.get(e.options.from), i = e.options.compute(r);
-    let s = i, a, d;
-    t !== void 0 && (r === void 0 && (i === void 0 || Array.isArray(i) && i.length === 0) ? (a = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map()) : (t.kind === "filter-by-key" ? (S(e.id, t.key, r, i), s = z(i)) : K(e.id, t.key, r, i), a = w(r, t.key, "source"), d = w(s, t.key, "output"))), this._writeDerivedTarget(e.options.to, s), t !== void 0 && (t.sourceIndex = a, t.targetIndex = d, t.initialized = !0, t.full = !1, t.keys.clear());
+    let s = i, o, h;
+    t !== void 0 && (r === void 0 && (i === void 0 || Array.isArray(i) && i.length === 0) ? (o = /* @__PURE__ */ new Map(), h = /* @__PURE__ */ new Map()) : (t.kind === "filter-by-key" ? (S(e.id, t.key, r, i), s = C(i)) : W(e.id, t.key, r, i), o = k(r, t.key, "source"), h = k(s, t.key, "output"))), this._writeDerivedTarget(e.options.to, s), t !== void 0 && (t.sourceIndex = o, t.targetIndex = h, t.initialized = !0, t.full = !1, t.keys.clear());
   }
   _recomputeDerivedCollection(e, t) {
     t.full = !0;
     const r = this.get(e.options.from), i = this.get(e.options.to);
     if (!Array.isArray(r) || !Array.isArray(i))
-      throw M(e.id, "requires array source and target");
-    (t.sourceIndex === void 0 || P(r, t.key, t.sourceIndex, t.keys)) && (t.sourceIndex = w(r, t.key, "source"));
+      throw b(e.id, "requires array source and target");
+    (t.sourceIndex === void 0 || z(r, t.key, t.sourceIndex, t.keys)) && (t.sourceIndex = k(r, t.key, "source"));
     const s = t.targetIndex;
     if (s === void 0)
-      throw M(e.id, "has no materialized target index");
-    const a = [], d = [];
-    for (const o of t.keys) {
-      const m = t.sourceIndex.get(o);
-      m === void 0 ? d.push(o) : a.push({ key: o, index: m, item: r[m] });
+      throw b(e.id, "has no materialized target index");
+    const o = [], h = [];
+    for (const a of t.keys) {
+      const g = t.sourceIndex.get(a);
+      g === void 0 ? h.push(a) : o.push({ key: a, index: g, item: r[g] });
     }
-    a.sort((o, m) => o.index - m.index);
-    const c = a.map((o) => o.item), l = c.length === 0 ? [] : e.options.compute(c);
-    q(
+    o.sort((a, g) => a.index - g.index);
+    const l = o.map((a) => a.item), d = l.length === 0 ? [] : e.options.compute(l);
+    B(
       e.id,
       t.key,
-      a.map((o) => o.key),
-      l
+      o.map((a) => a.key),
+      d
     );
-    const v = l;
-    if (d.length !== 0 || a.some((o) => !s.has(o.key))) {
-      const o = /* @__PURE__ */ new Map();
-      for (let u = 0; u < a.length; u++)
-        o.set(a[u].key, v[u]);
-      const m = /* @__PURE__ */ new Map();
-      for (const [u, g] of s)
-        m.set(u, i[g]);
-      const n = C(r, t.key, "source"), h = [];
-      h.length = n.length;
-      for (let u = 0; u < n.length; u++) {
-        const g = n[u];
-        if (g === void 0)
+    const u = d;
+    if (h.length !== 0 || o.some((a) => !s.has(a.key))) {
+      const a = /* @__PURE__ */ new Map();
+      for (let f = 0; f < o.length; f++)
+        a.set(o[f].key, u[f]);
+      const g = /* @__PURE__ */ new Map();
+      for (const [f, v] of s)
+        g.set(f, i[v]);
+      const n = x(r, t.key, "source"), c = [];
+      c.length = n.length;
+      for (let f = 0; f < n.length; f++) {
+        const v = n[f];
+        if (v === void 0)
           continue;
-        const D = o.has(g) ? o.get(g) : m.get(g);
+        const D = a.has(v) ? a.get(v) : g.get(v);
         if (D === void 0)
-          throw M(e.id, `is missing target item for key "${String(g)}"`);
-        h[u] = D;
+          throw b(e.id, `is missing target item for key "${String(v)}"`);
+        c[f] = D;
       }
-      const y = w(h, t.key, "target");
-      this._replaceDerivedTarget(e.options.to, h, t.keys), t.targetIndex = y;
+      const p = k(c, t.key, "target");
+      this._replaceDerivedTarget(e.options.to, c, t.keys), t.targetIndex = p;
     } else
-      for (let o = 0; o < a.length; o++)
+      for (let a = 0; a < o.length; a++)
         this._writeDerivedTarget(
-          A(e.options.to, t.key, a[o].key),
-          v[o]
+          A(e.options.to, t.key, o[a].key),
+          u[a]
         );
     t.keys.clear(), t.full = !1;
   }
@@ -510,127 +561,127 @@ const x = class x {
     t.full = !0;
     const r = this.get(e.options.from), i = this.get(e.options.to);
     if (!Array.isArray(r) || !Array.isArray(i))
-      throw I(e.id, "requires array source and target");
-    (t.sourceIndex === void 0 || P(r, t.key, t.sourceIndex, t.keys)) && (t.sourceIndex = w(r, t.key, "source"));
+      throw P(e.id, "requires array source and target");
+    (t.sourceIndex === void 0 || z(r, t.key, t.sourceIndex, t.keys)) && (t.sourceIndex = k(r, t.key, "source"));
     const s = t.targetIndex;
     if (s === void 0)
-      throw I(e.id, "has no materialized target index");
-    const a = [];
+      throw P(e.id, "has no materialized target index");
+    const o = [];
     for (const n of t.keys) {
-      const h = t.sourceIndex.get(n);
-      h !== void 0 && a.push({ key: n, index: h, item: r[h] });
+      const c = t.sourceIndex.get(n);
+      c !== void 0 && o.push({ key: n, index: c, item: r[c] });
     }
-    a.sort((n, h) => n.index - h.index);
-    const d = a.map((n) => n.item), c = d.length === 0 ? [] : e.options.compute(d);
-    N(
+    o.sort((n, c) => n.index - c.index);
+    const h = o.map((n) => n.item), l = h.length === 0 ? [] : e.options.compute(h);
+    K(
       e.id,
       t.key,
-      a.map((n) => n.key),
-      c
+      o.map((n) => n.key),
+      l
     );
-    const l = /* @__PURE__ */ new Map(), v = c, _ = C(v, t.key, "output");
-    for (let n = 0; n < _.length; n++) {
-      const h = _[n];
-      h !== void 0 && l.set(h, z(v[n]));
+    const d = /* @__PURE__ */ new Map(), u = l, m = x(u, t.key, "output");
+    for (let n = 0; n < m.length; n++) {
+      const c = m[n];
+      c !== void 0 && d.set(c, C(u[n]));
     }
-    const o = /* @__PURE__ */ new Set();
-    let m = !1;
+    const a = /* @__PURE__ */ new Set();
+    let g = !1;
     for (const n of t.keys) {
-      const h = s.has(n), y = l.has(n);
-      !h && !y || (o.add(n), h !== y && (m = !0));
+      const c = s.has(n), p = d.has(n);
+      !c && !p || (a.add(n), c !== p && (g = !0));
     }
-    if (m && t.keys.size === 1 && i.length === s.size && this._patchSingleFilterMembership(
+    if (g && t.keys.size === 1 && i.length === s.size && this._patchSingleFilterMembership(
       e,
       t,
       i,
       s,
-      l,
-      o
+      d,
+      a
     )) {
       t.keys.clear(), t.full = !1;
       return;
     }
-    if (m) {
+    if (g) {
       const n = /* @__PURE__ */ new Map();
-      for (const [u, g] of s)
-        n.set(u, i[g]);
-      const h = [];
-      for (const u of C(r, t.key, "source"))
-        if (u !== void 0) {
-          if (t.keys.has(u)) {
-            l.has(u) && h.push(l.get(u));
+      for (const [f, v] of s)
+        n.set(f, i[v]);
+      const c = [];
+      for (const f of x(r, t.key, "source"))
+        if (f !== void 0) {
+          if (t.keys.has(f)) {
+            d.has(f) && c.push(d.get(f));
             continue;
           }
-          n.has(u) && h.push(n.get(u));
+          n.has(f) && c.push(n.get(f));
         }
-      const y = w(h, t.key, "target");
-      this._replaceDerivedTarget(e.options.to, h, o), t.targetIndex = y;
+      const p = k(c, t.key, "target");
+      this._replaceDerivedTarget(e.options.to, c, a), t.targetIndex = p;
     } else
-      for (const [n, h] of l)
-        this._writeDerivedTarget(A(e.options.to, t.key, n), h);
+      for (const [n, c] of d)
+        this._writeDerivedTarget(A(e.options.to, t.key, n), c);
     t.keys.clear(), t.full = !1;
   }
-  _patchSingleFilterMembership(e, t, r, i, s, a) {
-    const d = t.sourceIndex;
-    if (d === void 0)
+  _patchSingleFilterMembership(e, t, r, i, s, o) {
+    const h = t.sourceIndex;
+    if (h === void 0)
       return !1;
-    const c = t.keys.values().next().value;
-    if (c === void 0)
+    const l = t.keys.values().next().value;
+    if (l === void 0)
       return !1;
-    const l = i.get(c), v = s.has(c);
-    if (l !== void 0 === v)
+    const d = i.get(l), u = s.has(l);
+    if (d !== void 0 === u)
       return !1;
-    const _ = r.slice();
-    let o;
-    if (l !== void 0)
-      o = l, _.splice(o, 1);
+    const m = r.slice();
+    let a;
+    if (d !== void 0)
+      a = d, m.splice(a, 1);
     else {
-      const m = d.get(c);
-      if (m === void 0)
+      const g = h.get(l);
+      if (g === void 0)
         return !1;
-      let n = 0, h = _.length;
-      for (; n < h; ) {
-        const y = n + h >>> 1, u = _[y];
-        if (typeof u != "object" || u === null || Array.isArray(u))
+      let n = 0, c = m.length;
+      for (; n < c; ) {
+        const p = n + c >>> 1, f = m[p];
+        if (typeof f != "object" || f === null || Array.isArray(f))
           return !1;
-        const g = u[t.key];
-        if (typeof g != "string" && typeof g != "number")
+        const v = f[t.key];
+        if (typeof v != "string" && typeof v != "number")
           return !1;
-        const D = d.get(g);
+        const D = h.get(v);
         if (D === void 0)
           return !1;
-        D < m ? n = y + 1 : h = y;
+        D < g ? n = p + 1 : c = p;
       }
-      o = n, _.splice(o, 0, s.get(c));
+      a = n, m.splice(a, 0, s.get(l));
     }
-    if (this._replaceDerivedTarget(e.options.to, _, a), l !== void 0) {
-      i.delete(c);
-      for (const [m, n] of i)
-        n > o && i.set(m, n - 1);
+    if (this._replaceDerivedTarget(e.options.to, m, o), d !== void 0) {
+      i.delete(l);
+      for (const [g, n] of i)
+        n > a && i.set(g, n - 1);
     } else {
-      for (const [m, n] of i)
-        n >= o && i.set(m, n + 1);
-      i.set(c, o);
+      for (const [g, n] of i)
+        n >= a && i.set(g, n + 1);
+      i.set(l, a);
     }
     return !0;
   }
 };
 // Формирует локальный id для Kernel без явно заданного имени.
-p(x, "_kernelCounter", 0);
-let E = x;
-function T(f, e) {
-  const t = Math.min(f.segments.length, e.segments.length);
+y(M, "_kernelCounter", 0);
+let I = M;
+function E(_, e) {
+  const t = Math.min(_.segments.length, e.segments.length);
   for (let r = 0; r < t; r++)
-    if (!V(f.segments[r], e.segments[r]))
+    if (!V(_.segments[r], e.segments[r]))
       return !1;
   return !0;
 }
-function U(f, e) {
-  return typeof f != "object" || f === null || Array.isArray(f) || e.kind !== "key" ? !0 : Object.hasOwn(f, e.key);
+function U(_, e) {
+  return typeof _ != "object" || _ === null || Array.isArray(_) || e.kind !== "key" ? !0 : Object.hasOwn(_, e.key);
 }
-function V(f, e) {
-  return f.kind !== e.kind ? !1 : f.kind === "key" && e.kind === "key" ? f.key === e.key : f.kind === "index" && e.kind === "index" ? f.index === e.index : f.kind === "selector" && e.kind === "selector" && f.key === e.key && Object.is(f.value, e.value);
+function V(_, e) {
+  return _.kind !== e.kind ? !1 : _.kind === "key" && e.kind === "key" ? _.key === e.key : _.kind === "index" && e.kind === "index" ? _.index === e.index : _.kind === "selector" && e.kind === "selector" && _.key === e.key && Object.is(_.value, e.value);
 }
 export {
-  E as RaphKernel
+  I as RaphKernel
 };