@unbrained/pm-cli 2026.9.7 → 2026.9.9

package/dist/core/governance/content-fields.js

@@ -1,161 +1,2 @@
-/**
- * Content-field governance & utilization primitives.
- *
- * "Project management = context management": these primitives let agents query
- * which items carry context (notes/learnings/files/docs/tests/comments/deps/
- * body, plus whether a linked test carries a runnable command) and which do
- * not. The surface powers content-field selection (pm list / pm update-many)
- * and field-utilization reporting (pm stats --field-utilization).
- *
- * The module is pure: it performs no IO and imports no heavy runtime
- * dependencies. Callers pass plain structural item shapes so the logic stays
- * trivially testable.
- */
-/** Stable rendering / iteration order for content fields. */
-
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="03824e4b-562b-5e12-a89a-9dd091ae7fd3")}catch(e){}}();
-export const CONTENT_FIELD_ORDER = [
-    "notes",
-    "learnings",
-    "files",
-    "docs",
-    "tests",
-    "comments",
-    "deps",
-    "body",
-    "linked_command",
-];
-/** True when `value` is a non-empty array. */
-function hasEntries(value) {
-    return Array.isArray(value) && value.length > 0;
-}
-/** True when the body string carries non-whitespace content. */
-function hasBody(body) {
-    return typeof body === "string" && body.trim().length > 0;
-}
-/** True when at least one entry in the `tests` array carries a non-empty string `command`. Tolerant of non-object / non-string entries. */
-function hasLinkedCommand(tests) {
-    if (!Array.isArray(tests)) {
-        return false;
-    }
-    return tests.some((entry) => {
-        if (typeof entry !== "object" || entry === null) {
-            return false;
-        }
-        const command = entry.command;
-        return typeof command === "string" && command.trim().length > 0;
-    });
-}
-/** True when the given content field carries context on this item. - collection fields: `Array.isArray && length > 0` - "deps": maps to the `dependencies` array - "body": `typeof body === "string" && body.trim().length > 0` - "linked_command": `tests` array has at least one entry with a non-empty string `command` */
-export function isContentFieldPresent(item, field) {
-    switch (field) {
-        case "notes":
-            return hasEntries(item.notes);
-        case "learnings":
-            return hasEntries(item.learnings);
-        case "files":
-            return hasEntries(item.files);
-        case "docs":
-            return hasEntries(item.docs);
-        case "tests":
-            return hasEntries(item.tests);
-        case "comments":
-            return hasEntries(item.comments);
-        case "deps":
-            return hasEntries(item.dependencies);
-        case "body":
-            return hasBody(item.body);
-        case "linked_command":
-            return hasLinkedCommand(item.tests);
-    }
-    // No default: every ContentField has an explicit case above, so TypeScript
-    // enforces exhaustiveness here — adding a new field without a case is a
-    // compile error rather than a silent fall-through (and no unreachable branch
-    // to dent the literal-100% coverage gate).
-}
-/** True when at least one content-field selection is requested. */
-export function hasContentFieldFilter(filters) {
-    return CONTENT_FIELD_ORDER.some((field) => filters[field] !== undefined);
-}
-/**
- * Does a single item satisfy the requested content-field filters?
- *
- * AND semantics across all requested fields: each requested field must match
- * its present/absent requirement. When no filter is requested the item passes.
- */
-export function itemMatchesContentFilters(item, filters) {
-    for (const field of CONTENT_FIELD_ORDER) {
-        const selection = filters[field];
-        if (selection === undefined) {
-            continue;
-        }
-        const present = isContentFieldPresent(item, field);
-        if (selection === "present" && !present) {
-            return false;
-        }
-        if (selection === "absent" && present) {
-            return false;
-        }
-    }
-    return true;
-}
-/** Filter a list of items by the requested content-field selections. */
-export function filterByContentFields(items, filters) {
-    if (!hasContentFieldFilter(filters)) {
-        return [...items];
-    }
-    return items.filter((item) => itemMatchesContentFilters(item, filters));
-}
-/** Whether a content-field filter set requires the heavy collections to be loaded. True when any non-body field is requested (collections + tests' linked command all live in the heavy item-metadata arrays). */
-export function contentFiltersNeedCollections(filters) {
-    return CONTENT_FIELD_ORDER.some((field) => field !== "body" && filters[field] !== undefined);
-}
-/** Whether a content-field filter set requires the item body to be loaded. */
-export function contentFiltersNeedBody(filters) {
-    return filters.body !== undefined;
-}
-/** Round present/total into a one-decimal percentage. Matches the convention in metadata-coverage.ts: a zero population reports 100 (nothing missing). */
-function roundPercent(present, total) {
-    if (total === 0) {
-        return 100;
-    }
-    return Math.round((present / total) * 1000) / 10;
-}
-function emptyUtilizationFields() {
-    const record = {};
-    for (const field of CONTENT_FIELD_ORDER) {
-        record[field] = { present: 0, total: 0, percent: 100 };
-    }
-    return record;
-}
-/** Compute content-field utilization across a list of items. For each field we report how many items populate it out of the total, plus a rounded percentage. Convenience `body_populated`/`empty_body` aliases mirror GH-241. */
-export function computeContentFieldUtilization(items) {
-    const fields = emptyUtilizationFields();
-    const total = items.length;
-    for (const item of items) {
-        for (const field of CONTENT_FIELD_ORDER) {
-            if (isContentFieldPresent(item, field)) {
-                fields[field].present += 1;
-            }
-        }
-    }
-    for (const field of CONTENT_FIELD_ORDER) {
-        fields[field].total = total;
-        fields[field].percent = roundPercent(fields[field].present, total);
-    }
-    const bodyPopulated = fields.body;
-    const emptyBodyCount = total - bodyPopulated.present;
-    const emptyBody = {
-        present: emptyBodyCount,
-        total,
-        percent: roundPercent(emptyBodyCount, total),
-    };
-    return {
-        total_items: total,
-        fields,
-        body_populated: bodyPopulated,
-        empty_body: emptyBody,
-    };
-}
+!(function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=new e.Error().stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="2e200f74-0e6c-58ac-ab8c-da49071465ff")}catch(e2){}})();const CONTENT_FIELD_ORDER=["notes","learnings","files","docs","tests","comments","deps","body","linked_command"];function hasEntries(value){return Array.isArray(value)&&value.length>0}function hasBody(body){return typeof body==="string"&&body.trim().length>0}function hasLinkedCommand(tests){if(!Array.isArray(tests)){return false}return tests.some(entry=>{if(typeof entry!=="object"||entry===null){return false}const command=entry.command;return typeof command==="string"&&command.trim().length>0})}function isContentFieldPresent(item,field){switch(field){case"notes":return hasEntries(item.notes);case"learnings":return hasEntries(item.learnings);case"files":return hasEntries(item.files);case"docs":return hasEntries(item.docs);case"tests":return hasEntries(item.tests);case"comments":return hasEntries(item.comments);case"deps":return hasEntries(item.dependencies);case"body":return hasBody(item.body);case"linked_command":return hasLinkedCommand(item.tests)}}function hasContentFieldFilter(filters){return CONTENT_FIELD_ORDER.some(field=>filters[field]!==void 0)}function itemMatchesContentFilters(item,filters){for(const field of CONTENT_FIELD_ORDER){const selection=filters[field];if(selection===void 0){continue}const present=isContentFieldPresent(item,field);if(selection==="present"&&!present){return false}if(selection==="absent"&&present){return false}}return true}function filterByContentFields(items,filters){if(!hasContentFieldFilter(filters)){return[...items]}return items.filter(item=>itemMatchesContentFilters(item,filters))}function contentFiltersNeedCollections(filters){return CONTENT_FIELD_ORDER.some(field=>field!=="body"&&filters[field]!==void 0)}function contentFiltersNeedBody(filters){return filters.body!==void 0}function roundPercent(present,total){if(total===0){return 100}return Math.round(present/total*1e3)/10}function emptyUtilizationFields(){const record={};for(const field of CONTENT_FIELD_ORDER){record[field]={present:0,total:0,percent:100}}return record}function computeContentFieldUtilization(items){const fields=emptyUtilizationFields();const total=items.length;for(const item of items){for(const field of CONTENT_FIELD_ORDER){if(isContentFieldPresent(item,field)){fields[field].present+=1}}}for(const field of CONTENT_FIELD_ORDER){fields[field].total=total;fields[field].percent=roundPercent(fields[field].present,total)}const bodyPopulated=fields.body;const emptyBodyCount=total-bodyPopulated.present;const emptyBody={present:emptyBodyCount,total,percent:roundPercent(emptyBodyCount,total)};return{total_items:total,fields,body_populated:bodyPopulated,empty_body:emptyBody}}export{CONTENT_FIELD_ORDER,computeContentFieldUtilization,contentFiltersNeedBody,contentFiltersNeedCollections,filterByContentFields,hasContentFieldFilter,isContentFieldPresent,itemMatchesContentFilters};
 //# sourceMappingURL=content-fields.js.map
-//# debugId=03824e4b-562b-5e12-a89a-9dd091ae7fd3

package/dist/core/governance/issue-codes.js

@@ -1,152 +1,2 @@
-/**
- * Logical issue-code governance primitives (GH-235).
- *
- * Trackers frequently adopt a title convention that embeds a logical issue
- * code at the START of the title, e.g. `ISSUE-004: ...`, `BUG-12 ...`,
- * `TASK-7 — ...`, `ADR-001`, `RFC-9`. When two distinct items share the same
- * logical code, auditability and duplicate detection both suffer: a human or
- * agent searching for "ISSUE-004" can no longer assume a single canonical item.
- *
- * These primitives detect that condition. They are pure: no IO, no heavy
- * runtime dependencies. Callers pass plain structural item shapes so the logic
- * stays trivially unit-testable.
- */
-/**
- * Match a conventional leading logical issue code: an upper-case alphanumeric
- * prefix (starting with a letter) followed by a `-` separator and a number, at
- * the very start of the title (after optional leading whitespace).
- *
- * Examples that match: `ISSUE-004`, `BUG-12`, `TASK-7`, `ADR-001`, `RFC-9`,
- * `GH-235`, `PM2-14`. The trailing `\b` requires the digit run to end at a word
- * boundary, so `ISSUE-004-extra` extracts `ISSUE-004` while `ISSUE-004foo`
- * (digit immediately followed by a letter — no boundary) does not match.
- */
-
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="8a7fbaf1-917f-5067-b9b6-a9f27c80e291")}catch(e){}}();
-const ISSUE_CODE_PATTERN = /^([A-Z][A-Z0-9]*-\d+)\b/iu;
-/**
- * Extract the leading logical issue code from a title, or `null` when the title
- * does not begin with one. The title is trimmed and upper-cased before matching
- * so case differences (`issue-004` vs `ISSUE-004`) collapse to one logical
- * code; the returned code is therefore always normalized upper-case.
- *
- * Accepts unknown-ish input defensively (exported helper SDK consumers may call
- * from untyped JS): a non-string or empty title resolves to `null`.
- */
-export function extractIssueCode(title, options = {}) {
-    if (typeof title !== "string") {
-        return null;
-    }
-    const trimmed = title.trim();
-    if (trimmed.length === 0) {
-        return null;
-    }
-    const match = ISSUE_CODE_PATTERN.exec(trimmed);
-    if (!match)
-        return null;
-    const rawCode = match[1];
-    const normalized = rawCode.toUpperCase();
-    const rawPrefix = rawCode.slice(0, rawCode.lastIndexOf("-"));
-    const configured = new Set((options.configuredPrefixes ?? []).map((prefix) => prefix.trim().replace(/-+$/u, "").toUpperCase()));
-    const remainder = trimmed.slice(rawCode.length);
-    const evidence = options.evidenceText?.toUpperCase() ?? "";
-    const hasExplicitBodyEvidence = evidence.includes(`ISSUE CODE: ${normalized}`) ||
-        evidence.includes(`ISSUE CODE \`${normalized}\``) ||
-        evidence.includes(`\`${normalized}\``) ||
-        evidence.includes(`[${normalized}]`);
-    const structurallyQualified = rawPrefix === rawPrefix.toUpperCase() ||
-        /^\s*(?::|—|–|\])/u.test(remainder) ||
-        configured.has(rawPrefix.toUpperCase()) ||
-        hasExplicitBodyEvidence;
-    return structurallyQualified ? normalized : null;
-}
-/** Test whether a value is a usable (non-empty after trim) item-id reference. */
-function isNonEmptyIdReference(value) {
-    return typeof value === "string" && value.trim().length > 0;
-}
-/**
- * Find logical issue codes used by 2+ items. Any item whose title begins with a
- * conventional issue code contributes; codes used by a single item are not
- * reported. Status is intentionally NOT considered for genuine collisions — a
- * closed item and an open item sharing a code still collide for audit purposes.
- *
- * Two adjudicated/by-design cases are excluded so `validate` output stays
- * trustworthy in real trackers (GH-275, GH-278):
- *
- * - **Closed-as-duplicate** (GH-278): an item with a non-empty `duplicate_of`
- *   has already been resolved against its canonical keeper, so it is dropped
- *   before grouping and never contributes to a collision.
- * - **Parent/child prefix sharing** (GH-275): the `PARENT` + `PARENT-T0n`
- *   task-breakdown convention makes a child's title share the parent's code.
- *   Within each code group, any item whose `parent` is another item in the same
- *   group is dropped, because the shared code is intentional hierarchy, not a
- *   collision. A genuine duplicate (two items with the same code, neither the
- *   parent of the other) still surfaces after this filtering.
- *
- * Results are deterministic: duplicate groups are sorted by code, and the
- * `ids`/`titles` within each group are sorted by id. The first-seen title for a
- * given (id) is used; duplicate ids (should not occur for a valid corpus) are
- * de-duplicated so an item never inflates its own code's count.
- */
-export function findDuplicateIssueCodes(items, options = {}) {
-    const byCode = new Map();
-    for (const item of items) {
-        // A non-string title can never carry a code, so skip it before extraction;
-        // this also guarantees every stored title below is a real string.
-        if (typeof item.title !== "string") {
-            continue;
-        }
-        // GH-278: an item closed as a duplicate of another is already adjudicated.
-        if (isNonEmptyIdReference(item.duplicate_of)) {
-            continue;
-        }
-        const code = extractIssueCode(item.title, {
-            ...options,
-            evidenceText: item.body,
-        });
-        if (code === null) {
-            continue;
-        }
-        let entries = byCode.get(code);
-        if (!entries) {
-            entries = [];
-            byCode.set(code, entries);
-        }
-        if (!entries.some((entry) => entry.id === item.id)) {
-            entries.push({
-                id: item.id,
-                title: item.title,
-                parent: isNonEmptyIdReference(item.parent) ? item.parent.trim() : null,
-            });
-        }
-    }
-    const duplicates = [];
-    for (const [code, entries] of byCode) {
-        if (entries.length < 2) {
-            continue;
-        }
-        // GH-275: drop children whose parent is another item carrying the same code
-        // (intentional `PARENT` + `PARENT-T0n` breakdown), then re-check the group.
-        // The parent reference is resolved only against the same-code group on
-        // purpose: a child is by-design noise solely when its parent shares the code
-        // (resolving against the full corpus would suppress genuinely colliding
-        // siblings whose parent merely exists elsewhere). Comparison is
-        // case-insensitive so a `parent` reference recorded in a different case than
-        // the canonical id (e.g. an upper-case `id_prefix`) still matches.
-        const idsInGroup = new Set(entries.map((entry) => entry.id.toLowerCase()));
-        const collisionEntries = entries.filter((entry) => entry.parent === null || !idsInGroup.has(entry.parent.toLowerCase()));
-        if (collisionEntries.length < 2) {
-            continue;
-        }
-        const sorted = [...collisionEntries].sort((left, right) => left.id.localeCompare(right.id));
-        duplicates.push({
-            code,
-            count: sorted.length,
-            ids: sorted.map((entry) => entry.id),
-            titles: sorted.map((entry) => entry.title),
-        });
-    }
-    return duplicates.sort((left, right) => left.code.localeCompare(right.code));
-}
+!(function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=new e.Error().stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="40703093-d602-5e6b-92b6-6b5efe3613fe")}catch(e2){}})();const ISSUE_CODE_PATTERN=/^([A-Z][A-Z0-9]*-\d+)\b/iu;function extractIssueCode(title,options={}){if(typeof title!=="string"){return null}const trimmed=title.trim();if(trimmed.length===0){return null}const match=ISSUE_CODE_PATTERN.exec(trimmed);if(!match)return null;const rawCode=match[1];const normalized=rawCode.toUpperCase();const rawPrefix=rawCode.slice(0,rawCode.lastIndexOf("-"));const configured=new Set((options.configuredPrefixes??[]).map(prefix=>prefix.trim().replace(/-+$/u,"").toUpperCase()));const remainder=trimmed.slice(rawCode.length);const evidence=options.evidenceText?.toUpperCase()??"";const hasExplicitBodyEvidence=evidence.includes(`ISSUE CODE: ${normalized}`)||evidence.includes(`ISSUE CODE \`${normalized}\``)||evidence.includes(`\`${normalized}\``)||evidence.includes(`[${normalized}]`);const structurallyQualified=rawPrefix===rawPrefix.toUpperCase()||/^\s*(?::|—|–|\])/u.test(remainder)||configured.has(rawPrefix.toUpperCase())||hasExplicitBodyEvidence;return structurallyQualified?normalized:null}function isNonEmptyIdReference(value){return typeof value==="string"&&value.trim().length>0}function findDuplicateIssueCodes(items,options={}){const byCode=new Map;for(const item of items){if(typeof item.title!=="string"){continue}if(isNonEmptyIdReference(item.duplicate_of)){continue}const code=extractIssueCode(item.title,{...options,evidenceText:item.body});if(code===null){continue}let entries=byCode.get(code);if(!entries){entries=[];byCode.set(code,entries)}if(!entries.some(entry=>entry.id===item.id)){entries.push({id:item.id,title:item.title,parent:isNonEmptyIdReference(item.parent)?item.parent.trim():null})}}const duplicates=[];for(const[code,entries]of byCode){if(entries.length<2){continue}const idsInGroup=new Set(entries.map(entry=>entry.id.toLowerCase()));const collisionEntries=entries.filter(entry=>entry.parent===null||!idsInGroup.has(entry.parent.toLowerCase()));if(collisionEntries.length<2){continue}const sorted=[...collisionEntries].sort((left,right)=>left.id.localeCompare(right.id));duplicates.push({code,count:sorted.length,ids:sorted.map(entry=>entry.id),titles:sorted.map(entry=>entry.title)})}return duplicates.sort((left,right)=>left.code.localeCompare(right.code))}export{extractIssueCode,findDuplicateIssueCodes};
 //# sourceMappingURL=issue-codes.js.map
-//# debugId=8a7fbaf1-917f-5067-b9b6-a9f27c80e291