@platformos/platformos-graph 0.0.20 → 0.1.0

package/dist/graph/query.d.ts

@@ -0,0 +1,72 @@
+import { UriString } from '@platformos/platformos-check-common';
+import { AppGraph, AppModule, Reference } from '../types';
+/**
+ * Project-structure queries over a BUILT {@link AppGraph}.
+ *
+ * Every function here is PURE and synchronous: it only reads the in-memory
+ * graph produced by `buildAppGraph`. All I/O (disk traversal, parsing,
+ * resolution) stays in `buildAppGraph`; this layer never touches the filesystem.
+ *
+ * These resurrect the old in-supervisor `ProjectFactGraph` / `ProjectMap`
+ * capabilities as the graph package's own API, so consumers (the MCP supervisor,
+ * the LSP) read project facts without re-deriving any graph logic.
+ *
+ * Note on graph scope: `buildAppGraph` only materializes modules reachable from
+ * its entry points. Whole-project queries like {@link orphans} are therefore
+ * only as complete as the graph they are given — to detect unreferenced files,
+ * build the graph with every file as an entry point.
+ */
+/** The outgoing dependency edges of `uri` (what it renders/includes/runs/queries/wraps). */
+export declare function dependenciesOf(graph: AppGraph, uri: UriString): Reference[];
+/** The incoming reference edges to `uri` (who renders/includes/runs/queries/wraps it). */
+export declare function dependentsOf(graph: AppGraph, uri: UriString): Reference[];
+/**
+ * Whether `uri` is a module in the graph that resolves to a file on disk.
+ * Returns `false` for a URI absent from the graph or a known-missing target.
+ */
+export declare function exists(graph: AppGraph, uri: UriString): boolean;
+/** Whether `uri` is one of the graph's entry points (a page or layout root). */
+export declare function isEntryPoint(graph: AppGraph, uri: UriString): boolean;
+/**
+ * Whether `uri` is an orphan: an existing, non-entry-point module that nothing
+ * references. Entry points (pages, layouts) are roots reachable independently of
+ * render edges, so they are never orphans; known-missing targets are "missing"
+ * (see {@link missingDependencies}), not orphans.
+ */
+export declare function isOrphan(graph: AppGraph, uri: UriString): boolean;
+/** Every orphan module in the graph (see {@link isOrphan}), sorted by URI. */
+export declare function orphans(graph: AppGraph): AppModule[];
+/**
+ * Every module URI transitively reachable from `uri` by following outgoing
+ * dependency edges, sorted. Excludes `uri` itself unless a cycle leads back to
+ * it. Modules absent from the graph contribute nothing.
+ */
+export declare function reachableFrom(graph: AppGraph, uri: UriString): UriString[];
+/** The outgoing edges of `uri` whose target does not exist on disk. */
+export declare function missingDependencies(graph: AppGraph, uri: UriString): Reference[];
+/**
+ * Every edge in the graph that points at a non-existent target — the project's
+ * unresolved references. Sorted by (source URI, target URI) for stable output.
+ */
+export declare function missingTargets(graph: AppGraph): Reference[];
+export interface NearestModulesOptions {
+    /** Maximum number of candidates to return, closest first. Default 3. */
+    limit?: number;
+    /** Maximum edit distance to include. Default: no cap (consumer decides relevance). */
+    maxDistance?: number;
+}
+/**
+ * The existing modules whose names are closest to `uri` — the "did you mean?"
+ * candidate set for a typo'd or missing reference.
+ *
+ * Candidates are restricted to the SAME category as `uri` (same module `type`,
+ * and for Liquid the same `kind`), so a missing `{% render %}` only suggests
+ * partials, a missing `{% graphql %}` only graphql operations, etc. Ranked by
+ * Levenshtein distance over the project-relative path (reusing check-common's
+ * `levenshtein` + `path.relative` — never re-implemented), closest first, ties
+ * broken by URI. `uri` itself and known-missing modules are excluded.
+ *
+ * Pure over the graph: candidates come only from modules present in it, so build
+ * with every file as an entry point for a complete candidate pool (see header).
+ */
+export declare function nearestModules(graph: AppGraph, uri: UriString, options?: NearestModulesOptions): AppModule[];

package/dist/graph/query.js

@@ -0,0 +1,140 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.dependenciesOf = dependenciesOf;
+exports.dependentsOf = dependentsOf;
+exports.exists = exists;
+exports.isEntryPoint = isEntryPoint;
+exports.isOrphan = isOrphan;
+exports.orphans = orphans;
+exports.reachableFrom = reachableFrom;
+exports.missingDependencies = missingDependencies;
+exports.missingTargets = missingTargets;
+exports.nearestModules = nearestModules;
+const platformos_check_common_1 = require("@platformos/platformos-check-common");
+/**
+ * Project-structure queries over a BUILT {@link AppGraph}.
+ *
+ * Every function here is PURE and synchronous: it only reads the in-memory
+ * graph produced by `buildAppGraph`. All I/O (disk traversal, parsing,
+ * resolution) stays in `buildAppGraph`; this layer never touches the filesystem.
+ *
+ * These resurrect the old in-supervisor `ProjectFactGraph` / `ProjectMap`
+ * capabilities as the graph package's own API, so consumers (the MCP supervisor,
+ * the LSP) read project facts without re-deriving any graph logic.
+ *
+ * Note on graph scope: `buildAppGraph` only materializes modules reachable from
+ * its entry points. Whole-project queries like {@link orphans} are therefore
+ * only as complete as the graph they are given — to detect unreferenced files,
+ * build the graph with every file as an entry point.
+ */
+/** The outgoing dependency edges of `uri` (what it renders/includes/runs/queries/wraps). */
+function dependenciesOf(graph, uri) {
+    return graph.modules[uri]?.dependencies ?? [];
+}
+/** The incoming reference edges to `uri` (who renders/includes/runs/queries/wraps it). */
+function dependentsOf(graph, uri) {
+    return graph.modules[uri]?.references ?? [];
+}
+/**
+ * Whether `uri` is a module in the graph that resolves to a file on disk.
+ * Returns `false` for a URI absent from the graph or a known-missing target.
+ */
+function exists(graph, uri) {
+    return graph.modules[uri]?.exists ?? false;
+}
+/** Whether `uri` is one of the graph's entry points (a page or layout root). */
+function isEntryPoint(graph, uri) {
+    return graph.entryPoints.some((entry) => entry.uri === uri);
+}
+/**
+ * Whether `uri` is an orphan: an existing, non-entry-point module that nothing
+ * references. Entry points (pages, layouts) are roots reachable independently of
+ * render edges, so they are never orphans; known-missing targets are "missing"
+ * (see {@link missingDependencies}), not orphans.
+ */
+function isOrphan(graph, uri) {
+    const module = graph.modules[uri];
+    if (!module || module.exists === false)
+        return false;
+    if (isEntryPoint(graph, uri))
+        return false;
+    // Schema nodes are referenced by model table name (from graphql/commands), not
+    // by file edges, so they are NEVER edge-referenced — "no incoming references"
+    // is meaningless for them. Excluding them keeps orphan = render dead-code.
+    if (module.type === "Schema" /* ModuleType.Schema */)
+        return false;
+    return module.references.length === 0;
+}
+/** Every orphan module in the graph (see {@link isOrphan}), sorted by URI. */
+function orphans(graph) {
+    return Object.values(graph.modules)
+        .filter((module) => isOrphan(graph, module.uri))
+        .sort((a, b) => a.uri.localeCompare(b.uri));
+}
+/**
+ * Every module URI transitively reachable from `uri` by following outgoing
+ * dependency edges, sorted. Excludes `uri` itself unless a cycle leads back to
+ * it. Modules absent from the graph contribute nothing.
+ */
+function reachableFrom(graph, uri) {
+    const seen = new Set();
+    const queue = dependenciesOf(graph, uri).map((dep) => dep.target.uri);
+    while (queue.length > 0) {
+        const next = queue.shift();
+        if (seen.has(next))
+            continue;
+        seen.add(next);
+        for (const dep of dependenciesOf(graph, next))
+            queue.push(dep.target.uri);
+    }
+    return [...seen].sort((a, b) => a.localeCompare(b));
+}
+/** The outgoing edges of `uri` whose target does not exist on disk. */
+function missingDependencies(graph, uri) {
+    return dependenciesOf(graph, uri).filter((ref) => !exists(graph, ref.target.uri));
+}
+/**
+ * Every edge in the graph that points at a non-existent target — the project's
+ * unresolved references. Sorted by (source URI, target URI) for stable output.
+ */
+function missingTargets(graph) {
+    return Object.values(graph.modules)
+        .flatMap((module) => module.dependencies)
+        .filter((ref) => !exists(graph, ref.target.uri))
+        .sort((a, b) => a.source.uri.localeCompare(b.source.uri) || a.target.uri.localeCompare(b.target.uri));
+}
+/**
+ * The existing modules whose names are closest to `uri` — the "did you mean?"
+ * candidate set for a typo'd or missing reference.
+ *
+ * Candidates are restricted to the SAME category as `uri` (same module `type`,
+ * and for Liquid the same `kind`), so a missing `{% render %}` only suggests
+ * partials, a missing `{% graphql %}` only graphql operations, etc. Ranked by
+ * Levenshtein distance over the project-relative path (reusing check-common's
+ * `levenshtein` + `path.relative` — never re-implemented), closest first, ties
+ * broken by URI. `uri` itself and known-missing modules are excluded.
+ *
+ * Pure over the graph: candidates come only from modules present in it, so build
+ * with every file as an entry point for a complete candidate pool (see header).
+ */
+function nearestModules(graph, uri, options = {}) {
+    const { limit = 3, maxDistance = Infinity } = options;
+    const target = graph.modules[uri];
+    if (!target)
+        return [];
+    const targetPath = platformos_check_common_1.path.relative(uri, graph.rootUri);
+    return Object.values(graph.modules)
+        .filter((module) => module.uri !== uri &&
+        module.exists !== false &&
+        module.type === target.type &&
+        module.kind === target.kind)
+        .map((module) => ({
+        module,
+        distance: (0, platformos_check_common_1.levenshtein)(platformos_check_common_1.path.relative(module.uri, graph.rootUri), targetPath),
+    }))
+        .filter((candidate) => candidate.distance <= maxDistance)
+        .sort((a, b) => a.distance - b.distance || a.module.uri.localeCompare(b.module.uri))
+        .slice(0, limit)
+        .map((candidate) => candidate.module);
+}
+//# sourceMappingURL=query.js.map

package/dist/graph/query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.js","sourceRoot":"","sources":["../../src/graph/query.ts"],"names":[],"mappings":";;AAqBA,wCAEC;AAGD,oCAEC;AAMD,wBAEC;AAGD,oCAEC;AAQD,4BASC;AAGD,0BAIC;AAOD,sCAYC;AAGD,kDAEC;AAMD,wCAQC;AAuBD,wCA2BC;AAzJD,iFAAmF;AAGnF;;;;;;;;;;;;;;;GAeG;AAEH,4FAA4F;AAC5F,SAAgB,cAAc,CAAC,KAAe,EAAE,GAAc;IAC5D,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,YAAY,IAAI,EAAE,CAAC;AAChD,CAAC;AAED,0FAA0F;AAC1F,SAAgB,YAAY,CAAC,KAAe,EAAE,GAAc;IAC1D,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,UAAU,IAAI,EAAE,CAAC;AAC9C,CAAC;AAED;;;GAGG;AACH,SAAgB,MAAM,CAAC,KAAe,EAAE,GAAc;IACpD,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,MAAM,IAAI,KAAK,CAAC;AAC7C,CAAC;AAED,gFAAgF;AAChF,SAAgB,YAAY,CAAC,KAAe,EAAE,GAAc;IAC1D,OAAO,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;GAKG;AACH,SAAgB,QAAQ,CAAC,KAAe,EAAE,GAAc;IACtD,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK;QAAE,OAAO,KAAK,CAAC;IACrD,IAAI,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAC3C,+EAA+E;IAC/E,8EAA8E;IAC9E,2EAA2E;IAC3E,IAAI,MAAM,CAAC,IAAI,qCAAsB;QAAE,OAAO,KAAK,CAAC;IACpD,OAAO,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;AACxC,CAAC;AAED,8EAA8E;AAC9E,SAAgB,OAAO,CAAC,KAAe;IACrC,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC;SAChC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;SAC/C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,SAAgB,aAAa,CAAC,KAAe,EAAE,GAAc;IAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAa,CAAC;IAClC,MAAM,KAAK,GAAgB,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAEnF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACf,KAAK,MAAM,GAAG,IAAI,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC5E,CAAC;IAED,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,uEAAuE;AACvE,SAAgB,mBAAmB,CAAC,KAAe,EAAE,GAAc;IACjE,OAAO,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AACpF,CAAC;AAED;;;GAGG;AACH,SAAgB,cAAc,CAAC,KAAe;IAC5C,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC;SAChC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC;SACxC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;SAC/C,IAAI,CACH,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CACvF,CAAC;AACN,CAAC;AASD;;;;;;;;;;;;;GAaG;AACH,SAAgB,cAAc,CAC5B,KAAe,EACf,GAAc,EACd,UAAiC,EAAE;IAEnC,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,WAAW,GAAG,QAAQ,EAAE,GAAG,OAAO,CAAC;IACtD,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAEvB,MAAM,UAAU,GAAG,8BAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IAErD,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC;SAChC,MAAM,CACL,CAAC,MAAM,EAAE,EAAE,CACT,MAAM,CAAC,GAAG,KAAK,GAAG;QAClB,MAAM,CAAC,MAAM,KAAK,KAAK;QACvB,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI;QAC3B,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAC9B;SACA,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAChB,MAAM;QACN,QAAQ,EAAE,IAAA,qCAAW,EAAC,8BAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,UAAU,CAAC;KAC5E,CAAC,CAAC;SACF,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,IAAI,WAAW,CAAC;SACxD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;SACnF,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;SACf,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;AAC1C,CAAC"}

package/dist/graph/query.spec.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/graph/query.spec.js

@@ -0,0 +1,209 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const platformos_check_common_1 = require("@platformos/platformos-check-common");
+const vitest_1 = require("vitest");
+const index_1 = require("../index");
+const query_1 = require("./query");
+const module_1 = require("./module");
+const traverse_1 = require("./traverse");
+const test_helpers_1 = require("./test-helpers");
+const targets = (refs) => refs.map((r) => r.target.uri).sort((a, b) => a.localeCompare(b));
+const sources = (refs) => refs.map((r) => r.source.uri).sort((a, b) => a.localeCompare(b));
+(0, vitest_1.describe)('Graph queries: over the built skeleton app graph', () => {
+    const p = (part) => platformos_check_common_1.path.join(test_helpers_1.skeleton, ...part.split('/'));
+    let graph;
+    (0, vitest_1.beforeAll)(async () => {
+        graph = await (0, index_1.buildAppGraph)(test_helpers_1.skeleton, (0, test_helpers_1.getDependencies)());
+    }, 15000);
+    (0, vitest_1.it)('dependenciesOf returns a file’s outgoing targets', () => {
+        (0, vitest_1.expect)(targets((0, query_1.dependenciesOf)(graph, p('app/views/pages/index.liquid')))).toEqual([
+            p('app/views/layouts/application.liquid'),
+            p('app/views/partials/parent.liquid'),
+        ]);
+    });
+    (0, vitest_1.it)('dependency edges are call sites carrying kind + named-argument names', () => {
+        // index.liquid: `layout: application` (no args) + `{% render "parent", children: "hello" %}`.
+        const edges = (0, query_1.dependenciesOf)(graph, p('app/views/pages/index.liquid'))
+            .map((ref) => ({ kind: ref.kind, target: ref.target.uri, args: ref.args }))
+            .sort((a, b) => a.target.localeCompare(b.target));
+        (0, vitest_1.expect)(edges).toEqual([
+            { kind: 'layout', target: p('app/views/layouts/application.liquid'), args: undefined },
+            { kind: 'render', target: p('app/views/partials/parent.liquid'), args: ['children'] },
+        ]);
+    });
+    (0, vitest_1.it)('dependentsOf returns every caller of a file', () => {
+        (0, vitest_1.expect)(sources((0, query_1.dependentsOf)(graph, p('app/views/partials/child.liquid')))).toEqual([
+            p('app/views/partials/header.liquid'),
+            p('app/views/partials/parent.liquid'),
+        ]);
+        (0, vitest_1.expect)(sources((0, query_1.dependentsOf)(graph, p('app/views/layouts/application.liquid')))).toEqual([
+            p('app/views/pages/index.liquid'),
+        ]);
+    });
+    (0, vitest_1.it)('dependenciesOf / dependentsOf return [] for a URI absent from the graph', () => {
+        (0, vitest_1.expect)((0, query_1.dependenciesOf)(graph, p('app/views/partials/nope.liquid'))).toEqual([]);
+        (0, vitest_1.expect)((0, query_1.dependentsOf)(graph, p('app/views/partials/nope.liquid'))).toEqual([]);
+    });
+    (0, vitest_1.it)('reachableFrom returns the transitive outgoing closure', () => {
+        // Sorted by URI — `app/assets/*` sorts ahead of `app/views/*`.
+        (0, vitest_1.expect)((0, query_1.reachableFrom)(graph, p('app/views/pages/index.liquid'))).toEqual([
+            p('app/assets/app.css'),
+            p('app/assets/app.js'),
+            p('app/views/layouts/application.liquid'),
+            p('app/views/partials/child.liquid'),
+            p('app/views/partials/header.liquid'),
+            p('app/views/partials/parent.liquid'),
+        ]);
+    });
+    (0, vitest_1.it)('exists reflects on-disk presence', () => {
+        (0, vitest_1.expect)((0, query_1.exists)(graph, p('app/views/partials/child.liquid'))).toBe(true);
+        (0, vitest_1.expect)((0, query_1.exists)(graph, p('app/views/partials/nope.liquid'))).toBe(false);
+    });
+    (0, vitest_1.it)('isEntryPoint distinguishes pages/layouts from partials', () => {
+        (0, vitest_1.expect)((0, query_1.isEntryPoint)(graph, p('app/views/pages/index.liquid'))).toBe(true);
+        (0, vitest_1.expect)((0, query_1.isEntryPoint)(graph, p('app/views/layouts/application.liquid'))).toBe(true);
+        (0, vitest_1.expect)((0, query_1.isEntryPoint)(graph, p('app/views/partials/child.liquid'))).toBe(false);
+    });
+    (0, vitest_1.it)('a fully-wired skeleton has no orphans and no missing targets', () => {
+        (0, vitest_1.expect)((0, query_1.orphans)(graph)).toEqual([]);
+        (0, vitest_1.expect)((0, query_1.missingTargets)(graph)).toEqual([]);
+    });
+});
+(0, vitest_1.describe)('Graph queries: orphan and missing-target detection (hermetic graph)', () => {
+    const rootUri = 'file:///app';
+    const p = (part) => platformos_check_common_1.path.join(rootUri, ...part.split('/'));
+    // page (entry) ─render→ used (exists)
+    //                └─render→ missing (exists:false)
+    // orphan (exists, referenced by nothing, not an entry point)
+    // schema (exists, referenced by nothing, not an entry point — but NOT an orphan)
+    let graph;
+    let pageUri;
+    let usedUri;
+    let orphanUri;
+    let missingUri;
+    let schemaUri;
+    (0, vitest_1.beforeAll)(() => {
+        graph = { rootUri, entryPoints: [], modules: {} };
+        const page = (0, module_1.getPageModule)(graph, p('app/views/pages/index.liquid'));
+        const used = (0, module_1.getPartialModuleByUri)(graph, p('app/views/partials/used.liquid'));
+        const orphan = (0, module_1.getPartialModuleByUri)(graph, p('app/views/partials/orphan.liquid'));
+        const missing = (0, module_1.getPartialModuleByUri)(graph, p('app/views/partials/missing.liquid'));
+        const schema = (0, module_1.getSchemaModule)(graph, p('app/schema/blog_post.yml'));
+        page.exists = true;
+        used.exists = true;
+        orphan.exists = true;
+        missing.exists = false;
+        schema.exists = true;
+        (0, traverse_1.bind)(page, used, { sourceRange: [0, 10], kind: 'render' });
+        (0, traverse_1.bind)(page, missing, { sourceRange: [11, 21], kind: 'render' });
+        graph.entryPoints = [page];
+        for (const module of [page, used, orphan, missing, schema])
+            graph.modules[module.uri] = module;
+        pageUri = page.uri;
+        usedUri = used.uri;
+        orphanUri = orphan.uri;
+        missingUri = missing.uri;
+        schemaUri = schema.uri;
+    });
+    (0, vitest_1.it)('flags an unreferenced, non-entry-point file as an orphan', () => {
+        (0, vitest_1.expect)((0, query_1.isOrphan)(graph, orphanUri)).toBe(true);
+    });
+    (0, vitest_1.it)('does not flag referenced files, entry points, or missing targets as orphans', () => {
+        (0, vitest_1.expect)((0, query_1.isOrphan)(graph, usedUri)).toBe(false); // referenced by the page
+        (0, vitest_1.expect)((0, query_1.isOrphan)(graph, pageUri)).toBe(false); // entry point
+        (0, vitest_1.expect)((0, query_1.isOrphan)(graph, missingUri)).toBe(false); // missing, not orphan
+    });
+    (0, vitest_1.it)('never flags a schema node as an orphan (referenced by table name, not edges)', () => {
+        // Without the guard this would be a false positive: schema exists, is not an
+        // entry point, and has zero incoming edges.
+        (0, vitest_1.expect)((0, query_1.isOrphan)(graph, schemaUri)).toBe(false);
+    });
+    (0, vitest_1.it)('orphans() lists exactly the orphan modules (excludes the schema)', () => {
+        (0, vitest_1.expect)((0, query_1.orphans)(graph).map((m) => m.uri)).toEqual([orphanUri]);
+    });
+    (0, vitest_1.it)('missingDependencies returns a file’s edges to non-existent targets', () => {
+        (0, vitest_1.expect)((0, query_1.missingDependencies)(graph, pageUri)).toEqual([
+            {
+                source: { uri: pageUri, range: [11, 21] },
+                target: { uri: missingUri },
+                type: 'direct',
+                kind: 'render',
+            },
+        ]);
+    });
+    (0, vitest_1.it)('missingTargets lists every unresolved edge in the graph', () => {
+        (0, vitest_1.expect)((0, query_1.missingTargets)(graph)).toEqual([
+            {
+                source: { uri: pageUri, range: [11, 21] },
+                target: { uri: missingUri },
+                type: 'direct',
+                kind: 'render',
+            },
+        ]);
+    });
+});
+(0, vitest_1.describe)('Graph queries: nearest-name candidates (did-you-mean)', () => {
+    const rootUri = 'file:///app';
+    const p = (part) => platformos_check_common_1.path.join(rootUri, ...part.split('/'));
+    // Partials: header, footer, sidebar (exist). A layout ALSO named "header"
+    // (exists) — same name, different category. A graphql op blog/find (exists).
+    // Typo targets: partial "headr" and graphql "blog/fnd" (both exists:false).
+    let graph;
+    let headerUri;
+    let footerUri;
+    let sidebarUri;
+    let headrUri;
+    let graphqlFindUri;
+    let graphqlTypoUri;
+    (0, vitest_1.beforeAll)(() => {
+        graph = { rootUri, entryPoints: [], modules: {} };
+        const page = (0, module_1.getPageModule)(graph, p('app/views/pages/index.liquid'));
+        const header = (0, module_1.getPartialModuleByUri)(graph, p('app/views/partials/header.liquid'));
+        const footer = (0, module_1.getPartialModuleByUri)(graph, p('app/views/partials/footer.liquid'));
+        const sidebar = (0, module_1.getPartialModuleByUri)(graph, p('app/views/partials/sidebar.liquid'));
+        const headerLayout = (0, module_1.getLayoutModule)(graph, p('app/views/layouts/header.liquid'));
+        const find = (0, module_1.getGraphQLModuleByUri)(graph, p('app/graphql/blog/find.graphql'));
+        const headr = (0, module_1.getPartialModuleByUri)(graph, p('app/views/partials/headr.liquid'));
+        const graphqlTypo = (0, module_1.getGraphQLModuleByUri)(graph, p('app/graphql/blog/fnd.graphql'));
+        for (const m of [page, header, footer, sidebar, headerLayout, find])
+            m.exists = true;
+        headr.exists = false;
+        graphqlTypo.exists = false;
+        graph.entryPoints = [page];
+        for (const m of [page, header, footer, sidebar, headerLayout, find, headr, graphqlTypo]) {
+            graph.modules[m.uri] = m;
+        }
+        headerUri = header.uri;
+        footerUri = footer.uri;
+        sidebarUri = sidebar.uri;
+        headrUri = headr.uri;
+        graphqlFindUri = find.uri;
+        graphqlTypoUri = graphqlTypo.uri;
+    });
+    (0, vitest_1.it)('ranks the closest same-category name first', () => {
+        (0, vitest_1.expect)((0, query_1.nearestModules)(graph, headrUri, { limit: 1 }).map((m) => m.uri)).toEqual([headerUri]);
+    });
+    (0, vitest_1.it)('only considers existing modules of the same category (excludes self, layouts, graphql, missing)', () => {
+        // The layout "header" shares the name but is a different kind; the graphql
+        // op, the page, the typo itself, and missing modules are all out.
+        const uris = (0, query_1.nearestModules)(graph, headrUri, { limit: 10 })
+            .map((m) => m.uri)
+            .sort((a, b) => a.localeCompare(b));
+        (0, vitest_1.expect)(uris).toEqual([footerUri, headerUri, sidebarUri]);
+    });
+    (0, vitest_1.it)('honours maxDistance', () => {
+        // Only "header" is within edit distance 1 of "headr".
+        (0, vitest_1.expect)((0, query_1.nearestModules)(graph, headrUri, { maxDistance: 1 }).map((m) => m.uri)).toEqual([
+            headerUri,
+        ]);
+    });
+    (0, vitest_1.it)('suggests graphql operations for a missing graphql target', () => {
+        (0, vitest_1.expect)((0, query_1.nearestModules)(graph, graphqlTypoUri, { limit: 1 }).map((m) => m.uri)).toEqual([
+            graphqlFindUri,
+        ]);
+    });
+    (0, vitest_1.it)('returns [] for a URI absent from the graph', () => {
+        (0, vitest_1.expect)((0, query_1.nearestModules)(graph, p('app/views/partials/unknown.liquid'))).toEqual([]);
+    });
+});
+//# sourceMappingURL=query.spec.js.map

package/dist/graph/query.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.spec.js","sourceRoot":"","sources":["../../src/graph/query.spec.ts"],"names":[],"mappings":";;AAAA,iFAAwE;AACxE,mCAAyD;AACzD,oCAAyC;AAEzC,mCAWiB;AACjB,qCAMkB;AAClB,yCAAkC;AAClC,iDAA2D;AAE3D,MAAM,OAAO,GAAG,CAAC,IAAmC,EAAE,EAAE,CACtD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;AACnE,MAAM,OAAO,GAAG,CAAC,IAAmC,EAAE,EAAE,CACtD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;AAEnE,IAAA,iBAAQ,EAAC,kDAAkD,EAAE,GAAG,EAAE;IAChE,MAAM,CAAC,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,8BAAS,CAAC,IAAI,CAAC,uBAAQ,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACzE,IAAI,KAAe,CAAC;IAEpB,IAAA,kBAAS,EAAC,KAAK,IAAI,EAAE;QACnB,KAAK,GAAG,MAAM,IAAA,qBAAa,EAAC,uBAAQ,EAAE,IAAA,8BAAe,GAAE,CAAC,CAAC;IAC3D,CAAC,EAAE,KAAK,CAAC,CAAC;IAEV,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,IAAA,eAAM,EAAC,OAAO,CAAC,IAAA,sBAAc,EAAC,KAAK,EAAE,CAAC,CAAC,8BAA8B,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YAChF,CAAC,CAAC,sCAAsC,CAAC;YACzC,CAAC,CAAC,kCAAkC,CAAC;SACtC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,8FAA8F;QAC9F,MAAM,KAAK,GAAG,IAAA,sBAAc,EAAC,KAAK,EAAE,CAAC,CAAC,8BAA8B,CAAC,CAAC;aACnE,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;aAC1E,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAEpD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC;YACpB,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,sCAAsC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE;YACtF,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,kCAAkC,CAAC,EAAE,IAAI,EAAE,CAAC,UAAU,CAAC,EAAE;SACtF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,IAAA,eAAM,EAAC,OAAO,CAAC,IAAA,oBAAY,EAAC,KAAK,EAAE,CAAC,CAAC,iCAAiC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YACjF,CAAC,CAAC,kCAAkC,CAAC;YACrC,CAAC,CAAC,kCAAkC,CAAC;SACtC,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,OAAO,CAAC,IAAA,oBAAY,EAAC,KAAK,EAAE,CAAC,CAAC,sCAAsC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YACtF,CAAC,CAAC,8BAA8B,CAAC;SAClC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yEAAyE,EAAE,GAAG,EAAE;QACjF,IAAA,eAAM,EAAC,IAAA,sBAAc,EAAC,KAAK,EAAE,CAAC,CAAC,gCAAgC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC/E,IAAA,eAAM,EAAC,IAAA,oBAAY,EAAC,KAAK,EAAE,CAAC,CAAC,gCAAgC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,+DAA+D;QAC/D,IAAA,eAAM,EAAC,IAAA,qBAAa,EAAC,KAAK,EAAE,CAAC,CAAC,8BAA8B,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YACtE,CAAC,CAAC,oBAAoB,CAAC;YACvB,CAAC,CAAC,mBAAmB,CAAC;YACtB,CAAC,CAAC,sCAAsC,CAAC;YACzC,CAAC,CAAC,iCAAiC,CAAC;YACpC,CAAC,CAAC,kCAAkC,CAAC;YACrC,CAAC,CAAC,kCAAkC,CAAC;SACtC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,IAAA,eAAM,EAAC,IAAA,cAAM,EAAC,KAAK,EAAE,CAAC,CAAC,iCAAiC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,IAAA,cAAM,EAAC,KAAK,EAAE,CAAC,CAAC,gCAAgC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,IAAA,eAAM,EAAC,IAAA,oBAAY,EAAC,KAAK,EAAE,CAAC,CAAC,8BAA8B,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1E,IAAA,eAAM,EAAC,IAAA,oBAAY,EAAC,KAAK,EAAE,CAAC,CAAC,sCAAsC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClF,IAAA,eAAM,EAAC,IAAA,oBAAY,EAAC,KAAK,EAAE,CAAC,CAAC,iCAAiC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChF,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,IAAA,eAAM,EAAC,IAAA,eAAO,EAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,sBAAc,EAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,qEAAqE,EAAE,GAAG,EAAE;IACnF,MAAM,OAAO,GAAG,aAAa,CAAC;IAC9B,MAAM,CAAC,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,8BAAS,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAExE,sCAAsC;IACtC,kDAAkD;IAClD,6DAA6D;IAC7D,iFAAiF;IACjF,IAAI,KAAe,CAAC;IACpB,IAAI,OAAe,CAAC;IACpB,IAAI,OAAe,CAAC;IACpB,IAAI,SAAiB,CAAC;IACtB,IAAI,UAAkB,CAAC;IACvB,IAAI,SAAiB,CAAC;IAEtB,IAAA,kBAAS,EAAC,GAAG,EAAE;QACb,KAAK,GAAG,EAAE,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,IAAA,sBAAa,EAAC,KAAK,EAAE,CAAC,CAAC,8BAA8B,CAAC,CAAC,CAAC;QACrE,MAAM,IAAI,GAAG,IAAA,8BAAqB,EAAC,KAAK,EAAE,CAAC,CAAC,gCAAgC,CAAC,CAAC,CAAC;QAC/E,MAAM,MAAM,GAAG,IAAA,8BAAqB,EAAC,KAAK,EAAE,CAAC,CAAC,kCAAkC,CAAC,CAAC,CAAC;QACnF,MAAM,OAAO,GAAG,IAAA,8BAAqB,EAAC,KAAK,EAAE,CAAC,CAAC,mCAAmC,CAAC,CAAC,CAAC;QACrF,MAAM,MAAM,GAAG,IAAA,wBAAe,EAAC,KAAK,EAAE,CAAC,CAAC,0BAA0B,CAAC,CAAC,CAAC;QAErE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC;QACrB,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC;QACvB,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC;QAErB,IAAA,eAAI,EAAC,IAAI,EAAE,IAAI,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC3D,IAAA,eAAI,EAAC,IAAI,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QAE/D,KAAK,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,KAAK,MAAM,MAAM,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC;YAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;QAE/F,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC;QACnB,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC;QACnB,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC;QACvB,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC;QACzB,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,IAAA,eAAM,EAAC,IAAA,gBAAQ,EAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6EAA6E,EAAE,GAAG,EAAE;QACrF,IAAA,eAAM,EAAC,IAAA,gBAAQ,EAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,yBAAyB;QACvE,IAAA,eAAM,EAAC,IAAA,gBAAQ,EAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc;QAC5D,IAAA,eAAM,EAAC,IAAA,gBAAQ,EAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,sBAAsB;IACzE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,6EAA6E;QAC7E,4CAA4C;QAC5C,IAAA,eAAM,EAAC,IAAA,gBAAQ,EAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,IAAA,eAAM,EAAC,IAAA,eAAO,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,IAAA,eAAM,EAAC,IAAA,2BAAmB,EAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;YAClD;gBACE,MAAM,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;gBACzC,MAAM,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE;gBAC3B,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,QAAQ;aACf;SACF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,IAAA,eAAM,EAAC,IAAA,sBAAc,EAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC;YACpC;gBACE,MAAM,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;gBACzC,MAAM,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE;gBAC3B,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,QAAQ;aACf;SACF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uDAAuD,EAAE,GAAG,EAAE;IACrE,MAAM,OAAO,GAAG,aAAa,CAAC;IAC9B,MAAM,CAAC,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,8BAAS,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAExE,0EAA0E;IAC1E,6EAA6E;IAC7E,4EAA4E;IAC5E,IAAI,KAAe,CAAC;IACpB,IAAI,SAAiB,CAAC;IACtB,IAAI,SAAiB,CAAC;IACtB,IAAI,UAAkB,CAAC;IACvB,IAAI,QAAgB,CAAC;IACrB,IAAI,cAAsB,CAAC;IAC3B,IAAI,cAAsB,CAAC;IAE3B,IAAA,kBAAS,EAAC,GAAG,EAAE;QACb,KAAK,GAAG,EAAE,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,IAAA,sBAAa,EAAC,KAAK,EAAE,CAAC,CAAC,8BAA8B,CAAC,CAAC,CAAC;QACrE,MAAM,MAAM,GAAG,IAAA,8BAAqB,EAAC,KAAK,EAAE,CAAC,CAAC,kCAAkC,CAAC,CAAC,CAAC;QACnF,MAAM,MAAM,GAAG,IAAA,8BAAqB,EAAC,KAAK,EAAE,CAAC,CAAC,kCAAkC,CAAC,CAAC,CAAC;QACnF,MAAM,OAAO,GAAG,IAAA,8BAAqB,EAAC,KAAK,EAAE,CAAC,CAAC,mCAAmC,CAAC,CAAC,CAAC;QACrF,MAAM,YAAY,GAAG,IAAA,wBAAe,EAAC,KAAK,EAAE,CAAC,CAAC,iCAAiC,CAAC,CAAE,CAAC;QACnF,MAAM,IAAI,GAAG,IAAA,8BAAqB,EAAC,KAAK,EAAE,CAAC,CAAC,+BAA+B,CAAC,CAAC,CAAC;QAC9E,MAAM,KAAK,GAAG,IAAA,8BAAqB,EAAC,KAAK,EAAE,CAAC,CAAC,iCAAiC,CAAC,CAAC,CAAC;QACjF,MAAM,WAAW,GAAG,IAAA,8BAAqB,EAAC,KAAK,EAAE,CAAC,CAAC,8BAA8B,CAAC,CAAC,CAAC;QAEpF,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,IAAI,CAAC;YAAE,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC;QACrF,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC;QACrB,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;QAE3B,KAAK,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,EAAE,WAAW,CAAC,EAAE,CAAC;YACxF,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QAED,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC;QACvB,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC;QACvB,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC;QACzB,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC;QACrB,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC;QAC1B,cAAc,GAAG,WAAW,CAAC,GAAG,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,IAAA,eAAM,EAAC,IAAA,sBAAc,EAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAC/F,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iGAAiG,EAAE,GAAG,EAAE;QACzG,2EAA2E;QAC3E,kEAAkE;QAClE,MAAM,IAAI,GAAG,IAAA,sBAAc,EAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;aACxD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;aACjB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,sDAAsD;QACtD,IAAA,eAAM,EAAC,IAAA,sBAAc,EAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;YACpF,SAAS;SACV,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,IAAA,eAAM,EAAC,IAAA,sBAAc,EAAC,KAAK,EAAE,cAAc,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;YACpF,cAAc;SACf,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,IAAA,eAAM,EAAC,IAAA,sBAAc,EAAC,KAAK,EAAE,CAAC,CAAC,mCAAmC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACpF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/graph/serialize.spec.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/graph/serialize.spec.js

@@ -0,0 +1,50 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const platformos_check_common_1 = require("@platformos/platformos-check-common");
+const vitest_1 = require("vitest");
+const module_1 = require("./module");
+const serialize_1 = require("./serialize");
+const traverse_1 = require("./traverse");
+(0, vitest_1.describe)('Unit: serializeAppGraph', () => {
+    (0, vitest_1.it)('serialize the graph', () => {
+        const rootUri = 'file:///app';
+        const p = (part) => platformos_check_common_1.path.join(rootUri, part);
+        const graph = {
+            entryPoints: [],
+            modules: {},
+            rootUri,
+        };
+        const layout = (0, module_1.getLayoutModule)(graph, p('app/views/layouts/application.liquid'));
+        const headerPartial = (0, module_1.getPartialModuleByUri)(graph, p('app/views/partials/header.liquid'));
+        const parentPartial = (0, module_1.getPartialModuleByUri)(graph, p('app/views/partials/parent.liquid'));
+        const childPartial = (0, module_1.getPartialModuleByUri)(graph, p('app/views/partials/child.liquid'));
+        (0, traverse_1.bind)(layout, headerPartial, { sourceRange: [0, 5] });
+        (0, traverse_1.bind)(layout, parentPartial, { sourceRange: [10, 15] });
+        (0, traverse_1.bind)(parentPartial, childPartial, { sourceRange: [20, 25] });
+        graph.entryPoints = [layout];
+        [layout, headerPartial, parentPartial, childPartial].forEach((module) => {
+            graph.modules[module.uri] = module;
+        });
+        const { nodes, edges } = (0, serialize_1.serializeAppGraph)(graph);
+        (0, vitest_1.expect)(nodes).toHaveLength(4);
+        (0, vitest_1.expect)(edges).toHaveLength(3);
+        (0, vitest_1.expect)(edges).toEqual(vitest_1.expect.arrayContaining([
+            {
+                source: { uri: p('app/views/layouts/application.liquid'), range: [0, 5] },
+                target: { uri: p('app/views/partials/header.liquid') },
+                type: 'direct',
+            },
+            {
+                source: { uri: p('app/views/layouts/application.liquid'), range: [10, 15] },
+                target: { uri: p('app/views/partials/parent.liquid') },
+                type: 'direct',
+            },
+            {
+                source: { uri: p('app/views/partials/parent.liquid'), range: [20, 25] },
+                target: { uri: p('app/views/partials/child.liquid') },
+                type: 'direct',
+            },
+        ]));
+    });
+});
+//# sourceMappingURL=serialize.spec.js.map

package/dist/graph/serialize.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"serialize.spec.js","sourceRoot":"","sources":["../../src/graph/serialize.spec.ts"],"names":[],"mappings":";;AAAA,iFAAwE;AACxE,mCAA8C;AAE9C,qCAAkE;AAClE,2CAAgD;AAChD,yCAAkC;AAElC,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,MAAM,OAAO,GAAG,aAAa,CAAC;QAC9B,MAAM,CAAC,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,8BAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC1D,MAAM,KAAK,GAAa;YACtB,WAAW,EAAE,EAAE;YACf,OAAO,EAAE,EAAE;YACX,OAAO;SACR,CAAC;QAEF,MAAM,MAAM,GAAG,IAAA,wBAAe,EAAC,KAAK,EAAE,CAAC,CAAC,sCAAsC,CAAC,CAAE,CAAC;QAClF,MAAM,aAAa,GAAG,IAAA,8BAAqB,EAAC,KAAK,EAAE,CAAC,CAAC,kCAAkC,CAAC,CAAC,CAAC;QAC1F,MAAM,aAAa,GAAG,IAAA,8BAAqB,EAAC,KAAK,EAAE,CAAC,CAAC,kCAAkC,CAAC,CAAC,CAAC;QAC1F,MAAM,YAAY,GAAG,IAAA,8BAAqB,EAAC,KAAK,EAAE,CAAC,CAAC,iCAAiC,CAAC,CAAC,CAAC;QAExF,IAAA,eAAI,EAAC,MAAM,EAAE,aAAa,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACrD,IAAA,eAAI,EAAC,MAAM,EAAE,aAAa,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QACvD,IAAA,eAAI,EAAC,aAAa,EAAE,YAAY,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAE7D,KAAK,CAAC,WAAW,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7B,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,EAAE,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;YACtE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAA,6BAAiB,EAAC,KAAK,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CACnB,eAAM,CAAC,eAAe,CAAC;YACrB;gBACE,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,sCAAsC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBACzE,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,kCAAkC,CAAC,EAAE;gBACtD,IAAI,EAAE,QAAQ;aACf;YACD;gBACE,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,sCAAsC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;gBAC3E,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,kCAAkC,CAAC,EAAE;gBACtD,IAAI,EAAE,QAAQ;aACf;YACD;gBACE,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,kCAAkC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;gBACvE,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,iCAAiC,CAAC,EAAE;gBACrD,IAAI,EAAE,QAAQ;aACf;SACF,CAAC,CACH,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/graph/structural.spec.d.ts

@@ -0,0 +1 @@
+export {};