@unbrained/pm-cli 2026.7.17 → 2026.7.18

package/dist/cli-bundle/chunks/chunk-P56LKFQX.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../../../../../../core/item/actionability.ts"],
-  "sourcesContent": ["/**\n * @module core/item/actionability\n *\n * Pure, dependency-aware actionability model shared by the `pm next` command and\n * the close-time auto-unblock sweep. It answers \"what is ready to work on now?\"\n * without any I/O: given a candidate set and the surrounding corpus it partitions\n * work into READY items (active, leaf, no open blockers) and BLOCKED items (active\n * leaf waiting on at least one open blocker). Keeping the logic here — rather than\n * inside a CLI command — makes it trivially testable and reusable, and gives the\n * `blocked_by` resolution a single source of truth.\n */\nimport { isTerminalStatus, normalizeStatusForRegistry } from \"./status.js\";\nimport type { RuntimeStatusRegistry } from \"../schema/runtime-schema.js\";\nimport type { ItemMetadata, ItemStatus } from \"../../types/index.js\";\n\n/** Dependency kind that marks \"this item is blocked by the referenced item\". */\nconst BLOCKED_BY_DEPENDENCY_KIND = \"blocked_by\";\n\n/**\n * Normalizes an item id / parent reference / blocker id to its canonical\n * comparison key (trimmed, lowercased). pm ids are canonically lowercase, but\n * resolving case-insensitively — as {@link collectSubtreeIds} does — keeps a\n * hand-edited mixed-case reference from being silently treated as missing.\n */\nfunction normalizeItemId(id: string): string {\n  return id.trim().toLowerCase();\n}\n\n/** Collects the blocker item ids declared by an item: the legacy scalar `blocked_by` field plus every `blocked_by` dependency edge. Ids are trimmed, de-duplicated, and returned in stable lexicographic order. This is the single source of truth for \"what must close before this item can proceed\", shared by `pm next` readiness classification and the close-time auto-unblock sweep. */\nexport function collectBlockedByIds(\n  item: Pick<ItemMetadata, \"blocked_by\" | \"dependencies\">,\n): string[] {\n  const ids = new Set<string>();\n  const scalar =\n    typeof item.blocked_by === \"string\" ? item.blocked_by.trim() : \"\";\n  if (scalar.length > 0) {\n    ids.add(scalar);\n  }\n  for (const dependency of item.dependencies ?? []) {\n    if (\n      dependency.kind === BLOCKED_BY_DEPENDENCY_KIND &&\n      typeof dependency.id === \"string\" &&\n      dependency.id.trim().length > 0\n    ) {\n      ids.add(dependency.id.trim());\n    }\n  }\n  return [...ids].sort((left, right) => left.localeCompare(right));\n}\n\n/** A blocker reference resolved against the corpus and annotated with its state. */\nexport interface ResolvedBlocker {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports title for this contract. */\n  title: string | null;\n  /** Lifecycle state reported for status. */\n  status: ItemStatus | null;\n  /** True when the blocker no longer gates work because the referenced item is terminal. */\n  resolved: boolean;\n}\n\n/** Resolves an item's declared blockers against a corpus index, annotating each with the blocker's title/status and whether it still gates work. Unknown ids remain unresolved: silently treating a typo as satisfied would dispatch work whose prerequisite was never completed. Terminal referenced items alone are resolved. */\nexport function resolveItemBlockers(\n  item: Pick<ItemMetadata, \"blocked_by\" | \"dependencies\">,\n  itemsById: Map<string, ItemMetadata>,\n  statusRegistry: RuntimeStatusRegistry,\n): ResolvedBlocker[] {\n  return collectBlockedByIds(item).map((id) => {\n    const blocker = itemsById.get(normalizeItemId(id));\n    if (!blocker) {\n      return { id, title: null, status: null, resolved: false };\n    }\n    return {\n      id,\n      title: blocker.title,\n      status: blocker.status,\n      resolved: isTerminalStatus(blocker.status, statusRegistry),\n    };\n  });\n}\n\n/** A classified actionable item plus the context an agent needs to act on it. */\nexport interface ActionableEntry {\n  /** Value that configures or reports item for this contract. */\n  item: ItemMetadata;\n  /** Blockers that still gate the item (resolved blockers are filtered out). */\n  open_blockers: ResolvedBlocker[];\n  /** Ids of non-terminal items whose `blocked_by` points at this item. */\n  unblocks: string[];\n}\n\n/** Result of partitioning a candidate set into ready vs blocked leaf work. */\nexport interface ActionabilityReport {\n  /** Active leaves with no open blockers — ready to work on now. */\n  ready: ActionableEntry[];\n  /** Active leaves with at least one open blocker — waiting to become ready. */\n  blocked: ActionableEntry[];\n  /** Active candidates considered before the leaf/blocker split. */\n  active_count: number;\n  /** Active candidates skipped because they still have open descendants. */\n  container_count: number;\n}\n\n/** Resolves the registry's active status set, falling back to just the canonical open status when a custom schema declares none — the same safety net `pm context` applies so the report never misclassifies every item as inactive. */\nfunction resolveActiveStatusSet(\n  statusRegistry: RuntimeStatusRegistry,\n): Set<string> {\n  /* c8 ignore start -- fallback applies only to custom schemas that intentionally define zero active statuses */\n  return statusRegistry.active_statuses.size > 0\n    ? statusRegistry.active_statuses\n    : new Set<string>([statusRegistry.open_status]);\n  /* c8 ignore stop */\n}\n\n/** Returns whether an item has any non-terminal descendant by walking the parent→children index depth-first, short-circuiting on the first one found. Such an item is a container (its real work lives in its children), so `pm next` skips it and recommends a leaf instead. Cycle-safe via a visited set. */\nfunction hasOpenDescendant(\n  rootId: string,\n  childrenByParent: Map<string, ItemMetadata[]>,\n  statusRegistry: RuntimeStatusRegistry,\n): boolean {\n  const stack = [normalizeItemId(rootId)];\n  const visited = new Set<string>();\n  while (stack.length > 0) {\n    const current = stack.pop() as string;\n    /* c8 ignore start -- defensive cycle-guard: unreachable for active roots (an open child returns before any node is revisited, and single-parent graphs cannot form a root-reachable cycle excluding the root), retained for safety */\n    if (visited.has(current)) continue;\n    /* c8 ignore stop */\n    visited.add(current);\n    for (const child of childrenByParent.get(current) ?? []) {\n      if (!isTerminalStatus(child.status, statusRegistry)) {\n        return true;\n      }\n      stack.push(normalizeItemId(child.id));\n    }\n  }\n  return false;\n}\n\n/** Indexes the corpus into a by-id map, a parent→children map, and a reverse blocker map (blocker id → ids of items it blocks). Built once per report so blocker resolution, descendant counting, and downstream \"unblocks\" lookups share the same passes over the corpus. */\nfunction indexCorpus(corpus: ItemMetadata[]): {\n  itemsById: Map<string, ItemMetadata>;\n  childrenByParent: Map<string, ItemMetadata[]>;\n  blockedByReverse: Map<string, string[]>;\n} {\n  const itemsById = new Map<string, ItemMetadata>();\n  const childrenByParent = new Map<string, ItemMetadata[]>();\n  const blockedByReverse = new Map<string, string[]>();\n  for (const item of corpus) {\n    // Index keys are normalized (lowercased) for case-insensitive resolution;\n    // stored values keep the item's original-case id for display.\n    itemsById.set(normalizeItemId(item.id), item);\n    const parent = typeof item.parent === \"string\" ? item.parent.trim() : \"\";\n    if (parent.length > 0) {\n      const parentKey = normalizeItemId(parent);\n      const siblings = childrenByParent.get(parentKey) ?? [];\n      siblings.push(item);\n      childrenByParent.set(parentKey, siblings);\n    }\n    for (const blockerId of collectBlockedByIds(item)) {\n      const blockerKey = normalizeItemId(blockerId);\n      const dependents = blockedByReverse.get(blockerKey) ?? [];\n      dependents.push(item.id);\n      blockedByReverse.set(blockerKey, dependents);\n    }\n  }\n  return { itemsById, childrenByParent, blockedByReverse };\n}\n\n/**\n * Partitions a candidate set into ready vs blocked leaf work using the corpus to\n * resolve blockers, descendants, and downstream dependents.\n *\n * An item qualifies when its status is active. Containers — items with at least\n * one non-terminal descendant — are excluded from both lists because the real\n * work is the leaf beneath them. A leaf with no open blockers is READY; a leaf\n * with one or more open blockers is BLOCKED, annotated with the unresolved\n * blockers and the non-terminal items it would unblock. Returned lists preserve\n * the candidate order so the caller can apply its own ranking.\n */\nexport function computeActionabilityReport(\n  candidates: ItemMetadata[],\n  corpus: ItemMetadata[],\n  statusRegistry: RuntimeStatusRegistry,\n): ActionabilityReport {\n  const { itemsById, childrenByParent, blockedByReverse } = indexCorpus(corpus);\n  const activeStatuses = new Set([\n    ...resolveActiveStatusSet(statusRegistry),\n    ...statusRegistry.blocked_statuses,\n  ]);\n  // Ids of corpus items still in flight, used to keep only the non-terminal\n  // dependents in each item's downstream \"unblocks\" list.\n  const nonTerminalIds = new Set(\n    corpus\n      .filter((entry) => !isTerminalStatus(entry.status, statusRegistry))\n      .map((entry) => normalizeItemId(entry.id)),\n  );\n  const ready: ActionableEntry[] = [];\n  const blocked: ActionableEntry[] = [];\n  let activeCount = 0;\n  let containerCount = 0;\n  for (const item of candidates) {\n    if (\n      !activeStatuses.has(\n        normalizeStatusForRegistry(item.status, statusRegistry),\n      )\n    )\n      continue;\n    activeCount += 1;\n    if (hasOpenDescendant(item.id, childrenByParent, statusRegistry)) {\n      containerCount += 1;\n      continue;\n    }\n    const openBlockers = resolveItemBlockers(\n      item,\n      itemsById,\n      statusRegistry,\n    ).filter((blocker) => !blocker.resolved);\n    const unblocks = (blockedByReverse.get(normalizeItemId(item.id)) ?? [])\n      .filter((dependentId) => nonTerminalIds.has(normalizeItemId(dependentId)))\n      .sort((left, right) => left.localeCompare(right));\n    const entry: ActionableEntry = {\n      item,\n      open_blockers: openBlockers,\n      unblocks,\n    };\n    const lifecycleBlocked = statusRegistry.blocked_statuses.has(\n      normalizeStatusForRegistry(item.status, statusRegistry),\n    );\n    if (openBlockers.length === 0 && !lifecycleBlocked) {\n      ready.push(entry);\n    } else {\n      blocked.push(entry);\n    }\n  }\n  return {\n    ready,\n    blocked,\n    active_count: activeCount,\n    container_count: containerCount,\n  };\n}\n"],
-  "mappings": ";;;;;;;;;;;;;AAgBA,IAAM,6BAA6B;AAQnC,SAAS,gBAAgB,IAAU;AACjC,SAAO,GAAG,KAAI,EAAG,YAAW;AAC9B;AAGM,SAAU,oBACd,MAAuD;AAEvD,QAAM,MAAM,oBAAI,IAAG;AACnB,QAAM,SACJ,OAAO,KAAK,eAAe,WAAW,KAAK,WAAW,KAAI,IAAK;AACjE,MAAI,OAAO,SAAS,GAAG;AACrB,QAAI,IAAI,MAAM;EAChB;AACA,aAAW,cAAc,KAAK,gBAAgB,CAAA,GAAI;AAChD,QACE,WAAW,SAAS,8BACpB,OAAO,WAAW,OAAO,YACzB,WAAW,GAAG,KAAI,EAAG,SAAS,GAC9B;AACA,UAAI,IAAI,WAAW,GAAG,KAAI,CAAE;IAC9B;EACF;AACA,SAAO,CAAC,GAAG,GAAG,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACjE;AAeM,SAAU,oBACd,MACA,WACA,gBAAqC;AAErC,SAAO,oBAAoB,IAAI,EAAE,IAAI,CAAC,OAAM;AAC1C,UAAM,UAAU,UAAU,IAAI,gBAAgB,EAAE,CAAC;AACjD,QAAI,CAAC,SAAS;AACZ,aAAO,EAAE,IAAI,OAAO,MAAM,QAAQ,MAAM,UAAU,MAAK;IACzD;AACA,WAAO;MACL;MACA,OAAO,QAAQ;MACf,QAAQ,QAAQ;MAChB,UAAU,iBAAiB,QAAQ,QAAQ,cAAc;;EAE7D,CAAC;AACH;AAyBA,SAAS,uBACP,gBAAqC;AAGrC,SAAO,eAAe,gBAAgB,OAAO,IACzC,eAAe,kBACf,oBAAI,IAAY,CAAC,eAAe,WAAW,CAAC;AAElD;AAGA,SAAS,kBACP,QACA,kBACA,gBAAqC;AAErC,QAAM,QAAQ,CAAC,gBAAgB,MAAM,CAAC;AACtC,QAAM,UAAU,oBAAI,IAAG;AACvB,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,UAAU,MAAM,IAAG;AAEzB,QAAI,QAAQ,IAAI,OAAO;AAAG;AAE1B,YAAQ,IAAI,OAAO;AACnB,eAAW,SAAS,iBAAiB,IAAI,OAAO,KAAK,CAAA,GAAI;AACvD,UAAI,CAAC,iBAAiB,MAAM,QAAQ,cAAc,GAAG;AACnD,eAAO;MACT;AACA,YAAM,KAAK,gBAAgB,MAAM,EAAE,CAAC;IACtC;EACF;AACA,SAAO;AACT;AAGA,SAAS,YAAY,QAAsB;AAKzC,QAAM,YAAY,oBAAI,IAAG;AACzB,QAAM,mBAAmB,oBAAI,IAAG;AAChC,QAAM,mBAAmB,oBAAI,IAAG;AAChC,aAAW,QAAQ,QAAQ;AAGzB,cAAU,IAAI,gBAAgB,KAAK,EAAE,GAAG,IAAI;AAC5C,UAAM,SAAS,OAAO,KAAK,WAAW,WAAW,KAAK,OAAO,KAAI,IAAK;AACtE,QAAI,OAAO,SAAS,GAAG;AACrB,YAAM,YAAY,gBAAgB,MAAM;AACxC,YAAM,WAAW,iBAAiB,IAAI,SAAS,KAAK,CAAA;AACpD,eAAS,KAAK,IAAI;AAClB,uBAAiB,IAAI,WAAW,QAAQ;IAC1C;AACA,eAAW,aAAa,oBAAoB,IAAI,GAAG;AACjD,YAAM,aAAa,gBAAgB,SAAS;AAC5C,YAAM,aAAa,iBAAiB,IAAI,UAAU,KAAK,CAAA;AACvD,iBAAW,KAAK,KAAK,EAAE;AACvB,uBAAiB,IAAI,YAAY,UAAU;IAC7C;EACF;AACA,SAAO,EAAE,WAAW,kBAAkB,iBAAgB;AACxD;AAaM,SAAU,2BACd,YACA,QACA,gBAAqC;AAErC,QAAM,EAAE,WAAW,kBAAkB,iBAAgB,IAAK,YAAY,MAAM;AAC5E,QAAM,iBAAiB,oBAAI,IAAI;IAC7B,GAAG,uBAAuB,cAAc;IACxC,GAAG,eAAe;GACnB;AAGD,QAAM,iBAAiB,IAAI,IACzB,OACG,OAAO,CAAC,UAAU,CAAC,iBAAiB,MAAM,QAAQ,cAAc,CAAC,EACjE,IAAI,CAAC,UAAU,gBAAgB,MAAM,EAAE,CAAC,CAAC;AAE9C,QAAM,QAA2B,CAAA;AACjC,QAAM,UAA6B,CAAA;AACnC,MAAI,cAAc;AAClB,MAAI,iBAAiB;AACrB,aAAW,QAAQ,YAAY;AAC7B,QACE,CAAC,eAAe,IACd,2BAA2B,KAAK,QAAQ,cAAc,CAAC;AAGzD;AACF,mBAAe;AACf,QAAI,kBAAkB,KAAK,IAAI,kBAAkB,cAAc,GAAG;AAChE,wBAAkB;AAClB;IACF;AACA,UAAM,eAAe,oBACnB,MACA,WACA,cAAc,EACd,OAAO,CAAC,YAAY,CAAC,QAAQ,QAAQ;AACvC,UAAM,YAAY,iBAAiB,IAAI,gBAAgB,KAAK,EAAE,CAAC,KAAK,CAAA,GACjE,OAAO,CAAC,gBAAgB,eAAe,IAAI,gBAAgB,WAAW,CAAC,CAAC,EACxE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAClD,UAAM,QAAyB;MAC7B;MACA,eAAe;MACf;;AAEF,UAAM,mBAAmB,eAAe,iBAAiB,IACvD,2BAA2B,KAAK,QAAQ,cAAc,CAAC;AAEzD,QAAI,aAAa,WAAW,KAAK,CAAC,kBAAkB;AAClD,YAAM,KAAK,KAAK;IAClB,OAAO;AACL,cAAQ,KAAK,KAAK;IACpB;EACF;AACA,SAAO;IACL;IACA;IACA,cAAc;IACd,iBAAiB;;AAErB;",
-  "names": []
-}