217 lines
6.5 KiB
JavaScript
217 lines
6.5 KiB
JavaScript
/*
|
|
* Extracted from browser-delivered Turbopack chunk: 5d5b47876e53e564.da1ba52a93.js
|
|
* Module id: 790237
|
|
* For reading/searching only; this factory depends on the original Turbopack runtime.
|
|
*/
|
|
|
|
const moduleFactory = (e, t, r) => {
|
|
"use strict";
|
|
Object.defineProperty(r, "__esModule", { value: !0 });
|
|
var n = {
|
|
getNamedMiddlewareRegex: function () {
|
|
return h;
|
|
},
|
|
getNamedRouteRegex: function () {
|
|
return p;
|
|
},
|
|
getRouteRegex: function () {
|
|
return d;
|
|
},
|
|
};
|
|
for (var o in n) Object.defineProperty(r, o, { enumerable: !0, get: n[o] });
|
|
let a = e.r(695283),
|
|
i = e.r(617286),
|
|
l = e.r(205240),
|
|
s = e.r(239314),
|
|
c = e.r(981344);
|
|
function u(e, t, r) {
|
|
let n = {},
|
|
o = 1,
|
|
a = [];
|
|
for (let u of (0, s.removeTrailingSlash)(e).slice(1).split("/")) {
|
|
let e = i.INTERCEPTION_ROUTE_MARKERS.find((e) => u.startsWith(e)),
|
|
s = u.match(c.PARAMETER_PATTERN);
|
|
if (e && s && s[2]) {
|
|
let {
|
|
key: t,
|
|
optional: r,
|
|
repeat: i,
|
|
} = (0, c.parseMatchedParameter)(s[2]);
|
|
(n[t] = { pos: o++, repeat: i, optional: r }),
|
|
a.push(`/${(0, l.escapeStringRegexp)(e)}([^/]+?)`);
|
|
} else if (s && s[2]) {
|
|
let {
|
|
key: e,
|
|
repeat: t,
|
|
optional: i,
|
|
} = (0, c.parseMatchedParameter)(s[2]);
|
|
(n[e] = { pos: o++, repeat: t, optional: i }),
|
|
r && s[1] && a.push(`/${(0, l.escapeStringRegexp)(s[1])}`);
|
|
let u = t ? (i ? "(?:/(.+?))?" : "/(.+?)") : "/([^/]+?)";
|
|
r && s[1] && (u = u.substring(1)), a.push(u);
|
|
} else a.push(`/${(0, l.escapeStringRegexp)(u)}`);
|
|
t && s && s[3] && a.push((0, l.escapeStringRegexp)(s[3]));
|
|
}
|
|
return { parameterizedRoute: a.join(""), groups: n };
|
|
}
|
|
function d(
|
|
e,
|
|
{
|
|
includeSuffix: t = !1,
|
|
includePrefix: r = !1,
|
|
excludeOptionalTrailingSlash: n = !1,
|
|
} = {},
|
|
) {
|
|
let { parameterizedRoute: o, groups: a } = u(e, t, r),
|
|
i = o;
|
|
return n || (i += "(?:/)?"), { re: RegExp(`^${i}$`), groups: a };
|
|
}
|
|
function f({
|
|
interceptionMarker: e,
|
|
getSafeRouteKey: t,
|
|
segment: r,
|
|
routeKeys: n,
|
|
keyPrefix: o,
|
|
backreferenceDuplicateKeys: a,
|
|
}) {
|
|
let i,
|
|
{ key: s, optional: u, repeat: d } = (0, c.parseMatchedParameter)(r),
|
|
f = s.replace(/\W/g, "");
|
|
o && (f = `${o}${f}`);
|
|
let m = !1;
|
|
(0 === f.length || f.length > 30) && (m = !0),
|
|
isNaN(parseInt(f.slice(0, 1))) || (m = !0),
|
|
m && (f = t());
|
|
let p = f in n;
|
|
o ? (n[f] = `${o}${s}`) : (n[f] = s);
|
|
let h = e ? (0, l.escapeStringRegexp)(e) : "";
|
|
return (
|
|
(i = p && a ? `\\k<${f}>` : d ? `(?<${f}>.+?)` : `(?<${f}>[^/]+?)`),
|
|
{
|
|
key: s,
|
|
pattern: u ? `(?:/${h}${i})?` : `/${h}${i}`,
|
|
cleanedKey: f,
|
|
optional: u,
|
|
repeat: d,
|
|
}
|
|
);
|
|
}
|
|
function m(e, t, r, n, o, u = { names: {}, intercepted: {} }) {
|
|
let d,
|
|
p =
|
|
((d = 0),
|
|
() => {
|
|
let e = "",
|
|
t = ++d;
|
|
for (; t > 0; )
|
|
(e += String.fromCharCode(97 + ((t - 1) % 26))),
|
|
(t = Math.floor((t - 1) / 26));
|
|
return e;
|
|
}),
|
|
h = {},
|
|
g = [],
|
|
b = [];
|
|
for (let d of ((u = structuredClone(u)),
|
|
(0, s.removeTrailingSlash)(e).slice(1).split("/"))) {
|
|
let e,
|
|
s = i.INTERCEPTION_ROUTE_MARKERS.some((e) => d.startsWith(e)),
|
|
m = d.match(c.PARAMETER_PATTERN),
|
|
v = s ? m?.[1] : void 0;
|
|
if (
|
|
(v && m?.[2]
|
|
? ((e = t ? a.NEXT_INTERCEPTION_MARKER_PREFIX : void 0),
|
|
(u.intercepted[m[2]] = v))
|
|
: (e =
|
|
m?.[2] && u.intercepted[m[2]]
|
|
? t
|
|
? a.NEXT_INTERCEPTION_MARKER_PREFIX
|
|
: void 0
|
|
: t
|
|
? a.NEXT_QUERY_PARAM_PREFIX
|
|
: void 0),
|
|
v && m && m[2])
|
|
) {
|
|
let {
|
|
key: t,
|
|
pattern: r,
|
|
cleanedKey: n,
|
|
repeat: a,
|
|
optional: i,
|
|
} = f({
|
|
getSafeRouteKey: p,
|
|
interceptionMarker: v,
|
|
segment: m[2],
|
|
routeKeys: h,
|
|
keyPrefix: e,
|
|
backreferenceDuplicateKeys: o,
|
|
});
|
|
g.push(r),
|
|
b.push(`/${m[1]}:${u.names[t] ?? n}${a ? (i ? "*" : "+") : ""}`),
|
|
(u.names[t] ??= n);
|
|
} else if (m && m[2]) {
|
|
n &&
|
|
m[1] &&
|
|
(g.push(`/${(0, l.escapeStringRegexp)(m[1])}`), b.push(`/${m[1]}`));
|
|
let {
|
|
key: t,
|
|
pattern: r,
|
|
cleanedKey: a,
|
|
repeat: i,
|
|
optional: s,
|
|
} = f({
|
|
getSafeRouteKey: p,
|
|
segment: m[2],
|
|
routeKeys: h,
|
|
keyPrefix: e,
|
|
backreferenceDuplicateKeys: o,
|
|
}),
|
|
c = r;
|
|
n && m[1] && (c = c.substring(1)),
|
|
g.push(c),
|
|
b.push(`/:${u.names[t] ?? a}${i ? (s ? "*" : "+") : ""}`),
|
|
(u.names[t] ??= a);
|
|
} else g.push(`/${(0, l.escapeStringRegexp)(d)}`), b.push(`/${d}`);
|
|
r &&
|
|
m &&
|
|
m[3] &&
|
|
(g.push((0, l.escapeStringRegexp)(m[3])), b.push(m[3]));
|
|
}
|
|
return {
|
|
namedParameterizedRoute: g.join(""),
|
|
routeKeys: h,
|
|
pathToRegexpPattern: b.join(""),
|
|
reference: u,
|
|
};
|
|
}
|
|
function p(e, t) {
|
|
let r = m(
|
|
e,
|
|
t.prefixRouteKeys,
|
|
t.includeSuffix ?? !1,
|
|
t.includePrefix ?? !1,
|
|
t.backreferenceDuplicateKeys ?? !1,
|
|
t.reference,
|
|
),
|
|
n = r.namedParameterizedRoute;
|
|
return (
|
|
t.excludeOptionalTrailingSlash || (n += "(?:/)?"),
|
|
{
|
|
...d(e, t),
|
|
namedRegex: `^${n}$`,
|
|
routeKeys: r.routeKeys,
|
|
pathToRegexpPattern: r.pathToRegexpPattern,
|
|
reference: r.reference,
|
|
}
|
|
);
|
|
}
|
|
function h(e, t) {
|
|
let { parameterizedRoute: r } = u(e, !1, !1),
|
|
{ catchAll: n = !0 } = t;
|
|
if ("/" === r) return { namedRegex: `^/${n ? ".*" : ""}$` };
|
|
let { namedParameterizedRoute: o } = m(e, !1, !1, !1, !1, void 0);
|
|
return { namedRegex: `^${o}${n ? "(?:(/.*)?)" : ""}$` };
|
|
}
|
|
};
|
|
|
|
export default moduleFactory;
|