oh-my-second-brain 0.1.8 → 0.2.0

package/dist/engine/graph/resolver.js.map

@@ -1 +1 @@
-{"version":3,"file":"resolver.js","sourceRoot":"","sources":["../../../src/engine/graph/resolver.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,WAAW,CAAC;AA6B7B,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,UAA6B;IAC9D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,uDAAuD;QACvD,MAAM,UAAU,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,KAAK,CAAC;QAC5E,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAEtB,kBAAkB;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QACnD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;AAChC,CAAC;AAED,8EAA8E;AAC9E,uBAAuB;AACvB,8EAA8E;AAE9E;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,GAAW;IAClC,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IACnB,wCAAwC;IACxC,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/D,cAAc;IACd,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,OAAO,IAAI,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC1C,gBAAgB;IAChB,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,OAAO,IAAI,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC1C,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;AAClB,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,eAAe,CAAC,OAAe,EAAE,KAAoB;IACnE,MAAM,MAAM,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IACxC,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAE9C,qDAAqD;IACrD,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IAChC,MAAM,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC;IACtD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC5C,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;IAEjE,qEAAqE;IACrE,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACtC,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9C,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtD,MAAM,MAAM,GAAG,UAAU;aACtB,KAAK,EAAE;aACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QAC/B,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IACnC,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AACnC,CAAC;AAED,8EAA8E;AAC9E,6DAA6D;AAC7D,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAC3B,QAAgB,EAChB,QAA2B,EAC3B,KAAoB,EACpB,MAAM,GAAG,GAAG;IAEZ,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAa,EAAE;QACzC,MAAM,EAAE,OAAO,EAAE,GAAG,eAAe,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACrB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;QACnE,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC;IACzE,CAAC,CAAC,CAAC;AACL,CAAC"}
+{"version":3,"file":"resolver.js","sourceRoot":"","sources":["../../../src/engine/graph/resolver.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,WAAW,CAAC;AAsC7B,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,UAA6B;IAC9D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE5C,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,uDAAuD;QACvD,MAAM,UAAU,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,KAAK,CAAC;QAC5E,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAEtB,kBAAkB;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QACnD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;AACzC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iCAAiC,CAAC,IAA2B;IAC3E,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE5C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;YAC7D,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;AACzC,CAAC;AAED,mFAAmF;AACnF,SAAS,YAAY,CAAC,KAAc;IAClC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;IAC7D,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,EAAE,CAAC;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAClC,CAAC;AAED,sDAAsD;AACtD,SAAS,aAAa,CAAC,UAAyC;IAC9D,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACrE,MAAM,MAAM,GAAG,UAAU;SACtB,KAAK,EAAE;SACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACnF,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;AAC3B,CAAC;AAED,8EAA8E;AAC9E,uBAAuB;AACvB,8EAA8E;AAE9E;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,GAAW;IAClC,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IACnB,wCAAwC;IACxC,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/D,cAAc;IACd,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,OAAO,IAAI,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC1C,gBAAgB;IAChB,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,OAAO,IAAI,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC1C,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;AAClB,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAAC,OAAe,EAAE,KAAoB;IACnE,MAAM,MAAM,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IACxC,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAE9C,qDAAqD;IACrD,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IAChC,MAAM,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC;IACtD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC5C,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;IAEjE,qEAAqE;IACrE,MAAM,aAAa,GAAG,aAAa,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACpF,IAAI,aAAa,KAAK,IAAI;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC;IAEtE,8CAA8C;IAC9C,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AACnE,CAAC;AAED,8EAA8E;AAC9E,6DAA6D;AAC7D,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAC3B,QAAgB,EAChB,QAA2B,EAC3B,KAAoB,EACpB,MAAM,GAAG,GAAG;IAEZ,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAa,EAAE;QACzC,MAAM,EAAE,OAAO,EAAE,GAAG,eAAe,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACrB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;QACnE,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC;IACzE,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/engine/linkify/apply.d.ts

@@ -0,0 +1,56 @@
+/**
+ * Link application: splice accepted candidates into a note body and persist
+ * through the capture kernel.
+ *
+ * This is the only linkify module with a side effect, and even here the effect
+ * is injected — `writeNote` arrives as a parameter, `node:fs` is never imported,
+ * and the capture kernel is referenced by TYPE only. mask.ts and suggest.ts stay
+ * pure; every disk decision (path safety, concept contract, postcondition
+ * re-read) remains the kernel's, unduplicated here.
+ *
+ * Optimistic concurrency: candidates carry absolute offsets into the body they
+ * were computed from. If that body changed, the offsets are lies. `applyLinks`
+ * therefore re-hashes the body it is handed and refuses to write on any
+ * mismatch, on any candidate whose recorded text no longer sits at its offsets,
+ * and on any overlapping pair — three independent ways the same corruption
+ * could otherwise reach disk.
+ */
+import type { WriteNoteInput, WriteNoteResult } from "../../capture/safe.js";
+import type { LinkCandidate } from "./types.js";
+/** The capture-kernel seam apply persists through (structurally `writeNote`). */
+export type WriteNoteLike = (input: WriteNoteInput) => Promise<WriteNoteResult>;
+/** Everything the kernel needs to address the note, minus the body apply supplies. */
+export type LinkifyWriteTarget = Omit<WriteNoteInput, "mode" | "dryRun" | "body" | "frontmatter">;
+/** Why an apply attempt produced no write. */
+export type ApplyRefusal = "note-changed" | "no-candidates" | "candidate-drift" | "overlapping-candidates" | "write-rejected";
+/** Outcome of {@link applyLinks}: a written body, or a typed refusal. */
+export type ApplyResult = {
+    readonly applied: true;
+    readonly body: string;
+    readonly contentHash: string;
+    readonly write: WriteNoteResult;
+} | {
+    readonly applied: false;
+    readonly reason: ApplyRefusal;
+    readonly write?: WriteNoteResult;
+};
+/** Inputs for {@link applyLinks}, grouped so the call site stays readable. */
+export interface ApplyLinksInput {
+    /** The note body the candidates were computed against. */
+    readonly body: string;
+    /** sha256 hex of that body, taken when the candidates were produced. */
+    readonly baseContentHash: string;
+    /** The candidates the caller (or user) accepted. */
+    readonly accepted: readonly LinkCandidate[];
+    readonly writeNote: WriteNoteLike;
+    readonly target: LinkifyWriteTarget;
+}
+/** sha256 hex digest of a note body — the optimistic-concurrency token. */
+export declare function hashBody(body: string): string;
+/**
+ * Apply accepted link candidates to a note body and persist the result.
+ *
+ * Returns `{ applied: false, reason }` — with no write attempted — whenever the
+ * body has drifted from the snapshot the candidates were computed against.
+ */
+export declare function applyLinks(input: ApplyLinksInput): Promise<ApplyResult>;

package/dist/engine/linkify/apply.js

@@ -0,0 +1,65 @@
+/**
+ * Link application: splice accepted candidates into a note body and persist
+ * through the capture kernel.
+ *
+ * This is the only linkify module with a side effect, and even here the effect
+ * is injected — `writeNote` arrives as a parameter, `node:fs` is never imported,
+ * and the capture kernel is referenced by TYPE only. mask.ts and suggest.ts stay
+ * pure; every disk decision (path safety, concept contract, postcondition
+ * re-read) remains the kernel's, unduplicated here.
+ *
+ * Optimistic concurrency: candidates carry absolute offsets into the body they
+ * were computed from. If that body changed, the offsets are lies. `applyLinks`
+ * therefore re-hashes the body it is handed and refuses to write on any
+ * mismatch, on any candidate whose recorded text no longer sits at its offsets,
+ * and on any overlapping pair — three independent ways the same corruption
+ * could otherwise reach disk.
+ */
+import { createHash } from "node:crypto";
+/** sha256 hex digest of a note body — the optimistic-concurrency token. */
+export function hashBody(body) {
+    return createHash("sha256").update(body, "utf-8").digest("hex");
+}
+/** True when any two candidates claim overlapping body ranges. */
+function hasOverlap(sorted) {
+    return sorted.some((candidate, index) => {
+        const previous = sorted[index - 1];
+        return previous !== undefined && candidate.startOffset < previous.endOffset;
+    });
+}
+/** True when every candidate's recorded text still sits at its offsets. */
+function offsetsIntact(body, candidates) {
+    return candidates.every((candidate) => body.slice(candidate.startOffset, candidate.endOffset) === candidate.matchedText);
+}
+/** Splice replacements right-to-left so untouched offsets stay valid. */
+function splice(body, sorted) {
+    return sorted.reduceRight((acc, candidate) => acc.slice(0, candidate.startOffset) + candidate.renderedReplacement + acc.slice(candidate.endOffset), body);
+}
+/**
+ * Apply accepted link candidates to a note body and persist the result.
+ *
+ * Returns `{ applied: false, reason }` — with no write attempted — whenever the
+ * body has drifted from the snapshot the candidates were computed against.
+ */
+export async function applyLinks(input) {
+    if (hashBody(input.body) !== input.baseContentHash) {
+        return { applied: false, reason: "note-changed" };
+    }
+    if (input.accepted.length < 1) {
+        return { applied: false, reason: "no-candidates" };
+    }
+    const sorted = input.accepted.slice().sort((a, b) => a.startOffset - b.startOffset);
+    if (hasOverlap(sorted)) {
+        return { applied: false, reason: "overlapping-candidates" };
+    }
+    if (!offsetsIntact(input.body, sorted)) {
+        return { applied: false, reason: "candidate-drift" };
+    }
+    const body = splice(input.body, sorted);
+    const write = await input.writeNote({ ...input.target, mode: "update", dryRun: false, body });
+    if (write.status !== "written") {
+        return { applied: false, reason: "write-rejected", write };
+    }
+    return { applied: true, body, contentHash: hashBody(body), write };
+}
+//# sourceMappingURL=apply.js.map

package/dist/engine/linkify/apply.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"apply.js","sourceRoot":"","sources":["../../../src/engine/linkify/apply.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAmCzC,2EAA2E;AAC3E,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAClE,CAAC;AAED,kEAAkE;AAClE,SAAS,UAAU,CAAC,MAAgC;IAClD,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE;QACtC,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACnC,OAAO,QAAQ,KAAK,SAAS,IAAI,SAAS,CAAC,WAAW,GAAG,QAAQ,CAAC,SAAS,CAAC;IAC9E,CAAC,CAAC,CAAC;AACL,CAAC;AAED,2EAA2E;AAC3E,SAAS,aAAa,CAAC,IAAY,EAAE,UAAoC;IACvE,OAAO,UAAU,CAAC,KAAK,CACrB,CAAC,SAAS,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,WAAW,EAAE,SAAS,CAAC,SAAS,CAAC,KAAK,SAAS,CAAC,WAAW,CAChG,CAAC;AACJ,CAAC;AAED,yEAAyE;AACzE,SAAS,MAAM,CAAC,IAAY,EAAE,MAAgC;IAC5D,OAAO,MAAM,CAAC,WAAW,CACvB,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE,CACjB,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,WAAW,CAAC,GAAG,SAAS,CAAC,mBAAmB,GAAG,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,EACtG,IAAI,CACL,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,KAAsB;IACrD,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,eAAe,EAAE,CAAC;QACnD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;IACpD,CAAC;IACD,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9B,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC;IACrD,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;IACpF,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,wBAAwB,EAAE,CAAC;IAC9D,CAAC;IACD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;QACvC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;IACvD,CAAC;IAED,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,SAAS,CAAC,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAC9F,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC/B,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC;IAC7D,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;AACrE,CAAC"}

package/dist/engine/linkify/josa.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Korean josa (조사) table + stem matcher for the linkify span detector.
+ *
+ * Why this exists: Korean is agglutinative, so a vault term almost never appears
+ * bare in prose — "아타락시아" shows up as "아타락시아를", "아타락시아는",
+ * "아타락시아에서". A plain word-boundary matcher misses every one of them, and a
+ * plain prefix matcher over-matches ("학교" inside "학교폭력").
+ *
+ * The rule this module encodes: a term matches a token when the term is a prefix
+ * and the remainder is a KNOWN particle from the table below (or empty). An
+ * unknown remainder is NOT a match — there is no morphological analysis here and
+ * no guessing. Latin-script terms get ordinary case-insensitive whole-token
+ * matching; particle logic never applies to them.
+ *
+ * Pure module: no I/O, no state. Tokenisation grain matches
+ * src/engine/graph/node.ts::tokenize (\p{L}/\p{N} runs), so callers can feed it
+ * whitespace/punctuation-delimited tokens directly.
+ */
+/**
+ * Common Korean particles, ≤2 syllables, that may directly follow a noun.
+ *
+ * Plain reviewable data, grouped by role. Deliberately conservative: only
+ * particles that attach to a bare noun stem are listed, because anything longer
+ * or more contextual (verb endings such as "하게", "이라는") is exactly the case
+ * the matcher must reject rather than guess at.
+ */
+export declare const KOREAN_PARTICLES: readonly ["이", "가", "께서", "은", "는", "을", "를", "의", "에", "에서", "에게", "께", "한테", "으로", "로", "와", "과", "하고", "이랑", "랑", "보다", "부터", "까지", "에도", "에는", "도", "만", "조차", "마저", "밖에", "이나", "이란", "란", "이다"];
+/** A particle string drawn from {@link KOREAN_PARTICLES}. */
+export type KoreanParticle = (typeof KOREAN_PARTICLES)[number];
+/**
+ * Outcome of matching a term against a single token.
+ *
+ * Offsets are UTF-16 code-unit indices into the token, so `token.slice(stemStart,
+ * stemEnd)` yields the stem the caller should wrap. Particle fields are null on
+ * a bare match (no trailing particle).
+ */
+export type JosaMatch = {
+    readonly kind: "match";
+    readonly stem: string;
+    readonly stemStart: number;
+    readonly stemEnd: number;
+    readonly particle: string | null;
+    readonly particleStart: number | null;
+    readonly particleEnd: number | null;
+} | {
+    readonly kind: "no_match";
+};
+/** True when the remainder is a known particle short enough to be one. */
+export declare function isKnownParticle(remainder: string): boolean;
+/**
+ * Match `term` inside a single whitespace/punctuation-delimited `token`.
+ *
+ * Korean-final terms accept one trailing particle from {@link KOREAN_PARTICLES};
+ * the returned span covers the stem only. Every other trailing remainder is a
+ * no-match. Latin/other-script terms require the whole token to equal the term
+ * (case-insensitive) — no particle absorption, no partial-word hits.
+ */
+export declare function matchTermInToken(term: string, token: string): JosaMatch;

package/dist/engine/linkify/josa.js

@@ -0,0 +1,133 @@
+/**
+ * Korean josa (조사) table + stem matcher for the linkify span detector.
+ *
+ * Why this exists: Korean is agglutinative, so a vault term almost never appears
+ * bare in prose — "아타락시아" shows up as "아타락시아를", "아타락시아는",
+ * "아타락시아에서". A plain word-boundary matcher misses every one of them, and a
+ * plain prefix matcher over-matches ("학교" inside "학교폭력").
+ *
+ * The rule this module encodes: a term matches a token when the term is a prefix
+ * and the remainder is a KNOWN particle from the table below (or empty). An
+ * unknown remainder is NOT a match — there is no morphological analysis here and
+ * no guessing. Latin-script terms get ordinary case-insensitive whole-token
+ * matching; particle logic never applies to them.
+ *
+ * Pure module: no I/O, no state. Tokenisation grain matches
+ * src/engine/graph/node.ts::tokenize (\p{L}/\p{N} runs), so callers can feed it
+ * whitespace/punctuation-delimited tokens directly.
+ */
+// ---------------------------------------------------------------------------
+// Particle table
+// ---------------------------------------------------------------------------
+/**
+ * Common Korean particles, ≤2 syllables, that may directly follow a noun.
+ *
+ * Plain reviewable data, grouped by role. Deliberately conservative: only
+ * particles that attach to a bare noun stem are listed, because anything longer
+ * or more contextual (verb endings such as "하게", "이라는") is exactly the case
+ * the matcher must reject rather than guess at.
+ */
+export const KOREAN_PARTICLES = [
+    // subject (주격)
+    "이",
+    "가",
+    "께서",
+    // topic (보조사 — 주제)
+    "은",
+    "는",
+    // object (목적격)
+    "을",
+    "를",
+    // possessive (관형격)
+    "의",
+    // locative / directional (부사격)
+    "에",
+    "에서",
+    "에게",
+    "께",
+    "한테",
+    "으로",
+    "로",
+    // comitative / conjunctive (접속)
+    "와",
+    "과",
+    "하고",
+    "이랑",
+    "랑",
+    // comparative / source (부사격)
+    "보다",
+    "부터",
+    "까지",
+    "에도",
+    "에는",
+    // auxiliary (보조사)
+    "도",
+    "만",
+    "조차",
+    "마저",
+    "밖에",
+    "이나",
+    "이란",
+    "란",
+    // copula attached straight to a noun
+    "이다",
+];
+const PARTICLE_SET = new Set(KOREAN_PARTICLES);
+const NO_MATCH = { kind: "no_match" };
+// ---------------------------------------------------------------------------
+// Matcher
+// ---------------------------------------------------------------------------
+const HANGUL_SYLLABLE = /^[\uAC00-\uD7A3]+$/u;
+/** True when the string's last character is a Hangul syllable. */
+function endsWithHangul(text) {
+    const last = text.slice(-1);
+    return last.length > 0 && HANGUL_SYLLABLE.test(last);
+}
+/** True when the remainder is a known particle short enough to be one. */
+export function isKnownParticle(remainder) {
+    return remainder.length <= 2 && PARTICLE_SET.has(remainder);
+}
+/**
+ * Match `term` inside a single whitespace/punctuation-delimited `token`.
+ *
+ * Korean-final terms accept one trailing particle from {@link KOREAN_PARTICLES};
+ * the returned span covers the stem only. Every other trailing remainder is a
+ * no-match. Latin/other-script terms require the whole token to equal the term
+ * (case-insensitive) — no particle absorption, no partial-word hits.
+ */
+export function matchTermInToken(term, token) {
+    if (term.length < 1 || token.length < 1)
+        return NO_MATCH;
+    if (!endsWithHangul(term)) {
+        return token.toLowerCase() === term.toLowerCase() ? bareMatch(term.length, token) : NO_MATCH;
+    }
+    if (!token.startsWith(term))
+        return NO_MATCH;
+    const remainder = token.slice(term.length);
+    if (remainder.length < 1)
+        return bareMatch(term.length, token);
+    if (!isKnownParticle(remainder))
+        return NO_MATCH;
+    return {
+        kind: "match",
+        stem: token.slice(0, term.length),
+        stemStart: 0,
+        stemEnd: term.length,
+        particle: remainder,
+        particleStart: term.length,
+        particleEnd: token.length,
+    };
+}
+/** Whole-token match with no trailing particle. */
+function bareMatch(stemEnd, token) {
+    return {
+        kind: "match",
+        stem: token.slice(0, stemEnd),
+        stemStart: 0,
+        stemEnd,
+        particle: null,
+        particleStart: null,
+        particleEnd: null,
+    };
+}
+//# sourceMappingURL=josa.js.map

package/dist/engine/linkify/josa.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"josa.js","sourceRoot":"","sources":["../../../src/engine/linkify/josa.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG;IAC9B,eAAe;IACf,GAAG;IACH,GAAG;IACH,IAAI;IACJ,mBAAmB;IACnB,GAAG;IACH,GAAG;IACH,eAAe;IACf,GAAG;IACH,GAAG;IACH,mBAAmB;IACnB,GAAG;IACH,+BAA+B;IAC/B,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,GAAG;IACH,gCAAgC;IAChC,GAAG;IACH,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,GAAG;IACH,6BAA6B;IAC7B,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,kBAAkB;IAClB,GAAG;IACH,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,GAAG;IACH,qCAAqC;IACrC,IAAI;CACI,CAAC;AAKX,MAAM,YAAY,GAAwB,IAAI,GAAG,CAAS,gBAAgB,CAAC,CAAC;AAyB5E,MAAM,QAAQ,GAAc,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;AAEjD,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,MAAM,eAAe,GAAG,qBAAqB,CAAC;AAE9C,kEAAkE;AAClE,SAAS,cAAc,CAAC,IAAY;IAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACvD,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,eAAe,CAAC,SAAiB;IAC/C,OAAO,SAAS,CAAC,MAAM,IAAI,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY,EAAE,KAAa;IAC1D,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC;IAEzD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC/F,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,QAAQ,CAAC;IAE7C,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3C,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/D,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC;QAAE,OAAO,QAAQ,CAAC;IAEjD,OAAO;QACL,IAAI,EAAE,OAAO;QACb,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC;QACjC,SAAS,EAAE,CAAC;QACZ,OAAO,EAAE,IAAI,CAAC,MAAM;QACpB,QAAQ,EAAE,SAAS;QACnB,aAAa,EAAE,IAAI,CAAC,MAAM;QAC1B,WAAW,EAAE,KAAK,CAAC,MAAM;KAC1B,CAAC;AACJ,CAAC;AAED,mDAAmD;AACnD,SAAS,SAAS,CAAC,OAAe,EAAE,KAAa;IAC/C,OAAO;QACL,IAAI,EAAE,OAAO;QACb,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC;QAC7B,SAAS,EAAE,CAAC;QACZ,OAAO;QACP,QAAQ,EAAE,IAAI;QACd,aAAa,EAAE,IAAI;QACnB,WAAW,EAAE,IAAI;KAClB,CAAC;AACJ,CAAC"}

package/dist/engine/linkify/mask.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Body masking: split a note body into regions the linkifier may rewrite and
+ * regions it must leave byte-for-byte alone.
+ *
+ * Why this exists: inserting `[[…]]` into a code fence, a URL, an existing
+ * wikilink, or a heading corrupts the note. The span detector therefore never
+ * sees the raw body — it sees only the FREE spans this module returns.
+ *
+ * Design: one collector pass per construct family, then a sort-and-merge into
+ * disjoint ascending ranges, then the complement. Merging (rather than
+ * precedence rules) is what makes overlapping constructs — a URL inside a
+ * markdown link target, a wikilink inside a heading — safe: the union is
+ * protected and nothing is double-counted. Malformed input degrades toward MORE
+ * protection (an unterminated fence protects to end of body), never less.
+ *
+ * Pure module: no I/O, no state. Offsets are UTF-16 indices into the input.
+ */
+import type { MaskResult } from "./types.js";
+/**
+ * Partition `body` into protected and free spans.
+ *
+ * Together the two lists tile `[0, body.length)` exactly once, ascending, with
+ * no zero-length entries. Callers scan `freeSpans` and never touch the rest.
+ */
+export declare function maskBody(body: string): MaskResult;
+/** True when `offset` falls inside any protected span. */
+export declare function isProtected(mask: MaskResult, offset: number): boolean;
+/** The body slices the span detector is allowed to scan, in document order. */
+export declare function freeText(body: string, mask: MaskResult): string[];

package/dist/engine/linkify/mask.js

@@ -0,0 +1,173 @@
+/**
+ * Body masking: split a note body into regions the linkifier may rewrite and
+ * regions it must leave byte-for-byte alone.
+ *
+ * Why this exists: inserting `[[…]]` into a code fence, a URL, an existing
+ * wikilink, or a heading corrupts the note. The span detector therefore never
+ * sees the raw body — it sees only the FREE spans this module returns.
+ *
+ * Design: one collector pass per construct family, then a sort-and-merge into
+ * disjoint ascending ranges, then the complement. Merging (rather than
+ * precedence rules) is what makes overlapping constructs — a URL inside a
+ * markdown link target, a wikilink inside a heading — safe: the union is
+ * protected and nothing is double-counted. Malformed input degrades toward MORE
+ * protection (an unterminated fence protects to end of body), never less.
+ *
+ * Pure module: no I/O, no state. Offsets are UTF-16 indices into the input.
+ */
+// ---------------------------------------------------------------------------
+// Collectors — each returns raw (possibly overlapping) protected ranges
+// ---------------------------------------------------------------------------
+/** Leading `---\n … \n---` YAML block only; a mid-body `---` is a thematic break. */
+function frontmatterSpan(body) {
+    if (!body.startsWith("---\n") && !body.startsWith("---\r\n"))
+        return [];
+    const close = /^---[ \t]*\r?$/m.exec(body.slice(3));
+    if (!close || close.index === undefined)
+        return [];
+    return [{ start: 0, end: 3 + close.index + close[0].length, kind: "frontmatter" }];
+}
+/**
+ * Fenced code blocks (``` or ~~~), including the fence lines themselves.
+ * An unterminated fence protects everything to the end of the body.
+ */
+function fencedCodeSpans(body) {
+    const spans = [];
+    const fence = /^[ \t]*(`{3,}|~{3,})[^\n]*$/gm;
+    let match;
+    while ((match = fence.exec(body)) !== null) {
+        const marker = match[1];
+        if (marker === undefined)
+            continue;
+        const opening = match.index;
+        const closer = new RegExp(`^[ \\t]*${marker[0] === "\`" ? "`" : "~"}{${String(marker.length)},}[ \\t]*$`, "m");
+        const rest = body.slice(fence.lastIndex);
+        const closeMatch = closer.exec(rest);
+        const end = closeMatch && closeMatch.index !== undefined
+            ? fence.lastIndex + closeMatch.index + closeMatch[0].length
+            : body.length;
+        spans.push({ start: opening, end, kind: "fenced-code" });
+        fence.lastIndex = end;
+    }
+    return spans;
+}
+/**
+ * Inline code spans: a run of N backticks closed by another run of exactly N
+ * on the same logical block. An unclosed run protects nothing extra — the
+ * fenced-code pass already covers the block-level case.
+ */
+function inlineCodeSpans(body) {
+    const spans = [];
+    const run = /`+/g;
+    let match;
+    while ((match = run.exec(body)) !== null) {
+        const ticks = match[0];
+        const closeIndex = body.indexOf(ticks, match.index + ticks.length);
+        if (closeIndex < 0)
+            continue;
+        const inner = body.slice(match.index + ticks.length, closeIndex);
+        if (inner.includes("\n\n"))
+            continue;
+        const end = closeIndex + ticks.length;
+        spans.push({ start: match.index, end, kind: "inline-code" });
+        run.lastIndex = end;
+    }
+    return spans;
+}
+/** Regex-driven collectors that need no cursor bookkeeping. */
+const SIMPLE_PATTERNS = [
+    // image embeds first so their `!` prefix is inside the span, not left free
+    { kind: "image-embed", pattern: /!\[\[[^\]\n]*\]\]/g },
+    { kind: "image-embed", pattern: /!\[[^\]\n]*\]\([^)\n]*\)/g },
+    { kind: "wikilink", pattern: /\[\[[^\]\n]*\]\]/g },
+    { kind: "markdown-link", pattern: /\[[^\]\n]*\]\([^)\n]*\)/g },
+    { kind: "html", pattern: /<\/?[A-Za-z][^<>\n]*>/g },
+    { kind: "heading", pattern: /^[ \t]{0,3}#{1,6}[ \t][^\n]*$/gm },
+    { kind: "heading", pattern: /^[^\n]+\r?\n[ \t]{0,3}(?:=+|-{2,})[ \t]*$/gm },
+    { kind: "url", pattern: /\b(?:https?|ftp|obsidian|mailto):[^\s<>()[\]]+/g },
+    { kind: "block-id", pattern: /(?<=\s)\^[A-Za-z0-9-]+[ \t]*$/gm },
+    { kind: "tag", pattern: /(?<=^|\s)#[\p{L}\p{N}][\p{L}\p{N}/_-]*/gu },
+];
+function simpleSpans(body) {
+    const spans = [];
+    for (const { kind, pattern } of SIMPLE_PATTERNS) {
+        const scanner = new RegExp(pattern.source, pattern.flags);
+        let match;
+        while ((match = scanner.exec(body)) !== null) {
+            if (match[0].length < 1) {
+                scanner.lastIndex += 1;
+                continue;
+            }
+            spans.push({ start: match.index, end: match.index + match[0].length, kind });
+        }
+    }
+    return spans;
+}
+// ---------------------------------------------------------------------------
+// Merge + complement
+// ---------------------------------------------------------------------------
+/**
+ * Sort by start (earlier wins, longer wins on tie) and fuse overlaps into one
+ * span carrying the first contributor's kind — the union is what matters to the
+ * detector; the kind is reviewer-facing provenance.
+ */
+function mergeSpans(raw) {
+    const sorted = raw
+        .filter((s) => s.end > s.start)
+        .slice()
+        .sort((a, b) => a.start - b.start || b.end - a.end);
+    const merged = [];
+    for (const span of sorted) {
+        const last = merged[merged.length - 1];
+        if (last !== undefined && span.start <= last.end) {
+            if (span.end > last.end) {
+                merged[merged.length - 1] = { start: last.start, end: span.end, kind: last.kind };
+            }
+            continue;
+        }
+        merged.push(span);
+    }
+    return merged;
+}
+/** The complement of `protectedSpans` within `[0, length)`. */
+function complement(protectedSpans, length) {
+    const free = [];
+    let cursor = 0;
+    for (const span of protectedSpans) {
+        if (span.start > cursor)
+            free.push({ start: cursor, end: span.start });
+        cursor = span.end;
+    }
+    if (cursor < length)
+        free.push({ start: cursor, end: length });
+    return free;
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Partition `body` into protected and free spans.
+ *
+ * Together the two lists tile `[0, body.length)` exactly once, ascending, with
+ * no zero-length entries. Callers scan `freeSpans` and never touch the rest.
+ */
+export function maskBody(body) {
+    if (body.length < 1)
+        return { protectedSpans: [], freeSpans: [] };
+    const protectedSpans = mergeSpans([
+        ...frontmatterSpan(body),
+        ...fencedCodeSpans(body),
+        ...inlineCodeSpans(body),
+        ...simpleSpans(body),
+    ]);
+    return { protectedSpans, freeSpans: complement(protectedSpans, body.length) };
+}
+/** True when `offset` falls inside any protected span. */
+export function isProtected(mask, offset) {
+    return mask.protectedSpans.some((span) => span.start <= offset && offset < span.end);
+}
+/** The body slices the span detector is allowed to scan, in document order. */
+export function freeText(body, mask) {
+    return mask.freeSpans.map((span) => body.slice(span.start, span.end));
+}
+//# sourceMappingURL=mask.js.map

package/dist/engine/linkify/mask.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mask.js","sourceRoot":"","sources":["../../../src/engine/linkify/mask.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,8EAA8E;AAC9E,wEAAwE;AACxE,8EAA8E;AAE9E,qFAAqF;AACrF,SAAS,eAAe,CAAC,IAAY;IACnC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC;QAAE,OAAO,EAAE,CAAC;IACxE,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACnD,OAAO,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;AACrF,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAY;IACnC,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,MAAM,KAAK,GAAG,+BAA+B,CAAC;IAC9C,IAAI,KAA6B,CAAC;IAClC,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,MAAM,KAAK,SAAS;YAAE,SAAS;QACnC,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC;QAC5B,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,WAAW,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;QAC/G,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACzC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,GAAG,GACP,UAAU,IAAI,UAAU,CAAC,KAAK,KAAK,SAAS;YAC1C,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,UAAU,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM;YAC3D,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QAClB,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;QACzD,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC;IACxB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAC,IAAY;IACnC,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,MAAM,GAAG,GAAG,KAAK,CAAC;IAClB,IAAI,KAA6B,CAAC;IAClC,OAAO,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QACnE,IAAI,UAAU,GAAG,CAAC;YAAE,SAAS;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACjE,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,SAAS;QACrC,MAAM,GAAG,GAAG,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;QAC7D,GAAG,CAAC,SAAS,GAAG,GAAG,CAAC;IACtB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+DAA+D;AAC/D,MAAM,eAAe,GAA0E;IAC7F,2EAA2E;IAC3E,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,oBAAoB,EAAE;IACtD,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,2BAA2B,EAAE;IAC7D,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,mBAAmB,EAAE;IAClD,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,0BAA0B,EAAE;IAC9D,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,wBAAwB,EAAE;IACnD,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,iCAAiC,EAAE;IAC/D,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,6CAA6C,EAAE;IAC3E,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,iDAAiD,EAAE;IAC3E,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,iCAAiC,EAAE;IAChE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,0CAA0C,EAAE;CACrE,CAAC;AAEF,SAAS,WAAW,CAAC,IAAY;IAC/B,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,eAAe,EAAE,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAC1D,IAAI,KAA6B,CAAC;QAClC,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YAC7C,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;gBACvB,SAAS;YACX,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E;;;;GAIG;AACH,SAAS,UAAU,CAAC,GAA6B;IAC/C,MAAM,MAAM,GAAG,GAAG;SACf,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC;SAC9B,KAAK,EAAE;SACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAEtD,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YACjD,IAAI,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACxB,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;YACpF,CAAC;YACD,SAAS;QACX,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+DAA+D;AAC/D,SAAS,UAAU,CAAC,cAAwC,EAAE,MAAc;IAC1E,MAAM,IAAI,GAAW,EAAE,CAAC;IACxB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,KAAK,GAAG,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACvE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC;IACpB,CAAC;IACD,IAAI,MAAM,GAAG,MAAM;QAAE,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;IAC/D,OAAO,IAAI,CAAC;AACd,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,cAAc,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IAElE,MAAM,cAAc,GAAG,UAAU,CAAC;QAChC,GAAG,eAAe,CAAC,IAAI,CAAC;QACxB,GAAG,eAAe,CAAC,IAAI,CAAC;QACxB,GAAG,eAAe,CAAC,IAAI,CAAC;QACxB,GAAG,WAAW,CAAC,IAAI,CAAC;KACrB,CAAC,CAAC;IAEH,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,UAAU,CAAC,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;AAChF,CAAC;AAED,0DAA0D;AAC1D,MAAM,UAAU,WAAW,CAAC,IAAgB,EAAE,MAAc;IAC1D,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,MAAM,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;AACvF,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,QAAQ,CAAC,IAAY,EAAE,IAAgB;IACrD,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACxE,CAAC"}

package/dist/engine/linkify/suggest.d.ts

@@ -0,0 +1,52 @@
+/**
+ * Span detection: propose `[[wikilink]]` insertions for a note body.
+ *
+ * The pipeline is surface-anchored by construction. A candidate exists ONLY
+ * because a term's basename or frontmatter alias literally appears in a FREE
+ * region of the body (see mask.ts). Retrieval signals never create candidates:
+ * an injected lexical ranker may only reorder what the surface already found,
+ * and an injected vector predicate may only veto. This is what keeps the
+ * feature from hallucinating links into a user's vault.
+ *
+ * Two rules encode judgement the machine must not make on its own:
+ *   - FIRST occurrence per target note only — a term linked ten times is noise.
+ *   - Ambiguity (2+ notes claiming one span) is REPORTED, never resolved. The
+ *     resolver's shortest-path tie-break is right for reading an existing link
+ *     and wrong for creating a new one.
+ *
+ * Pure given its injected dependencies: no I/O, no globals, no clock.
+ */
+import type { LinkCandidate, TermNote } from "./types.js";
+/** The ontology concept whose notes are the default link universe. */
+export declare const TERM_CONCEPT = "term";
+/** Minimal shape of `EngineStore.queryLex` results — only what ranking needs. */
+export interface LexHit {
+    readonly docPath: string;
+    readonly score: number;
+}
+/** Options for {@link suggestLinks}; every dependency is optional and injected. */
+export interface SuggestOptions {
+    /** Vault-relative path of the note being linkified; never linked to itself. */
+    readonly notePath: string;
+    /** Optional lexical re-ranker. Reorders surface-anchored candidates only. */
+    readonly queryLex?: (text: string, k: number) => readonly LexHit[];
+    /** Optional semantic veto, honoured only when `embeddingConfigured` is true. */
+    readonly vectorVeto?: (candidate: LinkCandidate) => boolean;
+    /** ADR-007 gate; when false the vector veto is inert. Defaults to true. */
+    readonly embeddingConfigured?: boolean;
+}
+/**
+ * Restrict a candidate set to notes bound to the `term` concept.
+ *
+ * Offered as a helper rather than applied inside {@link suggestLinks} so the
+ * caller owns the universe decision (a vault may want a wider set).
+ */
+export declare function termBoundNotes(notes: readonly TermNote[]): TermNote[];
+/**
+ * Propose link candidates for `body` against `notes`.
+ *
+ * Candidates are returned ranked (highest confidence first, earliest offset
+ * breaking ties) and are guaranteed to be non-overlapping, first-occurrence
+ * only, outside every protected region, and never self-referential.
+ */
+export declare function suggestLinks(body: string, notes: readonly TermNote[], options: SuggestOptions): LinkCandidate[];