@unbrained/pm-cli 2026.9.7 → 2026.9.9

package/dist/core/shared/item-metadata-contract.js

@@ -1,90 +1,2 @@
-/**
- * @module core/shared/item-metadata-contract
- *
- * Declares the dependency-free canonical item metadata vocabulary shared by
- * storage, query projections, generated contracts, and package consumers.
- */
-/** Portable project-context fields shared by storage order and structured mutation IO. */
-
-!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]="27c5eac3-4580-5f6f-8ae9-b04d0281766d")}catch(e){}}();
-export const ITEM_PROJECT_CONTEXT_KEYS = [
-    "goal",
-    "objective",
-    "value",
-    "impact",
-    "outcome",
-    "why_now",
-    "parent",
-    "reviewer",
-    "risk",
-    "confidence",
-    "sprint",
-    "release",
-    "blocked_by",
-    "blocked_reason",
-    "unblock_note",
-    "reporter",
-    "severity",
-    "environment",
-    "repro_steps",
-    "resolution",
-    "expected_result",
-    "actual_result",
-];
-const ITEM_METADATA_KEY_ORDER_VALUES = [
-    "id",
-    "title",
-    "description",
-    "type",
-    "pm_format_version",
-    "source_type",
-    "type_options",
-    "status",
-    "priority",
-    "tags",
-    "created_at",
-    "updated_at",
-    "deadline",
-    "reminders",
-    "events",
-    "closed_at",
-    "completed_at",
-    "assignee",
-    "claim_principal",
-    "source_owner",
-    "author",
-    "estimated_minutes",
-    "acceptance_criteria",
-    "design",
-    "external_ref",
-    "definition_of_ready",
-    "order",
-    ...ITEM_PROJECT_CONTEXT_KEYS,
-    "affected_version",
-    "fixed_version",
-    "component",
-    "regression",
-    "customer_impact",
-    "dependencies",
-    "comments",
-    "notes",
-    "learnings",
-    "files",
-    "tests",
-    "test_runs",
-    "docs",
-    "close_reason",
-    "duplicate_of",
-    "plan_mode",
-    "plan_scope",
-    "plan_harness",
-    "plan_resume_context",
-    "plan_validation",
-    "plan_decisions",
-    "plan_discoveries",
-    "plan_steps",
-];
-/** Public contract for item metadata key order, shared by SDK and presentation-layer consumers. */
-export const ITEM_METADATA_KEY_ORDER = ITEM_METADATA_KEY_ORDER_VALUES;
+!(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]="0d16c1b3-1bc5-5973-a20d-78ada79d4c9b")}catch(e2){}})();const ITEM_PROJECT_CONTEXT_KEYS=["goal","objective","value","impact","outcome","why_now","parent","reviewer","risk","confidence","sprint","release","blocked_by","blocked_reason","unblock_note","reporter","severity","environment","repro_steps","resolution","expected_result","actual_result"];const ITEM_METADATA_KEY_ORDER_VALUES=["id","title","description","type","pm_format_version","source_type","type_options","status","priority","tags","created_at","updated_at","deadline","reminders","events","closed_at","completed_at","assignee","claim_principal","source_owner","author","estimated_minutes","acceptance_criteria","design","external_ref","definition_of_ready","order",...ITEM_PROJECT_CONTEXT_KEYS,"affected_version","fixed_version","component","regression","customer_impact","dependencies","comments","notes","learnings","files","tests","test_runs","docs","close_reason","duplicate_of","plan_mode","plan_scope","plan_harness","plan_resume_context","plan_validation","plan_decisions","plan_discoveries","plan_steps"];const ITEM_METADATA_KEY_ORDER=ITEM_METADATA_KEY_ORDER_VALUES;export{ITEM_METADATA_KEY_ORDER,ITEM_PROJECT_CONTEXT_KEYS};
 //# sourceMappingURL=item-metadata-contract.js.map
-//# debugId=27c5eac3-4580-5f6f-8ae9-b04d0281766d

package/dist/core/shared/lazy-module.js

@@ -1,17 +1,2 @@
-/**
- * @module core/shared/lazy-module
- *
- * Provides shared primitives and utilities for Lazy Module.
- */
-/** Creates a memoized async module loader for optional or expensive runtime dependencies. */
-
-!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]="0ce743d1-917a-5c96-b038-c95e3922bc48")}catch(e){}}();
-export function createLazyModule(importer) {
-    let promise = null;
-    return () => {
-        promise ??= importer();
-        return promise;
-    };
-}
+!(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]="4873876d-67b4-5f79-a984-756b7e539e9b")}catch(e2){}})();function createLazyModule(importer){let promise=null;return()=>{promise??=importer();return promise}}export{createLazyModule};
 //# sourceMappingURL=lazy-module.js.map
-//# debugId=0ce743d1-917a-5c96-b038-c95e3922bc48

package/dist/core/shared/levenshtein.js

@@ -1,62 +1,2 @@
-/**
- * @module core/shared/levenshtein
- *
- * Provides shared primitives and utilities for Levenshtein.
- */
-// Optimal String Alignment (OSA) Damerau–Levenshtein: counts a single adjacent
-// transposition as one edit (e.g. "titel" vs "title", "lst" vs "lts" -> "list")
-// so flag/command typo suggestions catch transpositions at the same maxDistance
-// budget plain Levenshtein uses for substitutions. pm-fl0c #6 (2026-05-28):
-// fixed because plain Levenshtein scored "titel"->"title" at 2, defeating the
-// length-5 maxDistance=1 ceiling in suggestNearestLongFlags.
-/** Computes bounded Levenshtein distance for typo suggestions without scanning unnecessary suffixes. */
-
-!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]="294d43fb-b6e8-5a5f-91fe-73ba21075bf5")}catch(e){}}();
-export function levenshteinDistanceWithinLimit(left, right, limit) {
-    if (left === right) {
-        return 0;
-    }
-    if (Math.abs(left.length - right.length) > limit) {
-        return null;
-    }
-    const width = right.length + 1;
-    const beforePrevious = new Array(width);
-    const previous = new Array(width);
-    const current = new Array(width);
-    for (let column = 0; column < width; column += 1) {
-        beforePrevious[column] = 0;
-        previous[column] = column;
-    }
-    for (let row = 1; row <= left.length; row += 1) {
-        current[0] = row;
-        let rowMin = current[0];
-        for (let column = 1; column <= right.length; column += 1) {
-            const cost = left[row - 1] === right[column - 1] ? 0 : 1;
-            const substitution = previous[column - 1] + cost;
-            const insertion = current[column - 1] + 1;
-            const deletion = previous[column] + 1;
-            let candidate = Math.min(substitution, insertion, deletion);
-            if (row > 1 &&
-                column > 1 &&
-                left[row - 1] === right[column - 2] &&
-                left[row - 2] === right[column - 1]) {
-                candidate = Math.min(candidate, beforePrevious[column - 2] + 1);
-            }
-            current[column] = candidate;
-            if (candidate < rowMin) {
-                rowMin = candidate;
-            }
-        }
-        if (rowMin > limit) {
-            return null;
-        }
-        for (let column = 0; column < width; column += 1) {
-            beforePrevious[column] = previous[column];
-            previous[column] = current[column];
-        }
-    }
-    const result = previous[right.length];
-    return result <= limit ? result : null;
-}
+!(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]="de2a2a0e-8a39-5569-9af9-cbf557bce2a9")}catch(e2){}})();function levenshteinDistanceWithinLimit(left,right,limit){if(left===right){return 0}if(Math.abs(left.length-right.length)>limit){return null}const width=right.length+1;const beforePrevious=new Array(width);const previous=new Array(width);const current=new Array(width);for(let column=0;column<width;column+=1){beforePrevious[column]=0;previous[column]=column}for(let row=1;row<=left.length;row+=1){current[0]=row;let rowMin=current[0];for(let column=1;column<=right.length;column+=1){const cost=left[row-1]===right[column-1]?0:1;const substitution=previous[column-1]+cost;const insertion=current[column-1]+1;const deletion=previous[column]+1;let candidate=Math.min(substitution,insertion,deletion);if(row>1&&column>1&&left[row-1]===right[column-2]&&left[row-2]===right[column-1]){candidate=Math.min(candidate,beforePrevious[column-2]+1)}current[column]=candidate;if(candidate<rowMin){rowMin=candidate}}if(rowMin>limit){return null}for(let column=0;column<width;column+=1){beforePrevious[column]=previous[column];previous[column]=current[column]}}const result=previous[right.length];return result<=limit?result:null}export{levenshteinDistanceWithinLimit};
 //# sourceMappingURL=levenshtein.js.map
-//# debugId=294d43fb-b6e8-5a5f-91fe-73ba21075bf5

package/dist/core/shared/memo.js

@@ -1,20 +1,2 @@
-/**
- * @module core/shared/memo
- *
- * Provides shared primitives and utilities for capped memoization maps.
- */
-/** Drop the oldest-inserted half of a memo map (Map preserves insertion order), so a size-cap hit mid-scan keeps the newest-inserted half instead of cold-starting the memo. Callers that re-insert entries on hit (the envelope memo) get LRU eviction; the scalar comparator memos evict purely by insertion order. */
-
-!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]="b2649352-0afa-5972-8c48-b999f86d5522")}catch(e){}}();
-export function evictOldestMemoEntries(memo) {
-    let remaining = Math.ceil(memo.size / 2);
-    for (const key of memo.keys()) {
-        if (remaining === 0) {
-            return;
-        }
-        memo.delete(key);
-        remaining -= 1;
-    }
-}
+!(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]="43f7bd27-7874-56f9-a497-e6f67a3ae9be")}catch(e2){}})();function evictOldestMemoEntries(memo){let remaining=Math.ceil(memo.size/2);for(const key of memo.keys()){if(remaining===0){return}memo.delete(key);remaining-=1}}export{evictOldestMemoEntries};
 //# sourceMappingURL=memo.js.map
-//# debugId=b2649352-0afa-5972-8c48-b999f86d5522

package/dist/core/shared/numeric-parsers.js

@@ -1,21 +1,2 @@
-/**
- * @module core/shared/numeric-parsers
- *
- * Provides dependency-neutral numeric parsers shared by CLI and SDK surfaces.
- */
-
-!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]="b9581c92-5e8a-589d-9681-d4d014e6902b")}catch(e){}}();
-import { EXIT_CODE } from "./constants.js";
-import { PmCliError } from "./errors.js";
-/** Parses a non-negative numeric limit and floors fractional values. */
-export function parseLimit(raw, label = "--limit") {
-    if (raw === undefined)
-        return undefined;
-    const parsed = Number(raw);
-    if (!Number.isFinite(parsed) || parsed < 0) {
-        throw new PmCliError(`${label} must be a non-negative number`, EXIT_CODE.USAGE);
-    }
-    return Math.floor(parsed);
-}
+!(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]="df9abedd-6e84-5712-8e5e-4e510ec3ed60")}catch(e2){}})();import{EXIT_CODE}from"./constants.js";import{PmCliError}from"./errors.js";function parseLimit(raw,label="--limit"){if(raw===void 0)return void 0;const parsed=Number(raw);if(!Number.isFinite(parsed)||parsed<0){throw new PmCliError(`${label} must be a non-negative number`,EXIT_CODE.USAGE)}return Math.floor(parsed)}export{parseLimit};
 //# sourceMappingURL=numeric-parsers.js.map
-//# debugId=b9581c92-5e8a-589d-9681-d4d014e6902b

package/dist/core/shared/option-alias-visibility.js

@@ -1,68 +1,2 @@
-/**
- * Helpers for deciding whether a CLI option alias is a pure snake_case
- * underscore-duplicate of an existing kebab-case flag.
- *
- * Mutation commands historically register every `--foo-bar` flag together with
- * a `--foo_bar` alias so agents are never blocked by a snake/kebab mismatch.
- * Those underscore duplicates roughly double the option list of every
- * `--help` and waste agent context. We keep them functional as parse-time
- * aliases but hide them from the rendered `--help` text.
- *
- * The rule is intentionally narrow: an alias is hidden ONLY when its long flag
- * is exactly the underscore form of an existing kebab flag (for example
- * `--create_mode` is the `-`→`_` form of `--create-mode`). Semantically-distinct
- * aliases (for example `--fail-on-warn` for `--strict-exit`, `--local` for
- * `--project`, `--ac` for `--acceptance-criteria`) are NOT snake duplicates and
- * stay visible.
- */
-/** Extract every long flag (for example `--create-mode`) from a commander flag spec that may include short aliases and a value placeholder. A spec can list more than one long flag, for example `"--estimate, --estimated-minutes <value>"` → `["--estimate", "--estimated-minutes"]`. */
-
-!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]="868dfae8-2575-5d5f-8425-c7e68aefdc84")}catch(e){}}();
-export function extractLongFlags(flagSpec) {
-    return flagSpec
-        .split(/[\s,|]+/)
-        .map((token) => token.trim())
-        .filter((token) => token.startsWith("--"));
-}
-/** Extract the first long flag from a commander flag spec, or null when none is present. */
-export function extractLongFlag(flagSpec) {
-    return extractLongFlags(flagSpec)[0] ?? null;
-}
-/**
- * Returns true when `aliasFlagSpec` differs from `canonicalFlagSpec` ONLY by
- * substituting one or more interior hyphens with underscores — i.e. it is a
- * pure snake_case underscore-duplicate of the canonical kebab flag.
- *
- * Examples that match (alias hidden):
- *   --create-mode            <- --create_mode
- *   --filter-assignee-filter <- --filter-assignee_filter
- *
- * Examples that do NOT match (alias stays visible):
- *   --acceptance-criteria    <- --ac      (different identifier)
- *   --order                  <- --rank    (different identifier)
- *   --strict-exit            <- --fail-on-warn (semantically distinct)
- */
-export function isPureSnakeCaseAlias(canonicalFlagSpec, aliasFlagSpec) {
-    const aliasLong = extractLongFlag(aliasFlagSpec);
-    if (aliasLong === null) {
-        return false;
-    }
-    const normalize = (long) => long.slice(2).replaceAll("-", "_");
-    // The canonical spec may declare multiple long flags (e.g.
-    // "--estimate, --estimated-minutes <value>"); the alias is hidden when it is
-    // the underscore form of ANY of them.
-    return extractLongFlags(canonicalFlagSpec).some((canonicalLong) => {
-        if (!canonicalLong.slice(2).includes("-")) {
-            // No interior hyphen to convert, so there is no kebab form to snake-duplicate.
-            return false;
-        }
-        if (aliasLong === canonicalLong) {
-            // Identical flags are not aliases of one another.
-            return false;
-        }
-        // Reachable from the canonical purely by hyphen→underscore substitution.
-        return normalize(aliasLong) === normalize(canonicalLong);
-    });
-}
+!(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]="3940f646-f84d-5eb0-8db1-de64ca0a5985")}catch(e2){}})();function extractLongFlags(flagSpec){return flagSpec.split(/[\s,|]+/).map(token=>token.trim()).filter(token=>token.startsWith("--"))}function extractLongFlag(flagSpec){return extractLongFlags(flagSpec)[0]??null}function isPureSnakeCaseAlias(canonicalFlagSpec,aliasFlagSpec){const aliasLong=extractLongFlag(aliasFlagSpec);if(aliasLong===null){return false}const normalize=long=>long.slice(2).replaceAll("-","_");return extractLongFlags(canonicalFlagSpec).some(canonicalLong=>{if(!canonicalLong.slice(2).includes("-")){return false}if(aliasLong===canonicalLong){return false}return normalize(aliasLong)===normalize(canonicalLong)})}export{extractLongFlag,extractLongFlags,isPureSnakeCaseAlias};
 //# sourceMappingURL=option-alias-visibility.js.map
-//# debugId=868dfae8-2575-5d5f-8425-c7e68aefdc84

package/dist/core/shared/primitives.js

@@ -1,128 +1,2 @@
-/**
- * Common primitive utility functions shared across core modules.
- *
- * These reduce duplication of trivial helpers like string-presence checks,
- * error message extraction, and numeric array guards that were previously
- * duplicated in providers.ts, vector-stores.ts, lock.ts, cache.ts, and
- * several CLI command modules.
- */
-/** Return a trimmed non-empty string, or `null` for non-string/blank input. */
-
-!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]="c29511ab-8c01-57f2-b353-cbc72900cb90")}catch(e){}}();
-export function toNonEmptyString(value) {
-    if (typeof value !== "string") {
-        return null;
-    }
-    const normalized = value.trim();
-    return normalized.length > 0 ? normalized : null;
-}
-/** Implements to non empty string or undefined for the public runtime surface of this module. */
-export function toNonEmptyStringOrUndefined(value) {
-    const result = toNonEmptyString(value);
-    return result ?? undefined;
-}
-/** Implements trim trailing slashes for the public runtime surface of this module. */
-export function trimTrailingSlashes(value) {
-    let end = value.length;
-    while (end > 0 && value.charCodeAt(end - 1) === 47) {
-        end -= 1;
-    }
-    return end === value.length ? value : value.slice(0, end);
-}
-/** Implements check whether finite number array for the public runtime surface of this module. */
-export function isFiniteNumberArray(value) {
-    return (Array.isArray(value) &&
-        value.every((entry) => typeof entry === "number" && Number.isFinite(entry)));
-}
-/** Implements to error message for the public runtime surface of this module. */
-export function toErrorMessage(error) {
-    if (error instanceof Error) {
-        const message = error.message.trim();
-        return message.length > 0 ? message : error.name;
-    }
-    return String(error);
-}
-/** Parse either a finite numeric literal or a non-empty numeric string. Returns `null` for unsupported input types, empty strings, and non-finite numeric values. */
-export function coerceFiniteNumber(value) {
-    const parsed = typeof value === "number"
-        ? value
-        : typeof value === "string" && value.trim().length > 0
-            ? Number(value.trim())
-            : Number.NaN;
-    return Number.isFinite(parsed) ? parsed : null;
-}
-/** Implements coerce positive integer for the public runtime surface of this module. */
-export function coercePositiveInteger(value) {
-    const parsed = coerceFiniteNumber(value);
-    if (parsed === null || parsed <= 0 || !Number.isInteger(parsed)) {
-        return null;
-    }
-    return parsed;
-}
-/** Implements coerce number in range for the public runtime surface of this module. */
-export function coerceNumberInRange(value, min, max) {
-    const parsed = coerceFiniteNumber(value);
-    if (parsed === null || parsed < min || parsed > max) {
-        return null;
-    }
-    return parsed;
-}
-/**
- * Narrow a value to a plain object, returning `null` for non-objects,
- * `null`, and arrays. Returns the original reference (no clone).
- *
- * Matches the historical `asRecord` in src/cli/main.ts.
- */
-export function asRecordOrNull(value) {
-    if (typeof value !== "object" || value === null || Array.isArray(value)) {
-        return null;
-    }
-    return value;
-}
-/**
- * Narrow a value to a plain object, returning `null` only for non-objects and
- * `null` while accepting arrays (arrays are objects). Returns the original
- * reference (no clone).
- *
- * Matches the historical `asRecord` in src/core/extensions/loader.ts, which
- * intentionally omits the array guard.
- */
-export function asRecordLoose(value) {
-    if (typeof value !== "object" || value === null) {
-        return null;
-    }
-    return value;
-}
-/** Narrow a value to a property-bearing object or function. Dynamic module exports can be function/class values with static lifecycle properties, so activation boundaries need a wider record shape than plain-object parsing. */
-export function asPropertyRecord(value) {
-    if ((typeof value !== "object" && typeof value !== "function") ||
-        value === null) {
-        return null;
-    }
-    return value;
-}
-/** Resolve the module or default export record that owns an `activate` lifecycle function. Accepts object and function/class-shaped exports so runtime loading and SDK tests share the same extension interop rule. */
-export function resolveActivatablePropertyRecord(value) {
-    const moduleRecord = asPropertyRecord(value);
-    if (!moduleRecord) {
-        return null;
-    }
-    if (typeof moduleRecord.activate === "function") {
-        return moduleRecord;
-    }
-    const defaultExport = asPropertyRecord(moduleRecord.default);
-    return typeof defaultExport?.activate === "function" ? defaultExport : null;
-}
-/**
- * Narrow a value to a plain object, returning an empty object for non-objects,
- * `null`, and arrays. Returns a shallow clone of the source object.
- *
- * Matches the historical `asRecord` in src/mcp/server.ts.
- */
-export function asRecordClone(value) {
-    return typeof value === "object" && value !== null && !Array.isArray(value)
-        ? { ...value }
-        : {};
-}
+!(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]="49fe564d-671f-5425-96fe-517cb323f773")}catch(e2){}})();function toNonEmptyString(value){if(typeof value!=="string"){return null}const normalized=value.trim();return normalized.length>0?normalized:null}function toNonEmptyStringOrUndefined(value){const result=toNonEmptyString(value);return result??void 0}function trimTrailingSlashes(value){let end=value.length;while(end>0&&value.charCodeAt(end-1)===47){end-=1}return end===value.length?value:value.slice(0,end)}function isFiniteNumberArray(value){return Array.isArray(value)&&value.every(entry=>typeof entry==="number"&&Number.isFinite(entry))}function toErrorMessage(error){if(error instanceof Error){const message=error.message.trim();return message.length>0?message:error.name}return String(error)}function coerceFiniteNumber(value){const parsed=typeof value==="number"?value:typeof value==="string"&&value.trim().length>0?Number(value.trim()):Number.NaN;return Number.isFinite(parsed)?parsed:null}function coercePositiveInteger(value){const parsed=coerceFiniteNumber(value);if(parsed===null||parsed<=0||!Number.isInteger(parsed)){return null}return parsed}function coerceNumberInRange(value,min,max){const parsed=coerceFiniteNumber(value);if(parsed===null||parsed<min||parsed>max){return null}return parsed}function asRecordOrNull(value){if(typeof value!=="object"||value===null||Array.isArray(value)){return null}return value}function asRecordLoose(value){if(typeof value!=="object"||value===null){return null}return value}function asPropertyRecord(value){if(typeof value!=="object"&&typeof value!=="function"||value===null){return null}return value}function resolveActivatablePropertyRecord(value){const moduleRecord=asPropertyRecord(value);if(!moduleRecord){return null}if(typeof moduleRecord.activate==="function"){return moduleRecord}const defaultExport=asPropertyRecord(moduleRecord.default);return typeof defaultExport?.activate==="function"?defaultExport:null}function asRecordClone(value){return typeof value==="object"&&value!==null&&!Array.isArray(value)?{...value}:{}}export{asPropertyRecord,asRecordClone,asRecordLoose,asRecordOrNull,coerceFiniteNumber,coerceNumberInRange,coercePositiveInteger,isFiniteNumberArray,resolveActivatablePropertyRecord,toErrorMessage,toNonEmptyString,toNonEmptyStringOrUndefined,trimTrailingSlashes};
 //# sourceMappingURL=primitives.js.map
-//# debugId=c29511ab-8c01-57f2-b353-cbc72900cb90

package/dist/core/shared/serial-queue.js

@@ -1,80 +1,2 @@
-/**
- * @module core/shared/serial-queue
- *
- * Provides shared primitives and utilities for Serial Queue.
- */
-// pm-3puw: a minimal FIFO async queue. Tasks enqueued onto a single instance run
-// strictly one-at-a-time in arrival order — the next task does not start until
-// the previous one has fully settled. The MCP stdio transport uses this to
-// process JSON-RPC lines in arrival order, so a client that pipelines two
-// mutations on the same item (without awaiting the first response) no longer
-// races into a lock conflict on the second.
-/** Create an arrival-ordered asynchronous read/write gate. Readers may overlap, while writers exclude both modes and never starve behind later readers. */
-
-!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]="3239b2c7-3ae3-5d4e-9005-b61000362304")}catch(e){}}();
-export function createAsyncReadWriteGate() {
-    let writerBarrier = Promise.resolve();
-    const readers = new Set();
-    return {
-        async read(task) {
-            const precedingWriters = writerBarrier;
-            let finishReader;
-            const readerDone = new Promise((resolve) => {
-                finishReader = resolve;
-            });
-            readers.add(readerDone);
-            await precedingWriters;
-            try {
-                return await task();
-            }
-            finally {
-                readers.delete(readerDone);
-                finishReader();
-            }
-        },
-        write(task) {
-            const precedingWork = Promise.all([writerBarrier, ...readers]);
-            const run = precedingWork.then(() => task());
-            writerBarrier = run.then(() => undefined, () => undefined);
-            return run;
-        },
-    };
-}
-/** Implements create serial queue for the public runtime surface of this module. */
-export function createSerialQueue() {
-    // `tail` is the error-isolated chain the next task waits on; it is kept
-    // separate from the per-task promise returned to callers so one rejection
-    // does not break the chain or surface as an unhandled rejection.
-    let tail = Promise.resolve();
-    let pending = 0;
-    const idleWaiters = [];
-    const notifyIdle = () => {
-        if (pending !== 0) {
-            return;
-        }
-        const waiters = idleWaiters.splice(0);
-        for (const resolve of waiters) {
-            resolve();
-        }
-    };
-    return {
-        enqueue(task) {
-            pending++;
-            const run = tail.then(() => task());
-            tail = run
-                .then(() => undefined, () => undefined)
-                .finally(() => {
-                pending--;
-                notifyIdle();
-            });
-            return run;
-        },
-        idle() {
-            return pending === 0
-                ? Promise.resolve()
-                : new Promise((resolve) => idleWaiters.push(resolve));
-        },
-    };
-}
+!(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]="07566a0b-2917-5ed8-828a-d811ae48dfaf")}catch(e2){}})();function createAsyncReadWriteGate(){let writerBarrier=Promise.resolve();const readers=new Set;return{async read(task){const precedingWriters=writerBarrier;let finishReader;const readerDone=new Promise(resolve=>{finishReader=resolve});readers.add(readerDone);await precedingWriters;try{return await task()}finally{readers.delete(readerDone);finishReader()}},write(task){const precedingWork=Promise.all([writerBarrier,...readers]);const run=precedingWork.then(()=>task());writerBarrier=run.then(()=>void 0,()=>void 0);return run}}}function createSerialQueue(){let tail=Promise.resolve();let pending=0;const idleWaiters=[];const notifyIdle=()=>{if(pending!==0){return}const waiters=idleWaiters.splice(0);for(const resolve of waiters){resolve()}};return{enqueue(task){pending++;const run=tail.then(()=>task());tail=run.then(()=>void 0,()=>void 0).finally(()=>{pending--;notifyIdle()});return run},idle(){return pending===0?Promise.resolve():new Promise(resolve=>idleWaiters.push(resolve))}}}export{createAsyncReadWriteGate,createSerialQueue};
 //# sourceMappingURL=serial-queue.js.map
-//# debugId=3239b2c7-3ae3-5d4e-9005-b61000362304