vectis-ui 0.10.1 → 0.10.2

package/dist/utils/file.js.map

@@ -1 +1 @@
-{"version":3,"file":"file.js","names":[],"sources":["../../src/utils/file.ts"],"sourcesContent":["// @core — module-wide: pure domain logic, no a11y, no DOM, no environment guard.\n/**\n * The FILE domain: whether a file is of an accepted kind, how its size is written out, and\n * which of a batch may come in. Grouped by subject rather than by shared code, like `text.ts`.\n *\n * Nothing here knows about components, which is what shapes the screening: it RETURNS its\n * refusals instead of emitting them. One body then serves VFileInput, which reports them one\n * at a time, and a test that reads them all as a list without a mount.\n */\nimport { memo } from './memo'\n\n/** All the matching needs of a file, so that a test does not have to counterfeit one. */\nexport interface FileCandidate {\n  name: string\n  type: string\n}\n\n/**\n * An `accept` list read into its tokens: split on commas, trimmed, lowercased, the empty ones\n * dropped. An empty result accepts everything.\n */\nexport function parseAccept(accept?: string): string[] {\n  if (!accept) return []\n  return accept\n    .split(',')\n    .map((token) => token.trim().toLowerCase())\n    .filter(Boolean)\n}\n\n/**\n * Whether a file matches an `accept` list, written exactly as the HTML attribute is:\n * `.pdf` (case-insensitive), `image/*`, or one precise MIME type. An empty list accepts\n * everything.\n *\n * The rule is applied in JS because the ATTRIBUTE only governs the dialog the browser\n * opens: a DROPPED file bypasses it entirely. Without this second reading, dropping\n * smuggles anything past a restriction the consumer believes is enforced.\n *\n * The list may be handed over already read by `parseAccept`, which is what a batch does:\n * screening a hundred dropped files would otherwise split the same string a hundred times.\n *\n * TRAP: `file.type` is the browser's GUESS and is often empty (an unknown extension, some\n * Linux setups). A list written only in MIME types then turns away a perfectly good file,\n * which is why the docs ask for extensions alongside: `image/*,.heic`, not `image/*` alone.\n */\nexport function matchesAccept(file: FileCandidate, accept?: string | readonly string[]): boolean {\n  const tokens = typeof accept === 'string' || accept === undefined ? parseAccept(accept) : accept\n  if (tokens.length === 0) return true\n\n  const name = file.name.toLowerCase()\n  const type = file.type.toLowerCase()\n\n  return tokens.some((token) => {\n    if (token === '*' || token === '*/*') return true\n    if (token.startsWith('.')) return name.endsWith(token)\n    if (token.endsWith('/*')) return type !== '' && type.startsWith(token.slice(0, -1))\n    return type === token\n  })\n}\n\n/**\n * A stable key per FILE OBJECT, for the `v-for` of a file list.\n *\n * An index-based key re-keys every row after a removal, which remounts them — a thumbnail's\n * `<img>` included — and a name is not unique across folders. A File travels through a\n * v-model unproxied (reactivity only wraps plain objects and collections), so its identity is\n * a key that survives both. The map is weak, so a file that leaves every list is not held.\n */\nconst fileIds = new WeakMap<File, number>()\nlet nextFileId = 0\n\nexport function fileKey(file: File): number {\n  let id = fileIds.get(file)\n  if (id === undefined) {\n    id = nextFileId++\n    fileIds.set(file, id)\n  }\n  return id\n}\n\n/** The units a size can be written in, smallest first — the rungs of the ladder. */\nconst UNITS = ['byte', 'kilobyte', 'megabyte', 'gigabyte', 'terabyte'] as const\n\n/**\n * Building a number formatter costs one to two orders of magnitude more than using one,\n * and a running total is rewritten every time a file is added — so one is built per\n * language and rung, and kept for as long as the page lives.\n */\nconst formatters = new Map<string, Intl.NumberFormat>()\n\n/** Bytes are counted whole; above that, one decimal is what reads as a size. */\nconst digitsFor = (step: number) => (step === 0 ? 0 : 1)\n\nfunction formatterFor(locale: string, step: number): Intl.NumberFormat {\n  return memo(\n    formatters,\n    `${locale}|${step}`,\n    () =>\n      new Intl.NumberFormat(locale, {\n        style: 'unit',\n        unit: UNITS[step]!,\n        // The byte rung is spelled out, plural included: CLDR's short English name for a\n        // byte is the word \"byte\" itself, which printed \"999 byte\".\n        unitDisplay: step === 0 ? 'long' : 'short',\n        maximumFractionDigits: digitsFor(step),\n      }),\n  )\n}\n\n/**\n * A file size as a reader expects it: 1 200 000 gives \"1.2 MB\" in English, \"1,2 Mo\" in\n * French. Nothing here is translatable: `Intl` knows the unit names and the decimal mark.\n *\n * SI base 1000, which is what the unit names `Intl` prints actually mean. The computing\n * convention of 1024 would show a 1024-byte file as \"1.02 kB\", a discrepancy no reader can\n * explain to themselves. A negative or non-finite size reads as 0: the number comes straight\n * off the file, and a size beside a name must never be the thing that breaks.\n */\nexport function formatBytes(bytes: number, locale: string): string {\n  const n = Number.isFinite(bytes) && bytes > 0 ? bytes : 0\n\n  let step = n === 0 ? 0 : Math.min(UNITS.length - 1, Math.max(0, Math.floor(Math.log10(n) / 3)))\n  let value = n / 1000 ** step\n\n  /*\n   * The carry. 999 999 bytes belongs on the kB rung and ROUNDS to 1000 at one decimal, so\n   * rung and rounding have to agree or the reader is shown \"1,000 kB\" for \"1 MB\". Round\n   * first, then step up: the other order lets the same discrepancy through one rung higher.\n   */\n  const rounded = Math.round(value * 10 ** digitsFor(step)) / 10 ** digitsFor(step)\n  if (rounded >= 1000 && step < UNITS.length - 1) {\n    step += 1\n    value = n / 1000 ** step\n  }\n\n  return formatterFor(locale, step).format(value)\n}\n\n/**\n * Why a file was turned away: its kind, its size, how many there already are, or the\n * total.\n *\n * VFileInput and VFilePicker screen a batch through the same `screenFiles` below, so the\n * two report the same thing and the type is declared ONCE, here, rather than copied into\n * each of them under a name of its own. It is the `TimePickerAllowed` arrangement: the type\n * lives beside the rule that produces it, and `index.ts` is what makes it public. The\n * MODULE stays internal, and a handler written for one of the two components can be\n * handed to the other.\n */\nexport type FileRejectReason = 'type' | 'size' | 'count' | 'total-size'\n\n/** One file that was turned away, and the reason it was. */\nexport interface FileRejection {\n  /** The file itself, so a message can name it. */\n  file: File\n  /** What it fell foul of. */\n  reason: FileRejectReason\n}\n\nexport interface FileLimits {\n  accept?: string\n  /** How large ONE file may be, in bytes. */\n  maxSize?: number\n  /** Already settled by the caller: a field that takes a single file passes one. */\n  maxFiles?: number\n  maxTotalSize?: number\n}\n\n/**\n * Screens an arriving batch against what is already chosen, returning the accepted files\n * and one rejection per refusal.\n *\n * The order `type → size → count → total-size` is a contract both `.mdx` pages state, and\n * it is the order a reader can act on: a file of the wrong KIND is reported as such even\n * when it is also too big, since being told to shrink a file that would never be accepted\n * is worse than useless.\n *\n * Duplicates are deliberately NOT a reason: two files in different folders may share a\n * name, and there is no reliable way to tell one from another. What is already chosen\n * counts towards both the count and the running total, so a second drop obeys the same\n * limits as the first instead of starting over.\n */\nexport function screenFiles(\n  incoming: readonly File[],\n  current: readonly File[],\n  limits: FileLimits,\n): { accepted: File[]; rejected: FileRejection[] } {\n  const accepted: File[] = []\n  const rejected: FileRejection[] = []\n  let total = current.reduce((sum, file) => sum + file.size, 0)\n  const accept = parseAccept(limits.accept)\n\n  for (const file of incoming) {\n    if (!matchesAccept(file, accept)) {\n      rejected.push({ file, reason: 'type' })\n      continue\n    }\n    if (limits.maxSize !== undefined && file.size > limits.maxSize) {\n      rejected.push({ file, reason: 'size' })\n      continue\n    }\n    if (limits.maxFiles !== undefined && current.length + accepted.length >= limits.maxFiles) {\n      rejected.push({ file, reason: 'count' })\n      continue\n    }\n    if (limits.maxTotalSize !== undefined && total + file.size > limits.maxTotalSize) {\n      rejected.push({ file, reason: 'total-size' })\n      continue\n    }\n    accepted.push(file)\n    total += file.size\n  }\n\n  return { accepted, rejected }\n}\n"],"mappings":";;AAqBA,SAAgB,EAAY,GAA2B;CAErD,OADK,IACE,EACJ,MAAM,GAAG,CAAC,CACV,KAAK,MAAU,EAAM,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAC1C,OAAO,OAAO,IAJG,CAAC;AAKvB;AAkBA,SAAgB,EAAc,GAAqB,GAA8C;CAC/F,IAAM,IAAS,OAAO,KAAW,YAAY,MAAW,KAAA,IAAY,EAAY,CAAM,IAAI;CAC1F,IAAI,EAAO,WAAW,GAAG,OAAO;CAEhC,IAAM,IAAO,EAAK,KAAK,YAAY,GAC7B,IAAO,EAAK,KAAK,YAAY;CAEnC,OAAO,EAAO,MAAM,MACd,MAAU,OAAO,MAAU,QAAc,KACzC,EAAM,WAAW,GAAG,IAAU,EAAK,SAAS,CAAK,IACjD,EAAM,SAAS,IAAI,IAAU,MAAS,MAAM,EAAK,WAAW,EAAM,MAAM,GAAG,EAAE,CAAC,IAC3E,MAAS,CACjB;AACH;AAUA,IAAM,oBAAU,IAAI,QAAsB,GACtC,IAAa;AAEjB,SAAgB,EAAQ,GAAoB;CAC1C,IAAI,IAAK,EAAQ,IAAI,CAAI;CAKzB,OAJI,MAAO,KAAA,MACT,IAAK,KACL,EAAQ,IAAI,GAAM,CAAE,IAEf;AACT;AAGA,IAAM,IAAQ;CAAC;CAAQ;CAAY;CAAY;CAAY;AAAU,GAO/D,oBAAa,IAAI,IAA+B,GAGhD,KAAa,MAAkB,MAAS,IAAI,IAAI;AAEtD,SAAS,EAAa,GAAgB,GAAiC;CACrE,OAAO,EACL,GACA,GAAG,EAAO,GAAG,WAEX,IAAI,KAAK,aAAa,GAAQ;EAC5B,OAAO;EACP,MAAM,EAAM;EAGZ,aAAa,MAAS,IAAI,SAAS;EACnC,uBAAuB,EAAU,CAAI;CACvC,CAAC,CACL;AACF;AAWA,SAAgB,EAAY,GAAe,GAAwB;CACjE,IAAM,IAAI,OAAO,SAAS,CAAK,KAAK,IAAQ,IAAI,IAAQ,GAEpD,IAAO,MAAM,IAAI,IAAI,KAAK,IAAI,EAAM,SAAS,GAAG,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAC1F,IAAQ,IAAI,OAAQ;CAaxB,OANgB,KAAK,MAAM,IAAQ,MAAM,EAAU,CAAI,CAAC,IAAI,MAAM,EAAU,CAAI,KACjE,OAAQ,IAAO,EAAM,SAAS,MAC3C,KAAQ,GACR,IAAQ,IAAI,OAAQ,IAGf,EAAa,GAAQ,CAAI,CAAC,CAAC,OAAO,CAAK;AAChD;AA8CA,SAAgB,EACd,GACA,GACA,GACiD;CACjD,IAAM,IAAmB,CAAC,GACpB,IAA4B,CAAC,GAC/B,IAAQ,EAAQ,QAAQ,GAAK,MAAS,IAAM,EAAK,MAAM,CAAC,GACtD,IAAS,EAAY,EAAO,MAAM;CAExC,KAAK,IAAM,KAAQ,GAAU;EAC3B,IAAI,CAAC,EAAc,GAAM,CAAM,GAAG;GAChC,EAAS,KAAK;IAAE;IAAM,QAAQ;GAAO,CAAC;GACtC;EACF;EACA,IAAI,EAAO,YAAY,KAAA,KAAa,EAAK,OAAO,EAAO,SAAS;GAC9D,EAAS,KAAK;IAAE;IAAM,QAAQ;GAAO,CAAC;GACtC;EACF;EACA,IAAI,EAAO,aAAa,KAAA,KAAa,EAAQ,SAAS,EAAS,UAAU,EAAO,UAAU;GACxF,EAAS,KAAK;IAAE;IAAM,QAAQ;GAAQ,CAAC;GACvC;EACF;EACA,IAAI,EAAO,iBAAiB,KAAA,KAAa,IAAQ,EAAK,OAAO,EAAO,cAAc;GAChF,EAAS,KAAK;IAAE;IAAM,QAAQ;GAAa,CAAC;GAC5C;EACF;EAEA,AADA,EAAS,KAAK,CAAI,GAClB,KAAS,EAAK;CAChB;CAEA,OAAO;EAAE;EAAU;CAAS;AAC9B"}
+{"version":3,"file":"file.js","names":[],"sources":["../../src/utils/file.ts"],"sourcesContent":["// @core\n/**\n * Pure file screening and formatting; return accepted files and rejection reasons for\n * components to emit.\n */\nimport { memo } from './memo'\n\n/** All the matching needs of a file, so that a test does not have to counterfeit one. */\nexport interface FileCandidate {\n  name: string\n  type: string\n}\n\n/**\n * An `accept` list read into its tokens: split on commas, trimmed, lowercased, the empty ones\n * dropped. An empty result accepts everything.\n */\nexport function parseAccept(accept?: string): string[] {\n  if (!accept) return []\n  return accept\n    .split(',')\n    .map((token) => token.trim().toLowerCase())\n    .filter(Boolean)\n}\n\n/**\n * `file.type` is the browser's GUESS and is often empty (an unknown extension, some Linux\n * setups). A list written only in MIME types then turns away a perfectly good file, which is\n * why the docs ask for extensions alongside: `image/*,.heic`, not `image/*` alone.\n */\nexport function matchesAccept(file: FileCandidate, accept?: string | readonly string[]): boolean {\n  const tokens = typeof accept === 'string' || accept === undefined ? parseAccept(accept) : accept\n  if (tokens.length === 0) return true\n\n  const name = file.name.toLowerCase()\n  const type = file.type.toLowerCase()\n\n  return tokens.some((token) => {\n    if (token === '*' || token === '*/*') return true\n    if (token.startsWith('.')) return name.endsWith(token)\n    if (token.endsWith('/*')) return type !== '' && type.startsWith(token.slice(0, -1))\n    return type === token\n  })\n}\n\n/** A stable key per FILE OBJECT, for the `v-for` of a file list. */\nconst fileIds = new WeakMap<File, number>()\nlet nextFileId = 0\n\nexport function fileKey(file: File): number {\n  let id = fileIds.get(file)\n  if (id === undefined) {\n    id = nextFileId++\n    fileIds.set(file, id)\n  }\n  return id\n}\n\n/** The units a size can be written in, smallest first; the rungs of the ladder. */\nconst UNITS = ['byte', 'kilobyte', 'megabyte', 'gigabyte', 'terabyte'] as const\n\n/**\n * Building a number formatter costs one to two orders of magnitude more than using one, and a\n * running total is rewritten every time a file is added; so one is built per language and rung,\n * and kept for as long as the page lives.\n */\nconst formatters = new Map<string, Intl.NumberFormat>()\n\n/** Bytes are counted whole; above that, one decimal is what reads as a size. */\nconst digitsFor = (step: number) => (step === 0 ? 0 : 1)\n\nfunction formatterFor(locale: string, step: number): Intl.NumberFormat {\n  return memo(\n    formatters,\n    `${locale}|${step}`,\n    () =>\n      new Intl.NumberFormat(locale, {\n        style: 'unit',\n        unit: UNITS[step]!,\n        // The byte rung is spelled out, plural included: CLDR's short English name for a\n        // byte is the word \"byte\" itself, which printed \"999 byte\".\n        unitDisplay: step === 0 ? 'long' : 'short',\n        maximumFractionDigits: digitsFor(step),\n      }),\n  )\n}\n\n/** A file size as a reader expects it: 1 200 000 gives \"1.2 MB\" in English, \"1,2 Mo\" in French. */\nexport function formatBytes(bytes: number, locale: string): string {\n  const n = Number.isFinite(bytes) && bytes > 0 ? bytes : 0\n\n  let step = n === 0 ? 0 : Math.min(UNITS.length - 1, Math.max(0, Math.floor(Math.log10(n) / 3)))\n  let value = n / 1000 ** step\n\n  /*\n   * The carry. 999 999 bytes belongs on the kB rung and ROUNDS to 1000 at one decimal, so\n   * rung and rounding have to agree or the reader is shown \"1,000 kB\" for \"1 MB\". Round\n   * first, then step up: the other order lets the same discrepancy through one rung higher.\n   */\n  const rounded = Math.round(value * 10 ** digitsFor(step)) / 10 ** digitsFor(step)\n  if (rounded >= 1000 && step < UNITS.length - 1) {\n    step += 1\n    value = n / 1000 ** step\n  }\n\n  return formatterFor(locale, step).format(value)\n}\n\n/** Why a file was turned away: its kind, its size, how many there already are, or the total. */\nexport type FileRejectReason = 'type' | 'size' | 'count' | 'total-size'\n\n/** One file that was turned away, and the reason it was. */\nexport interface FileRejection {\n  /** The file itself, so a message can name it. */\n  file: File\n  /** What it fell foul of. */\n  reason: FileRejectReason\n}\n\nexport interface FileLimits {\n  accept?: string\n  /** How large ONE file may be, in bytes. */\n  maxSize?: number\n  /** Already settled by the caller: a field that takes a single file passes one. */\n  maxFiles?: number\n  maxTotalSize?: number\n}\n\n/**\n * Screens an arriving batch against what is already chosen, returning the accepted files and\n * one rejection per refusal. What is already chosen counts towards both the count and the\n * running total, so a second drop obeys the same limits as the first instead of starting over.\n */\nexport function screenFiles(\n  incoming: readonly File[],\n  current: readonly File[],\n  limits: FileLimits,\n): { accepted: File[]; rejected: FileRejection[] } {\n  const accepted: File[] = []\n  const rejected: FileRejection[] = []\n  let total = current.reduce((sum, file) => sum + file.size, 0)\n  const accept = parseAccept(limits.accept)\n\n  for (const file of incoming) {\n    if (!matchesAccept(file, accept)) {\n      rejected.push({ file, reason: 'type' })\n      continue\n    }\n    if (limits.maxSize !== undefined && file.size > limits.maxSize) {\n      rejected.push({ file, reason: 'size' })\n      continue\n    }\n    if (limits.maxFiles !== undefined && current.length + accepted.length >= limits.maxFiles) {\n      rejected.push({ file, reason: 'count' })\n      continue\n    }\n    if (limits.maxTotalSize !== undefined && total + file.size > limits.maxTotalSize) {\n      rejected.push({ file, reason: 'total-size' })\n      continue\n    }\n    accepted.push(file)\n    total += file.size\n  }\n\n  return { accepted, rejected }\n}\n"],"mappings":";;AAiBA,SAAgB,EAAY,GAA2B;CAErD,OADK,IACE,EACJ,MAAM,GAAG,CAAC,CACV,KAAK,MAAU,EAAM,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAC1C,OAAO,OAAO,IAJG,CAAC;AAKvB;AAOA,SAAgB,EAAc,GAAqB,GAA8C;CAC/F,IAAM,IAAS,OAAO,KAAW,YAAY,MAAW,KAAA,IAAY,EAAY,CAAM,IAAI;CAC1F,IAAI,EAAO,WAAW,GAAG,OAAO;CAEhC,IAAM,IAAO,EAAK,KAAK,YAAY,GAC7B,IAAO,EAAK,KAAK,YAAY;CAEnC,OAAO,EAAO,MAAM,MACd,MAAU,OAAO,MAAU,QAAc,KACzC,EAAM,WAAW,GAAG,IAAU,EAAK,SAAS,CAAK,IACjD,EAAM,SAAS,IAAI,IAAU,MAAS,MAAM,EAAK,WAAW,EAAM,MAAM,GAAG,EAAE,CAAC,IAC3E,MAAS,CACjB;AACH;AAGA,IAAM,oBAAU,IAAI,QAAsB,GACtC,IAAa;AAEjB,SAAgB,EAAQ,GAAoB;CAC1C,IAAI,IAAK,EAAQ,IAAI,CAAI;CAKzB,OAJI,MAAO,KAAA,MACT,IAAK,KACL,EAAQ,IAAI,GAAM,CAAE,IAEf;AACT;AAGA,IAAM,IAAQ;CAAC;CAAQ;CAAY;CAAY;CAAY;AAAU,GAO/D,oBAAa,IAAI,IAA+B,GAGhD,KAAa,MAAkB,MAAS,IAAI,IAAI;AAEtD,SAAS,EAAa,GAAgB,GAAiC;CACrE,OAAO,EACL,GACA,GAAG,EAAO,GAAG,WAEX,IAAI,KAAK,aAAa,GAAQ;EAC5B,OAAO;EACP,MAAM,EAAM;EAGZ,aAAa,MAAS,IAAI,SAAS;EACnC,uBAAuB,EAAU,CAAI;CACvC,CAAC,CACL;AACF;AAGA,SAAgB,EAAY,GAAe,GAAwB;CACjE,IAAM,IAAI,OAAO,SAAS,CAAK,KAAK,IAAQ,IAAI,IAAQ,GAEpD,IAAO,MAAM,IAAI,IAAI,KAAK,IAAI,EAAM,SAAS,GAAG,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAC1F,IAAQ,IAAI,OAAQ;CAaxB,OANgB,KAAK,MAAM,IAAQ,MAAM,EAAU,CAAI,CAAC,IAAI,MAAM,EAAU,CAAI,KACjE,OAAQ,IAAO,EAAM,SAAS,MAC3C,KAAQ,GACR,IAAQ,IAAI,OAAQ,IAGf,EAAa,GAAQ,CAAI,CAAC,CAAC,OAAO,CAAK;AAChD;AA2BA,SAAgB,EACd,GACA,GACA,GACiD;CACjD,IAAM,IAAmB,CAAC,GACpB,IAA4B,CAAC,GAC/B,IAAQ,EAAQ,QAAQ,GAAK,MAAS,IAAM,EAAK,MAAM,CAAC,GACtD,IAAS,EAAY,EAAO,MAAM;CAExC,KAAK,IAAM,KAAQ,GAAU;EAC3B,IAAI,CAAC,EAAc,GAAM,CAAM,GAAG;GAChC,EAAS,KAAK;IAAE;IAAM,QAAQ;GAAO,CAAC;GACtC;EACF;EACA,IAAI,EAAO,YAAY,KAAA,KAAa,EAAK,OAAO,EAAO,SAAS;GAC9D,EAAS,KAAK;IAAE;IAAM,QAAQ;GAAO,CAAC;GACtC;EACF;EACA,IAAI,EAAO,aAAa,KAAA,KAAa,EAAQ,SAAS,EAAS,UAAU,EAAO,UAAU;GACxF,EAAS,KAAK;IAAE;IAAM,QAAQ;GAAQ,CAAC;GACvC;EACF;EACA,IAAI,EAAO,iBAAiB,KAAA,KAAa,IAAQ,EAAK,OAAO,EAAO,cAAc;GAChF,EAAS,KAAK;IAAE;IAAM,QAAQ;GAAa,CAAC;GAC5C;EACF;EAEA,AADA,EAAS,KAAK,CAAI,GAClB,KAAS,EAAK;CAChB;CAEA,OAAO;EAAE;EAAU;CAAS;AAC9B"}

package/dist/utils/focus.d.ts

@@ -1,15 +1,2 @@
-/**
- * Whether this element is focused the way a keyboard user focuses things.
- *
- * A `focus` event does not carry the distinction: a mouse click and a Tab leave an element in
- * the same state. The browser already makes the judgement for its own focus rings and
- * publishes it as `:focus-visible`, so that is what gets asked. The `try` covers a selector
- * engine that throws on a pseudo-class it cannot parse; the keyboard is the careful answer
- * there, being the one that keeps a component reachable.
- *
- * TRAP for the tests: jsdom is NOT that environment. It parses `:focus-visible` happily and
- * answers `false` for everything, a genuinely focused element included, so the `catch` never
- * runs and every test silently takes the pointer branch. Stub `matches` on the element being
- * asked; what that locks is that the component ASKS and branches, never jsdom's answer.
- */
+/** Use the browser's focus-visible heuristic to distinguish keyboard focus. */
 export declare function isKeyboardFocus(target: EventTarget | null): boolean;

package/dist/utils/focus.js

@@ -1,11 +1,6 @@
 //#region src/utils/focus.ts
 function e(e) {
-	if (!(e instanceof Element)) return !1;
-	try {
-		return e.matches(":focus-visible");
-	} catch {
-		return !0;
-	}
+	return e instanceof Element && e.matches(":focus-visible");
 }
 //#endregion
 export { e as isKeyboardFocus };

package/dist/utils/focus.js.map

@@ -1 +1 @@
-{"version":3,"file":"focus.js","names":[],"sources":["../../src/utils/focus.ts"],"sourcesContent":["// @a11y @fallback\n/**\n * Whether this element is focused the way a keyboard user focuses things.\n *\n * A `focus` event does not carry the distinction: a mouse click and a Tab leave an element in\n * the same state. The browser already makes the judgement for its own focus rings and\n * publishes it as `:focus-visible`, so that is what gets asked. The `try` covers a selector\n * engine that throws on a pseudo-class it cannot parse; the keyboard is the careful answer\n * there, being the one that keeps a component reachable.\n *\n * TRAP for the tests: jsdom is NOT that environment. It parses `:focus-visible` happily and\n * answers `false` for everything, a genuinely focused element included, so the `catch` never\n * runs and every test silently takes the pointer branch. Stub `matches` on the element being\n * asked; what that locks is that the component ASKS and branches, never jsdom's answer.\n */\nexport function isKeyboardFocus(target: EventTarget | null): boolean {\n  if (!(target instanceof Element)) return false\n  try {\n    return target.matches(':focus-visible')\n  } catch {\n    return true\n  }\n}\n"],"mappings":";AAeA,SAAgB,EAAgB,GAAqC;CACnE,IAAI,EAAE,aAAkB,UAAU,OAAO;CACzC,IAAI;EACF,OAAO,EAAO,QAAQ,gBAAgB;CACxC,QAAQ;EACN,OAAO;CACT;AACF"}
+{"version":3,"file":"focus.js","names":[],"sources":["../../src/utils/focus.ts"],"sourcesContent":["// @a11y\n/** Use the browser's focus-visible heuristic to distinguish keyboard focus. */\nexport function isKeyboardFocus(target: EventTarget | null): boolean {\n  return target instanceof Element && target.matches(':focus-visible')\n}\n"],"mappings":";AAEA,SAAgB,EAAgB,GAAqC;CACnE,OAAO,aAAkB,WAAW,EAAO,QAAQ,gBAAgB;AACrE"}

package/dist/utils/hostWarns.d.ts

@@ -1,12 +1,7 @@
 import { InjectionKey } from 'vue';
 /**
- * Provided by a component that renders another with props it has ALREADY checked and
- * reported on: VDateInput for VDatePicker's bounds, VTimeInput for VTimePicker's step and
- * restrictions, both forwarded as they stand. The component inside then keeps those warnings
- * to itself. The consumer wrote the host, and a second copy of the same sentence under a
- * name they never typed is noise.
- *
- * A module of its own and not a line in `env.ts`: that one is in nearly every closure, where a
- * key only four components read added bytes to all of them.
+ * Provided by a component that renders another with props it has ALREADY checked and reported
+ * on: VDateInput for VDatePicker's bounds, VTimeInput for VTimePicker's step and restrictions,
+ * both forwarded as they stand.
  */
 export declare const hostWarnsKey: InjectionKey<true>;

package/dist/utils/hostWarns.js.map

@@ -1 +1 @@
-{"version":3,"file":"hostWarns.js","names":[],"sources":["../../src/utils/hostWarns.ts"],"sourcesContent":["import type { InjectionKey } from 'vue'\n\n/**\n * Provided by a component that renders another with props it has ALREADY checked and\n * reported on: VDateInput for VDatePicker's bounds, VTimeInput for VTimePicker's step and\n * restrictions, both forwarded as they stand. The component inside then keeps those warnings\n * to itself. The consumer wrote the host, and a second copy of the same sentence under a\n * name they never typed is noise.\n *\n * A module of its own and not a line in `env.ts`: that one is in nearly every closure, where a\n * key only four components read added bytes to all of them.\n */\nexport const hostWarnsKey: InjectionKey<true> = Symbol('vectisHostWarns')\n"],"mappings":";AAYA,IAAa,IAAmC,OAAO,iBAAiB"}
+{"version":3,"file":"hostWarns.js","names":[],"sources":["../../src/utils/hostWarns.ts"],"sourcesContent":["import type { InjectionKey } from 'vue'\n\n/**\n * Provided by a component that renders another with props it has ALREADY checked and reported\n * on: VDateInput for VDatePicker's bounds, VTimeInput for VTimePicker's step and restrictions,\n * both forwarded as they stand.\n */\nexport const hostWarnsKey: InjectionKey<true> = Symbol('vectisHostWarns')\n"],"mappings":";AAOA,IAAa,IAAmC,OAAO,iBAAiB"}

package/dist/utils/ids.d.ts

@@ -1,10 +1,5 @@
 /**
- * An IDREF list: the value of `aria-describedby` or `aria-labelledby`: assembled from
- * references that may each be absent. The empty ones are dropped by TRUTHINESS, so an empty
- * string contributes nothing, and a list left with no reference at all is `undefined`, which
- * removes the attribute instead of writing an empty one.
- *
- * A module of its own rather than a line in `text.ts`: every field loads it, and none of them
- * should pay for the text helpers to get it.
+ * Omit empty ID references and return undefined for an empty list so ARIA attributes are
+ * removed rather than left blank.
  */
 export declare function joinIds(...ids: (string | false | null | undefined)[]): string | undefined;

package/dist/utils/ids.js.map

@@ -1 +1 @@
-{"version":3,"file":"ids.js","names":[],"sources":["../../src/utils/ids.ts"],"sourcesContent":["// @a11y\n/**\n * An IDREF list: the value of `aria-describedby` or `aria-labelledby`: assembled from\n * references that may each be absent. The empty ones are dropped by TRUTHINESS, so an empty\n * string contributes nothing, and a list left with no reference at all is `undefined`, which\n * removes the attribute instead of writing an empty one.\n *\n * A module of its own rather than a line in `text.ts`: every field loads it, and none of them\n * should pay for the text helpers to get it.\n */\nexport function joinIds(...ids: (string | false | null | undefined)[]): string | undefined {\n  return ids.filter(Boolean).join(' ') || undefined\n}\n"],"mappings":";AAUA,SAAgB,EAAQ,GAAG,GAAgE;CACzF,OAAO,EAAI,OAAO,OAAO,CAAC,CAAC,KAAK,GAAG,KAAK,KAAA;AAC1C"}
+{"version":3,"file":"ids.js","names":[],"sources":["../../src/utils/ids.ts"],"sourcesContent":["// @a11y\n/**\n * Omit empty ID references and return undefined for an empty list so ARIA attributes are\n * removed rather than left blank.\n */\nexport function joinIds(...ids: (string | false | null | undefined)[]): string | undefined {\n  return ids.filter(Boolean).join(' ') || undefined\n}\n"],"mappings":";AAKA,SAAgB,EAAQ,GAAG,GAAgE;CACzF,OAAO,EAAI,OAAO,OAAO,CAAC,CAAC,KAAK,GAAG,KAAK,KAAA;AAC1C"}

package/dist/utils/matcher.d.ts

@@ -1,9 +1,2 @@
-/**
- * Turns the design system's "which entries are unavailable" props: `disabledDates`,
- * `disabledPages` and their kind, each accepting a list OR a predicate, into one
- * function to ask, so components need not care which they were handed.
- *
- * Resolve it ONCE inside a `computed`, never per value: the list becomes a `Set` here, so
- * each lookup is immediate where an `includes` would rescan it for every cell on screen.
- */
+/** Resolve matchers once in a computed value so repeated cell lookups reuse the compiled Set. */
 export declare function resolveMatcher<T>(matcher: readonly T[] | ((value: T) => boolean) | undefined): (value: T) => boolean;

package/dist/utils/matcher.js.map

@@ -1 +1 @@
-{"version":3,"file":"matcher.js","names":[],"sources":["../../src/utils/matcher.ts"],"sourcesContent":["// @core\n/**\n * Turns the design system's \"which entries are unavailable\" props: `disabledDates`,\n * `disabledPages` and their kind, each accepting a list OR a predicate, into one\n * function to ask, so components need not care which they were handed.\n *\n * Resolve it ONCE inside a `computed`, never per value: the list becomes a `Set` here, so\n * each lookup is immediate where an `includes` would rescan it for every cell on screen.\n */\nexport function resolveMatcher<T>(\n  matcher: readonly T[] | ((value: T) => boolean) | undefined,\n): (value: T) => boolean {\n  if (!matcher) return () => false\n  if (typeof matcher === 'function') return matcher\n  const set = new Set(matcher)\n  return (value: T) => set.has(value)\n}\n"],"mappings":";AASA,SAAgB,EACd,GACuB;CACvB,IAAI,CAAC,GAAS,aAAa;CAC3B,IAAI,OAAO,KAAY,YAAY,OAAO;CAC1C,IAAM,IAAM,IAAI,IAAI,CAAO;CAC3B,QAAQ,MAAa,EAAI,IAAI,CAAK;AACpC"}
+{"version":3,"file":"matcher.js","names":[],"sources":["../../src/utils/matcher.ts"],"sourcesContent":["// @core\n/** Resolve matchers once in a computed value so repeated cell lookups reuse the compiled Set. */\nexport function resolveMatcher<T>(\n  matcher: readonly T[] | ((value: T) => boolean) | undefined,\n): (value: T) => boolean {\n  if (!matcher) return () => false\n  if (typeof matcher === 'function') return matcher\n  const set = new Set(matcher)\n  return (value: T) => set.has(value)\n}\n"],"mappings":";AAEA,SAAgB,EACd,GACuB;CACvB,IAAI,CAAC,GAAS,aAAa;CAC3B,IAAI,OAAO,KAAY,YAAY,OAAO;CAC1C,IAAM,IAAM,IAAI,IAAI,CAAO;CAC3B,QAAQ,MAAa,EAAI,IAAI,CAAK;AACpC"}

package/dist/utils/memo.d.ts

@@ -1,12 +1,2 @@
-/**
- * Reads a module-level cache, building the entry on its first miss.
- *
- * The `Intl` helpers in `date.ts`, `time.ts` and `file.ts` all keep one: an `Intl` object
- * costs one to two orders of magnitude more to build than to use, and those helpers are
- * called one value at a time. What each cache holds is the helper's own business; the
- * get-or-build around it is the same everywhere, and written here once.
- *
- * `undefined` is the miss marker, so a builder must never return it. None does, every entry
- * being an object, a string or a number.
- */
+/** undefined marks a cache miss; builders must return a defined value. */
 export declare function memo<K, V>(cache: Map<K, V>, key: K, build: () => V): V;

package/dist/utils/memo.js.map

@@ -1 +1 @@
-{"version":3,"file":"memo.js","names":[],"sources":["../../src/utils/memo.ts"],"sourcesContent":["// @core\n/**\n * Reads a module-level cache, building the entry on its first miss.\n *\n * The `Intl` helpers in `date.ts`, `time.ts` and `file.ts` all keep one: an `Intl` object\n * costs one to two orders of magnitude more to build than to use, and those helpers are\n * called one value at a time. What each cache holds is the helper's own business; the\n * get-or-build around it is the same everywhere, and written here once.\n *\n * `undefined` is the miss marker, so a builder must never return it. None does, every entry\n * being an object, a string or a number.\n */\nexport function memo<K, V>(cache: Map<K, V>, key: K, build: () => V): V {\n  let value = cache.get(key)\n  if (value === undefined) {\n    value = build()\n    cache.set(key, value)\n  }\n  return value\n}\n"],"mappings":";AAYA,SAAgB,EAAW,GAAkB,GAAQ,GAAmB;CACtE,IAAI,IAAQ,EAAM,IAAI,CAAG;CAKzB,OAJI,MAAU,KAAA,MACZ,IAAQ,EAAM,GACd,EAAM,IAAI,GAAK,CAAK,IAEf;AACT"}
+{"version":3,"file":"memo.js","names":[],"sources":["../../src/utils/memo.ts"],"sourcesContent":["// @core\n/** undefined marks a cache miss; builders must return a defined value. */\nexport function memo<K, V>(cache: Map<K, V>, key: K, build: () => V): V {\n  let value = cache.get(key)\n  if (value === undefined) {\n    value = build()\n    cache.set(key, value)\n  }\n  return value\n}\n"],"mappings":";AAEA,SAAgB,EAAW,GAAkB,GAAQ,GAAmB;CACtE,IAAI,IAAQ,EAAM,IAAI,CAAG;CAKzB,OAJI,MAAU,KAAA,MACZ,IAAQ,EAAM,GACd,EAAM,IAAI,GAAK,CAAK,IAEf;AACT"}

package/dist/utils/number.d.ts

@@ -1,8 +1,2 @@
-/**
- * Holds a number between a lower and an upper bound.
- *
- * On an empty interval the LOWER bound wins, which is deliberate: `max` is often derived
- * from a list, and an empty one puts its last position one short of its first. The lower
- * bound is the one that is always somewhere a value can sit.
- */
+/** Clamp to the lower bound when the interval is empty, as with the last index of an empty list. */
 export declare function clamp(n: number, min: number, max: number): number;

package/dist/utils/number.js.map

@@ -1 +1 @@
-{"version":3,"file":"number.js","names":[],"sources":["../../src/utils/number.ts"],"sourcesContent":["// @core\n/**\n * Holds a number between a lower and an upper bound.\n *\n * On an empty interval the LOWER bound wins, which is deliberate: `max` is often derived\n * from a list, and an empty one puts its last position one short of its first. The lower\n * bound is the one that is always somewhere a value can sit.\n */\nexport function clamp(n: number, min: number, max: number): number {\n  return Math.max(min, Math.min(max, n))\n}\n"],"mappings":";AAQA,SAAgB,EAAM,GAAW,GAAa,GAAqB;CACjE,OAAO,KAAK,IAAI,GAAK,KAAK,IAAI,GAAK,CAAC,CAAC;AACvC"}
+{"version":3,"file":"number.js","names":[],"sources":["../../src/utils/number.ts"],"sourcesContent":["// @core\n/** Clamp to the lower bound when the interval is empty, as with the last index of an empty list. */\nexport function clamp(n: number, min: number, max: number): number {\n  return Math.max(min, Math.min(max, n))\n}\n"],"mappings":";AAEA,SAAgB,EAAM,GAAW,GAAa,GAAqB;CACjE,OAAO,KAAK,IAAI,GAAK,KAAK,IAAI,GAAK,CAAC,CAAC;AACvC"}

package/dist/utils/text.d.ts

@@ -1,30 +1,11 @@
-/**
- * The form of a text used for COMPARING it: case and accents no longer count.
- *
- * NFD splits each letter into the plain letter and its mark, and the marks are dropped.
- * Used wherever the library matches a list against what someone typed: searching "e" has
- * to find "é", nobody reaching for the right accent to find a name.
- */
+/** Remove NFD combining marks for accent-insensitive matching. */
 export declare function normalizeText(s: string): string;
 /**
- * A memory of `normalizeText` results, filed under the object a text belongs to: a table row,
- * a combobox option, and under a field name when one object holds several texts.
- *
- * A filter normalizes the whole list again on every keystroke, and normalizing decomposes,
- * strips and lowercases each string: this is what makes the second keystroke cost a lookup.
- *
- * The raw text is passed on EVERY call and compared with the one remembered, rather than the
- * list being derived once: that is what notices a label edited in place, which a value keyed
- * on the list alone would not. And the memory is a `WeakMap` keyed by the owner, so replacing
- * the list lets the old entries be collected with no invalidation written anywhere.
+ * A memory of `normalizeText` results, filed under the object a text belongs to: a table row, a
+ * combobox option, and under a field name when one object holds several texts.
  */
 export declare function createNormalizedCache<K extends object>(): (owner: K, raw: string, field?: string) => string;
 /** A whole number written on two digits, so that 7 becomes "07": as dates and times are. */
 export declare function pad2(n: number): string;
-/**
- * Just the digits of a string, everything else dropped.
- *
- * It knows nothing of dates or times, which is why it lives here rather than with either:
- * the masked fields only ever handle the run of digits and place the separators themselves.
- */
+/** Just the digits of a string, everything else dropped. */
 export declare const digitsOf: (text: string) => string;

package/dist/utils/text.js.map

@@ -1 +1 @@
-{"version":3,"file":"text.js","names":[],"sources":["../../src/utils/text.ts"],"sourcesContent":["// @core\n/**\n * The form of a text used for COMPARING it: case and accents no longer count.\n *\n * NFD splits each letter into the plain letter and its mark, and the marks are dropped.\n * Used wherever the library matches a list against what someone typed: searching \"e\" has\n * to find \"é\", nobody reaching for the right accent to find a name.\n */\nexport function normalizeText(s: string): string {\n  return s\n    .normalize('NFD')\n    .replace(/[\\u0300-\\u036f]/g, '')\n    .toLowerCase()\n}\n\n// @core\n/**\n * A memory of `normalizeText` results, filed under the object a text belongs to: a table row,\n * a combobox option, and under a field name when one object holds several texts.\n *\n * A filter normalizes the whole list again on every keystroke, and normalizing decomposes,\n * strips and lowercases each string: this is what makes the second keystroke cost a lookup.\n *\n * The raw text is passed on EVERY call and compared with the one remembered, rather than the\n * list being derived once: that is what notices a label edited in place, which a value keyed\n * on the list alone would not. And the memory is a `WeakMap` keyed by the owner, so replacing\n * the list lets the old entries be collected with no invalidation written anywhere.\n */\nexport function createNormalizedCache<K extends object>() {\n  const cache = new WeakMap<K, Map<string, { raw: string; normalized: string }>>()\n  return (owner: K, raw: string, field = ''): string => {\n    let texts = cache.get(owner)\n    if (!texts) {\n      texts = new Map()\n      cache.set(owner, texts)\n    }\n    const hit = texts.get(field)\n    if (hit && hit.raw === raw) return hit.normalized\n    const normalized = normalizeText(raw)\n    texts.set(field, { raw, normalized })\n    return normalized\n  }\n}\n\n// @core\n/** A whole number written on two digits, so that 7 becomes \"07\": as dates and times are. */\nexport function pad2(n: number): string {\n  return String(n).padStart(2, '0')\n}\n\n// @core\n/**\n * Just the digits of a string, everything else dropped.\n *\n * It knows nothing of dates or times, which is why it lives here rather than with either:\n * the masked fields only ever handle the run of digits and place the separators themselves.\n */\nexport const digitsOf = (text: string): string => text.replace(/\\D/g, '')\n"],"mappings":";AAQA,SAAgB,EAAc,GAAmB;CAC/C,OAAO,EACJ,UAAU,KAAK,CAAC,CAChB,QAAQ,oBAAoB,EAAE,CAAC,CAC/B,YAAY;AACjB;AAeA,SAAgB,IAA0C;CACxD,IAAM,oBAAQ,IAAI,QAA6D;CAC/E,QAAQ,GAAU,GAAa,IAAQ,OAAe;EACpD,IAAI,IAAQ,EAAM,IAAI,CAAK;EAC3B,AAAK,MACH,oBAAQ,IAAI,IAAI,GAChB,EAAM,IAAI,GAAO,CAAK;EAExB,IAAM,IAAM,EAAM,IAAI,CAAK;EAC3B,IAAI,KAAO,EAAI,QAAQ,GAAK,OAAO,EAAI;EACvC,IAAM,IAAa,EAAc,CAAG;EAEpC,OADA,EAAM,IAAI,GAAO;GAAE;GAAK;EAAW,CAAC,GAC7B;CACT;AACF;AAIA,SAAgB,EAAK,GAAmB;CACtC,OAAO,OAAO,CAAC,CAAC,CAAC,SAAS,GAAG,GAAG;AAClC;AASA,IAAa,KAAY,MAAyB,EAAK,QAAQ,OAAO,EAAE"}
+{"version":3,"file":"text.js","names":[],"sources":["../../src/utils/text.ts"],"sourcesContent":["// @core\n/** Remove NFD combining marks for accent-insensitive matching. */\nexport function normalizeText(s: string): string {\n  return s\n    .normalize('NFD')\n    .replace(/[\\u0300-\\u036f]/g, '')\n    .toLowerCase()\n}\n\n// @core\n/**\n * A memory of `normalizeText` results, filed under the object a text belongs to: a table row, a\n * combobox option, and under a field name when one object holds several texts.\n */\nexport function createNormalizedCache<K extends object>() {\n  const cache = new WeakMap<K, Map<string, { raw: string; normalized: string }>>()\n  return (owner: K, raw: string, field = ''): string => {\n    let texts = cache.get(owner)\n    if (!texts) {\n      texts = new Map()\n      cache.set(owner, texts)\n    }\n    const hit = texts.get(field)\n    if (hit && hit.raw === raw) return hit.normalized\n    const normalized = normalizeText(raw)\n    texts.set(field, { raw, normalized })\n    return normalized\n  }\n}\n\n// @core\n/** A whole number written on two digits, so that 7 becomes \"07\": as dates and times are. */\nexport function pad2(n: number): string {\n  return String(n).padStart(2, '0')\n}\n\n// @core\n/** Just the digits of a string, everything else dropped. */\nexport const digitsOf = (text: string): string => text.replace(/\\D/g, '')\n"],"mappings":";AAEA,SAAgB,EAAc,GAAmB;CAC/C,OAAO,EACJ,UAAU,KAAK,CAAC,CAChB,QAAQ,oBAAoB,EAAE,CAAC,CAC/B,YAAY;AACjB;AAOA,SAAgB,IAA0C;CACxD,IAAM,oBAAQ,IAAI,QAA6D;CAC/E,QAAQ,GAAU,GAAa,IAAQ,OAAe;EACpD,IAAI,IAAQ,EAAM,IAAI,CAAK;EAC3B,AAAK,MACH,oBAAQ,IAAI,IAAI,GAChB,EAAM,IAAI,GAAO,CAAK;EAExB,IAAM,IAAM,EAAM,IAAI,CAAK;EAC3B,IAAI,KAAO,EAAI,QAAQ,GAAK,OAAO,EAAI;EACvC,IAAM,IAAa,EAAc,CAAG;EAEpC,OADA,EAAM,IAAI,GAAO;GAAE;GAAK;EAAW,CAAC,GAC7B;CACT;AACF;AAIA,SAAgB,EAAK,GAAmB;CACtC,OAAO,OAAO,CAAC,CAAC,CAAC,SAAS,GAAG,GAAG;AAClC;AAIA,IAAa,KAAY,MAAyB,EAAK,QAAQ,OAAO,EAAE"}

package/dist/utils/time.d.ts

@@ -12,20 +12,12 @@ export declare function parseTime(value: string | null | undefined): TimeParts |
 /** Writes an hour and a minute back into the canonical form, both on two digits. */
 export declare function formatTime(hour: number, minute: number): string;
 /**
- * Whether a language counts the hours to twelve, with a morning and an afternoon, or
- * straight to twenty-four. It is the browser that knows, and it is asked.
- *
- * A language tag it cannot make sense of falls back to the 24-hour clock rather than
- * failing.
+ * Whether a language counts the hours to twelve, with a morning and an afternoon, or straight
+ * to twenty-four. A language tag it cannot make sense of falls back to the 24-hour clock rather
+ * than failing.
  */
 export declare function hourCycleFor(locale: string): HourFormat;
-/**
- * A time written out for a reader: "19:05", or "7:05 PM".
- *
- * `hourCycle` is imposed rather than left to `Intl`, so the text follows what the component
- * settled on: a consumer asking for a 24-hour clock in a locale that would choose otherwise
- * must get theirs.
- */
+/** A time written out for a reader: "19:05", or "7:05 PM". */
 export declare function formatTimeDisplay(time: string, locale: string, format: HourFormat): string;
 /** A time as minutes since midnight, `null` if it is not one: its position in a list. */
 export declare function minutesOf(time: string | null | undefined): number | null;

package/dist/utils/time.js.map

@@ -1 +1 @@
-{"version":3,"file":"time.js","names":[],"sources":["../../src/utils/time.ts"],"sourcesContent":["// @ssr @core — module-wide: every export below is @core unless tagged otherwise.\n/**\n * The TIME domain every component that shows a time shares: VTimePicker, VTimeInput and the\n * VCalendar views. Pure: nothing here draws or touches the page, and the same numbers always\n * give the same answer.\n *\n * TRAP — what only the clock and the field need lives in `./clock`, not here. This module\n * is in the import closure of every VCalendar component (`minutesOf`, `hourCycleFor`,\n * `formatTimeDisplay`), and anything added to it is paid by each of them: the dial, the\n * AM/PM arithmetic, the typing mask and the list of times weighed some 600 B gzip on\n * `VCalendarYear`, which shows no time at all.\n *\n * A time is always the canonical 24-hour string `'HH:mm'`, whatever is being SHOWN — a\n * picker displaying \"7:05 PM\" still holds `'19:05'`. That is what keeps the value a\n * consumer receives independent of the reader's locale.\n *\n * `Intl` is asked on UTC reference instants only, so nothing depends on the host clock and\n * the server render agrees with the browser's.\n */\nimport { memo } from './memo'\nimport { pad2 } from './text'\n\nexport type HourFormat = '12h' | '24h'\nexport type Meridiem = 'AM' | 'PM'\n\nexport interface TimeParts {\n  /** The hour on the 24-hour clock, from 0 to 23. */\n  hour: number\n  minute: number\n}\n\nconst TIME_RE = /^([01]\\d|2[0-3]):([0-5]\\d)$/\n\n/** Whether something is a time in the canonical form: two digits, a colon, two digits. */\nexport function isValidTime(value: unknown): value is string {\n  return typeof value === 'string' && TIME_RE.test(value)\n}\n\n/** Reads a canonical time into its two numbers, or nothing at all if it is not one. */\nexport function parseTime(value: string | null | undefined): TimeParts | null {\n  if (!isValidTime(value)) return null\n  const [h, m] = value.split(':')\n  return { hour: Number(h), minute: Number(m) }\n}\n\n/** Writes an hour and a minute back into the canonical form, both on two digits. */\nexport function formatTime(hour: number, minute: number): string {\n  return `${pad2(hour)}:${pad2(minute)}`\n}\n\nconst hourCycleCache = new Map<string, HourFormat>()\n\n// @fallback\n/**\n * Whether a language counts the hours to twelve, with a morning and an afternoon, or\n * straight to twenty-four. It is the browser that knows, and it is asked.\n *\n * A language tag it cannot make sense of falls back to the 24-hour clock rather than\n * failing.\n */\nexport function hourCycleFor(locale: string): HourFormat {\n  return memo(hourCycleCache, locale, () => resolveHourCycle(locale))\n}\n\nfunction resolveHourCycle(locale: string): HourFormat {\n  try {\n    const { hourCycle } = new Intl.DateTimeFormat(locale, { hour: 'numeric' }).resolvedOptions()\n    return hourCycle === 'h11' || hourCycle === 'h12' ? '12h' : '24h'\n  } catch {\n    return '24h'\n  }\n}\n\n/**\n * One formatter per locale and clock, module-lived — the `formatterFor` idiom of `file.ts`.\n *\n * Construction costs one to two orders of magnitude more than use, and `timeList` formats\n * ONE VALUE AT A TIME: 1440 entries at one-minute steps, so 1440 constructions per rebuild.\n * Measured at ~82 ms against ~2 ms memoized. The clock is part of the key because it is\n * imposed below rather than following from the locale.\n */\nconst displayFormatters = new Map<string, Intl.DateTimeFormat>()\n\nfunction displayFormatterFor(locale: string, format: HourFormat): Intl.DateTimeFormat {\n  return memo(\n    displayFormatters,\n    `${locale}|${format}`,\n    () =>\n      new Intl.DateTimeFormat(locale, {\n        hour: 'numeric',\n        minute: '2-digit',\n        // A 12-hour clock takes the language's own: Japanese counts it from 0 (h11), English\n        // from 12 (h12). Imposing h12 wrote 午前12:05 where 午前0:05 is written.\n        ...(format === '12h' ? { hour12: true } : { hourCycle: 'h23' as const }),\n        timeZone: 'UTC',\n      }),\n  )\n}\n\n/**\n * A time written out for a reader: \"19:05\", or \"7:05 PM\".\n *\n * `hourCycle` is imposed rather than left to `Intl`, so the text follows what the component\n * settled on: a consumer asking for a 24-hour clock in a locale that would choose otherwise\n * must get theirs.\n */\nexport function formatTimeDisplay(time: string, locale: string, format: HourFormat): string {\n  const parts = parseTime(time)\n  if (!parts) return ''\n  return displayFormatterFor(locale, format).format(Date.UTC(2021, 0, 1, parts.hour, parts.minute))\n}\n\n/** A time as minutes since midnight, `null` if it is not one: its position in a list. */\nexport function minutesOf(time: string | null | undefined): number | null {\n  const parts = parseTime(time)\n  return parts ? parts.hour * 60 + parts.minute : null\n}\n"],"mappings":";;;AA+BA,IAAM,IAAU;AAGhB,SAAgB,EAAY,GAAiC;CAC3D,OAAO,OAAO,KAAU,YAAY,EAAQ,KAAK,CAAK;AACxD;AAGA,SAAgB,EAAU,GAAoD;CAC5E,IAAI,CAAC,EAAY,CAAK,GAAG,OAAO;CAChC,IAAM,CAAC,GAAG,KAAK,EAAM,MAAM,GAAG;CAC9B,OAAO;EAAE,MAAM,OAAO,CAAC;EAAG,QAAQ,OAAO,CAAC;CAAE;AAC9C;AAGA,SAAgB,EAAW,GAAc,GAAwB;CAC/D,OAAO,GAAG,EAAK,CAAI,EAAE,GAAG,EAAK,CAAM;AACrC;AAEA,IAAM,oBAAiB,IAAI,IAAwB;AAUnD,SAAgB,EAAa,GAA4B;CACvD,OAAO,EAAK,GAAgB,SAAc,EAAiB,CAAM,CAAC;AACpE;AAEA,SAAS,EAAiB,GAA4B;CACpD,IAAI;EACF,IAAM,EAAE,iBAAc,IAAI,KAAK,eAAe,GAAQ,EAAE,MAAM,UAAU,CAAC,CAAC,CAAC,gBAAgB;EAC3F,OAAO,MAAc,SAAS,MAAc,QAAQ,QAAQ;CAC9D,QAAQ;EACN,OAAO;CACT;AACF;AAUA,IAAM,oBAAoB,IAAI,IAAiC;AAE/D,SAAS,EAAoB,GAAgB,GAAyC;CACpF,OAAO,EACL,GACA,GAAG,EAAO,GAAG,WAEX,IAAI,KAAK,eAAe,GAAQ;EAC9B,MAAM;EACN,QAAQ;EAGR,GAAI,MAAW,QAAQ,EAAE,QAAQ,GAAK,IAAI,EAAE,WAAW,MAAe;EACtE,UAAU;CACZ,CAAC,CACL;AACF;AASA,SAAgB,EAAkB,GAAc,GAAgB,GAA4B;CAC1F,IAAM,IAAQ,EAAU,CAAI;CAE5B,OADK,IACE,EAAoB,GAAQ,CAAM,CAAC,CAAC,OAAO,KAAK,IAAI,MAAM,GAAG,GAAG,EAAM,MAAM,EAAM,MAAM,CAAC,IAD7E;AAErB;AAGA,SAAgB,EAAU,GAAgD;CACxE,IAAM,IAAQ,EAAU,CAAI;CAC5B,OAAO,IAAQ,EAAM,OAAO,KAAK,EAAM,SAAS;AAClD"}
+{"version":3,"file":"time.js","names":[],"sources":["../../src/utils/time.ts"],"sourcesContent":["// @ssr @core\n/**\n * Keep this shared time module small: calendar views import it, while clock and field-specific\n * helpers belong in clock.ts.\n */\nimport { memo } from './memo'\nimport { pad2 } from './text'\n\nexport type HourFormat = '12h' | '24h'\nexport type Meridiem = 'AM' | 'PM'\n\nexport interface TimeParts {\n  /** The hour on the 24-hour clock, from 0 to 23. */\n  hour: number\n  minute: number\n}\n\nconst TIME_RE = /^([01]\\d|2[0-3]):([0-5]\\d)$/\n\n/** Whether something is a time in the canonical form: two digits, a colon, two digits. */\nexport function isValidTime(value: unknown): value is string {\n  return typeof value === 'string' && TIME_RE.test(value)\n}\n\n/** Reads a canonical time into its two numbers, or nothing at all if it is not one. */\nexport function parseTime(value: string | null | undefined): TimeParts | null {\n  if (!isValidTime(value)) return null\n  const [h, m] = value.split(':')\n  return { hour: Number(h), minute: Number(m) }\n}\n\n/** Writes an hour and a minute back into the canonical form, both on two digits. */\nexport function formatTime(hour: number, minute: number): string {\n  return `${pad2(hour)}:${pad2(minute)}`\n}\n\nconst hourCycleCache = new Map<string, HourFormat>()\n\n// @fallback\n/**\n * Whether a language counts the hours to twelve, with a morning and an afternoon, or straight\n * to twenty-four. A language tag it cannot make sense of falls back to the 24-hour clock rather\n * than failing.\n */\nexport function hourCycleFor(locale: string): HourFormat {\n  return memo(hourCycleCache, locale, () => resolveHourCycle(locale))\n}\n\nfunction resolveHourCycle(locale: string): HourFormat {\n  try {\n    const { hourCycle } = new Intl.DateTimeFormat(locale, { hour: 'numeric' }).resolvedOptions()\n    return hourCycle === 'h11' || hourCycle === 'h12' ? '12h' : '24h'\n  } catch {\n    return '24h'\n  }\n}\n\n/** One formatter per locale and clock, module-lived; the `formatterFor` idiom of `file.ts`. */\nconst displayFormatters = new Map<string, Intl.DateTimeFormat>()\n\nfunction displayFormatterFor(locale: string, format: HourFormat): Intl.DateTimeFormat {\n  return memo(\n    displayFormatters,\n    `${locale}|${format}`,\n    () =>\n      new Intl.DateTimeFormat(locale, {\n        hour: 'numeric',\n        minute: '2-digit',\n        // A 12-hour clock takes the language's own: Japanese counts it from 0 (h11), English\n        // from 12 (h12). Imposing h12 wrote 午前12:05 where 午前0:05 is written.\n        ...(format === '12h' ? { hour12: true } : { hourCycle: 'h23' as const }),\n        timeZone: 'UTC',\n      }),\n  )\n}\n\n/** A time written out for a reader: \"19:05\", or \"7:05 PM\". */\nexport function formatTimeDisplay(time: string, locale: string, format: HourFormat): string {\n  const parts = parseTime(time)\n  if (!parts) return ''\n  return displayFormatterFor(locale, format).format(Date.UTC(2021, 0, 1, parts.hour, parts.minute))\n}\n\n/** A time as minutes since midnight, `null` if it is not one: its position in a list. */\nexport function minutesOf(time: string | null | undefined): number | null {\n  const parts = parseTime(time)\n  return parts ? parts.hour * 60 + parts.minute : null\n}\n"],"mappings":";;;AAiBA,IAAM,IAAU;AAGhB,SAAgB,EAAY,GAAiC;CAC3D,OAAO,OAAO,KAAU,YAAY,EAAQ,KAAK,CAAK;AACxD;AAGA,SAAgB,EAAU,GAAoD;CAC5E,IAAI,CAAC,EAAY,CAAK,GAAG,OAAO;CAChC,IAAM,CAAC,GAAG,KAAK,EAAM,MAAM,GAAG;CAC9B,OAAO;EAAE,MAAM,OAAO,CAAC;EAAG,QAAQ,OAAO,CAAC;CAAE;AAC9C;AAGA,SAAgB,EAAW,GAAc,GAAwB;CAC/D,OAAO,GAAG,EAAK,CAAI,EAAE,GAAG,EAAK,CAAM;AACrC;AAEA,IAAM,oBAAiB,IAAI,IAAwB;AAQnD,SAAgB,EAAa,GAA4B;CACvD,OAAO,EAAK,GAAgB,SAAc,EAAiB,CAAM,CAAC;AACpE;AAEA,SAAS,EAAiB,GAA4B;CACpD,IAAI;EACF,IAAM,EAAE,iBAAc,IAAI,KAAK,eAAe,GAAQ,EAAE,MAAM,UAAU,CAAC,CAAC,CAAC,gBAAgB;EAC3F,OAAO,MAAc,SAAS,MAAc,QAAQ,QAAQ;CAC9D,QAAQ;EACN,OAAO;CACT;AACF;AAGA,IAAM,oBAAoB,IAAI,IAAiC;AAE/D,SAAS,EAAoB,GAAgB,GAAyC;CACpF,OAAO,EACL,GACA,GAAG,EAAO,GAAG,WAEX,IAAI,KAAK,eAAe,GAAQ;EAC9B,MAAM;EACN,QAAQ;EAGR,GAAI,MAAW,QAAQ,EAAE,QAAQ,GAAK,IAAI,EAAE,WAAW,MAAe;EACtE,UAAU;CACZ,CAAC,CACL;AACF;AAGA,SAAgB,EAAkB,GAAc,GAAgB,GAA4B;CAC1F,IAAM,IAAQ,EAAU,CAAI;CAE5B,OADK,IACE,EAAoB,GAAQ,CAAM,CAAC,CAAC,OAAO,KAAK,IAAI,MAAM,GAAG,GAAG,EAAM,MAAM,EAAM,MAAM,CAAC,IAD7E;AAErB;AAGA,SAAgB,EAAU,GAAgD;CACxE,IAAM,IAAQ,EAAU,CAAI;CAC5B,OAAO,IAAQ,EAAM,OAAO,KAAK,EAAM,SAAS;AAClD"}

package/dist/utils/vnode.d.ts

@@ -2,15 +2,5 @@ import { VNode } from 'vue';
 /**
  * A slot's VNodes reduced to the elements that will actually render: `v-for` Fragments
  * unwrapped, a false `v-if`'s Comment and the source text's whitespace dropped.
- *
- * This is what lets a component count its children without a registry they feed at mount.
- * A registry fills up in the browser and stays empty on the server, so the two renders
- * disagree: VAvatarGroup would say "+0" in one and "+3" in the other. Reading the slot
- * happens while the parent renders, which is the same on both sides.
- *
- * Components never call it on a slot directly: they go through `composables/useSlotNodes`,
- * which redoes the read whenever the parent hands down a new slot. Its consumers are
- * VAvatarGroup for its "+N", VCarousel for its slide count and the index each slide is
- * handed, and VInputGroup for its dev warning on a segment carrying a label.
  */
 export declare function flattenSlot(nodes: VNode[] | undefined): VNode[];

package/dist/utils/vnode.js.map

@@ -1 +1 @@
-{"version":3,"file":"vnode.js","names":[],"sources":["../../src/utils/vnode.ts"],"sourcesContent":["import { Comment, Fragment, Text } from 'vue'\nimport type { VNode } from 'vue'\n\n// @ssr @core\n/**\n * A slot's VNodes reduced to the elements that will actually render: `v-for` Fragments\n * unwrapped, a false `v-if`'s Comment and the source text's whitespace dropped.\n *\n * This is what lets a component count its children without a registry they feed at mount.\n * A registry fills up in the browser and stays empty on the server, so the two renders\n * disagree: VAvatarGroup would say \"+0\" in one and \"+3\" in the other. Reading the slot\n * happens while the parent renders, which is the same on both sides.\n *\n * Components never call it on a slot directly: they go through `composables/useSlotNodes`,\n * which redoes the read whenever the parent hands down a new slot. Its consumers are\n * VAvatarGroup for its \"+N\", VCarousel for its slide count and the index each slide is\n * handed, and VInputGroup for its dev warning on a segment carrying a label.\n */\nexport function flattenSlot(nodes: VNode[] | undefined): VNode[] {\n  const out: VNode[] = []\n  for (const node of nodes ?? []) {\n    if (node.type === Fragment) out.push(...flattenSlot(node.children as VNode[]))\n    else if (node.type === Comment) continue\n    else if (node.type === Text && !String(node.children).trim()) continue\n    else out.push(node)\n  }\n  return out\n}\n"],"mappings":";;AAkBA,SAAgB,EAAY,GAAqC;CAC/D,IAAM,IAAe,CAAC;CACtB,KAAK,IAAM,KAAQ,KAAS,CAAC,GAC3B,IAAI,EAAK,SAAS,GAAU,EAAI,KAAK,GAAG,EAAY,EAAK,QAAmB,CAAC;MACxE,IAAI,EAAK,SAAS,GAAS;MAC3B,IAAI,EAAK,SAAS,KAAQ,CAAC,OAAO,EAAK,QAAQ,CAAC,CAAC,KAAK,GAAG;MACzD,EAAI,KAAK,CAAI;CAEpB,OAAO;AACT"}
+{"version":3,"file":"vnode.js","names":[],"sources":["../../src/utils/vnode.ts"],"sourcesContent":["import { Comment, Fragment, Text } from 'vue'\nimport type { VNode } from 'vue'\n\n// @ssr @core\n/**\n * A slot's VNodes reduced to the elements that will actually render: `v-for` Fragments\n * unwrapped, a false `v-if`'s Comment and the source text's whitespace dropped.\n */\nexport function flattenSlot(nodes: VNode[] | undefined): VNode[] {\n  const out: VNode[] = []\n  for (const node of nodes ?? []) {\n    if (node.type === Fragment) out.push(...flattenSlot(node.children as VNode[]))\n    else if (node.type === Comment) continue\n    else if (node.type === Text && !String(node.children).trim()) continue\n    else out.push(node)\n  }\n  return out\n}\n"],"mappings":";;AAQA,SAAgB,EAAY,GAAqC;CAC/D,IAAM,IAAe,CAAC;CACtB,KAAK,IAAM,KAAQ,KAAS,CAAC,GAC3B,IAAI,EAAK,SAAS,GAAU,EAAI,KAAK,GAAG,EAAY,EAAK,QAAmB,CAAC;MACxE,IAAI,EAAK,SAAS,GAAS;MAC3B,IAAI,EAAK,SAAS,KAAQ,CAAC,OAAO,EAAK,QAAQ,CAAC,CAAC,KAAK,GAAG;MACzD,EAAI,KAAK,CAAI;CAEpB,OAAO;AACT"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "vectis-ui",
-  "version": "0.10.1",
+  "version": "0.10.2",
   "description": "Vue 3 design system — HTML/CSS first, CSS tokens, Nuxt 3 (SSR) compatible",
   "type": "module",
   "license": "MIT",