@raphy-js/raph 1.0.1-dev.20 → 1.0.1-dev.25

package/dist/debug/path/RaphKernel.js

@@ -1,44 +1,48 @@
-var F = Object.defineProperty;
-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 {
+import { parseDataPath as p } from "./data-path.utils.js";
+import { DataPath as B } from "./DataPath.js";
+import { validateFullFilter as I, cloneMaterializedValue as M, validateFullCollection as E, collectionIndex as w, collectionError as D, indexesAreStale as x, validateIncrementalCollection as F, collectionKeys as b, keyedPath as C, filterError as R, validateIncrementalFilter as K } from "./derived/derived-collection.utils.js";
+import { DerivedRegistry as O } from "./derived/DerivedRegistry.js";
+import { RaphDerivedHandle as S, RaphDerivedTargetWriteError as T } from "./derived/RaphDerivedHandle.js";
+import { MetaController as W } from "./meta/MetaController.js";
+import { AdapterPathStore as z } from "./storage/AdapterPathStore.js";
+import { DefaultDataAdapter as q } from "./storage/DefaultDataAdapter.js";
+import { PathStore as N } from "./storage/PathStore.js";
+class P {
+  // Формирует локальный id для Kernel без явно заданного имени.
+  static _kernelCounter = 0;
+  // Публикует стабильную identity data/meta owner.
+  id;
+  // Лениво создают независимые data, derived, runtime и metadata controllers.
+  _paths;
+  _derivedController;
+  _runtimes;
+  _metaController;
+  // Что читает `_openSoleRuntimeBatch()`: единственный присоединённый Runtime
+  // и владелец batch boundary встроенного store. Первое пусто, пока Runtime
+  // нет либо их несколько; второе — у store над adapter и после dispose.
+  _soleRuntime;
+  _pathBatch;
+  // Защищают batch stabilization и записи в derived targets.
+  _batchDepth = 0;
+  _runtimeMutationDepth = 0;
+  _stabilizing = !1;
+  _derivedWriteDepth = 0;
   /**
    * Создаёт data/meta owner с независимым lifecycle и derived registry.
    */
   constructor(e = {}) {
-    // Публикует стабильную identity data/meta owner.
-    y(this, "id");
-    // Лениво создают независимые data, derived, runtime и metadata controllers.
-    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 (this.id = e.id ?? `kernel-${P._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 R(e.adapter);
+      this._paths = new z(e.adapter);
     } else if (e.adapterOptions !== void 0)
-      this._paths = new R(new L(
+      this._paths = new z(new q(
         e.initial,
         e.adapterOptions
       ));
     else {
-      const t = this._paths = new H();
-      e.initial !== void 0 && t.set("", e.initial);
+      const t = this._paths = new N();
+      this._pathBatch = t._batchHub, e.initial !== void 0 && t.set("", e.initial);
     }
   }
   /**
@@ -51,12 +55,11 @@ const M = class M {
    * Формирует диагностический снимок materialized derived registry.
    */
   getDerivedSnapshot() {
-    var t;
     const e = this._derivedController;
     return {
-      registrations: (e == null ? void 0 : e.size) ?? 0,
-      errors: [...(e == null ? void 0 : e.values()) ?? []].filter((r) => r.status === "error").length,
-      pending: ((t = e == null ? void 0 : e.pending) == null ? void 0 : t.size) ?? 0,
+      registrations: e?.size ?? 0,
+      errors: [...e?.values() ?? []].filter((t) => t.status === "error").length,
+      pending: e?.pending?.size ?? 0,
       stabilizing: this._stabilizing
     };
   }
@@ -82,14 +85,13 @@ const M = class M {
    * Записывает значение и публикует соответствующее изменение.
    */
   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) {
+    if ((this._metaController?.size ?? 0) === 0) {
       if (this._derivedController === void 0) {
         i.set(e, t, r);
         return;
@@ -105,14 +107,13 @@ const M = class M {
    * Объединяет значение по пути и публикует соответствующее изменение.
    */
   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) {
+    if ((this._metaController?.size ?? 0) === 0) {
       if (this._derivedController === void 0) {
         i.merge(e, t, r);
         return;
@@ -128,14 +129,13 @@ const M = class M {
    * Удаляет значение по пути и публикует изменение при наличии данных.
    */
   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) {
+    if ((this._metaController?.size ?? 0) === 0) {
       if (this._derivedController === void 0) {
         r.delete(e, t);
         return;
@@ -145,30 +145,72 @@ const M = class M {
     }
     r.has(e, t) && this._mutateWithMetaLifecycle(() => {
       this._derivedController === void 0 ? r.delete(e, t) : this._mutateDerived(r, "delete", e, void 0, t);
-      const s = this._metaPath(e, t);
-      this._metaController.deleteSubtree(s, "owner-delete"), this._pruneMissingMetaOwners(s, "owner-delete");
+      const i = this._metaPath(e, t);
+      this._metaController.deleteSubtree(i, "owner-delete"), this._pruneMissingMetaOwners(i, "owner-delete");
     });
   }
   /**
    * Выполняет операцию в общей синхронной batch boundary.
    */
   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 && !((o = this._metaController) != null && o.hasWatchers))
+    if (this._derivedController === void 0 && !this._metaController?.hasWatchers)
       return t.batch(e);
     let r, i, s = !1;
     try {
       r = t.batch(() => this._runDerivedBatch(e));
-    } catch (h) {
-      s = !0, i = h;
+    } catch (o) {
+      s = !0, i = o;
     }
     if (s)
       throw i;
     return r;
   }
+  /**
+   * Открывает то же, что `batch()`, для единственного присоединённого Runtime
+   * без closure операции и без массивов: границу этого Runtime и path batch.
+   * Возвращает владельца path batch, которого вызывающий передаёт в
+   * `_closeSoleRuntimeBatch()` после операции.
+   *
+   * Возвращает `undefined` и ничего не открывает в любом другом состоянии:
+   * Kernel разделяют несколько Runtime, граница Runtime уже открыта, есть
+   * derived handles либо metadata watchers, store построен над adapter. Тогда
+   * вызывающий исполняет `batch()`. Состояние читается при входе, как в
+   * `batch()`: то, что появилось во время операции, выход не меняет.
+   * @internal
+   */
+  _openSoleRuntimeBatch(e) {
+    const t = this._pathBatch;
+    if (!(this._soleRuntime !== e || t === void 0 || this._runtimeMutationDepth !== 0 || this._derivedController !== void 0 || this._metaController?.hasWatchers === !0))
+      return this._runtimeMutationDepth++, e._beginKernelBatch?.(), t._openBatch(), t;
+  }
+  /**
+   * Закрывает границу, открытую `_openSoleRuntimeBatch()`, в порядке `batch()`:
+   * публикация path events, затем граница Runtime. Бросает то же, что бросил бы
+   * `batch()` с этой операцией; после успешного выхода возвращает управление.
+   * @internal
+   */
+  _closeSoleRuntimeBatch(e, t, r, i) {
+    let s = r, o = i;
+    try {
+      t._closeBatch(r, i);
+    } catch (n) {
+      s = !0, o = n;
+    }
+    this._runtimeMutationDepth--;
+    try {
+      e._endKernelBatch?.();
+    } catch (n) {
+      throw s ? new AggregateError(
+        [o, n],
+        "[Raph] Kernel mutation and Runtime publication failed."
+      ) : n;
+    }
+    if (s)
+      throw o;
+  }
   /**
    * Подписывает callback на подходящие изменения и возвращает disposer.
    */
@@ -179,15 +221,13 @@ const M = class M {
    * Возвращает metadata указанного data-owner.
    */
   getMeta(e, t, r) {
-    var i;
-    return this._store, t !== void 0 && this._assertMetaNamespace(t), (i = this._metaController) == null ? void 0 : i.get(this._metaPath(e, r), t);
+    return this._store, t !== void 0 && this._assertMetaNamespace(t), this._metaController?.get(this._metaPath(e, r), t);
   }
   /**
    * Проверяет наличие metadata у указанного data-owner.
    */
   hasMeta(e, t, r) {
-    var i;
-    return this._store, t !== void 0 && this._assertMetaNamespace(t), ((i = this._metaController) == null ? void 0 : i.has(this._metaPath(e, r), t)) ?? !1;
+    return this._store, t !== void 0 && this._assertMetaNamespace(t), this._metaController?.has(this._metaPath(e, r), t) ?? !1;
   }
   /**
    * Записывает metadata указанного data-owner.
@@ -217,14 +257,13 @@ const M = class M {
    * Удаляет metadata указанного data-owner.
    */
   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);
+    this._metaController?.delete(i, t, r);
   }
   /**
    * Подписывает runtime adapter на metadata-события Kernel.
@@ -237,33 +276,34 @@ const M = class M {
    * Создаёт управляемое derived-представление source path в target path.
    */
   derive(e) {
-    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 && ((d = this._derivedController) != null && d.has(e.id)))
+    if (e.id !== void 0 && this._derivedController?.has(e.id))
       throw new Error(`[Raph] Duplicate derived id "${e.id}".`);
-    const t = w(e.from), r = w(e.to);
-    if (E(t, r))
+    const t = p(e.from), r = p(e.to);
+    if (A(t, r))
       throw new Error("[Raph] Derived source and target must not overlap.");
-    const i = this._derivedController ?? new q(), s = e.id ?? i.nextId(), o = {
+    const i = this._derivedController ?? new O(), s = e.id ?? i.nextId(), o = {
       ...e,
       from: t.canonical,
       to: r.canonical
-    }, 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);
+    }, n = new S(this, s, o), c = e.strategy?.kind === "collection-by-key" || e.strategy?.kind === "filter-by-key" ? e.strategy : void 0;
+    this._derivedController = i, i.register(n, t, c);
     try {
-      e.immediate !== !1 && h.recompute();
-    } catch (a) {
-      throw this._removeDerived(h), h._disposeFromKernel(), a;
+      e.immediate !== !1 && n.recompute();
+    } catch (l) {
+      throw this._removeDerived(n), n._disposeFromKernel(), l;
     }
-    return h;
+    return n;
   }
   /**
    * Регистрирует runtime, разделяющий этот Kernel.
    * @internal
    */
   _attachRuntime(e) {
-    this._store, (this._runtimes ?? (this._runtimes = /* @__PURE__ */ new Set())).add(e);
+    this._store;
+    const t = this._runtimes ??= /* @__PURE__ */ new Set();
+    t.add(e), this._soleRuntime = t.size === 1 ? e : void 0;
   }
   /**
    * Удаляет runtime из shared Kernel registry.
@@ -271,24 +311,23 @@ const M = class M {
    */
   _detachRuntime(e) {
     const t = this._runtimes;
-    t !== void 0 && (t.delete(e), t.size === 0 && (this._runtimes = void 0));
+    t !== void 0 && (t.delete(e), t.size === 0 && (this._runtimes = void 0), this._soleRuntime = t.size === 1 ? t.values().next().value : void 0);
   }
   /**
    * Освобождает shared runtimes, derived handles и data/meta state Kernel.
    */
   dispose() {
-    var t, r;
     if (this._paths === void 0)
       return;
     const e = [];
     if (this._runtimes !== void 0)
-      for (const i of [...this._runtimes])
+      for (const t of [...this._runtimes])
         try {
-          i.dispose();
-        } catch (s) {
-          e.push(s);
+          t.dispose();
+        } catch (r) {
+          e.push(r);
         }
-    if (this._runtimes = void 0, (t = this._derivedController) == null || t.dispose(), this._derivedController = void 0, (r = this._metaController) == null || r.dispose(), this._metaController = void 0, this._paths = void 0, e.length === 1)
+    if (this._runtimes = void 0, this._soleRuntime = void 0, this._derivedController?.dispose(), this._derivedController = void 0, this._metaController?.dispose(), this._metaController = void 0, this._paths = void 0, this._pathBatch = void 0, e.length === 1)
       throw e[0];
     if (e.length > 1)
       throw new AggregateError(e, `[Raph] Kernel "${this.id}" disposal failed.`);
@@ -320,15 +359,14 @@ const M = class M {
     throw new Error(`[Raph] Kernel "${this.id}" is disposed.`);
   }
   get _metadata() {
-    return this._store, this._metaController ?? (this._metaController = new j(
+    return this._store, this._metaController ??= new W(
       this,
       (e) => this.has(e),
       () => 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();
@@ -336,22 +374,22 @@ const M = class M {
     let s, o = !1;
     this._runtimeMutationDepth++;
     try {
-      for (const u of t)
-        (h = u._beginKernelBatch) == null || h.call(u), r.push(u);
+      for (const n of t)
+        n._beginKernelBatch?.(), r.push(n);
       try {
         s = e();
-      } catch (u) {
-        o = !0, i.push(u);
+      } catch (n) {
+        o = !0, i.push(n);
       }
-    } catch (u) {
-      o = !0, i.push(u);
+    } catch (n) {
+      o = !0, i.push(n);
     } finally {
       this._runtimeMutationDepth--;
-      for (let u = r.length - 1; u >= 0; u--)
+      for (let n = r.length - 1; n >= 0; n--)
         try {
-          (d = (l = r[u])._endKernelBatch) == null || d.call(l);
-        } catch (m) {
-          i.push(m);
+          r[n]._endKernelBatch?.();
+        } catch (c) {
+          i.push(c);
         }
     }
     if (i.length === 1)
@@ -367,14 +405,14 @@ const M = class M {
     const s = this._derivedController;
     if (s === void 0 || this._derivedWriteDepth !== 0)
       return;
-    const o = w(t, i);
-    for (const h of s.values()) {
-      const l = w(h.options.to);
-      if (!E(o, l))
+    const o = p(t, i);
+    for (const n of s.values()) {
+      const c = p(n.options.to);
+      if (!A(o, c))
         continue;
-      const d = o.segments.length < l.segments.length;
-      if (!(e === "merge" && d && !U(r, l.segments[o.segments.length])))
-        throw new $(o.canonical);
+      const l = o.segments.length < c.segments.length;
+      if (!(e === "merge" && l && !$(r, c.segments[o.segments.length])))
+        throw new T(o.canonical);
     }
   }
   _writeDerivedTarget(e, t) {
@@ -386,17 +424,16 @@ const M = class M {
     }
   }
   _mutateDerived(e, t, r, i, s) {
-    const o = w(r, s);
+    const o = p(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();
     });
   }
   _runDerivedBatch(e) {
-    var u;
-    let t = !1, r, i = !1, s, o = !1, h, l;
+    let t = !1, r, i = !1, s, o = !1, n, c;
     this._batchDepth++;
     try {
-      l = e();
+      c = e();
     } catch (m) {
       t = !0, r = m;
     } finally {
@@ -408,21 +445,21 @@ const M = class M {
             i = !0, s = m;
           }
         try {
-          (u = this._metaController) == null || u.publish();
+          this._metaController?.publish();
         } catch (m) {
-          o = !0, h = m;
+          o = !0, n = m;
         }
       }
     }
-    const d = [];
-    if (t && d.push(r), i && d.push(s), o && d.push(h), d.length > 1)
+    const l = [];
+    if (t && l.push(r), i && l.push(s), o && l.push(n), l.length > 1)
       throw new AggregateError(
-        d,
+        l,
         "[Raph] Kernel batch publication failed."
       );
-    if (d.length === 1)
-      throw d[0];
-    return l;
+    if (l.length === 1)
+      throw l[0];
+    return c;
   }
   _mutateWithMetaLifecycle(e) {
     if (this._batchDepth !== 0 || this._stabilizing) {
@@ -432,11 +469,10 @@ const M = class M {
     this.batch(e);
   }
   _pruneMissingMetaOwners(e, t, r) {
-    var i;
-    (i = this._metaController) == null || i.pruneMissing(this._metaPath(e, r), t);
+    this._metaController?.pruneMissing(this._metaPath(e, r), t);
   }
   _metaPath(e, t) {
-    return T.from(e, t);
+    return B.from(e, t);
   }
   _exactMetaPath(e, t) {
     const r = this._metaPath(e, t);
@@ -453,19 +489,17 @@ const M = class M {
       throw new Error(`[RaphMeta] Owner data path does not exist: "${e}".`);
   }
   _queueDerived(e) {
-    var t;
-    (t = this._derivedController) == null || t.queue(e);
+    this._derivedController?.queue(e);
   }
   _queueDerivedReplacement(e, t) {
-    var r;
-    (r = this._derivedController) == null || r.queueReplacement(e, t);
+    this._derivedController?.queueReplacement(e, t);
   }
   _replaceDerivedTarget(e, t, r) {
-    const i = w(e);
+    const i = p(e);
     this._store.set(i.canonical, t), this._queueDerivedReplacement(i, r);
   }
   _stabilizeDerived() {
-    const e = this._derivedController, t = e == null ? void 0 : e.pending;
+    const e = this._derivedController, t = e?.pending;
     if (t === void 0 || t.size === 0)
       return;
     this._stabilizing = !0;
@@ -486,12 +520,11 @@ const M = class M {
     } catch (i) {
       throw t.clear(), i;
     } finally {
-      this._stabilizing = !1, e == null || e.clearPendingIfEmpty();
+      this._stabilizing = !1, e?.clearPendingIfEmpty();
     }
   }
   _recomputePendingDerived(e) {
-    var r;
-    const t = (r = this._derivedController) == null ? void 0 : r.state(e);
+    const t = this._derivedController?.state(e);
     if (t === void 0 || !t.initialized || t.full) {
       this._recomputeDerivedFull(e);
       return;
@@ -499,61 +532,60 @@ const M = class M {
     t.kind === "filter-by-key" ? this._recomputeDerivedFilter(e, t) : this._recomputeDerivedCollection(e, t);
   }
   _recomputeDerivedFull(e) {
-    var l;
-    const t = (l = this._derivedController) == null ? void 0 : l.state(e);
+    const t = this._derivedController?.state(e);
     t !== void 0 && (t.full = !0);
     const r = this.get(e.options.from), i = e.options.compute(r);
-    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());
+    let s = i, o, n;
+    t !== void 0 && (r === void 0 && (i === void 0 || Array.isArray(i) && i.length === 0) ? (o = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map()) : (t.kind === "filter-by-key" ? (I(e.id, t.key, r, i), s = M(i)) : E(e.id, t.key, r, i), o = w(r, t.key, "source"), n = w(s, t.key, "output"))), this._writeDerivedTarget(e.options.to, s), t !== void 0 && (t.sourceIndex = o, t.targetIndex = n, 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 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"));
+      throw D(e.id, "requires array source and target");
+    (t.sourceIndex === void 0 || x(r, t.key, t.sourceIndex, t.keys)) && (t.sourceIndex = w(r, t.key, "source"));
     const s = t.targetIndex;
     if (s === void 0)
-      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] });
+      throw D(e.id, "has no materialized target index");
+    const o = [], n = [];
+    for (const h of t.keys) {
+      const _ = t.sourceIndex.get(h);
+      _ === void 0 ? n.push(h) : o.push({ key: h, index: _, item: r[_] });
     }
-    o.sort((a, g) => a.index - g.index);
-    const l = o.map((a) => a.item), d = l.length === 0 ? [] : e.options.compute(l);
-    B(
+    o.sort((h, _) => h.index - _.index);
+    const c = o.map((h) => h.item), l = c.length === 0 ? [] : e.options.compute(c);
+    F(
       e.id,
       t.key,
-      o.map((a) => a.key),
-      d
+      o.map((h) => h.key),
+      l
     );
-    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];
+    const m = l;
+    if (n.length !== 0 || o.some((h) => !s.has(h.key))) {
+      const h = /* @__PURE__ */ new Map();
+      for (let u = 0; u < o.length; u++)
+        h.set(o[u].key, m[u]);
+      const _ = /* @__PURE__ */ new Map();
+      for (const [u, v] of s)
+        _.set(u, i[v]);
+      const a = b(r, t.key, "source"), d = [];
+      d.length = a.length;
+      for (let u = 0; u < a.length; u++) {
+        const v = a[u];
         if (v === void 0)
           continue;
-        const D = a.has(v) ? a.get(v) : g.get(v);
-        if (D === void 0)
-          throw b(e.id, `is missing target item for key "${String(v)}"`);
-        c[f] = D;
+        const k = h.has(v) ? h.get(v) : _.get(v);
+        if (k === void 0)
+          throw D(e.id, `is missing target item for key "${String(v)}"`);
+        d[u] = k;
       }
-      const p = k(c, t.key, "target");
-      this._replaceDerivedTarget(e.options.to, c, t.keys), t.targetIndex = p;
+      const g = w(d, t.key, "target");
+      this._replaceDerivedTarget(e.options.to, d, t.keys), t.targetIndex = g;
     } else
-      for (let a = 0; a < o.length; a++)
+      for (let h = 0; h < o.length; h++)
         this._writeDerivedTarget(
-          A(e.options.to, t.key, o[a].key),
-          u[a]
+          C(e.options.to, t.key, o[h].key),
+          m[h]
         );
     t.keys.clear(), t.full = !1;
   }
@@ -561,127 +593,124 @@ const M = class M {
     t.full = !0;
     const r = this.get(e.options.from), i = this.get(e.options.to);
     if (!Array.isArray(r) || !Array.isArray(i))
-      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"));
+      throw R(e.id, "requires array source and target");
+    (t.sourceIndex === void 0 || x(r, t.key, t.sourceIndex, t.keys)) && (t.sourceIndex = w(r, t.key, "source"));
     const s = t.targetIndex;
     if (s === void 0)
-      throw P(e.id, "has no materialized target index");
+      throw R(e.id, "has no materialized target index");
     const o = [];
-    for (const n of t.keys) {
-      const c = t.sourceIndex.get(n);
-      c !== void 0 && o.push({ key: n, index: c, item: r[c] });
+    for (const a of t.keys) {
+      const d = t.sourceIndex.get(a);
+      d !== void 0 && o.push({ key: a, index: d, item: r[d] });
     }
-    o.sort((n, c) => n.index - c.index);
-    const h = o.map((n) => n.item), l = h.length === 0 ? [] : e.options.compute(h);
+    o.sort((a, d) => a.index - d.index);
+    const n = o.map((a) => a.item), c = n.length === 0 ? [] : e.options.compute(n);
     K(
       e.id,
       t.key,
-      o.map((n) => n.key),
-      l
+      o.map((a) => a.key),
+      c
     );
-    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 l = /* @__PURE__ */ new Map(), m = c, y = b(m, t.key, "output");
+    for (let a = 0; a < y.length; a++) {
+      const d = y[a];
+      d !== void 0 && l.set(d, M(m[a]));
     }
-    const a = /* @__PURE__ */ new Set();
-    let g = !1;
-    for (const n of t.keys) {
-      const c = s.has(n), p = d.has(n);
-      !c && !p || (a.add(n), c !== p && (g = !0));
+    const h = /* @__PURE__ */ new Set();
+    let _ = !1;
+    for (const a of t.keys) {
+      const d = s.has(a), g = l.has(a);
+      !d && !g || (h.add(a), d !== g && (_ = !0));
     }
-    if (g && t.keys.size === 1 && i.length === s.size && this._patchSingleFilterMembership(
+    if (_ && t.keys.size === 1 && i.length === s.size && this._patchSingleFilterMembership(
       e,
       t,
       i,
       s,
-      d,
-      a
+      l,
+      h
     )) {
       t.keys.clear(), t.full = !1;
       return;
     }
-    if (g) {
-      const n = /* @__PURE__ */ new Map();
-      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));
+    if (_) {
+      const a = /* @__PURE__ */ new Map();
+      for (const [u, v] of s)
+        a.set(u, i[v]);
+      const d = [];
+      for (const u of b(r, t.key, "source"))
+        if (u !== void 0) {
+          if (t.keys.has(u)) {
+            l.has(u) && d.push(l.get(u));
             continue;
           }
-          n.has(f) && c.push(n.get(f));
+          a.has(u) && d.push(a.get(u));
         }
-      const p = k(c, t.key, "target");
-      this._replaceDerivedTarget(e.options.to, c, a), t.targetIndex = p;
+      const g = w(d, t.key, "target");
+      this._replaceDerivedTarget(e.options.to, d, h), t.targetIndex = g;
     } else
-      for (const [n, c] of d)
-        this._writeDerivedTarget(A(e.options.to, t.key, n), c);
+      for (const [a, d] of l)
+        this._writeDerivedTarget(C(e.options.to, t.key, a), d);
     t.keys.clear(), t.full = !1;
   }
   _patchSingleFilterMembership(e, t, r, i, s, o) {
-    const h = t.sourceIndex;
-    if (h === void 0)
+    const n = t.sourceIndex;
+    if (n === void 0)
       return !1;
-    const l = t.keys.values().next().value;
-    if (l === void 0)
+    const c = t.keys.values().next().value;
+    if (c === void 0)
       return !1;
-    const d = i.get(l), u = s.has(l);
-    if (d !== void 0 === u)
+    const l = i.get(c), m = s.has(c);
+    if (l !== void 0 === m)
       return !1;
-    const m = r.slice();
-    let a;
-    if (d !== void 0)
-      a = d, m.splice(a, 1);
+    const y = r.slice();
+    let h;
+    if (l !== void 0)
+      h = l, y.splice(h, 1);
     else {
-      const g = h.get(l);
-      if (g === void 0)
+      const _ = n.get(c);
+      if (_ === void 0)
         return !1;
-      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))
+      let a = 0, d = y.length;
+      for (; a < d; ) {
+        const g = a + d >>> 1, u = y[g];
+        if (typeof u != "object" || u === null || Array.isArray(u))
           return !1;
-        const v = f[t.key];
+        const v = u[t.key];
         if (typeof v != "string" && typeof v != "number")
           return !1;
-        const D = h.get(v);
-        if (D === void 0)
+        const k = n.get(v);
+        if (k === void 0)
           return !1;
-        D < g ? n = p + 1 : c = p;
+        k < _ ? a = g + 1 : d = g;
       }
-      a = n, m.splice(a, 0, s.get(l));
+      h = a, y.splice(h, 0, s.get(c));
     }
-    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);
+    if (this._replaceDerivedTarget(e.options.to, y, o), l !== void 0) {
+      i.delete(c);
+      for (const [_, a] of i)
+        a > h && i.set(_, a - 1);
     } else {
-      for (const [g, n] of i)
-        n >= a && i.set(g, n + 1);
-      i.set(l, a);
+      for (const [_, a] of i)
+        a >= h && i.set(_, a + 1);
+      i.set(c, h);
     }
     return !0;
   }
-};
-// Формирует локальный id для Kernel без явно заданного имени.
-y(M, "_kernelCounter", 0);
-let I = M;
-function E(_, e) {
-  const t = Math.min(_.segments.length, e.segments.length);
+}
+function A(f, e) {
+  const t = Math.min(f.segments.length, e.segments.length);
   for (let r = 0; r < t; r++)
-    if (!V(_.segments[r], e.segments[r]))
+    if (!j(f.segments[r], e.segments[r]))
       return !1;
   return !0;
 }
-function U(_, e) {
-  return typeof _ != "object" || _ === null || Array.isArray(_) || e.kind !== "key" ? !0 : Object.hasOwn(_, e.key);
+function $(f, e) {
+  return typeof f != "object" || f === null || Array.isArray(f) || e.kind !== "key" ? !0 : Object.hasOwn(f, e.key);
 }
-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);
+function j(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);
 }
 export {
-  I as RaphKernel
+  P as RaphKernel
 };