main.js

"use strict";
var wt = Object.defineProperty;
var Es = Object.getOwnPropertyDescriptor;
var Ms = Object.getOwnPropertyNames;
var Rs = Object.prototype.hasOwnProperty;
var Ds = (s, t) => {
    for (var e in t) wt(s, e, { get: t[e], enumerable: !0 });
  },
  Ts = (s, t, e, n) => {
    if ((t && typeof t == "object") || typeof t == "function")
      for (let i of Ms(t))
        !Rs.call(s, i) && i !== e && wt(s, i, { get: () => t[i], enumerable: !(n = Es(t, i)) || n.enumerable });
    return s;
  };
var Is = (s) => Ts(wt({}, "__esModule", { value: !0 }), s);
var _o = {};
Ds(_o, { default: () => bt });
module.exports = Is(_o);
var E = require("obsidian");
function ee(s) {
  let t = 5381;
  for (let e = 0; e < s.length; e++) ((t = ((t << 5) + t) ^ s.charCodeAt(e)), (t = t >>> 0));
  return t;
}
function te(s) {
  let t = ["purple", "teal", "coral", "pink", "blue", "amber"];
  return s ? t[ee(s) % t.length] : "purple";
}
function $(s) {
  return s.toLowerCase().trim();
}
function w(s) {
  return [...s].map($).sort().join("|");
}
var ks = { simplex: "s", hyperedge: "h" };
function M(s, t) {
  return `${ks[s]}:${w(t)}`;
}
function D(s) {
  return [...s].sort((t, e) => $(t).localeCompare($(e)));
}
function ne(s) {
  let t = new Set(),
    e = [];
  for (let n of D(s)) {
    let i = $(n);
    t.has(i) || (t.add(i), e.push(n));
  }
  return e;
}
var Ct = null,
  on = -1,
  Et = 0;
function de() {
  Et++;
}
function Ns(s) {
  if (Ct && on === Et) return Ct;
  let t = new Map();
  for (let e of s.vault.getMarkdownFiles()) {
    let n = s.metadataCache.getFileCache(e)?.frontmatter?.aliases;
    (Array.isArray(n) ? n : typeof n == "string" ? [n] : []).forEach((r) => {
      let o = $(String(r));
      o && !t.has(o) && t.set(o, e);
    });
  }
  return ((Ct = t), (on = Et), t);
}
function Fe(s, t, e) {
  let n = s.trim();
  if (!n) return null;
  let i = e.metadataCache.getFirstLinkpathDest(n, t);
  return i || (Ns(e).get($(n)) ?? null);
}
var Me = "simplicial-view",
  ue = "simplicial-panel",
  Re = "simplicial-sheaf",
  De = "simplicial-dynamics",
  Te = "simplicial-persistence";
function ln(s) {
  return s.nodes.length - 1;
}
function* pe(s, t) {
  if (t === 0) {
    yield [];
    return;
  }
  for (let e = 0; e <= s.length - t; e++) for (let n of pe(s.slice(e + 1), t - 1)) yield [s[e], ...n];
}
function Mt(s, t) {
  if (ln(t) >= 4) return [];
  let n = D(t.nodes),
    i = [];
  for (let r = 2; r < n.length; r++) for (let o of pe(n, r)) s.simplices.has(w(o)) || i.push(D(o));
  return i;
}
function cn(s, t) {
  let e = ln(t);
  if (e > 4) {
    console.warn(`[Simplicial] Simplex dim=${e} exceeds cap. Faces not auto-generated.`);
    return;
  }
  let n = w(t.nodes),
    i = t.colorKey ?? te(t.label);
  for (let r of Mt(s, t))
    s.simplices.set(w(r), { nodes: r, autoGenerated: !0, userDefined: !1, parentKey: n, colorKey: i });
}
function Ps(s, t) {
  let e = [...s.simplices.entries()].map(([i, r]) => {
      let o = Rt(r, t);
      if (!Number.isFinite(o) || o < 0 || o > 1) throw new Error(`Invalid ${t} score for ${i}`);
      return {
        simplexKey: i,
        dimension: r.nodes.length - 1,
        score: o,
        value: 1 - o,
        metric: t,
        direction: "increasing",
      };
    }),
    n = new Map(e.map((i) => [i.simplexKey, i]));
  for (let i of e) {
    let r = i.simplexKey.split("|");
    if (!(r.length <= 2))
      for (let o = 0; o < r.length; o++) {
        let a = w(r.filter((c, u) => u !== o)),
          l = n.get(a);
        if (!l) throw new Error(`Filtration input is not downward closed: ${i.simplexKey} lacks ${a}`);
        if (l.value > i.value) throw new Error(`Filtration face condition violated: ${a} follows ${i.simplexKey}`);
      }
  }
  return e.sort((i, r) => i.value - r.value || i.dimension - r.dimension || i.simplexKey.localeCompare(r.simplexKey));
}
function dn(s) {
  let t = [];
  for (let e of s)
    (t.push({
      threshold: 1 - e.birth,
      type: "class-birth",
      nodes: e.birthSimplex.split("|"),
      simplexKey: e.birthSimplex,
      description: `H${e.dimension} class born: ${e.birthSimplex.split("|").join(" \xB7 ")}`,
      intervalId: e.id,
      dimension: e.dimension,
    }),
      !(e.death === null || e.deathSimplex === void 0) &&
        t.push({
          threshold: 1 - e.death,
          type: "class-death",
          nodes: e.deathSimplex.split("|"),
          simplexKey: e.deathSimplex,
          description: `${e.deathSimplex.split("|").join(" \xB7 ")} closes the H${e.dimension} class born at ${e.birthSimplex.split("|").join(" \xB7 ")}`,
          intervalId: e.id,
          dimension: e.dimension,
          pairedSimplexKey: e.birthSimplex,
        }));
  return t.sort(
    (e, n) => n.threshold - e.threshold || e.dimension - n.dimension || e.simplexKey.localeCompare(n.simplexKey),
  );
}
function un(s, t) {
  return Ps(s, t)
    .map((e) => ({
      threshold: e.score,
      type: "simplex-appearance",
      nodes: s.simplices.get(e.simplexKey)?.nodes ?? e.simplexKey.split("|"),
      simplexKey: e.simplexKey,
      description: `${e.dimension}-simplex appears: ${e.simplexKey.split("|").join(" \xB7 ")}`,
    }))
    .sort(
      (e, n) =>
        n.threshold - e.threshold || e.nodes.length - n.nodes.length || e.simplexKey.localeCompare(n.simplexKey),
    );
}
function Rt(s, t) {
  let e = s.autoGenerated ? 1 : 0;
  return t === "confidence"
    ? (s.confidence ?? s.weight ?? e)
    : t === "decayed-weight"
      ? (s.decayedWeight ?? s.weight ?? s.confidence ?? e)
      : (s.weight ?? s.decayedWeight ?? s.confidence ?? e);
}
function pn(s) {
  return [...new Set(s.map((e) => Math.round(e.threshold * 100) / 100))].sort((e, n) => e - n);
}
function Fs(s, t = 1 / 0) {
  let e = new Map();
  e.set(
    0,
    D([...s.nodes.keys()]).map((o) => w([o])),
  );
  for (let o of s.simplices.values()) {
    let a = o.nodes.length - 1;
    if (a > t) continue;
    let l = e.get(a) ?? [];
    (l.push(w(o.nodes)), e.set(a, l));
  }
  let n = Math.max(0, ...e.keys()),
    i = [];
  for (let o = 0; o <= n; o++) {
    let a = [...new Set(e.get(o) ?? [])].sort();
    i.push({ dimension: o, simplices: a, index: new Map(a.map((l, c) => [l, c])) });
  }
  let r = [];
  for (let o = 1; o <= n; o++) {
    let a = i[o - 1],
      l = i[o],
      c = l.simplices.map((u) => {
        let d = u.split("|"),
          p = d.map((h, m) => a.index.get(w(d.filter((g, f) => f !== m))));
        if (p.some((h) => h === void 0))
          throw new Error(`Topology input is not downward closed: ${u} lacks a codimension-one face`);
        return Uint32Array.from(p.sort((h, m) => h - m));
      });
    r.push({ dimension: o, rows: a, columns: l, data: c });
  }
  return { bases: i, boundaries: r, maxDimension: n };
}
function he(s, t) {
  let e = [],
    n = 0,
    i = 0;
  for (; n < s.length || i < t.length;)
    i >= t.length || (n < s.length && s[n] < t[i])
      ? e.push(s[n++])
      : n >= s.length || t[i] < s[n]
        ? e.push(t[i++])
        : (n++, i++);
  return Uint32Array.from(e);
}
function Dt(s) {
  return s.length ? s[s.length - 1] : null;
}
function As(s) {
  let t = new Map(),
    e = 0;
  for (let n of s) {
    let i = Uint32Array.from(n);
    for (;;) {
      let r = Dt(i);
      if (r === null) break;
      let o = t.get(r);
      if (!o) {
        (t.set(r, i), e++);
        break;
      }
      i = he(i, o);
    }
  }
  return e;
}
function Ae(s, t) {
  let e = Fs(s, t + 1),
    n = Array.from({ length: t + 2 }, () => 0);
  for (let o of e.boundaries) n[o.dimension] = As(o.data);
  let i = Array.from({ length: t + 2 }, (o, a) => e.bases[a]?.simplices.length ?? 0),
    r = Array.from({ length: t + 1 }, (o, a) => i[a] - n[a] - n[a + 1]);
  return {
    b0: r[0] ?? 0,
    b1: r[1] ?? 0,
    b2: r[2] ?? 0,
    coefficientField: "F2",
    betti: r,
    chainDimensions: i.slice(0, t + 2),
    boundaryRanks: n.slice(0, t + 2),
    maxDimension: t,
    modelRevision: s.revision,
  };
}
function hn(s) {
  if (s.simplexOffsets.length !== s.simplexDimensions.length + 1) throw new Error("Invalid simplex offsets");
  if (s.stableKeys.length !== s.simplexDimensions.length) throw new Error("Invalid stable-key table");
  if (s.filtrationValues.length !== s.simplexDimensions.length) throw new Error("Invalid filtration table");
  if ([...s.filtrationValues].some((e) => !Number.isFinite(e))) throw new Error("Invalid filtration value");
  let t = [];
  for (let e = 0; e < s.simplexDimensions.length; e++) {
    let n = s.simplexOffsets[e],
      i = s.simplexOffsets[e + 1];
    if (i < n || i > s.simplexVertices.length) throw new Error("Invalid simplex vertex range");
    let r = [...s.simplexVertices.slice(n, i)].map((o) => s.vertexKeys[o]);
    if (r.some((o) => o === void 0) || r.length !== s.simplexDimensions[e] + 1)
      throw new Error("Invalid simplex dimension or vertex index");
    t.push(r);
  }
  return { nodes: s.vertexKeys, simplices: t };
}
function mn(s, t, e = {}) {
  let n = e.maxHomologyDimension ?? 2,
    i = e.metric ?? "weight",
    r = D([...s.nodes.keys()]),
    o = new Map(r.map((u, d) => [u, d])),
    a = [...s.simplices.values()]
      .map((u) => ({ nodes: D(u.nodes), key: w(u.nodes), value: 1 - Rt(u, i) }))
      .sort((u, d) => u.nodes.length - d.nodes.length || u.key.localeCompare(d.key)),
    l = [0],
    c = [];
  for (let u of a) {
    for (let d of u.nodes) {
      let p = o.get(d);
      if (p === void 0) throw new Error(`Simplex ${u.key} references unknown vertex ${d}`);
      c.push(p);
    }
    l.push(c.length);
  }
  return {
    requestId: t,
    vertexKeys: r,
    simplexOffsets: Uint32Array.from(l),
    simplexVertices: Uint32Array.from(c),
    simplexDimensions: Uint16Array.from(a.map((u) => u.nodes.length - 1)),
    filtrationValues: Float64Array.from(a.map((u) => u.value)),
    stableKeys: a.map((u) => u.key),
    maxHomologyDimension: n,
    modelRevision: s.revision,
    metric: i,
    computeRepresentatives: e.computeRepresentatives ?? !1,
  };
}
function Le(s, t = 2) {
  return Ae(s, t);
}
function G(s, t = 2) {
  let e = new Map();
  for (let i of s.simplices.values()) {
    let r = i.nodes.length,
      o = e.get(r) ?? new Set();
    (o.add(w(i.nodes)), e.set(r, o));
  }
  let n = [];
  return (t >= 1 && n.push(...Ls(s, e)), t >= 2 && n.push(...Hs(e)), n);
}
function Ls(s, t) {
  let e = new Map([...s.nodes.keys()].map((o) => [o, new Set()]));
  for (let o of s.simplices.values()) {
    if (o.nodes.length !== 2) continue;
    let [a, l] = o.nodes;
    (e.get(a)?.add(l), e.get(l)?.add(a));
  }
  let n = t.get(3) ?? new Set(),
    i = new Set(),
    r = [];
  for (let [o, a] of e) {
    let l = D([...a]);
    for (let c = 0; c < l.length; c++)
      for (let u = c + 1; u < l.length; u++) {
        let d = l[c],
          p = l[u];
        if (!e.get(d)?.has(p)) continue;
        let h = D([o, d, p]),
          m = w(h);
        n.has(m) || i.has(m) || (i.add(m), r.push({ dimension: 1, boundaryNodes: h, missingSimplex: [...h] }));
      }
  }
  return r.sort((o, a) => w(o.missingSimplex).localeCompare(w(a.missingSimplex)));
}
function Hs(s) {
  let t = s.get(3) ?? new Set(),
    e = s.get(4) ?? new Set(),
    n = new Map(),
    i = [...t].map((o) => o.split("|"));
  for (let o = 0; o < i.length; o++)
    for (let a = o + 1; a < i.length; a++) {
      let l = D([...new Set([...i[o], ...i[a]])]);
      l.length === 4 && n.set(w(l), l);
    }
  let r = [];
  for (let [o, a] of n) {
    if (e.has(o)) continue;
    a.every((c, u) => t.has(w(a.filter((d, p) => p !== u)))) &&
      r.push({ dimension: 2, boundaryNodes: [...a], missingSimplex: [...a] });
  }
  return r.sort((o, a) => w(o.missingSimplex).localeCompare(w(a.missingSimplex)));
}
function $s(s) {
  if (!s) return "";
  try {
    return ` ${JSON.stringify(s)}`;
  } catch {
    return " [unserializable-details]";
  }
}
function He(s, t, e, n) {
  let i = `[Simplicial:${t}] ${e}${$s(n)}`;
  if (s === "error") {
    console.error(i);
    return;
  }
  if (s === "warn") {
    console.warn(i);
    return;
  }
  if (s === "debug") {
    console.debug(i);
    return;
  }
  console.debug(i);
}
var C = {
  debug(s, t, e) {
    He("debug", s, t, e);
  },
  info(s, t, e) {
    He("info", s, t, e);
  },
  warn(s, t, e) {
    He("warn", s, t, e);
  },
  error(s, t, e) {
    He("error", s, t, e);
  },
};
function $e(s, t) {
  return s + Math.random() * (t - s);
}
function Os(s, t, e) {
  let n = s / 2,
    i = t / 2,
    r = Math.max(e + 40, n - e),
    o = Math.max(e + 40, i - e);
  switch (Math.floor(Math.random() * 4)) {
    case 0:
      return { px: $e(-r, r), py: -o };
    case 1:
      return { px: r, py: $e(-o, o) };
    case 2:
      return { px: $e(-r, r), py: o };
    default:
      return { px: -r, py: $e(-o, o) };
  }
}
function Ks(s, t, e = !1) {
  let n = t?.width ?? 960,
    i = t?.height ?? 640,
    { px: r, py: o } = Os(n, i, 80);
  return { id: s, px: r, py: o, vx: 0, vy: 0, isVirtual: e, isPinned: !1, displayAlpha: 1 };
}
var me = class {
  constructor() {
    this.revision = 0;
    this.nodes = new Map();
    this.simplices = new Map();
    this.hyperedges = new Map();
    this.listeners = new Set();
    this.batchDepth = 0;
    this.hasPendingEmit = !1;
    this._analysisCache = null;
    this._analysisDirty = !0;
    this._crossLayerCache = null;
  }
  subscribe(t) {
    return (this.listeners.add(t), () => this.listeners.delete(t));
  }
  emitChange() {
    if (this.batchDepth > 0) {
      this.hasPendingEmit = !0;
      return;
    }
    this.flushChange();
  }
  flushChange() {
    this.listeners.forEach((t) => t());
  }
  batch(t) {
    this.batchDepth++;
    try {
      return t();
    } finally {
      (this.batchDepth--,
        this.batchDepth === 0 && this.hasPendingEmit && ((this.hasPendingEmit = !1), this.flushChange()));
    }
  }
  setNode(t, e) {
    let n = this.nodes.get(t);
    if (n) {
      (Object.assign(n, e ?? {}), e?.isVirtual === !1 && (n.isVirtual = !1), this.emitChange());
      return;
    }
    let i = Ks(t, void 0, e?.isVirtual ?? !1);
    (e?.px !== void 0 && (i.px = e.px),
      e?.py !== void 0 && (i.py = e.py),
      e?.isPinned !== void 0 && (i.isPinned = e.isPinned),
      this.nodes.set(t, i),
      this.invalidateAnalysisCache(),
      this.emitChange());
  }
  removeNode(t) {
    this.nodes.delete(t);
    for (let [e, n] of [...this.simplices]) n.nodes.includes(t) && this.simplices.delete(e);
    for (let [e, n] of [...this.hyperedges]) n.nodes.includes(t) && this.hyperedges.delete(e);
    (this.invalidateAnalysisCache(), this.emitChange());
  }
  updateNodeId(t, e) {
    if (t === e) return;
    let n = this.nodes.get(t);
    n && (this.nodes.set(e, { ...n, id: e }), this.nodes.delete(t));
    for (let [i, r] of [...this.simplices]) {
      if (!r.nodes.includes(t)) continue;
      let o = { ...r, nodes: D(r.nodes.map((a) => (a === t ? e : a))) };
      (this.simplices.delete(i), this.simplices.set(w(o.nodes), o));
    }
    for (let [i, r] of [...this.hyperedges]) {
      if (!r.nodes.includes(t)) continue;
      let o = { ...r, nodes: D(r.nodes.map((a) => (a === t ? e : a))) };
      (this.hyperedges.delete(i), this.hyperedges.set(M("hyperedge", o.nodes), o));
    }
    (this.invalidateAnalysisCache(), this.emitChange());
  }
  addSimplex(t) {
    if (t.kind === "hyperedge")
      return (C.error("model", "Refused to add a hyperedge through addSimplex", { nodes: t.nodes }), "");
    let e = ne(t.nodes);
    if (e.length < 2) return "";
    e.forEach((r) => {
      this.nodes.has(r) || this.setNode(r, { isVirtual: !1 });
    });
    let n = {
        ...t,
        nodes: D(e),
        weight: Oe(t.weight),
        autoGenerated: t.autoGenerated ?? !1,
        userDefined: t.userDefined ?? !t.autoGenerated,
        colorKey: t.autoGenerated ? (t.colorKey ?? "neutral") : (t.colorKey ?? te(t.label)),
      },
      i = w(n.nodes);
    return (this.simplices.set(i, n), cn(this, n), this.invalidateAnalysisCache(), this.emitChange(), i);
  }
  removeSimplex(t) {
    if (this.simplices.delete(t)) {
      for (let [e, n] of [...this.simplices]) {
        if (!n.autoGenerated) continue;
        [...this.simplices.entries()].some(([r, o]) =>
          r === e || o.autoGenerated ? !1 : n.nodes.every((a) => o.nodes.includes(a)),
        ) || this.simplices.delete(e);
      }
      (this.invalidateAnalysisCache(), this.emitChange());
    }
  }
  addHyperedge(t) {
    let e = ne(t.nodes);
    if (e.length < 2) return "";
    e.forEach((l) => {
      this.nodes.has(l) || this.setNode(l, { isVirtual: !1 });
    });
    let n = D(e),
      i = M("hyperedge", n),
      r = this.hyperedges.get(i),
      o = r?.suggested && !t.suggested ? void 0 : r,
      a = {
        ...o,
        ...t,
        nodes: n,
        weight: Oe(t.weight ?? o?.weight),
        colorKey: t.colorKey ?? o?.colorKey ?? te(t.label),
        ...(t.suggested ? {} : { occurredAt: o?.occurredAt ?? t.occurredAt ?? Date.now() }),
      };
    return (this.hyperedges.set(i, a), this.invalidateAnalysisCache(!1), this.emitChange(), i);
  }
  removeHyperedge(t) {
    return this.hyperedges.delete(t) ? (this.invalidateAnalysisCache(!1), this.emitChange(), !0) : !1;
  }
  getHyperedge(t) {
    return this.hyperedges.get(t);
  }
  getHyperedgesForNode(t) {
    return [...this.hyperedges.values()].filter((e) => e.nodes.includes(t));
  }
  updateHyperedge(t, e) {
    let n = this.hyperedges.get(t);
    if (!n) return;
    let i = { ...n, ...e, nodes: n.nodes };
    return (
      e.label !== void 0 && (i.colorKey = te(e.label)),
      e.weight !== void 0 && (i.weight = Oe(e.weight)),
      this.hyperedges.set(t, i),
      this.invalidateAnalysisCache(!1),
      this.emitChange(),
      i
    );
  }
  facesImpliedByPromotion(t) {
    let e = this.hyperedges.get(t);
    return e ? Mt(this, { nodes: e.nodes }) : [];
  }
  promoteToSimplex(t, e = {}) {
    let n = this.hyperedges.get(t);
    if (!n) return null;
    let i = this.facesImpliedByPromotion(t),
      r = "";
    return (
      this.batch(() => {
        ((r = this.addSimplex({
          nodes: n.nodes,
          label: n.label,
          weight: n.weight,
          sourcePath: n.sourcePath,
          userDefined: !0,
          autoGenerated: !1,
        })),
          e.retainEncounter === !1 ? this.hyperedges.delete(t) : this.hyperedges.set(t, { ...n, promotedTo: r }),
          this.invalidateAnalysisCache(),
          this.emitChange());
      }),
      r ? { simplexKey: r, createdFaces: i } : null
    );
  }
  relaxToHyperedge(t) {
    let e = this.simplices.get(t);
    if (!e || e.autoGenerated) return null;
    let n = M("hyperedge", e.nodes),
      i = this.hyperedges.get(n),
      r = "";
    return (
      this.batch(() => {
        ((r = this.addHyperedge({
          ...i,
          nodes: e.nodes,
          label: i?.label ?? e.label,
          weight: i?.weight ?? e.weight,
          sourcePath: i?.sourcePath ?? e.sourcePath,
          occurredAt: i?.occurredAt,
          promotedTo: void 0,
        })),
          this.removeSimplex(t));
      }),
      r || null
    );
  }
  crystallizeHyperedge(t, e) {
    let n = this.hyperedges.get(t);
    return n
      ? (this.batch(() => {
          (this.nodes.has(e) || this.setNode(e, { isVirtual: !1 }),
            this.hyperedges.set(t, { ...n, crystallizedInto: e }),
            this.invalidateAnalysisCache(),
            this.emitChange());
        }),
        !0)
      : !1;
  }
  getAllRelations() {
    let t = [];
    return (
      this.simplices.forEach((e, n) => {
        t.push({ key: M("simplex", e.nodes), relation: { kind: "simplex", ...e } });
      }),
      this.hyperedges.forEach((e, n) => {
        t.push({ key: n, relation: { kind: "hyperedge", ...e } });
      }),
      t
    );
  }
  replaceInferredSimplices(t) {
    this.batch(() => {
      for (let [e, n] of [...this.simplices]) n.inferred && this.simplices.delete(e);
      (t.forEach((e) => {
        (e.nodes.forEach((n) => {
          this.nodes.has(n) || this.setNode(n, { isVirtual: !1 });
        }),
          this.addSimplex(e));
      }),
        this.invalidateAnalysisCache(),
        this.emitChange());
    });
  }
  replaceInferredHyperedges(t) {
    this.batch(() => {
      for (let [e, n] of this.hyperedges)
        n.inferred && n.suggested && n.suggestionSource !== "encounter-discovery" && this.hyperedges.delete(e);
      (t.forEach((e) => this.addHyperedge({ ...e, inferred: !0, suggested: !0, suggestionSource: "inference" })),
        this.invalidateAnalysisCache(!1),
        this.emitChange());
    });
  }
  replaceSourceRelations(t, e, n) {
    this.batch(() => {
      for (let [i, r] of [...this.simplices]) r.sourcePath === t && !r.autoGenerated && this.simplices.delete(i);
      for (let [i, r] of [...this.hyperedges]) r.sourcePath === t && this.hyperedges.delete(i);
      (e.forEach((i) => {
        (i.nodes.forEach((r) => {
          this.nodes.has(r) || this.setNode(r, { isVirtual: !0 });
        }),
          this.addSimplex({ ...i, sourcePath: t }));
      }),
        n.forEach((i) => {
          (i.nodes.forEach((r) => {
            this.nodes.has(r) || this.setNode(r, { isVirtual: !0 });
          }),
            this.addHyperedge({ ...i, sourcePath: t }));
        }),
        this.invalidateAnalysisCache(),
        this.emitChange());
    });
  }
  replaceSourceSimplices(t, e) {
    this.replaceSourceRelations(t, e, []);
  }
  updateMetadata(t, e) {
    let n = this.simplices.get(t);
    if (!n) return;
    let i = { ...n, ...e };
    (e.label !== void 0 && (i.colorKey = n.autoGenerated ? "neutral" : te(e.label)),
      e.weight !== void 0 && (i.weight = Oe(e.weight)),
      this.simplices.set(t, i),
      this.invalidateAnalysisCache(),
      this.emitChange());
  }
  setPinnedState(t, e, n, i) {
    let r = this.nodes.get(t);
    r && ((r.isPinned = e), n !== void 0 && (r.px = n), i !== void 0 && (r.py = i), this.emitChange());
  }
  getSimplicesForNode(t) {
    return [...this.simplices.values()].filter((e) => e.nodes.includes(t));
  }
  getNeighbors(t) {
    let e = new Set();
    return (
      this.getSimplicesForNode(t).forEach((n) => {
        n.nodes.forEach((i) => {
          i !== t && e.add(i);
        });
      }),
      [...e]
    );
  }
  getSimplicesByDim(t) {
    return [...this.simplices.values()].filter((e) => e.nodes.length - 1 === t);
  }
  getAllNodes() {
    return [...this.nodes.values()];
  }
  getSimplex(t) {
    return this.simplices.get(t);
  }
  invalidateAnalysisCache(t = !0) {
    ((this._analysisDirty = !0), (this._crossLayerCache = null), t && this.revision++);
  }
  readCrossLayerCache() {
    return this._crossLayerCache;
  }
  writeCrossLayerCache(t) {
    return ((this._crossLayerCache = t), t);
  }
  getAnalysisSummary() {
    return !this._analysisDirty && this._analysisCache
      ? this._analysisCache
      : ((this._analysisCache = this.computeAnalysisSummary()), (this._analysisDirty = !1), this._analysisCache);
  }
  getCachedBetti() {
    return !this._analysisDirty && this._analysisCache ? (this._analysisCache.betti ?? Le(this, 2)) : Le(this, 2);
  }
  computeAnalysisSummary() {
    let t = [...this.simplices.values()],
      e = t.filter((f) => f.nodes.length === 2),
      n = new Map(),
      i = new Map();
    (this.nodes.forEach((f, v) => n.set(v, new Set())),
      this.nodes.forEach((f, v) => i.set(v, 0)),
      e.forEach((f) => {
        let [v, y] = f.nodes;
        (n.get(v)?.add(y), n.get(y)?.add(v));
      }),
      t.forEach((f) => {
        f.nodes.forEach((v) => {
          i.set(v, (i.get(v) ?? 0) + 1);
        });
      }));
    let r = 0,
      o = new Set();
    n.forEach((f, v) => {
      if (o.has(v)) return;
      r++;
      let y = [v];
      for (; y.length > 0;) {
        let b = y.pop();
        o.has(b) ||
          (o.add(b),
          n.get(b)?.forEach((x) => {
            o.has(x) || y.push(x);
          }));
      }
    });
    let a = null,
      l = -1,
      c = 0;
    n.forEach((f, v) => {
      let y = f.size;
      ((c += y), y > l && ((l = y), (a = v)));
    });
    let u = null,
      d = -1,
      p = 0;
    i.forEach((f, v) => {
      ((p += f), f > d && ((d = f), (u = v)));
    });
    let h = Le(this, 2),
      m = G(this, 2).length,
      g = [...this.hyperedges.values()];
    return {
      nodeCount: this.nodes.size,
      simplexCount: t.length,
      hyperedgeCount: g.length,
      recurringEncounterCount: g.filter((f) => f.persistence === "recurring").length,
      edgeCount: e.length,
      clusterCount: t.filter((f) => f.nodes.length === 3).length,
      coreCount: t.filter((f) => f.nodes.length >= 4).length,
      inferredCount: t.filter((f) => f.inferred).length,
      suggestedCount: t.filter((f) => f.suggested).length,
      connectedComponents: r,
      averageDegree: this.nodes.size ? Number((c / this.nodes.size).toFixed(2)) : 0,
      maxDegreeNodeId: a,
      maxDegree: Math.max(0, l),
      maxSimplexCentralityNodeId: u,
      maxSimplexCentrality: Math.max(0, d),
      averageSimplexCentrality: this.nodes.size ? Number((p / this.nodes.size).toFixed(2)) : 0,
      betti: h,
      missingFaceCount: m,
    };
  }
};
function Oe(s) {
  return s === void 0 || Number.isNaN(s) ? 1 : Math.max(0.1, Math.min(1, s));
}
var Ke = class {
  constructor() {
    this.events = [];
    this.listeners = new Set();
  }
  onAppend(t) {
    return (this.listeners.add(t), () => this.listeners.delete(t));
  }
  append(t) {
    let e = [...t.nodes],
      n = Object.freeze({
        timestamp: t.timestamp ?? Date.now(),
        type: t.type,
        kind: t.kind,
        relationKey: M(t.kind, e),
        nodeKey: w(e),
        nodes: Object.freeze(e),
        actor: t.actor,
        ...(t.prior ? { prior: Object.freeze({ ...t.prior }) } : {}),
        ...(t.detail ? { detail: Object.freeze({ ...t.detail }) } : {}),
      });
    return (this.events.push(n), this.listeners.forEach((i) => i(n)), n);
  }
  all() {
    return [...this.events];
  }
  get size() {
    return this.events.length;
  }
  forRelation(t) {
    return this.events.filter((e) => e.relationKey === t);
  }
  forNodes(t) {
    let e = w(t);
    return this.events.filter((n) => n.nodeKey === e);
  }
  replayAt(t) {
    let e = new Map(),
      n = new Map();
    return (
      this.events
        .filter((i) => i.timestamp <= t)
        .sort((i, r) => i.timestamp - r.timestamp)
        .forEach((i) => {
          let r = M("simplex", [...i.nodes]),
            o = M("hyperedge", [...i.nodes]);
          switch (i.type) {
            case "encountered":
            case "recurred":
              n.set(o, i.nodes);
              break;
            case "created":
              (i.kind === "simplex" ? e : n).set(i.relationKey, i.nodes);
              break;
            case "promoted":
              (n.set(o, i.nodes), e.set(r, i.nodes));
              break;
            case "relaxed":
              (e.delete(r), n.set(o, i.nodes));
              break;
            case "dissolved":
              (i.kind === "simplex" ? e : n).delete(i.relationKey);
              break;
            case "crystallized":
              break;
          }
        }),
      Object.freeze({ timestamp: t, simplices: e, hyperedges: n })
    );
  }
  lineage() {
    return this.events.flatMap((t) =>
      t.type === "promoted"
        ? [
            {
              type: "promotion",
              timestamp: t.timestamp,
              source: M("hyperedge", [...t.nodes]),
              target: M("simplex", [...t.nodes]),
              ...(Array.isArray(t.detail?.evidence) ? { evidence: t.detail.evidence.map(String) } : {}),
            },
          ]
        : t.type === "crystallized" && typeof t.detail?.conceptNote == "string"
          ? [
              {
                type: "crystallization",
                timestamp: t.timestamp,
                source: M("hyperedge", [...t.nodes]),
                target: `n:${t.detail.conceptNote}`,
              },
            ]
          : [],
    );
  }
  lineageFor(t) {
    let e = t.startsWith("n:") ? t : `n:${t}`;
    return this.lineage().filter((n) => n.source === t || n.target === t || n.target === e);
  }
  get timeRange() {
    return this.events.length === 0
      ? null
      : { start: this.events[0].timestamp, end: this.events[this.events.length - 1].timestamp };
  }
  occurrencesOf(t) {
    return this.forNodes(t)
      .filter((e) => e.type === "encountered" || e.type === "recurred")
      .map((e) => e.timestamp)
      .sort((e, n) => e - n);
  }
  isRecurring(t, e) {
    return this.occurrencesOf(t).length >= Math.max(2, e);
  }
  load(t) {
    (t.forEach((e) => this.events.push(Object.freeze({ ...e, nodes: Object.freeze([...e.nodes]) }))),
      this.events.sort((e, n) => e.timestamp - n.timestamp));
  }
};
function gn(s, t, e) {
  let n = 0;
  return (
    [...s.hyperedges].forEach(([i, r]) => {
      let o = t.occurrencesOf(r.nodes),
        a = t.isRecurring(r.nodes, e) ? "recurring" : "momentary";
      ((r.occurrences?.length ?? 0) === o.length && r.persistence === a) ||
        (s.updateHyperedge(i, { occurrences: o, persistence: a }), n++);
    }),
    n
  );
}
var Bs = new Set(["encountered", "recurred", "created", "promoted", "relaxed", "crystallized", "dissolved"]);
function fn(s) {
  return JSON.stringify({
    t: s.timestamp,
    e: s.type,
    k: s.kind,
    n: s.nodes,
    a: s.actor,
    ...(s.prior ? { p: s.prior } : {}),
    ...(s.detail ? { d: s.detail } : {}),
  });
}
function yn(s) {
  let t = s.trim();
  if (!t.startsWith("{")) return null;
  let e;
  try {
    e = JSON.parse(t);
  } catch {
    return null;
  }
  let n = String(e.e ?? ""),
    i = e.k === "hyperedge" ? "hyperedge" : "simplex",
    r = Array.isArray(e.n) ? e.n.map(String) : [],
    o = typeof e.t == "number" ? e.t : NaN;
  return !Bs.has(n) || r.length === 0 || Number.isNaN(o)
    ? null
    : Object.freeze({
        timestamp: o,
        type: n,
        kind: i,
        relationKey: M(i, r),
        nodeKey: w(r),
        nodes: Object.freeze(r),
        actor: e.a === "user" || e.a === "inference" || e.a === "parser" ? e.a : "user",
        ...(e.p && typeof e.p == "object" ? { prior: Object.freeze(e.p) } : {}),
        ...(e.d && typeof e.d == "object" ? { detail: Object.freeze(e.d) } : {}),
      });
}
var _s = { opened: 1, edited: 1, focused: 0.7, query: 0.5, recency: 0.25 },
  Ws = { halfLifeMinutes: 30, sourceWeights: _s };
function It(s) {
  return Math.max(0, Math.min(1, s));
}
var Be = class {
    constructor(t = Ws) {
      this.config = t;
      this.stamps = new Map();
    }
    configure(t) {
      this.config = { ...this.config, ...t };
    }
    register(t, e, n = Date.now()) {
      let i = this.config.sourceWeights[e] ?? 0;
      if (i <= 0) return;
      let r = this.valueAt(t, n);
      this.stamps.set(t, { value: It(Math.max(r, i)), at: n });
    }
    clear() {
      this.stamps.clear();
    }
    valueAt(t, e = Date.now()) {
      let n = this.stamps.get(t);
      if (!n) return 0;
      let i = Math.max(0, (e - n.at) / 6e4);
      return this.config.halfLifeMinutes <= 0 ? 0 : n.value * Math.pow(0.5, i / this.config.halfLifeMinutes);
    }
    field(t = Date.now()) {
      let e = new Map();
      return (
        this.stamps.forEach((n, i) => {
          let r = this.valueAt(i, t);
          r > 0.001 && e.set(i, r);
        }),
        e
      );
    }
    get size() {
      return this.stamps.size;
    }
  },
  kt = ["pairwise", "simplicial", "hypergraph"];
function zs(s, t) {
  if (t === "hypergraph") return [...s.hyperedges.values()].map((n) => n.nodes);
  let e = [...s.simplices.values()];
  return t === "pairwise"
    ? e.filter((n) => n.nodes.length === 2).map((n) => n.nodes)
    : e.filter((n) => n.nodes.length >= 2).map((n) => n.nodes);
}
function Nt(s, t) {
  let e = zs(s, t),
    n = new Map();
  return (
    e.forEach((i, r) => {
      i.forEach((o) => {
        let a = n.get(o) ?? [];
        (a.push(r), n.set(o, a));
      });
    }),
    {
      name: t,
      groups: e,
      step(i, r) {
        let o = e.map((l) => (l.length === 0 ? 0 : l.reduce((c, u) => c + (i.get(u) ?? 0), 0) / l.length)),
          a = new Map(i);
        return (
          n.forEach((l, c) => {
            let u = i.get(c) ?? 0,
              d = l.reduce((p, h) => p + o[h], 0) / l.length;
            a.set(c, It(u + r * (d - u)));
          }),
          a
        );
      },
    }
  );
}
function bn(s, t, e, n = 0.4) {
  let i = t;
  for (let r = 0; r < e; r++) i = s.step(i, n);
  return i;
}
function js(s) {
  let t = s >>> 0;
  return () => {
    t = (t + 1831565813) >>> 0;
    let e = t;
    return (
      (e = Math.imul(e ^ (e >>> 15), e | 1)),
      (e ^= e + Math.imul(e ^ (e >>> 7), e | 61)),
      ((e ^ (e >>> 14)) >>> 0) / 4294967296
    );
  };
}
function Tt(s) {
  if (s.length === 0) return 0;
  let t = s.reduce((e, n) => e + n, 0) / s.length;
  return s.reduce((e, n) => e + (n - t) ** 2, 0) / s.length;
}
function vn(s) {
  return It(1 - 2 * Math.sqrt(Tt(s)));
}
var Vs = { seed: 20260401, rate: 0.35, threshold: 1e-4, maxIterations: 400 };
async function xn(s, t, e, n = {}) {
  let i = s.getHyperedge(t);
  if (!i) return null;
  let r = { ...Vs, ...n },
    o = Math.max(1, Math.floor(n.sliceIterations ?? 20)),
    a = n.yieldControl ?? (() => Promise.resolve()),
    l = n.isCancelled ?? (() => !1),
    c = Nt(s, e),
    u = js(r.seed),
    d = new Map();
  [...s.nodes.keys()].sort().forEach((g) => d.set(g, u()));
  let p = (g) => i.nodes.map((f) => g.get(f) ?? 0),
    h = [vn(p(d))],
    m = null;
  for (let g = 1; g <= r.maxIterations; g++) {
    if (l()) return null;
    d = c.step(d, r.rate);
    let f = p(d);
    if ((h.push(vn(f)), Tt(f) <= r.threshold)) {
      m = g;
      break;
    }
    g % o === 0 && (await a());
  }
  return {
    kernel: e,
    relationKey: t,
    members: i.nodes,
    iterations: m,
    converged: m !== null,
    orderTrace: h,
    finalVariance: Tt(p(d)),
  };
}
function Sn(s, t = 5) {
  let e = [];
  for (let n = 0; n < s.length; n++)
    for (let i = n + 1; i < s.length; i++) {
      let r = s[n],
        o = s[i];
      if (r.iterations === null || o.iterations === null) continue;
      let a = r.members.filter((c) => o.members.includes(c));
      if (a.length === 0) continue;
      let l = Math.abs(r.iterations - o.iterations);
      l < t || e.push({ a: r.relationKey, b: o.relationKey, sharedNodes: a, separation: l });
    }
  return e.sort((n, i) => i.separation - n.separation);
}
var Gs = { k: 8, minClusterSize: 3, maxIterations: 100 };
function Pt(s, t = {}) {
  let e = { ...Gs, ...t };
  if (s.length < e.minClusterSize) return new Map(s.map((o) => [o.path, "default"]));
  let n = Math.min(e.k, Math.floor(s.length / e.minClusterSize));
  if (n < 2) return new Map(s.map((o) => [o.path, "default"]));
  let i = Ft(s),
    r = qs(i, n, e.maxIterations);
  return new Map(r.map((o, a) => [i[a].path, `cluster-${o}`]));
}
function Ft(s) {
  let t = s.length,
    e = new Map(),
    n = [];
  for (let r of s) {
    let o = new Map();
    for (let a of r.titleTokens) o.set(a, (o.get(a) ?? 0) + 3);
    for (let a of r.contentTokens) o.set(a, (o.get(a) ?? 0) + 1);
    for (let a of r.tags) {
      let l = a.replace(/^#/, "");
      o.set(l, (o.get(l) ?? 0) + 5);
    }
    for (let a of o.keys()) e.set(a, (e.get(a) ?? 0) + 1);
    n.push(o);
  }
  let i = new Map();
  for (let [r, o] of e) i.set(r, Math.log(t / (o + 1)) + 1);
  return s.map((r, o) => {
    let a = n[o],
      l = new Map(),
      c = 0;
    for (let [u, d] of a) {
      let p = d * (i.get(u) ?? 1);
      (l.set(u, p), (c += p * p));
    }
    return { path: r.path, vector: l, magnitude: Math.sqrt(c) };
  });
}
function At(s, t) {
  if (s.magnitude === 0 || t.magnitude === 0) return 0;
  let e = 0;
  for (let [n, i] of s.vector) {
    let r = t.vector.get(n);
    r !== void 0 && (e += i * r);
  }
  return e / (s.magnitude * t.magnitude);
}
function qs(s, t, e) {
  let n = s.length,
    i = new Array(n).fill(0).map(() => Math.floor(Math.random() * t)),
    r = [];
  for (let o = 0; o < e; o++) {
    for (let l = 0; l < t; l++) {
      let c = s.filter((p, h) => i[h] === l);
      if (c.length === 0) {
        r[l] = new Map(s[Math.floor(Math.random() * n)].vector);
        continue;
      }
      let u = new Map(),
        d = new Map();
      for (let p of c) for (let [h, m] of p.vector) (d.set(h, (d.get(h) ?? 0) + 1), u.set(h, (u.get(h) ?? 0) + m));
      for (let [p, h] of u) u.set(p, h / c.length);
      r[l] = u;
    }
    let a = !1;
    for (let l = 0; l < n; l++) {
      let c = s[l],
        u = 0,
        d = -1;
      for (let p = 0; p < t; p++) {
        let h = {
            path: `centroid-${p}`,
            vector: r[p],
            magnitude: Math.sqrt([...r[p].values()].reduce((g, f) => g + f * f, 0)),
          },
          m = At(c, h);
        m > d && ((d = m), (u = p));
      }
      i[l] !== u && ((i[l] = u), (a = !0));
    }
    if (!a) break;
  }
  return i;
}
function wn(s, t) {
  let e = new Map();
  for (let n of s) {
    let i = t.get(n.path);
    !i || i === "default" ? e.set(n.path, n.topFolder || n.folder || "misc") : e.set(n.path, i);
  }
  return e;
}
function Cn(s, t) {
  return [s, t].sort().join("|");
}
function Us(s, t) {
  let e = new Set(s);
  return t.filter((n) => e.has(n));
}
function Ys(s, t, e, n, i = 0) {
  let r = 0,
    o = e.get(s.id),
    a = e.get(t.id),
    l = o?.outgoingLinks.has(t.id) ?? !1,
    c = a?.outgoingLinks.has(s.id) ?? !1;
  l && c ? (r += 0.8) : (l || c) && (r += 0.5);
  let u = Us(s.tags, t.tags),
    d = [...e.values()].flatMap((y) => [...y.tags]),
    p = new Map();
  for (let y of d) p.set(y, (p.get(y) ?? 0) + 1);
  let h = e.size,
    m = new Set(),
    g = new Set();
  for (let [y, b] of p.entries()) b / h < n.tagRarityThreshold ? m.add(y) : g.add(y);
  let f = u.filter((y) => m.has(y)),
    v = u.filter((y) => g.has(y));
  return (
    (r += f.length * 0.15),
    (r -= v.length * 0.1),
    s.domain && t.domain && s.domain === t.domain && (r += 0.15),
    (r += i * 0.35),
    Math.max(0, Math.min(1, r))
  );
}
function _e(s, t) {
  let e = new Map(),
    n = new Map(s.map((p) => [p.path, p])),
    i;
  if (t.domainSource === "content-cluster") i = Pt(s, { k: t.contentClusterCount });
  else if (t.domainSource === "hybrid") {
    let p = Pt(s, { k: t.contentClusterCount });
    i = wn(s, p);
  } else i = new Map(s.map((p) => [p.path, p.topFolder || p.folder || ""]));
  for (let p of s)
    e.set(p.path, {
      id: p.path,
      role: p.role,
      domain: i.get(p.path) || p.topFolder || p.folder || "",
      tags: [...p.tags],
      modifiedAt: p.modifiedAt,
      linkCount: p.outgoingLinks.size,
    });
  let r = new Map(),
    o = [...e.values()],
    a = Ft(s),
    l = new Map(a.map((p) => [p.path, p]));
  for (let p = 0; p < o.length; p++)
    for (let h = p + 1; h < o.length; h++) {
      let m = o[p],
        g = o[h],
        f = l.get(m.id),
        v = l.get(g.id),
        y = f && v ? At(f, v) : 0,
        b = Ys(m, g, n, t, y),
        x = Cn(m.id, g.id);
      r.set(x, { a: m.id, b: g.id, strength: b });
    }
  let c = new Map();
  for (let p of r.values()) p.strength > 0 && (c.set(p.a, (c.get(p.a) ?? 0) + 1), c.set(p.b, (c.get(p.b) ?? 0) + 1));
  let d = [...c.values()].reduce((p, h) => p + h, 0) / Math.max(c.size, 1);
  for (let [p, h] of r) {
    let m = c.get(h.a) ?? 1,
      g = c.get(h.b) ?? 1,
      v = 0.5 + 0.5 * Math.min(1, (d * d) / (m * g));
    r.set(p, { ...h, strength: Math.min(1, h.strength * v) });
  }
  return { nodes: e, edges: r };
}
function z(s, t, e) {
  let n = Cn(s, t);
  return e.edges.get(n)?.strength ?? 0;
}
function ge(s, t, e) {
  let n = [];
  for (let i of e.edges.values()) i.strength < t || (i.a === s ? n.push(i.b) : i.b === s && n.push(i.a));
  return n;
}
function En(s, t) {
  let e = _e(s, t);
  return (n) => Xs(n, e);
}
function Xs(s, t) {
  if (s.length < 2) return 0;
  let e = 0,
    n = 0;
  for (let i = 0; i < s.length; i++) for (let r = i + 1; r < s.length; r++) ((e += z(s[i], s[r], t)), n++);
  return n > 0 ? e / n : 0;
}
function Mn(s, t) {
  let e = new Map(),
    n = [...s.simplices.values()].filter((o) => !o.autoGenerated && o.nodes.length >= 3 && o.nodes.length <= 6),
    i = (o, a, l) => {
      let c = M("hyperedge", o);
      if (s.hyperedges.has(c)) return;
      let u = e.get(c);
      (!u || a > u.structural) && e.set(c, { nodes: [...o].sort(), structural: a, reason: l });
    };
  n.forEach((o) => i(o.nodes, 0.62 + 0.28 * (o.confidence ?? o.weight ?? 0.5), "coherent field"));
  let r = new Map();
  return (
    n.forEach((o) => o.nodes.forEach((a) => r.set(a, [...(r.get(a) ?? []), o]))),
    r.forEach((o, a) => {
      for (let l = 0; l < o.length; l++)
        for (let c = l + 1; c < o.length; c++) {
          let u = o[l].nodes.find((p) => p !== a && !o[c].nodes.includes(p)),
            d = o[c].nodes.find((p) => p !== a && !o[l].nodes.includes(p));
          u && d && i([a, u, d], 0.58, "cross-field junction");
        }
    }),
    [...e.values()]
      .map(({ nodes: o, structural: a, reason: l }) => {
        let c = t.score?.(o) ?? a,
          u = Math.max(0, Math.min(1, a * 0.7 + c * 0.3));
        return {
          nodes: o,
          label: `Possible encounter \xB7 ${l}`,
          mode: "suggested",
          weight: u,
          confidence: u,
          suggested: !0,
          inferred: !0,
          suggestionSource: "encounter-discovery",
        };
      })
      .filter((o) => (o.confidence ?? 0) >= t.threshold)
      .sort((o, a) => (a.confidence ?? 0) - (o.confidence ?? 0))
      .slice(0, Math.max(0, t.limit))
  );
}
function Lt() {
  return { events: [], nodeScores: new Map(), simplexScores: new Map() };
}
function q(s, t) {
  let e = { ...t, timestamp: Date.now() };
  s.events.push(e);
  let n = Zs(t.type);
  if (t.simplexKey && t.type !== "hover") {
    let i = s.simplexScores.get(t.simplexKey) ?? 1;
    s.simplexScores.set(t.simplexKey, Math.min(3, i + n));
  }
  if (t.nodeIds)
    for (let i of t.nodeIds) {
      let r = s.nodeScores.get(i) ?? 1;
      s.nodeScores.set(i, Math.min(3, r + n * 0.5));
    }
  Js(s);
}
function Zs(s) {
  switch (s) {
    case "confirm":
      return 0.5;
    case "promote":
      return 0.8;
    case "create":
      return 0.6;
    case "reject":
      return -0.3;
    case "dissolve":
      return -0.5;
    case "select":
      return 0.1;
    case "hover":
      return 0.02;
    default:
      return 0;
  }
}
function Js(s) {
  let t = Date.now() - 2592e6;
  s.events = s.events.filter((e) => e.timestamp > t);
}
function Rn(s, t, e) {
  let n = 1;
  if (t) {
    let i = s.simplexScores.get(t) ?? 1;
    n *= i;
  }
  if (e && e.length > 0) {
    let i = e.reduce((r, o) => r + (s.nodeScores.get(o) ?? 1), 0) / e.length;
    n *= 1 + (i - 1) * 0.3;
  }
  return Math.min(3, Math.max(0.3, n));
}
function Dn(s) {
  return {
    events: s.events.slice(-100),
    nodeScores: Array.from(s.nodeScores.entries()),
    simplexScores: Array.from(s.simplexScores.entries()),
  };
}
function Tn(s) {
  let t = Lt();
  if (typeof s != "object" || s === null) return t;
  let e = s;
  if (
    (Array.isArray(e.events) &&
      (t.events = e.events.filter((n) => {
        if (typeof n != "object" || n === null) return !1;
        let i = n;
        return typeof i.timestamp == "number" && typeof i.type == "string";
      })),
    Array.isArray(e.nodeScores))
  )
    for (let [n, i] of e.nodeScores) typeof i == "number" && t.nodeScores.set(n, i);
  if (Array.isArray(e.simplexScores))
    for (let [n, i] of e.simplexScores) typeof i == "number" && t.simplexScores.set(n, i);
  return t;
}
function Qs(s, t) {
  let e = Math.abs(s),
    n = Math.abs(t);
  for (; n;) {
    let i = e % n;
    ((e = n), (n = i));
  }
  return e || 1;
}
function ie(s, t = 1) {
  if (t === 0) throw new Error("linalg: zero denominator");
  let e = t < 0 ? -1 : 1,
    n = Qs(s, t);
  return { n: (e * s) / n, d: (e * t) / n };
}
function Ht(s) {
  return s.n === 0;
}
function In(s, t) {
  return ie(s.n * t.d + t.n * s.d, s.d * t.d);
}
function $t(s, t) {
  return ie(s.n * t.d - t.n * s.d, s.d * t.d);
}
function er(s, t) {
  return ie(s.n * t.n, s.d * t.d);
}
function tr(s, t) {
  if (Ht(t)) throw new Error("linalg: division by zero");
  return ie(s.n * t.d, s.d * t.n);
}
function nr(s) {
  let t = s.map((o) => [...o]),
    e = t.length,
    n = e > 0 ? t[0].length : 0,
    i = [],
    r = 0;
  for (let o = 0; o < n && r < e; o++) {
    let a = -1;
    for (let c = r; c < e; c++)
      if (!Ht(t[c][o])) {
        a = c;
        break;
      }
    if (a === -1) continue;
    [t[r], t[a]] = [t[a], t[r]];
    let l = t[r][o];
    for (let c = o; c < n; c++) t[r][c] = tr(t[r][c], l);
    for (let c = 0; c < e; c++) {
      if (c === r || Ht(t[c][o])) continue;
      let u = t[c][o];
      for (let d = o; d < n; d++) t[c][d] = $t(t[c][d], er(u, t[r][d]));
    }
    (i.push(o), r++);
  }
  return { reduced: t, pivotColumns: i };
}
function Ot(s) {
  return s.length === 0 ? 0 : nr(s).pivotColumns.length;
}
var U = ["action", "project", "research", "idea", "creative", "reference"];
function F(s, t) {
  let e = new Set();
  return (
    t.relations.forEach((n) => {
      let i = s.getHyperedge(n);
      if (i) {
        i.nodes.forEach((a) => e.add(a));
        return;
      }
      let r = n.startsWith("s:") ? n.slice(2) : n;
      s.getSimplex(r)?.nodes.forEach((a) => e.add(a));
    }),
    [...e].sort()
  );
}
function ir(s) {
  return U.map((t) => ie(t === s ? 1 : 0));
}
function kn(s, t) {
  let e = new Map(t.map((i) => [i.id, new Set(F(s, i))])),
    n = [];
  for (let i = 0; i < t.length; i++)
    for (let r = i + 1; r < t.length; r++) {
      let o = e.get(t[i].id),
        a = e.get(t[r].id),
        l = [...o].filter((c) => a.has(c)).sort();
      l.length !== 0 && n.push({ a: t[i].id, b: t[r].id, nodes: l });
    }
  return n;
}
function sr(s, t, e) {
  let n = t.sections.get(e.a),
    i = t.sections.get(e.b);
  if (!n || !i) return { ...e, agrees: !0, disagreeingNodes: [] };
  let r = e.nodes.map((u) => ({ id: u, a: n.get(u), b: i.get(u) })).filter((u) => u.a !== void 0 && u.b !== void 0);
  if (r.length <= 1) return { ...e, agrees: !0, disagreeingNodes: [] };
  let o = r.every((u) => u.a === u.b),
    a = r[0],
    l = r.every((u) => u.a === a.a && u.b === a.b);
  if (o || l) return { ...e, agrees: !0, disagreeingNodes: [] };
  let c = r.filter((u) => u.a !== u.b).map((u) => u.id);
  return { ...e, agrees: !1, disagreeingNodes: c };
}
function Nn(s, t) {
  let e = [],
    n = new Map(),
    i = new Set(),
    r = (o, a, l, c) => {
      (i.add(o), i.add(a));
      let u = n.get(o) ?? [];
      (u.push({ to: a, edgeIndex: l, forward: c }), n.set(o, u));
    };
  return (
    t.contexts.forEach((o) => {
      let a = t.sections.get(o.id);
      a &&
        F(s, o).forEach((l) => {
          let c = a.get(l);
          if (!c) return;
          let u = e.length;
          (e.push({ nodeId: l, contextId: o.id, value: ir(c) }),
            r(`n:${l}`, `c:${o.id}`, u, !0),
            r(`c:${o.id}`, `n:${l}`, u, !1));
        });
    }),
    { edges: e, adjacency: n, vertices: [...i].sort() }
  );
}
function Pn(s, t) {
  let e = Nn(s, t),
    n = new Map(),
    i = new Map(),
    r = new Set(),
    o = [];
  e.vertices.forEach((l) => {
    if (n.has(l)) return;
    (n.set(l, null), i.set(l, 0));
    let c = [l];
    for (; c.length > 0;) {
      let u = c.shift();
      for (let d of e.adjacency.get(u) ?? [])
        r.has(d.edgeIndex) ||
          n.has(d.to) ||
          (r.add(d.edgeIndex),
          n.set(d.to, { vertex: u, edgeIndex: d.edgeIndex, forward: d.forward }),
          i.set(d.to, (i.get(u) ?? 0) + 1),
          c.push(d.to));
    }
  });
  let a = (l) => {
    let c = [l],
      u = l;
    for (;;) {
      let d = n.get(u);
      if (!d) break;
      ((u = d.vertex), c.push(u));
    }
    return c;
  };
  return (
    e.edges.forEach((l, c) => {
      if (r.has(c)) return;
      let u = `n:${l.nodeId}`,
        d = `c:${l.contextId}`,
        p = a(u),
        h = a(d),
        m = new Map(h.map((b, x) => [b, x])),
        g = -1,
        f = -1;
      for (let b = 0; b < p.length; b++) {
        let x = m.get(p[b]);
        if (x !== void 0) {
          ((g = b), (f = x));
          break;
        }
      }
      if (g === -1) return;
      let v = [...p.slice(0, g + 1), ...h.slice(0, f).reverse()],
        y = rr(v, c, e);
      o.push({
        vertices: v,
        contexts: [...new Set(v.filter((b) => b.startsWith("c:")).map((b) => b.slice(2)))].sort(),
        nodes: [...new Set(v.filter((b) => b.startsWith("n:")).map((b) => b.slice(2)))].sort(),
        holonomy: y,
        closes: y.every((b) => b.n === 0),
      });
    }),
    o
  );
}
function rr(s, t, e) {
  let n = U.map(() => ie(0)),
    i = (r, o) => {
      n = n.map((a, l) => (o ? In(a, r.value[l]) : $t(a, r.value[l])));
    };
  for (let r = 0; r + 1 < s.length; r++) {
    let o = (e.adjacency.get(s[r]) ?? []).find((a) => a.to === s[r + 1]);
    o && i(e.edges[o.edgeIndex], o.forward);
  }
  return (i(e.edges[t], !1), n);
}
function Kt(s, t) {
  let i = kn(s, t.contexts)
      .map((d) => sr(s, t, d))
      .filter((d) => !d.agrees),
    r = Pn(s, t),
    a = r.filter((d) => !d.closes).map((d) => d.holonomy),
    l = a.length > 0 ? Ot(a) : 0,
    c = or(s, t),
    u = l === 0;
  return {
    pairwiseDisagreements: i,
    cycles: r,
    obstructionRank: l,
    globalBaselineDimension: u ? c * U.length : 0,
    glues: u,
    contextualityDetected: l > 0 && i.length === 0,
  };
}
function or(s, t) {
  let e = Nn(s, t),
    n = new Set(),
    i = 0;
  return (
    e.vertices.forEach((r) => {
      if (n.has(r)) return;
      i++;
      let o = [r];
      for (; o.length > 0;) {
        let a = o.pop();
        n.has(a) ||
          (n.add(a),
          (e.adjacency.get(a) ?? []).forEach((l) => {
            n.has(l.to) || o.push(l.to);
          }));
      }
    }),
    i
  );
}
function ar(s) {
  let t = s.cycles.filter((i) => !i.closes),
    e = [],
    n = [];
  for (let i of t) {
    let r = [...n, i.holonomy];
    if (
      !(Ot(r) <= n.length) &&
      (n.push(i.holonomy),
      e.push({
        contexts: i.contexts,
        nodes: i.nodes,
        magnitude: i.holonomy.reduce((o, a) => o + Math.abs(a.n / a.d), 0),
      }),
      e.length >= s.obstructionRank)
    )
      break;
  }
  return e;
}
var lr = 12;
function cr(s) {
  let t = 0,
    e = s;
  for (; e;) ((e &= e - 1), t++);
  return t;
}
function dr(s, t) {
  let e = t.contexts;
  if (e.length === 0) return { value: 1, consistentContexts: [], exact: !0 };
  if (Kt(s, t).glues) return { value: 1, consistentContexts: e.map((r) => r.id), exact: !0 };
  let n = (r) => Kt(s, { contexts: e.filter((o) => r.has(o.id)), sections: t.sections }).glues;
  if (e.length <= lr) {
    for (let r = e.length - 1; r >= 1; r--)
      for (let o = 0; o < 1 << e.length; o++) {
        if (cr(o) !== r) continue;
        let a = new Set(e.filter((l, c) => (o & (1 << c)) !== 0).map((l) => l.id));
        if (n(a)) return { value: r / e.length, consistentContexts: [...a].sort(), exact: !0 };
      }
    return { value: 0, consistentContexts: [], exact: !0 };
  }
  let i = new Set(e.map((r) => r.id));
  for (; i.size > 0 && !n(i);) {
    let r = { contexts: e.filter((l) => i.has(l.id)), sections: t.sections },
      o = new Map();
    Pn(s, r)
      .filter((l) => !l.closes)
      .forEach((l) => l.contexts.forEach((c) => o.set(c, (o.get(c) ?? 0) + 1)));
    let a = [...o.entries()].sort((l, c) => c[1] - l[1])[0];
    if (!a) break;
    i.delete(a[0]);
  }
  return { value: i.size / e.length, consistentContexts: [...i].sort(), exact: !1 };
}
function se(s, t) {
  let e = Kt(s, t);
  return { gluing: e, obstructions: ar(e), fraction: dr(s, t), overlaps: kn(s, t.contexts) };
}
function Fn(s, t, e = {}) {
  let n = Math.max(0, e.limit ?? 8),
    i = Math.max(0, e.maxCandidates ?? 600);
  if (n === 0 || i === 0 || t.contexts.length === 0) return [];
  let r = se(s, t),
    o = {
      obstructionRank: r.gluing.obstructionRank,
      contextualFraction: r.fraction.value,
      localDisagreements: r.gluing.pairwiseDisagreements.length,
      contextualityDetected: r.gluing.contextualityDetected,
    };
  if (o.obstructionRank === 0 && o.localDisagreements === 0) return [];
  let a = new Set(),
    l = new Set();
  (r.obstructions.forEach((d) => {
    (d.contexts.forEach((p) => a.add(p)), d.nodes.forEach((p) => l.add(p)));
  }),
    r.gluing.pairwiseDisagreements.forEach((d) => {
      (a.add(d.a), a.add(d.b), d.disagreeingNodes.forEach((p) => l.add(p)));
    }));
  let c = [],
    u = 0;
  for (let d of t.contexts) {
    if (a.size > 0 && !a.has(d.id)) continue;
    let p = t.sections.get(d.id);
    if (p) {
      for (let [h, m] of p)
        if (!(l.size > 0 && !l.has(h))) {
          for (let g of U) {
            if (g === m || u >= i) continue;
            u++;
            let f = new Map(t.sections);
            f.set(d.id, new Map(p).set(h, g));
            let v = se(s, { contexts: t.contexts, sections: f }),
              y = {
                obstructionRank: v.gluing.obstructionRank,
                contextualFraction: v.fraction.value,
                localDisagreements: v.gluing.pairwiseDisagreements.length,
                contextualityDetected: v.gluing.contextualityDetected,
              },
              b =
                (o.obstructionRank - y.obstructionRank) * 100 +
                (Number(o.contextualityDetected) - Number(y.contextualityDetected)) * 50 +
                (y.contextualFraction - o.contextualFraction) * 25 +
                (o.localDisagreements - y.localDisagreements) * 10;
            b > 1e-9 && c.push({ contextId: d.id, nodeId: h, from: m, to: g, before: o, after: y, score: b });
          }
          if (u >= i) break;
        }
      if (u >= i) break;
    }
  }
  return c
    .sort(
      (d, p) =>
        p.score - d.score ||
        d.contextId.localeCompare(p.contextId) ||
        d.nodeId.localeCompare(p.nodeId) ||
        d.to.localeCompare(p.to),
    )
    .slice(0, n);
}
function An(s) {
  return [
    ...[...s.simplices.values()].filter((t) => !t.autoGenerated).map((t) => M("simplex", t.nodes)),
    ...s.hyperedges.keys(),
  ].sort();
}
var ze = require("obsidian");
function We(s, t, e) {
  let n = (t?.tags ?? []).map((r) => r.tag?.toLowerCase?.() ?? ""),
    i = t?.frontmatter ?? {};
  return /- \[ \]/.test(e)
    ? "action"
    : i.status || n.some((r) => ["#project", "#plan", "#initiative"].includes(r))
      ? "project"
      : n.some((r) => ["#research", "#paper", "#study", "#analysis"].includes(r))
        ? "research"
        : n.some((r) => ["#story", "#fiction", "#game", "#worldbuilding", "#writing"].includes(r))
          ? "creative"
          : n.some((r) => ["#idea", "#concept", "#hypothesis", "#thought"].includes(r))
            ? "idea"
            : "reference";
}
var ur = { contexts: [], sections: {}, audit: [] };
function Ln(s) {
  return typeof s == "string" && U.includes(s);
}
function je(s) {
  let t = s.sheaf;
  if (!t || typeof t != "object") return ur;
  let e = t,
    n = Array.isArray(e.contexts) ? e.contexts.filter(On) : [],
    i = {};
  Object.entries(e.sections ?? {}).forEach(([o, a]) => {
    if (!a || typeof a != "object") return;
    let l = {};
    (Object.entries(a).forEach(([c, u]) => {
      Ln(u) && (l[c] = u);
    }),
      (i[o] = l));
  });
  let r = Array.isArray(e.audit) ? e.audit.filter($n).map((o) => ({ ...o })) : [];
  return { contexts: n, sections: i, audit: r };
}
function Hn(s, t) {
  s.sheaf = pr(t);
}
function pr(s) {
  let t = s.contexts
      .filter(On)
      .map((n) => ({ ...n, relations: [...new Set(n.relations.filter((i) => typeof i == "string"))].sort() })),
    e = {};
  return (
    t.forEach((n) => {
      let i = s.sections[n.id] ?? {};
      e[n.id] = Object.fromEntries(Object.entries(i).filter((r) => Ln(r[1])));
    }),
    { contexts: t, sections: e, audit: s.audit.filter($n).map((n) => ({ ...n })) }
  );
}
function $n(s) {
  if (!s || typeof s != "object") return !1;
  let t = s;
  return (
    typeof t.id == "string" &&
    typeof t.at == "number" &&
    ["context-added", "context-deleted", "context-refined", "role-refined"].includes(t.action ?? "") &&
    typeof t.contextId == "string" &&
    typeof t.reason == "string"
  );
}
function O(s, t) {
  let e = t.at ?? Date.now(),
    n = { ...t, at: e, id: t.id ?? `${e}-${s.audit.length + 1}` };
  return (s.audit.push(n), n);
}
function On(s) {
  if (!s || typeof s != "object") return !1;
  let t = s;
  return (
    typeof t.id == "string" &&
    typeof t.name == "string" &&
    typeof t.definition == "string" &&
    ["folder", "tag", "query", "moc", "manual"].includes(t.source ?? "") &&
    Array.isArray(t.relations) &&
    t.relations.every((e) => typeof e == "string")
  );
}
function fe(s, t, e) {
  let n = new Map();
  return (
    t.contexts.forEach((i) => {
      let r = t.sections[i.id] ?? {},
        o = new Map();
      (F(s, i).forEach((a) => {
        o.set(a, r[a] ?? e.get(a) ?? "reference");
      }),
        n.set(i.id, o));
    }),
    { contexts: t.contexts, sections: n }
  );
}
function Y(s, t) {
  let e = new Map();
  return (
    t.nodes.forEach((n, i) => {
      let r = s.vault.getAbstractFileByPath(i);
      if (!(r instanceof ze.TFile)) return;
      let o = s.metadataCache.getFileCache(r);
      e.set(i, We(r, o, ""));
    }),
    e
  );
}
function hr(s) {
  return (
    s
      .toLowerCase()
      .replace(/[^a-z0-9]+/g, "-")
      .replace(/^-|-$/g, "") || "context"
  );
}
function ye(s, t) {
  let e = hr(s),
    n = new Set(t.map((r) => r.id));
  if (!n.has(e)) return e;
  let i = 2;
  for (; n.has(`${e}-${i}`);) i++;
  return `${e}-${i}`;
}
function Bt(s, t, e, n, i) {
  let r = (a) => {
      if (e === "folder") return a.startsWith(n.replace(/\/*$/, "/"));
      let l = s.vault.getAbstractFileByPath(a);
      if (!(l instanceof ze.TFile)) return !1;
      let c = s.metadataCache.getFileCache(l),
        u = [...(c?.tags ?? []).map((p) => p.tag?.toLowerCase() ?? ""), ...Wn(c?.frontmatter?.tags)],
        d = n.startsWith("#") ? n.toLowerCase() : `#${n.toLowerCase()}`;
      return u.includes(d);
    },
    o = [];
  return (
    t.hyperedges.forEach((a, l) => {
      a.nodes.some(r) && o.push(l);
    }),
    t.simplices.forEach((a) => {
      a.autoGenerated || (a.nodes.some(r) && o.push(M("simplex", a.nodes)));
    }),
    o.length === 0 ? null : { id: ye(n, i), name: n, source: e, definition: n, relations: [...new Set(o)].sort() }
  );
}
function Ve(s, t, e) {
  let n = Y(s, t);
  return Object.fromEntries(F(t, e).map((i) => [i, n.get(i) ?? "reference"]));
}
function Kn(s, t, e, n = 12) {
  let i = new Set(e.flatMap((a) => a.relations)),
    r = t
      .getAllRelations()
      .filter(({ relation: a }) => !(a.kind === "simplex" && a.autoGenerated))
      .filter(({ relation: a }) => !a.suggested),
    o = [...e];
  return r
    .filter(({ key: a }) => !i.has(a))
    .map(({ key: a, relation: l }) => ({
      key: a,
      relation: l,
      overlap: l.nodes.filter((c) => r.filter(({ relation: u }) => u.nodes.includes(c)).length > 1),
    }))
    .filter(({ overlap: a }) => a.length > 0)
    .sort((a, l) => l.overlap.length - a.overlap.length || l.relation.nodes.length - a.relation.nodes.length)
    .slice(0, Math.max(0, n))
    .map(({ key: a, relation: l, overlap: c }) => {
      let u = l.nodes.map((m) => m.split("/").pop()?.replace(/\.md$/, "")).join(" \xB7 "),
        d = l.label?.trim(),
        p = d && !/^inferred relation$/i.test(d) ? d : u || "Relation context",
        h = {
          id: ye(p, o),
          name: p,
          source: "manual",
          definition: `Overlapping relation among ${u}. Deterministic draft; rename and refine it.`,
          relations: [a],
        };
      return (
        o.push(h),
        {
          context: h,
          reason: `Shares ${c.length} participant${c.length === 1 ? "" : "s"} with another relation.`,
          usefulOverlap: c.length,
          initialRoles: Ve(s, t, h),
        }
      );
    });
}
function Bn(s, t, e, n = 12) {
  let i = new Map();
  t.nodes.forEach((o, a) => {
    let l = a.lastIndexOf("/");
    if (l > 0) {
      let d = a.slice(0, l);
      i.set(`folder:${d}`, { source: "folder", definition: d });
    }
    let c = s.vault.getAbstractFileByPath(a);
    if (!(c instanceof ze.TFile)) return;
    let u = s.metadataCache.getFileCache(c);
    [...(u?.tags ?? []).map((d) => d.tag ?? ""), ...Wn(u?.frontmatter?.tags)].forEach((d) => {
      d && i.set(`tag:${d.toLowerCase()}`, { source: "tag", definition: d });
    });
  });
  let r = new Set(e.map((o) => `${o.source}:${o.definition.toLowerCase()}`));
  return [...i.values()]
    .filter(({ source: o, definition: a }) => !r.has(`${o}:${a.toLowerCase()}`))
    .map(({ source: o, definition: a }) => Bt(s, t, o, a, e))
    .filter((o) => o !== null)
    .map((o) => {
      let a = new Set(F(t, o)),
        l = e.reduce((c, u) => c + F(t, u).filter((d) => a.has(d)).length, 0);
      return {
        context: o,
        usefulOverlap: l,
        reason: `${o.relations.length} relation${o.relations.length === 1 ? "" : "s"}; useful overlap score ${l}.`,
        initialRoles: Ve(s, t, o),
      };
    })
    .filter(({ usefulOverlap: o, context: a }) => o > 0 || (e.length === 0 && a.relations.length > 1))
    .sort((o, a) => a.usefulOverlap - o.usefulOverlap || a.context.relations.length - o.context.relations.length)
    .slice(0, Math.max(0, n));
}
function _n(s, t, e, n) {
  return t.contexts
    .filter((i) => F(s, i).includes(n))
    .map((i) => {
      let r = t.sections[i.id]?.[n],
        o = e.get(n);
      return {
        contextId: i.id,
        contextName: i.name,
        role: r ?? o ?? "reference",
        provenance: r ? "explicit override" : o ? "global backfill" : "fallback",
      };
    });
}
function Wn(s) {
  return (Array.isArray(s) ? s : typeof s == "string" ? [s] : []).map(
    (e) => `#${String(e).replace(/^#/, "").toLowerCase()}`,
  );
}
var re = require("obsidian");
function zn(s, t, e) {
  return `---
${e.stringify(s).trimEnd()}
---
${t.replace(/^\n*/, "")}`;
}
function jn(s, t) {
  let e = s.match(/^---\n([\s\S]*?)\n---\n?/);
  if (!e) return { frontmatter: {}, body: s };
  let n = s.replace(/^---\n[\s\S]*?\n---\n?/, "");
  try {
    return { frontmatter: t.parse(e[1]) ?? {}, body: n };
  } catch {
    return { frontmatter: {}, body: n };
  }
}
function _t(s, t, e, n) {
  let i = Object.prototype.hasOwnProperty.call(s, t),
    o = (Array.isArray(s[t]) ? [...s[t]] : []).filter((a) => {
      let l = a && typeof a == "object" && Array.isArray(a.nodes) ? a.nodes.map(String) : [];
      return w(l) !== e;
    });
  return (n && o.push(n), (o.length > 0 || i) && (s[t] = o), s);
}
var Vn = { parse: (s) => (0, re.parseYaml)(s) ?? null, stringify: (s) => (0, re.stringifyYaml)(s) };
function ve(s, t) {
  return zn(s, t, Vn);
}
function be(s) {
  return jn(s, Vn);
}
function Gn(s) {
  return {
    nodes: s.nodes,
    ...(s.label ? { label: s.label } : {}),
    ...(s.weight !== void 0 ? { weight: s.weight } : {}),
  };
}
function qn(s) {
  return {
    nodes: s.nodes,
    ...(s.label ? { label: s.label } : {}),
    ...(s.weight !== void 0 ? { weight: s.weight } : {}),
    ...(s.mode ? { mode: s.mode } : {}),
    ...(s.occurredAt !== void 0 ? { occurredAt: s.occurredAt } : {}),
    ...(s.persistence ? { persistence: s.persistence } : {}),
    ...(s.promotedTo ? { promotedTo: s.promotedTo } : {}),
    ...(s.crystallizedInto ? { crystallizedInto: s.crystallizedInto } : {}),
  };
}
function Wt(s, t, e) {
  return _t(s, "simplices", t, e);
}
function zt(s, t, e) {
  return _t(s, "hyperedges", t, e);
}
async function jt(s, t, e) {
  let n = await s.vault.read(t),
    { frontmatter: i, body: r } = be(n),
    o = w(e.nodes);
  Wt(i, o, Gn(e));
  let a = Array.isArray(i.simplices) ? i.simplices.length : 0;
  return (
    C.info("persistence", "Prepared source-note write", {
      mode: "source-note",
      file: t.path,
      simplexKey: o,
      simplexCount: a,
    }),
    ve(i, r)
  );
}
async function Un(s, t, e) {
  let n = await s.vault.read(t),
    { frontmatter: i, body: r } = be(n),
    o = w(e.nodes);
  return (
    zt(i, o, qn(e)),
    C.info("persistence", "Prepared source-note hyperedge write", {
      mode: "source-note",
      file: t.path,
      nodeKey: o,
      hyperedgeCount: Array.isArray(i.hyperedges) ? i.hyperedges.length : 0,
    }),
    ve(i, r)
  );
}
async function Yn(s, t, e) {
  let n = await X(s, t),
    i = await s.vault.read(n),
    { frontmatter: r, body: o } = be(i),
    a = w(e.nodes);
  ((r.managedBy = "simplicial-complex"), zt(r, a, qn(e)));
  let l = ve(
    r,
    o ||
      `<!-- managed by Simplicial Complex plugin -->
`,
  );
  return (
    C.info("persistence", "Prepared central-file hyperedge write", {
      mode: "central-file",
      file: n.path,
      nodeKey: a,
      hyperedgeCount: Array.isArray(r.hyperedges) ? r.hyperedges.length : 0,
    }),
    { file: n, content: l }
  );
}
async function Xn(s, t, e) {
  let n = await s.vault.read(t),
    { frontmatter: i, body: r } = be(n);
  return (
    zt(i, e),
    C.info("persistence", "Prepared hyperedge removal", {
      file: t.path,
      nodeKey: e,
      remainingHyperedgeCount: Array.isArray(i.hyperedges) ? i.hyperedges.length : 0,
    }),
    ve(i, r)
  );
}
async function X(s, t) {
  let e = s.vault.getAbstractFileByPath(t);
  if (e instanceof re.TFile) return e;
  let n = [
      "---",
      "managedBy: simplicial-complex",
      "simplices: []",
      "hyperedges: []",
      "---",
      "",
      "<!-- managed by Simplicial Complex plugin -->",
      "",
    ].join(`
`),
    i = await s.vault.create(t, n);
  return (C.info("persistence", "Created central file", { path: t }), i);
}
async function Zn(s, t, e) {
  let n = await X(s, t),
    i = await s.vault.read(n),
    { frontmatter: r, body: o } = be(i),
    a = w(e.nodes);
  ((r.managedBy = "simplicial-complex"), Wt(r, a, Gn(e)));
  let l = Array.isArray(r.simplices) ? r.simplices.length : 0,
    c = ve(
      r,
      o ||
        `<!-- managed by Simplicial Complex plugin -->
`,
    );
  return (
    C.info("persistence", "Prepared central-file write", {
      mode: "central-file",
      file: n.path,
      simplexKey: a,
      simplexCount: l,
    }),
    { file: n, content: c }
  );
}
async function Ie(s, t, e) {
  let n = await s.vault.read(t),
    { frontmatter: i, body: r } = be(n);
  return (
    Wt(i, e),
    C.info("persistence", "Prepared simplex removal", {
      file: t.path,
      simplexKey: e,
      remainingSimplexCount: Array.isArray(i.simplices) ? i.simplices.length : 0,
    }),
    ve(i, r)
  );
}
async function Jn(s, t) {
  let e = s.vault.getAbstractFileByPath(t);
  if (!(e instanceof re.TFile))
    return (
      C.warn("persistence", "Central file does not exist", { mode: "central-file", path: t }),
      { exists: !1, path: t, length: 0 }
    );
  let n = await s.vault.read(e);
  return (
    C.info("persistence", "Central file state", { mode: "central-file", path: t, exists: !0, length: n.length }),
    { exists: !0, path: e.path, length: n.length }
  );
}
function Qn() {
  return {
    domainSource: "hybrid",
    contentClusterCount: 8,
    enableBettiComputation: !1,
    bettiDisplayOnCanvas: !0,
    maxBettiDim: 2,
    showFiltrationSlider: !0,
    enableExplanationPanel: !0,
    enableInteractionReinforcement: !0,
    reinforcementStrength: 0.05,
    persistenceMode: "source-note",
    centralFile: "_simplicial.md",
    showEdges: !0,
    showClusters: !0,
    showCores: !0,
    maxRenderedDim: 12,
    noiseAmount: 0.12,
    sleepThreshold: 0.01,
    repulsionStrength: 2400,
    cohesionStrength: 0.005,
    gravityStrength: 7e-4,
    dampingFactor: 0.84,
    boundaryPadding: 50,
    darkMode: "auto",
    inferenceMode: "hybrid",
    inferenceEmits: "simplex",
    insightThreshold: 0.45,
    linkStrengthThreshold: 0.4,
    linkThresholdLowerBound: 0,
    linkThresholdUpperBound: 1,
    closureThreshold: 0.25,
    tagRarityThreshold: 0.05,
    decayHalfLifeDays: 90,
    decayMinimumWeight: 0.1,
    minDomainsForTriangle: 2,
    minDomainsForTetra: 2,
    minRolesForTetra: 2,
    roleDiversityWeight: 0.2,
    domainDiversityWeight: 0.25,
    actionBonus: 0.3,
    rareTagWeight: 0.15,
    commonTagPenalty: 0.12,
    linkGraphBaseline: !0,
    enableInferredEdges: !0,
    inferenceThreshold: 0.12,
    enableLinkInference: !0,
    enableMutualLinkBonus: !0,
    enableSharedTags: !0,
    enableTitleOverlap: !0,
    enableContentOverlap: !0,
    enableSameFolderInference: !0,
    enableSameTopFolderInference: !0,
    linkWeight: 0.25,
    mutualLinkBonus: 0.25,
    sharedTagWeight: 0.08,
    titleOverlapWeight: 0.18,
    contentOverlapWeight: 0.16,
    sameFolderWeight: 0.08,
    sameTopFolderWeight: 0.04,
    showSuggestions: !0,
    suggestionThreshold: 0.34,
    commandSimplexSize: 3,
    commandAutoOpenPanel: !0,
    metadataHoverDelayMs: 1e3,
    formalMode: !0,
    sparseEdgeLength: 150,
    sparseGravityBoost: 1.8,
    labelDensity: 0.42,
    renderFilterMetric: "weight",
    renderFilterThreshold: 0.1,
    pinnedNodes: {},
    showHyperedges: !0,
    hyperedgeOpacity: 0.55,
    enableHyperedgePulse: !0,
    encounterRecurrenceThreshold: 3,
    crystallizeFolder: "",
    historyFile: "_simplicial-history.md",
    enableRelationHistory: !0,
    enableDynamicsLab: !1,
    activationDecayHalfLifeMinutes: 30,
    sheaf: { contexts: [], sections: {}, audit: [] },
    enableEncounterSuggestions: !0,
    encounterSuggestionThreshold: 0.55,
    maxEncounterSuggestions: 20,
    discoveryNoticeShown: !1,
    topologyCorrectionNoticeShown: !1,
    performanceDefaultsV045Applied: !1,
    enablePersistenceView: !0,
    enableBootstrapUncertainty: !1,
    bootstrapSampleCount: 20,
    topologyMaxSimplices: 5e4,
    persistenceReleaseNoticeShown: !1,
  };
}
function ei(s, t) {
  return { ...s, ...(t ?? {}) };
}
var Vt = require("obsidian");
var mr = [
    "---",
    "managedBy: simplicial-complex",
    "---",
    "",
    "<!-- Append-only relation history. One JSON event per line, oldest first.",
    "     Corrections are new events, never edits: this file is only ever appended to. -->",
    "",
  ].join(`
`),
  Ge = class {
    constructor(t, e) {
      this.app = t;
      this.historyFile = e;
      this.queue = [];
      this.flushing = null;
    }
    setPath(t) {
      this.historyFile = t;
    }
    get path() {
      return this.historyFile;
    }
    async load(t) {
      let e = this.app.vault.getAbstractFileByPath(this.historyFile);
      if (!(e instanceof Vt.TFile)) return 0;
      let i = (await this.app.vault.read(e))
        .split(
          `
`,
        )
        .map((r) => yn(r))
        .filter((r) => r !== null);
      return (
        t.load(i),
        C.info("history", "Loaded relation history", { path: this.historyFile, eventCount: i.length }),
        i.length
      );
    }
    record(t) {
      (this.queue.push(t), this.flush());
    }
    async flush() {
      return this.flushing
        ? this.flushing
        : ((this.flushing = (async () => {
            try {
              for (; this.queue.length > 0;) {
                let e = this.queue.splice(0, this.queue.length).map((n) => fn(n)).join(`
`);
                await this.appendLines(e);
              }
            } catch (t) {
              C.error("history", "Failed to append relation history", {
                path: this.historyFile,
                error: t instanceof Error ? t.message : String(t),
              });
            } finally {
              this.flushing = null;
            }
          })()),
          this.flushing);
    }
    async appendLines(t) {
      let e = this.app.vault.getAbstractFileByPath(this.historyFile);
      if (e instanceof Vt.TFile) {
        await this.app.vault.append(
          e,
          `${t}
`,
        );
        return;
      }
      (await this.app.vault.create(
        this.historyFile,
        `${mr}${t}
`,
      ),
        C.info("history", "Created relation history file", { path: this.historyFile }));
    }
  };
var oe = require("obsidian");
function ti(s, t) {
  let e = [],
    n = [...s.nodes.keys()],
    i = t.linkStrengthThreshold,
    r = t.closureThreshold;
  for (let o of n) {
    let a = ge(o, i, s);
    for (let l = 0; l < a.length; l++)
      for (let c = l + 1; c < a.length; c++) {
        let u = a[l],
          d = a[c],
          p = z(u, d, s);
        if (p >= r) continue;
        let h = z(u, o, s),
          m = z(o, d, s),
          g = h + m - p * 2,
          f = Math.min(0.9, Math.max(0.3, g / 2));
        e.push({ nodes: [u, o, d], source: "inferred-bridge", bridgeNode: o, triadScore: g, label: null, weight: f });
      }
  }
  return e;
}
function gr(s) {
  return [...s].sort().join("|");
}
function fr(s, t) {
  if (s.length < 2) return { average: 0, density: 0 };
  let e = 0,
    n = 0,
    i = (s.length * (s.length - 1)) / 2;
  for (let r = 0; r < s.length; r++)
    for (let o = r + 1; o < s.length; o++) {
      let a = z(s[r], s[o], t);
      ((e += a), a > 0 && n++);
    }
  return { average: i > 0 ? e / i : 0, density: i > 0 ? n / i : 0 };
}
function ni(s, t) {
  let e = Math.max(0.22, t.linkStrengthThreshold * 0.7),
    n = 2,
    i = 0.6,
    r = Math.max(0.16, t.closureThreshold * 0.8),
    o = new Set(),
    a = new Set(),
    l = [];
  for (let c of s.nodes.keys()) {
    if (o.has(c) || ge(c, e, s).length < n) continue;
    let d = new Set([c]),
      p = [c];
    for (o.add(c); p.length > 0;) {
      let v = p.shift(),
        y = ge(v, e, s);
      if (!(y.length < n)) for (let b of y) (d.add(b), !o.has(b) && (o.add(b), p.push(b)));
    }
    if (d.size < 3) continue;
    let h = [...d].sort(),
      m =
        h.length > 5
          ? h
              .map((v) => ({
                id: v,
                strength: ge(v, e, s)
                  .filter((y) => d.has(y))
                  .reduce((y, b) => y + z(v, b, s), 0),
              }))
              .sort((v, y) => y.strength - v.strength)
              .slice(0, 5)
              .map(({ id: v }) => v)
              .sort()
          : h,
      g = fr(m, s);
    if (g.density < i || g.average < r) continue;
    let f = gr(m);
    a.has(f) ||
      (a.add(f),
      l.push({
        nodes: m,
        source: "inferred-cross",
        label: "density cluster",
        weight: Math.min(0.95, Math.max(0.35, g.average * 0.7 + g.density * 0.3)),
        triadScore: Number((g.average * m.length).toFixed(2)),
      }));
  }
  return l;
}
function ii(s, t) {
  let e = new Set(s.map((i) => i.role)),
    n = new Set(s.map((i) => i.domain));
  return t === 1 ? e.size >= 2 || n.size >= 2 : t === 2 ? n.size >= 2 && e.size >= 2 : !0;
}
function si(s, t, e) {
  let n = new Set(s.map((l) => l.domain)),
    i = new Set(s.map((l) => l.role)),
    r = s.some((l) => l.role === "action");
  if (n.size < t) return { qualifies: !1, isSuper: !1, class: "folder-cluster" };
  let o = n.size >= 3 && i.size >= 3;
  return { qualifies: !0, isSuper: o, class: r ? "project-nucleus" : o ? "super-insight" : "cross-domain-core" };
}
var yr = {
  halfLifeDays: 90,
  minimumWeight: 0.1,
  roleModifier: { action: 0.3, project: 0.5, research: 0.7, idea: 1, creative: 1.2, reference: 1.5 },
  enableReinforcement: !1,
  reinforcementStrength: 0.5,
};
function ri(s, t, e = yr, n, i) {
  let r = Date.now(),
    o = Math.max(...t.map((d) => d.modifiedAt)),
    a = (r - o) / (1e3 * 60 * 60 * 24),
    l = t.reduce((d, p) => d + e.roleModifier[p.role], 0) / t.length,
    c = Math.pow(0.5, (a * l) / e.halfLifeDays),
    u = s * c;
  if (e.enableReinforcement && n) {
    let d = t.map((m) => m.id),
      h = 1 + (Rn(n, i, d) - 1) * e.reinforcementStrength;
    u *= h;
  }
  return Math.max(e.minimumWeight, Math.min(1, u));
}
function oi(s, t, e) {
  let n = s.nodes.map((g) => t.find((f) => f.id === g)),
    i = n.length - 1,
    r = s.triadScore ?? 0,
    o = new Set(n.map((g) => g.role)).size;
  r += o * e.roleDiversityWeight;
  let a = new Set(n.map((g) => g.domain)).size;
  ((r += a * e.domainDiversityWeight), n.some((g) => g.role === "action") && (r += e.actionBonus));
  let c = n.flatMap((g) => g.tags),
    u = new Map();
  for (let g of c) u.set(g, (u.get(g) ?? 0) + 1);
  let d = [...u.entries()].filter(([, g]) => g > 1 && g <= 2).length;
  r += d * e.rareTagWeight;
  let p = [...u.entries()].filter(([, g]) => g > 2).length;
  if (((r -= p * e.commonTagPenalty), !ii(n, i)))
    return { ...s, insightScore: 0, class: "folder-cluster", decayedWeight: 0 };
  let h =
    i === 2 ? si(n, e.minDomainsForTetra, e.minRolesForTetra) : { qualifies: !0, isSuper: !1, class: "cross-domain" };
  if (!h.qualifies) return { ...s, insightScore: 0, class: "folder-cluster", decayedWeight: 0 };
  let m = ri(s.weight ?? 1, n, {
    halfLifeDays: e.decayHalfLifeDays,
    minimumWeight: e.decayMinimumWeight,
    roleModifier: { action: 0.3, project: 0.5, research: 0.7, idea: 1, creative: 1.2, reference: 1.5 },
    enableReinforcement: !1,
    reinforcementStrength: 0.5,
  });
  return { ...s, insightScore: r, class: h.class, decayedWeight: m };
}
function vr(s, t) {
  let e = _e(s, t),
    n = ti(e, t),
    i = ni(e, t),
    r = new Map();
  [...n, ...i].forEach((h) => {
    let m = [...h.nodes].sort().join("|"),
      g = r.get(m);
    (!g || (h.weight ?? 0) > (g.weight ?? 0)) && r.set(m, h);
  });
  let a = [...r.values()]
      .map((h) => oi(h, [...e.nodes.values()], t))
      .filter((h) => h.insightScore >= t.insightThreshold && h.class !== "folder-cluster")
      .sort((h, m) => m.insightScore - h.insightScore)
      .map((h) => ({
        nodes: h.nodes,
        weight: h.decayedWeight,
        label: h.label ?? void 0,
        source: h.source,
        sourcePath: void 0,
        autoGenerated: !0,
        inferred: !0,
        userDefined: !1,
        suggested: !0,
        colorKey: "neutral",
        confidence: h.insightScore,
        decayedWeight: h.decayedWeight,
        inferredSignals: h.label === "density cluster" ? ["density-cluster"] : [],
        dominantSignal: h.label === "density cluster" ? "semantic" : "soft-cluster",
      })),
    l = [],
    c = [...e.edges.values()]
      .map((h) => h.strength)
      .filter((h) => h > 0)
      .sort((h, m) => m - h),
    u = 1 - t.linkStrengthThreshold,
    d = Math.max(0, Math.floor(c.length * u) - 1),
    p = c[d] ?? 0;
  for (let h of e.edges.values())
    h.strength >= p &&
      l.push({
        nodes: [h.a, h.b],
        weight: h.strength,
        source: "suggested",
        sourcePath: void 0,
        autoGenerated: !0,
        inferred: !0,
        userDefined: !1,
        suggested: h.strength >= t.closureThreshold,
        colorKey: "neutral",
        confidence: h.strength,
        decayedWeight: h.strength,
        inferredSignals: ["emergent-edge"],
        dominantSignal: "link",
      });
  return [...l, ...a];
}
function ai(s, t) {
  return vr(s, t);
}
var li = new Set([
    "the",
    "a",
    "an",
    "this",
    "that",
    "these",
    "those",
    "my",
    "your",
    "his",
    "her",
    "its",
    "our",
    "their",
    "in",
    "on",
    "at",
    "to",
    "for",
    "with",
    "from",
    "by",
    "about",
    "into",
    "onto",
    "of",
    "off",
    "over",
    "under",
    "again",
    "further",
    "then",
    "once",
    "here",
    "there",
    "when",
    "where",
    "why",
    "how",
    "all",
    "each",
    "few",
    "more",
    "most",
    "other",
    "some",
    "such",
    "no",
    "nor",
    "not",
    "only",
    "own",
    "same",
    "so",
    "than",
    "too",
    "very",
    "just",
    "now",
    "also",
    "after",
    "before",
    "above",
    "below",
    "up",
    "down",
    "out",
    "on",
    "any",
    "both",
    "during",
    "through",
    "between",
    "against",
    "until",
    "while",
    "and",
    "or",
    "but",
    "if",
    "because",
    "as",
    "until",
    "while",
    "although",
    "though",
    "unless",
    "whether",
    "either",
    "neither",
    "both",
    "yet",
    "so",
    "since",
    "than",
    "i",
    "me",
    "my",
    "myself",
    "we",
    "our",
    "ours",
    "ourselves",
    "you",
    "your",
    "yours",
    "yourself",
    "yourselves",
    "he",
    "him",
    "his",
    "himself",
    "she",
    "her",
    "hers",
    "herself",
    "it",
    "its",
    "itself",
    "they",
    "them",
    "their",
    "theirs",
    "themselves",
    "what",
    "which",
    "who",
    "whom",
    "whose",
    "whoever",
    "whomever",
    "whatever",
    "whichever",
    "one",
    "another",
    "each",
    "everyone",
    "everybody",
    "anyone",
    "anybody",
    "someone",
    "somebody",
    "noone",
    "nobody",
    "nothing",
    "everything",
    "something",
    "anything",
    "is",
    "are",
    "was",
    "were",
    "be",
    "been",
    "being",
    "have",
    "has",
    "had",
    "having",
    "do",
    "does",
    "did",
    "doing",
    "get",
    "gets",
    "got",
    "gotten",
    "make",
    "makes",
    "made",
    "making",
    "take",
    "takes",
    "took",
    "taken",
    "go",
    "goes",
    "went",
    "gone",
    "going",
    "say",
    "says",
    "said",
    "saying",
    "come",
    "comes",
    "came",
    "coming",
    "see",
    "sees",
    "saw",
    "seen",
    "know",
    "knows",
    "knew",
    "known",
    "think",
    "thinks",
    "thought",
    "look",
    "looks",
    "looked",
    "looking",
    "want",
    "wants",
    "wanted",
    "use",
    "uses",
    "used",
    "using",
    "find",
    "finds",
    "found",
    "finding",
    "give",
    "gives",
    "gave",
    "given",
    "giving",
    "tell",
    "tells",
    "told",
    "telling",
    "ask",
    "asks",
    "asked",
    "asking",
    "work",
    "works",
    "worked",
    "working",
    "seem",
    "seems",
    "seemed",
    "seeming",
    "feel",
    "feels",
    "felt",
    "feeling",
    "try",
    "tries",
    "tried",
    "trying",
    "leave",
    "leaves",
    "left",
    "leaving",
    "call",
    "calls",
    "called",
    "calling",
    "note",
    "notes",
    "todo",
    "idea",
    "link",
    "tags",
    "file",
    "folder",
    "vault",
  ]),
  br = new Set([
    "\u0627\u06CC\u0646",
    "\u0622\u0646",
    "\u0622\u0646\u0627\u0646",
    "\u0627\u06CC\u0646\u0627\u0646",
    "\u0647\u0645\u06CC\u0646",
    "\u0647\u0645\u0627\u0646",
    "\u0647\u06CC\u0686",
    "\u0647\u0645\u0647",
    "\u0647\u06CC\u0686\u06A9\u0633",
    "\u0647\u0645\u0647",
    "\u0647\u0631",
    "\u0628\u0639\u0636\u06CC",
    "\u0686\u0646\u062F",
    "\u0686\u0646\u06CC\u0646",
    "\u0686\u0646\u0627\u0646",
    "\u0627\u0646",
    "\u0627\u06CC",
    "\u0627\u06CC\u0646",
    "\u0622\u0646",
    "\u062F\u0631",
    "\u0628\u0647",
    "\u0627\u0632",
    "\u0628\u0627",
    "\u0628\u0631",
    "\u0628\u0631\u0627\u06CC",
    "\u062A\u0627",
    "\u0686\u0648\u0646",
    "\u0645\u062B\u0644",
    "\u0645\u0627\u0646\u0646\u062F",
    "\u0631\u0627\u062C\u0639",
    "\u0646\u0633\u0628\u062A",
    "\u0637\u0631\u0641",
    "\u0648\u0633\u0637",
    "\u067E\u0634\u062A",
    "\u0631\u0648\u06CC",
    "\u06A9\u0646\u0627\u0631",
    "\u0646\u0632\u062F",
    "\u062F\u0646\u0628\u0627\u0644",
    "\u0628\u0627\u0644\u0627",
    "\u067E\u0627\u06CC\u06CC\u0646",
    "\u062F\u0627\u062E\u0644",
    "\u062E\u0627\u0631\u062C",
    "\u0632\u06CC\u0631",
    "\u0628\u06CC\u0631\u0648\u0646",
    "\u0627\u062B\u0631",
    "\u0645\u0648\u062C\u0628",
    "\u062F\u0644\u06CC\u0644",
    "\u0633\u0628\u0628",
    "\u062C\u0627\u0646\u0628",
    "\u0637\u0631\u0641",
    "\u0648\u0642\u062A",
    "\u062D\u06CC\u0646",
    "\u0639\u0647\u062F",
    "\u0645\u062F\u062A",
    "\u0644\u062D\u0638\u0647",
    "\u0633\u0627\u0639\u062A",
    "\u062F\u0642\u06CC\u0642\u0647",
    "\u062B\u0627\u0646\u06CC\u0647",
    "\u0631\u0648\u0632",
    "\u0634\u0628",
    "\u0635\u0628\u062D",
    "\u0638\u0647\u0631",
    "\u0639\u0635\u0631",
    "\u0628\u0627\u0645\u062F\u0627\u062F",
    "\u0634\u0627\u0645",
    "\u067E\u06CC\u0634",
    "\u0628\u0639\u062F",
    "\u0642\u0628\u0644",
    "\u0646\u0632\u062F\u06CC\u06A9",
    "\u062F\u0648\u0631",
    "\u0646\u0632\u062F\u06CC\u06A9\u06CC",
    "\u062F\u0648\u0631\u06CC",
    "\u0627\u0648\u0644",
    "\u0622\u062E\u0631",
    "\u0645\u06CC\u0627\u0646",
    "\u0628\u06CC\u0646",
    "\u0648",
    "\u06CC\u0627",
    "\u0627\u0645\u0627",
    "\u0648\u0644\u06CC",
    "\u0686\u0648\u0646",
    "\u0686\u0631\u0627\u06A9\u0647",
    "\u0632\u06CC\u0631\u0627",
    "\u0628\u0644\u06A9\u0647",
    "\u0646\u0647",
    "\u0647\u0645",
    "\u0646\u06CC\u0632",
    "\u06CC\u0639\u0646\u06CC",
    "\u06A9\u0647",
    "\u0686\u0648\u0646\u06A9\u0647",
    "\u0627\u06AF\u0631",
    "\u062A\u0627",
    "\u0686\u0647",
    "\u0622\u0646\u06A9\u0647",
    "\u0648\u0644\u06CC\u06A9\u0646",
    "\u0644\u06CC\u06A9\u0646",
    "\u0647\u0646\u0648\u0632",
    "\u062D\u0627\u0644",
    "\u0648\u0642\u062A\u06CC",
    "\u0628\u06CC\u0646",
    "\u0645\u0646",
    "\u062A\u0648",
    "\u0627\u0648",
    "\u0645\u0627",
    "\u0634\u0645\u0627",
    "\u0627\u06CC\u0634\u0627\u0646",
    "\u0622\u0646\u0647\u0627",
    "\u0645\u0631\u0627",
    "\u062A\u0631\u0627",
    "\u0634\u0645\u0627 \u0631\u0627",
    "\u0645\u0627 \u0631\u0627",
    "\u0622\u0646\u0647\u0627 \u0631\u0627",
    "\u0627\u0645",
    "\u0627\u06CC",
    "\u0627\u0633\u062A",
    "\u0627\u06CC\u0645",
    "\u0627\u06CC\u062F",
    "\u0627\u0646\u062F",
    "\u0628\u0648\u062F\u0645",
    "\u0628\u0648\u062F\u06CC",
    "\u0628\u0648\u062F",
    "\u0628\u0648\u062F\u06CC\u0645",
    "\u0628\u0648\u062F\u06CC\u062F",
    "\u0628\u0648\u062F\u0646\u062F",
    "\u062E\u0648\u062F",
    "\u062E\u0648\u062F\u0645",
    "\u062E\u0648\u062F\u062A",
    "\u062E\u0648\u062F\u0634",
    "\u062E\u0648\u062F\u0645\u0627\u0646",
    "\u062E\u0648\u062F\u062A\u0627\u0646",
    "\u062E\u0648\u062F\u0634\u0627\u0646",
    "\u06A9\u0631\u062F",
    "\u06A9\u0631\u062F\u0645",
    "\u06A9\u0631\u062F\u06CC",
    "\u06A9\u0631\u062F",
    "\u06A9\u0631\u062F\u06CC\u0645",
    "\u06A9\u0631\u062F\u06CC\u062F",
    "\u06A9\u0631\u062F\u0646\u062F",
    "\u06A9\u0646",
    "\u06A9\u0646\u0645",
    "\u06A9\u0646\u06CC",
    "\u06A9\u0646\u062F",
    "\u06A9\u0646\u06CC\u0645",
    "\u06A9\u0646\u06CC\u062F",
    "\u06A9\u0646\u0646\u062F",
    "\u0634\u062F",
    "\u0634\u062F\u0645",
    "\u0634\u062F\u06CC",
    "\u0634\u062F",
    "\u0634\u062F\u06CC\u0645",
    "\u0634\u062F\u06CC\u062F",
    "\u0634\u062F\u0646\u062F",
    "\u0634\u0648",
    "\u0634\u0648\u0645",
    "\u0634\u0648\u06CC",
    "\u0634\u0648\u062F",
    "\u0634\u0648\u06CC\u0645",
    "\u0634\u0648\u06CC\u062F",
    "\u0634\u0648\u0646\u062F",
    "\u0628\u0648\u062F",
    "\u0628\u0648\u062F\u0645",
    "\u0628\u0648\u062F\u06CC",
    "\u0628\u0648\u062F",
    "\u0628\u0648\u062F\u06CC\u0645",
    "\u0628\u0648\u062F\u06CC\u062F",
    "\u0628\u0648\u062F\u0646\u062F",
    "\u0628\u0627\u0634",
    "\u0628\u0627\u0634\u0645",
    "\u0628\u0627\u0634\u06CC",
    "\u0628\u0627\u0634\u062F",
    "\u0628\u0627\u0634\u06CC\u0645",
    "\u0628\u0627\u0634\u06CC\u062F",
    "\u0628\u0627\u0634\u0646\u062F",
    "\u062F\u0627\u062F",
    "\u062F\u0627\u062F\u0645",
    "\u062F\u0627\u062F\u06CC",
    "\u062F\u0627\u062F",
    "\u062F\u0627\u062F\u06CC\u0645",
    "\u062F\u0627\u062F\u06CC\u062F",
    "\u062F\u0627\u062F\u0646\u062F",
    "\u062F\u0647",
    "\u062F\u0647\u0645",
    "\u062F\u0647\u06CC",
    "\u062F\u0647\u062F",
    "\u062F\u0647\u06CC\u0645",
    "\u062F\u0647\u06CC\u062F",
    "\u062F\u0647\u0646\u062F",
    "\u06AF\u0631\u0641\u062A",
    "\u06AF\u0631\u0641\u062A\u0645",
    "\u06AF\u0631\u0641\u062A\u06CC",
    "\u06AF\u0631\u0641\u062A",
    "\u06AF\u0631\u0641\u062A\u06CC\u0645",
    "\u06AF\u0631\u0641\u062A\u06CC\u062F",
    "\u06AF\u0631\u0641\u062A\u0646\u062F",
    "\u06AF\u06CC\u0631",
    "\u06AF\u06CC\u0631\u0645",
    "\u06AF\u06CC\u0631\u06CC",
    "\u06AF\u06CC\u0631\u062F",
    "\u06AF\u06CC\u0631\u06CC\u0645",
    "\u06AF\u06CC\u0631\u06CC\u062F",
    "\u06AF\u06CC\u0631\u0646\u062F",
    "\u0632\u062F",
    "\u0632\u062F\u0645",
    "\u0632\u062F\u06CC",
    "\u0632\u062F",
    "\u0632\u062F\u06CC\u0645",
    "\u0632\u062F\u06CC\u062F",
    "\u0632\u062F\u0646\u062F",
    "\u0632\u0646",
    "\u0632\u0646\u0645",
    "\u0632\u0646\u06CC",
    "\u0632\u0646\u062F",
    "\u0632\u0646\u06CC\u0645",
    "\u0632\u0646\u06CC\u062F",
    "\u0632\u0646\u0646\u062F",
    "\u0631\u0641\u062A",
    "\u0631\u0641\u062A\u0645",
    "\u0631\u0641\u062A\u06CC",
    "\u0631\u0641\u062A",
    "\u0631\u0641\u062A\u06CC\u0645",
    "\u0631\u0641\u062A\u06CC\u062F",
    "\u0631\u0641\u062A\u0646\u062F",
    "\u0631\u0648",
    "\u0631\u0648\u0645",
    "\u0631\u0648\u06CC",
    "\u0631\u0648\u062F",
    "\u0631\u0648\u06CC\u0645",
    "\u0631\u0648\u06CC\u062F",
    "\u0631\u0648\u0646\u062F",
    "\u0622\u0645\u062F",
    "\u0622\u0645\u062F\u0645",
    "\u0622\u0645\u062F\u06CC",
    "\u0622\u0645\u062F",
    "\u0622\u0645\u062F\u06CC\u0645",
    "\u0622\u0645\u062F\u06CC\u062F",
    "\u0622\u0645\u062F\u0646\u062F",
    "\u0628\u06CC\u0627",
    "\u0628\u06CC\u0627\u06CC\u0645",
    "\u0628\u06CC\u0627\u06CC\u06CC",
    "\u0628\u06CC\u0627\u06CC\u062F",
    "\u0628\u06CC\u0627\u06CC\u06CC\u0645",
    "\u0628\u06CC\u0627\u06CC\u06CC\u062F",
    "\u0628\u06CC\u0627\u06CC\u0646\u062F",
    "\u0645\u06CC",
    "\u0646\u0645\u06CC",
    "\u0646\u0647",
    "\u0628\u0644\u0647",
    "\u062E\u0648\u0628",
    "\u0628\u062F",
    "\u0628\u0633\u06CC\u0627\u0631",
    "\u062E\u06CC\u0644\u06CC",
    "\u0632\u06CC\u0627\u062F",
    "\u06A9\u0645",
    "\u06A9\u0645\u06CC",
    "\u062A\u0646\u0647\u0627",
    "\u0641\u0642\u0637",
    "\u062D\u062A\u06CC",
    "\u062F\u06CC\u06AF\u0631",
    "\u062F\u06CC\u06AF\u0631\u06CC",
    "\u062F\u06CC\u06AF\u0631\u0627\u0646",
    "\u062D\u0627\u0644\u0627",
    "\u0627\u0644\u0627\u0646",
    "\u0627\u0645\u0631\u0648\u0632",
    "\u062F\u06CC\u0631\u0648\u0632",
    "\u0641\u0631\u062F\u0627",
    "\u0635\u0628\u062D",
    "\u0638\u0647\u0631",
    "\u0639\u0635\u0631",
    "\u0634\u0628",
    "\u06AF\u0627\u0647",
    "\u06AF\u0627\u0647\u06CC",
    "\u0647\u0645\u06CC\u0634\u0647",
    "\u0647\u0631\u06AF\u0632",
    "\u06CC\u06A9",
    "\u062F\u0648",
    "\u0633\u0647",
    "\u0686\u0647\u0627\u0631",
    "\u067E\u0646\u062C",
    "\u0627\u0648\u0644",
    "\u062F\u0648\u0627\u0645",
    "\u0633\u0648\u0645",
    "\u0686\u0647\u0627\u0631\u0645",
    "\u067E\u0646\u062C\u0645",
    "\u06CC\u06A9\u06CC",
    "\u0686\u06CC\u0632\u06CC",
    "\u06A9\u0633\u06CC",
    "\u062C\u0627\u06CC\u06CC",
    "\u0628\u0627\u06CC\u062F",
    "\u0634\u0627\u06CC\u062F",
    "\u0644\u0637\u0641\u0627",
    "\u0645\u062A\u0634\u06A9\u0631\u0645",
    "\u0633\u067E\u0627\u0633",
    "\u0645\u0631\u0633\u06CC",
    "\u0628\u0641\u0631\u0645\u0627\u06CC\u06CC\u062F",
    "\u0628\u0631\u0648",
    "\u0628\u06CC\u0627",
    "\u0647\u0627",
    "\u0647\u0627\u06CC",
    "\u0627\u062A",
    "\u06CC\u062A",
    "\u0627\u0634",
    "\u0645\u0627\u0646",
    "\u062A\u0627\u0646",
    "\u0634\u0627\u0646",
    "\u06CC",
    "\u0627\u06CC",
    "\u0627\u06CC\u0645",
    "\u0627\u06CC\u062F",
    "\u0627\u0646\u062F",
    "\u0645",
    "\u06CC",
    "\u0633\u062A",
    "\u0627\u06CC\u0645",
    "\u0627\u06CC\u062F",
    "\u0646\u062F",
    "\u0631\u0645",
    "\u0631\u06CC",
    "\u0631\u062F",
    "\u0631\u06CC\u0645",
    "\u0631\u06CC\u062F",
    "\u0631\u0646\u062F",
    "note",
    "notes",
    "todo",
    "idea",
    "link",
    "tags",
    "file",
    "folder",
    "vault",
  ]),
  xr = new Set([
    "el",
    "la",
    "de",
    "que",
    "y",
    "a",
    "en",
    "un",
    "ser",
    "se",
    "no",
    "haber",
    "por",
    "con",
    "su",
    "para",
    "como",
    "estar",
    "tener",
    "le",
    "lo",
    "todo",
    "pero",
    "m\xE1s",
    "hacer",
    "o",
    "poder",
    "decir",
    "este",
    "ir",
    "otro",
    "ese",
    "la",
    "si",
    "me",
    "ya",
    "ver",
    "porque",
    "dar",
    "cuando",
    "\xE9l",
    "muy",
    "sin",
    "vez",
    "mucho",
    "saber",
    "qu\xE9",
    "sobre",
    "mi",
    "alguno",
    "mismo",
    "yo",
    "tambi\xE9n",
    "hasta",
    "a\xF1o",
    "dos",
    "querer",
    "entre",
    "as\xED",
    "primero",
    "desde",
    "grande",
    "esto",
    "ni",
    "nos",
    "llegar",
    "pasar",
    "tiempo",
    "ella",
    "s\xED",
    "d\xEDa",
    "uno",
    "bien",
    "poco",
    "deber",
    "entonces",
    "poner",
    "cosa",
    "tanto",
    "hombre",
    "parecer",
    "nuestro",
    "tan",
    "donde",
    "ahora",
    "parte",
    "despu\xE9s",
    "vida",
    "quedar",
    "siempre",
    "creer",
    "hablar",
    "llevar",
    "dejar",
    "nada",
    "cada",
    "seguir",
    "menos",
    "nuevo",
    "encontrar",
    "algo",
    "casa",
    "gente",
    "momento",
    "note",
    "notes",
    "todo",
    "idea",
    "link",
    "tags",
    "file",
    "folder",
    "vault",
  ]),
  Sr = new Set([
    "le",
    "de",
    "un",
    "\xEAtre",
    "et",
    "\xE0",
    "il",
    "avoir",
    "ne",
    "je",
    "son",
    "que",
    "se",
    "qui",
    "ce",
    "dans",
    "en",
    "du",
    "elle",
    "au",
    "de",
    "ce",
    "pour",
    "pas",
    "que",
    "vous",
    "par",
    "sur",
    "faire",
    "plus",
    "dire",
    "me",
    "on",
    "mon",
    "lui",
    "nous",
    "comme",
    "mais",
    "pouvoir",
    "tout",
    "y",
    "aller",
    "voir",
    "bien",
    "o\xF9",
    "sans",
    "tu",
    "ou",
    "leur",
    "l\xE0",
    "deux",
    "mari",
    "vouloir",
    "venir",
    "quand",
    "grand",
    "celui",
    "si",
    "notre",
    "m\xEAme",
    "ont",
    "o\xF9",
    "tout",
    "savoir",
    "votre",
    "doit",
    "bon",
    "tr\xE8s",
    "aucun",
    "peu",
    "m\xEAme",
    "trop",
    "assez",
    "quelque",
    "fois",
    "tant",
    "rien",
    "toujours",
    "encore",
    "quel",
    "ainsi",
    "moins",
    "aussi",
    "note",
    "notes",
    "todo",
    "id\xE9e",
    "lien",
    "tags",
    "fichier",
    "dossier",
    "coffre",
  ]),
  wr = new Set([
    "der",
    "die",
    "und",
    "in",
    "den",
    "von",
    "zu",
    "mit",
    "ist",
    "das",
    "f\xFCr",
    "auf",
    "sich",
    "dem",
    "er",
    "nicht",
    "ein",
    "eine",
    "als",
    "auch",
    "es",
    "an",
    "werden",
    "aus",
    "er",
    "hat",
    "dass",
    "sie",
    "nach",
    "wird",
    "bei",
    "einer",
    "um",
    "am",
    "sind",
    "noch",
    "wie",
    "einen",
    "so",
    "zum",
    "sein",
    "oder",
    "wurde",
    "ihr",
    "bis",
    "mehr",
    "durch",
    "man",
    "mein",
    "mich",
    "hatte",
    "sein",
    "kann",
    "sei",
    "war",
    "wenn",
    "w\xFCrde",
    "seine",
    "um",
    "haben",
    "keine",
    "vom",
    "wo",
    "geht",
    "k\xF6nnen",
    "ja",
    "sein",
    "sehr",
    "hier",
    "ganz",
    "also",
    "dann",
    "schon",
    "wohl",
    "immer",
    "m\xFCssen",
    "ohne",
    "etwas",
    "sagen",
    "jedoch",
    "da",
    "note",
    "notes",
    "todo",
    "idee",
    "link",
    "tags",
    "datei",
    "ordner",
    "tresor",
  ]),
  Cr = { en: li, fa: br, es: xr, fr: Sr, de: wr };
function Er(s) {
  let t = s.toLowerCase().split("-")[0];
  return Cr[t] ?? li;
}
function ci(s, t = "en") {
  return Er(t).has(s.toLowerCase());
}
var Mr = "en";
function di(s, t = Mr) {
  return new Set(
    s
      .toLocaleLowerCase()
      .split(/[^\p{L}\p{N}_]+/gu)
      .filter((e) => e.length >= 3 && !ci(e, t)),
  );
}
function ui(s) {
  return s.replace(/^#/, "").trim().toLowerCase();
}
function hi(s, t) {
  let e = 0;
  for (let n of s) t.has(n) && e++;
  return e;
}
function qe(s, t) {
  return [s, t].sort().join("|");
}
function Rr(s) {
  if (s.includes("soft-cluster")) return "soft-cluster";
  if (s.some((t) => t.startsWith("tags:"))) return "tags";
  if (s.some((t) => t === "folder:same" || t === "folder:top")) return "folder";
  if (s.some((t) => t.startsWith("title:") || t.startsWith("content:"))) return "semantic";
  if (s.some((t) => t.startsWith("link:"))) return "link";
}
function Dr(s) {
  let t = new Map();
  return (
    s.forEach((e) => {
      (e.titleTokens.forEach((n) => {
        (t.has(n) || t.set(n, new Set()), t.get(n).add(e.path));
      }),
        e.contentTokens.forEach((n) => {
          (t.get(n)?.size ?? 0) < Math.max(3, s.length * 0.1) &&
            (t.has(n) || t.set(n, new Set()), t.get(n).add(e.path));
        }),
        e.tags.forEach((n) => {
          let i = `tag:${n}`;
          (t.has(i) || t.set(i, new Set()), t.get(i).add(e.path));
        }));
    }),
    t
  );
}
function Tr(s, t, e) {
  let n = new Set();
  (s.titleTokens.forEach((o) => {
    t.get(o)?.forEach((a) => {
      a !== s.path && n.add(a);
    });
  }),
    s.contentTokens.forEach((o) => {
      t.get(o)?.forEach((a) => {
        a !== s.path && n.add(a);
      });
    }),
    s.tags.forEach((o) => {
      let a = `tag:${o}`;
      t.get(a)?.forEach((l) => {
        l !== s.path && n.add(l);
      });
    }));
  let i = `folder:${s.folder}`;
  t.has(i) &&
    t.get(i).forEach((o) => {
      o !== s.path && n.add(o);
    });
  let r = Array.from(n);
  return (r.length > 50 && r.splice(50), r);
}
function pi(s, t, e) {
  if (!s.size || !t.size) return 0;
  let n = hi(s, t);
  return n ? Math.min(e, (n / Math.max(s.size, t.size)) * e * 2) : 0;
}
function Ir(s) {
  let t = new Set();
  s?.tags?.forEach((i) => t.add(ui(i.tag)));
  let e = s?.frontmatter?.tags;
  return ((Array.isArray(e) ? e : typeof e == "string" ? [e] : []).forEach((i) => t.add(ui(String(i)))), t);
}
function kr(s, t, e) {
  let n = new Set();
  return (
    t?.links?.forEach((i) => {
      let r = e.metadataCache.getFirstLinkpathDest(i.link, s.path);
      r && n.add(r.path);
    }),
    n
  );
}
function mi(s, t, e) {
  let n = s.metadataCache.getFileCache(t),
    i = t.parent?.path ?? "",
    r = i.split("/")[0] ?? "",
    o = e.replace(/^---\n[\s\S]*?\n---\n?/, "");
  return {
    path: t.path,
    folder: i,
    topFolder: r,
    titleTokens: di(t.basename),
    contentTokens: di(o),
    tags: Ir(n),
    outgoingLinks: kr(t, n, s),
    role: We(t, n, e),
    modifiedAt: t.stat?.mtime ?? Date.now(),
  };
}
function Nr(s, t) {
  if (!t.enableInferredEdges && !t.linkGraphBaseline)
    return (C.info("inference", "Inferred simplices disabled by settings"), []);
  let e = [],
    n = new Map(),
    i = new Map(s.map((a) => [a.path, a])),
    r = Dr(s),
    o = new Set(s.map((a) => a.path));
  if (
    (s.forEach((a) => {
      let l = `folder:${a.folder}`;
      (r.has(l) || r.set(l, new Set()), r.get(l).add(a.path));
    }),
    s.forEach((a) => {
      Tr(a, r, o).forEach((c) => {
        let u = i.get(c);
        if (!u || a.path > c) return;
        let d = a,
          p = u,
          h = 0,
          m = [],
          g = !1;
        if (
          (t.enableLinkInference !== !1 &&
            d.outgoingLinks.has(p.path) &&
            ((g = !0), (h += t.linkWeight), m.push("link:a->b")),
          t.enableMutualLinkBonus !== !1 &&
            p.outgoingLinks.has(d.path) &&
            ((g = !0), (h += t.mutualLinkBonus), m.push("link:b->a")),
          !t.linkGraphBaseline && g && ((h = 0), (g = !1), (m.length = 0)),
          !t.enableInferredEdges && !g)
        )
          return;
        let f = hi(d.tags, p.tags);
        if (t.enableInferredEdges && t.enableSharedTags !== !1 && f > 0) {
          let x = Math.min(t.sharedTagWeight * 3, f * t.sharedTagWeight);
          ((h += x), m.push(`tags:${f}`));
        }
        let v =
          t.enableInferredEdges && t.enableTitleOverlap !== !1
            ? pi(d.titleTokens, p.titleTokens, t.titleOverlapWeight)
            : 0;
        v > 0 && ((h += v), m.push(`title:${v.toFixed(2)}`));
        let y =
          t.enableInferredEdges && t.enableContentOverlap !== !1
            ? pi(d.contentTokens, p.contentTokens, t.contentOverlapWeight)
            : 0;
        if (
          (y > 0 && ((h += y), m.push(`content:${y.toFixed(2)}`)),
          t.enableInferredEdges && t.enableSameFolderInference !== !1 && d.folder && d.folder === p.folder
            ? ((h += t.sameFolderWeight), m.push("folder:same"))
            : t.enableInferredEdges &&
              t.enableSameTopFolderInference !== !1 &&
              d.topFolder &&
              d.topFolder === p.topFolder &&
              ((h += t.sameTopFolderWeight), m.push("folder:top")),
          !g && h < t.inferenceThreshold)
        )
          return;
        let b = Math.max(0.1, Math.min(1, Number(h.toFixed(2))));
        (e.push({
          nodes: [d.path, p.path],
          weight: b,
          label: g && !t.enableInferredEdges ? "vault link" : "inferred relation",
          inferred: !0,
          userDefined: !1,
          autoGenerated: !1,
          colorKey: "neutral",
          inferredSignals: m,
          dominantSignal: Rr(m),
          confidence: b,
          suggested: b >= t.suggestionThreshold,
        }),
          n.set(qe(d.path, p.path), { nodes: [d.path, p.path], weight: b, signals: [...m] }));
      });
    }),
    t.enableInferredEdges)
  ) {
    let a = new Map();
    (n.forEach((c) => {
      let [u, d] = c.nodes;
      c.weight >= Math.max(t.inferenceThreshold, 0.18) &&
        (a.has(u) || a.set(u, []),
        a.has(d) || a.set(d, []),
        a.get(u).push({ partner: d, weight: c.weight, signals: c.signals }),
        a.get(d).push({ partner: u, weight: c.weight, signals: c.signals }));
    }),
      Array.from(a.entries())
        .filter(([, c]) => c.length >= 2)
        .map(([c]) => c)
        .forEach((c) => {
          let u = a.get(c) || [];
          for (let d = 0; d < u.length; d++)
            for (let p = d + 1; p < u.length; p++) {
              let h = u[d].partner,
                m = u[p].partner;
              if ([c, h, m].sort()[0] !== c) continue;
              let f = n.get(qe(c, h)),
                v = n.get(qe(c, m)),
                y = n.get(qe(h, m));
              if (!f || !v || !y) continue;
              let b = new Set([...f.signals, ...v.signals, ...y.signals, "soft-cluster"]);
              e.push({
                nodes: [c, h, m],
                weight: Math.min(1, Number(((f.weight + v.weight + y.weight) / 3 + 0.05).toFixed(2))),
                label: "soft cluster",
                inferred: !0,
                userDefined: !1,
                autoGenerated: !1,
                colorKey: "neutral",
                inferredSignals: [...b],
                dominantSignal: "soft-cluster",
                confidence: Math.min(1, Number(((f.weight + v.weight + y.weight) / 3 + 0.05).toFixed(2))),
                suggested: !0,
              });
            }
        }));
  }
  return (
    C.debug("inference", "Rebuilt inferred simplices (optimized)", {
      fileCount: s.length,
      inferredSimplexCount: e.length,
    }),
    e
  );
}
function gi(s, t) {
  let e = t.inferenceMode ?? "taxonomic",
    n = [];
  return (
    (e === "taxonomic" || e === "hybrid") && n.push(...Nr(s, t)),
    (e === "emergent" || e === "hybrid") && n.push(...ai(s, t)),
    n
  );
}
var xi = require("obsidian");
var fi = /^(△+|simplex:)\s+(.+)$/gim,
  yi = /^(◇|hyperedge:|encounter:)\s+(.+)$/gim;
function Pr(s, t) {
  let e = s.match(/^---\n([\s\S]*?)\n---/);
  if (!e) return null;
  try {
    return t.parseYaml(e[1]);
  } catch (n) {
    return (
      C.warn("parser", "Failed to parse frontmatter", { error: n instanceof Error ? n.message : String(n) }),
      null
    );
  }
}
function vi(s, t) {
  let e = Array.isArray(s.nodes) ? s.nodes.map(String) : [];
  return ne(e.map((n) => t.canonicalize(n)));
}
function Fr(s, t, e) {
  if (!s || typeof s != "object") return null;
  let n = s,
    i = vi(n, e);
  return i.length < 2
    ? null
    : {
        nodes: D(i),
        label: typeof n.label == "string" ? n.label : void 0,
        weight: typeof n.weight == "number" ? n.weight : void 0,
        userDefined: !0,
        autoGenerated: !1,
        sourcePath: t,
      };
}
function Ar(s, t, e) {
  if (!s || typeof s != "object") return null;
  let n = s,
    i = vi(n, e);
  if (i.length < 2) return null;
  let r = n.persistence === "recurring" ? "recurring" : "momentary";
  return {
    nodes: D(i),
    label: typeof n.label == "string" ? n.label : void 0,
    weight: typeof n.weight == "number" ? n.weight : void 0,
    mode: typeof n.mode == "string" ? n.mode : void 0,
    occurredAt: typeof n.occurredAt == "number" ? n.occurredAt : void 0,
    persistence: r,
    promotedTo: typeof n.promotedTo == "string" ? n.promotedTo : void 0,
    crystallizedInto: typeof n.crystallizedInto == "string" ? n.crystallizedInto : void 0,
    sourcePath: t,
  };
}
function Lr(s, t, e) {
  let n = [];
  fi.lastIndex = 0;
  let i;
  for (; (i = fi.exec(s)) !== null;) {
    let r = i[1],
      o = i[2].split(/\s+/).filter(Boolean),
      a = r === "\u25B3\u25B3" ? 4 : r === "\u25B3" ? 3 : o.length,
      l = ne(o.slice(0, a).map((c) => e.canonicalize(c)));
    l.length < 2 || n.push({ nodes: D(l), sourcePath: t, userDefined: !0, autoGenerated: !1 });
  }
  return n;
}
function Hr(s, t, e) {
  let n = [];
  yi.lastIndex = 0;
  let i;
  for (; (i = yi.exec(s)) !== null;) {
    let r = i[2].split(/\s+/).filter(Boolean),
      o = ne(r.map((a) => e.canonicalize(a)));
    o.length < 2 || n.push({ nodes: D(o), sourcePath: t, persistence: "momentary" });
  }
  return n;
}
function bi(s, t, e) {
  let n = Pr(s, e),
    i = { nodeIds: new Set(), simplices: [], hyperedges: [] };
  if (Array.isArray(n?.simplices))
    for (let o of n.simplices) {
      let a = Fr(o, t, e);
      a && i.simplices.push(a);
    }
  if (Array.isArray(n?.hyperedges))
    for (let o of n.hyperedges) {
      let a = Ar(o, t, e);
      a && i.hyperedges.push(a);
    }
  (i.simplices.push(...Lr(s, t, e)), i.hyperedges.push(...Hr(s, t, e)));
  let r = $r(i);
  return (
    r.simplices.forEach((o) => o.nodes.forEach((a) => r.nodeIds.add(a))),
    r.hyperedges.forEach((o) => o.nodes.forEach((a) => r.nodeIds.add(a))),
    C.info("parser", "Parsed relations", {
      sourcePath: t,
      simplexCount: r.simplices.length,
      hyperedgeCount: r.hyperedges.length,
      nodeCount: r.nodeIds.size,
    }),
    r
  );
}
function $r(s) {
  let t = new Set();
  s.simplices = s.simplices.filter((n) => {
    let i = w(n.nodes);
    return t.has(i) ? !1 : (t.add(i), !0);
  });
  let e = new Set();
  return (
    (s.hyperedges = s.hyperedges.filter((n) => {
      let i = w(n.nodes);
      return e.has(i) ? !1 : (e.add(i), !0);
    })),
    s
  );
}
function Si(s, t, e) {
  return bi(s, t, {
    canonicalize: (i) => Fe(i, t, e)?.path ?? i.trim(),
    parseYaml: (i) => (0, xi.parseYaml)(i) ?? null,
  });
}
var Ue = class {
  constructor(t, e, n, i, r) {
    this.app = t;
    this.model = e;
    this.settings = n;
    this.onExternalChange = i;
    this.onEncounterParsed = r;
    this.fullScanChunkSize = 24;
    this.inferenceRebuildDelayMs = 40;
    this.lastWrittenHash = new Map();
    this.fileSimplexKeys = new Map();
    this.inferenceContexts = new Map();
    this.lastInferredSnapshot = "";
    this.inferenceRebuildTimer = null;
    this.inferenceRebuildPromise = null;
    this.resolveInferenceRebuild = null;
    ((this.debouncedChange = (0, oe.debounce)(
      (o) => {
        this.onFileChange(o);
      },
      100,
      !0,
    )),
      this.app.vault.on("modify", (o) => {
        (de(), o instanceof oe.TFile && this.debouncedChange(o));
      }),
      this.app.vault.on("create", (o) => {
        (de(), o instanceof oe.TFile && this.debouncedChange(o));
      }),
      this.app.vault.on("delete", (o) => {
        (de(), this.onFileDelete(o));
      }),
      this.app.vault.on("rename", (o, a) => {
        (de(), o instanceof oe.TFile && this.onFileRename(o, a));
      }));
  }
  getInferenceContexts() {
    return [...this.inferenceContexts.values()];
  }
  recordWrite(t, e) {
    (this.lastWrittenHash.set(t, ee(e)),
      C.debug("vault-index", "Recorded plugin write hash", { path: t, hash: this.lastWrittenHash.get(t) }));
  }
  updateSettings(t) {
    ((this.settings = t), this.rebuildInferredSimplices());
  }
  isPluginInternalFile(t) {
    return t === this.settings.historyFile;
  }
  async fullScan() {
    de();
    let t = this.app.vault.getMarkdownFiles().filter((n) => !this.isPluginInternalFile(n.path));
    C.info("vault-index", "Starting full vault scan", { fileCount: t.length });
    let e = [];
    for (let n of t) {
      let i = await this.app.vault.read(n);
      (e.push({ file: n, content: i }),
        e.length >= this.fullScanChunkSize && (this.flushFullScanChunk(e), (e = []), await this.yieldToBrowser()));
    }
    (e.length > 0 && this.flushFullScanChunk(e),
      await this.scheduleInferenceRebuild(0),
      C.info("vault-index", "Completed full vault scan", {
        fileCount: t.length,
        indexedNodeCount: this.model.nodes.size,
        simplexCount: this.model.simplices.size,
      }));
  }
  async onFileChange(t) {
    if (t.extension !== "md" || this.isPluginInternalFile(t.path)) return;
    let e = await this.app.vault.read(t),
      n = ee(e);
    if (this.lastWrittenHash.get(t.path) === n) {
      C.debug("vault-index", "Suppressed self-triggered modify event", { path: t.path, hash: n });
      return;
    }
    (C.info("vault-index", "Processing changed file", { path: t.path, hash: n }),
      this.processFile(t, e),
      await this.scheduleInferenceRebuild(),
      this.onExternalChange?.());
  }
  onFileDelete(t) {
    t instanceof oe.TFile &&
      (C.info("vault-index", "File deleted", { path: t.path }),
      this.inferenceContexts.delete(t.path),
      this.model.removeNode(t.path),
      this.model.replaceSourceRelations(t.path, [], []),
      this.scheduleInferenceRebuild().then(() => this.onExternalChange?.()));
  }
  onFileRename(t, e) {
    (C.info("vault-index", "File renamed", { oldPath: e, newPath: t.path }), this.model.updateNodeId(e, t.path));
    let n = this.fileSimplexKeys.get(e);
    n && (this.fileSimplexKeys.set(t.path, n), this.fileSimplexKeys.delete(e));
    let i = this.inferenceContexts.get(e);
    (i && (this.inferenceContexts.set(t.path, { ...i, path: t.path }), this.inferenceContexts.delete(e)),
      this.scheduleInferenceRebuild().then(() => this.onExternalChange?.()));
  }
  processFile(t, e) {
    this.model.setNode(t.path, { isVirtual: !1 });
    let n = Si(e, t.path, this.app);
    (this.model.replaceSourceRelations(t.path, n.simplices, n.hyperedges),
      this.fileSimplexKeys.set(t.path, new Set(n.simplices.map((i) => i.nodes.join("|")))),
      this.inferenceContexts.set(t.path, mi(this.app, t, e)),
      n.hyperedges.forEach((i) => this.onEncounterParsed?.(i)),
      C.info("vault-index", "Indexed file", {
        path: t.path,
        parsedSimplexCount: n.simplices.length,
        parsedHyperedgeCount: n.hyperedges.length,
        parsedNodeCount: n.nodeIds.size,
        totalNodeCount: this.model.nodes.size,
        totalSimplexCount: this.model.simplices.size,
        totalHyperedgeCount: this.model.hyperedges.size,
      }));
  }
  flushFullScanChunk(t) {
    this.model.batch(() => {
      t.forEach(({ file: e, content: n }) => {
        this.processFile(e, n);
      });
    });
  }
  async yieldToBrowser() {
    await new Promise((t) => window.setTimeout(t, 0));
  }
  scheduleInferenceRebuild(t = this.inferenceRebuildDelayMs) {
    return (
      this.inferenceRebuildPromise === null &&
        (this.inferenceRebuildPromise = new Promise((e) => {
          this.resolveInferenceRebuild = e;
        })),
      this.inferenceRebuildTimer !== null && window.clearTimeout(this.inferenceRebuildTimer),
      (this.inferenceRebuildTimer = window.setTimeout(() => {
        this.inferenceRebuildTimer = null;
        try {
          this.rebuildInferredSimplices();
        } finally {
          let e = this.resolveInferenceRebuild;
          ((this.resolveInferenceRebuild = null), (this.inferenceRebuildPromise = null), e?.());
        }
      }, t)),
      this.inferenceRebuildPromise
    );
  }
  rebuildInferredSimplices() {
    let t = gi([...this.inferenceContexts.values()], this.settings),
      e =
        this.settings.inferenceEmits === "hyperedge"
          ? t
              .filter((r) => r.nodes.length > 2)
              .map((r) => ({
                nodes: r.nodes,
                label: r.label,
                weight: r.weight,
                confidence: r.confidence,
                inferred: !0,
                suggested: !0,
                suggestionSource: "inference",
              }))
          : [],
      n = this.settings.inferenceEmits === "hyperedge" ? t.filter((r) => r.nodes.length <= 2) : t;
    (this.model.replaceInferredSimplices(n), this.model.replaceInferredHyperedges(e));
    let i = JSON.stringify({
      inferredSimplexCount: n.length,
      inferredEncounterCount: e.length,
      totalSimplexCount: this.model.simplices.size,
      totalNodeCount: this.model.nodes.size,
      enabled: this.settings.enableInferredEdges,
    });
    i !== this.lastInferredSnapshot &&
      ((this.lastInferredSnapshot = i), C.debug("vault-index", "Updated inferred graph state", JSON.parse(i)));
  }
  destroy() {
    this.inferenceRebuildTimer !== null &&
      (window.clearTimeout(this.inferenceRebuildTimer), (this.inferenceRebuildTimer = null));
  }
};
function Or(s, t, e) {
  return s + (t - s) * e;
}
var Ye = class {
  constructor(t, e, n, i, r, o) {
    this.model = t;
    this.onWake = e;
    this.onSelection = n;
    this.onHoverIntent = i;
    this.onPinnedStateChanged = r;
    this.onInteraction = o;
    this.hoveredNodeId = null;
    this.lockedNodeId = null;
    this.hoveredSimplexKey = null;
    this.hoveredHyperedgeKey = null;
    this.holdNode = null;
    this.holdTimer = null;
    this.hoverIntentTimer = null;
    this.pressedNodeId = null;
    this.draggingNodeId = null;
    this.draggedNodeWasPinned = !1;
    this.dragOffsetX = 0;
    this.dragOffsetY = 0;
    this.pressX = 0;
    this.pressY = 0;
    this.movedDuringPointerDown = !1;
    this.interactionTracker = Lt();
  }
  getInteractionTracker() {
    return this.interactionTracker;
  }
  setInteractionTracker(t) {
    this.interactionTracker = t;
  }
  logConfirm(t, e) {
    (q(this.interactionTracker, { type: "confirm", simplexKey: t, nodeIds: e, weight: 0.5 }),
      this.onInteraction?.(this.interactionTracker));
  }
  logReject(t, e) {
    (q(this.interactionTracker, { type: "reject", simplexKey: t, nodeIds: e, weight: -0.3 }),
      this.onInteraction?.(this.interactionTracker));
  }
  logPromote(t, e) {
    (q(this.interactionTracker, { type: "promote", simplexKey: t, nodeIds: e, weight: 0.8 }),
      this.onInteraction?.(this.interactionTracker));
  }
  logDissolve(t, e) {
    (q(this.interactionTracker, { type: "dissolve", simplexKey: t, nodeIds: e, weight: -0.5 }),
      this.onInteraction?.(this.interactionTracker));
  }
  logCreate(t) {
    (q(this.interactionTracker, { type: "create", nodeIds: t, weight: 0.6 }),
      this.onInteraction?.(this.interactionTracker));
  }
  getFocusState() {
    let t = new Set(),
      e = new Set(),
      n = new Set(),
      i = this.lockedNodeId ?? this.hoveredNodeId;
    (i &&
      (t.add(i),
      this.model.getSimplicesForNode(i).forEach((o) => {
        (e.add(w(o.nodes)), o.nodes.forEach((a) => t.add(a)));
      }),
      this.model.getHyperedgesForNode(i).forEach((o) => {
        (n.add(M("hyperedge", o.nodes)), o.nodes.forEach((a) => t.add(a)));
      })),
      this.hoveredSimplexKey &&
        (e.add(this.hoveredSimplexKey), this.model.getSimplex(this.hoveredSimplexKey)?.nodes.forEach((o) => t.add(o))),
      this.hoveredHyperedgeKey &&
        (n.add(this.hoveredHyperedgeKey),
        this.model.getHyperedge(this.hoveredHyperedgeKey)?.nodes.forEach((o) => t.add(o))));
    let r = (o, a) => {
      if (o.kind === "hyperedge") {
        let c = a ?? M("hyperedge", o.nodes);
        return n.has(c) || o.nodes.some((u) => t.has(u));
      }
      let l = a ?? w(o.nodes);
      return e.has(l) || o.nodes.some((c) => t.has(c));
    };
    return {
      isActive: t.size > 0 || e.size > 0 || n.size > 0,
      lockedNodeId: this.lockedNodeId,
      hoveredNodeId: this.hoveredNodeId,
      hoveredSimplexKey: this.hoveredSimplexKey,
      hoveredHyperedgeKey: this.hoveredHyperedgeKey,
      activeNodeIds: t,
      activeSimplexKeys: e,
      activeHyperedgeKeys: n,
      involvesNode: (o) => t.has(o),
      involvesSimplex: (o, a) => r({ kind: "simplex", ...o }, a),
      involvesRelation: r,
    };
  }
  updateHover(t, e, n, i = 1e3) {
    this.onWake?.();
    let r = n.find((o) => (o.px - t) ** 2 + (o.py - e) ** 2 <= 400)?.id ?? null;
    r !== this.hoveredNodeId && ((this.hoveredNodeId = r), this.scheduleHoverIntent(i));
  }
  clearFocus() {
    (this.clearHoverIntent(),
      (this.hoveredNodeId = null),
      (this.hoveredSimplexKey = null),
      (this.hoveredHyperedgeKey = null),
      (this.lockedNodeId = null),
      this.onSelection?.(null));
  }
  focusHoveredNode() {
    this.lockedNodeId = this.hoveredNodeId;
  }
  onMousedown(t, e, n) {
    let i = this.model.nodes.get(t);
    i &&
      ((this.pressedNodeId = t),
      (this.draggingNodeId = null),
      (this.draggedNodeWasPinned = i.isPinned),
      (this.dragOffsetX = e - i.px),
      (this.dragOffsetY = n - i.py),
      (this.pressX = e),
      (this.pressY = n),
      (this.movedDuringPointerDown = !1),
      (this.holdTimer = window.setTimeout(() => {
        ((this.holdNode = t), this.onWake?.());
      }, 200)));
  }
  onPointerMove(t, e) {
    if (!this.pressedNodeId || !this.model.nodes.get(this.pressedNodeId)) return !1;
    let i = (t - this.pressX) ** 2 + (e - this.pressY) ** 2;
    if (
      (i > 1 && (this.clearHoldTimer(), (this.holdNode = null)),
      i > 1 && ((this.movedDuringPointerDown = !0), (this.draggingNodeId = this.pressedNodeId)),
      !this.draggingNodeId)
    )
      return !1;
    ((this.hoveredNodeId = this.draggingNodeId),
      this.model.setPinnedState(
        this.draggingNodeId,
        this.draggedNodeWasPinned,
        t - this.dragOffsetX,
        e - this.dragOffsetY,
      ));
    let o = this.model.nodes.get(this.draggingNodeId);
    return (o && ((o.vx = 0), (o.vy = 0)), this.onWake?.(), !0);
  }
  onMouseup() {
    let t = this.movedDuringPointerDown && !!this.draggingNodeId;
    return (
      this.clearHoldTimer(),
      (this.pressedNodeId = null),
      (this.draggingNodeId = null),
      (this.draggedNodeWasPinned = !1),
      (this.movedDuringPointerDown = !1),
      (this.holdNode = null),
      t && this.onWake?.(),
      t
    );
  }
  clearHoldTimer() {
    this.holdTimer !== null && (window.clearTimeout(this.holdTimer), (this.holdTimer = null));
  }
  cancelHoverSelection() {
    this.clearHoverIntent();
  }
  togglePin(t) {
    let e = this.model.nodes.get(t);
    return e
      ? (this.model.setPinnedState(t, !e.isPinned, e.px, e.py),
        this.onWake?.(),
        this.onPinnedStateChanged?.(),
        !e.isPinned)
      : !1;
  }
  selectSimplex(t) {
    if (
      (this.clearHoverIntent(),
      (this.hoveredSimplexKey = t),
      (this.hoveredHyperedgeKey = null),
      this.onSelection?.(t ? { kind: "simplex", key: t } : null),
      t)
    ) {
      let e = this.model.getSimplex(t);
      e && q(this.interactionTracker, { type: "select", simplexKey: t, nodeIds: e.nodes, weight: 0.1 });
    }
  }
  selectHyperedge(t) {
    if (
      (this.clearHoverIntent(),
      (this.hoveredHyperedgeKey = t),
      (this.hoveredSimplexKey = null),
      this.onSelection?.(t ? { kind: "hyperedge", key: t } : null),
      t)
    ) {
      let e = this.model.getHyperedge(t);
      e && q(this.interactionTracker, { type: "select", simplexKey: t, nodeIds: e.nodes, weight: 0.1 });
    }
  }
  selectRelation(t) {
    if (!t) {
      this.selectSimplex(null);
      return;
    }
    t.kind === "hyperedge" ? this.selectHyperedge(t.key) : this.selectSimplex(t.key);
  }
  lerpAlpha(t, e) {
    let n = !e.isActive || e.involvesNode(t.id) ? 1 : 0.2;
    t.displayAlpha = Or(t.displayAlpha, n, 0.12);
  }
  scheduleHoverIntent(t) {
    if ((this.clearHoverIntent(), !this.hoveredNodeId)) {
      this.onHoverIntent?.(null);
      return;
    }
    this.hoverIntentTimer = window.setTimeout(() => {
      let e = this.model.getSimplicesForNode(this.hoveredNodeId).sort((i, r) => (r.weight ?? 1) - (i.weight ?? 1))[0],
        n = e ? w(e.nodes) : null;
      ((this.hoveredSimplexKey = n), this.onHoverIntent?.(n ? { kind: "simplex", key: n } : null));
    }, t);
  }
  clearHoverIntent() {
    this.hoverIntentTimer !== null && (window.clearTimeout(this.hoverIntentTimer), (this.hoverIntentTimer = null));
  }
};
function Ci(s, t) {
  return s < t ? `${s}|${t}` : `${t}|${s}`;
}
function Kr(s) {
  let t = 2166136261;
  for (let e = 0; e < s.length; e++) ((t ^= s.charCodeAt(e)), (t = Math.imul(t, 16777619)));
  return (t >>> 0) / 4294967295;
}
var Gt = class s {
    constructor(t, e, n, i) {
      this.mass = 0;
      this.cx = 0;
      this.cy = 0;
      this.children = [null, null, null, null];
      this.node = null;
      ((this.x = t), (this.y = e), (this.width = n), (this.height = i));
    }
    insert(t) {
      if (this.node === null && this.children[0] === null) {
        ((this.node = t), (this.mass = 1), (this.cx = t.px), (this.cy = t.py));
        return;
      }
      if (this.node !== null) {
        this.subdivide();
        let e = this.node;
        ((this.node = null), this.insertIntoChildren(e), this.insertIntoChildren(t));
      } else this.insertIntoChildren(t);
      this.updateCenterOfMass();
    }
    subdivide() {
      let t = this.width / 2,
        e = this.height / 2;
      ((this.children[0] = new s(this.x, this.y, t, e)),
        (this.children[1] = new s(this.x + t, this.y, t, e)),
        (this.children[2] = new s(this.x, this.y + e, t, e)),
        (this.children[3] = new s(this.x + t, this.y + e, t, e)));
    }
    insertIntoChildren(t) {
      let e = this.width / 2,
        n = this.height / 2;
      t.px < this.x + e
        ? t.py < this.y + n
          ? this.children[0].insert(t)
          : this.children[2].insert(t)
        : t.py < this.y + n
          ? this.children[1].insert(t)
          : this.children[3].insert(t);
    }
    updateCenterOfMass() {
      let t = 0,
        e = 0,
        n = 0;
      for (let i of this.children) i && ((t += i.mass), (e += i.cx * i.mass), (n += i.cy * i.mass));
      ((this.mass = t), t > 0 && ((this.cx = e / t), (this.cy = n / t)));
    }
    calculateForce(t, e, n) {
      if (this.mass === 0) return { fx: 0, fy: 0 };
      let i = t.px - this.cx,
        r = t.py - this.cy,
        o = Math.hypot(i, r) || 1,
        a = o * o + 1;
      if (this.node === t && this.children[0] === null) return { fx: 0, fy: 0 };
      if (this.width / o < e || this.node !== null) {
        let l = (n * this.mass) / a;
        return { fx: (l * i) / o, fy: (l * r) / o };
      } else {
        let l = 0,
          c = 0;
        for (let u of this.children)
          if (u) {
            let d = u.calculateForce(t, e, n);
            ((l += d.fx), (c += d.fy));
          }
        return { fx: l, fy: c };
      }
    }
  },
  Xe = class {
    constructor() {
      this.MIN_NODE_SEPARATION = 72;
      this.REPULSION = 1800;
      this.COHESION = 0.005;
      this.GRAVITY = 7e-4;
      this.NOISE = 0.06;
      this.DAMPING = 0.9;
      this.BOUNDARY_PADDING = 50;
      this.SPARSE_EDGE_LENGTH = 150;
      this.SPARSE_GRAVITY_BOOST = 1.8;
      this.BARNES_HUT_THETA = 0.65;
      this.MAX_VELOCITY = 30;
      this.USE_BARNES_HUT = !0;
      this.isAsleep = !1;
      this.animationHold = !1;
      this.animFrame = null;
      this.renderFn = null;
      this.getState = null;
    }
    configure(t) {
      (t.noiseAmount !== void 0 && (this.NOISE = t.noiseAmount),
        t.sleepThreshold,
        t.repulsionStrength !== void 0 && (this.REPULSION = t.repulsionStrength),
        t.cohesionStrength !== void 0 && (this.COHESION = t.cohesionStrength),
        t.gravityStrength !== void 0 && (this.GRAVITY = t.gravityStrength),
        t.dampingFactor !== void 0 && (this.DAMPING = t.dampingFactor),
        t.boundaryPadding !== void 0 && (this.BOUNDARY_PADDING = t.boundaryPadding),
        t.sparseEdgeLength !== void 0 && (this.SPARSE_EDGE_LENGTH = t.sparseEdgeLength),
        t.sparseGravityBoost !== void 0 && (this.SPARSE_GRAVITY_BOOST = t.sparseGravityBoost));
    }
    start(t, e) {
      ((this.renderFn = t),
        (this.getState = e),
        this.animFrame !== null && window.cancelAnimationFrame(this.animFrame));
      let n = () => {
        let { nodes: i, simplices: r, hyperedges: o, bounds: a, holdNode: l } = e();
        (this.tick(i, r, a, l, o), t(), this.isAsleep || (this.animFrame = window.requestAnimationFrame(n)));
      };
      ((this.isAsleep = !1), (this.animFrame = window.requestAnimationFrame(n)));
    }
    stop() {
      (this.animFrame !== null && window.cancelAnimationFrame(this.animFrame),
        (this.animFrame = null),
        (this.isAsleep = !0));
    }
    wake() {
      !this.isAsleep ||
        !this.renderFn ||
        !this.getState ||
        ((this.isAsleep = !1), this.start(this.renderFn, this.getState));
    }
    refresh() {
      !this.renderFn || !this.getState || this.start(this.renderFn, this.getState);
    }
    setAnimationHold(t) {
      ((this.animationHold = t), t && this.wake());
    }
    get isAnimationHeld() {
      return this.animationHold;
    }
    get sleeping() {
      return this.isAsleep;
    }
    tick(t, e, n, i, r = []) {
      let a =
          e.filter((m) => m.nodes.length === 2).length > 0 &&
          e.every((m) => m.nodes.length <= 2 || m.inferred) &&
          !r.some((m) => m.nodes.length >= 3),
        l = new Map(t.map((m) => [m.id, m])),
        c = new Map(),
        u = new Map();
      (t.forEach((m) => {
        u.set(m.id, { edgeCount: 0, clusterCount: 0, maxDim: 0 });
      }),
        e.forEach((m) => {
          let g = m.nodes.length - 1,
            f = m.weight ?? 1,
            v = m.nodes.length === 2 ? 1 : 1 + Math.min(1.2, (m.nodes.length - 2) * 0.4);
          m.nodes.forEach((y) => {
            let b = u.get(y);
            b &&
              (m.nodes.length === 2 && b.edgeCount++,
              m.nodes.length >= 3 && b.clusterCount++,
              (b.maxDim = Math.max(b.maxDim, g)));
          });
          for (let y = 0; y < m.nodes.length; y++)
            for (let b = y + 1; b < m.nodes.length; b++) {
              let x = Ci(m.nodes[y], m.nodes[b]),
                R = (c.get(x) ?? 0) + f * v;
              c.set(x, Math.min(3.5, R));
            }
        }));
      let d = t.length > 0 ? this.calculateBounds(t) : { x: 0, y: 0, width: 1e3, height: 1e3 },
        p = new Gt(d.x, d.y, d.width, d.height);
      (t.forEach((m) => p.insert(m)),
        t.forEach((m) => {
          if (m.isPinned) return;
          let g = p.calculateForce(m, this.BARNES_HUT_THETA, this.REPULSION);
          ((m.vx += g.fx), (m.vy += g.fy));
        }));
      for (let m = 0; m < t.length; m++)
        for (let g = m + 1; g < t.length; g++) {
          let f = t[m],
            v = t[g],
            y = v.px - f.px,
            b = v.py - f.py,
            x = Math.hypot(y, b) || 1,
            R = c.get(Ci(f.id, v.id)) ?? 0,
            k = y / x,
            P = b / x,
            N = Math.max(0, this.MIN_NODE_SEPARATION - x);
          if (N > 0 && !this.USE_BARNES_HUT) {
            let B = N * this.COHESION * 0.55;
            (f.isPinned || ((f.vx -= B * k), (f.vy -= B * P)), v.isPinned || ((v.vx += B * k), (v.vy += B * P)));
          }
          if (R > 0) {
            let B = Math.min(1.6, R),
              W = Math.max(this.MIN_NODE_SEPARATION * 1.05, this.SPARSE_EDGE_LENGTH * (1.08 - B * 0.2)),
              Q = (x - W) * this.COHESION * 0.16 * (1 + R * 0.9),
              Ee = W * 0.68,
              V = Math.max(0, Ee - x) * this.COHESION * 0.28 * (1 + R * 1.1);
            (f.isPinned || ((f.vx += Q * k - V * k), (f.vy += Q * P - V * P)),
              v.isPinned || ((v.vx -= Q * k - V * k), (v.vy -= Q * P - V * P)));
          }
        }
      if (
        (e.forEach((m) => {
          if (m.nodes.length < 3) return;
          let g = m.nodes.map((b) => l.get(b)).filter(Boolean);
          if (!g.length) return;
          let f = g.reduce((b, x) => b + x.px, 0) / g.length,
            v = g.reduce((b, x) => b + x.py, 0) / g.length,
            y = m.weight ?? 1;
          g.forEach((b) => {
            b.isPinned ||
              ((b.vx += (f - b.px) * this.COHESION * y * 0.75), (b.vy += (v - b.py) * this.COHESION * y * 0.75));
          });
        }),
        r.forEach((m) => {
          let g = m.nodes.map((b) => l.get(b)).filter(Boolean);
          if (g.length < 2) return;
          let f = g.reduce((b, x) => b + x.px, 0) / g.length,
            v = g.reduce((b, x) => b + x.py, 0) / g.length,
            y = m.weight ?? 1;
          g.forEach((b) => {
            b.isPinned ||
              ((b.vx += (f - b.px) * this.COHESION * y * 0.5), (b.vy += (v - b.py) * this.COHESION * y * 0.5));
          });
        }),
        i)
      ) {
        let m = l.get(i);
        m &&
          t.forEach((g) => {
            if (g === m || g.isPinned) return;
            let f = g.px - m.px,
              v = g.py - m.py,
              y = f * f + v * v + 1;
            ((g.vx += (f / y) * 900), (g.vy += (v / y) * 900));
          });
      }
      let h =
        t.length > 0
          ? { x: t.reduce((m, g) => m + g.px, 0) / t.length, y: t.reduce((m, g) => m + g.py, 0) / t.length }
          : { x: 0, y: 0 };
      t.forEach((m) => {
        if (m.isPinned) return;
        let g = u.get(m.id) ?? { edgeCount: 0, clusterCount: 0, maxDim: 0 },
          f = a ? this.GRAVITY * this.SPARSE_GRAVITY_BOOST : this.GRAVITY,
          v = g.clusterCount > 0 ? 1.2 : g.edgeCount > 0 ? 0.7 : 0.08,
          y = g.clusterCount > 0 ? 0.14 : g.edgeCount > 0 ? 0.08 : 0.01;
        if (
          ((m.vx += (0 - m.px) * f * v + (h.x - m.px) * f * y + (Math.random() - 0.5) * this.NOISE),
          (m.vy += (0 - m.py) * f * v + (h.y - m.py) * f * y + (Math.random() - 0.5) * this.NOISE),
          g.edgeCount === 0 && g.clusterCount === 0)
        ) {
          let x = Kr(m.id) * Math.PI * 2,
            R = Math.max(this.SPARSE_EDGE_LENGTH * 2.8, 320),
            k = Math.cos(x) * R,
            P = Math.sin(x) * R;
          ((m.vx += (k - m.px) * f * 0.22), (m.vy += (P - m.py) * f * 0.22));
        }
        ((m.vx *= this.DAMPING), (m.vy *= this.DAMPING));
        let b = Math.hypot(m.vx, m.vy);
        if (b > this.MAX_VELOCITY) {
          let x = this.MAX_VELOCITY / b;
          ((m.vx *= x), (m.vy *= x));
        }
        ((m.px += m.vx), (m.py += m.vy));
      });
    }
    calculateBounds(t) {
      if (t.length === 0) return { x: -500, y: -500, width: 1e3, height: 1e3 };
      let e = 1 / 0,
        n = 1 / 0,
        i = -1 / 0,
        r = -1 / 0;
      t.forEach((c) => {
        ((e = Math.min(e, c.px)), (n = Math.min(n, c.py)), (i = Math.max(i, c.px)), (r = Math.max(r, c.py)));
      });
      let o = 100,
        a = Math.max(i - e + 2 * o, 1e3),
        l = Math.max(r - n + 2 * o, 1e3);
      return { x: e - o, y: n - o, width: a, height: l };
    }
  };
var A = {
  purple: [127, 119, 221],
  teal: [29, 158, 117],
  coral: [216, 90, 48],
  pink: [208, 98, 156],
  blue: [76, 125, 212],
  amber: [214, 151, 52],
  neutral: [136, 135, 128],
  "default-purple": [127, 119, 221],
  "default-teal": [29, 158, 117],
  "default-coral": [216, 90, 48],
};
function Br(s) {
  let t = s.inferredSignals ?? [];
  return t.includes("soft-cluster")
    ? A.teal
    : t.some((e) => e.startsWith("tags:"))
      ? A.amber
      : t.some((e) => e === "folder:same" || e === "folder:top")
        ? A.pink
        : t.some((e) => e.startsWith("title:") || e.startsWith("content:"))
          ? A.coral
          : t.some((e) => e.startsWith("link:"))
            ? A.blue
            : A.neutral;
}
function Di(s) {
  return `${s.nodes.join("|")}|${s.label ?? ""}|${s.sourcePath ?? ""}`;
}
function Ti(s, t) {
  let n = 0.82 + (ee(Di(t)) % 29) / 100;
  return s.map((i) => Math.max(0, Math.min(255, Math.round(i * n))));
}
function Ei(s) {
  let t = Math.max(2, s.nodes.length),
    e = [A.blue, A.teal, A.coral, A.pink, A.amber, A.purple],
    n = ee(Di(s)),
    r = (((t - 2) % e.length) + (n % e.length)) % e.length;
  return Ti(e[r], s);
}
function Mi(s, t) {
  return s.every((e) => t.includes(e));
}
function Ri(s) {
  if (s.inferred) {
    let t = Br(s);
    return s.nodes.length >= 3 ? Ei(s) : Ti(t, s);
  }
  return Ei(s);
}
function _r(s, t) {
  let e = [...s.simplices.values()].filter((r) => r.nodes.length > t.nodes.length && Mi(t.nodes, r.nodes));
  if (!e.length) return null;
  let n = e.sort((r, o) => o.nodes.length - r.nodes.length || r.nodes.join("|").localeCompare(o.nodes.join("|")))[0];
  return e.some((r) => !Mi(r.nodes, n.nodes)) ? null : n;
}
function L(s, t) {
  if (!s) return Ri(t);
  let e = _r(s, t);
  return Ri(e ?? t);
}
var Ii = new Map();
function Ut(s, t) {
  return s.nodes.map((e) => t.find((n) => n.id === e)).filter(Boolean);
}
function Ni(s) {
  return { x: s.reduce((t, e) => t + e.x, 0) / s.length, y: s.reduce((t, e) => t + e.y, 0) / s.length };
}
function Wr(s) {
  let t = Ni(s);
  return [...s].sort((e, n) => Math.atan2(e.y - t.y, e.x - t.x) - Math.atan2(n.y - t.y, n.x - t.x));
}
function zr(s, t) {
  let e = Ni(s);
  return s.map((n) => {
    let i = n.x - e.x,
      r = n.y - e.y,
      o = Math.hypot(i, r) || 1;
    return { x: n.x + (i / o) * t, y: n.y + (r / o) * t };
  });
}
function jr(s, t) {
  let e = t.length;
  s.beginPath();
  for (let n = 0; n < e; n++) {
    let i = t[(n - 1 + e) % e],
      r = t[n],
      o = t[(n + 1) % e],
      a = t[(n + 2) % e],
      l = 0.45,
      c = r.x + ((o.x - i.x) * l) / 2,
      u = r.y + ((o.y - i.y) * l) / 2,
      d = o.x - ((a.x - r.x) * l) / 2,
      p = o.y - ((a.y - r.y) * l) / 2;
    (n === 0 && s.moveTo(r.x, r.y), s.bezierCurveTo(c, u, d, p, o.x, o.y));
  }
  s.closePath();
}
function qt(s, t, e, n) {
  let i = e.x - t.x,
    r = e.y - t.y,
    o = Math.hypot(i, r) || 1,
    a = (-r / o) * n,
    l = (i / o) * n,
    c = Math.atan2(r, i);
  (s.beginPath(),
    s.moveTo(t.x + a, t.y + l),
    s.lineTo(e.x + a, e.y + l),
    s.arc(e.x, e.y, n, c - Math.PI / 2, c + Math.PI / 2),
    s.lineTo(t.x - a, t.y - l),
    s.arc(t.x, t.y, n, c + Math.PI / 2, c - Math.PI / 2),
    s.closePath());
}
function Pi(s) {
  if (s.length < 3) return !0;
  let [t, e] = s;
  for (let n = 2; n < s.length; n++) {
    let i = s[n],
      r = (e.x - t.x) * (i.y - t.y) - (e.y - t.y) * (i.x - t.x);
    if (Math.abs(r) > 0.001) return !1;
  }
  return !0;
}
function Vr(s, t, e, n) {
  let i = s,
    r = Ut(t, e);
  if (!r.length) return null;
  let o = r.map((y) => ({ x: y.px, y: y.py })),
    a = Ii.get(i);
  if (a && o.every((y, b) => Math.hypot(y.x - a.positions[b].x, y.y - a.positions[b].y) <= 2)) return a;
  let l = n * 2.5,
    c = r.map((y) => y.px),
    u = r.map((y) => y.py),
    d = Math.min(...c) - l,
    p = Math.min(...u) - l,
    h = Math.max(...c) - d + l,
    m = Math.max(...u) - p + l,
    g = activeDocument.createEl("canvas");
  ((g.width = Math.max(1, Math.ceil(h))), (g.height = Math.max(1, Math.ceil(m))));
  let f = g.getContext("2d");
  if (!f) return null;
  if ((f.translate(-d, -p), (f.fillStyle = "#ffffff"), r.length === 1))
    (f.beginPath(), f.arc(r[0].px, r[0].py, n, 0, Math.PI * 2), f.fill());
  else if (Pi(o)) (qt(f, o[0], o[o.length - 1], n), f.fill());
  else
    for (let y = 0; y < r.length; y++) {
      for (let b = y + 1; b < r.length; b++)
        (qt(f, { x: r[y].px, y: r[y].py }, { x: r[b].px, y: r[b].py }, n), f.fill());
      (f.beginPath(), f.arc(r[y].px, r[y].py, n, 0, Math.PI * 2), f.fill());
    }
  let v = { canvas: g, x: d, y: p, positions: o };
  return (Ii.set(i, v), v);
}
var Gr = 8;
function ki(s, t, e) {
  if (t.length === 2 || Pi(t)) {
    qt(s, t[0], t[t.length - 1], e);
    return;
  }
  jr(s, zr(Wr(t), e));
}
function Fi(s, t, e, n, i) {
  let r = Ut(t, e);
  if (r.length < 2) return;
  let [o, a, l] = n,
    c = r.map((d) => ({ x: d.px, y: d.py })),
    u = 30 + (t.weight ?? 1) * 14;
  if (
    (s.save(),
    (s.lineJoin = "round"),
    s.setLineDash(i.dash),
    (s.lineWidth = i.lineWidth),
    (s.strokeStyle = `rgba(${o},${a},${l},${i.strokeAlpha})`),
    (s.fillStyle = `rgba(${o},${a},${l},${i.fillAlpha})`),
    r.length > Gr)
  ) {
    (c.forEach((d) => {
      (s.beginPath(), s.arc(d.x, d.y, u * 0.42, 0, Math.PI * 2), s.stroke());
    }),
      s.restore());
    return;
  }
  (ki(s, c, u),
    s.fill(),
    s.stroke(),
    i.showEmergenceContour &&
      (s.setLineDash([2, 5]),
      (s.lineWidth = 1),
      (s.strokeStyle = `rgba(${o},${a},${l},${Math.min(1, i.strokeAlpha * 0.8)})`),
      ki(s, c, u * 0.62),
      s.stroke()),
    s.setLineDash([]),
    (s.fillStyle = `rgba(${o},${a},${l},${Math.min(1, i.strokeAlpha * 0.8)})`),
    c.forEach((d) => {
      (s.beginPath(), s.arc(d.x, d.y, i.memberRadius, 0, Math.PI * 2), s.fill());
    }),
    s.restore());
}
function Ai(s, t, e, n, i, r, o) {
  if (!Ut(e, i).length) return;
  let [l, c, u] = L(n, e),
    d = 36 + (e.weight ?? 1) * 24 + (e.nodes.length - 1 === 3 ? 20 : 0),
    p = o.isActive ? (o.involvesSimplex(e, t) ? r : r * 0.18) : r,
    h = Vr(`s:${t}`, e, i, d);
  if (!h) return;
  [
    { alpha: p * 0.15, blur: 18 },
    { alpha: p * 0.42, blur: 12 },
    { alpha: p, blur: 8 },
  ].forEach((g) => {
    (s.save(),
      (s.globalAlpha = g.alpha),
      (s.filter = `blur(${g.blur}px)`),
      s.drawImage(h.canvas, h.x, h.y),
      (s.filter = "none"),
      (s.globalCompositeOperation = "source-atop"),
      (s.fillStyle = `rgb(${l},${c},${u})`),
      s.fillRect(h.x, h.y, h.canvas.width, h.canvas.height),
      (s.globalCompositeOperation = "source-over"),
      s.restore());
  });
}
function xe(s) {
  return Math.max(0, Math.min(1, s));
}
function Li(s, t = 2600) {
  return (1 - Math.cos((s / t) * Math.PI * 2)) / 2;
}
function Hi(s) {
  let t = xe(s.opacity) * (s.focused ? 1 : 0.35),
    e = s.deficit === null ? 0.5 : 1 - xe(s.deficit),
    n = xe(s.pulse);
  return {
    dash: [9, 4 + 11 * (1 - e)],
    strokeAlpha: xe(t * 1.5 * (0.85 + 0.3 * n)),
    fillAlpha: xe(t * (0.05 + 0.14 * e)),
    lineWidth: (s.focused ? 2 : 1.4) * (1 + 0.25 * n),
    memberRadius: (s.focused ? 3.4 : 2.6) * (1 + 0.35 * n),
    showEmergenceContour: s.emergent,
  };
}
function $i(s, t) {
  return s * (1 + 0.45 * xe(t));
}
var Ze = 10;
function Oi(s) {
  let t = s.readCrossLayerCache();
  if (t) return t;
  let e = new Map(),
    n = new Map();
  return (
    s.hyperedges.forEach((i, r) => {
      let o = i.nodes,
        a = o.length,
        l = a <= Ze ? 2 ** a - a - 1 : Number.POSITIVE_INFINITY;
      if (a > Ze) {
        e.set(r, { key: r, nodes: o, presentFaces: [], missingFaces: [], impliedFaceCount: l, unbounded: !0 });
        return;
      }
      let c = [],
        u = [];
      for (let d = 2; d <= a; d++)
        for (let p of pe(o, d)) {
          let h = w(p);
          if (s.simplices.has(h)) {
            c.push(h);
            let m = n.get(h) ?? [];
            (m.push(r), n.set(h, m));
          } else u.push(p);
        }
      e.set(r, { key: r, nodes: o, presentFaces: c, missingFaces: u, impliedFaceCount: l, unbounded: !1 });
    }),
    s.writeCrossLayerCache({ hyperedges: e, simplexCoveredBy: n })
  );
}
var qr = 1e3 * 60 * 60 * 24;
function ke(s) {
  return Number.isNaN(s) ? 0 : Math.max(0, Math.min(1, s));
}
function Je(s, t) {
  let e = Oi(s).hyperedges.get(t);
  if (!e) return null;
  if (e.unbounded)
    return {
      key: t,
      nodes: e.nodes,
      missingFaces: [],
      missingCount: 0,
      impliedFaceCount: e.impliedFaceCount,
      deficit: null,
      unbounded: !0,
    };
  let n = e.missingFaces.length;
  return {
    key: t,
    nodes: e.nodes,
    missingFaces: e.missingFaces,
    missingCount: n,
    impliedFaceCount: e.impliedFaceCount,
    deficit: e.impliedFaceCount > 0 ? ke(n / e.impliedFaceCount) : 0,
    unbounded: !1,
  };
}
function Ki(s) {
  let t = new Map(),
    e = 0;
  s.hyperedges.forEach((r, o) => {
    let a = Je(s, o);
    if (!a || a.unbounded) {
      (e++, t.set(o, null));
      return;
    }
    t.set(o, a.deficit);
  });
  let n = [...t.values()].filter((r) => r !== null),
    i = Ur(s).map((r) => {
      let o = r.encounters.map((a) => t.get(a)).filter((a) => a != null);
      return { ...r, simpliciality: o.length > 0 ? 1 - o.reduce((a, l) => a + l, 0) / o.length : null };
    });
  return {
    value: n.length > 0 ? 1 - n.reduce((r, o) => r + o, 0) / n.length : null,
    measuredEncounters: n.length,
    unboundedEncounters: e,
    components: i,
  };
}
function Ur(s) {
  let t = new Map(),
    e = (i) => {
      let r = i;
      for (; t.get(r) !== r;) r = t.get(r);
      let o = i;
      for (; t.get(o) !== r;) {
        let a = t.get(o);
        (t.set(o, r), (o = a));
      }
      return r;
    };
  (s.hyperedges.forEach((i) => {
    i.nodes.forEach((r) => {
      t.has(r) || t.set(r, r);
    });
  }),
    s.hyperedges.forEach((i) => {
      let [r, ...o] = i.nodes;
      r !== void 0 &&
        o.forEach((a) => {
          let l = e(r),
            c = e(a);
          l !== c && t.set(c, l);
        });
    }));
  let n = new Map();
  return (
    t.forEach((i, r) => {
      let o = e(r),
        a = n.get(o) ?? { nodes: [], encounters: [] };
      (a.nodes.push(r), n.set(o, a));
    }),
    s.hyperedges.forEach((i, r) => {
      let o = i.nodes[0];
      o !== void 0 && n.get(e(o))?.encounters.push(r);
    }),
    [...n.values()].map((i) => ({ nodes: i.nodes.sort(), encounters: i.encounters.sort() }))
  );
}
function Yr(s, t, e) {
  let n = s.getHyperedge(t);
  if (!n) return null;
  let i = n.nodes;
  if (i.length > Ze)
    return {
      key: t,
      independence: null,
      fullSetScore: 0,
      maxSubsetScore: 0,
      meanSubsetScore: 0,
      strongestSubset: null,
      evaluatedSubsets: 0,
      unbounded: !0,
    };
  let r = ke(e(i)),
    o = 0,
    a = 0,
    l = 0,
    c = null;
  for (let u = 2; u < i.length; u++)
    for (let d of pe(i, u)) {
      let p = ke(e(d));
      ((a += p), l++, p > o && ((o = p), (c = d)));
    }
  return {
    key: t,
    independence: l > 0 ? ke(1 - o) : null,
    fullSetScore: r,
    maxSubsetScore: o,
    meanSubsetScore: l > 0 ? a / l : 0,
    strongestSubset: c,
    evaluatedSubsets: l,
    unbounded: !1,
  };
}
function Xr(s, t, e = Date.now()) {
  return s.length === 0 || t <= 0
    ? 0
    : s.reduce((n, i) => {
        let r = Math.max(0, (e - i) / qr);
        return n + Math.pow(0.5, r / t);
      }, 0);
}
function Zr(s, t) {
  let e = s.getHyperedgesForNode(t),
    n = e.length;
  if (n < 2) return { nodeId: t, incidentEncounters: n, meanJaccard: n === 1 ? 1 : 0, pressure: 0 };
  let i = 0,
    r = 0;
  for (let a = 0; a < n; a++)
    for (let l = a + 1; l < n; l++) {
      let c = new Set(e[a].nodes),
        u = new Set(e[l].nodes),
        d = 0;
      u.forEach((h) => {
        c.has(h) && d++;
      });
      let p = c.size + u.size - d;
      ((i += p > 0 ? d / p : 0), r++);
    }
  let o = r > 0 ? i / r : 0;
  return { nodeId: t, incidentEncounters: n, meanJaccard: o, pressure: ke((1 - o) * (1 - 1 / n)) };
}
function Bi(s, t, e = {}) {
  let n = s.getHyperedge(t);
  if (!n) return null;
  let i = e.occurrences ?? n.occurrences ?? [],
    o = n.nodes.map((a) => Zr(s, a)).reduce((a, l) => (a === null || l.pressure > a.pressure ? l : a), null);
  return {
    key: t,
    nodes: n.nodes,
    closure: Je(s, t),
    independence: e.score ? Yr(s, t, e.score) : null,
    peakOverlap: o,
    occurrences: i,
    vitality: Xr(i, e.halfLifeDays ?? 90, e.now),
    persistence: n.persistence === "recurring" ? "recurring" : "momentary",
  };
}
function _i(s, t, e, n, i, r) {
  if (!i) return;
  let o = new Set();
  t.forEach((a) => {
    let l = a.nodes.map((h) => n.get(h)).filter(Boolean),
      c = !r.isActive || r.involvesSimplex(a),
      [u, d, p] = L(e, a);
    for (let h = 0; h < l.length; h++)
      for (let m = h + 1; m < l.length; m++) {
        let g = [l[h].id, l[m].id].sort().join("|");
        o.has(g) ||
          (o.add(g),
          (s.strokeStyle = `rgba(${u},${d},${p},${c ? 0.22 : 0.06})`),
          (s.lineWidth = c ? 1 : 0.5),
          s.beginPath(),
          s.moveTo(l[h].px, l[h].py),
          s.lineTo(l[m].px, l[m].py),
          s.stroke());
      }
  });
}
function Wi(s, t, e, n, i, r = null) {
  let a = s.measureText(t).width + 20,
    l = 26;
  return (
    (s.fillStyle = i ? "rgba(20, 24, 32, 0.85)" : "rgba(255, 255, 255, 0.85)"),
    s.beginPath(),
    s.roundRect(e, n, a, l, 8),
    s.fill(),
    (s.strokeStyle = r ?? (i ? "rgba(255, 255, 255, 0.15)" : "rgba(0, 0, 0, 0.1)")),
    (s.lineWidth = 1),
    s.stroke(),
    (s.fillStyle = i ? "rgba(235, 240, 248, 0.9)" : "rgba(24, 28, 34, 0.85)"),
    (s.textAlign = "left"),
    (s.textBaseline = "middle"),
    s.fillText(t, e + 10, n + l / 2),
    l
  );
}
function zi(s, t, e) {
  let n = t.getAnalysisSummary();
  if (!n.betti) return;
  let { b0: i, b1: r, b2: o } = n.betti,
    a = `\u03B2\u2080 ${i}   \u03B2\u2081 ${r}${o !== void 0 ? `   \u03B2\u2082 ${o}` : ""}`;
  (s.save(), (s.font = "500 14px ui-monospace, SFMono-Regular, Menlo, monospace"));
  let l = Wi(s, a, 14, 14, e);
  s.restore();
}
function ji(s, t, e, n = 14) {
  let i = t.hyperedges.size;
  if (i === 0) return;
  let r = Ki(t),
    o = r.value === null ? "\u2013" : r.value.toFixed(2),
    a = t.getAnalysisSummary().recurringEncounterCount,
    l = `\u25C7 ${i}${a > 0 ? ` \xB7 ${a} recurring` : ""}   simpliciality ${o}`;
  (s.save(),
    (s.font = "500 14px ui-monospace, SFMono-Regular, Menlo, monospace"),
    Wi(s, l, 14, n, e, "rgba(127, 119, 221, 0.35)"),
    s.restore());
}
function Vi(s, t, e, n, i) {
  let r = G(t, 2);
  if (!r.length) return;
  let o = t.getAllNodes(),
    a = new Map(o.map((l) => [l.id, l]));
  (s.save(), s.setLineDash([8, 4]), (s.lineWidth = 1.5));
  for (let l of r) Jr(s, l, a, e, n, i);
  s.restore();
}
function Jr(s, t, e, n, i, r) {
  let o = t.boundaryNodes.map((x) => e.get(x)).filter(Boolean);
  if (o.length < 3) return;
  let a = 200,
    l = o.filter((x) => Math.hypot(x.px, x.py) > a);
  if (l.length < o.length) return;
  let c = l.reduce((x, R) => ({ x: x.x + R.px, y: x.y + R.py }), { x: 0, y: 0 });
  if (((c.x /= l.length), (c.y /= l.length), Math.max(...l.map((x) => Math.hypot(x.px - c.x, x.py - c.y))) < 150))
    return;
  let p = 300,
    h = Math.min(...l.map((x) => x.px)),
    m = Math.max(...l.map((x) => x.px)),
    g = Math.min(...l.map((x) => x.py)),
    f = Math.max(...l.map((x) => x.py));
  if (m < i.minX - p || h > i.maxX + p || f < i.minY - p || g > i.maxY + p) return;
  let v = [...t.boundaryNodes].sort().join("|"),
    y = r === v;
  ((s.strokeStyle = y ? "rgba(255, 165, 0, 0.9)" : n ? "rgba(255, 165, 0, 0.5)" : "rgba(255, 140, 0, 0.6)"),
    s.beginPath(),
    s.moveTo(l[0].px, l[0].py));
  for (let x = 1; x < l.length; x++) s.lineTo(l[x].px, l[x].py);
  (s.closePath(), s.stroke(), (s.fillStyle = y ? "rgba(255, 165, 0, 0.15)" : "rgba(255, 165, 0, 0.05)"), s.fill());
  let b = Math.sqrt(l.reduce((x, R) => x + (R.px - c.x) ** 2 + (R.py - c.y) ** 2, 0) / l.length);
  if (y || b < 200) {
    ((s.fillStyle = y ? "rgba(255, 165, 0, 0.9)" : "rgba(255, 165, 0, 0.6)"),
      s.beginPath(),
      s.arc(c.x, c.y, y ? 8 : 5, 0, Math.PI * 2),
      s.fill(),
      (s.font = "500 12px system-ui, sans-serif"),
      (s.fillStyle = n ? "rgba(255, 255, 255, 0.8)" : "rgba(0, 0, 0, 0.7)"),
      (s.textAlign = "center"),
      (s.textBaseline = "middle"));
    let x = t.dimension === 1 ? "Missing \u0394" : "Missing \u25A1";
    (s.fillText(x, c.x, c.y - 14),
      (s.font = "400 10px system-ui, sans-serif"),
      (s.fillStyle = n ? "rgba(255, 255, 255, 0.5)" : "rgba(0, 0, 0, 0.5)"),
      s.fillText(`${l.length} nodes`, c.x, c.y + 14));
  }
}
function Gi(s, t, e, n) {
  t.length !== 0 &&
    (s.save(),
    (s.lineCap = "round"),
    (s.lineJoin = "round"),
    t.forEach((i, r) => {
      let o = i.nodes.map((a) => e.get(a)).filter((a) => a !== void 0);
      if (!(o.length < 2)) {
        (s.beginPath(), s.moveTo(o[0].px, o[0].py));
        for (let a = 1; a < o.length; a++) {
          let l = o[a - 1],
            c = o[a],
            u = c.px - l.px,
            d = c.py - l.py,
            p = Math.max(1, Math.hypot(u, d)),
            h = -d / p,
            m = u / p,
            g = Math.max(2, Math.min(8, Math.ceil(p / 45)));
          for (let f = 1; f <= g; f++) {
            let v = f / g,
              y = f === g ? 0 : (f % 2 === 0 ? -1 : 1) * (5 + r * 1.5);
            s.lineTo(l.px + u * v + h * y, l.py + d * v + m * y);
          }
        }
        ((s.strokeStyle = n ? "rgba(255, 92, 118, 0.88)" : "rgba(184, 24, 62, 0.82)"),
          (s.lineWidth = Math.min(4, 1.8 + i.magnitude * 0.18)),
          s.setLineDash([]),
          s.stroke());
      }
    }),
    s.restore());
}
function qi(s) {
  return s.split("/").pop()?.replace(/\.md$/, "") ?? s;
}
function Qr(s) {
  let t = s.closure;
  if (!t) return null;
  if (t.unbounded) return "Too large to enumerate what it implies. The closure deficit here is unmeasured, not zero.";
  if (t.missingCount === 0)
    return "Every relation this encounter implies already exists in the complex. Promoting it would assert nothing new.";
  let e = s.nodes.length,
    n = t.deficit ?? 0;
  return n >= 0.8
    ? `This cluster looks visually coherent, but its meaning exists only at order ${e} \u2014 ${t.missingCount} of the ${t.impliedFaceCount} relations it implies are absent.`
    : n >= 0.4
      ? `${t.missingCount} of the ${t.impliedFaceCount} implied relations are absent. Part of this group is already understood; part of it is not.`
      : `Most of what this encounter implies already exists \u2014 ${t.missingCount} implied relation${t.missingCount === 1 ? " is" : "s are"} still absent.`;
}
function eo(s) {
  let t = s.independence;
  if (!t) return null;
  if (t.unbounded) return "Too large to test its subgroups against the vault.";
  if (t.independence === null)
    return "A two-note encounter has no proper subgroup, so there is nothing for it to be irreducible to.";
  let e = t.strongestSubset?.map(qi).join(" \xB7 ");
  return t.independence >= 0.75
    ? t.fullSetScore >= 0.3
      ? "The group is evidenced by the vault; no subgroup inside it is. That is what irreducible looks like."
      : "Neither the group nor any subgroup inside it is evidenced by the vault. This encounter rests on your assertion alone \u2014 which is a reason to keep it, not to promote it."
    : t.independence >= 0.4
      ? `Some of this group stands on its own${e ? ` \u2014 ${e} most of all` : ""}, but not all of it.`
      : `${e ?? "A subgroup"} is already well evidenced without the rest. This may be a simplex you have not asserted yet.`;
}
function to(s, t) {
  let e = Math.max(1, s.occurrences.length),
    n = `${e}\xD7`;
  return s.persistence !== "recurring"
    ? `Encountered ${n}. Recurring at ${t} \u2014 repetition is evidence, never proof.`
    : s.vitality >= e * 0.7
      ? `Recurring and still warm: ${n}, most of it recent.`
      : s.vitality < 1
        ? `Recurring, but cooled: ${n}, none of it lately.`
        : `Recurring: ${n}, some of it a while ago.`;
}
function no(s) {
  let t = s.peakOverlap;
  return !t || t.pressure < 0.4
    ? null
    : `${qi(t.nodeId)} sits in ${t.incidentEncounters} encounters that barely overlap each other. It may be carrying contexts that do not belong together.`;
}
function Ui(s, t) {
  return {
    headline:
      "These notes came together as one irreducible whole. No pair among them is asserted to be meaningful on its own.",
    closure: Qr(s),
    independence: eo(s),
    persistence: to(s, t),
    overlap: no(s),
  };
}
function Yi(s, t, e, n) {
  let i = s.nodes,
    r = i.map((a) => t.find((l) => l.id === a)).filter(Boolean),
    o = n.find((a) => a.missingSimplex.length === i.length && a.missingSimplex.every((l) => i.includes(l)));
  return s.inferred ? io(s, r, e, o) : s.autoGenerated ? so(s) : ro(s, r);
}
function io(s, t, e, n) {
  let i = s.nodes.length - 1,
    r = t.map((l) => l.id.replace(/\.md$/, "")),
    o = s.inferredSignals ?? [];
  if (n)
    return {
      headline: `This ${i === 1 ? "edge" : i === 2 ? "triangle" : "tetrahedron"} fills a local missing face.`,
      tension: `Notes ${r.join(" \xB7 ")} bounded an absent simplex. This structure now completes that local motif.`,
      prompt: "Does this new connection reveal a synthesis you hadn't consciously noticed?",
      signals: [n.dimension === 1 ? "Fills a triangular missing face" : "Fills a tetrahedral missing face", ...o],
    };
  if (i === 2 && t.length === 3) {
    let l = oo(t, e);
    if (l) {
      let c = r.filter((u) => u !== l.replace(/\.md$/, ""));
      return {
        headline: "Three notes form a structural bridge through a common connection.",
        tension: `${c[0]} and ${c[1]} both connect to ${l.replace(/\.md$/, "")}, but have no direct link between them.`,
        prompt: `What would a note directly relating "${c[0]}" and "${c[1]}" say?`,
        signals: ["Bridge pattern detected", ...o],
      };
    }
  }
  let a = new Set(t.map((l) => l.domain));
  return a.size > 1
    ? {
        headline: `Cross-domain ${i === 1 ? "relation" : i === 2 ? "triangle" : "synthesis"} spanning ${a.size} conceptual areas.`,
        tension: `Connects: ${[...a].join(" \xB7 ")}. These domains rarely intersect in your vault.`,
        prompt: "What insight emerges from seeing these domains together?",
        signals: [`Cross-domain: ${[...a].join(" + ")}`, ...o],
      }
    : {
        headline: `${i === 1 ? "An inferred relation" : i === 2 ? "An inferred triangle" : "An inferred higher-order structure"} among ${t.length} notes.`,
        tension: `Based on ${o.length > 0 ? o.join(" \xB7 ") : "vault structure analysis"}.`,
        prompt: "Is this a meaningful connection worth confirming?",
        signals: o.length > 0 ? o : ["Pattern-based inference"],
      };
}
function so(s) {
  let t = s.nodes.length - 1;
  return {
    headline: `Auto-generated face of a ${t + 1}-simplex.`,
    tension: `This ${t === 1 ? "edge" : t === 2 ? "triangle" : "tetrahedron"} is the boundary of a higher-dimensional simplex you defined.`,
    prompt: "Faces help visualize the structure but cannot be edited independently.",
    signals: [`Face of ${s.parentKey || "parent simplex"}`],
  };
}
function ro(s, t) {
  let e = s.nodes.length - 1,
    n = t.map((i) => i.id.replace(/\.md$/, ""));
  return {
    headline: `Confirmed ${e === 1 ? "relation" : e === 2 ? "triangle" : e === 3 ? "tetrahedron" : "simplex"} you defined.`,
    tension: `You explicitly marked ${n.join(" \xB7 ")} as forming a meaningful structure.`,
    prompt: s.label
      ? `Labeled as "${s.label}". Does this label still capture the relationship?`
      : "Consider adding a label to capture what binds these notes together.",
    signals: s.label ? [`Label: ${s.label}`] : ["User-defined"],
  };
}
function oo(s, t) {
  if (s.length !== 3) return null;
  for (let e of s) {
    let n = t.get(e.id);
    if (!n) continue;
    let i = s.filter((o) => o.id !== e.id);
    if (i.every((o) => n.outgoingLinks.has(o.id) || t.get(o.id)?.outgoingLinks.has(e.id))) {
      let [o, a] = i,
        l = t.get(o.id),
        c = t.get(a.id),
        u = l?.outgoingLinks.has(a.id) ?? !1,
        d = c?.outgoingLinks.has(o.id) ?? !1;
      if (!u && !d) return e.id;
    }
  }
  return null;
}
function Yt(s, t) {
  let e = s.boundaryNodes.map((n) => n.replace(/\.md$/, ""));
  return s.dimension === 1
    ? {
        headline: "A triangular missing face \u2014 a local completion opportunity.",
        tension: `Notes ${e.join(" \xB7 ")} connect pairwise, but no synthesizing structure exists at the center.`,
        prompt: "What could synthesize all three notes?",
        signals: ["Three boundary edges, no triangle"],
      }
    : {
        headline: "A tetrahedral boundary missing its 3-simplex.",
        tension: "Four notes form a complete boundary of triangles, but the interior is empty.",
        prompt: "What synthesis would complete this local structure?",
        signals: ["Four triangular faces, no tetrahedron"],
      };
}
function Qe(s, t) {
  let e = !1;
  for (let n = 0, i = t.length - 1; n < t.length; i = n++) {
    let r = t[n].x,
      o = t[n].y,
      a = t[i].x,
      l = t[i].y;
    o > s.y != l > s.y && s.x < ((a - r) * (s.y - o)) / (l - o || 1e-6) + r && (e = !e);
  }
  return e;
}
function et(s, t) {
  let e = s.nodes
    .map((i) => t.find((r) => r.id === i))
    .filter(Boolean)
    .map((i) => ({ x: i.px, y: i.py }));
  if (e.length <= 2) return e;
  let n = { x: e.reduce((i, r) => i + r.x, 0) / e.length, y: e.reduce((i, r) => i + r.y, 0) / e.length };
  return [...e].sort((i, r) => Math.atan2(i.y - n.y, i.x - n.x) - Math.atan2(r.y - n.y, r.x - n.x));
}
var tt = class {
  constructor(t, e, n, i, r = {}) {
    this.model = t;
    this.engine = e;
    this.controller = n;
    this.settings = i;
    this.callbacks = r;
    this.canvas = null;
    this.ctx = null;
    this.dpr = activeWindow.devicePixelRatio || 1;
    this.W = 0;
    this.H = 0;
    this.userZoom = 1;
    this.userPanX = 0;
    this.userPanY = 0;
    this.viewZoom = 1;
    this.viewOffsetX = 0;
    this.viewOffsetY = 0;
    this.MIN_ZOOM = 0.6;
    this.MAX_ZOOM = 3.5;
    this.FIT_PADDING = 84;
    this.MIN_NODE_RADIUS = 18;
    this.resizeHandler = () => this.resize();
    this.isDark = !1;
    this.mediaQuery = activeWindow.matchMedia("(prefers-color-scheme: dark)");
    this.pointer = { x: 0, y: 0 };
    this.lassoPath = [];
    this.isLassoActive = !1;
    this.hoveredHoleKey = null;
    this.reducedMotionQuery = activeWindow.matchMedia("(prefers-reduced-motion: reduce)");
    this.pulseHeld = !1;
    this.isPanning = !1;
    this.panStartScreenX = 0;
    this.panStartScreenY = 0;
    this.panMoved = !1;
    this.suppressNextClick = !1;
    this.themeHandler = () => {
      ((this.isDark = this.detectDarkMode()), this.render());
    };
    this.textWidthCache = new Map();
    this.viewportPadding = 100;
    this.lastRenderedNodes = new Set();
    this.progressiveSceneKey = "";
    this.progressiveNodeBudget = 0;
    this.progressiveSimplexBudget = 0;
    this.progressiveNodeStep = 140;
    this.progressiveSimplexStep = 220;
    this.activation = new Map();
    this.sheafReport = null;
    this.cycleHighlight = null;
    this.replayState = null;
  }
  setReplayState(t) {
    ((this.replayState = t), (this.progressiveSceneKey = ""), this.render());
  }
  setActivation(t) {
    this.activation = t;
  }
  setSheafReport(t) {
    ((this.sheafReport = t), this.render());
  }
  setCycleHighlight(t) {
    ((this.cycleHighlight = t), this.render());
  }
  drawCycleHighlight(t, e) {
    let n = this.cycleHighlight;
    if (!n) return;
    let i = new Map(e.map((o) => [$(o.id), o])),
      r = this.isDark ? "255,214,102" : "196,120,0";
    (t.save(), (t.lineCap = "round"));
    for (let o of n.simplexKeys) {
      let a = o.split("|");
      if (a.length !== 2) continue;
      let l = i.get(a[0]),
        c = i.get(a[1]);
      !l ||
        !c ||
        (t.beginPath(),
        t.moveTo(l.px, l.py),
        t.lineTo(c.px, c.py),
        (t.strokeStyle = `rgba(${r},0.85)`),
        (t.lineWidth = 3.5),
        t.stroke());
    }
    for (let o of n.nodeIds) {
      let a = i.get($(o));
      a &&
        (t.beginPath(),
        t.arc(a.px, a.py, 9, 0, Math.PI * 2),
        (t.strokeStyle = `rgba(${r},0.95)`),
        (t.lineWidth = 2),
        t.stroke());
    }
    t.restore();
  }
  measureTextWidth(t, e) {
    if (this.textWidthCache.has(e)) return this.textWidthCache.get(e);
    let n = t.measureText(e).width;
    return (this.textWidthCache.size > 1e3 && this.textWidthCache.clear(), this.textWidthCache.set(e, n), n);
  }
  getVisibleNodes(t) {
    let e = -this.viewOffsetX / this.viewZoom - this.viewportPadding,
      n = -this.viewOffsetY / this.viewZoom - this.viewportPadding,
      i = (-this.viewOffsetX + this.W) / this.viewZoom + this.viewportPadding,
      r = (-this.viewOffsetY + this.H) / this.viewZoom + this.viewportPadding;
    return t.filter((o) => o.px >= e && o.px <= i && o.py >= n && o.py <= r);
  }
  simplexStrength(t, e) {
    return e === "confidence"
      ? (t.confidence ?? t.weight ?? 0)
      : e === "decayed-weight"
        ? (t.decayedWeight ?? t.weight ?? t.confidence ?? 0)
        : (t.weight ?? t.decayedWeight ?? t.confidence ?? 0);
  }
  passesRenderFilter(t) {
    return this.simplexStrength(t, this.settings.renderFilterMetric) >= this.settings.renderFilterThreshold;
  }
  nodeVisualPriority(t) {
    let e = this.model.getSimplicesForNode(t.id),
      n = e.some((o) => o.nodes.length >= 3),
      i = e.some((o) => o.nodes.length === 2);
    return { bucket: n ? 3 : i ? 2 : e.length > 0 ? 1 : 0, simplexCount: e.length };
  }
  progressiveNodeKey(t) {
    let e = this.controller.hoveredNodeId ?? "",
      n = this.controller.lockedNodeId ?? "";
    return [
      this.viewZoom.toFixed(3),
      this.viewOffsetX.toFixed(1),
      this.viewOffsetY.toFixed(1),
      e,
      n,
      t.length,
      this.settings.renderFilterMetric,
      (this.settings.renderFilterThreshold ?? 0).toFixed(2),
    ].join("|");
  }
  rankVisibleNodes(t, e) {
    let n = (this.W / 2 - this.viewOffsetX) / this.viewZoom,
      i = (this.H / 2 - this.viewOffsetY) / this.viewZoom,
      r = this.controller.hoveredNodeId,
      o = this.controller.lockedNodeId;
    return [...t].sort((a, l) => {
      let c = this.nodeVisualPriority(a),
        u = this.nodeVisualPriority(l),
        d = c.bucket * 10 + Math.min(4, c.simplexCount),
        p = u.bucket * 10 + Math.min(4, u.simplexCount),
        h = (a.id === r ? 6 : 0) + (a.id === o ? 5 : 0) + (e.has(a.id) ? 4 : 0) + (a.isPinned ? 2 : 0) + d,
        m = (l.id === r ? 6 : 0) + (l.id === o ? 5 : 0) + (e.has(l.id) ? 4 : 0) + (l.isPinned ? 2 : 0) + p;
      if (h !== m) return m - h;
      let g = (a.px - n) ** 2 + (a.py - i) ** 2,
        f = (l.px - n) ** 2 + (l.py - i) ** 2;
      return g - f;
    });
  }
  getProgressiveRenderableNodes(t, e) {
    let n = this.rankVisibleNodes(t, e),
      i = this.progressiveNodeKey(n);
    return (
      i !== this.progressiveSceneKey
        ? ((this.progressiveSceneKey = i),
          (this.progressiveNodeBudget = Math.min(n.length, this.progressiveNodeStep)),
          (this.progressiveSimplexBudget = this.progressiveSimplexStep))
        : ((this.progressiveNodeBudget = Math.min(n.length, this.progressiveNodeBudget + this.progressiveNodeStep)),
          (this.progressiveSimplexBudget += this.progressiveSimplexStep)),
      n.slice(0, this.progressiveNodeBudget)
    );
  }
  getRenderableSimplices(t, e, n) {
    return t
      .filter(([, r]) => !this.replayState || this.replayState.simplices.has(M("simplex", r.nodes)))
      .filter(([, r]) => this.passesRenderFilter(r))
      .filter(([, r]) => r.nodes.every((o) => e.has(o)))
      .sort((r, o) => {
        let [a, l] = r,
          [c, u] = o,
          d = l.nodes.length >= 3 ? 20 : l.nodes.length === 2 ? 10 : 0,
          p = u.nodes.length >= 3 ? 20 : u.nodes.length === 2 ? 10 : 0,
          h =
            (n.has(a) ? 6 : 0) +
            (l.suggested ? 2 : 0) +
            this.simplexStrength(l, this.settings.renderFilterMetric) +
            l.nodes.length * 0.05 +
            d;
        return (
          (n.has(c) ? 6 : 0) +
          (u.suggested ? 2 : 0) +
          this.simplexStrength(u, this.settings.renderFilterMetric) +
          u.nodes.length * 0.05 +
          p -
          h
        );
      })
      .slice(0, this.progressiveSimplexBudget);
  }
  getRenderableHyperedges(t) {
    return this.settings.showHyperedges
      ? [...this.model.hyperedges.entries()].filter(
          ([, e]) =>
            (!this.replayState || this.replayState.hyperedges.has(M("hyperedge", e.nodes))) &&
            e.nodes.some((n) => t.has(n)),
        )
      : [];
  }
  canPlaceLabelFast(t, e, n, i) {
    if (!this.ctx) return !1;
    let r = this.measureTextWidth(this.ctx, e) + 12,
      o = n - r / 2,
      a = i - 14,
      l = { left: o, top: a, right: o + r, bottom: a + 18 };
    return !t.some((c) => l.left < c.right && l.right > c.left && l.top < c.bottom && l.bottom > c.top);
  }
  init(t) {
    (this.canvas && !this.canvas.isConnected && this.destroy(),
      !this.canvas &&
        ((this.canvas = t.createEl("canvas", { cls: "simplicial-canvas" })),
        (this.ctx = this.canvas.getContext("2d")),
        (this.isDark = this.detectDarkMode()),
        this.resize(),
        activeWindow.addEventListener("resize", this.resizeHandler),
        this.mediaQuery.addEventListener("change", this.themeHandler),
        this.engine.start(
          () => this.render(),
          () => ({
            nodes: this.model.getAllNodes(),
            simplices: [...this.model.simplices.values()],
            hyperedges: [...this.model.hyperedges.values()],
            bounds: { width: this.W, height: this.H },
            holdNode: this.controller.holdNode,
          }),
        ),
        this.bindCanvasEvents()));
  }
  bindCanvasEvents() {
    this.canvas &&
      (this.canvas.addEventListener(
        "wheel",
        (t) => {
          t.preventDefault();
          let e = this.canvas.getBoundingClientRect(),
            n = { x: ((t.clientX - e.left) * this.W) / e.width, y: ((t.clientY - e.top) * this.H) / e.height };
          (this.zoomAt(n, t.deltaY), this.render());
        },
        { passive: !1 },
      ),
      this.canvas.addEventListener("mousemove", (t) => {
        let e = this.canvas.getBoundingClientRect(),
          n = { x: ((t.clientX - e.left) * this.W) / e.width, y: ((t.clientY - e.top) * this.H) / e.height };
        if (this.isPanning) {
          let r = n.x - this.panStartScreenX,
            o = n.y - this.panStartScreenY;
          (r * r + o * o > 1 && (this.panMoved = !0),
            (this.userPanX += r),
            (this.userPanY += o),
            (this.panStartScreenX = n.x),
            (this.panStartScreenY = n.y),
            this.render());
          return;
        }
        let i = this.eventToCanvasPoint(t);
        if (((this.pointer = i), this.settings.enableBettiComputation)) {
          let r = this.findHoleAtPoint(i),
            o = this.hoveredHoleKey;
          if (r) {
            if (((this.hoveredHoleKey = [...r.boundaryNodes].sort().join("|")), this.hoveredHoleKey !== o)) {
              let a = Yt(r, new Map());
              this.callbacks.onHoleHover?.(r, a);
            }
          } else ((this.hoveredHoleKey = null), o !== null && this.callbacks.onHoleHover?.(null, null));
        }
        (this.isLassoActive
          ? this.lassoPath.push(i)
          : this.controller.onPointerMove(i.x, i.y)
            ? (this.suppressNextClick = !0)
            : this.controller.updateHover(i.x, i.y, this.model.getAllNodes(), this.settings.metadataHoverDelayMs),
          this.render());
      }),
      this.canvas.addEventListener("mouseleave", () => {
        (this.controller.cancelHoverSelection(),
          (this.controller.hoveredNodeId = null),
          this.controller.onMouseup(),
          (this.isPanning = !1),
          (this.panMoved = !1),
          this.cancelLasso(),
          this.render());
      }),
      this.canvas.addEventListener("mousedown", (t) => {
        if (t.shiftKey) {
          let r = this.eventToCanvasPoint(t);
          ((this.isLassoActive = !0), (this.lassoPath = [r]), this.controller.cancelHoverSelection(), this.render());
          return;
        }
        let e = this.eventToCanvasPoint(t),
          n = this.findNodeNearPoint(e);
        if (n) {
          ((this.controller.hoveredNodeId = n.id), this.controller.onMousedown(n.id, e.x, e.y));
          return;
        }
        let i = this.canvas.getBoundingClientRect();
        ((this.isPanning = !0),
          (this.panMoved = !1),
          (this.panStartScreenX = ((t.clientX - i.left) * this.W) / i.width),
          (this.panStartScreenY = ((t.clientY - i.top) * this.H) / i.height));
      }),
      this.canvas.addEventListener("mouseup", () => {
        (this.controller.onMouseup() && (this.suppressNextClick = !0),
          this.isPanning && this.panMoved && (this.suppressNextClick = !0),
          (this.isPanning = !1),
          (this.panMoved = !1),
          this.isLassoActive && this.finishLasso());
      }),
      this.canvas.addEventListener("dblclick", () => {
        (this.controller.hoveredNodeId && this.callbacks.onNodeOpen?.(this.controller.hoveredNodeId), this.render());
      }),
      this.canvas.addEventListener("click", (t) => {
        if (this.isLassoActive || this.suppressNextClick) {
          this.suppressNextClick = !1;
          return;
        }
        let e = this.eventToCanvasPoint(t),
          n = this.settings.enableBettiComputation ? this.findHoleAtPoint(e) : null;
        if (n) {
          let r = Yt(n, new Map());
          this.callbacks.onHoleClick?.(n, r);
          return;
        }
        let i = this.findSimplexAtPoint(e);
        if (i) this.controller.selectSimplex(w(i.nodes));
        else {
          let r = this.findHyperedgeAtPoint(e);
          this.controller.selectRelation(r ? { kind: "hyperedge", key: r } : null);
        }
        this.render();
      }),
      this.canvas.addEventListener("contextmenu", (t) => {
        t.preventDefault();
        let e = this.eventToCanvasPoint(t),
          n = this.findNodeNearPoint(e),
          i = this.findSimplexAtPoint(e),
          r = this.findHyperedgeAtPoint(e);
        (!n && !i && !r) ||
          this.callbacks.onContextMenu?.(
            {
              ...(n ? { nodeId: n.id } : {}),
              ...(i ? { simplexKey: w(i.nodes) } : {}),
              ...(r ? { hyperedgeKey: r } : {}),
            },
            t,
          );
      }));
  }
  eventToCanvasPoint(t) {
    let e = this.canvas.getBoundingClientRect(),
      n = { x: ((t.clientX - e.left) * this.W) / e.width, y: ((t.clientY - e.top) * this.H) / e.height };
    return this.screenToWorld(n);
  }
  screenToWorld(t) {
    return { x: (t.x - this.viewOffsetX) / this.viewZoom, y: (t.y - this.viewOffsetY) / this.viewZoom };
  }
  worldToScreen(t) {
    return { x: t.x * this.viewZoom + this.viewOffsetX, y: t.y * this.viewZoom + this.viewOffsetY };
  }
  worldRadius(t) {
    return t / this.viewZoom;
  }
  findNodeNearPoint(t) {
    let e = this.worldRadius(20);
    return this.model.getAllNodes().find((n) => (n.px - t.x) ** 2 + (n.py - t.y) ** 2 <= e * e) ?? null;
  }
  findSimplexAtPoint(t) {
    let e = [...this.model.simplices.values()]
      .filter((i) => i.nodes.length >= 2)
      .sort((i, r) => r.nodes.length - i.nodes.length);
    for (let i of e) {
      let r = et(i, this.model.getAllNodes());
      if (r.length === 2) {
        let [o, a] = r,
          l = a.x - o.x,
          c = a.y - o.y,
          u = Math.abs(c * t.x - l * t.y + a.x * o.y - a.y * o.x) / (Math.hypot(l, c) || 1),
          d = this.worldRadius(8);
        if (
          t.x >= Math.min(o.x, a.x) - d &&
          t.x <= Math.max(o.x, a.x) + d &&
          t.y >= Math.min(o.y, a.y) - d &&
          t.y <= Math.max(o.y, a.y) + d &&
          u <= this.worldRadius(10)
        )
          return i;
        continue;
      }
      if (r.length >= 3 && Qe(t, r)) return i;
    }
    let n = this.findNodeNearPoint(t);
    return n ? (this.model.getSimplicesForNode(n.id).sort((i, r) => r.nodes.length - i.nodes.length)[0] ?? null) : null;
  }
  findHyperedgeAtPoint(t) {
    if (!this.settings.showHyperedges) return null;
    let e = this.model.getAllNodes(),
      n = [...this.model.hyperedges.entries()].sort((i, r) => i[1].nodes.length - r[1].nodes.length);
    for (let [i, r] of n) {
      let o = et(r, e);
      if (!(o.length < 2)) {
        if (o.length === 2) {
          let [a, l] = o,
            c = l.x - a.x,
            u = l.y - a.y,
            d = Math.abs(u * t.x - c * t.y + l.x * a.y - l.y * a.x) / (Math.hypot(c, u) || 1),
            p = this.worldRadius(8);
          if (
            t.x >= Math.min(a.x, l.x) - p &&
            t.x <= Math.max(a.x, l.x) + p &&
            t.y >= Math.min(a.y, l.y) - p &&
            t.y <= Math.max(a.y, l.y) + p &&
            d <= this.worldRadius(10)
          )
            return i;
          continue;
        }
        if (Qe(t, o)) return i;
      }
    }
    return null;
  }
  findHoleAtPoint(t) {
    if (!this.settings.enableBettiComputation) return null;
    let e = G(this.model, 2);
    if (!e.length) return null;
    let n = this.model.getAllNodes(),
      i = new Map(n.map((o) => [o.id, o])),
      r = this.worldRadius(15);
    for (let o of e) {
      let a = o.boundaryNodes.map((h) => i.get(h)).filter(Boolean);
      if (a.length < 3) continue;
      let l = a.filter((h) => Math.hypot(h.px, h.py) > 80);
      if (l.length < a.length) continue;
      let c = l.reduce((h, m) => ({ x: h.x + m.px, y: h.y + m.py }), { x: 0, y: 0 });
      if (((c.x /= l.length), (c.y /= l.length), Math.max(...l.map((h) => Math.hypot(h.px - c.x, h.py - c.y))) < 40))
        continue;
      if (Math.hypot(t.x - c.x, t.y - c.y) < r * 2) return o;
      let p = l.map((h) => ({ x: h.px, y: h.py }));
      if (Qe(t, p)) return o;
    }
    return null;
  }
  finishLasso() {
    let t = this.lassoPath.length >= 3 ? this.lassoPath : [],
      e =
        t.length >= 3
          ? this.model
              .getAllNodes()
              .filter((n) => Qe({ x: n.px, y: n.py }, t))
              .map((n) => n.id)
          : [];
    (this.cancelLasso(),
      (this.suppressNextClick = !0),
      e.length >= 2 && this.callbacks.onLassoCreate?.(e),
      this.render());
  }
  cancelLasso() {
    ((this.isLassoActive = !1), (this.lassoPath = []));
  }
  detectDarkMode() {
    return this.settings.darkMode === "force-dark"
      ? !0
      : this.settings.darkMode === "force-light"
        ? !1
        : activeWindow.matchMedia("(prefers-color-scheme: dark)").matches;
  }
  resize() {
    if (!this.canvas || !this.ctx) return;
    let t = this.canvas.parentElement?.getBoundingClientRect();
    t &&
      ((this.W = t.width),
      (this.H = t.height),
      (this.canvas.width = this.W * this.dpr),
      (this.canvas.height = this.H * this.dpr),
      (this.canvas.style.width = `${this.W}px`),
      (this.canvas.style.height = `${this.H}px`),
      this.ctx.setTransform(this.dpr, 0, 0, this.dpr, 0, 0));
  }
  zoomAt(t, e) {
    let n = Math.exp(-e * 0.0015),
      i = Math.max(this.MIN_ZOOM, Math.min(this.MAX_ZOOM, this.userZoom * n));
    Math.abs(i - this.userZoom) < 1e-4 || (this.userZoom = i);
  }
  updateViewTransform(t) {
    if (!t.length || this.W <= 0 || this.H <= 0) {
      ((this.viewZoom = this.userZoom), (this.viewOffsetX = this.W / 2), (this.viewOffsetY = this.H / 2));
      return;
    }
    let e = t.filter((f) => this.nodeVisualPriority(f).bucket >= 2),
      n = e.length > 0 ? e : t,
      i = this.MIN_NODE_RADIUS,
      r = Math.min(...n.map((f) => f.px)) - i,
      o = Math.max(...n.map((f) => f.px)) + i,
      a = Math.min(...n.map((f) => f.py)) - i,
      l = Math.max(...n.map((f) => f.py)) + i,
      c = Math.max(1, o - r),
      u = Math.max(1, l - a),
      d = Math.max(1, this.W - this.FIT_PADDING * 2),
      p = Math.max(1, this.H - this.FIT_PADDING * 2),
      h = Math.min(d / c, p / u),
      m = (r + o) / 2,
      g = (a + l) / 2;
    ((this.viewZoom = h * this.userZoom),
      (this.viewOffsetX = this.W / 2 - m * this.viewZoom + this.userPanX),
      (this.viewOffsetY = this.H / 2 - g * this.viewZoom + this.userPanY));
  }
  hyperedgeColor(t) {
    return L(null, { nodes: t.nodes, label: t.label, colorKey: t.colorKey, sourcePath: t.sourcePath });
  }
  encounterPulse(t) {
    return !this.settings.enableHyperedgePulse || this.reducedMotionQuery.matches || !t.hoveredHyperedgeKey
      ? 0
      : Li(Date.now());
  }
  encounterDeficit(t) {
    return Je(this.model, t)?.deficit ?? null;
  }
  alphaForDimension(t, e) {
    return t === 1 ? (e ? 0.18 : 0.1) : t === 2 ? (e ? 0.18 : 0.13) : t === 3 ? (e ? 0.11 : 0.07) : 0.05;
  }
  formatNodeLabel(t) {
    return t.split("/").pop()?.replace(/\.md$/, "") ?? t;
  }
  simplexPathText(t, e) {
    return [t, ...e.nodes.filter((i) => i !== t)].map((i) => this.formatNodeLabel(i)).join(" -> ");
  }
  simplexDescriptor(t) {
    let e = t.label?.trim();
    if (e && e.toLowerCase() !== "soft cluster") return e;
    let n = (t.inferredSignals ?? []).filter((i) => i !== "soft-cluster");
    if (n.length > 0) {
      let i = [],
        r = n
          .filter((h) => h.startsWith("tags:"))
          .map((h) => Number(h.slice(5)))
          .filter((h) => Number.isFinite(h) && h > 0),
        o = r.length ? Math.max(...r) : 0,
        a = n.includes("folder:same"),
        l = n.includes("folder:top"),
        c = n.includes("link:a->b"),
        u = n.includes("link:b->a"),
        d = n.filter((h) => h.startsWith("title:")).map((h) => h.slice(6)),
        p = n.filter((h) => h.startsWith("content:")).map((h) => h.slice(8));
      return (
        c && u ? i.push("mutual link") : (c || u) && i.push("direct link"),
        o > 0 && i.push(o === 1 ? "1 shared tag" : `${o} shared tags`),
        a ? i.push("same folder") : l && i.push("same top folder"),
        d.length && i.push("similar titles"),
        p.length && i.push("similar content"),
        i.join(" \xB7 ")
      );
    }
    return t.dominantSignal === "tags"
      ? "tag relation"
      : t.dominantSignal === "folder"
        ? "folder relation"
        : t.dominantSignal === "link"
          ? "link relation"
          : t.dominantSignal === "semantic"
            ? "semantic relation"
            : t.dominantSignal === "soft-cluster"
              ? "soft cluster"
              : t.sourcePath
                ? this.formatNodeLabel(t.sourcePath)
                : `dim ${t.nodes.length - 1} simplex`;
  }
  largestNodeContext(t) {
    let e = this.model
      .getSimplicesForNode(t)
      .sort((n, i) => i.nodes.length - n.nodes.length || (i.weight ?? 1) - (n.weight ?? 1));
    return e.length > 0 ? this.simplexDescriptor(e[0]) : null;
  }
  drawWrappedText(t, e, n, i, r, o) {
    let a = e.split(/\s+/).filter(Boolean);
    if (!a.length) return i;
    let l = "",
      c = i;
    return (
      a.forEach((u) => {
        let d = l ? `${l} ${u}` : u;
        if (t.measureText(d).width <= r || !l) {
          l = d;
          return;
        }
        (t.fillText(l, n, c), (c += o), (l = u));
      }),
      l && t.fillText(l, n, c),
      c + o
    );
  }
  drawHoveredNodeOverlay(t) {
    let e = this.controller.hoveredNodeId ?? this.controller.lockedNodeId;
    if (!e) return;
    let n = this.model.nodes.get(e);
    if (!n) return;
    let i = this.formatNodeLabel(e),
      r = this.largestNodeContext(e),
      o = this.model.getSimplicesForNode(e)[0],
      [a, l, c] = o ? L(this.model, o) : [136, 135, 128],
      u = this.worldToScreen({ x: n.px, y: n.py });
    (t.save(), (t.font = "700 18px system-ui, sans-serif"));
    let d = t.measureText(i).width;
    t.font = "500 12px system-ui, sans-serif";
    let p = r ? Math.min(320, t.measureText(r).width) : 0,
      h = Math.min(Math.max(d + 28, p + 28, 180), 360),
      m = r ? 48 : 26,
      g = Math.min(Math.max(12, u.x + 14), this.W - h - 12),
      f = Math.min(Math.max(24, u.y - m - 18), this.H - m - 12);
    ((t.fillStyle = `rgb(${a},${l},${c})`),
      (t.shadowColor = this.isDark ? "rgba(10, 14, 22, 0.9)" : "rgba(255, 255, 255, 0.92)"),
      (t.shadowBlur = 10),
      (t.font = "700 18px system-ui, sans-serif"),
      t.fillText(i, g, f + 18),
      r &&
        ((t.fillStyle = this.isDark ? "rgba(235,240,248,0.88)" : "rgba(24,28,34,0.84)"),
        (t.shadowBlur = 8),
        (t.font = "500 12px system-ui, sans-serif"),
        this.drawWrappedText(t, r, g, f + 36, h, 16)),
      t.restore());
  }
  drawFormalSimplex(t, e, n) {
    let i = et(e, this.model.getAllNodes());
    if (i.length < 2) return;
    let [r, o, a] = L(this.model, e),
      l = n ? 0.8 : 0.28;
    if (
      (t.save(),
      (t.strokeStyle = `rgba(${r},${o},${a},${l})`),
      (t.lineWidth = e.nodes.length >= 3 ? 1.6 : 1.1),
      i.length === 2)
    ) {
      (t.beginPath(), t.moveTo(i[0].x, i[0].y), t.lineTo(i[1].x, i[1].y), t.stroke(), t.restore());
      return;
    }
    (t.beginPath(),
      t.moveTo(i[0].x, i[0].y),
      i.slice(1).forEach((c) => t.lineTo(c.x, c.y)),
      t.closePath(),
      t.stroke(),
      (t.fillStyle = `rgba(${r},${o},${a},${e.inferred ? 0.03 : 0.06})`),
      t.fill(),
      t.restore());
  }
  drawSuggestionOverlay(t, e, n) {
    if (!this.settings.showSuggestions || !n.suggested || !n.inferred) return;
    let i = et(n, this.model.getAllNodes());
    if (i.length < 2) return;
    let [r, o, a] = L(this.model, n);
    (t.save(),
      t.setLineDash([5, 5]),
      (t.strokeStyle = `rgba(${r},${o},${a},0.7)`),
      (t.lineWidth = 1),
      i.length === 2
        ? (t.beginPath(), t.moveTo(i[0].x, i[0].y), t.lineTo(i[1].x, i[1].y), t.stroke())
        : (t.beginPath(),
          t.moveTo(i[0].x, i[0].y),
          i.slice(1).forEach((p) => t.lineTo(p.x, p.y)),
          t.closePath(),
          t.stroke()),
      t.setLineDash([]));
    let l = i.reduce((p, h) => ({ x: p.x + h.x, y: p.y + h.y }), { x: 0, y: 0 });
    ((l.x /= i.length), (l.y /= i.length));
    let c = Math.round((n.confidence ?? n.weight ?? 0) * 100),
      u = n.nodes.length > 2 ? `Form? ${c}%` : `${c}%`;
    t.font = "11px system-ui, sans-serif";
    let d = t.measureText(u).width + 10;
    ((t.fillStyle = this.isDark ? "rgba(10,14,22,0.85)" : "rgba(255,255,255,0.88)"),
      t.beginPath(),
      t.roundRect(l.x - d / 2, l.y - 10, d, 18, 9),
      t.fill(),
      (t.fillStyle = `rgb(${r},${o},${a})`),
      (t.textAlign = "center"),
      t.fillText(u, l.x, l.y + 3),
      t.restore());
  }
  render() {
    if (!this.ctx) return;
    let t = this.ctx,
      e = this.model.getAllNodes(),
      n = [...this.model.simplices.entries()]
        .filter(([, f]) => f.nodes.length - 1 <= this.settings.maxRenderedDim)
        .sort((f, v) => v[1].nodes.length - f[1].nodes.length),
      i = this.controller.getFocusState();
    this.updateViewTransform(e);
    let r = this.getVisibleNodes(e),
      o = this.getProgressiveRenderableNodes(r, i.activeNodeIds),
      a = new Set(o.map((f) => f.id)),
      l = this.getRenderableSimplices(n, a, i.activeSimplexKeys),
      c = this.getRenderableHyperedges(a);
    (t.setTransform(this.dpr, 0, 0, this.dpr, 0, 0),
      t.clearRect(0, 0, this.W, this.H),
      t.translate(this.viewOffsetX, this.viewOffsetY),
      t.scale(this.viewZoom, this.viewZoom),
      this.lastRenderedNodes.clear(),
      o.forEach((f) => this.lastRenderedNodes.add(f.id)));
    let u = [],
      d = 0,
      p = Math.max(4, Math.ceil(o.length * this.settings.labelDensity));
    (this.settings.formalMode
      ? l.forEach(([f, v]) => {
          let y = v.nodes.length - 1;
          (y === 1 && !this.settings.showEdges) ||
            (y === 2 && !this.settings.showClusters) ||
            (y >= 3 && !this.settings.showCores) ||
            (this.drawFormalSimplex(t, v, !i.isActive || i.involvesSimplex(v, f)), this.drawSuggestionOverlay(t, f, v));
        })
      : l.forEach(([f, v]) => {
          let y = v.nodes.length - 1;
          (y === 1 && !this.settings.showEdges) ||
            (y === 2 && !this.settings.showClusters) ||
            (y >= 3 && !this.settings.showCores) ||
            (Ai(t, f, v, this.model, e, this.alphaForDimension(y, i.isActive), i), this.drawSuggestionOverlay(t, f, v));
        }),
      this.settings.formalMode ||
        _i(
          t,
          l.map(([, f]) => f),
          this.model,
          this.model.nodes,
          this.settings.showEdges,
          i,
        ));
    let h = this.encounterPulse(i);
    h > 0 !== this.pulseHeld && ((this.pulseHeld = h > 0), this.engine.setAnimationHold(this.pulseHeld));
    let m = new Set();
    (c.forEach(([f, v]) => {
      let y = !i.isActive || i.involvesRelation({ kind: "hyperedge", ...v }, f),
        b = h > 0 && f === i.hoveredHyperedgeKey;
      (b && v.nodes.forEach((x) => m.add(x)),
        Fi(
          t,
          v,
          e,
          this.hyperedgeColor(v),
          Hi({
            opacity: this.settings.hyperedgeOpacity * (v.suggested ? 0.62 : 1),
            focused: y,
            deficit: this.encounterDeficit(f),
            emergent: !v.suggested && v.persistence === "recurring" && !v.crystallizedInto,
            pulse: b ? h : 0,
          }),
        ));
    }),
      this.drawCycleHighlight(t, e),
      this.sheafReport?.obstructions.length &&
        Gi(t, this.sheafReport.obstructions, new Map(e.map((f) => [f.id, f])), this.isDark),
      o.forEach((f) => {
        this.controller.lerpAlpha(f, i);
        let v = f.id === i.hoveredNodeId,
          y = !i.isActive || i.involvesNode(f.id),
          b = this.model.getSimplicesForNode(f.id)[0] ?? null,
          [x, R, k] = b ? L(this.model, b) : [136, 135, 128];
        v &&
          (t.beginPath(), t.arc(f.px, f.py, 15, 0, Math.PI * 2), (t.fillStyle = `rgba(${x},${R},${k},0.10)`), t.fill());
        let P = this.settings.formalMode ? 4.5 : v ? 7 : 5,
          N = m.has(f.id) ? $i(P, h) : P,
          B = this.activation.get(f.id) ?? 0,
          W = Math.min(1, (y ? f.displayAlpha : 0.2) + B * 0.5);
        (t.beginPath(),
          f.isVirtual
            ? (t.arc(f.px, f.py, N, 0, Math.PI * 2),
              (t.strokeStyle = `rgba(${x},${R},${k},${W})`),
              (t.lineWidth = 1.5),
              t.stroke())
            : (t.arc(f.px, f.py, N, 0, Math.PI * 2), (t.fillStyle = `rgba(${x},${R},${k},${W})`), t.fill()),
          f.isPinned &&
            (t.beginPath(),
            t.moveTo(f.px, f.py - 18),
            t.lineTo(f.px + 5, f.py - 13),
            t.lineTo(f.px, f.py - 8),
            t.lineTo(f.px - 5, f.py - 13),
            t.closePath(),
            (t.fillStyle = `rgba(${x},${R},${k},0.8)`),
            t.fill()),
          (t.font = `${v ? "500" : "400"} 12px system-ui, sans-serif`));
        let j = this.formatNodeLabel(f.id),
          Q = d < p,
          Ee = this.canPlaceLabelFast(u, j, f.px, f.py - 13),
          Pe = this.measureTextWidth(t, j) + 12,
          V = this.nodeVisualPriority(f),
          sn = v || i.lockedNodeId === f.id || f.isPinned,
          Ss = V.bucket >= 3,
          ws = V.bucket === 2,
          Cs = V.bucket === 0;
        if (!(
          sn ||
          (Ss && Q && Ee) ||
          (ws && d < Math.max(2, Math.floor(p * 0.45)) && Ee) ||
          (!Cs && i.isActive && Q && Ee)
        ))
          return;
        sn || d++;
        let rn = 18,
          xt = f.px - Pe / 2,
          St = f.py - 27;
        (u.push({ left: xt, top: St, right: xt + Pe, bottom: St + rn }),
          (t.fillStyle = this.isDark ? "rgba(7,10,18,0.28)" : "rgba(255,255,255,0.42)"),
          t.beginPath(),
          t.roundRect(xt, St, Pe, rn, 9),
          t.fill(),
          (t.fillStyle = this.isDark ? `rgba(255,255,255,${y ? 0.88 : 0.32})` : `rgba(0,0,0,${y ? 0.72 : 0.28})`),
          (t.textAlign = "center"),
          t.fillText(j, f.px, f.py - 13));
      }),
      this.isLassoActive &&
        this.lassoPath.length > 1 &&
        (t.save(),
        (t.strokeStyle = this.isDark ? "rgba(255,255,255,0.45)" : "rgba(0,0,0,0.45)"),
        (t.fillStyle = this.isDark ? "rgba(255,255,255,0.05)" : "rgba(0,0,0,0.04)"),
        t.setLineDash([6, 6]),
        t.beginPath(),
        t.moveTo(this.lassoPath[0].x, this.lassoPath[0].y),
        this.lassoPath.slice(1).forEach((f) => t.lineTo(f.x, f.y)),
        t.stroke(),
        t.lineTo(this.pointer.x, this.pointer.y),
        t.closePath(),
        t.fill(),
        t.restore()),
      t.setTransform(this.dpr, 0, 0, this.dpr, 0, 0),
      this.drawHoveredNodeOverlay(t));
    let g = this.settings.bettiDisplayOnCanvas && this.settings.enableBettiComputation;
    (g && zi(t, this.model, this.isDark),
      this.settings.showHyperedges && ji(t, this.model, this.isDark, g ? 46 : 14),
      this.settings.enableBettiComputation &&
        Vi(t, this.model, this.isDark, this.getVisibleWorldBounds(), this.hoveredHoleKey));
  }
  getVisibleWorldBounds() {
    let t = this.screenToWorld({ x: 0, y: 0 }),
      e = this.screenToWorld({ x: this.W, y: this.H });
    return { minX: Math.min(t.x, e.x), maxX: Math.max(t.x, e.x), minY: Math.min(t.y, e.y), maxY: Math.max(t.y, e.y) };
  }
  canPlaceLabel(t, e, n, i, r) {
    return this.canPlaceLabelFast(e, n, i, r);
  }
  getBounds() {
    return { width: this.W, height: this.H };
  }
  destroy() {
    (this.engine.stop(),
      activeWindow.removeEventListener("resize", this.resizeHandler),
      this.mediaQuery.removeEventListener("change", this.themeHandler),
      (this.canvas = null),
      (this.ctx = null));
  }
};
var nt = class {
  constructor() {
    this.targets = new Set();
    this.listeners = new Set();
    this.current = null;
  }
  registerTarget(t) {
    return (
      this.targets.add(t),
      t.setCycleHighlight(this.current),
      () => {
        (this.targets.delete(t), t.setCycleHighlight(null));
      }
    );
  }
  highlight(t) {
    ((this.current = t), this.targets.forEach((e) => e.setCycleHighlight(t)));
  }
  select(t) {
    this.listeners.forEach((e) => e(t));
  }
  onSelect(t) {
    return (this.listeners.add(t), () => this.listeners.delete(t));
  }
  get highlighted() {
    return this.current;
  }
};
var Xt = "filtration-order-v1";
function Se(s) {
  let t = s.maxHomologyDimension,
    e = t + 1,
    n = new Map();
  s.vertexKeys.forEach((d, p) => {
    let h = w([d]);
    n.set(h, { key: h, vertices: [p], dimension: 0, raw: 0, score: 1 });
  });
  for (let d = 0; d < s.simplexDimensions.length; d++) {
    let p = s.simplexDimensions[d];
    if (p > e) continue;
    let h = [...s.simplexVertices.slice(s.simplexOffsets[d], s.simplexOffsets[d + 1])].sort((g, f) => g - f),
      m = s.filtrationValues[d];
    if (!Number.isFinite(m)) throw new Error(`Filtration value for ${s.stableKeys[d]} is not finite`);
    n.set(s.stableKeys[d], { key: s.stableKeys[d], vertices: h, dimension: p, raw: m, score: 1 - m });
  }
  let i = [...n.values()].sort((d, p) => d.dimension - p.dimension || d.key.localeCompare(p.key)),
    r = new Map();
  for (let d of i) {
    if (d.dimension === 0) {
      r.set(d.key, []);
      continue;
    }
    let p = d.vertices.map((h, m) => w(d.vertices.filter((g, f) => f !== m).map((g) => s.vertexKeys[g])));
    for (let h of p) if (!n.has(h)) throw new Error(`Filtration input is not downward closed: ${d.key} lacks ${h}`);
    r.set(d.key, p);
  }
  let o = new Map(),
    a = [];
  for (let d of i) {
    let p = d.raw,
      h = null;
    for (let m of r.get(d.key) ?? []) {
      let g = o.get(m) ?? 0;
      g > p && ((p = g), (h = m));
    }
    (o.set(d.key, p), h !== null && a.push({ simplexKey: d.key, faceKey: h, rawValue: d.raw, repairedValue: p }));
  }
  let l = [...n.values()]
      .sort((d, p) => o.get(d.key) - o.get(p.key) || d.dimension - p.dimension || d.key.localeCompare(p.key))
      .map((d, p) => ({
        key: d.key,
        vertices: d.vertices,
        dimension: d.dimension,
        value: o.get(d.key),
        rawValue: d.raw,
        score: d.score,
        order: p,
      })),
    c = new Map(l.map((d) => [d.key, d.order])),
    u = l.map((d) => {
      let h = (r.get(d.key) ?? []).map((m) => {
        let g = c.get(m);
        if (g === void 0) throw new Error(`Face ${m} of ${d.key} is missing from the total order`);
        if (g >= d.order) throw new Error(`Face precedence violated: ${m} does not precede ${d.key}`);
        return g;
      });
      return Uint32Array.from(h.sort((m, g) => m - g));
    });
  return { simplices: l, order: c, boundaries: u, repairs: a, maxDimension: t, tiePolicy: Xt };
}
function Xi(s, t, e) {
  if (!t.basis) return { representatives: [], rejected: 0 };
  let n = t.basis,
    i = [],
    r = 0;
  for (let o of e) {
    if (o.dimension !== 1 && o.dimension !== 2) continue;
    let a = s.order.get(o.birthSimplex);
    if (a === void 0) continue;
    let l = n[a];
    if (!(!l || l.length === 0)) {
      if (!ao(s, l)) {
        r++;
        continue;
      }
      if (o.deathSimplex !== void 0) {
        let c = s.order.get(o.deathSimplex),
          u = c === void 0 ? void 0 : t.reduced[c];
        if (!u || u.length === 0 || u[u.length - 1] !== a) {
          r++;
          continue;
        }
      }
      i.push({
        intervalId: o.id,
        dimension: o.dimension,
        simplices: [...l].map((c) => s.simplices[c].key).sort(),
        boundaryIsZero: !0,
        canonical: !1,
      });
    }
  }
  return { representatives: i, rejected: r };
}
function ao(s, t) {
  let e = new Uint32Array(0);
  for (let n of t) e = he(e, s.boundaries[n]);
  return e.length === 0;
}
var _ = class extends Error {
    constructor(e) {
      super(`Persistence reduction cancelled after ${e} columns`);
      this.completedColumns = e;
      this.name = "PersistenceCancelledError";
    }
  },
  we = class extends Error {
    constructor(e, n, i) {
      super(
        `Reduction reached ${e.toLocaleString()} live column entries, above the ${n.toLocaleString()} ceiling, after ${i.toLocaleString()} columns`,
      );
      this.peakColumnEntries = e;
      this.limit = n;
      this.completedColumns = i;
      this.name = "PersistenceLimitExceededError";
    }
  };
var lo = 256;
function co(s, t = {}) {
  let e = Zi(s, t),
    n = e.next();
  for (; !n.done;) n = e.next();
  return n.value;
}
async function uo(s, t = {}, e = ho, n = 8) {
  let i = Zi(s, t),
    r = () => (typeof performance > "u" ? Date.now() : performance.now()),
    o = r(),
    a = i.next();
  for (; !a.done;) (r() - o >= n && (await e(), (o = r())), (a = i.next()));
  return a.value;
}
var po = setTimeout;
function ho() {
  return new Promise((s) => po(s, 0));
}
function* Zi(s, t = {}) {
  let e = s.simplices.length,
    n = s.boundaries.map((u) => Uint32Array.from(u)),
    i = t.computeRepresentatives ? s.boundaries.map((u, d) => Uint32Array.of(d)) : null,
    r = new Map(),
    o = new Map(),
    a = 0,
    l = n.reduce((u, d) => u + d.length, 0) + (i ? e : 0),
    c = l;
  for (let u = 0; u < e; u++) {
    if (u % lo === 0) {
      if (t.shouldCancel?.()) throw new _(u);
      (t.onProgress?.(e === 0 ? 1 : u / e), yield u);
    }
    let d = n[u],
      p = i?.[u];
    for (;;) {
      let h = Dt(d);
      if (h === null) break;
      let m = r.get(h);
      if (m === void 0) {
        (r.set(h, u), o.set(h, u));
        break;
      }
      if (
        ((l -= d.length + (p?.length ?? 0)),
        (d = he(d, n[m])),
        i && p && (p = he(p, i[m])),
        (l += d.length + (p?.length ?? 0)),
        (c = Math.max(c, l)),
        a++,
        t.maxColumnEntries !== void 0 && c > t.maxColumnEntries)
      )
        throw new we(c, t.maxColumnEntries, u);
    }
    ((n[u] = d), i && p && (i[u] = p));
  }
  return (
    t.onProgress?.(1),
    {
      reduced: n,
      basis: i,
      pairs: o,
      diagnostics: {
        simplexCount: e,
        columnOperations: a,
        peakColumnEntries: c,
        zeroLengthIntervalCount: 0,
        essentialIntervalCount: 0,
        representativesRequested: !!t.computeRepresentatives,
        rejectedRepresentativeCount: 0,
      },
    }
  );
}
function it(s, t, e = {}) {
  return Qi(s, t, co(s, { ...e, computeRepresentatives: t.computeRepresentatives }));
}
async function Ji(s, t, e = {}) {
  let n = await uo(s, { ...e, computeRepresentatives: t.computeRepresentatives });
  return Qi(s, t, n);
}
function Qi(s, t, e) {
  let n = [];
  for (let o = 0; o < s.simplices.length; o++) {
    if (e.reduced[o].length > 0) continue;
    let a = s.simplices[o];
    if (a.dimension > s.maxDimension) continue;
    let l = e.pairs.get(o),
      c = l === void 0 ? null : s.simplices[l];
    n.push({
      id: mo(a.dimension, a.key),
      dimension: a.dimension,
      birth: a.value,
      death: c ? c.value : null,
      birthSimplex: a.key,
      ...(c ? { deathSimplex: c.key } : {}),
      lifetime: c ? c.value - a.value : null,
    });
  }
  n.sort(
    (o, a) =>
      o.dimension - a.dimension ||
      o.birth - a.birth ||
      (a.lifetime ?? 1 / 0) - (o.lifetime ?? 1 / 0) ||
      o.birthSimplex.localeCompare(a.birthSimplex),
  );
  let i = Xi(s, e, n),
    r = {
      ...e.diagnostics,
      zeroLengthIntervalCount: n.filter((o) => o.lifetime === 0).length,
      essentialIntervalCount: n.filter((o) => o.death === null).length,
      rejectedRepresentativeCount: i.rejected,
    };
  return {
    intervals: n,
    representatives: i.representatives,
    repairs: s.repairs,
    metric: t.metric,
    direction: "increasing",
    coefficientField: "F2",
    maxDimension: s.maxDimension,
    tiePolicy: s.tiePolicy,
    modelRevision: t.modelRevision,
    diagnostics: r,
  };
}
function mo(s, t) {
  return `H${s}:${t}`;
}
var ts = {
  enabled: !1,
  mode: "subsample",
  sampleCount: 20,
  retainFraction: 0.8,
  perturbationScale: 0.05,
  seed: 20250804,
  budgetMs: 4e3,
};
function ns(s, t, e, n, i = {}) {
  let r = i.now ?? (() => Date.now()),
    o = r(),
    a = Eo(n.seed),
    l = [...new Set(e.intervals.map((g) => g.dimension))],
    c = new Map();
  e.intervals.forEach((g) => c.set(g.id, { births: [], deaths: [] }));
  let u = 0,
    d = 0,
    p = 0,
    h = !1;
  for (let g = 0; g < n.sampleCount; g++) {
    if (i.shouldCancel?.()) throw new _(u);
    if (r() - o > n.budgetMs) {
      h = !0;
      break;
    }
    let f = n.mode === "subsample" ? xo(s, n, a) : wo(s, n, a);
    if (f === null) continue;
    let v = Se(f),
      y = it(v, { metric: s.metric, modelRevision: s.modelRevision, computeRepresentatives: !1 });
    for (let b of l) {
      let x = e.intervals.filter((N) => N.dimension === b),
        R = y.intervals.filter((N) => N.dimension === b),
        k = fo(x.map(Zt), R.map(Zt));
      k.forEach((N, B) => {
        if (N === null) return;
        let W = c.get(x[B].id);
        if (!W) return;
        let j = Zt(R[N]);
        (W.births.push(j.birth), Number.isFinite(j.death) && W.deaths.push(j.death));
      });
      let P = new Set(k.filter((N) => N !== null));
      ((d += R.length), (p += R.length - P.size));
    }
    (u++, i.onProgress?.((g + 1) / n.sampleCount));
  }
  let m = e.intervals.map((g) => {
    let f = c.get(g.id) ?? { births: [], deaths: [] };
    return {
      intervalId: g.id,
      supportFrequency: u === 0 ? 0 : f.births.length / u,
      matchedCount: f.births.length,
      birthQuantiles: es(f.births),
      deathQuantiles: es(f.deaths),
    };
  });
  return {
    mode: n.mode,
    seed: n.seed,
    requestedSamples: n.sampleCount,
    completedSamples: u,
    truncated: h,
    elapsedMs: r() - o,
    unmatchedRate: d === 0 ? 0 : p / d,
    samplingScheme: go(n),
    support: m,
  };
}
function go(s) {
  if (s.mode === "subsample") {
    let t = s.strata?.length ? "within each configured stratum" : "across all notes";
    return `Stratified subsampling: ${Math.round(s.retainFraction * 100)}% of notes retained ${t}, ${s.sampleCount} seeded resamples (seed ${s.seed}).`;
  }
  return `Weight perturbation: filtration values moved by up to \xB1${s.perturbationScale.toFixed(2)}, ${s.sampleCount} seeded resamples (seed ${s.seed}). This is not subsampling and the two must not be compared.`;
}
function Zt(s) {
  return { birth: s.birth, death: s.death ?? 1 / 0 };
}
function fo(s, t) {
  let e = s.map(() => null);
  if (s.length === 0 || t.length === 0) return e;
  let n = st(s, (a) => Number.isFinite(a.death)),
    i = st(t, (a) => Number.isFinite(a.death));
  yo(
    n.map((a) => s[a]),
    i.map((a) => t[a]),
  ).forEach((a, l) => {
    a !== null && (e[n[l]] = i[a]);
  });
  let r = st(s, (a) => !Number.isFinite(a.death)),
    o = st(t, (a) => !Number.isFinite(a.death));
  return (
    vo(
      r.map((a) => s[a]),
      o.map((a) => t[a]),
    ).forEach((a, l) => {
      a !== null && (e[r[l]] = o[a]);
    }),
    e
  );
}
function yo(s, t) {
  if (s.length === 0) return [];
  if (t.length === 0) return s.map(() => null);
  let e = new Set([0]);
  (s.forEach((a) => {
    (e.add(rt(a)), t.forEach((l) => e.add(is(a, l))));
  }),
    t.forEach((a) => e.add(rt(a))));
  let n = [...e].filter((a) => Number.isFinite(a)).sort((a, l) => a - l),
    i = 0,
    r = n.length - 1,
    o = null;
  for (; i <= r;) {
    let a = (i + r) >> 1,
      l = bo(s, t, n[a]);
    l ? ((o = l), (r = a - 1)) : (i = a + 1);
  }
  return o ?? s.map(() => null);
}
function vo(s, t) {
  let e = s.map((r, o) => o).sort((r, o) => s[r].birth - s[o].birth),
    n = t.map((r, o) => o).sort((r, o) => t[r].birth - t[o].birth),
    i = s.map(() => null);
  for (let r = 0; r < Math.min(e.length, n.length); r++) i[e[r]] = n[r];
  return i;
}
function is(s, t) {
  return Math.max(Math.abs(s.birth - t.birth), Math.abs(s.death - t.death));
}
function rt(s) {
  return (s.death - s.birth) / 2;
}
function bo(s, t, e) {
  let n = s.length,
    i = t.length,
    r = [];
  for (let l = 0; l < n; l++) {
    let c = [];
    for (let u = 0; u < i; u++) is(s[l], t[u]) <= e && c.push(u);
    (rt(s[l]) <= e && c.push(i + l), r.push(c));
  }
  for (let l = 0; l < i; l++) {
    let c = [];
    rt(t[l]) <= e && c.push(l);
    for (let u = 0; u < n; u++) c.push(i + u);
    r.push(c);
  }
  let o = Array.from({ length: n + i }, () => null),
    a = Array.from({ length: n + i }, () => null);
  for (let l = 0; l < n + i; l++) if (!ss(l, r, o, a, new Set())) return null;
  return Array.from({ length: n }, (l, c) => {
    let u = o[c];
    return u !== null && u < i ? u : null;
  });
}
function ss(s, t, e, n, i) {
  for (let r of t[s]) {
    if (i.has(r)) continue;
    i.add(r);
    let o = n[r];
    if (o === null || ss(o, t, e, n, i)) return ((n[r] = s), (e[s] = r), !0);
  }
  return !1;
}
function st(s, t) {
  let e = [];
  return (
    s.forEach((n, i) => {
      t(n) && e.push(i);
    }),
    e
  );
}
function xo(s, t, e) {
  let n = new Map();
  s.vertexKeys.forEach((r, o) => {
    let a = t.strata?.[o] ?? "all",
      l = n.get(a) ?? [];
    (l.push(o), n.set(a, l));
  });
  let i = new Set();
  for (let r of n.values()) {
    let o = Co(r, e),
      a = Math.max(1, Math.round(r.length * t.retainFraction));
    o.slice(0, a).forEach((l) => i.add(l));
  }
  return i.size === 0 ? null : So(s, i);
}
function So(s, t) {
  let e = new Map(),
    n = [];
  s.vertexKeys.forEach((c, u) => {
    t.has(u) && (e.set(u, n.length), n.push(c));
  });
  let i = [0],
    r = [],
    o = [],
    a = [],
    l = [];
  for (let c = 0; c < s.simplexDimensions.length; c++) {
    let u = [...s.simplexVertices.slice(s.simplexOffsets[c], s.simplexOffsets[c + 1])];
    u.every((d) => t.has(d)) &&
      (u.forEach((d) => r.push(e.get(d))),
      i.push(r.length),
      o.push(s.simplexDimensions[c]),
      a.push(s.filtrationValues[c]),
      l.push(s.stableKeys[c]));
  }
  return {
    ...s,
    vertexKeys: n,
    simplexOffsets: Uint32Array.from(i),
    simplexVertices: Uint32Array.from(r),
    simplexDimensions: Uint16Array.from(o),
    filtrationValues: Float64Array.from(a),
    stableKeys: l,
    computeRepresentatives: !1,
  };
}
function wo(s, t, e) {
  let n = Float64Array.from(s.filtrationValues, (i) => {
    let r = i + (e() * 2 - 1) * t.perturbationScale;
    return Math.min(1, Math.max(0, r));
  });
  return { ...s, filtrationValues: n, computeRepresentatives: !1 };
}
function Co(s, t) {
  let e = [...s];
  for (let n = e.length - 1; n > 0; n--) {
    let i = Math.floor(t() * (n + 1));
    [e[n], e[i]] = [e[i], e[n]];
  }
  return e;
}
function es(s) {
  if (s.length === 0) return null;
  let t = [...s].sort((n, i) => n - i),
    e = (n) => t[Math.min(t.length - 1, Math.floor(n * t.length))];
  return { p05: e(0.05), p50: e(0.5), p95: e(0.95) };
}
function Eo(s) {
  let t = s >>> 0;
  return () => {
    t = (t + 1831565813) >>> 0;
    let e = t;
    return (
      (e = Math.imul(e ^ (e >>> 15), e | 1)),
      (e ^= e + Math.imul(e ^ (e >>> 7), e | 61)),
      ((e ^ (e >>> 14)) >>> 0) / 4294967296
    );
  };
}
var ot = class {
  constructor() {
    this.cancelled = new Set();
  }
  capabilities() {
    return { coefficientFields: ["F2"], maxHomologyDimension: 2, persistence: !0 };
  }
  async computeStatic(t) {
    if (this.cancelled.delete(t.requestId)) throw new Error(`Topology request cancelled: ${t.requestId}`);
    let e = hn(t),
      n = new me();
    return (
      e.nodes.forEach((i) => n.setNode(i)),
      e.simplices.filter((i) => i.length > 1).forEach((i) => n.addSimplex({ nodes: i })),
      { ...Ae(n, t.maxHomologyDimension), modelRevision: t.modelRevision }
    );
  }
  async computePersistence(t, e = {}) {
    if (this.cancelled.delete(t.requestId)) throw new Error(`Topology request cancelled: ${t.requestId}`);
    let n = Se(t);
    return it(
      n,
      { metric: t.metric, modelRevision: t.modelRevision, computeRepresentatives: t.computeRepresentatives },
      { ...e, shouldCancel: () => this.cancelled.has(t.requestId) || !!e.shouldCancel?.() },
    );
  }
  cancel(t) {
    this.cancelled.add(t);
  }
  clearCancellation(t) {
    this.cancelled.delete(t);
  }
};
var rs = { maxSimplices: 5e4, maxColumnEntries: 4e6 };
function os(s, t) {
  let e = s.stableKeys.length + s.vertexKeys.length;
  return e <= t.maxSimplices
    ? null
    : {
        reason: "limit-exceeded",
        message: `This vault produces ${e.toLocaleString()} simplices, above the ${t.maxSimplices.toLocaleString()} ceiling. Raise the limit in settings, or narrow the filtration metric, to analyze it.`,
        phase: "building",
        simplexCount: e,
        vertexCount: s.vertexKeys.length,
      };
}
function Jt(s) {
  let t = new Set();
  return function (n) {
    if (n.kind === "cancel") {
      t.add(n.requestId);
      return;
    }
    let { requestId: i, input: r, limits: o } = n,
      a = r.stableKeys.length + r.vertexKeys.length,
      l = r.vertexKeys.length,
      c = "building",
      u = os(r, o);
    if (u) {
      s({ kind: "failure", requestId: i, failure: u });
      return;
    }
    let d = new ot(),
      p = () => t.has(i);
    (async () => {
      try {
        if (n.kind === "static") {
          let g = await d.computeStatic(r);
          if (p()) throw new _(0);
          s({ kind: "static-result", requestId: i, result: g });
          return;
        }
        s({ kind: "progress", requestId: i, phase: c, fraction: 0 });
        let h = Se(r);
        c = "reducing";
        let m = await Ji(
          h,
          { metric: r.metric, modelRevision: r.modelRevision, computeRepresentatives: r.computeRepresentatives },
          {
            shouldCancel: p,
            maxColumnEntries: o.maxColumnEntries,
            onProgress: (g) => s({ kind: "progress", requestId: i, phase: "reducing", fraction: g }),
          },
        );
        if (
          (r.computeRepresentatives &&
            ((c = "witnesses"), s({ kind: "progress", requestId: i, phase: c, fraction: 1 })),
          r.bootstrap?.enabled &&
            ((c = "uncertainty"),
            s({ kind: "progress", requestId: i, phase: c, fraction: 0 }),
            (m.uncertainty = ns(r, h, m, r.bootstrap, {
              shouldCancel: p,
              onProgress: (g) => s({ kind: "progress", requestId: i, phase: "uncertainty", fraction: g }),
            }))),
          p())
        )
          throw new _(h.simplices.length);
        s({ kind: "persistence-result", requestId: i, result: m });
      } catch (h) {
        s({ kind: "failure", requestId: i, failure: Mo(h, c, a, l) });
      } finally {
        t.delete(i);
      }
    })();
  };
}
function Mo(s, t, e, n) {
  return s instanceof _
    ? { reason: "cancelled", message: s.message, phase: t, simplexCount: e, vertexCount: n }
    : s instanceof we
      ? { reason: "limit-exceeded", message: s.message, phase: t, simplexCount: e, vertexCount: n }
      : {
          reason: "engine-error",
          message: s instanceof Error ? s.message : String(s),
          phase: t,
          simplexCount: e,
          vertexCount: n,
        };
}
if (typeof self < "u" && typeof self.postMessage == "function" && typeof document > "u") {
  let s = Jt((t) => self.postMessage(t));
  self.onmessage = (t) => s(t.data);
}
var Ro = setTimeout,
  at = class {
    constructor() {
      this.worker = null;
      this.blobUrl = null;
      this.inlineHandler = null;
      this.handlers = new Map();
      this.execution = "worker";
      this.restartCount = 0;
    }
    get lastExecution() {
      return this.execution;
    }
    get restarts() {
      return this.restartCount;
    }
    send(t, e) {
      this.handlers.set(t.requestId, e);
      let n = this.ensureWorker();
      if (n) {
        ((this.execution = "worker"),
          n.postMessage(t, [
            t.input.simplexOffsets.buffer,
            t.input.simplexVertices.buffer,
            t.input.simplexDimensions.buffer,
            t.input.filtrationValues.buffer,
          ]));
        return;
      }
      this.execution = "main-thread";
      let i = this.ensureInlineHandler();
      Ro(() => i(t), 0);
    }
    cancel(t) {
      let e = { kind: "cancel", requestId: t };
      this.worker ? this.worker.postMessage(e) : this.inlineHandler?.(e);
    }
    restart() {
      (this.disposeWorker(), this.handlers.clear(), this.restartCount++);
    }
    dispose() {
      (this.disposeWorker(), this.handlers.clear(), (this.inlineHandler = null));
    }
    ensureWorker() {
      if (this.worker) return this.worker;
      if (typeof Worker > "u" || typeof Blob > "u" || typeof URL > "u") return null;
      try {
        let t = new Blob(
          [
            '"use strict";(()=>{function K(n){return n.toLowerCase().trim()}function y(n){return[...n].map(K).sort().join("|")}var pe={simplex:"s",hyperedge:"h"};function D(n,e){return`${pe[n]}:${y(e)}`}function x(n){return[...n].sort((e,t)=>K(e).localeCompare(K(t)))}function z(n){let e=new Set,t=[];for(let r of x(n)){let i=K(r);e.has(i)||(e.add(i),t.push(r))}return t}var he="filtration-order-v1";function I(n){let e=n.maxHomologyDimension,t=e+1,r=new Map;n.vertexKeys.forEach((c,m)=>{let p=y([c]);r.set(p,{key:p,vertices:[m],dimension:0,raw:0,score:1})});for(let c=0;c<n.simplexDimensions.length;c++){let m=n.simplexDimensions[c];if(m>t)continue;let p=[...n.simplexVertices.slice(n.simplexOffsets[c],n.simplexOffsets[c+1])].sort((g,h)=>g-h),f=n.filtrationValues[c];if(!Number.isFinite(f))throw new Error(`Filtration value for ${n.stableKeys[c]} is not finite`);r.set(n.stableKeys[c],{key:n.stableKeys[c],vertices:p,dimension:m,raw:f,score:1-f})}let i=[...r.values()].sort((c,m)=>c.dimension-m.dimension||c.key.localeCompare(m.key)),o=new Map;for(let c of i){if(c.dimension===0){o.set(c.key,[]);continue}let m=c.vertices.map((p,f)=>y(c.vertices.filter((g,h)=>h!==f).map(g=>n.vertexKeys[g])));for(let p of m)if(!r.has(p))throw new Error(`Filtration input is not downward closed: ${c.key} lacks ${p}`);o.set(c.key,m)}let s=new Map,a=[];for(let c of i){let m=c.raw,p=null;for(let f of o.get(c.key)??[]){let g=s.get(f)??0;g>m&&(m=g,p=f)}s.set(c.key,m),p!==null&&a.push({simplexKey:c.key,faceKey:p,rawValue:c.raw,repairedValue:m})}let l=[...r.values()].sort((c,m)=>s.get(c.key)-s.get(m.key)||c.dimension-m.dimension||c.key.localeCompare(m.key)).map((c,m)=>({key:c.key,vertices:c.vertices,dimension:c.dimension,value:s.get(c.key),rawValue:c.raw,score:c.score,order:m})),u=new Map(l.map(c=>[c.key,c.order])),d=l.map(c=>{let p=(o.get(c.key)??[]).map(f=>{let g=u.get(f);if(g===void 0)throw new Error(`Face ${f} of ${c.key} is missing from the total order`);if(g>=c.order)throw new Error(`Face precedence violated: ${f} does not precede ${c.key}`);return g});return Uint32Array.from(p.sort((f,g)=>f-g))});return{simplices:l,order:u,boundaries:d,repairs:a,maxDimension:e,tiePolicy:he}}function fe(n,e=1/0){let t=new Map;t.set(0,x([...n.nodes.keys()]).map(s=>y([s])));for(let s of n.simplices.values()){let a=s.nodes.length-1;if(a>e)continue;let l=t.get(a)??[];l.push(y(s.nodes)),t.set(a,l)}let r=Math.max(0,...t.keys()),i=[];for(let s=0;s<=r;s++){let a=[...new Set(t.get(s)??[])].sort();i.push({dimension:s,simplices:a,index:new Map(a.map((l,u)=>[l,u]))})}let o=[];for(let s=1;s<=r;s++){let a=i[s-1],l=i[s],u=l.simplices.map(d=>{let c=d.split("|"),m=c.map((p,f)=>a.index.get(y(c.filter((g,h)=>h!==f))));if(m.some(p=>p===void 0))throw new Error(`Topology input is not downward closed: ${d} lacks a codimension-one face`);return Uint32Array.from(m.sort((p,f)=>p-f))});o.push({dimension:s,rows:a,columns:l,data:u})}return{bases:i,boundaries:o,maxDimension:r}}function P(n,e){let t=[],r=0,i=0;for(;r<n.length||i<e.length;)i>=e.length||r<n.length&&n[r]<e[i]?t.push(n[r++]):r>=n.length||e[i]<n[r]?t.push(e[i++]):(r++,i++);return Uint32Array.from(t)}function W(n){return n.length?n[n.length-1]:null}function ge(n){let e=new Map,t=0;for(let r of n){let i=Uint32Array.from(r);for(;;){let o=W(i);if(o===null)break;let s=e.get(o);if(!s){e.set(o,i),t++;break}i=P(i,s)}}return t}function E(n,e){let t=fe(n,e+1),r=Array.from({length:e+2},()=>0);for(let s of t.boundaries)r[s.dimension]=ge(s.data);let i=Array.from({length:e+2},(s,a)=>t.bases[a]?.simplices.length??0),o=Array.from({length:e+1},(s,a)=>i[a]-r[a]-r[a+1]);return{b0:o[0]??0,b1:o[1]??0,b2:o[2]??0,coefficientField:"F2",betti:o,chainDimensions:i.slice(0,e+2),boundaryRanks:r.slice(0,e+2),maxDimension:e,modelRevision:n.revision}}function Y(n){if(n.simplexOffsets.length!==n.simplexDimensions.length+1)throw new Error("Invalid simplex offsets");if(n.stableKeys.length!==n.simplexDimensions.length)throw new Error("Invalid stable-key table");if(n.filtrationValues.length!==n.simplexDimensions.length)throw new Error("Invalid filtration table");if([...n.filtrationValues].some(t=>!Number.isFinite(t)))throw new Error("Invalid filtration value");let e=[];for(let t=0;t<n.simplexDimensions.length;t++){let r=n.simplexOffsets[t],i=n.simplexOffsets[t+1];if(i<r||i>n.simplexVertices.length)throw new Error("Invalid simplex vertex range");let o=[...n.simplexVertices.slice(r,i)].map(s=>n.vertexKeys[s]);if(o.some(s=>s===void 0)||o.length!==n.simplexDimensions[t]+1)throw new Error("Invalid simplex dimension or vertex index");e.push(o)}return{nodes:n.vertexKeys,simplices:e}}function Q(n,e,t){if(!e.basis)return{representatives:[],rejected:0};let r=e.basis,i=[],o=0;for(let s of t){if(s.dimension!==1&&s.dimension!==2)continue;let a=n.order.get(s.birthSimplex);if(a===void 0)continue;let l=r[a];if(!(!l||l.length===0)){if(!ye(n,l)){o++;continue}if(s.deathSimplex!==void 0){let u=n.order.get(s.deathSimplex),d=u===void 0?void 0:e.reduced[u];if(!d||d.length===0||d[d.length-1]!==a){o++;continue}}i.push({intervalId:s.id,dimension:s.dimension,simplices:[...l].map(u=>n.simplices[u].key).sort(),boundaryIsZero:!0,canonical:!1})}}return{representatives:i,rejected:o}}function ye(n,e){let t=new Uint32Array(0);for(let r of e)t=P(t,n.boundaries[r]);return t.length===0}var S=class extends Error{constructor(t){super(`Persistence reduction cancelled after ${t} columns`);this.completedColumns=t;this.name="PersistenceCancelledError"}},k=class extends Error{constructor(t,r,i){super(`Reduction reached ${t.toLocaleString()} live column entries, above the ${r.toLocaleString()} ceiling, after ${i.toLocaleString()} columns`);this.peakColumnEntries=t;this.limit=r;this.completedColumns=i;this.name="PersistenceLimitExceededError"}};var be=256;function xe(n,e={}){let t=X(n,e),r=t.next();for(;!r.done;)r=t.next();return r.value}async function ve(n,e={},t=Ce,r=8){let i=X(n,e),o=()=>typeof performance>"u"?Date.now():performance.now(),s=o(),a=i.next();for(;!a.done;)o()-s>=r&&(await t(),s=o()),a=i.next();return a.value}var Se=setTimeout;function Ce(){return new Promise(n=>Se(n,0))}function*X(n,e={}){let t=n.simplices.length,r=n.boundaries.map(d=>Uint32Array.from(d)),i=e.computeRepresentatives?n.boundaries.map((d,c)=>Uint32Array.of(c)):null,o=new Map,s=new Map,a=0,l=r.reduce((d,c)=>d+c.length,0)+(i?t:0),u=l;for(let d=0;d<t;d++){if(d%be===0){if(e.shouldCancel?.())throw new S(d);e.onProgress?.(t===0?1:d/t),yield d}let c=r[d],m=i?.[d];for(;;){let p=W(c);if(p===null)break;let f=o.get(p);if(f===void 0){o.set(p,d),s.set(p,d);break}if(l-=c.length+(m?.length??0),c=P(c,r[f]),i&&m&&(m=P(m,i[f])),l+=c.length+(m?.length??0),u=Math.max(u,l),a++,e.maxColumnEntries!==void 0&&u>e.maxColumnEntries)throw new k(u,e.maxColumnEntries,d)}r[d]=c,i&&m&&(i[d]=m)}return e.onProgress?.(1),{reduced:r,basis:i,pairs:s,diagnostics:{simplexCount:t,columnOperations:a,peakColumnEntries:u,zeroLengthIntervalCount:0,essentialIntervalCount:0,representativesRequested:!!e.computeRepresentatives,rejectedRepresentativeCount:0}}}function M(n,e,t={}){return J(n,e,xe(n,{...t,computeRepresentatives:e.computeRepresentatives}))}async function Z(n,e,t={}){let r=await ve(n,{...t,computeRepresentatives:e.computeRepresentatives});return J(n,e,r)}function J(n,e,t){let r=[];for(let s=0;s<n.simplices.length;s++){if(t.reduced[s].length>0)continue;let a=n.simplices[s];if(a.dimension>n.maxDimension)continue;let l=t.pairs.get(s),u=l===void 0?null:n.simplices[l];r.push({id:Re(a.dimension,a.key),dimension:a.dimension,birth:a.value,death:u?u.value:null,birthSimplex:a.key,...u?{deathSimplex:u.key}:{},lifetime:u?u.value-a.value:null})}r.sort((s,a)=>s.dimension-a.dimension||s.birth-a.birth||(a.lifetime??1/0)-(s.lifetime??1/0)||s.birthSimplex.localeCompare(a.birthSimplex));let i=Q(n,t,r),o={...t.diagnostics,zeroLengthIntervalCount:r.filter(s=>s.lifetime===0).length,essentialIntervalCount:r.filter(s=>s.death===null).length,rejectedRepresentativeCount:i.rejected};return{intervals:r,representatives:i.representatives,repairs:n.repairs,metric:e.metric,direction:"increasing",coefficientField:"F2",maxDimension:n.maxDimension,tiePolicy:n.tiePolicy,modelRevision:e.modelRevision,diagnostics:o}}function Re(n,e){return`H${n}:${e}`}function te(n,e,t,r,i={}){let o=i.now??(()=>Date.now()),s=o(),a=Me(r.seed),l=[...new Set(t.intervals.map(g=>g.dimension))],u=new Map;t.intervals.forEach(g=>u.set(g.id,{births:[],deaths:[]}));let d=0,c=0,m=0,p=!1;for(let g=0;g<r.sampleCount;g++){if(i.shouldCancel?.())throw new S(d);if(o()-s>r.budgetMs){p=!0;break}let h=r.mode==="subsample"?De(n,r,a):Ke(n,r,a);if(h===null)continue;let b=I(h),v=M(b,{metric:n.metric,modelRevision:n.modelRevision,computeRepresentatives:!1});for(let w of l){let F=t.intervals.filter(C=>C.dimension===w),T=v.intervals.filter(C=>C.dimension===w),U=Ie(F.map(q),T.map(q));U.forEach((C,me)=>{if(C===null)return;let $=u.get(F[me].id);if(!$)return;let V=q(T[C]);$.births.push(V.birth),Number.isFinite(V.death)&&$.deaths.push(V.death)});let de=new Set(U.filter(C=>C!==null));c+=T.length,m+=T.length-de.size}d++,i.onProgress?.((g+1)/r.sampleCount)}let f=t.intervals.map(g=>{let h=u.get(g.id)??{births:[],deaths:[]};return{intervalId:g.id,supportFrequency:d===0?0:h.births.length/d,matchedCount:h.births.length,birthQuantiles:ee(h.births),deathQuantiles:ee(h.deaths)}});return{mode:r.mode,seed:r.seed,requestedSamples:r.sampleCount,completedSamples:d,truncated:p,elapsedMs:o()-s,unmatchedRate:c===0?0:m/c,samplingScheme:we(r),support:f}}function we(n){if(n.mode==="subsample"){let e=n.strata?.length?"within each configured stratum":"across all notes";return`Stratified subsampling: ${Math.round(n.retainFraction*100)}% of notes retained ${e}, ${n.sampleCount} seeded resamples (seed ${n.seed}).`}return`Weight perturbation: filtration values moved by up to \\xB1${n.perturbationScale.toFixed(2)}, ${n.sampleCount} seeded resamples (seed ${n.seed}). This is not subsampling and the two must not be compared.`}function q(n){return{birth:n.birth,death:n.death??1/0}}function Ie(n,e){let t=n.map(()=>null);if(n.length===0||e.length===0)return t;let r=N(n,a=>Number.isFinite(a.death)),i=N(e,a=>Number.isFinite(a.death));Pe(r.map(a=>n[a]),i.map(a=>e[a])).forEach((a,l)=>{a!==null&&(t[r[l]]=i[a])});let o=N(n,a=>!Number.isFinite(a.death)),s=N(e,a=>!Number.isFinite(a.death));return ke(o.map(a=>n[a]),s.map(a=>e[a])).forEach((a,l)=>{a!==null&&(t[o[l]]=s[a])}),t}function Pe(n,e){if(n.length===0)return[];if(e.length===0)return n.map(()=>null);let t=new Set([0]);n.forEach(a=>{t.add(A(a)),e.forEach(l=>t.add(ne(a,l)))}),e.forEach(a=>t.add(A(a)));let r=[...t].filter(a=>Number.isFinite(a)).sort((a,l)=>a-l),i=0,o=r.length-1,s=null;for(;i<=o;){let a=i+o>>1,l=Fe(n,e,r[a]);l?(s=l,o=a-1):i=a+1}return s??n.map(()=>null)}function ke(n,e){let t=n.map((o,s)=>s).sort((o,s)=>n[o].birth-n[s].birth),r=e.map((o,s)=>s).sort((o,s)=>e[o].birth-e[s].birth),i=n.map(()=>null);for(let o=0;o<Math.min(t.length,r.length);o++)i[t[o]]=r[o];return i}function ne(n,e){return Math.max(Math.abs(n.birth-e.birth),Math.abs(n.death-e.death))}function A(n){return(n.death-n.birth)/2}function Fe(n,e,t){let r=n.length,i=e.length,o=[];for(let l=0;l<r;l++){let u=[];for(let d=0;d<i;d++)ne(n[l],e[d])<=t&&u.push(d);A(n[l])<=t&&u.push(i+l),o.push(u)}for(let l=0;l<i;l++){let u=[];A(e[l])<=t&&u.push(l);for(let d=0;d<r;d++)u.push(i+d);o.push(u)}let s=Array.from({length:r+i},()=>null),a=Array.from({length:r+i},()=>null);for(let l=0;l<r+i;l++)if(!re(l,o,s,a,new Set))return null;return Array.from({length:r},(l,u)=>{let d=s[u];return d!==null&&d<i?d:null})}function re(n,e,t,r,i){for(let o of e[n]){if(i.has(o))continue;i.add(o);let s=r[o];if(s===null||re(s,e,t,r,i))return r[o]=n,t[n]=o,!0}return!1}function N(n,e){let t=[];return n.forEach((r,i)=>{e(r)&&t.push(i)}),t}function De(n,e,t){let r=new Map;n.vertexKeys.forEach((o,s)=>{let a=e.strata?.[s]??"all",l=r.get(a)??[];l.push(s),r.set(a,l)});let i=new Set;for(let o of r.values()){let s=Ee(o,t),a=Math.max(1,Math.round(o.length*e.retainFraction));s.slice(0,a).forEach(l=>i.add(l))}return i.size===0?null:Te(n,i)}function Te(n,e){let t=new Map,r=[];n.vertexKeys.forEach((u,d)=>{e.has(d)&&(t.set(d,r.length),r.push(u))});let i=[0],o=[],s=[],a=[],l=[];for(let u=0;u<n.simplexDimensions.length;u++){let d=[...n.simplexVertices.slice(n.simplexOffsets[u],n.simplexOffsets[u+1])];d.every(c=>e.has(c))&&(d.forEach(c=>o.push(t.get(c))),i.push(o.length),s.push(n.simplexDimensions[u]),a.push(n.filtrationValues[u]),l.push(n.stableKeys[u]))}return{...n,vertexKeys:r,simplexOffsets:Uint32Array.from(i),simplexVertices:Uint32Array.from(o),simplexDimensions:Uint16Array.from(s),filtrationValues:Float64Array.from(a),stableKeys:l,computeRepresentatives:!1}}function Ke(n,e,t){let r=Float64Array.from(n.filtrationValues,i=>{let o=i+(t()*2-1)*e.perturbationScale;return Math.min(1,Math.max(0,o))});return{...n,filtrationValues:r,computeRepresentatives:!1}}function Ee(n,e){let t=[...n];for(let r=t.length-1;r>0;r--){let i=Math.floor(e()*(r+1));[t[r],t[i]]=[t[i],t[r]]}return t}function ee(n){if(n.length===0)return null;let e=[...n].sort((r,i)=>r-i),t=r=>e[Math.min(e.length-1,Math.floor(r*e.length))];return{p05:t(.05),p50:t(.5),p95:t(.95)}}function Me(n){let e=n>>>0;return()=>{e=e+1831565813>>>0;let t=e;return t=Math.imul(t^t>>>15,t|1),t^=t+Math.imul(t^t>>>7,t|61),((t^t>>>14)>>>0)/4294967296}}function Ne(n){let e=5381;for(let t=0;t<n.length;t++)e=(e<<5)+e^n.charCodeAt(t),e=e>>>0;return e}function R(n){let e=["purple","teal","coral","pink","blue","amber"];return n?e[Ne(n)%e.length]:"purple"}function oe(n){return n.nodes.length-1}function*se(n,e){if(e===0){yield[];return}for(let t=0;t<=n.length-e;t++)for(let r of se(n.slice(t+1),e-1))yield[n[t],...r]}function G(n,e){if(oe(e)>=4)return[];let r=x(e.nodes),i=[];for(let o=2;o<r.length;o++)for(let s of se(r,o))n.simplices.has(y(s))||i.push(x(s));return i}function ae(n,e){let t=oe(e);if(t>4){console.warn(`[Simplicial] Simplex dim=${t} exceeds cap. Faces not auto-generated.`);return}let r=y(e.nodes),i=e.colorKey??R(e.label);for(let o of G(n,e))n.simplices.set(y(o),{nodes:o,autoGenerated:!0,userDefined:!1,parentKey:r,colorKey:i})}function _(n,e=2){return E(n,e)}function le(n,e=2){let t=new Map;for(let i of n.simplices.values()){let o=i.nodes.length,s=t.get(o)??new Set;s.add(y(i.nodes)),t.set(o,s)}let r=[];return e>=1&&r.push(...Ae(n,t)),e>=2&&r.push(..._e(t)),r}function Ae(n,e){let t=new Map([...n.nodes.keys()].map(s=>[s,new Set]));for(let s of n.simplices.values()){if(s.nodes.length!==2)continue;let[a,l]=s.nodes;t.get(a)?.add(l),t.get(l)?.add(a)}let r=e.get(3)??new Set,i=new Set,o=[];for(let[s,a]of t){let l=x([...a]);for(let u=0;u<l.length;u++)for(let d=u+1;d<l.length;d++){let c=l[u],m=l[d];if(!t.get(c)?.has(m))continue;let p=x([s,c,m]),f=y(p);r.has(f)||i.has(f)||(i.add(f),o.push({dimension:1,boundaryNodes:p,missingSimplex:[...p]}))}}return o.sort((s,a)=>y(s.missingSimplex).localeCompare(y(a.missingSimplex)))}function _e(n){let e=n.get(3)??new Set,t=n.get(4)??new Set,r=new Map,i=[...e].map(s=>s.split("|"));for(let s=0;s<i.length;s++)for(let a=s+1;a<i.length;a++){let l=x([...new Set([...i[s],...i[a]])]);l.length===4&&r.set(y(l),l)}let o=[];for(let[s,a]of r){if(t.has(s))continue;a.every((u,d)=>e.has(y(a.filter((c,m)=>m!==d))))&&o.push({dimension:2,boundaryNodes:[...a],missingSimplex:[...a]})}return o.sort((s,a)=>y(s.missingSimplex).localeCompare(y(a.missingSimplex)))}function Le(n){if(!n)return"";try{return` ${JSON.stringify(n)}`}catch{return" [unserializable-details]"}}function L(n,e,t,r){let i=`[Simplicial:${e}] ${t}${Le(r)}`;if(n==="error"){console.error(i);return}if(n==="warn"){console.warn(i);return}if(n==="debug"){console.debug(i);return}console.debug(i)}var ce={debug(n,e,t){L("debug",n,e,t)},info(n,e,t){L("info",n,e,t)},warn(n,e,t){L("warn",n,e,t)},error(n,e,t){L("error",n,e,t)}};function B(n,e){return n+Math.random()*(e-n)}function Be(n,e,t){let r=n/2,i=e/2,o=Math.max(t+40,r-t),s=Math.max(t+40,i-t);switch(Math.floor(Math.random()*4)){case 0:return{px:B(-o,o),py:-s};case 1:return{px:o,py:B(-s,s)};case 2:return{px:B(-o,o),py:s};default:return{px:-o,py:B(-s,s)}}}function Oe(n,e,t=!1){let r=e?.width??960,i=e?.height??640,{px:o,py:s}=Be(r,i,80);return{id:n,px:o,py:s,vx:0,vy:0,isVirtual:t,isPinned:!1,displayAlpha:1}}var H=class{constructor(){this.revision=0;this.nodes=new Map;this.simplices=new Map;this.hyperedges=new Map;this.listeners=new Set;this.batchDepth=0;this.hasPendingEmit=!1;this._analysisCache=null;this._analysisDirty=!0;this._crossLayerCache=null}subscribe(e){return this.listeners.add(e),()=>this.listeners.delete(e)}emitChange(){if(this.batchDepth>0){this.hasPendingEmit=!0;return}this.flushChange()}flushChange(){this.listeners.forEach(e=>e())}batch(e){this.batchDepth++;try{return e()}finally{this.batchDepth--,this.batchDepth===0&&this.hasPendingEmit&&(this.hasPendingEmit=!1,this.flushChange())}}setNode(e,t){let r=this.nodes.get(e);if(r){Object.assign(r,t??{}),t?.isVirtual===!1&&(r.isVirtual=!1),this.emitChange();return}let i=Oe(e,void 0,t?.isVirtual??!1);t?.px!==void 0&&(i.px=t.px),t?.py!==void 0&&(i.py=t.py),t?.isPinned!==void 0&&(i.isPinned=t.isPinned),this.nodes.set(e,i),this.invalidateAnalysisCache(),this.emitChange()}removeNode(e){this.nodes.delete(e);for(let[t,r]of[...this.simplices])r.nodes.includes(e)&&this.simplices.delete(t);for(let[t,r]of[...this.hyperedges])r.nodes.includes(e)&&this.hyperedges.delete(t);this.invalidateAnalysisCache(),this.emitChange()}updateNodeId(e,t){if(e===t)return;let r=this.nodes.get(e);r&&(this.nodes.set(t,{...r,id:t}),this.nodes.delete(e));for(let[i,o]of[...this.simplices]){if(!o.nodes.includes(e))continue;let s={...o,nodes:x(o.nodes.map(a=>a===e?t:a))};this.simplices.delete(i),this.simplices.set(y(s.nodes),s)}for(let[i,o]of[...this.hyperedges]){if(!o.nodes.includes(e))continue;let s={...o,nodes:x(o.nodes.map(a=>a===e?t:a))};this.hyperedges.delete(i),this.hyperedges.set(D("hyperedge",s.nodes),s)}this.invalidateAnalysisCache(),this.emitChange()}addSimplex(e){if(e.kind==="hyperedge")return ce.error("model","Refused to add a hyperedge through addSimplex",{nodes:e.nodes}),"";let t=z(e.nodes);if(t.length<2)return"";t.forEach(o=>{this.nodes.has(o)||this.setNode(o,{isVirtual:!1})});let r={...e,nodes:x(t),weight:O(e.weight),autoGenerated:e.autoGenerated??!1,userDefined:e.userDefined??!e.autoGenerated,colorKey:e.autoGenerated?e.colorKey??"neutral":e.colorKey??R(e.label)},i=y(r.nodes);return this.simplices.set(i,r),ae(this,r),this.invalidateAnalysisCache(),this.emitChange(),i}removeSimplex(e){if(this.simplices.delete(e)){for(let[t,r]of[...this.simplices]){if(!r.autoGenerated)continue;[...this.simplices.entries()].some(([o,s])=>o===t||s.autoGenerated?!1:r.nodes.every(a=>s.nodes.includes(a)))||this.simplices.delete(t)}this.invalidateAnalysisCache(),this.emitChange()}}addHyperedge(e){let t=z(e.nodes);if(t.length<2)return"";t.forEach(l=>{this.nodes.has(l)||this.setNode(l,{isVirtual:!1})});let r=x(t),i=D("hyperedge",r),o=this.hyperedges.get(i),s=o?.suggested&&!e.suggested?void 0:o,a={...s,...e,nodes:r,weight:O(e.weight??s?.weight),colorKey:e.colorKey??s?.colorKey??R(e.label),...e.suggested?{}:{occurredAt:s?.occurredAt??e.occurredAt??Date.now()}};return this.hyperedges.set(i,a),this.invalidateAnalysisCache(!1),this.emitChange(),i}removeHyperedge(e){return this.hyperedges.delete(e)?(this.invalidateAnalysisCache(!1),this.emitChange(),!0):!1}getHyperedge(e){return this.hyperedges.get(e)}getHyperedgesForNode(e){return[...this.hyperedges.values()].filter(t=>t.nodes.includes(e))}updateHyperedge(e,t){let r=this.hyperedges.get(e);if(!r)return;let i={...r,...t,nodes:r.nodes};return t.label!==void 0&&(i.colorKey=R(t.label)),t.weight!==void 0&&(i.weight=O(t.weight)),this.hyperedges.set(e,i),this.invalidateAnalysisCache(!1),this.emitChange(),i}facesImpliedByPromotion(e){let t=this.hyperedges.get(e);return t?G(this,{nodes:t.nodes}):[]}promoteToSimplex(e,t={}){let r=this.hyperedges.get(e);if(!r)return null;let i=this.facesImpliedByPromotion(e),o="";return this.batch(()=>{o=this.addSimplex({nodes:r.nodes,label:r.label,weight:r.weight,sourcePath:r.sourcePath,userDefined:!0,autoGenerated:!1}),t.retainEncounter===!1?this.hyperedges.delete(e):this.hyperedges.set(e,{...r,promotedTo:o}),this.invalidateAnalysisCache(),this.emitChange()}),o?{simplexKey:o,createdFaces:i}:null}relaxToHyperedge(e){let t=this.simplices.get(e);if(!t||t.autoGenerated)return null;let r=D("hyperedge",t.nodes),i=this.hyperedges.get(r),o="";return this.batch(()=>{o=this.addHyperedge({...i,nodes:t.nodes,label:i?.label??t.label,weight:i?.weight??t.weight,sourcePath:i?.sourcePath??t.sourcePath,occurredAt:i?.occurredAt,promotedTo:void 0}),this.removeSimplex(e)}),o||null}crystallizeHyperedge(e,t){let r=this.hyperedges.get(e);return r?(this.batch(()=>{this.nodes.has(t)||this.setNode(t,{isVirtual:!1}),this.hyperedges.set(e,{...r,crystallizedInto:t}),this.invalidateAnalysisCache(),this.emitChange()}),!0):!1}getAllRelations(){let e=[];return this.simplices.forEach((t,r)=>{e.push({key:D("simplex",t.nodes),relation:{kind:"simplex",...t}})}),this.hyperedges.forEach((t,r)=>{e.push({key:r,relation:{kind:"hyperedge",...t}})}),e}replaceInferredSimplices(e){this.batch(()=>{for(let[t,r]of[...this.simplices])r.inferred&&this.simplices.delete(t);e.forEach(t=>{t.nodes.forEach(r=>{this.nodes.has(r)||this.setNode(r,{isVirtual:!1})}),this.addSimplex(t)}),this.invalidateAnalysisCache(),this.emitChange()})}replaceInferredHyperedges(e){this.batch(()=>{for(let[t,r]of this.hyperedges)r.inferred&&r.suggested&&r.suggestionSource!=="encounter-discovery"&&this.hyperedges.delete(t);e.forEach(t=>this.addHyperedge({...t,inferred:!0,suggested:!0,suggestionSource:"inference"})),this.invalidateAnalysisCache(!1),this.emitChange()})}replaceSourceRelations(e,t,r){this.batch(()=>{for(let[i,o]of[...this.simplices])o.sourcePath===e&&!o.autoGenerated&&this.simplices.delete(i);for(let[i,o]of[...this.hyperedges])o.sourcePath===e&&this.hyperedges.delete(i);t.forEach(i=>{i.nodes.forEach(o=>{this.nodes.has(o)||this.setNode(o,{isVirtual:!0})}),this.addSimplex({...i,sourcePath:e})}),r.forEach(i=>{i.nodes.forEach(o=>{this.nodes.has(o)||this.setNode(o,{isVirtual:!0})}),this.addHyperedge({...i,sourcePath:e})}),this.invalidateAnalysisCache(),this.emitChange()})}replaceSourceSimplices(e,t){this.replaceSourceRelations(e,t,[])}updateMetadata(e,t){let r=this.simplices.get(e);if(!r)return;let i={...r,...t};t.label!==void 0&&(i.colorKey=r.autoGenerated?"neutral":R(t.label)),t.weight!==void 0&&(i.weight=O(t.weight)),this.simplices.set(e,i),this.invalidateAnalysisCache(),this.emitChange()}setPinnedState(e,t,r,i){let o=this.nodes.get(e);o&&(o.isPinned=t,r!==void 0&&(o.px=r),i!==void 0&&(o.py=i),this.emitChange())}getSimplicesForNode(e){return[...this.simplices.values()].filter(t=>t.nodes.includes(e))}getNeighbors(e){let t=new Set;return this.getSimplicesForNode(e).forEach(r=>{r.nodes.forEach(i=>{i!==e&&t.add(i)})}),[...t]}getSimplicesByDim(e){return[...this.simplices.values()].filter(t=>t.nodes.length-1===e)}getAllNodes(){return[...this.nodes.values()]}getSimplex(e){return this.simplices.get(e)}invalidateAnalysisCache(e=!0){this._analysisDirty=!0,this._crossLayerCache=null,e&&this.revision++}readCrossLayerCache(){return this._crossLayerCache}writeCrossLayerCache(e){return this._crossLayerCache=e,e}getAnalysisSummary(){return!this._analysisDirty&&this._analysisCache?this._analysisCache:(this._analysisCache=this.computeAnalysisSummary(),this._analysisDirty=!1,this._analysisCache)}getCachedBetti(){return!this._analysisDirty&&this._analysisCache?this._analysisCache.betti??_(this,2):_(this,2)}computeAnalysisSummary(){let e=[...this.simplices.values()],t=e.filter(h=>h.nodes.length===2),r=new Map,i=new Map;this.nodes.forEach((h,b)=>r.set(b,new Set)),this.nodes.forEach((h,b)=>i.set(b,0)),t.forEach(h=>{let[b,v]=h.nodes;r.get(b)?.add(v),r.get(v)?.add(b)}),e.forEach(h=>{h.nodes.forEach(b=>{i.set(b,(i.get(b)??0)+1)})});let o=0,s=new Set;r.forEach((h,b)=>{if(s.has(b))return;o++;let v=[b];for(;v.length>0;){let w=v.pop();s.has(w)||(s.add(w),r.get(w)?.forEach(F=>{s.has(F)||v.push(F)}))}});let a=null,l=-1,u=0;r.forEach((h,b)=>{let v=h.size;u+=v,v>l&&(l=v,a=b)});let d=null,c=-1,m=0;i.forEach((h,b)=>{m+=h,h>c&&(c=h,d=b)});let p=_(this,2),f=le(this,2).length,g=[...this.hyperedges.values()];return{nodeCount:this.nodes.size,simplexCount:e.length,hyperedgeCount:g.length,recurringEncounterCount:g.filter(h=>h.persistence==="recurring").length,edgeCount:t.length,clusterCount:e.filter(h=>h.nodes.length===3).length,coreCount:e.filter(h=>h.nodes.length>=4).length,inferredCount:e.filter(h=>h.inferred).length,suggestedCount:e.filter(h=>h.suggested).length,connectedComponents:o,averageDegree:this.nodes.size?Number((u/this.nodes.size).toFixed(2)):0,maxDegreeNodeId:a,maxDegree:Math.max(0,l),maxSimplexCentralityNodeId:d,maxSimplexCentrality:Math.max(0,c),averageSimplexCentrality:this.nodes.size?Number((m/this.nodes.size).toFixed(2)):0,betti:p,missingFaceCount:f}}};function O(n){return n===void 0||Number.isNaN(n)?1:Math.max(.1,Math.min(1,n))}var j=class{constructor(){this.cancelled=new Set}capabilities(){return{coefficientFields:["F2"],maxHomologyDimension:2,persistence:!0}}async computeStatic(e){if(this.cancelled.delete(e.requestId))throw new Error(`Topology request cancelled: ${e.requestId}`);let t=Y(e),r=new H;return t.nodes.forEach(i=>r.setNode(i)),t.simplices.filter(i=>i.length>1).forEach(i=>r.addSimplex({nodes:i})),{...E(r,e.maxHomologyDimension),modelRevision:e.modelRevision}}async computePersistence(e,t={}){if(this.cancelled.delete(e.requestId))throw new Error(`Topology request cancelled: ${e.requestId}`);let r=I(e);return M(r,{metric:e.metric,modelRevision:e.modelRevision,computeRepresentatives:e.computeRepresentatives},{...t,shouldCancel:()=>this.cancelled.has(e.requestId)||!!t.shouldCancel?.()})}cancel(e){this.cancelled.add(e)}clearCancellation(e){this.cancelled.delete(e)}};function ue(n,e){let t=n.stableKeys.length+n.vertexKeys.length;return t<=e.maxSimplices?null:{reason:"limit-exceeded",message:`This vault produces ${t.toLocaleString()} simplices, above the ${e.maxSimplices.toLocaleString()} ceiling. Raise the limit in settings, or narrow the filtration metric, to analyze it.`,phase:"building",simplexCount:t,vertexCount:n.vertexKeys.length}}function He(n){let e=new Set;return function(r){if(r.kind==="cancel"){e.add(r.requestId);return}let{requestId:i,input:o,limits:s}=r,a=o.stableKeys.length+o.vertexKeys.length,l=o.vertexKeys.length,u="building",d=ue(o,s);if(d){n({kind:"failure",requestId:i,failure:d});return}let c=new j,m=()=>e.has(i);(async()=>{try{if(r.kind==="static"){let g=await c.computeStatic(o);if(m())throw new S(0);n({kind:"static-result",requestId:i,result:g});return}n({kind:"progress",requestId:i,phase:u,fraction:0});let p=I(o);u="reducing";let f=await Z(p,{metric:o.metric,modelRevision:o.modelRevision,computeRepresentatives:o.computeRepresentatives},{shouldCancel:m,maxColumnEntries:s.maxColumnEntries,onProgress:g=>n({kind:"progress",requestId:i,phase:"reducing",fraction:g})});if(o.computeRepresentatives&&(u="witnesses",n({kind:"progress",requestId:i,phase:u,fraction:1})),o.bootstrap?.enabled&&(u="uncertainty",n({kind:"progress",requestId:i,phase:u,fraction:0}),f.uncertainty=te(o,p,f,o.bootstrap,{shouldCancel:m,onProgress:g=>n({kind:"progress",requestId:i,phase:"uncertainty",fraction:g})})),m())throw new S(p.simplices.length);n({kind:"persistence-result",requestId:i,result:f})}catch(p){n({kind:"failure",requestId:i,failure:je(p,u,a,l)})}finally{e.delete(i)}})()}}function je(n,e,t,r){return n instanceof S?{reason:"cancelled",message:n.message,phase:e,simplexCount:t,vertexCount:r}:n instanceof k?{reason:"limit-exceeded",message:n.message,phase:e,simplexCount:t,vertexCount:r}:{reason:"engine-error",message:n instanceof Error?n.message:String(n),phase:e,simplexCount:t,vertexCount:r}}if(typeof self<"u"&&typeof self.postMessage=="function"&&typeof document>"u"){let n=He(e=>self.postMessage(e));self.onmessage=e=>n(e.data)}})();\n',
          ],
          { type: "text/javascript" },
        );
        this.blobUrl = URL.createObjectURL(t);
        let e = new Worker(this.blobUrl);
        return (
          (e.onmessage = (n) => this.receive(n.data)),
          (e.onerror = (n) => this.failAll(n instanceof ErrorEvent ? n.message : "Topology worker error")),
          (this.worker = e),
          e
        );
      } catch (t) {
        return (
          C.warn("topology", "Falling back to main-thread topology: worker start failed", {
            error: t instanceof Error ? t.message : String(t),
          }),
          this.disposeWorker(),
          null
        );
      }
    }
    ensureInlineHandler() {
      return (this.inlineHandler ?? (this.inlineHandler = Jt((t) => this.receive(t))), this.inlineHandler);
    }
    receive(t) {
      let e = this.handlers.get(t.requestId);
      e && (t.kind !== "progress" && this.handlers.delete(t.requestId), e.onMessage(t));
    }
    failAll(t) {
      for (let [e, n] of [...this.handlers])
        (this.handlers.delete(e),
          n.onMessage({
            kind: "failure",
            requestId: e,
            failure: { reason: "engine-error", message: t, phase: "reducing", simplexCount: 0, vertexCount: 0 },
          }));
      (this.disposeWorker(), this.restartCount++);
    }
    disposeWorker() {
      (this.worker?.terminate(),
        (this.worker = null),
        this.blobUrl && URL.revokeObjectURL(this.blobUrl),
        (this.blobUrl = null));
    }
  };
var Do = 1,
  To = 4,
  Z = { metric: "weight", maxHomologyDimension: 2, computeRepresentatives: !0, bootstrap: ts, limits: rs },
  ae = {
    status: "idle",
    phase: null,
    fraction: 0,
    result: null,
    failure: null,
    execution: "worker",
    stale: !1,
    durationMs: null,
  },
  lt = class {
    constructor(t) {
      this.model = t;
      this.client = new at();
      this.cache = new Map();
      this.listeners = new Set();
      this.state = ae;
      this.currentRequestId = null;
      this.requestCounter = 0;
      this.startedAt = 0;
    }
    getState() {
      return this.state;
    }
    subscribe(t) {
      return (this.listeners.add(t), t(this.state), () => this.listeners.delete(t));
    }
    cacheKey(t) {
      let e = t.bootstrap.enabled
        ? `${t.bootstrap.mode}:${t.bootstrap.sampleCount}:${t.bootstrap.retainFraction}:${t.bootstrap.perturbationScale}:${t.bootstrap.seed}`
        : "off";
      return [
        `v${Do}`,
        `rev${this.model.revision}`,
        t.metric,
        `dim${t.maxHomologyDimension}`,
        "F2",
        Xt,
        t.computeRepresentatives ? "witnesses" : "no-witnesses",
        e,
      ].join("|");
    }
    request(t = Z) {
      let e = this.cacheKey(t),
        n = this.cache.get(e);
      if (n) {
        ((this.currentRequestId = null),
          this.emit({ ...ae, status: "ready", result: n, execution: this.client.lastExecution }));
        return;
      }
      this.currentRequestId && this.client.cancel(this.currentRequestId);
      let i = `topology-${++this.requestCounter}`;
      ((this.currentRequestId = i),
        (this.startedAt = Date.now()),
        this.emit({ ...ae, status: "running", phase: "building", result: this.state.result, stale: !0 }));
      let r = mn(this.model, i, {
        maxHomologyDimension: t.maxHomologyDimension,
        metric: t.metric,
        computeRepresentatives: t.computeRepresentatives,
      });
      ((r.bootstrap = t.bootstrap),
        this.client.send(
          { kind: "persistence", requestId: i, input: r, limits: t.limits },
          {
            onMessage: (o) => {
              if (o.requestId === this.currentRequestId) {
                if (o.kind === "progress") {
                  this.emit({ ...this.state, status: "running", phase: o.phase, fraction: o.fraction });
                  return;
                }
                if (o.kind === "persistence-result") {
                  ((this.currentRequestId = null),
                    this.store(e, o.result),
                    this.emit({
                      ...ae,
                      status: "ready",
                      result: o.result,
                      execution: this.client.lastExecution,
                      durationMs: Date.now() - this.startedAt,
                    }));
                  return;
                }
                o.kind === "failure" &&
                  ((this.currentRequestId = null),
                  o.failure.reason !== "cancelled" &&
                    C.warn("topology", "Persistence request failed", {
                      reason: o.failure.reason,
                      phase: o.failure.phase,
                      simplexCount: o.failure.simplexCount,
                    }),
                  this.emit({
                    ...ae,
                    status: "failed",
                    failure: o.failure,
                    execution: this.client.lastExecution,
                    durationMs: Date.now() - this.startedAt,
                  }));
              }
            },
          },
        ));
    }
    cancel() {
      this.currentRequestId &&
        (this.client.cancel(this.currentRequestId),
        (this.currentRequestId = null),
        this.emit({ ...ae, status: "idle", result: this.state.result, stale: !0 }));
    }
    restartWorker() {
      (this.client.restart(),
        (this.currentRequestId = null),
        this.emit({ ...ae, status: "idle", result: this.state.result, stale: !0 }));
    }
    invalidate() {
      this.cache.clear();
    }
    dispose() {
      (this.client.dispose(), this.listeners.clear(), this.cache.clear(), (this.currentRequestId = null));
    }
    store(t, e) {
      for (this.cache.set(t, e); this.cache.size > To;) {
        let n = this.cache.keys().next().value;
        if (n === void 0) break;
        this.cache.delete(n);
      }
    }
    emit(t) {
      ((this.state = t), this.listeners.forEach((e) => e(t)));
    }
  };
var K = require("obsidian");
var le = require("obsidian"),
  en = `You are reading an Obsidian vault that uses the Simplicial Complex plugin.

Work read-only during this first pass. Do not edit any file.

SEMANTICS

A simplex means the group is coherent and its relevant sub-relations are also meaningful. It supports downward closure.

An encounter or hyperedge means something meaningful occurs through the participants together, without claiming that its proper subsets are independently meaningful. Never generate faces from an encounter.

A context is a local relational reading of notes. A note may have different roles in different contexts. A contextual role is not the note's absolute identity.

Contextuality means local readings are pairwise compatible but cannot all be reconciled into one global reading. Ordinary disagreement between two contexts is not contextuality.

HARD RULES

- Treat every result as a proposal, not a vault fact.
- Never create a universal classification of a note or person.
- Never infer that an encounter actually occurred merely from semantic similarity.
- Never promote an encounter to a simplex.
- Repetition is evidence, not proof of simplicial coherence.
- Never edit relation history.
- Cite vault paths supporting every proposal.
- Prefer uncertainty and a precise user question over an unsupported assertion.`,
  as = `TASK \u2014 ENCOUNTER CANDIDATES

Find groups whose meaning may depend upon the whole configuration.

For each candidate:
1. Assign an ID such as E-01.
2. List the participating notes.
3. Describe what appears only through the whole.
4. Test whether the meaning survives in the important proper subsets.
5. Classify it as encounter, simplex, ordinary collection, or insufficient evidence.
6. Cite supporting vault paths.
7. State what only the user can confirm.
8. Provide ready-to-paste \u25C7 syntax, but do not insert it.

Return a ranked table followed by detailed evidence. Do not edit the vault until I explicitly select proposal IDs.`,
  ls = `TASK \u2014 CONTEXTUALITY CANDIDATES

Find overlapping argumentative, project, research, creative, or practical contexts.

For each candidate:
1. Assign an ID such as C-01.
2. Name and describe each context.
3. List the relations supporting it.
4. Identify only the notes shared across contexts.
5. Suggest local roles for shared notes using action, project, research, idea, creative, or reference.
6. Cite evidence for every context-relative role.
7. Distinguish ordinary local disagreement, compatible readings that glue, and a possible contextual obstruction.
8. Ask only questions whose answers could change the result.

Return a ranked table followed by detailed evidence. Do not edit the vault or Obsidian plugin settings. For selected proposals, produce a Contextuality Lab worksheet with context name, source, definition, included relations, local-role overrides, and unresolved user questions.`,
  cs = `${en}

${as}`,
  ds = `${en}

${ls}`,
  us = `${en}

${as}

${ls}`;
async function ps(s, t) {
  try {
    (await navigator.clipboard.writeText(s), new le.Notice(`${t} copied. Paste it into an external agent you trust.`));
  } catch {
    new le.Notice("Could not access the clipboard. Open the complete guide and copy the prompt manually.");
  }
}
function ct(s, t, e = !1) {
  let n = s.createDiv({ cls: "simplicial-agent-help" });
  (n.createDiv({ cls: "simplicial-panel-section-label", text: "Use an external AI reader" }),
    n.createEl("p", {
      text: "This plugin never sends your vault anywhere. If you independently give a file-capable agent access, these instructions help it propose structure for you to review.",
    }));
  let i = n.createDiv({ cls: "simplicial-agent-help-actions" }),
    r = (a, l) => {
      i.createEl("button", { text: a }).addEventListener("click", () => {
        ps(l, a);
      });
    };
  (e || r("Copy combined prompt", us),
    r("Copy encounter prompt", cs),
    r("Copy contextuality prompt", ds),
    i.createEl("button", { text: "Open complete guide" }).addEventListener("click", () => new Qt(t).open()));
}
var Qt = class extends le.Modal {
  onOpen() {
    (this.contentEl.addClass("simplicial-agent-guide"),
      this.contentEl.createEl("h2", { text: "Agent-assisted discovery" }),
      this.contentEl.createEl("p", {
        text: "Optional and provider-neutral: the plugin does not invoke an agent, transmit notes, or accept proposals automatically. You choose the tool, its vault access, and every intervention.",
      }),
      this.contentEl.createEl("h3", { text: "Safe workflow" }));
    let t = this.contentEl.createEl("ol");
    ([
      "Choose which vault folders the external agent may read and exclude private material.",
      "Run the first pass read-only with one of the prompts below.",
      "Review citations, uncertainty, and the questions marked for you.",
      "Record confirmed encounters through the plugin; enter contextuality worksheets in the Contextuality Lab.",
      "If you later permit file edits, preview the exact diff and never allow relation-history edits.",
    ].forEach((e) => t.createEl("li", { text: e })),
      this.addPrompt("Combined discovery prompt", us),
      this.addPrompt("Encounter-only prompt", cs),
      this.addPrompt("Contextuality-only prompt", ds));
  }
  addPrompt(t, e) {
    let n = this.contentEl.createEl("details");
    (n.createEl("summary", { text: t }),
      n.createEl("pre").createEl("code", { text: e }),
      new le.Setting(n).addButton((r) => {
        (r.setButtonText(`Copy ${t.toLowerCase()}`),
          r.onClick(() => {
            ps(e, t);
          }));
      }));
  }
};
var Io = {
    simplex: {
      title: "Create simplex",
      blurb: "A simplex claims the group and every sub-relation within it is coherent. Its faces will be generated.",
      cta: "Create simplex",
    },
    hyperedge: {
      title: "Create encounter",
      blurb:
        "An encounter claims only that these notes came together as one irreducible whole. No faces are generated, and no pair is asserted to be meaningful on its own.",
      cta: "Create encounter",
    },
  },
  dt = class extends K.Modal {
    constructor(e, n, i, r, o = "simplex") {
      super(e);
      this.initialNodes = n;
      this.persistenceLabel = i;
      this.onSubmit = r;
      this.nodesInput = "";
      this.labelInput = "";
      this.modeInput = "";
      this.weightInput = 1;
      ((this.nodesInput = n.join(", ")), (this.kind = o));
    }
    onOpen() {
      (this.render(),
        window.setTimeout(() => {
          let e = this.contentEl.querySelector("textarea");
          e instanceof HTMLTextAreaElement && e.focus();
        }, 0));
    }
    render() {
      let { contentEl: e } = this;
      e.empty();
      let n = Io[this.kind];
      (e.createEl("h3", { text: n.title }),
        e.createEl("p", { text: n.blurb }),
        e.createEl("p", {
          text: `Saves to ${this.persistenceLabel}. Use commas, spaces, or new lines to separate nodes.`,
        }),
        new K.Setting(e)
          .setName("Kind")
          .setDesc("Simplex: coherence inherited across subrelations. Encounter: irreducible group emergence.")
          .addDropdown((r) => {
            (r.addOption("simplex", "Simplex (\u25B3)"),
              r.addOption("hyperedge", "Encounter (\u25C7)"),
              r.setValue(this.kind),
              r.onChange((o) => {
                ((this.kind = o === "hyperedge" ? "hyperedge" : "simplex"), this.render());
              }));
          }));
      let i = null;
      (new K.Setting(e)
        .setName("Nodes")
        .setDesc("These will be resolved as notes when possible; unknown values become virtual nodes.")
        .addTextArea((r) => {
          ((i = r),
            r.setValue(this.nodesInput),
            (r.inputEl.rows = 6),
            r.onChange((o) => {
              this.nodesInput = o;
            }));
        }),
        new K.Setting(e).setName("Label").addText((r) => {
          (r.setPlaceholder("Unnamed"),
            r.setValue(this.labelInput),
            r.onChange((o) => {
              this.labelInput = o;
            }));
        }),
        this.kind === "hyperedge" &&
          (new K.Setting(e)
            .setName("Mode")
            .setDesc("What kind of encounter this was \u2014 free text, e.g. 'encounter', 'reading', 'argument'.")
            .addText((r) => {
              (r.setPlaceholder("Encounter"),
                r.setValue(this.modeInput),
                r.onChange((o) => {
                  this.modeInput = o;
                }));
            }),
          ct(e, this.app, !0)),
        new K.Setting(e)
          .setName("Weight")
          .setDesc("0.1 to 1.0")
          .addSlider((r) => {
            (r.setLimits(0.1, 1, 0.1),
              r.setValue(this.weightInput),
              r.onChange((o) => {
                this.weightInput = o;
              }));
          }),
        new K.Setting(e)
          .addButton((r) => {
            (r.setButtonText(n.cta),
              r.setCta(),
              r.onClick(async () => {
                let o = this.parseNodes(this.nodesInput);
                if (o.length < 2) {
                  (new K.Notice(
                    this.kind === "hyperedge"
                      ? "An encounter needs at least two participants."
                      : "A simplex needs at least two nodes.",
                  ),
                    i?.inputEl.focus());
                  return;
                }
                (await this.onSubmit({
                  kind: this.kind,
                  nodes: o,
                  label: this.labelInput.trim() || void 0,
                  weight: this.weightInput,
                  ...(this.kind === "hyperedge" ? { mode: this.modeInput.trim() || "encounter" } : {}),
                }),
                  this.close());
              }));
          })
          .addExtraButton((r) => {
            (r.setIcon("cross"), r.setTooltip("Cancel"), r.onClick(() => this.close()));
          }));
    }
    parseNodes(e) {
      return e
        .split(/[\n,\s]+/g)
        .map((n) => n.trim())
        .filter(Boolean)
        .filter((n, i, r) => r.indexOf(n) === i);
    }
  };
var pt = require("obsidian");
function hs(s) {
  return s.split("/").pop()?.replace(/\.md$/, "") ?? s;
}
var ut = class extends pt.Modal {
  constructor(e, n, i, r) {
    super(e);
    this.nodes = n;
    this.faces = i;
    this.onConfirm = r;
  }
  onOpen() {
    let { contentEl: e } = this;
    if (
      (e.empty(),
      e.createEl("h3", { text: "Promote encounter to simplex" }),
      e.createEl("p", {
        text: `You are asserting that ${this.nodes.map(hs).join(" \xB7 ")} is not only meaningful as a whole, but that its sub-relations are meaningful too.`,
      }),
      this.faces.length === 0)
    )
      e.createEl("p", { text: "Every implied face already exists in the complex, so nothing new will be asserted." });
    else {
      e.createEl("p", {
        text: `${this.faces.length} new ${this.faces.length === 1 ? "relation" : "relations"} will be created:`,
      });
      let n = e.createEl("ul", { cls: "simplicial-promote-faces" });
      this.faces.forEach((i) => {
        n.createEl("li", { text: i.map(hs).join(" \u2014 ") });
      });
    }
    (e.createEl("p", {
      cls: "simplicial-promote-note",
      text: "The encounter is kept as provenance, so this can be undone with 'relax to encounter'.",
    }),
      new pt.Setting(e)
        .addButton((n) => {
          (n.setButtonText("Promote"),
            n.setCta(),
            n.onClick(async () => {
              (await this.onConfirm(), this.close());
            }));
        })
        .addExtraButton((n) => {
          (n.setIcon("cross"), n.setTooltip("Cancel"), n.onClick(() => this.close()));
        }));
  }
};
var I = require("obsidian");
var ht = class extends I.ItemView {
  constructor(e, n) {
    super(e);
    this.model = n;
    this.simplexKey = null;
    this.selection = null;
    this.actions = null;
    this.history = null;
    this.settings = null;
    this.nodeProfiles = [];
    this.subsetScorer = null;
  }
  setSettings(e) {
    this.settings = e;
  }
  setNodeProfiles(e) {
    this.nodeProfiles = e;
  }
  setSubsetScorer(e) {
    this.subsetScorer = e;
  }
  getViewType() {
    return ue;
  }
  getDisplayText() {
    return "Simplicial metadata";
  }
  setActions(e) {
    ((this.actions = e),
      (this.saveMetadata = e.saveMetadata),
      (this.promoteSimplex = e.promoteSimplex),
      (this.dissolveSimplex = e.dissolveSimplex));
  }
  setHistory(e) {
    this.history = e;
  }
  setSelection(e) {
    let n = typeof e == "string" ? { kind: "simplex", key: e } : e;
    ((this.selection = n), (this.simplexKey = n?.kind === "simplex" ? n.key : null), this.renderPanel());
  }
  async onOpen() {
    (await Promise.resolve(), this.renderPanel());
  }
  renderPanel() {
    let { contentEl: e } = this;
    if ((e.empty(), this.selection?.kind === "hyperedge")) {
      this.renderHyperedgePanel(e, this.selection.key);
      return;
    }
    let n = this.simplexKey ? this.model.getSimplex(this.simplexKey) : null;
    if ((e.createDiv({ cls: "simplicial-panel-title", text: "Simplex" }), !n)) {
      e.createDiv({ text: "Select a simplex or an encounter." });
      return;
    }
    (this.settings?.enableExplanationPanel && this.renderExplanationCard(e, n),
      e.createDiv({ cls: "simplicial-panel-section-label", text: "Nodes" }),
      e.createDiv({ cls: "simplicial-panel-value", text: n.nodes.join(" \xB7 ") }));
    let i = this.model.getAnalysisSummary(),
      [r, o, a] = L(this.model, n),
      l = e.createDiv({ cls: "simplicial-panel-badges" });
    (this.renderBadge(l, n.autoGenerated ? "Auto face" : n.inferred ? "Inferred" : "Confirmed", [r, o, a]),
      this.renderBadge(l, `dim ${n.nodes.length - 1}`, [r, o, a]),
      n.sourcePath && this.renderBadge(l, n.sourcePath.replace(/\.md$/, ""), [r, o, a], !0),
      this.renderJourney(e, n.nodes, M("simplex", n.nodes)),
      n.inferred &&
        (e.createDiv({
          cls: "simplicial-panel-value",
          text: `Inferred from: ${(n.inferredSignals ?? []).join(" \xB7 ") || "weighted vault signals"}`,
        }),
        e.createDiv({
          cls: "simplicial-panel-value",
          text: `Confidence: ${Math.round((n.confidence ?? n.weight ?? 0) * 100)}%${n.suggested ? " \xB7 suggested" : ""}${n.decayedWeight !== void 0 ? ` \xB7 decayed ${Math.round(n.decayedWeight * 100)}%` : ""}`,
        })));
    let u = n.nodes
      .map((d) => ({ nodeId: d, centrality: this.model.getSimplicesForNode(d).length }))
      .sort((d, p) => p.centrality - d.centrality)
      .map(({ nodeId: d, centrality: p }) => `${d.replace(/\.md$/, "")} (${p})`)
      .join(" \xB7 ");
    if (
      (e.createDiv({ cls: "simplicial-panel-value", text: `Simplex centrality: ${u || "n/a"}` }),
      i.maxSimplexCentralityNodeId &&
        e.createDiv({
          cls: "simplicial-panel-value",
          text: `Global hub: ${i.maxSimplexCentralityNodeId.replace(/\.md$/, "")} (${i.maxSimplexCentrality}) \xB7 avg ${i.averageSimplexCentrality}`,
        }),
      n.inferred ||
        e.createDiv({
          cls: "simplicial-panel-value",
          text: `Persistence: ${n.sourcePath?.replace(/\.md$/, "") ?? "in memory"}`,
        }),
      n.autoGenerated)
    ) {
      (e.createDiv({ cls: "simplicial-panel-value", text: "Auto-generated face. Metadata editing is disabled." }),
        e.createDiv({ cls: "simplicial-panel-footer", text: `dim: ${n.nodes.length - 1} \xB7 auto: yes` }));
      return;
    }
    (new I.Setting(e).setName("Label").addText((d) => {
      (d.setPlaceholder("Unnamed"),
        d.setValue(n.label ?? ""),
        d.onChange((p) => {
          (window.clearTimeout(d.inputEl._simplicialTimer),
            (d.inputEl._simplicialTimer = window.setTimeout(() => {
              this.saveMetadata?.(this.simplexKey, { label: p });
            }, 500)));
        }));
    }),
      new I.Setting(e)
        .setName("Weight")
        .setDesc(String(n.weight ?? 1))
        .addSlider((d) => {
          let p = n.weight ?? 1;
          (d.setLimits(0.1, 1, 0.1),
            d.setValue(n.weight ?? 1),
            d.onChange((h) => {
              ((p = h), this.model.updateMetadata(this.simplexKey, { weight: h }), this.renderPanel());
            }),
            d.sliderEl.addEventListener("mouseup", () => {
              this.saveMetadata?.(this.simplexKey, { weight: p });
            }));
        }),
      new I.Setting(e)
        .setName("Relax to encounter")
        .setDesc(
          "Withdraw the claim that this group's sub-relations are meaningful, while keeping the group relation itself.",
        )
        .addButton((d) => {
          (d.setButtonText("Relax"),
            d.onClick(async () => {
              this.simplexKey && (await this.actions?.relaxSimplex(this.simplexKey));
            }));
        }),
      new I.Setting(e)
        .addButton((d) => {
          (d.setButtonText("Promote to note"),
            d.onClick(async () => {
              this.simplexKey &&
                (await this.promoteSimplex?.(this.simplexKey), new I.Notice("Simplex promoted to note."));
            }));
        })
        .addExtraButton((d) => {
          (d.setIcon("trash"),
            d.setTooltip("Dissolve simplex"),
            d.onClick(async () => {
              this.simplexKey && (await this.dissolveSimplex?.(this.simplexKey), new I.Notice("Simplex dissolved."));
            }));
        }),
      e.createDiv({
        cls: "simplicial-panel-footer",
        text: `dim: ${n.nodes.length - 1} \xB7 auto: ${n.autoGenerated ? "yes" : "no"} \xB7 inferred: ${n.inferred ? "yes" : "no"}`,
      }));
  }
  renderHyperedgePanel(e, n) {
    e.createDiv({ cls: "simplicial-panel-title", text: "Encounter" });
    let i = this.model.getHyperedge(n);
    if (!i) {
      e.createDiv({ text: "This encounter is no longer in the graph." });
      return;
    }
    let r = this.settings?.encounterRecurrenceThreshold ?? 3,
      o = this.history?.occurrencesOf(i.nodes) ?? [],
      a = Bi(this.model, n, {
        ...(this.subsetScorer ? { score: this.subsetScorer } : {}),
        occurrences: o,
        halfLifeDays: this.settings?.decayHalfLifeDays ?? 90,
      });
    (i.suggested &&
      (e.createDiv({
        cls: "simplicial-explanation-tension",
        text: `Probabilistic suggestion \xB7 ${Math.round((i.confidence ?? 0) * 100)}% confidence. Nothing has been recorded in your notes or history.`,
      }),
      new I.Setting(e)
        .setName("Record this encounter")
        .setDesc("Confirm that these notes genuinely came together as one irreducible whole.")
        .addButton((d) => {
          (d.setButtonText("Confirm encounter").setCta(),
            d.onClick(async () => this.actions?.confirmSuggestedEncounter(n)));
        })),
      e.createDiv({
        cls: "simplicial-explanation-tension",
        text: "These notes came together as one irreducible whole. No pair among them is asserted to be meaningful on its own.",
      }),
      e.createDiv({ cls: "simplicial-panel-section-label", text: "Participants" }),
      e.createDiv({ cls: "simplicial-panel-value", text: i.nodes.join(" \xB7 ") }));
    let l = e.createDiv({ cls: "simplicial-panel-badges" }),
      c = [127, 119, 221];
    (this.renderBadge(l, `order ${i.nodes.length}`, c),
      i.suggested && this.renderBadge(l, "Suggested", c),
      this.renderBadge(l, i.persistence === "recurring" ? "Recurring" : "Momentary", c),
      i.mode && this.renderBadge(l, i.mode, c, !0),
      i.promotedTo && this.renderBadge(l, "promoted", c, !0),
      i.sourcePath && this.renderBadge(l, i.sourcePath.replace(/\.md$/, ""), c, !0),
      o.length > 0 &&
        e.createDiv({
          cls: "simplicial-panel-value",
          text: `First encountered ${new Date(o[0]).toLocaleDateString()}`,
        }),
      this.renderJourney(e, i.nodes, n),
      a && this.renderEncounterDiagnostics(e, a, r),
      i.crystallizedInto &&
        e.createDiv({
          cls: "simplicial-panel-value",
          text: `Crystallized into ${i.crystallizedInto.replace(/\.md$/, "")}`,
        }),
      new I.Setting(e).setName("Label").addText((d) => {
        (d.setPlaceholder("Unnamed"),
          d.setValue(i.label ?? ""),
          d.onChange((p) => {
            (window.clearTimeout(d.inputEl._simplicialTimer),
              (d.inputEl._simplicialTimer = window.setTimeout(() => {
                this.actions?.saveHyperedgeMetadata(n, { label: p });
              }, 500)));
          }));
      }),
      new I.Setting(e)
        .setName("Weight")
        .setDesc(String(i.weight ?? 1))
        .addSlider((d) => {
          let p = i.weight ?? 1;
          (d.setLimits(0.1, 1, 0.1),
            d.setValue(i.weight ?? 1),
            d.onChange((h) => {
              ((p = h), this.model.updateHyperedge(n, { weight: h }));
            }),
            d.sliderEl.addEventListener("mouseup", () => {
              this.actions?.saveHyperedgeMetadata(n, { weight: p });
            }));
        }),
      new I.Setting(e)
        .setName("Promote to simplex")
        .setDesc(
          "Assert that the sub-relations within this group are meaningful too. You will see the exact list first.",
        )
        .addButton((d) => {
          (d.setButtonText("Promote"),
            d.setDisabled(!!i.promotedTo || !!i.suggested),
            d.onClick(() => this.actions?.promoteEncounter(n)));
        }));
    let u = i.persistence === "recurring" && !i.suggested;
    (new I.Setting(e)
      .setName("Crystallize concept")
      .setDesc(
        u
          ? "Precipitate a new note naming what keeps emerging here. The encounter stays unpromoted."
          : `Available once this configuration has recurred ${r} times.`,
      )
      .addButton((d) => {
        (d.setButtonText("Crystallize"),
          d.setDisabled(!u),
          d.onClick(async () => {
            await this.actions?.crystallizeEncounter(n);
          }));
      }),
      new I.Setting(e).addExtraButton((d) => {
        (d.setIcon("trash"),
          d.setTooltip("Dissolve encounter"),
          d.onClick(async () => {
            await this.actions?.dissolveHyperedge(n);
          }));
      }),
      e.createDiv({
        cls: "simplicial-panel-footer",
        text: `order: ${i.nodes.length} \xB7 faces: none \xB7 kind: encounter`,
      }));
  }
  renderEncounterDiagnostics(e, n, i) {
    let r = Ui(n, i),
      o = e.createDiv({ cls: "simplicial-diagnostics" });
    o.createDiv({ cls: "simplicial-panel-section-label", text: "Diagnostics" });
    let a = n.closure;
    this.renderMeasure(
      o,
      "Closure deficit",
      a === null || a.deficit === null ? "unbounded" : a.deficit.toFixed(2),
      r.closure,
      a?.deficit ?? null,
    );
    let l = n.independence;
    (this.renderMeasure(
      o,
      "Face independence",
      l === null
        ? "not measured"
        : l.independence === null
          ? "n/a"
          : `${l.independence.toFixed(2)} \xB7 group evidence ${l.fullSetScore.toFixed(2)}`,
      r.independence,
      l?.independence ?? null,
    ),
      this.renderMeasure(
        o,
        "Persistence",
        `${n.occurrences.length || 1}\xD7 \xB7 vitality ${n.vitality.toFixed(1)}`,
        r.persistence,
        null,
      ));
    let c = n.peakOverlap;
    this.renderMeasure(o, "Overlap pressure", c ? c.pressure.toFixed(2) : "0.00", r.overlap, c?.pressure ?? null);
  }
  renderJourney(e, n, i) {
    if (!this.history) return;
    let r = this.history.forNodes(n).sort((l, c) => l.timestamp - c.timestamp),
      o = this.history.lineageFor(i);
    if (r.length === 0 && o.length === 0) return;
    let a = e.createDiv({ cls: "simplicial-journey" });
    (a.createDiv({ cls: "simplicial-panel-section-label", text: "Journey" }),
      r.forEach((l) => {
        let c = a.createDiv({ cls: "simplicial-journey-event" });
        (c.createSpan({ cls: "simplicial-journey-time", text: new Date(l.timestamp).toLocaleString() }),
          c.createSpan({ cls: "simplicial-journey-action", text: `${l.type} \xB7 ${l.actor}` }),
          l.type === "promoted" &&
            typeof l.detail?.createdFaceCount == "number" &&
            c.createSpan({ text: `${l.detail.createdFaceCount} faces asserted` }));
      }),
      o.forEach((l) => {
        let c = l.target.startsWith("n:") ? l.target.slice(2) : "simplex over the same participants";
        a.createDiv({
          cls: "simplicial-journey-lineage",
          text: l.type === "crystallization" ? `Produced ${c}` : `Produced ${c}`,
        });
      }));
  }
  renderMeasure(e, n, i, r, o) {
    let a = e.createDiv({ cls: "simplicial-measure" }),
      l = a.createDiv({ cls: "simplicial-measure-head" });
    (l.createSpan({ cls: "simplicial-measure-name", text: n }),
      l.createSpan({ cls: "simplicial-measure-figure", text: i }),
      o !== null &&
        a.createDiv({ cls: "simplicial-measure-track" }).createDiv({
          cls: "simplicial-measure-bar",
          attr: { style: `width: ${Math.round(Math.max(0, Math.min(1, o)) * 100)}%;` },
        }),
      r && a.createDiv({ cls: "simplicial-measure-reading", text: r }));
  }
  renderExplanationCard(e, n) {
    let i = G(this.model, 2),
      r = Yi(n, this.nodeProfiles, new Map(), i),
      o = e.createDiv({ cls: "simplicial-explanation-card" });
    if (
      (o.createDiv({ cls: "simplicial-explanation-headline", text: r.headline }),
      o.createDiv({ cls: "simplicial-explanation-tension", text: r.tension }),
      o.createDiv({ cls: "simplicial-explanation-prompt", text: r.prompt }),
      r.signals.length > 0)
    ) {
      let a = o.createDiv({ cls: "simplicial-explanation-signals" });
      (a.createDiv({ cls: "simplicial-explanation-signals-label", text: "Evidence:" }),
        r.signals.forEach((l) => {
          a.createDiv({ cls: "simplicial-explanation-signal", text: `\u2022 ${l}` });
        }));
    }
  }
  renderBadge(e, n, i, r = !1) {
    e.createSpan({
      cls: "simplicial-panel-badge",
      text: n,
      attr: {
        style: r
          ? `border-color: rgba(${i[0]},${i[1]},${i[2]},0.18); color: rgba(${i[0]},${i[1]},${i[2]},0.78);`
          : `background: rgba(${i[0]},${i[1]},${i[2]},0.12); border-color: rgba(${i[0]},${i[1]},${i[2]},0.28); color: rgb(${i[0]},${i[1]},${i[2]});`,
      },
    });
  }
};
async function tn(s, t, e) {
  let n = t.replace(/[\\/:*?"<>|]/g, "-").trim() || "simplex",
    i = 0;
  for (;;) {
    let r = `${n}${i === 0 ? "" : `-${i}`}.md`;
    if (!(s.vault.getAbstractFileByPath(r) instanceof I.TFile)) return s.vault.create(r, e);
    i++;
  }
}
var Ce = require("obsidian");
var Ne = {
    pairwise: { title: "Pairwise", claim: "Attention flows along links, one note to one note." },
    simplicial: { title: "Simplicial", claim: "Attention flows through coherent groups and every face they imply." },
    hypergraph: { title: "Hypergraph", claim: "Attention flows through whole encounters, which are never decomposed." },
  },
  mt = class extends Ce.ItemView {
    constructor(e, n) {
      super(e);
      this.model = n;
      this.runs = [];
      this.isRunning = !1;
      this.lastRunAt = null;
      this.runGeneration = 0;
    }
    getViewType() {
      return De;
    }
    getDisplayText() {
      return "Dynamics lab";
    }
    getIcon() {
      return "activity";
    }
    async onOpen() {
      (await Promise.resolve(), this.render());
    }
    async onClose() {
      (this.runGeneration++, (this.isRunning = !1), await Promise.resolve());
    }
    async run() {
      if (this.isRunning) return;
      let e = [...this.model.hyperedges.keys()];
      if (e.length === 0) {
        new Ce.Notice("No encounters to run. Record one with \u25C7 first.");
        return;
      }
      this.isRunning = !0;
      let n = ++this.runGeneration;
      ((this.runs = []), this.render());
      for (let i of e) {
        let r = this.model.getHyperedge(i);
        if (!r) continue;
        let o = [];
        for (let a of kt) {
          let l = await xn(this.model, i, a, {
            sliceIterations: 20,
            yieldControl: gs,
            isCancelled: () => n !== this.runGeneration,
          });
          if (n !== this.runGeneration) return;
          l && o.push(l);
        }
        (this.runs.push({ key: i, label: r.label?.trim() || r.nodes.map((a) => ms(a)).join(" \xB7 "), results: o }),
          await gs());
      }
      n === this.runGeneration && ((this.isRunning = !1), (this.lastRunAt = Date.now()), this.render());
    }
    render() {
      let { contentEl: e } = this;
      (e.empty(),
        e.createDiv({ cls: "simplicial-panel-title", text: "Dynamics lab" }),
        e.createDiv({
          cls: "simplicial-explanation-tension",
          text: "Three models of how attention spreads, run over the same vault. Where they disagree is where the shape of your notes is doing something a graph cannot describe.",
        }),
        new Ce.Setting(e)
          .setName("Run simulation")
          .setDesc(
            this.lastRunAt
              ? `Last run ${new Date(this.lastRunAt).toLocaleTimeString()} \xB7 ${this.runs.length} encounter${this.runs.length === 1 ? "" : "s"}.`
              : "Seeded and deterministic: the same vault gives the same answer every time.",
          )
          .addButton((i) => {
            (i.setButtonText(this.isRunning ? "Running\u2026" : "Run"),
              i.setDisabled(this.isRunning),
              i.onClick(() => {
                this.run();
              }));
          }));
      let n = e.createDiv({ cls: "simplicial-kernel-legend" });
      if (
        (kt.forEach((i) => {
          let r = n.createDiv({ cls: "simplicial-kernel-legend-row" });
          (r.createSpan({ cls: `simplicial-kernel-swatch is-${i}` }),
            r.createSpan({ cls: "simplicial-kernel-name", text: Ne[i].title }),
            r.createSpan({ cls: "simplicial-kernel-claim", text: Ne[i].claim }));
        }),
        this.runs.length === 0)
      ) {
        e.createDiv({ cls: "simplicial-panel-value", text: this.isRunning ? "Running\u2026" : "Nothing run yet." });
        return;
      }
      (this.runs.forEach((i) => this.renderRun(e, i)), this.renderCompetingRhythms(e));
    }
    renderRun(e, n) {
      let i = e.createDiv({ cls: "simplicial-dynamics-card" });
      (i.createDiv({ cls: "simplicial-panel-section-label", text: n.label }),
        n.results.forEach((o) => {
          let a = i.createDiv({ cls: "simplicial-dynamics-row" }),
            l = a.createDiv({ cls: "simplicial-measure-head" });
          (l.createSpan({ cls: `simplicial-kernel-name is-${o.kernel}`, text: Ne[o.kernel].title }),
            l.createSpan({
              cls: "simplicial-measure-figure",
              text: o.converged ? `${o.iterations} iterations` : "did not settle",
            }),
            this.renderTrace(a, o));
        }));
      let r = n.results.filter((o) => o.converged);
      if (r.length > 1) {
        let o = r.reduce((l, c) => (c.iterations < l.iterations ? c : l)),
          a = r.reduce((l, c) => (c.iterations > l.iterations ? c : l));
        o.kernel !== a.kernel &&
          i.createDiv({
            cls: "simplicial-measure-reading",
            text: `Settles fastest as a ${Ne[o.kernel].title.toLowerCase()} structure and slowest as a ${Ne[a.kernel].title.toLowerCase()} one.`,
          });
      }
    }
    renderTrace(e, n) {
      let i = e.createDiv({ cls: "simplicial-trace" }),
        o = Math.max(1, Math.ceil(n.orderTrace.length / 48));
      for (let a = 0; a < n.orderTrace.length; a += o) {
        let l = Math.max(0, Math.min(1, n.orderTrace[a]));
        i.createDiv({
          cls: `simplicial-trace-bar is-${n.kernel}`,
          attr: { style: `height: ${Math.max(2, Math.round(l * 100))}%;` },
        });
      }
    }
    renderCompetingRhythms(e) {
      let n = this.runs.map((o) => o.results.find((a) => a.kernel === "hypergraph")).filter((o) => o !== void 0),
        i = Sn(n);
      if (i.length === 0) return;
      let r = e.createDiv({ cls: "simplicial-dynamics-card" });
      (r.createDiv({ cls: "simplicial-panel-section-label", text: "Competing rhythms" }),
        i.slice(0, 5).forEach((o) => {
          r.createDiv({
            cls: "simplicial-measure-reading",
            text: `${o.sharedNodes.map(ms).join(" \xB7 ")} belongs to two encounters that settle ${o.separation} iterations apart. It is being asked to move at two speeds.`,
          });
        }));
    }
  };
function ms(s) {
  return s.split("/").pop()?.replace(/\.md$/, "") ?? s;
}
function gs() {
  return new Promise((s) => {
    window.setTimeout(s, 0);
  });
}
var J = require("obsidian");
var ko = { minimumNormalizedLifetime: 0.15, minimumBootstrapSupport: 0.5, maximumWitnessSize: 8, limit: 10 };
function ys(s, t, e = ko) {
  let n = new Map(t.representatives.map((a) => [a.intervalId, a])),
    i = new Map((t.uncertainty?.support ?? []).map((a) => [a.intervalId, a])),
    r = Ho(t.intervals),
    o = [];
  for (let a of t.intervals) {
    if (a.dimension !== 1) continue;
    let l = n.get(a.id);
    if (!l) continue;
    let c = $o(s, l);
    if (c.length === 0 || c.length > e.maximumWitnessSize || s.simplices.has(w(c))) continue;
    let u = Lo(a, r);
    if (u < e.minimumNormalizedLifetime) continue;
    let d = i.get(a.id)?.supportFrequency ?? null;
    (t.uncertainty && (d ?? 0) < e.minimumBootstrapSupport) ||
      o.push({
        intervalId: a.id,
        nodes: c,
        witnessKeys: l.simplices,
        explanation: No(s, a, l, c, {
          normalizedLifetime: u,
          bootstrapSupport: d,
          uncertainty: t.uncertainty,
          metric: t.metric,
          tiePolicy: t.tiePolicy,
        }),
      });
  }
  return o
    .sort((a, l) => fs(l.explanation) - fs(a.explanation) || a.intervalId.localeCompare(l.intervalId))
    .slice(0, e.limit);
}
function No(s, t, e, n, i) {
  let r = [],
    o = [];
  for (let d of e.simplices) {
    let p = s.simplices.get(d);
    p && (p.inferred || p.autoGenerated || p.suggested ? o.push(d) : r.push(d));
  }
  let a = e.simplices.length ? o.length / e.simplices.length : 0,
    l = new Set(
      n.flatMap((d) =>
        s
          .getHyperedgesForNode(d)
          .filter((p) => p.persistence === "recurring")
          .map((p) => M("hyperedge", p.nodes)),
      ),
    ).size,
    c = {
      normalizedLifetime: ce(i.normalizedLifetime),
      bootstrapSupport: ce(i.bootstrapSupport ?? 0),
      crossDomainDiversity: ce(Fo(n)),
      representativeCompactness: ce(Ao(n.length)),
      encounterRecurrence: ce(Math.min(1, l / 3) * 0.5),
      inferredEdgePenalty: ce(-a * 0.5),
      witnessComplexityPenalty: ce(-Math.max(0, n.length - 4) * 0.05),
    },
    u = [
      `Representative cycles are not canonical: another valid reduction of the same data yields a different witness for this class (tie policy ${i.tiePolicy}).`,
      `Birth and death are positions in the ${i.metric} filtration, not dates.`,
    ];
  return (
    i.uncertainty
      ? (u.push(
          `${i.uncertainty.samplingScheme} ${Math.round((i.bootstrapSupport ?? 0) * 100)}% of ${i.uncertainty.completedSamples} completed resamples reproduced this feature.`,
        ),
        i.uncertainty.truncated &&
          u.push(
            `The resampling budget stopped the run at ${i.uncertainty.completedSamples} of ${i.uncertainty.requestedSamples} samples, so support is measured on fewer samples than configured.`,
          ))
      : u.push("Empirical stability was not computed for this result, so no support frequency is claimed."),
    a > 0 &&
      u.push(
        `${Math.round(a * 100)}% of this cycle's relations were inferred by the plugin rather than asserted by you.`,
      ),
    {
      claim: Po(t, n, i),
      kind: "persistent-gap",
      evidencePaths: n,
      contextIds: [],
      authoredInputs: r,
      inferredInputs: o,
      scoreComponents: c,
      uncertainty: u,
      witnessRef: t.id,
      suggestedAction: "write",
    }
  );
}
function Po(s, t, e) {
  let n =
      s.death === null
        ? `from ${s.birth.toFixed(2)} onward, never closing`
        : `across thresholds ${s.birth.toFixed(2)}\u2013${s.death.toFixed(2)}`,
    i = [...t, t[0]].map(Oo).join(" \u2192 "),
    r =
      e.bootstrapSupport === null
        ? ""
        : ` It reappeared in ${Math.round(e.bootstrapSupport * 100)}% of configured subsamples.`;
  return `This loop persists ${n}. One representative connects ${i}.${r} Consider writing a synthesis that explains whether the loop should remain open or be filled.`;
}
function Fo(s) {
  let t = new Set(s.map((e) => (e.includes("/") ? e.slice(0, e.indexOf("/")) : "")));
  return s.length <= 1 ? 0 : Math.min(1, (t.size - 1) / (s.length - 1));
}
function Ao(s) {
  return s <= 3 ? 1 : Math.max(0, 1 - (s - 3) / 8);
}
function Lo(s, t) {
  return s.lifetime === null ? 1 : t <= 0 ? 0 : Math.min(1, s.lifetime / t);
}
function Ho(s) {
  let t = s.flatMap((e) => [e.birth, ...(e.death === null ? [] : [e.death])]);
  return t.length === 0 ? 0 : Math.max(...t) - Math.min(...t);
}
function $o(s, t) {
  let e = new Map([...s.nodes.keys()].map((i) => [$(i), i])),
    n = new Set();
  for (let i of t.simplices) i.split("|").forEach((r) => n.add(r));
  return [...n].map((i) => e.get(i) ?? i).sort();
}
function fs(s) {
  return Object.values(s.scoreComponents).reduce((t, e) => t + e, 0);
}
function ce(s) {
  let t = Math.round(s * 1e3) / 1e3;
  return t === 0 ? 0 : t;
}
function Oo(s) {
  return s.replace(/\.md$/, "");
}
var vs = { 0: "H\u2080 \u2014 connected pieces", 1: "H\u2081 \u2014 loops", 2: "H\u2082 \u2014 voids" },
  gt = class extends J.ItemView {
    constructor(e, n, i, r, o) {
      super(e);
      this.model = n;
      this.settings = i;
      this.service = r;
      this.highlightBus = o;
      this.tab = "barcode";
      this.showZeroLength = !1;
      this.selectedIntervalId = null;
      this.unsubscribe = null;
      this.unsubscribeSelect = null;
      this.state = null;
    }
    getViewType() {
      return Te;
    }
    getDisplayText() {
      return "Persistence X-ray";
    }
    getIcon() {
      return "bar-chart-horizontal";
    }
    async onOpen() {
      (await Promise.resolve(),
        (this.unsubscribe = this.service.subscribe((e) => {
          ((this.state = e), this.render());
        })),
        (this.unsubscribeSelect = this.highlightBus.onSelect((e) => {
          ((this.selectedIntervalId = e), this.render());
        })),
        this.service.request(this.config()));
    }
    async onClose() {
      (this.service.cancel(),
        this.highlightBus.highlight(null),
        this.unsubscribe?.(),
        this.unsubscribeSelect?.(),
        await Promise.resolve());
    }
    refresh() {
      this.service.request(this.config());
    }
    config() {
      return {
        ...Z,
        metric: this.settings.renderFilterMetric ?? Z.metric,
        bootstrap: {
          ...Z.bootstrap,
          enabled: this.settings.enableBootstrapUncertainty ?? !1,
          sampleCount: this.settings.bootstrapSampleCount ?? Z.bootstrap.sampleCount,
        },
        limits: { ...Z.limits, maxSimplices: this.settings.topologyMaxSimplices ?? Z.limits.maxSimplices },
      };
    }
    render() {
      let { contentEl: e } = this;
      (e.empty(),
        e.createDiv({ cls: "simplicial-panel-title", text: "Persistence X-ray" }),
        e.createDiv({
          cls: "simplicial-explanation-tension",
          text: "Which shapes in your vault survive as the evidence threshold moves. A long bar is a feature that does not depend on where you drew the line; a short one does.",
        }),
        this.renderControls(e));
      let n = this.state;
      if (!n || n.status === "idle") {
        e.createDiv({ cls: "simplicial-panel-value", text: "Nothing computed yet." });
        return;
      }
      if (n.status === "running") {
        this.renderRunning(e, n);
        return;
      }
      if (n.status === "failed" && n.failure) {
        this.renderFailure(e, n);
        return;
      }
      let i = n.result;
      if (!i) return;
      this.renderProvenance(e, n);
      let r = i.intervals.filter((o) => this.showZeroLength || o.lifetime === null || o.lifetime > 0);
      if (r.length === 0) {
        e.createDiv({
          cls: "simplicial-measure-reading",
          text: "No classes at any threshold. This vault's relations form a shape with nothing to persist \u2014 not an error, and not a claim that the notes are unrelated.",
        });
        return;
      }
      (this.tab === "barcode" ? this.renderBarcode(e, r, i.representatives) : this.renderDiagram(e, r),
        this.renderGaps(e));
    }
    renderControls(e) {
      let n = e.createDiv({ cls: "simplicial-persistence-tabs" });
      (["barcode", "diagram"].forEach((i) => {
        let r = n.createEl("button", {
          cls: `simplicial-persistence-tab${this.tab === i ? " is-active" : ""}`,
          text: i === "barcode" ? "Barcode" : "Diagram",
        });
        (r.setAttr("aria-pressed", String(this.tab === i)),
          (r.onclick = () => {
            ((this.tab = i), this.render());
          }));
      }),
        new J.Setting(e)
          .setName("Show zero-length bars")
          .setDesc(
            "Classes born and killed at the same threshold. Kept for verification; hidden by default because they describe the tie policy, not the vault.",
          )
          .addToggle((i) => {
            (i.setValue(this.showZeroLength),
              i.onChange((r) => {
                ((this.showZeroLength = r), this.render());
              }));
          }),
        new J.Setting(e).addButton((i) => {
          (i.setButtonText("Recompute"), i.onClick(() => this.service.request(this.config())));
        }));
    }
    renderRunning(e, n) {
      let i = {
        building: "Building the filtered complex",
        reducing: "Reducing the boundary matrix",
        witnesses: "Collecting cycle witnesses",
        uncertainty: "Resampling for empirical stability",
      }[n.phase ?? "building"];
      (e.createDiv({ cls: "simplicial-measure-reading", text: `${i}\u2026 ${Math.round(n.fraction * 100)}%` }),
        n.result &&
          e.createDiv({
            cls: "simplicial-panel-value",
            text: "The bars below are from the previous run and are stale until this finishes.",
          }),
        new J.Setting(e).addButton((r) => {
          (r.setButtonText("Cancel"), r.onClick(() => this.service.cancel()));
        }));
    }
    renderFailure(e, n) {
      let i = n.failure;
      i &&
        (e.createDiv({ cls: "simplicial-panel-section-label", text: "Computation did not finish" }),
        e.createDiv({ cls: "simplicial-measure-reading", text: i.message }),
        e.createDiv({
          cls: "simplicial-panel-value",
          text: `Phase: ${i.phase} \xB7 ${i.simplexCount.toLocaleString()} simplices over ${i.vertexCount.toLocaleString()} notes.`,
        }),
        new J.Setting(e).addButton((r) => {
          (r.setButtonText(i.reason === "engine-error" ? "Restart engine and retry" : "Retry"),
            r.onClick(() => {
              (i.reason === "engine-error" && this.service.restartWorker(), this.service.request(this.config()));
            }));
        }));
    }
    renderProvenance(e, n) {
      let i = n.result;
      if (!i) return;
      let r = [
        `metric ${i.metric}`,
        `${i.direction} filtration`,
        `coefficients ${i.coefficientField}`,
        `through H${i.maxDimension}`,
        `tie policy ${i.tiePolicy}`,
        n.execution === "worker" ? "computed off the main thread" : "computed on the main thread (no worker available)",
      ];
      if ((e.createDiv({ cls: "simplicial-panel-value", text: r.join(" \xB7 ") }), i.repairs.length > 0)) {
        let o = e.createEl("details", { cls: "simplicial-persistence-repairs" });
        (o.createEl("summary", { text: `${i.repairs.length} filtration values were delayed to keep faces first` }),
          i.repairs.slice(0, 20).forEach((a) => {
            o.createDiv({
              cls: "simplicial-panel-value",
              text: `${a.simplexKey.split("|").join(" \xB7 ")} moved ${a.rawValue.toFixed(2)} \u2192 ${a.repairedValue.toFixed(2)} because of ${a.faceKey.split("|").join(" \xB7 ")}`,
            });
          }));
      }
      i.uncertainty &&
        (e.createDiv({ cls: "simplicial-measure-reading", text: i.uncertainty.samplingScheme }),
        e.createDiv({
          cls: "simplicial-panel-value",
          text: `${i.uncertainty.completedSamples} of ${i.uncertainty.requestedSamples} resamples completed${i.uncertainty.truncated ? " (budget reached)" : ""} \xB7 ${Math.round(i.uncertainty.unmatchedRate * 100)}% of resampled features had no counterpart in the full diagram. This is empirical stability, not a confidence band.`,
        }));
    }
    renderBarcode(e, n, i) {
      let r = new Map(i.map((a) => [a.intervalId, a])),
        o = bs(n);
      for (let a of [...new Set(n.map((l) => l.dimension))].sort()) {
        let l = e.createDiv({ cls: "simplicial-barcode-lane" });
        l.createDiv({ cls: "simplicial-panel-section-label", text: vs[a] ?? `H${a}` });
        let c = l.createEl("ul", { cls: "simplicial-barcode-list" });
        (c.setAttr("role", "listbox"), c.setAttr("aria-label", vs[a] ?? `H${a}`));
        for (let u of n.filter((d) => d.dimension === a)) {
          let d = r.get(u.id),
            p = c.createEl("li", {
              cls: `simplicial-barcode-row${this.selectedIntervalId === u.id ? " is-selected" : ""}${u.death === null ? " is-essential" : ""}`,
            });
          (p.setAttr("role", "option"),
            p.setAttr("tabindex", "0"),
            p.setAttr("aria-selected", String(this.selectedIntervalId === u.id)),
            p.setAttr("aria-label", nn(u, d)));
          let m = p.createDiv({ cls: "simplicial-barcode-track" }).createDiv({ cls: "simplicial-barcode-bar" }),
            g = o.size === 0 ? 0 : ((u.birth - o.min) / o.size) * 100,
            f = u.death === null || o.size === 0 ? 100 : ((u.death - o.min) / o.size) * 100;
          (m.setAttr("style", `left:${g.toFixed(2)}%;width:${Math.max(1.5, f - g).toFixed(2)}%`),
            p.createSpan({ cls: "simplicial-barcode-caption", text: nn(u, d) }));
          let v = () => this.select(u, d ?? null);
          ((p.onclick = v),
            (p.onfocus = v),
            (p.onkeydown = (y) => {
              (y.key !== "Enter" && y.key !== " ") || (y.preventDefault(), v());
            }));
        }
      }
      this.selectedIntervalId && this.renderWitness(e, n, r);
    }
    renderWitness(e, n, i) {
      let r = n.find((l) => l.id === this.selectedIntervalId);
      if (!r) return;
      let o = e.createDiv({ cls: "simplicial-persistence-witness" });
      o.createDiv({ cls: "simplicial-panel-section-label", text: "Representative cycle" });
      let a = i.get(r.id);
      if (!a) {
        o.createDiv({
          cls: "simplicial-measure-reading",
          text:
            r.dimension === 0
              ? "Dimension 0 classes are connected pieces; the panel names components directly rather than returning a single-vertex witness."
              : "No witness was retained for this bar. Enable witness tracking and recompute to inspect one.",
        });
        return;
      }
      (o.createDiv({
        cls: "simplicial-measure-reading",
        text: "One valid representative, not the only one and not the shortest. Another reduction of the same data would return a different cycle for the same class.",
      }),
        a.simplices.forEach((l) => {
          o.createDiv({ cls: "simplicial-panel-value", text: l.split("|").join(" \xB7 ") });
        }),
        r.deathSimplex &&
          o.createDiv({
            cls: "simplicial-measure-reading",
            text: `Killed at ${r.death?.toFixed(2)} by ${r.deathSimplex.split("|").join(" \xB7 ")}, which fills this class in.`,
          }));
    }
    renderDiagram(e, n) {
      let i = bs(n),
        r = e.createDiv({ cls: "simplicial-persistence-diagram" });
      (r.setAttr("role", "img"),
        r.setAttr(
          "aria-label",
          `Persistence diagram: ${n.length} classes. Points far from the diagonal persist across more of the filtration.`,
        ));
      for (let o of n) {
        let a = r.createDiv({
            cls: `simplicial-diagram-point is-dim-${o.dimension}${o.death === null ? " is-essential" : ""}${this.selectedIntervalId === o.id ? " is-selected" : ""}`,
          }),
          l = i.size === 0 ? 0 : ((o.birth - i.min) / i.size) * 100,
          c = o.death === null || i.size === 0 ? 100 : ((o.death - i.min) / i.size) * 100;
        (a.setAttr("style", `left:${l.toFixed(2)}%;bottom:${c.toFixed(2)}%`), a.setAttr("title", nn(o, void 0)));
      }
      e.createDiv({
        cls: "simplicial-panel-value",
        text: "Essential classes are drawn at the top edge; they never die inside the analyzed complex and have no finite death coordinate.",
      });
    }
    renderGaps(e) {
      let n = this.state?.result;
      if (!n) return;
      let i = ys(this.model, n),
        r = e.createDiv({ cls: "simplicial-persistence-gaps" });
      if ((r.createDiv({ cls: "simplicial-panel-section-label", text: "Gaps to write" }), i.length === 0)) {
        r.createDiv({
          cls: "simplicial-measure-reading",
          text: "No loop cleared the lifetime and witness thresholds. Nothing here is a claim that your vault has no gaps \u2014 only that none met the stated bar.",
        });
        return;
      }
      i.forEach((o) => this.renderGap(r, o));
    }
    renderGap(e, n) {
      let i = e.createDiv({ cls: "simplicial-gap-card" });
      i.createDiv({ cls: "simplicial-measure-reading", text: n.explanation.claim });
      let r = i.createEl("details");
      (r.createEl("summary", { text: "Why this ranked here" }),
        Object.entries(n.explanation.scoreComponents).forEach(([a, l]) => {
          r.createDiv({ cls: "simplicial-panel-value", text: `${Ko(a)}: ${l >= 0 ? "+" : ""}${l}` });
        }));
      let o = i.createEl("details");
      (o.createEl("summary", { text: "What this does not prove" }),
        n.explanation.uncertainty.forEach((a) => {
          o.createDiv({ cls: "simplicial-panel-value", text: a });
        }),
        new J.Setting(i).addButton((a) => {
          (a.setButtonText("Show on canvas"),
            a.onClick(() => {
              ((this.selectedIntervalId = n.intervalId),
                this.highlightBus.highlight({
                  intervalId: n.intervalId,
                  dimension: 1,
                  simplexKeys: n.witnessKeys,
                  nodeIds: n.nodes,
                }),
                this.render());
            }));
        }));
    }
    select(e, n) {
      ((this.selectedIntervalId = e.id),
        this.highlightBus.highlight(
          n
            ? {
                intervalId: e.id,
                dimension: n.dimension,
                simplexKeys: n.simplices,
                nodeIds: [...new Set(n.simplices.flatMap((i) => i.split("|")))],
              }
            : null,
        ),
        this.render());
    }
  };
function nn(s, t) {
  let e =
      s.death === null
        ? `born ${s.birth.toFixed(2)}, never dies`
        : `${s.birth.toFixed(2)} \u2192 ${s.death.toFixed(2)}`,
    n = t ? ` \xB7 ${t.simplices.length} relations` : "";
  return `H${s.dimension} ${e}${n}`;
}
function bs(s) {
  let t = s.flatMap((i) => [i.birth, ...(i.death === null ? [] : [i.death])]);
  if (t.length === 0) return { min: 0, max: 1, size: 1 };
  let e = Math.min(...t),
    n = Math.max(...t);
  return { min: e, max: n, size: n - e };
}
function Ko(s) {
  return s.replace(/([A-Z])/g, " $1").replace(/^./, (t) => t.toUpperCase());
}
var T = require("obsidian");
var Bo = ["manual", "folder", "tag", "query", "moc"],
  ft = class extends T.ItemView {
    constructor(e, n, i, r) {
      super(e);
      this.model = n;
      this.settings = i;
      this.onChanged = r;
      this.scratch = new Map();
      this.showDerivedSeeds = !1;
      this.compareNodeId = null;
    }
    getViewType() {
      return Re;
    }
    getDisplayText() {
      return "Contextuality lab";
    }
    getIcon() {
      return "combine";
    }
    async onOpen() {
      (await Promise.resolve(), this.render());
    }
    refresh() {
      this.render();
    }
    revealDiscoverySuggestions() {
      ((this.showDerivedSeeds = !0), this.render());
    }
    render() {
      let { contentEl: e } = this;
      (e.empty(),
        e.createDiv({ cls: "simplicial-panel-title", text: "Contextuality lab" }),
        e.createDiv({
          cls: "simplicial-explanation-tension",
          text: "Use this after you have overlapping groups. A context is one viewpoint (for example a project, folder, or theme). Give the same note a role in each viewpoint; the lab then shows whether those local readings agree when combined.",
        }));
      let n = e.createEl("details", { cls: "simplicial-sheaf-guide" });
      (n.createEl("summary", { text: "What to expect here" }),
        n.createEl("p", {
          text: "Start by adding suggested context seeds. In each context, assign roles only where they make sense. The report will show either a compatible shared reading, a direct local disagreement, or contextuality: every overlap looks compatible on its own, but all viewpoints cannot be combined at once. Suggestions are hypotheses and never change your notes automatically.",
        }),
        n.createEl("p", {
          text: "Role vocabulary: action = something being done; project = organized work; research = investigation; idea = a concept or proposal; creative = an expressive work; reference = supporting material. Every role is local to one context and can be corrected.",
        }));
      let i = je(this.settings);
      (ct(e, this.app),
        this.renderSuggestions(e, i),
        this.renderCreator(e, i),
        this.renderReport(e, i),
        i.contexts.forEach((r) => this.renderContext(e, i, r.id)),
        this.renderAudit(e, i));
    }
    renderSuggestions(e, n) {
      let i = Kn(this.app, this.model, n.contexts),
        r = e.createDiv({ cls: "simplicial-sheaf-suggestions" });
      (r.createDiv({ cls: "simplicial-panel-section-label", text: "Suggested starting cover" }),
        r.createDiv({
          cls: "simplicial-measure-reading",
          text: i.length
            ? "Each worksheet includes a deterministic first draft from authored overlap and note metadata. Add it, then rename it and correct any local role that does not fit."
            : "No new overlapping authored relations are available as context seeds.",
        }),
        i.forEach(({ context: o, reason: a, initialRoles: l }) => {
          new T.Setting(r)
            .setName(o.name)
            .setDesc(`${a} Starter roles: ${this.roleSummary(l)}.`)
            .addButton((c) => {
              (c.setButtonText("Add worksheet"),
                c.onClick(() => {
                  (async () => {
                    (n.contexts.push(o),
                      (n.sections[o.id] = { ...l }),
                      O(n, { action: "context-added", contextId: o.id, after: o.name, reason: a }),
                      await this.persist(n));
                  })();
                }));
            });
        }),
        new T.Setting(r)
          .setName("Folder and tag seeds")
          .setDesc("Optional filing-system hints, ranked by overlap. They are never added automatically.")
          .addButton((o) => {
            (o.setButtonText(this.showDerivedSeeds ? "Hide" : "Discover"),
              o.onClick(() => {
                ((this.showDerivedSeeds = !this.showDerivedSeeds), this.render());
              }));
          }),
        this.showDerivedSeeds &&
          Bn(this.app, this.model, n.contexts).forEach(({ context: o, reason: a, initialRoles: l }) => {
            new T.Setting(r)
              .setName(`${o.source}: ${o.name}`)
              .setDesc(`${a} Starter roles: ${this.roleSummary(l)}.`)
              .addButton((c) => {
                (c.setButtonText("Add worksheet"),
                  c.onClick(async () => {
                    (n.contexts.push(o),
                      (n.sections[o.id] = { ...l }),
                      O(n, { action: "context-added", contextId: o.id, after: o.name, reason: a }),
                      await this.persist(n));
                  }));
              });
          }));
    }
    renderCreator(e, n) {
      let i = e.createDiv({ cls: "simplicial-sheaf-create" });
      i.createDiv({ cls: "simplicial-panel-section-label", text: "Define context" });
      let r = "",
        o = "manual",
        a = "",
        l = new Set();
      (new T.Setting(i).setName("Name").addText((d) => d.onChange((p) => (r = p.trim()))),
        new T.Setting(i).setName("Source").addDropdown((d) => {
          (Bo.forEach((p) => {
            d.addOption(p, p === "moc" ? "MOC note" : p);
          }),
            d.setValue(o),
            d.onChange((p) => (o = p)));
        }),
        new T.Setting(i)
          .setName("Definition")
          .setDesc(
            "Folder path or tag for a derived seed, or a query or map-of-content description for an explicit selection.",
          )
          .addText((d) => d.onChange((p) => (a = p.trim()))));
      let c = An(this.model),
        u = i.createDiv({ cls: "simplicial-sheaf-relations" });
      (c.forEach((d) => {
        new T.Setting(u).setName(this.relationLabel(d)).addToggle((p) => {
          p.onChange((h) => (h ? l.add(d) : l.delete(d)));
        });
      }),
        new T.Setting(i).addButton((d) => {
          (d.setButtonText("Add context").setCta(),
            d.onClick(async () => {
              if (!r) {
                new T.Notice("Give the context a name first.");
                return;
              }
              let p = (o === "folder" || o === "tag") && a ? Bt(this.app, this.model, o, a, n.contexts) : null,
                h = l.size > 0 ? [...l] : (p?.relations ?? []);
              if (h.length === 0) {
                new T.Notice("Select at least one relation, or use a folder/tag that matches one.");
                return;
              }
              let m = ye(r, n.contexts);
              (n.contexts.push({ id: m, name: r, source: o, definition: a, relations: [...new Set(h)].sort() }),
                (n.sections[m] = {}),
                O(n, {
                  action: "context-added",
                  contextId: m,
                  after: r,
                  reason: "Explicitly accepted in Contextuality Lab.",
                }),
                await this.persist(n));
            }));
        }));
    }
    renderReport(e, n) {
      let i = fe(this.model, n, Y(this.app, this.model)),
        r = se(this.model, i),
        o = e.createDiv({ cls: "simplicial-sheaf-report" });
      (o.createDiv({ cls: "simplicial-panel-section-label", text: "Gluing report" }),
        o.createDiv({
          cls: "simplicial-panel-value",
          text: `Global baseline dimension ${r.gluing.globalBaselineDimension} \xB7 obstruction rank ${r.gluing.obstructionRank} \xB7 contextual fraction ${r.fraction.value.toFixed(2)}${r.fraction.exact ? "" : " lower bound"}`,
        }),
        r.obstructions.length === 0
          ? o.createDiv({ cls: "simplicial-measure-reading", text: "No gluing obstruction detected." })
          : r.obstructions.forEach((a) => {
              let l = a.contexts.map((c) => n.contexts.find((u) => u.id === c)?.name ?? c);
              o.createDiv({
                cls: "simplicial-obstruction-reading",
                text: r.gluing.contextualityDetected
                  ? `${a.nodes.map(H).join(" \xB7 ")} are pairwise compatible, but cannot be read together across ${l.join(" \u2194 ")}.`
                  : `${a.nodes.map(H).join(" \xB7 ")} cannot be reconciled across ${l.join(" \u2194 ")}; local disagreements are listed separately below.`,
              });
            }),
        r.gluing.pairwiseDisagreements.forEach((a) => {
          o.createDiv({
            cls: "simplicial-measure-reading",
            text: `Local disagreement between ${a.a} and ${a.b}: ${a.disagreeingNodes.map(H).join(" \xB7 ")}. This is not contextuality.`,
          });
        }),
        this.renderRefinements(o, n, i));
    }
    renderRefinements(e, n, i) {
      let r = Fn(this.model, i);
      r.length !== 0 &&
        (e.createDiv({ cls: "simplicial-panel-section-label", text: "Try a local refinement" }),
        e.createDiv({
          cls: "simplicial-measure-reading",
          text: "These are counterfactual improvements, not claims about meaning. Apply one only if the proposed local reading is accurate.",
        }),
        r.forEach((o, a) => {
          let l = n.contexts.find((u) => u.id === o.contextId);
          new T.Setting(e)
            .setName(`${a === 0 ? "Most consequential \xB7 " : ""}${H(o.nodeId)} in ${l?.name ?? o.contextId}`)
            .setDesc(
              `${o.from} \u2192 ${o.to}; obstruction rank ${o.before.obstructionRank} \u2192 ${o.after.obstructionRank}; contextual fraction ${o.before.contextualFraction.toFixed(2)} \u2192 ${o.after.contextualFraction.toFixed(2)}${o.before.contextualityDetected && !o.after.contextualityDetected ? "; converts a global-reconciliation candidate into a directly inspectable local disagreement" : ""}.`,
            )
            .addButton((u) => {
              (u.setButtonText("Try in scratch"),
                u.onClick(() => {
                  (this.scratch.set(`${o.contextId}\0${o.nodeId}`, o.to), this.render());
                }));
            });
        }),
        this.scratch.size > 0 && this.renderScratch(e, n));
    }
    renderScratch(e, n) {
      let i = e.createDiv({ cls: "simplicial-sheaf-scratch" });
      i.createDiv({ cls: "simplicial-panel-section-label", text: `Scratch changes (${this.scratch.size})` });
      let r = {
        contexts: n.contexts,
        sections: Object.fromEntries(Object.entries(n.sections).map(([a, l]) => [a, { ...l }])),
        audit: n.audit,
      };
      this.scratch.forEach((a, l) => {
        var d;
        let [c, u] = l.split("\0");
        ((d = r.sections)[c] ?? (d[c] = {}), (r.sections[c][u] = a));
      });
      let o = se(this.model, fe(this.model, r, Y(this.app, this.model)));
      (i.createDiv({
        cls: "simplicial-measure-reading",
        text: `Temporary simultaneous readings: obstruction rank ${o.gluing.obstructionRank}, contextual fraction ${o.fraction.value.toFixed(2)}. Accept all to persist and audit them, or discard without changing plugin data.`,
      }),
        new T.Setting(i)
          .addButton((a) =>
            a
              .setButtonText("Accept all")
              .setCta()
              .onClick(async () => {
                (this.scratch.forEach((l, c) => {
                  var h;
                  let [u, d] = c.split("\0");
                  (h = n.sections)[u] ?? (h[u] = {});
                  let p = n.sections[u][d];
                  ((n.sections[u][d] = l),
                    O(n, {
                      action: "role-refined",
                      contextId: u,
                      nodeId: d,
                      before: p,
                      after: l,
                      reason: "Accepted after simultaneous scratch comparison.",
                    }));
                }),
                  this.scratch.clear(),
                  await this.persist(n));
              }),
          )
          .addButton((a) =>
            a
              .setButtonText("Discard scratch")
              .setDestructive()
              .onClick(() => {
                (this.scratch.clear(), this.render());
              }),
          ));
    }
    renderContext(e, n, i) {
      let r = n.contexts.find((p) => p.id === i);
      if (!r) return;
      let o = e.createDiv({ cls: "simplicial-sheaf-context" }),
        a = o.createDiv({ cls: "simplicial-sheaf-context-head" });
      (a.createEl("strong", { text: r.name }),
        a.createSpan({ text: `${r.source}${r.definition ? ` \xB7 ${r.definition}` : ""}` }));
      let l = F(this.model, r);
      (Object.keys(n.sections[r.id] ?? {}).length === 0 &&
        l.length > 0 &&
        new T.Setting(o)
          .setName("This worksheet has no local readings yet")
          .setDesc(
            "Create an editable first draft from note tags and paths. This is a starting point, not a conclusion.",
          )
          .addButton((p) => {
            (p.setButtonText("Prepare starter worksheet").setCta(),
              p.onClick(async () => {
                let h = Ve(this.app, this.model, r),
                  m = r.name;
                (/^inferred relation$/i.test(r.name) &&
                  ((r.name = l.map(H).join(" \xB7 ")),
                  (r.definition = `Overlapping relation among ${r.name}. Deterministic draft; rename and refine it.`),
                  O(n, {
                    action: "context-refined",
                    contextId: r.id,
                    before: m,
                    after: r.name,
                    reason: "Accepted a descriptive participant-based starter name.",
                  })),
                  (n.sections[r.id] = { ...h }),
                  Object.entries(h).forEach(([g, f]) =>
                    O(n, {
                      action: "role-refined",
                      contextId: r.id,
                      nodeId: g,
                      after: f,
                      reason: "Accepted deterministic starter role from note metadata; remains editable.",
                    }),
                  ),
                  await this.persist(n));
              }));
          }),
        n.contexts
          .filter((p) => p.id !== r.id)
          .map((p) => ({ other: p, nodes: l.filter((h) => F(this.model, p).includes(h)) }))
          .filter((p) => p.nodes.length > 0)
          .forEach(({ other: p, nodes: h }) => {
            (o.createDiv({
              cls: "simplicial-context-overlap",
              text: `Intersection with ${p.name}: ${h.map(H).join(" \xB7 ")}`,
            }),
              o.createDiv({
                cls: "simplicial-measure-reading",
                text: `Useful because ${h.length} shared note${h.length === 1 ? " carries" : "s carry"} readings that can be tested for agreement.`,
              }));
          }));
      let d = fe(this.model, n, Y(this.app, this.model)).sections.get(r.id);
      if (
        (l.forEach((p) => {
          let h = new T.Setting(o)
            .setName(H(p))
            .setDesc("Role inside this context only\u2014not the note's permanent identity.");
          (h.addDropdown((m) => {
            (U.forEach((g) => {
              m.addOption(g, g);
            }),
              m.setValue(d?.get(p) ?? "reference"),
              m.onChange((g) => {
                (async () => {
                  var v, y;
                  (v = n.sections)[(y = r.id)] ?? (v[y] = {});
                  let f = n.sections[r.id][p];
                  ((n.sections[r.id][p] = g),
                    O(n, {
                      action: "role-refined",
                      contextId: r.id,
                      nodeId: p,
                      before: f,
                      after: g,
                      reason: "Explicit role selection.",
                    }),
                    await this.persist(n));
                })();
              }));
          }),
            h.addButton((m) =>
              m.setButtonText("Compare readings").onClick(() => {
                ((this.compareNodeId = p), this.render());
              }),
            ));
        }),
        this.compareNodeId && l.includes(this.compareNodeId))
      ) {
        let p = Y(this.app, this.model),
          h = o.createDiv({ cls: "simplicial-sheaf-comparison" });
        (h.createDiv({ cls: "simplicial-panel-section-label", text: `Readings of ${H(this.compareNodeId)}` }),
          _n(this.model, n, p, this.compareNodeId).forEach((m) => {
            h.createDiv({ text: `${m.contextName}: ${m.role} \xB7 ${m.provenance}` });
          }));
      }
      (this.renderContextRestructuring(o, n, r.id),
        new T.Setting(o).addButton((p) => {
          (p.setButtonText("Delete context").setDestructive(),
            p.onClick(async () => {
              (O(n, {
                action: "context-deleted",
                contextId: r.id,
                before: r.name,
                reason: "Explicitly deleted in Contextuality Lab.",
              }),
                (n.contexts = n.contexts.filter((h) => h.id !== r.id)),
                delete n.sections[r.id],
                await this.persist(n));
            }));
        }));
    }
    renderContextRestructuring(e, n, i) {
      let r = n.contexts.find((a) => a.id === i);
      if (!r) return;
      r.relations.length > 1 &&
        new T.Setting(e)
          .setName("Split suggestion")
          .setDesc("Review one relation as its own context; the current context remains unchanged until accepted.")
          .addButton((a) => {
            a.setButtonText("Accept split seed").onClick(async () => {
              let l = r.relations[r.relations.length - 1],
                c = ye(`${r.name} split`, n.contexts);
              (n.contexts.push({
                ...r,
                id: c,
                name: `${r.name} split`,
                source: "manual",
                definition: "Accepted split suggestion",
                relations: [l],
              }),
                (n.sections[c] = { ...(n.sections[r.id] ?? {}) }),
                O(n, {
                  action: "context-refined",
                  contextId: c,
                  before: r.id,
                  after: c,
                  reason: "Accepted context split seed.",
                }),
                await this.persist(n));
            });
          });
      let o = n.contexts.find((a) => a.id !== r.id && F(this.model, a).some((l) => F(this.model, r).includes(l)));
      o &&
        new T.Setting(e)
          .setName(`Merge suggestion: ${o.name}`)
          .setDesc("The contexts overlap. Accepting creates a new combined context and preserves both originals.")
          .addButton((a) => {
            a.setButtonText("Accept merge seed").onClick(async () => {
              let l = ye(`${r.name} + ${o.name}`, n.contexts);
              (n.contexts.push({
                id: l,
                name: `${r.name} + ${o.name}`,
                source: "manual",
                definition: "Accepted merge suggestion",
                relations: [...new Set([...r.relations, ...o.relations])].sort(),
              }),
                (n.sections[l] = { ...(n.sections[o.id] ?? {}), ...(n.sections[r.id] ?? {}) }),
                O(n, {
                  action: "context-refined",
                  contextId: l,
                  before: `${r.id},${o.id}`,
                  after: l,
                  reason: "Accepted context merge seed.",
                }),
                await this.persist(n));
            });
          });
    }
    async persist(e) {
      (Hn(this.settings, e), await this.onChanged(), this.render());
    }
    renderAudit(e, n) {
      let i = e.createDiv({ cls: "simplicial-sheaf-audit" });
      i.createDiv({ cls: "simplicial-panel-section-label", text: "Accepted refinement audit trail" });
      let r = n.audit.slice(-20).reverse();
      (r.length === 0 && i.createDiv({ cls: "simplicial-measure-reading", text: "No accepted refinements yet." }),
        r.forEach((o) =>
          i.createDiv({
            cls: "simplicial-measure-reading",
            text: `${new Date(o.at).toLocaleString()} \xB7 ${o.action} \xB7 ${o.nodeId ? `${H(o.nodeId)} \xB7 ` : ""}${o.before ?? "\u2205"} \u2192 ${o.after ?? "\u2205"} \xB7 ${o.reason}`,
          }),
        ));
    }
    relationLabel(e) {
      if (e.startsWith("h:")) {
        let r = this.model.getHyperedge(e);
        return `\u25C7 ${r?.label?.trim() || r?.nodes.map(H).join(" \xB7 ") || e}`;
      }
      let n = e.startsWith("s:") ? e.slice(2) : e,
        i = this.model.getSimplex(n);
      return `\u25B3 ${i?.label?.trim() || i?.nodes.map(H).join(" \xB7 ") || e}`;
    }
    roleSummary(e) {
      let n = Object.entries(e);
      if (n.length === 0) return "none available";
      let i = n.slice(0, 4).map(([r, o]) => `${H(r)} \u2192 ${o}`);
      return `${i.join("; ")}${n.length > i.length ? `; +${n.length - i.length} more` : ""}`;
    }
  };
function H(s) {
  return s.split("/").pop()?.replace(/\.md$/, "") ?? s;
}
var xs = require("obsidian");
var yt = class extends xs.ItemView {
  constructor(e, n, i, r, o, a, l, c) {
    super(e);
    this.model = n;
    this.renderer = i;
    this.settings = r;
    this.onSettingsChanged = o;
    this.actions = l;
    this.history = c;
    this.filtrationEvents = [];
    this.persistenceEvents = [];
    this.eventMarkers = [];
    this.sliderWrap = null;
    this.sliderEl = null;
    ((this.onRescan = a),
      this.computeFiltrationEvents(),
      this.model.subscribe(() => {
        this.computeFiltrationEvents();
      }));
  }
  setRescanCallback(e) {
    this.onRescan = e;
  }
  computeFiltrationEvents() {
    if (!this.settings.showFiltrationSlider) {
      this.sliderWrap && this.sliderWrap.addClass("simplicial-hidden");
      return;
    }
    (this.sliderWrap && this.sliderWrap.removeClass("simplicial-hidden"),
      (this.filtrationEvents = un(this.model, this.settings.renderFilterMetric)),
      this.updateEventMarkers());
  }
  refreshSettings() {
    this.computeFiltrationEvents();
  }
  setPersistenceEvents(e) {
    ((this.persistenceEvents = e), this.updateEventMarkers());
  }
  getViewType() {
    return Me;
  }
  getDisplayText() {
    return "Simplicial graph";
  }
  async onOpen() {
    await Promise.resolve();
    let { contentEl: e } = this;
    (e.empty(), e.addClass("simplicial-view"));
    let n = e.createDiv({ cls: "simplicial-view-wrap" }),
      i = e.createDiv({ cls: "simplicial-hud" }),
      r = e.createDiv({ cls: "simplicial-legend" });
    (this.renderFiltrationControls(i), this.renderLegend(r));
    let o = e.createDiv({ cls: "simplicial-filters" });
    (this.addFilterToggle(
      o,
      "edges",
      () => this.settings.showEdges,
      (a) => (this.settings.showEdges = a),
    ),
      this.addFilterToggle(
        o,
        "clusters",
        () => this.settings.showClusters,
        (a) => (this.settings.showClusters = a),
      ),
      this.addFilterToggle(
        o,
        "cores",
        () => this.settings.showCores,
        (a) => (this.settings.showCores = a),
      ),
      this.renderFloatingControls(e),
      this.renderExploreActions(e),
      this.renderer.init(n));
  }
  renderExploreActions(e) {
    if (!this.actions) return;
    let n = e.createDiv({ cls: "simplicial-explore" }),
      i = n.createDiv({ cls: "simplicial-explore-copy" });
    (i.createSpan({ cls: "simplicial-explore-title", text: "Explore" }),
      i.createSpan({ cls: "simplicial-explore-hint", text: "Discover groups, then review what the plugin suggests" }));
    let r = n.createEl("button", { cls: "simplicial-explore-action mod-cta", text: "Find expressive view" });
    ((r.title =
      "Turn on all evidence sources, choose balanced discovery thresholds, and reveal suggested links, groups, and encounters. Missing-face display stays off. Nothing is confirmed or written to notes."),
      r.setAttr("aria-label", r.title),
      r.addEventListener("click", () => {
        (async () => {
          ((r.disabled = !0), r.setText("Discovering\u2026"));
          try {
            await this.actions?.findExpressiveView();
          } finally {
            ((r.disabled = !1), r.setText("Find expressive view"));
          }
        })();
      }));
    let o = n.createEl("button", { cls: "simplicial-explore-action" });
    (o.createSpan({ cls: "simplicial-explore-glyph", text: "\u25C7", attr: { "aria-hidden": "true" } }),
      o.createSpan({ text: "Record encounter" }),
      (o.title = "Record several notes as one meaningful group; this does not imply pairwise links."),
      o.setAttr("aria-label", o.title),
      o.addEventListener("click", () => this.actions?.recordEncounter()));
    let a = n.createEl("button", { cls: "simplicial-explore-action", text: "Contextuality" });
    ((a.title = "Compare overlapping groups to find interpretations that cannot be reconciled globally."),
      a.setAttr("aria-label", a.title),
      a.addEventListener("click", () => this.actions?.openContextuality()),
      this.renderJourneyReplay(n));
  }
  renderJourneyReplay(e) {
    let n = this.history?.all().sort((c, u) => c.timestamp - u.timestamp) ?? [];
    if (n.length === 0) return;
    let i = e.createDiv({ cls: "simplicial-replay" }),
      r = i.createSpan({ cls: "simplicial-replay-label", text: "Now" }),
      o = i.createEl("input", { type: "range" });
    ((o.min = "0"),
      (o.max = String(n.length)),
      (o.step = "1"),
      (o.value = String(n.length)),
      (o.title = "Replay relational history"));
    let a = () => {
      let c = Number(o.value);
      if (c === n.length) {
        (this.renderer.setReplayState(null), r.setText("Now"));
        return;
      }
      let u = n[c],
        d = this.history.replayAt(u.timestamp);
      (this.renderer.setReplayState(d),
        r.setText(
          `${new Date(u.timestamp).toLocaleDateString()} \xB7 ${d.simplices.size} simplex \xB7 ${d.hyperedges.size} encounter`,
        ));
    };
    (o.addEventListener("input", a),
      i.createEl("button", { text: "Live" }).addEventListener("click", () => {
        ((o.value = String(n.length)), a());
      }));
  }
  async onClose() {
    (await Promise.resolve(), this.renderer.setReplayState(null), this.renderer.destroy());
  }
  addFilterToggle(e, n, i, r) {
    let o = e.createEl("button", { cls: `simplicial-filter ${i() ? "is-on" : ""}`, text: n });
    o.addEventListener("click", () => {
      let a = !i();
      (r(a), o.toggleClass("is-on", a), this.onSettingsChanged(), this.renderer.render());
    });
  }
  renderFiltrationControls(e) {
    this.sliderWrap = e.createDiv({ cls: "simplicial-filtration" });
    let n = this.sliderWrap.createDiv({ cls: "simplicial-filtration-header" });
    n.createSpan({ text: "Filter" });
    let i = n.createSpan({ cls: "simplicial-filtration-value", text: this.settings.renderFilterThreshold.toFixed(3) }),
      r = this.sliderWrap.createEl("select", { cls: "simplicial-filtration-metric" });
    [
      { value: "weight", label: "weight" },
      { value: "confidence", label: "confidence" },
      { value: "decayed-weight", label: "decayed" },
    ].forEach((g) => {
      let f = r.createEl("option", { text: g.label });
      ((f.value = g.value), (f.selected = this.settings.renderFilterMetric === g.value));
    });
    let a = this.sliderWrap.createDiv({ cls: "simplicial-filtration-sliders" }),
      l = a.createDiv({ cls: "simplicial-slider-row" });
    l.createSpan({ text: "Range", cls: "simplicial-slider-label" });
    let c = l.createEl("input", { type: "range", cls: "simplicial-filtration-slider coarse" });
    ((c.min = "0"),
      (c.max = "1"),
      (c.step = "0.1"),
      (c.value = String(Math.round(this.settings.renderFilterThreshold * 10) / 10)));
    let u = a.createDiv({ cls: "simplicial-slider-row" });
    u.createSpan({ text: "Fine", cls: "simplicial-slider-label" });
    let d = u.createEl("input", { type: "range", cls: "simplicial-filtration-slider fine" });
    ((d.min = "-0.05"), (d.max = "0.05"), (d.step = "0.001"), (d.value = "0"), (this.sliderEl = c));
    let p = Number(c.value),
      h = 0,
      m = () => {
        let g = p + h;
        return (
          (g = Math.max(0, Math.min(1, g))),
          i.setText(g.toFixed(3)),
          (this.settings.renderFilterThreshold = g),
          this.onSettingsChanged(),
          this.renderer.render(),
          g
        );
      };
    (c.addEventListener("input", () => {
      ((p = Number(c.value)), (h = 0), (d.value = "0"), m());
    }),
      d.addEventListener("input", () => {
        ((h = Number(d.value)), m());
      }),
      d.addEventListener("change", () => {
        let g = p + h;
        (g <= 0 || g >= 1) &&
          ((p = Math.max(0, Math.min(1, g))), (c.value = String(Math.round(p * 10) / 10)), (h = 0), (d.value = "0"));
      }),
      r.addEventListener("change", () => {
        ((this.settings.renderFilterMetric = r.value),
          this.onSettingsChanged(),
          this.renderer.render(),
          this.computeFiltrationEvents());
      }),
      this.updateEventMarkers());
  }
  renderFloatingControls(e) {
    let n = e.createDiv({ cls: "simplicial-floating-controls" }),
      i = n.createDiv({ cls: "simplicial-controls-toggle" });
    (i.setText("\u2699"), (i.title = "Open organized canvas settings"));
    let r = n.createDiv({ cls: "simplicial-controls-panel" });
    (r.createDiv({ cls: "simplicial-controls-title", text: "Canvas settings" }),
      r.createDiv({
        cls: "simplicial-controls-help",
        text: "Changes apply immediately. Suggested relations remain unconfirmed until you accept them.",
      }));
    let o = r.createEl("details", { cls: "simplicial-control-guide" });
    (o.createEl("summary", { text: "How to read encounters and contextuality" }),
      o.createEl("p", {
        text: "An encounter is a dashed enclosure around notes you want to treat as one group. It does not claim that every pair is linked. Record one yourself, or enable encounter suggestions and click a proposed enclosure to review it.",
      }),
      o.createEl("p", {
        text: "Contextuality compares overlapping groups as different viewpoints. Open the lab, add suggested context seeds, assign local roles, and read the report. It may find agreement, a direct disagreement, or a contradiction that appears only when all viewpoints are combined.",
      }));
    let a = this.addControlSection(r, "Discovery", !0);
    (this.addDualSlider(
      a,
      "Link selectivity",
      this.settings.linkStrengthThreshold,
      (g) => {
        ((this.settings.linkStrengthThreshold = g),
          this.onSettingsChanged(),
          this.onRescan?.("canvas-link-threshold-changed", 100));
      },
      this.settings.linkThresholdLowerBound,
      this.settings.linkThresholdUpperBound,
      (g, f) => {
        ((this.settings.linkThresholdLowerBound = g),
          (this.settings.linkThresholdUpperBound = f),
          this.onSettingsChanged());
      },
    ),
      this.addCanvasSlider(a, "Group confidence", this.settings.insightThreshold, 0, 1, 0.05, (g) => {
        ((this.settings.insightThreshold = g),
          this.onSettingsChanged(),
          this.onRescan?.("canvas-insight-threshold-changed", 100));
      }),
      this.addCanvasSlider(a, "Visible suggestion", this.settings.suggestionThreshold, 0.2, 0.95, 0.05, (g) => {
        ((this.settings.suggestionThreshold = g), this.onSettingsChanged(), this.renderer.render());
      }),
      this.addCanvasToggle(a, "Infer links", this.settings.enableLinkInference, (g) => {
        ((this.settings.enableLinkInference = g),
          this.onSettingsChanged(),
          this.onRescan?.("canvas-link-inference-changed", 100));
      }),
      this.addCanvasToggle(a, "Suggest encounters", this.settings.enableEncounterSuggestions, (g) => {
        ((this.settings.enableEncounterSuggestions = g),
          this.onSettingsChanged(),
          this.onRescan?.("canvas-encounter-discovery-changed", 100));
      }),
      this.addCanvasSlider(
        a,
        "Encounter confidence",
        this.settings.encounterSuggestionThreshold,
        0.4,
        0.95,
        0.05,
        (g) => {
          ((this.settings.encounterSuggestionThreshold = g),
            this.onSettingsChanged(),
            this.onRescan?.("canvas-encounter-threshold-changed", 100));
        },
      ));
    let l = this.addControlSection(r, "What is shown", !0);
    (this.addCanvasToggle(l, "Show missing faces (unavailable)", !1, () => {}, !0),
      this.addCanvasToggle(l, "Suggested relations", this.settings.showSuggestions, (g) => {
        ((this.settings.showSuggestions = g), this.onSettingsChanged(), this.renderer.render());
      }),
      this.addCanvasToggle(l, "Encounter enclosures", this.settings.showHyperedges, (g) => {
        ((this.settings.showHyperedges = g), this.onSettingsChanged(), this.renderer.render());
      }));
    let c = this.addControlSection(r, "Layout", !1);
    (this.addCanvasSlider(c, "Node spacing", this.settings.repulsionStrength, 200, 6e3, 100, (g) => {
      ((this.settings.repulsionStrength = g), this.onSettingsChanged());
    }),
      this.addCanvasSlider(c, "Center pull", this.settings.gravityStrength, 1e-4, 0.02, 1e-4, (g) => {
        ((this.settings.gravityStrength = g), this.onSettingsChanged());
      }));
    let u = this.addControlSection(r, "Actions", !0),
      p = u
        .createDiv({ cls: "simplicial-control-row" })
        .createEl("button", { cls: "simplicial-control-button", text: "Find expressive view" });
    ((p.title = "Reveal a balanced, suggestion-only view using all available evidence."),
      p.addEventListener("click", () => {
        (async () => {
          ((p.disabled = !0), p.setText("Discovering\u2026"));
          try {
            await this.actions?.findExpressiveView();
          } finally {
            ((p.disabled = !1), p.setText("Find expressive view"));
          }
        })();
      }),
      u
        .createDiv({ cls: "simplicial-control-row" })
        .createEl("button", { cls: "simplicial-control-button", text: "Rescan vault" })
        .addEventListener("click", () => {
          this.onRescan?.("manual-rescan", 0);
        }),
      i.addEventListener("click", () => {
        r.toggleClass("simplicial-hidden", !r.hasClass("simplicial-hidden"));
      }),
      r.addClass("simplicial-hidden"));
  }
  addControlSection(e, n, i) {
    let r = e.createEl("details", { cls: "simplicial-control-section" });
    return ((r.open = i), r.createEl("summary", { text: n }), r.createDiv({ cls: "simplicial-control-section-body" }));
  }
  addCanvasToggle(e, n, i, r, o = !1) {
    let a = e.createDiv({ cls: `simplicial-control-row${o ? " is-disabled" : ""}` });
    a.createSpan({ text: n });
    let l = a.createEl("input", { type: "checkbox" });
    ((l.checked = i),
      (l.disabled = o),
      l.addEventListener("change", () => {
        r(l.checked);
      }));
  }
  addCanvasSlider(e, n, i, r, o, a, l) {
    let c = e.createDiv({ cls: "simplicial-control-row" });
    c.createSpan({ text: n });
    let u = c.createEl("input", { type: "range" });
    ((u.min = String(r)), (u.max = String(o)), (u.step = String(a)), (u.value = String(i)));
    let d = a < 0.001 ? 4 : a < 0.01 ? 3 : 2,
      p = c.createSpan({ cls: "simplicial-control-value", text: i.toFixed(d) });
    u.addEventListener("input", () => {
      let h = Number(u.value);
      (p.setText(h.toFixed(d)), l(h));
    });
  }
  addDualSlider(e, n, i, r, o, a, l) {
    let c = e.createDiv({ cls: "simplicial-dual-slider-wrap" }),
      u = c.createDiv({ cls: "simplicial-dual-slider-header" });
    u.createSpan({ text: n });
    let d = u.createSpan({ cls: "simplicial-control-value", text: i.toFixed(4) }),
      p = c.createDiv({ cls: "simplicial-control-row" });
    p.createSpan({ text: "Range", cls: "simplicial-slider-label" });
    let h = p.createEl("input", { type: "range" });
    ((h.min = String(o)), (h.max = String(a)), (h.step = "0.01"), (h.value = String(i)));
    let m = c.createDiv({ cls: "simplicial-control-row" });
    m.createSpan({ text: "Fine", cls: "simplicial-slider-label" });
    let g = m.createEl("input", { type: "range" });
    ((g.min = "-0.05"), (g.max = "0.05"), (g.step = "0.001"), (g.value = "0"));
    let f = i,
      v = 0,
      y = () => {
        let b = Math.max(o, Math.min(a, f + v));
        return (d.setText(b.toFixed(4)), r(b), b);
      };
    (h.addEventListener("input", () => {
      ((f = Number(h.value)), (v = 0), (g.value = "0"), y());
    }),
      g.addEventListener("input", () => {
        ((v = Number(g.value)), y());
      }),
      l?.(o, a));
  }
  updateEventMarkers() {
    if (
      (this.eventMarkers.forEach((i) => i.remove()),
      (this.eventMarkers = []),
      !this.sliderWrap || !this.sliderEl || this.sliderEl.getBoundingClientRect().width === 0)
    )
      return;
    this.filtrationEvents.length > 0 &&
      pn(this.filtrationEvents).forEach((i) => {
        let r = this.sliderWrap.createDiv({ cls: "simplicial-filtration-marker" });
        (r.style.setProperty("left", `${i * 100}%`),
          (r.title = `A relation enters the filtration at ${i.toFixed(2)}. This is not a birth or a death.`),
          this.eventMarkers.push(r));
      });
    let n = new Map();
    for (let i of this.persistenceEvents) {
      let r = Math.round(i.threshold * 100) / 100;
      n.set(r, [...(n.get(r) ?? []), i]);
    }
    for (let [i, r] of n) {
      let o = r.filter((l) => l.type === "class-death"),
        a = this.sliderWrap.createDiv({
          cls: `simplicial-persistence-marker${o.length > 0 ? " is-death" : " is-birth"}`,
        });
      (a.style.setProperty("left", `${i * 100}%`),
        (a.title = r.map((l) => l.description).join(`
`)),
        this.eventMarkers.push(a));
    }
  }
  renderLegend(e) {
    [
      { label: "Link baseline", cls: "is-link" },
      { label: "Tag affinity", cls: "is-tag" },
      { label: "Folder affinity", cls: "is-folder" },
      { label: "Semantic overlap", cls: "is-semantic" },
      { label: "Soft cluster", cls: "is-cluster" },
      { label: "Confirmed simplex", cls: "is-confirmed" },
    ].forEach((i) => {
      let r = e.createDiv({ cls: "simplicial-legend-item" });
      (r.createSpan({ cls: `simplicial-legend-swatch ${i.cls}` }), r.createSpan({ text: i.label }));
    });
  }
};
var S = require("obsidian");
var vt = class extends S.PluginSettingTab {
  constructor(e, n) {
    super(e, n);
    this.plugin = n;
  }
  getSettingDefinitions() {
    return [
      this.settingSection("Storage", ["Persistence mode", "Central file"], (e) => this.renderPersistenceSettings(e)),
      this.settingSection(
        "Hypergraph",
        [
          "Hypergraph layer",
          "Show encounters",
          "Discover possible encounters",
          "Encounter suggestion confidence",
          "Encounter opacity",
          "Pulse focused encounters",
          "Recurrence threshold",
          "Crystallize folder",
          "Record relation history",
          "History file",
        ],
        (e) => this.renderHypergraphSettings(e),
      ),
      this.settingSection("Dynamics", ["Enable dynamics lab", "Attention half-life (minutes)"], (e) =>
        this.renderDynamicsSettings(e),
      ),
      this.settingSection("Contextuality", ["Contextuality lab"], (e) => this.renderSheafSettings(e)),
      this.settingSection(
        "Persistent topology",
        ["Enable persistence X-ray", "Compute empirical stability", "Resample count", "Maximum simplices"],
        (e) => this.renderPersistenceTopologySettings(e),
      ),
      this.settingSection(
        "Layout",
        [
          "Max rendered dimension",
          "Noise amount",
          "Repulsion strength",
          "Cohesion strength",
          "Gravity strength",
          "Damping",
          "Boundary padding",
          "Dark mode",
        ],
        (e) => this.renderLayoutSettings(e),
      ),
      this.settingSection(
        "Inference",
        [
          "Higher-order inference output",
          "Link graph baseline",
          "Enable inferred edges",
          "Inference threshold",
          "Show suggestions",
          "Suggestion threshold",
        ],
        (e) => this.renderInferenceSettings(e),
      ),
      this.settingSection(
        "Commands and display",
        [
          "Command simplex size",
          "Formal mode",
          "Sparse edge length",
          "Sparse gravity boost",
          "Label density",
          "Filtration metric",
          "Filtration threshold",
          "Open metadata panel after create",
          "Metadata hover delay",
        ],
        (e) => this.renderCommandUiSettings(e),
      ),
      this.settingSection(
        "Topology and explanations",
        [
          "Show missing-face opportunities",
          "Display betti on canvas",
          "Max betti dimension",
          "Show filtration slider",
          "Enable explanation panel",
        ],
        (e) => this.renderBettiSettings(e),
      ),
      this.settingSection(
        "Inference engine",
        [
          "Inference engine (v2)",
          "Inference mode",
          "Emergent inference",
          "Domain source",
          "Content cluster count",
          "Link strength threshold",
        ],
        (e) => this.renderEmergentSettings(e),
      ),
      this.settingSection(
        "Legacy inference weights",
        [
          "Link weight",
          "Mutual link bonus",
          "Shared tag weight",
          "Title overlap weight",
          "Content overlap weight",
          "Same folder weight",
          "Top folder weight",
        ],
        (e) => this.renderLegacySettings(e),
      ),
    ];
  }
  settingSection(e, n, i) {
    return {
      name: e,
      aliases: n,
      render: (r) => {
        (r.settingEl.empty(),
          r.settingEl.addClass("simplicial-settings-section"),
          new S.Setting(r.settingEl).setName(e).setHeading(),
          i(r.settingEl),
          this.refreshSettingVisibility());
      },
    };
  }
  renderPersistenceSettings(e) {
    (new S.Setting(e)
      .setName("Persistence mode")
      .setDesc("Choose where confirmed simplices are stored.")
      .addDropdown((n) => {
        (n.addOption("source-note", "Source note"),
          n.addOption("central-file", "Central file"),
          n.setValue(this.plugin.settings.persistenceMode),
          n.onChange(async (i) => {
            let r = i;
            ((this.plugin.settings.persistenceMode = r),
              r === "central-file" && (await X(this.app, this.plugin.settings.centralFile)),
              await this.plugin.saveSettings());
          }));
      }),
      new S.Setting(e).setName("Central file").addText((n) => {
        (n.setValue(this.plugin.settings.centralFile),
          n.onChange(async (i) => {
            ((this.plugin.settings.centralFile = i || "_simplicial.md"),
              this.plugin.settings.persistenceMode === "central-file" &&
                (await X(this.app, this.plugin.settings.centralFile)),
              await this.plugin.saveSettings());
          }));
      }));
  }
  renderLayoutSettings(e) {
    {
      let n = new S.Setting(e)
        .setName("Max rendered dimension")
        .setDesc("Highest simplex dimension to draw. A 10-node simplex has dimension 9.");
      this.addNumberSlider(n, this.plugin.settings.maxRenderedDim, 1, 12, 1, async (i) => {
        ((this.plugin.settings.maxRenderedDim = i), await this.plugin.saveSettings(), this.plugin.renderer.render());
      });
    }
    {
      let n = new S.Setting(e).setName("Noise amount");
      this.addNumberSlider(n, this.plugin.settings.noiseAmount, 0, 0.5, 0.01, async (i) => {
        ((this.plugin.settings.noiseAmount = i),
          this.plugin.engine.configure({ noiseAmount: i }),
          await this.plugin.saveSettings());
      });
    }
    {
      let n = new S.Setting(e).setName("Repulsion strength").setDesc("Higher values push nodes apart more strongly.");
      this.addNumberSlider(n, this.plugin.settings.repulsionStrength, 200, 6e3, 100, async (i) => {
        ((this.plugin.settings.repulsionStrength = i),
          this.plugin.engine.configure({ repulsionStrength: i }),
          await this.plugin.saveSettings());
      });
    }
    {
      let n = new S.Setting(e)
        .setName("Cohesion strength")
        .setDesc("Higher values pull connected simplices together more strongly.");
      this.addNumberSlider(n, this.plugin.settings.cohesionStrength, 0.001, 0.03, 0.001, async (i) => {
        ((this.plugin.settings.cohesionStrength = i),
          this.plugin.engine.configure({ cohesionStrength: i }),
          await this.plugin.saveSettings());
      });
    }
    {
      let n = new S.Setting(e)
        .setName("Gravity strength")
        .setDesc("Higher values keep nodes toward the center instead of drifting to the edges.");
      this.addNumberSlider(n, this.plugin.settings.gravityStrength, 1e-4, 0.01, 1e-4, async (i) => {
        ((this.plugin.settings.gravityStrength = i),
          this.plugin.engine.configure({ gravityStrength: i }),
          await this.plugin.saveSettings());
      });
    }
    {
      let n = new S.Setting(e)
        .setName("Damping")
        .setDesc("Higher values make motion settle more slowly and glide more.");
      this.addNumberSlider(n, this.plugin.settings.dampingFactor, 0.5, 0.99, 0.01, async (i) => {
        ((this.plugin.settings.dampingFactor = i),
          this.plugin.engine.configure({ dampingFactor: i }),
          await this.plugin.saveSettings());
      });
    }
    {
      let n = new S.Setting(e)
        .setName("Boundary padding")
        .setDesc("Minimum distance nodes keep from the canvas edges.");
      this.addNumberSlider(n, this.plugin.settings.boundaryPadding, 0, 200, 5, async (i) => {
        ((this.plugin.settings.boundaryPadding = i),
          this.plugin.engine.configure({ boundaryPadding: i }),
          await this.plugin.saveSettings());
      });
    }
    new S.Setting(e).setName("Dark mode").addDropdown((n) => {
      (n.addOption("auto", "Auto"),
        n.addOption("force-light", "Force light"),
        n.addOption("force-dark", "Force dark"),
        n.setValue(this.plugin.settings.darkMode),
        n.onChange(async (i) => {
          ((this.plugin.settings.darkMode = i), await this.plugin.saveSettings());
        }));
    });
  }
  renderHypergraphSettings(e) {
    (new S.Setting(e)
      .setName("Show encounters")
      .setDesc(
        "Render hyperedges (\u25C7) as transient enclosures. An encounter records that notes came together as one irreducible whole, without asserting any pair within it.",
      )
      .addToggle((n) => {
        (n.setValue(this.plugin.settings.showHyperedges),
          n.onChange(async (i) => {
            ((this.plugin.settings.showHyperedges = i),
              await this.plugin.saveSettings(),
              this.plugin.renderer.render());
          }));
      }),
      new S.Setting(e)
        .setName("Discover possible encounters")
        .setDesc(
          "Propose in-memory \u25C7 candidates from coherent fields and cross-field junctions. Suggestions are never written to notes or history until you confirm them.",
        )
        .addToggle((n) => {
          (n.setValue(this.plugin.settings.enableEncounterSuggestions),
            n.onChange(async (i) => {
              ((this.plugin.settings.enableEncounterSuggestions = i),
                await this.plugin.saveSettings(),
                this.plugin.scheduleFullScan("encounter-suggestions-changed", 0));
            }));
        }));
    {
      let n = new S.Setting(e)
        .setName("Encounter suggestion confidence")
        .setDesc("Minimum structural/evidence score for showing a possible encounter.");
      this.addNumberSlider(n, this.plugin.settings.encounterSuggestionThreshold, 0.4, 0.95, 0.01, async (i) => {
        ((this.plugin.settings.encounterSuggestionThreshold = i),
          await this.plugin.saveSettings(),
          this.plugin.scheduleFullScan("encounter-suggestion-threshold", 0));
      });
    }
    {
      let n = new S.Setting(e)
        .setName("Encounter opacity")
        .setDesc("How present encounter enclosures are against the simplicial fields.");
      this.addNumberSlider(n, this.plugin.settings.hyperedgeOpacity, 0.1, 1, 0.05, async (i) => {
        ((this.plugin.settings.hyperedgeOpacity = i), await this.plugin.saveSettings(), this.plugin.renderer.render());
      });
    }
    new S.Setting(e)
      .setName("Pulse focused encounters")
      .setDesc(
        "Breathe the participants of a focused encounter in phase \u2014 a temporary alignment of attention, not a permanent connection. Turned off automatically when your system asks for reduced motion.",
      )
      .addToggle((n) => {
        (n.setValue(this.plugin.settings.enableHyperedgePulse),
          n.onChange(async (i) => {
            ((this.plugin.settings.enableHyperedgePulse = i),
              await this.plugin.saveSettings(),
              this.plugin.renderer.render());
          }));
      });
    {
      let n = new S.Setting(e)
        .setName("Recurrence threshold")
        .setDesc(
          "How many recorded encounters over the same notes mark a configuration as recurring. Recurrence enables crystallization; it never promotes anything on its own.",
        );
      this.addNumberSlider(n, this.plugin.settings.encounterRecurrenceThreshold, 2, 10, 1, async (i) => {
        ((this.plugin.settings.encounterRecurrenceThreshold = i), await this.plugin.saveSettings());
      });
    }
    (new S.Setting(e)
      .setName("Crystallize folder")
      .setDesc("Where notes created by 'crystallize concept' are placed. Leave empty for the vault root.")
      .addText((n) => {
        (n.setPlaceholder("Concepts"),
          n.setValue(this.plugin.settings.crystallizeFolder),
          n.onChange(async (i) => {
            ((this.plugin.settings.crystallizeFolder = i.trim()), await this.plugin.saveSettings());
          }));
      }),
      new S.Setting(e)
        .setName("Record relation history")
        .setDesc(
          "Keep an append-only log of how relations came to be \u2014 encountered, promoted, relaxed, crystallized, dissolved. Turning this off stops new entries; it never deletes existing ones.",
        )
        .addToggle((n) => {
          (n.setValue(this.plugin.settings.enableRelationHistory),
            n.onChange(async (i) => {
              ((this.plugin.settings.enableRelationHistory = i),
                await this.plugin.saveSettings(),
                new S.Notice(i ? "History resumes on next reload." : "History paused. Existing entries are kept."));
            }));
        }),
      new S.Setting(e)
        .setName("History file")
        .setDesc("Vault path of the append-only relation history.")
        .addText((n) => {
          (n.setPlaceholder("_simplicial-history.md"),
            n.setValue(this.plugin.settings.historyFile),
            n.onChange(async (i) => {
              ((this.plugin.settings.historyFile = i.trim() || "_simplicial-history.md"),
                this.plugin.historyStore.setPath(this.plugin.settings.historyFile),
                await this.plugin.saveSettings());
            }));
        }));
  }
  renderDynamicsSettings(e) {
    new S.Setting(e)
      .setName("Enable dynamics lab")
      .setDesc(
        "Adds a view that runs your vault under three models of how attention spreads \u2014 pairwise, simplicial and hypergraph \u2014 and reports where they disagree. Experimental. Requires a reload.",
      )
      .addToggle((n) => {
        (n.setValue(this.plugin.settings.enableDynamicsLab),
          n.onChange(async (i) => {
            ((this.plugin.settings.enableDynamicsLab = i),
              await this.plugin.saveSettings(),
              new S.Notice(i ? "Dynamics lab appears after a reload." : "Dynamics lab removed after a reload."));
          }));
      });
    {
      let n = new S.Setting(e)
        .setName("Attention half-life (minutes)")
        .setDesc(
          "How long a note stays visibly in play after you leave it. Attention is never written to a note \u2014 it exists only while the plugin is running.",
        );
      this.addNumberSlider(n, this.plugin.settings.activationDecayHalfLifeMinutes, 1, 240, 1, async (i) => {
        ((this.plugin.settings.activationDecayHalfLifeMinutes = i), await this.plugin.saveSettings());
      });
    }
  }
  renderPersistenceTopologySettings(e) {
    (new S.Setting(e)
      .setName("Enable persistence X-ray")
      .setDesc(
        "Adds a view showing which topological features survive as the evidence threshold moves, with an inspectable representative cycle for each one. Requires a reload.",
      )
      .addToggle((n) => {
        (n.setValue(this.plugin.settings.enablePersistenceView),
          n.onChange(async (i) => {
            ((this.plugin.settings.enablePersistenceView = i),
              await this.plugin.saveSettings(),
              new S.Notice(
                i ? "Persistence X-ray appears after a reload." : "Persistence X-ray removed after a reload.",
              ));
          }));
      }),
      new S.Setting(e)
        .setName("Compute empirical stability")
        .setDesc(
          "Re-runs the whole analysis on seeded subsamples to see which features reappear. This multiplies the computation by the resample count, so it is off unless you ask for it. Bootstrap support is not a confidence band.",
        )
        .addToggle((n) => {
          (n.setValue(this.plugin.settings.enableBootstrapUncertainty),
            n.onChange(async (i) => {
              ((this.plugin.settings.enableBootstrapUncertainty = i), await this.plugin.saveSettings());
            }));
        }));
    {
      let n = new S.Setting(e)
        .setName("Resample count")
        .setDesc("How many seeded resamples empirical stability runs. Each one is a full reduction.");
      this.addNumberSlider(n, this.plugin.settings.bootstrapSampleCount, 5, 100, 5, async (i) => {
        ((this.plugin.settings.bootstrapSampleCount = i), await this.plugin.saveSettings());
      });
    }
    {
      let n = new S.Setting(e)
        .setName("Maximum simplices")
        .setDesc(
          "Ceiling on how much structure is sent to the topology engine. Sized for mobile, which is the tighter limit; above this the analysis reports what it could not do rather than freezing.",
        );
      this.addNumberSlider(n, this.plugin.settings.topologyMaxSimplices, 5e3, 2e5, 5e3, async (i) => {
        ((this.plugin.settings.topologyMaxSimplices = i), await this.plugin.saveSettings());
      });
    }
  }
  renderSheafSettings(e) {
    new S.Setting(e)
      .setName("Contextuality lab")
      .setDesc(
        "Define overlapping contexts, assign local roles, and detect gluing obstructions. Contexts live in plugin settings and never alter note content.",
      )
      .addButton((n) => {
        (n.setButtonText("Open lab"),
          n.onClick(() => {
            this.plugin.activateSheafView();
          }));
      });
  }
  renderInferenceSettings(e) {
    (new S.Setting(e)
      .setName("Higher-order inference output")
      .setDesc(
        "Keep inferred groups of three or more as encounter suggestions until you promote them. Pairwise links remain simplices.",
      )
      .addDropdown((n) => {
        (n.addOption("simplex", "Simplex (compatible default)"),
          n.addOption("hyperedge", "Encounter suggestion (safer)"),
          n.setValue(this.plugin.settings.inferenceEmits),
          n.onChange(async (i) => {
            ((this.plugin.settings.inferenceEmits = i), await this.plugin.saveSettings());
          }));
      }),
      new S.Setting(e)
        .setName("Link graph baseline")
        .setDesc("Always show note-to-note vault links as 1-simplices, even without higher-order structure.")
        .addToggle((n) => {
          (n.setValue(this.plugin.settings.linkGraphBaseline),
            n.onChange(async (i) => {
              ((this.plugin.settings.linkGraphBaseline = i), await this.plugin.saveSettings());
            }));
        }),
      new S.Setting(e)
        .setName("Enable inferred edges")
        .setDesc("Use tags, links, titles, content, and folders to infer lightweight edges.")
        .addToggle((n) => {
          (n.setValue(this.plugin.settings.enableInferredEdges),
            n.onChange(async (i) => {
              ((this.plugin.settings.enableInferredEdges = i), await this.plugin.saveSettings());
            }));
        }));
    {
      let n = new S.Setting(e)
        .setName("Inference threshold")
        .setDesc("Minimum combined signal needed before an inferred edge is created.");
      this.addNumberSlider(n, this.plugin.settings.inferenceThreshold, 0.05, 0.6, 0.01, async (i) => {
        ((this.plugin.settings.inferenceThreshold = i), await this.plugin.saveSettings());
      });
    }
    new S.Setting(e)
      .setName("Show suggestions")
      .setDesc("Render closure and soft-cluster suggestions directly on the canvas.")
      .addToggle((n) => {
        (n.setValue(this.plugin.settings.showSuggestions),
          n.onChange(async (i) => {
            ((this.plugin.settings.showSuggestions = i),
              await this.plugin.saveSettings(),
              this.plugin.renderer.render());
          }));
      });
    {
      let n = new S.Setting(e)
        .setName("Suggestion threshold")
        .setDesc("Confidence level required before a suggestion is surfaced in the UI.");
      this.addNumberSlider(n, this.plugin.settings.suggestionThreshold, 0.2, 0.95, 0.01, async (i) => {
        ((this.plugin.settings.suggestionThreshold = i), await this.plugin.saveSettings());
      });
    }
  }
  renderCommandUiSettings(e) {
    {
      let n = new S.Setting(e)
        .setName("Command simplex size")
        .setDesc("How many nodes the create-from-open-note command tries to include.");
      this.addNumberSlider(n, this.plugin.settings.commandSimplexSize, 2, 6, 1, async (i) => {
        ((this.plugin.settings.commandSimplexSize = i), await this.plugin.saveSettings());
      });
    }
    new S.Setting(e)
      .setName("Formal mode")
      .setDesc("Locked on in v0.4.5. Computation-intensive ambient rendering is temporarily unavailable.")
      .addToggle((n) => {
        (n.setValue(!0), n.setDisabled(!0));
      });
    {
      let n = new S.Setting(e).setName("Sparse edge length").setDesc("Preferred spacing for sparse link-only graphs.");
      this.addNumberSlider(n, this.plugin.settings.sparseEdgeLength, 60, 280, 5, async (i) => {
        ((this.plugin.settings.sparseEdgeLength = i),
          this.plugin.engine.configure({ sparseEdgeLength: i }),
          await this.plugin.saveSettings());
      });
    }
    {
      let n = new S.Setting(e)
        .setName("Sparse gravity boost")
        .setDesc("Extra centering force when the graph is mostly pairwise and sparse.");
      this.addNumberSlider(n, this.plugin.settings.sparseGravityBoost, 1, 4, 0.1, async (i) => {
        ((this.plugin.settings.sparseGravityBoost = i),
          this.plugin.engine.configure({ sparseGravityBoost: i }),
          await this.plugin.saveSettings());
      });
    }
    {
      let n = new S.Setting(e)
        .setName("Label density")
        .setDesc("Controls how many non-focused labels are allowed before decluttering hides the rest.");
      this.addNumberSlider(n, this.plugin.settings.labelDensity, 0.1, 1, 0.05, async (i) => {
        ((this.plugin.settings.labelDensity = i), await this.plugin.saveSettings(), this.plugin.renderer.render());
      });
    }
    new S.Setting(e)
      .setName("Filtration metric")
      .setDesc("Choose which simplex strength field the live filtration slider uses.")
      .addDropdown((n) => {
        (n.addOption("weight", "Weight"),
          n.addOption("confidence", "Confidence"),
          n.addOption("decayed-weight", "Decayed weight"),
          n.setValue(this.plugin.settings.renderFilterMetric),
          n.onChange(async (i) => {
            ((this.plugin.settings.renderFilterMetric = i),
              await this.plugin.saveSettings(),
              this.plugin.renderer.render());
          }));
      });
    {
      let n = new S.Setting(e)
        .setName("Filtration threshold")
        .setDesc("Hide simplices below this threshold in the active filtration metric.");
      this.addNumberSlider(n, this.plugin.settings.renderFilterThreshold, 0, 1, 0.01, async (i) => {
        ((this.plugin.settings.renderFilterThreshold = i),
          await this.plugin.saveSettings(),
          this.plugin.renderer.render());
      });
    }
    new S.Setting(e)
      .setName("Open metadata panel after create")
      .setDesc("Show the metadata panel immediately after the command creates a simplex.")
      .addToggle((n) => {
        (n.setValue(this.plugin.settings.commandAutoOpenPanel),
          n.onChange(async (i) => {
            ((this.plugin.settings.commandAutoOpenPanel = i), await this.plugin.saveSettings());
          }));
      });
    {
      let n = new S.Setting(e)
        .setName("Metadata hover delay")
        .setDesc("Delay before hover-driven metadata UI should appear.");
      this.addNumberSlider(n, this.plugin.settings.metadataHoverDelayMs, 250, 2e3, 50, async (i) => {
        ((this.plugin.settings.metadataHoverDelayMs = i), await this.plugin.saveSettings());
      });
    }
  }
  renderBettiSettings(e) {
    (new S.Setting(e)
      .setName("Show missing-face opportunities")
      .setDesc("Temporarily unavailable in v0.4.5 because the interactive missing-face scan is computation intensive.")
      .addToggle((n) => {
        (n.setValue(!1), n.setDisabled(!0));
      }),
      new S.Setting(e)
        .setName("Display betti on canvas")
        .setDesc("Show actual homology ranks mod 2 in the top-left overlay.")
        .addToggle((n) => {
          (n.setValue(this.plugin.settings.bettiDisplayOnCanvas),
            n.onChange(async (i) => {
              ((this.plugin.settings.bettiDisplayOnCanvas = i),
                await this.plugin.saveSettings(),
                this.plugin.renderer.render(),
                new S.Notice(i ? "Betti overlay will appear in top-left of graph" : "Betti overlay hidden"));
            }));
        }),
      new S.Setting(e)
        .setName("Max betti dimension")
        .setDesc("Choose the highest homology dimension reported for the analyzed skeleton.")
        .addDropdown((n) => {
          (n.addOption("1", "Through \u03B2\u2081"),
            n.addOption("2", "Through \u03B2\u2082"),
            n.setValue(String(this.plugin.settings.maxBettiDim)),
            n.onChange(async (i) => {
              ((this.plugin.settings.maxBettiDim = Number(i)),
                await this.plugin.saveSettings(),
                this.plugin.renderer.render());
            }));
        }),
      new S.Setting(e)
        .setName("Show filtration slider")
        .setDesc(
          "Enable the slider UI with simplex-appearance markers. Persistence births and deaths arrive in v0.5.0.",
        )
        .addToggle((n) => {
          (n.setValue(this.plugin.settings.showFiltrationSlider),
            n.onChange(async (i) => {
              ((this.plugin.settings.showFiltrationSlider = i),
                await this.plugin.saveSettings(),
                this.plugin.simplicialView?.refreshSettings(),
                new S.Notice(i ? "Filtration slider enabled" : "Filtration slider hidden"));
            }));
        }),
      new S.Setting(e)
        .setName("Enable explanation panel")
        .setDesc("Show human-readable explanations for inferred simplices in the metadata panel.")
        .addToggle((n) => {
          (n.setValue(this.plugin.settings.enableExplanationPanel),
            n.onChange(async (i) => {
              ((this.plugin.settings.enableExplanationPanel = i),
                await this.plugin.saveSettings(),
                this.plugin.panelView?.setSettings(this.plugin.settings),
                new S.Notice(i ? "Explanation cards enabled" : "Explanation cards disabled"));
            }));
        }));
  }
  renderEmergentSettings(e) {
    (e.createEl("p", {
      cls: "setting-item-description",
      text: "The plugin has two inference systems: emergent (graph-based with semantic clustering) and legacy (rule-based). Choose which to use.",
    }),
      new S.Setting(e)
        .setName("Inference mode")
        .setDesc("Emergent = semantic graph analysis | legacy = rule-based heuristics | hybrid = both")
        .addDropdown((i) => {
          (i.addOption("emergent", "Emergent (semantic graph)"),
            i.addOption("taxonomic", "Legacy (rule-based)"),
            i.addOption("hybrid", "Hybrid (both systems)"),
            i.setValue(this.plugin.settings.inferenceMode),
            i.onChange(async (r) => {
              ((this.plugin.settings.inferenceMode = r),
                await this.plugin.saveSettings(),
                new S.Notice(`Inference mode: ${r}. Rescanning vault...`),
                this.plugin.scheduleFullScan("inference-mode-changed", 100),
                this.refreshSettingVisibility());
            }));
        }));
    let n = e.createDiv({ cls: "emergent-settings" });
    (new S.Setting(n).setName("Emergent inference").setHeading(),
      new S.Setting(n)
        .setName("Domain source")
        .setDesc("How note domains are determined for coloring and edge strength.")
        .addDropdown((i) => {
          (i.addOption("folder", "Folder structure"),
            i.addOption("content-cluster", "Content clustering (tf-idf)"),
            i.addOption("hybrid", "Hybrid (folder + content)"),
            i.setValue(this.plugin.settings.domainSource),
            i.onChange(async (r) => {
              ((this.plugin.settings.domainSource = r),
                await this.plugin.saveSettings(),
                new S.Notice(`Domain source: ${r}. Rescanning...`),
                this.plugin.scheduleFullScan("domain-source-changed", 100));
            }));
        }));
    {
      let i = new S.Setting(n)
        .setName("Content cluster count")
        .setDesc("Number of semantic clusters (used when domain source is content-cluster or hybrid).");
      this.addNumberSlider(i, this.plugin.settings.contentClusterCount, 2, 12, 1, async (r) => {
        ((this.plugin.settings.contentClusterCount = r),
          await this.plugin.saveSettings(),
          this.plugin.settings.domainSource !== "folder" &&
            (new S.Notice(`Cluster count: ${r}. Rescanning...`),
            this.plugin.scheduleFullScan("cluster-count-changed", 100)));
      });
    }
    {
      let i = new S.Setting(n)
        .setName("Link strength threshold")
        .setDesc(
          "Minimum edge strength for emergent mode to create a visible link (0.0 = all edges, 1.0 = only strongest).",
        );
      this.addNumberSlider(i, this.plugin.settings.linkStrengthThreshold, 0, 1, 0.01, async (r) => {
        ((this.plugin.settings.linkStrengthThreshold = r),
          await this.plugin.saveSettings(),
          new S.Notice(`Link threshold: ${r.toFixed(2)}. Rescanning...`),
          this.plugin.scheduleFullScan("link-threshold-changed", 100));
      });
    }
    this._emergentSettingsDiv = n;
  }
  renderLegacySettings(e) {
    (e.createEl("p", {
      cls: "setting-item-description",
      text: "These weights only apply when using legacy or hybrid inference mode. They control rule-based edge detection.",
    }),
      this.addWeightSlider(
        e,
        "Link weight",
        "Strength added by a resolved outbound link.",
        "linkWeight",
        "enableLinkInference",
        0,
        0.6,
        0.01,
      ),
      this.addWeightSlider(
        e,
        "Mutual link bonus",
        "Extra weight when both notes link each other.",
        "mutualLinkBonus",
        "enableMutualLinkBonus",
        0,
        0.6,
        0.01,
      ),
      this.addWeightSlider(
        e,
        "Shared tag weight",
        "Weight contributed by each shared tag.",
        "sharedTagWeight",
        "enableSharedTags",
        0,
        0.2,
        0.01,
      ),
      this.addWeightSlider(
        e,
        "Title overlap weight",
        "Maximum title-token overlap contribution.",
        "titleOverlapWeight",
        "enableTitleOverlap",
        0,
        0.3,
        0.01,
      ),
      this.addWeightSlider(
        e,
        "Content overlap weight",
        "Maximum body-text overlap contribution.",
        "contentOverlapWeight",
        "enableContentOverlap",
        0,
        0.3,
        0.01,
      ),
      this.addWeightSlider(
        e,
        "Same folder weight",
        "Boost when two notes share the same folder (Legacy mode only).",
        "sameFolderWeight",
        "enableSameFolderInference",
        0,
        0.2,
        0.01,
      ),
      this.addWeightSlider(
        e,
        "Top folder weight",
        "Boost when two notes share the same top-level folder (Legacy mode only).",
        "sameTopFolderWeight",
        "enableSameTopFolderInference",
        0,
        0.2,
        0.01,
      ));
  }
  refreshSettingVisibility() {
    let e = this._emergentSettingsDiv;
    if (!e) return;
    let n = this.plugin.settings.inferenceMode === "emergent" || this.plugin.settings.inferenceMode === "hybrid";
    e.style.display = n ? "block" : "none";
  }
  addNumberSlider(e, n, i, r, o, a) {
    e.addSlider((l) => {
      let c = e.controlEl.createSpan({ cls: "simplicial-setting-value" }),
        u = (d) => {
          let p = o >= 1 ? 0 : (`${o}`.split(".")[1]?.length ?? 0);
          return d
            .toFixed(p)
            .replace(/\.0+$/, "")
            .replace(/(\.\d*?)0+$/, "$1");
        };
      (c.setText(u(n)),
        l.setLimits(i, r, o),
        l.setValue(n),
        l.onChange(async (d) => {
          (c.setText(u(d)), await a(d));
        }));
    });
  }
  addWeightSlider(e, n, i, r, o, a, l, c) {
    let u = new S.Setting(e).setName(n).setDesc(i),
      d = null,
      p = (h) => {
        let m = c >= 1 ? 0 : (`${c}`.split(".")[1]?.length ?? 0);
        return h
          .toFixed(m)
          .replace(/\.0+$/, "")
          .replace(/(\.\d*?)0+$/, "$1");
      };
    (u.addToggle((h) => {
      (h.setTooltip("Enable or disable this inference signal"),
        h.setValue(this.plugin.settings[o]),
        h.onChange(async (m) => {
          ((this.plugin.settings[o] = m), d?.setDisabled(!m), await this.plugin.saveSettings());
        }));
    }),
      u.addSlider((h) => {
        d = h;
        let m = u.controlEl.createSpan({ cls: "simplicial-setting-value" });
        (m.setText(p(this.plugin.settings[r])),
          h.setLimits(a, l, c),
          h.setValue(this.plugin.settings[r]),
          h.setDisabled(!this.plugin.settings[o]),
          h.onChange(async (g) => {
            (m.setText(p(g)), (this.plugin.settings[r] = g), await this.plugin.saveSettings());
          }));
      }));
  }
};
var bt = class extends E.Plugin {
  constructor() {
    super(...arguments);
    this.panelView = null;
    this.simplicialView = null;
    this.sheafView = null;
    this.persistenceView = null;
    this.cycleHighlightBus = new nt();
    this.releaseCycleHighlightTarget = null;
    this.saveTimer = null;
    this.rescanTimer = null;
    this.subsetScorer = null;
    this.activation = new Be();
    this.activationTimer = null;
  }
  async onload() {
    let e = (await this.loadData()) ?? {};
    this.settings = ei(Qn(), e);
    let n = !this.settings.performanceDefaultsV045Applied;
    n &&
      ((this.settings.enableBettiComputation = !1),
      (this.settings.formalMode = !0),
      (this.settings.performanceDefaultsV045Applied = !0));
    let i = !this.settings.topologyCorrectionNoticeShown;
    (this.settings.maxRenderedDim === 3 && (this.settings.maxRenderedDim = 12),
      C.info("plugin", "Loading plugin", {
        persistenceMode: this.settings.persistenceMode,
        centralFile: this.settings.centralFile,
        showEdges: this.settings.showEdges,
        showClusters: this.settings.showClusters,
        showCores: this.settings.showCores,
        pinnedNodeCount: Object.keys(this.settings.pinnedNodes).length,
      }),
      (this.model = new me()),
      (this.history = new Ke()),
      (this.historyStore = new Ge(this.app, this.settings.historyFile)),
      this.settings.enableRelationHistory && this.history.onAppend((o) => this.historyStore.record(o)),
      (this.engine = new Xe()),
      this.engine.configure({
        noiseAmount: this.settings.noiseAmount,
        sleepThreshold: this.settings.sleepThreshold,
        repulsionStrength: this.settings.repulsionStrength,
        cohesionStrength: this.settings.cohesionStrength,
        gravityStrength: this.settings.gravityStrength,
        dampingFactor: this.settings.dampingFactor,
        boundaryPadding: this.settings.boundaryPadding,
        sparseEdgeLength: this.settings.sparseEdgeLength,
        sparseGravityBoost: this.settings.sparseGravityBoost,
      }),
      (this.controller = new Ye(
        this.model,
        () => this.engine.wake(),
        (o) => this.panelView?.setSelection(o),
        (o) => {
          this.openPanel(o, !1);
        },
        () => this.queueSaveSettings(),
        (o) => this.saveInteractionState(o),
      )));
    let r = this.settings.interactionState;
    (r && this.controller.setInteractionTracker(Tn(r)),
      (this.renderer = new tt(this.model, this.engine, this.controller, this.settings, {
        onContextMenu: (o, a) => this.openCanvasContextMenu(o, a),
        onLassoCreate: (o) => {
          this.openCreateSimplexModal(o, o[0] ?? "");
        },
        onNodeOpen: (o) => {
          this.openNodeNote(o);
        },
        onHoleHover: (o, a) => {
          if (o && a) {
            let l = o.boundaryNodes.map((c) => c.split("/").pop()?.replace(/\.md$/, "") ?? c);
            new E.Notice(
              `Missing face: ${a.headline}
${l.join(" \xB7 ")}`,
              3e3,
            );
          }
        },
        onHoleClick: (o, a) => {
          let l = o.boundaryNodes.map((c) => c.split("/").pop()?.replace(/\.md$/, "") ?? c);
          new E.Notice(
            `\u{1F573}\uFE0F ${a.headline}

Notes: ${l.join(" \xB7 ")}

${a.prompt}`,
            8e3,
          );
        },
      })),
      (this.index = new Ue(
        this.app,
        this.model,
        this.settings,
        () => this.engine.wake(),
        (o) => this.recordEncounter(o, "parser"),
      )),
      (this.topologyAnalysis = new lt(this.model)),
      this.topologyAnalysis.subscribe((o) => {
        o.status !== "ready" || !o.result || this.simplicialView?.setPersistenceEvents(dn(o.result.intervals));
      }),
      (this.releaseCycleHighlightTarget = this.cycleHighlightBus.registerTarget(this.renderer)),
      this.restorePinnedNodes(),
      this.registerView(Me, (o) => {
        let a = new yt(
          o,
          this.model,
          this.renderer,
          this.settings,
          () => {
            (this.applyLiveSettings(), this.queueSaveSettings());
          },
          (l, c) => this.scheduleFullScan(l, c),
          {
            recordEncounter: () => this.createEncounterFromOpenNote(),
            openContextuality: () => {
              this.activateSheafView();
            },
            findExpressiveView: () => this.findExpressiveView(),
          },
          this.history,
        );
        return ((this.simplicialView = a), a);
      }),
      this.registerView(ue, (o) => {
        let a = new ht(o, this.model);
        return (
          a.setActions({
            saveMetadata: (l, c) => this.persistSimplexMetadata(l, c),
            promoteSimplex: (l) => this.promoteSimplex(l),
            dissolveSimplex: (l) => this.dissolveSimplex(l),
            relaxSimplex: (l) => this.relaxSimplex(l),
            saveHyperedgeMetadata: (l, c) => this.saveHyperedgeMetadata(l, c),
            promoteEncounter: (l) => this.promoteEncounter(l),
            crystallizeEncounter: (l) => this.crystallizeEncounter(l),
            dissolveHyperedge: (l) => this.dissolveHyperedge(l),
            confirmSuggestedEncounter: (l) => this.confirmSuggestedEncounter(l),
          }),
          a.setHistory(this.history),
          a.setSettings(this.settings),
          a.setSubsetScorer(this.subsetScorer),
          (this.panelView = a),
          a
        );
      }),
      this.registerView(Re, (o) => {
        let a = new ft(o, this.model, this.settings, async () => {
          (await this.saveSettings(), this.refreshSheafAnalysis());
        });
        return ((this.sheafView = a), a);
      }),
      this.addCommand({
        id: "open-contextuality-lab",
        name: "Open contextuality lab",
        callback: () => {
          this.activateSheafView();
        },
      }),
      this.settings.enablePersistenceView &&
        (this.registerView(Te, (o) => {
          let a = new gt(o, this.model, this.settings, this.topologyAnalysis, this.cycleHighlightBus);
          return ((this.persistenceView = a), a);
        }),
        this.addCommand({
          id: "open-persistence-xray",
          name: "Open persistence X-ray",
          callback: () => {
            this.activatePersistenceView();
          },
        })),
      this.settings.enableDynamicsLab &&
        (this.registerView(De, (o) => new mt(o, this.model)),
        this.addCommand({
          id: "open-dynamics-lab",
          name: "Open dynamics lab",
          callback: () => {
            this.activateDynamicsLab();
          },
        })),
      this.addRibbonIcon("network", "Simplicial graph", () => {
        this.activateView();
      }),
      this.addCommand({
        id: "open-simplicial",
        name: "Open simplicial graph",
        callback: () => {
          this.activateView();
        },
      }),
      this.addCommand({
        id: "find-expressive-view",
        name: "Find expressive view (suggestion-only)",
        callback: () => {
          this.findExpressiveView();
        },
      }),
      this.addCommand({
        id: "insert-simplex-symbol",
        name: "Insert triangle simplex marker",
        editorCallback: (o) => o.replaceSelection("\u25B3 "),
      }),
      this.addCommand({
        id: "insert-hyperedge-symbol",
        name: "Insert encounter hyperedge marker",
        editorCallback: (o) => o.replaceSelection("\u25C7 "),
      }),
      this.addCommand({
        id: "form-simplex-from-open-note",
        name: "Simplicial: form simplex from open note",
        callback: () => {
          this.formSimplexFromOpenNote();
        },
      }),
      this.addCommand({
        id: "create-encounter",
        name: "Simplicial: create encounter from open note",
        callback: () => {
          this.createEncounterFromOpenNote();
        },
      }),
      this.addCommand({
        id: "toggle-edges",
        name: "Toggle simplicial edges",
        callback: () => {
          activeDocument.activeElement?.tagName === "INPUT" ||
            activeDocument.activeElement?.tagName === "TEXTAREA" ||
            ((this.settings.showEdges = !this.settings.showEdges), this.saveSettings(), this.renderer.render());
        },
      }),
      this.addCommand({
        id: "toggle-clusters",
        name: "Toggle simplicial clusters",
        callback: () => {
          activeDocument.activeElement?.tagName === "INPUT" ||
            activeDocument.activeElement?.tagName === "TEXTAREA" ||
            ((this.settings.showClusters = !this.settings.showClusters), this.saveSettings(), this.renderer.render());
        },
      }),
      this.addCommand({
        id: "toggle-cores",
        name: "Toggle simplicial cores",
        callback: () => {
          activeDocument.activeElement?.tagName === "INPUT" ||
            activeDocument.activeElement?.tagName === "TEXTAREA" ||
            ((this.settings.showCores = !this.settings.showCores), this.saveSettings(), this.renderer.render());
        },
      }),
      this.addCommand({
        id: "clear-simplicial-focus",
        name: "Clear simplicial focus",
        callback: () => {
          if (
            activeDocument.activeElement?.tagName === "INPUT" ||
            activeDocument.activeElement?.tagName === "TEXTAREA"
          ) {
            activeDocument.activeElement.blur();
            return;
          }
          (this.controller.clearFocus(), this.renderer.render());
        },
      }),
      this.addCommand({
        id: "focus-hovered-node",
        name: "Focus hovered simplicial node",
        callback: () => {
          activeDocument.activeElement?.tagName === "INPUT" ||
            activeDocument.activeElement?.tagName === "TEXTAREA" ||
            (this.controller.focusHoveredNode(),
            this.controller.lockedNodeId && this.registerActivation(this.controller.lockedNodeId, "focused"),
            this.renderer.render());
        },
      }),
      this.addCommand({
        id: "open-hovered-simplex-panel",
        name: "Open metadata panel for hovered simplex",
        callback: () => {
          activeDocument.activeElement?.tagName === "INPUT" ||
            activeDocument.activeElement?.tagName === "TEXTAREA" ||
            this.openPanelForCurrentSelection();
        },
      }),
      this.addSettingTab(new vt(this.app, this)),
      this.activation.configure({ halfLifeMinutes: this.settings.activationDecayHalfLifeMinutes }),
      this.registerEvent(
        this.app.workspace.on("file-open", (o) => {
          o && this.registerActivation(o.path, "opened");
        }),
      ),
      this.registerEvent(
        this.app.vault.on("modify", (o) => {
          o instanceof E.TFile && this.registerActivation(o.path, "edited");
        }),
      ),
      this.model.subscribe(() => {
        this.engine.wake();
      }),
      await this.logPersistenceState(),
      this.settings.enableRelationHistory && (await this.historyStore.load(this.history), this.syncEncounterState()),
      this.scheduleFullScan("startup", 0),
      this.app.workspace.onLayoutReady(() => {
        (this.scheduleFullScan("layout-ready", 50),
          i &&
            ((this.settings.topologyCorrectionNoticeShown = !0),
            new E.Notice(
              "Topology corrected in v0.4.5: \u03B2\u2081/\u03B2\u2082 are now actual homology ranks. Earlier values counted local missing-face motifs, and each empty triangle was counted three times. No note data was changed.",
              1e4,
            )),
          (i || n) && this.saveSettings());
      }),
      this.registerEvent(this.app.metadataCache.on("resolved", () => this.scheduleFullScan("metadata-resolved", 50))));
  }
  onunload() {
    (this.rescanTimer !== null && window.clearTimeout(this.rescanTimer),
      this.activationTimer !== null && window.clearTimeout(this.activationTimer),
      C.info("plugin", "Unloading plugin", {
        indexedNodeCount: this.model.nodes.size,
        simplexCount: this.model.simplices.size,
        hyperedgeCount: this.model.hyperedges.size,
        historyEventCount: this.history.size,
      }),
      this.renderer.destroy(),
      this.index.destroy(),
      this.releaseCycleHighlightTarget?.(),
      this.topologyAnalysis.dispose());
  }
  restorePinnedNodes() {
    (C.info("plugin", "Restoring pinned nodes", { pinnedNodeCount: Object.keys(this.settings.pinnedNodes).length }),
      Object.entries(this.settings.pinnedNodes).forEach(([e, n]) => {
        this.model.setNode(e, { isPinned: !0, px: n.px, py: n.py });
      }));
  }
  async saveSettings() {
    this.applyLiveSettings();
    let e = {};
    (this.model.getAllNodes().forEach((n) => {
      n.isPinned && (e[n.id] = { px: n.px, py: n.py });
    }),
      (this.settings.pinnedNodes = e),
      await this.saveData(this.settings),
      this.index?.updateSettings(this.settings),
      C.info("plugin", "Saved persistence state", {
        persistenceMode: this.settings.persistenceMode,
        centralFile: this.settings.centralFile,
        pinnedNodeCount: Object.keys(this.settings.pinnedNodes).length,
        filters: {
          edges: this.settings.showEdges,
          clusters: this.settings.showClusters,
          cores: this.settings.showCores,
        },
        inference: {
          linkBaseline: this.settings.linkGraphBaseline,
          enabled: this.settings.enableInferredEdges,
          threshold: this.settings.inferenceThreshold,
          suggestions: this.settings.showSuggestions,
          suggestionThreshold: this.settings.suggestionThreshold,
        },
        layout: {
          repulsion: this.settings.repulsionStrength,
          cohesion: this.settings.cohesionStrength,
          gravity: this.settings.gravityStrength,
          damping: this.settings.dampingFactor,
          boundaryPadding: this.settings.boundaryPadding,
          sparseEdgeLength: this.settings.sparseEdgeLength,
          sparseGravityBoost: this.settings.sparseGravityBoost,
          labelDensity: this.settings.labelDensity,
          renderFilterMetric: this.settings.renderFilterMetric,
          renderFilterThreshold: this.settings.renderFilterThreshold,
        },
        commandUi: {
          simplexSize: this.settings.commandSimplexSize,
          autoOpenPanel: this.settings.commandAutoOpenPanel,
          metadataHoverDelayMs: this.settings.metadataHoverDelayMs,
          formalMode: this.settings.formalMode,
        },
      }));
  }
  applyLiveSettings() {
    ((this.settings.enableBettiComputation = !1),
      (this.settings.formalMode = !0),
      this.engine.configure({
        noiseAmount: this.settings.noiseAmount,
        sleepThreshold: this.settings.sleepThreshold,
        repulsionStrength: this.settings.repulsionStrength,
        cohesionStrength: this.settings.cohesionStrength,
        gravityStrength: this.settings.gravityStrength,
        dampingFactor: this.settings.dampingFactor,
        boundaryPadding: this.settings.boundaryPadding,
        sparseEdgeLength: this.settings.sparseEdgeLength,
        sparseGravityBoost: this.settings.sparseGravityBoost,
      }),
      this.engine.refresh());
  }
  queueSaveSettings() {
    (this.saveTimer !== null && window.clearTimeout(this.saveTimer),
      (this.saveTimer = window.setTimeout(() => {
        ((this.saveTimer = null), this.saveSettings());
      }, 150)));
  }
  saveInteractionState(e) {
    ((this.settings.interactionState = Dn(e)), this.queueSaveSettings());
  }
  async activateView() {
    await this.app.workspace.getLeaf(!0).setViewState({ type: Me, active: !0 });
    let e = this.app.workspace.getRightLeaf(!1);
    e && (await e.setViewState({ type: ue, active: !1 }));
  }
  async activatePersistenceView() {
    await this.app.workspace.getLeaf(!0).setViewState({ type: Te, active: !0 });
  }
  async activateDynamicsLab() {
    await this.app.workspace.getLeaf(!0).setViewState({ type: De, active: !0 });
  }
  async activateSheafView() {
    await this.app.workspace.getLeaf(!0).setViewState({ type: Re, active: !0 });
  }
  refreshSheafAnalysis() {
    let e = je(this.settings);
    if (e.contexts.length === 0) {
      (this.renderer.setSheafReport(null), this.sheafView?.refresh());
      return;
    }
    let n = fe(this.model, e, Y(this.app, this.model));
    (this.renderer.setSheafReport(se(this.model, n)), this.sheafView?.refresh());
  }
  async persistSimplexMetadata(e, n) {
    (C.info("plugin", "Persisting simplex metadata", {
      simplexKey: e,
      updates: n,
      persistenceMode: this.settings.persistenceMode,
    }),
      this.model.updateMetadata(e, n));
    let i = this.model.getSimplex(e);
    if (!i?.sourcePath) {
      (C.warn("plugin", "Simplex has no sourcePath; only settings state will be saved", { simplexKey: e }),
        await this.saveSettings());
      return;
    }
    (await this.persistSimplex(i), await this.saveSettings());
  }
  formSimplexFromOpenNote() {
    let n = this.app.workspace.getActiveViewOfType(E.MarkdownView)?.file;
    if (!n) {
      new E.Notice("Open a note first.");
      return;
    }
    let r = this.app.metadataCache.getFileCache(n)?.links?.map((c) => c.link) ?? [],
      o = r
        .map((c) => this.app.metadataCache.getFirstLinkpathDest(c, n.path)?.path ?? c)
        .filter((c, u, d) => d.indexOf(c) === u),
      a = Math.max(2, Math.min(6, this.settings.commandSimplexSize)),
      l = [n.path, ...o].slice(0, a);
    if (
      (C.info("plugin", "Form simplex from open note requested", {
        sourcePath: n.path,
        linkCount: r.length,
        desiredSize: a,
        proposedNodes: l,
      }),
      l.length < a)
    ) {
      new E.Notice(`Need at least ${a - 1} resolvable outgoing links to form this simplex.`);
      return;
    }
    this.openCreateSimplexModal(l, n.path);
  }
  recordEncounter(e, n) {
    let i = this.history.occurrencesOf(e.nodes);
    (n === "parser" && i.length > 0) ||
      (this.history.append({
        type: i.length > 0 ? "recurred" : "encountered",
        kind: "hyperedge",
        nodes: e.nodes,
        actor: n,
        ...(e.label || e.mode
          ? { detail: { ...(e.label ? { label: e.label } : {}), ...(e.mode ? { mode: e.mode } : {}) } }
          : {}),
      }),
      this.syncEncounterState());
  }
  syncEncounterState() {
    gn(this.model, this.history, this.settings.encounterRecurrenceThreshold);
  }
  refreshEncounterSuggestions() {
    for (let [n, i] of [...this.model.hyperedges])
      i.suggested && i.suggestionSource === "encounter-discovery" && this.model.removeHyperedge(n);
    if (!this.settings.enableEncounterSuggestions) return 0;
    let e = Mn(this.model, {
      threshold: this.settings.encounterSuggestionThreshold,
      limit: this.settings.maxEncounterSuggestions,
      ...(this.subsetScorer ? { score: this.subsetScorer } : {}),
    });
    return (e.forEach((n) => this.model.addHyperedge(n)), e.length);
  }
  async confirmSuggestedEncounter(e) {
    let n = this.model.getHyperedge(e);
    if (!n?.suggested) return;
    let i = this.settings.persistenceMode === "central-file" ? this.settings.centralFile : n.nodes[0],
      r = {
        ...n,
        suggested: !1,
        suggestionSource: void 0,
        inferred: !1,
        mode: "encounter",
        occurredAt: Date.now(),
        persistence: "momentary",
        sourcePath: i,
      };
    (this.model.addHyperedge(r),
      this.recordEncounter(r, "user"),
      await this.persistHyperedge(this.model.getHyperedge(e)),
      this.panelView?.setSelection({ kind: "hyperedge", key: e }),
      new E.Notice("Encounter confirmed and recorded."));
  }
  registerActivation(e, n) {
    this.model.nodes.has(e) && (this.activation.register(e, n), this.refreshActivation());
  }
  refreshActivation() {
    this.activationTimer !== null && window.clearTimeout(this.activationTimer);
    let e = this.activation.field(),
      n = Nt(this.model, "hypergraph");
    (this.renderer.setActivation(bn(n, e, 3)),
      this.engine.wake(),
      e.size !== 0 &&
        (this.activationTimer = window.setTimeout(() => {
          ((this.activationTimer = null), this.refreshActivation());
        }, 2e4)));
  }
  rebuildSubsetScorer() {
    let e = this.index.getInferenceContexts();
    ((this.subsetScorer = e.length > 0 ? En(e, this.settings) : null),
      this.panelView?.setSubsetScorer(this.subsetScorer));
  }
  createEncounterFromOpenNote() {
    let n = this.app.workspace.getActiveViewOfType(E.MarkdownView)?.file;
    if (!n) {
      new E.Notice("Open a note first.");
      return;
    }
    let o = (this.app.metadataCache.getFileCache(n)?.links?.map((l) => l.link) ?? [])
        .map((l) => this.app.metadataCache.getFirstLinkpathDest(l, n.path)?.path ?? l)
        .filter((l, c, u) => u.indexOf(l) === c),
      a = [n.path, ...o];
    if (a.length < 2) {
      new E.Notice("Need at least one resolvable outgoing link to record an encounter.");
      return;
    }
    (C.info("plugin", "Create encounter from open note requested", { sourcePath: n.path, participantCount: a.length }),
      this.openCreateRelationModal(a, n.path, "hyperedge"));
  }
  async createHyperedge(e, n) {
    let i = e.nodes.map((l) => this.resolveDraftNode(l, n)),
      r = this.settings.persistenceMode === "central-file" ? this.settings.centralFile : n,
      o = {
        nodes: i,
        label: e.label,
        weight: e.weight,
        mode: e.mode ?? "encounter",
        occurredAt: Date.now(),
        persistence: "momentary",
        sourcePath: r,
      },
      a = this.model.addHyperedge(o);
    return a
      ? (this.recordEncounter({ ...o, nodes: this.model.getHyperedge(a).nodes }, "user"),
        await this.persistHyperedge(this.model.getHyperedge(a)),
        a)
      : "";
  }
  async persistHyperedge(e) {
    if (e.suggested) return;
    if (
      e.sourcePath === this.settings.centralFile ||
      (!e.sourcePath && this.settings.persistenceMode === "central-file")
    ) {
      let { file: o, content: a } = await Yn(this.app, this.settings.centralFile, {
        ...e,
        sourcePath: this.settings.centralFile,
      });
      (await this.app.vault.modify(o, a), this.index.recordWrite(o.path, a));
      return;
    }
    let i = this.app.vault.getAbstractFileByPath(e.sourcePath ?? "");
    if (!(i instanceof E.TFile)) {
      C.warn("plugin", "Unable to persist hyperedge to source note", { nodeKey: w(e.nodes), sourcePath: e.sourcePath });
      return;
    }
    let r = await Un(this.app, i, e);
    (await this.app.vault.modify(i, r), this.index.recordWrite(i.path, r));
  }
  async removeHyperedgeFromNote(e) {
    let n = w(e.nodes),
      r =
        e.sourcePath === this.settings.centralFile ||
        (!e.sourcePath && this.settings.persistenceMode === "central-file")
          ? await X(this.app, this.settings.centralFile)
          : this.app.vault.getAbstractFileByPath(e.sourcePath ?? "");
    if (!(r instanceof E.TFile)) return;
    let o = await Xn(this.app, r, n);
    (await this.app.vault.modify(r, o), this.index.recordWrite(r.path, o));
  }
  promoteEncounter(e) {
    let n = this.model.getHyperedge(e);
    if (!n) return;
    let i = this.model.facesImpliedByPromotion(e);
    new ut(this.app, n.nodes, i, async () => {
      let r = this.model.promoteToSimplex(e);
      if (!r) return;
      this.history.append({
        type: "promoted",
        kind: "hyperedge",
        nodes: n.nodes,
        actor: "user",
        prior: { persistence: n.persistence ?? "momentary" },
        detail: { createdFaceCount: r.createdFaces.length },
      });
      let o = this.model.getSimplex(r.simplexKey);
      (o && (await this.persistSimplex(o)),
        await this.persistHyperedge(this.model.getHyperedge(e)),
        this.controller.selectSimplex(r.simplexKey),
        await this.openPanel({ kind: "simplex", key: r.simplexKey }, !1),
        new E.Notice(
          r.createdFaces.length > 0
            ? `Promoted. ${r.createdFaces.length} face${r.createdFaces.length === 1 ? "" : "s"} asserted.`
            : "Promoted. Every implied face already existed.",
        ));
    }).open();
  }
  async relaxSimplex(e) {
    let n = this.model.getSimplex(e);
    if (!n || n.autoGenerated) return;
    let i = this.model.relaxToHyperedge(e);
    if (!i) return;
    this.history.append({
      type: "relaxed",
      kind: "simplex",
      nodes: n.nodes,
      actor: "user",
      prior: { label: n.label ?? null, weight: n.weight ?? null },
    });
    let r = this.app.vault.getAbstractFileByPath(n.sourcePath ?? "");
    if (r instanceof E.TFile) {
      let o = await Ie(this.app, r, e);
      (await this.app.vault.modify(r, o), this.index.recordWrite(r.path, o));
    }
    (await this.persistHyperedge(this.model.getHyperedge(i)),
      this.controller.selectHyperedge(i),
      await this.openPanel({ kind: "hyperedge", key: i }, !1),
      new E.Notice("Relaxed to encounter. The group relation is kept; its faces are not asserted."));
  }
  async crystallizeEncounter(e) {
    let n = this.model.getHyperedge(e);
    if (!n) return;
    let i = n.label?.trim() || `encounter-${w(n.nodes).replace(/[|/]/g, "-")}`,
      r = this.settings.crystallizeFolder.replace(/\/+$/, ""),
      o = n.nodes.map((c) => `  - "[[${c.replace(/\.md$/, "")}]]"`).join(`
`),
      a = [
        "---",
        `originatingEncounter: "${M("hyperedge", n.nodes)}"`,
        "crystallizedFrom:",
        o,
        `crystallizedAt: ${Date.now()}`,
        "---",
        "",
        `# ${i}`,
        "",
        "This note names a concept that emerged from a recurring encounter between:",
        "",
        ...n.nodes.map((c) => `- [[${c.replace(/\.md$/, "")}]]`),
        "",
        "The encounter is retained unpromoted \u2014 the triad recurring is evidence, not proof,",
        "that its pairs are meaningful on their own.",
        "",
      ].join(`
`),
      l = await tn(this.app, r ? `${r}/${i}` : i, a);
    (this.index.recordWrite(l.path, a),
      this.model.crystallizeHyperedge(e, l.path),
      this.history.append({
        type: "crystallized",
        kind: "hyperedge",
        nodes: n.nodes,
        actor: "user",
        detail: { conceptNote: l.path },
      }),
      await this.persistHyperedge(this.model.getHyperedge(e)),
      new E.Notice(`Crystallized into ${l.basename}. The encounter is unchanged.`),
      await this.app.workspace.getLeaf(!0).openFile(l));
  }
  async dissolveHyperedge(e) {
    let n = this.model.getHyperedge(e);
    if (n) {
      if (n.suggested) {
        (this.model.removeHyperedge(e),
          this.panelView?.setSelection(null),
          new E.Notice("Encounter suggestion dismissed."));
        return;
      }
      (await this.removeHyperedgeFromNote(n),
        this.model.removeHyperedge(e),
        this.history.append({
          type: "dissolved",
          kind: "hyperedge",
          nodes: n.nodes,
          actor: "user",
          prior: { label: n.label ?? null, mode: n.mode ?? null },
        }),
        this.controller.clearFocus(),
        this.panelView?.setSelection(null),
        new E.Notice("Encounter dissolved. Its history is kept."));
    }
  }
  async saveHyperedgeMetadata(e, n) {
    let i = this.model.updateHyperedge(e, n);
    i && (await this.persistHyperedge(i));
  }
  async promoteSimplex(e) {
    let n = this.model.getSimplex(e);
    if (!n || n.autoGenerated) return;
    this.controller.logPromote(e, n.nodes);
    let i = n.label?.trim() || `simplex-${e.replace(/\|/g, "-")}`,
      r = n.nodes.map((u) => `- [[${u.replace(/\.md$/, "")}]]`).join(`
`),
      o = await tn(this.app, i, r),
      a = { ...n, sourcePath: o.path, userDefined: !0, inferred: !1, suggested: !1, autoGenerated: !1 };
    if (n.sourcePath && n.sourcePath !== o.path) {
      let u = this.app.vault.getAbstractFileByPath(n.sourcePath);
      if (u instanceof E.TFile) {
        let d = await Ie(this.app, u, e);
        (await this.app.vault.modify(u, d), this.index.recordWrite(u.path, d));
      }
    }
    let l = await jt(this.app, o, a);
    (await this.app.vault.modify(o, l), this.index.recordWrite(o.path, l), this.model.removeSimplex(e));
    let c = this.model.addSimplex(a);
    (this.controller.selectSimplex(c),
      await this.openPanel(c, !1),
      new E.Notice(`Simplex now owned by ${o.basename}.`));
  }
  openCreateSimplexModal(e, n) {
    this.openCreateRelationModal(e, n, "simplex");
  }
  openCreateRelationModal(e, n, i) {
    let r = this.settings.persistenceMode === "central-file" ? this.settings.centralFile : n;
    new dt(
      this.app,
      e,
      r,
      async (o) => {
        if (o.kind === "hyperedge") {
          let c = await this.createHyperedge(o, n);
          if (!c) return;
          (this.controller.selectHyperedge(c),
            this.settings.commandAutoOpenPanel && (await this.openPanel({ kind: "hyperedge", key: c }, !1)),
            C.info("plugin", "Encounter created from guided modal", {
              relationKey: c,
              sourcePath: r,
              hyperedgeCount: this.model.hyperedges.size,
            }),
            new E.Notice(
              this.settings.persistenceMode === "central-file"
                ? `Encounter added to ${this.settings.centralFile}. No faces were generated.`
                : "Encounter added to note frontmatter. No faces were generated.",
            ));
          return;
        }
        let a = {
            nodes: o.nodes.map((c) => this.resolveDraftNode(c, n)),
            label: o.label,
            weight: o.weight,
            sourcePath: r,
            userDefined: !0,
            autoGenerated: !1,
          },
          l = this.model.addSimplex(a);
        (await this.persistSimplex(this.model.getSimplex(l)),
          this.history.append({ type: "created", kind: "simplex", nodes: a.nodes, actor: "user" }),
          this.controller.selectSimplex(l),
          this.settings.commandAutoOpenPanel && (await this.openPanel(l, !1)),
          C.info("plugin", "Simplex created from guided modal", {
            simplexKey: l,
            sourcePath: a.sourcePath,
            simplexCount: this.model.simplices.size,
          }),
          new E.Notice(
            this.settings.persistenceMode === "central-file"
              ? `Simplex added to ${this.settings.centralFile}.`
              : "Simplex added to note frontmatter.",
          ));
      },
      i,
    ).open();
  }
  async openPanelForCurrentSelection() {
    let e =
      this.controller.hoveredSimplexKey ??
      (this.controller.hoveredNodeId && this.model.getSimplicesForNode(this.controller.hoveredNodeId)[0]?.nodes
        ? w(this.model.getSimplicesForNode(this.controller.hoveredNodeId)[0].nodes)
        : null);
    await this.openPanel(e, !0);
  }
  async logPersistenceState() {
    (C.info("plugin", "Persistence state", {
      mode: this.settings.persistenceMode,
      centralFile: this.settings.centralFile,
    }),
      this.settings.persistenceMode === "central-file"
        ? await Jn(this.app, this.settings.centralFile)
        : C.info("persistence", "Source-note persistence active", { mode: this.settings.persistenceMode }));
  }
  async persistSimplex(e) {
    if (
      e.sourcePath === this.settings.centralFile ||
      (!e.sourcePath && this.settings.persistenceMode === "central-file")
    ) {
      let { file: o, content: a } = await Zn(this.app, this.settings.centralFile, {
        ...e,
        sourcePath: this.settings.centralFile,
      });
      (await this.app.vault.modify(o, a),
        this.index.recordWrite(o.path, a),
        C.info("plugin", "Persisted simplex to central file", { simplexKey: w(e.nodes), path: o.path }));
      return;
    }
    let i = this.app.vault.getAbstractFileByPath(e.sourcePath ?? "");
    if (!(i instanceof E.TFile)) {
      C.warn("plugin", "Unable to persist simplex to source note", {
        simplexKey: w(e.nodes),
        sourcePath: e.sourcePath,
      });
      return;
    }
    let r = await jt(this.app, i, e);
    (await this.app.vault.modify(i, r),
      this.index.recordWrite(i.path, r),
      C.info("plugin", "Persisted simplex to source note", { simplexKey: w(e.nodes), path: i.path }));
  }
  openCanvasContextMenu(e, n) {
    let i = new E.Menu();
    if (
      (e.nodeId &&
        (i.addItem((r) =>
          r
            .setTitle("Open note")
            .setIcon("file-text")
            .onClick(() => {
              this.openNodeNote(e.nodeId);
            }),
        ),
        i.addItem((r) =>
          r
            .setTitle("Focus node")
            .setIcon("crosshair")
            .onClick(() => {
              ((this.controller.hoveredNodeId = e.nodeId), this.controller.focusHoveredNode(), this.renderer.render());
            }),
        ),
        i.addItem((r) =>
          r
            .setTitle("Create simplex from node + neighbors")
            .setIcon("plus-circle")
            .onClick(() => {
              this.createSimplexFromNode(e.nodeId);
            }),
        ),
        i.addItem((r) =>
          r
            .setTitle("Record encounter from node + neighbors")
            .setIcon("diamond")
            .onClick(() => {
              this.createEncounterFromNode(e.nodeId);
            }),
        ),
        i.addItem((r) =>
          r
            .setTitle(this.model.nodes.get(e.nodeId)?.isPinned ? "Unpin node" : "Pin node")
            .setIcon("pin")
            .onClick(() => {
              (this.controller.togglePin(e.nodeId), this.renderer.render());
            }),
        )),
      e.simplexKey &&
        (i.addItem((r) =>
          r
            .setTitle("Open metadata")
            .setIcon("info")
            .onClick(() => {
              this.openPanel(e.simplexKey, !0);
            }),
        ),
        i.addItem((r) =>
          r
            .setTitle("Promote to note")
            .setIcon("up-right-from-square")
            .onClick(() => {
              this.promoteSimplex(e.simplexKey);
            }),
        ),
        i.addItem((r) =>
          r
            .setTitle("Dissolve simplex")
            .setIcon("trash")
            .onClick(() => {
              this.dissolveSimplex(e.simplexKey);
            }),
        ),
        i.addItem((r) =>
          r
            .setTitle("Relax to encounter")
            .setIcon("diamond")
            .onClick(() => {
              this.relaxSimplex(e.simplexKey);
            }),
        ),
        i.addItem((r) =>
          r
            .setTitle("Show in formal view")
            .setIcon("sigma")
            .onClick(async () => {
              ((this.settings.formalMode = !0),
                await this.saveSettings(),
                this.controller.selectSimplex(e.simplexKey),
                this.applyLiveSettings());
            }),
        )),
      e.hyperedgeKey)
    ) {
      let r = this.model.getHyperedge(e.hyperedgeKey);
      (i.addItem((o) =>
        o
          .setTitle("Open encounter")
          .setIcon("info")
          .onClick(() => {
            this.openPanel({ kind: "hyperedge", key: e.hyperedgeKey }, !0);
          }),
      ),
        i.addItem((o) =>
          o
            .setTitle("Promote to simplex")
            .setIcon("triangle")
            .onClick(() => this.promoteEncounter(e.hyperedgeKey)),
        ),
        r?.persistence === "recurring" &&
          i.addItem((o) =>
            o
              .setTitle("Crystallize concept")
              .setIcon("sparkles")
              .onClick(() => {
                this.crystallizeEncounter(e.hyperedgeKey);
              }),
          ),
        i.addItem((o) =>
          o
            .setTitle("Dissolve encounter")
            .setIcon("trash")
            .onClick(() => {
              this.dissolveHyperedge(e.hyperedgeKey);
            }),
        ));
    }
    i.showAtMouseEvent(n);
  }
  async openNodeNote(e) {
    let n = this.app.vault.getAbstractFileByPath(e),
      i = n instanceof E.TFile ? n : Fe(e, e, this.app);
    if (!(i instanceof E.TFile)) {
      new E.Notice("This node is not backed by a note yet.");
      return;
    }
    await this.app.workspace.getLeaf(!0).openFile(i);
  }
  createSimplexFromNode(e) {
    let n = this.model.getNeighbors(e),
      i = [e, ...n].slice(0, Math.max(2, this.settings.commandSimplexSize));
    if (i.length < 2) {
      new E.Notice("Need at least one connected neighbor to form a simplex.");
      return;
    }
    this.openCreateSimplexModal(i, e);
  }
  createEncounterFromNode(e) {
    let n = [e, ...this.model.getNeighbors(e)];
    if (n.length < 2) {
      new E.Notice("Need at least one connected neighbor to record an encounter.");
      return;
    }
    this.openCreateRelationModal(n, e, "hyperedge");
  }
  async dissolveSimplex(e) {
    let n = this.model.getSimplex(e);
    if (!n || n.autoGenerated) return;
    if (
      (this.controller.logDissolve(e, n.nodes),
      n.sourcePath === this.settings.centralFile || (!n.sourcePath && this.settings.persistenceMode === "central-file"))
    ) {
      let r = await X(this.app, this.settings.centralFile),
        o = await Ie(this.app, r, e);
      (await this.app.vault.modify(r, o), this.index.recordWrite(r.path, o));
    } else {
      let r = n.sourcePath ?? "",
        o = this.app.vault.getAbstractFileByPath(r);
      if (!(o instanceof E.TFile)) return;
      let a = await Ie(this.app, o, e);
      (await this.app.vault.modify(o, a), this.index.recordWrite(o.path, a));
    }
    (this.model.removeSimplex(e),
      this.controller.clearFocus(),
      this.panelView?.setSelection(null),
      C.info("plugin", "Dissolved simplex", { simplexKey: e, persistenceMode: this.settings.persistenceMode }));
  }
  async openPanel(e, n) {
    let i = this.app.workspace.getRightLeaf(!1);
    if (!i) return;
    let r = typeof e == "string" ? { kind: "simplex", key: e } : e;
    (await i.setViewState({ type: ue, active: n }),
      this.panelView?.setSelection(r),
      C.info("plugin", "Opened metadata panel", { kind: r?.kind ?? null, relationKey: r?.key ?? null, active: n }));
  }
  resolveDraftNode(e, n) {
    return this.app.metadataCache.getFirstLinkpathDest(e, n)?.path ?? e.trim();
  }
  scheduleFullScan(e, n) {
    (this.rescanTimer !== null && window.clearTimeout(this.rescanTimer),
      (this.rescanTimer = window.setTimeout(async () => {
        ((this.rescanTimer = null),
          C.info("plugin", "Running full scan", { reason: e }),
          await this.index.fullScan(),
          this.syncEncounterState(),
          this.rebuildSubsetScorer());
        let i = this.refreshEncounterSuggestions();
        (this.refreshSheafAnalysis(),
          this.settings.discoveryNoticeShown ||
            ((this.settings.discoveryNoticeShown = !0),
            await this.saveSettings(),
            new E.Notice(
              i > 0
                ? `Found ${i} possible \u25C7 encounter${i === 1 ? "" : "s"}. Open the Simplicial graph to review them; nothing was written automatically.`
                : "New: record irreducible groups with \u25C7, compare attention in Dynamics Lab, and define overlapping readings in the Contextuality Lab.",
              9e3,
            )),
          C.info("plugin", "Full scan complete", {
            reason: e,
            indexedNodeCount: this.model.nodes.size,
            simplexCount: this.model.simplices.size,
          }));
      }, n)));
  }
  async findExpressiveView() {
    (Object.assign(this.settings, {
      inferenceMode: "hybrid",
      inferenceEmits: "simplex",
      enableInferredEdges: !0,
      enableLinkInference: !0,
      enableMutualLinkBonus: !0,
      enableSharedTags: !0,
      enableTitleOverlap: !0,
      enableContentOverlap: !0,
      enableSameFolderInference: !0,
      enableSameTopFolderInference: !0,
      insightThreshold: 0.35,
      linkStrengthThreshold: 0.32,
      suggestionThreshold: 0.28,
      showSuggestions: !0,
      enableEncounterSuggestions: !0,
      encounterSuggestionThreshold: 0.48,
      showHyperedges: !0,
      maxRenderedDim: 12,
      renderFilterThreshold: 0,
    }),
      await this.saveSettings(),
      await this.index.fullScan(),
      this.syncEncounterState(),
      this.rebuildSubsetScorer());
    let e = this.refreshEncounterSuggestions();
    (this.refreshSheafAnalysis(),
      this.sheafView?.revealDiscoverySuggestions(),
      this.simplicialView?.refreshSettings(),
      this.renderer.render());
    let n = [...this.model.simplices.values()].filter((i) => i.inferred).length;
    new E.Notice(
      `Expressive view ready: ${n} inferred relation${n === 1 ? "" : "s"} and ${e} possible encounter${e === 1 ? "" : "s"}. Review before confirming; no suggestions were written to notes.`,
      9e3,
    );
  }
};