@aglyn/aglyn 1.0.0-beta.221 → 1.0.0-beta.222

package/src/lib/data-transfer/package.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../libs/aglyn/src/lib/data-transfer/package.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/*==========================================\n * PACKAGES — site items (pages, layouts, components, emails…) carried as one file.\n *\n * A package is a manifest and the items it lists. Each manifest entry\n * names the item's kind and id, its slug or name, a content hash, and the\n * items it depends on (a page on its layout, a layout on its components).\n *\n * ## Content hashes\n *\n * `sha256:` + the hex SHA-256 of the item's stable JSON — keys sorted at\n * every depth, `undefined` dropped — through WebCrypto, which both the\n * browser and Node provide. Equal hashes mean an import would change\n * nothing, so the item is `identical` and skipped by default.\n *\n * ## Importing an item\n *\n * Each item is matched to what the site already holds — by id, then slug,\n * then name, within its kind — and is `new`, `identical` or `differs`;\n * an item whose dependencies are neither in the package nor on the site is\n * flagged `missingDependency`. For a colliding item the person chooses:\n * replace it (as a new version), keep both (a new id and slug), skip it,\n * or merge it (for the kinds that merge key by key, like site settings).\n *=========================================*/\n\n/** The format tag every package carries. */\nexport const TRANSFER_PACKAGE_FORMAT = 'aglyn-package'\n\n/** The manifest version this module reads and writes. */\nexport const TRANSFER_PACKAGE_VERSION = 2\n\n/** An item another item needs. */\nexport interface PackageDependency {\n  kind: string\n  id: string\n}\n\n/** One item as the manifest lists it. */\nexport interface PackageManifestItem {\n  kind: string\n  $id: string\n  slug?: string\n  name?: string\n  contentHash: string\n  deps: PackageDependency[]\n}\n\nexport interface PackageManifest {\n  format: typeof TRANSFER_PACKAGE_FORMAT\n  version: typeof TRANSFER_PACKAGE_VERSION\n  items: PackageManifestItem[]\n  /** When the package was made (ms since epoch). */\n  createdAt?: number\n  /** Where it came from, for the import screen (\"Site: Acme\"). */\n  source?: string\n}\n\n/** A whole package: the manifest and each item's content by {@link packageItemKey}. */\nexport interface TransferPackage<T = unknown> {\n  manifest: PackageManifest\n  items: Record<string, T>\n}\n\n/** The key an item is filed under: `<kind>/<id>`. */\nexport function packageItemKey(item: { kind: string; $id?: string; id?: string }): string {\n  return `${item.kind}/${item.$id ?? item.id ?? ''}`\n}\n\n/**\n * JSON with every object's keys sorted, at every depth, and `undefined`\n * dropped (as `JSON.stringify` drops it). Dates are their ISO string;\n * a non-finite number is `null`. Two values that are the same data are\n * the same text, whatever order their keys were written in.\n */\nexport function stableJson(value: unknown): string {\n  return JSON.stringify(canonical(value)) ?? 'null'\n}\n\nfunction canonical(value: unknown): unknown {\n  if (value === null || value === undefined) return value\n  if (value instanceof Date) return value.toISOString()\n  if (typeof value === 'number') return Number.isFinite(value) ? value : null\n  if (Array.isArray(value)) return value.map((entry) => (entry === undefined ? null : canonical(entry)))\n  if (typeof value === 'object') {\n    const source = value as Record<string, unknown>\n    const sorted: Record<string, unknown> = {}\n    for (const key of Object.keys(source).sort()) {\n      if (source[key] === undefined) continue\n      sorted[key] = canonical(source[key])\n    }\n    return sorted\n  }\n  return value\n}\n\n/** The hash prefix every content hash carries. */\nexport const CONTENT_HASH_PREFIX = 'sha256:'\n\n/**\n * The content hash of a value: `sha256:` + hex of its {@link stableJson}.\n * Uses WebCrypto (`globalThis.crypto.subtle`), present in browsers and Node.\n */\nexport async function contentHash(value: unknown): Promise<string> {\n  const subtle = globalThis.crypto?.subtle\n  if (!subtle) throw new Error('Content hashing needs WebCrypto (crypto.subtle).')\n  const bytes = new TextEncoder().encode(stableJson(value))\n  const digest = await subtle.digest('SHA-256', bytes)\n  return CONTENT_HASH_PREFIX + [...new Uint8Array(digest)].map((byte) => byte.toString(16).padStart(2, '0')).join('')\n}\n\n/** A manifest read from a file, or why it cannot be. */\nexport type PackageManifestRead = { ok: true; manifest: PackageManifest } | { ok: false; problems: string[] }\n\n/**\n * A manifest from untrusted JSON. Every problem is reported, not just the\n * first: a wrong format or version, an item without a kind, id or hash, a\n * malformed dependency, an id listed twice.\n */\nexport function readPackageManifest(raw: unknown): PackageManifestRead {\n  const problems: string[] = []\n  if (!raw || typeof raw !== 'object') return { ok: false, problems: ['The file is not a package.'] }\n  const source = raw as Record<string, unknown>\n  if (source['format'] !== TRANSFER_PACKAGE_FORMAT) {\n    problems.push(`The file's format is ${JSON.stringify(source['format'] ?? null)}, not \"${TRANSFER_PACKAGE_FORMAT}\".`)\n  }\n  if (source['version'] !== TRANSFER_PACKAGE_VERSION) {\n    problems.push(`The package is version ${String(source['version'])}; this reads version ${TRANSFER_PACKAGE_VERSION}.`)\n  }\n  if (!Array.isArray(source['items'])) problems.push('The package lists no items.')\n  const items: PackageManifestItem[] = []\n  const seen = new Set<string>()\n  for (const [index, entry] of (Array.isArray(source['items']) ? source['items'] : []).entries()) {\n    const item = (entry ?? {}) as Record<string, unknown>\n    const where = `Item ${index + 1}`\n    const kind = typeof item['kind'] === 'string' ? item['kind'].trim() : ''\n    const id = typeof item['$id'] === 'string' ? item['$id'].trim() : ''\n    const hash = typeof item['contentHash'] === 'string' ? item['contentHash'] : ''\n    if (!kind) problems.push(`${where} has no kind.`)\n    if (!id) problems.push(`${where} has no id.`)\n    if (!hash.startsWith(CONTENT_HASH_PREFIX)) problems.push(`${where} has no content hash.`)\n    const deps: PackageDependency[] = []\n    for (const dep of Array.isArray(item['deps']) ? item['deps'] : []) {\n      const d = (dep ?? {}) as Record<string, unknown>\n      if (typeof d['kind'] === 'string' && d['kind'] && typeof d['id'] === 'string' && d['id']) {\n        deps.push({ kind: d['kind'], id: d['id'] })\n      } else {\n        problems.push(`${where} has a dependency without a kind and id.`)\n      }\n    }\n    if (item['deps'] !== undefined && !Array.isArray(item['deps'])) problems.push(`${where} has dependencies that are not a list.`)\n    const key = `${kind}/${id}`\n    if (kind && id && seen.has(key)) problems.push(`${where} repeats ${key}.`)\n    seen.add(key)\n    items.push({\n      kind,\n      $id: id,\n      ...(typeof item['slug'] === 'string' ? { slug: item['slug'] } : {}),\n      ...(typeof item['name'] === 'string' ? { name: item['name'] } : {}),\n      contentHash: hash,\n      deps,\n    })\n  }\n  if (problems.length) return { ok: false, problems }\n  return {\n    ok: true,\n    manifest: {\n      format: TRANSFER_PACKAGE_FORMAT,\n      version: TRANSFER_PACKAGE_VERSION,\n      items,\n      ...(typeof source['createdAt'] === 'number' ? { createdAt: source['createdAt'] } : {}),\n      ...(typeof source['source'] === 'string' ? { source: source['source'] } : {}),\n    },\n  }\n}\n\n/** A dependency that is not in the package (and, where asked, not on the site). */\nexport interface MissingPackageDependency {\n  /** The item that needs it, by {@link packageItemKey}. */\n  item: string\n  dependency: PackageDependency\n}\n\n/** The items in an order that installs every dependency before what needs it. */\nexport interface PackageDependencyOrder {\n  order: PackageManifestItem[]\n  missing: MissingPackageDependency[]\n  /** Each cycle as item keys; its items are appended to `order` in manifest order. */\n  cycles: string[][]\n}\n\n/**\n * Dependencies first (Kahn's algorithm, ties in manifest order). A\n * dependency outside the package is reported as missing unless `available`\n * says the site has it. Items on a cycle cannot be ordered: each strongly\n * connected group is reported and its items appended last.\n */\nexport function packageDependencyOrder(\n  items: readonly PackageManifestItem[],\n  available: (dependency: PackageDependency) => boolean = () => false,\n): PackageDependencyOrder {\n  const byKey = new Map(items.map((item) => [packageItemKey(item), item]))\n  const missing: MissingPackageDependency[] = []\n  const needs = new Map<string, Set<string>>()\n  const neededBy = new Map<string, string[]>()\n  for (const item of items) {\n    const key = packageItemKey(item)\n    const set = new Set<string>()\n    for (const dep of item.deps) {\n      const depKey = packageItemKey(dep)\n      if (byKey.has(depKey)) {\n        if (!set.has(depKey)) {\n          set.add(depKey)\n          neededBy.set(depKey, [...(neededBy.get(depKey) ?? []), key])\n        }\n      } else if (!available(dep)) {\n        missing.push({ item: key, dependency: dep })\n      }\n    }\n    needs.set(key, set)\n  }\n  const order: PackageManifestItem[] = []\n  const placed = new Set<string>()\n  const position = new Map(items.map((item, at) => [packageItemKey(item), at]))\n  const byPosition = (a: string, b: string): number => (position.get(a) ?? 0) - (position.get(b) ?? 0)\n  const ready = items.filter((item) => needs.get(packageItemKey(item))?.size === 0).map(packageItemKey)\n  while (ready.length) {\n    // Ties go in manifest order: the earliest ready item is placed next.\n    ready.sort(byPosition)\n    const key = ready.shift() as string\n    if (placed.has(key)) continue\n    placed.add(key)\n    order.push(byKey.get(key) as PackageManifestItem)\n    for (const dependent of neededBy.get(key) ?? []) {\n      const set = needs.get(dependent) as Set<string>\n      set.delete(key)\n      if (set.size === 0) ready.push(dependent)\n    }\n  }\n  const rest = items.filter((item) => !placed.has(packageItemKey(item)))\n  const cycles = stronglyConnected(rest, byKey).filter(\n    (group) => group.length > 1 || (byKey.get(group[0] as string)?.deps.some((dep) => packageItemKey(dep) === group[0]) ?? false),\n  )\n  return { order: [...order, ...rest], missing, cycles }\n}\n\n/** Tarjan's strongly connected components over the given items' in-package edges. */\nfunction stronglyConnected(\n  items: readonly PackageManifestItem[],\n  byKey: ReadonlyMap<string, PackageManifestItem>,\n): string[][] {\n  const keys = new Set(items.map(packageItemKey))\n  const index = new Map<string, number>()\n  const low = new Map<string, number>()\n  const stack: string[] = []\n  const onStack = new Set<string>()\n  const groups: string[][] = []\n  let counter = 0\n  const visit = (key: string): void => {\n    index.set(key, counter)\n    low.set(key, counter)\n    counter += 1\n    stack.push(key)\n    onStack.add(key)\n    for (const dep of byKey.get(key)?.deps ?? []) {\n      const next = packageItemKey(dep)\n      if (!keys.has(next)) continue\n      if (!index.has(next)) {\n        visit(next)\n        low.set(key, Math.min(low.get(key) as number, low.get(next) as number))\n      } else if (onStack.has(next)) {\n        low.set(key, Math.min(low.get(key) as number, index.get(next) as number))\n      }\n    }\n    if (low.get(key) === index.get(key)) {\n      const group: string[] = []\n      let member: string | undefined\n      do {\n        member = stack.pop() as string\n        onStack.delete(member)\n        group.push(member)\n      } while (member !== key)\n      groups.push(group.reverse())\n    }\n  }\n  for (const key of keys) if (!index.has(key)) visit(key)\n  return groups\n}\n\n/**\n * The selected items and everything they depend on inside the package,\n * transitively — the export picker's \"include dependencies\". Returns keys\n * in manifest order.\n */\nexport function packageDependencyClosure(\n  items: readonly PackageManifestItem[],\n  selected: Iterable<string>,\n): string[] {\n  const byKey = new Map(items.map((item) => [packageItemKey(item), item]))\n  const included = new Set<string>()\n  const queue = [...selected].filter((key) => byKey.has(key))\n  while (queue.length) {\n    const key = queue.pop() as string\n    if (included.has(key)) continue\n    included.add(key)\n    for (const dep of byKey.get(key)?.deps ?? []) {\n      const depKey = packageItemKey(dep)\n      if (byKey.has(depKey) && !included.has(depKey)) queue.push(depKey)\n    }\n  }\n  return items.map(packageItemKey).filter((key) => included.has(key))\n}\n\n/** An item the site already holds. */\nexport interface ExistingPackageItem {\n  kind: string\n  id: string\n  slug?: string\n  name?: string\n  contentHash: string\n}\n\n/** How an incoming item compares with what the site holds. */\nexport type PackageItemComparison = 'new' | 'identical' | 'differs'\n\n/** The status the import screen shows: the comparison, unless a dependency is missing. */\nexport type PackageItemStatus = PackageItemComparison | 'missingDependency'\n\nexport interface PackageItemMatch {\n  item: PackageManifestItem\n  status: PackageItemStatus\n  comparison: PackageItemComparison\n  existing?: ExistingPackageItem\n  matchedBy?: 'id' | 'slug' | 'name'\n  /** Dependencies neither in the package nor on the site. */\n  missing: PackageDependency[]\n}\n\nfunction caseless(value: string | undefined): string {\n  return String(value ?? '').trim().toLowerCase()\n}\n\n/**\n * Every manifest item against what the site holds: matched by id, then\n * slug, then name, within its kind; compared by content hash; and checked\n * for dependencies that exist in neither place.\n */\nexport function matchPackageItems(\n  manifest: Pick<PackageManifest, 'items'>,\n  existing: readonly ExistingPackageItem[],\n): PackageItemMatch[] {\n  const inPackage = new Set(manifest.items.map(packageItemKey))\n  const onSite = new Set(existing.map((item) => `${item.kind}/${item.id}`))\n  return manifest.items.map((item) => {\n    const sameKind = existing.filter((entry) => entry.kind === item.kind)\n    let found: ExistingPackageItem | undefined = sameKind.find((entry) => entry.id === item.$id)\n    let matchedBy: PackageItemMatch['matchedBy'] = found ? 'id' : undefined\n    if (!found && item.slug) {\n      found = sameKind.find((entry) => entry.slug && caseless(entry.slug) === caseless(item.slug))\n      if (found) matchedBy = 'slug'\n    }\n    if (!found && item.name) {\n      found = sameKind.find((entry) => entry.name && caseless(entry.name) === caseless(item.name))\n      if (found) matchedBy = 'name'\n    }\n    const comparison: PackageItemComparison = !found ? 'new' : found.contentHash === item.contentHash ? 'identical' : 'differs'\n    const missing = item.deps.filter((dep) => {\n      const key = packageItemKey(dep)\n      return !inPackage.has(key) && !onSite.has(key)\n    })\n    return {\n      item,\n      status: missing.length ? 'missingDependency' : comparison,\n      comparison,\n      ...(found ? { existing: found, matchedBy } : {}),\n      missing,\n    }\n  })\n}\n\n/** What to do with an incoming item that collides with one the site holds. */\nexport type PackageCollisionChoice = 'replace' | 'keepBoth' | 'skip' | 'merge'\n\n/** What to do with an item: create it (new), or a collision choice. */\nexport type PackageItemDecision = 'create' | PackageCollisionChoice\n\n/** What to do about a dependency the package and the site both lack. */\nexport type PackageMissingDependencyChoice =\n  | { action: 'mapTo'; id: string }\n  | { action: 'dropReference' }\n  | { action: 'skipItem' }\n\n/**\n * The decision proposed before the person chooses: create a new item, skip\n * an identical one, and skip a differing one — replacing is never assumed;\n * `needsChoice` marks the items the person must decide.\n */\nexport function proposePackageDecision(match: PackageItemMatch): { decision: PackageItemDecision; needsChoice: boolean } {\n  if (match.comparison === 'new') return { decision: 'create', needsChoice: match.missing.length > 0 }\n  if (match.comparison === 'identical') return { decision: 'skip', needsChoice: match.missing.length > 0 }\n  return { decision: 'skip', needsChoice: true }\n}\n\n/** The decisions an item may take; `merge` only for kinds that merge key by key. */\nexport function packageDecisionsFor(match: PackageItemMatch, mergeable = false): PackageItemDecision[] {\n  if (match.comparison === 'new') return ['create', 'skip']\n  return mergeable ? ['replace', 'keepBoth', 'skip', 'merge'] : ['replace', 'keepBoth', 'skip']\n}\n\n/**\n * The slug a kept-both copy takes: `<slug>-copy`, then `-copy-2`, `-copy-3`…\n * until none of `taken` (compared caselessly).\n */\nexport function keepBothSlug(slug: string, taken: Iterable<string>): string {\n  const used = new Set([...taken].map(caseless))\n  const base = `${slug.replace(/-copy(?:-\\d+)?$/, '')}-copy`\n  if (!used.has(caseless(base))) return base\n  for (let n = 2; ; n += 1) {\n    const candidate = `${base}-${n}`\n    if (!used.has(caseless(candidate))) return candidate\n  }\n}\n\n/**\n * The manifest for a set of items. Hashes each item's content; `deps` and\n * the slug and name come from `describe`. Items are listed in the order given.\n */\nexport async function buildPackageManifest<T>(\n  items: readonly { kind: string; id: string; content: T }[],\n  describe: (item: { kind: string; id: string; content: T }) => {\n    slug?: string\n    name?: string\n    deps?: PackageDependency[]\n  } = () => ({}),\n  meta: Pick<PackageManifest, 'createdAt' | 'source'> = {},\n): Promise<TransferPackage<T>> {\n  const entries: PackageManifestItem[] = []\n  const contents: Record<string, T> = {}\n  for (const item of items) {\n    const described = describe(item)\n    const entry: PackageManifestItem = {\n      kind: item.kind,\n      $id: item.id,\n      ...(described.slug ? { slug: described.slug } : {}),\n      ...(described.name ? { name: described.name } : {}),\n      contentHash: await contentHash(item.content),\n      deps: described.deps ?? [],\n    }\n    entries.push(entry)\n    contents[packageItemKey(entry)] = item.content\n  }\n  return {\n    manifest: { format: TRANSFER_PACKAGE_FORMAT, version: TRANSFER_PACKAGE_VERSION, items: entries, ...meta },\n    items: contents,\n  }\n}\n"],"names":["TRANSFER_PACKAGE_FORMAT","TRANSFER_PACKAGE_VERSION","packageItemKey","item","kind","$id","id","stableJson","value","JSON","stringify","canonical","undefined","Date","toISOString","Number","isFinite","Array","isArray","map","entry","source","sorted","key","Object","keys","sort","CONTENT_HASH_PREFIX","contentHash","globalThis","subtle","crypto","Error","bytes","TextEncoder","encode","digest","Uint8Array","byte","toString","padStart","join","readPackageManifest","raw","problems","ok","push","String","items","seen","Set","index","entries","where","trim","hash","startsWith","deps","dep","d","has","add","slug","name","length","manifest","format","version","createdAt","packageDependencyOrder","available","byKey","Map","missing","needs","neededBy","set","depKey","get","dependency","order","placed","position","at","byPosition","a","b","ready","filter","size","shift","dependent","delete","rest","cycles","stronglyConnected","group","some","low","stack","onStack","groups","counter","visit","next","Math","min","member","pop","reverse","packageDependencyClosure","selected","included","queue","caseless","toLowerCase","matchPackageItems","existing","inPackage","onSite","sameKind","found","find","matchedBy","comparison","status","proposePackageDecision","match","decision","needsChoice","packageDecisionsFor","mergeable","keepBothSlug","taken","used","base","replace","n","candidate","buildPackageManifest","describe","meta","contents","described","content"],"mappings":";AAAA;;;;;;;;;;;;;;;CAeC,GAED;;;;;;;;;;;;;;;;;;;;;;2CAsB2C,GAE3C,0CAA0C,GAC1C,OAAO,MAAMA,0BAA0B,gBAAe;AAEtD,uDAAuD,GACvD,OAAO,MAAMC,2BAA2B,EAAC;AAkCzC,mDAAmD,GACnD,OAAO,SAASC,eAAeC,IAAiD;QACvDA,MAAAA;IAAvB,OAAO,GAAGA,KAAKC,IAAI,CAAC,CAAC,GAAED,QAAAA,YAAAA,KAAKE,GAAG,YAARF,YAAYA,KAAKG,EAAE,YAAnBH,OAAuB,IAAI;AACpD;AAEA;;;;;CAKC,GACD,OAAO,SAASI,WAAWC,KAAc;QAChCC;IAAP,QAAOA,kBAAAA,KAAKC,SAAS,CAACC,UAAUH,mBAAzBC,kBAAoC;AAC7C;AAEA,SAASE,UAAUH,KAAc;IAC/B,IAAIA,UAAU,QAAQA,UAAUI,WAAW,OAAOJ;IAClD,IAAIA,iBAAiBK,MAAM,OAAOL,MAAMM,WAAW;IACnD,IAAI,OAAON,UAAU,UAAU,OAAOO,OAAOC,QAAQ,CAACR,SAASA,QAAQ;IACvE,IAAIS,MAAMC,OAAO,CAACV,QAAQ,OAAOA,MAAMW,GAAG,CAAC,CAACC,QAAWA,UAAUR,YAAY,OAAOD,UAAUS;IAC9F,IAAI,OAAOZ,UAAU,UAAU;QAC7B,MAAMa,SAASb;QACf,MAAMc,SAAkC,CAAC;QACzC,KAAK,MAAMC,OAAOC,OAAOC,IAAI,CAACJ,QAAQK,IAAI,GAAI;YAC5C,IAAIL,MAAM,CAACE,IAAI,KAAKX,WAAW;YAC/BU,MAAM,CAACC,IAAI,GAAGZ,UAAUU,MAAM,CAACE,IAAI;QACrC;QACA,OAAOD;IACT;IACA,OAAOd;AACT;AAEA,gDAAgD,GAChD,OAAO,MAAMmB,sBAAsB,UAAS;AAE5C;;;CAGC,GACD,OAAO,eAAeC,YAAYpB,KAAc;QAC/BqB;IAAf,MAAMC,UAASD,qBAAAA,WAAWE,MAAM,qBAAjBF,mBAAmBC,MAAM;IACxC,IAAI,CAACA,QAAQ,MAAM,IAAIE,MAAM;IAC7B,MAAMC,QAAQ,IAAIC,cAAcC,MAAM,CAAC5B,WAAWC;IAClD,MAAM4B,SAAS,MAAMN,OAAOM,MAAM,CAAC,WAAWH;IAC9C,OAAON,sBAAsB;WAAI,IAAIU,WAAWD;KAAQ,CAACjB,GAAG,CAAC,CAACmB,OAASA,KAAKC,QAAQ,CAAC,IAAIC,QAAQ,CAAC,GAAG,MAAMC,IAAI,CAAC;AAClH;AAKA;;;;CAIC,GACD,OAAO,SAASC,oBAAoBC,GAAY;IAC9C,MAAMC,WAAqB,EAAE;IAC7B,IAAI,CAACD,OAAO,OAAOA,QAAQ,UAAU,OAAO;QAAEE,IAAI;QAAOD,UAAU;YAAC;SAA6B;IAAC;IAClG,MAAMvB,SAASsB;IACf,IAAItB,MAAM,CAAC,SAAS,KAAKrB,yBAAyB;YACKqB;QAArDuB,SAASE,IAAI,CAAC,CAAC,qBAAqB,EAAErC,KAAKC,SAAS,EAACW,iBAAAA,MAAM,CAAC,SAAS,YAAhBA,iBAAoB,MAAM,OAAO,EAAErB,wBAAwB,EAAE,CAAC;IACrH;IACA,IAAIqB,MAAM,CAAC,UAAU,KAAKpB,0BAA0B;QAClD2C,SAASE,IAAI,CAAC,CAAC,uBAAuB,EAAEC,OAAO1B,MAAM,CAAC,UAAU,EAAE,qBAAqB,EAAEpB,yBAAyB,CAAC,CAAC;IACtH;IACA,IAAI,CAACgB,MAAMC,OAAO,CAACG,MAAM,CAAC,QAAQ,GAAGuB,SAASE,IAAI,CAAC;IACnD,MAAME,QAA+B,EAAE;IACvC,MAAMC,OAAO,IAAIC;IACjB,KAAK,MAAM,CAACC,OAAO/B,MAAM,IAAI,AAACH,CAAAA,MAAMC,OAAO,CAACG,MAAM,CAAC,QAAQ,IAAIA,MAAM,CAAC,QAAQ,GAAG,EAAE,AAAD,EAAG+B,OAAO,GAAI;QAC9F,MAAMjD,OAAQiB,gBAAAA,QAAS,CAAC;QACxB,MAAMiC,QAAQ,CAAC,KAAK,EAAEF,QAAQ,GAAG;QACjC,MAAM/C,OAAO,OAAOD,IAAI,CAAC,OAAO,KAAK,WAAWA,IAAI,CAAC,OAAO,CAACmD,IAAI,KAAK;QACtE,MAAMhD,KAAK,OAAOH,IAAI,CAAC,MAAM,KAAK,WAAWA,IAAI,CAAC,MAAM,CAACmD,IAAI,KAAK;QAClE,MAAMC,OAAO,OAAOpD,IAAI,CAAC,cAAc,KAAK,WAAWA,IAAI,CAAC,cAAc,GAAG;QAC7E,IAAI,CAACC,MAAMwC,SAASE,IAAI,CAAC,GAAGO,MAAM,aAAa,CAAC;QAChD,IAAI,CAAC/C,IAAIsC,SAASE,IAAI,CAAC,GAAGO,MAAM,WAAW,CAAC;QAC5C,IAAI,CAACE,KAAKC,UAAU,CAAC7B,sBAAsBiB,SAASE,IAAI,CAAC,GAAGO,MAAM,qBAAqB,CAAC;QACxF,MAAMI,OAA4B,EAAE;QACpC,KAAK,MAAMC,OAAOzC,MAAMC,OAAO,CAACf,IAAI,CAAC,OAAO,IAAIA,IAAI,CAAC,OAAO,GAAG,EAAE,CAAE;YACjE,MAAMwD,IAAKD,cAAAA,MAAO,CAAC;YACnB,IAAI,OAAOC,CAAC,CAAC,OAAO,KAAK,YAAYA,CAAC,CAAC,OAAO,IAAI,OAAOA,CAAC,CAAC,KAAK,KAAK,YAAYA,CAAC,CAAC,KAAK,EAAE;gBACxFF,KAAKX,IAAI,CAAC;oBAAE1C,MAAMuD,CAAC,CAAC,OAAO;oBAAErD,IAAIqD,CAAC,CAAC,KAAK;gBAAC;YAC3C,OAAO;gBACLf,SAASE,IAAI,CAAC,GAAGO,MAAM,wCAAwC,CAAC;YAClE;QACF;QACA,IAAIlD,IAAI,CAAC,OAAO,KAAKS,aAAa,CAACK,MAAMC,OAAO,CAACf,IAAI,CAAC,OAAO,GAAGyC,SAASE,IAAI,CAAC,GAAGO,MAAM,sCAAsC,CAAC;QAC9H,MAAM9B,MAAM,GAAGnB,KAAK,CAAC,EAAEE,IAAI;QAC3B,IAAIF,QAAQE,MAAM2C,KAAKW,GAAG,CAACrC,MAAMqB,SAASE,IAAI,CAAC,GAAGO,MAAM,SAAS,EAAE9B,IAAI,CAAC,CAAC;QACzE0B,KAAKY,GAAG,CAACtC;QACTyB,MAAMF,IAAI,CAAC;YACT1C;YACAC,KAAKC;WACD,OAAOH,IAAI,CAAC,OAAO,KAAK,WAAW;YAAE2D,MAAM3D,IAAI,CAAC,OAAO;QAAC,IAAI,CAAC,GAC7D,OAAOA,IAAI,CAAC,OAAO,KAAK,WAAW;YAAE4D,MAAM5D,IAAI,CAAC,OAAO;QAAC,IAAI,CAAC;YACjEyB,aAAa2B;YACbE;;IAEJ;IACA,IAAIb,SAASoB,MAAM,EAAE,OAAO;QAAEnB,IAAI;QAAOD;IAAS;IAClD,OAAO;QACLC,IAAI;QACJoB,UAAU;YACRC,QAAQlE;YACRmE,SAASlE;YACT+C;WACI,OAAO3B,MAAM,CAAC,YAAY,KAAK,WAAW;YAAE+C,WAAW/C,MAAM,CAAC,YAAY;QAAC,IAAI,CAAC,GAChF,OAAOA,MAAM,CAAC,SAAS,KAAK,WAAW;YAAEA,QAAQA,MAAM,CAAC,SAAS;QAAC,IAAI,CAAC;IAE/E;AACF;AAiBA;;;;;CAKC,GACD,OAAO,SAASgD,uBACdrB,KAAqC,EACrCsB,YAAwD,IAAM,KAAK;IAEnE,MAAMC,QAAQ,IAAIC,IAAIxB,MAAM7B,GAAG,CAAC,CAAChB,OAAS;YAACD,eAAeC;YAAOA;SAAK;IACtE,MAAMsE,UAAsC,EAAE;IAC9C,MAAMC,QAAQ,IAAIF;IAClB,MAAMG,WAAW,IAAIH;IACrB,KAAK,MAAMrE,QAAQ6C,MAAO;QACxB,MAAMzB,MAAMrB,eAAeC;QAC3B,MAAMyE,MAAM,IAAI1B;QAChB,KAAK,MAAMQ,OAAOvD,KAAKsD,IAAI,CAAE;YAC3B,MAAMoB,SAAS3E,eAAewD;YAC9B,IAAIa,MAAMX,GAAG,CAACiB,SAAS;gBACrB,IAAI,CAACD,IAAIhB,GAAG,CAACiB,SAAS;wBAEMF;oBAD1BC,IAAIf,GAAG,CAACgB;oBACRF,SAASC,GAAG,CAACC,QAAQ;4BAAKF,gBAAAA,SAASG,GAAG,CAACD,mBAAbF,gBAAwB,EAAE;wBAAGpD;qBAAI;gBAC7D;YACF,OAAO,IAAI,CAAC+C,UAAUZ,MAAM;gBAC1Be,QAAQ3B,IAAI,CAAC;oBAAE3C,MAAMoB;oBAAKwD,YAAYrB;gBAAI;YAC5C;QACF;QACAgB,MAAME,GAAG,CAACrD,KAAKqD;IACjB;IACA,MAAMI,QAA+B,EAAE;IACvC,MAAMC,SAAS,IAAI/B;IACnB,MAAMgC,WAAW,IAAIV,IAAIxB,MAAM7B,GAAG,CAAC,CAAChB,MAAMgF,KAAO;YAACjF,eAAeC;YAAOgF;SAAG;IAC3E,MAAMC,aAAa,CAACC,GAAWC;YAAuBJ,eAAyBA;eAA1B,EAACA,gBAAAA,SAASJ,GAAG,CAACO,cAAbH,gBAAmB,OAAMA,iBAAAA,SAASJ,GAAG,CAACQ,cAAbJ,iBAAmB;;IAClG,MAAMK,QAAQvC,MAAMwC,MAAM,CAAC,CAACrF;YAASuE;eAAAA,EAAAA,aAAAA,MAAMI,GAAG,CAAC5E,eAAeC,2BAAzBuE,WAAiCe,IAAI,MAAK;OAAGtE,GAAG,CAACjB;IACtF,MAAOqF,MAAMvB,MAAM,CAAE;YAOKW;QANxB,qEAAqE;QACrEY,MAAM7D,IAAI,CAAC0D;QACX,MAAM7D,MAAMgE,MAAMG,KAAK;QACvB,IAAIT,OAAOrB,GAAG,CAACrC,MAAM;QACrB0D,OAAOpB,GAAG,CAACtC;QACXyD,MAAMlC,IAAI,CAACyB,MAAMO,GAAG,CAACvD;QACrB,KAAK,MAAMoE,cAAahB,iBAAAA,SAASG,GAAG,CAACvD,gBAAboD,iBAAqB,EAAE,CAAE;YAC/C,MAAMC,MAAMF,MAAMI,GAAG,CAACa;YACtBf,IAAIgB,MAAM,CAACrE;YACX,IAAIqD,IAAIa,IAAI,KAAK,GAAGF,MAAMzC,IAAI,CAAC6C;QACjC;IACF;IACA,MAAME,OAAO7C,MAAMwC,MAAM,CAAC,CAACrF,OAAS,CAAC8E,OAAOrB,GAAG,CAAC1D,eAAeC;IAC/D,MAAM2F,SAASC,kBAAkBF,MAAMtB,OAAOiB,MAAM,CAClD,CAACQ;;YAA+BzB;eAArByB,MAAMhC,MAAM,GAAG,eAAMO,aAAAA,MAAMO,GAAG,CAACkB,KAAK,CAAC,EAAE,sBAAlBzB,WAA+Bd,IAAI,CAACwC,IAAI,CAAC,CAACvC,MAAQxD,eAAewD,SAASsC,KAAK,CAAC,EAAE,oBAAK;;IAEzH,OAAO;QAAEhB,OAAO;eAAIA;eAAUa;SAAK;QAAEpB;QAASqB;IAAO;AACvD;AAEA,mFAAmF,GACnF,SAASC,kBACP/C,KAAqC,EACrCuB,KAA+C;IAE/C,MAAM9C,OAAO,IAAIyB,IAAIF,MAAM7B,GAAG,CAACjB;IAC/B,MAAMiD,QAAQ,IAAIqB;IAClB,MAAM0B,MAAM,IAAI1B;IAChB,MAAM2B,QAAkB,EAAE;IAC1B,MAAMC,UAAU,IAAIlD;IACpB,MAAMmD,SAAqB,EAAE;IAC7B,IAAIC,UAAU;IACd,MAAMC,QAAQ,CAAChF;;YAMKgD;QALlBpB,MAAMyB,GAAG,CAACrD,KAAK+E;QACfJ,IAAItB,GAAG,CAACrD,KAAK+E;QACbA,WAAW;QACXH,MAAMrD,IAAI,CAACvB;QACX6E,QAAQvC,GAAG,CAACtC;QACZ,KAAK,MAAMmC,gBAAOa,aAAAA,MAAMO,GAAG,CAACvD,yBAAVgD,WAAgBd,IAAI,mBAAI,EAAE,CAAE;YAC5C,MAAM+C,OAAOtG,eAAewD;YAC5B,IAAI,CAACjC,KAAKmC,GAAG,CAAC4C,OAAO;YACrB,IAAI,CAACrD,MAAMS,GAAG,CAAC4C,OAAO;gBACpBD,MAAMC;gBACNN,IAAItB,GAAG,CAACrD,KAAKkF,KAAKC,GAAG,CAACR,IAAIpB,GAAG,CAACvD,MAAgB2E,IAAIpB,GAAG,CAAC0B;YACxD,OAAO,IAAIJ,QAAQxC,GAAG,CAAC4C,OAAO;gBAC5BN,IAAItB,GAAG,CAACrD,KAAKkF,KAAKC,GAAG,CAACR,IAAIpB,GAAG,CAACvD,MAAgB4B,MAAM2B,GAAG,CAAC0B;YAC1D;QACF;QACA,IAAIN,IAAIpB,GAAG,CAACvD,SAAS4B,MAAM2B,GAAG,CAACvD,MAAM;YACnC,MAAMyE,QAAkB,EAAE;YAC1B,IAAIW;YACJ,GAAG;gBACDA,SAASR,MAAMS,GAAG;gBAClBR,QAAQR,MAAM,CAACe;gBACfX,MAAMlD,IAAI,CAAC6D;YACb,QAASA,WAAWpF,IAAI;YACxB8E,OAAOvD,IAAI,CAACkD,MAAMa,OAAO;QAC3B;IACF;IACA,KAAK,MAAMtF,OAAOE,KAAM,IAAI,CAAC0B,MAAMS,GAAG,CAACrC,MAAMgF,MAAMhF;IACnD,OAAO8E;AACT;AAEA;;;;CAIC,GACD,OAAO,SAASS,yBACd9D,KAAqC,EACrC+D,QAA0B;IAE1B,MAAMxC,QAAQ,IAAIC,IAAIxB,MAAM7B,GAAG,CAAC,CAAChB,OAAS;YAACD,eAAeC;YAAOA;SAAK;IACtE,MAAM6G,WAAW,IAAI9D;IACrB,MAAM+D,QAAQ;WAAIF;KAAS,CAACvB,MAAM,CAAC,CAACjE,MAAQgD,MAAMX,GAAG,CAACrC;IACtD,MAAO0F,MAAMjD,MAAM,CAAE;;YAIDO;QAHlB,MAAMhD,MAAM0F,MAAML,GAAG;QACrB,IAAII,SAASpD,GAAG,CAACrC,MAAM;QACvByF,SAASnD,GAAG,CAACtC;QACb,KAAK,MAAMmC,gBAAOa,aAAAA,MAAMO,GAAG,CAACvD,yBAAVgD,WAAgBd,IAAI,mBAAI,EAAE,CAAE;YAC5C,MAAMoB,SAAS3E,eAAewD;YAC9B,IAAIa,MAAMX,GAAG,CAACiB,WAAW,CAACmC,SAASpD,GAAG,CAACiB,SAASoC,MAAMnE,IAAI,CAAC+B;QAC7D;IACF;IACA,OAAO7B,MAAM7B,GAAG,CAACjB,gBAAgBsF,MAAM,CAAC,CAACjE,MAAQyF,SAASpD,GAAG,CAACrC;AAChE;AA2BA,SAAS2F,SAAS1G,KAAyB;IACzC,OAAOuC,OAAOvC,gBAAAA,QAAS,IAAI8C,IAAI,GAAG6D,WAAW;AAC/C;AAEA;;;;CAIC,GACD,OAAO,SAASC,kBACdnD,QAAwC,EACxCoD,QAAwC;IAExC,MAAMC,YAAY,IAAIpE,IAAIe,SAASjB,KAAK,CAAC7B,GAAG,CAACjB;IAC7C,MAAMqH,SAAS,IAAIrE,IAAImE,SAASlG,GAAG,CAAC,CAAChB,OAAS,GAAGA,KAAKC,IAAI,CAAC,CAAC,EAAED,KAAKG,EAAE,EAAE;IACvE,OAAO2D,SAASjB,KAAK,CAAC7B,GAAG,CAAC,CAAChB;QACzB,MAAMqH,WAAWH,SAAS7B,MAAM,CAAC,CAACpE,QAAUA,MAAMhB,IAAI,KAAKD,KAAKC,IAAI;QACpE,IAAIqH,QAAyCD,SAASE,IAAI,CAAC,CAACtG,QAAUA,MAAMd,EAAE,KAAKH,KAAKE,GAAG;QAC3F,IAAIsH,YAA2CF,QAAQ,OAAO7G;QAC9D,IAAI,CAAC6G,SAAStH,KAAK2D,IAAI,EAAE;YACvB2D,QAAQD,SAASE,IAAI,CAAC,CAACtG,QAAUA,MAAM0C,IAAI,IAAIoD,SAAS9F,MAAM0C,IAAI,MAAMoD,SAAS/G,KAAK2D,IAAI;YAC1F,IAAI2D,OAAOE,YAAY;QACzB;QACA,IAAI,CAACF,SAAStH,KAAK4D,IAAI,EAAE;YACvB0D,QAAQD,SAASE,IAAI,CAAC,CAACtG,QAAUA,MAAM2C,IAAI,IAAImD,SAAS9F,MAAM2C,IAAI,MAAMmD,SAAS/G,KAAK4D,IAAI;YAC1F,IAAI0D,OAAOE,YAAY;QACzB;QACA,MAAMC,aAAoC,CAACH,QAAQ,QAAQA,MAAM7F,WAAW,KAAKzB,KAAKyB,WAAW,GAAG,cAAc;QAClH,MAAM6C,UAAUtE,KAAKsD,IAAI,CAAC+B,MAAM,CAAC,CAAC9B;YAChC,MAAMnC,MAAMrB,eAAewD;YAC3B,OAAO,CAAC4D,UAAU1D,GAAG,CAACrC,QAAQ,CAACgG,OAAO3D,GAAG,CAACrC;QAC5C;QACA,OAAO;YACLpB;YACA0H,QAAQpD,QAAQT,MAAM,GAAG,sBAAsB4D;YAC/CA;WACIH,QAAQ;YAAEJ,UAAUI;YAAOE;QAAU,IAAI,CAAC;YAC9ClD;;IAEJ;AACF;AAcA;;;;CAIC,GACD,OAAO,SAASqD,uBAAuBC,KAAuB;IAC5D,IAAIA,MAAMH,UAAU,KAAK,OAAO,OAAO;QAAEI,UAAU;QAAUC,aAAaF,MAAMtD,OAAO,CAACT,MAAM,GAAG;IAAE;IACnG,IAAI+D,MAAMH,UAAU,KAAK,aAAa,OAAO;QAAEI,UAAU;QAAQC,aAAaF,MAAMtD,OAAO,CAACT,MAAM,GAAG;IAAE;IACvG,OAAO;QAAEgE,UAAU;QAAQC,aAAa;IAAK;AAC/C;AAEA,kFAAkF,GAClF,OAAO,SAASC,oBAAoBH,KAAuB,EAAEI,YAAY,KAAK;IAC5E,IAAIJ,MAAMH,UAAU,KAAK,OAAO,OAAO;QAAC;QAAU;KAAO;IACzD,OAAOO,YAAY;QAAC;QAAW;QAAY;QAAQ;KAAQ,GAAG;QAAC;QAAW;QAAY;KAAO;AAC/F;AAEA;;;CAGC,GACD,OAAO,SAASC,aAAatE,IAAY,EAAEuE,KAAuB;IAChE,MAAMC,OAAO,IAAIpF,IAAI;WAAImF;KAAM,CAAClH,GAAG,CAAC+F;IACpC,MAAMqB,OAAO,GAAGzE,KAAK0E,OAAO,CAAC,mBAAmB,IAAI,KAAK,CAAC;IAC1D,IAAI,CAACF,KAAK1E,GAAG,CAACsD,SAASqB,QAAQ,OAAOA;IACtC,IAAK,IAAIE,IAAI,IAAKA,KAAK,EAAG;QACxB,MAAMC,YAAY,GAAGH,KAAK,CAAC,EAAEE,GAAG;QAChC,IAAI,CAACH,KAAK1E,GAAG,CAACsD,SAASwB,aAAa,OAAOA;IAC7C;AACF;AAEA;;;CAGC,GACD,OAAO,eAAeC,qBACpB3F,KAA0D,EAC1D4F,WAII,IAAO,CAAA,CAAC,CAAA,CAAE,EACdC,OAAsD,CAAC,CAAC;IAExD,MAAMzF,UAAiC,EAAE;IACzC,MAAM0F,WAA8B,CAAC;IACrC,KAAK,MAAM3I,QAAQ6C,MAAO;YAQhB+F;QAPR,MAAMA,YAAYH,SAASzI;QAC3B,MAAMiB,QAA6B;YACjChB,MAAMD,KAAKC,IAAI;YACfC,KAAKF,KAAKG,EAAE;WACRyI,UAAUjF,IAAI,GAAG;YAAEA,MAAMiF,UAAUjF,IAAI;QAAC,IAAI,CAAC,GAC7CiF,UAAUhF,IAAI,GAAG;YAAEA,MAAMgF,UAAUhF,IAAI;QAAC,IAAI,CAAC;YACjDnC,aAAa,MAAMA,YAAYzB,KAAK6I,OAAO;YAC3CvF,IAAI,GAAEsF,kBAAAA,UAAUtF,IAAI,YAAdsF,kBAAkB,EAAE;;QAE5B3F,QAAQN,IAAI,CAAC1B;QACb0H,QAAQ,CAAC5I,eAAekB,OAAO,GAAGjB,KAAK6I,OAAO;IAChD;IACA,OAAO;QACL/E,UAAU;YAAEC,QAAQlE;YAAyBmE,SAASlE;YAA0B+C,OAAOI;WAAYyF;QACnG7F,OAAO8F;IACT;AACF"}

package/src/lib/data-transfer/picklist-map.d.ts

@@ -0,0 +1,139 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+import type { PicklistSpec, PicklistValue, PicklistValueSet } from '../app-utils/picklists';
+/** One distinct value of a column, with where it occurs. */
+export interface PicklistIncomingValue {
+    /** The first spelling the file used. */
+    value: string;
+    /** The comparison key ({@link picklistLabelKey}). */
+    key: string;
+    /** How many cells carry it. */
+    count: number;
+    /** The first few row indexes that carry it. */
+    rows: number[];
+}
+/** How many row indexes a distinct value keeps as samples. */
+export declare const PICKLIST_SAMPLE_ROWS = 5;
+/**
+ * The distinct values of a column, in the order first seen. A multi-value
+ * cell (an array) counts each of its values.
+ */
+export declare function collectPicklistValues(cells: Iterable<{
+    row: number;
+    value: unknown;
+}>): PicklistIncomingValue[];
+/** A value of the list an incoming value might have meant. */
+export interface PicklistSuggestion {
+    valueId: string;
+    label: string;
+    confidence: number;
+}
+/** An incoming value the list holds. */
+export interface PicklistMatched extends PicklistIncomingValue {
+    valueId: string;
+    /** The label as the list spells it — what records store. */
+    label: string;
+    /** The list holds it deactivated; storing it is allowed but worth a word. */
+    inactive: boolean;
+    /** Matched by value id rather than by label. */
+    byId: boolean;
+}
+/** An incoming value the list does not hold. */
+export interface PicklistUnmatched extends PicklistIncomingValue {
+    /** The list's values it is closest to, strongest first. */
+    suggestions: PicklistSuggestion[];
+}
+export interface PicklistMatchResult {
+    matched: PicklistMatched[];
+    unmatched: PicklistUnmatched[];
+}
+/** The least similarity a suggestion is offered at. */
+export declare const PICKLIST_SUGGESTION_THRESHOLD = 0.6;
+/**
+ * The incoming values against the organization's effective list. A value
+ * matches a list value by label (any case or spacing) or by id; the rest
+ * are unmatched, each with the closest list values as suggestions.
+ */
+export declare function matchPicklistValues(set: PicklistValueSet, incoming: readonly PicklistIncomingValue[]): PicklistMatchResult;
+/** What to do with one unmatched value. */
+export type PicklistValueChoice = {
+    action: 'mapTo';
+    valueId: string;
+} | {
+    action: 'addValue';
+    label?: string;
+    group?: string | null;
+    meaning?: string | null;
+} | {
+    action: 'leaveBlank';
+} | {
+    action: 'refuseRow';
+};
+/** The suggestion confidence at which "map to it" is proposed outright. */
+export declare const PICKLIST_AUTO_MAP_CONFIDENCE = 0.9;
+/**
+ * The choice proposed before the person decides: map to a near-certain
+ * suggestion; else add the value to an open list (an unrestricted one with
+ * no meanings, which would store it as typed anyway); else leave it blank.
+ * Every proposal is shown and can be changed — none is applied unseen.
+ */
+export declare function proposePicklistChoice(spec: PicklistSpec, value: PicklistUnmatched): PicklistValueChoice;
+/**
+ * What is wrong with a set of choices, as sentences: a value with no
+ * choice, a mapping to a value the list does not hold, an added value that
+ * needs a meaning or names an unknown group or meaning, two added values
+ * with one label, or more values than a list may hold.
+ */
+export declare function picklistChoiceProblems(spec: PicklistSpec, set: PicklistValueSet, unmatched: readonly PicklistUnmatched[], choices: Readonly<Record<string, PicklistValueChoice | undefined>>): string[];
+/** What one incoming value becomes. */
+export type PicklistCellOutcome = {
+    kind: 'value';
+    label: string;
+    valueId: string;
+} | {
+    kind: 'blank';
+} | {
+    kind: 'refuse';
+};
+/** The choices applied: the list with added values, and how each incoming value resolves. */
+export interface PicklistResolution {
+    /** The list with every added value appended, active. */
+    set: PicklistValueSet;
+    /** The values to add to the organization's list. */
+    added: PicklistValue[];
+    /** Incoming key → outcome, for matched and unmatched values alike. */
+    outcomes: Map<string, PicklistCellOutcome>;
+}
+/**
+ * The choices applied to the list. Matched values resolve to the list's
+ * own label; added values are minted ids that never collide with a stored
+ * or standard id. A value with no choice resolves to blank — callers check
+ * {@link picklistChoiceProblems} first.
+ */
+export declare function resolvePicklistChoices(spec: PicklistSpec, set: PicklistValueSet, result: PicklistMatchResult, choices: Readonly<Record<string, PicklistValueChoice | undefined>>): PicklistResolution;
+/** One cell through a resolution: the label to store, blank, or refuse the row. */
+export declare function resolvePicklistCell(resolution: PicklistResolution, raw: unknown): PicklistCellOutcome;
+/**
+ * A multi-value cell through a resolution: the labels to store, in order and
+ * without repeats; `refuse` when any value refuses the row.
+ */
+export declare function resolveMultiPicklistCell(resolution: PicklistResolution, raw: readonly unknown[]): {
+    kind: 'values';
+    labels: string[];
+} | {
+    kind: 'refuse';
+};

package/src/lib/data-transfer/picklist-map.js

@@ -0,0 +1,271 @@
+import { _ as _extends } from "@swc/helpers/_/_extends";
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */ /*==========================================
+ * PICKLIST MAPPING — what to do with a file's values a picklist does not hold.
+ *
+ * For each picklist column the wizard lists the DISTINCT values the file
+ * carries. A value the organization's list already holds (by label in any
+ * case or spacing, or by value id) is matched. Every other value gets a
+ * choice, made once and applied to every row that carries it:
+ *
+ *  - map it to an existing value;
+ *  - add it to the organization's list as a new value (with a group, and a
+ *    meaning when the list needs one);
+ *  - leave the field blank on those rows;
+ *  - refuse those rows.
+ *
+ * Built on the picklist engine (`app-utils/picklists.ts`): labels compare
+ * by its key, new value ids are minted by it, and an added value can never
+ * take a standard value's id.
+ *=========================================*/ import { PICKLIST_VALUES_MAX, mintPicklistValueId, normalizePicklistLabel, picklistLabelKey, picklistValueByLabel } from "../app-utils/picklists.js";
+import { textSimilarity } from "./similarity.js";
+/** How many row indexes a distinct value keeps as samples. */ export const PICKLIST_SAMPLE_ROWS = 5;
+/**
+ * The distinct values of a column, in the order first seen. A multi-value
+ * cell (an array) counts each of its values.
+ */ export function collectPicklistValues(cells) {
+    const byKey = new Map();
+    for (const { row, value } of cells){
+        const values = Array.isArray(value) ? value : [
+            value
+        ];
+        for (const entry of values){
+            const label = normalizePicklistLabel(entry);
+            if (!label) continue;
+            const key = picklistLabelKey(label);
+            const seen = byKey.get(key);
+            if (seen) {
+                seen.count += 1;
+                if (seen.rows.length < PICKLIST_SAMPLE_ROWS && !seen.rows.includes(row)) seen.rows.push(row);
+            } else {
+                byKey.set(key, {
+                    value: label,
+                    key,
+                    count: 1,
+                    rows: [
+                        row
+                    ]
+                });
+            }
+        }
+    }
+    return [
+        ...byKey.values()
+    ];
+}
+/** The least similarity a suggestion is offered at. */ export const PICKLIST_SUGGESTION_THRESHOLD = 0.6;
+/**
+ * The incoming values against the organization's effective list. A value
+ * matches a list value by label (any case or spacing) or by id; the rest
+ * are unmatched, each with the closest list values as suggestions.
+ */ export function matchPicklistValues(set, incoming) {
+    const matched = [];
+    const unmatched = [];
+    for (const value of incoming){
+        var _ref;
+        const byLabel = picklistValueByLabel(set, value.value);
+        const byId = (_ref = byLabel != null ? byLabel : set.values.find((entry)=>entry.id.toLowerCase() === value.value.toLowerCase())) != null ? _ref : null;
+        if (byId) {
+            matched.push(_extends({}, value, {
+                valueId: byId.id,
+                label: byId.label,
+                inactive: !byId.active,
+                byId: !byLabel
+            }));
+            continue;
+        }
+        const suggestions = set.values.filter((entry)=>entry.active).map((entry)=>({
+                valueId: entry.id,
+                label: entry.label,
+                confidence: Math.round(textSimilarity(value.value, entry.label) * 1000) / 1000
+            })).filter((entry)=>entry.confidence >= PICKLIST_SUGGESTION_THRESHOLD).sort((a, b)=>b.confidence - a.confidence).slice(0, 3);
+        unmatched.push(_extends({}, value, {
+            suggestions
+        }));
+    }
+    return {
+        matched,
+        unmatched
+    };
+}
+/** The suggestion confidence at which "map to it" is proposed outright. */ export const PICKLIST_AUTO_MAP_CONFIDENCE = 0.9;
+/**
+ * The choice proposed before the person decides: map to a near-certain
+ * suggestion; else add the value to an open list (an unrestricted one with
+ * no meanings, which would store it as typed anyway); else leave it blank.
+ * Every proposal is shown and can be changed — none is applied unseen.
+ */ export function proposePicklistChoice(spec, value) {
+    var _spec_meanings;
+    const top = value.suggestions[0];
+    if (top && top.confidence >= PICKLIST_AUTO_MAP_CONFIDENCE) return {
+        action: 'mapTo',
+        valueId: top.valueId
+    };
+    if (!spec.restricted && !((_spec_meanings = spec.meanings) == null ? void 0 : _spec_meanings.length)) return {
+        action: 'addValue'
+    };
+    return {
+        action: 'leaveBlank'
+    };
+}
+/**
+ * What is wrong with a set of choices, as sentences: a value with no
+ * choice, a mapping to a value the list does not hold, an added value that
+ * needs a meaning or names an unknown group or meaning, two added values
+ * with one label, or more values than a list may hold.
+ */ export function picklistChoiceProblems(spec, set, unmatched, choices) {
+    const problems = [];
+    const labels = new Set(set.values.map((value)=>picklistLabelKey(value.label)));
+    let added = 0;
+    for (const value of unmatched){
+        var _choice_label;
+        var _spec_meanings, _spec_groups;
+        const choice = choices[value.key];
+        if (!choice) {
+            problems.push(`Choose what to do with "${value.value}".`);
+            continue;
+        }
+        if (choice.action === 'mapTo' && !set.values.some((entry)=>entry.id === choice.valueId)) {
+            problems.push(`"${value.value}" is mapped to a value the list does not hold.`);
+        }
+        if (choice.action !== 'addValue') continue;
+        added += 1;
+        const label = normalizePicklistLabel((_choice_label = choice.label) != null ? _choice_label : value.value);
+        if (!label) problems.push(`"${value.value}" needs a label to be added.`);
+        else if (labels.has(picklistLabelKey(label))) problems.push(`"${label}" is already in the list or added twice.`);
+        labels.add(picklistLabelKey(label));
+        if ((_spec_meanings = spec.meanings) == null ? void 0 : _spec_meanings.length) {
+            if (!choice.meaning) problems.push(`"${label}" needs a meaning to be added.`);
+            else if (!spec.meanings.includes(choice.meaning)) problems.push(`"${label}" names an unknown meaning.`);
+        }
+        if (choice.group && !((_spec_groups = spec.groups) == null ? void 0 : _spec_groups.some((group)=>group.id === choice.group))) {
+            problems.push(`"${label}" names an unknown group.`);
+        }
+    }
+    if (set.values.length + added > PICKLIST_VALUES_MAX) {
+        problems.push(`A list holds at most ${PICKLIST_VALUES_MAX} values; this would make ${set.values.length + added}.`);
+    }
+    return problems;
+}
+/**
+ * The choices applied to the list. Matched values resolve to the list's
+ * own label; added values are minted ids that never collide with a stored
+ * or standard id. A value with no choice resolves to blank — callers check
+ * {@link picklistChoiceProblems} first.
+ */ export function resolvePicklistChoices(spec, set, result, choices) {
+    const values = set.values.map((value)=>_extends({}, value));
+    const added = [];
+    const outcomes = new Map();
+    for (const value of result.matched){
+        outcomes.set(value.key, {
+            kind: 'value',
+            label: value.label,
+            valueId: value.valueId
+        });
+    }
+    const taken = ()=>[
+            ...values.map((value)=>value.id),
+            ...spec.standardValues.map((value)=>value.id)
+        ];
+    for (const value of result.unmatched){
+        const choice = choices[value.key];
+        if ((choice == null ? void 0 : choice.action) === 'mapTo') {
+            const target = values.find((entry)=>entry.id === choice.valueId);
+            outcomes.set(value.key, target ? {
+                kind: 'value',
+                label: target.label,
+                valueId: target.id
+            } : {
+                kind: 'blank'
+            });
+        } else if ((choice == null ? void 0 : choice.action) === 'addValue') {
+            var _choice_label, _choice_group, _choice_meaning;
+            var _spec_groups, _spec_meanings;
+            const label = normalizePicklistLabel((_choice_label = choice.label) != null ? _choice_label : value.value);
+            const existing = values.find((entry)=>picklistLabelKey(entry.label) === picklistLabelKey(label));
+            if (existing) {
+                outcomes.set(value.key, {
+                    kind: 'value',
+                    label: existing.label,
+                    valueId: existing.id
+                });
+                continue;
+            }
+            const entry = _extends({
+                id: mintPicklistValueId(label, taken()),
+                label,
+                active: true
+            }, ((_spec_groups = spec.groups) == null ? void 0 : _spec_groups.length) ? {
+                group: (_choice_group = choice.group) != null ? _choice_group : null
+            } : {}, ((_spec_meanings = spec.meanings) == null ? void 0 : _spec_meanings.length) ? {
+                meaning: (_choice_meaning = choice.meaning) != null ? _choice_meaning : null
+            } : {});
+            values.push(entry);
+            added.push(entry);
+            outcomes.set(value.key, {
+                kind: 'value',
+                label: entry.label,
+                valueId: entry.id
+            });
+        } else if ((choice == null ? void 0 : choice.action) === 'refuseRow') {
+            outcomes.set(value.key, {
+                kind: 'refuse'
+            });
+        } else {
+            outcomes.set(value.key, {
+                kind: 'blank'
+            });
+        }
+    }
+    return {
+        set: {
+            values,
+            defaultValueId: set.defaultValueId
+        },
+        added,
+        outcomes
+    };
+}
+/** One cell through a resolution: the label to store, blank, or refuse the row. */ export function resolvePicklistCell(resolution, raw) {
+    var _resolution_outcomes_get;
+    const label = normalizePicklistLabel(raw);
+    if (!label) return {
+        kind: 'blank'
+    };
+    return (_resolution_outcomes_get = resolution.outcomes.get(picklistLabelKey(label))) != null ? _resolution_outcomes_get : {
+        kind: 'blank'
+    };
+}
+/**
+ * A multi-value cell through a resolution: the labels to store, in order and
+ * without repeats; `refuse` when any value refuses the row.
+ */ export function resolveMultiPicklistCell(resolution, raw) {
+    const labels = [];
+    for (const entry of raw){
+        const outcome = resolvePicklistCell(resolution, entry);
+        if (outcome.kind === 'refuse') return {
+            kind: 'refuse'
+        };
+        if (outcome.kind === 'value' && !labels.includes(outcome.label)) labels.push(outcome.label);
+    }
+    return {
+        kind: 'values',
+        labels
+    };
+}
+
+//# sourceMappingURL=picklist-map.js.map

package/src/lib/data-transfer/picklist-map.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../libs/aglyn/src/lib/data-transfer/picklist-map.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/*==========================================\n * PICKLIST MAPPING — what to do with a file's values a picklist does not hold.\n *\n * For each picklist column the wizard lists the DISTINCT values the file\n * carries. A value the organization's list already holds (by label in any\n * case or spacing, or by value id) is matched. Every other value gets a\n * choice, made once and applied to every row that carries it:\n *\n *  - map it to an existing value;\n *  - add it to the organization's list as a new value (with a group, and a\n *    meaning when the list needs one);\n *  - leave the field blank on those rows;\n *  - refuse those rows.\n *\n * Built on the picklist engine (`app-utils/picklists.ts`): labels compare\n * by its key, new value ids are minted by it, and an added value can never\n * take a standard value's id.\n *=========================================*/\n\nimport {\n  PICKLIST_VALUES_MAX,\n  mintPicklistValueId,\n  normalizePicklistLabel,\n  picklistLabelKey,\n  picklistValueByLabel,\n} from '../app-utils/picklists'\nimport type { PicklistSpec, PicklistValue, PicklistValueSet } from '../app-utils/picklists'\nimport { textSimilarity } from './similarity'\n\n/** One distinct value of a column, with where it occurs. */\nexport interface PicklistIncomingValue {\n  /** The first spelling the file used. */\n  value: string\n  /** The comparison key ({@link picklistLabelKey}). */\n  key: string\n  /** How many cells carry it. */\n  count: number\n  /** The first few row indexes that carry it. */\n  rows: number[]\n}\n\n/** How many row indexes a distinct value keeps as samples. */\nexport const PICKLIST_SAMPLE_ROWS = 5\n\n/**\n * The distinct values of a column, in the order first seen. A multi-value\n * cell (an array) counts each of its values.\n */\nexport function collectPicklistValues(\n  cells: Iterable<{ row: number; value: unknown }>,\n): PicklistIncomingValue[] {\n  const byKey = new Map<string, PicklistIncomingValue>()\n  for (const { row, value } of cells) {\n    const values = Array.isArray(value) ? value : [value]\n    for (const entry of values) {\n      const label = normalizePicklistLabel(entry)\n      if (!label) continue\n      const key = picklistLabelKey(label)\n      const seen = byKey.get(key)\n      if (seen) {\n        seen.count += 1\n        if (seen.rows.length < PICKLIST_SAMPLE_ROWS && !seen.rows.includes(row)) seen.rows.push(row)\n      } else {\n        byKey.set(key, { value: label, key, count: 1, rows: [row] })\n      }\n    }\n  }\n  return [...byKey.values()]\n}\n\n/** A value of the list an incoming value might have meant. */\nexport interface PicklistSuggestion {\n  valueId: string\n  label: string\n  confidence: number\n}\n\n/** An incoming value the list holds. */\nexport interface PicklistMatched extends PicklistIncomingValue {\n  valueId: string\n  /** The label as the list spells it — what records store. */\n  label: string\n  /** The list holds it deactivated; storing it is allowed but worth a word. */\n  inactive: boolean\n  /** Matched by value id rather than by label. */\n  byId: boolean\n}\n\n/** An incoming value the list does not hold. */\nexport interface PicklistUnmatched extends PicklistIncomingValue {\n  /** The list's values it is closest to, strongest first. */\n  suggestions: PicklistSuggestion[]\n}\n\nexport interface PicklistMatchResult {\n  matched: PicklistMatched[]\n  unmatched: PicklistUnmatched[]\n}\n\n/** The least similarity a suggestion is offered at. */\nexport const PICKLIST_SUGGESTION_THRESHOLD = 0.6\n\n/**\n * The incoming values against the organization's effective list. A value\n * matches a list value by label (any case or spacing) or by id; the rest\n * are unmatched, each with the closest list values as suggestions.\n */\nexport function matchPicklistValues(\n  set: PicklistValueSet,\n  incoming: readonly PicklistIncomingValue[],\n): PicklistMatchResult {\n  const matched: PicklistMatched[] = []\n  const unmatched: PicklistUnmatched[] = []\n  for (const value of incoming) {\n    const byLabel = picklistValueByLabel(set, value.value)\n    const byId =\n      byLabel ?? set.values.find((entry) => entry.id.toLowerCase() === value.value.toLowerCase()) ?? null\n    if (byId) {\n      matched.push({ ...value, valueId: byId.id, label: byId.label, inactive: !byId.active, byId: !byLabel })\n      continue\n    }\n    const suggestions = set.values\n      .filter((entry) => entry.active)\n      .map((entry) => ({\n        valueId: entry.id,\n        label: entry.label,\n        confidence: Math.round(textSimilarity(value.value, entry.label) * 1000) / 1000,\n      }))\n      .filter((entry) => entry.confidence >= PICKLIST_SUGGESTION_THRESHOLD)\n      .sort((a, b) => b.confidence - a.confidence)\n      .slice(0, 3)\n    unmatched.push({ ...value, suggestions })\n  }\n  return { matched, unmatched }\n}\n\n/** What to do with one unmatched value. */\nexport type PicklistValueChoice =\n  | { action: 'mapTo'; valueId: string }\n  | { action: 'addValue'; label?: string; group?: string | null; meaning?: string | null }\n  | { action: 'leaveBlank' }\n  | { action: 'refuseRow' }\n\n/** The suggestion confidence at which \"map to it\" is proposed outright. */\nexport const PICKLIST_AUTO_MAP_CONFIDENCE = 0.9\n\n/**\n * The choice proposed before the person decides: map to a near-certain\n * suggestion; else add the value to an open list (an unrestricted one with\n * no meanings, which would store it as typed anyway); else leave it blank.\n * Every proposal is shown and can be changed — none is applied unseen.\n */\nexport function proposePicklistChoice(spec: PicklistSpec, value: PicklistUnmatched): PicklistValueChoice {\n  const top = value.suggestions[0]\n  if (top && top.confidence >= PICKLIST_AUTO_MAP_CONFIDENCE) return { action: 'mapTo', valueId: top.valueId }\n  if (!spec.restricted && !spec.meanings?.length) return { action: 'addValue' }\n  return { action: 'leaveBlank' }\n}\n\n/**\n * What is wrong with a set of choices, as sentences: a value with no\n * choice, a mapping to a value the list does not hold, an added value that\n * needs a meaning or names an unknown group or meaning, two added values\n * with one label, or more values than a list may hold.\n */\nexport function picklistChoiceProblems(\n  spec: PicklistSpec,\n  set: PicklistValueSet,\n  unmatched: readonly PicklistUnmatched[],\n  choices: Readonly<Record<string, PicklistValueChoice | undefined>>,\n): string[] {\n  const problems: string[] = []\n  const labels = new Set(set.values.map((value) => picklistLabelKey(value.label)))\n  let added = 0\n  for (const value of unmatched) {\n    const choice = choices[value.key]\n    if (!choice) {\n      problems.push(`Choose what to do with \"${value.value}\".`)\n      continue\n    }\n    if (choice.action === 'mapTo' && !set.values.some((entry) => entry.id === choice.valueId)) {\n      problems.push(`\"${value.value}\" is mapped to a value the list does not hold.`)\n    }\n    if (choice.action !== 'addValue') continue\n    added += 1\n    const label = normalizePicklistLabel(choice.label ?? value.value)\n    if (!label) problems.push(`\"${value.value}\" needs a label to be added.`)\n    else if (labels.has(picklistLabelKey(label))) problems.push(`\"${label}\" is already in the list or added twice.`)\n    labels.add(picklistLabelKey(label))\n    if (spec.meanings?.length) {\n      if (!choice.meaning) problems.push(`\"${label}\" needs a meaning to be added.`)\n      else if (!spec.meanings.includes(choice.meaning)) problems.push(`\"${label}\" names an unknown meaning.`)\n    }\n    if (choice.group && !spec.groups?.some((group) => group.id === choice.group)) {\n      problems.push(`\"${label}\" names an unknown group.`)\n    }\n  }\n  if (set.values.length + added > PICKLIST_VALUES_MAX) {\n    problems.push(`A list holds at most ${PICKLIST_VALUES_MAX} values; this would make ${set.values.length + added}.`)\n  }\n  return problems\n}\n\n/** What one incoming value becomes. */\nexport type PicklistCellOutcome =\n  | { kind: 'value'; label: string; valueId: string }\n  | { kind: 'blank' }\n  | { kind: 'refuse' }\n\n/** The choices applied: the list with added values, and how each incoming value resolves. */\nexport interface PicklistResolution {\n  /** The list with every added value appended, active. */\n  set: PicklistValueSet\n  /** The values to add to the organization's list. */\n  added: PicklistValue[]\n  /** Incoming key → outcome, for matched and unmatched values alike. */\n  outcomes: Map<string, PicklistCellOutcome>\n}\n\n/**\n * The choices applied to the list. Matched values resolve to the list's\n * own label; added values are minted ids that never collide with a stored\n * or standard id. A value with no choice resolves to blank — callers check\n * {@link picklistChoiceProblems} first.\n */\nexport function resolvePicklistChoices(\n  spec: PicklistSpec,\n  set: PicklistValueSet,\n  result: PicklistMatchResult,\n  choices: Readonly<Record<string, PicklistValueChoice | undefined>>,\n): PicklistResolution {\n  const values = set.values.map((value) => ({ ...value }))\n  const added: PicklistValue[] = []\n  const outcomes = new Map<string, PicklistCellOutcome>()\n  for (const value of result.matched) {\n    outcomes.set(value.key, { kind: 'value', label: value.label, valueId: value.valueId })\n  }\n  const taken = (): string[] => [...values.map((value) => value.id), ...spec.standardValues.map((value) => value.id)]\n  for (const value of result.unmatched) {\n    const choice = choices[value.key]\n    if (choice?.action === 'mapTo') {\n      const target = values.find((entry) => entry.id === choice.valueId)\n      outcomes.set(value.key, target ? { kind: 'value', label: target.label, valueId: target.id } : { kind: 'blank' })\n    } else if (choice?.action === 'addValue') {\n      const label = normalizePicklistLabel(choice.label ?? value.value)\n      const existing = values.find((entry) => picklistLabelKey(entry.label) === picklistLabelKey(label))\n      if (existing) {\n        outcomes.set(value.key, { kind: 'value', label: existing.label, valueId: existing.id })\n        continue\n      }\n      const entry: PicklistValue = {\n        id: mintPicklistValueId(label, taken()),\n        label,\n        active: true,\n        ...(spec.groups?.length ? { group: choice.group ?? null } : {}),\n        ...(spec.meanings?.length ? { meaning: choice.meaning ?? null } : {}),\n      }\n      values.push(entry)\n      added.push(entry)\n      outcomes.set(value.key, { kind: 'value', label: entry.label, valueId: entry.id })\n    } else if (choice?.action === 'refuseRow') {\n      outcomes.set(value.key, { kind: 'refuse' })\n    } else {\n      outcomes.set(value.key, { kind: 'blank' })\n    }\n  }\n  return { set: { values, defaultValueId: set.defaultValueId }, added, outcomes }\n}\n\n/** One cell through a resolution: the label to store, blank, or refuse the row. */\nexport function resolvePicklistCell(resolution: PicklistResolution, raw: unknown): PicklistCellOutcome {\n  const label = normalizePicklistLabel(raw)\n  if (!label) return { kind: 'blank' }\n  return resolution.outcomes.get(picklistLabelKey(label)) ?? { kind: 'blank' }\n}\n\n/**\n * A multi-value cell through a resolution: the labels to store, in order and\n * without repeats; `refuse` when any value refuses the row.\n */\nexport function resolveMultiPicklistCell(\n  resolution: PicklistResolution,\n  raw: readonly unknown[],\n): { kind: 'values'; labels: string[] } | { kind: 'refuse' } {\n  const labels: string[] = []\n  for (const entry of raw) {\n    const outcome = resolvePicklistCell(resolution, entry)\n    if (outcome.kind === 'refuse') return { kind: 'refuse' }\n    if (outcome.kind === 'value' && !labels.includes(outcome.label)) labels.push(outcome.label)\n  }\n  return { kind: 'values', labels }\n}\n"],"names":["PICKLIST_VALUES_MAX","mintPicklistValueId","normalizePicklistLabel","picklistLabelKey","picklistValueByLabel","textSimilarity","PICKLIST_SAMPLE_ROWS","collectPicklistValues","cells","byKey","Map","row","value","values","Array","isArray","entry","label","key","seen","get","count","rows","length","includes","push","set","PICKLIST_SUGGESTION_THRESHOLD","matchPicklistValues","incoming","matched","unmatched","byLabel","byId","find","id","toLowerCase","valueId","inactive","active","suggestions","filter","map","confidence","Math","round","sort","a","b","slice","PICKLIST_AUTO_MAP_CONFIDENCE","proposePicklistChoice","spec","top","action","restricted","meanings","picklistChoiceProblems","choices","problems","labels","Set","added","choice","some","has","add","meaning","group","groups","resolvePicklistChoices","result","outcomes","kind","taken","standardValues","target","existing","defaultValueId","resolvePicklistCell","resolution","raw","resolveMultiPicklistCell","outcome"],"mappings":";AAAA;;;;;;;;;;;;;;;CAeC,GAED;;;;;;;;;;;;;;;;;2CAiB2C,GAE3C,SACEA,mBAAmB,EACnBC,mBAAmB,EACnBC,sBAAsB,EACtBC,gBAAgB,EAChBC,oBAAoB,QACf,4BAAwB;AAE/B,SAASC,cAAc,QAAQ,kBAAc;AAc7C,4DAA4D,GAC5D,OAAO,MAAMC,uBAAuB,EAAC;AAErC;;;CAGC,GACD,OAAO,SAASC,sBACdC,KAAgD;IAEhD,MAAMC,QAAQ,IAAIC;IAClB,KAAK,MAAM,EAAEC,GAAG,EAAEC,KAAK,EAAE,IAAIJ,MAAO;QAClC,MAAMK,SAASC,MAAMC,OAAO,CAACH,SAASA,QAAQ;YAACA;SAAM;QACrD,KAAK,MAAMI,SAASH,OAAQ;YAC1B,MAAMI,QAAQf,uBAAuBc;YACrC,IAAI,CAACC,OAAO;YACZ,MAAMC,MAAMf,iBAAiBc;YAC7B,MAAME,OAAOV,MAAMW,GAAG,CAACF;YACvB,IAAIC,MAAM;gBACRA,KAAKE,KAAK,IAAI;gBACd,IAAIF,KAAKG,IAAI,CAACC,MAAM,GAAGjB,wBAAwB,CAACa,KAAKG,IAAI,CAACE,QAAQ,CAACb,MAAMQ,KAAKG,IAAI,CAACG,IAAI,CAACd;YAC1F,OAAO;gBACLF,MAAMiB,GAAG,CAACR,KAAK;oBAAEN,OAAOK;oBAAOC;oBAAKG,OAAO;oBAAGC,MAAM;wBAACX;qBAAI;gBAAC;YAC5D;QACF;IACF;IACA,OAAO;WAAIF,MAAMI,MAAM;KAAG;AAC5B;AA+BA,qDAAqD,GACrD,OAAO,MAAMc,gCAAgC,IAAG;AAEhD;;;;CAIC,GACD,OAAO,SAASC,oBACdF,GAAqB,EACrBG,QAA0C;IAE1C,MAAMC,UAA6B,EAAE;IACrC,MAAMC,YAAiC,EAAE;IACzC,KAAK,MAAMnB,SAASiB,SAAU;YAG1BG;QAFF,MAAMA,UAAU5B,qBAAqBsB,KAAKd,MAAMA,KAAK;QACrD,MAAMqB,QACJD,OAAAA,kBAAAA,UAAWN,IAAIb,MAAM,CAACqB,IAAI,CAAC,CAAClB,QAAUA,MAAMmB,EAAE,CAACC,WAAW,OAAOxB,MAAMA,KAAK,CAACwB,WAAW,eAAxFJ,OAA+F;QACjG,IAAIC,MAAM;YACRH,QAAQL,IAAI,CAAC,aAAKb;gBAAOyB,SAASJ,KAAKE,EAAE;gBAAElB,OAAOgB,KAAKhB,KAAK;gBAAEqB,UAAU,CAACL,KAAKM,MAAM;gBAAEN,MAAM,CAACD;;YAC7F;QACF;QACA,MAAMQ,cAAcd,IAAIb,MAAM,CAC3B4B,MAAM,CAAC,CAACzB,QAAUA,MAAMuB,MAAM,EAC9BG,GAAG,CAAC,CAAC1B,QAAW,CAAA;gBACfqB,SAASrB,MAAMmB,EAAE;gBACjBlB,OAAOD,MAAMC,KAAK;gBAClB0B,YAAYC,KAAKC,KAAK,CAACxC,eAAeO,MAAMA,KAAK,EAAEI,MAAMC,KAAK,IAAI,QAAQ;YAC5E,CAAA,GACCwB,MAAM,CAAC,CAACzB,QAAUA,MAAM2B,UAAU,IAAIhB,+BACtCmB,IAAI,CAAC,CAACC,GAAGC,IAAMA,EAAEL,UAAU,GAAGI,EAAEJ,UAAU,EAC1CM,KAAK,CAAC,GAAG;QACZlB,UAAUN,IAAI,CAAC,aAAKb;YAAO4B;;IAC7B;IACA,OAAO;QAAEV;QAASC;IAAU;AAC9B;AASA,yEAAyE,GACzE,OAAO,MAAMmB,+BAA+B,IAAG;AAE/C;;;;;CAKC,GACD,OAAO,SAASC,sBAAsBC,IAAkB,EAAExC,KAAwB;QAGvDwC;IAFzB,MAAMC,MAAMzC,MAAM4B,WAAW,CAAC,EAAE;IAChC,IAAIa,OAAOA,IAAIV,UAAU,IAAIO,8BAA8B,OAAO;QAAEI,QAAQ;QAASjB,SAASgB,IAAIhB,OAAO;IAAC;IAC1G,IAAI,CAACe,KAAKG,UAAU,IAAI,GAACH,iBAAAA,KAAKI,QAAQ,qBAAbJ,eAAe7B,MAAM,GAAE,OAAO;QAAE+B,QAAQ;IAAW;IAC5E,OAAO;QAAEA,QAAQ;IAAa;AAChC;AAEA;;;;;CAKC,GACD,OAAO,SAASG,uBACdL,IAAkB,EAClB1B,GAAqB,EACrBK,SAAuC,EACvC2B,OAAkE;IAElE,MAAMC,WAAqB,EAAE;IAC7B,MAAMC,SAAS,IAAIC,IAAInC,IAAIb,MAAM,CAAC6B,GAAG,CAAC,CAAC9B,QAAUT,iBAAiBS,MAAMK,KAAK;IAC7E,IAAI6C,QAAQ;IACZ,KAAK,MAAMlD,SAASmB,UAAW;YAWQgC;YAIjCX,gBAIiBA;QAlBrB,MAAMW,SAASL,OAAO,CAAC9C,MAAMM,GAAG,CAAC;QACjC,IAAI,CAAC6C,QAAQ;YACXJ,SAASlC,IAAI,CAAC,CAAC,wBAAwB,EAAEb,MAAMA,KAAK,CAAC,EAAE,CAAC;YACxD;QACF;QACA,IAAImD,OAAOT,MAAM,KAAK,WAAW,CAAC5B,IAAIb,MAAM,CAACmD,IAAI,CAAC,CAAChD,QAAUA,MAAMmB,EAAE,KAAK4B,OAAO1B,OAAO,GAAG;YACzFsB,SAASlC,IAAI,CAAC,CAAC,CAAC,EAAEb,MAAMA,KAAK,CAAC,8CAA8C,CAAC;QAC/E;QACA,IAAImD,OAAOT,MAAM,KAAK,YAAY;QAClCQ,SAAS;QACT,MAAM7C,QAAQf,wBAAuB6D,gBAAAA,OAAO9C,KAAK,YAAZ8C,gBAAgBnD,MAAMA,KAAK;QAChE,IAAI,CAACK,OAAO0C,SAASlC,IAAI,CAAC,CAAC,CAAC,EAAEb,MAAMA,KAAK,CAAC,4BAA4B,CAAC;aAClE,IAAIgD,OAAOK,GAAG,CAAC9D,iBAAiBc,SAAS0C,SAASlC,IAAI,CAAC,CAAC,CAAC,EAAER,MAAM,wCAAwC,CAAC;QAC/G2C,OAAOM,GAAG,CAAC/D,iBAAiBc;QAC5B,KAAImC,iBAAAA,KAAKI,QAAQ,qBAAbJ,eAAe7B,MAAM,EAAE;YACzB,IAAI,CAACwC,OAAOI,OAAO,EAAER,SAASlC,IAAI,CAAC,CAAC,CAAC,EAAER,MAAM,8BAA8B,CAAC;iBACvE,IAAI,CAACmC,KAAKI,QAAQ,CAAChC,QAAQ,CAACuC,OAAOI,OAAO,GAAGR,SAASlC,IAAI,CAAC,CAAC,CAAC,EAAER,MAAM,2BAA2B,CAAC;QACxG;QACA,IAAI8C,OAAOK,KAAK,IAAI,GAAChB,eAAAA,KAAKiB,MAAM,qBAAXjB,aAAaY,IAAI,CAAC,CAACI,QAAUA,MAAMjC,EAAE,KAAK4B,OAAOK,KAAK,IAAG;YAC5ET,SAASlC,IAAI,CAAC,CAAC,CAAC,EAAER,MAAM,yBAAyB,CAAC;QACpD;IACF;IACA,IAAIS,IAAIb,MAAM,CAACU,MAAM,GAAGuC,QAAQ9D,qBAAqB;QACnD2D,SAASlC,IAAI,CAAC,CAAC,qBAAqB,EAAEzB,oBAAoB,yBAAyB,EAAE0B,IAAIb,MAAM,CAACU,MAAM,GAAGuC,MAAM,CAAC,CAAC;IACnH;IACA,OAAOH;AACT;AAkBA;;;;;CAKC,GACD,OAAO,SAASW,uBACdlB,IAAkB,EAClB1B,GAAqB,EACrB6C,MAA2B,EAC3Bb,OAAkE;IAElE,MAAM7C,SAASa,IAAIb,MAAM,CAAC6B,GAAG,CAAC,CAAC9B,QAAW,aAAKA;IAC/C,MAAMkD,QAAyB,EAAE;IACjC,MAAMU,WAAW,IAAI9D;IACrB,KAAK,MAAME,SAAS2D,OAAOzC,OAAO,CAAE;QAClC0C,SAAS9C,GAAG,CAACd,MAAMM,GAAG,EAAE;YAAEuD,MAAM;YAASxD,OAAOL,MAAMK,KAAK;YAAEoB,SAASzB,MAAMyB,OAAO;QAAC;IACtF;IACA,MAAMqC,QAAQ,IAAgB;eAAI7D,OAAO6B,GAAG,CAAC,CAAC9B,QAAUA,MAAMuB,EAAE;eAAMiB,KAAKuB,cAAc,CAACjC,GAAG,CAAC,CAAC9B,QAAUA,MAAMuB,EAAE;SAAE;IACnH,KAAK,MAAMvB,SAAS2D,OAAOxC,SAAS,CAAE;QACpC,MAAMgC,SAASL,OAAO,CAAC9C,MAAMM,GAAG,CAAC;QACjC,IAAI6C,CAAAA,0BAAAA,OAAQT,MAAM,MAAK,SAAS;YAC9B,MAAMsB,SAAS/D,OAAOqB,IAAI,CAAC,CAAClB,QAAUA,MAAMmB,EAAE,KAAK4B,OAAO1B,OAAO;YACjEmC,SAAS9C,GAAG,CAACd,MAAMM,GAAG,EAAE0D,SAAS;gBAAEH,MAAM;gBAASxD,OAAO2D,OAAO3D,KAAK;gBAAEoB,SAASuC,OAAOzC,EAAE;YAAC,IAAI;gBAAEsC,MAAM;YAAQ;QAChH,OAAO,IAAIV,CAAAA,0BAAAA,OAAQT,MAAM,MAAK,YAAY;gBACHS,eAUAA,eACIA;gBADnCX,cACAA;YAXN,MAAMnC,QAAQf,wBAAuB6D,gBAAAA,OAAO9C,KAAK,YAAZ8C,gBAAgBnD,MAAMA,KAAK;YAChE,MAAMiE,WAAWhE,OAAOqB,IAAI,CAAC,CAAClB,QAAUb,iBAAiBa,MAAMC,KAAK,MAAMd,iBAAiBc;YAC3F,IAAI4D,UAAU;gBACZL,SAAS9C,GAAG,CAACd,MAAMM,GAAG,EAAE;oBAAEuD,MAAM;oBAASxD,OAAO4D,SAAS5D,KAAK;oBAAEoB,SAASwC,SAAS1C,EAAE;gBAAC;gBACrF;YACF;YACA,MAAMnB,QAAuB;gBAC3BmB,IAAIlC,oBAAoBgB,OAAOyD;gBAC/BzD;gBACAsB,QAAQ;eACJa,EAAAA,eAAAA,KAAKiB,MAAM,qBAAXjB,aAAa7B,MAAM,IAAG;gBAAE6C,KAAK,GAAEL,gBAAAA,OAAOK,KAAK,YAAZL,gBAAgB;YAAK,IAAI,CAAC,GACzDX,EAAAA,iBAAAA,KAAKI,QAAQ,qBAAbJ,eAAe7B,MAAM,IAAG;gBAAE4C,OAAO,GAAEJ,kBAAAA,OAAOI,OAAO,YAAdJ,kBAAkB;YAAK,IAAI,CAAC;YAErElD,OAAOY,IAAI,CAACT;YACZ8C,MAAMrC,IAAI,CAACT;YACXwD,SAAS9C,GAAG,CAACd,MAAMM,GAAG,EAAE;gBAAEuD,MAAM;gBAASxD,OAAOD,MAAMC,KAAK;gBAAEoB,SAASrB,MAAMmB,EAAE;YAAC;QACjF,OAAO,IAAI4B,CAAAA,0BAAAA,OAAQT,MAAM,MAAK,aAAa;YACzCkB,SAAS9C,GAAG,CAACd,MAAMM,GAAG,EAAE;gBAAEuD,MAAM;YAAS;QAC3C,OAAO;YACLD,SAAS9C,GAAG,CAACd,MAAMM,GAAG,EAAE;gBAAEuD,MAAM;YAAQ;QAC1C;IACF;IACA,OAAO;QAAE/C,KAAK;YAAEb;YAAQiE,gBAAgBpD,IAAIoD,cAAc;QAAC;QAAGhB;QAAOU;IAAS;AAChF;AAEA,iFAAiF,GACjF,OAAO,SAASO,oBAAoBC,UAA8B,EAAEC,GAAY;QAGvED;IAFP,MAAM/D,QAAQf,uBAAuB+E;IACrC,IAAI,CAAChE,OAAO,OAAO;QAAEwD,MAAM;IAAQ;IACnC,QAAOO,2BAAAA,WAAWR,QAAQ,CAACpD,GAAG,CAACjB,iBAAiBc,mBAAzC+D,2BAAoD;QAAEP,MAAM;IAAQ;AAC7E;AAEA;;;CAGC,GACD,OAAO,SAASS,yBACdF,UAA8B,EAC9BC,GAAuB;IAEvB,MAAMrB,SAAmB,EAAE;IAC3B,KAAK,MAAM5C,SAASiE,IAAK;QACvB,MAAME,UAAUJ,oBAAoBC,YAAYhE;QAChD,IAAImE,QAAQV,IAAI,KAAK,UAAU,OAAO;YAAEA,MAAM;QAAS;QACvD,IAAIU,QAAQV,IAAI,KAAK,WAAW,CAACb,OAAOpC,QAAQ,CAAC2D,QAAQlE,KAAK,GAAG2C,OAAOnC,IAAI,CAAC0D,QAAQlE,KAAK;IAC5F;IACA,OAAO;QAAEwD,MAAM;QAAUb;IAAO;AAClC"}