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

package/dist/debug/path/DataPath.js

@@ -1,60 +1,59 @@
-var v = Object.defineProperty;
-var S = (n, e, t) => e in n ? v(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t;
-var o = (n, e, t) => S(n, typeof e != "symbol" ? e + "" : e, t);
-const u = class u {
+class u {
+  // Переиспользует immutable экземпляры для одинаковых canonical paths.
+  static _cache;
+  // Хранят canonical value и разобранные сегменты пути.
+  _canonical;
+  _segments;
+  // Кешируют проверенные exact и mask представления.
+  _exact;
+  _mask;
   /**
    * Сохраняет уже разобранный immutable path value.
    */
-  constructor(e, t) {
-    // Хранят canonical value и разобранные сегменты пути.
-    o(this, "_canonical");
-    o(this, "_segments");
-    // Кешируют проверенные exact и mask представления.
-    o(this, "_exact");
-    o(this, "_mask");
+  constructor(e, n) {
     this._canonical = e, this._segments = Object.freeze(
-      t.map((r) => Object.freeze({ ...r }))
+      n.map((i) => Object.freeze({ ...i }))
     );
   }
   /**
    * Нормализует поддерживаемое определение пути в DataPath.
    */
-  static from(e, t) {
-    return e instanceof u ? e : typeof e == "string" ? this.fromString(e, t) : this.fromPlain(e);
+  static from(e, n) {
+    return e instanceof u ? e : typeof e == "string" ? this.fromString(e, n) : this.fromPlain(e);
   }
   /**
    * Разбирает строковый path согласно строгой грамматике.
    */
-  static fromString(e, t) {
-    const r = m(
+  static fromString(e, n) {
+    const i = g(
       e,
-      t == null ? void 0 : t.vars,
+      n?.vars,
       !0,
-      (t == null ? void 0 : t.wildcardDynamic) === !0,
+      n?.wildcardDynamic === !0,
       !0
-    ), s = this._cache ?? (this._cache = /* @__PURE__ */ new Map()), i = s.get(r.canonical);
-    if (i !== void 0)
-      return i;
+    ), s = this._cache ??= /* @__PURE__ */ new Map(), r = s.get(i.canonical);
+    if (r !== void 0)
+      return r;
     s.size >= 2e4 && s.clear();
-    const c = new u(r.canonical, r.segments);
-    return s.set(r.canonical, c), c;
+    const c = new u(i.canonical, i.segments);
+    return s.set(i.canonical, c), c;
   }
   /**
    * Восстанавливает DataPath из сериализованного представления.
    */
   static fromPlain(e) {
-    const r = (Array.isArray(e.segs) ? e.segs : []).map(O);
-    return new u(w(r), r);
+    const i = (Array.isArray(e.segs) ? e.segs : []).map(A);
+    return new u(m(i), i);
   }
   /**
    * Разбирает строку exact path без создания публичного value object.
    * @internal
    */
-  static _parseExactString(e, t) {
-    const r = m(e, t == null ? void 0 : t.vars, !1, !1, !0);
+  static _parseExactString(e, n) {
+    const i = g(e, n?.vars, !1, !1, !0);
     return {
-      canonical: r.canonical,
-      segments: r.segments
+      canonical: i.canonical,
+      segments: i.segments
     };
   }
   /**
@@ -62,19 +61,19 @@ const u = class u {
    * @internal
    */
   static _parseMaskString(e) {
-    const t = m(e, void 0, !0, !1, !0);
-    for (let i = 0; i < t.segments.length - 1; i++) {
-      const c = t.segments[i];
+    const n = g(e, void 0, !0, !1, !0);
+    for (let r = 0; r < n.segments.length - 1; r++) {
+      const c = n.segments[r];
       if (c.kind === "wildcard" && !c.indexed)
         throw new TypeError(
           `[Raph] Dot wildcard must be the final mask segment: "${e}".`
         );
     }
-    const r = t.segments[t.segments.length - 1], s = (r == null ? void 0 : r.kind) === "wildcard" && !r.indexed;
+    const i = n.segments[n.segments.length - 1], s = i?.kind === "wildcard" && !i.indexed;
     return {
-      canonical: t.canonical,
+      canonical: n.canonical,
       deep: s,
-      segments: s ? t.segments.slice(0, -1) : t.segments
+      segments: s ? n.segments.slice(0, -1) : n.segments
     };
   }
   /**
@@ -82,7 +81,7 @@ const u = class u {
    * @internal
    */
   static _renderSegments(e) {
-    return w(e);
+    return m(e);
   }
   /**
    * Сериализует path в независимое plain-представление.
@@ -90,7 +89,7 @@ const u = class u {
   toPlain() {
     return {
       segs: this._segments.map((e) => e.kind === "key" ? { t: "key", k: e.key } : e.kind === "index" ? { t: "idx", i: e.index } : e.kind === "selector" ? { t: "param", pk: e.key, pv: e.value } : { t: "wc", indexed: e.indexed }),
-      deepOnTail: b(this._segments)
+      deepOnTail: _(this._segments)
     };
   }
   /**
@@ -114,18 +113,18 @@ const u = class u {
   /**
    * Проверяет соответствие exact path указанной маске.
    */
-  static match(e, t) {
-    const r = this.from(e)._segments, s = this.from(t)._segments;
-    let i = 0;
-    for (; i < r.length; i++) {
-      const c = r[i];
-      if (c.kind === "wildcard" && !c.indexed && i === r.length - 1)
+  static match(e, n) {
+    const i = this.from(e)._segments, s = this.from(n)._segments;
+    let r = 0;
+    for (; r < i.length; r++) {
+      const c = i[r];
+      if (c.kind === "wildcard" && !c.indexed && r === i.length - 1)
         return !0;
-      const a = s[i];
-      if (a === void 0 || !j(c, a))
+      const a = s[r];
+      if (a === void 0 || !N(c, a))
         return !1;
     }
-    return i === s.length;
+    return r === s.length;
   }
   /**
    * Возвращает exact path либо отклоняет wildcard-сегменты.
@@ -134,261 +133,258 @@ const u = class u {
   _asExact() {
     for (const e of this._segments)
       if (e.kind === "wildcard")
-        throw y(this._canonical);
-    return this._exact ?? (this._exact = {
+        throw w(this._canonical);
+    return this._exact ??= {
       canonical: this._canonical,
       segments: this._segments
-    });
+    };
   }
   /**
    * Возвращает path mask с проверкой позиции wildcard.
    * @internal
    */
   _asMask() {
-    for (let t = 0; t < this._segments.length - 1; t++) {
-      const r = this._segments[t];
-      if (r.kind === "wildcard" && !r.indexed)
+    for (let n = 0; n < this._segments.length - 1; n++) {
+      const i = this._segments[n];
+      if (i.kind === "wildcard" && !i.indexed)
         throw new TypeError(
           `[Raph] Dot wildcard must be the final mask segment: "${this._canonical}".`
         );
     }
-    const e = b(this._segments);
-    return this._mask ?? (this._mask = {
+    const e = _(this._segments);
+    return this._mask ??= {
       canonical: this._canonical,
       deep: e,
       segments: e ? this._segments.slice(0, -1) : this._segments
-    });
+    };
   }
-};
-// Переиспользует immutable экземпляры для одинаковых canonical paths.
-o(u, "_cache");
-let k = u;
-function m(n, e, t, r = !1, s = !1) {
-  const i = n.trim();
-  if (i.length === 0) {
+}
+function g(t, e, n, i = !1, s = !1) {
+  const r = t.trim();
+  if (r.length === 0) {
     if (s)
       return { canonical: "", segments: [] };
     throw new TypeError("[Raph] Data path must not be empty.");
   }
   const c = [];
-  let a = 0, l = !0;
-  for (; a < i.length; ) {
-    const x = i[a];
-    if (x === ".") {
-      if (l)
-        throw d(n);
-      l = !0, a++;
+  let a = 0, o = !0;
+  for (; a < r.length; ) {
+    const y = r[a];
+    if (y === ".") {
+      if (o)
+        throw l(t);
+      o = !0, a++;
       continue;
     }
-    if (x === "[") {
-      const _ = E(i, a);
-      c.push(T(
-        i.slice(a + 1, _),
+    if (y === "[") {
+      const x = b(r, a);
+      c.push($(
+        r.slice(a + 1, x),
         e,
-        t,
-        r
-      )), a = _ + 1, l = !1;
+        n,
+        i
+      )), a = x + 1, o = !1;
       continue;
     }
-    if (!l)
-      throw d(n);
-    let f = a;
-    for (; f < i.length && i[f] !== "." && i[f] !== "["; )
-      f++;
-    const h = i.slice(a, f).trim();
-    if (h.length === 0)
-      throw d(n);
-    if (h === "*") {
-      if (!t)
-        throw y(n);
+    if (!o)
+      throw l(t);
+    let d = a;
+    for (; d < r.length && r[d] !== "." && r[d] !== "["; )
+      d++;
+    const f = r.slice(a, d).trim();
+    if (f.length === 0)
+      throw l(t);
+    if (f === "*") {
+      if (!n)
+        throw w(t);
       c.push({ kind: "wildcard", indexed: !1 });
-    } else r && h.startsWith("$") && !g(h.slice(1), e) ? c.push({ kind: "wildcard", indexed: !1 }) : c.push({ kind: "key", key: N(h, e) });
-    a = f, l = !1;
+    } else i && f.startsWith("$") && !h(f.slice(1), e) ? c.push({ kind: "wildcard", indexed: !1 }) : c.push({ kind: "key", key: T(f, e) });
+    a = d, o = !1;
   }
-  if (l || c.length === 0)
-    throw d(n);
-  return { canonical: w(c), segments: c };
+  if (o || c.length === 0)
+    throw l(t);
+  return { canonical: m(c), segments: c };
 }
-function E(n, e) {
-  let t, r = 1;
-  for (let s = e + 1; s < n.length; s++) {
-    const i = n[s];
-    if (i === "\\") {
+function b(t, e) {
+  let n, i = 1;
+  for (let s = e + 1; s < t.length; s++) {
+    const r = t[s];
+    if (r === "\\") {
       s++;
       continue;
     }
-    if (t !== void 0) {
-      i === t && (t = void 0);
+    if (n !== void 0) {
+      r === n && (n = void 0);
       continue;
     }
-    if (i === '"' || i === "'") {
-      t = i;
+    if (r === '"' || r === "'") {
+      n = r;
       continue;
     }
-    if (i === "[") {
-      r++;
+    if (r === "[") {
+      i++;
       continue;
     }
-    if (i === "]" && --r === 0)
+    if (r === "]" && --i === 0)
       return s;
   }
-  throw d(n);
+  throw l(t);
 }
-function T(n, e, t, r) {
-  const s = n.trim();
+function $(t, e, n, i) {
+  const s = t.trim();
   if (s === "*") {
-    if (!t)
-      throw y(`[${n}]`);
+    if (!n)
+      throw w(`[${t}]`);
     return { kind: "wildcard", indexed: !0 };
   }
   if (/^\d+$/.test(s))
     return { kind: "index", index: Number(s) };
   if (/^\$[A-Z_$][\w$]*$/i.test(s)) {
-    if (r && !g(s.slice(1), e))
+    if (i && !h(s.slice(1), e))
       return { kind: "wildcard", indexed: !0 };
-    const l = p(s.slice(1), e);
-    if (!Number.isInteger(l) || l < 0)
+    const o = p(s.slice(1), e);
+    if (!Number.isInteger(o) || o < 0)
       throw new TypeError(`[Raph] Index variable "${s}" must be a non-negative integer.`);
-    return { kind: "index", index: l };
+    return { kind: "index", index: o };
   }
-  const i = R(s);
-  if (i === -1)
-    throw d(`[${n}]`);
-  const c = s.slice(0, i).trim(), a = s.slice(i + 1).trim();
+  const r = v(s);
+  if (r === -1)
+    throw l(`[${t}]`);
+  const c = s.slice(0, r).trim(), a = s.slice(r + 1).trim();
   if (!c || !a)
-    throw d(`[${n}]`);
-  return r && I(a, e) ? { kind: "wildcard", indexed: !0 } : {
+    throw l(`[${t}]`);
+  return i && R(a, e) ? { kind: "wildcard", indexed: !0 } : {
     kind: "selector",
     key: c,
-    value: A(a, e)
+    value: S(a, e)
   };
 }
-function R(n) {
+function v(t) {
   let e;
-  for (let t = 0; t < n.length; t++) {
-    const r = n[t];
-    if (r === "\\") {
-      t++;
+  for (let n = 0; n < t.length; n++) {
+    const i = t[n];
+    if (i === "\\") {
+      n++;
       continue;
     }
     if (e !== void 0) {
-      r === e && (e = void 0);
+      i === e && (e = void 0);
       continue;
     }
-    if (r === '"' || r === "'")
-      e = r;
-    else if (r === "=")
-      return t;
+    if (i === '"' || i === "'")
+      e = i;
+    else if (i === "=")
+      return n;
   }
   return -1;
 }
-function A(n, e) {
-  if (/^\$[A-Z_$][\w$]*$/i.test(n)) {
-    const t = p(n.slice(1), e);
-    if (t === null || typeof t == "string" || typeof t == "boolean" || typeof t == "number" && Number.isFinite(t))
-      return t;
-    throw new TypeError(`[Raph] Selector variable "${n}" must be scalar.`);
+function S(t, e) {
+  if (/^\$[A-Z_$][\w$]*$/i.test(t)) {
+    const n = p(t.slice(1), e);
+    if (n === null || typeof n == "string" || typeof n == "boolean" || typeof n == "number" && Number.isFinite(n))
+      return n;
+    throw new TypeError(`[Raph] Selector variable "${t}" must be scalar.`);
   }
-  if (n[0] === '"' || n[0] === "'")
-    return P(n);
-  if (/^-?(?:\d+(?:\.\d*)?|\.\d+)$/.test(n)) {
-    const t = Number(n);
-    if (Number.isFinite(t))
-      return t;
+  if (t[0] === '"' || t[0] === "'")
+    return E(t);
+  if (/^-?(?:\d+(?:\.\d*)?|\.\d+)$/.test(t)) {
+    const n = Number(t);
+    if (Number.isFinite(n))
+      return n;
   }
-  return n === "true" ? !0 : n === "false" ? !1 : n === "null" ? null : n;
+  return t === "true" ? !0 : t === "false" ? !1 : t === "null" ? null : t;
 }
-function P(n) {
-  const e = n[0];
-  if (n.length < 2 || n[n.length - 1] !== e)
-    throw d(n);
+function E(t) {
+  const e = t[0];
+  if (t.length < 2 || t[t.length - 1] !== e)
+    throw l(t);
   if (e === '"')
     try {
-      const r = JSON.parse(n);
-      if (typeof r == "string")
-        return r;
+      const i = JSON.parse(t);
+      if (typeof i == "string")
+        return i;
     } catch {
-      throw d(n);
+      throw l(t);
     }
-  let t = "";
-  for (let r = 1; r < n.length - 1; r++) {
-    const s = n[r];
+  let n = "";
+  for (let i = 1; i < t.length - 1; i++) {
+    const s = t[i];
     if (s === "\\") {
-      if (r++, r >= n.length - 1)
-        throw d(n);
-      t += n[r];
+      if (i++, i >= t.length - 1)
+        throw l(t);
+      n += t[i];
     } else
-      t += s;
+      n += s;
   }
-  return t;
+  return n;
 }
-function N(n, e) {
-  if (!n.startsWith("$"))
-    return n;
-  const t = p(n.slice(1), e);
-  if (typeof t != "string" && typeof t != "number")
-    throw new TypeError(`[Raph] Key variable "${n}" must be a string or number.`);
-  const r = String(t);
-  if (!r || r.includes(".") || r.includes("[") || r.includes("]"))
-    throw new TypeError(`[Raph] Key variable "${n}" contains path syntax.`);
-  return r;
+function T(t, e) {
+  if (!t.startsWith("$"))
+    return t;
+  const n = p(t.slice(1), e);
+  if (typeof n != "string" && typeof n != "number")
+    throw new TypeError(`[Raph] Key variable "${t}" must be a string or number.`);
+  const i = String(n);
+  if (!i || i.includes(".") || i.includes("[") || i.includes("]"))
+    throw new TypeError(`[Raph] Key variable "${t}" contains path syntax.`);
+  return i;
 }
-function p(n, e) {
-  if (!g(n, e))
-    throw new TypeError(`[Raph] Missing path variable "${n}".`);
-  return e[n];
+function p(t, e) {
+  if (!h(t, e))
+    throw new TypeError(`[Raph] Missing path variable "${t}".`);
+  return e[t];
 }
-function g(n, e) {
-  return e !== void 0 && Object.hasOwn(e, n);
+function h(t, e) {
+  return e !== void 0 && Object.hasOwn(e, t);
 }
-function I(n, e) {
-  for (const t of n.matchAll(/\$([A-Z_$][\w$]*)/gi))
-    if (!g(t[1], e))
+function R(t, e) {
+  for (const n of t.matchAll(/\$([A-Z_$][\w$]*)/gi))
+    if (!h(n[1], e))
       return !0;
   return !1;
 }
-function O(n) {
-  if (typeof n != "object" || n === null)
-    throw $();
-  const e = n;
+function A(t) {
+  if (typeof t != "object" || t === null)
+    throw k();
+  const e = t;
   if (e.t === "key" && typeof e.k == "string")
     return { kind: "key", key: e.k };
   if (e.t === "idx" && typeof e.i == "number" && Number.isInteger(e.i) && e.i >= 0)
     return { kind: "index", index: e.i };
   if (e.t === "wc")
     return { kind: "wildcard", indexed: e.indexed === !0 };
-  if (e.t === "param" && typeof e.pk == "string" && M(e.pv))
+  if (e.t === "param" && typeof e.pk == "string" && P(e.pv))
     return { kind: "selector", key: e.pk, value: e.pv };
-  throw $();
+  throw k();
 }
-function M(n) {
-  return n === null || typeof n == "string" || typeof n == "boolean" || typeof n == "number" && Number.isFinite(n);
+function P(t) {
+  return t === null || typeof t == "string" || typeof t == "boolean" || typeof t == "number" && Number.isFinite(t);
 }
-function b(n) {
-  const e = n[n.length - 1];
-  return (e == null ? void 0 : e.kind) === "wildcard" && !e.indexed;
+function _(t) {
+  const e = t[t.length - 1];
+  return e?.kind === "wildcard" && !e.indexed;
 }
-function j(n, e) {
-  return n.kind === "wildcard" ? !n.indexed || e.kind === "index" || e.kind === "selector" : n.kind !== e.kind ? !1 : n.kind === "key" ? n.key === e.key : n.kind === "index" ? n.index === e.index : n.key === e.key && Object.is(n.value, e.value);
+function N(t, e) {
+  return t.kind === "wildcard" ? !t.indexed || e.kind === "index" || e.kind === "selector" : t.kind !== e.kind ? !1 : t.kind === "key" ? t.key === e.key : t.kind === "index" ? t.index === e.index : t.key === e.key && Object.is(t.value, e.value);
 }
-function w(n) {
+function m(t) {
   let e = "";
-  for (const t of n)
-    t.kind === "key" ? e += e ? `.${t.key}` : t.key : t.kind === "index" ? e += `[${t.index}]` : t.kind === "selector" ? e += `[${t.key}=${C(t.value)}]` : e += t.indexed ? "[*]" : e ? ".*" : "*";
+  for (const n of t)
+    n.kind === "key" ? e += e ? `.${n.key}` : n.key : n.kind === "index" ? e += `[${n.index}]` : n.kind === "selector" ? e += `[${n.key}=${I(n.value)}]` : e += n.indexed ? "[*]" : e ? ".*" : "*";
   return e;
 }
-function C(n) {
-  return typeof n == "string" ? JSON.stringify(n) : String(n);
+function I(t) {
+  return typeof t == "string" ? JSON.stringify(t) : String(t);
 }
-function d(n) {
-  return new TypeError(`[Raph] Invalid data path "${n}".`);
+function l(t) {
+  return new TypeError(`[Raph] Invalid data path "${t}".`);
 }
-function $() {
+function k() {
   return new TypeError("[Raph] Invalid plain DataPath representation.");
 }
-function y(n) {
-  return new TypeError(`[Raph] Wildcard is only allowed in watch masks: "${n}".`);
+function w(t) {
+  return new TypeError(`[Raph] Wildcard is only allowed in watch masks: "${t}".`);
 }
 export {
-  k as DataPath
+  u as DataPath
 };

package/dist/debug/path/PathRouter.cjs

@@ -1 +1 @@
-"use strict";var u=Object.defineProperty;var x=(n,t,i)=>t in n?u(n,t,{enumerable:!0,configurable:!0,writable:!0,value:i}):n[t]=i;var p=(n,t,i)=>x(n,typeof t!="symbol"?t+"":t,i);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const h=require("./pathSegmentKey.cjs");class g{constructor(){p(this,"_root",{})}add(t,i){let e=this._root;const o=[];for(const c of t.segments)if(c.kind==="wildcard"){const d=e.indexedWildcard??(e.indexedWildcard={});o.push({child:d,parent:e,indexedWildcard:!0}),e=d}else{const d=h.pathSegmentKey(c),a=e.exact??(e.exact=new Map);let s=a.get(d);s===void 0&&(s={},a.set(d,s)),o.push({child:s,key:d,parent:e,indexedWildcard:!1}),e=s}const r=t.deep?e.deep??(e.deep=new Set):e.end??(e.end=new Set);r.add(i);let l=!0;return()=>{if(l){l=!1,r.delete(i),r.size===0&&(t.deep?e.deep=void 0:e.end=void 0);for(let c=o.length-1;c>=0;c--){const d=o[c];if(!v(d.child))break;d.indexedWildcard?d.parent.indexedWildcard=void 0:(d.parent.exact.delete(d.key),d.parent.exact.size===0&&(d.parent.exact=void 0))}}}}match(t){var o;let i=[this._root];const e=new Set;for(let r=0;r<=t.length;r++){const l=r===t.length,c=[];for(const d of i){if(f(e,d.deep),l){f(e,d.end);continue}const a=t[r],s=(o=d.exact)==null?void 0:o.get(h.pathSegmentKey(a));s!==void 0&&c.push(s),d.indexedWildcard!==void 0&&(a.kind==="index"||a.kind==="selector")&&c.push(d.indexedWildcard)}if(l||(i=c,i.length===0))break}return e}matchAll(){const t=new Set,i=[this._root];for(;i.length;){const e=i.pop();if(f(t,e.deep),f(t,e.end),e.indexedWildcard!==void 0&&i.push(e.indexedWildcard),e.exact!==void 0)for(const o of e.exact.values())i.push(o)}return t}}function f(n,t){if(t!==void 0)for(const i of t)n.add(i)}function v(n){return n.deep===void 0&&n.end===void 0&&n.exact===void 0&&n.indexedWildcard===void 0}exports.PathRouter=g;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./pathSegmentKey.cjs");class h{_root={};add(d,n){let e=this._root;const o=[];for(const i of d.segments)if(i.kind==="wildcard"){const t=e.indexedWildcard??={};o.push({child:t,parent:e,indexedWildcard:!0}),e=t}else{const t=p.pathSegmentKey(i),a=e.exact??=new Map;let l=a.get(t);l===void 0&&(l={},a.set(t,l)),o.push({child:l,key:t,parent:e,indexedWildcard:!1}),e=l}const r=d.deep?e.deep??=new Set:e.end??=new Set;r.add(n);let s=!0;return()=>{if(s){s=!1,r.delete(n),r.size===0&&(d.deep?e.deep=void 0:e.end=void 0);for(let i=o.length-1;i>=0;i--){const t=o[i];if(!u(t.child))break;t.indexedWildcard?t.parent.indexedWildcard=void 0:(t.parent.exact.delete(t.key),t.parent.exact.size===0&&(t.parent.exact=void 0))}}}}match(d){let n=[this._root];const e=new Set;for(let o=0;o<=d.length;o++){const r=o===d.length,s=[];for(const i of n){if(f(e,i.deep),r){f(e,i.end);continue}const t=d[o],a=i.exact?.get(p.pathSegmentKey(t));a!==void 0&&s.push(a),i.indexedWildcard!==void 0&&(t.kind==="index"||t.kind==="selector")&&s.push(i.indexedWildcard)}if(r||(n=s,n.length===0))break}return e}matchAll(){const d=new Set,n=[this._root];for(;n.length;){const e=n.pop();if(f(d,e.deep),f(d,e.end),e.indexedWildcard!==void 0&&n.push(e.indexedWildcard),e.exact!==void 0)for(const o of e.exact.values())n.push(o)}return d}}function f(c,d){if(d!==void 0)for(const n of d)c.add(n)}function u(c){return c.deep===void 0&&c.end===void 0&&c.exact===void 0&&c.indexedWildcard===void 0}exports.PathRouter=h;