@unbrained/pm-cli 2026.9.7 → 2026.9.8

package/dist/sdk/search-refresh-worker.js

@@ -1,19 +1,2 @@
-/**
- * @module sdk/search-refresh-worker
- *
- * Owns the detached semantic-refresh worker entry used by custom mutation hosts.
- */
-
-!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]="8c9a34bd-b77a-55ab-a5d1-3594cecfeb3f")}catch(e){}}();
-import { runSemanticRefreshWorker } from "../core/search/background-refresh.js";
-import { refreshSemanticEmbeddingsForMutatedItems } from "../core/search/cache.js";
-import { resolvePmRoot } from "../core/store/paths.js";
-/** Drain the active workspace's pending semantic-refresh queue. */
-export async function runSearchRefreshWorkerEntrypoint() {
-    const pmRoot = resolvePmRoot(process.cwd(), process.env.PM_PATH);
-    await runSemanticRefreshWorker(pmRoot, (root, itemIds) => refreshSemanticEmbeddingsForMutatedItems(root, itemIds, {
-        apply_runtime_defaults: true,
-    }));
-}
+!(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]="dd1a948a-2fa2-5d2e-a41c-31f75297f17e")}catch(e2){}})();import{runSemanticRefreshWorker}from"../core/search/background-refresh.js";import{refreshSemanticEmbeddingsForMutatedItems}from"../core/search/cache.js";import{resolvePmRoot}from"../core/store/paths.js";async function runSearchRefreshWorkerEntrypoint(){const pmRoot=resolvePmRoot(process.cwd(),process.env.PM_PATH);await runSemanticRefreshWorker(pmRoot,(root,itemIds)=>refreshSemanticEmbeddingsForMutatedItems(root,itemIds,{apply_runtime_defaults:true}))}export{runSearchRefreshWorkerEntrypoint};
 //# sourceMappingURL=search-refresh-worker.js.map
-//# debugId=8c9a34bd-b77a-55ab-a5d1-3594cecfeb3f

package/dist/sdk/similarity-scoring.js

@@ -1,54 +1,2 @@
-/**
- * @module sdk/similarity-scoring
- *
- * Dependency-light deterministic scoring shared by core governance and
- * extension packages without loading tracker query infrastructure.
- */
-
-!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]="dff9b113-2b29-5154-afbf-f191f2f556a6")}catch(e){}}();
-import { jaccardSimilarity } from "../core/shared/text-normalization.js";
-export { jaccardSimilarity } from "../core/shared/text-normalization.js";
-const ISSUE_CODE_PATTERN = /\b[a-z][a-z0-9]*-\d+(?:-[a-z0-9]+)*\b/giu;
-/** Normalize title text for exact comparisons and tokenization. */
-export function normalizeSimilarityText(value) {
-    return value.trim().toLowerCase().replace(/\s+/g, " ");
-}
-/** Split normalized text into unique Unicode letter/number tokens. */
-export function tokenizeSimilarityText(value) {
-    return [
-        ...new Set(normalizeSimilarityText(value).match(/[\p{L}\p{N}]+/gu) ?? []),
-    ];
-}
-/** Precompute every deterministic title signal exactly once for repeated comparisons. */
-export function prepareSimilarityText(value) {
-    const normalized = normalizeSimilarityText(value);
-    return {
-        normalized,
-        tokens: tokenizeSimilarityText(normalized),
-        issueCodes: [
-            ...new Set(normalized
-                .match(ISSUE_CODE_PATTERN)
-                ?.map((code) => code.toLowerCase()) ?? []),
-        ],
-    };
-}
-/** Score two titles through the canonical exact, issue-code, and token signals. */
-export function scoreItemSimilarity(leftTitle, rightTitle) {
-    return scorePreparedItemSimilarity(prepareSimilarityText(leftTitle), prepareSimilarityText(rightTitle));
-}
-/** Score two precomputed title representations without repeating normalization or tokenization. */
-export function scorePreparedItemSimilarity(left, right) {
-    if (left.normalized === right.normalized) {
-        return { score: 1, reason: "exact_title" };
-    }
-    const leftCodes = new Set(left.issueCodes);
-    if (right.issueCodes.some((code) => leftCodes.has(code))) {
-        return { score: 0.99, reason: "issue_code" };
-    }
-    return {
-        score: jaccardSimilarity(left.tokens, right.tokens),
-        reason: "title_token_jaccard",
-    };
-}
+!(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]="54784ad1-36bd-5a10-aa00-ad0b09e935a7")}catch(e2){}})();import{jaccardSimilarity}from"../core/shared/text-normalization.js";import{jaccardSimilarity as jaccardSimilarity2}from"../core/shared/text-normalization.js";const ISSUE_CODE_PATTERN=/\b[a-z][a-z0-9]*-\d+(?:-[a-z0-9]+)*\b/giu;function normalizeSimilarityText(value){return value.trim().toLowerCase().replace(/\s+/g," ")}function tokenizeSimilarityText(value){return[...new Set(normalizeSimilarityText(value).match(/[\p{L}\p{N}]+/gu)??[])]}function prepareSimilarityText(value){const normalized=normalizeSimilarityText(value);return{normalized,tokens:tokenizeSimilarityText(normalized),issueCodes:[...new Set(normalized.match(ISSUE_CODE_PATTERN)?.map(code=>code.toLowerCase())??[])]}}function scoreItemSimilarity(leftTitle,rightTitle){return scorePreparedItemSimilarity(prepareSimilarityText(leftTitle),prepareSimilarityText(rightTitle))}function scorePreparedItemSimilarity(left,right){if(left.normalized===right.normalized){return{score:1,reason:"exact_title"}}const leftCodes=new Set(left.issueCodes);if(right.issueCodes.some(code=>leftCodes.has(code))){return{score:.99,reason:"issue_code"}}return{score:jaccardSimilarity(left.tokens,right.tokens),reason:"title_token_jaccard"}}export{jaccardSimilarity2 as jaccardSimilarity,normalizeSimilarityText,prepareSimilarityText,scoreItemSimilarity,scorePreparedItemSimilarity,tokenizeSimilarityText};
 //# sourceMappingURL=similarity-scoring.js.map
-//# debugId=dff9b113-2b29-5154-afbf-f191f2f556a6

package/dist/sdk/similarity.js

@@ -1,327 +1,2 @@
-/**
- * @module sdk/similarity
- *
- * Provides one bounded, reusable similarity contract for create-time
- * governance and package-owned duplicate analysis.
- */
-
-!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]="9baf5711-9796-57e8-99e5-8990fd481ef8")}catch(e){}}();
-import { EXIT_CODE } from "../core/shared/constants.js";
-import { PmCliError } from "../core/shared/errors.js";
-import { resolveItemTypeRegistry } from "../core/item/type-registry.js";
-import { isTerminalStatus, normalizeStatusInput } from "../core/item/status.js";
-import { resolveRuntimeStatusRegistry } from "../core/schema/runtime-schema.js";
-import { listAllItemMetadataLight } from "../core/store/item-store.js";
-import { resolvePmRoot } from "../core/store/paths.js";
-import { readSettings } from "../core/store/settings.js";
-import { readItemMetadataDerivedIndexState } from "../core/store/item-metadata-cache.js";
-import { querySimilarItemMetadataIndex } from "../core/store/item-metadata-query-index.js";
-import { collectDuplicateCandidatePairs, MAX_DUPLICATE_CANDIDATE_PAIRS } from "./query/duplicate-candidates.js";
-import { prepareSimilarityText, scoreItemSimilarity, scorePreparedItemSimilarity, tokenizeSimilarityText, } from "./similarity-scoring.js";
-export { jaccardSimilarity, normalizeSimilarityText, prepareSimilarityText, scoreItemSimilarity, scorePreparedItemSimilarity, tokenizeSimilarityText, } from "./similarity-scoring.js";
-const DEFAULT_SIMILARITY_LIMIT = 3;
-const MAX_SIMILARITY_LIMIT = 20;
-const DEFAULT_SIMILARITY_THRESHOLD = 0.8;
-const DEFAULT_DUPLICATE_CLUSTER_LIMIT = 100;
-const MAX_DUPLICATE_CLUSTER_LIMIT = 1_000;
-/** Render compact warning tokens shared by create and copy results. */
-export function similarityAdvisoryWarnings(advisory) {
-    return advisory === undefined
-        ? []
-        : [
-            `likely_duplicates:${advisory.result.items
-                .map((item) => item.id)
-                .join(",")}`,
-            `likely_duplicate_recovery:${advisory.recovery.action}:${advisory.recovery.item_id}`,
-        ];
-}
-async function resolveSimilarityRecovery(result, options) {
-    const strongest = result.items[0];
-    const pmRoot = resolvePmRoot(options.cwd ?? process.cwd(), options.pmRoot);
-    const statusRegistry = resolveRuntimeStatusRegistry((await readSettings(pmRoot)).schema);
-    if (isTerminalStatus(strongest.status, statusRegistry)) {
-        return {
-            action: "reopen",
-            item_id: strongest.id,
-            command: `pm item reopen ${strongest.id} "<recurrence reason>"`,
-            args: ["item", "reopen", strongest.id, "<recurrence reason>"],
-        };
-    }
-    return {
-        action: "reuse",
-        item_id: strongest.id,
-        command: `pm get ${strongest.id} --full`,
-        args: ["get", strongest.id, "--full"],
-    };
-}
-function validateSimilarityOptions(options) {
-    const limit = options.limit ?? DEFAULT_SIMILARITY_LIMIT;
-    const threshold = options.threshold ?? DEFAULT_SIMILARITY_THRESHOLD;
-    if (!Number.isSafeInteger(limit) ||
-        limit < 0 ||
-        limit > MAX_SIMILARITY_LIMIT) {
-        throw new PmCliError(`Similarity limit must be an integer from 0 to ${MAX_SIMILARITY_LIMIT}.`, EXIT_CODE.USAGE);
-    }
-    if (!Number.isFinite(threshold) || threshold < 0 || threshold > 1) {
-        throw new PmCliError("Similarity threshold must be a number from 0 to 1.", EXIT_CODE.USAGE);
-    }
-    return { limit, threshold };
-}
-function validateDuplicateClusterOptions(options) {
-    const limit = options.limit ?? DEFAULT_DUPLICATE_CLUSTER_LIMIT;
-    if (!Number.isSafeInteger(limit) ||
-        limit < 0 ||
-        limit > MAX_DUPLICATE_CLUSTER_LIMIT) {
-        throw new PmCliError(`Duplicate cluster limit must be an integer from 0 to ${MAX_DUPLICATE_CLUSTER_LIMIT}.`, EXIT_CODE.USAGE);
-    }
-    const since = options.since === undefined ? undefined : new Date(options.since);
-    if (since && Number.isNaN(since.getTime())) {
-        throw new PmCliError("Duplicate cluster --since must be a valid ISO timestamp.", EXIT_CODE.USAGE);
-    }
-    return { limit, since };
-}
-/** Resolve registered statuses and load the metadata population before applying status and creation-time filters. */
-async function loadDuplicateItems(options, since) {
-    const pmRoot = resolvePmRoot(options.cwd ?? process.cwd(), options.pmRoot);
-    const settings = await readSettings(pmRoot);
-    const typeRegistry = resolveItemTypeRegistry(settings);
-    const requestedStatuses = options.statuses
-        ?.map((status) => status.trim().toLowerCase())
-        .filter(Boolean);
-    if (options.statuses !== undefined && requestedStatuses?.length === 0) {
-        throw new PmCliError("Duplicate cluster statuses must include at least one lifecycle status or all.", EXIT_CODE.USAGE);
-    }
-    const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);
-    const normalizedStatuses = requestedStatuses?.map((status) => {
-        if (status === "all")
-            return status;
-        const normalized = normalizeStatusInput(status, statusRegistry);
-        if (!normalized) {
-            throw new PmCliError(`Unknown duplicate-cluster status "${status}". Allowed: all, ${statusRegistry.definitions.map((entry) => entry.id).join(", ")}.`, EXIT_CODE.USAGE);
-        }
-        return normalized;
-    });
-    const hasAll = normalizedStatuses?.includes("all") === true;
-    if (hasAll && normalizedStatuses?.some((status) => status !== "all")) {
-        throw new PmCliError('The "all" status cannot be combined with other statuses.', EXIT_CODE.USAGE);
-    }
-    const effectiveStatuses = hasAll ? undefined : normalizedStatuses;
-    const allowedStatuses = effectiveStatuses
-        ? new Set(effectiveStatuses)
-        : undefined;
-    return {
-        items: (await listAllItemMetadataLight(pmRoot, settings.item_format, typeRegistry.type_to_folder, undefined, settings.schema))
-            .filter((item) => (!allowedStatuses || allowedStatuses.has(item.status)) &&
-            (!since || new Date(item.created_at).getTime() >= since.getTime())),
-        statuses: effectiveStatuses,
-    };
-}
-/** Internal deterministic seams used to prove bounded batch behavior without building a million-pair fixture. */
-export const _testOnlySimilarity = {
-    buildDuplicateClusters,
-    collectDuplicateCandidatePairs,
-    createDuplicateUnionFind,
-};
-function createDuplicateUnionFind(size) {
-    const parent = Array.from({ length: size }, (_entry, index) => index);
-    const findRoot = (index) => {
-        let root = index;
-        while (parent[root] !== root)
-            root = parent[root];
-        while (parent[index] !== index) {
-            const next = parent[index];
-            parent[index] = root;
-            index = next;
-        }
-        return root;
-    };
-    return { parent, findRoot };
-}
-function scoreDuplicateCandidates(items, candidates, threshold, union) {
-    const matches = [];
-    for (const candidate of candidates) {
-        const [leftIndex, rightIndex] = candidate
-            .split(":")
-            .map((value) => Number.parseInt(value, 10));
-        const scored = scorePreparedItemSimilarity(items[leftIndex].prepared, items[rightIndex].prepared);
-        if (scored.score < threshold)
-            continue;
-        const leftRoot = union.findRoot(leftIndex);
-        const rightRoot = union.findRoot(rightIndex);
-        if (leftRoot !== rightRoot)
-            union.parent[rightRoot] = leftRoot;
-        matches.push({
-            left_id: items[leftIndex].item.id,
-            right_id: items[rightIndex].item.id,
-            ...scored,
-        });
-    }
-    return matches;
-}
-/** Group unioned endpoints and their scored evidence once, then deterministically rank and limit complete components. */
-function buildDuplicateClusters(items, matches, union, limit) {
-    const components = new Map();
-    for (const index of items.keys()) {
-        const root = union.findRoot(index);
-        const component = components.get(root) ?? [];
-        component.push(index);
-        components.set(root, component);
-    }
-    const rootsById = new Map(items.map(({ item }, index) => [item.id, union.findRoot(index)]));
-    const matchesByRoot = new Map();
-    for (const match of matches) {
-        // Scored matches have already joined both endpoints in the union above.
-        const root = rootsById.get(match.left_id);
-        const rows = matchesByRoot.get(root) ?? [];
-        rows.push(match);
-        matchesByRoot.set(root, rows);
-    }
-    return [...components.values()]
-        .filter((component) => component.length > 1)
-        .map((component) => {
-        const clusterMatches = (matchesByRoot.get(union.findRoot(component[0])) ?? [])
-            .sort((left, right) => right.score - left.score ||
-            left.left_id.localeCompare(right.left_id) ||
-            left.right_id.localeCompare(right.right_id));
-        return {
-            id: items[component[0]].item.id,
-            items: component.map((itemIndex) => {
-                const item = items[itemIndex].item;
-                return {
-                    id: item.id,
-                    title: item.title,
-                    status: item.status,
-                    type: item.type,
-                };
-            }),
-            matches: clusterMatches,
-            max_score: clusterMatches[0]?.score ?? 0,
-        };
-    })
-        .sort((left, right) => right.max_score - left.max_score || left.id.localeCompare(right.id))
-        .slice(0, limit);
-}
-function rankSimilarItems(title, candidates, excludedIds, threshold, limit) {
-    return candidates
-        .filter((item) => !excludedIds.has(item.id))
-        .map((item) => ({
-        id: item.id,
-        title: item.title,
-        status: item.status,
-        type: item.type,
-        ...scoreItemSimilarity(title, item.title),
-    }))
-        .filter((item) => item.score >= threshold)
-        .sort((left, right) => right.score - left.score || left.id.localeCompare(right.id))
-        .slice(0, limit);
-}
-/** Find likely existing duplicates through an index-first bounded read. */
-export async function findSimilarItems(candidate, options = {}) {
-    const title = candidate.title.trim();
-    if (title.length === 0) {
-        throw new PmCliError("Similarity candidate title must not be empty.", EXIT_CODE.USAGE);
-    }
-    const { limit, threshold } = validateSimilarityOptions(options);
-    const pmRoot = resolvePmRoot(options.cwd ?? process.cwd(), options.pmRoot);
-    const settings = await readSettings(pmRoot);
-    const typeRegistry = resolveItemTypeRegistry(settings);
-    const indexState = await readItemMetadataDerivedIndexState(pmRoot, Object.values(typeRegistry.type_to_folder));
-    const tokens = tokenizeSimilarityText(title);
-    const indexed = indexState && tokens.length > 0
-        ? await querySimilarItemMetadataIndex({
-            pmRoot,
-            expectedSourceCursor: indexState.source_cursor,
-            query: tokens
-                .map((token) => `"${token.replaceAll('"', '""')}"`)
-                .join(" OR "),
-            limit: Math.max(limit * 10, 50),
-        })
-        : null;
-    const candidates = indexed === null
-        ? await listAllItemMetadataLight(pmRoot, settings.item_format, typeRegistry.type_to_folder, undefined, settings.schema)
-        : indexed.items;
-    const items = rankSimilarItems(title, candidates, new Set(candidate.excludeIds ?? []), threshold, limit);
-    return {
-        items,
-        count: items.length,
-        threshold,
-        source: indexed ? "persistent_index" : "metadata_fallback",
-    };
-}
-/**
- * Cluster caller-owned metadata using the same scorer and safety bounds as the CLI.
- * Candidate filtering is lossless; exhaustive mode provides an independent pair
- * population for recall checks. Inputs are copied, sorted and never mutated.
- */
-export function analyzeDuplicateItems(input, options = {}) {
-    const { threshold } = validateSimilarityOptions({ ...options, limit: undefined });
-    const { limit } = validateDuplicateClusterOptions(options);
-    const ids = new Set();
-    for (const item of input) {
-        if (!item.id.trim() || ids.has(item.id)) {
-            throw new PmCliError("Duplicate analysis requires unique non-empty item ids.", EXIT_CODE.USAGE);
-        }
-        ids.add(item.id);
-    }
-    const items = [...input].sort((left, right) => left.id.localeCompare(right.id))
-        .map((item) => ({ item, prepared: prepareSimilarityText(item.title) }));
-    const candidates = collectDuplicateCandidatePairs(items, MAX_DUPLICATE_CANDIDATE_PAIRS, threshold, options.exhaustive === true);
-    const union = createDuplicateUnionFind(items.length);
-    const matches = scoreDuplicateCandidates(items, candidates, threshold, union);
-    const clusters = buildDuplicateClusters(items, matches, union, limit);
-    return {
-        clusters,
-        count: clusters.length,
-        threshold,
-        cost: {
-            item_count: items.length,
-            algorithm: options.exhaustive === true || threshold === 0 ? "exhaustive" : "prefix_exact",
-            possible_pairs: items.length * (items.length - 1) / 2,
-            pair_limit: MAX_DUPLICATE_CANDIDATE_PAIRS,
-            recall_guarantee: "exact",
-            candidate_pairs: candidates.size,
-            scored_pairs: candidates.size,
-        },
-    };
-}
-/** Find connected duplicate clusters with one metadata read and shared package analysis. */
-export async function findDuplicateClusters(options = {}) {
-    validateSimilarityOptions({ ...options, limit: undefined });
-    const { since } = validateDuplicateClusterOptions(options);
-    const { items, statuses } = await loadDuplicateItems(options, since);
-    return {
-        ...analyzeDuplicateItems(items, options),
-        source: "metadata_scan",
-        filters: { statuses: statuses ?? null, since: options.since ?? null },
-    };
-}
-/** Apply off/advisory/strict mutation governance through the shared query. */
-export async function evaluateSimilarityGovernance(candidate, options) {
-    if (options.mode === "off")
-        return undefined;
-    const result = await findSimilarItems(candidate, options);
-    if (result.count === 0)
-        return undefined;
-    const recovery = await resolveSimilarityRecovery(result, options);
-    const bypassed = options.mode === "strict" && options.allowDuplicate === true;
-    if (options.mode === "strict" && !bypassed) {
-        const candidates = result.items
-            .map((item) => `${item.id} (${item.status}): ${item.title}`)
-            .join("; ");
-        const recoveryInstruction = recovery.action === "reopen"
-            ? "Reopen the canonical item"
-            : "Reuse the canonical item";
-        throw new PmCliError(`Likely duplicate item(s) found: ${candidates}. ${recoveryInstruction} or pass --allow-duplicate with explicit intent.`, EXIT_CODE.CONFLICT, {
-            code: "likely_duplicate",
-            required: `${recoveryInstruction}, or explicitly acknowledge the duplicate with --allow-duplicate.`,
-            recovery: {
-                suggested_flags: ["--allow-duplicate"],
-                suggested_retry: recovery.command,
-                suggested_retry_args: recovery.args,
-            },
-        });
-    }
-    return { mode: options.mode, bypassed, result, recovery };
-}
+!(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]="8d07624c-8663-5aba-8018-1b2c47997bef")}catch(e2){}})();import{EXIT_CODE}from"../core/shared/constants.js";import{PmCliError}from"../core/shared/errors.js";import{resolveItemTypeRegistry}from"../core/item/type-registry.js";import{isTerminalStatus,normalizeStatusInput}from"../core/item/status.js";import{resolveRuntimeStatusRegistry}from"../core/schema/runtime-schema.js";import{listAllItemMetadataLight}from"../core/store/item-store.js";import{resolvePmRoot}from"../core/store/paths.js";import{readSettings}from"../core/store/settings.js";import{readItemMetadataDerivedIndexState}from"../core/store/item-metadata-cache.js";import{querySimilarItemMetadataIndex}from"../core/store/item-metadata-query-index.js";import{collectDuplicateCandidatePairs,MAX_DUPLICATE_CANDIDATE_PAIRS}from"./query/duplicate-candidates.js";import{prepareSimilarityText,scoreItemSimilarity,scorePreparedItemSimilarity,tokenizeSimilarityText}from"./similarity-scoring.js";import{jaccardSimilarity,normalizeSimilarityText,prepareSimilarityText as prepareSimilarityText2,scoreItemSimilarity as scoreItemSimilarity2,scorePreparedItemSimilarity as scorePreparedItemSimilarity2,tokenizeSimilarityText as tokenizeSimilarityText2}from"./similarity-scoring.js";const DEFAULT_SIMILARITY_LIMIT=3;const MAX_SIMILARITY_LIMIT=20;const DEFAULT_SIMILARITY_THRESHOLD=.8;const DEFAULT_DUPLICATE_CLUSTER_LIMIT=100;const MAX_DUPLICATE_CLUSTER_LIMIT=1e3;function similarityAdvisoryWarnings(advisory){return advisory===void 0?[]:[`likely_duplicates:${advisory.result.items.map(item=>item.id).join(",")}`,`likely_duplicate_recovery:${advisory.recovery.action}:${advisory.recovery.item_id}`]}async function resolveSimilarityRecovery(result,options){const strongest=result.items[0];const pmRoot=resolvePmRoot(options.cwd??process.cwd(),options.pmRoot);const statusRegistry=resolveRuntimeStatusRegistry((await readSettings(pmRoot)).schema);if(isTerminalStatus(strongest.status,statusRegistry)){return{action:"reopen",item_id:strongest.id,command:`pm item reopen ${strongest.id} "<recurrence reason>"`,args:["item","reopen",strongest.id,"<recurrence reason>"]}}return{action:"reuse",item_id:strongest.id,command:`pm get ${strongest.id} --full`,args:["get",strongest.id,"--full"]}}function validateSimilarityOptions(options){const limit=options.limit??DEFAULT_SIMILARITY_LIMIT;const threshold=options.threshold??DEFAULT_SIMILARITY_THRESHOLD;if(!Number.isSafeInteger(limit)||limit<0||limit>MAX_SIMILARITY_LIMIT){throw new PmCliError(`Similarity limit must be an integer from 0 to ${MAX_SIMILARITY_LIMIT}.`,EXIT_CODE.USAGE)}if(!Number.isFinite(threshold)||threshold<0||threshold>1){throw new PmCliError("Similarity threshold must be a number from 0 to 1.",EXIT_CODE.USAGE)}return{limit,threshold}}function validateDuplicateClusterOptions(options){const limit=options.limit??DEFAULT_DUPLICATE_CLUSTER_LIMIT;if(!Number.isSafeInteger(limit)||limit<0||limit>MAX_DUPLICATE_CLUSTER_LIMIT){throw new PmCliError(`Duplicate cluster limit must be an integer from 0 to ${MAX_DUPLICATE_CLUSTER_LIMIT}.`,EXIT_CODE.USAGE)}const since=options.since===void 0?void 0:new Date(options.since);if(since&&Number.isNaN(since.getTime())){throw new PmCliError("Duplicate cluster --since must be a valid ISO timestamp.",EXIT_CODE.USAGE)}return{limit,since}}async function loadDuplicateItems(options,since){const pmRoot=resolvePmRoot(options.cwd??process.cwd(),options.pmRoot);const settings=await readSettings(pmRoot);const typeRegistry=resolveItemTypeRegistry(settings);const requestedStatuses=options.statuses?.map(status=>status.trim().toLowerCase()).filter(Boolean);if(options.statuses!==void 0&&requestedStatuses?.length===0){throw new PmCliError("Duplicate cluster statuses must include at least one lifecycle status or all.",EXIT_CODE.USAGE)}const statusRegistry=resolveRuntimeStatusRegistry(settings.schema);const normalizedStatuses=requestedStatuses?.map(status=>{if(status==="all")return status;const normalized=normalizeStatusInput(status,statusRegistry);if(!normalized){throw new PmCliError(`Unknown duplicate-cluster status "${status}". Allowed: all, ${statusRegistry.definitions.map(entry=>entry.id).join(", ")}.`,EXIT_CODE.USAGE)}return normalized});const hasAll=normalizedStatuses?.includes("all")===true;if(hasAll&&normalizedStatuses?.some(status=>status!=="all")){throw new PmCliError('The "all" status cannot be combined with other statuses.',EXIT_CODE.USAGE)}const effectiveStatuses=hasAll?void 0:normalizedStatuses;const allowedStatuses=effectiveStatuses?new Set(effectiveStatuses):void 0;return{items:(await listAllItemMetadataLight(pmRoot,settings.item_format,typeRegistry.type_to_folder,void 0,settings.schema)).filter(item=>(!allowedStatuses||allowedStatuses.has(item.status))&&(!since||new Date(item.created_at).getTime()>=since.getTime())),statuses:effectiveStatuses}}const _testOnlySimilarity={buildDuplicateClusters,collectDuplicateCandidatePairs,createDuplicateUnionFind};function createDuplicateUnionFind(size){const parent=Array.from({length:size},(_entry,index)=>index);const findRoot=index=>{let root=index;while(parent[root]!==root)root=parent[root];while(parent[index]!==index){const next=parent[index];parent[index]=root;index=next}return root};return{parent,findRoot}}function scoreDuplicateCandidates(items,candidates,threshold,union){const matches=[];for(const candidate of candidates){const[leftIndex,rightIndex]=candidate.split(":").map(value=>Number.parseInt(value,10));const scored=scorePreparedItemSimilarity(items[leftIndex].prepared,items[rightIndex].prepared);if(scored.score<threshold)continue;const leftRoot=union.findRoot(leftIndex);const rightRoot=union.findRoot(rightIndex);if(leftRoot!==rightRoot)union.parent[rightRoot]=leftRoot;matches.push({left_id:items[leftIndex].item.id,right_id:items[rightIndex].item.id,...scored})}return matches}function buildDuplicateClusters(items,matches,union,limit){const components=new Map;for(const index of items.keys()){const root=union.findRoot(index);const component=components.get(root)??[];component.push(index);components.set(root,component)}const rootsById=new Map(items.map(({item},index)=>[item.id,union.findRoot(index)]));const matchesByRoot=new Map;for(const match of matches){const root=rootsById.get(match.left_id);const rows=matchesByRoot.get(root)??[];rows.push(match);matchesByRoot.set(root,rows)}return[...components.values()].filter(component=>component.length>1).map(component=>{const clusterMatches=(matchesByRoot.get(union.findRoot(component[0]))??[]).sort((left,right)=>right.score-left.score||left.left_id.localeCompare(right.left_id)||left.right_id.localeCompare(right.right_id));return{id:items[component[0]].item.id,items:component.map(itemIndex=>{const item=items[itemIndex].item;return{id:item.id,title:item.title,status:item.status,type:item.type}}),matches:clusterMatches,max_score:clusterMatches[0]?.score??0}}).sort((left,right)=>right.max_score-left.max_score||left.id.localeCompare(right.id)).slice(0,limit)}function rankSimilarItems(title,candidates,excludedIds,threshold,limit){return candidates.filter(item=>!excludedIds.has(item.id)).map(item=>({id:item.id,title:item.title,status:item.status,type:item.type,...scoreItemSimilarity(title,item.title)})).filter(item=>item.score>=threshold).sort((left,right)=>right.score-left.score||left.id.localeCompare(right.id)).slice(0,limit)}async function findSimilarItems(candidate,options={}){const title=candidate.title.trim();if(title.length===0){throw new PmCliError("Similarity candidate title must not be empty.",EXIT_CODE.USAGE)}const{limit,threshold}=validateSimilarityOptions(options);const pmRoot=resolvePmRoot(options.cwd??process.cwd(),options.pmRoot);const settings=await readSettings(pmRoot);const typeRegistry=resolveItemTypeRegistry(settings);const indexState=await readItemMetadataDerivedIndexState(pmRoot,Object.values(typeRegistry.type_to_folder));const tokens=tokenizeSimilarityText(title);const indexed=indexState&&tokens.length>0?await querySimilarItemMetadataIndex({pmRoot,expectedSourceCursor:indexState.source_cursor,query:tokens.map(token=>`"${token.replaceAll('"','""')}"`).join(" OR "),limit:Math.max(limit*10,50)}):null;const candidates=indexed===null?await listAllItemMetadataLight(pmRoot,settings.item_format,typeRegistry.type_to_folder,void 0,settings.schema):indexed.items;const items=rankSimilarItems(title,candidates,new Set(candidate.excludeIds??[]),threshold,limit);return{items,count:items.length,threshold,source:indexed?"persistent_index":"metadata_fallback"}}function analyzeDuplicateItems(input,options={}){const{threshold}=validateSimilarityOptions({...options,limit:void 0});const{limit}=validateDuplicateClusterOptions(options);const ids=new Set;for(const item of input){if(!item.id.trim()||ids.has(item.id)){throw new PmCliError("Duplicate analysis requires unique non-empty item ids.",EXIT_CODE.USAGE)}ids.add(item.id)}const items=[...input].sort((left,right)=>left.id.localeCompare(right.id)).map(item=>({item,prepared:prepareSimilarityText(item.title)}));const candidates=collectDuplicateCandidatePairs(items,MAX_DUPLICATE_CANDIDATE_PAIRS,threshold,options.exhaustive===true);const union=createDuplicateUnionFind(items.length);const matches=scoreDuplicateCandidates(items,candidates,threshold,union);const clusters=buildDuplicateClusters(items,matches,union,limit);return{clusters,count:clusters.length,threshold,cost:{item_count:items.length,algorithm:options.exhaustive===true||threshold===0?"exhaustive":"prefix_exact",possible_pairs:items.length*(items.length-1)/2,pair_limit:MAX_DUPLICATE_CANDIDATE_PAIRS,recall_guarantee:"exact",candidate_pairs:candidates.size,scored_pairs:candidates.size}}}async function findDuplicateClusters(options={}){validateSimilarityOptions({...options,limit:void 0});const{since}=validateDuplicateClusterOptions(options);const{items,statuses}=await loadDuplicateItems(options,since);return{...analyzeDuplicateItems(items,options),source:"metadata_scan",filters:{statuses:statuses??null,since:options.since??null}}}async function evaluateSimilarityGovernance(candidate,options){if(options.mode==="off")return void 0;const result=await findSimilarItems(candidate,options);if(result.count===0)return void 0;const recovery=await resolveSimilarityRecovery(result,options);const bypassed=options.mode==="strict"&&options.allowDuplicate===true;if(options.mode==="strict"&&!bypassed){const candidates=result.items.map(item=>`${item.id} (${item.status}): ${item.title}`).join("; ");const recoveryInstruction=recovery.action==="reopen"?"Reopen the canonical item":"Reuse the canonical item";throw new PmCliError(`Likely duplicate item(s) found: ${candidates}. ${recoveryInstruction} or pass --allow-duplicate with explicit intent.`,EXIT_CODE.CONFLICT,{code:"likely_duplicate",required:`${recoveryInstruction}, or explicitly acknowledge the duplicate with --allow-duplicate.`,recovery:{suggested_flags:["--allow-duplicate"],suggested_retry:recovery.command,suggested_retry_args:recovery.args}})}return{mode:options.mode,bypassed,result,recovery}}export{_testOnlySimilarity,analyzeDuplicateItems,evaluateSimilarityGovernance,findDuplicateClusters,findSimilarItems,jaccardSimilarity,normalizeSimilarityText,prepareSimilarityText2 as prepareSimilarityText,scoreItemSimilarity2 as scoreItemSimilarity,scorePreparedItemSimilarity2 as scorePreparedItemSimilarity,similarityAdvisoryWarnings,tokenizeSimilarityText2 as tokenizeSimilarityText};
 //# sourceMappingURL=similarity.js.map
-//# debugId=9baf5711-9796-57e8-99e5-8990fd481ef8

package/dist/sdk/start-task-status.js

@@ -1,15 +1,2 @@
-/**
- * @module sdk/start-task-status
- *
- * Resolves lifecycle alias status transitions shared by CLI registration and the SDK runtime.
- */
-
-!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]="d1930c5a-6849-5f78-8090-a436f61711ae")}catch(e){}}();
-import { normalizeStatusInputWithRegistry, } from "../core/schema/runtime-schema.js";
-/** Resolve the status the `start-task` lifecycle alias should move an item to. Resolves `in_progress` strictly through the workspace registry so a custom workflow that omits in_progress falls back to its open status instead of setting a status the workflow does not define. */
-export function resolveStartTaskInProgressStatus(statusRegistry) {
-    return (normalizeStatusInputWithRegistry("in_progress", statusRegistry) ??
-        statusRegistry.open_status);
-}
+!(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]="961c1918-75f9-5e5d-bbae-b333ca29534f")}catch(e2){}})();import{normalizeStatusInputWithRegistry}from"../core/schema/runtime-schema.js";function resolveStartTaskInProgressStatus(statusRegistry){return normalizeStatusInputWithRegistry("in_progress",statusRegistry)??statusRegistry.open_status}export{resolveStartTaskInProgressStatus};
 //# sourceMappingURL=start-task-status.js.map
-//# debugId=d1930c5a-6849-5f78-8090-a436f61711ae