@pitchfork-ui/elements 0.0.0-stage → 0.2.1

package/dist/esm/aria-DfpCerXM.js

@@ -0,0 +1,22 @@
+//#region src/aria.ts
+var composeDescribedBy = (...ids) => ids.filter(Boolean).join(" ") || void 0;
+/**
+* The ARIA role a live region should carry for a given severity.
+*
+* `alert` is an assertive live region: it interrupts whatever a screen reader
+* is saying. That is right for a warning or a failure and wrong for a success
+* toast, which should wait its turn — so only `warning` and `danger` get it.
+*
+* Here rather than in either layer because the two had already diverged:
+* `Alert` carried this map and `Notification` carried no map at all, so the
+* same `danger` content announced assertively from one component and politely
+* from the other. One definition is what stops that happening again.
+*/
+function liveRegionRole(variant) {
+	return variant === "warning" || variant === "danger" ? "alert" : "status";
+}
+
+export { composeDescribedBy as c, liveRegionRole as l };
+//# sourceMappingURL=aria-DfpCerXM.js.map
+
+//# sourceMappingURL=aria-DfpCerXM.js.map

package/dist/esm/aria-DfpCerXM.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aria-DfpCerXM.js","sources":["../core/dist/aria.js"],"sourcesContent":["//#region src/aria.ts\nvar composeDescribedBy = (...ids) => ids.filter(Boolean).join(\" \") || void 0;\n/**\n* The ARIA role a live region should carry for a given severity.\n*\n* `alert` is an assertive live region: it interrupts whatever a screen reader\n* is saying. That is right for a warning or a failure and wrong for a success\n* toast, which should wait its turn — so only `warning` and `danger` get it.\n*\n* Here rather than in either layer because the two had already diverged:\n* `Alert` carried this map and `Notification` carried no map at all, so the\n* same `danger` content announced assertively from one component and politely\n* from the other. One definition is what stops that happening again.\n*/\nfunction liveRegionRole(variant) {\n\treturn variant === \"warning\" || variant === \"danger\" ? \"alert\" : \"status\";\n}\n//#endregion\nexport { composeDescribedBy, liveRegionRole };\n"],"names":[],"mappings":"AAAA;AACG,IAAC,kBAAkB,GAAG,CAAC,GAAG,GAAG,KAAK,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI;AACtE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,cAAc,CAAC,OAAO,EAAE;AACjC,CAAC,OAAO,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,QAAQ,GAAG,OAAO,GAAG,QAAQ;AAC1E;;;;"}

package/dist/esm/cartesian-rMXGMSEx.js

@@ -0,0 +1,184 @@
+import { C as CHART_SERIES_COLORS } from './pie-COAc4ZDB.js';
+
+//#region src/cartesian.ts
+/**
+* The scales and paths behind a line, area or bar chart: where the axis ticks
+* fall, where a value lands in the plot, and the paths drawn through those
+* points.
+*
+* Shared because the axis labels and the geometry have to come from the same
+* tick scale — a chart whose gridlines say 40 and whose line peaks at
+* three-quarters height is worse than one with no gridlines — and because
+* both layers draw the same two chart types.
+*/
+/** The viewBox both chart types draw into, and the room left for the axes. */
+var CHART_VIEW = {
+	width: 560,
+	height: 240
+};
+var CHART_PADDING = {
+	top: 24,
+	right: 32,
+	bottom: 40,
+	left: 56
+};
+var CHART_PLOT = {
+	width: CHART_VIEW.width - CHART_PADDING.left - CHART_PADDING.right,
+	height: CHART_VIEW.height - CHART_PADDING.top - CHART_PADDING.bottom
+};
+/** The colour for a series: the one it asked for, or the palette's. */
+function chartSeriesColor(index, override) {
+	return override ?? CHART_SERIES_COLORS[index % CHART_SERIES_COLORS.length];
+}
+/**
+* Axis ticks a person would have chosen: `0` upwards in steps of 1, 2, 2.5 or
+* 5 times a power of ten, ending at or just above the largest value.
+*
+* Three things the React version got wrong, all of them in the arithmetic
+* rather than in the idea:
+*
+* - A `maxValue` that is not a number fell through the `<= 0` guard, made
+*   `step` `NaN`, and so produced an **empty** array — after which
+*   `ticks[ticks.length - 1]` was `undefined`, the whole chart's `maxTick`
+*   was `undefined`, and every coordinate came out `NaN`.
+* - The ticks were accumulated with `v += step`, which drifts: a step of
+*   `0.1` gave `0.30000000000000004` as an axis label. They are multiplied
+*   out from the index instead.
+* - An `Infinity` maximum looped on a step of `Infinity`.
+*/
+function niceAxisTicks(maxValue, count = 5) {
+	const fallback = [
+		0,
+		1,
+		2,
+		3,
+		4,
+		5
+	];
+	if (!Number.isFinite(maxValue) || maxValue <= 0) return fallback;
+	const rough = maxValue / Math.max(1, count);
+	const magnitude = 10 ** Math.floor(Math.log10(rough));
+	const step = ([
+		1,
+		2,
+		2.5,
+		5,
+		10
+	].find((factor) => factor * magnitude >= rough) ?? 10) * magnitude;
+	if (!(step > 0)) return fallback;
+	const steps = Math.max(1, Math.ceil(maxValue / step - 1e-9));
+	return Array.from({ length: steps + 1 }, (_, index) => Number((index * step).toPrecision(12)));
+}
+/**
+* A tick as a person reads it: `1.5k`, `2M`, `940`, `0.25`.
+*
+* In core because the axis and the hover title have to agree, and because two
+* layers abbreviating differently would show the same number two ways in one
+* chart.
+*
+* The fractional branch is the fix: the React version ended in
+* `String(Math.round(value))`, so **every** tick on an axis that tops out
+* below 1 printed as `0` — a chart of conversion rates had six gridlines all
+* labelled zero. Below 1 the value is shown to two significant figures with
+* trailing zeros trimmed, which is what `Number(toPrecision(2))` gives.
+*/
+function formatAxisTick(value) {
+	if (!Number.isFinite(value)) return "0";
+	const magnitude = Math.abs(value);
+	if (magnitude >= 1e6) return `${(value / 1e6).toFixed(1)}M`;
+	if (magnitude >= 1e3) return `${(value / 1e3).toFixed(value % 1e3 === 0 ? 0 : 1)}k`;
+	if (magnitude > 0 && magnitude < 1) return String(Number(value.toPrecision(2)));
+	return String(Math.round(value));
+}
+/** Where a value sits vertically: the plot's floor at 0, its ceiling at `maxTick`. */
+function plotY(value, maxTick) {
+	const top = maxTick > 0 ? maxTick : 1;
+	const safe = Number.isFinite(value) ? value : 0;
+	return CHART_PADDING.top + CHART_PLOT.height - safe / top * CHART_PLOT.height;
+}
+/**
+* Where the nth of `count` points sits horizontally.
+*
+* A single point goes in the middle: `index / (count - 1)` divides by zero
+* there, which is the same trap `sparklinePoints` exists to avoid.
+*/
+function plotX(index, count) {
+	if (count <= 1) return CHART_PADDING.left + CHART_PLOT.width / 2;
+	return CHART_PADDING.left + index / (count - 1) * CHART_PLOT.width;
+}
+/** A straight line through the points. */
+function straightSeriesPath(points) {
+	if (points.length === 0) return "";
+	return `M ${points.map((point) => `${point.x},${point.y}`).join(" L ")}`;
+}
+/**
+* A smooth line through the points, as cubic beziers.
+*
+* Catmull-Rom with the usual sixth-of-the-span control points, which passes
+* *through* every point rather than near it — a chart whose line misses its
+* own dots is a chart nobody trusts.
+*/
+function smoothSeriesPath(points) {
+	if (points.length === 0) return "";
+	if (points.length === 1) return `M ${points[0].x},${points[0].y}`;
+	if (points.length === 2) return straightSeriesPath(points);
+	const round = (value) => Number(value.toFixed(2));
+	let path = `M ${points[0].x},${points[0].y}`;
+	for (let index = 0; index < points.length - 1; index += 1) {
+		const before = points[Math.max(0, index - 1)];
+		const from = points[index];
+		const to = points[index + 1];
+		const after = points[Math.min(points.length - 1, index + 2)];
+		const c1x = round(from.x + (to.x - before.x) / 6);
+		const c1y = round(from.y + (to.y - before.y) / 6);
+		const c2x = round(to.x - (after.x - from.x) / 6);
+		const c2y = round(to.y - (after.y - from.y) / 6);
+		path += ` C ${c1x},${c1y} ${c2x},${c2y} ${to.x},${to.y}`;
+	}
+	return path;
+}
+/** The same line closed down to the plot's floor, for the filled variant. */
+function areaSeriesPath(line, points) {
+	if (!line || points.length === 0) return "";
+	const floor = CHART_PADDING.top + CHART_PLOT.height;
+	return `${line} L ${points[points.length - 1].x},${floor} L ${points[0].x},${floor} Z`;
+}
+/**
+* How wide the bars are and where each group starts.
+*
+* `barWidth` is floored at 1: with enough series,
+* `(total - gap * (m - 1)) / m` goes **negative**, and a negative `width` on
+* a `<rect>` is an error the browser drops the element for — so a chart of
+* twelve series silently lost its bars.
+*/
+function barGeometry(groups, seriesCount, stacked) {
+	const count = Math.max(1, Math.floor(groups) || 1);
+	const series = Math.max(1, Math.floor(seriesCount) || 1);
+	const groupWidth = CHART_PLOT.width / count;
+	const totalWidth = groupWidth * .72;
+	const gap = Math.max(2, groupWidth * .06);
+	const barWidth = stacked ? totalWidth : Math.max(1, (totalWidth - gap * (series - 1)) / series);
+	const groupCenters = Array.from({ length: count }, (_, index) => CHART_PADDING.left + (index + .5) * groupWidth);
+	return {
+		groupWidth,
+		barWidth,
+		gap,
+		groupLefts: groupCenters.map((center) => center - totalWidth / 2),
+		groupCenters
+	};
+}
+/**
+* How often to print an x-axis label.
+*
+* Every label on a long series overlaps itself into a grey smear, so a chart
+* of forty points prints every fourth. Twelve is as many as fit across the
+* plot at the tick font size.
+*/
+function axisLabelStep(count, maximumLabels = 12) {
+	return Math.max(1, Math.ceil(count / Math.max(1, maximumLabels)));
+}
+
+export { CHART_VIEW as C, CHART_PADDING as a, barGeometry as b, chartSeriesColor as c, CHART_PLOT as d, axisLabelStep as e, formatAxisTick as f, plotX as g, straightSeriesPath as h, areaSeriesPath as i, niceAxisTicks as n, plotY as p, smoothSeriesPath as s };
+//# sourceMappingURL=cartesian-rMXGMSEx.js.map
+
+//# sourceMappingURL=cartesian-rMXGMSEx.js.map

package/dist/esm/cartesian-rMXGMSEx.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cartesian-rMXGMSEx.js","sources":["../core/dist/cartesian.js"],"sourcesContent":["import { CHART_SERIES_COLORS } from \"./pie.js\";\n//#region src/cartesian.ts\n/**\n* The scales and paths behind a line, area or bar chart: where the axis ticks\n* fall, where a value lands in the plot, and the paths drawn through those\n* points.\n*\n* Shared because the axis labels and the geometry have to come from the same\n* tick scale — a chart whose gridlines say 40 and whose line peaks at\n* three-quarters height is worse than one with no gridlines — and because\n* both layers draw the same two chart types.\n*/\n/** The viewBox both chart types draw into, and the room left for the axes. */\nvar CHART_VIEW = {\n\twidth: 560,\n\theight: 240\n};\nvar CHART_PADDING = {\n\ttop: 24,\n\tright: 32,\n\tbottom: 40,\n\tleft: 56\n};\nvar CHART_PLOT = {\n\twidth: CHART_VIEW.width - CHART_PADDING.left - CHART_PADDING.right,\n\theight: CHART_VIEW.height - CHART_PADDING.top - CHART_PADDING.bottom\n};\n/** The colour for a series: the one it asked for, or the palette's. */\nfunction chartSeriesColor(index, override) {\n\treturn override ?? CHART_SERIES_COLORS[index % CHART_SERIES_COLORS.length];\n}\n/**\n* Axis ticks a person would have chosen: `0` upwards in steps of 1, 2, 2.5 or\n* 5 times a power of ten, ending at or just above the largest value.\n*\n* Three things the React version got wrong, all of them in the arithmetic\n* rather than in the idea:\n*\n* - A `maxValue` that is not a number fell through the `<= 0` guard, made\n*   `step` `NaN`, and so produced an **empty** array — after which\n*   `ticks[ticks.length - 1]` was `undefined`, the whole chart's `maxTick`\n*   was `undefined`, and every coordinate came out `NaN`.\n* - The ticks were accumulated with `v += step`, which drifts: a step of\n*   `0.1` gave `0.30000000000000004` as an axis label. They are multiplied\n*   out from the index instead.\n* - An `Infinity` maximum looped on a step of `Infinity`.\n*/\nfunction niceAxisTicks(maxValue, count = 5) {\n\tconst fallback = [\n\t\t0,\n\t\t1,\n\t\t2,\n\t\t3,\n\t\t4,\n\t\t5\n\t];\n\tif (!Number.isFinite(maxValue) || maxValue <= 0) return fallback;\n\tconst rough = maxValue / Math.max(1, count);\n\tconst magnitude = 10 ** Math.floor(Math.log10(rough));\n\tconst step = ([\n\t\t1,\n\t\t2,\n\t\t2.5,\n\t\t5,\n\t\t10\n\t].find((factor) => factor * magnitude >= rough) ?? 10) * magnitude;\n\tif (!(step > 0)) return fallback;\n\tconst steps = Math.max(1, Math.ceil(maxValue / step - 1e-9));\n\treturn Array.from({ length: steps + 1 }, (_, index) => Number((index * step).toPrecision(12)));\n}\n/**\n* A tick as a person reads it: `1.5k`, `2M`, `940`, `0.25`.\n*\n* In core because the axis and the hover title have to agree, and because two\n* layers abbreviating differently would show the same number two ways in one\n* chart.\n*\n* The fractional branch is the fix: the React version ended in\n* `String(Math.round(value))`, so **every** tick on an axis that tops out\n* below 1 printed as `0` — a chart of conversion rates had six gridlines all\n* labelled zero. Below 1 the value is shown to two significant figures with\n* trailing zeros trimmed, which is what `Number(toPrecision(2))` gives.\n*/\nfunction formatAxisTick(value) {\n\tif (!Number.isFinite(value)) return \"0\";\n\tconst magnitude = Math.abs(value);\n\tif (magnitude >= 1e6) return `${(value / 1e6).toFixed(1)}M`;\n\tif (magnitude >= 1e3) return `${(value / 1e3).toFixed(value % 1e3 === 0 ? 0 : 1)}k`;\n\tif (magnitude > 0 && magnitude < 1) return String(Number(value.toPrecision(2)));\n\treturn String(Math.round(value));\n}\n/** Where a value sits vertically: the plot's floor at 0, its ceiling at `maxTick`. */\nfunction plotY(value, maxTick) {\n\tconst top = maxTick > 0 ? maxTick : 1;\n\tconst safe = Number.isFinite(value) ? value : 0;\n\treturn CHART_PADDING.top + CHART_PLOT.height - safe / top * CHART_PLOT.height;\n}\n/**\n* Where the nth of `count` points sits horizontally.\n*\n* A single point goes in the middle: `index / (count - 1)` divides by zero\n* there, which is the same trap `sparklinePoints` exists to avoid.\n*/\nfunction plotX(index, count) {\n\tif (count <= 1) return CHART_PADDING.left + CHART_PLOT.width / 2;\n\treturn CHART_PADDING.left + index / (count - 1) * CHART_PLOT.width;\n}\n/** A straight line through the points. */\nfunction straightSeriesPath(points) {\n\tif (points.length === 0) return \"\";\n\treturn `M ${points.map((point) => `${point.x},${point.y}`).join(\" L \")}`;\n}\n/**\n* A smooth line through the points, as cubic beziers.\n*\n* Catmull-Rom with the usual sixth-of-the-span control points, which passes\n* *through* every point rather than near it — a chart whose line misses its\n* own dots is a chart nobody trusts.\n*/\nfunction smoothSeriesPath(points) {\n\tif (points.length === 0) return \"\";\n\tif (points.length === 1) return `M ${points[0].x},${points[0].y}`;\n\tif (points.length === 2) return straightSeriesPath(points);\n\tconst round = (value) => Number(value.toFixed(2));\n\tlet path = `M ${points[0].x},${points[0].y}`;\n\tfor (let index = 0; index < points.length - 1; index += 1) {\n\t\tconst before = points[Math.max(0, index - 1)];\n\t\tconst from = points[index];\n\t\tconst to = points[index + 1];\n\t\tconst after = points[Math.min(points.length - 1, index + 2)];\n\t\tconst c1x = round(from.x + (to.x - before.x) / 6);\n\t\tconst c1y = round(from.y + (to.y - before.y) / 6);\n\t\tconst c2x = round(to.x - (after.x - from.x) / 6);\n\t\tconst c2y = round(to.y - (after.y - from.y) / 6);\n\t\tpath += ` C ${c1x},${c1y} ${c2x},${c2y} ${to.x},${to.y}`;\n\t}\n\treturn path;\n}\n/** The same line closed down to the plot's floor, for the filled variant. */\nfunction areaSeriesPath(line, points) {\n\tif (!line || points.length === 0) return \"\";\n\tconst floor = CHART_PADDING.top + CHART_PLOT.height;\n\treturn `${line} L ${points[points.length - 1].x},${floor} L ${points[0].x},${floor} Z`;\n}\n/**\n* How wide the bars are and where each group starts.\n*\n* `barWidth` is floored at 1: with enough series,\n* `(total - gap * (m - 1)) / m` goes **negative**, and a negative `width` on\n* a `<rect>` is an error the browser drops the element for — so a chart of\n* twelve series silently lost its bars.\n*/\nfunction barGeometry(groups, seriesCount, stacked) {\n\tconst count = Math.max(1, Math.floor(groups) || 1);\n\tconst series = Math.max(1, Math.floor(seriesCount) || 1);\n\tconst groupWidth = CHART_PLOT.width / count;\n\tconst totalWidth = groupWidth * .72;\n\tconst gap = Math.max(2, groupWidth * .06);\n\tconst barWidth = stacked ? totalWidth : Math.max(1, (totalWidth - gap * (series - 1)) / series);\n\tconst groupCenters = Array.from({ length: count }, (_, index) => CHART_PADDING.left + (index + .5) * groupWidth);\n\treturn {\n\t\tgroupWidth,\n\t\tbarWidth,\n\t\tgap,\n\t\tgroupLefts: groupCenters.map((center) => center - totalWidth / 2),\n\t\tgroupCenters\n\t};\n}\n/**\n* How often to print an x-axis label.\n*\n* Every label on a long series overlaps itself into a grey smear, so a chart\n* of forty points prints every fourth. Twelve is as many as fit across the\n* plot at the tick font size.\n*/\nfunction axisLabelStep(count, maximumLabels = 12) {\n\treturn Math.max(1, Math.ceil(count / Math.max(1, maximumLabels)));\n}\n//#endregion\nexport { CHART_PADDING, CHART_PLOT, CHART_VIEW, areaSeriesPath, axisLabelStep, barGeometry, chartSeriesColor, formatAxisTick, niceAxisTicks, plotX, plotY, smoothSeriesPath, straightSeriesPath };\n"],"names":[],"mappings":";;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACG,IAAC,UAAU,GAAG;AACjB,CAAC,KAAK,EAAE,GAAG;AACX,CAAC,MAAM,EAAE;AACT;AACG,IAAC,aAAa,GAAG;AACpB,CAAC,GAAG,EAAE,EAAE;AACR,CAAC,KAAK,EAAE,EAAE;AACV,CAAC,MAAM,EAAE,EAAE;AACX,CAAC,IAAI,EAAE;AACP;AACG,IAAC,UAAU,GAAG;AACjB,CAAC,KAAK,EAAE,UAAU,CAAC,KAAK,GAAG,aAAa,CAAC,IAAI,GAAG,aAAa,CAAC,KAAK;AACnE,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,GAAG,aAAa,CAAC,GAAG,GAAG,aAAa,CAAC;AAC/D;AACA;AACA,SAAS,gBAAgB,CAAC,KAAK,EAAE,QAAQ,EAAE;AAC3C,CAAC,OAAO,QAAQ,IAAI,mBAAmB,CAAC,KAAK,GAAG,mBAAmB,CAAC,MAAM,CAAC;AAC3E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,aAAa,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE;AAC5C,CAAC,MAAM,QAAQ,GAAG;AAClB,EAAE,CAAC;AACH,EAAE,CAAC;AACH,EAAE,CAAC;AACH,EAAE,CAAC;AACH,EAAE,CAAC;AACH,EAAE;AACF,EAAE;AACF,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE,OAAO,QAAQ;AACjE,CAAC,MAAM,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC;AAC5C,CAAC,MAAM,SAAS,GAAG,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACtD,CAAC,MAAM,IAAI,GAAG,CAAC;AACf,EAAE,CAAC;AACH,EAAE,CAAC;AACH,EAAE,GAAG;AACL,EAAE,CAAC;AACH,EAAE;AACF,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,GAAG,SAAS,IAAI,KAAK,CAAC,IAAI,EAAE,IAAI,SAAS;AACnE,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,EAAE,OAAO,QAAQ;AACjC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;AAC7D,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK,MAAM,CAAC,CAAC,KAAK,GAAG,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,cAAc,CAAC,KAAK,EAAE;AAC/B,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,GAAG;AACxC,CAAC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;AAClC,CAAC,IAAI,SAAS,IAAI,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5D,CAAC,IAAI,SAAS,IAAI,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,GAAG,EAAE,OAAO,CAAC,KAAK,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACpF,CAAC,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;AAChF,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACjC;AACA;AACA,SAAS,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE;AAC/B,CAAC,MAAM,GAAG,GAAG,OAAO,GAAG,CAAC,GAAG,OAAO,GAAG,CAAC;AACtC,CAAC,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC;AAChD,CAAC,OAAO,aAAa,CAAC,GAAG,GAAG,UAAU,CAAC,MAAM,GAAG,IAAI,GAAG,GAAG,GAAG,UAAU,CAAC,MAAM;AAC9E;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE;AAC7B,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,OAAO,aAAa,CAAC,IAAI,GAAG,UAAU,CAAC,KAAK,GAAG,CAAC;AACjE,CAAC,OAAO,aAAa,CAAC,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,KAAK;AACnE;AACA;AACA,SAAS,kBAAkB,CAAC,MAAM,EAAE;AACpC,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE;AACnC,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACzE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,gBAAgB,CAAC,MAAM,EAAE;AAClC,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE;AACnC,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClE,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,kBAAkB,CAAC,MAAM,CAAC;AAC3D,CAAC,MAAM,KAAK,GAAG,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAClD,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE;AAC5D,EAAE,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;AAC/C,EAAE,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC;AAC5B,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;AAC9B,EAAE,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;AAC9D,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;AACnD,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;AACnD,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;AAClD,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;AAClD,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AAC1D;AACA,CAAC,OAAO,IAAI;AACZ;AACA;AACA,SAAS,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE;AACtC,CAAC,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE;AAC5C,CAAC,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,GAAG,UAAU,CAAC,MAAM;AACpD,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;AACvF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,WAAW,CAAC,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE;AACnD,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AACnD,CAAC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;AACzD,CAAC,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,GAAG,KAAK;AAC5C,CAAC,MAAM,UAAU,GAAG,UAAU,GAAG,GAAG;AACpC,CAAC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,GAAG,CAAC;AAC1C,CAAC,MAAM,QAAQ,GAAG,OAAO,GAAG,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,UAAU,GAAG,GAAG,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC;AAChG,CAAC,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK,aAAa,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE,IAAI,UAAU,CAAC;AACjH,CAAC,OAAO;AACR,EAAE,UAAU;AACZ,EAAE,QAAQ;AACV,EAAE,GAAG;AACL,EAAE,UAAU,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,MAAM,GAAG,UAAU,GAAG,CAAC,CAAC;AACnE,EAAE;AACF,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,EAAE,EAAE;AAClD,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;AAClE;;;;"}

package/dist/esm/command-Dkd7BUB5.js

@@ -0,0 +1,39 @@
+//#region src/command.ts
+/** Trimmed and lower-cased, so an empty or whitespace query matches everything. */
+function normalizeCommandQuery(query) {
+	return query.trim().toLowerCase();
+}
+/**
+* Substring, case-insensitive, across all three fields. Not fuzzy: the React
+* component is a plain `includes`, and a fuzzy matcher here would make the
+* elements layer rank results the React one does not.
+*/
+function matchesCommandQuery(fields, query) {
+	const needle = normalizeCommandQuery(query);
+	if (!needle) return true;
+	return [
+		fields.label,
+		fields.description,
+		fields.group
+	].some((field) => field ? field.toLowerCase().includes(needle) : false);
+}
+/**
+* Whether a combobox query should filter the list at all.
+*
+* It should not when the query is simply the chosen option's label echoed
+* back, which is what the field holds the moment after a selection. Filtering
+* then would leave exactly one option on screen, so reopening the list to
+* change your mind would show only the answer you already had.
+*
+* Shared because it is a rule rather than a rendering detail, and a layer that
+* forgot it would feel broken in a way its own tests would not notice.
+*/
+function queryIsEchoedSelection(query, selectedLabel) {
+	if (!selectedLabel) return false;
+	return query.trim() === selectedLabel.trim();
+}
+
+export { matchesCommandQuery as m, queryIsEchoedSelection as q };
+//# sourceMappingURL=command-Dkd7BUB5.js.map
+
+//# sourceMappingURL=command-Dkd7BUB5.js.map

package/dist/esm/command-Dkd7BUB5.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"command-Dkd7BUB5.js","sources":["../core/dist/command.js"],"sourcesContent":["//#region src/command.ts\n/** Trimmed and lower-cased, so an empty or whitespace query matches everything. */\nfunction normalizeCommandQuery(query) {\n\treturn query.trim().toLowerCase();\n}\n/**\n* Substring, case-insensitive, across all three fields. Not fuzzy: the React\n* component is a plain `includes`, and a fuzzy matcher here would make the\n* elements layer rank results the React one does not.\n*/\nfunction matchesCommandQuery(fields, query) {\n\tconst needle = normalizeCommandQuery(query);\n\tif (!needle) return true;\n\treturn [\n\t\tfields.label,\n\t\tfields.description,\n\t\tfields.group\n\t].some((field) => field ? field.toLowerCase().includes(needle) : false);\n}\n/**\n* Whether a combobox query should filter the list at all.\n*\n* It should not when the query is simply the chosen option's label echoed\n* back, which is what the field holds the moment after a selection. Filtering\n* then would leave exactly one option on screen, so reopening the list to\n* change your mind would show only the answer you already had.\n*\n* Shared because it is a rule rather than a rendering detail, and a layer that\n* forgot it would feel broken in a way its own tests would not notice.\n*/\nfunction queryIsEchoedSelection(query, selectedLabel) {\n\tif (!selectedLabel) return false;\n\treturn query.trim() === selectedLabel.trim();\n}\n//#endregion\nexport { matchesCommandQuery, normalizeCommandQuery, queryIsEchoedSelection };\n"],"names":[],"mappings":"AAAA;AACA;AACA,SAAS,qBAAqB,CAAC,KAAK,EAAE;AACtC,CAAC,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,mBAAmB,CAAC,MAAM,EAAE,KAAK,EAAE;AAC5C,CAAC,MAAM,MAAM,GAAG,qBAAqB,CAAC,KAAK,CAAC;AAC5C,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,IAAI;AACzB,CAAC,OAAO;AACR,EAAE,MAAM,CAAC,KAAK;AACd,EAAE,MAAM,CAAC,WAAW;AACpB,EAAE,MAAM,CAAC;AACT,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;AACxE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,sBAAsB,CAAC,KAAK,EAAE,aAAa,EAAE;AACtD,CAAC,IAAI,CAAC,aAAa,EAAE,OAAO,KAAK;AACjC,CAAC,OAAO,KAAK,CAAC,IAAI,EAAE,KAAK,aAAa,CAAC,IAAI,EAAE;AAC7C;;;;"}

package/dist/esm/control-label-Cy_kHPeC.js

@@ -0,0 +1,34 @@
+/**
+ * How a form control here gets an accessible name when it has no visible one.
+ *
+ * Not in `@pitchfork-ui/core`: it is about the shadow boundary, which only
+ * this layer has.
+ *
+ * The React components extend `InputHTMLAttributes`, so
+ * `<Input aria-label="Search" />` lands the attribute on the real `<input>`
+ * and names it. An element cannot do that. `aria-label` on the host names the
+ * **host**, and the host is not the control -- the `<input>` lives in the
+ * shadow root with nothing pointing at it, so a consumer who writes the same
+ * thing gets a control with no accessible name at all and no warning. Measured
+ * against Chromium's accessibility tree: the host reports the name and the
+ * textbox inside it reports none.
+ *
+ * `aria-labelledby` has no answer either, for the rule this library keeps
+ * running into: an IDREF cannot point into a shadow root. So the text is
+ * copied across, which is what `pf-tooltip` does for its trigger's
+ * description and for the same reason.
+ *
+ * A visible `label` wins, because it is both the name and a `for` target in
+ * the control's own root -- the kind of reference that does resolve.
+ */
+function controlAriaLabel(host, label) {
+    if (label)
+        return null;
+    const copied = host.getAttribute('aria-label');
+    return copied && copied.trim().length > 0 ? copied : null;
+}
+
+export { controlAriaLabel as c };
+//# sourceMappingURL=control-label-Cy_kHPeC.js.map
+
+//# sourceMappingURL=control-label-Cy_kHPeC.js.map

package/dist/esm/control-label-Cy_kHPeC.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"control-label-Cy_kHPeC.js","sources":["src/control-label.ts"],"sourcesContent":["/**\n * How a form control here gets an accessible name when it has no visible one.\n *\n * Not in `@pitchfork-ui/core`: it is about the shadow boundary, which only\n * this layer has.\n *\n * The React components extend `InputHTMLAttributes`, so\n * `<Input aria-label=\"Search\" />` lands the attribute on the real `<input>`\n * and names it. An element cannot do that. `aria-label` on the host names the\n * **host**, and the host is not the control -- the `<input>` lives in the\n * shadow root with nothing pointing at it, so a consumer who writes the same\n * thing gets a control with no accessible name at all and no warning. Measured\n * against Chromium's accessibility tree: the host reports the name and the\n * textbox inside it reports none.\n *\n * `aria-labelledby` has no answer either, for the rule this library keeps\n * running into: an IDREF cannot point into a shadow root. So the text is\n * copied across, which is what `pf-tooltip` does for its trigger's\n * description and for the same reason.\n *\n * A visible `label` wins, because it is both the name and a `for` target in\n * the control's own root -- the kind of reference that does resolve.\n */\nexport function controlAriaLabel(host: HTMLElement, label: string | undefined): string | null {\n  if (label) return null;\n  const copied = host.getAttribute('aria-label');\n  return copied && copied.trim().length > 0 ? copied : null;\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;AAsBG;AACG,SAAU,gBAAgB,CAAC,IAAiB,EAAE,KAAyB,EAAA;AAC3E,IAAA,IAAI,KAAK;AAAE,QAAA,OAAO,IAAI;IACtB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC;AAC9C,IAAA,OAAO,MAAM,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,GAAG,IAAI;AAC3D;;;;"}

package/dist/esm/date-C9jNMqLs.js

@@ -0,0 +1,154 @@
+//#region src/date.ts
+/**
+* Calendar maths, shared by `Calendar`, `DateRangePicker` and
+* `<pf-calendar>`.
+*
+* **Every date here is pinned to midday.** A date at midnight is one DST shift
+* away from being the previous day, so arithmetic on it silently loses or
+* repeats a day twice a year. Midday is far enough from both boundaries that
+* a ±1h shift cannot cross one.
+*/
+/** Sunday-first, matching the grid's first column. */
+var WEEKDAY_LABELS = [
+	"Su",
+	"Mo",
+	"Tu",
+	"We",
+	"Th",
+	"Fr",
+	"Sa"
+];
+/** Six rows of seven, so the grid never changes height between months. */
+var CALENDAR_CELL_COUNT = 42;
+var toMidday = (date) => {
+	const next = new Date(date);
+	next.setHours(12, 0, 0, 0);
+	return next;
+};
+var isSameDay = (a, b) => a.getFullYear() === b.getFullYear() && a.getMonth() === b.getMonth() && a.getDate() === b.getDate();
+var isSameMonth = (a, b) => a.getFullYear() === b.getFullYear() && a.getMonth() === b.getMonth();
+var startOfMonth = (date) => new Date(date.getFullYear(), date.getMonth(), 1, 12);
+var addMonths = (date, amount) => new Date(date.getFullYear(), date.getMonth() + amount, 1, 12);
+/**
+* Adds days, through the `Date` constructor rather than by adding
+* milliseconds: the constructor normalises an out-of-range day into the next
+* month, and a millisecond offset would be wrong by an hour across a DST
+* boundary even from midday.
+*/
+var addDays = (date, amount) => new Date(date.getFullYear(), date.getMonth(), date.getDate() + amount, 12);
+/** The 42 cells of a month grid, starting on the Sunday on or before the 1st. */
+var buildCalendarDays = (monthDate) => {
+	const monthStart = startOfMonth(monthDate);
+	const gridStart = addDays(monthStart, -monthStart.getDay());
+	return Array.from({ length: 42 }, (_, index) => {
+		const date = addDays(gridStart, index);
+		return {
+			date,
+			inCurrentMonth: date.getMonth() === monthDate.getMonth()
+		};
+	});
+};
+/**
+* Pulls a month back inside the selectable years, landing on January of the
+* first year or December of the last rather than merely clamping the year —
+* so stepping past the end stops at the last reachable month, not at the same
+* month of it.
+*/
+var clampMonthToYearRange = (date, startYear, endYear) => {
+	const start = Math.min(startYear, endYear);
+	const end = Math.max(startYear, endYear);
+	const year = date.getFullYear();
+	if (year < start) return new Date(start, 0, 1, 12);
+	if (year > end) return new Date(end, 11, 1, 12);
+	return date;
+};
+/**
+* Where a keypress moves the focused day.
+*
+* The grid pattern: left and right step a day, up and down step a week, Home
+* and End go to the ends of the focused week, and PageUp/PageDown step a
+* month. Crossing a month boundary is ordinary arithmetic here — the caller
+* decides whether that also scrolls the grid to a new month.
+*
+* Stepping a month from the 31st lands on the last day of a shorter month
+* rather than overflowing into the one after: `new Date(2024, 1, 31)` is the
+* 2nd of March, which is not what "a month after the 31st of January" means
+* in a date picker.
+*/
+/**
+* The move a keypress means in a date grid, or null for a key it does not
+* handle — so Tab, Escape and the activation keys fall through to the caller.
+*
+* Lived as a `MOVES` record inside `pf-calendar` until the React `Calendar`
+* needed the same eight keys. Two copies of a key map agree until one of them
+* gains a key, and the two layers disagreeing about what PageUp does is
+* exactly the drift `moveCalendarDate` is here to prevent.
+*
+* `PageUp`/`PageDown` are not in `Keys`, which carries only the keys every
+* widget uses; they are spelt out, as `resolveSplitterKey` spells out Home and
+* End.
+*/
+var resolveCalendarKey = (key) => {
+	switch (key) {
+		case "ArrowRight": return "day-next";
+		case "ArrowLeft": return "day-previous";
+		case "ArrowDown": return "week-next";
+		case "ArrowUp": return "week-previous";
+		case "Home": return "week-start";
+		case "End": return "week-end";
+		case "PageDown": return "month-next";
+		case "PageUp": return "month-previous";
+		default: return null;
+	}
+};
+var moveCalendarDate = (date, move) => {
+	switch (move) {
+		case "day-next": return addDays(date, 1);
+		case "day-previous": return addDays(date, -1);
+		case "week-next": return addDays(date, 7);
+		case "week-previous": return addDays(date, -7);
+		case "week-start": return addDays(date, -date.getDay());
+		case "week-end": return addDays(date, 6 - date.getDay());
+		case "month-next": return clampDayIntoMonth(date, date.getFullYear(), date.getMonth() + 1);
+		case "month-previous": return clampDayIntoMonth(date, date.getFullYear(), date.getMonth() - 1);
+		case "year-next": return clampDayIntoMonth(date, date.getFullYear() + 1, date.getMonth());
+		case "year-previous": return clampDayIntoMonth(date, date.getFullYear() - 1, date.getMonth());
+	}
+};
+/** Keeps the day-of-month, or the last day of the target month if it is shorter. */
+var clampDayIntoMonth = (date, year, month) => {
+	const lastDay = new Date(year, month + 1, 0, 12).getDate();
+	return new Date(year, month, Math.min(date.getDate(), lastDay), 12);
+};
+/** True when `date` falls outside an inclusive min/max, either of which may be absent. */
+var isOutsideDateRange = (date, min, max) => {
+	const day = toMidday(date).getTime();
+	if (min && day < toMidday(min).getTime()) return true;
+	if (max && day > toMidday(max).getTime()) return true;
+	return false;
+};
+/**
+* Parses `YYYY-MM-DD` to a midday local date, or null.
+*
+* Deliberately not `new Date(string)`, which reads a bare `YYYY-MM-DD` as
+* **UTC** and so lands on the previous day for anyone west of Greenwich.
+*/
+var parseISODate = (value) => {
+	if (!value) return null;
+	const match = /^(\d{4})-(\d{2})-(\d{2})$/.exec(value.trim());
+	if (!match) return null;
+	const [, year, month, day] = match;
+	const date = new Date(Number(year), Number(month) - 1, Number(day), 12);
+	if (date.getFullYear() !== Number(year) || date.getMonth() !== Number(month) - 1) return null;
+	if (date.getDate() !== Number(day)) return null;
+	return date;
+};
+/** Formats as `YYYY-MM-DD` in local time, the inverse of `parseISODate`. */
+var formatISODate = (date) => {
+	return `${String(date.getFullYear()).padStart(4, "0")}-${String(date.getMonth() + 1).padStart(2, "0")}-${String(date.getDate()).padStart(2, "0")}`;
+};
+
+export { CALENDAR_CELL_COUNT as C, WEEKDAY_LABELS as W, addMonths as a, buildCalendarDays as b, clampMonthToYearRange as c, isSameDay as d, isSameMonth as e, formatISODate as f, addDays as g, isOutsideDateRange as i, moveCalendarDate as m, parseISODate as p, resolveCalendarKey as r, startOfMonth as s, toMidday as t };
+//# sourceMappingURL=date-C9jNMqLs.js.map
+
+//# sourceMappingURL=date-C9jNMqLs.js.map

package/dist/esm/date-C9jNMqLs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"date-C9jNMqLs.js","sources":["../core/dist/date.js"],"sourcesContent":["//#region src/date.ts\n/**\n* Calendar maths, shared by `Calendar`, `DateRangePicker` and\n* `<pf-calendar>`.\n*\n* **Every date here is pinned to midday.** A date at midnight is one DST shift\n* away from being the previous day, so arithmetic on it silently loses or\n* repeats a day twice a year. Midday is far enough from both boundaries that\n* a ±1h shift cannot cross one.\n*/\n/** Sunday-first, matching the grid's first column. */\nvar WEEKDAY_LABELS = [\n\t\"Su\",\n\t\"Mo\",\n\t\"Tu\",\n\t\"We\",\n\t\"Th\",\n\t\"Fr\",\n\t\"Sa\"\n];\n/** Six rows of seven, so the grid never changes height between months. */\nvar CALENDAR_CELL_COUNT = 42;\nvar toMidday = (date) => {\n\tconst next = new Date(date);\n\tnext.setHours(12, 0, 0, 0);\n\treturn next;\n};\nvar isSameDay = (a, b) => a.getFullYear() === b.getFullYear() && a.getMonth() === b.getMonth() && a.getDate() === b.getDate();\nvar isSameMonth = (a, b) => a.getFullYear() === b.getFullYear() && a.getMonth() === b.getMonth();\nvar startOfMonth = (date) => new Date(date.getFullYear(), date.getMonth(), 1, 12);\nvar addMonths = (date, amount) => new Date(date.getFullYear(), date.getMonth() + amount, 1, 12);\n/**\n* Adds days, through the `Date` constructor rather than by adding\n* milliseconds: the constructor normalises an out-of-range day into the next\n* month, and a millisecond offset would be wrong by an hour across a DST\n* boundary even from midday.\n*/\nvar addDays = (date, amount) => new Date(date.getFullYear(), date.getMonth(), date.getDate() + amount, 12);\n/** The 42 cells of a month grid, starting on the Sunday on or before the 1st. */\nvar buildCalendarDays = (monthDate) => {\n\tconst monthStart = startOfMonth(monthDate);\n\tconst gridStart = addDays(monthStart, -monthStart.getDay());\n\treturn Array.from({ length: 42 }, (_, index) => {\n\t\tconst date = addDays(gridStart, index);\n\t\treturn {\n\t\t\tdate,\n\t\t\tinCurrentMonth: date.getMonth() === monthDate.getMonth()\n\t\t};\n\t});\n};\n/**\n* Pulls a month back inside the selectable years, landing on January of the\n* first year or December of the last rather than merely clamping the year —\n* so stepping past the end stops at the last reachable month, not at the same\n* month of it.\n*/\nvar clampMonthToYearRange = (date, startYear, endYear) => {\n\tconst start = Math.min(startYear, endYear);\n\tconst end = Math.max(startYear, endYear);\n\tconst year = date.getFullYear();\n\tif (year < start) return new Date(start, 0, 1, 12);\n\tif (year > end) return new Date(end, 11, 1, 12);\n\treturn date;\n};\n/**\n* Where a keypress moves the focused day.\n*\n* The grid pattern: left and right step a day, up and down step a week, Home\n* and End go to the ends of the focused week, and PageUp/PageDown step a\n* month. Crossing a month boundary is ordinary arithmetic here — the caller\n* decides whether that also scrolls the grid to a new month.\n*\n* Stepping a month from the 31st lands on the last day of a shorter month\n* rather than overflowing into the one after: `new Date(2024, 1, 31)` is the\n* 2nd of March, which is not what \"a month after the 31st of January\" means\n* in a date picker.\n*/\n/**\n* The move a keypress means in a date grid, or null for a key it does not\n* handle — so Tab, Escape and the activation keys fall through to the caller.\n*\n* Lived as a `MOVES` record inside `pf-calendar` until the React `Calendar`\n* needed the same eight keys. Two copies of a key map agree until one of them\n* gains a key, and the two layers disagreeing about what PageUp does is\n* exactly the drift `moveCalendarDate` is here to prevent.\n*\n* `PageUp`/`PageDown` are not in `Keys`, which carries only the keys every\n* widget uses; they are spelt out, as `resolveSplitterKey` spells out Home and\n* End.\n*/\nvar resolveCalendarKey = (key) => {\n\tswitch (key) {\n\t\tcase \"ArrowRight\": return \"day-next\";\n\t\tcase \"ArrowLeft\": return \"day-previous\";\n\t\tcase \"ArrowDown\": return \"week-next\";\n\t\tcase \"ArrowUp\": return \"week-previous\";\n\t\tcase \"Home\": return \"week-start\";\n\t\tcase \"End\": return \"week-end\";\n\t\tcase \"PageDown\": return \"month-next\";\n\t\tcase \"PageUp\": return \"month-previous\";\n\t\tdefault: return null;\n\t}\n};\nvar moveCalendarDate = (date, move) => {\n\tswitch (move) {\n\t\tcase \"day-next\": return addDays(date, 1);\n\t\tcase \"day-previous\": return addDays(date, -1);\n\t\tcase \"week-next\": return addDays(date, 7);\n\t\tcase \"week-previous\": return addDays(date, -7);\n\t\tcase \"week-start\": return addDays(date, -date.getDay());\n\t\tcase \"week-end\": return addDays(date, 6 - date.getDay());\n\t\tcase \"month-next\": return clampDayIntoMonth(date, date.getFullYear(), date.getMonth() + 1);\n\t\tcase \"month-previous\": return clampDayIntoMonth(date, date.getFullYear(), date.getMonth() - 1);\n\t\tcase \"year-next\": return clampDayIntoMonth(date, date.getFullYear() + 1, date.getMonth());\n\t\tcase \"year-previous\": return clampDayIntoMonth(date, date.getFullYear() - 1, date.getMonth());\n\t}\n};\n/** Keeps the day-of-month, or the last day of the target month if it is shorter. */\nvar clampDayIntoMonth = (date, year, month) => {\n\tconst lastDay = new Date(year, month + 1, 0, 12).getDate();\n\treturn new Date(year, month, Math.min(date.getDate(), lastDay), 12);\n};\n/** True when `date` falls outside an inclusive min/max, either of which may be absent. */\nvar isOutsideDateRange = (date, min, max) => {\n\tconst day = toMidday(date).getTime();\n\tif (min && day < toMidday(min).getTime()) return true;\n\tif (max && day > toMidday(max).getTime()) return true;\n\treturn false;\n};\n/**\n* Parses `YYYY-MM-DD` to a midday local date, or null.\n*\n* Deliberately not `new Date(string)`, which reads a bare `YYYY-MM-DD` as\n* **UTC** and so lands on the previous day for anyone west of Greenwich.\n*/\nvar parseISODate = (value) => {\n\tif (!value) return null;\n\tconst match = /^(\\d{4})-(\\d{2})-(\\d{2})$/.exec(value.trim());\n\tif (!match) return null;\n\tconst [, year, month, day] = match;\n\tconst date = new Date(Number(year), Number(month) - 1, Number(day), 12);\n\tif (date.getFullYear() !== Number(year) || date.getMonth() !== Number(month) - 1) return null;\n\tif (date.getDate() !== Number(day)) return null;\n\treturn date;\n};\n/** Formats as `YYYY-MM-DD` in local time, the inverse of `parseISODate`. */\nvar formatISODate = (date) => {\n\treturn `${String(date.getFullYear()).padStart(4, \"0\")}-${String(date.getMonth() + 1).padStart(2, \"0\")}-${String(date.getDate()).padStart(2, \"0\")}`;\n};\n//#endregion\nexport { CALENDAR_CELL_COUNT, WEEKDAY_LABELS, addDays, addMonths, buildCalendarDays, clampMonthToYearRange, formatISODate, isOutsideDateRange, isSameDay, isSameMonth, moveCalendarDate, parseISODate, resolveCalendarKey, startOfMonth, toMidday };\n"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACG,IAAC,cAAc,GAAG;AACrB,CAAC,IAAI;AACL,CAAC,IAAI;AACL,CAAC,IAAI;AACL,CAAC,IAAI;AACL,CAAC,IAAI;AACL,CAAC,IAAI;AACL,CAAC;AACD;AACA;AACG,IAAC,mBAAmB,GAAG;AACvB,IAAC,QAAQ,GAAG,CAAC,IAAI,KAAK;AACzB,CAAC,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC;AAC5B,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAC3B,CAAC,OAAO,IAAI;AACZ;AACG,IAAC,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,OAAO;AACxH,IAAC,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,QAAQ;AAC3F,IAAC,YAAY,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,EAAE;AAC7E,IAAC,SAAS,GAAG,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;AAC9F;AACA;AACA;AACA;AACA;AACA;AACG,IAAC,OAAO,GAAG,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,MAAM,EAAE,EAAE;AACzG;AACG,IAAC,iBAAiB,GAAG,CAAC,SAAS,KAAK;AACvC,CAAC,MAAM,UAAU,GAAG,YAAY,CAAC,SAAS,CAAC;AAC3C,CAAC,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;AAC5D,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK;AACjD,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC;AACxC,EAAE,OAAO;AACT,GAAG,IAAI;AACP,GAAG,cAAc,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,SAAS,CAAC,QAAQ;AACzD,GAAG;AACH,EAAE,CAAC;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACG,IAAC,qBAAqB,GAAG,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,KAAK;AAC1D,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC;AAC3C,CAAC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC;AACzC,CAAC,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE;AAChC,CAAC,IAAI,IAAI,GAAG,KAAK,EAAE,OAAO,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;AACnD,CAAC,IAAI,IAAI,GAAG,GAAG,EAAE,OAAO,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;AAChD,CAAC,OAAO,IAAI;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACG,IAAC,kBAAkB,GAAG,CAAC,GAAG,KAAK;AAClC,CAAC,QAAQ,GAAG;AACZ,EAAE,KAAK,YAAY,EAAE,OAAO,UAAU;AACtC,EAAE,KAAK,WAAW,EAAE,OAAO,cAAc;AACzC,EAAE,KAAK,WAAW,EAAE,OAAO,WAAW;AACtC,EAAE,KAAK,SAAS,EAAE,OAAO,eAAe;AACxC,EAAE,KAAK,MAAM,EAAE,OAAO,YAAY;AAClC,EAAE,KAAK,KAAK,EAAE,OAAO,UAAU;AAC/B,EAAE,KAAK,UAAU,EAAE,OAAO,YAAY;AACtC,EAAE,KAAK,QAAQ,EAAE,OAAO,gBAAgB;AACxC,EAAE,SAAS,OAAO,IAAI;AACtB;AACA;AACG,IAAC,gBAAgB,GAAG,CAAC,IAAI,EAAE,IAAI,KAAK;AACvC,CAAC,QAAQ,IAAI;AACb,EAAE,KAAK,UAAU,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;AAC1C,EAAE,KAAK,cAAc,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;AAC/C,EAAE,KAAK,WAAW,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;AAC3C,EAAE,KAAK,eAAe,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;AAChD,EAAE,KAAK,YAAY,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;AACzD,EAAE,KAAK,UAAU,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;AAC1D,EAAE,KAAK,YAAY,EAAE,OAAO,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;AAC5F,EAAE,KAAK,gBAAgB,EAAE,OAAO,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;AAChG,EAAE,KAAK,WAAW,EAAE,OAAO,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC;AAC3F,EAAE,KAAK,eAAe,EAAE,OAAO,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC;AAC/F;AACA;AACA;AACA,IAAI,iBAAiB,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,KAAK;AAC/C,CAAC,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE;AAC3D,CAAC,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC;AACpE,CAAC;AACD;AACG,IAAC,kBAAkB,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,KAAK;AAC7C,CAAC,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE;AACrC,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,OAAO,IAAI;AACtD,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,OAAO,IAAI;AACtD,CAAC,OAAO,KAAK;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACG,IAAC,YAAY,GAAG,CAAC,KAAK,KAAK;AAC9B,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,IAAI;AACxB,CAAC,MAAM,KAAK,GAAG,2BAA2B,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;AAC7D,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,IAAI;AACxB,CAAC,MAAM,GAAG,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,KAAK;AACnC,CAAC,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;AACxE,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,KAAK,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,IAAI;AAC9F,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,KAAK,MAAM,CAAC,GAAG,CAAC,EAAE,OAAO,IAAI;AAChD,CAAC,OAAO,IAAI;AACZ;AACA;AACG,IAAC,aAAa,GAAG,CAAC,IAAI,KAAK;AAC9B,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;AACnJ;;;;"}

package/dist/esm/form-validity-Cr6IXrUk.js

@@ -0,0 +1,35 @@
+/**
+ * The validity rules every form-associated element here shares.
+ *
+ * Not in `@pitchfork-ui/core`: this is about `ElementInternals`, which only
+ * the elements layer has. The React components are native inputs and get all
+ * of it from the browser.
+ *
+ * Shared between the elements because the alternative is each one inventing
+ * its own precedence between `error` and `required`, and a design system whose
+ * controls disagree about which message wins is worse than one with no
+ * messages.
+ */
+/**
+ * `error` wins over `required`. A consumer who has set an error message has
+ * already decided what to say; "This field is required." would overwrite a
+ * server's own answer with a guess.
+ */
+function resolveControlValidity(hasValue, required, error) {
+    if (error)
+        return { flags: { customError: true }, message: error };
+    if (required && !hasValue) {
+        return { flags: { valueMissing: true }, message: 'This field is required.' };
+    }
+    return { flags: {}, message: '' };
+}
+/** Applies `resolveControlValidity` to an element's internals. */
+function applyControlValidity(internals, hasValue, required, error) {
+    const { flags, message } = resolveControlValidity(hasValue, required, error);
+    internals.setValidity(flags, message);
+}
+
+export { applyControlValidity as a };
+//# sourceMappingURL=form-validity-Cr6IXrUk.js.map
+
+//# sourceMappingURL=form-validity-Cr6IXrUk.js.map

package/dist/esm/form-validity-Cr6IXrUk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"form-validity-Cr6IXrUk.js","sources":["src/form-validity.ts"],"sourcesContent":["/**\n * The validity rules every form-associated element here shares.\n *\n * Not in `@pitchfork-ui/core`: this is about `ElementInternals`, which only\n * the elements layer has. The React components are native inputs and get all\n * of it from the browser.\n *\n * Shared between the elements because the alternative is each one inventing\n * its own precedence between `error` and `required`, and a design system whose\n * controls disagree about which message wins is worse than one with no\n * messages.\n */\n\nexport interface ValidityState_ {\n  flags: ValidityStateFlags;\n  message: string;\n}\n\n/**\n * `error` wins over `required`. A consumer who has set an error message has\n * already decided what to say; \"This field is required.\" would overwrite a\n * server's own answer with a guess.\n */\nexport function resolveControlValidity(\n  hasValue: boolean,\n  required: boolean,\n  error: string | undefined,\n): ValidityState_ {\n  if (error) return { flags: { customError: true }, message: error };\n  if (required && !hasValue) {\n    return { flags: { valueMissing: true }, message: 'This field is required.' };\n  }\n  return { flags: {}, message: '' };\n}\n\n/** Applies `resolveControlValidity` to an element's internals. */\nexport function applyControlValidity(\n  internals: ElementInternals,\n  hasValue: boolean,\n  required: boolean,\n  error: string | undefined,\n): void {\n  const { flags, message } = resolveControlValidity(hasValue, required, error);\n  internals.setValidity(flags, message);\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;;;AAWG;AAOH;;;;AAIG;SACa,sBAAsB,CACpC,QAAiB,EACjB,QAAiB,EACjB,KAAyB,EAAA;AAEzB,IAAA,IAAI,KAAK;AAAE,QAAA,OAAO,EAAE,KAAK,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE;AAClE,IAAA,IAAI,QAAQ,IAAI,CAAC,QAAQ,EAAE;AACzB,QAAA,OAAO,EAAE,KAAK,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,yBAAyB,EAAE;;IAE9E,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE;AACnC;AAEA;AACM,SAAU,oBAAoB,CAClC,SAA2B,EAC3B,QAAiB,EACjB,QAAiB,EACjB,KAAyB,EAAA;AAEzB,IAAA,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;AAC5E,IAAA,SAAS,CAAC,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC;AACvC;;;;"}

package/dist/esm/icons-CCln56Fj.js

@@ -0,0 +1,75 @@
+//#region src/icons.ts
+/** Every registered glyph, bundled or added by a consumer at runtime. */
+var registered = /* @__PURE__ */ new Map();
+/**
+* Font Awesome records an icon's former names in `icon[2]`, so `bar-chart`
+* keeps resolving after the icon was renamed to `chart-bar`. Aliases lose to
+* registered names, so registering under an alias is never shadowed.
+*/
+var aliases = /* @__PURE__ */ new Map();
+var registerAliases = (glyph) => {
+	const names = glyph.icon?.[2];
+	if (!Array.isArray(names)) return;
+	for (const alias of names) if (typeof alias === "string") aliases.set(alias, glyph);
+};
+/**
+* Drop the aliases a glyph brought with it. Without this, replacing a
+* registered icon leaves its old aliases pointing at the old glyph.
+*/
+var unregisterAliases = (glyph) => {
+	for (const [alias, target] of aliases) if (target === glyph) aliases.delete(alias);
+};
+/** Spellings that do not survive kebab-casing. */
+var legacySpellings = {
+	circleCheck: "circle-check",
+	circleQuestion: "circle-question",
+	circleInfo: "circle-info"
+};
+var toKebabCase = (value) => value.replace(/[A-Z]/g, (c) => `-${c.toLowerCase()}`);
+/** `chartBar` and `chart-bar` are the same icon; so are `circleInfo` and `circle-info`. */
+var normalizeIconName = (name) => legacySpellings[name] ?? toKebabCase(name);
+/**
+* Add glyphs, or replace existing ones. Replacing takes the old icon's aliases
+* with it.
+*/
+function registerIconGlyphs(glyphs) {
+	for (const [name, glyph] of Object.entries(glyphs)) {
+		const previous = registered.get(name);
+		if (previous && previous !== glyph) unregisterAliases(previous);
+		registered.set(name, glyph);
+		registerAliases(glyph);
+	}
+}
+/** The glyph for a name or one of its aliases, or undefined. */
+function resolveIconGlyph(name) {
+	const normalized = normalizeIconName(name);
+	return registered.get(normalized) ?? aliases.get(normalized);
+}
+function getIconPaths(glyph) {
+	const [width, height, , , pathData] = glyph.icon;
+	return {
+		viewBox: `0 0 ${width} ${height}`,
+		paths: Array.isArray(pathData) ? pathData : [pathData]
+	};
+}
+/**
+* The icon that stands for each severity.
+*
+* Both `Alert` and `Notification` carried identical copies of this map, and
+* `<pf-notification>` would have made a third. The name is returned rather
+* than a glyph, so core still imports nothing and each layer resolves it
+* through its own `Icon` / `<pf-icon>`.
+*/
+function severityIconName(variant) {
+	switch (variant) {
+		case "success": return "circle-check";
+		case "warning": return "triangle-exclamation";
+		case "danger": return "circle-xmark";
+		default: return "circle-info";
+	}
+}
+
+export { resolveIconGlyph as a, getIconPaths as g, normalizeIconName as n, registerIconGlyphs as r, severityIconName as s };
+//# sourceMappingURL=icons-CCln56Fj.js.map
+
+//# sourceMappingURL=icons-CCln56Fj.js.map

package/dist/esm/icons-CCln56Fj.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"icons-CCln56Fj.js","sources":["../core/dist/icons.js"],"sourcesContent":["//#region src/icons.ts\n/** Every registered glyph, bundled or added by a consumer at runtime. */\nvar registered = /* @__PURE__ */ new Map();\n/**\n* Font Awesome records an icon's former names in `icon[2]`, so `bar-chart`\n* keeps resolving after the icon was renamed to `chart-bar`. Aliases lose to\n* registered names, so registering under an alias is never shadowed.\n*/\nvar aliases = /* @__PURE__ */ new Map();\nvar registerAliases = (glyph) => {\n\tconst names = glyph.icon?.[2];\n\tif (!Array.isArray(names)) return;\n\tfor (const alias of names) if (typeof alias === \"string\") aliases.set(alias, glyph);\n};\n/**\n* Drop the aliases a glyph brought with it. Without this, replacing a\n* registered icon leaves its old aliases pointing at the old glyph.\n*/\nvar unregisterAliases = (glyph) => {\n\tfor (const [alias, target] of aliases) if (target === glyph) aliases.delete(alias);\n};\n/** Spellings that do not survive kebab-casing. */\nvar legacySpellings = {\n\tcircleCheck: \"circle-check\",\n\tcircleQuestion: \"circle-question\",\n\tcircleInfo: \"circle-info\"\n};\nvar toKebabCase = (value) => value.replace(/[A-Z]/g, (c) => `-${c.toLowerCase()}`);\n/** `chartBar` and `chart-bar` are the same icon; so are `circleInfo` and `circle-info`. */\nvar normalizeIconName = (name) => legacySpellings[name] ?? toKebabCase(name);\n/**\n* Add glyphs, or replace existing ones. Replacing takes the old icon's aliases\n* with it.\n*/\nfunction registerIconGlyphs(glyphs) {\n\tfor (const [name, glyph] of Object.entries(glyphs)) {\n\t\tconst previous = registered.get(name);\n\t\tif (previous && previous !== glyph) unregisterAliases(previous);\n\t\tregistered.set(name, glyph);\n\t\tregisterAliases(glyph);\n\t}\n}\n/** The glyph for a name or one of its aliases, or undefined. */\nfunction resolveIconGlyph(name) {\n\tconst normalized = normalizeIconName(name);\n\treturn registered.get(normalized) ?? aliases.get(normalized);\n}\n/** Registered names, sorted. Aliases are not included. */\nvar getRegisteredIconNames = () => [...registered.keys()].sort();\nfunction getIconPaths(glyph) {\n\tconst [width, height, , , pathData] = glyph.icon;\n\treturn {\n\t\tviewBox: `0 0 ${width} ${height}`,\n\t\tpaths: Array.isArray(pathData) ? pathData : [pathData]\n\t};\n}\n/**\n* The icon that stands for each severity.\n*\n* Both `Alert` and `Notification` carried identical copies of this map, and\n* `<pf-notification>` would have made a third. The name is returned rather\n* than a glyph, so core still imports nothing and each layer resolves it\n* through its own `Icon` / `<pf-icon>`.\n*/\nfunction severityIconName(variant) {\n\tswitch (variant) {\n\t\tcase \"success\": return \"circle-check\";\n\t\tcase \"warning\": return \"triangle-exclamation\";\n\t\tcase \"danger\": return \"circle-xmark\";\n\t\tdefault: return \"circle-info\";\n\t}\n}\n//#endregion\nexport { getIconPaths, getRegisteredIconNames, normalizeIconName, registerIconGlyphs, resolveIconGlyph, severityIconName };\n"],"names":[],"mappings":"AAAA;AACA;AACA,IAAI,UAAU,mBAAmB,IAAI,GAAG,EAAE;AAC1C;AACA;AACA;AACA;AACA;AACA,IAAI,OAAO,mBAAmB,IAAI,GAAG,EAAE;AACvC,IAAI,eAAe,GAAG,CAAC,KAAK,KAAK;AACjC,CAAC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC;AAC9B,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AAC5B,CAAC,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC;AACpF,CAAC;AACD;AACA;AACA;AACA;AACA,IAAI,iBAAiB,GAAG,CAAC,KAAK,KAAK;AACnC,CAAC,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,IAAI,MAAM,KAAK,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC;AACnF,CAAC;AACD;AACA,IAAI,eAAe,GAAG;AACtB,CAAC,WAAW,EAAE,cAAc;AAC5B,CAAC,cAAc,EAAE,iBAAiB;AAClC,CAAC,UAAU,EAAE;AACb,CAAC;AACD,IAAI,WAAW,GAAG,CAAC,KAAK,KAAK,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;AAClF;AACG,IAAC,iBAAiB,GAAG,CAAC,IAAI,KAAK,eAAe,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,IAAI;AAC3E;AACA;AACA;AACA;AACA,SAAS,kBAAkB,CAAC,MAAM,EAAE;AACpC,CAAC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;AACrD,EAAE,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;AACvC,EAAE,IAAI,QAAQ,IAAI,QAAQ,KAAK,KAAK,EAAE,iBAAiB,CAAC,QAAQ,CAAC;AACjE,EAAE,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC;AAC7B,EAAE,eAAe,CAAC,KAAK,CAAC;AACxB;AACA;AACA;AACA,SAAS,gBAAgB,CAAC,IAAI,EAAE;AAChC,CAAC,MAAM,UAAU,GAAG,iBAAiB,CAAC,IAAI,CAAC;AAC3C,CAAC,OAAO,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;AAC7D;AAGA,SAAS,YAAY,CAAC,KAAK,EAAE;AAC7B,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,MAAM,QAAQ,CAAC,GAAG,KAAK,CAAC,IAAI;AACjD,CAAC,OAAO;AACR,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AACnC,EAAE,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,QAAQ,GAAG,CAAC,QAAQ;AACvD,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,gBAAgB,CAAC,OAAO,EAAE;AACnC,CAAC,QAAQ,OAAO;AAChB,EAAE,KAAK,SAAS,EAAE,OAAO,cAAc;AACvC,EAAE,KAAK,SAAS,EAAE,OAAO,sBAAsB;AAC/C,EAAE,KAAK,QAAQ,EAAE,OAAO,cAAc;AACtC,EAAE,SAAS,OAAO,aAAa;AAC/B;AACA;;;;"}