@unbrained/pm-cli 2026.7.13 → 2026.7.14

package/dist/sdk/context-packing.d.ts

@@ -0,0 +1,114 @@
+/**
+ * @module sdk/context-packing
+ *
+ * Deterministic, token-budget-aware packing primitives for ranked context and
+ * next-work candidates. The packer is deliberately storage-agnostic so custom
+ * tools can reuse the exact selection contract with their own projections.
+ */
+/** Detail levels a context candidate may occupy inside a bounded packet. */
+export type ContextProjectionLevel = "identity" | "summary" | "full";
+/** Stable intent-keyed policies for risk, diversity, and safety-aware packing. */
+export declare const CONTEXT_PACKING_PROFILES: {
+    readonly balanced: {
+        readonly redundancyPenalty: 0.35;
+        readonly uncertaintyPenalty: 0.2;
+    };
+    readonly context: {
+        readonly redundancyPenalty: 0.45;
+        readonly uncertaintyPenalty: 0.15;
+    };
+    readonly next: {
+        readonly redundancyPenalty: 0.25;
+        readonly uncertaintyPenalty: 0.3;
+    };
+};
+/** Built-in task-set profiles selected from the triggering command intent. */
+export type ContextPackingProfile = keyof typeof CONTEXT_PACKING_PROFILES;
+/** Token costs for the monotone projection levels of one candidate. */
+export interface ContextProjectionCosts {
+    /** Stable identity-only representation cost. */
+    identity: number;
+    /** Compact summary representation cost. */
+    summary: number;
+    /** Full representation cost. */
+    full: number;
+}
+/** One ranked candidate offered to the context packet optimizer. */
+export interface ContextPackingCandidate<TItem> {
+    /** Stable candidate identifier. */
+    id: string;
+    /** Caller-owned value returned unchanged for selected candidates. */
+    item: TItem;
+    /** One-based relevance rank; lower is better. */
+    rank: number;
+    /** Normalized relevance score. */
+    score: number;
+    /** Projection-specific token estimates. */
+    token_costs: ContextProjectionCosts;
+    /** Candidates sharing a cluster compete through a redundancy penalty. */
+    cluster?: string;
+    /** Required anchors are admitted before optional candidates. */
+    required?: boolean;
+    /** Optional credible-width estimate used for risk-adjusted value. */
+    uncertainty?: number;
+    /** Optional lineage identity used to suppress superseded duplicates. */
+    lineage?: string;
+}
+/** One selected candidate and the projection depth bought for it. */
+export interface PackedContextCandidate<TItem> extends ContextPackingCandidate<TItem> {
+    /** Projection depth selected by the packer. */
+    projection: ContextProjectionLevel;
+    /** Tokens charged to the packet. */
+    tokens: number;
+    /** Risk- and redundancy-adjusted value used for selection. */
+    marginal_value: number;
+}
+/** Accounting and completeness metadata for one packed context packet. */
+export interface ContextPackingReport<TItem> {
+    /** Selected candidates in deterministic relevance order. */
+    included: PackedContextCandidate<TItem>[];
+    /** Ranked candidate identifiers omitted after projection degradation. */
+    omitted_ids: string[];
+    /** Explicit packet token budget. */
+    token_budget: number;
+    /** Estimated tokens consumed by selected projections. */
+    used_tokens: number;
+    /** Tokens left unspent. */
+    remaining_tokens: number;
+    /** True when every candidate fit at full detail. */
+    complete: boolean;
+    /** Whether selection inspected every optional candidate before its deadline. */
+    selection_complete: boolean;
+    /** Machine-readable reason selection stopped. */
+    termination_reason: "exhausted" | "latency_budget";
+    /** Candidate comparisons completed by the bounded selector. */
+    evaluated_candidates: number;
+    /** Explicit selection latency budget, or null when unbounded. */
+    latency_budget_ms: number | null;
+    /** Stable task-set profile disclosed to downstream evaluation. */
+    profile: ContextPackingProfile;
+    /** Projection degradation order used by the optimizer. */
+    degradation_ladder: ContextProjectionLevel[];
+}
+/** Options controlling deterministic packet selection. */
+export interface PackContextCandidatesOptions {
+    /** Maximum estimated tokens available to the packet. */
+    tokenBudget: number;
+    /** Task-set profile disclosed in the result envelope. */
+    profile?: ContextPackingProfile;
+    /** Penalty applied when a cluster or lineage is already represented. */
+    redundancyPenalty?: number;
+    /** Risk-aversion coefficient applied to candidate uncertainty. */
+    uncertaintyPenalty?: number;
+    /** Maximum selector wall-clock time; required anchors remain mask-immune. */
+    latencyBudgetMs?: number;
+    /** Monotonic clock override for deterministic hosts and tests. */
+    readClock?: () => number;
+}
+/**
+ * Packs ranked candidates under an explicit token budget. Required anchors are
+ * admitted first, optional rows compete by marginal value per token, and then
+ * selected rows are upgraded from identity to summary to full detail. This
+ * guarantees projection degradation happens before omission.
+ */
+export declare function packContextCandidates<TItem>(candidates: readonly ContextPackingCandidate<TItem>[], options: PackContextCandidatesOptions): ContextPackingReport<TItem>;

package/dist/sdk/context-packing.js

@@ -0,0 +1,219 @@
+/**
+ * @module sdk/context-packing
+ *
+ * Deterministic, token-budget-aware packing primitives for ranked context and
+ * next-work candidates. The packer is deliberately storage-agnostic so custom
+ * tools can reuse the exact selection contract with their own projections.
+ */
+/** Stable intent-keyed policies for risk, diversity, and safety-aware packing. */
+
+!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]="f2b38b30-c8d0-51a2-9444-b2e0db9fa353")}catch(e){}}();
+export const CONTEXT_PACKING_PROFILES = {
+    balanced: { redundancyPenalty: 0.35, uncertaintyPenalty: 0.2 },
+    context: { redundancyPenalty: 0.45, uncertaintyPenalty: 0.15 },
+    next: { redundancyPenalty: 0.25, uncertaintyPenalty: 0.3 },
+};
+const PROJECTION_LEVELS = [
+    "identity",
+    "summary",
+    "full",
+];
+function assertPackingCandidate(candidate) {
+    if (!candidate.id.trim() ||
+        !Number.isInteger(candidate.rank) ||
+        candidate.rank < 1) {
+        throw new TypeError("Context packing candidates require a non-empty id and positive integer rank");
+    }
+    if (!Number.isFinite(candidate.score) || candidate.score < 0) {
+        throw new TypeError("Context packing candidate scores must be finite and non-negative");
+    }
+    const costs = PROJECTION_LEVELS.map((level) => candidate.token_costs[level]);
+    if (costs.some((cost) => !Number.isInteger(cost) || cost < 1) ||
+        costs[0] > costs[1] ||
+        costs[1] > costs[2]) {
+        throw new TypeError("Context projection costs must be positive monotone integers");
+    }
+    if (candidate.uncertainty !== undefined &&
+        (!Number.isFinite(candidate.uncertainty) || candidate.uncertainty < 0)) {
+        throw new TypeError("Context packing uncertainty must be finite and non-negative");
+    }
+}
+function resolvePackingPenalties(options) {
+    if (!Number.isInteger(options.tokenBudget) || options.tokenBudget < 1) {
+        throw new TypeError("Context packing tokenBudget must be a positive integer");
+    }
+    const profile = options.profile ?? "balanced";
+    const policy = CONTEXT_PACKING_PROFILES[profile];
+    if (!policy)
+        throw new TypeError("Unknown context packing profile");
+    const redundancy = options.redundancyPenalty ?? policy.redundancyPenalty;
+    const uncertainty = options.uncertaintyPenalty ?? policy.uncertaintyPenalty;
+    if (!Number.isFinite(redundancy) ||
+        redundancy < 0 ||
+        redundancy > 1 ||
+        !Number.isFinite(uncertainty) ||
+        uncertainty < 0) {
+        throw new TypeError("Context packing penalties must be finite and within their supported ranges");
+    }
+    if (options.latencyBudgetMs !== undefined &&
+        (!Number.isFinite(options.latencyBudgetMs) || options.latencyBudgetMs <= 0)) {
+        throw new TypeError("Context packing latencyBudgetMs must be positive");
+    }
+    return { redundancy, uncertainty, profile };
+}
+function orderPackingCandidates(candidates) {
+    const ids = new Set();
+    for (const candidate of candidates) {
+        assertPackingCandidate(candidate);
+        if (ids.has(candidate.id)) {
+            throw new TypeError("Context packing candidates require unique ids");
+        }
+        ids.add(candidate.id);
+    }
+    return [...candidates].sort((left, right) => left.rank - right.rank || left.id.localeCompare(right.id));
+}
+function findBestAffordableCandidate(candidates, remaining, valueOf, deadline, readClock) {
+    let bestIndex = -1;
+    let evaluated = 0;
+    for (let index = 0; index < candidates.length; index += 1) {
+        if (index % 128 === 0 && readClock() >= deadline) {
+            return { index: bestIndex, evaluated, timedOut: true };
+        }
+        const candidate = candidates[index];
+        if (candidate.token_costs.identity > remaining)
+            continue;
+        evaluated += 1;
+        const best = bestIndex < 0 ? undefined : candidates[bestIndex];
+        const density = valueOf(candidate) / candidate.token_costs.identity;
+        const bestDensity = best === undefined
+            ? Number.NEGATIVE_INFINITY
+            : valueOf(best) / best.token_costs.identity;
+        if (density > bestDensity ||
+            (density === bestDensity &&
+                best !== undefined &&
+                (candidate.rank < best.rank ||
+                    (candidate.rank === best.rank &&
+                        candidate.id.localeCompare(best.id) < 0)))) {
+            bestIndex = index;
+        }
+    }
+    return { index: bestIndex, evaluated, timedOut: false };
+}
+function selectIdentityCandidates(params) {
+    const represented = new Set();
+    const included = [];
+    let remaining = params.tokenBudget;
+    const valueOf = (candidate) => {
+        const key = candidate.lineage ?? candidate.cluster;
+        const redundancy = key && represented.has(key) ? 1 - params.redundancyPenalty : 1;
+        return Math.max(0, (candidate.score -
+            params.uncertaintyPenalty * (candidate.uncertainty ?? 0)) *
+            redundancy);
+    };
+    const admit = (candidate) => {
+        const tokens = candidate.token_costs.identity;
+        included.push({
+            ...candidate,
+            projection: "identity",
+            tokens,
+            marginal_value: valueOf(candidate),
+        });
+        remaining -= tokens;
+        const key = candidate.lineage ?? candidate.cluster;
+        if (key)
+            represented.add(key);
+    };
+    for (const candidate of params.ordered.filter((entry) => entry.required)) {
+        if (candidate.token_costs.identity <= remaining)
+            admit(candidate);
+    }
+    const optional = params.ordered.filter((entry) => !entry.required);
+    let selectionComplete = true;
+    let evaluatedCandidates = 0;
+    while (optional.length > 0) {
+        const selection = findBestAffordableCandidate(optional, remaining, valueOf, params.deadline, params.readClock);
+        evaluatedCandidates += selection.evaluated;
+        if (selection.timedOut)
+            selectionComplete = false;
+        if (selection.index < 0 || selection.timedOut)
+            break;
+        admit(optional.splice(selection.index, 1)[0]);
+    }
+    return {
+        included,
+        remaining,
+        selectionComplete,
+        evaluatedCandidates,
+    };
+}
+function upgradeSelectedProjections(included, initialRemaining) {
+    let remaining = initialRemaining;
+    for (const target of ["summary", "full"]) {
+        const previous = target === "summary" ? "identity" : "summary";
+        const upgrades = [...included].sort((left, right) => {
+            const leftCost = left.token_costs[target] - left.token_costs[previous];
+            const rightCost = right.token_costs[target] - right.token_costs[previous];
+            return (right.marginal_value / Math.max(rightCost, 1) -
+                left.marginal_value / Math.max(leftCost, 1) || left.rank - right.rank || left.id.localeCompare(right.id));
+        });
+        for (const entry of upgrades) {
+            if (entry.projection !== previous)
+                continue;
+            const extra = entry.token_costs[target] - entry.tokens;
+            if (extra > remaining)
+                continue;
+            entry.projection = target;
+            entry.tokens += extra;
+            remaining -= extra;
+        }
+    }
+    return remaining;
+}
+/**
+ * Packs ranked candidates under an explicit token budget. Required anchors are
+ * admitted first, optional rows compete by marginal value per token, and then
+ * selected rows are upgraded from identity to summary to full detail. This
+ * guarantees projection degradation happens before omission.
+ */
+export function packContextCandidates(candidates, options) {
+    const penalties = resolvePackingPenalties(options);
+    const ordered = orderPackingCandidates(candidates);
+    const readClock = options.readClock ?? performance.now.bind(performance);
+    const deadline = options.latencyBudgetMs === undefined
+        ? Number.POSITIVE_INFINITY
+        : readClock() + options.latencyBudgetMs;
+    const selection = selectIdentityCandidates({
+        ordered,
+        tokenBudget: options.tokenBudget,
+        redundancyPenalty: penalties.redundancy,
+        uncertaintyPenalty: penalties.uncertainty,
+        deadline,
+        readClock,
+    });
+    const { included } = selection;
+    const remaining = upgradeSelectedProjections(included, selection.remaining);
+    included.sort((left, right) => left.rank - right.rank || left.id.localeCompare(right.id));
+    const selected = new Set(included.map((entry) => entry.id));
+    return {
+        included,
+        omitted_ids: ordered
+            .filter((entry) => !selected.has(entry.id))
+            .map((entry) => entry.id),
+        token_budget: options.tokenBudget,
+        used_tokens: options.tokenBudget - remaining,
+        remaining_tokens: remaining,
+        complete: selection.selectionComplete &&
+            included.length === candidates.length &&
+            included.every((entry) => entry.projection === "full"),
+        selection_complete: selection.selectionComplete,
+        termination_reason: selection.selectionComplete
+            ? "exhausted"
+            : "latency_budget",
+        evaluated_candidates: selection.evaluatedCandidates,
+        latency_budget_ms: options.latencyBudgetMs ?? null,
+        profile: penalties.profile,
+        degradation_ladder: ["full", "summary", "identity"],
+    };
+}
+//# sourceMappingURL=context-packing.js.map
+//# debugId=f2b38b30-c8d0-51a2-9444-b2e0db9fa353

package/dist/sdk/context-packing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"context-packing.js","sources":["sdk/context-packing.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/context-packing\n *\n * Deterministic, token-budget-aware packing primitives for ranked context and\n * next-work candidates. The packer is deliberately storage-agnostic so custom\n * tools can reuse the exact selection contract with their own projections.\n */\n\n/** Detail levels a context candidate may occupy inside a bounded packet. */\nexport type ContextProjectionLevel = \"identity\" | \"summary\" | \"full\";\n\n/** Stable intent-keyed policies for risk, diversity, and safety-aware packing. */\nexport const CONTEXT_PACKING_PROFILES = {\n  balanced: { redundancyPenalty: 0.35, uncertaintyPenalty: 0.2 },\n  context: { redundancyPenalty: 0.45, uncertaintyPenalty: 0.15 },\n  next: { redundancyPenalty: 0.25, uncertaintyPenalty: 0.3 },\n} as const;\n\n/** Built-in task-set profiles selected from the triggering command intent. */\nexport type ContextPackingProfile = keyof typeof CONTEXT_PACKING_PROFILES;\n\n/** Token costs for the monotone projection levels of one candidate. */\nexport interface ContextProjectionCosts {\n  /** Stable identity-only representation cost. */\n  identity: number;\n  /** Compact summary representation cost. */\n  summary: number;\n  /** Full representation cost. */\n  full: number;\n}\n\n/** One ranked candidate offered to the context packet optimizer. */\nexport interface ContextPackingCandidate<TItem> {\n  /** Stable candidate identifier. */\n  id: string;\n  /** Caller-owned value returned unchanged for selected candidates. */\n  item: TItem;\n  /** One-based relevance rank; lower is better. */\n  rank: number;\n  /** Normalized relevance score. */\n  score: number;\n  /** Projection-specific token estimates. */\n  token_costs: ContextProjectionCosts;\n  /** Candidates sharing a cluster compete through a redundancy penalty. */\n  cluster?: string;\n  /** Required anchors are admitted before optional candidates. */\n  required?: boolean;\n  /** Optional credible-width estimate used for risk-adjusted value. */\n  uncertainty?: number;\n  /** Optional lineage identity used to suppress superseded duplicates. */\n  lineage?: string;\n}\n\n/** One selected candidate and the projection depth bought for it. */\nexport interface PackedContextCandidate<\n  TItem,\n> extends ContextPackingCandidate<TItem> {\n  /** Projection depth selected by the packer. */\n  projection: ContextProjectionLevel;\n  /** Tokens charged to the packet. */\n  tokens: number;\n  /** Risk- and redundancy-adjusted value used for selection. */\n  marginal_value: number;\n}\n\n/** Accounting and completeness metadata for one packed context packet. */\nexport interface ContextPackingReport<TItem> {\n  /** Selected candidates in deterministic relevance order. */\n  included: PackedContextCandidate<TItem>[];\n  /** Ranked candidate identifiers omitted after projection degradation. */\n  omitted_ids: string[];\n  /** Explicit packet token budget. */\n  token_budget: number;\n  /** Estimated tokens consumed by selected projections. */\n  used_tokens: number;\n  /** Tokens left unspent. */\n  remaining_tokens: number;\n  /** True when every candidate fit at full detail. */\n  complete: boolean;\n  /** Whether selection inspected every optional candidate before its deadline. */\n  selection_complete: boolean;\n  /** Machine-readable reason selection stopped. */\n  termination_reason: \"exhausted\" | \"latency_budget\";\n  /** Candidate comparisons completed by the bounded selector. */\n  evaluated_candidates: number;\n  /** Explicit selection latency budget, or null when unbounded. */\n  latency_budget_ms: number | null;\n  /** Stable task-set profile disclosed to downstream evaluation. */\n  profile: ContextPackingProfile;\n  /** Projection degradation order used by the optimizer. */\n  degradation_ladder: ContextProjectionLevel[];\n}\n\n/** Options controlling deterministic packet selection. */\nexport interface PackContextCandidatesOptions {\n  /** Maximum estimated tokens available to the packet. */\n  tokenBudget: number;\n  /** Task-set profile disclosed in the result envelope. */\n  profile?: ContextPackingProfile;\n  /** Penalty applied when a cluster or lineage is already represented. */\n  redundancyPenalty?: number;\n  /** Risk-aversion coefficient applied to candidate uncertainty. */\n  uncertaintyPenalty?: number;\n  /** Maximum selector wall-clock time; required anchors remain mask-immune. */\n  latencyBudgetMs?: number;\n  /** Monotonic clock override for deterministic hosts and tests. */\n  readClock?: () => number;\n}\n\nconst PROJECTION_LEVELS: ContextProjectionLevel[] = [\n  \"identity\",\n  \"summary\",\n  \"full\",\n];\n\nfunction assertPackingCandidate<TItem>(\n  candidate: ContextPackingCandidate<TItem>,\n): void {\n  if (\n    !candidate.id.trim() ||\n    !Number.isInteger(candidate.rank) ||\n    candidate.rank < 1\n  ) {\n    throw new TypeError(\n      \"Context packing candidates require a non-empty id and positive integer rank\",\n    );\n  }\n  if (!Number.isFinite(candidate.score) || candidate.score < 0) {\n    throw new TypeError(\n      \"Context packing candidate scores must be finite and non-negative\",\n    );\n  }\n  const costs = PROJECTION_LEVELS.map((level) => candidate.token_costs[level]);\n  if (\n    costs.some((cost) => !Number.isInteger(cost) || cost < 1) ||\n    costs[0]! > costs[1]! ||\n    costs[1]! > costs[2]!\n  ) {\n    throw new TypeError(\n      \"Context projection costs must be positive monotone integers\",\n    );\n  }\n  if (\n    candidate.uncertainty !== undefined &&\n    (!Number.isFinite(candidate.uncertainty) || candidate.uncertainty < 0)\n  ) {\n    throw new TypeError(\n      \"Context packing uncertainty must be finite and non-negative\",\n    );\n  }\n}\n\nfunction resolvePackingPenalties(options: PackContextCandidatesOptions): {\n  redundancy: number;\n  uncertainty: number;\n  profile: ContextPackingProfile;\n} {\n  if (!Number.isInteger(options.tokenBudget) || options.tokenBudget < 1) {\n    throw new TypeError(\n      \"Context packing tokenBudget must be a positive integer\",\n    );\n  }\n  const profile = options.profile ?? \"balanced\";\n  const policy = CONTEXT_PACKING_PROFILES[profile];\n  if (!policy) throw new TypeError(\"Unknown context packing profile\");\n  const redundancy = options.redundancyPenalty ?? policy.redundancyPenalty;\n  const uncertainty = options.uncertaintyPenalty ?? policy.uncertaintyPenalty;\n  if (\n    !Number.isFinite(redundancy) ||\n    redundancy < 0 ||\n    redundancy > 1 ||\n    !Number.isFinite(uncertainty) ||\n    uncertainty < 0\n  ) {\n    throw new TypeError(\n      \"Context packing penalties must be finite and within their supported ranges\",\n    );\n  }\n  if (\n    options.latencyBudgetMs !== undefined &&\n    (!Number.isFinite(options.latencyBudgetMs) || options.latencyBudgetMs <= 0)\n  ) {\n    throw new TypeError(\"Context packing latencyBudgetMs must be positive\");\n  }\n  return { redundancy, uncertainty, profile };\n}\n\nfunction orderPackingCandidates<TItem>(\n  candidates: readonly ContextPackingCandidate<TItem>[],\n): ContextPackingCandidate<TItem>[] {\n  const ids = new Set<string>();\n  for (const candidate of candidates) {\n    assertPackingCandidate(candidate);\n    if (ids.has(candidate.id)) {\n      throw new TypeError(\"Context packing candidates require unique ids\");\n    }\n    ids.add(candidate.id);\n  }\n  return [...candidates].sort(\n    (left, right) => left.rank - right.rank || left.id.localeCompare(right.id),\n  );\n}\n\nfunction findBestAffordableCandidate<TItem>(\n  candidates: ContextPackingCandidate<TItem>[],\n  remaining: number,\n  valueOf: (candidate: ContextPackingCandidate<TItem>) => number,\n  deadline: number,\n  readClock: () => number,\n): { index: number; evaluated: number; timedOut: boolean } {\n  let bestIndex = -1;\n  let evaluated = 0;\n  for (let index = 0; index < candidates.length; index += 1) {\n    if (index % 128 === 0 && readClock() >= deadline) {\n      return { index: bestIndex, evaluated, timedOut: true };\n    }\n    const candidate = candidates[index]!;\n    if (candidate.token_costs.identity > remaining) continue;\n    evaluated += 1;\n    const best = bestIndex < 0 ? undefined : candidates[bestIndex];\n    const density = valueOf(candidate) / candidate.token_costs.identity;\n    const bestDensity =\n      best === undefined\n        ? Number.NEGATIVE_INFINITY\n        : valueOf(best) / best.token_costs.identity;\n    if (\n      density > bestDensity ||\n      (density === bestDensity &&\n        best !== undefined &&\n        (candidate.rank < best.rank ||\n          (candidate.rank === best.rank &&\n            candidate.id.localeCompare(best.id) < 0)))\n    ) {\n      bestIndex = index;\n    }\n  }\n  return { index: bestIndex, evaluated, timedOut: false };\n}\n\nfunction selectIdentityCandidates<TItem>(params: {\n  ordered: ContextPackingCandidate<TItem>[];\n  tokenBudget: number;\n  redundancyPenalty: number;\n  uncertaintyPenalty: number;\n  deadline: number;\n  readClock: () => number;\n}): {\n  included: PackedContextCandidate<TItem>[];\n  remaining: number;\n  selectionComplete: boolean;\n  evaluatedCandidates: number;\n} {\n  const represented = new Set<string>();\n  const included: PackedContextCandidate<TItem>[] = [];\n  let remaining = params.tokenBudget;\n  const valueOf = (candidate: ContextPackingCandidate<TItem>): number => {\n    const key = candidate.lineage ?? candidate.cluster;\n    const redundancy =\n      key && represented.has(key) ? 1 - params.redundancyPenalty : 1;\n    return Math.max(\n      0,\n      (candidate.score -\n        params.uncertaintyPenalty * (candidate.uncertainty ?? 0)) *\n        redundancy,\n    );\n  };\n  const admit = (candidate: ContextPackingCandidate<TItem>): void => {\n    const tokens = candidate.token_costs.identity;\n    included.push({\n      ...candidate,\n      projection: \"identity\",\n      tokens,\n      marginal_value: valueOf(candidate),\n    });\n    remaining -= tokens;\n    const key = candidate.lineage ?? candidate.cluster;\n    if (key) represented.add(key);\n  };\n\n  for (const candidate of params.ordered.filter((entry) => entry.required)) {\n    if (candidate.token_costs.identity <= remaining) admit(candidate);\n  }\n  const optional = params.ordered.filter((entry) => !entry.required);\n  let selectionComplete = true;\n  let evaluatedCandidates = 0;\n  while (optional.length > 0) {\n    const selection = findBestAffordableCandidate(\n      optional,\n      remaining,\n      valueOf,\n      params.deadline,\n      params.readClock,\n    );\n    evaluatedCandidates += selection.evaluated;\n    if (selection.timedOut) selectionComplete = false;\n    if (selection.index < 0 || selection.timedOut) break;\n    admit(optional.splice(selection.index, 1)[0]!);\n  }\n  return {\n    included,\n    remaining,\n    selectionComplete,\n    evaluatedCandidates,\n  };\n}\n\nfunction upgradeSelectedProjections<TItem>(\n  included: PackedContextCandidate<TItem>[],\n  initialRemaining: number,\n): number {\n  let remaining = initialRemaining;\n  for (const target of [\"summary\", \"full\"] as const) {\n    const previous: ContextProjectionLevel =\n      target === \"summary\" ? \"identity\" : \"summary\";\n    const upgrades = [...included].sort((left, right) => {\n      const leftCost = left.token_costs[target] - left.token_costs[previous];\n      const rightCost = right.token_costs[target] - right.token_costs[previous];\n      return (\n        right.marginal_value / Math.max(rightCost, 1) -\n          left.marginal_value / Math.max(leftCost, 1) || left.rank - right.rank || left.id.localeCompare(right.id)\n      );\n    });\n    for (const entry of upgrades) {\n      if (entry.projection !== previous) continue;\n      const extra = entry.token_costs[target] - entry.tokens;\n      if (extra > remaining) continue;\n      entry.projection = target;\n      entry.tokens += extra;\n      remaining -= extra;\n    }\n  }\n  return remaining;\n}\n\n/**\n * Packs ranked candidates under an explicit token budget. Required anchors are\n * admitted first, optional rows compete by marginal value per token, and then\n * selected rows are upgraded from identity to summary to full detail. This\n * guarantees projection degradation happens before omission.\n */\nexport function packContextCandidates<TItem>(\n  candidates: readonly ContextPackingCandidate<TItem>[],\n  options: PackContextCandidatesOptions,\n): ContextPackingReport<TItem> {\n  const penalties = resolvePackingPenalties(options);\n  const ordered = orderPackingCandidates(candidates);\n  const readClock = options.readClock ?? performance.now.bind(performance);\n  const deadline =\n    options.latencyBudgetMs === undefined\n      ? Number.POSITIVE_INFINITY\n      : readClock() + options.latencyBudgetMs;\n  const selection = selectIdentityCandidates({\n    ordered,\n    tokenBudget: options.tokenBudget,\n    redundancyPenalty: penalties.redundancy,\n    uncertaintyPenalty: penalties.uncertainty,\n    deadline,\n    readClock,\n  });\n  const { included } = selection;\n  const remaining = upgradeSelectedProjections(included, selection.remaining);\n  included.sort(\n    (left, right) => left.rank - right.rank || left.id.localeCompare(right.id),\n  );\n  const selected = new Set(included.map((entry) => entry.id));\n  return {\n    included,\n    omitted_ids: ordered\n      .filter((entry) => !selected.has(entry.id))\n      .map((entry) => entry.id),\n    token_budget: options.tokenBudget,\n    used_tokens: options.tokenBudget - remaining,\n    remaining_tokens: remaining,\n    complete:\n      selection.selectionComplete &&\n      included.length === candidates.length &&\n      included.every((entry) => entry.projection === \"full\"),\n    selection_complete: selection.selectionComplete,\n    termination_reason: selection.selectionComplete\n      ? \"exhausted\"\n      : \"latency_budget\",\n    evaluated_candidates: selection.evaluatedCandidates,\n    latency_budget_ms: options.latencyBudgetMs ?? null,\n    profile: penalties.profile,\n    degradation_ladder: [\"full\", \"summary\", \"identity\"],\n  };\n}\n"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAKH,kFAAkF;;;AAClF,MAAM,CAAC,MAAM,wBAAwB,GAAG;IACtC,QAAQ,EAAE,EAAE,iBAAiB,EAAE,IAAI,EAAE,kBAAkB,EAAE,GAAG,EAAE;IAC9D,OAAO,EAAE,EAAE,iBAAiB,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,EAAE;IAC9D,IAAI,EAAE,EAAE,iBAAiB,EAAE,IAAI,EAAE,kBAAkB,EAAE,GAAG,EAAE;CAClD,CAAC;AA6FX,MAAM,iBAAiB,GAA6B;IAClD,UAAU;IACV,SAAS;IACT,MAAM;CACP,CAAC;AAEF,SAAS,sBAAsB,CAC7B,SAAyC;IAEzC,IACE,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE;QACpB,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC;QACjC,SAAS,CAAC,IAAI,GAAG,CAAC,EAClB,CAAC;QACD,MAAM,IAAI,SAAS,CACjB,6EAA6E,CAC9E,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;QAC7D,MAAM,IAAI,SAAS,CACjB,kEAAkE,CACnE,CAAC;IACJ,CAAC;IACD,MAAM,KAAK,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7E,IACE,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;QACzD,KAAK,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,CAAC,CAAE;QACrB,KAAK,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,CAAC,CAAE,EACrB,CAAC;QACD,MAAM,IAAI,SAAS,CACjB,6DAA6D,CAC9D,CAAC;IACJ,CAAC;IACD,IACE,SAAS,CAAC,WAAW,KAAK,SAAS;QACnC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,SAAS,CAAC,WAAW,GAAG,CAAC,CAAC,EACtE,CAAC;QACD,MAAM,IAAI,SAAS,CACjB,6DAA6D,CAC9D,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,uBAAuB,CAAC,OAAqC;IAKpE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,OAAO,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;QACtE,MAAM,IAAI,SAAS,CACjB,wDAAwD,CACzD,CAAC;IACJ,CAAC;IACD,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,UAAU,CAAC;IAC9C,MAAM,MAAM,GAAG,wBAAwB,CAAC,OAAO,CAAC,CAAC;IACjD,IAAI,CAAC,MAAM;QAAE,MAAM,IAAI,SAAS,CAAC,iCAAiC,CAAC,CAAC;IACpE,MAAM,UAAU,GAAG,OAAO,CAAC,iBAAiB,IAAI,MAAM,CAAC,iBAAiB,CAAC;IACzE,MAAM,WAAW,GAAG,OAAO,CAAC,kBAAkB,IAAI,MAAM,CAAC,kBAAkB,CAAC;IAC5E,IACE,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC;QAC5B,UAAU,GAAG,CAAC;QACd,UAAU,GAAG,CAAC;QACd,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC;QAC7B,WAAW,GAAG,CAAC,EACf,CAAC;QACD,MAAM,IAAI,SAAS,CACjB,4EAA4E,CAC7E,CAAC;IACJ,CAAC;IACD,IACE,OAAO,CAAC,eAAe,KAAK,SAAS;QACrC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,OAAO,CAAC,eAAe,IAAI,CAAC,CAAC,EAC3E,CAAC;QACD,MAAM,IAAI,SAAS,CAAC,kDAAkD,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;AAC9C,CAAC;AAED,SAAS,sBAAsB,CAC7B,UAAqD;IAErD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,sBAAsB,CAAC,SAAS,CAAC,CAAC;QAClC,IAAI,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,SAAS,CAAC,+CAA+C,CAAC,CAAC;QACvE,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CACzB,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC,CAC3E,CAAC;AACJ,CAAC;AAED,SAAS,2BAA2B,CAClC,UAA4C,EAC5C,SAAiB,EACjB,OAA8D,EAC9D,QAAgB,EAChB,SAAuB;IAEvB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QAC1D,IAAI,KAAK,GAAG,GAAG,KAAK,CAAC,IAAI,SAAS,EAAE,IAAI,QAAQ,EAAE,CAAC;YACjD,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;QACD,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAE,CAAC;QACrC,IAAI,SAAS,CAAC,WAAW,CAAC,QAAQ,GAAG,SAAS;YAAE,SAAS;QACzD,SAAS,IAAI,CAAC,CAAC;QACf,MAAM,IAAI,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAC/D,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC;QACpE,MAAM,WAAW,GACf,IAAI,KAAK,SAAS;YAChB,CAAC,CAAC,MAAM,CAAC,iBAAiB;YAC1B,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;QAChD,IACE,OAAO,GAAG,WAAW;YACrB,CAAC,OAAO,KAAK,WAAW;gBACtB,IAAI,KAAK,SAAS;gBAClB,CAAC,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;oBACzB,CAAC,SAAS,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;wBAC3B,SAAS,CAAC,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAChD,CAAC;YACD,SAAS,GAAG,KAAK,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;AAC1D,CAAC;AAED,SAAS,wBAAwB,CAAQ,MAOxC;IAMC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,QAAQ,GAAoC,EAAE,CAAC;IACrD,IAAI,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC;IACnC,MAAM,OAAO,GAAG,CAAC,SAAyC,EAAU,EAAE;QACpE,MAAM,GAAG,GAAG,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,OAAO,CAAC;QACnD,MAAM,UAAU,GACd,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC,GAAG,CACb,CAAC,EACD,CAAC,SAAS,CAAC,KAAK;YACd,MAAM,CAAC,kBAAkB,GAAG,CAAC,SAAS,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;YACzD,UAAU,CACb,CAAC;IACJ,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,SAAyC,EAAQ,EAAE;QAChE,MAAM,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC;QAC9C,QAAQ,CAAC,IAAI,CAAC;YACZ,GAAG,SAAS;YACZ,UAAU,EAAE,UAAU;YACtB,MAAM;YACN,cAAc,EAAE,OAAO,CAAC,SAAS,CAAC;SACnC,CAAC,CAAC;QACH,SAAS,IAAI,MAAM,CAAC;QACpB,MAAM,GAAG,GAAG,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,OAAO,CAAC;QACnD,IAAI,GAAG;YAAE,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IAEF,KAAK,MAAM,SAAS,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzE,IAAI,SAAS,CAAC,WAAW,CAAC,QAAQ,IAAI,SAAS;YAAE,KAAK,CAAC,SAAS,CAAC,CAAC;IACpE,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACnE,IAAI,iBAAiB,GAAG,IAAI,CAAC;IAC7B,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAC5B,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,2BAA2B,CAC3C,QAAQ,EACR,SAAS,EACT,OAAO,EACP,MAAM,CAAC,QAAQ,EACf,MAAM,CAAC,SAAS,CACjB,CAAC;QACF,mBAAmB,IAAI,SAAS,CAAC,SAAS,CAAC;QAC3C,IAAI,SAAS,CAAC,QAAQ;YAAE,iBAAiB,GAAG,KAAK,CAAC;QAClD,IAAI,SAAS,CAAC,KAAK,GAAG,CAAC,IAAI,SAAS,CAAC,QAAQ;YAAE,MAAM;QACrD,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;IACjD,CAAC;IACD,OAAO;QACL,QAAQ;QACR,SAAS;QACT,iBAAiB;QACjB,mBAAmB;KACpB,CAAC;AACJ,CAAC;AAED,SAAS,0BAA0B,CACjC,QAAyC,EACzC,gBAAwB;IAExB,IAAI,SAAS,GAAG,gBAAgB,CAAC;IACjC,KAAK,MAAM,MAAM,IAAI,CAAC,SAAS,EAAE,MAAM,CAAU,EAAE,CAAC;QAClD,MAAM,QAAQ,GACZ,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;QAChD,MAAM,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YACvE,MAAM,SAAS,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAC1E,OAAO,CACL,KAAK,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3C,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC,CAC3G,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,KAAK,CAAC,UAAU,KAAK,QAAQ;gBAAE,SAAS;YAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;YACvD,IAAI,KAAK,GAAG,SAAS;gBAAE,SAAS;YAChC,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC;YAC1B,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC;YACtB,SAAS,IAAI,KAAK,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CACnC,UAAqD,EACrD,OAAqC;IAErC,MAAM,SAAS,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAC;IACnD,MAAM,OAAO,GAAG,sBAAsB,CAAC,UAAU,CAAC,CAAC;IACnD,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACzE,MAAM,QAAQ,GACZ,OAAO,CAAC,eAAe,KAAK,SAAS;QACnC,CAAC,CAAC,MAAM,CAAC,iBAAiB;QAC1B,CAAC,CAAC,SAAS,EAAE,GAAG,OAAO,CAAC,eAAe,CAAC;IAC5C,MAAM,SAAS,GAAG,wBAAwB,CAAC;QACzC,OAAO;QACP,WAAW,EAAE,OAAO,CAAC,WAAW;QAChC,iBAAiB,EAAE,SAAS,CAAC,UAAU;QACvC,kBAAkB,EAAE,SAAS,CAAC,WAAW;QACzC,QAAQ;QACR,SAAS;KACV,CAAC,CAAC;IACH,MAAM,EAAE,QAAQ,EAAE,GAAG,SAAS,CAAC;IAC/B,MAAM,SAAS,GAAG,0BAA0B,CAAC,QAAQ,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;IAC5E,QAAQ,CAAC,IAAI,CACX,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC,CAC3E,CAAC;IACF,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,OAAO;QACL,QAAQ;QACR,WAAW,EAAE,OAAO;aACjB,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;aAC1C,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,YAAY,EAAE,OAAO,CAAC,WAAW;QACjC,WAAW,EAAE,OAAO,CAAC,WAAW,GAAG,SAAS;QAC5C,gBAAgB,EAAE,SAAS;QAC3B,QAAQ,EACN,SAAS,CAAC,iBAAiB;YAC3B,QAAQ,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM;YACrC,QAAQ,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,KAAK,MAAM,CAAC;QACxD,kBAAkB,EAAE,SAAS,CAAC,iBAAiB;QAC/C,kBAAkB,EAAE,SAAS,CAAC,iBAAiB;YAC7C,CAAC,CAAC,WAAW;YACb,CAAC,CAAC,gBAAgB;QACpB,oBAAoB,EAAE,SAAS,CAAC,mBAAmB;QACnD,iBAAiB,EAAE,OAAO,CAAC,eAAe,IAAI,IAAI;QAClD,OAAO,EAAE,SAAS,CAAC,OAAO;QAC1B,kBAAkB,EAAE,CAAC,MAAM,EAAE,SAAS,EAAE,UAAU,CAAC;KACpD,CAAC;AACJ,CAAC","debugId":"f2b38b30-c8d0-51a2-9444-b2e0db9fa353"}

package/dist/sdk/context-relevance.d.ts

@@ -1,5 +1,5 @@
 /** Canonical signal keys understood by the built-in relevance model. */
-export declare const CONTEXT_RELEVANCE_SIGNAL_NAMES: readonly ["structural", "recency", "activity_density", "graph_proximity", "claim_focus", "priority_pressure", "risk_pressure", "deadline_pressure", "knowledge_density", "author_affinity", "semantic_similarity"];
+export declare const CONTEXT_RELEVANCE_SIGNAL_NAMES: readonly ["structural", "recency", "activity_density", "graph_proximity", "claim_focus", "priority_pressure", "risk_pressure", "deadline_pressure", "knowledge_density", "author_affinity", "usage_affinity", "semantic_similarity"];
 /** A normalized signal consumed by the built-in context relevance scorer. */
 export type ContextRelevanceSignalName = (typeof CONTEXT_RELEVANCE_SIGNAL_NAMES)[number];
 /** Normalized candidate features; omitted signals are excluded from weighting. */

package/dist/sdk/context-relevance.js

@@ -6,7 +6,7 @@
  * with core, extension, or project-specific feature stores.
  */
 
-!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]="380bb6a4-3d56-5a72-8bc9-236b044012b3")}catch(e){}}();
+!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]="305d815a-a180-56bf-9a09-b7830e0c3970")}catch(e){}}();
 import { runActiveServiceOverride } from "../core/extensions/index.js";
 /** Canonical signal keys understood by the built-in relevance model. */
 export const CONTEXT_RELEVANCE_SIGNAL_NAMES = [
@@ -20,6 +20,7 @@ export const CONTEXT_RELEVANCE_SIGNAL_NAMES = [
     "deadline_pressure",
     "knowledge_density",
     "author_affinity",
+    "usage_affinity",
     "semantic_similarity",
 ];
 /** Governed extension service used to replace or wrap context ranking. */
@@ -35,6 +36,7 @@ const DEFAULT_CONTEXT_RELEVANCE_WEIGHTS = {
     deadline_pressure: 0.45,
     knowledge_density: 0.25,
     author_affinity: 0.2,
+    usage_affinity: 0.3,
     semantic_similarity: 0.5,
 };
 const JSON_TOKEN_ENCODER = new TextEncoder();
@@ -340,4 +342,4 @@ export async function runContextEvaluationCorpus(scenarios, reader, thresholds)
     return summarizeContextEvaluationReports(reports, thresholds);
 }
 //# sourceMappingURL=context-relevance.js.map
-//# debugId=380bb6a4-3d56-5a72-8bc9-236b044012b3
+//# debugId=305d815a-a180-56bf-9a09-b7830e0c3970

package/dist/sdk/context-relevance.js.map

@@ -1 +1 @@
-{"version":3,"file":"context-relevance.js","sources":["sdk/context-relevance.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/context-relevance\n *\n * Public, deterministic context-ranking and evaluation primitives. The scorer\n * accepts already-derived signals so package authors can reuse the same model\n * with core, extension, or project-specific feature stores.\n */\nimport { runActiveServiceOverride } from \"../core/extensions/index.js\";\n\n/** Canonical signal keys understood by the built-in relevance model. */\nexport const CONTEXT_RELEVANCE_SIGNAL_NAMES = [\n  \"structural\",\n  \"recency\",\n  \"activity_density\",\n  \"graph_proximity\",\n  \"claim_focus\",\n  \"priority_pressure\",\n  \"risk_pressure\",\n  \"deadline_pressure\",\n  \"knowledge_density\",\n  \"author_affinity\",\n  \"semantic_similarity\",\n] as const;\n\n/** A normalized signal consumed by the built-in context relevance scorer. */\nexport type ContextRelevanceSignalName =\n  (typeof CONTEXT_RELEVANCE_SIGNAL_NAMES)[number];\n\n/** Normalized candidate features; omitted signals are excluded from weighting. */\nexport type ContextRelevanceSignals = Partial<\n  Record<Exclude<ContextRelevanceSignalName, \"structural\">, number>\n>;\n\n/** A project-management object and its derived relevance signals. */\nexport interface ContextRelevanceCandidate<TItem> {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports item for this contract. */\n  item: TItem;\n  /** Value that configures or reports signals for this contract. */\n  signals?: ContextRelevanceSignals;\n}\n\n/** Per-signal weighted contributions used to explain a ranked result. */\nexport type ContextRelevanceContributions = Record<string, number>;\n\n/** One ranked candidate with deterministic score and explanation metadata. */\nexport interface RankedContextCandidate<\n  TItem,\n> extends ContextRelevanceCandidate<TItem> {\n  /** Value that configures or reports baseline rank for this contract. */\n  baseline_rank: number;\n  /** Value that configures or reports rank for this contract. */\n  rank: number;\n  /** Value that configures or reports score for this contract. */\n  score: number;\n  /** Value that configures or reports contributions for this contract. */\n  contributions: ContextRelevanceContributions;\n}\n\n/** Complete output from a context relevance scorer. */\nexport interface ContextRelevanceReport<TItem> {\n  /** Value that configures or reports model for this contract. */\n  model: string;\n  /** Value that configures or reports available signals for this contract. */\n  available_signals: ContextRelevanceSignalName[];\n  /** Value that configures or reports ranked for this contract. */\n  ranked: RankedContextCandidate<TItem>[];\n  /** Value that configures or reports warnings for this contract. */\n  warnings?: string[];\n}\n\n/** Minimal custom score returned by a replacement or wrapper scorer. */\nexport interface ContextRelevanceCustomScore {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports score for this contract. */\n  score: number;\n}\n\n/** Input provided to a custom scorer, including the deterministic default. */\nexport interface ContextRelevanceScorerInput<TItem> {\n  /** Value that configures or reports candidates for this contract. */\n  candidates: readonly ContextRelevanceCandidate<TItem>[];\n  /** Fallback report used when callers do not provide an override. */\n  default_report: ContextRelevanceReport<TItem>;\n}\n\n/** Replaceable package/extension scorer contract. */\nexport type ContextRelevanceScorer<TItem> = (\n  input: ContextRelevanceScorerInput<TItem>,\n) =>\n  | readonly ContextRelevanceCustomScore[]\n  | Promise<readonly ContextRelevanceCustomScore[]>;\n\n/** Options for the built-in or replaceable context relevance scorer. */\nexport interface ScoreContextCandidatesOptions<TItem> {\n  /** Value that configures or reports weights for this contract. */\n  weights?: Partial<Record<ContextRelevanceSignalName, number>>;\n  /** Value that configures or reports scorer for this contract. */\n  scorer?: ContextRelevanceScorer<TItem>;\n}\n\n/** Governed extension service used to replace or wrap context ranking. */\nexport const CONTEXT_RELEVANCE_SERVICE = \"context_relevance\" as const;\n\n/** Command surface requesting an active extension relevance override. */\nexport type ContextRelevanceSurface = \"context\" | \"next\";\n\nconst DEFAULT_CONTEXT_RELEVANCE_WEIGHTS: Record<\n  ContextRelevanceSignalName,\n  number\n> = {\n  structural: 0.4,\n  recency: 0.35,\n  activity_density: 0.25,\n  graph_proximity: 0.15,\n  claim_focus: 0.6,\n  priority_pressure: 0.35,\n  risk_pressure: 0.2,\n  deadline_pressure: 0.45,\n  knowledge_density: 0.25,\n  author_affinity: 0.2,\n  semantic_similarity: 0.5,\n};\nconst JSON_TOKEN_ENCODER = new TextEncoder();\n\nfunction assertCandidates<TItem>(\n  candidates: readonly ContextRelevanceCandidate<TItem>[],\n): void {\n  const ids = new Set<string>();\n  for (const candidate of candidates) {\n    if (\n      typeof candidate.id !== \"string\" ||\n      candidate.id.trim().length === 0 ||\n      ids.has(candidate.id)\n    ) {\n      throw new TypeError(\n        \"Context relevance candidates require unique non-empty ids\",\n      );\n    }\n    ids.add(candidate.id);\n    for (const [signal, value] of Object.entries(candidate.signals ?? {})) {\n      if (\n        signal === \"structural\" ||\n        !CONTEXT_RELEVANCE_SIGNAL_NAMES.includes(\n          signal as ContextRelevanceSignalName,\n        )\n      ) {\n        throw new TypeError(`Unknown context relevance signal: ${signal}`);\n      }\n      if (value === undefined) continue;\n      if (!Number.isFinite(value) || value < 0 || value > 1) {\n        throw new TypeError(\n          `Context relevance signal ${signal} must be a finite number from 0 to 1`,\n        );\n      }\n    }\n  }\n}\n\nfunction resolveWeights(\n  overrides: Partial<Record<ContextRelevanceSignalName, number>> | undefined,\n): Record<ContextRelevanceSignalName, number> {\n  const weights = { ...DEFAULT_CONTEXT_RELEVANCE_WEIGHTS };\n  for (const [signal, weight] of Object.entries(overrides ?? {})) {\n    if (\n      weight !== undefined &&\n      CONTEXT_RELEVANCE_SIGNAL_NAMES.includes(\n        signal as ContextRelevanceSignalName,\n      )\n    ) {\n      weights[signal as ContextRelevanceSignalName] = weight;\n    }\n  }\n  for (const [signal, weight] of Object.entries(weights)) {\n    if (!Number.isFinite(weight) || weight < 0) {\n      throw new TypeError(\n        `Context relevance weight ${signal} must be a finite non-negative number`,\n      );\n    }\n  }\n  return weights;\n}\n\n/** Score candidates with pm's deterministic weighted model. Candidate order is the structural baseline and remains unchanged when no advanced signals exist. */\nexport function defaultScoreContextCandidates<TItem>(\n  candidates: readonly ContextRelevanceCandidate<TItem>[],\n  options: Pick<ScoreContextCandidatesOptions<TItem>, \"weights\"> = {},\n): ContextRelevanceReport<TItem> {\n  assertCandidates(candidates);\n  const weights = resolveWeights(options.weights);\n  const denominator = Math.max(candidates.length - 1, 1);\n  const available = new Set<ContextRelevanceSignalName>([\"structural\"]);\n  for (const candidate of candidates) {\n    for (const [signal, value] of Object.entries(candidate.signals ?? {})) {\n      if (value !== undefined)\n        available.add(signal as ContextRelevanceSignalName);\n    }\n  }\n  const availableSignals = CONTEXT_RELEVANCE_SIGNAL_NAMES.filter((signal) =>\n    available.has(signal),\n  );\n  const scored = candidates.map(\n    (candidate, index): RankedContextCandidate<TItem> => {\n      const signalValues: Partial<Record<ContextRelevanceSignalName, number>> =\n        {\n          structural: candidates.length === 1 ? 1 : 1 - index / denominator,\n          ...candidate.signals,\n        };\n      const contributions: ContextRelevanceContributions = {};\n      let weightedScore = 0;\n      let totalWeight = 0;\n      for (const signal of availableSignals) {\n        const value = signalValues[signal];\n        if (value === undefined) continue;\n        const contribution = value * weights[signal];\n        contributions[signal] = contribution;\n        weightedScore += contribution;\n        totalWeight += weights[signal];\n      }\n      return {\n        ...candidate,\n        baseline_rank: index + 1,\n        rank: 0,\n        score: totalWeight === 0 ? 0 : weightedScore / totalWeight,\n        contributions,\n      };\n    },\n  );\n  scored.sort(\n    (left, right) =>\n      right.score - left.score || left.baseline_rank - right.baseline_rank,\n  );\n  scored.forEach((entry, index) => {\n    entry.rank = index + 1;\n  });\n  return {\n    model: \"default-weighted-v1\",\n    available_signals: availableSignals,\n    ranked: scored,\n  };\n}\n\n/** Score candidates with the default model or a validated replacement/wrapper. */\nexport async function scoreContextCandidates<TItem>(\n  candidates: readonly ContextRelevanceCandidate<TItem>[],\n  options: ScoreContextCandidatesOptions<TItem> = {},\n): Promise<ContextRelevanceReport<TItem>> {\n  const defaultReport = defaultScoreContextCandidates(candidates, options);\n  if (!options.scorer) return defaultReport;\n  const customScores = await options.scorer({\n    candidates,\n    default_report: defaultReport,\n  });\n  const scoreById = new Map<string, number>();\n  for (const entry of customScores) {\n    if (scoreById.has(entry.id) || !Number.isFinite(entry.score)) {\n      throw new TypeError(\n        \"Context relevance scorer must return one finite score for every candidate\",\n      );\n    }\n    scoreById.set(entry.id, entry.score);\n  }\n  if (\n    scoreById.size !== candidates.length ||\n    candidates.some((candidate) => !scoreById.has(candidate.id))\n  ) {\n    throw new TypeError(\n      \"Context relevance scorer must return one finite score for every candidate\",\n    );\n  }\n  const ranked = defaultReport.ranked.map((entry) => {\n    const score = scoreById.get(entry.id) as number;\n    return { ...entry, score, contributions: { custom: score } };\n  });\n  ranked.sort(\n    (left, right) =>\n      right.score - left.score || left.baseline_rank - right.baseline_rank,\n  );\n  ranked.forEach((entry, index) => {\n    entry.rank = index + 1;\n  });\n  return {\n    model: \"custom\",\n    available_signals: defaultReport.available_signals,\n    ranked,\n  };\n}\n\n/** Score command candidates through the public default model and then the active governed `context_relevance` service override, when one is registered. */\nexport async function scoreContextCandidatesWithActiveExtensions<TItem>(\n  surface: ContextRelevanceSurface,\n  candidates: readonly ContextRelevanceCandidate<TItem>[],\n  options: Pick<ScoreContextCandidatesOptions<TItem>, \"weights\"> = {},\n): Promise<ContextRelevanceReport<TItem>> {\n  const defaultReport = defaultScoreContextCandidates(candidates, options);\n  const override = await runActiveServiceOverride(CONTEXT_RELEVANCE_SERVICE, {\n    surface,\n    candidates,\n    default_report: defaultReport,\n  });\n  if (!override.handled) {\n    return override.warnings.length > 0\n      ? { ...defaultReport, warnings: override.warnings }\n      : defaultReport;\n  }\n  if (\n    !Array.isArray(override.result) ||\n    !override.result.every(\n      (entry) =>\n        typeof entry === \"object\" &&\n        entry !== null &&\n        typeof (entry as { id?: unknown }).id === \"string\" &&\n        typeof (entry as { score?: unknown }).score === \"number\" &&\n        Number.isFinite((entry as { score: number }).score),\n    )\n  ) {\n    return {\n      ...defaultReport,\n      warnings: [\n        ...override.warnings,\n        \"extension_context_relevance_invalid_result\",\n      ],\n    };\n  }\n  try {\n    const report = await scoreContextCandidates(candidates, {\n      ...options,\n      scorer: () => override.result as ContextRelevanceCustomScore[],\n    });\n    return override.warnings.length > 0\n      ? { ...report, warnings: override.warnings }\n      : report;\n  } catch {\n    return {\n      ...defaultReport,\n      warnings: [\n        ...override.warnings,\n        \"extension_context_relevance_invalid_result\",\n      ],\n    };\n  }\n}\n\n/** Input for rank-aware context/next quality evaluation. */\nexport interface ContextRankingEvaluationInput {\n  /** Value that configures or reports ranked ids for this contract. */\n  ranked_ids: string[];\n  /** Value that configures or reports judgments for this contract. */\n  judgments: Record<string, number>;\n  /** Value that configures or reports required ids for this contract. */\n  required_ids?: string[];\n  /** Value that configures or reports continuity ids for this contract. */\n  continuity_ids?: string[];\n  /** Value that configures or reports actual tokens for this contract. */\n  actual_tokens: number;\n  /** Value that configures or reports token budget for this contract. */\n  token_budget: number;\n}\n\n/** Rank-quality, continuity, recall, and token-budget metrics for one scenario. */\nexport interface ContextRankingEvaluation {\n  /** Value that configures or reports ndcg for this contract. */\n  ndcg: number;\n  /** Value that configures or reports reciprocal rank for this contract. */\n  reciprocal_rank: number;\n  /** Value that configures or reports required recall for this contract. */\n  required_recall: number;\n  /** Value that configures or reports continuity coverage for this contract. */\n  continuity_coverage: number;\n  /** Value that configures or reports token budget adherence for this contract. */\n  token_budget_adherence: number;\n  /** Value that configures or reports within token budget for this contract. */\n  within_token_budget: boolean;\n}\n\n/** Flexible read options accepted by context evaluation scenarios. */\nexport interface ContextEvaluationReadOptions {\n  /** Value that configures or reports explain ranking for this contract. */\n  explainRanking?: boolean;\n  [key: string]: unknown;\n}\n\n/** Minimal item identity consumed by the context evaluation runner. */\nexport interface ContextEvaluationResultItem {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n}\n\n/** Optional scorer attribution returned by an evaluated read primitive. */\nexport interface ContextEvaluationResultRanking {\n  /** Value that configures or reports items for this contract. */\n  items?: Array<{ id: string; contributions: ContextRelevanceContributions }>;\n}\n\n/** Structural context result consumed by the evaluation runner. */\nexport interface ContextEvaluationContextResult {\n  /** Value that configures or reports high level for this contract. */\n  high_level?: ContextEvaluationResultItem[];\n  /** Value that configures or reports low level for this contract. */\n  low_level?: ContextEvaluationResultItem[];\n  /** Value that configures or reports blocked fallback for this contract. */\n  blocked_fallback?: ContextEvaluationResultItem[];\n  /** Value that configures or reports ranking for this contract. */\n  ranking?: ContextEvaluationResultRanking;\n  [key: string]: unknown;\n}\n\n/** Structural next result consumed by the evaluation runner. */\nexport interface ContextEvaluationNextResult {\n  /** Value that configures or reports recommended for this contract. */\n  recommended?: ContextEvaluationResultItem | null;\n  /** Value that configures or reports ready for this contract. */\n  ready?: ContextEvaluationResultItem[];\n  /** Value that configures or reports ranking for this contract. */\n  ranking?: ContextEvaluationResultRanking;\n  [key: string]: unknown;\n}\n\n/** Read-only SDK surface required by the context evaluation runner. */\nexport interface ContextEvaluationReader {\n  /** Value that configures or reports context for this contract. */\n  context(\n    options?: ContextEvaluationReadOptions,\n  ): Promise<ContextEvaluationContextResult>;\n  /** Value that configures or reports next for this contract. */\n  next(\n    options?: ContextEvaluationReadOptions,\n  ): Promise<ContextEvaluationNextResult>;\n}\n\n/** One graded context or next scenario evaluated against a real SDK reader. */\nexport interface ContextEvaluationScenario {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports surface for this contract. */\n  surface: ContextRelevanceSurface;\n  /** Value that configures or reports options for this contract. */\n  options?: ContextEvaluationReadOptions;\n  /** Value that configures or reports judgments for this contract. */\n  judgments: Record<string, number>;\n  /** Value that configures or reports required ids for this contract. */\n  required_ids?: string[];\n  /** Value that configures or reports continuity ids for this contract. */\n  continuity_ids?: string[];\n  /** Value that configures or reports token budget for this contract. */\n  token_budget: number;\n  /** Value that configures or reports rationale for this contract. */\n  rationale: string;\n}\n\n/** Per-item signal attribution retained by a context evaluation report. */\nexport interface ContextEvaluationAttribution {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports contributions for this contract. */\n  contributions: ContextRelevanceContributions;\n}\n\n/** Result of executing and grading one context evaluation scenario. */\nexport interface ContextEvaluationScenarioReport {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports surface for this contract. */\n  surface: ContextRelevanceSurface;\n  /** Value that configures or reports rationale for this contract. */\n  rationale: string;\n  /** Value that configures or reports ranked ids for this contract. */\n  ranked_ids: string[];\n  /** Value that configures or reports actual tokens for this contract. */\n  actual_tokens: number;\n  /** Value that configures or reports metrics for this contract. */\n  metrics: ContextRankingEvaluation;\n  /** Value that configures or reports attribution for this contract. */\n  attribution: ContextEvaluationAttribution[];\n}\n\n/** Minimum acceptable aggregate metrics for a context evaluation corpus. */\nexport interface ContextEvaluationThresholds {\n  /** Value that configures or reports ndcg for this contract. */\n  ndcg: number;\n  /** Value that configures or reports reciprocal rank for this contract. */\n  reciprocal_rank: number;\n  /** Value that configures or reports required recall for this contract. */\n  required_recall: number;\n  /** Value that configures or reports continuity coverage for this contract. */\n  continuity_coverage: number;\n  /** Value that configures or reports token budget adherence for this contract. */\n  token_budget_adherence: number;\n}\n\n/** Canonical aggregate metrics required by every context evaluation corpus. */\nexport const CONTEXT_EVALUATION_METRIC_NAMES = [\n  \"ndcg\",\n  \"reciprocal_rank\",\n  \"required_recall\",\n  \"continuity_coverage\",\n  \"token_budget_adherence\",\n] as const satisfies readonly (keyof ContextEvaluationThresholds)[];\n\n/** Aggregate context evaluation report suitable for a CI quality gate. */\nexport interface ContextEvaluationCorpusReport {\n  /** Number of scenario entries represented by this result. */\n  scenario_count: number;\n  /** Value that configures or reports aggregate for this contract. */\n  aggregate: ContextEvaluationThresholds;\n  /** Value that configures or reports scenarios for this contract. */\n  scenarios: ContextEvaluationScenarioReport[];\n  /** Value that configures or reports passed for this contract. */\n  passed: boolean;\n  /** Value that configures or reports failures for this contract. */\n  failures: string[];\n}\n\nfunction ratioOfPresent(\n  expected: readonly string[],\n  actual: ReadonlySet<string>,\n): number {\n  if (expected.length === 0) return 1;\n  return expected.filter((id) => actual.has(id)).length / expected.length;\n}\n\n/** Evaluate one ranked context packet against graded human judgments. */\nexport function evaluateContextRanking(\n  input: ContextRankingEvaluationInput,\n): ContextRankingEvaluation {\n  if (\n    !Number.isFinite(input.actual_tokens) ||\n    input.actual_tokens < 0 ||\n    !Number.isFinite(input.token_budget) ||\n    input.token_budget <= 0\n  ) {\n    throw new TypeError(\n      \"Context ranking token counts require actual_tokens >= 0 and token_budget > 0\",\n    );\n  }\n  const judgments = input.judgments ?? {};\n  const gains = input.ranked_ids.map((id) => Math.max(0, judgments[id] ?? 0));\n  const idealGains = Object.values(judgments)\n    .map((grade) => Math.max(0, grade))\n    .sort((left, right) => right - left)\n    .slice(0, gains.length || 1);\n  const discountedGain = (values: readonly number[]) =>\n    values.reduce(\n      (total, grade, index) => total + (2 ** grade - 1) / Math.log2(index + 2),\n      0,\n    );\n  const ideal = discountedGain(idealGains);\n  const firstRelevant = gains.findIndex((grade) => grade > 0);\n  const actualIds = new Set(input.ranked_ids);\n  const withinBudget = input.actual_tokens <= input.token_budget;\n  return {\n    ndcg: ideal === 0 ? 1 : discountedGain(gains) / ideal,\n    reciprocal_rank: firstRelevant < 0 ? 0 : 1 / (firstRelevant + 1),\n    required_recall: ratioOfPresent(input.required_ids ?? [], actualIds),\n    continuity_coverage: ratioOfPresent(input.continuity_ids ?? [], actualIds),\n    token_budget_adherence: withinBudget\n      ? 1\n      : input.token_budget / input.actual_tokens,\n    within_token_budget: withinBudget,\n  };\n}\n\nfunction estimateJsonTokens(value: unknown): number {\n  return Math.ceil(\n    JSON_TOKEN_ENCODER.encode(JSON.stringify(value)).byteLength / 4,\n  );\n}\n\nfunction roundEvaluationMetric(value: number): number {\n  return Math.round(value * 10_000) / 10_000;\n}\n\nfunction rankingPayloadForScenario(\n  result: ContextEvaluationContextResult | ContextEvaluationNextResult,\n  surface: ContextRelevanceSurface,\n): { rankedIds: string[]; attribution: ContextEvaluationAttribution[] } {\n  const rankedIds =\n    surface === \"context\"\n      ? [\n          ...((result as ContextEvaluationContextResult).high_level ?? []),\n          ...((result as ContextEvaluationContextResult).low_level ?? []),\n          ...((result as ContextEvaluationContextResult).blocked_fallback ??\n            []),\n        ].map((item) => item.id)\n      : [\n          ...((result as ContextEvaluationNextResult).recommended\n            ? [\n                (result as ContextEvaluationNextResult)\n                  .recommended as ContextEvaluationResultItem,\n              ]\n            : []),\n          ...((result as ContextEvaluationNextResult).ready ?? []),\n        ].map((item) => item.id);\n  const servedIds = new Set(rankedIds);\n  const attribution = (result.ranking?.items ?? [])\n    .filter((item) => servedIds.has(item.id))\n    .map((item) => ({ id: item.id, contributions: item.contributions }));\n  return { rankedIds, attribution };\n}\n\n/** Execute one graded scenario through public SDK context/next read primitives. */\nexport async function runContextEvaluationScenario(\n  scenario: ContextEvaluationScenario,\n  reader: ContextEvaluationReader,\n): Promise<ContextEvaluationScenarioReport> {\n  if (\n    scenario.id.trim().length === 0 ||\n    scenario.rationale.trim().length === 0\n  ) {\n    throw new TypeError(\n      \"Context evaluation scenarios require non-empty id and rationale values\",\n    );\n  }\n  const result =\n    scenario.surface === \"context\"\n      ? await reader.context({ ...scenario.options, explainRanking: true })\n      : await reader.next({ ...scenario.options, explainRanking: true });\n  const { rankedIds, attribution } = rankingPayloadForScenario(\n    result,\n    scenario.surface,\n  );\n  const packet = { ...result, ranking: undefined };\n  const actualTokens = estimateJsonTokens(packet);\n  return {\n    id: scenario.id,\n    surface: scenario.surface,\n    rationale: scenario.rationale,\n    ranked_ids: rankedIds,\n    actual_tokens: actualTokens,\n    metrics: evaluateContextRanking({\n      ranked_ids: rankedIds,\n      judgments: scenario.judgments,\n      required_ids: scenario.required_ids,\n      continuity_ids: scenario.continuity_ids,\n      actual_tokens: actualTokens,\n      token_budget: scenario.token_budget,\n    }),\n    attribution,\n  };\n}\n\n/** Aggregate scenario reports and evaluate every metric against explicit thresholds. */\nexport function summarizeContextEvaluationReports(\n  reports: readonly ContextEvaluationScenarioReport[],\n  thresholds: ContextEvaluationThresholds,\n): ContextEvaluationCorpusReport {\n  if (reports.length === 0) {\n    throw new TypeError(\n      \"Context evaluation requires at least one scenario report\",\n    );\n  }\n  const metrics = CONTEXT_EVALUATION_METRIC_NAMES;\n  for (const metric of metrics) {\n    if (!Number.isFinite(thresholds[metric])) {\n      throw new TypeError(\n        `Context evaluation threshold ${metric} must be a finite number`,\n      );\n    }\n  }\n  const aggregate = Object.fromEntries(\n    metrics.map((metric) => [\n      metric,\n      roundEvaluationMetric(\n        reports.reduce((total, report) => total + report.metrics[metric], 0) /\n          reports.length,\n      ),\n    ]),\n  ) as unknown as ContextEvaluationThresholds;\n  const failures = metrics\n    .filter((metric) => aggregate[metric] < thresholds[metric])\n    .map((metric) => `${metric}:${aggregate[metric]}<${thresholds[metric]}`);\n  return {\n    scenario_count: reports.length,\n    aggregate,\n    scenarios: [...reports],\n    passed: failures.length === 0,\n    failures,\n  };\n}\n\n/** Execute a same-workspace scenario corpus through public SDK read primitives. */\nexport async function runContextEvaluationCorpus(\n  scenarios: readonly ContextEvaluationScenario[],\n  reader: ContextEvaluationReader,\n  thresholds: ContextEvaluationThresholds,\n): Promise<ContextEvaluationCorpusReport> {\n  const reports: ContextEvaluationScenarioReport[] = [];\n  for (const scenario of scenarios) {\n    reports.push(await runContextEvaluationScenario(scenario, reader));\n  }\n  return summarizeContextEvaluationReports(reports, thresholds);\n}\n"],"names":[],"mappings":"AAAA;;;;;;GAMG;;;AACH,OAAO,EAAE,wBAAwB,EAAE,MAAM,6BAA6B,CAAC;AAEvE,wEAAwE;AACxE,MAAM,CAAC,MAAM,8BAA8B,GAAG;IAC5C,YAAY;IACZ,SAAS;IACT,kBAAkB;IAClB,iBAAiB;IACjB,aAAa;IACb,mBAAmB;IACnB,eAAe;IACf,mBAAmB;IACnB,mBAAmB;IACnB,iBAAiB;IACjB,qBAAqB;CACb,CAAC;AAiFX,0EAA0E;AAC1E,MAAM,CAAC,MAAM,yBAAyB,GAAG,mBAA4B,CAAC;AAKtE,MAAM,iCAAiC,GAGnC;IACF,UAAU,EAAE,GAAG;IACf,OAAO,EAAE,IAAI;IACb,gBAAgB,EAAE,IAAI;IACtB,eAAe,EAAE,IAAI;IACrB,WAAW,EAAE,GAAG;IAChB,iBAAiB,EAAE,IAAI;IACvB,aAAa,EAAE,GAAG;IAClB,iBAAiB,EAAE,IAAI;IACvB,iBAAiB,EAAE,IAAI;IACvB,eAAe,EAAE,GAAG;IACpB,mBAAmB,EAAE,GAAG;CACzB,CAAC;AACF,MAAM,kBAAkB,GAAG,IAAI,WAAW,EAAE,CAAC;AAE7C,SAAS,gBAAgB,CACvB,UAAuD;IAEvD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IACE,OAAO,SAAS,CAAC,EAAE,KAAK,QAAQ;YAChC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;YAChC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,EACrB,CAAC;YACD,MAAM,IAAI,SAAS,CACjB,2DAA2D,CAC5D,CAAC;QACJ,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QACtB,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;YACtE,IACE,MAAM,KAAK,YAAY;gBACvB,CAAC,8BAA8B,CAAC,QAAQ,CACtC,MAAoC,CACrC,EACD,CAAC;gBACD,MAAM,IAAI,SAAS,CAAC,qCAAqC,MAAM,EAAE,CAAC,CAAC;YACrE,CAAC;YACD,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAS;YAClC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACtD,MAAM,IAAI,SAAS,CACjB,4BAA4B,MAAM,sCAAsC,CACzE,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CACrB,SAA0E;IAE1E,MAAM,OAAO,GAAG,EAAE,GAAG,iCAAiC,EAAE,CAAC;IACzD,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,IAAI,EAAE,CAAC,EAAE,CAAC;QAC/D,IACE,MAAM,KAAK,SAAS;YACpB,8BAA8B,CAAC,QAAQ,CACrC,MAAoC,CACrC,EACD,CAAC;YACD,OAAO,CAAC,MAAoC,CAAC,GAAG,MAAM,CAAC;QACzD,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACvD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,MAAM,IAAI,SAAS,CACjB,4BAA4B,MAAM,uCAAuC,CAC1E,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,gKAAgK;AAChK,MAAM,UAAU,6BAA6B,CAC3C,UAAuD,EACvD,UAAiE,EAAE;IAEnE,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAC7B,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAChD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACvD,MAAM,SAAS,GAAG,IAAI,GAAG,CAA6B,CAAC,YAAY,CAAC,CAAC,CAAC;IACtE,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;YACtE,IAAI,KAAK,KAAK,SAAS;gBACrB,SAAS,CAAC,GAAG,CAAC,MAAoC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD,MAAM,gBAAgB,GAAG,8BAA8B,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CACxE,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CACtB,CAAC;IACF,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAC3B,CAAC,SAAS,EAAE,KAAK,EAAiC,EAAE;QAClD,MAAM,YAAY,GAChB;YACE,UAAU,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,WAAW;YACjE,GAAG,SAAS,CAAC,OAAO;SACrB,CAAC;QACJ,MAAM,aAAa,GAAkC,EAAE,CAAC;QACxD,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,MAAM,IAAI,gBAAgB,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAS;YAClC,MAAM,YAAY,GAAG,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;YAC7C,aAAa,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC;YACrC,aAAa,IAAI,YAAY,CAAC;YAC9B,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;QACjC,CAAC;QACD,OAAO;YACL,GAAG,SAAS;YACZ,aAAa,EAAE,KAAK,GAAG,CAAC;YACxB,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,WAAW;YAC1D,aAAa;SACd,CAAC;IACJ,CAAC,CACF,CAAC;IACF,MAAM,CAAC,IAAI,CACT,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CACvE,CAAC;IACF,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QAC9B,KAAK,CAAC,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IACH,OAAO;QACL,KAAK,EAAE,qBAAqB;QAC5B,iBAAiB,EAAE,gBAAgB;QACnC,MAAM,EAAE,MAAM;KACf,CAAC;AACJ,CAAC;AAED,kFAAkF;AAClF,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,UAAuD,EACvD,UAAgD,EAAE;IAElD,MAAM,aAAa,GAAG,6BAA6B,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACzE,IAAI,CAAC,OAAO,CAAC,MAAM;QAAE,OAAO,aAAa,CAAC;IAC1C,MAAM,YAAY,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC;QACxC,UAAU;QACV,cAAc,EAAE,aAAa;KAC9B,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7D,MAAM,IAAI,SAAS,CACjB,2EAA2E,CAC5E,CAAC;QACJ,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC;IACD,IACE,SAAS,CAAC,IAAI,KAAK,UAAU,CAAC,MAAM;QACpC,UAAU,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAC5D,CAAC;QACD,MAAM,IAAI,SAAS,CACjB,2EAA2E,CAC5E,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAChD,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAW,CAAC;QAChD,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;IAC/D,CAAC,CAAC,CAAC;IACH,MAAM,CAAC,IAAI,CACT,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CACvE,CAAC;IACF,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QAC9B,KAAK,CAAC,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IACH,OAAO;QACL,KAAK,EAAE,QAAQ;QACf,iBAAiB,EAAE,aAAa,CAAC,iBAAiB;QAClD,MAAM;KACP,CAAC;AACJ,CAAC;AAED,2JAA2J;AAC3J,MAAM,CAAC,KAAK,UAAU,0CAA0C,CAC9D,OAAgC,EAChC,UAAuD,EACvD,UAAiE,EAAE;IAEnE,MAAM,aAAa,GAAG,6BAA6B,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACzE,MAAM,QAAQ,GAAG,MAAM,wBAAwB,CAAC,yBAAyB,EAAE;QACzE,OAAO;QACP,UAAU;QACV,cAAc,EAAE,aAAa;KAC9B,CAAC,CAAC;IACH,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QACtB,OAAO,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;YACjC,CAAC,CAAC,EAAE,GAAG,aAAa,EAAE,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE;YACnD,CAAC,CAAC,aAAa,CAAC;IACpB,CAAC;IACD,IACE,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC/B,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CACpB,CAAC,KAAK,EAAE,EAAE,CACR,OAAO,KAAK,KAAK,QAAQ;YACzB,KAAK,KAAK,IAAI;YACd,OAAQ,KAA0B,CAAC,EAAE,KAAK,QAAQ;YAClD,OAAQ,KAA6B,CAAC,KAAK,KAAK,QAAQ;YACxD,MAAM,CAAC,QAAQ,CAAE,KAA2B,CAAC,KAAK,CAAC,CACtD,EACD,CAAC;QACD,OAAO;YACL,GAAG,aAAa;YAChB,QAAQ,EAAE;gBACR,GAAG,QAAQ,CAAC,QAAQ;gBACpB,4CAA4C;aAC7C;SACF,CAAC;IACJ,CAAC;IACD,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,sBAAsB,CAAC,UAAU,EAAE;YACtD,GAAG,OAAO;YACV,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,MAAuC;SAC/D,CAAC,CAAC;QACH,OAAO,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;YACjC,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE;YAC5C,CAAC,CAAC,MAAM,CAAC;IACb,CAAC;IAAC,MAAM,CAAC;QACP,OAAO;YACL,GAAG,aAAa;YAChB,QAAQ,EAAE;gBACR,GAAG,QAAQ,CAAC,QAAQ;gBACpB,4CAA4C;aAC7C;SACF,CAAC;IACJ,CAAC;AACH,CAAC;AAqJD,+EAA+E;AAC/E,MAAM,CAAC,MAAM,+BAA+B,GAAG;IAC7C,MAAM;IACN,iBAAiB;IACjB,iBAAiB;IACjB,qBAAqB;IACrB,wBAAwB;CACyC,CAAC;AAgBpE,SAAS,cAAc,CACrB,QAA2B,EAC3B,MAA2B;IAE3B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACpC,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;AAC1E,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,sBAAsB,CACpC,KAAoC;IAEpC,IACE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC;QACrC,KAAK,CAAC,aAAa,GAAG,CAAC;QACvB,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,YAAY,CAAC;QACpC,KAAK,CAAC,YAAY,IAAI,CAAC,EACvB,CAAC;QACD,MAAM,IAAI,SAAS,CACjB,8EAA8E,CAC/E,CAAC;IACJ,CAAC;IACD,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC;IACxC,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC;SACxC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;SAClC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC;SACnC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAC/B,MAAM,cAAc,GAAG,CAAC,MAAyB,EAAE,EAAE,CACnD,MAAM,CAAC,MAAM,CACX,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,EACxE,CAAC,CACF,CAAC;IACJ,MAAM,KAAK,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;IACzC,MAAM,aAAa,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAC5D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAC5C,MAAM,YAAY,GAAG,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,YAAY,CAAC;IAC/D,OAAO;QACL,IAAI,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,GAAG,KAAK;QACrD,eAAe,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,GAAG,CAAC,CAAC;QAChE,eAAe,EAAE,cAAc,CAAC,KAAK,CAAC,YAAY,IAAI,EAAE,EAAE,SAAS,CAAC;QACpE,mBAAmB,EAAE,cAAc,CAAC,KAAK,CAAC,cAAc,IAAI,EAAE,EAAE,SAAS,CAAC;QAC1E,sBAAsB,EAAE,YAAY;YAClC,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,aAAa;QAC5C,mBAAmB,EAAE,YAAY;KAClC,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAc;IACxC,OAAO,IAAI,CAAC,IAAI,CACd,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAChE,CAAC;AACJ,CAAC;AAED,SAAS,qBAAqB,CAAC,KAAa;IAC1C,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;AAC7C,CAAC;AAED,SAAS,yBAAyB,CAChC,MAAoE,EACpE,OAAgC;IAEhC,MAAM,SAAS,GACb,OAAO,KAAK,SAAS;QACnB,CAAC,CAAC;YACE,GAAG,CAAE,MAAyC,CAAC,UAAU,IAAI,EAAE,CAAC;YAChE,GAAG,CAAE,MAAyC,CAAC,SAAS,IAAI,EAAE,CAAC;YAC/D,GAAG,CAAE,MAAyC,CAAC,gBAAgB;gBAC7D,EAAE,CAAC;SACN,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,CAAC,CAAC;YACE,GAAG,CAAE,MAAsC,CAAC,WAAW;gBACrD,CAAC,CAAC;oBACG,MAAsC;yBACpC,WAA0C;iBAC9C;gBACH,CAAC,CAAC,EAAE,CAAC;YACP,GAAG,CAAE,MAAsC,CAAC,KAAK,IAAI,EAAE,CAAC;SACzD,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;IACrC,MAAM,WAAW,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;SAC9C,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACxC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IACvE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;AACpC,CAAC;AAED,mFAAmF;AACnF,MAAM,CAAC,KAAK,UAAU,4BAA4B,CAChD,QAAmC,EACnC,MAA+B;IAE/B,IACE,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAC/B,QAAQ,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EACtC,CAAC;QACD,MAAM,IAAI,SAAS,CACjB,wEAAwE,CACzE,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GACV,QAAQ,CAAC,OAAO,KAAK,SAAS;QAC5B,CAAC,CAAC,MAAM,MAAM,CAAC,OAAO,CAAC,EAAE,GAAG,QAAQ,CAAC,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC;QACrE,CAAC,CAAC,MAAM,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,QAAQ,CAAC,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC;IACvE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,GAAG,yBAAyB,CAC1D,MAAM,EACN,QAAQ,CAAC,OAAO,CACjB,CAAC;IACF,MAAM,MAAM,GAAG,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;IACjD,MAAM,YAAY,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAChD,OAAO;QACL,EAAE,EAAE,QAAQ,CAAC,EAAE;QACf,OAAO,EAAE,QAAQ,CAAC,OAAO;QACzB,SAAS,EAAE,QAAQ,CAAC,SAAS;QAC7B,UAAU,EAAE,SAAS;QACrB,aAAa,EAAE,YAAY;QAC3B,OAAO,EAAE,sBAAsB,CAAC;YAC9B,UAAU,EAAE,SAAS;YACrB,SAAS,EAAE,QAAQ,CAAC,SAAS;YAC7B,YAAY,EAAE,QAAQ,CAAC,YAAY;YACnC,cAAc,EAAE,QAAQ,CAAC,cAAc;YACvC,aAAa,EAAE,YAAY;YAC3B,YAAY,EAAE,QAAQ,CAAC,YAAY;SACpC,CAAC;QACF,WAAW;KACZ,CAAC;AACJ,CAAC;AAED,wFAAwF;AACxF,MAAM,UAAU,iCAAiC,CAC/C,OAAmD,EACnD,UAAuC;IAEvC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,SAAS,CACjB,0DAA0D,CAC3D,CAAC;IACJ,CAAC;IACD,MAAM,OAAO,GAAG,+BAA+B,CAAC;IAChD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;YACzC,MAAM,IAAI,SAAS,CACjB,gCAAgC,MAAM,0BAA0B,CACjE,CAAC;QACJ,CAAC;IACH,CAAC;IACD,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAClC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QACtB,MAAM;QACN,qBAAqB,CACnB,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAClE,OAAO,CAAC,MAAM,CACjB;KACF,CAAC,CACuC,CAAC;IAC5C,MAAM,QAAQ,GAAG,OAAO;SACrB,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;SAC1D,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,GAAG,MAAM,IAAI,SAAS,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC3E,OAAO;QACL,cAAc,EAAE,OAAO,CAAC,MAAM;QAC9B,SAAS;QACT,SAAS,EAAE,CAAC,GAAG,OAAO,CAAC;QACvB,MAAM,EAAE,QAAQ,CAAC,MAAM,KAAK,CAAC;QAC7B,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,mFAAmF;AACnF,MAAM,CAAC,KAAK,UAAU,0BAA0B,CAC9C,SAA+C,EAC/C,MAA+B,EAC/B,UAAuC;IAEvC,MAAM,OAAO,GAAsC,EAAE,CAAC;IACtD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,OAAO,CAAC,IAAI,CAAC,MAAM,4BAA4B,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,iCAAiC,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AAChE,CAAC","debugId":"380bb6a4-3d56-5a72-8bc9-236b044012b3"}
+{"version":3,"file":"context-relevance.js","sources":["sdk/context-relevance.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/context-relevance\n *\n * Public, deterministic context-ranking and evaluation primitives. The scorer\n * accepts already-derived signals so package authors can reuse the same model\n * with core, extension, or project-specific feature stores.\n */\nimport { runActiveServiceOverride } from \"../core/extensions/index.js\";\n\n/** Canonical signal keys understood by the built-in relevance model. */\nexport const CONTEXT_RELEVANCE_SIGNAL_NAMES = [\n  \"structural\",\n  \"recency\",\n  \"activity_density\",\n  \"graph_proximity\",\n  \"claim_focus\",\n  \"priority_pressure\",\n  \"risk_pressure\",\n  \"deadline_pressure\",\n  \"knowledge_density\",\n  \"author_affinity\",\n  \"usage_affinity\",\n  \"semantic_similarity\",\n] as const;\n\n/** A normalized signal consumed by the built-in context relevance scorer. */\nexport type ContextRelevanceSignalName =\n  (typeof CONTEXT_RELEVANCE_SIGNAL_NAMES)[number];\n\n/** Normalized candidate features; omitted signals are excluded from weighting. */\nexport type ContextRelevanceSignals = Partial<\n  Record<Exclude<ContextRelevanceSignalName, \"structural\">, number>\n>;\n\n/** A project-management object and its derived relevance signals. */\nexport interface ContextRelevanceCandidate<TItem> {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports item for this contract. */\n  item: TItem;\n  /** Value that configures or reports signals for this contract. */\n  signals?: ContextRelevanceSignals;\n}\n\n/** Per-signal weighted contributions used to explain a ranked result. */\nexport type ContextRelevanceContributions = Record<string, number>;\n\n/** One ranked candidate with deterministic score and explanation metadata. */\nexport interface RankedContextCandidate<\n  TItem,\n> extends ContextRelevanceCandidate<TItem> {\n  /** Value that configures or reports baseline rank for this contract. */\n  baseline_rank: number;\n  /** Value that configures or reports rank for this contract. */\n  rank: number;\n  /** Value that configures or reports score for this contract. */\n  score: number;\n  /** Value that configures or reports contributions for this contract. */\n  contributions: ContextRelevanceContributions;\n}\n\n/** Complete output from a context relevance scorer. */\nexport interface ContextRelevanceReport<TItem> {\n  /** Value that configures or reports model for this contract. */\n  model: string;\n  /** Value that configures or reports available signals for this contract. */\n  available_signals: ContextRelevanceSignalName[];\n  /** Value that configures or reports ranked for this contract. */\n  ranked: RankedContextCandidate<TItem>[];\n  /** Value that configures or reports warnings for this contract. */\n  warnings?: string[];\n}\n\n/** Minimal custom score returned by a replacement or wrapper scorer. */\nexport interface ContextRelevanceCustomScore {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports score for this contract. */\n  score: number;\n}\n\n/** Input provided to a custom scorer, including the deterministic default. */\nexport interface ContextRelevanceScorerInput<TItem> {\n  /** Value that configures or reports candidates for this contract. */\n  candidates: readonly ContextRelevanceCandidate<TItem>[];\n  /** Fallback report used when callers do not provide an override. */\n  default_report: ContextRelevanceReport<TItem>;\n}\n\n/** Replaceable package/extension scorer contract. */\nexport type ContextRelevanceScorer<TItem> = (\n  input: ContextRelevanceScorerInput<TItem>,\n) =>\n  | readonly ContextRelevanceCustomScore[]\n  | Promise<readonly ContextRelevanceCustomScore[]>;\n\n/** Options for the built-in or replaceable context relevance scorer. */\nexport interface ScoreContextCandidatesOptions<TItem> {\n  /** Value that configures or reports weights for this contract. */\n  weights?: Partial<Record<ContextRelevanceSignalName, number>>;\n  /** Value that configures or reports scorer for this contract. */\n  scorer?: ContextRelevanceScorer<TItem>;\n}\n\n/** Governed extension service used to replace or wrap context ranking. */\nexport const CONTEXT_RELEVANCE_SERVICE = \"context_relevance\" as const;\n\n/** Command surface requesting an active extension relevance override. */\nexport type ContextRelevanceSurface = \"context\" | \"next\";\n\nconst DEFAULT_CONTEXT_RELEVANCE_WEIGHTS: Record<\n  ContextRelevanceSignalName,\n  number\n> = {\n  structural: 0.4,\n  recency: 0.35,\n  activity_density: 0.25,\n  graph_proximity: 0.15,\n  claim_focus: 0.6,\n  priority_pressure: 0.35,\n  risk_pressure: 0.2,\n  deadline_pressure: 0.45,\n  knowledge_density: 0.25,\n  author_affinity: 0.2,\n  usage_affinity: 0.3,\n  semantic_similarity: 0.5,\n};\nconst JSON_TOKEN_ENCODER = new TextEncoder();\n\nfunction assertCandidates<TItem>(\n  candidates: readonly ContextRelevanceCandidate<TItem>[],\n): void {\n  const ids = new Set<string>();\n  for (const candidate of candidates) {\n    if (\n      typeof candidate.id !== \"string\" ||\n      candidate.id.trim().length === 0 ||\n      ids.has(candidate.id)\n    ) {\n      throw new TypeError(\n        \"Context relevance candidates require unique non-empty ids\",\n      );\n    }\n    ids.add(candidate.id);\n    for (const [signal, value] of Object.entries(candidate.signals ?? {})) {\n      if (\n        signal === \"structural\" ||\n        !CONTEXT_RELEVANCE_SIGNAL_NAMES.includes(\n          signal as ContextRelevanceSignalName,\n        )\n      ) {\n        throw new TypeError(`Unknown context relevance signal: ${signal}`);\n      }\n      if (value === undefined) continue;\n      if (!Number.isFinite(value) || value < 0 || value > 1) {\n        throw new TypeError(\n          `Context relevance signal ${signal} must be a finite number from 0 to 1`,\n        );\n      }\n    }\n  }\n}\n\nfunction resolveWeights(\n  overrides: Partial<Record<ContextRelevanceSignalName, number>> | undefined,\n): Record<ContextRelevanceSignalName, number> {\n  const weights = { ...DEFAULT_CONTEXT_RELEVANCE_WEIGHTS };\n  for (const [signal, weight] of Object.entries(overrides ?? {})) {\n    if (\n      weight !== undefined &&\n      CONTEXT_RELEVANCE_SIGNAL_NAMES.includes(\n        signal as ContextRelevanceSignalName,\n      )\n    ) {\n      weights[signal as ContextRelevanceSignalName] = weight;\n    }\n  }\n  for (const [signal, weight] of Object.entries(weights)) {\n    if (!Number.isFinite(weight) || weight < 0) {\n      throw new TypeError(\n        `Context relevance weight ${signal} must be a finite non-negative number`,\n      );\n    }\n  }\n  return weights;\n}\n\n/** Score candidates with pm's deterministic weighted model. Candidate order is the structural baseline and remains unchanged when no advanced signals exist. */\nexport function defaultScoreContextCandidates<TItem>(\n  candidates: readonly ContextRelevanceCandidate<TItem>[],\n  options: Pick<ScoreContextCandidatesOptions<TItem>, \"weights\"> = {},\n): ContextRelevanceReport<TItem> {\n  assertCandidates(candidates);\n  const weights = resolveWeights(options.weights);\n  const denominator = Math.max(candidates.length - 1, 1);\n  const available = new Set<ContextRelevanceSignalName>([\"structural\"]);\n  for (const candidate of candidates) {\n    for (const [signal, value] of Object.entries(candidate.signals ?? {})) {\n      if (value !== undefined)\n        available.add(signal as ContextRelevanceSignalName);\n    }\n  }\n  const availableSignals = CONTEXT_RELEVANCE_SIGNAL_NAMES.filter((signal) =>\n    available.has(signal),\n  );\n  const scored = candidates.map(\n    (candidate, index): RankedContextCandidate<TItem> => {\n      const signalValues: Partial<Record<ContextRelevanceSignalName, number>> =\n        {\n          structural: candidates.length === 1 ? 1 : 1 - index / denominator,\n          ...candidate.signals,\n        };\n      const contributions: ContextRelevanceContributions = {};\n      let weightedScore = 0;\n      let totalWeight = 0;\n      for (const signal of availableSignals) {\n        const value = signalValues[signal];\n        if (value === undefined) continue;\n        const contribution = value * weights[signal];\n        contributions[signal] = contribution;\n        weightedScore += contribution;\n        totalWeight += weights[signal];\n      }\n      return {\n        ...candidate,\n        baseline_rank: index + 1,\n        rank: 0,\n        score: totalWeight === 0 ? 0 : weightedScore / totalWeight,\n        contributions,\n      };\n    },\n  );\n  scored.sort(\n    (left, right) =>\n      right.score - left.score || left.baseline_rank - right.baseline_rank,\n  );\n  scored.forEach((entry, index) => {\n    entry.rank = index + 1;\n  });\n  return {\n    model: \"default-weighted-v1\",\n    available_signals: availableSignals,\n    ranked: scored,\n  };\n}\n\n/** Score candidates with the default model or a validated replacement/wrapper. */\nexport async function scoreContextCandidates<TItem>(\n  candidates: readonly ContextRelevanceCandidate<TItem>[],\n  options: ScoreContextCandidatesOptions<TItem> = {},\n): Promise<ContextRelevanceReport<TItem>> {\n  const defaultReport = defaultScoreContextCandidates(candidates, options);\n  if (!options.scorer) return defaultReport;\n  const customScores = await options.scorer({\n    candidates,\n    default_report: defaultReport,\n  });\n  const scoreById = new Map<string, number>();\n  for (const entry of customScores) {\n    if (scoreById.has(entry.id) || !Number.isFinite(entry.score)) {\n      throw new TypeError(\n        \"Context relevance scorer must return one finite score for every candidate\",\n      );\n    }\n    scoreById.set(entry.id, entry.score);\n  }\n  if (\n    scoreById.size !== candidates.length ||\n    candidates.some((candidate) => !scoreById.has(candidate.id))\n  ) {\n    throw new TypeError(\n      \"Context relevance scorer must return one finite score for every candidate\",\n    );\n  }\n  const ranked = defaultReport.ranked.map((entry) => {\n    const score = scoreById.get(entry.id) as number;\n    return { ...entry, score, contributions: { custom: score } };\n  });\n  ranked.sort(\n    (left, right) =>\n      right.score - left.score || left.baseline_rank - right.baseline_rank,\n  );\n  ranked.forEach((entry, index) => {\n    entry.rank = index + 1;\n  });\n  return {\n    model: \"custom\",\n    available_signals: defaultReport.available_signals,\n    ranked,\n  };\n}\n\n/** Score command candidates through the public default model and then the active governed `context_relevance` service override, when one is registered. */\nexport async function scoreContextCandidatesWithActiveExtensions<TItem>(\n  surface: ContextRelevanceSurface,\n  candidates: readonly ContextRelevanceCandidate<TItem>[],\n  options: Pick<ScoreContextCandidatesOptions<TItem>, \"weights\"> = {},\n): Promise<ContextRelevanceReport<TItem>> {\n  const defaultReport = defaultScoreContextCandidates(candidates, options);\n  const override = await runActiveServiceOverride(CONTEXT_RELEVANCE_SERVICE, {\n    surface,\n    candidates,\n    default_report: defaultReport,\n  });\n  if (!override.handled) {\n    return override.warnings.length > 0\n      ? { ...defaultReport, warnings: override.warnings }\n      : defaultReport;\n  }\n  if (\n    !Array.isArray(override.result) ||\n    !override.result.every(\n      (entry) =>\n        typeof entry === \"object\" &&\n        entry !== null &&\n        typeof (entry as { id?: unknown }).id === \"string\" &&\n        typeof (entry as { score?: unknown }).score === \"number\" &&\n        Number.isFinite((entry as { score: number }).score),\n    )\n  ) {\n    return {\n      ...defaultReport,\n      warnings: [\n        ...override.warnings,\n        \"extension_context_relevance_invalid_result\",\n      ],\n    };\n  }\n  try {\n    const report = await scoreContextCandidates(candidates, {\n      ...options,\n      scorer: () => override.result as ContextRelevanceCustomScore[],\n    });\n    return override.warnings.length > 0\n      ? { ...report, warnings: override.warnings }\n      : report;\n  } catch {\n    return {\n      ...defaultReport,\n      warnings: [\n        ...override.warnings,\n        \"extension_context_relevance_invalid_result\",\n      ],\n    };\n  }\n}\n\n/** Input for rank-aware context/next quality evaluation. */\nexport interface ContextRankingEvaluationInput {\n  /** Value that configures or reports ranked ids for this contract. */\n  ranked_ids: string[];\n  /** Value that configures or reports judgments for this contract. */\n  judgments: Record<string, number>;\n  /** Value that configures or reports required ids for this contract. */\n  required_ids?: string[];\n  /** Value that configures or reports continuity ids for this contract. */\n  continuity_ids?: string[];\n  /** Value that configures or reports actual tokens for this contract. */\n  actual_tokens: number;\n  /** Value that configures or reports token budget for this contract. */\n  token_budget: number;\n}\n\n/** Rank-quality, continuity, recall, and token-budget metrics for one scenario. */\nexport interface ContextRankingEvaluation {\n  /** Value that configures or reports ndcg for this contract. */\n  ndcg: number;\n  /** Value that configures or reports reciprocal rank for this contract. */\n  reciprocal_rank: number;\n  /** Value that configures or reports required recall for this contract. */\n  required_recall: number;\n  /** Value that configures or reports continuity coverage for this contract. */\n  continuity_coverage: number;\n  /** Value that configures or reports token budget adherence for this contract. */\n  token_budget_adherence: number;\n  /** Value that configures or reports within token budget for this contract. */\n  within_token_budget: boolean;\n}\n\n/** Flexible read options accepted by context evaluation scenarios. */\nexport interface ContextEvaluationReadOptions {\n  /** Value that configures or reports explain ranking for this contract. */\n  explainRanking?: boolean;\n  [key: string]: unknown;\n}\n\n/** Minimal item identity consumed by the context evaluation runner. */\nexport interface ContextEvaluationResultItem {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n}\n\n/** Optional scorer attribution returned by an evaluated read primitive. */\nexport interface ContextEvaluationResultRanking {\n  /** Value that configures or reports items for this contract. */\n  items?: Array<{ id: string; contributions: ContextRelevanceContributions }>;\n}\n\n/** Structural context result consumed by the evaluation runner. */\nexport interface ContextEvaluationContextResult {\n  /** Value that configures or reports high level for this contract. */\n  high_level?: ContextEvaluationResultItem[];\n  /** Value that configures or reports low level for this contract. */\n  low_level?: ContextEvaluationResultItem[];\n  /** Value that configures or reports blocked fallback for this contract. */\n  blocked_fallback?: ContextEvaluationResultItem[];\n  /** Value that configures or reports ranking for this contract. */\n  ranking?: ContextEvaluationResultRanking;\n  [key: string]: unknown;\n}\n\n/** Structural next result consumed by the evaluation runner. */\nexport interface ContextEvaluationNextResult {\n  /** Value that configures or reports recommended for this contract. */\n  recommended?: ContextEvaluationResultItem | null;\n  /** Value that configures or reports ready for this contract. */\n  ready?: ContextEvaluationResultItem[];\n  /** Value that configures or reports ranking for this contract. */\n  ranking?: ContextEvaluationResultRanking;\n  [key: string]: unknown;\n}\n\n/** Read-only SDK surface required by the context evaluation runner. */\nexport interface ContextEvaluationReader {\n  /** Value that configures or reports context for this contract. */\n  context(\n    options?: ContextEvaluationReadOptions,\n  ): Promise<ContextEvaluationContextResult>;\n  /** Value that configures or reports next for this contract. */\n  next(\n    options?: ContextEvaluationReadOptions,\n  ): Promise<ContextEvaluationNextResult>;\n}\n\n/** One graded context or next scenario evaluated against a real SDK reader. */\nexport interface ContextEvaluationScenario {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports surface for this contract. */\n  surface: ContextRelevanceSurface;\n  /** Value that configures or reports options for this contract. */\n  options?: ContextEvaluationReadOptions;\n  /** Value that configures or reports judgments for this contract. */\n  judgments: Record<string, number>;\n  /** Value that configures or reports required ids for this contract. */\n  required_ids?: string[];\n  /** Value that configures or reports continuity ids for this contract. */\n  continuity_ids?: string[];\n  /** Value that configures or reports token budget for this contract. */\n  token_budget: number;\n  /** Value that configures or reports rationale for this contract. */\n  rationale: string;\n}\n\n/** Per-item signal attribution retained by a context evaluation report. */\nexport interface ContextEvaluationAttribution {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports contributions for this contract. */\n  contributions: ContextRelevanceContributions;\n}\n\n/** Result of executing and grading one context evaluation scenario. */\nexport interface ContextEvaluationScenarioReport {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports surface for this contract. */\n  surface: ContextRelevanceSurface;\n  /** Value that configures or reports rationale for this contract. */\n  rationale: string;\n  /** Value that configures or reports ranked ids for this contract. */\n  ranked_ids: string[];\n  /** Value that configures or reports actual tokens for this contract. */\n  actual_tokens: number;\n  /** Value that configures or reports metrics for this contract. */\n  metrics: ContextRankingEvaluation;\n  /** Value that configures or reports attribution for this contract. */\n  attribution: ContextEvaluationAttribution[];\n}\n\n/** Minimum acceptable aggregate metrics for a context evaluation corpus. */\nexport interface ContextEvaluationThresholds {\n  /** Value that configures or reports ndcg for this contract. */\n  ndcg: number;\n  /** Value that configures or reports reciprocal rank for this contract. */\n  reciprocal_rank: number;\n  /** Value that configures or reports required recall for this contract. */\n  required_recall: number;\n  /** Value that configures or reports continuity coverage for this contract. */\n  continuity_coverage: number;\n  /** Value that configures or reports token budget adherence for this contract. */\n  token_budget_adherence: number;\n}\n\n/** Canonical aggregate metrics required by every context evaluation corpus. */\nexport const CONTEXT_EVALUATION_METRIC_NAMES = [\n  \"ndcg\",\n  \"reciprocal_rank\",\n  \"required_recall\",\n  \"continuity_coverage\",\n  \"token_budget_adherence\",\n] as const satisfies readonly (keyof ContextEvaluationThresholds)[];\n\n/** Aggregate context evaluation report suitable for a CI quality gate. */\nexport interface ContextEvaluationCorpusReport {\n  /** Number of scenario entries represented by this result. */\n  scenario_count: number;\n  /** Value that configures or reports aggregate for this contract. */\n  aggregate: ContextEvaluationThresholds;\n  /** Value that configures or reports scenarios for this contract. */\n  scenarios: ContextEvaluationScenarioReport[];\n  /** Value that configures or reports passed for this contract. */\n  passed: boolean;\n  /** Value that configures or reports failures for this contract. */\n  failures: string[];\n}\n\nfunction ratioOfPresent(\n  expected: readonly string[],\n  actual: ReadonlySet<string>,\n): number {\n  if (expected.length === 0) return 1;\n  return expected.filter((id) => actual.has(id)).length / expected.length;\n}\n\n/** Evaluate one ranked context packet against graded human judgments. */\nexport function evaluateContextRanking(\n  input: ContextRankingEvaluationInput,\n): ContextRankingEvaluation {\n  if (\n    !Number.isFinite(input.actual_tokens) ||\n    input.actual_tokens < 0 ||\n    !Number.isFinite(input.token_budget) ||\n    input.token_budget <= 0\n  ) {\n    throw new TypeError(\n      \"Context ranking token counts require actual_tokens >= 0 and token_budget > 0\",\n    );\n  }\n  const judgments = input.judgments ?? {};\n  const gains = input.ranked_ids.map((id) => Math.max(0, judgments[id] ?? 0));\n  const idealGains = Object.values(judgments)\n    .map((grade) => Math.max(0, grade))\n    .sort((left, right) => right - left)\n    .slice(0, gains.length || 1);\n  const discountedGain = (values: readonly number[]) =>\n    values.reduce(\n      (total, grade, index) => total + (2 ** grade - 1) / Math.log2(index + 2),\n      0,\n    );\n  const ideal = discountedGain(idealGains);\n  const firstRelevant = gains.findIndex((grade) => grade > 0);\n  const actualIds = new Set(input.ranked_ids);\n  const withinBudget = input.actual_tokens <= input.token_budget;\n  return {\n    ndcg: ideal === 0 ? 1 : discountedGain(gains) / ideal,\n    reciprocal_rank: firstRelevant < 0 ? 0 : 1 / (firstRelevant + 1),\n    required_recall: ratioOfPresent(input.required_ids ?? [], actualIds),\n    continuity_coverage: ratioOfPresent(input.continuity_ids ?? [], actualIds),\n    token_budget_adherence: withinBudget\n      ? 1\n      : input.token_budget / input.actual_tokens,\n    within_token_budget: withinBudget,\n  };\n}\n\nfunction estimateJsonTokens(value: unknown): number {\n  return Math.ceil(\n    JSON_TOKEN_ENCODER.encode(JSON.stringify(value)).byteLength / 4,\n  );\n}\n\nfunction roundEvaluationMetric(value: number): number {\n  return Math.round(value * 10_000) / 10_000;\n}\n\nfunction rankingPayloadForScenario(\n  result: ContextEvaluationContextResult | ContextEvaluationNextResult,\n  surface: ContextRelevanceSurface,\n): { rankedIds: string[]; attribution: ContextEvaluationAttribution[] } {\n  const rankedIds =\n    surface === \"context\"\n      ? [\n          ...((result as ContextEvaluationContextResult).high_level ?? []),\n          ...((result as ContextEvaluationContextResult).low_level ?? []),\n          ...((result as ContextEvaluationContextResult).blocked_fallback ??\n            []),\n        ].map((item) => item.id)\n      : [\n          ...((result as ContextEvaluationNextResult).recommended\n            ? [\n                (result as ContextEvaluationNextResult)\n                  .recommended as ContextEvaluationResultItem,\n              ]\n            : []),\n          ...((result as ContextEvaluationNextResult).ready ?? []),\n        ].map((item) => item.id);\n  const servedIds = new Set(rankedIds);\n  const attribution = (result.ranking?.items ?? [])\n    .filter((item) => servedIds.has(item.id))\n    .map((item) => ({ id: item.id, contributions: item.contributions }));\n  return { rankedIds, attribution };\n}\n\n/** Execute one graded scenario through public SDK context/next read primitives. */\nexport async function runContextEvaluationScenario(\n  scenario: ContextEvaluationScenario,\n  reader: ContextEvaluationReader,\n): Promise<ContextEvaluationScenarioReport> {\n  if (\n    scenario.id.trim().length === 0 ||\n    scenario.rationale.trim().length === 0\n  ) {\n    throw new TypeError(\n      \"Context evaluation scenarios require non-empty id and rationale values\",\n    );\n  }\n  const result =\n    scenario.surface === \"context\"\n      ? await reader.context({ ...scenario.options, explainRanking: true })\n      : await reader.next({ ...scenario.options, explainRanking: true });\n  const { rankedIds, attribution } = rankingPayloadForScenario(\n    result,\n    scenario.surface,\n  );\n  const packet = { ...result, ranking: undefined };\n  const actualTokens = estimateJsonTokens(packet);\n  return {\n    id: scenario.id,\n    surface: scenario.surface,\n    rationale: scenario.rationale,\n    ranked_ids: rankedIds,\n    actual_tokens: actualTokens,\n    metrics: evaluateContextRanking({\n      ranked_ids: rankedIds,\n      judgments: scenario.judgments,\n      required_ids: scenario.required_ids,\n      continuity_ids: scenario.continuity_ids,\n      actual_tokens: actualTokens,\n      token_budget: scenario.token_budget,\n    }),\n    attribution,\n  };\n}\n\n/** Aggregate scenario reports and evaluate every metric against explicit thresholds. */\nexport function summarizeContextEvaluationReports(\n  reports: readonly ContextEvaluationScenarioReport[],\n  thresholds: ContextEvaluationThresholds,\n): ContextEvaluationCorpusReport {\n  if (reports.length === 0) {\n    throw new TypeError(\n      \"Context evaluation requires at least one scenario report\",\n    );\n  }\n  const metrics = CONTEXT_EVALUATION_METRIC_NAMES;\n  for (const metric of metrics) {\n    if (!Number.isFinite(thresholds[metric])) {\n      throw new TypeError(\n        `Context evaluation threshold ${metric} must be a finite number`,\n      );\n    }\n  }\n  const aggregate = Object.fromEntries(\n    metrics.map((metric) => [\n      metric,\n      roundEvaluationMetric(\n        reports.reduce((total, report) => total + report.metrics[metric], 0) /\n          reports.length,\n      ),\n    ]),\n  ) as unknown as ContextEvaluationThresholds;\n  const failures = metrics\n    .filter((metric) => aggregate[metric] < thresholds[metric])\n    .map((metric) => `${metric}:${aggregate[metric]}<${thresholds[metric]}`);\n  return {\n    scenario_count: reports.length,\n    aggregate,\n    scenarios: [...reports],\n    passed: failures.length === 0,\n    failures,\n  };\n}\n\n/** Execute a same-workspace scenario corpus through public SDK read primitives. */\nexport async function runContextEvaluationCorpus(\n  scenarios: readonly ContextEvaluationScenario[],\n  reader: ContextEvaluationReader,\n  thresholds: ContextEvaluationThresholds,\n): Promise<ContextEvaluationCorpusReport> {\n  const reports: ContextEvaluationScenarioReport[] = [];\n  for (const scenario of scenarios) {\n    reports.push(await runContextEvaluationScenario(scenario, reader));\n  }\n  return summarizeContextEvaluationReports(reports, thresholds);\n}\n"],"names":[],"mappings":"AAAA;;;;;;GAMG;;;AACH,OAAO,EAAE,wBAAwB,EAAE,MAAM,6BAA6B,CAAC;AAEvE,wEAAwE;AACxE,MAAM,CAAC,MAAM,8BAA8B,GAAG;IAC5C,YAAY;IACZ,SAAS;IACT,kBAAkB;IAClB,iBAAiB;IACjB,aAAa;IACb,mBAAmB;IACnB,eAAe;IACf,mBAAmB;IACnB,mBAAmB;IACnB,iBAAiB;IACjB,gBAAgB;IAChB,qBAAqB;CACb,CAAC;AAiFX,0EAA0E;AAC1E,MAAM,CAAC,MAAM,yBAAyB,GAAG,mBAA4B,CAAC;AAKtE,MAAM,iCAAiC,GAGnC;IACF,UAAU,EAAE,GAAG;IACf,OAAO,EAAE,IAAI;IACb,gBAAgB,EAAE,IAAI;IACtB,eAAe,EAAE,IAAI;IACrB,WAAW,EAAE,GAAG;IAChB,iBAAiB,EAAE,IAAI;IACvB,aAAa,EAAE,GAAG;IAClB,iBAAiB,EAAE,IAAI;IACvB,iBAAiB,EAAE,IAAI;IACvB,eAAe,EAAE,GAAG;IACpB,cAAc,EAAE,GAAG;IACnB,mBAAmB,EAAE,GAAG;CACzB,CAAC;AACF,MAAM,kBAAkB,GAAG,IAAI,WAAW,EAAE,CAAC;AAE7C,SAAS,gBAAgB,CACvB,UAAuD;IAEvD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IACE,OAAO,SAAS,CAAC,EAAE,KAAK,QAAQ;YAChC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;YAChC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,EACrB,CAAC;YACD,MAAM,IAAI,SAAS,CACjB,2DAA2D,CAC5D,CAAC;QACJ,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QACtB,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;YACtE,IACE,MAAM,KAAK,YAAY;gBACvB,CAAC,8BAA8B,CAAC,QAAQ,CACtC,MAAoC,CACrC,EACD,CAAC;gBACD,MAAM,IAAI,SAAS,CAAC,qCAAqC,MAAM,EAAE,CAAC,CAAC;YACrE,CAAC;YACD,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAS;YAClC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACtD,MAAM,IAAI,SAAS,CACjB,4BAA4B,MAAM,sCAAsC,CACzE,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CACrB,SAA0E;IAE1E,MAAM,OAAO,GAAG,EAAE,GAAG,iCAAiC,EAAE,CAAC;IACzD,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,IAAI,EAAE,CAAC,EAAE,CAAC;QAC/D,IACE,MAAM,KAAK,SAAS;YACpB,8BAA8B,CAAC,QAAQ,CACrC,MAAoC,CACrC,EACD,CAAC;YACD,OAAO,CAAC,MAAoC,CAAC,GAAG,MAAM,CAAC;QACzD,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACvD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,MAAM,IAAI,SAAS,CACjB,4BAA4B,MAAM,uCAAuC,CAC1E,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,gKAAgK;AAChK,MAAM,UAAU,6BAA6B,CAC3C,UAAuD,EACvD,UAAiE,EAAE;IAEnE,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAC7B,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAChD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACvD,MAAM,SAAS,GAAG,IAAI,GAAG,CAA6B,CAAC,YAAY,CAAC,CAAC,CAAC;IACtE,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;YACtE,IAAI,KAAK,KAAK,SAAS;gBACrB,SAAS,CAAC,GAAG,CAAC,MAAoC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD,MAAM,gBAAgB,GAAG,8BAA8B,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CACxE,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CACtB,CAAC;IACF,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAC3B,CAAC,SAAS,EAAE,KAAK,EAAiC,EAAE;QAClD,MAAM,YAAY,GAChB;YACE,UAAU,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,WAAW;YACjE,GAAG,SAAS,CAAC,OAAO;SACrB,CAAC;QACJ,MAAM,aAAa,GAAkC,EAAE,CAAC;QACxD,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,MAAM,IAAI,gBAAgB,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAS;YAClC,MAAM,YAAY,GAAG,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;YAC7C,aAAa,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC;YACrC,aAAa,IAAI,YAAY,CAAC;YAC9B,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;QACjC,CAAC;QACD,OAAO;YACL,GAAG,SAAS;YACZ,aAAa,EAAE,KAAK,GAAG,CAAC;YACxB,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,WAAW;YAC1D,aAAa;SACd,CAAC;IACJ,CAAC,CACF,CAAC;IACF,MAAM,CAAC,IAAI,CACT,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CACvE,CAAC;IACF,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QAC9B,KAAK,CAAC,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IACH,OAAO;QACL,KAAK,EAAE,qBAAqB;QAC5B,iBAAiB,EAAE,gBAAgB;QACnC,MAAM,EAAE,MAAM;KACf,CAAC;AACJ,CAAC;AAED,kFAAkF;AAClF,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,UAAuD,EACvD,UAAgD,EAAE;IAElD,MAAM,aAAa,GAAG,6BAA6B,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACzE,IAAI,CAAC,OAAO,CAAC,MAAM;QAAE,OAAO,aAAa,CAAC;IAC1C,MAAM,YAAY,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC;QACxC,UAAU;QACV,cAAc,EAAE,aAAa;KAC9B,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7D,MAAM,IAAI,SAAS,CACjB,2EAA2E,CAC5E,CAAC;QACJ,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC;IACD,IACE,SAAS,CAAC,IAAI,KAAK,UAAU,CAAC,MAAM;QACpC,UAAU,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAC5D,CAAC;QACD,MAAM,IAAI,SAAS,CACjB,2EAA2E,CAC5E,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAChD,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAW,CAAC;QAChD,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;IAC/D,CAAC,CAAC,CAAC;IACH,MAAM,CAAC,IAAI,CACT,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CACvE,CAAC;IACF,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QAC9B,KAAK,CAAC,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IACH,OAAO;QACL,KAAK,EAAE,QAAQ;QACf,iBAAiB,EAAE,aAAa,CAAC,iBAAiB;QAClD,MAAM;KACP,CAAC;AACJ,CAAC;AAED,2JAA2J;AAC3J,MAAM,CAAC,KAAK,UAAU,0CAA0C,CAC9D,OAAgC,EAChC,UAAuD,EACvD,UAAiE,EAAE;IAEnE,MAAM,aAAa,GAAG,6BAA6B,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACzE,MAAM,QAAQ,GAAG,MAAM,wBAAwB,CAAC,yBAAyB,EAAE;QACzE,OAAO;QACP,UAAU;QACV,cAAc,EAAE,aAAa;KAC9B,CAAC,CAAC;IACH,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QACtB,OAAO,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;YACjC,CAAC,CAAC,EAAE,GAAG,aAAa,EAAE,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE;YACnD,CAAC,CAAC,aAAa,CAAC;IACpB,CAAC;IACD,IACE,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC/B,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CACpB,CAAC,KAAK,EAAE,EAAE,CACR,OAAO,KAAK,KAAK,QAAQ;YACzB,KAAK,KAAK,IAAI;YACd,OAAQ,KAA0B,CAAC,EAAE,KAAK,QAAQ;YAClD,OAAQ,KAA6B,CAAC,KAAK,KAAK,QAAQ;YACxD,MAAM,CAAC,QAAQ,CAAE,KAA2B,CAAC,KAAK,CAAC,CACtD,EACD,CAAC;QACD,OAAO;YACL,GAAG,aAAa;YAChB,QAAQ,EAAE;gBACR,GAAG,QAAQ,CAAC,QAAQ;gBACpB,4CAA4C;aAC7C;SACF,CAAC;IACJ,CAAC;IACD,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,sBAAsB,CAAC,UAAU,EAAE;YACtD,GAAG,OAAO;YACV,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,MAAuC;SAC/D,CAAC,CAAC;QACH,OAAO,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;YACjC,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE;YAC5C,CAAC,CAAC,MAAM,CAAC;IACb,CAAC;IAAC,MAAM,CAAC;QACP,OAAO;YACL,GAAG,aAAa;YAChB,QAAQ,EAAE;gBACR,GAAG,QAAQ,CAAC,QAAQ;gBACpB,4CAA4C;aAC7C;SACF,CAAC;IACJ,CAAC;AACH,CAAC;AAqJD,+EAA+E;AAC/E,MAAM,CAAC,MAAM,+BAA+B,GAAG;IAC7C,MAAM;IACN,iBAAiB;IACjB,iBAAiB;IACjB,qBAAqB;IACrB,wBAAwB;CACyC,CAAC;AAgBpE,SAAS,cAAc,CACrB,QAA2B,EAC3B,MAA2B;IAE3B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACpC,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;AAC1E,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,sBAAsB,CACpC,KAAoC;IAEpC,IACE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC;QACrC,KAAK,CAAC,aAAa,GAAG,CAAC;QACvB,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,YAAY,CAAC;QACpC,KAAK,CAAC,YAAY,IAAI,CAAC,EACvB,CAAC;QACD,MAAM,IAAI,SAAS,CACjB,8EAA8E,CAC/E,CAAC;IACJ,CAAC;IACD,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC;IACxC,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC;SACxC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;SAClC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC;SACnC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAC/B,MAAM,cAAc,GAAG,CAAC,MAAyB,EAAE,EAAE,CACnD,MAAM,CAAC,MAAM,CACX,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,EACxE,CAAC,CACF,CAAC;IACJ,MAAM,KAAK,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;IACzC,MAAM,aAAa,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAC5D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAC5C,MAAM,YAAY,GAAG,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,YAAY,CAAC;IAC/D,OAAO;QACL,IAAI,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,GAAG,KAAK;QACrD,eAAe,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,GAAG,CAAC,CAAC;QAChE,eAAe,EAAE,cAAc,CAAC,KAAK,CAAC,YAAY,IAAI,EAAE,EAAE,SAAS,CAAC;QACpE,mBAAmB,EAAE,cAAc,CAAC,KAAK,CAAC,cAAc,IAAI,EAAE,EAAE,SAAS,CAAC;QAC1E,sBAAsB,EAAE,YAAY;YAClC,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,aAAa;QAC5C,mBAAmB,EAAE,YAAY;KAClC,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAc;IACxC,OAAO,IAAI,CAAC,IAAI,CACd,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAChE,CAAC;AACJ,CAAC;AAED,SAAS,qBAAqB,CAAC,KAAa;IAC1C,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;AAC7C,CAAC;AAED,SAAS,yBAAyB,CAChC,MAAoE,EACpE,OAAgC;IAEhC,MAAM,SAAS,GACb,OAAO,KAAK,SAAS;QACnB,CAAC,CAAC;YACE,GAAG,CAAE,MAAyC,CAAC,UAAU,IAAI,EAAE,CAAC;YAChE,GAAG,CAAE,MAAyC,CAAC,SAAS,IAAI,EAAE,CAAC;YAC/D,GAAG,CAAE,MAAyC,CAAC,gBAAgB;gBAC7D,EAAE,CAAC;SACN,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,CAAC,CAAC;YACE,GAAG,CAAE,MAAsC,CAAC,WAAW;gBACrD,CAAC,CAAC;oBACG,MAAsC;yBACpC,WAA0C;iBAC9C;gBACH,CAAC,CAAC,EAAE,CAAC;YACP,GAAG,CAAE,MAAsC,CAAC,KAAK,IAAI,EAAE,CAAC;SACzD,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;IACrC,MAAM,WAAW,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;SAC9C,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACxC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IACvE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;AACpC,CAAC;AAED,mFAAmF;AACnF,MAAM,CAAC,KAAK,UAAU,4BAA4B,CAChD,QAAmC,EACnC,MAA+B;IAE/B,IACE,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAC/B,QAAQ,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EACtC,CAAC;QACD,MAAM,IAAI,SAAS,CACjB,wEAAwE,CACzE,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GACV,QAAQ,CAAC,OAAO,KAAK,SAAS;QAC5B,CAAC,CAAC,MAAM,MAAM,CAAC,OAAO,CAAC,EAAE,GAAG,QAAQ,CAAC,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC;QACrE,CAAC,CAAC,MAAM,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,QAAQ,CAAC,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC;IACvE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,GAAG,yBAAyB,CAC1D,MAAM,EACN,QAAQ,CAAC,OAAO,CACjB,CAAC;IACF,MAAM,MAAM,GAAG,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;IACjD,MAAM,YAAY,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAChD,OAAO;QACL,EAAE,EAAE,QAAQ,CAAC,EAAE;QACf,OAAO,EAAE,QAAQ,CAAC,OAAO;QACzB,SAAS,EAAE,QAAQ,CAAC,SAAS;QAC7B,UAAU,EAAE,SAAS;QACrB,aAAa,EAAE,YAAY;QAC3B,OAAO,EAAE,sBAAsB,CAAC;YAC9B,UAAU,EAAE,SAAS;YACrB,SAAS,EAAE,QAAQ,CAAC,SAAS;YAC7B,YAAY,EAAE,QAAQ,CAAC,YAAY;YACnC,cAAc,EAAE,QAAQ,CAAC,cAAc;YACvC,aAAa,EAAE,YAAY;YAC3B,YAAY,EAAE,QAAQ,CAAC,YAAY;SACpC,CAAC;QACF,WAAW;KACZ,CAAC;AACJ,CAAC;AAED,wFAAwF;AACxF,MAAM,UAAU,iCAAiC,CAC/C,OAAmD,EACnD,UAAuC;IAEvC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,SAAS,CACjB,0DAA0D,CAC3D,CAAC;IACJ,CAAC;IACD,MAAM,OAAO,GAAG,+BAA+B,CAAC;IAChD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;YACzC,MAAM,IAAI,SAAS,CACjB,gCAAgC,MAAM,0BAA0B,CACjE,CAAC;QACJ,CAAC;IACH,CAAC;IACD,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAClC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QACtB,MAAM;QACN,qBAAqB,CACnB,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAClE,OAAO,CAAC,MAAM,CACjB;KACF,CAAC,CACuC,CAAC;IAC5C,MAAM,QAAQ,GAAG,OAAO;SACrB,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;SAC1D,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,GAAG,MAAM,IAAI,SAAS,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC3E,OAAO;QACL,cAAc,EAAE,OAAO,CAAC,MAAM;QAC9B,SAAS;QACT,SAAS,EAAE,CAAC,GAAG,OAAO,CAAC;QACvB,MAAM,EAAE,QAAQ,CAAC,MAAM,KAAK,CAAC;QAC7B,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,mFAAmF;AACnF,MAAM,CAAC,KAAK,UAAU,0BAA0B,CAC9C,SAA+C,EAC/C,MAA+B,EAC/B,UAAuC;IAEvC,MAAM,OAAO,GAAsC,EAAE,CAAC;IACtD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,OAAO,CAAC,IAAI,CAAC,MAAM,4BAA4B,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,iCAAiC,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AAChE,CAAC","debugId":"305d815a-a180-56bf-9a09-b7830e0c3970"}