vorma 0.0.0-pre.0 → 0.82.0

package/npm_dist/kit/_typescript/json/json.js

@@ -0,0 +1,110 @@
+// kit/_typescript/json/deep_equals.ts
+function jsonDeepEquals(a, b) {
+  if (a === b) {
+    return true;
+  }
+  if (a == null || b == null) {
+    return false;
+  }
+  if (typeof a !== typeof b) {
+    return false;
+  }
+  const aIsArray = Array.isArray(a);
+  const bIsArray = Array.isArray(b);
+  if (aIsArray !== bIsArray) {
+    return false;
+  }
+  if (aIsArray && bIsArray) {
+    if (a.length !== b.length) {
+      return false;
+    }
+    return a.every((item, index) => jsonDeepEquals(item, b[index]));
+  }
+  if (typeof a === "object" && typeof b === "object") {
+    const aKeys = Object.keys(a);
+    const bKeys = Object.keys(b);
+    if (aKeys.length !== bKeys.length) {
+      return false;
+    }
+    return aKeys.every((key) => {
+      return Object.hasOwn(b, key) && jsonDeepEquals(a[key], b[key]);
+    });
+  }
+  return false;
+}
+
+// kit/_typescript/json/search_param_serializer.ts
+function serializeToSearchParams(obj) {
+  const params = new URLSearchParams();
+  function appendValue(key, value) {
+    if (value === null || value === void 0) {
+      params.append(key, "");
+      return;
+    }
+    if (Array.isArray(value)) {
+      if (value.length === 0) {
+        params.append(key, "");
+      } else {
+        for (const item of value) {
+          appendValue(key, item);
+        }
+      }
+      return;
+    }
+    if (typeof value === "object") {
+      const entries = Object.entries(value);
+      if (entries.length === 0) {
+        params.append(key, "");
+      } else {
+        entries.sort(([keyA], [keyB]) => keyA.localeCompare(keyB));
+        for (const [subKey, subValue] of entries) {
+          const newKey = key ? `${key}.${subKey}` : subKey;
+          appendValue(newKey, subValue);
+        }
+      }
+      return;
+    }
+    params.append(key, String(value));
+  }
+  if (typeof obj === "object" && obj !== null) {
+    const entries = Object.entries(obj);
+    entries.sort(([keyA], [keyB]) => keyA.localeCompare(keyB));
+    for (const [key, value] of entries) {
+      appendValue(key, value);
+    }
+  }
+  return params;
+}
+
+// kit/_typescript/json/stringify_stable.ts
+function jsonStringifyStable(input) {
+  const stabilized = stabilizeStructure(input, /* @__PURE__ */ new WeakSet());
+  return JSON.stringify(stabilized);
+}
+function stabilizeStructure(value, visited) {
+  if (value === null || typeof value !== "object") {
+    return value;
+  }
+  if (visited.has(value)) {
+    throw new Error("Circular reference detected during stable JSON stringification");
+  }
+  visited.add(value);
+  if (Array.isArray(value)) {
+    const result = value.map((item) => stabilizeStructure(item, visited));
+    visited.delete(value);
+    return result;
+  }
+  const keys = Object.keys(value).sort();
+  const stable = {};
+  for (const key of keys) {
+    stable[key] = stabilizeStructure(value[key], visited);
+  }
+  visited.delete(value);
+  return stable;
+}
+export {
+  jsonDeepEquals,
+  jsonStringifyStable,
+  serializeToSearchParams
+};
+//# sourceMappingURL=json.js.map

package/npm_dist/kit/_typescript/json/json.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../kit/_typescript/json/deep_equals.ts", "../../../../kit/_typescript/json/search_param_serializer.ts", "../../../../kit/_typescript/json/stringify_stable.ts"],
+  "sourcesContent": ["/**\n * Performs a deep equality comparison of two JSON-compatible values.\n * Handles null, undefined, primitives, arrays, and plain objects, recursively.\n * Does not support Maps, Sets, Functions, or other non-JSON types.\n */\nexport function jsonDeepEquals(a: unknown, b: unknown): boolean {\n\t// Tautology\n\tif (a === b) {\n\t\treturn true;\n\t}\n\n\t// If both were null or both were undefined, we would have early returned above.\n\t// So if either at this point is loosely null, we know they're not equal.\n\tif (a == null || b == null) {\n\t\treturn false;\n\t}\n\n\t// If types are different, we know they're not equal.\n\tif (typeof a !== typeof b) {\n\t\treturn false;\n\t}\n\n\tconst aIsArray = Array.isArray(a);\n\tconst bIsArray = Array.isArray(b);\n\n\t// If one is an array and the other is not, we know they're not equal.\n\tif (aIsArray !== bIsArray) {\n\t\treturn false;\n\t}\n\n\t// Handle arrays\n\tif (aIsArray && bIsArray) {\n\t\tif (a.length !== b.length) {\n\t\t\treturn false;\n\t\t}\n\t\treturn a.every((item, index) => jsonDeepEquals(item, b[index]));\n\t}\n\n\t// Handle objects\n\tif (typeof a === \"object\" && typeof b === \"object\") {\n\t\tconst aKeys = Object.keys(a as object);\n\t\tconst bKeys = Object.keys(b as object);\n\n\t\tif (aKeys.length !== bKeys.length) {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn aKeys.every((key) => {\n\t\t\treturn Object.hasOwn(b, key) && jsonDeepEquals((a as any)[key], (b as any)[key]);\n\t\t});\n\t}\n\n\treturn false;\n}\n", "export function serializeToSearchParams(obj: Record<any, any>): URLSearchParams {\n\tconst params = new URLSearchParams();\n\n\tfunction appendValue(key: string, value: any) {\n\t\tif (value === null || value === undefined) {\n\t\t\tparams.append(key, \"\");\n\t\t\treturn;\n\t\t}\n\n\t\tif (Array.isArray(value)) {\n\t\t\tif (value.length === 0) {\n\t\t\t\tparams.append(key, \"\");\n\t\t\t} else {\n\t\t\t\tfor (const item of value) {\n\t\t\t\t\tappendValue(key, item);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\n\t\tif (typeof value === \"object\") {\n\t\t\tconst entries = Object.entries(value);\n\t\t\tif (entries.length === 0) {\n\t\t\t\tparams.append(key, \"\");\n\t\t\t} else {\n\t\t\t\t// Sort nested keys alphabetically\n\t\t\t\tentries.sort(([keyA], [keyB]) => keyA.localeCompare(keyB));\n\t\t\t\tfor (const [subKey, subValue] of entries) {\n\t\t\t\t\tconst newKey = key ? `${key}.${subKey}` : subKey;\n\t\t\t\t\tappendValue(newKey, subValue);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\n\t\tparams.append(key, String(value));\n\t}\n\n\tif (typeof obj === \"object\" && obj !== null) {\n\t\t// Sort top-level keys alphabetically\n\t\tconst entries = Object.entries(obj);\n\t\tentries.sort(([keyA], [keyB]) => keyA.localeCompare(keyB));\n\t\tfor (const [key, value] of entries) {\n\t\t\tappendValue(key, value);\n\t\t}\n\t}\n\n\treturn params;\n}\n", "/**\n * Deterministically serializes a JSON-compatible value to a stable string.\n * Throws if it detects a circular reference. Does not support Maps, Sets,\n * Functions, or other non-JSON types.\n */\nexport function jsonStringifyStable(input: unknown): string {\n\t// First stabilize the structure, then JSON.stringify\n\tconst stabilized = stabilizeStructure(input, new WeakSet());\n\n\treturn JSON.stringify(stabilized);\n}\n\nfunction stabilizeStructure(value: unknown, visited: WeakSet<object>): unknown {\n\t// Handle primitives and null\n\tif (value === null || typeof value !== \"object\") {\n\t\treturn value;\n\t}\n\n\t// Prevent circular references\n\tif (visited.has(value)) {\n\t\tthrow new Error(\"Circular reference detected during stable JSON stringification\");\n\t}\n\tvisited.add(value);\n\n\t// Handle arrays - recursively stabilize each element\n\tif (Array.isArray(value)) {\n\t\tconst result = value.map((item) => stabilizeStructure(item, visited));\n\t\tvisited.delete(value); // Clean up after processing\n\t\treturn result;\n\t}\n\n\t// Handle objects - sort keys and recursively stabilize values\n\tconst keys = Object.keys(value).sort();\n\tconst stable: Record<string, unknown> = {};\n\n\t// Add sorted keys with stabilized values\n\tfor (const key of keys) {\n\t\tstable[key] = stabilizeStructure((value as Record<string, unknown>)[key], visited);\n\t}\n\n\tvisited.delete(value); // Clean up after processing\n\treturn stable;\n}\n"],
+  "mappings": ";AAKO,SAAS,eAAe,GAAY,GAAqB;AAE/D,MAAI,MAAM,GAAG;AACZ,WAAO;AAAA,EACR;AAIA,MAAI,KAAK,QAAQ,KAAK,MAAM;AAC3B,WAAO;AAAA,EACR;AAGA,MAAI,OAAO,MAAM,OAAO,GAAG;AAC1B,WAAO;AAAA,EACR;AAEA,QAAM,WAAW,MAAM,QAAQ,CAAC;AAChC,QAAM,WAAW,MAAM,QAAQ,CAAC;AAGhC,MAAI,aAAa,UAAU;AAC1B,WAAO;AAAA,EACR;AAGA,MAAI,YAAY,UAAU;AACzB,QAAI,EAAE,WAAW,EAAE,QAAQ;AAC1B,aAAO;AAAA,IACR;AACA,WAAO,EAAE,MAAM,CAAC,MAAM,UAAU,eAAe,MAAM,EAAE,KAAK,CAAC,CAAC;AAAA,EAC/D;AAGA,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU;AACnD,UAAM,QAAQ,OAAO,KAAK,CAAW;AACrC,UAAM,QAAQ,OAAO,KAAK,CAAW;AAErC,QAAI,MAAM,WAAW,MAAM,QAAQ;AAClC,aAAO;AAAA,IACR;AAEA,WAAO,MAAM,MAAM,CAAC,QAAQ;AAC3B,aAAO,OAAO,OAAO,GAAG,GAAG,KAAK,eAAgB,EAAU,GAAG,GAAI,EAAU,GAAG,CAAC;AAAA,IAChF,CAAC;AAAA,EACF;AAEA,SAAO;AACR;;;ACrDO,SAAS,wBAAwB,KAAwC;AAC/E,QAAM,SAAS,IAAI,gBAAgB;AAEnC,WAAS,YAAY,KAAa,OAAY;AAC7C,QAAI,UAAU,QAAQ,UAAU,QAAW;AAC1C,aAAO,OAAO,KAAK,EAAE;AACrB;AAAA,IACD;AAEA,QAAI,MAAM,QAAQ,KAAK,GAAG;AACzB,UAAI,MAAM,WAAW,GAAG;AACvB,eAAO,OAAO,KAAK,EAAE;AAAA,MACtB,OAAO;AACN,mBAAW,QAAQ,OAAO;AACzB,sBAAY,KAAK,IAAI;AAAA,QACtB;AAAA,MACD;AACA;AAAA,IACD;AAEA,QAAI,OAAO,UAAU,UAAU;AAC9B,YAAM,UAAU,OAAO,QAAQ,KAAK;AACpC,UAAI,QAAQ,WAAW,GAAG;AACzB,eAAO,OAAO,KAAK,EAAE;AAAA,MACtB,OAAO;AAEN,gBAAQ,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,MAAM,KAAK,cAAc,IAAI,CAAC;AACzD,mBAAW,CAAC,QAAQ,QAAQ,KAAK,SAAS;AACzC,gBAAM,SAAS,MAAM,GAAG,GAAG,IAAI,MAAM,KAAK;AAC1C,sBAAY,QAAQ,QAAQ;AAAA,QAC7B;AAAA,MACD;AACA;AAAA,IACD;AAEA,WAAO,OAAO,KAAK,OAAO,KAAK,CAAC;AAAA,EACjC;AAEA,MAAI,OAAO,QAAQ,YAAY,QAAQ,MAAM;AAE5C,UAAM,UAAU,OAAO,QAAQ,GAAG;AAClC,YAAQ,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,MAAM,KAAK,cAAc,IAAI,CAAC;AACzD,eAAW,CAAC,KAAK,KAAK,KAAK,SAAS;AACnC,kBAAY,KAAK,KAAK;AAAA,IACvB;AAAA,EACD;AAEA,SAAO;AACR;;;AC3CO,SAAS,oBAAoB,OAAwB;AAE3D,QAAM,aAAa,mBAAmB,OAAO,oBAAI,QAAQ,CAAC;AAE1D,SAAO,KAAK,UAAU,UAAU;AACjC;AAEA,SAAS,mBAAmB,OAAgB,SAAmC;AAE9E,MAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;AAChD,WAAO;AAAA,EACR;AAGA,MAAI,QAAQ,IAAI,KAAK,GAAG;AACvB,UAAM,IAAI,MAAM,gEAAgE;AAAA,EACjF;AACA,UAAQ,IAAI,KAAK;AAGjB,MAAI,MAAM,QAAQ,KAAK,GAAG;AACzB,UAAM,SAAS,MAAM,IAAI,CAAC,SAAS,mBAAmB,MAAM,OAAO,CAAC;AACpE,YAAQ,OAAO,KAAK;AACpB,WAAO;AAAA,EACR;AAGA,QAAM,OAAO,OAAO,KAAK,KAAK,EAAE,KAAK;AACrC,QAAM,SAAkC,CAAC;AAGzC,aAAW,OAAO,MAAM;AACvB,WAAO,GAAG,IAAI,mBAAoB,MAAkC,GAAG,GAAG,OAAO;AAAA,EAClF;AAEA,UAAQ,OAAO,KAAK;AACpB,SAAO;AACR;",
+  "names": []
+}

package/npm_dist/kit/_typescript/json/search_param_serializer.d.ts

@@ -0,0 +1,2 @@
+export declare function serializeToSearchParams(obj: Record<any, any>): URLSearchParams;
+//# sourceMappingURL=search_param_serializer.d.ts.map

package/npm_dist/kit/_typescript/json/search_param_serializer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search_param_serializer.d.ts","sourceRoot":"","sources":["../../../../kit/_typescript/json/search_param_serializer.ts"],"names":[],"mappings":"AAAA,wBAAgB,uBAAuB,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,eAAe,CAgD9E"}

package/npm_dist/kit/_typescript/json/stringify_stable.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Deterministically serializes a JSON-compatible value to a stable string.
+ * Throws if it detects a circular reference. Does not support Maps, Sets,
+ * Functions, or other non-JSON types.
+ */
+export declare function jsonStringifyStable(input: unknown): string;
+//# sourceMappingURL=stringify_stable.d.ts.map

package/npm_dist/kit/_typescript/json/stringify_stable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stringify_stable.d.ts","sourceRoot":"","sources":["../../../../kit/_typescript/json/stringify_stable.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAK1D"}

package/npm_dist/kit/_typescript/listeners/listeners.d.ts

@@ -0,0 +1,2 @@
+export declare function addOnWindowFocusListener(callback: () => void): () => void;
+//# sourceMappingURL=listeners.d.ts.map

package/npm_dist/kit/_typescript/listeners/listeners.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"listeners.d.ts","sourceRoot":"","sources":["../../../../kit/_typescript/listeners/listeners.ts"],"names":[],"mappings":"AAEA,wBAAgB,wBAAwB,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAazE"}

package/npm_dist/kit/_typescript/listeners/listeners.js

@@ -0,0 +1,20 @@
+// kit/_typescript/listeners/listeners.ts
+import { debounce } from "vorma/kit/debounce";
+function addOnWindowFocusListener(callback) {
+  const debouncedCallback = debounce(callback, 30);
+  const ifVisibleCallback = () => {
+    if (document.visibilityState === "visible") {
+      debouncedCallback();
+    }
+  };
+  window.addEventListener("focus", debouncedCallback);
+  window.addEventListener("visibilitychange", ifVisibleCallback);
+  return () => {
+    window.removeEventListener("focus", debouncedCallback);
+    window.removeEventListener("visibilitychange", ifVisibleCallback);
+  };
+}
+export {
+  addOnWindowFocusListener
+};
+//# sourceMappingURL=listeners.js.map

package/npm_dist/kit/_typescript/listeners/listeners.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../kit/_typescript/listeners/listeners.ts"],
+  "sourcesContent": ["import { debounce } from \"vorma/kit/debounce\";\n\nexport function addOnWindowFocusListener(callback: () => void): () => void {\n\tconst debouncedCallback = debounce(callback, 30);\n\tconst ifVisibleCallback = () => {\n\t\tif (document.visibilityState === \"visible\") {\n\t\t\tdebouncedCallback();\n\t\t}\n\t};\n\twindow.addEventListener(\"focus\", debouncedCallback);\n\twindow.addEventListener(\"visibilitychange\", ifVisibleCallback);\n\treturn () => {\n\t\twindow.removeEventListener(\"focus\", debouncedCallback);\n\t\twindow.removeEventListener(\"visibilitychange\", ifVisibleCallback);\n\t};\n}\n"],
+  "mappings": ";AAAA,SAAS,gBAAgB;AAElB,SAAS,yBAAyB,UAAkC;AAC1E,QAAM,oBAAoB,SAAS,UAAU,EAAE;AAC/C,QAAM,oBAAoB,MAAM;AAC/B,QAAI,SAAS,oBAAoB,WAAW;AAC3C,wBAAkB;AAAA,IACnB;AAAA,EACD;AACA,SAAO,iBAAiB,SAAS,iBAAiB;AAClD,SAAO,iBAAiB,oBAAoB,iBAAiB;AAC7D,SAAO,MAAM;AACZ,WAAO,oBAAoB,SAAS,iBAAiB;AACrD,WAAO,oBAAoB,oBAAoB,iBAAiB;AAAA,EACjE;AACD;",
+  "names": []
+}

package/npm_dist/kit/_typescript/matcher/find_best_match.d.ts

@@ -0,0 +1,10 @@
+import { type Params, type PatternRegistry, type RegisteredPattern } from "./register.ts";
+type BestMatch = {
+    registeredPattern: RegisteredPattern;
+    params: Params;
+    splatValues: string[];
+    score: number;
+};
+export declare function findBestMatch(registry: PatternRegistry, realPath: string): BestMatch | null;
+export {};
+//# sourceMappingURL=find_best_match.d.ts.map

package/npm_dist/kit/_typescript/matcher/find_best_match.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"find_best_match.d.ts","sourceRoot":"","sources":["../../../../kit/_typescript/matcher/find_best_match.ts"],"names":[],"mappings":"AACA,OAAO,EAMN,KAAK,MAAM,EACX,KAAK,eAAe,EACpB,KAAK,iBAAiB,EAEtB,MAAM,eAAe,CAAC;AAEvB,KAAK,SAAS,GAAG;IAChB,iBAAiB,EAAE,iBAAiB,CAAC;IACrC,MAAM,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;CACd,CAAC;AAoGF,wBAAgB,aAAa,CAC5B,QAAQ,EAAE,eAAe,EACzB,QAAQ,EAAE,MAAM,GACd,SAAS,GAAG,IAAI,CAmFlB"}

package/npm_dist/kit/_typescript/matcher/find_best_match.js

@@ -0,0 +1,146 @@
+import {
+  NODE_DYNAMIC,
+  NODE_SPLAT,
+  SCORE_DYNAMIC,
+  SCORE_STATIC_MATCH,
+  SEG_TYPES,
+  parseSegments
+} from "../chunk-YBAPNBS2.js";
+
+// kit/_typescript/matcher/find_best_match.ts
+function dfsBest(registry, node, segments, depth, score, state, checkTrailingSlash) {
+  const atNormalEnd = checkTrailingSlash && depth === segments.length - 1;
+  if (node.pattern.length > 0) {
+    const rp = registry.dynamicPatterns.get(node.pattern);
+    if (rp) {
+      if (depth === segments.length || node.nodeType === NODE_SPLAT || atNormalEnd) {
+        if (!state.foundMatch || score > state.bestScore) {
+          state.best = {
+            registeredPattern: rp,
+            params: {},
+            splatValues: [],
+            score
+          };
+          state.bestScore = score;
+          state.foundMatch = true;
+        }
+      }
+    }
+  }
+  if (depth >= segments.length) return;
+  if (node.children !== null) {
+    const child = node.children.get(segments[depth]);
+    if (child) {
+      dfsBest(
+        registry,
+        child,
+        segments,
+        depth + 1,
+        score + SCORE_STATIC_MATCH,
+        state,
+        checkTrailingSlash
+      );
+      if (state.foundMatch && depth + 1 === segments.length && child.pattern !== "") {
+        return;
+      }
+    }
+  }
+  for (const child of node.dynChildren) {
+    switch (child.nodeType) {
+      case NODE_DYNAMIC:
+        if (segments[depth] !== "") {
+          dfsBest(
+            registry,
+            child,
+            segments,
+            depth + 1,
+            score + SCORE_DYNAMIC,
+            state,
+            checkTrailingSlash
+          );
+        }
+        break;
+      case NODE_SPLAT:
+        if (child.pattern.length > 0) {
+          const rp = registry.dynamicPatterns.get(child.pattern);
+          if (rp && !state.foundMatch) {
+            state.best = {
+              registeredPattern: rp,
+              params: {},
+              splatValues: [],
+              score: 0
+            };
+            state.foundMatch = true;
+          }
+        }
+        break;
+    }
+  }
+}
+function findBestMatch(registry, realPath) {
+  const rr = registry.staticPatterns.get(realPath);
+  if (rr) {
+    return {
+      registeredPattern: rr,
+      params: {},
+      splatValues: [],
+      score: 0
+    };
+  }
+  const segments = parseSegments(realPath);
+  const hasTrailingSlash = realPath.length > 0 && realPath[realPath.length - 1] === "/";
+  if (hasTrailingSlash) {
+    const pathWithoutTrailingSlash = realPath.substring(
+      0,
+      realPath.length - 1
+    );
+    const rrWithoutSlash = registry.staticPatterns.get(
+      pathWithoutTrailingSlash
+    );
+    if (rrWithoutSlash) {
+      return {
+        registeredPattern: rrWithoutSlash,
+        params: {},
+        splatValues: [],
+        score: 0
+      };
+    }
+  }
+  const state = {
+    best: null,
+    bestScore: 0,
+    foundMatch: false
+  };
+  dfsBest(
+    registry,
+    registry.rootNode,
+    segments,
+    0,
+    0,
+    state,
+    hasTrailingSlash
+  );
+  if (!state.foundMatch || !state.best) {
+    return null;
+  }
+  if (state.best.registeredPattern.numberOfDynamicParamSegs > 0) {
+    const params = {};
+    for (let i = 0; i < state.best.registeredPattern.normalizedSegments.length; i++) {
+      const seg = state.best.registeredPattern.normalizedSegments[i];
+      if (seg.segType === SEG_TYPES.dynamic) {
+        params[seg.normalizedVal.substring(1)] = segments[i];
+      }
+    }
+    state.best.params = params;
+  }
+  if (state.best.registeredPattern.normalizedPattern === "/*" || state.best.registeredPattern.lastSegIsNonRootSplat) {
+    state.best.splatValues = segments.slice(
+      state.best.registeredPattern.normalizedSegments.length - 1
+    );
+  }
+  return state.best;
+}
+export {
+  findBestMatch
+};
+//# sourceMappingURL=find_best_match.js.map

package/npm_dist/kit/_typescript/matcher/find_best_match.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../kit/_typescript/matcher/find_best_match.ts"],
+  "sourcesContent": ["import { parseSegments } from \"./parse_segments.ts\";\nimport {\n\tNODE_DYNAMIC,\n\tNODE_SPLAT,\n\tSCORE_DYNAMIC,\n\tSCORE_STATIC_MATCH,\n\tSEG_TYPES,\n\ttype Params,\n\ttype PatternRegistry,\n\ttype RegisteredPattern,\n\ttype SegmentNode,\n} from \"./register.ts\";\n\ntype BestMatch = {\n\tregisteredPattern: RegisteredPattern;\n\tparams: Params;\n\tsplatValues: string[];\n\tscore: number;\n};\n\ntype DfsBestState = {\n\tbest: BestMatch | null;\n\tbestScore: number;\n\tfoundMatch: boolean;\n};\n\nfunction dfsBest(\n\tregistry: PatternRegistry,\n\tnode: SegmentNode,\n\tsegments: string[],\n\tdepth: number,\n\tscore: number,\n\tstate: DfsBestState,\n\tcheckTrailingSlash: boolean,\n): void {\n\tconst atNormalEnd = checkTrailingSlash && depth === segments.length - 1;\n\n\tif (node.pattern.length > 0) {\n\t\tconst rp = registry.dynamicPatterns.get(node.pattern);\n\t\tif (rp) {\n\t\t\tif (\n\t\t\t\tdepth === segments.length ||\n\t\t\t\tnode.nodeType === NODE_SPLAT ||\n\t\t\t\tatNormalEnd\n\t\t\t) {\n\t\t\t\tif (!state.foundMatch || score > state.bestScore) {\n\t\t\t\t\tstate.best = {\n\t\t\t\t\t\tregisteredPattern: rp,\n\t\t\t\t\t\tparams: {},\n\t\t\t\t\t\tsplatValues: [],\n\t\t\t\t\t\tscore,\n\t\t\t\t\t};\n\t\t\t\t\tstate.bestScore = score;\n\t\t\t\t\tstate.foundMatch = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (depth >= segments.length) return;\n\n\tif (node.children !== null) {\n\t\tconst child = node.children.get(segments[depth]!);\n\t\tif (child) {\n\t\t\tdfsBest(\n\t\t\t\tregistry,\n\t\t\t\tchild,\n\t\t\t\tsegments,\n\t\t\t\tdepth + 1,\n\t\t\t\tscore + SCORE_STATIC_MATCH,\n\t\t\t\tstate,\n\t\t\t\tcheckTrailingSlash,\n\t\t\t);\n\n\t\t\tif (\n\t\t\t\tstate.foundMatch &&\n\t\t\t\tdepth + 1 === segments.length &&\n\t\t\t\tchild.pattern !== \"\"\n\t\t\t) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (const child of node.dynChildren) {\n\t\tswitch (child.nodeType) {\n\t\t\tcase NODE_DYNAMIC:\n\t\t\t\tif (segments[depth] !== \"\") {\n\t\t\t\t\tdfsBest(\n\t\t\t\t\t\tregistry,\n\t\t\t\t\t\tchild,\n\t\t\t\t\t\tsegments,\n\t\t\t\t\t\tdepth + 1,\n\t\t\t\t\t\tscore + SCORE_DYNAMIC,\n\t\t\t\t\t\tstate,\n\t\t\t\t\t\tcheckTrailingSlash,\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase NODE_SPLAT:\n\t\t\t\tif (child.pattern.length > 0) {\n\t\t\t\t\tconst rp = registry.dynamicPatterns.get(child.pattern);\n\t\t\t\t\tif (rp && !state.foundMatch) {\n\t\t\t\t\t\tstate.best = {\n\t\t\t\t\t\t\tregisteredPattern: rp,\n\t\t\t\t\t\t\tparams: {},\n\t\t\t\t\t\t\tsplatValues: [],\n\t\t\t\t\t\t\tscore: 0,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tstate.foundMatch = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\nexport function findBestMatch(\n\tregistry: PatternRegistry,\n\trealPath: string,\n): BestMatch | null {\n\t// Check static patterns first\n\tconst rr = registry.staticPatterns.get(realPath);\n\tif (rr) {\n\t\treturn {\n\t\t\tregisteredPattern: rr,\n\t\t\tparams: {},\n\t\t\tsplatValues: [],\n\t\t\tscore: 0,\n\t\t};\n\t}\n\n\tconst segments = parseSegments(realPath);\n\tconst hasTrailingSlash =\n\t\trealPath.length > 0 && realPath[realPath.length - 1] === \"/\";\n\n\t// Check static pattern without trailing slash\n\tif (hasTrailingSlash) {\n\t\tconst pathWithoutTrailingSlash = realPath.substring(\n\t\t\t0,\n\t\t\trealPath.length - 1,\n\t\t);\n\t\tconst rrWithoutSlash = registry.staticPatterns.get(\n\t\t\tpathWithoutTrailingSlash,\n\t\t);\n\t\tif (rrWithoutSlash) {\n\t\t\treturn {\n\t\t\t\tregisteredPattern: rrWithoutSlash,\n\t\t\t\tparams: {},\n\t\t\t\tsplatValues: [],\n\t\t\t\tscore: 0,\n\t\t\t};\n\t\t}\n\t}\n\n\t// Search for dynamic patterns\n\tconst state: DfsBestState = {\n\t\tbest: null,\n\t\tbestScore: 0,\n\t\tfoundMatch: false,\n\t};\n\n\tdfsBest(\n\t\tregistry,\n\t\tregistry.rootNode,\n\t\tsegments,\n\t\t0,\n\t\t0,\n\t\tstate,\n\t\thasTrailingSlash,\n\t);\n\n\tif (!state.foundMatch || !state.best) {\n\t\treturn null;\n\t}\n\n\t// Populate params\n\tif (state.best.registeredPattern.numberOfDynamicParamSegs > 0) {\n\t\tconst params: Params = {};\n\t\tfor (\n\t\t\tlet i = 0;\n\t\t\ti < state.best.registeredPattern.normalizedSegments.length;\n\t\t\ti++\n\t\t) {\n\t\t\tconst seg = state.best.registeredPattern.normalizedSegments[i]!;\n\t\t\tif (seg.segType === SEG_TYPES.dynamic) {\n\t\t\t\tparams[seg.normalizedVal.substring(1)] = segments[i]!;\n\t\t\t}\n\t\t}\n\t\tstate.best.params = params;\n\t}\n\n\t// Populate splat values\n\tif (\n\t\tstate.best.registeredPattern.normalizedPattern === \"/*\" ||\n\t\tstate.best.registeredPattern.lastSegIsNonRootSplat\n\t) {\n\t\tstate.best.splatValues = segments.slice(\n\t\t\tstate.best.registeredPattern.normalizedSegments.length - 1,\n\t\t);\n\t}\n\n\treturn state.best;\n}\n"],
+  "mappings": ";;;;;;;;;;AA0BA,SAAS,QACR,UACA,MACA,UACA,OACA,OACA,OACA,oBACO;AACP,QAAM,cAAc,sBAAsB,UAAU,SAAS,SAAS;AAEtE,MAAI,KAAK,QAAQ,SAAS,GAAG;AAC5B,UAAM,KAAK,SAAS,gBAAgB,IAAI,KAAK,OAAO;AACpD,QAAI,IAAI;AACP,UACC,UAAU,SAAS,UACnB,KAAK,aAAa,cAClB,aACC;AACD,YAAI,CAAC,MAAM,cAAc,QAAQ,MAAM,WAAW;AACjD,gBAAM,OAAO;AAAA,YACZ,mBAAmB;AAAA,YACnB,QAAQ,CAAC;AAAA,YACT,aAAa,CAAC;AAAA,YACd;AAAA,UACD;AACA,gBAAM,YAAY;AAClB,gBAAM,aAAa;AAAA,QACpB;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAEA,MAAI,SAAS,SAAS,OAAQ;AAE9B,MAAI,KAAK,aAAa,MAAM;AAC3B,UAAM,QAAQ,KAAK,SAAS,IAAI,SAAS,KAAK,CAAE;AAChD,QAAI,OAAO;AACV;AAAA,QACC;AAAA,QACA;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR;AAAA,QACA;AAAA,MACD;AAEA,UACC,MAAM,cACN,QAAQ,MAAM,SAAS,UACvB,MAAM,YAAY,IACjB;AACD;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAEA,aAAW,SAAS,KAAK,aAAa;AACrC,YAAQ,MAAM,UAAU;AAAA,MACvB,KAAK;AACJ,YAAI,SAAS,KAAK,MAAM,IAAI;AAC3B;AAAA,YACC;AAAA,YACA;AAAA,YACA;AAAA,YACA,QAAQ;AAAA,YACR,QAAQ;AAAA,YACR;AAAA,YACA;AAAA,UACD;AAAA,QACD;AACA;AAAA,MAED,KAAK;AACJ,YAAI,MAAM,QAAQ,SAAS,GAAG;AAC7B,gBAAM,KAAK,SAAS,gBAAgB,IAAI,MAAM,OAAO;AACrD,cAAI,MAAM,CAAC,MAAM,YAAY;AAC5B,kBAAM,OAAO;AAAA,cACZ,mBAAmB;AAAA,cACnB,QAAQ,CAAC;AAAA,cACT,aAAa,CAAC;AAAA,cACd,OAAO;AAAA,YACR;AACA,kBAAM,aAAa;AAAA,UACpB;AAAA,QACD;AACA;AAAA,IACF;AAAA,EACD;AACD;AAEO,SAAS,cACf,UACA,UACmB;AAEnB,QAAM,KAAK,SAAS,eAAe,IAAI,QAAQ;AAC/C,MAAI,IAAI;AACP,WAAO;AAAA,MACN,mBAAmB;AAAA,MACnB,QAAQ,CAAC;AAAA,MACT,aAAa,CAAC;AAAA,MACd,OAAO;AAAA,IACR;AAAA,EACD;AAEA,QAAM,WAAW,cAAc,QAAQ;AACvC,QAAM,mBACL,SAAS,SAAS,KAAK,SAAS,SAAS,SAAS,CAAC,MAAM;AAG1D,MAAI,kBAAkB;AACrB,UAAM,2BAA2B,SAAS;AAAA,MACzC;AAAA,MACA,SAAS,SAAS;AAAA,IACnB;AACA,UAAM,iBAAiB,SAAS,eAAe;AAAA,MAC9C;AAAA,IACD;AACA,QAAI,gBAAgB;AACnB,aAAO;AAAA,QACN,mBAAmB;AAAA,QACnB,QAAQ,CAAC;AAAA,QACT,aAAa,CAAC;AAAA,QACd,OAAO;AAAA,MACR;AAAA,IACD;AAAA,EACD;AAGA,QAAM,QAAsB;AAAA,IAC3B,MAAM;AAAA,IACN,WAAW;AAAA,IACX,YAAY;AAAA,EACb;AAEA;AAAA,IACC;AAAA,IACA,SAAS;AAAA,IACT;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AAEA,MAAI,CAAC,MAAM,cAAc,CAAC,MAAM,MAAM;AACrC,WAAO;AAAA,EACR;AAGA,MAAI,MAAM,KAAK,kBAAkB,2BAA2B,GAAG;AAC9D,UAAM,SAAiB,CAAC;AACxB,aACK,IAAI,GACR,IAAI,MAAM,KAAK,kBAAkB,mBAAmB,QACpD,KACC;AACD,YAAM,MAAM,MAAM,KAAK,kBAAkB,mBAAmB,CAAC;AAC7D,UAAI,IAAI,YAAY,UAAU,SAAS;AACtC,eAAO,IAAI,cAAc,UAAU,CAAC,CAAC,IAAI,SAAS,CAAC;AAAA,MACpD;AAAA,IACD;AACA,UAAM,KAAK,SAAS;AAAA,EACrB;AAGA,MACC,MAAM,KAAK,kBAAkB,sBAAsB,QACnD,MAAM,KAAK,kBAAkB,uBAC5B;AACD,UAAM,KAAK,cAAc,SAAS;AAAA,MACjC,MAAM,KAAK,kBAAkB,mBAAmB,SAAS;AAAA,IAC1D;AAAA,EACD;AAEA,SAAO,MAAM;AACd;",
+  "names": []
+}

package/npm_dist/kit/_typescript/matcher/find_nested_matches.d.ts

@@ -0,0 +1,14 @@
+import type { Params, PatternRegistry, RegisteredPattern } from "./register.ts";
+export type Match = {
+    registeredPattern: RegisteredPattern;
+    params: Params;
+    splatValues: string[];
+};
+type FindNestedMatchesResult = {
+    params: Params;
+    splatValues: string[];
+    matches: Match[];
+};
+export declare function findNestedMatches(registry: PatternRegistry, realPath: string): FindNestedMatchesResult | null;
+export {};
+//# sourceMappingURL=find_nested_matches.d.ts.map

package/npm_dist/kit/_typescript/matcher/find_nested_matches.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"find_nested_matches.d.ts","sourceRoot":"","sources":["../../../../kit/_typescript/matcher/find_nested_matches.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACX,MAAM,EACN,eAAe,EACf,iBAAiB,EAEjB,MAAM,eAAe,CAAC;AAGvB,MAAM,MAAM,KAAK,GAAG;IACnB,iBAAiB,EAAE,iBAAiB,CAAC;IACrC,MAAM,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,MAAM,EAAE,CAAC;CACtB,CAAC;AAEF,KAAK,uBAAuB,GAAG;IAC9B,MAAM,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,OAAO,EAAE,KAAK,EAAE,CAAC;CACjB,CAAC;AA2JF,wBAAgB,iBAAiB,CAChC,QAAQ,EAAE,eAAe,EACzB,QAAQ,EAAE,MAAM,GACd,uBAAuB,GAAG,IAAI,CAmLhC"}

package/npm_dist/kit/_typescript/matcher/find_nested_matches.js

@@ -0,0 +1,248 @@
+import {
+  NODE_DYNAMIC,
+  NODE_SPLAT,
+  SEG_TYPES,
+  parseSegments
+} from "../chunk-YBAPNBS2.js";
+
+// kit/_typescript/matcher/find_nested_matches.ts
+function stripTrailingSlash(pattern) {
+  return pattern.length > 0 && pattern[pattern.length - 1] === "/" ? pattern.substring(0, pattern.length - 1) : pattern;
+}
+function dfsNestedMatches(registry, node, segments, depth, params, matches) {
+  if (node.pattern.length > 0) {
+    const rp = registry.dynamicPatterns.get(node.pattern);
+    if (rp && node.pattern !== "/*") {
+      const paramsCopy = { ...params };
+      let splatValues = [];
+      if (node.nodeType === NODE_SPLAT && depth < segments.length) {
+        splatValues = segments.slice(depth);
+      }
+      matches.set(node.pattern, {
+        registeredPattern: rp,
+        params: paramsCopy,
+        splatValues
+      });
+      if (depth === segments.length) {
+        const indexPattern = node.pattern + "/";
+        const rpIndex = registry.dynamicPatterns.get(indexPattern);
+        if (rpIndex) {
+          matches.set(indexPattern, {
+            registeredPattern: rpIndex,
+            params: paramsCopy,
+            splatValues: []
+          });
+        }
+      }
+    }
+  }
+  if (depth >= segments.length) return;
+  const seg = segments[depth];
+  if (node.children !== null) {
+    const child = node.children.get(seg);
+    if (child) {
+      dfsNestedMatches(
+        registry,
+        child,
+        segments,
+        depth + 1,
+        params,
+        matches
+      );
+    }
+  }
+  for (const child of node.dynChildren) {
+    switch (child.nodeType) {
+      case NODE_DYNAMIC: {
+        const oldVal = params[child.paramName];
+        const hadVal = oldVal !== void 0;
+        params[child.paramName] = seg;
+        dfsNestedMatches(
+          registry,
+          child,
+          segments,
+          depth + 1,
+          params,
+          matches
+        );
+        if (hadVal) {
+          params[child.paramName] = oldVal;
+        } else {
+          delete params[child.paramName];
+        }
+        break;
+      }
+      case NODE_SPLAT:
+        dfsNestedMatches(
+          registry,
+          child,
+          segments,
+          depth,
+          params,
+          matches
+        );
+        break;
+    }
+  }
+}
+function flattenAndSortMatches(matches, realPath, realSegmentLen) {
+  const results = Array.from(matches.values());
+  results.sort((i, j) => {
+    if (i.registeredPattern.lastSegIsIndex) return 1;
+    if (j.registeredPattern.lastSegIsIndex) return -1;
+    return i.registeredPattern.normalizedSegments.length - j.registeredPattern.normalizedSegments.length;
+  });
+  if (results.length === 0) return null;
+  const isNotSlashRoute = realPath !== "" && realPath !== "/";
+  if (isNotSlashRoute && results.length === 1 && results[0].registeredPattern.normalizedPattern === "") {
+    return null;
+  }
+  const lastMatch = results[results.length - 1];
+  if (!lastMatch.registeredPattern.lastSegIsNonRootSplat && lastMatch.registeredPattern.normalizedPattern !== "/*") {
+    const patternSegmentsLen = lastMatch.registeredPattern.normalizedSegments.length;
+    if (patternSegmentsLen < realSegmentLen) return null;
+    if (patternSegmentsLen === realSegmentLen && lastMatch.registeredPattern.numberOfDynamicParamSegs > 0 && Object.keys(lastMatch.params).length === 0) {
+      return null;
+    }
+  }
+  return {
+    params: lastMatch.params,
+    splatValues: lastMatch.splatValues,
+    matches: results
+  };
+}
+function findNestedMatches(registry, realPath) {
+  realPath = stripTrailingSlash(realPath);
+  const realSegments = parseSegments(realPath);
+  const matches = /* @__PURE__ */ new Map();
+  const emptyRR = registry.staticPatterns.get("");
+  if (emptyRR) {
+    matches.set(emptyRR.normalizedPattern, {
+      registeredPattern: emptyRR,
+      params: {},
+      splatValues: []
+    });
+  }
+  const realSegmentsLen = realSegments.length;
+  if (realPath === "") {
+    const rr = registry.staticPatterns.get("/");
+    if (rr) {
+      matches.set(rr.normalizedPattern, {
+        registeredPattern: rr,
+        params: {},
+        splatValues: []
+      });
+    } else {
+      const catchAllRR = registry.dynamicPatterns.get("/*");
+      if (catchAllRR) {
+        matches.set("/*", {
+          registeredPattern: catchAllRR,
+          params: {},
+          splatValues: []
+        });
+      }
+    }
+    return flattenAndSortMatches(matches, realPath, realSegmentsLen);
+  }
+  let pb = "";
+  let foundFullStatic = false;
+  for (let i = 0; i < realSegments.length; i++) {
+    pb += "/" + realSegments[i];
+    const rr = registry.staticPatterns.get(pb);
+    if (rr) {
+      matches.set(rr.normalizedPattern, {
+        registeredPattern: rr,
+        params: {},
+        splatValues: []
+      });
+      if (i === realSegmentsLen - 1) foundFullStatic = true;
+    }
+    if (i === realSegmentsLen - 1) {
+      pb += "/";
+      const rrWithSlash = registry.staticPatterns.get(pb);
+      if (rrWithSlash) {
+        matches.set(rrWithSlash.normalizedPattern, {
+          registeredPattern: rrWithSlash,
+          params: {},
+          splatValues: []
+        });
+      }
+    }
+  }
+  if (!foundFullStatic) {
+    const rr = registry.dynamicPatterns.get("/*");
+    if (rr) {
+      matches.set("/*", {
+        registeredPattern: rr,
+        params: {},
+        splatValues: realSegments
+      });
+    }
+    const params = {};
+    dfsNestedMatches(
+      registry,
+      registry.rootNode,
+      realSegments,
+      0,
+      params,
+      matches
+    );
+  }
+  const hasEmptyRR = emptyRR !== void 0;
+  if (matches.has("/*")) {
+    if (hasEmptyRR) {
+      if (matches.size > 2) matches.delete("/*");
+    } else if (matches.size > 1) {
+      matches.delete("/*");
+    }
+  }
+  if (matches.size < 2) {
+    return flattenAndSortMatches(matches, realPath, realSegmentsLen);
+  }
+  let longestSegmentLen = 0;
+  const longestSegmentMatches = /* @__PURE__ */ new Map();
+  for (const match of matches.values()) {
+    if (match.registeredPattern.normalizedSegments.length > longestSegmentLen) {
+      longestSegmentLen = match.registeredPattern.normalizedSegments.length;
+    }
+  }
+  for (const match of matches.values()) {
+    if (match.registeredPattern.normalizedSegments.length === longestSegmentLen) {
+      longestSegmentMatches.set(
+        match.registeredPattern.lastSegType,
+        match
+      );
+    }
+  }
+  for (const [pattern, match] of matches) {
+    if (match.registeredPattern.normalizedSegments.length < longestSegmentLen) {
+      if (match.registeredPattern.lastSegIsNonRootSplat || match.registeredPattern.lastSegIsIndex) {
+        matches.delete(pattern);
+      }
+    }
+  }
+  if (matches.size < 2) {
+    return flattenAndSortMatches(matches, realPath, realSegmentsLen);
+  }
+  if (longestSegmentMatches.size > 1) {
+    const indexMatch = longestSegmentMatches.get(SEG_TYPES.index);
+    if (indexMatch) {
+      matches.delete(indexMatch.registeredPattern.normalizedPattern);
+    }
+    const dynamicExists = longestSegmentMatches.has(SEG_TYPES.dynamic);
+    const splatExists = longestSegmentMatches.has(SEG_TYPES.splat);
+    if (realSegmentsLen === longestSegmentLen && dynamicExists && splatExists) {
+      const splatMatch = longestSegmentMatches.get(SEG_TYPES.splat);
+      matches.delete(splatMatch.registeredPattern.normalizedPattern);
+    }
+    if (realSegmentsLen > longestSegmentLen && splatExists && dynamicExists) {
+      const dynamicMatch = longestSegmentMatches.get(SEG_TYPES.dynamic);
+      matches.delete(dynamicMatch.registeredPattern.normalizedPattern);
+    }
+  }
+  return flattenAndSortMatches(matches, realPath, realSegmentsLen);
+}
+export {
+  findNestedMatches
+};
+//# sourceMappingURL=find_nested_matches.js.map