sherick-ui 2.0.0 → 2.1.0

package/dist/esm/components/date-family.js

@@ -0,0 +1,173 @@
+/* The date family's own calendar arithmetic, labels and Intl formatting.
+   ====================================================================
+   `Calendar`, `DatePicker` and `DateRangePicker` share one definition of what a date *is*, so a
+   calendar grid, a native `type=date` input and a range span all agree.
+
+   A `CalendarDate` is a zero-padded Gregorian civil date (`YYYY-MM-DD`, years `0001`–`9999`) and
+   carries no time. Every arithmetic step below reads and writes calendar fields directly, through
+   the pure helpers in this module, rather than going through a timestamp: a local-midnight
+   `Date` would shift a day under a daylight-saving transition, and `Date.UTC` silently maps a
+   year below 100 onto `1900 + year`. The only `Date` objects here are the ones `Intl` needs to
+   *format* a value, and they are built through `setUTCFullYear` so year `0001` survives.
+
+   This module is private to the date family. The public date types are re-exported from
+   `Calendar.tsx`, which is the family's public entry. */
+/** Inclusive year bounds of the value format: `0001-01-01` through `9999-12-31`. */
+const MIN_CALENDAR_YEAR = 1;
+const MAX_CALENDAR_YEAR = 9999;
+const DAYS_PER_MONTH = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];
+const DATE_PATTERN = /^(\d{4})-(\d{2})-(\d{2})$/;
+const pad = (value, length) => String(value).padStart(length, "0");
+const isLeapYear = (year) => year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);
+const daysInMonth = (year, month) => month === 1 && isLeapYear(year) ? 29 : DAYS_PER_MONTH[month];
+/**
+ * The only way a value becomes a date. A value that is not zero-padded, not a real civil date
+ * (including a day that does not exist in its month) or outside the year bounds is not a date at
+ * all, so callers never have to reason about a half-valid value.
+ */
+const parseCalendarDate = (value) => {
+    if (typeof value !== "string")
+        return null;
+    const match = DATE_PATTERN.exec(value);
+    if (!match)
+        return null;
+    const year = Number(match[1]);
+    const month = Number(match[2]) - 1;
+    const day = Number(match[3]);
+    if (year < MIN_CALENDAR_YEAR || year > MAX_CALENDAR_YEAR)
+        return null;
+    if (month < 0 || month > 11)
+        return null;
+    if (day < 1 || day > daysInMonth(year, month))
+        return null;
+    return { year, month, day };
+};
+const toCalendarDate = ({ year, month, day }) => `${pad(year, 4)}-${pad(month + 1, 2)}-${pad(day, 2)}`;
+/** A calendar date, or `null` when the input is not one. */
+const normalizeCalendarDate = (value) => {
+    const parts = parseCalendarDate(value);
+    return parts ? toCalendarDate(parts) : null;
+};
+const normalizeDateRange = (range) => ({
+    start: normalizeCalendarDate(range === null || range === void 0 ? void 0 : range.start),
+    end: normalizeCalendarDate(range === null || range === void 0 ? void 0 : range.end),
+});
+/* Zero-padded dates order lexicographically exactly as they order in time, so comparison needs no
+   parsing. */
+const compareCalendarDates = (left, right) => left === right ? 0 : left < right ? -1 : 1;
+/** Day of week, `0` for Sunday. Sakamoto's algorithm: pure integer arithmetic, so it is exact for
+ *  the whole year range rather than only for the years a `Date` round-trip happens to preserve. */
+const dayOfWeek = ({ year, month, day }) => {
+    const offsets = [0, 3, 2, 5, 0, 3, 5, 1, 4, 6, 2, 4];
+    const adjustedYear = month < 2 ? year - 1 : year;
+    return ((adjustedYear +
+        Math.floor(adjustedYear / 4) -
+        Math.floor(adjustedYear / 100) +
+        Math.floor(adjustedYear / 400) +
+        offsets[month] +
+        day) %
+        7);
+};
+const addCalendarDays = ({ year, month, day }, delta) => {
+    let nextYear = year;
+    let nextMonth = month;
+    let nextDay = day + delta;
+    while (nextDay < 1) {
+        nextMonth -= 1;
+        if (nextMonth < 0) {
+            nextMonth = 11;
+            nextYear -= 1;
+        }
+        nextDay += daysInMonth(nextYear, nextMonth);
+    }
+    while (nextDay > daysInMonth(nextYear, nextMonth)) {
+        nextDay -= daysInMonth(nextYear, nextMonth);
+        nextMonth += 1;
+        if (nextMonth > 11) {
+            nextMonth = 0;
+            nextYear += 1;
+        }
+    }
+    return { year: nextYear, month: nextMonth, day: nextDay };
+};
+/** Moves by whole months and **clamps** the day to the target month, which is what keeps
+ *  `2024-01-31` a real date when the grid walks into February. The result never leaves the year
+ *  bounds, so month and year navigation cannot escape `0001`–`9999`. */
+const addCalendarMonths = ({ year, month, day }, delta) => {
+    const minIndex = MIN_CALENDAR_YEAR * 12;
+    const maxIndex = MAX_CALENDAR_YEAR * 12 + 11;
+    const index = Math.min(maxIndex, Math.max(minIndex, year * 12 + month + delta));
+    const nextYear = Math.floor(index / 12);
+    const nextMonth = index % 12;
+    return { year: nextYear, month: nextMonth, day: Math.min(day, daysInMonth(nextYear, nextMonth)) };
+};
+/** Walks an inclusive span once and reports whether any date in it matches `predicate`. */
+const rangeIncludesDate = (from, to, predicate) => {
+    const last = toCalendarDate(to);
+    let cursor = from;
+    while (!predicate(toCalendarDate(cursor))) {
+        if (toCalendarDate(cursor) === last)
+            return false;
+        cursor = addCalendarDays(cursor, 1);
+    }
+    return true;
+};
+/** Today in UTC calendar fields — the value an application overrides through `today` when its own
+ *  civil day differs from UTC. */
+const todayCalendarDate = () => {
+    const now = new Date();
+    return toCalendarDate({
+        year: now.getUTCFullYear(),
+        month: now.getUTCMonth(),
+        day: now.getUTCDate(),
+    });
+};
+/* A `Date` only so `Intl` can format; the calendar fields are set through `setUTCFullYear`, which
+   keeps year `0001` intact instead of folding it into the 1900s. */
+const utcDate = ({ year, month, day }) => {
+    const date = new Date(0);
+    date.setUTCHours(0, 0, 0, 0);
+    date.setUTCFullYear(year, month, day);
+    return date;
+};
+/* 2024-01-07 is a Sunday, which is what anchors the weekday headings: asking `Intl` for a weekday
+   name needs a date, and a fixed one keeps the headings independent of the visitor's clock. */
+const WEEKDAY_ANCHOR = { year: 2024, month: 0, day: 7 };
+/**
+ * The locale's month, weekday and full-date wording, with the Gregorian calendar and UTC fixed.
+ * Values stay Gregorian and zero-padded whatever the locale is, so a locale changes how a date is
+ * written and announced, never what it means.
+ */
+const createCalendarFormat = (locale) => {
+    const shared = { timeZone: "UTC", calendar: "gregory" };
+    const monthYear = new Intl.DateTimeFormat(locale, { ...shared, month: "long", year: "numeric" });
+    const fullDate = new Intl.DateTimeFormat(locale, { ...shared, dateStyle: "full" });
+    const dayNumber = new Intl.NumberFormat(locale, { useGrouping: false });
+    const shortWeekday = new Intl.DateTimeFormat(locale, { ...shared, weekday: "short" });
+    const longWeekday = new Intl.DateTimeFormat(locale, { ...shared, weekday: "long" });
+    const weekdayNames = Array.from({ length: 7 }, (_, index) => {
+        const date = utcDate(addCalendarDays(WEEKDAY_ANCHOR, index));
+        return { short: shortWeekday.format(date), long: longWeekday.format(date) };
+    });
+    return {
+        formatMonthYear: (parts) => monthYear.format(utcDate(parts)),
+        formatDayNumber: (day) => dayNumber.format(day),
+        weekdayNames,
+        formatDate: (parts) => fullDate.format(utcDate(parts)),
+    };
+};
+const defaultCalendarLabels = {
+    previousMonth: "Previous month",
+    nextMonth: "Next month",
+    today: "Today",
+    selectDate: "Select a date",
+    selectRange: "Select a range",
+    unavailableRange: "That range includes an unavailable date",
+};
+const resolveCalendarLabels = (labels) => ({
+    ...defaultCalendarLabels,
+    ...labels,
+});
+
+export { MAX_CALENDAR_YEAR, MIN_CALENDAR_YEAR, addCalendarDays, addCalendarMonths, compareCalendarDates, createCalendarFormat, dayOfWeek, daysInMonth, defaultCalendarLabels, isLeapYear, normalizeCalendarDate, normalizeDateRange, parseCalendarDate, rangeIncludesDate, resolveCalendarLabels, toCalendarDate, todayCalendarDate };
+//# sourceMappingURL=date-family.js.map

package/dist/esm/components/date-family.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"date-family.js","sources":["../../../src/components/date-family.ts"],"sourcesContent":["/* The date family's own calendar arithmetic, labels and Intl formatting.\n   ====================================================================\n   `Calendar`, `DatePicker` and `DateRangePicker` share one definition of what a date *is*, so a\n   calendar grid, a native `type=date` input and a range span all agree.\n\n   A `CalendarDate` is a zero-padded Gregorian civil date (`YYYY-MM-DD`, years `0001`–`9999`) and\n   carries no time. Every arithmetic step below reads and writes calendar fields directly, through\n   the pure helpers in this module, rather than going through a timestamp: a local-midnight\n   `Date` would shift a day under a daylight-saving transition, and `Date.UTC` silently maps a\n   year below 100 onto `1900 + year`. The only `Date` objects here are the ones `Intl` needs to\n   *format* a value, and they are built through `setUTCFullYear` so year `0001` survives.\n\n   This module is private to the date family. The public date types are re-exported from\n   `Calendar.tsx`, which is the family's public entry. */\n\nexport type CalendarDate = string;\n\nexport interface DateRange {\n  start: CalendarDate | null;\n  end: CalendarDate | null;\n}\n\n/** A parsed civil date. `month` is 0-based, as every `Intl` and `Date` API expects. */\nexport interface DateParts {\n  year: number;\n  month: number;\n  day: number;\n}\n\n/** Inclusive year bounds of the value format: `0001-01-01` through `9999-12-31`. */\nexport const MIN_CALENDAR_YEAR = 1;\nexport const MAX_CALENDAR_YEAR = 9999;\n\nconst DAYS_PER_MONTH = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];\nconst DATE_PATTERN = /^(\\d{4})-(\\d{2})-(\\d{2})$/;\n\nconst pad = (value: number, length: number) => String(value).padStart(length, \"0\");\n\nexport const isLeapYear = (year: number) =>\n  year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);\n\nexport const daysInMonth = (year: number, month: number) =>\n  month === 1 && isLeapYear(year) ? 29 : DAYS_PER_MONTH[month];\n\n/**\n * The only way a value becomes a date. A value that is not zero-padded, not a real civil date\n * (including a day that does not exist in its month) or outside the year bounds is not a date at\n * all, so callers never have to reason about a half-valid value.\n */\nexport const parseCalendarDate = (value: CalendarDate | null | undefined): DateParts | null => {\n  if (typeof value !== \"string\") return null;\n\n  const match = DATE_PATTERN.exec(value);\n  if (!match) return null;\n\n  const year = Number(match[1]);\n  const month = Number(match[2]) - 1;\n  const day = Number(match[3]);\n\n  if (year < MIN_CALENDAR_YEAR || year > MAX_CALENDAR_YEAR) return null;\n  if (month < 0 || month > 11) return null;\n  if (day < 1 || day > daysInMonth(year, month)) return null;\n\n  return { year, month, day };\n};\n\nexport const isValidCalendarDate = (value: CalendarDate | null | undefined) =>\n  parseCalendarDate(value) !== null;\n\nexport const toCalendarDate = ({ year, month, day }: DateParts): CalendarDate =>\n  `${pad(year, 4)}-${pad(month + 1, 2)}-${pad(day, 2)}`;\n\n/** A calendar date, or `null` when the input is not one. */\nexport const normalizeCalendarDate = (value: CalendarDate | null | undefined): CalendarDate | null => {\n  const parts = parseCalendarDate(value);\n  return parts ? toCalendarDate(parts) : null;\n};\n\nexport const normalizeDateRange = (range: DateRange | null | undefined): DateRange => ({\n  start: normalizeCalendarDate(range?.start),\n  end: normalizeCalendarDate(range?.end),\n});\n\nexport const emptyDateRange = (): DateRange => ({ start: null, end: null });\n\n/* Zero-padded dates order lexicographically exactly as they order in time, so comparison needs no\n   parsing. */\nexport const compareCalendarDates = (left: CalendarDate, right: CalendarDate) =>\n  left === right ? 0 : left < right ? -1 : 1;\n\n/** Day of week, `0` for Sunday. Sakamoto's algorithm: pure integer arithmetic, so it is exact for\n *  the whole year range rather than only for the years a `Date` round-trip happens to preserve. */\nexport const dayOfWeek = ({ year, month, day }: DateParts): number => {\n  const offsets = [0, 3, 2, 5, 0, 3, 5, 1, 4, 6, 2, 4];\n  const adjustedYear = month < 2 ? year - 1 : year;\n\n  return (\n    (adjustedYear +\n      Math.floor(adjustedYear / 4) -\n      Math.floor(adjustedYear / 100) +\n      Math.floor(adjustedYear / 400) +\n      offsets[month] +\n      day) %\n    7\n  );\n};\n\nexport const addCalendarDays = ({ year, month, day }: DateParts, delta: number): DateParts => {\n  let nextYear = year;\n  let nextMonth = month;\n  let nextDay = day + delta;\n\n  while (nextDay < 1) {\n    nextMonth -= 1;\n    if (nextMonth < 0) {\n      nextMonth = 11;\n      nextYear -= 1;\n    }\n    nextDay += daysInMonth(nextYear, nextMonth);\n  }\n\n  while (nextDay > daysInMonth(nextYear, nextMonth)) {\n    nextDay -= daysInMonth(nextYear, nextMonth);\n    nextMonth += 1;\n    if (nextMonth > 11) {\n      nextMonth = 0;\n      nextYear += 1;\n    }\n  }\n\n  return { year: nextYear, month: nextMonth, day: nextDay };\n};\n\n/** Moves by whole months and **clamps** the day to the target month, which is what keeps\n *  `2024-01-31` a real date when the grid walks into February. The result never leaves the year\n *  bounds, so month and year navigation cannot escape `0001`–`9999`. */\nexport const addCalendarMonths = ({ year, month, day }: DateParts, delta: number): DateParts => {\n  const minIndex = MIN_CALENDAR_YEAR * 12;\n  const maxIndex = MAX_CALENDAR_YEAR * 12 + 11;\n  const index = Math.min(maxIndex, Math.max(minIndex, year * 12 + month + delta));\n  const nextYear = Math.floor(index / 12);\n  const nextMonth = index % 12;\n\n  return { year: nextYear, month: nextMonth, day: Math.min(day, daysInMonth(nextYear, nextMonth)) };\n};\n\n/** Walks an inclusive span once and reports whether any date in it matches `predicate`. */\nexport const rangeIncludesDate = (\n  from: DateParts,\n  to: DateParts,\n  predicate: (date: CalendarDate) => boolean\n): boolean => {\n  const last = toCalendarDate(to);\n  let cursor = from;\n\n  while (!predicate(toCalendarDate(cursor))) {\n    if (toCalendarDate(cursor) === last) return false;\n    cursor = addCalendarDays(cursor, 1);\n  }\n\n  return true;\n};\n\n/** Today in UTC calendar fields — the value an application overrides through `today` when its own\n *  civil day differs from UTC. */\nexport const todayCalendarDate = (): CalendarDate => {\n  const now = new Date();\n  return toCalendarDate({\n    year: now.getUTCFullYear(),\n    month: now.getUTCMonth(),\n    day: now.getUTCDate(),\n  });\n};\n\n/* A `Date` only so `Intl` can format; the calendar fields are set through `setUTCFullYear`, which\n   keeps year `0001` intact instead of folding it into the 1900s. */\nconst utcDate = ({ year, month, day }: DateParts) => {\n  const date = new Date(0);\n  date.setUTCHours(0, 0, 0, 0);\n  date.setUTCFullYear(year, month, day);\n  return date;\n};\n\nexport interface CalendarFormat {\n  /** The visible and announced month caption, e.g. `January 2024`. */\n  formatMonthYear: (parts: DateParts) => string;\n  /** The day number as the locale writes digits. */\n  formatDayNumber: (day: number) => string;\n  /** Weekday headings, indexed from Sunday. `short` is shown, `long` is the heading's name. */\n  weekdayNames: { short: string; long: string }[];\n  /** The day's full accessible name, e.g. `Monday, January 15, 2024`. */\n  formatDate: (parts: DateParts) => string;\n}\n\n/* 2024-01-07 is a Sunday, which is what anchors the weekday headings: asking `Intl` for a weekday\n   name needs a date, and a fixed one keeps the headings independent of the visitor's clock. */\nconst WEEKDAY_ANCHOR: DateParts = { year: 2024, month: 0, day: 7 };\n\n/**\n * The locale's month, weekday and full-date wording, with the Gregorian calendar and UTC fixed.\n * Values stay Gregorian and zero-padded whatever the locale is, so a locale changes how a date is\n * written and announced, never what it means.\n */\nexport const createCalendarFormat = (locale: string): CalendarFormat => {\n  const shared = { timeZone: \"UTC\", calendar: \"gregory\" } as const;\n  const monthYear = new Intl.DateTimeFormat(locale, { ...shared, month: \"long\", year: \"numeric\" });\n  const fullDate = new Intl.DateTimeFormat(locale, { ...shared, dateStyle: \"full\" });\n  const dayNumber = new Intl.NumberFormat(locale, { useGrouping: false });\n  const shortWeekday = new Intl.DateTimeFormat(locale, { ...shared, weekday: \"short\" });\n  const longWeekday = new Intl.DateTimeFormat(locale, { ...shared, weekday: \"long\" });\n\n  const weekdayNames = Array.from({ length: 7 }, (_, index) => {\n    const date = utcDate(addCalendarDays(WEEKDAY_ANCHOR, index));\n    return { short: shortWeekday.format(date), long: longWeekday.format(date) };\n  });\n\n  return {\n    formatMonthYear: (parts) => monthYear.format(utcDate(parts)),\n    formatDayNumber: (day) => dayNumber.format(day),\n    weekdayNames,\n    formatDate: (parts) => fullDate.format(utcDate(parts)),\n  };\n};\n\nexport interface CalendarLabels {\n  /** The control that moves the grid to the previous month. */\n  previousMonth: string;\n  /** The control that moves the grid to the next month. */\n  nextMonth: string;\n  /** The control that navigates to today without selecting it. */\n  today: string;\n  /** Describes a single-date grid to assistive technology. */\n  selectDate: string;\n  /** Describes a range grid to assistive technology. */\n  selectRange: string;\n  /** Reported when a date — or a range — cannot be selected or is not acceptable. */\n  unavailableRange: string;\n}\n\nexport const defaultCalendarLabels: CalendarLabels = {\n  previousMonth: \"Previous month\",\n  nextMonth: \"Next month\",\n  today: \"Today\",\n  selectDate: \"Select a date\",\n  selectRange: \"Select a range\",\n  unavailableRange: \"That range includes an unavailable date\",\n};\n\nexport const resolveCalendarLabels = (labels?: Partial<CalendarLabels>): CalendarLabels => ({\n  ...defaultCalendarLabels,\n  ...labels,\n});\n"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;AAayD;AAgBzD;AACO,MAAM,iBAAiB,GAAG;AAC1B,MAAM,iBAAiB,GAAG;AAEjC,MAAM,cAAc,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;AACvE,MAAM,YAAY,GAAG,2BAA2B;AAEhD,MAAM,GAAG,GAAG,CAAC,KAAa,EAAE,MAAc,KAAK,MAAM,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC;AAE3E,MAAM,UAAU,GAAG,CAAC,IAAY,KACrC,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,GAAG,GAAG,KAAK,CAAC,IAAI,IAAI,GAAG,GAAG,KAAK,CAAC;AAElD,MAAM,WAAW,GAAG,CAAC,IAAY,EAAE,KAAa,KACrD,KAAK,KAAK,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,cAAc,CAAC,KAAK;AAE7D;;;;AAIG;AACI,MAAM,iBAAiB,GAAG,CAAC,KAAsC,KAAsB;IAC5F,IAAI,OAAO,KAAK,KAAK,QAAQ;AAAE,QAAA,OAAO,IAAI;IAE1C,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC;AACtC,IAAA,IAAI,CAAC,KAAK;AAAE,QAAA,OAAO,IAAI;IAEvB,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAClC,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAE5B,IAAA,IAAI,IAAI,GAAG,iBAAiB,IAAI,IAAI,GAAG,iBAAiB;AAAE,QAAA,OAAO,IAAI;AACrE,IAAA,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE;AAAE,QAAA,OAAO,IAAI;IACxC,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC;AAAE,QAAA,OAAO,IAAI;AAE1D,IAAA,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE;AAC7B;AAKO,MAAM,cAAc,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAa,KAC5D,CAAA,EAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA,CAAA,EAAI,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA,CAAA,EAAI,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;AAErD;AACO,MAAM,qBAAqB,GAAG,CAAC,KAAsC,KAAyB;AACnG,IAAA,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC;AACtC,IAAA,OAAO,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,GAAG,IAAI;AAC7C;MAEa,kBAAkB,GAAG,CAAC,KAAmC,MAAiB;IACrF,KAAK,EAAE,qBAAqB,CAAC,KAAK,KAAA,IAAA,IAAL,KAAK,KAAA,MAAA,GAAA,MAAA,GAAL,KAAK,CAAE,KAAK,CAAC;IAC1C,GAAG,EAAE,qBAAqB,CAAC,KAAK,KAAA,IAAA,IAAL,KAAK,KAAA,MAAA,GAAA,MAAA,GAAL,KAAK,CAAE,GAAG,CAAC;AACvC,CAAA;AAID;AACc;AACP,MAAM,oBAAoB,GAAG,CAAC,IAAkB,EAAE,KAAmB,KAC1E,IAAI,KAAK,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,KAAK,GAAG,EAAE,GAAG;AAE3C;AACmG;AAC5F,MAAM,SAAS,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAa,KAAY;IACnE,MAAM,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AACpD,IAAA,MAAM,YAAY,GAAG,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI;IAEhD,QACE,CAAC,YAAY;AACX,QAAA,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC;AAC5B,QAAA,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,GAAG,CAAC;AAC9B,QAAA,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,GAAG,CAAC;QAC9B,OAAO,CAAC,KAAK,CAAC;AACd,QAAA,GAAG;AACL,QAAA,CAAC;AAEL;AAEO,MAAM,eAAe,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAa,EAAE,KAAa,KAAe;IAC3F,IAAI,QAAQ,GAAG,IAAI;IACnB,IAAI,SAAS,GAAG,KAAK;AACrB,IAAA,IAAI,OAAO,GAAG,GAAG,GAAG,KAAK;AAEzB,IAAA,OAAO,OAAO,GAAG,CAAC,EAAE;QAClB,SAAS,IAAI,CAAC;AACd,QAAA,IAAI,SAAS,GAAG,CAAC,EAAE;YACjB,SAAS,GAAG,EAAE;YACd,QAAQ,IAAI,CAAC;QACf;AACA,QAAA,OAAO,IAAI,WAAW,CAAC,QAAQ,EAAE,SAAS,CAAC;IAC7C;IAEA,OAAO,OAAO,GAAG,WAAW,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE;AACjD,QAAA,OAAO,IAAI,WAAW,CAAC,QAAQ,EAAE,SAAS,CAAC;QAC3C,SAAS,IAAI,CAAC;AACd,QAAA,IAAI,SAAS,GAAG,EAAE,EAAE;YAClB,SAAS,GAAG,CAAC;YACb,QAAQ,IAAI,CAAC;QACf;IACF;AAEA,IAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,EAAE;AAC3D;AAEA;;AAEwE;AACjE,MAAM,iBAAiB,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAa,EAAE,KAAa,KAAe;AAC7F,IAAA,MAAM,QAAQ,GAAG,iBAAiB,GAAG,EAAE;AACvC,IAAA,MAAM,QAAQ,GAAG,iBAAiB,GAAG,EAAE,GAAG,EAAE;IAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC;IAC/E,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC;AACvC,IAAA,MAAM,SAAS,GAAG,KAAK,GAAG,EAAE;IAE5B,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,EAAE;AACnG;AAEA;AACO,MAAM,iBAAiB,GAAG,CAC/B,IAAe,EACf,EAAa,EACb,SAA0C,KAC/B;AACX,IAAA,MAAM,IAAI,GAAG,cAAc,CAAC,EAAE,CAAC;IAC/B,IAAI,MAAM,GAAG,IAAI;IAEjB,OAAO,CAAC,SAAS,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,EAAE;AACzC,QAAA,IAAI,cAAc,CAAC,MAAM,CAAC,KAAK,IAAI;AAAE,YAAA,OAAO,KAAK;AACjD,QAAA,MAAM,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,CAAC;IACrC;AAEA,IAAA,OAAO,IAAI;AACb;AAEA;AACkC;AAC3B,MAAM,iBAAiB,GAAG,MAAmB;AAClD,IAAA,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE;AACtB,IAAA,OAAO,cAAc,CAAC;AACpB,QAAA,IAAI,EAAE,GAAG,CAAC,cAAc,EAAE;AAC1B,QAAA,KAAK,EAAE,GAAG,CAAC,WAAW,EAAE;AACxB,QAAA,GAAG,EAAE,GAAG,CAAC,UAAU,EAAE;AACtB,KAAA,CAAC;AACJ;AAEA;AACoE;AACpE,MAAM,OAAO,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAa,KAAI;AAClD,IAAA,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;IACxB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC5B,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC;AACrC,IAAA,OAAO,IAAI;AACb,CAAC;AAaD;AAC+F;AAC/F,MAAM,cAAc,GAAc,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;AAElE;;;;AAIG;AACI,MAAM,oBAAoB,GAAG,CAAC,MAAc,KAAoB;IACrE,MAAM,MAAM,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAW;IAChE,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;AAChG,IAAA,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;AAClF,IAAA,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;AACvE,IAAA,MAAM,YAAY,GAAG,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AACrF,IAAA,MAAM,WAAW,GAAG,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AAEnF,IAAA,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,KAAI;QAC1D,MAAM,IAAI,GAAG,OAAO,CAAC,eAAe,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC;AAC5D,QAAA,OAAO,EAAE,KAAK,EAAE,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;AAC7E,IAAA,CAAC,CAAC;IAEF,OAAO;AACL,QAAA,eAAe,EAAE,CAAC,KAAK,KAAK,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC5D,eAAe,EAAE,CAAC,GAAG,KAAK,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC;QAC/C,YAAY;AACZ,QAAA,UAAU,EAAE,CAAC,KAAK,KAAK,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KACvD;AACH;AAiBO,MAAM,qBAAqB,GAAmB;AACnD,IAAA,aAAa,EAAE,gBAAgB;AAC/B,IAAA,SAAS,EAAE,YAAY;AACvB,IAAA,KAAK,EAAE,OAAO;AACd,IAAA,UAAU,EAAE,eAAe;AAC3B,IAAA,WAAW,EAAE,gBAAgB;AAC7B,IAAA,gBAAgB,EAAE,yCAAyC;;MAGhD,qBAAqB,GAAG,CAAC,MAAgC,MAAsB;AAC1F,IAAA,GAAG,qBAAqB;AACxB,IAAA,GAAG,MAAM;AACV,CAAA;;"}

package/dist/esm/components/date-field.js

@@ -0,0 +1,84 @@
+'use client';
+import { jsx, jsxs } from 'react/jsx-runtime';
+import { Popover } from '@base-ui/react/popover';
+import { CalendarDays } from 'lucide-react';
+import { useRef, useEffect } from 'react';
+import { cn } from '../libs/utils.js';
+import { density, shape, text, stateLayer, state, focusRingWithin, material, overlay, stacking } from './ui.common.js';
+import { motionInkPress, motionFeedback, motionPresenceAnchored } from './ui.motion.js';
+
+/* The parts the two date pickers share.
+   ====================================
+   A picker is a native `type=date` field with a named control beside it that opens the calendar,
+   so the field's surface, its trailing control and the popup that holds the grid have to be one
+   definition rather than two that drift. This module is private to the date family: nothing here
+   is published, and neither picker adds a shell of its own.
+
+   `DatePicker` and `DateRangePicker` compose Base `Field` for the label/description/error
+   relationship and Base `Popover` for the popup; what lives here is only the visual and
+   structural arrangement those compositions hold in common. */
+/**
+ * The one field surface the date family uses: a borderless matte field whose focus treatment
+ * wraps the whole row, exactly as the library's other composite fields do.
+ *
+ * The row carries `group/field` and its own `data-disabled` marker so the trailing control's dim
+ * is neutralised inside an already dimmed field — a disabled field dims once, at the field.
+ */
+const dateFieldRowClassName = (disabled) => cn("group/field flex min-w-0 w-full items-center ps-5 pe-3", density.normal, shape.control, material.control, motionFeedback, focusRingWithin, state.field.invalid, !disabled && state.field.hover, !disabled && state.field.focusWithin, !disabled && state.field.invalidHover, !disabled && state.field.invalidFocusWithin, disabled ? state.disabledDescendant : state.text);
+/** Native date entry remains intact. Its trailing browser affordance sits outside the clipped
+ *  input slot, leaving one visible calendar trigger in every engine (Firefox does not expose
+ *  a picker-indicator pseudo-element). The composite row owns focus, not the clipped input. */
+const dateInputClassName = "block w-[calc(100%+2.5rem)] min-w-0 bg-transparent py-3 text-inherit outline-none disabled:cursor-not-allowed";
+/* The 36×44 target holds a concentric 32px hover surface, leaving air inside the 48px field.
+   Only the icon presses: the adjacent native text entry never activates this button. */
+const datePartClassName = `group inline-flex shrink-0 items-center justify-center ${density.part} ${shape.circle} ${text.medium} ${motionFeedback} ${stateLayer.quiet} before:inset-x-0.5 before:inset-y-1.5 ${state.enabled} ${state.disabledPart} [&:not([data-disabled]):not(:disabled)]:hover:text-sherick-ink`;
+/**
+ * The named control that opens the calendar. It is a Base `Popover.Trigger` rendered as a native
+ * button, so Base owns the relationship it publishes on the field (`aria-haspopup`,
+ * `aria-expanded`, `aria-controls`) and the pointer and keyboard activation that opens the
+ * surface; the button itself only carries the type it needs to stay out of form submission.
+ */
+const DateFieldTrigger = ({ label, disabled = false }) => (jsx(Popover.Trigger, { disabled: disabled, render: jsx("button", { type: "button", "aria-label": label, disabled: disabled, className: cn(datePartClassName) }), children: jsx("span", { className: cn("inline-flex size-5 items-center justify-center [&>svg]:size-5", !disabled && motionInkPress), children: jsx(CalendarDays, { "aria-hidden": "true" }) }) }));
+/**
+ * The calendar's popup: the same shell `Popover.Content` renders, composed straight from Base's
+ * public parts because the grid needs one thing the published shell does not offer — `initialFocus`
+ * aimed at the day the reader is on, so the grid is usable from the moment it opens.
+ *
+ * Base owns the portal, the placement and collision handling, the outside-interaction and Escape
+ * dismissal and the focus restoration; the surface is non-modal, so the rest of the page stays
+ * reachable. Sherick owns only the sheet and its presence.
+ */
+const DateCalendarPopup = ({ title, children, anchor }) => {
+    const popupRef = useRef(null);
+    return (jsx(Popover.Portal, { children: jsx(Popover.Positioner, { anchor: anchor, side: "bottom", align: "start", sideOffset: 8, className: cn(stacking.float), children: jsxs(Popover.Popup, { ref: popupRef, 
+                /* The roving tab stop is the calendar's own active day, so this is exactly the cell a
+                   keyboard reader would land on. `null` leaves Base's default focus behaviour in place
+                   if the grid has no tab stop to give. */
+                initialFocus: () => { var _a, _b; return (_b = (_a = popupRef.current) === null || _a === void 0 ? void 0 : _a.querySelector('[data-day][tabindex="0"]')) !== null && _b !== void 0 ? _b : null; }, className: cn("w-max max-w-[min(24rem,var(--available-width))] max-h-[var(--available-height)] overflow-y-auto p-3 [overflow-wrap:anywhere]", overlay.popup, motionPresenceAnchored), children: [jsx(Popover.Title, { className: cn("sr-only"), children: title }), children] }) }) }));
+};
+/** Base Field controls entry and validity, but native reset emits no input/change event.
+ * Bridge only the date family's domain state, after the owning form's cancelable reset. */
+const useDateFormReset = (inputRef, formId, restore) => {
+    const latestRestore = useRef(restore);
+    useEffect(() => { latestRestore.current = restore; }, [restore]);
+    useEffect(() => {
+        var _a;
+        const form = (_a = inputRef.current) === null || _a === void 0 ? void 0 : _a.form;
+        if (!form)
+            return;
+        const reset = (event) => {
+            // A microtask can run between native listeners, before React's delegated onReset.
+            // The next task observes cancellation after the entire native dispatch/default action.
+            setTimeout(() => {
+                var _a;
+                if (!event.defaultPrevented && ((_a = inputRef.current) === null || _a === void 0 ? void 0 : _a.form) === form)
+                    latestRestore.current();
+            }, 0);
+        };
+        form.addEventListener("reset", reset);
+        return () => form.removeEventListener("reset", reset);
+    }, [inputRef, formId]);
+};
+
+export { DateCalendarPopup, DateFieldTrigger, dateFieldRowClassName, dateInputClassName, useDateFormReset };
+//# sourceMappingURL=date-field.js.map

package/dist/esm/components/date-field.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"date-field.js","sources":["../../../src/components/date-field.tsx"],"sourcesContent":["\"use client\";\n\nimport { Popover as BasePopover } from \"@base-ui/react/popover\";\nimport { CalendarDays } from \"lucide-react\";\nimport React, { useEffect, useRef, type ReactNode } from \"react\";\nimport { cn } from \"@/libs/utils\";\nimport { density, focusRingWithin, material, overlay, shape, stacking, state, stateLayer, text } from \"./ui.common\";\nimport { motionFeedback, motionInkPress, motionPresenceAnchored } from \"./ui.motion\";\n\n/* The parts the two date pickers share.\n   ====================================\n   A picker is a native `type=date` field with a named control beside it that opens the calendar,\n   so the field's surface, its trailing control and the popup that holds the grid have to be one\n   definition rather than two that drift. This module is private to the date family: nothing here\n   is published, and neither picker adds a shell of its own.\n\n   `DatePicker` and `DateRangePicker` compose Base `Field` for the label/description/error\n   relationship and Base `Popover` for the popup; what lives here is only the visual and\n   structural arrangement those compositions hold in common. */\n\n/**\n * The one field surface the date family uses: a borderless matte field whose focus treatment\n * wraps the whole row, exactly as the library's other composite fields do.\n *\n * The row carries `group/field` and its own `data-disabled` marker so the trailing control's dim\n * is neutralised inside an already dimmed field — a disabled field dims once, at the field.\n */\nexport const dateFieldRowClassName = (disabled: boolean) =>\n  cn(\n    \"group/field flex min-w-0 w-full items-center ps-5 pe-3\",\n    density.normal,\n    shape.control,\n    material.control,\n    motionFeedback,\n    focusRingWithin,\n    state.field.invalid,\n    !disabled && state.field.hover,\n    !disabled && state.field.focusWithin,\n    !disabled && state.field.invalidHover,\n    !disabled && state.field.invalidFocusWithin,\n    disabled ? state.disabledDescendant : state.text\n  );\n\n/** Native date entry remains intact. Its trailing browser affordance sits outside the clipped\n *  input slot, leaving one visible calendar trigger in every engine (Firefox does not expose\n *  a picker-indicator pseudo-element). The composite row owns focus, not the clipped input. */\nexport const dateInputClassName =\n  \"block w-[calc(100%+2.5rem)] min-w-0 bg-transparent py-3 text-inherit outline-none disabled:cursor-not-allowed\";\n\n/* The 36×44 target holds a concentric 32px hover surface, leaving air inside the 48px field.\n   Only the icon presses: the adjacent native text entry never activates this button. */\nconst datePartClassName = `group inline-flex shrink-0 items-center justify-center ${density.part} ${shape.circle} ${text.medium} ${motionFeedback} ${stateLayer.quiet} before:inset-x-0.5 before:inset-y-1.5 ${state.enabled} ${state.disabledPart} [&:not([data-disabled]):not(:disabled)]:hover:text-sherick-ink`;\n\nexport interface DateFieldTriggerProps {\n  /** The control's accessible name. It has no visible label, so it has to be named. */\n  label: string;\n  disabled?: boolean;\n}\n\n/**\n * The named control that opens the calendar. It is a Base `Popover.Trigger` rendered as a native\n * button, so Base owns the relationship it publishes on the field (`aria-haspopup`,\n * `aria-expanded`, `aria-controls`) and the pointer and keyboard activation that opens the\n * surface; the button itself only carries the type it needs to stay out of form submission.\n */\nexport const DateFieldTrigger = ({ label, disabled = false }: DateFieldTriggerProps) => (\n  <BasePopover.Trigger\n    disabled={disabled}\n    render={<button type=\"button\" aria-label={label} disabled={disabled} className={cn(datePartClassName)} />}\n  >\n    <span className={cn(\"inline-flex size-5 items-center justify-center [&>svg]:size-5\", !disabled && motionInkPress)}>\n      <CalendarDays aria-hidden=\"true\" />\n    </span>\n  </BasePopover.Trigger>\n);\n\nexport interface DateCalendarPopupProps {\n  /** Names the popup, through Base's own Title part. */\n  title: string;\n  children: ReactNode;\n  anchor: React.ComponentProps<typeof BasePopover.Positioner>[\"anchor\"];\n}\n\n/**\n * The calendar's popup: the same shell `Popover.Content` renders, composed straight from Base's\n * public parts because the grid needs one thing the published shell does not offer — `initialFocus`\n * aimed at the day the reader is on, so the grid is usable from the moment it opens.\n *\n * Base owns the portal, the placement and collision handling, the outside-interaction and Escape\n * dismissal and the focus restoration; the surface is non-modal, so the rest of the page stays\n * reachable. Sherick owns only the sheet and its presence.\n */\nexport const DateCalendarPopup = ({ title, children, anchor }: DateCalendarPopupProps) => {\n  const popupRef = useRef<HTMLDivElement | null>(null);\n\n  return (\n    <BasePopover.Portal>\n      <BasePopover.Positioner\n        anchor={anchor}\n        side=\"bottom\"\n        align=\"start\"\n        sideOffset={8}\n        className={cn(stacking.float)}\n      >\n        <BasePopover.Popup\n          ref={popupRef}\n          /* The roving tab stop is the calendar's own active day, so this is exactly the cell a\n             keyboard reader would land on. `null` leaves Base's default focus behaviour in place\n             if the grid has no tab stop to give. */\n          initialFocus={() =>\n            popupRef.current?.querySelector<HTMLElement>('[data-day][tabindex=\"0\"]') ?? null\n          }\n          className={cn(\n            \"w-max max-w-[min(24rem,var(--available-width))] max-h-[var(--available-height)] overflow-y-auto p-3 [overflow-wrap:anywhere]\",\n            overlay.popup,\n            motionPresenceAnchored\n          )}\n        >\n          <BasePopover.Title className={cn(\"sr-only\")}>{title}</BasePopover.Title>\n          {children}\n        </BasePopover.Popup>\n      </BasePopover.Positioner>\n    </BasePopover.Portal>\n  );\n};\n\n/** Base Field controls entry and validity, but native reset emits no input/change event.\n * Bridge only the date family's domain state, after the owning form's cancelable reset. */\nexport const useDateFormReset = (\n  inputRef: React.RefObject<HTMLInputElement | null>,\n  formId: string | undefined,\n  restore: () => void\n) => {\n  const latestRestore = useRef(restore);\n  useEffect(() => { latestRestore.current = restore; }, [restore]);\n  useEffect(() => {\n    const form = inputRef.current?.form;\n    if (!form) return;\n    const reset = (event: Event) => {\n      // A microtask can run between native listeners, before React's delegated onReset.\n      // The next task observes cancellation after the entire native dispatch/default action.\n      setTimeout(() => {\n        if (!event.defaultPrevented && inputRef.current?.form === form) latestRestore.current();\n      }, 0);\n    };\n    form.addEventListener(\"reset\", reset);\n    return () => form.removeEventListener(\"reset\", reset);\n  }, [inputRef, formId]);\n};\n"],"names":["_jsx","BasePopover","_jsxs"],"mappings":";;;;;;;;;AASA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;;;;;;;;;AAS+D,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;AAE/D,CAAA,CAAA;;;;;;AAMG,CAAA,CAAA;AACI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAqB,CAAA,CAAA,CAAG,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAiB,KACrD,CAAA,CAAE,CACA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAwD,CAAA,CACxD,OAAO,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CACd,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CACb,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAC,OAAO,CAAA,CAChB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAc,CAAA,CACd,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAe,EACf,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,OAAO,CAAA,CACnB,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA,CAAA,CAAA,CAAI,KAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,EAC9B,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAW,CAAA,CACpC,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,KAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAY,CAAA,CACrC,CAAC,QAAQ,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAkB,CAAA,CAC3C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA,CAAA,CAAG,KAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAkB,CAAA,CAAA,CAAG,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAI,CAAA;AAGpD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;;AAE+F,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;AACxF,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,kBAAkB,CAAA,CAAA,CAC7B,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;AAEF,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;AACwF,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;AACxF,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAiB,GAAG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAA0D,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAC,IAAI,CAAA,CAAA,EAAI,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,MAAM,CAAA,CAAA,EAAI,CAAA,CAAA,CAAA,CAAI,CAAC,MAAM,CAAA,CAAA,EAAI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAc,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAU,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,uCAAA,CAAA,CAA0C,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAY,iEAAiE;AAQnT,CAAA,CAAA;;;;;AAKG,CAAA,CAAA;AACI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,gBAAgB,CAAA,CAAA,CAAG,CAAC,EAAE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAE,QAAQ,CAAA,CAAA,CAAG,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAyB,CAAA,CAAA,CAAA,CAAA,CAAA,CACjFA,GAAA,CAACC,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAW,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CAAA,EAClB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA,CAClB,MAAM,CAAA,CAAED,CAAAA,CAAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAQ,CAAA,CAAA,CAAA,CAAI,CAAA,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA,CAAA,YAAA,CAAA,CAAa,CAAA,CAAA,CAAA,CAAA,CAAK,EAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA,CAAE,QAAQ,CAAA,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAS,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAiB,CAAC,EAAA,CAAI,CAAA,CAAA,QAAA,CAAA,CAEzGA,CAAAA,CAAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAS,EAAE,CAAA,CAAE,CAAC,+DAA+D,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA,CAAA,CAAA,CAAI,cAAc,CAAC,CAAA,CAAA,QAAA,CAAA,CAC/GA,CAAAA,CAAAA,CAAA,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAY,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAa,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAG,CAAA,CAAA,CAC9B,EAAA,CACa,CAAA;AAUxB,CAAA,CAAA;;;;;;;;AAQG,CAAA,CAAA;AACI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAiB,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAA,CAAA,CAAA,CAAA,CAAK,EAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAA0B,CAAA,CAAA,CAAA,CAAA,CAAI;AACvF,CAAA,CAAA,CAAA,CAAA,MAAM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA,CAAA,CAAG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAwB,IAAI,CAAC;AAEpD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CACEA,CAAAA,CAAAA,CAAA,CAACC,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAW,CAAC,MAAM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CACjBD,CAAAA,CAAAA,EAACC,OAAW,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAU,CAAA,CAAA,CAAA,CACrB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAE,MAAM,CAAA,CACd,CAAA,CAAA,CAAA,CAAI,CAAA,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA,CACb,CAAA,CAAA,CAAA,CAAA,CAAK,EAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CACb,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAU,CAAA,CAAE,CAAC,CAAA,CACb,SAAS,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAE7BC,CAAAA,CAAAA,CAAAA,EAACD,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAW,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAA,CAAA,CAChB,CAAA,CAAA,CAAG,CAAA,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAA;AACb,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;;AAE0C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;gBAC1C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAY,EAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAA,IAAA,CAAA,CAAA,CAAA,CAAA,EAAA,CAAA,CACjB,OAAA,MAAA,CAAA,CAAA,CAAA,GAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAC,OAAO,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,IAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,GAAA,CAAA,CAAA,CAAE,aAAa,CAAc,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAA0B,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,IAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,GAAI,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAA,CAAA,CAElF,SAAS,CAAA,CAAE,CAAA,CAAE,CACX,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAA8H,CAAA,CAC9H,OAAO,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,EACb,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAsB,CACvB,EAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAEDD,CAAAA,CAAAA,EAACC,OAAW,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,EAAA,CAAA,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAS,EAAE,CAAA,CAAE,CAAC,SAAS,CAAC,CAAA,CAAA,QAAA,CAAA,CAAG,CAAA,CAAA,CAAA,CAAA,CAAK,EAAA,CAAqB,CAAA,CACvE,QAAQ,CAAA,CAAA,CAAA,CACS,CAAA,CAAA,CACG,EAAA,CACN,CAAA;AAEzB,CAAA;AAEA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;AAC2F,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;AACpF,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAgB,GAAG,CAC9B,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAkD,EAClD,CAAA,CAAA,CAAA,CAAA,CAAA,CAA0B,CAAA,CAC1B,OAAmB,CAAA,CAAA,CAAA,CAAA,CACjB;AACF,CAAA,CAAA,CAAA,CAAA,MAAM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAa,CAAA,CAAA,CAAG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAC,OAAO,CAAC;AACrC,CAAA,CAAA,CAAA,CAAA,SAAS,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAa,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CAAA,CAAG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAC,CAAC;IAChE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAS,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAK;;QACb,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,IAAI,CAAA,CAAA,CAAG,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,IAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,KAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI;AACnC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAI;YAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;AACX,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAA,CAAG,CAAC,KAAY,CAAA,CAAA,CAAA,CAAA,CAAI;;;YAG7B,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAU,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAK;;AACd,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAgB,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAA,CAAA,CAAI;oBAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAa,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CAAE;YACzF,CAAC,CAAA,CAAE,CAAC,CAAC;AACP,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAC;AACD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,IAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAgB,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CAAE,KAAK,CAAC;QACrC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,MAAM,CAAA,CAAA,CAAA,CAAI,CAAC,mBAAmB,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CAAE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC;AACvD,CAAA,CAAA,CAAA,CAAA,CAAC,CAAA,CAAE,CAAC,QAAQ,CAAA,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAC,CAAC;AACxB,CAAA;;"}

package/dist/esm/components/fileUpload.rules.js

@@ -0,0 +1,114 @@
+/* File selection rules for `FileUpload`.
+
+   The native chooser and the drop zone are two doors into one policy: the same accept, the same
+   per-file size and the same total count decide both, so a file the picker would refuse cannot
+   slip in through a drop. Nothing here reads a browser global — every rule works from the
+   metadata a `File` already carries — so the module is safe to evaluate during SSR and can be
+   probed without a document.
+
+   `FileUpload.tsx` composes the field around these rules; it owns no rule of its own. */
+/** The identity of one selection entry: the fields that make two `File`s the same choice. */
+const fileKey = (file) => `${file.name}\u0000${file.size}\u0000${file.type}\u0000${file.lastModified}`;
+/** The per-file byte limit as a whole number, or `undefined` when the caller set none. */
+const resolveMaxSize = (maxSize) => maxSize !== undefined && Number.isFinite(maxSize) && maxSize >= 0 ? Math.floor(maxSize) : undefined;
+/**
+ * The total file limit, or `undefined` when the selection is unbounded. A single-file field
+ * holds exactly one: the picker is told nothing about it, because that limit is what makes a
+ * second file a replacement rather than an addition.
+ */
+const resolveMaxFiles = (maxFiles, multiple) => {
+    if (!multiple)
+        return 1;
+    return maxFiles !== undefined && Number.isFinite(maxFiles) && maxFiles >= 0
+        ? Math.floor(maxFiles)
+        : undefined;
+};
+/** A byte limit as the copy spells it: `2 MB`, never `2097152`. */
+const formatBytes = (bytes) => {
+    const units = ["B", "KB", "MB", "GB"];
+    let value = bytes;
+    let unit = 0;
+    while (value >= 1024 && unit < units.length - 1) {
+        value /= 1024;
+        unit += 1;
+    }
+    return `${Number.isInteger(value) ? value : value.toFixed(1)} ${units[unit]}`;
+};
+const acceptTokens = (accept) => (accept !== null && accept !== void 0 ? accept : "")
+    .split(",")
+    .map((token) => token.trim().toLowerCase())
+    .filter(Boolean);
+/** An extension token starts with a dot; anything else has to name a media type. */
+const isAcceptToken = (token) => (token.startsWith(".") ? token.length > 1 : token.includes("/"));
+/**
+ * Whether a file satisfies the native `accept` restriction. An extension token matches the file
+ * name, a media type matches the reported MIME type, and a `type/*` wildcard matches a whole
+ * family of them. A file that reports no MIME type at all can satisfy an extension but can never
+ * establish a MIME-only match, which is exactly what the platform does. A malformed `accept`
+ * value is ignored entirely rather than taken as a restriction that refuses everything, again
+ * mirroring the platform: a typo must not close the field.
+ */
+const matchesAccept = (file, accept) => {
+    const tokens = acceptTokens(accept);
+    if (tokens.length === 0 || !tokens.every(isAcceptToken))
+        return true;
+    const name = file.name.toLowerCase();
+    const type = file.type.toLowerCase();
+    return tokens.some((token) => {
+        if (token.startsWith("."))
+            return name.endsWith(token);
+        if (token.endsWith("/*"))
+            return type !== "" && type.startsWith(token.slice(0, -1));
+        return type !== "" && type === token;
+    });
+};
+const countMessage = (file, limit, multiple) => multiple
+    ? `${file.name} was not added: at most ${limit} file${limit === 1 ? "" : "s"} can be selected.`
+    : `${file.name} was not added: this field holds one file.`;
+/**
+ * Applies the whole policy to one batch, from either door.
+ *
+ * Each file is judged type first, then size, then count — the caller's order of severity — and a
+ * refusal never removes a file that was already accepted, so the valid part of a mixed batch
+ * still enters. A file the selection already holds is not a failure, it is the same choice
+ * arriving twice, so it is neither reported nor counted against the limit.
+ *
+ * A single-file field starts from an empty selection: the first accepted file replaces what was
+ * there and everything after it is a count failure.
+ */
+const selectFiles = ({ incoming, current, limits, }) => {
+    const maxSize = resolveMaxSize(limits.maxSize);
+    const maxFiles = resolveMaxFiles(limits.maxFiles, limits.multiple);
+    const files = limits.multiple ? [...current] : [];
+    const keys = new Set(current.map(fileKey));
+    const rejections = [];
+    let accepted = 0;
+    for (const file of incoming) {
+        if (!matchesAccept(file, limits.accept)) {
+            rejections.push({ file, code: "type", message: `${file.name} is not an accepted file type.` });
+            continue;
+        }
+        if (maxSize !== undefined && file.size > maxSize) {
+            rejections.push({
+                file,
+                code: "size",
+                message: `${file.name} is larger than the ${formatBytes(maxSize)} limit.`,
+            });
+            continue;
+        }
+        const key = fileKey(file);
+        if (keys.has(key))
+            continue;
+        if (maxFiles !== undefined && files.length >= maxFiles) {
+            rejections.push({ file, code: "count", message: countMessage(file, maxFiles, limits.multiple) });
+            continue;
+        }
+        keys.add(key);
+        files.push(file);
+        accepted += 1;
+    }
+    return { files, rejections, accepted };
+};
+
+export { fileKey, formatBytes, matchesAccept, resolveMaxFiles, resolveMaxSize, selectFiles };
+//# sourceMappingURL=fileUpload.rules.js.map

package/dist/esm/components/fileUpload.rules.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fileUpload.rules.js","sources":["../../../src/components/fileUpload.rules.ts"],"sourcesContent":["/* File selection rules for `FileUpload`.\n\n   The native chooser and the drop zone are two doors into one policy: the same accept, the same\n   per-file size and the same total count decide both, so a file the picker would refuse cannot\n   slip in through a drop. Nothing here reads a browser global — every rule works from the\n   metadata a `File` already carries — so the module is safe to evaluate during SSR and can be\n   probed without a document.\n\n   `FileUpload.tsx` composes the field around these rules; it owns no rule of its own. */\n\nexport type RejectionCode = \"type\" | \"size\" | \"count\";\n\n/** One file a selection operation refused, with the reason it was refused. */\nexport interface FileRejection {\n  file: File;\n  code: RejectionCode;\n  message: string;\n}\n\nexport interface FileSelectionLimits {\n  /** The native `accept` value, comma-separated MIME types and extensions. */\n  accept?: string;\n  /** Per-file byte limit, already normalized. */\n  maxSize?: number;\n  /** Total file limit, already normalized. */\n  maxFiles?: number;\n  /** Whether the field holds several files or replaces its selection with one. */\n  multiple: boolean;\n}\n\nexport interface FileSelection {\n  /** The selection the operation leaves behind. */\n  files: File[];\n  /** Everything the batch refused, in the order it arrived. */\n  rejections: FileRejection[];\n  /** How many of the incoming files entered the selection. */\n  accepted: number;\n}\n\n/** The identity of one selection entry: the fields that make two `File`s the same choice. */\nexport const fileKey = (file: File) =>\n  `${file.name}\\u0000${file.size}\\u0000${file.type}\\u0000${file.lastModified}`;\n\n/** The per-file byte limit as a whole number, or `undefined` when the caller set none. */\nexport const resolveMaxSize = (maxSize?: number) =>\n  maxSize !== undefined && Number.isFinite(maxSize) && maxSize >= 0 ? Math.floor(maxSize) : undefined;\n\n/**\n * The total file limit, or `undefined` when the selection is unbounded. A single-file field\n * holds exactly one: the picker is told nothing about it, because that limit is what makes a\n * second file a replacement rather than an addition.\n */\nexport const resolveMaxFiles = (maxFiles: number | undefined, multiple: boolean) => {\n  if (!multiple) return 1;\n  return maxFiles !== undefined && Number.isFinite(maxFiles) && maxFiles >= 0\n    ? Math.floor(maxFiles)\n    : undefined;\n};\n\n/** A byte limit as the copy spells it: `2 MB`, never `2097152`. */\nexport const formatBytes = (bytes: number) => {\n  const units = [\"B\", \"KB\", \"MB\", \"GB\"];\n  let value = bytes;\n  let unit = 0;\n  while (value >= 1024 && unit < units.length - 1) {\n    value /= 1024;\n    unit += 1;\n  }\n  return `${Number.isInteger(value) ? value : value.toFixed(1)} ${units[unit]}`;\n};\n\nconst acceptTokens = (accept?: string) =>\n  (accept ?? \"\")\n    .split(\",\")\n    .map((token) => token.trim().toLowerCase())\n    .filter(Boolean);\n\n/** An extension token starts with a dot; anything else has to name a media type. */\nconst isAcceptToken = (token: string) => (token.startsWith(\".\") ? token.length > 1 : token.includes(\"/\"));\n\n/**\n * Whether a file satisfies the native `accept` restriction. An extension token matches the file\n * name, a media type matches the reported MIME type, and a `type/*` wildcard matches a whole\n * family of them. A file that reports no MIME type at all can satisfy an extension but can never\n * establish a MIME-only match, which is exactly what the platform does. A malformed `accept`\n * value is ignored entirely rather than taken as a restriction that refuses everything, again\n * mirroring the platform: a typo must not close the field.\n */\nexport const matchesAccept = (file: File, accept?: string) => {\n  const tokens = acceptTokens(accept);\n  if (tokens.length === 0 || !tokens.every(isAcceptToken)) return true;\n\n  const name = file.name.toLowerCase();\n  const type = file.type.toLowerCase();\n\n  return tokens.some((token) => {\n    if (token.startsWith(\".\")) return name.endsWith(token);\n    if (token.endsWith(\"/*\")) return type !== \"\" && type.startsWith(token.slice(0, -1));\n    return type !== \"\" && type === token;\n  });\n};\n\nconst countMessage = (file: File, limit: number, multiple: boolean) =>\n  multiple\n    ? `${file.name} was not added: at most ${limit} file${limit === 1 ? \"\" : \"s\"} can be selected.`\n    : `${file.name} was not added: this field holds one file.`;\n\n/**\n * Applies the whole policy to one batch, from either door.\n *\n * Each file is judged type first, then size, then count — the caller's order of severity — and a\n * refusal never removes a file that was already accepted, so the valid part of a mixed batch\n * still enters. A file the selection already holds is not a failure, it is the same choice\n * arriving twice, so it is neither reported nor counted against the limit.\n *\n * A single-file field starts from an empty selection: the first accepted file replaces what was\n * there and everything after it is a count failure.\n */\nexport const selectFiles = ({\n  incoming,\n  current,\n  limits,\n}: {\n  incoming: File[];\n  current: File[];\n  limits: FileSelectionLimits;\n}): FileSelection => {\n  const maxSize = resolveMaxSize(limits.maxSize);\n  const maxFiles = resolveMaxFiles(limits.maxFiles, limits.multiple);\n\n  const files = limits.multiple ? [...current] : [];\n  const keys = new Set(current.map(fileKey));\n  const rejections: FileRejection[] = [];\n  let accepted = 0;\n\n  for (const file of incoming) {\n    if (!matchesAccept(file, limits.accept)) {\n      rejections.push({ file, code: \"type\", message: `${file.name} is not an accepted file type.` });\n      continue;\n    }\n\n    if (maxSize !== undefined && file.size > maxSize) {\n      rejections.push({\n        file,\n        code: \"size\",\n        message: `${file.name} is larger than the ${formatBytes(maxSize)} limit.`,\n      });\n      continue;\n    }\n\n    const key = fileKey(file);\n    if (keys.has(key)) continue;\n\n    if (maxFiles !== undefined && files.length >= maxFiles) {\n      rejections.push({ file, code: \"count\", message: countMessage(file, maxFiles, limits.multiple) });\n      continue;\n    }\n\n    keys.add(key);\n    files.push(file);\n    accepted += 1;\n  }\n\n  return { files, rejections, accepted };\n};\n"],"names":[],"mappings":"AAAA;;;;;;;;AAQyF;AA+BzF;AACO,MAAM,OAAO,GAAG,CAAC,IAAU,KAChC,CAAA,EAAG,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,IAAI,CAAA,MAAA,EAAS,IAAI,CAAC,IAAI,CAAA,MAAA,EAAS,IAAI,CAAC,YAAY,CAAA;AAE5E;AACO,MAAM,cAAc,GAAG,CAAC,OAAgB,KAC7C,OAAO,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG;AAE5F;;;;AAIG;MACU,eAAe,GAAG,CAAC,QAA4B,EAAE,QAAiB,KAAI;AACjF,IAAA,IAAI,CAAC,QAAQ;AAAE,QAAA,OAAO,CAAC;AACvB,IAAA,OAAO,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI;AACxE,UAAE,IAAI,CAAC,KAAK,CAAC,QAAQ;UACnB,SAAS;AACf;AAEA;AACO,MAAM,WAAW,GAAG,CAAC,KAAa,KAAI;IAC3C,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC;IACrC,IAAI,KAAK,GAAG,KAAK;IACjB,IAAI,IAAI,GAAG,CAAC;AACZ,IAAA,OAAO,KAAK,IAAI,IAAI,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;QAC/C,KAAK,IAAI,IAAI;QACb,IAAI,IAAI,CAAC;IACX;IACA,OAAO,CAAA,EAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA,CAAA,EAAI,KAAK,CAAC,IAAI,CAAC,CAAA,CAAE;AAC/E;AAEA,MAAM,YAAY,GAAG,CAAC,MAAe,KACnC,CAAC,MAAM,aAAN,MAAM,KAAA,MAAA,GAAN,MAAM,GAAI,EAAE;KACV,KAAK,CAAC,GAAG;AACT,KAAA,GAAG,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE;KACzC,MAAM,CAAC,OAAO,CAAC;AAEpB;AACA,MAAM,aAAa,GAAG,CAAC,KAAa,MAAM,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;AAEzG;;;;;;;AAOG;MACU,aAAa,GAAG,CAAC,IAAU,EAAE,MAAe,KAAI;AAC3D,IAAA,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;AACnC,IAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC;AAAE,QAAA,OAAO,IAAI;IAEpE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE;IACpC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE;AAEpC,IAAA,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,KAAI;AAC3B,QAAA,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC;AAAE,YAAA,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;AACtD,QAAA,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;AAAE,YAAA,OAAO,IAAI,KAAK,EAAE,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACnF,QAAA,OAAO,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,KAAK;AACtC,IAAA,CAAC,CAAC;AACJ;AAEA,MAAM,YAAY,GAAG,CAAC,IAAU,EAAE,KAAa,EAAE,QAAiB,KAChE;AACE,MAAE,CAAA,EAAG,IAAI,CAAC,IAAI,CAAA,wBAAA,EAA2B,KAAK,CAAA,KAAA,EAAQ,KAAK,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,CAAA,iBAAA;AAC5E,MAAE,CAAA,EAAG,IAAI,CAAC,IAAI,4CAA4C;AAE9D;;;;;;;;;;AAUG;AACI,MAAM,WAAW,GAAG,CAAC,EAC1B,QAAQ,EACR,OAAO,EACP,MAAM,GAKP,KAAmB;IAClB,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,OAAO,CAAC;AAC9C,IAAA,MAAM,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC;AAElE,IAAA,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE;AACjD,IAAA,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC1C,MAAM,UAAU,GAAoB,EAAE;IACtC,IAAI,QAAQ,GAAG,CAAC;AAEhB,IAAA,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;QAC3B,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE;AACvC,YAAA,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,IAAI,CAAA,8BAAA,CAAgC,EAAE,CAAC;YAC9F;QACF;QAEA,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,GAAG,OAAO,EAAE;YAChD,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI;AACJ,gBAAA,IAAI,EAAE,MAAM;gBACZ,OAAO,EAAE,CAAA,EAAG,IAAI,CAAC,IAAI,uBAAuB,WAAW,CAAC,OAAO,CAAC,CAAA,OAAA,CAAS;AAC1E,aAAA,CAAC;YACF;QACF;AAEA,QAAA,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC;AACzB,QAAA,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE;QAEnB,IAAI,QAAQ,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,IAAI,QAAQ,EAAE;YACtD,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChG;QACF;AAEA,QAAA,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AACb,QAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;QAChB,QAAQ,IAAI,CAAC;IACf;AAEA,IAAA,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE;AACxC;;"}

package/dist/esm/components/tree.js

@@ -0,0 +1,88 @@
+/**
+ * How long a typed sequence stays open for extension.
+ *
+ * A node label is a word rather than a document, so a search only spans a few characters: long
+ * enough that typing quickly reads as one search, short enough that the next deliberate
+ * character starts a new one instead of extending a stale one.
+ */
+const typeaheadWindow = 500;
+/** Whether a node holds children the tree can show. */
+const isBranch = (item) => { var _a, _b; return ((_b = (_a = item.children) === null || _a === void 0 ? void 0 : _a.length) !== null && _b !== void 0 ? _b : 0) > 0; };
+/**
+ * The nodes in the order the tree presents them: a document-order walk that descends into an
+ * expanded branch and leaves a collapsed one alone.
+ *
+ * This is the one place that decides what "visible" means, and the keyboard, the typeahead and
+ * the roving tab stop all read it rather than walking the tree again — so they can never
+ * disagree about which node is where.
+ */
+const flattenTree = (items, expanded) => {
+    const rows = [];
+    const collect = (nodes, depth, ancestors, ancestorDisabled) => {
+        var _a, _b;
+        for (const item of nodes) {
+            const expandedHere = isBranch(item) && expanded.has(item.value);
+            rows.push({
+                item,
+                depth,
+                parent: (_a = ancestors[ancestors.length - 1]) !== null && _a !== void 0 ? _a : null,
+                ancestors,
+                expanded: expandedHere,
+                ancestorDisabled,
+            });
+            if (expandedHere) {
+                collect((_b = item.children) !== null && _b !== void 0 ? _b : [], depth + 1, [...ancestors, item.value], ancestorDisabled || item.disabled === true);
+            }
+        }
+    };
+    collect(items, 0, [], false);
+    return rows;
+};
+/** The nearest of `ancestors`, deepest first, that the tree still shows. */
+const nearestVisible = (ancestors, visible) => {
+    for (let index = ancestors.length - 1; index >= 0; index -= 1) {
+        if (visible.has(ancestors[index]))
+            return ancestors[index];
+    }
+    return null;
+};
+/**
+ * The APG typeahead search: the next *visible* node whose label starts with the characters typed
+ * so far, starting after `from` and wrapping at the end of the tree.
+ *
+ * A search moves focus and nothing else. Selection is the user's decision, so typing a letter can
+ * never change what is chosen, and a node that a typeahead lands on is not selected by arriving.
+ */
+const matchTypeahead = (rows, pattern, from) => {
+    const query = pattern.toLowerCase();
+    if (query.length === 0 || rows.length === 0)
+        return null;
+    const start = rows.findIndex((row) => row.item.value === from);
+    for (let step = 1; step <= rows.length; step += 1) {
+        const row = rows[(start + step + rows.length) % rows.length];
+        if (row.item.label.toLowerCase().startsWith(query))
+            return row;
+    }
+    return null;
+};
+/**
+ * Advances the typeahead buffer by one keystroke.
+ *
+ * Characters typed in quick succession are one search — `d`, `o`, `c` looks for a label starting
+ * with "doc" — and the *same* character typed again cycles through the nodes that start with it
+ * rather than searching for a two-letter word that almost certainly does not exist. A repeat
+ * neither clears nor extends the buffer, so the next different character still widens the
+ * single-character search it was part of.
+ */
+const typeaheadStep = (buffer, key, now) => {
+    if (buffer.text.length === 0 || now - buffer.time >= typeaheadWindow) {
+        return { buffer: { text: key, time: now }, pattern: key };
+    }
+    if (buffer.text === key) {
+        return { buffer: { text: buffer.text, time: now }, pattern: key };
+    }
+    return { buffer: { text: buffer.text + key, time: now }, pattern: buffer.text + key };
+};
+
+export { flattenTree, isBranch, matchTypeahead, nearestVisible, typeaheadStep, typeaheadWindow };
+//# sourceMappingURL=tree.js.map

package/dist/esm/components/tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.js","sources":["../../../src/components/tree.ts"],"sourcesContent":["import type { ReactNode } from \"react\";\n\n/**\n * The finite static tree a `TreeView` presents.\n *\n * A node is data, never markup: the tree renders the roles, the nesting and the indentation\n * itself, so every node in it is reachable the same way whether it is a leaf or a branch.\n * `value` identifies a node throughout the tree and is unique; `label` is what the node is\n * called — its accessible name and what a typeahead search matches.\n */\nexport interface TreeViewItem {\n  value: string;\n  label: string;\n  icon?: ReactNode;\n  disabled?: boolean;\n  children?: TreeViewItem[];\n}\n\n/** One node, as the tree currently shows it. */\nexport interface TreeRow {\n  item: TreeViewItem;\n  /** How deep the node sits, counted from the roots. */\n  depth: number;\n  /** The node that contains it, or `null` at the top level. */\n  parent: string | null;\n  /** Its ancestors, outermost first. */\n  ancestors: string[];\n  /** Whether this node's own children are shown. */\n  expanded: boolean;\n  /**\n   * Whether a node above this one is disabled. `aria-disabled` is inherited down a subtree, and\n   * this tree deliberately does not mean that: a node below an unavailable branch is its own\n   * node, so the row has to be able to say it is not itself unavailable.\n   */\n  ancestorDisabled: boolean;\n}\n\n/** The characters a typeahead search has accumulated, and when the last one arrived. */\nexport interface TypeaheadBuffer {\n  text: string;\n  time: number;\n}\n\n/**\n * How long a typed sequence stays open for extension.\n *\n * A node label is a word rather than a document, so a search only spans a few characters: long\n * enough that typing quickly reads as one search, short enough that the next deliberate\n * character starts a new one instead of extending a stale one.\n */\nexport const typeaheadWindow = 500;\n\n/** Whether a node holds children the tree can show. */\nexport const isBranch = (item: TreeViewItem) => (item.children?.length ?? 0) > 0;\n\n/**\n * The nodes in the order the tree presents them: a document-order walk that descends into an\n * expanded branch and leaves a collapsed one alone.\n *\n * This is the one place that decides what \"visible\" means, and the keyboard, the typeahead and\n * the roving tab stop all read it rather than walking the tree again — so they can never\n * disagree about which node is where.\n */\nexport const flattenTree = (items: TreeViewItem[], expanded: ReadonlySet<string>): TreeRow[] => {\n  const rows: TreeRow[] = [];\n\n  const collect = (\n    nodes: TreeViewItem[],\n    depth: number,\n    ancestors: string[],\n    ancestorDisabled: boolean\n  ) => {\n    for (const item of nodes) {\n      const expandedHere = isBranch(item) && expanded.has(item.value);\n      rows.push({\n        item,\n        depth,\n        parent: ancestors[ancestors.length - 1] ?? null,\n        ancestors,\n        expanded: expandedHere,\n        ancestorDisabled,\n      });\n      if (expandedHere) {\n        collect(\n          item.children ?? [],\n          depth + 1,\n          [...ancestors, item.value],\n          ancestorDisabled || item.disabled === true\n        );\n      }\n    }\n  };\n\n  collect(items, 0, [], false);\n  return rows;\n};\n\n/** The nearest of `ancestors`, deepest first, that the tree still shows. */\nexport const nearestVisible = (\n  ancestors: string[],\n  visible: ReadonlySet<string>\n): string | null => {\n  for (let index = ancestors.length - 1; index >= 0; index -= 1) {\n    if (visible.has(ancestors[index])) return ancestors[index];\n  }\n  return null;\n};\n\n/**\n * The APG typeahead search: the next *visible* node whose label starts with the characters typed\n * so far, starting after `from` and wrapping at the end of the tree.\n *\n * A search moves focus and nothing else. Selection is the user's decision, so typing a letter can\n * never change what is chosen, and a node that a typeahead lands on is not selected by arriving.\n */\nexport const matchTypeahead = (\n  rows: TreeRow[],\n  pattern: string,\n  from: string | null\n): TreeRow | null => {\n  const query = pattern.toLowerCase();\n  if (query.length === 0 || rows.length === 0) return null;\n\n  const start = rows.findIndex((row) => row.item.value === from);\n  for (let step = 1; step <= rows.length; step += 1) {\n    const row = rows[(start + step + rows.length) % rows.length];\n    if (row.item.label.toLowerCase().startsWith(query)) return row;\n  }\n  return null;\n};\n\n/**\n * Advances the typeahead buffer by one keystroke.\n *\n * Characters typed in quick succession are one search — `d`, `o`, `c` looks for a label starting\n * with \"doc\" — and the *same* character typed again cycles through the nodes that start with it\n * rather than searching for a two-letter word that almost certainly does not exist. A repeat\n * neither clears nor extends the buffer, so the next different character still widens the\n * single-character search it was part of.\n */\nexport const typeaheadStep = (\n  buffer: TypeaheadBuffer,\n  key: string,\n  now: number\n): { buffer: TypeaheadBuffer; pattern: string } => {\n  if (buffer.text.length === 0 || now - buffer.time >= typeaheadWindow) {\n    return { buffer: { text: key, time: now }, pattern: key };\n  }\n\n  if (buffer.text === key) {\n    return { buffer: { text: buffer.text, time: now }, pattern: key };\n  }\n\n  return { buffer: { text: buffer.text + key, time: now }, pattern: buffer.text + key };\n};\n"],"names":[],"mappings":"AA2CA;;;;;;AAMG;AACI,MAAM,eAAe,GAAG;AAE/B;AACO,MAAM,QAAQ,GAAG,CAAC,IAAkB,KAAI,EAAA,IAAA,EAAA,EAAA,EAAA,CAAA,CAAC,OAAA,CAAC,CAAA,EAAA,GAAA,MAAA,IAAI,CAAC,QAAQ,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,MAAM,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,CAAC,IAAI,CAAC,CAAA,CAAA;AAEhF;;;;;;;AAOG;MACU,WAAW,GAAG,CAAC,KAAqB,EAAE,QAA6B,KAAe;IAC7F,MAAM,IAAI,GAAc,EAAE;IAE1B,MAAM,OAAO,GAAG,CACd,KAAqB,EACrB,KAAa,EACb,SAAmB,EACnB,gBAAyB,KACvB;;AACF,QAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AACxB,YAAA,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;YAC/D,IAAI,CAAC,IAAI,CAAC;gBACR,IAAI;gBACJ,KAAK;gBACL,MAAM,EAAE,CAAA,EAAA,GAAA,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,IAAI;gBAC/C,SAAS;AACT,gBAAA,QAAQ,EAAE,YAAY;gBACtB,gBAAgB;AACjB,aAAA,CAAC;YACF,IAAI,YAAY,EAAE;AAChB,gBAAA,OAAO,CACL,CAAA,EAAA,GAAA,IAAI,CAAC,QAAQ,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,EAAE,EACnB,KAAK,GAAG,CAAC,EACT,CAAC,GAAG,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,EAC1B,gBAAgB,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAC3C;YACH;QACF;AACF,IAAA,CAAC;IAED,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC;AAC5B,IAAA,OAAO,IAAI;AACb;AAEA;MACa,cAAc,GAAG,CAC5B,SAAmB,EACnB,OAA4B,KACX;AACjB,IAAA,KAAK,IAAI,KAAK,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE;QAC7D,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AAAE,YAAA,OAAO,SAAS,CAAC,KAAK,CAAC;IAC5D;AACA,IAAA,OAAO,IAAI;AACb;AAEA;;;;;;AAMG;AACI,MAAM,cAAc,GAAG,CAC5B,IAAe,EACf,OAAe,EACf,IAAmB,KACD;AAClB,IAAA,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE;IACnC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,IAAI;AAExD,IAAA,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC;AAC9D,IAAA,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,EAAE;AACjD,QAAA,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;AAC5D,QAAA,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC;AAAE,YAAA,OAAO,GAAG;IAChE;AACA,IAAA,OAAO,IAAI;AACb;AAEA;;;;;;;;AAQG;AACI,MAAM,aAAa,GAAG,CAC3B,MAAuB,EACvB,GAAW,EACX,GAAW,KACqC;AAChD,IAAA,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,GAAG,MAAM,CAAC,IAAI,IAAI,eAAe,EAAE;AACpE,QAAA,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE;IAC3D;AAEA,IAAA,IAAI,MAAM,CAAC,IAAI,KAAK,GAAG,EAAE;AACvB,QAAA,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE;IACnE;IAEA,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,GAAG,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,OAAO,EAAE,MAAM,CAAC,IAAI,GAAG,GAAG,EAAE;AACvF;;"}