@unbrained/pm-cli 2026.6.24 → 2026.7.1

package/dist/cli-bundle/chunks/{chunk-TSI32UEL.js.map → chunk-MAUKX7JC.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../../../../../../../../core/schema/item-types-file.ts"],"sourcesContent":["/**\n * @module core/schema/item-types-file\n *\n * Resolves configurable schema, fields, statuses, and workflows for Item Types File.\n */\nimport { BUILTIN_ITEM_TYPE_VALUES } from \"../../types/index.js\";\nimport type { ItemTypeDefinition } from \"../../types/index.js\";\nimport { toDefaultFolder } from \"../item/type-registry.js\";\n\nexport type { ItemTypeDefinition } from \"../../types/index.js\";\n\n/**\n * Pure logic for the `pm schema add-type` command and the create/update\n * invalid-type discoverability hint. The CLI command file (schema.ts) handles\n * IO/governance; everything testable and side-effect-free lives here so it can\n * be coverage-gated to 100%.\n */\n\nconst BUILTIN_NAME_LOOKUP = new Map<string, string>(\n  BUILTIN_ITEM_TYPE_VALUES.map((name) => [name.toLowerCase(), name]),\n);\n\n/**\n * The shape persisted at `.agents/pm/schema/types.json`.\n */\nexport interface ItemTypesFile {\n  definitions: ItemTypeDefinition[];\n}\n\n/**\n * Documents the normalized add type input payload exchanged by command, SDK, and package integrations.\n */\nexport interface NormalizedAddTypeInput {\n  name: string;\n  description?: string;\n  defaultStatus?: string;\n  folder?: string;\n  aliases: string[];\n}\n\n/**\n * Documents the raw add type input payload exchanged by command, SDK, and package integrations.\n */\nexport interface RawAddTypeInput {\n  name: string | undefined;\n  description?: string;\n  defaultStatus?: string;\n  folder?: string;\n  aliases?: string[];\n}\n\n/**\n * Documents the upsert item type result payload exchanged by command, SDK, and package integrations.\n */\nexport interface UpsertItemTypeResult {\n  file: ItemTypesFile;\n  /** The definition as stored after the upsert (existing fields preserved). */\n  definition: ItemTypeDefinition;\n  /** True when an existing definition with the same (case-insensitive) name was replaced. */\n  replaced: boolean;\n  /**\n   * The canonical name of the replaced definition (only present when `replaced`).\n   * Lets the caller detect a silent recase (e.g. \"Spike\" -> \"spike\") and warn.\n   */\n  previousName?: string;\n}\n\n/**\n * Custom item type names (and aliases) must be a single letter-led identifier\n * token: letters, digits, hyphen, or underscore — no whitespace or other\n * punctuation. This keeps names copy-pasteable as shell arguments and folder\n * slugs deterministic, matching the single-token PascalCase shape of every\n * built-in type. Folder/slug overlap between two distinct valid tokens (e.g.\n * \"Spike\"/\"Spikes\", \"code-review\"/\"code_review\") is rejected separately by\n * assertTypeFolderAvailable.\n */\nconst TYPE_NAME_TOKEN_PATTERN = /^[A-Za-z][A-Za-z0-9_-]*$/;\n\nfunction assertValidTypeToken(value: string, label: string): void {\n  if (!TYPE_NAME_TOKEN_PATTERN.test(value)) {\n    throw new Error(\n      `${label} \"${value}\" is not a valid identifier. Use a single letter-led token of letters, digits, hyphen, or underscore with no spaces or punctuation (e.g. \"Spike\" or \"code-review\").`,\n    );\n  }\n}\n\n/**\n * Documents the remove item type result payload exchanged by command, SDK, and package integrations.\n */\nexport interface RemoveItemTypeResult {\n  file: ItemTypesFile;\n  /** True when a matching definition existed and was dropped from the file. */\n  removed: boolean;\n  /** The removed definition, when one matched (case-insensitively) the requested name. */\n  definition?: ItemTypeDefinition;\n}\n\n/**\n * Returns the canonical built-in name when `name` collides (case-insensitively)\n * with a reserved built-in item type, otherwise undefined.\n */\nexport function matchBuiltinTypeName(name: string): string | undefined {\n  return BUILTIN_NAME_LOOKUP.get(name.trim().toLowerCase());\n}\n\n/**\n * Coerces a persisted `aliases` value into a string array, tolerating malformed\n * data (a non-array, or an array containing non-string entries) without throwing\n * or exploding a stray string into character aliases.\n */\nfunction coerceAliasArray(value: unknown): string[] {\n  return Array.isArray(value) ? value.filter((entry): entry is string => typeof entry === \"string\") : [];\n}\n\n/**\n * Escapes a value for safe interpolation inside a double-quoted shell string so\n * suggested copy-pasteable commands stay well-formed for names containing\n * `\"`, `` ` ``, `$`, or `\\`.\n */\nexport function escapeForDoubleQuotes(value: string): string {\n  return value.replace(/[\\\\\"`$]/g, (char) => `\\\\${char}`);\n}\n\nfunction dedupeAliases(values: Iterable<string>): string[] {\n  const seen = new Map<string, string>();\n  for (const value of values) {\n    const trimmed = value.trim();\n    if (trimmed.length === 0) {\n      continue;\n    }\n    const key = trimmed.toLowerCase();\n    if (!seen.has(key)) {\n      seen.set(key, trimmed);\n    }\n  }\n  return [...seen.values()].sort((left, right) => left.localeCompare(right));\n}\n\n/**\n * Validates and normalizes raw add-type CLI input. Throws a plain Error with a\n * stable message when the name is missing/empty or collides with a built-in;\n * the CLI layer maps these to PmCliError exit codes.\n */\nexport function normalizeAddTypeInput(raw: RawAddTypeInput): NormalizedAddTypeInput {\n  const name = (raw.name ?? \"\").trim();\n  if (name.length === 0) {\n    throw new Error(\"Type name must not be empty.\");\n  }\n  assertValidTypeToken(name, \"Type name\");\n  const builtinMatch = matchBuiltinTypeName(name);\n  if (builtinMatch) {\n    throw new Error(\n      `Cannot redefine built-in item type \"${builtinMatch}\". Built-in types are reserved: ${BUILTIN_ITEM_TYPE_VALUES.join(\", \")}.`,\n    );\n  }\n  const description = raw.description?.trim();\n  const defaultStatus = raw.defaultStatus?.trim();\n  const folder = raw.folder?.trim();\n  const aliases = dedupeAliases(raw.aliases ?? []);\n  for (const alias of aliases) {\n    assertValidTypeToken(alias, \"Alias\");\n    const aliasBuiltin = matchBuiltinTypeName(alias);\n    if (aliasBuiltin) {\n      throw new Error(\n        `Alias \"${alias}\" collides with built-in item type \"${aliasBuiltin}\". Built-in types are reserved: ${BUILTIN_ITEM_TYPE_VALUES.join(\", \")}.`,\n      );\n    }\n  }\n  return {\n    name,\n    description: description && description.length > 0 ? description : undefined,\n    defaultStatus: defaultStatus && defaultStatus.length > 0 ? defaultStatus : undefined,\n    folder: folder && folder.length > 0 ? folder : undefined,\n    aliases,\n  };\n}\n\n/**\n * Throws when the requested name or any alias collides (case-insensitively)\n * with the canonical name or an alias of a DIFFERENT existing definition.\n * Such collisions would make `pm create`/`pm update --type` resolve\n * ambiguously (the runtime registry keys a single lowercase alias map), so\n * they are rejected. Tokens belonging to the same-named definition being\n * upserted are ignored, keeping re-runs idempotent.\n */\nexport function assertAliasesAvailable(input: NormalizedAddTypeInput, existing: ItemTypesFile): void {\n  const selfLower = input.name.toLowerCase();\n  const taken = new Map<string, string>();\n  for (const definition of existing.definitions) {\n    if (typeof definition.name !== \"string\") {\n      continue;\n    }\n    const definitionName = definition.name.trim();\n    if (definitionName.length === 0 || definitionName.toLowerCase() === selfLower) {\n      continue;\n    }\n    taken.set(definitionName.toLowerCase(), definitionName);\n    for (const alias of coerceAliasArray(definition.aliases)) {\n      if (alias.trim().length > 0) {\n        taken.set(alias.trim().toLowerCase(), definitionName);\n      }\n    }\n  }\n  const nameOwner = taken.get(selfLower);\n  if (nameOwner) {\n    throw new Error(`Type name \"${input.name}\" collides with an alias of existing item type \"${nameOwner}\".`);\n  }\n  for (const alias of input.aliases) {\n    const owner = taken.get(alias.toLowerCase());\n    if (owner) {\n      throw new Error(`Alias \"${alias}\" already maps to existing item type \"${owner}\".`);\n    }\n  }\n}\n\n/**\n * Resolves the storage folder a definition would use: an explicit non-empty\n * `folder` wins, otherwise the deterministic slug derived from the name (the\n * same derivation the runtime registry applies, single-sourced from\n * type-registry.toDefaultFolder).\n */\nfunction resolveDefinitionFolder(name: string, folder: unknown): string {\n  if (typeof folder === \"string\" && folder.trim().length > 0) {\n    return folder.trim().toLowerCase();\n  }\n  return toDefaultFolder(name).toLowerCase();\n}\n\n/**\n * Throws when the requested type's storage folder would collide with a\n * DIFFERENT existing definition's folder. Two distinct type names can slug to\n * one folder (\"Spike\"/\"Spikes\", \"code-review\"/\"code_review\"), which would make\n * their item files share a directory and silently corrupt the taxonomy. The\n * same-named definition being upserted is ignored (folder reuse on re-run is\n * expected). Resolving the collision is a matter of passing a distinct\n * `--folder`, so the error says so.\n *\n * `reservedFolders` carries the folders already owned by built-in and extension\n * types (folder-slug → owner name); a custom type whose slug matches one of\n * those (e.g. \"Tasks\" → \"tasks\", owned by the built-in Task) is just as\n * corrupting as a custom-vs-custom collision, so both are checked.\n */\nexport function assertTypeFolderAvailable(\n  input: NormalizedAddTypeInput,\n  existing: ItemTypesFile,\n  reservedFolders?: ReadonlyMap<string, string>,\n): void {\n  const selfLower = input.name.toLowerCase();\n  const inputFolder = resolveDefinitionFolder(input.name, input.folder);\n  const fail = (ownerName: string): never => {\n    throw new Error(\n      `Item type \"${input.name}\" would store items in folder \"${inputFolder}\", which already belongs to existing item type \"${ownerName}\". Pass a distinct --folder to keep their storage separate.`,\n    );\n  };\n  for (const definition of existing.definitions) {\n    if (typeof definition.name !== \"string\") {\n      continue;\n    }\n    const definitionName = definition.name.trim();\n    if (definitionName.length === 0 || definitionName.toLowerCase() === selfLower) {\n      continue;\n    }\n    if (resolveDefinitionFolder(definitionName, definition.folder) === inputFolder) {\n      fail(definitionName);\n    }\n  }\n  const reservedOwner = reservedFolders?.get(inputFolder);\n  if (reservedOwner !== undefined && reservedOwner.toLowerCase() !== selfLower) {\n    fail(reservedOwner);\n  }\n}\n\n/**\n * Coerces an arbitrary parsed value from types.json into an ItemTypesFile.\n * Accepts the canonical `{ definitions: [...] }` shape, a bare array of\n * definitions, or a nested `{ item_types: { definitions: [...] } }` form, and\n * tolerates a missing/invalid file by returning an empty definitions list.\n */\nexport function parseItemTypesFile(raw: string | null | undefined): ItemTypesFile {\n  if (raw === null || raw === undefined || raw.trim().length === 0) {\n    return { definitions: [] };\n  }\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(raw) as unknown;\n  } catch {\n    throw new Error(\"schema/types.json contains invalid JSON.\");\n  }\n  return { definitions: extractDefinitions(parsed) };\n}\n\nfunction extractDefinitions(parsed: unknown): ItemTypeDefinition[] {\n  const candidate = selectDefinitionsArray(parsed);\n  if (!candidate) {\n    return [];\n  }\n  const definitions: ItemTypeDefinition[] = [];\n  for (const entry of candidate) {\n    if (typeof entry !== \"object\" || entry === null || Array.isArray(entry)) {\n      continue;\n    }\n    const record = entry as Record<string, unknown>;\n    if (typeof record.name !== \"string\" || record.name.trim().length === 0) {\n      continue;\n    }\n    definitions.push(record as unknown as ItemTypeDefinition);\n  }\n  return definitions;\n}\n\nfunction selectDefinitionsArray(parsed: unknown): unknown[] | undefined {\n  if (Array.isArray(parsed)) {\n    return parsed;\n  }\n  if (typeof parsed !== \"object\" || parsed === null) {\n    return undefined;\n  }\n  const record = parsed as Record<string, unknown>;\n  if (Array.isArray(record.definitions)) {\n    return record.definitions;\n  }\n  if (typeof record.item_types === \"object\" && record.item_types !== null) {\n    const nested = record.item_types as Record<string, unknown>;\n    if (Array.isArray(nested.definitions)) {\n      return nested.definitions;\n    }\n  }\n  return undefined;\n}\n\n/**\n * Idempotent UPSERT of a custom item type into the parsed file. Matching is\n * case-insensitive by name. When a definition already exists, fields supplied\n * in `input` override the previous values; aliases are merged (deduped); other\n * fields not addressed by add-type flags are preserved untouched.\n */\nexport function upsertItemType(file: ItemTypesFile, input: NormalizedAddTypeInput): UpsertItemTypeResult {\n  const lowerName = input.name.toLowerCase();\n  const definitions = file.definitions.slice();\n  const existingIndex = definitions.findIndex(\n    (definition) => typeof definition.name === \"string\" && definition.name.trim().toLowerCase() === lowerName,\n  );\n  const existing = existingIndex >= 0 ? definitions[existingIndex] : undefined;\n\n  const mergedAliases = dedupeAliases([...coerceAliasArray(existing?.aliases), ...input.aliases]);\n\n  const next: ItemTypeDefinition = {\n    ...(existing ?? {}),\n    name: input.name,\n  };\n  if (input.folder !== undefined) {\n    next.folder = input.folder;\n  }\n  if (mergedAliases.length > 0) {\n    next.aliases = mergedAliases;\n  } else if (next.aliases !== undefined) {\n    delete next.aliases;\n  }\n  applyAttribute(next, \"description\", input.description);\n  applyAttribute(next, \"default_status\", input.defaultStatus);\n\n  if (existingIndex >= 0) {\n    definitions[existingIndex] = next;\n  } else {\n    definitions.push(next);\n  }\n  definitions.sort((left, right) => left.name.localeCompare(right.name));\n\n  return {\n    file: { definitions },\n    definition: next,\n    replaced: existingIndex >= 0,\n    ...(existing && typeof existing.name === \"string\" ? { previousName: existing.name } : {}),\n  };\n}\n\n/**\n * Removes a custom item type definition from the parsed file by name\n * (case-insensitive). Throws a plain Error when `name` is empty or collides\n * with a reserved built-in type (built-ins are not stored in the file and must\n * never be deletable). Returns `removed: false` when no matching custom\n * definition exists so the CLI layer can treat the call as an idempotent no-op.\n */\nexport function removeItemType(file: ItemTypesFile, name: string | undefined): RemoveItemTypeResult {\n  const trimmed = (name ?? \"\").trim();\n  if (trimmed.length === 0) {\n    throw new Error(\"Type name must not be empty.\");\n  }\n  const builtinMatch = matchBuiltinTypeName(trimmed);\n  if (builtinMatch) {\n    throw new Error(\n      `Cannot remove built-in item type \"${builtinMatch}\". Built-in types are reserved: ${BUILTIN_ITEM_TYPE_VALUES.join(\", \")}.`,\n    );\n  }\n  const lowerName = trimmed.toLowerCase();\n  const definitions = file.definitions.slice();\n  const existingIndex = definitions.findIndex(\n    (definition) => typeof definition.name === \"string\" && definition.name.trim().toLowerCase() === lowerName,\n  );\n  if (existingIndex < 0) {\n    return { file: { definitions }, removed: false };\n  }\n  const [definition] = definitions.splice(existingIndex, 1);\n  return { file: { definitions }, removed: true, definition };\n}\n\nfunction applyAttribute(definition: ItemTypeDefinition, key: string, value: string | undefined): void {\n  const record = definition as unknown as Record<string, unknown>;\n  if (value !== undefined) {\n    record[key] = value;\n  }\n}\n\n/**\n * Serializes the item types file with a trailing newline (matches the rest of\n * the schema scaffold files written by pm).\n */\nexport function serializeItemTypesFile(file: ItemTypesFile): string {\n  return `${JSON.stringify({ definitions: file.definitions }, null, 2)}\\n`;\n}\n\n/**\n * Appends a discoverable hint to the \"Invalid type\" error so agents learn that\n * custom types exist and how to register one. Quotes are chosen so the printed\n * line is copy-pasteable as a shell command.\n */\nexport function buildInvalidTypeHint(name: string, typesFilePath?: string): string {\n  const safeName = name.trim().length > 0 ? name.trim() : name;\n  const target = typesFilePath?.trim() || \".agents/pm/schema/types.json\";\n  return `To register a custom type, run: pm schema add-type \"${escapeForDoubleQuotes(safeName)}\" (writes ${target}).`;\n}\n\n/**\n * Builds the full invalid-type error message used by create/update: the\n * existing \"Invalid type ... Allowed: ...\" line plus the discoverable hint.\n * `typesFilePath` should be the resolved schema/types.json path for the active\n * tracker (see {@link resolveItemTypesFilePath}) so the hint reflects a custom\n * `--pm-path` instead of the hardcoded `.agents/pm` default.\n */\nexport function buildInvalidTypeError(name: string, allowedTypes: readonly string[], typesFilePath?: string): string {\n  return `Invalid type value \"${name}\". Allowed: ${allowedTypes.join(\", \")}. ${buildInvalidTypeHint(name, typesFilePath)}`;\n}\n"],"names":["definition"],"mappings":";;;;;;;;;;AAkBA,IAAM,sBAAsB,IAAI,IAC9B,yBAAyB,IAAI,CAAC,SAAS,CAAC,KAAK,YAAW,GAAI,IAAI,CAAC,CAAC;AAyDpE,IAAM,0BAA0B;AAEhC,SAAS,qBAAqB,OAAe,OAAa;AACxD,MAAI,CAAC,wBAAwB,KAAK,KAAK,GAAG;AACxC,UAAM,IAAI,MACR,GAAG,KAAK,KAAK,KAAK,qKAAqK;EAE3L;AACF;AAiBM,SAAU,qBAAqB,MAAY;AAC/C,SAAO,oBAAoB,IAAI,KAAK,KAAI,EAAG,YAAW,CAAE;AAC1D;AAOA,SAAS,iBAAiB,OAAc;AACtC,SAAO,MAAM,QAAQ,KAAK,IAAI,MAAM,OAAO,CAAC,UAA2B,OAAO,UAAU,QAAQ,IAAI,CAAA;AACtG;AAOM,SAAU,sBAAsB,OAAa;AACjD,SAAO,MAAM,QAAQ,YAAY,CAAC,SAAS,KAAK,IAAI,EAAE;AACxD;AAEA,SAAS,cAAc,QAAwB;AAC7C,QAAM,OAAO,oBAAI,IAAG;AACpB,aAAW,SAAS,QAAQ;AAC1B,UAAM,UAAU,MAAM,KAAI;AAC1B,QAAI,QAAQ,WAAW,GAAG;AACxB;IACF;AACA,UAAM,MAAM,QAAQ,YAAW;AAC/B,QAAI,CAAC,KAAK,IAAI,GAAG,GAAG;AAClB,WAAK,IAAI,KAAK,OAAO;IACvB;EACF;AACA,SAAO,CAAC,GAAG,KAAK,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAC3E;AAOM,SAAU,sBAAsB,KAAoB;AACxD,QAAM,QAAQ,IAAI,QAAQ,IAAI,KAAI;AAClC,MAAI,KAAK,WAAW,GAAG;AACrB,UAAM,IAAI,MAAM,8BAA8B;EAChD;AACA,uBAAqB,MAAM,WAAW;AACtC,QAAM,eAAe,qBAAqB,IAAI;AAC9C,MAAI,cAAc;AAChB,UAAM,IAAI,MACR,uCAAuC,YAAY,mCAAmC,yBAAyB,KAAK,IAAI,CAAC,GAAG;EAEhI;AACA,QAAM,cAAc,IAAI,aAAa,KAAI;AACzC,QAAM,gBAAgB,IAAI,eAAe,KAAI;AAC7C,QAAM,SAAS,IAAI,QAAQ,KAAI;AAC/B,QAAM,UAAU,cAAc,IAAI,WAAW,CAAA,CAAE;AAC/C,aAAW,SAAS,SAAS;AAC3B,yBAAqB,OAAO,OAAO;AACnC,UAAM,eAAe,qBAAqB,KAAK;AAC/C,QAAI,cAAc;AAChB,YAAM,IAAI,MACR,UAAU,KAAK,uCAAuC,YAAY,mCAAmC,yBAAyB,KAAK,IAAI,CAAC,GAAG;IAE/I;EACF;AACA,SAAO;IACL;IACA,aAAa,eAAe,YAAY,SAAS,IAAI,cAAc;IACnE,eAAe,iBAAiB,cAAc,SAAS,IAAI,gBAAgB;IAC3E,QAAQ,UAAU,OAAO,SAAS,IAAI,SAAS;IAC/C;;AAEJ;AAUM,SAAU,uBAAuB,OAA+B,UAAuB;AAC3F,QAAM,YAAY,MAAM,KAAK,YAAW;AACxC,QAAM,QAAQ,oBAAI,IAAG;AACrB,aAAW,cAAc,SAAS,aAAa;AAC7C,QAAI,OAAO,WAAW,SAAS,UAAU;AACvC;IACF;AACA,UAAM,iBAAiB,WAAW,KAAK,KAAI;AAC3C,QAAI,eAAe,WAAW,KAAK,eAAe,YAAW,MAAO,WAAW;AAC7E;IACF;AACA,UAAM,IAAI,eAAe,YAAW,GAAI,cAAc;AACtD,eAAW,SAAS,iBAAiB,WAAW,OAAO,GAAG;AACxD,UAAI,MAAM,KAAI,EAAG,SAAS,GAAG;AAC3B,cAAM,IAAI,MAAM,KAAI,EAAG,YAAW,GAAI,cAAc;MACtD;IACF;EACF;AACA,QAAM,YAAY,MAAM,IAAI,SAAS;AACrC,MAAI,WAAW;AACb,UAAM,IAAI,MAAM,cAAc,MAAM,IAAI,mDAAmD,SAAS,IAAI;EAC1G;AACA,aAAW,SAAS,MAAM,SAAS;AACjC,UAAM,QAAQ,MAAM,IAAI,MAAM,YAAW,CAAE;AAC3C,QAAI,OAAO;AACT,YAAM,IAAI,MAAM,UAAU,KAAK,yCAAyC,KAAK,IAAI;IACnF;EACF;AACF;AAQA,SAAS,wBAAwB,MAAc,QAAe;AAC5D,MAAI,OAAO,WAAW,YAAY,OAAO,KAAI,EAAG,SAAS,GAAG;AAC1D,WAAO,OAAO,KAAI,EAAG,YAAW;EAClC;AACA,SAAO,gBAAgB,IAAI,EAAE,YAAW;AAC1C;AAgBM,SAAU,0BACd,OACA,UACA,iBAA6C;AAE7C,QAAM,YAAY,MAAM,KAAK,YAAW;AACxC,QAAM,cAAc,wBAAwB,MAAM,MAAM,MAAM,MAAM;AACpE,QAAM,OAAO,CAAC,cAA4B;AACxC,UAAM,IAAI,MACR,cAAc,MAAM,IAAI,kCAAkC,WAAW,mDAAmD,SAAS,6DAA6D;EAElM;AACA,aAAW,cAAc,SAAS,aAAa;AAC7C,QAAI,OAAO,WAAW,SAAS,UAAU;AACvC;IACF;AACA,UAAM,iBAAiB,WAAW,KAAK,KAAI;AAC3C,QAAI,eAAe,WAAW,KAAK,eAAe,YAAW,MAAO,WAAW;AAC7E;IACF;AACA,QAAI,wBAAwB,gBAAgB,WAAW,MAAM,MAAM,aAAa;AAC9E,WAAK,cAAc;IACrB;EACF;AACA,QAAM,gBAAgB,iBAAiB,IAAI,WAAW;AACtD,MAAI,kBAAkB,UAAa,cAAc,YAAW,MAAO,WAAW;AAC5E,SAAK,aAAa;EACpB;AACF;AAQM,SAAU,mBAAmB,KAA8B;AAC/D,MAAI,QAAQ,QAAQ,QAAQ,UAAa,IAAI,KAAI,EAAG,WAAW,GAAG;AAChE,WAAO,EAAE,aAAa,CAAA,EAAE;EAC1B;AACA,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,GAAG;EACzB,QAAQ;AACN,UAAM,IAAI,MAAM,0CAA0C;EAC5D;AACA,SAAO,EAAE,aAAa,mBAAmB,MAAM,EAAC;AAClD;AAEA,SAAS,mBAAmB,QAAe;AACzC,QAAM,YAAY,uBAAuB,MAAM;AAC/C,MAAI,CAAC,WAAW;AACd,WAAO,CAAA;EACT;AACA,QAAM,cAAoC,CAAA;AAC1C,aAAW,SAAS,WAAW;AAC7B,QAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG;AACvE;IACF;AACA,UAAM,SAAS;AACf,QAAI,OAAO,OAAO,SAAS,YAAY,OAAO,KAAK,KAAI,EAAG,WAAW,GAAG;AACtE;IACF;AACA,gBAAY,KAAK,MAAuC;EAC1D;AACA,SAAO;AACT;AAEA,SAAS,uBAAuB,QAAe;AAC7C,MAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,WAAO;EACT;AACA,MAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AACjD,WAAO;EACT;AACA,QAAM,SAAS;AACf,MAAI,MAAM,QAAQ,OAAO,WAAW,GAAG;AACrC,WAAO,OAAO;EAChB;AACA,MAAI,OAAO,OAAO,eAAe,YAAY,OAAO,eAAe,MAAM;AACvE,UAAM,SAAS,OAAO;AACtB,QAAI,MAAM,QAAQ,OAAO,WAAW,GAAG;AACrC,aAAO,OAAO;IAChB;EACF;AACA,SAAO;AACT;AAQM,SAAU,eAAe,MAAqB,OAA6B;AAC/E,QAAM,YAAY,MAAM,KAAK,YAAW;AACxC,QAAM,cAAc,KAAK,YAAY,MAAK;AAC1C,QAAM,gBAAgB,YAAY,UAChC,CAAC,eAAe,OAAO,WAAW,SAAS,YAAY,WAAW,KAAK,KAAI,EAAG,YAAW,MAAO,SAAS;AAE3G,QAAM,WAAW,iBAAiB,IAAI,YAAY,aAAa,IAAI;AAEnE,QAAM,gBAAgB,cAAc,CAAC,GAAG,iBAAiB,UAAU,OAAO,GAAG,GAAG,MAAM,OAAO,CAAC;AAE9F,QAAM,OAA2B;IAC/B,GAAI,YAAY,CAAA;IAChB,MAAM,MAAM;;AAEd,MAAI,MAAM,WAAW,QAAW;AAC9B,SAAK,SAAS,MAAM;EACtB;AACA,MAAI,cAAc,SAAS,GAAG;AAC5B,SAAK,UAAU;EACjB,WAAW,KAAK,YAAY,QAAW;AACrC,WAAO,KAAK;EACd;AACA,iBAAe,MAAM,eAAe,MAAM,WAAW;AACrD,iBAAe,MAAM,kBAAkB,MAAM,aAAa;AAE1D,MAAI,iBAAiB,GAAG;AACtB,gBAAY,aAAa,IAAI;EAC/B,OAAO;AACL,gBAAY,KAAK,IAAI;EACvB;AACA,cAAY,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AAErE,SAAO;IACL,MAAM,EAAE,YAAW;IACnB,YAAY;IACZ,UAAU,iBAAiB;IAC3B,GAAI,YAAY,OAAO,SAAS,SAAS,WAAW,EAAE,cAAc,SAAS,KAAI,IAAK,CAAA;;AAE1F;AASM,SAAU,eAAe,MAAqB,MAAwB;AAC1E,QAAM,WAAW,QAAQ,IAAI,KAAI;AACjC,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,MAAM,8BAA8B;EAChD;AACA,QAAM,eAAe,qBAAqB,OAAO;AACjD,MAAI,cAAc;AAChB,UAAM,IAAI,MACR,qCAAqC,YAAY,mCAAmC,yBAAyB,KAAK,IAAI,CAAC,GAAG;EAE9H;AACA,QAAM,YAAY,QAAQ,YAAW;AACrC,QAAM,cAAc,KAAK,YAAY,MAAK;AAC1C,QAAM,gBAAgB,YAAY,UAChC,CAACA,gBAAe,OAAOA,YAAW,SAAS,YAAYA,YAAW,KAAK,KAAI,EAAG,YAAW,MAAO,SAAS;AAE3G,MAAI,gBAAgB,GAAG;AACrB,WAAO,EAAE,MAAM,EAAE,YAAW,GAAI,SAAS,MAAK;EAChD;AACA,QAAM,CAAC,UAAU,IAAI,YAAY,OAAO,eAAe,CAAC;AACxD,SAAO,EAAE,MAAM,EAAE,YAAW,GAAI,SAAS,MAAM,WAAU;AAC3D;AAEA,SAAS,eAAe,YAAgC,KAAa,OAAyB;AAC5F,QAAM,SAAS;AACf,MAAI,UAAU,QAAW;AACvB,WAAO,GAAG,IAAI;EAChB;AACF;AAMM,SAAU,uBAAuB,MAAmB;AACxD,SAAO,GAAG,KAAK,UAAU,EAAE,aAAa,KAAK,YAAW,GAAI,MAAM,CAAC,CAAC;;AACtE;AAOM,SAAU,qBAAqB,MAAc,eAAsB;AACvE,QAAM,WAAW,KAAK,KAAI,EAAG,SAAS,IAAI,KAAK,KAAI,IAAK;AACxD,QAAM,SAAS,eAAe,KAAI,KAAM;AACxC,SAAO,uDAAuD,sBAAsB,QAAQ,CAAC,aAAa,MAAM;AAClH;AASM,SAAU,sBAAsB,MAAc,cAAiC,eAAsB;AACzG,SAAO,uBAAuB,IAAI,eAAe,aAAa,KAAK,IAAI,CAAC,KAAK,qBAAqB,MAAM,aAAa,CAAC;AACxH","debugId":"be0afc71-fb35-553a-bad4-2a34c72a8d48"}
+{"version":3,"sources":["../../../../../../../../core/schema/item-types-file.ts"],"sourcesContent":["/**\n * @module core/schema/item-types-file\n *\n * Resolves configurable schema, fields, statuses, and workflows for Item Types File.\n */\nimport { BUILTIN_ITEM_TYPE_VALUES } from \"../../types/index.js\";\nimport type { ItemTypeDefinition } from \"../../types/index.js\";\nimport { toDefaultFolder } from \"../item/type-registry.js\";\n\nexport type { ItemTypeDefinition } from \"../../types/index.js\";\n\n/**\n * Pure logic for the `pm schema add-type` command and the create/update\n * invalid-type discoverability hint. The CLI command file (schema.ts) handles\n * IO/governance; everything testable and side-effect-free lives here so it can\n * be coverage-gated to 100%.\n */\n\nconst BUILTIN_NAME_LOOKUP = new Map<string, string>(\n  BUILTIN_ITEM_TYPE_VALUES.map((name) => [name.toLowerCase(), name]),\n);\n\n/**\n * The shape persisted at `.agents/pm/schema/types.json`.\n */\nexport interface ItemTypesFile {\n  definitions: ItemTypeDefinition[];\n}\n\n/**\n * Documents the normalized add type input payload exchanged by command, SDK, and package integrations.\n */\nexport interface NormalizedAddTypeInput {\n  name: string;\n  description?: string;\n  defaultStatus?: string;\n  folder?: string;\n  aliases: string[];\n}\n\n/**\n * Documents the raw add type input payload exchanged by command, SDK, and package integrations.\n */\nexport interface RawAddTypeInput {\n  name: string | undefined;\n  description?: string;\n  defaultStatus?: string;\n  folder?: string;\n  aliases?: string[];\n}\n\n/**\n * Documents the upsert item type result payload exchanged by command, SDK, and package integrations.\n */\nexport interface UpsertItemTypeResult {\n  file: ItemTypesFile;\n  /** The definition as stored after the upsert (existing fields preserved). */\n  definition: ItemTypeDefinition;\n  /** True when an existing definition with the same (case-insensitive) name was replaced. */\n  replaced: boolean;\n  /**\n   * The canonical name of the replaced definition (only present when `replaced`).\n   * Lets the caller detect a silent recase (e.g. \"Spike\" -> \"spike\") and warn.\n   */\n  previousName?: string;\n}\n\n/**\n * Custom item type names (and aliases) must be a single letter-led identifier\n * token: letters, digits, hyphen, or underscore — no whitespace or other\n * punctuation. This keeps names copy-pasteable as shell arguments and folder\n * slugs deterministic, matching the single-token PascalCase shape of every\n * built-in type. Folder/slug overlap between two distinct valid tokens (e.g.\n * \"Spike\"/\"Spikes\", \"code-review\"/\"code_review\") is rejected separately by\n * assertTypeFolderAvailable.\n */\nconst TYPE_NAME_TOKEN_PATTERN = /^[A-Za-z][A-Za-z0-9_-]*$/;\n\nfunction assertValidTypeToken(value: string, label: string): void {\n  if (!TYPE_NAME_TOKEN_PATTERN.test(value)) {\n    throw new Error(\n      `${label} \"${value}\" is not a valid identifier. Use a single letter-led token of letters, digits, hyphen, or underscore with no spaces or punctuation (e.g. \"Spike\" or \"code-review\").`,\n    );\n  }\n}\n\n/**\n * Documents the remove item type result payload exchanged by command, SDK, and package integrations.\n */\nexport interface RemoveItemTypeResult {\n  file: ItemTypesFile;\n  /** True when a matching definition existed and was dropped from the file. */\n  removed: boolean;\n  /** The removed definition, when one matched (case-insensitively) the requested name. */\n  definition?: ItemTypeDefinition;\n}\n\n/**\n * Returns the canonical built-in name when `name` collides (case-insensitively)\n * with a reserved built-in item type, otherwise undefined.\n */\nexport function matchBuiltinTypeName(name: string): string | undefined {\n  return BUILTIN_NAME_LOOKUP.get(name.trim().toLowerCase());\n}\n\n/**\n * Coerces a persisted `aliases` value into a string array, tolerating malformed\n * data (a non-array, or an array containing non-string entries) without throwing\n * or exploding a stray string into character aliases.\n */\nfunction coerceAliasArray(value: unknown): string[] {\n  return Array.isArray(value) ? value.filter((entry): entry is string => typeof entry === \"string\") : [];\n}\n\n/**\n * Escapes a value for safe interpolation inside a double-quoted shell string so\n * suggested copy-pasteable commands stay well-formed for names containing\n * `\"`, `` ` ``, `$`, or `\\`.\n */\nexport function escapeForDoubleQuotes(value: string): string {\n  return value.replace(/[\\\\\"`$]/g, (char) => `\\\\${char}`);\n}\n\nfunction dedupeAliases(values: Iterable<string>): string[] {\n  const seen = new Map<string, string>();\n  for (const value of values) {\n    const trimmed = value.trim();\n    if (trimmed.length === 0) {\n      continue;\n    }\n    const key = trimmed.toLowerCase();\n    if (!seen.has(key)) {\n      seen.set(key, trimmed);\n    }\n  }\n  return [...seen.values()].sort((left, right) => left.localeCompare(right));\n}\n\n/**\n * Validates and normalizes raw add-type CLI input. Throws a plain Error with a\n * stable message when the name is missing/empty or collides with a built-in;\n * the CLI layer maps these to PmCliError exit codes.\n */\nexport function normalizeAddTypeInput(raw: RawAddTypeInput): NormalizedAddTypeInput {\n  const name = (raw.name ?? \"\").trim();\n  if (name.length === 0) {\n    throw new Error(\"Type name must not be empty.\");\n  }\n  assertValidTypeToken(name, \"Type name\");\n  const builtinMatch = matchBuiltinTypeName(name);\n  if (builtinMatch) {\n    throw new Error(\n      `Cannot redefine built-in item type \"${builtinMatch}\". Built-in types are reserved: ${BUILTIN_ITEM_TYPE_VALUES.join(\", \")}.`,\n    );\n  }\n  const description = raw.description?.trim();\n  const defaultStatus = raw.defaultStatus?.trim();\n  const folder = raw.folder?.trim();\n  const aliases = dedupeAliases(raw.aliases ?? []);\n  for (const alias of aliases) {\n    assertValidTypeToken(alias, \"Alias\");\n    const aliasBuiltin = matchBuiltinTypeName(alias);\n    if (aliasBuiltin) {\n      throw new Error(\n        `Alias \"${alias}\" collides with built-in item type \"${aliasBuiltin}\". Built-in types are reserved: ${BUILTIN_ITEM_TYPE_VALUES.join(\", \")}.`,\n      );\n    }\n  }\n  return {\n    name,\n    description: description && description.length > 0 ? description : undefined,\n    defaultStatus: defaultStatus && defaultStatus.length > 0 ? defaultStatus : undefined,\n    folder: folder && folder.length > 0 ? folder : undefined,\n    aliases,\n  };\n}\n\n/**\n * Throws when the requested name or any alias collides (case-insensitively)\n * with the canonical name or an alias of a DIFFERENT existing definition.\n * Such collisions would make `pm create`/`pm update --type` resolve\n * ambiguously (the runtime registry keys a single lowercase alias map), so\n * they are rejected. Tokens belonging to the same-named definition being\n * upserted are ignored, keeping re-runs idempotent.\n */\nexport function assertAliasesAvailable(input: NormalizedAddTypeInput, existing: ItemTypesFile): void {\n  const selfLower = input.name.toLowerCase();\n  const taken = new Map<string, string>();\n  for (const definition of existing.definitions) {\n    if (typeof definition.name !== \"string\") {\n      continue;\n    }\n    const definitionName = definition.name.trim();\n    if (definitionName.length === 0 || definitionName.toLowerCase() === selfLower) {\n      continue;\n    }\n    taken.set(definitionName.toLowerCase(), definitionName);\n    for (const alias of coerceAliasArray(definition.aliases)) {\n      if (alias.trim().length > 0) {\n        taken.set(alias.trim().toLowerCase(), definitionName);\n      }\n    }\n  }\n  const nameOwner = taken.get(selfLower);\n  if (nameOwner) {\n    throw new Error(`Type name \"${input.name}\" collides with an alias of existing item type \"${nameOwner}\".`);\n  }\n  for (const alias of input.aliases) {\n    const owner = taken.get(alias.toLowerCase());\n    if (owner) {\n      throw new Error(`Alias \"${alias}\" already maps to existing item type \"${owner}\".`);\n    }\n  }\n}\n\n/**\n * Resolves the storage folder a definition would use: an explicit non-empty\n * `folder` wins, otherwise the deterministic slug derived from the name (the\n * same derivation the runtime registry applies, single-sourced from\n * type-registry.toDefaultFolder).\n */\nfunction resolveDefinitionFolder(name: string, folder: unknown): string {\n  if (typeof folder === \"string\" && folder.trim().length > 0) {\n    return folder.trim().toLowerCase();\n  }\n  return toDefaultFolder(name).toLowerCase();\n}\n\n/**\n * Throws when the requested type's storage folder would collide with a\n * DIFFERENT existing definition's folder. Two distinct type names can slug to\n * one folder (\"Spike\"/\"Spikes\", \"code-review\"/\"code_review\"), which would make\n * their item files share a directory and silently corrupt the taxonomy. The\n * same-named definition being upserted is ignored (folder reuse on re-run is\n * expected). Resolving the collision is a matter of passing a distinct\n * `--folder`, so the error says so.\n *\n * `reservedFolders` carries the folders already owned by built-in and extension\n * types (folder-slug → owner name); a custom type whose slug matches one of\n * those (e.g. \"Tasks\" → \"tasks\", owned by the built-in Task) is just as\n * corrupting as a custom-vs-custom collision, so both are checked.\n */\nexport function assertTypeFolderAvailable(\n  input: NormalizedAddTypeInput,\n  existing: ItemTypesFile,\n  reservedFolders?: ReadonlyMap<string, string>,\n): void {\n  const selfLower = input.name.toLowerCase();\n  const inputFolder = resolveDefinitionFolder(input.name, input.folder);\n  const fail = (ownerName: string): never => {\n    throw new Error(\n      `Item type \"${input.name}\" would store items in folder \"${inputFolder}\", which already belongs to existing item type \"${ownerName}\". Pass a distinct --folder to keep their storage separate.`,\n    );\n  };\n  for (const definition of existing.definitions) {\n    if (typeof definition.name !== \"string\") {\n      continue;\n    }\n    const definitionName = definition.name.trim();\n    if (definitionName.length === 0 || definitionName.toLowerCase() === selfLower) {\n      continue;\n    }\n    if (resolveDefinitionFolder(definitionName, definition.folder) === inputFolder) {\n      fail(definitionName);\n    }\n  }\n  const reservedOwner = reservedFolders?.get(inputFolder);\n  if (reservedOwner !== undefined && reservedOwner.toLowerCase() !== selfLower) {\n    fail(reservedOwner);\n  }\n}\n\n/**\n * Coerces an arbitrary parsed value from types.json into an ItemTypesFile.\n * Accepts the canonical `{ definitions: [...] }` shape, a bare array of\n * definitions, or a nested `{ item_types: { definitions: [...] } }` form, and\n * tolerates a missing/invalid file by returning an empty definitions list.\n */\nexport function parseItemTypesFile(raw: string | null | undefined): ItemTypesFile {\n  if (raw === null || raw === undefined || raw.trim().length === 0) {\n    return { definitions: [] };\n  }\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(raw) as unknown;\n  } catch {\n    throw new Error(\"schema/types.json contains invalid JSON.\");\n  }\n  return { definitions: extractDefinitions(parsed) };\n}\n\nfunction extractDefinitions(parsed: unknown): ItemTypeDefinition[] {\n  const candidate = selectDefinitionsArray(parsed);\n  if (!candidate) {\n    return [];\n  }\n  const definitions: ItemTypeDefinition[] = [];\n  for (const entry of candidate) {\n    if (typeof entry !== \"object\" || entry === null || Array.isArray(entry)) {\n      continue;\n    }\n    const record = entry as Record<string, unknown>;\n    if (typeof record.name !== \"string\" || record.name.trim().length === 0) {\n      continue;\n    }\n    definitions.push(record as unknown as ItemTypeDefinition);\n  }\n  return definitions;\n}\n\nfunction selectDefinitionsArray(parsed: unknown): unknown[] | undefined {\n  if (Array.isArray(parsed)) {\n    return parsed;\n  }\n  if (typeof parsed !== \"object\" || parsed === null) {\n    return undefined;\n  }\n  const record = parsed as Record<string, unknown>;\n  if (Array.isArray(record.definitions)) {\n    return record.definitions;\n  }\n  if (typeof record.item_types === \"object\" && record.item_types !== null) {\n    const nested = record.item_types as Record<string, unknown>;\n    if (Array.isArray(nested.definitions)) {\n      return nested.definitions;\n    }\n  }\n  return undefined;\n}\n\n/**\n * Idempotent UPSERT of a custom item type into the parsed file. Matching is\n * case-insensitive by name. When a definition already exists, fields supplied\n * in `input` override the previous values; aliases are merged (deduped); other\n * fields not addressed by add-type flags are preserved untouched.\n */\nexport function upsertItemType(file: ItemTypesFile, input: NormalizedAddTypeInput): UpsertItemTypeResult {\n  const lowerName = input.name.toLowerCase();\n  const definitions = file.definitions.slice();\n  const existingIndex = definitions.findIndex(\n    (definition) => typeof definition.name === \"string\" && definition.name.trim().toLowerCase() === lowerName,\n  );\n  const existing = existingIndex >= 0 ? definitions[existingIndex] : undefined;\n\n  const mergedAliases = dedupeAliases([...coerceAliasArray(existing?.aliases), ...input.aliases]);\n\n  const next: ItemTypeDefinition = {\n    ...existing,\n    name: input.name,\n  };\n  if (input.folder !== undefined) {\n    next.folder = input.folder;\n  }\n  if (mergedAliases.length > 0) {\n    next.aliases = mergedAliases;\n  } else if (next.aliases !== undefined) {\n    delete next.aliases;\n  }\n  applyAttribute(next, \"description\", input.description);\n  applyAttribute(next, \"default_status\", input.defaultStatus);\n\n  if (existingIndex >= 0) {\n    definitions[existingIndex] = next;\n  } else {\n    definitions.push(next);\n  }\n  definitions.sort((left, right) => left.name.localeCompare(right.name));\n\n  return {\n    file: { definitions },\n    definition: next,\n    replaced: existingIndex >= 0,\n    ...(existing && typeof existing.name === \"string\" ? { previousName: existing.name } : {}),\n  };\n}\n\n/**\n * Removes a custom item type definition from the parsed file by name\n * (case-insensitive). Throws a plain Error when `name` is empty or collides\n * with a reserved built-in type (built-ins are not stored in the file and must\n * never be deletable). Returns `removed: false` when no matching custom\n * definition exists so the CLI layer can treat the call as an idempotent no-op.\n */\nexport function removeItemType(file: ItemTypesFile, name: string | undefined): RemoveItemTypeResult {\n  const trimmed = (name ?? \"\").trim();\n  if (trimmed.length === 0) {\n    throw new Error(\"Type name must not be empty.\");\n  }\n  const builtinMatch = matchBuiltinTypeName(trimmed);\n  if (builtinMatch) {\n    throw new Error(\n      `Cannot remove built-in item type \"${builtinMatch}\". Built-in types are reserved: ${BUILTIN_ITEM_TYPE_VALUES.join(\", \")}.`,\n    );\n  }\n  const lowerName = trimmed.toLowerCase();\n  const definitions = file.definitions.slice();\n  const existingIndex = definitions.findIndex(\n    (definition) => typeof definition.name === \"string\" && definition.name.trim().toLowerCase() === lowerName,\n  );\n  if (existingIndex < 0) {\n    return { file: { definitions }, removed: false };\n  }\n  const [definition] = definitions.splice(existingIndex, 1);\n  return { file: { definitions }, removed: true, definition };\n}\n\nfunction applyAttribute(definition: ItemTypeDefinition, key: string, value: string | undefined): void {\n  const record = definition as unknown as Record<string, unknown>;\n  if (value !== undefined) {\n    record[key] = value;\n  }\n}\n\n/**\n * Serializes the item types file with a trailing newline (matches the rest of\n * the schema scaffold files written by pm).\n */\nexport function serializeItemTypesFile(file: ItemTypesFile): string {\n  return `${JSON.stringify({ definitions: file.definitions }, null, 2)}\\n`;\n}\n\n/**\n * Appends a discoverable hint to the \"Invalid type\" error so agents learn that\n * custom types exist and how to register one. Quotes are chosen so the printed\n * line is copy-pasteable as a shell command.\n */\nexport function buildInvalidTypeHint(name: string, typesFilePath?: string): string {\n  const safeName = name.trim().length > 0 ? name.trim() : name;\n  const target = typesFilePath?.trim() || \".agents/pm/schema/types.json\";\n  return `To register a custom type, run: pm schema add-type \"${escapeForDoubleQuotes(safeName)}\" (writes ${target}).`;\n}\n\n/**\n * Builds the full invalid-type error message used by create/update: the\n * existing \"Invalid type ... Allowed: ...\" line plus the discoverable hint.\n * `typesFilePath` should be the resolved schema/types.json path for the active\n * tracker (see {@link resolveItemTypesFilePath}) so the hint reflects a custom\n * `--pm-path` instead of the hardcoded `.agents/pm` default.\n */\nexport function buildInvalidTypeError(name: string, allowedTypes: readonly string[], typesFilePath?: string): string {\n  return `Invalid type value \"${name}\". Allowed: ${allowedTypes.join(\", \")}. ${buildInvalidTypeHint(name, typesFilePath)}`;\n}\n"],"names":["definition"],"mappings":";;;;;;;;AAkBA,IAAM,sBAAsB,IAAI,IAC9B,yBAAyB,IAAI,CAAC,SAAS,CAAC,KAAK,YAAW,GAAI,IAAI,CAAC,CAAC;AAyDpE,IAAM,0BAA0B;AAEhC,SAAS,qBAAqB,OAAe,OAAa;AACxD,MAAI,CAAC,wBAAwB,KAAK,KAAK,GAAG;AACxC,UAAM,IAAI,MACR,GAAG,KAAK,KAAK,KAAK,qKAAqK;EAE3L;AACF;AAiBM,SAAU,qBAAqB,MAAY;AAC/C,SAAO,oBAAoB,IAAI,KAAK,KAAI,EAAG,YAAW,CAAE;AAC1D;AAOA,SAAS,iBAAiB,OAAc;AACtC,SAAO,MAAM,QAAQ,KAAK,IAAI,MAAM,OAAO,CAAC,UAA2B,OAAO,UAAU,QAAQ,IAAI,CAAA;AACtG;AAOM,SAAU,sBAAsB,OAAa;AACjD,SAAO,MAAM,QAAQ,YAAY,CAAC,SAAS,KAAK,IAAI,EAAE;AACxD;AAEA,SAAS,cAAc,QAAwB;AAC7C,QAAM,OAAO,oBAAI,IAAG;AACpB,aAAW,SAAS,QAAQ;AAC1B,UAAM,UAAU,MAAM,KAAI;AAC1B,QAAI,QAAQ,WAAW,GAAG;AACxB;IACF;AACA,UAAM,MAAM,QAAQ,YAAW;AAC/B,QAAI,CAAC,KAAK,IAAI,GAAG,GAAG;AAClB,WAAK,IAAI,KAAK,OAAO;IACvB;EACF;AACA,SAAO,CAAC,GAAG,KAAK,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAC3E;AAOM,SAAU,sBAAsB,KAAoB;AACxD,QAAM,QAAQ,IAAI,QAAQ,IAAI,KAAI;AAClC,MAAI,KAAK,WAAW,GAAG;AACrB,UAAM,IAAI,MAAM,8BAA8B;EAChD;AACA,uBAAqB,MAAM,WAAW;AACtC,QAAM,eAAe,qBAAqB,IAAI;AAC9C,MAAI,cAAc;AAChB,UAAM,IAAI,MACR,uCAAuC,YAAY,mCAAmC,yBAAyB,KAAK,IAAI,CAAC,GAAG;EAEhI;AACA,QAAM,cAAc,IAAI,aAAa,KAAI;AACzC,QAAM,gBAAgB,IAAI,eAAe,KAAI;AAC7C,QAAM,SAAS,IAAI,QAAQ,KAAI;AAC/B,QAAM,UAAU,cAAc,IAAI,WAAW,CAAA,CAAE;AAC/C,aAAW,SAAS,SAAS;AAC3B,yBAAqB,OAAO,OAAO;AACnC,UAAM,eAAe,qBAAqB,KAAK;AAC/C,QAAI,cAAc;AAChB,YAAM,IAAI,MACR,UAAU,KAAK,uCAAuC,YAAY,mCAAmC,yBAAyB,KAAK,IAAI,CAAC,GAAG;IAE/I;EACF;AACA,SAAO;IACL;IACA,aAAa,eAAe,YAAY,SAAS,IAAI,cAAc;IACnE,eAAe,iBAAiB,cAAc,SAAS,IAAI,gBAAgB;IAC3E,QAAQ,UAAU,OAAO,SAAS,IAAI,SAAS;IAC/C;;AAEJ;AAUM,SAAU,uBAAuB,OAA+B,UAAuB;AAC3F,QAAM,YAAY,MAAM,KAAK,YAAW;AACxC,QAAM,QAAQ,oBAAI,IAAG;AACrB,aAAW,cAAc,SAAS,aAAa;AAC7C,QAAI,OAAO,WAAW,SAAS,UAAU;AACvC;IACF;AACA,UAAM,iBAAiB,WAAW,KAAK,KAAI;AAC3C,QAAI,eAAe,WAAW,KAAK,eAAe,YAAW,MAAO,WAAW;AAC7E;IACF;AACA,UAAM,IAAI,eAAe,YAAW,GAAI,cAAc;AACtD,eAAW,SAAS,iBAAiB,WAAW,OAAO,GAAG;AACxD,UAAI,MAAM,KAAI,EAAG,SAAS,GAAG;AAC3B,cAAM,IAAI,MAAM,KAAI,EAAG,YAAW,GAAI,cAAc;MACtD;IACF;EACF;AACA,QAAM,YAAY,MAAM,IAAI,SAAS;AACrC,MAAI,WAAW;AACb,UAAM,IAAI,MAAM,cAAc,MAAM,IAAI,mDAAmD,SAAS,IAAI;EAC1G;AACA,aAAW,SAAS,MAAM,SAAS;AACjC,UAAM,QAAQ,MAAM,IAAI,MAAM,YAAW,CAAE;AAC3C,QAAI,OAAO;AACT,YAAM,IAAI,MAAM,UAAU,KAAK,yCAAyC,KAAK,IAAI;IACnF;EACF;AACF;AAQA,SAAS,wBAAwB,MAAc,QAAe;AAC5D,MAAI,OAAO,WAAW,YAAY,OAAO,KAAI,EAAG,SAAS,GAAG;AAC1D,WAAO,OAAO,KAAI,EAAG,YAAW;EAClC;AACA,SAAO,gBAAgB,IAAI,EAAE,YAAW;AAC1C;AAgBM,SAAU,0BACd,OACA,UACA,iBAA6C;AAE7C,QAAM,YAAY,MAAM,KAAK,YAAW;AACxC,QAAM,cAAc,wBAAwB,MAAM,MAAM,MAAM,MAAM;AACpE,QAAM,OAAO,CAAC,cAA4B;AACxC,UAAM,IAAI,MACR,cAAc,MAAM,IAAI,kCAAkC,WAAW,mDAAmD,SAAS,6DAA6D;EAElM;AACA,aAAW,cAAc,SAAS,aAAa;AAC7C,QAAI,OAAO,WAAW,SAAS,UAAU;AACvC;IACF;AACA,UAAM,iBAAiB,WAAW,KAAK,KAAI;AAC3C,QAAI,eAAe,WAAW,KAAK,eAAe,YAAW,MAAO,WAAW;AAC7E;IACF;AACA,QAAI,wBAAwB,gBAAgB,WAAW,MAAM,MAAM,aAAa;AAC9E,WAAK,cAAc;IACrB;EACF;AACA,QAAM,gBAAgB,iBAAiB,IAAI,WAAW;AACtD,MAAI,kBAAkB,UAAa,cAAc,YAAW,MAAO,WAAW;AAC5E,SAAK,aAAa;EACpB;AACF;AAQM,SAAU,mBAAmB,KAA8B;AAC/D,MAAI,QAAQ,QAAQ,QAAQ,UAAa,IAAI,KAAI,EAAG,WAAW,GAAG;AAChE,WAAO,EAAE,aAAa,CAAA,EAAE;EAC1B;AACA,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,GAAG;EACzB,QAAQ;AACN,UAAM,IAAI,MAAM,0CAA0C;EAC5D;AACA,SAAO,EAAE,aAAa,mBAAmB,MAAM,EAAC;AAClD;AAEA,SAAS,mBAAmB,QAAe;AACzC,QAAM,YAAY,uBAAuB,MAAM;AAC/C,MAAI,CAAC,WAAW;AACd,WAAO,CAAA;EACT;AACA,QAAM,cAAoC,CAAA;AAC1C,aAAW,SAAS,WAAW;AAC7B,QAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG;AACvE;IACF;AACA,UAAM,SAAS;AACf,QAAI,OAAO,OAAO,SAAS,YAAY,OAAO,KAAK,KAAI,EAAG,WAAW,GAAG;AACtE;IACF;AACA,gBAAY,KAAK,MAAuC;EAC1D;AACA,SAAO;AACT;AAEA,SAAS,uBAAuB,QAAe;AAC7C,MAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,WAAO;EACT;AACA,MAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AACjD,WAAO;EACT;AACA,QAAM,SAAS;AACf,MAAI,MAAM,QAAQ,OAAO,WAAW,GAAG;AACrC,WAAO,OAAO;EAChB;AACA,MAAI,OAAO,OAAO,eAAe,YAAY,OAAO,eAAe,MAAM;AACvE,UAAM,SAAS,OAAO;AACtB,QAAI,MAAM,QAAQ,OAAO,WAAW,GAAG;AACrC,aAAO,OAAO;IAChB;EACF;AACA,SAAO;AACT;AAQM,SAAU,eAAe,MAAqB,OAA6B;AAC/E,QAAM,YAAY,MAAM,KAAK,YAAW;AACxC,QAAM,cAAc,KAAK,YAAY,MAAK;AAC1C,QAAM,gBAAgB,YAAY,UAChC,CAAC,eAAe,OAAO,WAAW,SAAS,YAAY,WAAW,KAAK,KAAI,EAAG,YAAW,MAAO,SAAS;AAE3G,QAAM,WAAW,iBAAiB,IAAI,YAAY,aAAa,IAAI;AAEnE,QAAM,gBAAgB,cAAc,CAAC,GAAG,iBAAiB,UAAU,OAAO,GAAG,GAAG,MAAM,OAAO,CAAC;AAE9F,QAAM,OAA2B;IAC/B,GAAG;IACH,MAAM,MAAM;;AAEd,MAAI,MAAM,WAAW,QAAW;AAC9B,SAAK,SAAS,MAAM;EACtB;AACA,MAAI,cAAc,SAAS,GAAG;AAC5B,SAAK,UAAU;EACjB,WAAW,KAAK,YAAY,QAAW;AACrC,WAAO,KAAK;EACd;AACA,iBAAe,MAAM,eAAe,MAAM,WAAW;AACrD,iBAAe,MAAM,kBAAkB,MAAM,aAAa;AAE1D,MAAI,iBAAiB,GAAG;AACtB,gBAAY,aAAa,IAAI;EAC/B,OAAO;AACL,gBAAY,KAAK,IAAI;EACvB;AACA,cAAY,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AAErE,SAAO;IACL,MAAM,EAAE,YAAW;IACnB,YAAY;IACZ,UAAU,iBAAiB;IAC3B,GAAI,YAAY,OAAO,SAAS,SAAS,WAAW,EAAE,cAAc,SAAS,KAAI,IAAK,CAAA;;AAE1F;AASM,SAAU,eAAe,MAAqB,MAAwB;AAC1E,QAAM,WAAW,QAAQ,IAAI,KAAI;AACjC,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,MAAM,8BAA8B;EAChD;AACA,QAAM,eAAe,qBAAqB,OAAO;AACjD,MAAI,cAAc;AAChB,UAAM,IAAI,MACR,qCAAqC,YAAY,mCAAmC,yBAAyB,KAAK,IAAI,CAAC,GAAG;EAE9H;AACA,QAAM,YAAY,QAAQ,YAAW;AACrC,QAAM,cAAc,KAAK,YAAY,MAAK;AAC1C,QAAM,gBAAgB,YAAY,UAChC,CAACA,gBAAe,OAAOA,YAAW,SAAS,YAAYA,YAAW,KAAK,KAAI,EAAG,YAAW,MAAO,SAAS;AAE3G,MAAI,gBAAgB,GAAG;AACrB,WAAO,EAAE,MAAM,EAAE,YAAW,GAAI,SAAS,MAAK;EAChD;AACA,QAAM,CAAC,UAAU,IAAI,YAAY,OAAO,eAAe,CAAC;AACxD,SAAO,EAAE,MAAM,EAAE,YAAW,GAAI,SAAS,MAAM,WAAU;AAC3D;AAEA,SAAS,eAAe,YAAgC,KAAa,OAAyB;AAC5F,QAAM,SAAS;AACf,MAAI,UAAU,QAAW;AACvB,WAAO,GAAG,IAAI;EAChB;AACF;AAMM,SAAU,uBAAuB,MAAmB;AACxD,SAAO,GAAG,KAAK,UAAU,EAAE,aAAa,KAAK,YAAW,GAAI,MAAM,CAAC,CAAC;;AACtE;AAOM,SAAU,qBAAqB,MAAc,eAAsB;AACvE,QAAM,WAAW,KAAK,KAAI,EAAG,SAAS,IAAI,KAAK,KAAI,IAAK;AACxD,QAAM,SAAS,eAAe,KAAI,KAAM;AACxC,SAAO,uDAAuD,sBAAsB,QAAQ,CAAC,aAAa,MAAM;AAClH;AASM,SAAU,sBAAsB,MAAc,cAAiC,eAAsB;AACzG,SAAO,uBAAuB,IAAI,eAAe,aAAa,KAAK,IAAI,CAAC,KAAK,qBAAqB,MAAM,aAAa,CAAC;AACxH","debugId":"1b7c28c0-5af8-526d-a895-fe83ffb2841e"}