@websolutespa/bom-next 3.0.0 → 3.0.2

package/dist/node_modules/peberminta/lib/core.js

@@ -0,0 +1,149 @@
+//#region ../../node_modules/peberminta/lib/core.mjs
+function token(onToken, onEnd) {
+	return (data, i) => {
+		let position = i;
+		let value = void 0;
+		if (i < data.tokens.length) {
+			value = onToken(data.tokens[i], data, i);
+			if (value !== void 0) position++;
+		} else onEnd?.(data, i);
+		return value === void 0 ? { matched: false } : {
+			matched: true,
+			position,
+			value
+		};
+	};
+}
+function mapInner(r, f) {
+	return r.matched ? {
+		matched: true,
+		position: r.position,
+		value: f(r.value, r.position)
+	} : r;
+}
+function mapOuter(r, f) {
+	return r.matched ? f(r) : r;
+}
+function map(p, mapper) {
+	return (data, i) => mapInner(p(data, i), (v, j) => mapper(v, data, i, j));
+}
+function option(p, def) {
+	return (data, i) => {
+		const r = p(data, i);
+		return r.matched ? r : {
+			matched: true,
+			position: i,
+			value: def
+		};
+	};
+}
+function choice(...ps) {
+	return (data, i) => {
+		for (const p of ps) {
+			const result = p(data, i);
+			if (result.matched) return result;
+		}
+		return { matched: false };
+	};
+}
+function otherwise(pa, pb) {
+	return (data, i) => {
+		const r1 = pa(data, i);
+		return r1.matched ? r1 : pb(data, i);
+	};
+}
+function takeWhile(p, test) {
+	return (data, i) => {
+		const values = [];
+		let success = true;
+		do {
+			const r = p(data, i);
+			if (r.matched && test(r.value, values.length + 1, data, i, r.position)) {
+				values.push(r.value);
+				i = r.position;
+			} else success = false;
+		} while (success);
+		return {
+			matched: true,
+			position: i,
+			value: values
+		};
+	};
+}
+function many(p) {
+	return takeWhile(p, () => true);
+}
+function many1(p) {
+	return ab(p, many(p), (head, tail) => [head, ...tail]);
+}
+function ab(pa, pb, join) {
+	return (data, i) => mapOuter(pa(data, i), (ma) => mapInner(pb(data, ma.position), (vb, j) => join(ma.value, vb, data, i, j)));
+}
+function left(pa, pb) {
+	return ab(pa, pb, (va) => va);
+}
+function right(pa, pb) {
+	return ab(pa, pb, (va, vb) => vb);
+}
+function abc(pa, pb, pc, join) {
+	return (data, i) => mapOuter(pa(data, i), (ma) => mapOuter(pb(data, ma.position), (mb) => mapInner(pc(data, mb.position), (vc, j) => join(ma.value, mb.value, vc, data, i, j))));
+}
+function middle(pa, pb, pc) {
+	return abc(pa, pb, pc, (ra, rb) => rb);
+}
+function all(...ps) {
+	return (data, i) => {
+		const result = [];
+		let position = i;
+		for (const p of ps) {
+			const r1 = p(data, position);
+			if (r1.matched) {
+				result.push(r1.value);
+				position = r1.position;
+			} else return { matched: false };
+		}
+		return {
+			matched: true,
+			position,
+			value: result
+		};
+	};
+}
+function flatten(...ps) {
+	return flatten1(all(...ps));
+}
+function flatten1(p) {
+	return map(p, (vs) => vs.flatMap((v) => v));
+}
+function chainReduce(acc, f) {
+	return (data, i) => {
+		let loop = true;
+		let acc1 = acc;
+		let pos = i;
+		do {
+			const r = f(acc1, data, pos)(data, pos);
+			if (r.matched) {
+				acc1 = r.value;
+				pos = r.position;
+			} else loop = false;
+		} while (loop);
+		return {
+			matched: true,
+			position: pos,
+			value: acc1
+		};
+	};
+}
+function reduceLeft(acc, p, reducer) {
+	return chainReduce(acc, (acc) => map(p, (v, data, i, j) => reducer(acc, v, data, i, j)));
+}
+function leftAssoc2(pLeft, pOper, pRight) {
+	return chain(pLeft, (v0) => reduceLeft(v0, ab(pOper, pRight, (f, y) => [f, y]), (acc, [f, y]) => f(acc, y)));
+}
+function chain(p, f) {
+	return (data, i) => mapOuter(p(data, i), (m1) => f(m1.value, data, i, m1.position)(data, m1.position));
+}
+//#endregion
+export { ab, abc, all, all as and, chain, chainReduce, choice, choice as or, otherwise as eitherOr, otherwise, flatten, flatten1, left, leftAssoc2, many, many1, many1 as some, map, middle, option, reduceLeft, right, takeWhile, token };
+
+//# sourceMappingURL=core.js.map

package/dist/node_modules/peberminta/lib/core.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"core.js","names":[],"sources":["../../../../../../node_modules/peberminta/lib/core.mjs"],"sourcesContent":["import { clamp, escapeWhitespace } from './util.mjs';\n\nfunction emit(value) {\n    return (data, i) => ({\n        matched: true,\n        position: i,\n        value: value\n    });\n}\nfunction make(\nf) {\n    return (data, i) => ({\n        matched: true,\n        position: i,\n        value: f(data, i)\n    });\n}\nfunction action(\nf) {\n    return (data, i) => {\n        f(data, i);\n        return {\n            matched: true,\n            position: i,\n            value: null\n        };\n    };\n}\nfunction fail(\ndata, i) {\n    return { matched: false };\n}\nfunction error(message) {\n    return (data, i) => {\n        throw new Error((message instanceof Function) ? message(data, i) : message);\n    };\n}\nfunction token(\nonToken,\nonEnd) {\n    return (data, i) => {\n        let position = i;\n        let value = undefined;\n        if (i < data.tokens.length) {\n            value = onToken(data.tokens[i], data, i);\n            if (value !== undefined) {\n                position++;\n            }\n        }\n        else {\n            onEnd?.(data, i);\n        }\n        return (value === undefined)\n            ? { matched: false }\n            : {\n                matched: true,\n                position: position,\n                value: value\n            };\n    };\n}\nfunction any(data, i) {\n    return (i < data.tokens.length)\n        ? {\n            matched: true,\n            position: i + 1,\n            value: data.tokens[i]\n        }\n        : { matched: false };\n}\nfunction satisfy(\ntest) {\n    return (data, i) => (i < data.tokens.length && test(data.tokens[i], data, i))\n        ? {\n            matched: true,\n            position: i + 1,\n            value: data.tokens[i]\n        }\n        : { matched: false };\n}\nfunction mapInner(r, f) {\n    return (r.matched) ? ({\n        matched: true,\n        position: r.position,\n        value: f(r.value, r.position)\n    }) : r;\n}\nfunction mapOuter(r, f) {\n    return (r.matched) ? f(r) : r;\n}\nfunction map(p, mapper) {\n    return (data, i) => mapInner(p(data, i), (v, j) => mapper(v, data, i, j));\n}\nfunction map1(p,\nmapper) {\n    return (data, i) => mapOuter(p(data, i), (m) => mapper(m, data, i));\n}\nfunction peek(p, f) {\n    return (data, i) => {\n        const r = p(data, i);\n        f(r, data, i);\n        return r;\n    };\n}\nfunction option(p, def) {\n    return (data, i) => {\n        const r = p(data, i);\n        return (r.matched)\n            ? r\n            : {\n                matched: true,\n                position: i,\n                value: def\n            };\n    };\n}\nfunction not(p) {\n    return (data, i) => {\n        const r = p(data, i);\n        return (r.matched)\n            ? { matched: false }\n            : {\n                matched: true,\n                position: i,\n                value: true\n            };\n    };\n}\nfunction choice(...ps) {\n    return (data, i) => {\n        for (const p of ps) {\n            const result = p(data, i);\n            if (result.matched) {\n                return result;\n            }\n        }\n        return { matched: false };\n    };\n}\nfunction otherwise(pa, pb) {\n    return (data, i) => {\n        const r1 = pa(data, i);\n        return (r1.matched)\n            ? r1\n            : pb(data, i);\n    };\n}\nfunction longest(...ps) {\n    return (data, i) => {\n        let match = undefined;\n        for (const p of ps) {\n            const result = p(data, i);\n            if (result.matched && (!match || match.position < result.position)) {\n                match = result;\n            }\n        }\n        return match || { matched: false };\n    };\n}\nfunction takeWhile(p,\ntest) {\n    return (data, i) => {\n        const values = [];\n        let success = true;\n        do {\n            const r = p(data, i);\n            if (r.matched && test(r.value, values.length + 1, data, i, r.position)) {\n                values.push(r.value);\n                i = r.position;\n            }\n            else {\n                success = false;\n            }\n        } while (success);\n        return {\n            matched: true,\n            position: i,\n            value: values\n        };\n    };\n}\nfunction takeUntil(p,\ntest) {\n    return takeWhile(p, (value, n, data, i, j) => !test(value, n, data, i, j));\n}\nfunction takeWhileP(pValue, pTest) {\n    return takeWhile(pValue, (value, n, data, i) => pTest(data, i).matched);\n}\nfunction takeUntilP(pValue, pTest) {\n    return takeWhile(pValue, (value, n, data, i) => !pTest(data, i).matched);\n}\nfunction many(p) {\n    return takeWhile(p, () => true);\n}\nfunction many1(p) {\n    return ab(p, many(p), (head, tail) => [head, ...tail]);\n}\nfunction ab(pa, pb, join) {\n    return (data, i) => mapOuter(pa(data, i), (ma) => mapInner(pb(data, ma.position), (vb, j) => join(ma.value, vb, data, i, j)));\n}\nfunction left(pa, pb) {\n    return ab(pa, pb, (va) => va);\n}\nfunction right(pa, pb) {\n    return ab(pa, pb, (va, vb) => vb);\n}\nfunction abc(pa, pb, pc, join) {\n    return (data, i) => mapOuter(pa(data, i), (ma) => mapOuter(pb(data, ma.position), (mb) => mapInner(pc(data, mb.position), (vc, j) => join(ma.value, mb.value, vc, data, i, j))));\n}\nfunction middle(pa, pb, pc) {\n    return abc(pa, pb, pc, (ra, rb) => rb);\n}\nfunction all(...ps) {\n    return (data, i) => {\n        const result = [];\n        let position = i;\n        for (const p of ps) {\n            const r1 = p(data, position);\n            if (r1.matched) {\n                result.push(r1.value);\n                position = r1.position;\n            }\n            else {\n                return { matched: false };\n            }\n        }\n        return {\n            matched: true,\n            position: position,\n            value: result\n        };\n    };\n}\nfunction skip(...ps) {\n    return map(all(...ps), () => null);\n}\nfunction flatten(...ps) {\n    return flatten1(all(...ps));\n}\nfunction flatten1(p) {\n    return map(p, (vs) => vs.flatMap((v) => v));\n}\nfunction sepBy1(pValue, pSep) {\n    return ab(pValue, many(right(pSep, pValue)), (head, tail) => [head, ...tail]);\n}\nfunction sepBy(pValue, pSep) {\n    return otherwise(sepBy1(pValue, pSep), emit([]));\n}\nfunction chainReduce(acc,\nf) {\n    return (data, i) => {\n        let loop = true;\n        let acc1 = acc;\n        let pos = i;\n        do {\n            const r = f(acc1, data, pos)(data, pos);\n            if (r.matched) {\n                acc1 = r.value;\n                pos = r.position;\n            }\n            else {\n                loop = false;\n            }\n        } while (loop);\n        return {\n            matched: true,\n            position: pos,\n            value: acc1\n        };\n    };\n}\nfunction reduceLeft(acc, p,\nreducer) {\n    return chainReduce(acc, (acc) => map(p, (v, data, i, j) => reducer(acc, v, data, i, j)));\n}\nfunction reduceRight(p, acc,\nreducer) {\n    return map(many(p), (vs, data, i, j) => vs.reduceRight((acc, v) => reducer(v, acc, data, i, j), acc));\n}\nfunction leftAssoc1(pLeft, pOper) {\n    return chain(pLeft, (v0) => reduceLeft(v0, pOper, (acc, f) => f(acc)));\n}\nfunction rightAssoc1(pOper, pRight) {\n    return ab(reduceRight(pOper, (y) => y, (f, acc) => (y) => f(acc(y))), pRight, (f, v) => f(v));\n}\nfunction leftAssoc2(pLeft, pOper, pRight) {\n    return chain(pLeft, (v0) => reduceLeft(v0, ab(pOper, pRight, (f, y) => [f, y]), (acc, [f, y]) => f(acc, y)));\n}\nfunction rightAssoc2(pLeft, pOper, pRight) {\n    return ab(reduceRight(ab(pLeft, pOper, (x, f) => [x, f]), (y) => y, ([x, f], acc) => (y) => f(x, acc(y))), pRight, (f, v) => f(v));\n}\nfunction condition(cond, pTrue, pFalse) {\n    return (data, i) => (cond(data, i))\n        ? pTrue(data, i)\n        : pFalse(data, i);\n}\nfunction decide(p) {\n    return (data, i) => mapOuter(p(data, i), (m1) => m1.value(data, m1.position));\n}\nfunction chain(p,\nf) {\n    return (data, i) => mapOuter(p(data, i), (m1) => f(m1.value, data, i, m1.position)(data, m1.position));\n}\nfunction ahead(p) {\n    return (data, i) => mapOuter(p(data, i), (m1) => ({\n        matched: true,\n        position: i,\n        value: m1.value\n    }));\n}\nfunction recursive(f) {\n    return function (data, i) {\n        return f()(data, i);\n    };\n}\nfunction start(data, i) {\n    return (i !== 0)\n        ? { matched: false }\n        : {\n            matched: true,\n            position: i,\n            value: true\n        };\n}\nfunction end(data, i) {\n    return (i < data.tokens.length)\n        ? { matched: false }\n        : {\n            matched: true,\n            position: i,\n            value: true\n        };\n}\nfunction remainingTokensNumber(data, i) {\n    return data.tokens.length - i;\n}\nfunction parserPosition(data, i, formatToken, contextTokens = 3) {\n    const len = data.tokens.length;\n    const lowIndex = clamp(0, i - contextTokens, len - contextTokens);\n    const highIndex = clamp(contextTokens, i + 1 + contextTokens, len);\n    const tokensSlice = data.tokens.slice(lowIndex, highIndex);\n    const lines = [];\n    const indexWidth = String(highIndex - 1).length + 1;\n    if (i < 0) {\n        lines.push(`${String(i).padStart(indexWidth)} >>`);\n    }\n    if (0 < lowIndex) {\n        lines.push('...'.padStart(indexWidth + 6));\n    }\n    for (let j = 0; j < tokensSlice.length; j++) {\n        const index = lowIndex + j;\n        lines.push(`${String(index).padStart(indexWidth)} ${(index === i ? '>' : ' ')} ${escapeWhitespace(formatToken(tokensSlice[j]))}`);\n    }\n    if (highIndex < len) {\n        lines.push('...'.padStart(indexWidth + 6));\n    }\n    if (len <= i) {\n        lines.push(`${String(i).padStart(indexWidth)} >>`);\n    }\n    return lines.join('\\n');\n}\nfunction parse(parser, tokens, options, formatToken = JSON.stringify) {\n    const data = { tokens: tokens, options: options };\n    const result = parser(data, 0);\n    if (!result.matched) {\n        throw new Error('No match');\n    }\n    if (result.position < data.tokens.length) {\n        throw new Error(`Partial match. Parsing stopped at:\\n${parserPosition(data, result.position, formatToken)}`);\n    }\n    return result.value;\n}\nfunction tryParse(parser, tokens, options) {\n    const result = parser({ tokens: tokens, options: options }, 0);\n    return (result.matched)\n        ? result.value\n        : undefined;\n}\nfunction match(matcher, tokens, options) {\n    const result = matcher({ tokens: tokens, options: options }, 0);\n    return result.value;\n}\n\nexport { ab, abc, action, ahead, all, all as and, any, chain, chainReduce, choice, condition, decide, skip as discard, otherwise as eitherOr, emit, end, end as eof, error, fail, flatten, flatten1, left, leftAssoc1, leftAssoc2, longest, ahead as lookAhead, make, many, many1, map, map1, match, middle, not, emit as of, option, choice as or, otherwise, parse, parserPosition, peek, recursive, reduceLeft, reduceRight, remainingTokensNumber, right, rightAssoc1, rightAssoc2, satisfy, sepBy, sepBy1, skip, many1 as some, start, takeUntil, takeUntilP, takeWhile, takeWhileP, token, tryParse };\n"],"x_google_ignoreList":[0],"mappings":";AAqCA,SAAS,MACT,SACA,OAAO;CACH,QAAQ,MAAM,MAAM;EAChB,IAAI,WAAW;EACf,IAAI,QAAQ,KAAA;EACZ,IAAI,IAAI,KAAK,OAAO,QAAQ;GACxB,QAAQ,QAAQ,KAAK,OAAO,IAAI,MAAM,CAAC;GACvC,IAAI,UAAU,KAAA,GACV;EAER,OAEI,QAAQ,MAAM,CAAC;EAEnB,OAAQ,UAAU,KAAA,IACZ,EAAE,SAAS,MAAM,IACjB;GACE,SAAS;GACC;GACH;EACX;CACR;AACJ;AAoBA,SAAS,SAAS,GAAG,GAAG;CACpB,OAAQ,EAAE,UAAY;EAClB,SAAS;EACT,UAAU,EAAE;EACZ,OAAO,EAAE,EAAE,OAAO,EAAE,QAAQ;CAChC,IAAK;AACT;AACA,SAAS,SAAS,GAAG,GAAG;CACpB,OAAQ,EAAE,UAAW,EAAE,CAAC,IAAI;AAChC;AACA,SAAS,IAAI,GAAG,QAAQ;CACpB,QAAQ,MAAM,MAAM,SAAS,EAAE,MAAM,CAAC,IAAI,GAAG,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,CAAC;AAC5E;AAYA,SAAS,OAAO,GAAG,KAAK;CACpB,QAAQ,MAAM,MAAM;EAChB,MAAM,IAAI,EAAE,MAAM,CAAC;EACnB,OAAQ,EAAE,UACJ,IACA;GACE,SAAS;GACT,UAAU;GACV,OAAO;EACX;CACR;AACJ;AAaA,SAAS,OAAO,GAAG,IAAI;CACnB,QAAQ,MAAM,MAAM;EAChB,KAAK,MAAM,KAAK,IAAI;GAChB,MAAM,SAAS,EAAE,MAAM,CAAC;GACxB,IAAI,OAAO,SACP,OAAO;EAEf;EACA,OAAO,EAAE,SAAS,MAAM;CAC5B;AACJ;AACA,SAAS,UAAU,IAAI,IAAI;CACvB,QAAQ,MAAM,MAAM;EAChB,MAAM,KAAK,GAAG,MAAM,CAAC;EACrB,OAAQ,GAAG,UACL,KACA,GAAG,MAAM,CAAC;CACpB;AACJ;AAaA,SAAS,UAAU,GACnB,MAAM;CACF,QAAQ,MAAM,MAAM;EAChB,MAAM,SAAS,CAAC;EAChB,IAAI,UAAU;EACd,GAAG;GACC,MAAM,IAAI,EAAE,MAAM,CAAC;GACnB,IAAI,EAAE,WAAW,KAAK,EAAE,OAAO,OAAO,SAAS,GAAG,MAAM,GAAG,EAAE,QAAQ,GAAG;IACpE,OAAO,KAAK,EAAE,KAAK;IACnB,IAAI,EAAE;GACV,OAEI,UAAU;EAElB,SAAS;EACT,OAAO;GACH,SAAS;GACT,UAAU;GACV,OAAO;EACX;CACJ;AACJ;AAWA,SAAS,KAAK,GAAG;CACb,OAAO,UAAU,SAAS,IAAI;AAClC;AACA,SAAS,MAAM,GAAG;CACd,OAAO,GAAG,GAAG,KAAK,CAAC,IAAI,MAAM,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC;AACzD;AACA,SAAS,GAAG,IAAI,IAAI,MAAM;CACtB,QAAQ,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,OAAO,SAAS,GAAG,MAAM,GAAG,QAAQ,IAAI,IAAI,MAAM,KAAK,GAAG,OAAO,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;AAChI;AACA,SAAS,KAAK,IAAI,IAAI;CAClB,OAAO,GAAG,IAAI,KAAK,OAAO,EAAE;AAChC;AACA,SAAS,MAAM,IAAI,IAAI;CACnB,OAAO,GAAG,IAAI,KAAK,IAAI,OAAO,EAAE;AACpC;AACA,SAAS,IAAI,IAAI,IAAI,IAAI,MAAM;CAC3B,QAAQ,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,OAAO,SAAS,GAAG,MAAM,GAAG,QAAQ,IAAI,OAAO,SAAS,GAAG,MAAM,GAAG,QAAQ,IAAI,IAAI,MAAM,KAAK,GAAG,OAAO,GAAG,OAAO,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;AACnL;AACA,SAAS,OAAO,IAAI,IAAI,IAAI;CACxB,OAAO,IAAI,IAAI,IAAI,KAAK,IAAI,OAAO,EAAE;AACzC;AACA,SAAS,IAAI,GAAG,IAAI;CAChB,QAAQ,MAAM,MAAM;EAChB,MAAM,SAAS,CAAC;EAChB,IAAI,WAAW;EACf,KAAK,MAAM,KAAK,IAAI;GAChB,MAAM,KAAK,EAAE,MAAM,QAAQ;GAC3B,IAAI,GAAG,SAAS;IACZ,OAAO,KAAK,GAAG,KAAK;IACpB,WAAW,GAAG;GAClB,OAEI,OAAO,EAAE,SAAS,MAAM;EAEhC;EACA,OAAO;GACH,SAAS;GACC;GACV,OAAO;EACX;CACJ;AACJ;AAIA,SAAS,QAAQ,GAAG,IAAI;CACpB,OAAO,SAAS,IAAI,GAAG,EAAE,CAAC;AAC9B;AACA,SAAS,SAAS,GAAG;CACjB,OAAO,IAAI,IAAI,OAAO,GAAG,SAAS,MAAM,CAAC,CAAC;AAC9C;AAOA,SAAS,YAAY,KACrB,GAAG;CACC,QAAQ,MAAM,MAAM;EAChB,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI,MAAM;EACV,GAAG;GACC,MAAM,IAAI,EAAE,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG;GACtC,IAAI,EAAE,SAAS;IACX,OAAO,EAAE;IACT,MAAM,EAAE;GACZ,OAEI,OAAO;EAEf,SAAS;EACT,OAAO;GACH,SAAS;GACT,UAAU;GACV,OAAO;EACX;CACJ;AACJ;AACA,SAAS,WAAW,KAAK,GACzB,SAAS;CACL,OAAO,YAAY,MAAM,QAAQ,IAAI,IAAI,GAAG,MAAM,GAAG,MAAM,QAAQ,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC;AAC3F;AAWA,SAAS,WAAW,OAAO,OAAO,QAAQ;CACtC,OAAO,MAAM,QAAQ,OAAO,WAAW,IAAI,GAAG,OAAO,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;AAC/G;AAYA,SAAS,MAAM,GACf,GAAG;CACC,QAAQ,MAAM,MAAM,SAAS,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,GAAG,OAAO,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,MAAM,GAAG,QAAQ,CAAC;AACzG"}

package/dist/node_modules/selderee/lib/selderee.js

@@ -0,0 +1,319 @@
+import { compareSpecificity, normalize, parse1, serialize } from "../../parseley/lib/parseley.js";
+//#region ../../node_modules/selderee/lib/selderee.mjs
+var DecisionTree = class {
+	constructor(input) {
+		this.branches = weave(toAstTerminalPairs(input));
+	}
+	build(builder) {
+		return builder(this.branches);
+	}
+};
+function toAstTerminalPairs(array) {
+	const len = array.length;
+	const results = new Array(len);
+	for (let i = 0; i < len; i++) {
+		const [selectorString, val] = array[i];
+		const ast = preprocess(parse1(selectorString));
+		results[i] = {
+			ast,
+			terminal: {
+				type: "terminal",
+				valueContainer: {
+					index: i,
+					value: val,
+					specificity: ast.specificity
+				}
+			}
+		};
+	}
+	return results;
+}
+function preprocess(ast) {
+	reduceSelectorVariants(ast);
+	normalize(ast);
+	return ast;
+}
+function reduceSelectorVariants(ast) {
+	const newList = [];
+	ast.list.forEach((sel) => {
+		switch (sel.type) {
+			case "class":
+				newList.push({
+					matcher: "~=",
+					modifier: null,
+					name: "class",
+					namespace: null,
+					specificity: sel.specificity,
+					type: "attrValue",
+					value: sel.name
+				});
+				break;
+			case "id":
+				newList.push({
+					matcher: "=",
+					modifier: null,
+					name: "id",
+					namespace: null,
+					specificity: sel.specificity,
+					type: "attrValue",
+					value: sel.name
+				});
+				break;
+			case "combinator":
+				reduceSelectorVariants(sel.left);
+				newList.push(sel);
+				break;
+			case "universal": break;
+			default: newList.push(sel);
+		}
+	});
+	ast.list = newList;
+}
+function weave(items) {
+	const branches = [];
+	while (items.length) {
+		const topKind = findTopKey(items, (sel) => true, getSelectorKind);
+		const { matches, nonmatches, empty } = breakByKind(items, topKind);
+		items = nonmatches;
+		if (matches.length) branches.push(branchOfKind(topKind, matches));
+		if (empty.length) branches.push(...terminate(empty));
+	}
+	return branches;
+}
+function terminate(items) {
+	const results = [];
+	for (const item of items) {
+		const terminal = item.terminal;
+		if (terminal.type === "terminal") results.push(terminal);
+		else {
+			const { matches, rest } = partition(terminal.cont, (node) => node.type === "terminal");
+			matches.forEach((node) => results.push(node));
+			if (rest.length) {
+				terminal.cont = rest;
+				results.push(terminal);
+			}
+		}
+	}
+	return results;
+}
+function breakByKind(items, selectedKind) {
+	const matches = [];
+	const nonmatches = [];
+	const empty = [];
+	for (const item of items) {
+		const simpsels = item.ast.list;
+		if (simpsels.length) (simpsels.some((node) => getSelectorKind(node) === selectedKind) ? matches : nonmatches).push(item);
+		else empty.push(item);
+	}
+	return {
+		matches,
+		nonmatches,
+		empty
+	};
+}
+function getSelectorKind(sel) {
+	switch (sel.type) {
+		case "attrPresence": return `attrPresence ${sel.name}`;
+		case "attrValue": return `attrValue ${sel.name}`;
+		case "combinator": return `combinator ${sel.combinator}`;
+		default: return sel.type;
+	}
+}
+function branchOfKind(kind, items) {
+	if (kind === "tag") return tagNameBranch(items);
+	if (kind.startsWith("attrValue ")) return attrValueBranch(kind.substring(10), items);
+	if (kind.startsWith("attrPresence ")) return attrPresenceBranch(kind.substring(13), items);
+	if (kind === "combinator >") return combinatorBranch(">", items);
+	if (kind === "combinator +") return combinatorBranch("+", items);
+	throw new Error(`Unsupported selector kind: ${kind}`);
+}
+function tagNameBranch(items) {
+	const groups = spliceAndGroup(items, (x) => x.type === "tag", (x) => x.name);
+	return {
+		type: "tagName",
+		variants: Object.entries(groups).map(([name, group]) => ({
+			type: "variant",
+			value: name,
+			cont: weave(group.items)
+		}))
+	};
+}
+function attrPresenceBranch(name, items) {
+	for (const item of items) spliceSimpleSelector(item, (x) => x.type === "attrPresence" && x.name === name);
+	return {
+		type: "attrPresence",
+		name,
+		cont: weave(items)
+	};
+}
+function attrValueBranch(name, items) {
+	const groups = spliceAndGroup(items, (x) => x.type === "attrValue" && x.name === name, (x) => `${x.matcher} ${x.modifier || ""} ${x.value}`);
+	const matchers = [];
+	for (const group of Object.values(groups)) {
+		const sel = group.oneSimpleSelector;
+		const predicate = getAttrPredicate(sel);
+		const continuation = weave(group.items);
+		matchers.push({
+			type: "matcher",
+			matcher: sel.matcher,
+			modifier: sel.modifier,
+			value: sel.value,
+			predicate,
+			cont: continuation
+		});
+	}
+	return {
+		type: "attrValue",
+		name,
+		matchers
+	};
+}
+function getAttrPredicate(sel) {
+	if (sel.modifier === "i") {
+		const expected = sel.value.toLowerCase();
+		switch (sel.matcher) {
+			case "=": return (actual) => expected === actual.toLowerCase();
+			case "~=": return (actual) => actual.toLowerCase().split(/[ \t]+/).includes(expected);
+			case "^=": return (actual) => actual.toLowerCase().startsWith(expected);
+			case "$=": return (actual) => actual.toLowerCase().endsWith(expected);
+			case "*=": return (actual) => actual.toLowerCase().includes(expected);
+			case "|=": return (actual) => {
+				const lower = actual.toLowerCase();
+				return expected === lower || lower.startsWith(expected) && lower[expected.length] === "-";
+			};
+		}
+	} else {
+		const expected = sel.value;
+		switch (sel.matcher) {
+			case "=": return (actual) => expected === actual;
+			case "~=": return (actual) => actual.split(/[ \t]+/).includes(expected);
+			case "^=": return (actual) => actual.startsWith(expected);
+			case "$=": return (actual) => actual.endsWith(expected);
+			case "*=": return (actual) => actual.includes(expected);
+			case "|=": return (actual) => expected === actual || actual.startsWith(expected) && actual[expected.length] === "-";
+		}
+	}
+}
+function combinatorBranch(combinator, items) {
+	const groups = spliceAndGroup(items, (x) => x.type === "combinator" && x.combinator === combinator, (x) => serialize(x.left));
+	const leftItems = [];
+	for (const group of Object.values(groups)) {
+		const rightCont = weave(group.items);
+		const leftAst = group.oneSimpleSelector.left;
+		leftItems.push({
+			ast: leftAst,
+			terminal: {
+				type: "popElement",
+				cont: rightCont
+			}
+		});
+	}
+	return {
+		type: "pushElement",
+		combinator,
+		cont: weave(leftItems)
+	};
+}
+function spliceAndGroup(items, predicate, keyCallback) {
+	const groups = {};
+	while (items.length) {
+		const bestKey = findTopKey(items, predicate, keyCallback);
+		const bestKeyPredicate = (sel) => predicate(sel) && keyCallback(sel) === bestKey;
+		const hasBestKeyPredicate = (item) => item.ast.list.some(bestKeyPredicate);
+		const { matches, rest } = partition1(items, hasBestKeyPredicate);
+		let oneSimpleSelector = null;
+		for (const item of matches) {
+			const splicedNode = spliceSimpleSelector(item, bestKeyPredicate);
+			if (!oneSimpleSelector) oneSimpleSelector = splicedNode;
+		}
+		if (oneSimpleSelector == null) throw new Error("No simple selector is found.");
+		groups[bestKey] = {
+			oneSimpleSelector,
+			items: matches
+		};
+		items = rest;
+	}
+	return groups;
+}
+function spliceSimpleSelector(item, predicate) {
+	const simpsels = item.ast.list;
+	const matches = new Array(simpsels.length);
+	let firstIndex = -1;
+	for (let i = simpsels.length; i-- > 0;) if (predicate(simpsels[i])) {
+		matches[i] = true;
+		firstIndex = i;
+	}
+	if (firstIndex == -1) throw new Error(`Couldn't find the required simple selector.`);
+	const result = simpsels[firstIndex];
+	item.ast.list = simpsels.filter((sel, i) => !matches[i]);
+	return result;
+}
+function findTopKey(items, predicate, keyCallback) {
+	const candidates = {};
+	for (const item of items) {
+		const candidates1 = {};
+		for (const node of item.ast.list.filter(predicate)) candidates1[keyCallback(node)] = true;
+		for (const key of Object.keys(candidates1)) if (candidates[key]) candidates[key]++;
+		else candidates[key] = 1;
+	}
+	let topKind = "";
+	let topCounter = 0;
+	for (const entry of Object.entries(candidates)) if (entry[1] > topCounter) {
+		topKind = entry[0];
+		topCounter = entry[1];
+	}
+	return topKind;
+}
+function partition(src, predicate) {
+	const matches = [];
+	const rest = [];
+	for (const x of src) if (predicate(x)) matches.push(x);
+	else rest.push(x);
+	return {
+		matches,
+		rest
+	};
+}
+function partition1(src, predicate) {
+	const matches = [];
+	const rest = [];
+	for (const x of src) if (predicate(x)) matches.push(x);
+	else rest.push(x);
+	return {
+		matches,
+		rest
+	};
+}
+var Picker = class {
+	constructor(f) {
+		this.f = f;
+	}
+	pickAll(el) {
+		return this.f(el);
+	}
+	pick1(el, preferFirst = false) {
+		const results = this.f(el);
+		const len = results.length;
+		if (len === 0) return null;
+		if (len === 1) return results[0].value;
+		const comparator = preferFirst ? comparatorPreferFirst : comparatorPreferLast;
+		let result = results[0];
+		for (let i = 1; i < len; i++) {
+			const next = results[i];
+			if (comparator(result, next)) result = next;
+		}
+		return result.value;
+	}
+};
+function comparatorPreferFirst(acc, next) {
+	const diff = compareSpecificity(next.specificity, acc.specificity);
+	return diff > 0 || diff === 0 && next.index < acc.index;
+}
+function comparatorPreferLast(acc, next) {
+	const diff = compareSpecificity(next.specificity, acc.specificity);
+	return diff > 0 || diff === 0 && next.index > acc.index;
+}
+//#endregion
+export { DecisionTree, Picker };
+
+//# sourceMappingURL=selderee.js.map

package/dist/node_modules/selderee/lib/selderee.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"selderee.js","names":["parseley.parse1","parseley.serialize"],"sources":["../../../../../../node_modules/selderee/lib/selderee.mjs"],"sourcesContent":["import * as parseley from 'parseley';\nimport { compareSpecificity } from 'parseley';\n\nvar Ast = /*#__PURE__*/Object.freeze({\n    __proto__: null\n});\n\nvar Types = /*#__PURE__*/Object.freeze({\n    __proto__: null\n});\n\nconst treeify = (nodes) => '▽\\n' + treeifyArray(nodes, thinLines);\nconst thinLines = [['├─', '│ '], ['└─', '  ']];\nconst heavyLines = [['┠─', '┃ '], ['┖─', '  ']];\nconst doubleLines = [['╟─', '║ '], ['╙─', '  ']];\nfunction treeifyArray(nodes, tpl = heavyLines) {\n    return prefixItems(tpl, nodes.map(n => treeifyNode(n)));\n}\nfunction treeifyNode(node) {\n    switch (node.type) {\n        case 'terminal': {\n            const vctr = node.valueContainer;\n            return `◁ #${vctr.index} ${JSON.stringify(vctr.specificity)} ${vctr.value}`;\n        }\n        case 'tagName':\n            return `◻ Tag name\\n${treeifyArray(node.variants, doubleLines)}`;\n        case 'attrValue':\n            return `▣ Attr value: ${node.name}\\n${treeifyArray(node.matchers, doubleLines)}`;\n        case 'attrPresence':\n            return `◨ Attr presence: ${node.name}\\n${treeifyArray(node.cont)}`;\n        case 'pushElement':\n            return `◉ Push element: ${node.combinator}\\n${treeifyArray(node.cont, thinLines)}`;\n        case 'popElement':\n            return `◌ Pop element\\n${treeifyArray(node.cont, thinLines)}`;\n        case 'variant':\n            return `◇ = ${node.value}\\n${treeifyArray(node.cont)}`;\n        case 'matcher':\n            return `◈ ${node.matcher} \"${node.value}\"${node.modifier || ''}\\n${treeifyArray(node.cont)}`;\n    }\n}\nfunction prefixItems(tpl, items) {\n    return items\n        .map((item, i, { length }) => prefixItem(tpl, item, i === length - 1))\n        .join('\\n');\n}\nfunction prefixItem(tpl, item, tail = true) {\n    const tpl1 = tpl[tail ? 1 : 0];\n    return tpl1[0] + item.split('\\n').join('\\n' + tpl1[1]);\n}\n\nvar TreeifyBuilder = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    treeify: treeify\n});\n\nclass DecisionTree {\n    constructor(input) {\n        this.branches = weave(toAstTerminalPairs(input));\n    }\n    build(builder) {\n        return builder(this.branches);\n    }\n}\nfunction toAstTerminalPairs(array) {\n    const len = array.length;\n    const results = new Array(len);\n    for (let i = 0; i < len; i++) {\n        const [selectorString, val] = array[i];\n        const ast = preprocess(parseley.parse1(selectorString));\n        results[i] = {\n            ast: ast,\n            terminal: {\n                type: 'terminal',\n                valueContainer: { index: i, value: val, specificity: ast.specificity }\n            }\n        };\n    }\n    return results;\n}\nfunction preprocess(ast) {\n    reduceSelectorVariants(ast);\n    parseley.normalize(ast);\n    return ast;\n}\nfunction reduceSelectorVariants(ast) {\n    const newList = [];\n    ast.list.forEach(sel => {\n        switch (sel.type) {\n            case 'class':\n                newList.push({\n                    matcher: '~=',\n                    modifier: null,\n                    name: 'class',\n                    namespace: null,\n                    specificity: sel.specificity,\n                    type: 'attrValue',\n                    value: sel.name,\n                });\n                break;\n            case 'id':\n                newList.push({\n                    matcher: '=',\n                    modifier: null,\n                    name: 'id',\n                    namespace: null,\n                    specificity: sel.specificity,\n                    type: 'attrValue',\n                    value: sel.name,\n                });\n                break;\n            case 'combinator':\n                reduceSelectorVariants(sel.left);\n                newList.push(sel);\n                break;\n            case 'universal':\n                break;\n            default:\n                newList.push(sel);\n                break;\n        }\n    });\n    ast.list = newList;\n}\nfunction weave(items) {\n    const branches = [];\n    while (items.length) {\n        const topKind = findTopKey(items, (sel) => true, getSelectorKind);\n        const { matches, nonmatches, empty } = breakByKind(items, topKind);\n        items = nonmatches;\n        if (matches.length) {\n            branches.push(branchOfKind(topKind, matches));\n        }\n        if (empty.length) {\n            branches.push(...terminate(empty));\n        }\n    }\n    return branches;\n}\nfunction terminate(items) {\n    const results = [];\n    for (const item of items) {\n        const terminal = item.terminal;\n        if (terminal.type === 'terminal') {\n            results.push(terminal);\n        }\n        else {\n            const { matches, rest } = partition(terminal.cont, (node) => node.type === 'terminal');\n            matches.forEach((node) => results.push(node));\n            if (rest.length) {\n                terminal.cont = rest;\n                results.push(terminal);\n            }\n        }\n    }\n    return results;\n}\nfunction breakByKind(items, selectedKind) {\n    const matches = [];\n    const nonmatches = [];\n    const empty = [];\n    for (const item of items) {\n        const simpsels = item.ast.list;\n        if (simpsels.length) {\n            const isMatch = simpsels.some(node => getSelectorKind(node) === selectedKind);\n            (isMatch ? matches : nonmatches).push(item);\n        }\n        else {\n            empty.push(item);\n        }\n    }\n    return { matches, nonmatches, empty };\n}\nfunction getSelectorKind(sel) {\n    switch (sel.type) {\n        case 'attrPresence':\n            return `attrPresence ${sel.name}`;\n        case 'attrValue':\n            return `attrValue ${sel.name}`;\n        case 'combinator':\n            return `combinator ${sel.combinator}`;\n        default:\n            return sel.type;\n    }\n}\nfunction branchOfKind(kind, items) {\n    if (kind === 'tag') {\n        return tagNameBranch(items);\n    }\n    if (kind.startsWith('attrValue ')) {\n        return attrValueBranch(kind.substring(10), items);\n    }\n    if (kind.startsWith('attrPresence ')) {\n        return attrPresenceBranch(kind.substring(13), items);\n    }\n    if (kind === 'combinator >') {\n        return combinatorBranch('>', items);\n    }\n    if (kind === 'combinator +') {\n        return combinatorBranch('+', items);\n    }\n    throw new Error(`Unsupported selector kind: ${kind}`);\n}\nfunction tagNameBranch(items) {\n    const groups = spliceAndGroup(items, (x) => x.type === 'tag', (x) => x.name);\n    const variants = Object.entries(groups).map(([name, group]) => ({\n        type: 'variant',\n        value: name,\n        cont: weave(group.items)\n    }));\n    return {\n        type: 'tagName',\n        variants: variants\n    };\n}\nfunction attrPresenceBranch(name, items) {\n    for (const item of items) {\n        spliceSimpleSelector(item, (x) => (x.type === 'attrPresence') && (x.name === name));\n    }\n    return {\n        type: 'attrPresence',\n        name: name,\n        cont: weave(items)\n    };\n}\nfunction attrValueBranch(name, items) {\n    const groups = spliceAndGroup(items, (x) => (x.type === 'attrValue') && (x.name === name), (x) => `${x.matcher} ${x.modifier || ''} ${x.value}`);\n    const matchers = [];\n    for (const group of Object.values(groups)) {\n        const sel = group.oneSimpleSelector;\n        const predicate = getAttrPredicate(sel);\n        const continuation = weave(group.items);\n        matchers.push({\n            type: 'matcher',\n            matcher: sel.matcher,\n            modifier: sel.modifier,\n            value: sel.value,\n            predicate: predicate,\n            cont: continuation\n        });\n    }\n    return {\n        type: 'attrValue',\n        name: name,\n        matchers: matchers\n    };\n}\nfunction getAttrPredicate(sel) {\n    if (sel.modifier === 'i') {\n        const expected = sel.value.toLowerCase();\n        switch (sel.matcher) {\n            case '=':\n                return (actual) => expected === actual.toLowerCase();\n            case '~=':\n                return (actual) => actual.toLowerCase().split(/[ \\t]+/).includes(expected);\n            case '^=':\n                return (actual) => actual.toLowerCase().startsWith(expected);\n            case '$=':\n                return (actual) => actual.toLowerCase().endsWith(expected);\n            case '*=':\n                return (actual) => actual.toLowerCase().includes(expected);\n            case '|=':\n                return (actual) => {\n                    const lower = actual.toLowerCase();\n                    return (expected === lower) || (lower.startsWith(expected) && lower[expected.length] === '-');\n                };\n        }\n    }\n    else {\n        const expected = sel.value;\n        switch (sel.matcher) {\n            case '=':\n                return (actual) => expected === actual;\n            case '~=':\n                return (actual) => actual.split(/[ \\t]+/).includes(expected);\n            case '^=':\n                return (actual) => actual.startsWith(expected);\n            case '$=':\n                return (actual) => actual.endsWith(expected);\n            case '*=':\n                return (actual) => actual.includes(expected);\n            case '|=':\n                return (actual) => (expected === actual) || (actual.startsWith(expected) && actual[expected.length] === '-');\n        }\n    }\n}\nfunction combinatorBranch(combinator, items) {\n    const groups = spliceAndGroup(items, (x) => (x.type === 'combinator') && (x.combinator === combinator), (x) => parseley.serialize(x.left));\n    const leftItems = [];\n    for (const group of Object.values(groups)) {\n        const rightCont = weave(group.items);\n        const leftAst = group.oneSimpleSelector.left;\n        leftItems.push({\n            ast: leftAst,\n            terminal: { type: 'popElement', cont: rightCont }\n        });\n    }\n    return {\n        type: 'pushElement',\n        combinator: combinator,\n        cont: weave(leftItems)\n    };\n}\nfunction spliceAndGroup(items, predicate, keyCallback) {\n    const groups = {};\n    while (items.length) {\n        const bestKey = findTopKey(items, predicate, keyCallback);\n        const bestKeyPredicate = (sel) => predicate(sel) && keyCallback(sel) === bestKey;\n        const hasBestKeyPredicate = (item) => item.ast.list.some(bestKeyPredicate);\n        const { matches, rest } = partition1(items, hasBestKeyPredicate);\n        let oneSimpleSelector = null;\n        for (const item of matches) {\n            const splicedNode = spliceSimpleSelector(item, bestKeyPredicate);\n            if (!oneSimpleSelector) {\n                oneSimpleSelector = splicedNode;\n            }\n        }\n        if (oneSimpleSelector == null) {\n            throw new Error('No simple selector is found.');\n        }\n        groups[bestKey] = { oneSimpleSelector: oneSimpleSelector, items: matches };\n        items = rest;\n    }\n    return groups;\n}\nfunction spliceSimpleSelector(item, predicate) {\n    const simpsels = item.ast.list;\n    const matches = new Array(simpsels.length);\n    let firstIndex = -1;\n    for (let i = simpsels.length; i-- > 0;) {\n        if (predicate(simpsels[i])) {\n            matches[i] = true;\n            firstIndex = i;\n        }\n    }\n    if (firstIndex == -1) {\n        throw new Error(`Couldn't find the required simple selector.`);\n    }\n    const result = simpsels[firstIndex];\n    item.ast.list = simpsels.filter((sel, i) => !matches[i]);\n    return result;\n}\nfunction findTopKey(items, predicate, keyCallback) {\n    const candidates = {};\n    for (const item of items) {\n        const candidates1 = {};\n        for (const node of item.ast.list.filter(predicate)) {\n            candidates1[keyCallback(node)] = true;\n        }\n        for (const key of Object.keys(candidates1)) {\n            if (candidates[key]) {\n                candidates[key]++;\n            }\n            else {\n                candidates[key] = 1;\n            }\n        }\n    }\n    let topKind = '';\n    let topCounter = 0;\n    for (const entry of Object.entries(candidates)) {\n        if (entry[1] > topCounter) {\n            topKind = entry[0];\n            topCounter = entry[1];\n        }\n    }\n    return topKind;\n}\nfunction partition(src, predicate) {\n    const matches = [];\n    const rest = [];\n    for (const x of src) {\n        if (predicate(x)) {\n            matches.push(x);\n        }\n        else {\n            rest.push(x);\n        }\n    }\n    return { matches, rest };\n}\nfunction partition1(src, predicate) {\n    const matches = [];\n    const rest = [];\n    for (const x of src) {\n        if (predicate(x)) {\n            matches.push(x);\n        }\n        else {\n            rest.push(x);\n        }\n    }\n    return { matches, rest };\n}\n\nclass Picker {\n    constructor(f) {\n        this.f = f;\n    }\n    pickAll(el) {\n        return this.f(el);\n    }\n    pick1(el, preferFirst = false) {\n        const results = this.f(el);\n        const len = results.length;\n        if (len === 0) {\n            return null;\n        }\n        if (len === 1) {\n            return results[0].value;\n        }\n        const comparator = (preferFirst)\n            ? comparatorPreferFirst\n            : comparatorPreferLast;\n        let result = results[0];\n        for (let i = 1; i < len; i++) {\n            const next = results[i];\n            if (comparator(result, next)) {\n                result = next;\n            }\n        }\n        return result.value;\n    }\n}\nfunction comparatorPreferFirst(acc, next) {\n    const diff = compareSpecificity(next.specificity, acc.specificity);\n    return diff > 0 || (diff === 0 && next.index < acc.index);\n}\nfunction comparatorPreferLast(acc, next) {\n    const diff = compareSpecificity(next.specificity, acc.specificity);\n    return diff > 0 || (diff === 0 && next.index > acc.index);\n}\n\nexport { Ast, DecisionTree, Picker, TreeifyBuilder as Treeify, Types };\n"],"x_google_ignoreList":[0],"mappings":";;AAuDA,IAAM,eAAN,MAAmB;CACf,YAAY,OAAO;EACf,KAAK,WAAW,MAAM,mBAAmB,KAAK,CAAC;CACnD;CACA,MAAM,SAAS;EACX,OAAO,QAAQ,KAAK,QAAQ;CAChC;AACJ;AACA,SAAS,mBAAmB,OAAO;CAC/B,MAAM,MAAM,MAAM;CAClB,MAAM,UAAU,IAAI,MAAM,GAAG;CAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK;EAC1B,MAAM,CAAC,gBAAgB,OAAO,MAAM;EACpC,MAAM,MAAM,WAAWA,OAAgB,cAAc,CAAC;EACtD,QAAQ,KAAK;GACJ;GACL,UAAU;IACN,MAAM;IACN,gBAAgB;KAAE,OAAO;KAAG,OAAO;KAAK,aAAa,IAAI;IAAY;GACzE;EACJ;CACJ;CACA,OAAO;AACX;AACA,SAAS,WAAW,KAAK;CACrB,uBAAuB,GAAG;CAC1B,UAAmB,GAAG;CACtB,OAAO;AACX;AACA,SAAS,uBAAuB,KAAK;CACjC,MAAM,UAAU,CAAC;CACjB,IAAI,KAAK,SAAQ,QAAO;EACpB,QAAQ,IAAI,MAAZ;GACI,KAAK;IACD,QAAQ,KAAK;KACT,SAAS;KACT,UAAU;KACV,MAAM;KACN,WAAW;KACX,aAAa,IAAI;KACjB,MAAM;KACN,OAAO,IAAI;IACf,CAAC;IACD;GACJ,KAAK;IACD,QAAQ,KAAK;KACT,SAAS;KACT,UAAU;KACV,MAAM;KACN,WAAW;KACX,aAAa,IAAI;KACjB,MAAM;KACN,OAAO,IAAI;IACf,CAAC;IACD;GACJ,KAAK;IACD,uBAAuB,IAAI,IAAI;IAC/B,QAAQ,KAAK,GAAG;IAChB;GACJ,KAAK,aACD;GACJ,SACI,QAAQ,KAAK,GAAG;EAExB;CACJ,CAAC;CACD,IAAI,OAAO;AACf;AACA,SAAS,MAAM,OAAO;CAClB,MAAM,WAAW,CAAC;CAClB,OAAO,MAAM,QAAQ;EACjB,MAAM,UAAU,WAAW,QAAQ,QAAQ,MAAM,eAAe;EAChE,MAAM,EAAE,SAAS,YAAY,UAAU,YAAY,OAAO,OAAO;EACjE,QAAQ;EACR,IAAI,QAAQ,QACR,SAAS,KAAK,aAAa,SAAS,OAAO,CAAC;EAEhD,IAAI,MAAM,QACN,SAAS,KAAK,GAAG,UAAU,KAAK,CAAC;CAEzC;CACA,OAAO;AACX;AACA,SAAS,UAAU,OAAO;CACtB,MAAM,UAAU,CAAC;CACjB,KAAK,MAAM,QAAQ,OAAO;EACtB,MAAM,WAAW,KAAK;EACtB,IAAI,SAAS,SAAS,YAClB,QAAQ,KAAK,QAAQ;OAEpB;GACD,MAAM,EAAE,SAAS,SAAS,UAAU,SAAS,OAAO,SAAS,KAAK,SAAS,UAAU;GACrF,QAAQ,SAAS,SAAS,QAAQ,KAAK,IAAI,CAAC;GAC5C,IAAI,KAAK,QAAQ;IACb,SAAS,OAAO;IAChB,QAAQ,KAAK,QAAQ;GACzB;EACJ;CACJ;CACA,OAAO;AACX;AACA,SAAS,YAAY,OAAO,cAAc;CACtC,MAAM,UAAU,CAAC;CACjB,MAAM,aAAa,CAAC;CACpB,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,QAAQ,OAAO;EACtB,MAAM,WAAW,KAAK,IAAI;EAC1B,IAAI,SAAS,QAET,CADgB,SAAS,MAAK,SAAQ,gBAAgB,IAAI,MAAM,YACzD,IAAI,UAAU,WAAA,CAAY,KAAK,IAAI;OAG1C,MAAM,KAAK,IAAI;CAEvB;CACA,OAAO;EAAE;EAAS;EAAY;CAAM;AACxC;AACA,SAAS,gBAAgB,KAAK;CAC1B,QAAQ,IAAI,MAAZ;EACI,KAAK,gBACD,OAAO,gBAAgB,IAAI;EAC/B,KAAK,aACD,OAAO,aAAa,IAAI;EAC5B,KAAK,cACD,OAAO,cAAc,IAAI;EAC7B,SACI,OAAO,IAAI;CACnB;AACJ;AACA,SAAS,aAAa,MAAM,OAAO;CAC/B,IAAI,SAAS,OACT,OAAO,cAAc,KAAK;CAE9B,IAAI,KAAK,WAAW,YAAY,GAC5B,OAAO,gBAAgB,KAAK,UAAU,EAAE,GAAG,KAAK;CAEpD,IAAI,KAAK,WAAW,eAAe,GAC/B,OAAO,mBAAmB,KAAK,UAAU,EAAE,GAAG,KAAK;CAEvD,IAAI,SAAS,gBACT,OAAO,iBAAiB,KAAK,KAAK;CAEtC,IAAI,SAAS,gBACT,OAAO,iBAAiB,KAAK,KAAK;CAEtC,MAAM,IAAI,MAAM,8BAA8B,MAAM;AACxD;AACA,SAAS,cAAc,OAAO;CAC1B,MAAM,SAAS,eAAe,QAAQ,MAAM,EAAE,SAAS,QAAQ,MAAM,EAAE,IAAI;CAM3E,OAAO;EACH,MAAM;EACN,UAPa,OAAO,QAAQ,MAAM,CAAC,CAAC,KAAK,CAAC,MAAM,YAAY;GAC5D,MAAM;GACN,OAAO;GACP,MAAM,MAAM,MAAM,KAAK;EAC3B,EAGqB;CACrB;AACJ;AACA,SAAS,mBAAmB,MAAM,OAAO;CACrC,KAAK,MAAM,QAAQ,OACf,qBAAqB,OAAO,MAAO,EAAE,SAAS,kBAAoB,EAAE,SAAS,IAAK;CAEtF,OAAO;EACH,MAAM;EACA;EACN,MAAM,MAAM,KAAK;CACrB;AACJ;AACA,SAAS,gBAAgB,MAAM,OAAO;CAClC,MAAM,SAAS,eAAe,QAAQ,MAAO,EAAE,SAAS,eAAiB,EAAE,SAAS,OAAQ,MAAM,GAAG,EAAE,QAAQ,GAAG,EAAE,YAAY,GAAG,GAAG,EAAE,OAAO;CAC/I,MAAM,WAAW,CAAC;CAClB,KAAK,MAAM,SAAS,OAAO,OAAO,MAAM,GAAG;EACvC,MAAM,MAAM,MAAM;EAClB,MAAM,YAAY,iBAAiB,GAAG;EACtC,MAAM,eAAe,MAAM,MAAM,KAAK;EACtC,SAAS,KAAK;GACV,MAAM;GACN,SAAS,IAAI;GACb,UAAU,IAAI;GACd,OAAO,IAAI;GACA;GACX,MAAM;EACV,CAAC;CACL;CACA,OAAO;EACH,MAAM;EACA;EACI;CACd;AACJ;AACA,SAAS,iBAAiB,KAAK;CAC3B,IAAI,IAAI,aAAa,KAAK;EACtB,MAAM,WAAW,IAAI,MAAM,YAAY;EACvC,QAAQ,IAAI,SAAZ;GACI,KAAK,KACD,QAAQ,WAAW,aAAa,OAAO,YAAY;GACvD,KAAK,MACD,QAAQ,WAAW,OAAO,YAAY,CAAC,CAAC,MAAM,QAAQ,CAAC,CAAC,SAAS,QAAQ;GAC7E,KAAK,MACD,QAAQ,WAAW,OAAO,YAAY,CAAC,CAAC,WAAW,QAAQ;GAC/D,KAAK,MACD,QAAQ,WAAW,OAAO,YAAY,CAAC,CAAC,SAAS,QAAQ;GAC7D,KAAK,MACD,QAAQ,WAAW,OAAO,YAAY,CAAC,CAAC,SAAS,QAAQ;GAC7D,KAAK,MACD,QAAQ,WAAW;IACf,MAAM,QAAQ,OAAO,YAAY;IACjC,OAAQ,aAAa,SAAW,MAAM,WAAW,QAAQ,KAAK,MAAM,SAAS,YAAY;GAC7F;EACR;CACJ,OACK;EACD,MAAM,WAAW,IAAI;EACrB,QAAQ,IAAI,SAAZ;GACI,KAAK,KACD,QAAQ,WAAW,aAAa;GACpC,KAAK,MACD,QAAQ,WAAW,OAAO,MAAM,QAAQ,CAAC,CAAC,SAAS,QAAQ;GAC/D,KAAK,MACD,QAAQ,WAAW,OAAO,WAAW,QAAQ;GACjD,KAAK,MACD,QAAQ,WAAW,OAAO,SAAS,QAAQ;GAC/C,KAAK,MACD,QAAQ,WAAW,OAAO,SAAS,QAAQ;GAC/C,KAAK,MACD,QAAQ,WAAY,aAAa,UAAY,OAAO,WAAW,QAAQ,KAAK,OAAO,SAAS,YAAY;EAChH;CACJ;AACJ;AACA,SAAS,iBAAiB,YAAY,OAAO;CACzC,MAAM,SAAS,eAAe,QAAQ,MAAO,EAAE,SAAS,gBAAkB,EAAE,eAAe,aAAc,MAAMC,UAAmB,EAAE,IAAI,CAAC;CACzI,MAAM,YAAY,CAAC;CACnB,KAAK,MAAM,SAAS,OAAO,OAAO,MAAM,GAAG;EACvC,MAAM,YAAY,MAAM,MAAM,KAAK;EACnC,MAAM,UAAU,MAAM,kBAAkB;EACxC,UAAU,KAAK;GACX,KAAK;GACL,UAAU;IAAE,MAAM;IAAc,MAAM;GAAU;EACpD,CAAC;CACL;CACA,OAAO;EACH,MAAM;EACM;EACZ,MAAM,MAAM,SAAS;CACzB;AACJ;AACA,SAAS,eAAe,OAAO,WAAW,aAAa;CACnD,MAAM,SAAS,CAAC;CAChB,OAAO,MAAM,QAAQ;EACjB,MAAM,UAAU,WAAW,OAAO,WAAW,WAAW;EACxD,MAAM,oBAAoB,QAAQ,UAAU,GAAG,KAAK,YAAY,GAAG,MAAM;EACzE,MAAM,uBAAuB,SAAS,KAAK,IAAI,KAAK,KAAK,gBAAgB;EACzE,MAAM,EAAE,SAAS,SAAS,WAAW,OAAO,mBAAmB;EAC/D,IAAI,oBAAoB;EACxB,KAAK,MAAM,QAAQ,SAAS;GACxB,MAAM,cAAc,qBAAqB,MAAM,gBAAgB;GAC/D,IAAI,CAAC,mBACD,oBAAoB;EAE5B;EACA,IAAI,qBAAqB,MACrB,MAAM,IAAI,MAAM,8BAA8B;EAElD,OAAO,WAAW;GAAqB;GAAmB,OAAO;EAAQ;EACzE,QAAQ;CACZ;CACA,OAAO;AACX;AACA,SAAS,qBAAqB,MAAM,WAAW;CAC3C,MAAM,WAAW,KAAK,IAAI;CAC1B,MAAM,UAAU,IAAI,MAAM,SAAS,MAAM;CACzC,IAAI,aAAa;CACjB,KAAK,IAAI,IAAI,SAAS,QAAQ,MAAM,IAChC,IAAI,UAAU,SAAS,EAAE,GAAG;EACxB,QAAQ,KAAK;EACb,aAAa;CACjB;CAEJ,IAAI,cAAc,IACd,MAAM,IAAI,MAAM,6CAA6C;CAEjE,MAAM,SAAS,SAAS;CACxB,KAAK,IAAI,OAAO,SAAS,QAAQ,KAAK,MAAM,CAAC,QAAQ,EAAE;CACvD,OAAO;AACX;AACA,SAAS,WAAW,OAAO,WAAW,aAAa;CAC/C,MAAM,aAAa,CAAC;CACpB,KAAK,MAAM,QAAQ,OAAO;EACtB,MAAM,cAAc,CAAC;EACrB,KAAK,MAAM,QAAQ,KAAK,IAAI,KAAK,OAAO,SAAS,GAC7C,YAAY,YAAY,IAAI,KAAK;EAErC,KAAK,MAAM,OAAO,OAAO,KAAK,WAAW,GACrC,IAAI,WAAW,MACX,WAAW,IAAI;OAGf,WAAW,OAAO;CAG9B;CACA,IAAI,UAAU;CACd,IAAI,aAAa;CACjB,KAAK,MAAM,SAAS,OAAO,QAAQ,UAAU,GACzC,IAAI,MAAM,KAAK,YAAY;EACvB,UAAU,MAAM;EAChB,aAAa,MAAM;CACvB;CAEJ,OAAO;AACX;AACA,SAAS,UAAU,KAAK,WAAW;CAC/B,MAAM,UAAU,CAAC;CACjB,MAAM,OAAO,CAAC;CACd,KAAK,MAAM,KAAK,KACZ,IAAI,UAAU,CAAC,GACX,QAAQ,KAAK,CAAC;MAGd,KAAK,KAAK,CAAC;CAGnB,OAAO;EAAE;EAAS;CAAK;AAC3B;AACA,SAAS,WAAW,KAAK,WAAW;CAChC,MAAM,UAAU,CAAC;CACjB,MAAM,OAAO,CAAC;CACd,KAAK,MAAM,KAAK,KACZ,IAAI,UAAU,CAAC,GACX,QAAQ,KAAK,CAAC;MAGd,KAAK,KAAK,CAAC;CAGnB,OAAO;EAAE;EAAS;CAAK;AAC3B;AAEA,IAAM,SAAN,MAAa;CACT,YAAY,GAAG;EACX,KAAK,IAAI;CACb;CACA,QAAQ,IAAI;EACR,OAAO,KAAK,EAAE,EAAE;CACpB;CACA,MAAM,IAAI,cAAc,OAAO;EAC3B,MAAM,UAAU,KAAK,EAAE,EAAE;EACzB,MAAM,MAAM,QAAQ;EACpB,IAAI,QAAQ,GACR,OAAO;EAEX,IAAI,QAAQ,GACR,OAAO,QAAQ,EAAE,CAAC;EAEtB,MAAM,aAAc,cACd,wBACA;EACN,IAAI,SAAS,QAAQ;EACrB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK;GAC1B,MAAM,OAAO,QAAQ;GACrB,IAAI,WAAW,QAAQ,IAAI,GACvB,SAAS;EAEjB;EACA,OAAO,OAAO;CAClB;AACJ;AACA,SAAS,sBAAsB,KAAK,MAAM;CACtC,MAAM,OAAO,mBAAmB,KAAK,aAAa,IAAI,WAAW;CACjE,OAAO,OAAO,KAAM,SAAS,KAAK,KAAK,QAAQ,IAAI;AACvD;AACA,SAAS,qBAAqB,KAAK,MAAM;CACrC,MAAM,OAAO,mBAAmB,KAAK,aAAa,IAAI,WAAW;CACjE,OAAO,OAAO,KAAM,SAAS,KAAK,KAAK,QAAQ,IAAI;AACvD"}

package/dist/proxy/protected-route.d.ts

@@ -0,0 +1,9 @@
+import { RouteMiddleware } from "./route-proxy.js";
+
+//#region src/proxy/protected-route.d.ts
+declare const protectedRouteProxy: RouteMiddleware;
+//# sourceMappingURL=protected-route.d.ts.map
+
+//#endregion
+export { protectedRouteProxy };
+//# sourceMappingURL=protected-route.d.ts.map

package/dist/proxy/protected-route.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"protected-route.d.ts","names":[],"sources":["../../src/proxy/protected-route.ts"],"mappings":";;;cAca,qBAAqB"}

package/dist/proxy/protected-route.js

@@ -0,0 +1,40 @@
+import { localApiGet } from "../lib/http.js";
+import { getNextUrl } from "../server/utils.js";
+import { getRequestOrigin } from "./proxy.js";
+import { NextResponse } from "next/server";
+//#region src/proxy/protected-route.ts
+function getPublicRedirectUrl(request, href) {
+	if (!href.startsWith("/") || href.startsWith("//")) return;
+	const url = new URL(href, getRequestOrigin(request));
+	return url.pathname === request.nextUrl.pathname ? void 0 : url;
+}
+const protectedRouteProxy = async ({ request, route }) => {
+	if (route.isProtected) {
+		const isAuthenticated = request.cookies.get("payload-token");
+		console.log("protectedRouteProxy.isAuthenticated", isAuthenticated);
+		if (!isAuthenticated) {
+			if (route.publicRedirect) {
+				const redirectUrl = getPublicRedirectUrl(request, route.publicRedirect);
+				if (redirectUrl) return NextResponse.redirect(redirectUrl);
+			}
+			const { pathname } = request.nextUrl;
+			const reqHeaders = new Headers(request.headers);
+			reqHeaders.set("x-pathname", pathname);
+			const nextRoute = (await localApiGet(`/-route?schema=login&market=${encodeURIComponent(route.market)}&locale=${encodeURIComponent(route.locale)}`, {}, void 0, getRequestOrigin(request)))?.route;
+			if (nextRoute) {
+				const nextUrl = getNextUrl(request, nextRoute);
+				reqHeaders.set("x-market", nextRoute.market);
+				reqHeaders.set("x-locale", nextRoute.locale);
+				reqHeaders.set("x-schema", nextRoute.schema);
+				reqHeaders.set("x-id", String(nextRoute.page));
+				reqHeaders.set("x-forwarded-pathname", nextUrl.pathname);
+				console.log("protectedRouteProxy.Protected", pathname, ">", nextUrl.pathname);
+				return NextResponse.rewrite(nextUrl, { request: { headers: reqHeaders } });
+			}
+		}
+	}
+};
+//#endregion
+export { protectedRouteProxy };
+
+//# sourceMappingURL=protected-route.js.map

package/dist/proxy/protected-route.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"protected-route.js","names":[],"sources":["../../src/proxy/protected-route.ts"],"sourcesContent":["import { NextResponse } from 'next/server';\r\nimport { localApiGet } from '../lib/http';\r\nimport { getNextUrl } from '../server/utils';\r\nimport { getRequestOrigin } from './proxy';\r\nimport type { RouteMiddleware, RouteMiddlewareOptions, RouteResolverResponse } from './route-proxy';\r\n\r\nfunction getPublicRedirectUrl(request: RouteMiddlewareOptions['request'], href: string): URL | undefined {\r\n  if (!href.startsWith('/') || href.startsWith('//')) {\r\n    return undefined;\r\n  }\r\n  const url = new URL(href, getRequestOrigin(request));\r\n  return url.pathname === request.nextUrl.pathname ? undefined : url;\r\n}\r\n\r\nexport const protectedRouteProxy: RouteMiddleware = async ({ request, route }: RouteMiddlewareOptions) => {\r\n  // console.log('protectedRouteProxy', 'token', token);\r\n  if (route.isProtected) {\r\n    const token = request.cookies.get('payload-token');\r\n    const isAuthenticated = token; // await hasValidSession();\r\n    console.log('protectedRouteProxy.isAuthenticated', isAuthenticated);\r\n    if (!isAuthenticated) {\r\n      if (route.publicRedirect) {\r\n        const redirectUrl = getPublicRedirectUrl(request, route.publicRedirect);\r\n        if (redirectUrl) {\r\n          return NextResponse.redirect(redirectUrl);\r\n        }\r\n      }\r\n      const url = request.nextUrl;\r\n      const { pathname } = url;\r\n      const reqHeaders = new Headers(request.headers);\r\n      reqHeaders.set('x-pathname', pathname);\r\n      const resolution = await localApiGet<RouteResolverResponse>(\r\n        `/-route?schema=login&market=${encodeURIComponent(route.market)}&locale=${encodeURIComponent(route.locale)}`,\r\n        {},\r\n        undefined,\r\n        getRequestOrigin(request)\r\n      );\r\n      const nextRoute = resolution?.route;\r\n      if (nextRoute) {\r\n        const nextUrl = getNextUrl(request, nextRoute);\r\n        reqHeaders.set('x-market', nextRoute.market);\r\n        reqHeaders.set('x-locale', nextRoute.locale);\r\n        reqHeaders.set('x-schema', nextRoute.schema);\r\n        reqHeaders.set('x-id', String(nextRoute.page));\r\n        reqHeaders.set('x-forwarded-pathname', nextUrl.pathname);\r\n        console.log('protectedRouteProxy.Protected', pathname, '>', nextUrl.pathname);\r\n        const response = NextResponse\r\n          .rewrite(nextUrl, {\r\n            request: {\r\n              headers: reqHeaders,\r\n            },\r\n          });\r\n        return response;\r\n      }\r\n    }\r\n  }\r\n};\r\n"],"mappings":";;;;;AAMA,SAAS,qBAAqB,SAA4C,MAA+B;CACvG,IAAI,CAAC,KAAK,WAAW,GAAG,KAAK,KAAK,WAAW,IAAI,GAC/C;CAEF,MAAM,MAAM,IAAI,IAAI,MAAM,iBAAiB,OAAO,CAAC;CACnD,OAAO,IAAI,aAAa,QAAQ,QAAQ,WAAW,KAAA,IAAY;AACjE;AAEA,MAAa,sBAAuC,OAAO,EAAE,SAAS,YAAoC;CAExG,IAAI,MAAM,aAAa;EAErB,MAAM,kBADQ,QAAQ,QAAQ,IAAI,eACN;EAC5B,QAAQ,IAAI,uCAAuC,eAAe;EAClE,IAAI,CAAC,iBAAiB;GACpB,IAAI,MAAM,gBAAgB;IACxB,MAAM,cAAc,qBAAqB,SAAS,MAAM,cAAc;IACtE,IAAI,aACF,OAAO,aAAa,SAAS,WAAW;GAE5C;GAEA,MAAM,EAAE,aADI,QAAQ;GAEpB,MAAM,aAAa,IAAI,QAAQ,QAAQ,OAAO;GAC9C,WAAW,IAAI,cAAc,QAAQ;GAOrC,MAAM,aAAY,MANO,YACvB,+BAA+B,mBAAmB,MAAM,MAAM,EAAE,UAAU,mBAAmB,MAAM,MAAM,KACzG,CAAC,GACD,KAAA,GACA,iBAAiB,OAAO,CAC1B,EAAA,EAC8B;GAC9B,IAAI,WAAW;IACb,MAAM,UAAU,WAAW,SAAS,SAAS;IAC7C,WAAW,IAAI,YAAY,UAAU,MAAM;IAC3C,WAAW,IAAI,YAAY,UAAU,MAAM;IAC3C,WAAW,IAAI,YAAY,UAAU,MAAM;IAC3C,WAAW,IAAI,QAAQ,OAAO,UAAU,IAAI,CAAC;IAC7C,WAAW,IAAI,wBAAwB,QAAQ,QAAQ;IACvD,QAAQ,IAAI,iCAAiC,UAAU,KAAK,QAAQ,QAAQ;IAO5E,OANiB,aACd,QAAQ,SAAS,EAChB,SAAS,EACP,SAAS,WACX,EACF,CACY;GAChB;EACF;CACF;AACF"}

package/dist/proxy/proxy.d.ts

@@ -0,0 +1,31 @@
+import { NextFetchEvent, NextRequest } from "next/server";
+import { NextMiddlewareResult } from "next/dist/server/web/types";
+
+//#region src/proxy/proxy.d.ts
+type MiddlewareOptions = {
+  request: NextRequest;
+  next: NextFetchEvent;
+  disabled?: boolean;
+};
+type Middleware = (props: MiddlewareOptions) => NextMiddlewareResult | Promise<NextMiddlewareResult>;
+/**
+ * Returns the externally visible origin for an internal middleware request.
+ *
+ * Deployments commonly terminate TLS or change ports before forwarding to
+ * Next.js. Honoring valid forwarded headers keeps resolver requests on the
+ * public host and prevents an avoidable proxy redirect; direct-origin fallback
+ * keeps local development and untrusted/invalid header values deterministic.
+ */
+declare function getRequestOrigin(request: NextRequest): string;
+/**
+ * Composes middleware into an ordered, short-circuiting proxy pipeline.
+ *
+ * A disabled proxy returns immediately, avoiding all downstream request work.
+ * Otherwise each middleware can claim the response; stopping at its first
+ * result prevents duplicate rewrites, redirects, and expensive policy checks.
+ */
+declare function createProxy(...proxies: Middleware[]): Middleware;
+//# sourceMappingURL=proxy.d.ts.map
+//#endregion
+export { Middleware, MiddlewareOptions, createProxy, getRequestOrigin };
+//# sourceMappingURL=proxy.d.ts.map

package/dist/proxy/proxy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"proxy.d.ts","names":[],"sources":["../../src/proxy/proxy.ts"],"mappings":";;;;KAKY,iBAAA;WACD;EADC,IAAA,EAEJ,cAFqB;EAAA,QAAA,CAAA,EAAA,OAAA;AAClB,CAAA;AACH,KAGI,UAAA,GAHJ,CAAA,KAAA,EAGyB,iBAHzB,EAAA,GAG+C,oBAH/C,GAGsE,OAHtE,CAG8E,oBAH9E,CAAA;AAAc;AAGtB;AAAsB;AAAW;AAAsB;AAA+B;AAAR;AAAO;AAUrE,iBAAA,gBAAA,CAA0B,OAAW,EAAX,WAAW,CAAA,EAAA,MAAA;AAwBrD;AAA2B;AAAa;AAAe;AAAU;;;iBAAjD,WAAA,aAAwB,eAAe"}