@wanshi-kg/wanshi 0.1.0

package/dist/quality/index.js

@@ -0,0 +1,23 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./StructuralMetrics"), exports);
+__exportStar(require("./GraphHealthMetrics"), exports);
+__exportStar(require("./SemanticMetrics"), exports);
+__exportStar(require("./FactualMetrics"), exports);
+__exportStar(require("./ConsistencyMetrics"), exports);
+__exportStar(require("./CompositeScore"), exports);
+//# sourceMappingURL=index.js.map

package/dist/quality/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/quality/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,sDAAoC;AACpC,uDAAqC;AACrC,oDAAkC;AAClC,mDAAiC;AACjC,uDAAqC;AACrC,mDAAiC"}

package/dist/shared/index.js

@@ -0,0 +1,20 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./logger"), exports);
+__exportStar(require("./utils"), exports);
+__exportStar(require("./shutdown"), exports);
+//# sourceMappingURL=index.js.map

package/dist/shared/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/shared/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,2CAAyB;AACzB,0CAAwB;AACxB,6CAA2B"}

package/dist/shared/logger/Logger.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=Logger.js.map

package/dist/shared/logger/Logger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Logger.js","sourceRoot":"","sources":["../../../src/shared/logger/Logger.ts"],"names":[],"mappings":""}

package/dist/shared/logger/LoggerFactory.js

@@ -0,0 +1,75 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LoggerFactory = void 0;
+const fs_1 = require("fs");
+const tslog_1 = require("tslog");
+class LoggerFactory {
+    static createLogger(options) {
+        var _a;
+        const { file: logFile, level: logLevel, silent, debug, progressNdjson, } = (_a = options.logging) !== null && _a !== void 0 ? _a : {};
+        const logger = new tslog_1.Logger({
+            name: "wanshi",
+            // In NDJSON progress mode, suppress tslog's built-in pretty output so it
+            // can't pollute the structured stdout stream; we re-emit logs ourselves as
+            // `channel: "log"` lines below.
+            type: progressNdjson ? "hidden" : "pretty",
+            // tslog scale: silly=0, trace=1, debug=2, info=3, warn=4, error=5, fatal=6.
+            // The old mapping was two notches loose (info→1 = "trace and up"), and
+            // `silent` at 4 still printed warn/error. (KG-19)
+            minLevel: silent
+                ? 7 // above fatal → nothing prints
+                : debug
+                    ? 2
+                    : logLevel === "debug"
+                        ? 2
+                        : logLevel === "info"
+                            ? 3
+                            : logLevel === "warning"
+                                ? 4
+                                : logLevel === "error"
+                                    ? 5
+                                    : 3,
+        });
+        if (progressNdjson) {
+            // Bridge logs onto the same NDJSON stdout stream the progress emitter uses,
+            // so a parent process gets a live log tail demuxed by `channel`.
+            logger.attachTransport((logObj) => {
+                var _a, _b;
+                try {
+                    process.stdout.write(JSON.stringify({
+                        channel: "log",
+                        ts: Date.now(),
+                        level: String((_b = (_a = logObj === null || logObj === void 0 ? void 0 : logObj._meta) === null || _a === void 0 ? void 0 : _a.logLevelName) !== null && _b !== void 0 ? _b : "INFO").toLowerCase(),
+                        message: stringifyLogArgs(logObj),
+                    }) + "\n");
+                }
+                catch (_c) {
+                    // side-channel only — swallow write errors (e.g. EPIPE)
+                }
+            });
+        }
+        if (logFile) {
+            logger.attachTransport((logObj) => {
+                (0, fs_1.appendFileSync)(logFile, JSON.stringify(logObj) + "\n");
+            });
+        }
+        return logger;
+    }
+}
+exports.LoggerFactory = LoggerFactory;
+/**
+ * tslog passes logged arguments as numeric keys (`0`, `1`, …) on the log object
+ * alongside the `_meta` block. Join the string parts into a single message,
+ * JSON-stringifying any non-string argument.
+ */
+function stringifyLogArgs(logObj) {
+    const parts = [];
+    for (const key of Object.keys(logObj)) {
+        if (key === "_meta")
+            continue;
+        const value = logObj[key];
+        parts.push(typeof value === "string" ? value : JSON.stringify(value));
+    }
+    return parts.join(" ");
+}
+//# sourceMappingURL=LoggerFactory.js.map

package/dist/shared/logger/LoggerFactory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LoggerFactory.js","sourceRoot":"","sources":["../../../src/shared/logger/LoggerFactory.ts"],"names":[],"mappings":";;;AAAA,2BAAoC;AACpC,iCAA2C;AAI3C,MAAa,aAAa;IACxB,MAAM,CAAC,YAAY,CACjB,OAA4D;;QAE5D,MAAM,EACJ,IAAI,EAAE,OAAO,EACb,KAAK,EAAE,QAAQ,EACf,MAAM,EACN,KAAK,EACL,cAAc,GACf,GAAG,MAAA,OAAO,CAAC,OAAO,mCAAI,EAAE,CAAC;QAE1B,MAAM,MAAM,GAAG,IAAI,cAAQ,CAAM;YAC/B,IAAI,EAAE,QAAQ;YACd,yEAAyE;YACzE,2EAA2E;YAC3E,gCAAgC;YAChC,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ;YAC1C,4EAA4E;YAC5E,uEAAuE;YACvE,kDAAkD;YAClD,QAAQ,EAAE,MAAM;gBACd,CAAC,CAAC,CAAC,CAAC,+BAA+B;gBACnC,CAAC,CAAC,KAAK;oBACP,CAAC,CAAC,CAAC;oBACH,CAAC,CAAC,QAAQ,KAAK,OAAO;wBACtB,CAAC,CAAC,CAAC;wBACH,CAAC,CAAC,QAAQ,KAAK,MAAM;4BACrB,CAAC,CAAC,CAAC;4BACH,CAAC,CAAC,QAAQ,KAAK,SAAS;gCACxB,CAAC,CAAC,CAAC;gCACH,CAAC,CAAC,QAAQ,KAAK,OAAO;oCACtB,CAAC,CAAC,CAAC;oCACH,CAAC,CAAC,CAAC;SACN,CAAC,CAAC;QAEH,IAAI,cAAc,EAAE,CAAC;YACnB,4EAA4E;YAC5E,iEAAiE;YACjE,MAAM,CAAC,eAAe,CAAC,CAAC,MAAM,EAAE,EAAE;;gBAChC,IAAI,CAAC;oBACH,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,IAAI,CAAC,SAAS,CAAC;wBACb,OAAO,EAAE,KAAK;wBACd,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE;wBACd,KAAK,EAAE,MAAM,CAAC,MAAA,MAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,KAAK,0CAAE,YAAY,mCAAI,MAAM,CAAC,CAAC,WAAW,EAAE;wBAClE,OAAO,EAAE,gBAAgB,CAAC,MAAM,CAAC;qBAClC,CAAC,GAAG,IAAI,CACV,CAAC;gBACJ,CAAC;gBAAC,WAAM,CAAC;oBACP,wDAAwD;gBAC1D,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;QAED,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,CAAC,eAAe,CAAC,CAAC,MAAM,EAAE,EAAE;gBAChC,IAAA,mBAAc,EAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,MAAgB,CAAC;IAC1B,CAAC;CACF;AA/DD,sCA+DC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,MAA+B;IACvD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACtC,IAAI,GAAG,KAAK,OAAO;YAAE,SAAS;QAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1B,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC"}

package/dist/shared/logger/index.js

@@ -0,0 +1,19 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./Logger"), exports);
+__exportStar(require("./LoggerFactory"), exports);
+//# sourceMappingURL=index.js.map

package/dist/shared/logger/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/shared/logger/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,2CAAyB;AACzB,kDAAgC"}

package/dist/shared/shutdown.js

@@ -0,0 +1,30 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.shutdown = void 0;
+/**
+ * Process-wide cooperative shutdown flag for graceful interrupts (Ctrl+C / Ctrl+D).
+ *
+ * The long-running processing loops poll `isRequested()` between units of work
+ * (between files in DirectoryProcessor, between chunks in KnowledgeGraphBuilder)
+ * and stop cleanly — finishing the in-flight chunk, checkpointing it, and flushing
+ * a partial graph — instead of being killed mid-chunk and wasting a paid LLM call.
+ *
+ * A module singleton keeps this low-ceremony for a single-run CLI: the signal
+ * handlers in the CLI flip the flag, the loops read it. No DI plumbing.
+ */
+class ShutdownController {
+    constructor() {
+        this.requested = false;
+    }
+    isRequested() {
+        return this.requested;
+    }
+    request() {
+        this.requested = true;
+    }
+    reset() {
+        this.requested = false;
+    }
+}
+exports.shutdown = new ShutdownController();
+//# sourceMappingURL=shutdown.js.map

package/dist/shared/shutdown.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shutdown.js","sourceRoot":"","sources":["../../src/shared/shutdown.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;GAUG;AACH,MAAM,kBAAkB;IAAxB;QACU,cAAS,GAAG,KAAK,CAAC;IAa5B,CAAC;IAXC,WAAW;QACT,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,OAAO;QACL,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;IACxB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;CACF;AAEY,QAAA,QAAQ,GAAG,IAAI,kBAAkB,EAAE,CAAC"}

package/dist/shared/utils/agglomerativeCluster.js

@@ -0,0 +1,269 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.agglomerativeClusters = agglomerativeClusters;
+exports.clusterByEmbedding = clusterByEmbedding;
+const cosineSimilarity_1 = require("./cosineSimilarity");
+/** Minimal union-find (path compression + union by size). */
+class UnionFind {
+    constructor(n) {
+        this.parent = Array.from({ length: n }, (_, i) => i);
+        this.size = new Array(n).fill(1);
+    }
+    find(x) {
+        while (this.parent[x] !== x) {
+            this.parent[x] = this.parent[this.parent[x]];
+            x = this.parent[x];
+        }
+        return x;
+    }
+    union(a, b) {
+        let ra = this.find(a);
+        let rb = this.find(b);
+        if (ra === rb)
+            return;
+        if (this.size[ra] < this.size[rb])
+            [ra, rb] = [rb, ra];
+        this.parent[rb] = ra;
+        this.size[ra] += this.size[rb];
+    }
+    connected(a, b) {
+        return this.find(a) === this.find(b);
+    }
+}
+/**
+ * Symmetric top-N eligibility matrix: `m[i][j]` is true iff j is among i's N most
+ * similar neighbours OR vice versa. Returns null when blocking is off (topN ≤ 0),
+ * meaning "all pairs eligible". Pure.
+ */
+function blockingEligibility(sim, n, topN) {
+    if (!topN || topN <= 0 || topN >= n - 1)
+        return null;
+    const m = Array.from({ length: n }, () => new Array(n).fill(false));
+    for (let i = 0; i < n; i++) {
+        const neighbours = [...Array(n).keys()]
+            .filter((j) => j !== i)
+            .sort((a, b) => sim[i][b] - sim[i][a])
+            .slice(0, topN);
+        for (const j of neighbours) {
+            m[i][j] = true;
+            m[j][i] = true; // symmetric: eligible if in EITHER endpoint's top-N
+        }
+    }
+    return m;
+}
+/** Group item indices by their union-find root, returned as id clusters. */
+function clustersFromUF(items, uf) {
+    const groups = new Map();
+    for (let i = 0; i < items.length; i++) {
+        const root = uf.find(i);
+        const g = groups.get(root);
+        if (g)
+            g.push(items[i].id);
+        else
+            groups.set(root, [items[i].id]);
+    }
+    return Array.from(groups.values());
+}
+/**
+ * Single-linkage agglomerative clustering: connected components of the graph
+ * where an edge joins two items whose cosine similarity ≥ `threshold`. Pure and
+ * synchronous; singletons are returned as one-element clusters. This is the
+ * embeddings-method workhorse for canonicalization.
+ */
+function agglomerativeClusters(items, threshold) {
+    const uf = new UnionFind(items.length);
+    for (let i = 0; i < items.length; i++) {
+        for (let j = i + 1; j < items.length; j++) {
+            if ((0, cosineSimilarity_1.cosineSimilarity)(items[i].embedding, items[j].embedding) >= threshold) {
+                uf.union(i, j);
+            }
+        }
+    }
+    return clustersFromUF(items, uf);
+}
+/**
+ * Clustering with a pluggable per-pair policy, shared by all canonicalization
+ * methods:
+ *   - embeddings: decide = sim ≥ threshold ? "merge" : "reject" (no escalation)
+ *   - llm/hybrid: decide = sim ≥ high ? "merge" : sim ≥ low ? "escalate" : "reject",
+ *     with the band escalated to the LLM adjudicator.
+ *
+ * "merge" pairs are unioned first; "escalate" pairs are then adjudicated highest
+ * similarity first (and skipped when already transitively merged). Pairs whose
+ * similarity falls in `band` are recorded as borderline with their final
+ * merged/not-merged outcome — the signal the merge-log viewer surfaces.
+ */
+function clusterByEmbedding(items, opts) {
+    return __awaiter(this, void 0, void 0, function* () {
+        var _a;
+        if (((_a = opts.linkage) !== null && _a !== void 0 ? _a : "single") === "complete") {
+            return completeLinkageCluster(items, opts);
+        }
+        const uf = new UnionFind(items.length);
+        const escalate = [];
+        const bandPairs = [];
+        for (let i = 0; i < items.length; i++) {
+            for (let j = i + 1; j < items.length; j++) {
+                const sim = (0, cosineSimilarity_1.cosineSimilarity)(items[i].embedding, items[j].embedding);
+                if (opts.band && sim >= opts.band[0] && sim < opts.band[1]) {
+                    bandPairs.push({ i, j, sim });
+                }
+                const d = opts.decide(sim, items[i].id, items[j].id);
+                if (d === "merge")
+                    uf.union(i, j);
+                else if (d === "escalate")
+                    escalate.push({ i, j, sim });
+            }
+        }
+        // Adjudicate escalated pairs, most-similar first; skip pairs already merged
+        // transitively (a no-op the LLM shouldn't be billed for).
+        escalate.sort((a, b) => b.sim - a.sim);
+        for (const { i, j, sim } of escalate) {
+            if (uf.connected(i, j))
+                continue;
+            if (opts.adjudicate && (yield opts.adjudicate(items[i].id, items[j].id, sim))) {
+                uf.union(i, j);
+            }
+        }
+        // Borderline = band pairs ∪ escalated pairs, with their final outcome.
+        const seen = new Set();
+        const borderline = [];
+        for (const { i, j, sim } of [...bandPairs, ...escalate]) {
+            const key = i + "-" + j;
+            if (seen.has(key))
+                continue;
+            seen.add(key);
+            borderline.push({
+                a: items[i].id,
+                b: items[j].id,
+                sim,
+                merged: uf.connected(i, j),
+            });
+        }
+        return { clusters: clustersFromUF(items, uf), borderline };
+    });
+}
+/**
+ * Complete-linkage agglomerative clustering over the same pluggable pairwise policy.
+ * A cluster is valid only when EVERY internal pair is "joinable" (decide()==="merge",
+ * or an "escalate" pair the adjudicator approves); a single "reject"/veto cross-pair
+ * blocks the whole merge. Clusters grow greedily by highest min-cross-similarity
+ * (tightest first), so — unlike single-linkage — one borderline bridge between two
+ * otherwise-dissimilar siblings can't chain a family into one node (CESI, WWW 2018;
+ * the 8-member Epicure fusion). Adjudication is lazy: an escalate pair is sent to the
+ * LLM only when it is the binding cross-pair of a candidate merge (rejects short-
+ * circuit first), which keeps call volume bounded.
+ */
+function completeLinkageCluster(items, opts) {
+    return __awaiter(this, void 0, void 0, function* () {
+        const n = items.length;
+        const sim = Array.from({ length: n }, () => new Array(n).fill(0));
+        const decision = Array.from({ length: n }, () => new Array(n).fill("reject"));
+        const bandPairs = [];
+        const escalatePairs = [];
+        for (let i = 0; i < n; i++) {
+            for (let j = i + 1; j < n; j++) {
+                sim[i][j] = sim[j][i] = (0, cosineSimilarity_1.cosineSimilarity)(items[i].embedding, items[j].embedding);
+            }
+        }
+        // Blocking: keep only each item's top-N neighbours as merge-eligible; the rest are
+        // forced to "reject" so decide/adjudicate is never spent on them.
+        const eligible = blockingEligibility(sim, n, opts.blockTopN);
+        for (let i = 0; i < n; i++) {
+            for (let j = i + 1; j < n; j++) {
+                const s = sim[i][j];
+                if (eligible && !eligible[i][j]) {
+                    decision[i][j] = decision[j][i] = "reject";
+                    continue;
+                }
+                if (opts.band && s >= opts.band[0] && s < opts.band[1])
+                    bandPairs.push({ i, j, sim: s });
+                const d = opts.decide(s, items[i].id, items[j].id);
+                decision[i][j] = decision[j][i] = d;
+                if (d === "escalate")
+                    escalatePairs.push({ i, j, sim: s });
+            }
+        }
+        // Lazy, cached per-pair joinability (only escalate pairs hit the adjudicator).
+        const adjCache = new Map();
+        const joinable = (i, j) => __awaiter(this, void 0, void 0, function* () {
+            const d = decision[i][j];
+            if (d === "merge")
+                return true;
+            if (d === "reject")
+                return false;
+            const key = (i < j ? i : j) * n + (i < j ? j : i);
+            const cached = adjCache.get(key);
+            if (cached !== undefined)
+                return cached;
+            const ok = opts.adjudicate ? yield opts.adjudicate(items[i].id, items[j].id, sim[i][j]) : false;
+            adjCache.set(key, ok);
+            return ok;
+        });
+        // Every cross-pair joinable? Cheap rejects first, then adjudicate the rest.
+        const allJoinable = (A, B) => __awaiter(this, void 0, void 0, function* () {
+            for (const x of A)
+                for (const y of B)
+                    if (decision[x][y] === "reject")
+                        return false;
+            for (const x of A)
+                for (const y of B)
+                    if (!(yield joinable(x, y)))
+                        return false;
+            return true;
+        });
+        let clusters = items.map((_, i) => [i]);
+        // Greedy: merge the tightest fully-joinable cluster pair until none qualify.
+        for (;;) {
+            const candidates = [];
+            for (let a = 0; a < clusters.length; a++) {
+                for (let b = a + 1; b < clusters.length; b++) {
+                    let mn = Infinity;
+                    for (const x of clusters[a])
+                        for (const y of clusters[b])
+                            mn = Math.min(mn, sim[x][y]);
+                    candidates.push({ a, b, min: mn });
+                }
+            }
+            candidates.sort((p, q) => q.min - p.min);
+            let mergedAny = false;
+            for (const c of candidates) {
+                if (yield allJoinable(clusters[c.a], clusters[c.b])) {
+                    clusters[c.a] = clusters[c.a].concat(clusters[c.b]);
+                    clusters.splice(c.b, 1); // c.b > c.a, so c.a index is unaffected
+                    mergedAny = true;
+                    break; // recompute candidates from scratch after each merge
+                }
+            }
+            if (!mergedAny)
+                break;
+        }
+        const clusterOf = new Map();
+        clusters.forEach((c, ci) => c.forEach((idx) => clusterOf.set(idx, ci)));
+        const seen = new Set();
+        const borderline = [];
+        for (const { i, j, sim: s } of [...bandPairs, ...escalatePairs]) {
+            const key = i + "-" + j;
+            if (seen.has(key))
+                continue;
+            seen.add(key);
+            borderline.push({
+                a: items[i].id,
+                b: items[j].id,
+                sim: s,
+                merged: clusterOf.get(i) === clusterOf.get(j),
+            });
+        }
+        return { clusters: clusters.map((c) => c.map((idx) => items[idx].id)), borderline };
+    });
+}
+//# sourceMappingURL=agglomerativeCluster.js.map

package/dist/shared/utils/agglomerativeCluster.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"agglomerativeCluster.js","sourceRoot":"","sources":["../../../src/shared/utils/agglomerativeCluster.ts"],"names":[],"mappings":";;;;;;;;;;;AA+EA,sDAUC;AAoDD,gDAiDC;AA9LD,yDAAsD;AAQtD,6DAA6D;AAC7D,MAAM,SAAS;IAGb,YAAY,CAAS;QACnB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,IAAI,CAAC,CAAS;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD,KAAK,CAAC,CAAS,EAAE,CAAS;QACxB,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO;QACtB,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACvD,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IACD,SAAS,CAAC,CAAS,EAAE,CAAS;QAC5B,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;CACF;AAED;;;;GAIG;AACH,SAAS,mBAAmB,CAC1B,GAAe,EACf,CAAS,EACT,IAAa;IAEb,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACrD,MAAM,CAAC,GAAgB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;aACpC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;aACtB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACrC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACf,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,oDAAoD;QACtE,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,4EAA4E;AAC5E,SAAS,cAAc,CAAC,KAAiB,EAAE,EAAa;IACtD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC;YAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;;YACtB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;AACrC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,qBAAqB,CAAC,KAAiB,EAAE,SAAiB;IACxE,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,IAAA,mCAAgB,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC1E,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,cAAc,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AACnC,CAAC;AAwCD;;;;;;;;;;;GAWG;AACH,SAAsB,kBAAkB,CACtC,KAAiB,EACjB,IAA+B;;;QAE/B,IAAI,CAAC,MAAA,IAAI,CAAC,OAAO,mCAAI,QAAQ,CAAC,KAAK,UAAU,EAAE,CAAC;YAC9C,OAAO,sBAAsB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAiD,EAAE,CAAC;QAClE,MAAM,SAAS,GAAiD,EAAE,CAAC;QAEnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,GAAG,GAAG,IAAA,mCAAgB,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBACrE,IAAI,IAAI,CAAC,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC3D,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBAChC,CAAC;gBACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACrD,IAAI,CAAC,KAAK,OAAO;oBAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;qBAC7B,IAAI,CAAC,KAAK,UAAU;oBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;QAED,4EAA4E;QAC5E,0DAA0D;QAC1D,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACvC,KAAK,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,QAAQ,EAAE,CAAC;YACrC,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;gBAAE,SAAS;YACjC,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC9E,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QAED,uEAAuE;QACvE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,UAAU,GAAqB,EAAE,CAAC;QACxC,KAAK,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,SAAS,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC;YACxD,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;YACxB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,UAAU,CAAC,IAAI,CAAC;gBACd,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;gBACd,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;gBACd,GAAG;gBACH,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;aAC3B,CAAC,CAAC;QACL,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,cAAc,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC;IAC7D,CAAC;CAAA;AAED;;;;;;;;;;GAUG;AACH,SAAe,sBAAsB,CACnC,KAAiB,EACjB,IAA+B;;QAE/B,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,MAAM,GAAG,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,MAAM,QAAQ,GAAsB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CACjE,IAAI,KAAK,CAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAC3C,CAAC;QACF,MAAM,SAAS,GAAiD,EAAE,CAAC;QACnE,MAAM,aAAa,GAAiD,EAAE,CAAC;QAEvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAA,mCAAgB,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACnF,CAAC;QACH,CAAC;QAED,mFAAmF;QACnF,kEAAkE;QAClE,MAAM,QAAQ,GAAG,mBAAmB,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAE7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpB,IAAI,QAAQ,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;oBAC3C,SAAS;gBACX,CAAC;gBACD,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;oBAAE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBACzF,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACnD,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpC,IAAI,CAAC,KAAK,UAAU;oBAAE,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,+EAA+E;QAC/E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC5C,MAAM,QAAQ,GAAG,CAAO,CAAS,EAAE,CAAS,EAAoB,EAAE;YAChE,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,KAAK,OAAO;gBAAE,OAAO,IAAI,CAAC;YAC/B,IAAI,CAAC,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YACjC,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO,MAAM,CAAC;YACxC,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAChG,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YACtB,OAAO,EAAE,CAAC;QACZ,CAAC,CAAA,CAAC;QAEF,4EAA4E;QAC5E,MAAM,WAAW,GAAG,CAAO,CAAW,EAAE,CAAW,EAAoB,EAAE;YACvE,KAAK,MAAM,CAAC,IAAI,CAAC;gBAAE,KAAK,MAAM,CAAC,IAAI,CAAC;oBAAE,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,QAAQ;wBAAE,OAAO,KAAK,CAAC;YACpF,KAAK,MAAM,CAAC,IAAI,CAAC;gBAAE,KAAK,MAAM,CAAC,IAAI,CAAC;oBAAE,IAAI,CAAC,CAAC,MAAM,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;YAChF,OAAO,IAAI,CAAC;QACd,CAAC,CAAA,CAAC;QAEF,IAAI,QAAQ,GAAe,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpD,6EAA6E;QAC7E,SAAS,CAAC;YACR,MAAM,UAAU,GAAiD,EAAE,CAAC;YACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7C,IAAI,EAAE,GAAG,QAAQ,CAAC;oBAClB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;wBAAE,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;4BAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACvF,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;YACD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAEzC,IAAI,SAAS,GAAG,KAAK,CAAC;YACtB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;gBAC3B,IAAI,MAAM,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACpD,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACpD,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,wCAAwC;oBACjE,SAAS,GAAG,IAAI,CAAC;oBACjB,MAAM,CAAC,qDAAqD;gBAC9D,CAAC;YACH,CAAC;YACD,IAAI,CAAC,SAAS;gBAAE,MAAM;QACxB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAExE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,UAAU,GAAqB,EAAE,CAAC;QACxC,KAAK,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,SAAS,EAAE,GAAG,aAAa,CAAC,EAAE,CAAC;YAChE,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;YACxB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,UAAU,CAAC,IAAI,CAAC;gBACd,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;gBACd,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;gBACd,GAAG,EAAE,CAAC;gBACN,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;aAC9C,CAAC,CAAC;QACL,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC;IACtF,CAAC;CAAA"}

package/dist/shared/utils/astSymbols.js

@@ -0,0 +1,69 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MODULE_MARKER = exports.REFERENCE_KIND_TO_PREDICATE = exports.SYMBOL_KIND_TO_ENTITY_TYPE = exports.MEMBER_KINDS = exports.DEFINITION_KINDS = exports.hashContent = void 0;
+exports.shouldSeedSymbol = shouldSeedSymbol;
+const outlion_1 = require("@wanshi-kg/outlion");
+Object.defineProperty(exports, "hashContent", { enumerable: true, get: function () { return outlion_1.hashContent; } });
+/**
+ * Mapping tables + filters for the AST symbol seed (Phase 8). Per the locked
+ * decision, every target type/predicate is an **existing** Phase-2 vocabulary
+ * member (`src/core/knowledge/vocabulary.ts`) — no `vocabulary.ts` / `system.hbs`
+ * extension — so seeded nodes/edges validate against the closed enum.
+ */
+/** Structural definitions — always seeded as entities. */
+exports.DEFINITION_KINDS = new Set([
+    "module",
+    "namespace",
+    "class",
+    "struct",
+    "interface",
+    "trait",
+    "enum",
+    "type_alias",
+    "function",
+    "method",
+    "constructor",
+]);
+/** Fine-grained members — seeded only when `exported` (public surface; locals are noise). */
+exports.MEMBER_KINDS = new Set([
+    "field",
+    "property",
+    "variable",
+    "constant",
+    "enum_member",
+]);
+/** `SymbolKind` → an existing `BASE_ENTITY_TYPE`. */
+exports.SYMBOL_KIND_TO_ENTITY_TYPE = {
+    module: "module",
+    namespace: "module",
+    class: "class",
+    struct: "class",
+    interface: "interface",
+    trait: "interface",
+    enum: "data_structure",
+    type_alias: "data_structure",
+    function: "function",
+    method: "function",
+    constructor: "function",
+    field: "term",
+    property: "term",
+    variable: "term",
+    constant: "term",
+    enum_member: "term",
+};
+/** `SymbolReference.kind` → an existing `BASE_RELATION_TYPE` predicate. */
+exports.REFERENCE_KIND_TO_PREDICATE = {
+    calls: "calls",
+    imports: "depends_on",
+};
+/** The marker the Symbol API uses for a reference `from` at file/module top level. */
+exports.MODULE_MARKER = "<module>";
+/** Seed definitions always; members only when exported (covers all 16 kinds). */
+function shouldSeedSymbol(symbol) {
+    if (exports.DEFINITION_KINDS.has(symbol.kind))
+        return true;
+    if (exports.MEMBER_KINDS.has(symbol.kind))
+        return symbol.exported;
+    return false;
+}
+//# sourceMappingURL=astSymbols.js.map

package/dist/shared/utils/astSymbols.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"astSymbols.js","sourceRoot":"","sources":["../../../src/shared/utils/astSymbols.ts"],"names":[],"mappings":";;;AAwEA,4CAIC;AA5ED,gDAM4B;AAEnB,4FAHP,qBAAW,OAGO;AAGpB;;;;;GAKG;AAEH,0DAA0D;AAC7C,QAAA,gBAAgB,GAA4B,IAAI,GAAG,CAAa;IAC3E,QAAQ;IACR,WAAW;IACX,OAAO;IACP,QAAQ;IACR,WAAW;IACX,OAAO;IACP,MAAM;IACN,YAAY;IACZ,UAAU;IACV,QAAQ;IACR,aAAa;CACd,CAAC,CAAC;AAEH,6FAA6F;AAChF,QAAA,YAAY,GAA4B,IAAI,GAAG,CAAa;IACvE,OAAO;IACP,UAAU;IACV,UAAU;IACV,UAAU;IACV,aAAa;CACd,CAAC,CAAC;AAEH,qDAAqD;AACxC,QAAA,0BAA0B,GAA+B;IACpE,MAAM,EAAE,QAAQ;IAChB,SAAS,EAAE,QAAQ;IACnB,KAAK,EAAE,OAAO;IACd,MAAM,EAAE,OAAO;IACf,SAAS,EAAE,WAAW;IACtB,KAAK,EAAE,WAAW;IAClB,IAAI,EAAE,gBAAgB;IACtB,UAAU,EAAE,gBAAgB;IAC5B,QAAQ,EAAE,UAAU;IACpB,MAAM,EAAE,UAAU;IAClB,WAAW,EAAE,UAAU;IACvB,KAAK,EAAE,MAAM;IACb,QAAQ,EAAE,MAAM;IAChB,QAAQ,EAAE,MAAM;IAChB,QAAQ,EAAE,MAAM;IAChB,WAAW,EAAE,MAAM;CACpB,CAAC;AAEF,2EAA2E;AAC9D,QAAA,2BAA2B,GAA4C;IAClF,KAAK,EAAE,OAAO;IACd,OAAO,EAAE,YAAY;CACtB,CAAC;AAEF,sFAAsF;AACzE,QAAA,aAAa,GAAG,UAAU,CAAC;AAExC,iFAAiF;AACjF,SAAgB,gBAAgB,CAAC,MAAmB;IAClD,IAAI,wBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACnD,IAAI,oBAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC,QAAQ,CAAC;IAC1D,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/shared/utils/cosineSimilarity.js

@@ -0,0 +1,18 @@
+"use strict";
+// Calculate cosine similarity between two vectors
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.cosineSimilarity = cosineSimilarity;
+function cosineSimilarity(a, b) {
+    if (a.length !== b.length)
+        return 0;
+    let dotProduct = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    return dotProduct / (Math.sqrt(normA) * Math.sqrt(normB));
+}
+//# sourceMappingURL=cosineSimilarity.js.map

package/dist/shared/utils/cosineSimilarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cosineSimilarity.js","sourceRoot":"","sources":["../../../src/shared/utils/cosineSimilarity.ts"],"names":[],"mappings":";AAAA,kDAAkD;;AAElD,4CAcC;AAdD,SAAgB,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IAEpC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,UAAU,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAC5D,CAAC"}