@unbrained/pm-cli 2026.9.6 → 2026.9.8

package/dist/core/shared/serialization.js

@@ -1,211 +1,2 @@
-/**
- * @module core/shared/serialization
- *
- * Provides shared primitives and utilities for Serialization.
- */
-
-!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]="83232698-197a-5aef-be7c-aa37f3c56822")}catch(e){}}();
-import crypto from "node:crypto";
-function sortScalarValue(value) {
-    if (value === null)
-        return null;
-    if (typeof value === "string" ||
-        typeof value === "number" ||
-        typeof value === "boolean") {
-        return value;
-    }
-    if (typeof value === "bigint") {
-        return value.toString();
-    }
-    if (value === undefined) {
-        return "undefined";
-    }
-    if (typeof value === "symbol") {
-        return value.toString();
-    }
-    if (typeof value === "function") {
-        return `[function:${value.name || "anonymous"}]`;
-    }
-    return undefined;
-}
-function sortPlainObjectKeys(value) {
-    // Use locale-independent Unicode code-unit ordering so canonical hashes stay reproducible.
-    const sortedKeys = Object.keys(value).sort();
-    const result = {};
-    for (const key of sortedKeys) {
-        const nested = value[key];
-        if (nested === undefined) {
-            continue;
-        }
-        result[key] = sortObjectKeys(nested);
-    }
-    return result;
-}
-function sortObjectKeys(value) {
-    const scalarValue = sortScalarValue(value);
-    if (scalarValue !== undefined) {
-        return scalarValue;
-    }
-    if (Array.isArray(value)) {
-        return value.map((entry) => sortObjectKeys(entry));
-    }
-    if (value instanceof Date) {
-        return value.toISOString();
-    }
-    const maybeJson = value;
-    if (typeof maybeJson.toJSON === "function") {
-        const normalized = maybeJson.toJSON();
-        if (normalized !== value) {
-            return sortObjectKeys(normalized);
-        }
-    }
-    return sortPlainObjectKeys(value);
-}
-/** Implements stable stringify for the public runtime surface of this module. */
-export function stableStringify(value) {
-    return JSON.stringify(sortObjectKeys(value));
-}
-function hasUnmatchedEquivalent(leftValue, rightValues, matchedIndexes, equals) {
-    for (let index = 0; index < rightValues.length; index += 1) {
-        if (matchedIndexes.has(index)) {
-            continue;
-        }
-        if (equals(leftValue, rightValues[index])) {
-            matchedIndexes.add(index);
-            return true;
-        }
-    }
-    return false;
-}
-function compareRegExpValues(left, right) {
-    if (!(left instanceof RegExp || right instanceof RegExp)) {
-        return undefined;
-    }
-    return (left instanceof RegExp &&
-        right instanceof RegExp &&
-        left.toString() === right.toString());
-}
-function compareDateValues(left, right) {
-    if (!(left instanceof Date || right instanceof Date)) {
-        return undefined;
-    }
-    return (left instanceof Date &&
-        right instanceof Date &&
-        left.getTime() === right.getTime());
-}
-function compareSetValues(left, right) {
-    if (!(left instanceof Set || right instanceof Set)) {
-        return undefined;
-    }
-    if (!(left instanceof Set && right instanceof Set) ||
-        left.size !== right.size) {
-        return false;
-    }
-    const rightValues = [...right];
-    const matched = new Set();
-    for (const leftValue of left) {
-        if (!hasUnmatchedEquivalent(leftValue, rightValues, matched, stableValueEquals)) {
-            return false;
-        }
-    }
-    return true;
-}
-function compareMapValues(left, right) {
-    if (!(left instanceof Map || right instanceof Map)) {
-        return undefined;
-    }
-    if (!(left instanceof Map && right instanceof Map) ||
-        left.size !== right.size) {
-        return false;
-    }
-    const rightEntries = [...right.entries()];
-    const matched = new Set();
-    for (const [leftKey, leftValue] of left.entries()) {
-        const leftEntry = [leftKey, leftValue];
-        if (!hasUnmatchedEquivalent(leftEntry, rightEntries, matched, ([candidateKey, candidateValue], [rightKey, rightValue]) => stableValueEquals(candidateKey, rightKey) &&
-            stableValueEquals(candidateValue, rightValue))) {
-            return false;
-        }
-    }
-    return true;
-}
-function compareArrayValues(left, right) {
-    if (!(Array.isArray(left) || Array.isArray(right))) {
-        return undefined;
-    }
-    if (!Array.isArray(left) ||
-        !Array.isArray(right) ||
-        left.length !== right.length) {
-        return false;
-    }
-    return left.every((value, index) => stableValueEquals(value, right[index]));
-}
-function comparePlainObjectValues(left, right) {
-    const leftKeys = Object.keys(left).sort((a, b) => a.localeCompare(b));
-    const rightKeys = Object.keys(right).sort((a, b) => a.localeCompare(b));
-    if (leftKeys.length !== rightKeys.length) {
-        return false;
-    }
-    for (let index = 0; index < leftKeys.length; index += 1) {
-        const leftKey = leftKeys[index];
-        if (leftKey !== rightKeys[index]) {
-            return false;
-        }
-        if (!stableValueEquals(left[leftKey], right[leftKey])) {
-            return false;
-        }
-    }
-    return true;
-}
-const SPECIALIZED_STABLE_VALUE_COMPARISONS = [
-    compareRegExpValues,
-    compareDateValues,
-    compareSetValues,
-    compareMapValues,
-    compareArrayValues,
-];
-/** Implements stable value equals for the public runtime surface of this module. */
-export function stableValueEquals(left, right) {
-    if (Object.is(left, right)) {
-        return true;
-    }
-    if (left === null ||
-        right === null ||
-        typeof left !== "object" ||
-        typeof right !== "object") {
-        return false;
-    }
-    for (const compare of SPECIALIZED_STABLE_VALUE_COMPARISONS) {
-        const result = compare(left, right);
-        if (result !== undefined) {
-            return result;
-        }
-    }
-    return comparePlainObjectValues(left, right);
-}
-/** Implements sha256 hex for the public runtime surface of this module. */
-export function sha256Hex(value) {
-    return crypto.createHash("sha256").update(value, "utf8").digest("hex");
-}
-/** Implements order object for the public runtime surface of this module. */
-export function orderObject(value, keyOrder) {
-    const ordered = {};
-    for (const key of keyOrder) {
-        const entry = value[key];
-        if (entry !== undefined) {
-            ordered[key] = entry;
-        }
-    }
-    const unknownKeys = Object.keys(value)
-        .filter((key) => !keyOrder.includes(key))
-        .sort((a, b) => a.localeCompare(b));
-    for (const key of unknownKeys) {
-        const entry = value[key];
-        if (entry !== undefined) {
-            ordered[key] = entry;
-        }
-    }
-    return ordered;
-}
+!(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]="c036d6cf-6a10-5c74-9e2f-e7c953339e2c")}catch(e2){}})();import crypto from"node:crypto";function sortScalarValue(value){if(value===null)return null;if(typeof value==="string"||typeof value==="number"||typeof value==="boolean"){return value}if(typeof value==="bigint"){return value.toString()}if(value===void 0){return"undefined"}if(typeof value==="symbol"){return value.toString()}if(typeof value==="function"){return`[function:${value.name||"anonymous"}]`}return void 0}function sortPlainObjectKeys(value){const sortedKeys=Object.keys(value).sort();const result={};for(const key of sortedKeys){const nested=value[key];if(nested===void 0){continue}result[key]=sortObjectKeys(nested)}return result}function sortObjectKeys(value){const scalarValue=sortScalarValue(value);if(scalarValue!==void 0){return scalarValue}if(Array.isArray(value)){return value.map(entry=>sortObjectKeys(entry))}if(value instanceof Date){return value.toISOString()}const maybeJson=value;if(typeof maybeJson.toJSON==="function"){const normalized=maybeJson.toJSON();if(normalized!==value){return sortObjectKeys(normalized)}}return sortPlainObjectKeys(value)}function stableStringify(value){return JSON.stringify(sortObjectKeys(value))}function hasUnmatchedEquivalent(leftValue,rightValues,matchedIndexes,equals){for(let index=0;index<rightValues.length;index+=1){if(matchedIndexes.has(index)){continue}if(equals(leftValue,rightValues[index])){matchedIndexes.add(index);return true}}return false}function compareRegExpValues(left,right){if(!(left instanceof RegExp||right instanceof RegExp)){return void 0}return left instanceof RegExp&&right instanceof RegExp&&left.toString()===right.toString()}function compareDateValues(left,right){if(!(left instanceof Date||right instanceof Date)){return void 0}return left instanceof Date&&right instanceof Date&&left.getTime()===right.getTime()}function compareSetValues(left,right){if(!(left instanceof Set||right instanceof Set)){return void 0}if(!(left instanceof Set&&right instanceof Set)||left.size!==right.size){return false}const rightValues=[...right];const matched=new Set;for(const leftValue of left){if(!hasUnmatchedEquivalent(leftValue,rightValues,matched,stableValueEquals)){return false}}return true}function compareMapValues(left,right){if(!(left instanceof Map||right instanceof Map)){return void 0}if(!(left instanceof Map&&right instanceof Map)||left.size!==right.size){return false}const rightEntries=[...right.entries()];const matched=new Set;for(const[leftKey,leftValue]of left.entries()){const leftEntry=[leftKey,leftValue];if(!hasUnmatchedEquivalent(leftEntry,rightEntries,matched,([candidateKey,candidateValue],[rightKey,rightValue])=>stableValueEquals(candidateKey,rightKey)&&stableValueEquals(candidateValue,rightValue))){return false}}return true}function compareArrayValues(left,right){if(!(Array.isArray(left)||Array.isArray(right))){return void 0}if(!Array.isArray(left)||!Array.isArray(right)||left.length!==right.length){return false}return left.every((value,index)=>stableValueEquals(value,right[index]))}function comparePlainObjectValues(left,right){const leftKeys=Object.keys(left).sort((a,b)=>a.localeCompare(b));const rightKeys=Object.keys(right).sort((a,b)=>a.localeCompare(b));if(leftKeys.length!==rightKeys.length){return false}for(let index=0;index<leftKeys.length;index+=1){const leftKey=leftKeys[index];if(leftKey!==rightKeys[index]){return false}if(!stableValueEquals(left[leftKey],right[leftKey])){return false}}return true}const SPECIALIZED_STABLE_VALUE_COMPARISONS=[compareRegExpValues,compareDateValues,compareSetValues,compareMapValues,compareArrayValues];function stableValueEquals(left,right){if(Object.is(left,right)){return true}if(left===null||right===null||typeof left!=="object"||typeof right!=="object"){return false}for(const compare of SPECIALIZED_STABLE_VALUE_COMPARISONS){const result=compare(left,right);if(result!==void 0){return result}}return comparePlainObjectValues(left,right)}function sha256Hex(value){return crypto.createHash("sha256").update(value,"utf8").digest("hex")}function orderObject(value,keyOrder){const ordered={};for(const key of keyOrder){const entry=value[key];if(entry!==void 0){ordered[key]=entry}}const unknownKeys=Object.keys(value).filter(key=>!keyOrder.includes(key)).sort((a,b)=>a.localeCompare(b));for(const key of unknownKeys){const entry=value[key];if(entry!==void 0){ordered[key]=entry}}return ordered}export{orderObject,sha256Hex,stableStringify,stableValueEquals};
 //# sourceMappingURL=serialization.js.map
-//# debugId=83232698-197a-5aef-be7c-aa37f3c56822

package/dist/core/shared/split-comma-list.js

@@ -1,31 +1,2 @@
-/**
- * Split a comma-separated (or custom-separator) string into trimmed, non-empty entries.
- *
- * Default behaviour:
- *   - Splits on `,`.
- *   - Trims each entry and discards empty results (collapsing leading/trailing/duplicate separators).
- *   - De-duplicates while preserving first-seen order.
- *   - Does not sort.
- *
- * Returns `[]` for `undefined`/`null` input. Pure, dependency-free.
- */
-
-!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]="4ecab833-db06-5baa-bfe6-d28b4c97f85a")}catch(e){}}();
-export function splitCommaList(raw, options) {
-    if (raw === undefined || raw === null) {
-        return [];
-    }
-    const separators = options?.separators ?? /,/;
-    const parts = raw.split(separators);
-    const trimmed = parts
-        .map((entry) => entry.trim())
-        .filter((entry) => entry.length > 0);
-    const unique = options?.unique !== false;
-    const deduped = unique ? Array.from(new Set(trimmed)) : trimmed;
-    if (options?.sort === true) {
-        return [...deduped].sort();
-    }
-    return deduped;
-}
+!(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]="f3edff87-6ea5-5108-a749-eeb380870601")}catch(e2){}})();function splitCommaList(raw,options){if(raw===void 0||raw===null){return[]}const separators=options?.separators??/,/;const parts=raw.split(separators);const trimmed=parts.map(entry=>entry.trim()).filter(entry=>entry.length>0);const unique=options?.unique!==false;const deduped=unique?Array.from(new Set(trimmed)):trimmed;if(options?.sort===true){return[...deduped].sort()}return deduped}export{splitCommaList};
 //# sourceMappingURL=split-comma-list.js.map
-//# debugId=4ecab833-db06-5baa-bfe6-d28b4c97f85a

package/dist/core/shared/text-normalization.js

@@ -1,39 +1,2 @@
-/**
- * @module core/shared/text-normalization
- *
- * Provides shared primitives and utilities for Text Normalization.
- */
-/** Normalizes text to lowercase whitespace-collapsed form for stable matching and comparison. */
-
-!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]="3ad30a32-0f83-5473-b0a3-349e271d8378")}catch(e){}}();
-export function normalizeLowercaseWhitespace(value) {
-    return value.trim().toLowerCase().replace(/\s+/g, " ");
-}
-/** Implements tokenize alpha numeric for the public runtime surface of this module. */
-export function tokenizeAlphaNumeric(value) {
-    return normalizeLowercaseWhitespace(value)
-        .split(/[^a-z0-9]+/)
-        .filter((token) => token.length > 0);
-}
-/** Implements jaccard similarity for the public runtime surface of this module. */
-export function jaccardSimilarity(leftTokens, rightTokens) {
-    if (leftTokens.length === 0 && rightTokens.length === 0) {
-        return 1;
-    }
-    if (leftTokens.length === 0 || rightTokens.length === 0) {
-        return 0;
-    }
-    const leftSet = new Set(leftTokens);
-    const rightSet = new Set(rightTokens);
-    let intersection = 0;
-    for (const token of leftSet) {
-        if (rightSet.has(token)) {
-            intersection += 1;
-        }
-    }
-    // Both token sets are non-empty here (guarded above), so union is always >= 1.
-    const union = new Set([...leftSet, ...rightSet]).size;
-    return intersection / union;
-}
+!(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]="c18e4dfc-d3e3-5185-9470-9d46b4dca893")}catch(e2){}})();function normalizeLowercaseWhitespace(value){return value.trim().toLowerCase().replace(/\s+/g," ")}function tokenizeAlphaNumeric(value){return normalizeLowercaseWhitespace(value).split(/[^a-z0-9]+/).filter(token=>token.length>0)}function jaccardSimilarity(leftTokens,rightTokens){if(leftTokens.length===0&&rightTokens.length===0){return 1}if(leftTokens.length===0||rightTokens.length===0){return 0}const leftSet=new Set(leftTokens);const rightSet=new Set(rightTokens);let intersection=0;for(const token of leftSet){if(rightSet.has(token)){intersection+=1}}const union=new Set([...leftSet,...rightSet]).size;return intersection/union}export{jaccardSimilarity,normalizeLowercaseWhitespace,tokenizeAlphaNumeric};
 //# sourceMappingURL=text-normalization.js.map
-//# debugId=3ad30a32-0f83-5473-b0a3-349e271d8378

package/dist/core/shared/time.js

@@ -1,307 +1,2 @@
-/**
- * @module core/shared/time
- *
- * Provides shared primitives and utilities for Time.
- */
-
-!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]="fb1102d4-1beb-5de8-87e6-af2efebafe39")}catch(e){}}();
-import { PmCliError } from "./errors.js";
-import { evictOldestMemoEntries } from "./memo.js";
-import { EXIT_CODE } from "./constants.js";
-import { nextReproducibleTimestamp } from "../reproducibility/context.js";
-const RELATIVE_DEADLINE = /^([+-]?)(\d+)([hdwm])$/i;
-const COMPOUND_RELATIVE_DEADLINE = /^[+-]?\d+[hdwm](?:[+-]\d+[hdwm])+$/i;
-const COMPACT_DATE = /^(\d{4})(\d{2})(\d{2})$/;
-const COMPACT_DATETIME = /^(\d{4})(\d{2})(\d{2})(?:[T\s]?)(\d{2})(\d{2})(\d{2})?([.,]\d{1,3})?(Z|[+-]\d{2}:?\d{2})?$/i;
-const HYPHEN_TIME = /^(\d{4}-\d{2}-\d{2})[T\s](\d{2})-(\d{2})(?:-(\d{2}))?([.,]\d{1,3})?(Z|[+-]\d{2}:?\d{2})?$/i;
-const COMPACT_TIME = /^(\d{4}-\d{2}-\d{2})[T\s](\d{2})(\d{2})(\d{2})?([.,]\d{1,3})?(Z|[+-]\d{2}:?\d{2})?$/i;
-const RFC_3339_DATE_TIME = /^(\d{4})-(\d{2})-(\d{2})T(\d{2}):(\d{2}):(\d{2})(?:\.\d+)?(?:Z|[+-](\d{2}):(\d{2}))$/i;
-/** Implements now iso for the public runtime surface of this module. */
-export function nowIso() {
-    return nextReproducibleTimestamp() ?? new Date().toISOString();
-}
-/** Implements check whether timestamp literal for the public runtime surface of this module. */
-export function isTimestampLiteral(input) {
-    return Number.isFinite(Date.parse(input));
-}
-/** Return whether a string is a calendar-valid RFC 3339 date-time. */
-export function isRfc3339DateTime(input) {
-    const match = RFC_3339_DATE_TIME.exec(input);
-    if (!match || !Number.isFinite(Date.parse(input)))
-        return false;
-    const [, yearRaw, monthRaw, dayRaw, hourRaw, minuteRaw, secondRaw, offsetHourRaw, offsetMinuteRaw,] = match;
-    const [year, month, day, hour, minute, second] = [
-        yearRaw,
-        monthRaw,
-        dayRaw,
-        hourRaw,
-        minuteRaw,
-        secondRaw,
-    ].map(Number);
-    return (month >= 1 &&
-        month <= 12 &&
-        day >= 1 &&
-        day <= daysInUtcMonth(year, month - 1) &&
-        hour <= 23 &&
-        minute <= 59 &&
-        second <= 59 &&
-        (offsetHourRaw === undefined || Number(offsetHourRaw) <= 23) &&
-        (offsetMinuteRaw === undefined || Number(offsetMinuteRaw) <= 59));
-}
-/** Return whether a value is a calendar-valid RFC 3339 date-time whose fractional seconds carry no sub-millisecond information. */
-export function isMillisecondPrecisionRfc3339DateTime(input) {
-    const fraction = /\.(\d+)(?:Z|[+-]\d{2}:\d{2})$/iu.exec(input)?.[1];
-    return (isRfc3339DateTime(input) &&
-        (fraction === undefined || /^\d{0,3}0*$/u.test(fraction)));
-}
-/**
- * Memoized `Date.parse` for {@link compareTimestampStrings}. Sort comparators call it
- * O(n log n) times over a corpus whose timestamp strings repeat heavily, and
- * `Date.parse` is expensive enough to show up in list/next/context profiles. The cap
- * bounds memory in long-lived hosts (the MCP server); half-eviction keeps the
- * newest-inserted half when the cap is hit.
- */
-const TIMESTAMP_PARSE_MEMO_MAX_ENTRIES = 10_000;
-const timestampParseMemo = new Map();
-function parseTimestampMsMemoized(value) {
-    const memoized = timestampParseMemo.get(value);
-    if (memoized !== undefined) {
-        return memoized;
-    }
-    const parsed = Date.parse(value);
-    if (timestampParseMemo.size >= TIMESTAMP_PARSE_MEMO_MAX_ENTRIES) {
-        evictOldestMemoEntries(timestampParseMemo);
-    }
-    timestampParseMemo.set(value, parsed);
-    return parsed;
-}
-/** Implements compare timestamp strings for the public runtime surface of this module. */
-export function compareTimestampStrings(left, right) {
-    const leftMs = parseTimestampMsMemoized(left);
-    const rightMs = parseTimestampMsMemoized(right);
-    if (Number.isFinite(leftMs) &&
-        Number.isFinite(rightMs) &&
-        leftMs !== rightMs) {
-        return leftMs - rightMs;
-    }
-    return left.localeCompare(right);
-}
-/** Return whether a timestamp-bearing record satisfies every configured bound. */
-export function matchesTimestampFilters(item, filters) {
-    return !((filters.deadlineBefore &&
-        (!item.deadline ||
-            compareTimestampStrings(item.deadline, filters.deadlineBefore) > 0)) ||
-        (filters.deadlineAfter &&
-            (!item.deadline ||
-                compareTimestampStrings(item.deadline, filters.deadlineAfter) < 0)) ||
-        (filters.updatedAfter &&
-            compareTimestampStrings(item.updated_at, filters.updatedAfter) < 0) ||
-        (filters.updatedBefore &&
-            compareTimestampStrings(item.updated_at, filters.updatedBefore) > 0) ||
-        (filters.createdAfter &&
-            compareTimestampStrings(item.created_at, filters.createdAfter) < 0) ||
-        (filters.createdBefore &&
-            compareTimestampStrings(item.created_at, filters.createdBefore) > 0));
-}
-function normalizeFraction(raw) {
-    if (!raw)
-        return "";
-    const digits = raw.slice(1);
-    return `.${digits.padEnd(3, "0").slice(0, 3)}`;
-}
-function normalizeOffset(raw) {
-    if (!raw)
-        return "";
-    if (raw.toUpperCase() === "Z")
-        return "Z";
-    const compact = /^([+-]\d{2})(\d{2})$/.exec(raw);
-    if (compact)
-        return `${compact[1]}:${compact[2]}`;
-    return raw;
-}
-function pushTimestampCandidate(candidates, input, value) {
-    if (!value)
-        return;
-    if (value === input)
-        return;
-    if (candidates.includes(value))
-        return;
-    candidates.push(value);
-}
-function normalizeTimestampCandidates(input) {
-    const candidates = [];
-    const push = (value) => pushTimestampCandidate(candidates, input, value);
-    const compactDate = COMPACT_DATE.exec(input);
-    if (compactDate) {
-        const [, year, month, day] = compactDate;
-        push(`${year}-${month}-${day}`);
-    }
-    const compactDateTime = COMPACT_DATETIME.exec(input);
-    if (compactDateTime) {
-        const [, year, month, day, hour, minute, secondRaw, fractionRaw, offsetRaw,] = compactDateTime;
-        const second = secondRaw ? `:${secondRaw}` : "";
-        push(`${year}-${month}-${day}T${hour}:${minute}${second}${normalizeFraction(fractionRaw)}${normalizeOffset(offsetRaw)}`);
-    }
-    const hyphenTime = HYPHEN_TIME.exec(input);
-    if (hyphenTime) {
-        const [, datePart, hour, minute, secondRaw, fractionRaw, offsetRaw] = hyphenTime;
-        const second = secondRaw ? `:${secondRaw}` : "";
-        push(`${datePart}T${hour}:${minute}${second}${normalizeFraction(fractionRaw)}${normalizeOffset(offsetRaw)}`);
-    }
-    const compactTime = COMPACT_TIME.exec(input);
-    if (compactTime) {
-        const [, datePart, hour, minute, secondRaw, fractionRaw, offsetRaw] = compactTime;
-        const second = secondRaw ? `:${secondRaw}` : "";
-        push(`${datePart}T${hour}:${minute}${second}${normalizeFraction(fractionRaw)}${normalizeOffset(offsetRaw)}`);
-    }
-    const datePrefixLength = 10;
-    const datePrefix = input.slice(0, datePrefixLength);
-    if (isHyphenDatePrefix(datePrefix)) {
-        let index = datePrefixLength;
-        while (index < input.length && isWhitespaceCharacter(input[index])) {
-            index += 1;
-        }
-        if (index < input.length) {
-            push(`${datePrefix}T${input.slice(index)}`);
-        }
-    }
-    return candidates;
-}
-function parseTimestampWithFallbacks(input) {
-    const direct = Date.parse(input);
-    if (Number.isFinite(direct))
-        return direct;
-    for (const candidate of normalizeTimestampCandidates(input)) {
-        const parsed = Date.parse(candidate);
-        if (Number.isFinite(parsed))
-            return parsed;
-    }
-    return Number.NaN;
-}
-function isHyphenDatePrefix(value) {
-    if (value.length !== 10) {
-        return false;
-    }
-    for (let index = 0; index < value.length; index += 1) {
-        const character = value[index];
-        if (index === 4 || index === 7) {
-            if (character !== "-") {
-                return false;
-            }
-            continue;
-        }
-        const code = character.charCodeAt(0);
-        if (code < 48 || code > 57) {
-            return false;
-        }
-    }
-    return true;
-}
-function isWhitespaceCharacter(character) {
-    if (!character) {
-        return false;
-    }
-    return (character === " " ||
-        character === "\t" ||
-        character === "\n" ||
-        character === "\r" ||
-        character === "\f" ||
-        character === "\v");
-}
-function daysInUtcMonth(year, monthIndex) {
-    return new Date(Date.UTC(year, monthIndex + 1, 0)).getUTCDate();
-}
-const MONTH_NAMES = [
-    "January",
-    "February",
-    "March",
-    "April",
-    "May",
-    "June",
-    "July",
-    "August",
-    "September",
-    "October",
-    "November",
-    "December",
-];
-// Leading literal calendar date in either hyphenated (`2026-02-30`) or compact
-// (`20260230`) form, optionally followed by any time/zone component. We validate
-// the digits the caller actually typed — not the parsed instant — so timezone
-// offsets never produce a false "impossible date" rejection. The hyphenated form
-// is unambiguous, so anything may follow (`T`/space time, `Z`, `+/-` offset). The
-// compact form must be followed by end-of-string or a time digit (with an optional
-// `T`/space separator) so a no-separator compact datetime like `20260230135900Z`
-// is still guarded and a 7-digit non-date is not misread as a date.
-const LEADING_HYPHEN_DATE = /^(\d{4})-(\d{2})-(\d{2})/;
-const LEADING_COMPACT_DATE = /^(\d{4})(\d{2})(\d{2})(?:[T ]?\d{2}|$)/;
-/** Reject literal calendar dates whose day cannot exist (e.g. `2026-02-30`, which JS `Date` silently rolls forward to March 2). Without this, agents that pass an impossible deadline get a silently-wrong stored date instead of an actionable error. Only triggers on a leading literal date; relative tokens, "now", and pure times are untouched. Month 00 / >12 is also rejected with a clear message rather than falling through to the generic "invalid value" path. */
-function assertRealCalendarDate(originalInput, trimmed, fieldLabel) {
-    const match = LEADING_HYPHEN_DATE.exec(trimmed) ?? LEADING_COMPACT_DATE.exec(trimmed);
-    if (!match) {
-        return;
-    }
-    const year = Number.parseInt(match[1], 10);
-    const month = Number.parseInt(match[2], 10);
-    const day = Number.parseInt(match[3], 10);
-    const label = fieldLabel?.trim() || "deadline";
-    if (month < 1 || month > 12) {
-        throw new PmCliError(`Invalid ${label} value "${originalInput}". Month "${match[2]}" is out of range — use a month between 01 and 12.`, EXIT_CODE.USAGE);
-    }
-    const maxDay = daysInUtcMonth(year, month - 1);
-    if (day < 1 || day > maxDay) {
-        throw new PmCliError(`Invalid ${label} value "${originalInput}". ${MONTH_NAMES[month - 1]} ${year} has ${maxDay} days, so day "${match[3]}" does not exist. Use a real YYYY-MM-DD calendar date.`, EXIT_CODE.USAGE);
-    }
-}
-function addUtcMonths(now, amount) {
-    const result = new Date(now.getTime());
-    const startDay = result.getUTCDate();
-    const targetMonthIndex = result.getUTCMonth() + amount;
-    const targetYear = result.getUTCFullYear() + Math.floor(targetMonthIndex / 12);
-    const targetMonth = ((targetMonthIndex % 12) + 12) % 12;
-    const day = Math.min(startDay, daysInUtcMonth(targetYear, targetMonth));
-    result.setUTCFullYear(targetYear, targetMonth, day);
-    return result;
-}
-/** Implements resolve iso or relative for the public runtime surface of this module. */
-export function resolveIsoOrRelative(input, now = new Date(), fieldLabel = "deadline") {
-    const trimmed = input.trim();
-    if (trimmed.toLowerCase() === "now") {
-        return now.toISOString();
-    }
-    const relative = RELATIVE_DEADLINE.exec(trimmed);
-    if (relative) {
-        const sign = relative[1] === "-" ? -1 : 1;
-        const amount = Number.parseInt(relative[2], 10) * sign;
-        const unit = relative[3].toLowerCase();
-        if (unit === "m") {
-            return addUtcMonths(now, amount).toISOString();
-        }
-        const msPerUnit = unit === "h"
-            ? 60 * 60 * 1000
-            : unit === "d"
-                ? 24 * 60 * 60 * 1000
-                : 7 * 24 * 60 * 60 * 1000;
-        return new Date(now.getTime() + amount * msPerUnit).toISOString();
-    }
-    assertRealCalendarDate(input, trimmed, fieldLabel);
-    const timestamp = parseTimestampWithFallbacks(trimmed);
-    if (!Number.isFinite(timestamp)) {
-        const normalizedLabel = fieldLabel.trim().length > 0 ? fieldLabel.trim() : "deadline";
-        const guidance = COMPOUND_RELATIVE_DEADLINE.test(trimmed)
-            ? "Compound relative expressions like +3d+1h are not supported; use a single relative token (for example +3d) or an ISO/date string."
-            : 'Use ISO/date string input, "now", or relative +6h/-6h/+1d/-1d/+2w/-2w/+6m/-6m.';
-        throw new PmCliError(`Invalid ${normalizedLabel} value "${input}". ${guidance}`, EXIT_CODE.USAGE);
-    }
-    return new Date(timestamp).toISOString();
-}
-/** Public contract for test only, shared by SDK and presentation-layer consumers. */
-export const _testOnly = {
-    normalizeOffset,
-    pushTimestampCandidate,
-    normalizeTimestampCandidates,
-    parseTimestampWithFallbacks,
-    isWhitespaceCharacter,
-};
+!(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]="a5bd8db9-cd23-5529-ad78-b7e87bd43b59")}catch(e2){}})();import{PmCliError}from"./errors.js";import{evictOldestMemoEntries}from"./memo.js";import{EXIT_CODE}from"./constants.js";import{nextReproducibleTimestamp}from"../reproducibility/context.js";const RELATIVE_DEADLINE=/^([+-]?)(\d+)([hdwm])$/i;const COMPOUND_RELATIVE_DEADLINE=/^[+-]?\d+[hdwm](?:[+-]\d+[hdwm])+$/i;const COMPACT_DATE=/^(\d{4})(\d{2})(\d{2})$/;const COMPACT_DATETIME=/^(\d{4})(\d{2})(\d{2})(?:[T\s]?)(\d{2})(\d{2})(\d{2})?([.,]\d{1,3})?(Z|[+-]\d{2}:?\d{2})?$/i;const HYPHEN_TIME=/^(\d{4}-\d{2}-\d{2})[T\s](\d{2})-(\d{2})(?:-(\d{2}))?([.,]\d{1,3})?(Z|[+-]\d{2}:?\d{2})?$/i;const COMPACT_TIME=/^(\d{4}-\d{2}-\d{2})[T\s](\d{2})(\d{2})(\d{2})?([.,]\d{1,3})?(Z|[+-]\d{2}:?\d{2})?$/i;const RFC_3339_DATE_TIME=/^(\d{4})-(\d{2})-(\d{2})T(\d{2}):(\d{2}):(\d{2})(?:\.\d+)?(?:Z|[+-](\d{2}):(\d{2}))$/i;function nowIso(){return nextReproducibleTimestamp()??new Date().toISOString()}function isTimestampLiteral(input){return Number.isFinite(Date.parse(input))}function isRfc3339DateTime(input){const match=RFC_3339_DATE_TIME.exec(input);if(!match||!Number.isFinite(Date.parse(input)))return false;const[,yearRaw,monthRaw,dayRaw,hourRaw,minuteRaw,secondRaw,offsetHourRaw,offsetMinuteRaw]=match;const[year,month,day,hour,minute,second]=[yearRaw,monthRaw,dayRaw,hourRaw,minuteRaw,secondRaw].map(Number);return month>=1&&month<=12&&day>=1&&day<=daysInUtcMonth(year,month-1)&&hour<=23&&minute<=59&&second<=59&&(offsetHourRaw===void 0||Number(offsetHourRaw)<=23)&&(offsetMinuteRaw===void 0||Number(offsetMinuteRaw)<=59)}function isMillisecondPrecisionRfc3339DateTime(input){const fraction=/\.(\d+)(?:Z|[+-]\d{2}:\d{2})$/iu.exec(input)?.[1];return isRfc3339DateTime(input)&&(fraction===void 0||/^\d{0,3}0*$/u.test(fraction))}const TIMESTAMP_PARSE_MEMO_MAX_ENTRIES=1e4;const timestampParseMemo=new Map;function parseTimestampMsMemoized(value){const memoized=timestampParseMemo.get(value);if(memoized!==void 0){return memoized}const parsed=Date.parse(value);if(timestampParseMemo.size>=TIMESTAMP_PARSE_MEMO_MAX_ENTRIES){evictOldestMemoEntries(timestampParseMemo)}timestampParseMemo.set(value,parsed);return parsed}function compareTimestampStrings(left,right){const leftMs=parseTimestampMsMemoized(left);const rightMs=parseTimestampMsMemoized(right);if(Number.isFinite(leftMs)&&Number.isFinite(rightMs)&&leftMs!==rightMs){return leftMs-rightMs}return left.localeCompare(right)}function matchesTimestampFilters(item,filters){return!(filters.deadlineBefore&&(!item.deadline||compareTimestampStrings(item.deadline,filters.deadlineBefore)>0)||filters.deadlineAfter&&(!item.deadline||compareTimestampStrings(item.deadline,filters.deadlineAfter)<0)||filters.updatedAfter&&compareTimestampStrings(item.updated_at,filters.updatedAfter)<0||filters.updatedBefore&&compareTimestampStrings(item.updated_at,filters.updatedBefore)>0||filters.createdAfter&&compareTimestampStrings(item.created_at,filters.createdAfter)<0||filters.createdBefore&&compareTimestampStrings(item.created_at,filters.createdBefore)>0)}function normalizeFraction(raw){if(!raw)return"";const digits=raw.slice(1);return`.${digits.padEnd(3,"0").slice(0,3)}`}function normalizeOffset(raw){if(!raw)return"";if(raw.toUpperCase()==="Z")return"Z";const compact=/^([+-]\d{2})(\d{2})$/.exec(raw);if(compact)return`${compact[1]}:${compact[2]}`;return raw}function pushTimestampCandidate(candidates,input,value){if(!value)return;if(value===input)return;if(candidates.includes(value))return;candidates.push(value)}function normalizeTimestampCandidates(input){const candidates=[];const push=value=>pushTimestampCandidate(candidates,input,value);const compactDate=COMPACT_DATE.exec(input);if(compactDate){const[,year,month,day]=compactDate;push(`${year}-${month}-${day}`)}const compactDateTime=COMPACT_DATETIME.exec(input);if(compactDateTime){const[,year,month,day,hour,minute,secondRaw,fractionRaw,offsetRaw]=compactDateTime;const second=secondRaw?`:${secondRaw}`:"";push(`${year}-${month}-${day}T${hour}:${minute}${second}${normalizeFraction(fractionRaw)}${normalizeOffset(offsetRaw)}`)}const hyphenTime=HYPHEN_TIME.exec(input);if(hyphenTime){const[,datePart,hour,minute,secondRaw,fractionRaw,offsetRaw]=hyphenTime;const second=secondRaw?`:${secondRaw}`:"";push(`${datePart}T${hour}:${minute}${second}${normalizeFraction(fractionRaw)}${normalizeOffset(offsetRaw)}`)}const compactTime=COMPACT_TIME.exec(input);if(compactTime){const[,datePart,hour,minute,secondRaw,fractionRaw,offsetRaw]=compactTime;const second=secondRaw?`:${secondRaw}`:"";push(`${datePart}T${hour}:${minute}${second}${normalizeFraction(fractionRaw)}${normalizeOffset(offsetRaw)}`)}const datePrefixLength=10;const datePrefix=input.slice(0,datePrefixLength);if(isHyphenDatePrefix(datePrefix)){let index=datePrefixLength;while(index<input.length&&isWhitespaceCharacter(input[index])){index+=1}if(index<input.length){push(`${datePrefix}T${input.slice(index)}`)}}return candidates}function parseTimestampWithFallbacks(input){const direct=Date.parse(input);if(Number.isFinite(direct))return direct;for(const candidate of normalizeTimestampCandidates(input)){const parsed=Date.parse(candidate);if(Number.isFinite(parsed))return parsed}return Number.NaN}function isHyphenDatePrefix(value){if(value.length!==10){return false}for(let index=0;index<value.length;index+=1){const character=value[index];if(index===4||index===7){if(character!=="-"){return false}continue}const code=character.charCodeAt(0);if(code<48||code>57){return false}}return true}function isWhitespaceCharacter(character){if(!character){return false}return character===" "||character==="	"||character==="\n"||character==="\r"||character==="\f"||character==="\v"}function daysInUtcMonth(year,monthIndex){return new Date(Date.UTC(year,monthIndex+1,0)).getUTCDate()}const MONTH_NAMES=["January","February","March","April","May","June","July","August","September","October","November","December"];const LEADING_HYPHEN_DATE=/^(\d{4})-(\d{2})-(\d{2})/;const LEADING_COMPACT_DATE=/^(\d{4})(\d{2})(\d{2})(?:[T ]?\d{2}|$)/;function assertRealCalendarDate(originalInput,trimmed,fieldLabel){const match=LEADING_HYPHEN_DATE.exec(trimmed)??LEADING_COMPACT_DATE.exec(trimmed);if(!match){return}const year=Number.parseInt(match[1],10);const month=Number.parseInt(match[2],10);const day=Number.parseInt(match[3],10);const label=fieldLabel?.trim()||"deadline";if(month<1||month>12){throw new PmCliError(`Invalid ${label} value "${originalInput}". Month "${match[2]}" is out of range \u2014 use a month between 01 and 12.`,EXIT_CODE.USAGE)}const maxDay=daysInUtcMonth(year,month-1);if(day<1||day>maxDay){throw new PmCliError(`Invalid ${label} value "${originalInput}". ${MONTH_NAMES[month-1]} ${year} has ${maxDay} days, so day "${match[3]}" does not exist. Use a real YYYY-MM-DD calendar date.`,EXIT_CODE.USAGE)}}function addUtcMonths(now,amount){const result=new Date(now.getTime());const startDay=result.getUTCDate();const targetMonthIndex=result.getUTCMonth()+amount;const targetYear=result.getUTCFullYear()+Math.floor(targetMonthIndex/12);const targetMonth=(targetMonthIndex%12+12)%12;const day=Math.min(startDay,daysInUtcMonth(targetYear,targetMonth));result.setUTCFullYear(targetYear,targetMonth,day);return result}function resolveIsoOrRelative(input,now=new Date,fieldLabel="deadline"){const trimmed=input.trim();if(trimmed.toLowerCase()==="now"){return now.toISOString()}const relative=RELATIVE_DEADLINE.exec(trimmed);if(relative){const sign=relative[1]==="-"?-1:1;const amount=Number.parseInt(relative[2],10)*sign;const unit=relative[3].toLowerCase();if(unit==="m"){return addUtcMonths(now,amount).toISOString()}const msPerUnit=unit==="h"?60*60*1e3:unit==="d"?24*60*60*1e3:7*24*60*60*1e3;return new Date(now.getTime()+amount*msPerUnit).toISOString()}assertRealCalendarDate(input,trimmed,fieldLabel);const timestamp=parseTimestampWithFallbacks(trimmed);if(!Number.isFinite(timestamp)){const normalizedLabel=fieldLabel.trim().length>0?fieldLabel.trim():"deadline";const guidance=COMPOUND_RELATIVE_DEADLINE.test(trimmed)?"Compound relative expressions like +3d+1h are not supported; use a single relative token (for example +3d) or an ISO/date string.":'Use ISO/date string input, "now", or relative +6h/-6h/+1d/-1d/+2w/-2w/+6m/-6m.';throw new PmCliError(`Invalid ${normalizedLabel} value "${input}". ${guidance}`,EXIT_CODE.USAGE)}return new Date(timestamp).toISOString()}const _testOnly={normalizeOffset,pushTimestampCandidate,normalizeTimestampCandidates,parseTimestampWithFallbacks,isWhitespaceCharacter};export{_testOnly,compareTimestampStrings,isMillisecondPrecisionRfc3339DateTime,isRfc3339DateTime,isTimestampLiteral,matchesTimestampFilters,nowIso,resolveIsoOrRelative};
 //# sourceMappingURL=time.js.map
-//# debugId=fb1102d4-1beb-5de8-87e6-af2efebafe39

package/dist/core/store/index.js

@@ -1,13 +1,2 @@
-/**
- * @module core/store/index
- *
- * Reads and writes tracker storage with format-aware helpers for Index.
- */
-
-!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]="b6bfc1f8-dc32-5942-810a-21f076e57d0f")}catch(e){}}();
-export * from "./item-format-migration.js";
-export * from "./item-store.js";
-export * from "./paths.js";
-export * from "./settings.js";
+!(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]="73dc2a96-d38f-5599-9c1a-3f035d466c46")}catch(e2){}})();export*from"./item-format-migration.js";export*from"./item-store.js";export*from"./paths.js";export*from"./settings.js";
 //# sourceMappingURL=index.js.map
-//# debugId=b6bfc1f8-dc32-5942-810a-21f076e57d0f