@timber-js/app 0.2.0-alpha.237 → 0.2.0-alpha.239

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (97) hide show
  1. package/dist/_chunks/chains-CmzbpG-6.js +1 -0
  2. package/dist/_chunks/{chains-BsGKkMTK.js → chains-DMoHX4yH.js} +2 -2
  3. package/dist/_chunks/{chains-BsGKkMTK.js.map → chains-DMoHX4yH.js.map} +1 -1
  4. package/dist/_chunks/{classify-cmE0Gins.js → classify-BwyAd-dZ.js} +3 -3
  5. package/dist/_chunks/{classify-cmE0Gins.js.map → classify-BwyAd-dZ.js.map} +1 -1
  6. package/dist/_chunks/{cli-check-BwiahbTC.js → cli-check-DQAD9MLo.js} +3 -3
  7. package/dist/_chunks/{cli-check-BwiahbTC.js.map → cli-check-DQAD9MLo.js.map} +1 -1
  8. package/dist/_chunks/{cli-schema-sync-Brw7kTmm.js → cli-schema-sync-C_xNLqBj.js} +1 -1
  9. package/dist/_chunks/{cli-schema-sync-B2ldclRO.js → cli-schema-sync-CmGls3dc.js} +2 -2
  10. package/dist/_chunks/{cli-schema-sync-B2ldclRO.js.map → cli-schema-sync-CmGls3dc.js.map} +1 -1
  11. package/dist/_chunks/{client-dep-entries-C1nMlLKV.js → client-dep-entries-C5BTQtFS.js} +2 -2
  12. package/dist/_chunks/{client-dep-entries-C1nMlLKV.js.map → client-dep-entries-C5BTQtFS.js.map} +1 -1
  13. package/dist/_chunks/{convention-lint-CLpuzY5h.js → convention-lint-GQA6WTRo.js} +2 -2
  14. package/dist/_chunks/{convention-lint-CLpuzY5h.js.map → convention-lint-GQA6WTRo.js.map} +1 -1
  15. package/dist/_chunks/dev-server--4_Ogy_6.js +1 -0
  16. package/dist/_chunks/{dev-server-lrdpD7Ws.js → dev-server-Cr3_Fu5A.js} +244 -26
  17. package/dist/_chunks/dev-server-Cr3_Fu5A.js.map +1 -0
  18. package/dist/_chunks/dev-span-RsVeYYc_.js.map +1 -1
  19. package/dist/_chunks/{scanner-CrB_h6FA.js → interception-CtNt9jPt.js} +169 -1043
  20. package/dist/_chunks/interception-CtNt9jPt.js.map +1 -0
  21. package/dist/_chunks/{live-graph-ChuFfmLi.js → live-graph-HcLScfiV.js} +4 -4
  22. package/dist/_chunks/{live-graph-ChuFfmLi.js.map → live-graph-HcLScfiV.js.map} +1 -1
  23. package/dist/_chunks/{metadata-routes-BL26HCDd.js → metadata-routes-MXNjWOt5.js} +60 -2
  24. package/dist/_chunks/metadata-routes-MXNjWOt5.js.map +1 -0
  25. package/dist/_chunks/{poison-scan-CJ9QfJWb.js → poison-scan-DONdiCGX.js} +2 -2
  26. package/dist/_chunks/{poison-scan-CJ9QfJWb.js.map → poison-scan-DONdiCGX.js.map} +1 -1
  27. package/dist/_chunks/scanner-DSAJjH0x.js +1043 -0
  28. package/dist/_chunks/scanner-DSAJjH0x.js.map +1 -0
  29. package/dist/_chunks/{walkers-BUvpsb2Q.js → walkers-96YopJds.js} +3 -3
  30. package/dist/_chunks/{walkers-BUvpsb2Q.js.map → walkers-96YopJds.js.map} +1 -1
  31. package/dist/analyze/crawl-entry.js +3 -3
  32. package/dist/analyze/graph-command.js +2 -2
  33. package/dist/cli.js +3 -3
  34. package/dist/config-types.d.ts +11 -0
  35. package/dist/config-types.d.ts.map +1 -1
  36. package/dist/config-validation.d.ts.map +1 -1
  37. package/dist/dev-tools/instrumentation.d.ts.map +1 -1
  38. package/dist/dev-tools/log-columns.d.ts +50 -0
  39. package/dist/dev-tools/log-columns.d.ts.map +1 -0
  40. package/dist/dev-tools/logger.d.ts +5 -0
  41. package/dist/dev-tools/logger.d.ts.map +1 -1
  42. package/dist/index.js +6 -155
  43. package/dist/index.js.map +1 -1
  44. package/dist/native/rsc/dev-tools/instrumentation.js +5 -1
  45. package/dist/native/rsc/dev-tools/instrumentation.js.map +1 -1
  46. package/dist/native/rsc/dev-tools/log-columns.js +69 -0
  47. package/dist/native/rsc/dev-tools/log-columns.js.map +1 -0
  48. package/dist/native/rsc/dev-tools/logger.js +60 -33
  49. package/dist/native/rsc/dev-tools/logger.js.map +1 -1
  50. package/dist/native/rsc/manifest.json +1 -0
  51. package/dist/native/rsc/shared/dev-span.js +5 -2
  52. package/dist/native/rsc/shared/dev-span.js.map +1 -1
  53. package/dist/native/rsc/shared/span-waterfall.js +13 -2
  54. package/dist/native/rsc/shared/span-waterfall.js.map +1 -1
  55. package/dist/native/ssr/dev-tools/instrumentation.js +5 -1
  56. package/dist/native/ssr/dev-tools/instrumentation.js.map +1 -1
  57. package/dist/native/ssr/dev-tools/log-columns.js +69 -0
  58. package/dist/native/ssr/dev-tools/log-columns.js.map +1 -0
  59. package/dist/native/ssr/dev-tools/logger.js +60 -33
  60. package/dist/native/ssr/dev-tools/logger.js.map +1 -1
  61. package/dist/native/ssr/manifest.json +1 -0
  62. package/dist/native/ssr/shared/dev-span.js +5 -2
  63. package/dist/native/ssr/shared/dev-span.js.map +1 -1
  64. package/dist/native/ssr/shared/span-waterfall.js +13 -2
  65. package/dist/native/ssr/shared/span-waterfall.js.map +1 -1
  66. package/dist/plugins/dev-precompile.d.ts +42 -14
  67. package/dist/plugins/dev-precompile.d.ts.map +1 -1
  68. package/dist/plugins/dev-server.d.ts.map +1 -1
  69. package/dist/routing/index.js +3 -2
  70. package/dist/routing/manifest-codegen.d.ts +2 -0
  71. package/dist/routing/manifest-codegen.d.ts.map +1 -1
  72. package/dist/server/internal.js +1 -2
  73. package/dist/server/internal.js.map +1 -1
  74. package/dist/shared/dev-span.d.ts +6 -0
  75. package/dist/shared/dev-span.d.ts.map +1 -1
  76. package/dist/shared/span-waterfall.d.ts.map +1 -1
  77. package/docs/api/34-api-config.mdx +18 -0
  78. package/package.json +1 -1
  79. package/src/config-types.ts +11 -0
  80. package/src/config-validation.ts +15 -8
  81. package/src/dev-tools/instrumentation.ts +4 -1
  82. package/src/dev-tools/log-columns.ts +156 -0
  83. package/src/dev-tools/logger.ts +107 -63
  84. package/src/plugins/dev-precompile.ts +108 -20
  85. package/src/plugins/dev-server.ts +12 -11
  86. package/src/routing/manifest-codegen.ts +2 -2
  87. package/src/shared/dev-span.ts +13 -1
  88. package/src/shared/span-waterfall.ts +36 -4
  89. package/dist/_chunks/chains-DHmoKxkO.js +0 -1
  90. package/dist/_chunks/dev-server-BGGGhHXx.js +0 -1
  91. package/dist/_chunks/dev-server-lrdpD7Ws.js.map +0 -1
  92. package/dist/_chunks/metadata-routes-BL26HCDd.js.map +0 -1
  93. package/dist/_chunks/scanner-CrB_h6FA.js.map +0 -1
  94. package/dist/_chunks/segment-keys-Y60KNc8C.js +0 -61
  95. package/dist/_chunks/segment-keys-Y60KNc8C.js.map +0 -1
  96. package/dist/_chunks/tree-match-Bqdr9szG.js +0 -168
  97. package/dist/_chunks/tree-match-Bqdr9szG.js.map +0 -1
@@ -1,168 +0,0 @@
1
- // src/server/tree-match.ts
2
- /**
3
- * Match URL path parts against a segment tree.
4
- *
5
- * Walks the tree depth-first with backtracking, applying priority
6
- * ordering globally across group boundaries. Returns the matched
7
- * segment chain and collected params, or null if no route matches.
8
- *
9
- * By default, a match requires a terminal node (one with `page` or
10
- * `route`) at the leaf. Pass `{ requireTerminal: false }` to match
11
- * any segment (used by metadata route matching).
12
- *
13
- * @param root The root segment node to start matching from.
14
- * @param parts URL path parts (e.g. ['blog', 'hello-world']).
15
- * Empty array matches the root itself (if terminal).
16
- */
17
- function matchUrlParts(root, parts, options) {
18
- const chain = [];
19
- const params = {};
20
- if (matchNode(root, parts, 0, chain, params, options?.requireTerminal ?? true)) return {
21
- chain,
22
- params
23
- };
24
- return null;
25
- }
26
- /**
27
- * Flatten children through group segments.
28
- *
29
- * Groups are transparent for URL matching — their non-group descendants
30
- * are returned with the chain of group nodes leading to them. This lets
31
- * the caller apply priority ordering (static > dynamic > catch-all >
32
- * optional-catch-all) across all groups uniformly instead of per-group.
33
- */
34
- function collectEffectiveChildren(node, groupChain = []) {
35
- const result = [];
36
- for (const child of node.children) if (child.segmentType === "group") {
37
- const nested = collectEffectiveChildren(child, [...groupChain, child]);
38
- result.push(...nested);
39
- } else result.push({
40
- child,
41
- groupChain
42
- });
43
- return result;
44
- }
45
- /** A node is terminal if it can serve a response (has a page or route handler). */
46
- function isTerminal(node) {
47
- return !!(node.page || node.route);
48
- }
49
- /**
50
- * Specificity tier for a segment. Lower = more specific. Matches the
51
- * priority order in `matchNode`: static > affixed-dynamic > bare-dynamic >
52
- * catch-all > optional-catch-all.
53
- */
54
- function segmentTier(node) {
55
- if (node.segmentType === "static") return 0;
56
- if (node.segmentType === "dynamic" && (node.paramPrefix || node.paramSuffix)) return 1;
57
- if (node.segmentType === "dynamic") return 2;
58
- if (node.segmentType === "catch-all") return 3;
59
- if (node.segmentType === "optional-catch-all") return 4;
60
- return 2;
61
- }
62
- /**
63
- * Score a bare-dynamic candidate by running `matchNode` against its subtree
64
- * with the remaining URL parts, then reading the tier of each segment in
65
- * the matched chain. Returns a tier array that is compared lexicographically
66
- * — the candidate whose chain has a lower tier at the first differing
67
- * position is more specific.
68
- *
69
- * Delegates entirely to `matchNode`, so every segment type and priority
70
- * rule is inherited automatically — no second copy to drift.
71
- */
72
- function subtreeMatchScore(node, parts, index, requireTerminal) {
73
- const chain = [];
74
- if (!matchNode(node, parts, index, chain, {}, requireTerminal)) return [];
75
- return chain.slice(1).map((seg) => segmentTier(seg));
76
- }
77
- /**
78
- * Compare two tier arrays lexicographically. Negative means `a` is more
79
- * specific (should be tried first).
80
- */
81
- function compareTierArrays(a, b) {
82
- const len = Math.max(a.length, b.length);
83
- for (let i = 0; i < len; i++) {
84
- const ta = i < a.length ? a[i] : 5;
85
- const tb = i < b.length ? b[i] : 5;
86
- if (ta !== tb) return ta - tb;
87
- }
88
- return 0;
89
- }
90
- /** Combined affix length for specificity ordering. */
91
- function affixLength(node) {
92
- return (node.paramPrefix?.length ?? 0) + (node.paramSuffix?.length ?? 0);
93
- }
94
- /**
95
- * Recursive depth-first matcher with backtracking.
96
- *
97
- * Mutates `chain` and `params` in place for performance; backtracks
98
- * (restores previous state) when a candidate doesn't lead to a match.
99
- */
100
- function matchNode(node, parts, index, chain, params, requireTerminal) {
101
- chain.push(node);
102
- if (index >= parts.length) {
103
- if (!requireTerminal || isTerminal(node)) return true;
104
- for (const child of node.children) if (child.segmentType === "group") {
105
- if (matchNode(child, parts, index, chain, params, requireTerminal)) return true;
106
- }
107
- const effective = collectEffectiveChildren(node);
108
- for (const { child, groupChain } of effective) if (child.segmentType === "optional-catch-all" && (!requireTerminal || isTerminal(child))) {
109
- chain.push(...groupChain, child);
110
- return true;
111
- }
112
- chain.pop();
113
- return false;
114
- }
115
- const part = parts[index];
116
- const effective = collectEffectiveChildren(node);
117
- for (const { child, groupChain } of effective) if (child.segmentType === "static" && child.segmentName === part) {
118
- chain.push(...groupChain);
119
- if (matchNode(child, parts, index + 1, chain, params, requireTerminal)) return true;
120
- chain.length -= groupChain.length;
121
- }
122
- const affixed = effective.filter(({ child }) => child.segmentType === "dynamic" && child.paramName && (child.paramPrefix || child.paramSuffix));
123
- affixed.sort((a, b) => affixLength(b.child) - affixLength(a.child));
124
- for (const { child, groupChain } of affixed) {
125
- const prefix = child.paramPrefix ?? "";
126
- const suffix = child.paramSuffix ?? "";
127
- if (part.length > prefix.length + suffix.length && (!prefix || part.startsWith(prefix)) && (!suffix || part.endsWith(suffix))) {
128
- const value = part.slice(prefix.length, part.length - (suffix.length || 0));
129
- chain.push(...groupChain);
130
- const prev = params[child.paramName];
131
- params[child.paramName] = value;
132
- if (matchNode(child, parts, index + 1, chain, params, requireTerminal)) return true;
133
- chain.length -= groupChain.length;
134
- if (prev !== void 0) params[child.paramName] = prev;
135
- else delete params[child.paramName];
136
- }
137
- }
138
- const bareDynamic = effective.filter(({ child }) => child.segmentType === "dynamic" && child.paramName && !child.paramPrefix && !child.paramSuffix);
139
- if (bareDynamic.length > 1 && index + 1 < parts.length) {
140
- const scores = /* @__PURE__ */ new Map();
141
- for (const { child } of bareDynamic) scores.set(child, subtreeMatchScore(child, parts, index + 1, requireTerminal));
142
- bareDynamic.sort((a, b) => compareTierArrays(scores.get(a.child), scores.get(b.child)));
143
- }
144
- for (const { child, groupChain } of bareDynamic) {
145
- chain.push(...groupChain);
146
- const prev = params[child.paramName];
147
- params[child.paramName] = part;
148
- if (matchNode(child, parts, index + 1, chain, params, requireTerminal)) return true;
149
- chain.length -= groupChain.length;
150
- if (prev !== void 0) params[child.paramName] = prev;
151
- else delete params[child.paramName];
152
- }
153
- for (const { child, groupChain } of effective) if (child.segmentType === "catch-all" && child.paramName && (!requireTerminal || isTerminal(child))) {
154
- chain.push(...groupChain, child);
155
- params[child.paramName] = parts.slice(index);
156
- return true;
157
- }
158
- for (const { child, groupChain } of effective) if (child.segmentType === "optional-catch-all" && child.paramName && (!requireTerminal || isTerminal(child))) {
159
- chain.push(...groupChain, child);
160
- params[child.paramName] = parts.slice(index);
161
- return true;
162
- }
163
- chain.pop();
164
- return false;
165
- }
166
- export { matchUrlParts as t };
167
-
168
- //# sourceMappingURL=tree-match-Bqdr9szG.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"tree-match-Bqdr9szG.js","names":[],"sources":["../../src/server/tree-match.ts"],"sourcesContent":["/**\n * Shared URL-matching tree walker for segment trees.\n *\n * Both the main route matcher (`route-matcher.ts`) and slot resolver\n * (`slot-resolver.ts`) need to walk a SegmentNode tree, matching URL\n * parts against children with the same priority semantics:\n *\n * static > dynamic > catch-all > optional-catch-all\n *\n * Before this module, each had its own walker with subtle divergences\n * (different group handling, missing backtracking, incomplete\n * optional-catch-all support). This shared walker is the single\n * source of truth for URL-to-segment matching.\n *\n * See design/07-routing.md §\"Request Lifecycle\" and TIM-940.\n */\n\nimport type { SegmentNode } from '../routing/types.ts';\n\n// ─── Public API ───────────────────────────────────────────────────────────\n\n/** Result of matching URL parts against a segment tree. */\nexport interface TreeMatchResult<TFile> {\n /** Matched segment chain from root to leaf, inclusive. */\n chain: SegmentNode<TFile>[];\n /** Collected params, keyed by param name. Catch-all params are string[]. */\n params: Record<string, string | string[]>;\n}\n\nexport interface TreeMatchOptions {\n /**\n * When true (default), only match if the leaf node has a page or route\n * handler. Set to false for metadata route matching, where we just need\n * to find the owning segment regardless of whether it has a page.\n */\n requireTerminal?: boolean;\n}\n\n/**\n * Match URL path parts against a segment tree.\n *\n * Walks the tree depth-first with backtracking, applying priority\n * ordering globally across group boundaries. Returns the matched\n * segment chain and collected params, or null if no route matches.\n *\n * By default, a match requires a terminal node (one with `page` or\n * `route`) at the leaf. Pass `{ requireTerminal: false }` to match\n * any segment (used by metadata route matching).\n *\n * @param root The root segment node to start matching from.\n * @param parts URL path parts (e.g. ['blog', 'hello-world']).\n * Empty array matches the root itself (if terminal).\n */\nexport function matchUrlParts<TFile>(\n root: SegmentNode<TFile>,\n parts: string[],\n options?: TreeMatchOptions\n): TreeMatchResult<TFile> | null {\n const chain: SegmentNode<TFile>[] = [];\n const params: Record<string, string | string[]> = {};\n const requireTerminal = options?.requireTerminal ?? true;\n\n if (matchNode(root, parts, 0, chain, params, requireTerminal)) {\n return { chain, params };\n }\n return null;\n}\n\n/**\n * Yield every match for the given URL parts, in priority order.\n *\n * Same matching semantics as `matchUrlParts` — static > affixed-dynamic >\n * bare-dynamic > catch-all > optional-catch-all — but instead of returning\n * the first match, it yields all of them. Used by the metadata route matcher,\n * which needs to try alternate owner segments when the first match doesn't\n * own the requested metadata file.\n */\nexport function* matchUrlPartsAll<TFile>(\n root: SegmentNode<TFile>,\n parts: string[],\n options?: TreeMatchOptions\n): Generator<TreeMatchResult<TFile>> {\n const chain: SegmentNode<TFile>[] = [];\n const params: Record<string, string | string[]> = {};\n const requireTerminal = options?.requireTerminal ?? true;\n\n yield* matchNodeAll(root, parts, 0, chain, params, requireTerminal);\n}\n\n// ─── Internal ─────────────────────────────────────────────────────────────\n\n/**\n * A child node flattened through group segments, along with the\n * chain of group nodes that must appear in the segment chain\n * before the child to preserve the tree path.\n */\ninterface EffectiveChild<TFile> {\n child: SegmentNode<TFile>;\n groupChain: SegmentNode<TFile>[];\n}\n\n/**\n * Flatten children through group segments.\n *\n * Groups are transparent for URL matching — their non-group descendants\n * are returned with the chain of group nodes leading to them. This lets\n * the caller apply priority ordering (static > dynamic > catch-all >\n * optional-catch-all) across all groups uniformly instead of per-group.\n */\nfunction collectEffectiveChildren<TFile>(\n node: SegmentNode<TFile>,\n groupChain: SegmentNode<TFile>[] = []\n): EffectiveChild<TFile>[] {\n const result: EffectiveChild<TFile>[] = [];\n for (const child of node.children) {\n if (child.segmentType === 'group') {\n const nested = collectEffectiveChildren(child, [...groupChain, child]);\n result.push(...nested);\n } else {\n result.push({ child, groupChain });\n }\n }\n return result;\n}\n\n/** A node is terminal if it can serve a response (has a page or route handler). */\nfunction isTerminal<TFile>(node: SegmentNode<TFile>): boolean {\n return !!(node.page || node.route);\n}\n\n/**\n * Specificity tier for a segment. Lower = more specific. Matches the\n * priority order in `matchNode`: static > affixed-dynamic > bare-dynamic >\n * catch-all > optional-catch-all.\n */\nfunction segmentTier<TFile>(node: SegmentNode<TFile>): number {\n if (node.segmentType === 'static') return 0;\n if (node.segmentType === 'dynamic' && (node.paramPrefix || node.paramSuffix)) return 1;\n if (node.segmentType === 'dynamic') return 2;\n if (node.segmentType === 'catch-all') return 3;\n if (node.segmentType === 'optional-catch-all') return 4;\n return 2;\n}\n\n/**\n * Score a bare-dynamic candidate by running `matchNode` against its subtree\n * with the remaining URL parts, then reading the tier of each segment in\n * the matched chain. Returns a tier array that is compared lexicographically\n * — the candidate whose chain has a lower tier at the first differing\n * position is more specific.\n *\n * Delegates entirely to `matchNode`, so every segment type and priority\n * rule is inherited automatically — no second copy to drift.\n */\nfunction subtreeMatchScore<TFile>(\n node: SegmentNode<TFile>,\n parts: string[],\n index: number,\n requireTerminal: boolean\n): number[] {\n const chain: SegmentNode<TFile>[] = [];\n const params: Record<string, string | string[]> = {};\n if (!matchNode(node, parts, index, chain, params, requireTerminal)) return [];\n // Skip the first entry (the candidate node itself — it's the bare-dynamic\n // we're scoring, which is the same tier for all candidates).\n return chain.slice(1).map((seg) => segmentTier(seg));\n}\n\n/**\n * Compare two tier arrays lexicographically. Negative means `a` is more\n * specific (should be tried first).\n */\nfunction compareTierArrays(a: number[], b: number[]): number {\n const len = Math.max(a.length, b.length);\n for (let i = 0; i < len; i++) {\n // A shorter match is less specific — missing entries treated as worst tier.\n const ta = i < a.length ? a[i] : 5;\n const tb = i < b.length ? b[i] : 5;\n if (ta !== tb) return ta - tb;\n }\n return 0;\n}\n\n/** Combined affix length for specificity ordering. */\nfunction affixLength<TFile>(node: SegmentNode<TFile>): number {\n return (node.paramPrefix?.length ?? 0) + (node.paramSuffix?.length ?? 0);\n}\n\n/**\n * Recursive depth-first matcher with backtracking.\n *\n * Mutates `chain` and `params` in place for performance; backtracks\n * (restores previous state) when a candidate doesn't lead to a match.\n */\nfunction matchNode<TFile>(\n node: SegmentNode<TFile>,\n parts: string[],\n index: number,\n chain: SegmentNode<TFile>[],\n params: Record<string, string | string[]>,\n requireTerminal: boolean\n): boolean {\n chain.push(node);\n\n // All parts consumed — check if this node is terminal (or any node if !requireTerminal)\n if (index >= parts.length) {\n if (!requireTerminal || isTerminal(node)) return true;\n\n // Groups don't consume URL segments, so a group child's page can\n // match at the same URL depth. Recurse into groups transparently.\n for (const child of node.children) {\n if (child.segmentType === 'group') {\n if (matchNode(child, parts, index, chain, params, requireTerminal)) {\n return true;\n }\n }\n }\n\n // Optional catch-all with zero segments (direct and through groups).\n // The param is NOT set — matching Next.js semantics for [[...slug]]\n // with no path segments.\n const effective = collectEffectiveChildren(node);\n for (const { child, groupChain } of effective) {\n if (child.segmentType === 'optional-catch-all' && (!requireTerminal || isTerminal(child))) {\n chain.push(...groupChain, child);\n return true;\n }\n }\n\n chain.pop();\n return false;\n }\n\n const part = parts[index];\n\n // Flatten children through groups so priority ordering applies globally.\n const effective = collectEffectiveChildren(node);\n\n // 1. Static segments (exact name match)\n for (const { child, groupChain } of effective) {\n if (child.segmentType === 'static' && child.segmentName === part) {\n chain.push(...groupChain);\n if (matchNode(child, parts, index + 1, chain, params, requireTerminal)) {\n return true;\n }\n chain.length -= groupChain.length;\n }\n }\n\n // 2. Affixed dynamic segments (e.g. img-[id].png) — more specific than bare dynamic.\n // Sorted by specificity: longer combined prefix+suffix wins.\n const affixed = effective.filter(\n ({ child }) =>\n child.segmentType === 'dynamic' && child.paramName && (child.paramPrefix || child.paramSuffix)\n );\n affixed.sort((a, b) => affixLength(b.child) - affixLength(a.child));\n for (const { child, groupChain } of affixed) {\n const prefix = child.paramPrefix ?? '';\n const suffix = child.paramSuffix ?? '';\n if (\n part.length > prefix.length + suffix.length &&\n (!prefix || part.startsWith(prefix)) &&\n (!suffix || part.endsWith(suffix))\n ) {\n const value = part.slice(prefix.length, part.length - (suffix.length || 0));\n chain.push(...groupChain);\n const prev = params[child.paramName!];\n params[child.paramName!] = value;\n if (matchNode(child, parts, index + 1, chain, params, requireTerminal)) {\n return true;\n }\n // Backtrack\n chain.length -= groupChain.length;\n if (prev !== undefined) {\n params[child.paramName!] = prev;\n } else {\n delete params[child.paramName!];\n }\n }\n }\n\n // 3. Bare dynamic segments ([param])\n // When multiple bare dynamics compete (common with route groups that\n // flatten into the same parent), sort by subtree specificity so a\n // branch containing a static match for the NEXT URL part is tried\n // first. Without this, the winner depends on children order and\n // renaming a route group can flip it — the exact shape the collision\n // validator exists to reject.\n const bareDynamic = effective.filter(\n ({ child }) =>\n child.segmentType === 'dynamic' && child.paramName && !child.paramPrefix && !child.paramSuffix\n );\n if (bareDynamic.length > 1 && index + 1 < parts.length) {\n const scores = new Map<SegmentNode<TFile>, number[]>();\n for (const { child } of bareDynamic) {\n scores.set(child, subtreeMatchScore(child, parts, index + 1, requireTerminal));\n }\n bareDynamic.sort((a, b) => compareTierArrays(scores.get(a.child)!, scores.get(b.child)!));\n }\n for (const { child, groupChain } of bareDynamic) {\n chain.push(...groupChain);\n const prev = params[child.paramName!];\n params[child.paramName!] = part;\n if (matchNode(child, parts, index + 1, chain, params, requireTerminal)) {\n return true;\n }\n // Backtrack\n chain.length -= groupChain.length;\n if (prev !== undefined) {\n params[child.paramName!] = prev;\n } else {\n delete params[child.paramName!];\n }\n }\n\n // 4. Catch-all segments ([...param]) — must be terminal unless the\n // caller passed requireTerminal:false (metadata route matching needs to\n // find the owning segment even when it has no page).\n for (const { child, groupChain } of effective) {\n if (\n child.segmentType === 'catch-all' &&\n child.paramName &&\n (!requireTerminal || isTerminal(child))\n ) {\n chain.push(...groupChain, child);\n params[child.paramName] = parts.slice(index);\n return true;\n }\n }\n\n // 5. Optional catch-all segments ([[...param]]) — same terminal rule\n for (const { child, groupChain } of effective) {\n if (\n child.segmentType === 'optional-catch-all' &&\n child.paramName &&\n (!requireTerminal || isTerminal(child))\n ) {\n chain.push(...groupChain, child);\n params[child.paramName] = parts.slice(index);\n return true;\n }\n }\n\n chain.pop();\n return false;\n}\n\n/**\n * Generator twin of `matchNode` — yields every match instead of returning\n * the first. Each yield snapshots `chain` and `params` so the caller gets\n * independent results. After yielding, backtracking continues to find the\n * next match.\n */\nfunction* matchNodeAll<TFile>(\n node: SegmentNode<TFile>,\n parts: string[],\n index: number,\n chain: SegmentNode<TFile>[],\n params: Record<string, string | string[]>,\n requireTerminal: boolean\n): Generator<TreeMatchResult<TFile>> {\n chain.push(node);\n\n if (index >= parts.length) {\n if (!requireTerminal || isTerminal(node)) {\n yield { chain: [...chain], params: { ...params } };\n }\n\n for (const child of node.children) {\n if (child.segmentType === 'group') {\n yield* matchNodeAll(child, parts, index, chain, params, requireTerminal);\n }\n }\n\n const effective = collectEffectiveChildren(node);\n for (const { child, groupChain } of effective) {\n if (child.segmentType === 'optional-catch-all' && (!requireTerminal || isTerminal(child))) {\n chain.push(...groupChain, child);\n yield { chain: [...chain], params: { ...params } };\n chain.length -= groupChain.length + 1;\n }\n }\n\n chain.pop();\n return;\n }\n\n const part = parts[index];\n const effective = collectEffectiveChildren(node);\n\n // 1. Static segments\n for (const { child, groupChain } of effective) {\n if (child.segmentType === 'static' && child.segmentName === part) {\n chain.push(...groupChain);\n yield* matchNodeAll(child, parts, index + 1, chain, params, requireTerminal);\n chain.length -= groupChain.length;\n }\n }\n\n // 2. Affixed dynamic segments\n const affixed = effective.filter(\n ({ child }) =>\n child.segmentType === 'dynamic' && child.paramName && (child.paramPrefix || child.paramSuffix)\n );\n affixed.sort((a, b) => affixLength(b.child) - affixLength(a.child));\n for (const { child, groupChain } of affixed) {\n const prefix = child.paramPrefix ?? '';\n const suffix = child.paramSuffix ?? '';\n if (\n part.length > prefix.length + suffix.length &&\n (!prefix || part.startsWith(prefix)) &&\n (!suffix || part.endsWith(suffix))\n ) {\n const value = part.slice(prefix.length, part.length - (suffix.length || 0));\n chain.push(...groupChain);\n const prev = params[child.paramName!];\n params[child.paramName!] = value;\n yield* matchNodeAll(child, parts, index + 1, chain, params, requireTerminal);\n chain.length -= groupChain.length;\n if (prev !== undefined) {\n params[child.paramName!] = prev;\n } else {\n delete params[child.paramName!];\n }\n }\n }\n\n // 3. Bare dynamic segments\n const bareDynamic = effective.filter(\n ({ child }) =>\n child.segmentType === 'dynamic' && child.paramName && !child.paramPrefix && !child.paramSuffix\n );\n if (bareDynamic.length > 1 && index + 1 < parts.length) {\n const scores = new Map<SegmentNode<TFile>, number[]>();\n for (const { child } of bareDynamic) {\n scores.set(child, subtreeMatchScore(child, parts, index + 1, requireTerminal));\n }\n bareDynamic.sort((a, b) => compareTierArrays(scores.get(a.child)!, scores.get(b.child)!));\n }\n for (const { child, groupChain } of bareDynamic) {\n chain.push(...groupChain);\n const prev = params[child.paramName!];\n params[child.paramName!] = part;\n yield* matchNodeAll(child, parts, index + 1, chain, params, requireTerminal);\n chain.length -= groupChain.length;\n if (prev !== undefined) {\n params[child.paramName!] = prev;\n } else {\n delete params[child.paramName!];\n }\n }\n\n // 4. Catch-all segments\n for (const { child, groupChain } of effective) {\n if (\n child.segmentType === 'catch-all' &&\n child.paramName &&\n (!requireTerminal || isTerminal(child))\n ) {\n chain.push(...groupChain, child);\n const prev = params[child.paramName];\n params[child.paramName] = parts.slice(index);\n yield { chain: [...chain], params: { ...params } };\n chain.length -= groupChain.length + 1;\n if (prev !== undefined) {\n params[child.paramName] = prev;\n } else {\n delete params[child.paramName];\n }\n }\n }\n\n // 5. Optional catch-all segments\n for (const { child, groupChain } of effective) {\n if (\n child.segmentType === 'optional-catch-all' &&\n child.paramName &&\n (!requireTerminal || isTerminal(child))\n ) {\n chain.push(...groupChain, child);\n const prev = params[child.paramName];\n params[child.paramName] = parts.slice(index);\n yield { chain: [...chain], params: { ...params } };\n chain.length -= groupChain.length + 1;\n if (prev !== undefined) {\n params[child.paramName] = prev;\n } else {\n delete params[child.paramName];\n }\n }\n }\n\n chain.pop();\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAqDA,SAAgB,cACd,MACA,OACA,SAC+B;CAC/B,MAAM,QAA8B,CAAC;CACrC,MAAM,SAA4C,CAAC;CAGnD,IAAI,UAAU,MAAM,OAAO,GAAG,OAAO,QAFb,SAAS,mBAAmB,IAEQ,GAC1D,OAAO;EAAE;EAAO;CAAO;CAEzB,OAAO;AACT;;;;;;;;;AA2CA,SAAS,yBACP,MACA,aAAmC,CAAC,GACX;CACzB,MAAM,SAAkC,CAAC;CACzC,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,MAAM,gBAAgB,SAAS;EACjC,MAAM,SAAS,yBAAyB,OAAO,CAAC,GAAG,YAAY,KAAK,CAAC;EACrE,OAAO,KAAK,GAAG,MAAM;CACvB,OACE,OAAO,KAAK;EAAE;EAAO;CAAW,CAAC;CAGrC,OAAO;AACT;;AAGA,SAAS,WAAkB,MAAmC;CAC5D,OAAO,CAAC,EAAE,KAAK,QAAQ,KAAK;AAC9B;;;;;;AAOA,SAAS,YAAmB,MAAkC;CAC5D,IAAI,KAAK,gBAAgB,UAAU,OAAO;CAC1C,IAAI,KAAK,gBAAgB,cAAc,KAAK,eAAe,KAAK,cAAc,OAAO;CACrF,IAAI,KAAK,gBAAgB,WAAW,OAAO;CAC3C,IAAI,KAAK,gBAAgB,aAAa,OAAO;CAC7C,IAAI,KAAK,gBAAgB,sBAAsB,OAAO;CACtD,OAAO;AACT;;;;;;;;;;;AAYA,SAAS,kBACP,MACA,OACA,OACA,iBACU;CACV,MAAM,QAA8B,CAAC;CAErC,IAAI,CAAC,UAAU,MAAM,OAAO,OAAO,OAAO,CAAA,GAAQ,eAAe,GAAG,OAAO,CAAC;CAG5E,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,KAAK,QAAQ,YAAY,GAAG,CAAC;AACrD;;;;;AAMA,SAAS,kBAAkB,GAAa,GAAqB;CAC3D,MAAM,MAAM,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;CACvC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK;EAE5B,MAAM,KAAK,IAAI,EAAE,SAAS,EAAE,KAAK;EACjC,MAAM,KAAK,IAAI,EAAE,SAAS,EAAE,KAAK;EACjC,IAAI,OAAO,IAAI,OAAO,KAAK;CAC7B;CACA,OAAO;AACT;;AAGA,SAAS,YAAmB,MAAkC;CAC5D,QAAQ,KAAK,aAAa,UAAU,MAAM,KAAK,aAAa,UAAU;AACxE;;;;;;;AAQA,SAAS,UACP,MACA,OACA,OACA,OACA,QACA,iBACS;CACT,MAAM,KAAK,IAAI;CAGf,IAAI,SAAS,MAAM,QAAQ;EACzB,IAAI,CAAC,mBAAmB,WAAW,IAAI,GAAG,OAAO;EAIjD,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,MAAM,gBAAgB,SACpB;OAAA,UAAU,OAAO,OAAO,OAAO,OAAO,QAAQ,eAAe,GAC/D,OAAO;EAAA;EAQb,MAAM,YAAY,yBAAyB,IAAI;EAC/C,KAAK,MAAM,EAAE,OAAO,gBAAgB,WAClC,IAAI,MAAM,gBAAgB,yBAAyB,CAAC,mBAAmB,WAAW,KAAK,IAAI;GACzF,MAAM,KAAK,GAAG,YAAY,KAAK;GAC/B,OAAO;EACT;EAGF,MAAM,IAAI;EACV,OAAO;CACT;CAEA,MAAM,OAAO,MAAM;CAGnB,MAAM,YAAY,yBAAyB,IAAI;CAG/C,KAAK,MAAM,EAAE,OAAO,gBAAgB,WAClC,IAAI,MAAM,gBAAgB,YAAY,MAAM,gBAAgB,MAAM;EAChE,MAAM,KAAK,GAAG,UAAU;EACxB,IAAI,UAAU,OAAO,OAAO,QAAQ,GAAG,OAAO,QAAQ,eAAe,GACnE,OAAO;EAET,MAAM,UAAU,WAAW;CAC7B;CAKF,MAAM,UAAU,UAAU,QACvB,EAAE,YACD,MAAM,gBAAgB,aAAa,MAAM,cAAc,MAAM,eAAe,MAAM,YACtF;CACA,QAAQ,MAAM,GAAG,MAAM,YAAY,EAAE,KAAK,IAAI,YAAY,EAAE,KAAK,CAAC;CAClE,KAAK,MAAM,EAAE,OAAO,gBAAgB,SAAS;EAC3C,MAAM,SAAS,MAAM,eAAe;EACpC,MAAM,SAAS,MAAM,eAAe;EACpC,IACE,KAAK,SAAS,OAAO,SAAS,OAAO,WACpC,CAAC,UAAU,KAAK,WAAW,MAAM,OACjC,CAAC,UAAU,KAAK,SAAS,MAAM,IAChC;GACA,MAAM,QAAQ,KAAK,MAAM,OAAO,QAAQ,KAAK,UAAU,OAAO,UAAU,EAAE;GAC1E,MAAM,KAAK,GAAG,UAAU;GACxB,MAAM,OAAO,OAAO,MAAM;GAC1B,OAAO,MAAM,aAAc;GAC3B,IAAI,UAAU,OAAO,OAAO,QAAQ,GAAG,OAAO,QAAQ,eAAe,GACnE,OAAO;GAGT,MAAM,UAAU,WAAW;GAC3B,IAAI,SAAS,KAAA,GACX,OAAO,MAAM,aAAc;QAE3B,OAAO,OAAO,MAAM;EAExB;CACF;CASA,MAAM,cAAc,UAAU,QAC3B,EAAE,YACD,MAAM,gBAAgB,aAAa,MAAM,aAAa,CAAC,MAAM,eAAe,CAAC,MAAM,WACvF;CACA,IAAI,YAAY,SAAS,KAAK,QAAQ,IAAI,MAAM,QAAQ;EACtD,MAAM,yBAAS,IAAI,IAAkC;EACrD,KAAK,MAAM,EAAE,WAAW,aACtB,OAAO,IAAI,OAAO,kBAAkB,OAAO,OAAO,QAAQ,GAAG,eAAe,CAAC;EAE/E,YAAY,MAAM,GAAG,MAAM,kBAAkB,OAAO,IAAI,EAAE,KAAK,GAAI,OAAO,IAAI,EAAE,KAAK,CAAE,CAAC;CAC1F;CACA,KAAK,MAAM,EAAE,OAAO,gBAAgB,aAAa;EAC/C,MAAM,KAAK,GAAG,UAAU;EACxB,MAAM,OAAO,OAAO,MAAM;EAC1B,OAAO,MAAM,aAAc;EAC3B,IAAI,UAAU,OAAO,OAAO,QAAQ,GAAG,OAAO,QAAQ,eAAe,GACnE,OAAO;EAGT,MAAM,UAAU,WAAW;EAC3B,IAAI,SAAS,KAAA,GACX,OAAO,MAAM,aAAc;OAE3B,OAAO,OAAO,MAAM;CAExB;CAKA,KAAK,MAAM,EAAE,OAAO,gBAAgB,WAClC,IACE,MAAM,gBAAgB,eACtB,MAAM,cACL,CAAC,mBAAmB,WAAW,KAAK,IACrC;EACA,MAAM,KAAK,GAAG,YAAY,KAAK;EAC/B,OAAO,MAAM,aAAa,MAAM,MAAM,KAAK;EAC3C,OAAO;CACT;CAIF,KAAK,MAAM,EAAE,OAAO,gBAAgB,WAClC,IACE,MAAM,gBAAgB,wBACtB,MAAM,cACL,CAAC,mBAAmB,WAAW,KAAK,IACrC;EACA,MAAM,KAAK,GAAG,YAAY,KAAK;EAC/B,OAAO,MAAM,aAAa,MAAM,MAAM,KAAK;EAC3C,OAAO;CACT;CAGF,MAAM,IAAI;CACV,OAAO;AACT"}