wiki-graph-core 0.3.1 → 0.4.0

package/dist/gc.d.cts

@@ -1,5 +1,25 @@
-import { G as GcRunReport } from './types-FVIqiLC9.cjs';
-export { a as GcContext, b as GcJob, c as GcJobReport, d as GcJobResult } from './types-FVIqiLC9.cjs';
+interface GcContext {
+    readonly force: boolean;
+    readonly now: number;
+    readonly stateDirectoryPath: string;
+    readonly dryRun: boolean;
+}
+interface GcJobResult {
+    readonly scanned: number;
+    readonly removed: number;
+    readonly freedBytes: number;
+}
+interface GcJobReport extends GcJobResult {
+    readonly name: string;
+    readonly error?: string;
+}
+interface GcRunReport extends GcJobResult {
+    readonly jobs: readonly GcJobReport[];
+    readonly skipped: boolean;
+    readonly startedAt: number;
+    readonly finishedAt: number;
+}
+type GcJob = (context: GcContext) => Promise<GcJobResult>;
 
 declare function tryRunWikiGraphGc(options?: {
     readonly dryRun?: boolean;
@@ -7,4 +27,4 @@ declare function tryRunWikiGraphGc(options?: {
     readonly opportunistic?: boolean;
 }): Promise<GcRunReport>;
 
-export { GcRunReport, tryRunWikiGraphGc };
+export { type GcContext, type GcJob, type GcJobReport, type GcJobResult, type GcRunReport, tryRunWikiGraphGc };

package/dist/gc.d.ts

@@ -1,2 +1,2 @@
-export { tryRunWikiGraphGc } from './gc/runner.js';
-export { GcContext, GcJob, GcJobReport, GcJobResult, GcRunReport } from './gc/types.js';
+export { tryRunWikiGraphGc } from './runtime/gc/runner.js';
+export { GcContext, GcJob, GcJobReport, GcJobResult, GcRunReport } from './runtime/gc/types.js';

package/dist/gc.js

@@ -1,4 +1,4 @@
-import { tryRunWikiGraphGc } from "./gc/index.js";
+import { tryRunWikiGraphGc } from "./runtime/gc/index.js";
 export {
   tryRunWikiGraphGc
 };

package/dist/gc.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/gc.ts"],"sourcesContent":["export { tryRunWikiGraphGc } from \"./gc/index.js\";\nexport type {\n  GcContext,\n  GcJob,\n  GcJobReport,\n  GcJobResult,\n  GcRunReport,\n} from \"./gc/index.js\";\n"],"mappings":"AAAA,SAAS,yBAAyB;","names":[]}
+{"version":3,"sources":["../src/gc.ts"],"sourcesContent":["export { tryRunWikiGraphGc } from \"./runtime/gc/index.js\";\nexport type {\n  GcContext,\n  GcJob,\n  GcJobReport,\n  GcJobResult,\n  GcRunReport,\n} from \"./runtime/gc/index.js\";\n"],"mappings":"AAAA,SAAS,yBAAyB;","names":[]}

package/dist/graph/evidence-selection/anchor/index.d.ts

@@ -0,0 +1,4 @@
+export { EvidenceResolver } from './resolver/index.js';
+export { EvidenceResolutionFailure, EvidenceResolutionResult, RankedSentenceCandidate } from './types.js';
+import '../../../document/types.js';
+import './resolver/types.js';

package/dist/graph/evidence-selection/anchor/index.js

@@ -0,0 +1,3 @@
+export * from "./resolver/index.js";
+export * from "./types.js";
+//# sourceMappingURL=index.js.map

package/dist/graph/evidence-selection/anchor/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../src/graph/evidence-selection/anchor/index.ts"],"sourcesContent":["export * from \"./resolver/index.js\";\nexport * from \"./types.js\";\n"],"mappings":"AAAA,cAAc;AACd,cAAc;","names":[]}

package/dist/graph/evidence-selection/anchor/resolver/index.d.ts

@@ -0,0 +1,38 @@
+import { SentenceId } from '../../../../document/types.js';
+import { EvidenceResolutionResult, EvidenceResolutionFailure, RankedSentenceCandidate } from '../types.js';
+import { AnchorSpec } from './types.js';
+
+declare class EvidenceResolver {
+    #private;
+    resolve(evidence: Record<string, unknown>, candidateSentenceIds: readonly SentenceId[], candidateTexts: readonly string[]): readonly [
+        result: EvidenceResolutionResult | undefined,
+        failure: EvidenceResolutionFailure | undefined
+    ];
+    resolveWithOverrides(input: {
+        evidence: Record<string, unknown>;
+        candidateSentenceIds: readonly SentenceId[];
+        candidateTexts: readonly string[];
+        overrides: Partial<Readonly<Record<"start_anchor" | "end_anchor", RankedSentenceCandidate>>>;
+    }): readonly [
+        result: EvidenceResolutionResult | undefined,
+        failure: EvidenceResolutionFailure | undefined
+    ];
+    parseAnchor(value: unknown, fieldName: string): readonly [
+        anchor: AnchorSpec | undefined,
+        failure: EvidenceResolutionFailure | undefined
+    ];
+    resolveAnchor(input: {
+        anchor: AnchorSpec | undefined;
+        candidateSentenceIds: readonly SentenceId[];
+        candidateTexts: readonly string[];
+        label: string;
+        minIndex?: number;
+    }): readonly [
+        candidate: RankedSentenceCandidate | undefined,
+        strategy: string,
+        failure: EvidenceResolutionFailure | undefined
+    ];
+    rankAnchor(anchor: AnchorSpec, candidateSentenceIds: readonly SentenceId[], candidateTexts: readonly string[], label: string): RankedSentenceCandidate[];
+}
+
+export { EvidenceResolver };

package/dist/graph/evidence-selection/anchor/resolver/index.js

@@ -0,0 +1,418 @@
+import { scoreAnchor } from "./matcher.js";
+import { anchorLength, normalizeAnchor, parseRawAnchor } from "./parser.js";
+import { formatCandidate } from "./scoring.js";
+import {
+  MAX_CANDIDATE_DISPLAY,
+  MIN_AUTO_RESOLVE_GAP,
+  MIN_AUTO_RESOLVE_SCORE,
+  MIN_CANDIDATE_SCORE,
+  VERY_HIGH_CONFIDENCE_SCORE
+} from "./types.js";
+class EvidenceResolver {
+  resolve(evidence, candidateSentenceIds, candidateTexts) {
+    const startValue = evidence.start_anchor ?? evidence.start;
+    const endValue = evidence.end_anchor ?? evidence.end;
+    const [startAnchor, startFailure] = this.parseAnchor(
+      startValue,
+      "start_anchor"
+    );
+    if (startFailure !== void 0) {
+      return [void 0, startFailure];
+    }
+    let endAnchor;
+    if (endValue !== void 0) {
+      const [parsedEndAnchor, endFailure] = this.parseAnchor(
+        endValue,
+        "end_anchor"
+      );
+      if (endFailure !== void 0) {
+        return [void 0, endFailure];
+      }
+      endAnchor = parsedEndAnchor;
+    }
+    const [startCandidate, startStrategy, startResolveFailure] = this.resolveAnchor({
+      anchor: startAnchor,
+      candidateSentenceIds,
+      candidateTexts,
+      label: "start_anchor"
+    });
+    if (startResolveFailure !== void 0) {
+      return [void 0, startResolveFailure];
+    }
+    if (startCandidate === void 0) {
+      return [
+        void 0,
+        {
+          candidates: [],
+          code: "none",
+          fieldName: "start_anchor",
+          message: "start_anchor could not be matched: no candidate selected"
+        }
+      ];
+    }
+    if (endAnchor === void 0) {
+      return [
+        {
+          confidence: startCandidate.score,
+          sentenceIds: [startCandidate.sentenceId],
+          strategy: startStrategy
+        },
+        void 0
+      ];
+    }
+    const [endCandidate, endStrategy, endResolveFailure] = this.resolveAnchor({
+      anchor: endAnchor,
+      candidateSentenceIds,
+      candidateTexts,
+      label: "end_anchor",
+      minIndex: startCandidate.index
+    });
+    if (endResolveFailure !== void 0) {
+      return [void 0, endResolveFailure];
+    }
+    if (endCandidate === void 0) {
+      return [
+        void 0,
+        {
+          candidates: [],
+          code: "none",
+          fieldName: "end_anchor",
+          message: "end_anchor could not be matched: no candidate selected"
+        }
+      ];
+    }
+    if (endCandidate.index < startCandidate.index) {
+      return [
+        void 0,
+        {
+          candidates: [],
+          code: "invalid_range",
+          fieldName: "end_anchor",
+          message: `Invalid evidence range: end_anchor resolved before start_anchor (${startCandidate.occurrenceId} -> ${endCandidate.occurrenceId}).`
+        }
+      ];
+    }
+    return [
+      {
+        confidence: Math.min(startCandidate.score, endCandidate.score),
+        sentenceIds: candidateSentenceIds.slice(
+          startCandidate.index,
+          endCandidate.index + 1
+        ),
+        strategy: `${startStrategy}+${endStrategy}`
+      },
+      void 0
+    ];
+  }
+  resolveWithOverrides(input) {
+    const startValue = input.evidence.start_anchor ?? input.evidence.start;
+    const endValue = input.evidence.end_anchor ?? input.evidence.end;
+    const [startAnchor, startFailure] = this.parseAnchor(
+      startValue,
+      "start_anchor"
+    );
+    if (startFailure !== void 0) {
+      return [void 0, startFailure];
+    }
+    const startCandidateOverride = input.overrides.start_anchor;
+    const [startCandidate, startStrategy, startResolveFailure] = startCandidateOverride === void 0 ? this.resolveAnchor({
+      anchor: startAnchor,
+      candidateSentenceIds: input.candidateSentenceIds,
+      candidateTexts: input.candidateTexts,
+      label: "start_anchor"
+    }) : [startCandidateOverride, "choice_final", void 0];
+    if (startResolveFailure !== void 0) {
+      return [void 0, startResolveFailure];
+    }
+    if (startCandidate === void 0) {
+      return [
+        void 0,
+        {
+          candidates: [],
+          code: "none",
+          fieldName: "start_anchor",
+          message: "start_anchor could not be matched: no candidate selected"
+        }
+      ];
+    }
+    if (endValue === void 0) {
+      return [
+        {
+          confidence: startCandidate.score,
+          sentenceIds: [startCandidate.sentenceId],
+          strategy: startStrategy
+        },
+        void 0
+      ];
+    }
+    const [endAnchor, endFailure] = this.parseAnchor(endValue, "end_anchor");
+    if (endFailure !== void 0) {
+      return [void 0, endFailure];
+    }
+    const endCandidateOverride = input.overrides.end_anchor;
+    const [endCandidate, endStrategy, endResolveFailure] = endCandidateOverride === void 0 ? this.resolveAnchor({
+      anchor: endAnchor,
+      candidateSentenceIds: input.candidateSentenceIds,
+      candidateTexts: input.candidateTexts,
+      label: "end_anchor",
+      minIndex: startCandidate.index
+    }) : [endCandidateOverride, "choice_final", void 0];
+    if (endResolveFailure !== void 0) {
+      return [void 0, endResolveFailure];
+    }
+    if (endCandidate === void 0) {
+      return [
+        void 0,
+        {
+          candidates: [],
+          code: "none",
+          fieldName: "end_anchor",
+          message: "end_anchor could not be matched: no candidate selected"
+        }
+      ];
+    }
+    if (endCandidate.index < startCandidate.index) {
+      return [
+        void 0,
+        {
+          candidates: [],
+          code: "invalid_range",
+          fieldName: "end_anchor",
+          message: `Invalid evidence range: end_anchor resolved before start_anchor (${startCandidate.occurrenceId} -> ${endCandidate.occurrenceId}).`
+        }
+      ];
+    }
+    return [
+      {
+        confidence: Math.min(startCandidate.score, endCandidate.score),
+        sentenceIds: input.candidateSentenceIds.slice(
+          startCandidate.index,
+          endCandidate.index + 1
+        ),
+        strategy: `${startStrategy}+${endStrategy}`
+      },
+      void 0
+    ];
+  }
+  parseAnchor(value, fieldName) {
+    const [anchor, error] = parseRawAnchor(value);
+    if (error !== void 0) {
+      return [
+        void 0,
+        {
+          candidates: [],
+          code: "invalid_anchor",
+          fieldName,
+          message: `Invalid evidence.${fieldName}: ${error}`
+        }
+      ];
+    }
+    return [normalizeAnchor(anchor, fieldName), void 0];
+  }
+  resolveAnchor(input) {
+    if (input.anchor === void 0) {
+      return [
+        void 0,
+        "invalid",
+        {
+          candidates: [],
+          code: "invalid",
+          fieldName: input.label,
+          message: `${input.label} is missing`
+        }
+      ];
+    }
+    let candidates = this.rankAnchor(
+      input.anchor,
+      input.candidateSentenceIds,
+      input.candidateTexts,
+      input.label
+    );
+    const minIndex = input.minIndex;
+    if (minIndex !== void 0) {
+      candidates = candidates.filter(
+        (candidate) => candidate.index >= minIndex
+      );
+    }
+    if (candidates.length === 0) {
+      return [
+        void 0,
+        "none",
+        {
+          candidates: [],
+          code: "none",
+          fieldName: input.label,
+          message: `${input.label} could not be matched: no candidates available`
+        }
+      ];
+    }
+    const exactRaw = candidates.filter((candidate) => candidate.exactRaw);
+    if (exactRaw.length === 1) {
+      return [exactRaw[0], "exact_raw", void 0];
+    }
+    if (exactRaw.length > 1) {
+      return [
+        void 0,
+        "ambiguous_exact_raw",
+        this.#buildAmbiguousFailure(
+          input.label,
+          "ambiguous_exact_raw",
+          exactRaw
+        )
+      ];
+    }
+    const exactSubstring = candidates.filter(
+      (candidate) => candidate.exactSubstring
+    );
+    if (exactSubstring.length === 1 && anchorLength(input.anchor) >= 8) {
+      return [exactSubstring[0], "exact_substring", void 0];
+    }
+    if (exactSubstring.length > 1 && anchorLength(input.anchor) >= 8) {
+      const selected = this.#tryAutoSelectScoredDuplicates(exactSubstring);
+      if (selected !== void 0) {
+        return [selected, "exact_substring_scored", void 0];
+      }
+      return [
+        void 0,
+        "ambiguous_exact_substring",
+        this.#buildAmbiguousFailure(
+          input.label,
+          "ambiguous_exact_substring",
+          exactSubstring
+        )
+      ];
+    }
+    const exactNormalized = candidates.filter(
+      (candidate) => candidate.exactNormalized
+    );
+    if (exactNormalized.length === 1) {
+      return [exactNormalized[0], "exact_normalized", void 0];
+    }
+    if (exactNormalized.length > 1) {
+      const selected = this.#tryAutoSelectScoredDuplicates(exactNormalized);
+      if (selected !== void 0) {
+        return [selected, "exact_normalized_scored", void 0];
+      }
+      return [
+        void 0,
+        "ambiguous_exact_normalized",
+        this.#buildAmbiguousFailure(
+          input.label,
+          "ambiguous_exact_normalized",
+          exactNormalized
+        )
+      ];
+    }
+    const topCandidate = candidates[0];
+    if (topCandidate === void 0) {
+      return [
+        void 0,
+        "none",
+        {
+          candidates: [],
+          code: "none",
+          fieldName: input.label,
+          message: `${input.label} could not be matched: no candidates available`
+        }
+      ];
+    }
+    const secondScore = candidates[1]?.score ?? 0;
+    const gap = topCandidate.score - secondScore;
+    if (topCandidate.score < MIN_CANDIDATE_SCORE) {
+      return [
+        void 0,
+        "low_confidence",
+        {
+          candidates: candidates.slice(0, MAX_CANDIDATE_DISPLAY),
+          code: "low_confidence",
+          fieldName: input.label,
+          message: `${input.label} could not be matched confidently. Best candidate score=${topCandidate.score.toFixed(3)}.`
+        }
+      ];
+    }
+    if (candidates.length === 1) {
+      return [topCandidate, "auto_top1_single_candidate", void 0];
+    }
+    if (topCandidate.score >= VERY_HIGH_CONFIDENCE_SCORE) {
+      return [topCandidate, "auto_top1_very_high", void 0];
+    }
+    if (topCandidate.score >= MIN_AUTO_RESOLVE_SCORE && gap >= MIN_AUTO_RESOLVE_GAP) {
+      return [topCandidate, "auto_top1", void 0];
+    }
+    return [
+      void 0,
+      "ambiguous_ranked",
+      this.#buildAmbiguousFailure(input.label, "ambiguous_ranked", candidates)
+    ];
+  }
+  rankAnchor(anchor, candidateSentenceIds, candidateTexts, label) {
+    const ranked = [];
+    for (const [index, sentenceId] of candidateSentenceIds.entries()) {
+      const text = candidateTexts[index] ?? "";
+      const prevText = index > 0 ? candidateTexts[index - 1] ?? "" : "";
+      const nextText = index < candidateTexts.length - 1 ? candidateTexts[index + 1] ?? "" : "";
+      const match = scoreAnchor(anchor, text, label);
+      ranked.push({
+        exactNormalized: match.exactNormalized,
+        exactRaw: match.exactRaw,
+        exactSubstring: match.exactSubstring,
+        index,
+        nextText,
+        occurrenceId: `S${index + 1}`,
+        prevText,
+        score: match.score,
+        sentenceId,
+        text
+      });
+    }
+    ranked.sort((left, right) => {
+      if (left.score !== right.score) {
+        return right.score - left.score;
+      }
+      if (left.exactRaw !== right.exactRaw) {
+        return left.exactRaw ? -1 : 1;
+      }
+      if (left.exactSubstring !== right.exactSubstring) {
+        return left.exactSubstring ? -1 : 1;
+      }
+      if (left.exactNormalized !== right.exactNormalized) {
+        return left.exactNormalized ? -1 : 1;
+      }
+      return left.index - right.index;
+    });
+    return ranked;
+  }
+  #tryAutoSelectScoredDuplicates(candidates) {
+    if (candidates.length === 0) {
+      return void 0;
+    }
+    if (candidates.length === 1) {
+      return candidates[0];
+    }
+    const topCandidate = candidates[0];
+    if (topCandidate === void 0) {
+      return void 0;
+    }
+    const secondScore = candidates[1]?.score ?? 0;
+    if (topCandidate.score >= MIN_AUTO_RESOLVE_SCORE && topCandidate.score - secondScore >= MIN_AUTO_RESOLVE_GAP) {
+      return topCandidate;
+    }
+    return void 0;
+  }
+  #buildAmbiguousFailure(label, code, candidates) {
+    const topCandidates = candidates.slice(0, MAX_CANDIDATE_DISPLAY);
+    const formatted = topCandidates.map((candidate) => formatCandidate(candidate)).join("\n");
+    return {
+      candidates: topCandidates,
+      code,
+      fieldName: label,
+      message: `${label} is ambiguous. Top candidates:
+${formatted}
+Please provide a more specific anchor or surrounding context.`
+    };
+  }
+}
+export {
+  EvidenceResolver
+};
+//# sourceMappingURL=index.js.map

package/dist/graph/evidence-selection/anchor/resolver/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../src/graph/evidence-selection/anchor/resolver/index.ts"],"sourcesContent":["import type { SentenceId } from \"../../../../document/index.js\";\nimport type {\n  EvidenceResolutionFailure,\n  EvidenceResolutionResult,\n  RankedSentenceCandidate,\n} from \"../types.js\";\nimport { scoreAnchor } from \"./matcher.js\";\nimport { anchorLength, normalizeAnchor, parseRawAnchor } from \"./parser.js\";\nimport { formatCandidate } from \"./scoring.js\";\nimport {\n  MAX_CANDIDATE_DISPLAY,\n  MIN_AUTO_RESOLVE_GAP,\n  MIN_AUTO_RESOLVE_SCORE,\n  MIN_CANDIDATE_SCORE,\n  VERY_HIGH_CONFIDENCE_SCORE,\n} from \"./types.js\";\nimport type { AnchorSpec } from \"./types.js\";\n\nexport class EvidenceResolver {\n  public resolve(\n    evidence: Record<string, unknown>,\n    candidateSentenceIds: readonly SentenceId[],\n    candidateTexts: readonly string[],\n  ): readonly [\n    result: EvidenceResolutionResult | undefined,\n    failure: EvidenceResolutionFailure | undefined,\n  ] {\n    const startValue = evidence.start_anchor ?? evidence.start;\n    const endValue = evidence.end_anchor ?? evidence.end;\n\n    const [startAnchor, startFailure] = this.parseAnchor(\n      startValue,\n      \"start_anchor\",\n    );\n\n    if (startFailure !== undefined) {\n      return [undefined, startFailure];\n    }\n\n    let endAnchor: AnchorSpec | undefined;\n\n    if (endValue !== undefined) {\n      const [parsedEndAnchor, endFailure] = this.parseAnchor(\n        endValue,\n        \"end_anchor\",\n      );\n\n      if (endFailure !== undefined) {\n        return [undefined, endFailure];\n      }\n\n      endAnchor = parsedEndAnchor;\n    }\n\n    const [startCandidate, startStrategy, startResolveFailure] =\n      this.resolveAnchor({\n        anchor: startAnchor,\n        candidateSentenceIds,\n        candidateTexts,\n        label: \"start_anchor\",\n      });\n\n    if (startResolveFailure !== undefined) {\n      return [undefined, startResolveFailure];\n    }\n\n    if (startCandidate === undefined) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"none\",\n          fieldName: \"start_anchor\",\n          message: \"start_anchor could not be matched: no candidate selected\",\n        },\n      ];\n    }\n\n    if (endAnchor === undefined) {\n      return [\n        {\n          confidence: startCandidate.score,\n          sentenceIds: [startCandidate.sentenceId],\n          strategy: startStrategy,\n        },\n        undefined,\n      ];\n    }\n\n    const [endCandidate, endStrategy, endResolveFailure] = this.resolveAnchor({\n      anchor: endAnchor,\n      candidateSentenceIds,\n      candidateTexts,\n      label: \"end_anchor\",\n      minIndex: startCandidate.index,\n    });\n\n    if (endResolveFailure !== undefined) {\n      return [undefined, endResolveFailure];\n    }\n\n    if (endCandidate === undefined) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"none\",\n          fieldName: \"end_anchor\",\n          message: \"end_anchor could not be matched: no candidate selected\",\n        },\n      ];\n    }\n\n    if (endCandidate.index < startCandidate.index) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"invalid_range\",\n          fieldName: \"end_anchor\",\n          message:\n            \"Invalid evidence range: end_anchor resolved before start_anchor \" +\n            `(${startCandidate.occurrenceId} -> ${endCandidate.occurrenceId}).`,\n        },\n      ];\n    }\n\n    return [\n      {\n        confidence: Math.min(startCandidate.score, endCandidate.score),\n        sentenceIds: candidateSentenceIds.slice(\n          startCandidate.index,\n          endCandidate.index + 1,\n        ),\n        strategy: `${startStrategy}+${endStrategy}`,\n      },\n      undefined,\n    ];\n  }\n\n  public resolveWithOverrides(input: {\n    evidence: Record<string, unknown>;\n    candidateSentenceIds: readonly SentenceId[];\n    candidateTexts: readonly string[];\n    overrides: Partial<\n      Readonly<Record<\"start_anchor\" | \"end_anchor\", RankedSentenceCandidate>>\n    >;\n  }): readonly [\n    result: EvidenceResolutionResult | undefined,\n    failure: EvidenceResolutionFailure | undefined,\n  ] {\n    const startValue = input.evidence.start_anchor ?? input.evidence.start;\n    const endValue = input.evidence.end_anchor ?? input.evidence.end;\n\n    const [startAnchor, startFailure] = this.parseAnchor(\n      startValue,\n      \"start_anchor\",\n    );\n\n    if (startFailure !== undefined) {\n      return [undefined, startFailure];\n    }\n\n    const startCandidateOverride = input.overrides.start_anchor;\n    const [startCandidate, startStrategy, startResolveFailure] =\n      startCandidateOverride === undefined\n        ? this.resolveAnchor({\n            anchor: startAnchor,\n            candidateSentenceIds: input.candidateSentenceIds,\n            candidateTexts: input.candidateTexts,\n            label: \"start_anchor\",\n          })\n        : [startCandidateOverride, \"choice_final\", undefined];\n\n    if (startResolveFailure !== undefined) {\n      return [undefined, startResolveFailure];\n    }\n\n    if (startCandidate === undefined) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"none\",\n          fieldName: \"start_anchor\",\n          message: \"start_anchor could not be matched: no candidate selected\",\n        },\n      ];\n    }\n\n    if (endValue === undefined) {\n      return [\n        {\n          confidence: startCandidate.score,\n          sentenceIds: [startCandidate.sentenceId],\n          strategy: startStrategy,\n        },\n        undefined,\n      ];\n    }\n\n    const [endAnchor, endFailure] = this.parseAnchor(endValue, \"end_anchor\");\n\n    if (endFailure !== undefined) {\n      return [undefined, endFailure];\n    }\n\n    const endCandidateOverride = input.overrides.end_anchor;\n    const [endCandidate, endStrategy, endResolveFailure] =\n      endCandidateOverride === undefined\n        ? this.resolveAnchor({\n            anchor: endAnchor,\n            candidateSentenceIds: input.candidateSentenceIds,\n            candidateTexts: input.candidateTexts,\n            label: \"end_anchor\",\n            minIndex: startCandidate.index,\n          })\n        : [endCandidateOverride, \"choice_final\", undefined];\n\n    if (endResolveFailure !== undefined) {\n      return [undefined, endResolveFailure];\n    }\n\n    if (endCandidate === undefined) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"none\",\n          fieldName: \"end_anchor\",\n          message: \"end_anchor could not be matched: no candidate selected\",\n        },\n      ];\n    }\n\n    if (endCandidate.index < startCandidate.index) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"invalid_range\",\n          fieldName: \"end_anchor\",\n          message:\n            \"Invalid evidence range: end_anchor resolved before start_anchor \" +\n            `(${startCandidate.occurrenceId} -> ${endCandidate.occurrenceId}).`,\n        },\n      ];\n    }\n\n    return [\n      {\n        confidence: Math.min(startCandidate.score, endCandidate.score),\n        sentenceIds: input.candidateSentenceIds.slice(\n          startCandidate.index,\n          endCandidate.index + 1,\n        ),\n        strategy: `${startStrategy}+${endStrategy}`,\n      },\n      undefined,\n    ];\n  }\n\n  public parseAnchor(\n    value: unknown,\n    fieldName: string,\n  ): readonly [\n    anchor: AnchorSpec | undefined,\n    failure: EvidenceResolutionFailure | undefined,\n  ] {\n    const [anchor, error] = parseRawAnchor(value);\n\n    if (error !== undefined) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"invalid_anchor\",\n          fieldName,\n          message: `Invalid evidence.${fieldName}: ${error}`,\n        },\n      ];\n    }\n\n    return [normalizeAnchor(anchor, fieldName), undefined];\n  }\n\n  public resolveAnchor(input: {\n    anchor: AnchorSpec | undefined;\n    candidateSentenceIds: readonly SentenceId[];\n    candidateTexts: readonly string[];\n    label: string;\n    minIndex?: number;\n  }): readonly [\n    candidate: RankedSentenceCandidate | undefined,\n    strategy: string,\n    failure: EvidenceResolutionFailure | undefined,\n  ] {\n    if (input.anchor === undefined) {\n      return [\n        undefined,\n        \"invalid\",\n        {\n          candidates: [],\n          code: \"invalid\",\n          fieldName: input.label,\n          message: `${input.label} is missing`,\n        },\n      ];\n    }\n\n    let candidates = this.rankAnchor(\n      input.anchor,\n      input.candidateSentenceIds,\n      input.candidateTexts,\n      input.label,\n    );\n\n    const minIndex = input.minIndex;\n\n    if (minIndex !== undefined) {\n      candidates = candidates.filter(\n        (candidate) => candidate.index >= minIndex,\n      );\n    }\n\n    if (candidates.length === 0) {\n      return [\n        undefined,\n        \"none\",\n        {\n          candidates: [],\n          code: \"none\",\n          fieldName: input.label,\n          message: `${input.label} could not be matched: no candidates available`,\n        },\n      ];\n    }\n\n    const exactRaw = candidates.filter((candidate) => candidate.exactRaw);\n\n    if (exactRaw.length === 1) {\n      return [exactRaw[0], \"exact_raw\", undefined];\n    }\n\n    if (exactRaw.length > 1) {\n      return [\n        undefined,\n        \"ambiguous_exact_raw\",\n        this.#buildAmbiguousFailure(\n          input.label,\n          \"ambiguous_exact_raw\",\n          exactRaw,\n        ),\n      ];\n    }\n\n    const exactSubstring = candidates.filter(\n      (candidate) => candidate.exactSubstring,\n    );\n\n    if (exactSubstring.length === 1 && anchorLength(input.anchor) >= 8) {\n      return [exactSubstring[0], \"exact_substring\", undefined];\n    }\n\n    if (exactSubstring.length > 1 && anchorLength(input.anchor) >= 8) {\n      const selected = this.#tryAutoSelectScoredDuplicates(exactSubstring);\n\n      if (selected !== undefined) {\n        return [selected, \"exact_substring_scored\", undefined];\n      }\n\n      return [\n        undefined,\n        \"ambiguous_exact_substring\",\n        this.#buildAmbiguousFailure(\n          input.label,\n          \"ambiguous_exact_substring\",\n          exactSubstring,\n        ),\n      ];\n    }\n\n    const exactNormalized = candidates.filter(\n      (candidate) => candidate.exactNormalized,\n    );\n\n    if (exactNormalized.length === 1) {\n      return [exactNormalized[0], \"exact_normalized\", undefined];\n    }\n\n    if (exactNormalized.length > 1) {\n      const selected = this.#tryAutoSelectScoredDuplicates(exactNormalized);\n\n      if (selected !== undefined) {\n        return [selected, \"exact_normalized_scored\", undefined];\n      }\n\n      return [\n        undefined,\n        \"ambiguous_exact_normalized\",\n        this.#buildAmbiguousFailure(\n          input.label,\n          \"ambiguous_exact_normalized\",\n          exactNormalized,\n        ),\n      ];\n    }\n\n    const topCandidate = candidates[0];\n\n    if (topCandidate === undefined) {\n      return [\n        undefined,\n        \"none\",\n        {\n          candidates: [],\n          code: \"none\",\n          fieldName: input.label,\n          message: `${input.label} could not be matched: no candidates available`,\n        },\n      ];\n    }\n\n    const secondScore = candidates[1]?.score ?? 0;\n    const gap = topCandidate.score - secondScore;\n\n    if (topCandidate.score < MIN_CANDIDATE_SCORE) {\n      return [\n        undefined,\n        \"low_confidence\",\n        {\n          candidates: candidates.slice(0, MAX_CANDIDATE_DISPLAY),\n          code: \"low_confidence\",\n          fieldName: input.label,\n          message:\n            `${input.label} could not be matched confidently. ` +\n            `Best candidate score=${topCandidate.score.toFixed(3)}.`,\n        },\n      ];\n    }\n\n    if (candidates.length === 1) {\n      return [topCandidate, \"auto_top1_single_candidate\", undefined];\n    }\n\n    if (topCandidate.score >= VERY_HIGH_CONFIDENCE_SCORE) {\n      return [topCandidate, \"auto_top1_very_high\", undefined];\n    }\n\n    if (\n      topCandidate.score >= MIN_AUTO_RESOLVE_SCORE &&\n      gap >= MIN_AUTO_RESOLVE_GAP\n    ) {\n      return [topCandidate, \"auto_top1\", undefined];\n    }\n\n    return [\n      undefined,\n      \"ambiguous_ranked\",\n      this.#buildAmbiguousFailure(input.label, \"ambiguous_ranked\", candidates),\n    ];\n  }\n\n  public rankAnchor(\n    anchor: AnchorSpec,\n    candidateSentenceIds: readonly SentenceId[],\n    candidateTexts: readonly string[],\n    label: string,\n  ): RankedSentenceCandidate[] {\n    const ranked: RankedSentenceCandidate[] = [];\n\n    for (const [index, sentenceId] of candidateSentenceIds.entries()) {\n      const text = candidateTexts[index] ?? \"\";\n      const prevText = index > 0 ? (candidateTexts[index - 1] ?? \"\") : \"\";\n      const nextText =\n        index < candidateTexts.length - 1\n          ? (candidateTexts[index + 1] ?? \"\")\n          : \"\";\n      const match = scoreAnchor(anchor, text, label);\n\n      ranked.push({\n        exactNormalized: match.exactNormalized,\n        exactRaw: match.exactRaw,\n        exactSubstring: match.exactSubstring,\n        index,\n        nextText,\n        occurrenceId: `S${index + 1}`,\n        prevText,\n        score: match.score,\n        sentenceId,\n        text,\n      });\n    }\n\n    ranked.sort((left, right) => {\n      if (left.score !== right.score) {\n        return right.score - left.score;\n      }\n\n      if (left.exactRaw !== right.exactRaw) {\n        return left.exactRaw ? -1 : 1;\n      }\n\n      if (left.exactSubstring !== right.exactSubstring) {\n        return left.exactSubstring ? -1 : 1;\n      }\n\n      if (left.exactNormalized !== right.exactNormalized) {\n        return left.exactNormalized ? -1 : 1;\n      }\n\n      return left.index - right.index;\n    });\n\n    return ranked;\n  }\n\n  #tryAutoSelectScoredDuplicates(\n    candidates: readonly RankedSentenceCandidate[],\n  ): RankedSentenceCandidate | undefined {\n    if (candidates.length === 0) {\n      return undefined;\n    }\n\n    if (candidates.length === 1) {\n      return candidates[0];\n    }\n\n    const topCandidate = candidates[0];\n\n    if (topCandidate === undefined) {\n      return undefined;\n    }\n\n    const secondScore = candidates[1]?.score ?? 0;\n\n    if (\n      topCandidate.score >= MIN_AUTO_RESOLVE_SCORE &&\n      topCandidate.score - secondScore >= MIN_AUTO_RESOLVE_GAP\n    ) {\n      return topCandidate;\n    }\n\n    return undefined;\n  }\n\n  #buildAmbiguousFailure(\n    label: string,\n    code: string,\n    candidates: readonly RankedSentenceCandidate[],\n  ): EvidenceResolutionFailure {\n    const topCandidates = candidates.slice(0, MAX_CANDIDATE_DISPLAY);\n    const formatted = topCandidates\n      .map((candidate) => formatCandidate(candidate))\n      .join(\"\\n\");\n\n    return {\n      candidates: topCandidates,\n      code,\n      fieldName: label,\n      message:\n        `${label} is ambiguous. Top candidates:\\n${formatted}\\n` +\n        \"Please provide a more specific anchor or surrounding context.\",\n    };\n  }\n}\n"],"mappings":"AAMA,SAAS,mBAAmB;AAC5B,SAAS,cAAc,iBAAiB,sBAAsB;AAC9D,SAAS,uBAAuB;AAChC;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAGA,MAAM,iBAAiB;AAAA,EACrB,QACL,UACA,sBACA,gBAIA;AACA,UAAM,aAAa,SAAS,gBAAgB,SAAS;AACrD,UAAM,WAAW,SAAS,cAAc,SAAS;AAEjD,UAAM,CAAC,aAAa,YAAY,IAAI,KAAK;AAAA,MACvC;AAAA,MACA;AAAA,IACF;AAEA,QAAI,iBAAiB,QAAW;AAC9B,aAAO,CAAC,QAAW,YAAY;AAAA,IACjC;AAEA,QAAI;AAEJ,QAAI,aAAa,QAAW;AAC1B,YAAM,CAAC,iBAAiB,UAAU,IAAI,KAAK;AAAA,QACzC;AAAA,QACA;AAAA,MACF;AAEA,UAAI,eAAe,QAAW;AAC5B,eAAO,CAAC,QAAW,UAAU;AAAA,MAC/B;AAEA,kBAAY;AAAA,IACd;AAEA,UAAM,CAAC,gBAAgB,eAAe,mBAAmB,IACvD,KAAK,cAAc;AAAA,MACjB,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA,OAAO;AAAA,IACT,CAAC;AAEH,QAAI,wBAAwB,QAAW;AACrC,aAAO,CAAC,QAAW,mBAAmB;AAAA,IACxC;AAEA,QAAI,mBAAmB,QAAW;AAChC,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AAEA,QAAI,cAAc,QAAW;AAC3B,aAAO;AAAA,QACL;AAAA,UACE,YAAY,eAAe;AAAA,UAC3B,aAAa,CAAC,eAAe,UAAU;AAAA,UACvC,UAAU;AAAA,QACZ;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAEA,UAAM,CAAC,cAAc,aAAa,iBAAiB,IAAI,KAAK,cAAc;AAAA,MACxE,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA,OAAO;AAAA,MACP,UAAU,eAAe;AAAA,IAC3B,CAAC;AAED,QAAI,sBAAsB,QAAW;AACnC,aAAO,CAAC,QAAW,iBAAiB;AAAA,IACtC;AAEA,QAAI,iBAAiB,QAAW;AAC9B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AAEA,QAAI,aAAa,QAAQ,eAAe,OAAO;AAC7C,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SACE,oEACI,eAAe,YAAY,OAAO,aAAa,YAAY;AAAA,QACnE;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,QACE,YAAY,KAAK,IAAI,eAAe,OAAO,aAAa,KAAK;AAAA,QAC7D,aAAa,qBAAqB;AAAA,UAChC,eAAe;AAAA,UACf,aAAa,QAAQ;AAAA,QACvB;AAAA,QACA,UAAU,GAAG,aAAa,IAAI,WAAW;AAAA,MAC3C;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA,EAEO,qBAAqB,OAU1B;AACA,UAAM,aAAa,MAAM,SAAS,gBAAgB,MAAM,SAAS;AACjE,UAAM,WAAW,MAAM,SAAS,cAAc,MAAM,SAAS;AAE7D,UAAM,CAAC,aAAa,YAAY,IAAI,KAAK;AAAA,MACvC;AAAA,MACA;AAAA,IACF;AAEA,QAAI,iBAAiB,QAAW;AAC9B,aAAO,CAAC,QAAW,YAAY;AAAA,IACjC;AAEA,UAAM,yBAAyB,MAAM,UAAU;AAC/C,UAAM,CAAC,gBAAgB,eAAe,mBAAmB,IACvD,2BAA2B,SACvB,KAAK,cAAc;AAAA,MACjB,QAAQ;AAAA,MACR,sBAAsB,MAAM;AAAA,MAC5B,gBAAgB,MAAM;AAAA,MACtB,OAAO;AAAA,IACT,CAAC,IACD,CAAC,wBAAwB,gBAAgB,MAAS;AAExD,QAAI,wBAAwB,QAAW;AACrC,aAAO,CAAC,QAAW,mBAAmB;AAAA,IACxC;AAEA,QAAI,mBAAmB,QAAW;AAChC,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AAEA,QAAI,aAAa,QAAW;AAC1B,aAAO;AAAA,QACL;AAAA,UACE,YAAY,eAAe;AAAA,UAC3B,aAAa,CAAC,eAAe,UAAU;AAAA,UACvC,UAAU;AAAA,QACZ;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAEA,UAAM,CAAC,WAAW,UAAU,IAAI,KAAK,YAAY,UAAU,YAAY;AAEvE,QAAI,eAAe,QAAW;AAC5B,aAAO,CAAC,QAAW,UAAU;AAAA,IAC/B;AAEA,UAAM,uBAAuB,MAAM,UAAU;AAC7C,UAAM,CAAC,cAAc,aAAa,iBAAiB,IACjD,yBAAyB,SACrB,KAAK,cAAc;AAAA,MACjB,QAAQ;AAAA,MACR,sBAAsB,MAAM;AAAA,MAC5B,gBAAgB,MAAM;AAAA,MACtB,OAAO;AAAA,MACP,UAAU,eAAe;AAAA,IAC3B,CAAC,IACD,CAAC,sBAAsB,gBAAgB,MAAS;AAEtD,QAAI,sBAAsB,QAAW;AACnC,aAAO,CAAC,QAAW,iBAAiB;AAAA,IACtC;AAEA,QAAI,iBAAiB,QAAW;AAC9B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AAEA,QAAI,aAAa,QAAQ,eAAe,OAAO;AAC7C,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SACE,oEACI,eAAe,YAAY,OAAO,aAAa,YAAY;AAAA,QACnE;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,QACE,YAAY,KAAK,IAAI,eAAe,OAAO,aAAa,KAAK;AAAA,QAC7D,aAAa,MAAM,qBAAqB;AAAA,UACtC,eAAe;AAAA,UACf,aAAa,QAAQ;AAAA,QACvB;AAAA,QACA,UAAU,GAAG,aAAa,IAAI,WAAW;AAAA,MAC3C;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA,EAEO,YACL,OACA,WAIA;AACA,UAAM,CAAC,QAAQ,KAAK,IAAI,eAAe,KAAK;AAE5C,QAAI,UAAU,QAAW;AACvB,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN;AAAA,UACA,SAAS,oBAAoB,SAAS,KAAK,KAAK;AAAA,QAClD;AAAA,MACF;AAAA,IACF;AAEA,WAAO,CAAC,gBAAgB,QAAQ,SAAS,GAAG,MAAS;AAAA,EACvD;AAAA,EAEO,cAAc,OAUnB;AACA,QAAI,MAAM,WAAW,QAAW;AAC9B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW,MAAM;AAAA,UACjB,SAAS,GAAG,MAAM,KAAK;AAAA,QACzB;AAAA,MACF;AAAA,IACF;AAEA,QAAI,aAAa,KAAK;AAAA,MACpB,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAEA,UAAM,WAAW,MAAM;AAEvB,QAAI,aAAa,QAAW;AAC1B,mBAAa,WAAW;AAAA,QACtB,CAAC,cAAc,UAAU,SAAS;AAAA,MACpC;AAAA,IACF;AAEA,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW,MAAM;AAAA,UACjB,SAAS,GAAG,MAAM,KAAK;AAAA,QACzB;AAAA,MACF;AAAA,IACF;AAEA,UAAM,WAAW,WAAW,OAAO,CAAC,cAAc,UAAU,QAAQ;AAEpE,QAAI,SAAS,WAAW,GAAG;AACzB,aAAO,CAAC,SAAS,CAAC,GAAG,aAAa,MAAS;AAAA,IAC7C;AAEA,QAAI,SAAS,SAAS,GAAG;AACvB,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,KAAK;AAAA,UACH,MAAM;AAAA,UACN;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,UAAM,iBAAiB,WAAW;AAAA,MAChC,CAAC,cAAc,UAAU;AAAA,IAC3B;AAEA,QAAI,eAAe,WAAW,KAAK,aAAa,MAAM,MAAM,KAAK,GAAG;AAClE,aAAO,CAAC,eAAe,CAAC,GAAG,mBAAmB,MAAS;AAAA,IACzD;AAEA,QAAI,eAAe,SAAS,KAAK,aAAa,MAAM,MAAM,KAAK,GAAG;AAChE,YAAM,WAAW,KAAK,+BAA+B,cAAc;AAEnE,UAAI,aAAa,QAAW;AAC1B,eAAO,CAAC,UAAU,0BAA0B,MAAS;AAAA,MACvD;AAEA,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,KAAK;AAAA,UACH,MAAM;AAAA,UACN;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,UAAM,kBAAkB,WAAW;AAAA,MACjC,CAAC,cAAc,UAAU;AAAA,IAC3B;AAEA,QAAI,gBAAgB,WAAW,GAAG;AAChC,aAAO,CAAC,gBAAgB,CAAC,GAAG,oBAAoB,MAAS;AAAA,IAC3D;AAEA,QAAI,gBAAgB,SAAS,GAAG;AAC9B,YAAM,WAAW,KAAK,+BAA+B,eAAe;AAEpE,UAAI,aAAa,QAAW;AAC1B,eAAO,CAAC,UAAU,2BAA2B,MAAS;AAAA,MACxD;AAEA,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,KAAK;AAAA,UACH,MAAM;AAAA,UACN;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,UAAM,eAAe,WAAW,CAAC;AAEjC,QAAI,iBAAiB,QAAW;AAC9B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW,MAAM;AAAA,UACjB,SAAS,GAAG,MAAM,KAAK;AAAA,QACzB;AAAA,MACF;AAAA,IACF;AAEA,UAAM,cAAc,WAAW,CAAC,GAAG,SAAS;AAC5C,UAAM,MAAM,aAAa,QAAQ;AAEjC,QAAI,aAAa,QAAQ,qBAAqB;AAC5C,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,UACE,YAAY,WAAW,MAAM,GAAG,qBAAqB;AAAA,UACrD,MAAM;AAAA,UACN,WAAW,MAAM;AAAA,UACjB,SACE,GAAG,MAAM,KAAK,2DACU,aAAa,MAAM,QAAQ,CAAC,CAAC;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAEA,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO,CAAC,cAAc,8BAA8B,MAAS;AAAA,IAC/D;AAEA,QAAI,aAAa,SAAS,4BAA4B;AACpD,aAAO,CAAC,cAAc,uBAAuB,MAAS;AAAA,IACxD;AAEA,QACE,aAAa,SAAS,0BACtB,OAAO,sBACP;AACA,aAAO,CAAC,cAAc,aAAa,MAAS;AAAA,IAC9C;AAEA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,KAAK,uBAAuB,MAAM,OAAO,oBAAoB,UAAU;AAAA,IACzE;AAAA,EACF;AAAA,EAEO,WACL,QACA,sBACA,gBACA,OAC2B;AAC3B,UAAM,SAAoC,CAAC;AAE3C,eAAW,CAAC,OAAO,UAAU,KAAK,qBAAqB,QAAQ,GAAG;AAChE,YAAM,OAAO,eAAe,KAAK,KAAK;AACtC,YAAM,WAAW,QAAQ,IAAK,eAAe,QAAQ,CAAC,KAAK,KAAM;AACjE,YAAM,WACJ,QAAQ,eAAe,SAAS,IAC3B,eAAe,QAAQ,CAAC,KAAK,KAC9B;AACN,YAAM,QAAQ,YAAY,QAAQ,MAAM,KAAK;AAE7C,aAAO,KAAK;AAAA,QACV,iBAAiB,MAAM;AAAA,QACvB,UAAU,MAAM;AAAA,QAChB,gBAAgB,MAAM;AAAA,QACtB;AAAA,QACA;AAAA,QACA,cAAc,IAAI,QAAQ,CAAC;AAAA,QAC3B;AAAA,QACA,OAAO,MAAM;AAAA,QACb;AAAA,QACA;AAAA,MACF,CAAC;AAAA,IACH;AAEA,WAAO,KAAK,CAAC,MAAM,UAAU;AAC3B,UAAI,KAAK,UAAU,MAAM,OAAO;AAC9B,eAAO,MAAM,QAAQ,KAAK;AAAA,MAC5B;AAEA,UAAI,KAAK,aAAa,MAAM,UAAU;AACpC,eAAO,KAAK,WAAW,KAAK;AAAA,MAC9B;AAEA,UAAI,KAAK,mBAAmB,MAAM,gBAAgB;AAChD,eAAO,KAAK,iBAAiB,KAAK;AAAA,MACpC;AAEA,UAAI,KAAK,oBAAoB,MAAM,iBAAiB;AAClD,eAAO,KAAK,kBAAkB,KAAK;AAAA,MACrC;AAEA,aAAO,KAAK,QAAQ,MAAM;AAAA,IAC5B,CAAC;AAED,WAAO;AAAA,EACT;AAAA,EAEA,+BACE,YACqC;AACrC,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO;AAAA,IACT;AAEA,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO,WAAW,CAAC;AAAA,IACrB;AAEA,UAAM,eAAe,WAAW,CAAC;AAEjC,QAAI,iBAAiB,QAAW;AAC9B,aAAO;AAAA,IACT;AAEA,UAAM,cAAc,WAAW,CAAC,GAAG,SAAS;AAE5C,QACE,aAAa,SAAS,0BACtB,aAAa,QAAQ,eAAe,sBACpC;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,uBACE,OACA,MACA,YAC2B;AAC3B,UAAM,gBAAgB,WAAW,MAAM,GAAG,qBAAqB;AAC/D,UAAM,YAAY,cACf,IAAI,CAAC,cAAc,gBAAgB,SAAS,CAAC,EAC7C,KAAK,IAAI;AAEZ,WAAO;AAAA,MACL,YAAY;AAAA,MACZ;AAAA,MACA,WAAW;AAAA,MACX,SACE,GAAG,KAAK;AAAA,EAAmC,SAAS;AAAA;AAAA,IAExD;AAAA,EACF;AACF;","names":[]}

package/dist/graph/evidence-selection/anchor/resolver/matcher.d.ts

@@ -0,0 +1,8 @@
+import { TextMatchScore } from './scoring.js';
+import { AnchorSpec } from './types.js';
+import '../types.js';
+import '../../../../document/types.js';
+
+declare function scoreAnchor(anchor: AnchorSpec, candidateText: string, label: string): TextMatchScore;
+
+export { scoreAnchor };