@fougere/core 0.1.0-alpha.0

package/dist/graph.js

@@ -0,0 +1,142 @@
+/** Build the full entity dependency graph from scanned fronds. */
+export function buildGraph(fronds) {
+    const nodes = new Map();
+    // First pass: create nodes and collect refs
+    for (const frond of fronds) {
+        for (const entity of frond.entities) {
+            const refs = [];
+            for (const [, field] of Object.entries(entity.entityClass.getFields())) {
+                if (field.role?.relation?.kind === 'one') {
+                    const resolved = field.role.relation.to();
+                    const targetName = typeof resolved === 'function' && 'name' in resolved
+                        ? resolved.name.toLowerCase()
+                        : undefined;
+                    if (targetName)
+                        refs.push(targetName);
+                }
+            }
+            nodes.set(entity.name, { name: entity.name, frond: frond.name, refs, referencedBy: [] });
+        }
+    }
+    // Second pass: populate referencedBy
+    for (const [, node] of nodes) {
+        for (const ref of node.refs) {
+            const target = nodes.get(ref);
+            if (target)
+                target.referencedBy.push(node.name);
+        }
+    }
+    return nodes;
+}
+/**
+ * Cluster entities into domains using connected component analysis.
+ * Entities linked by refs (in either direction) belong to the same cluster.
+ */
+export function clusterEntities(nodes) {
+    const visited = new Set();
+    const clusters = [];
+    // BFS to find connected components
+    for (const [name] of nodes) {
+        if (visited.has(name))
+            continue;
+        const cluster = [];
+        const queue = [name];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (visited.has(current))
+                continue;
+            visited.add(current);
+            cluster.push(current);
+            const node = nodes.get(current);
+            for (const ref of [...node.refs, ...node.referencedBy]) {
+                if (!visited.has(ref) && nodes.has(ref)) {
+                    queue.push(ref);
+                }
+            }
+        }
+        if (cluster.length > 0)
+            clusters.push(cluster);
+    }
+    // Name each cluster by its hub (most referenced entity)
+    return clusters.map((entities) => {
+        const hub = entities
+            .map((name) => ({ name, score: nodes.get(name).referencedBy.length }))
+            .sort((a, b) => b.score - a.score)[0];
+        return {
+            name: hub.name,
+            entities,
+            crossRefs: [],
+        };
+    });
+}
+/**
+ * If there's only one big cluster, try to split it using Kernighan-Lin-style
+ * heuristic: find the entity with the fewest cross-links and use it as a cut point.
+ */
+export function suggestSplit(nodes, minClusterSize = 2) {
+    const clusters = clusterEntities(nodes);
+    // If already multiple clusters, just annotate cross-refs
+    if (clusters.length > 1) {
+        return annotateCrossRefs(clusters, nodes);
+    }
+    // No entities at all — nothing to cluster (empty or fresh workspace).
+    if (clusters.length === 0)
+        return clusters;
+    // Single cluster — try to find natural cut points
+    const allEntities = clusters[0].entities;
+    if (allEntities.length <= minClusterSize)
+        return clusters;
+    // Score each entity by how many unique "groups" it connects
+    // Entities with high betweenness are boundaries, not cluster members
+    const subClusters = [];
+    const assigned = new Set();
+    // Start with entities that have no outgoing refs (leaves/roots)
+    const roots = allEntities.filter((name) => nodes.get(name).refs.length === 0);
+    for (const root of roots) {
+        if (assigned.has(root))
+            continue;
+        const group = [root];
+        assigned.add(root);
+        // Add entities that reference this root
+        for (const refBy of nodes.get(root).referencedBy) {
+            if (!assigned.has(refBy)) {
+                group.push(refBy);
+                assigned.add(refBy);
+            }
+        }
+        subClusters.push(group);
+    }
+    // Any remaining unassigned entities form their own group
+    const remaining = allEntities.filter((name) => !assigned.has(name));
+    if (remaining.length > 0)
+        subClusters.push(remaining);
+    // Convert to domain clusters
+    const result = subClusters.map((entities) => {
+        const hub = entities
+            .map((name) => ({ name, score: nodes.get(name).referencedBy.length }))
+            .sort((a, b) => b.score - a.score)[0];
+        return { name: hub.name, entities, crossRefs: [] };
+    });
+    return annotateCrossRefs(result, nodes);
+}
+function annotateCrossRefs(clusters, nodes) {
+    const entityToCluster = new Map();
+    for (const cluster of clusters) {
+        for (const entity of cluster.entities) {
+            entityToCluster.set(entity, cluster.name);
+        }
+    }
+    for (const cluster of clusters) {
+        for (const entity of cluster.entities) {
+            const node = nodes.get(entity);
+            for (const ref of node.refs) {
+                const targetCluster = entityToCluster.get(ref);
+                if (targetCluster && targetCluster !== cluster.name) {
+                    cluster.crossRefs.push({ from: entity, to: ref, targetCluster });
+                }
+            }
+        }
+    }
+    return clusters;
+}
+//# sourceMappingURL=graph.js.map

package/dist/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAmBA,kEAAkE;AAClE,MAAM,UAAU,UAAU,CAAC,MAAyB;IAClD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;IAE5C,4CAA4C;IAC5C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,IAAI,GAAa,EAAE,CAAC;YAC1B,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC;gBACvE,IAAI,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,KAAK,KAAK,EAAE,CAAC;oBACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;oBAC1C,MAAM,UAAU,GAAG,OAAO,QAAQ,KAAK,UAAU,IAAI,MAAM,IAAI,QAAQ;wBACrE,CAAC,CAAE,QAAQ,CAAC,IAAe,CAAC,WAAW,EAAE;wBACzC,CAAC,CAAC,SAAS,CAAC;oBACd,IAAI,UAAU;wBAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;YACD,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3F,CAAC;IACH,CAAC;IAED,qCAAqC;IACrC,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QAC7B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,MAAM;gBAAE,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,KAA8B;IAC5D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,QAAQ,GAAe,EAAE,CAAC;IAEhC,mCAAmC;IACnC,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAEhC,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;QAErB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YACnC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAEtB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;YACjC,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;gBACvD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACxC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjD,CAAC;IAED,wDAAwD;IACxD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QAC/B,MAAM,GAAG,GAAG,QAAQ;aACjB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC;aACtE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAExC,OAAO;YACL,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,QAAQ;YACR,SAAS,EAAE,EAAE;SACd,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAC1B,KAA8B,EAC9B,cAAc,GAAG,CAAC;IAElB,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAExC,yDAAyD;IACzD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,OAAO,iBAAiB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED,sEAAsE;IACtE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAE3C,kDAAkD;IAClD,MAAM,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IACzC,IAAI,WAAW,CAAC,MAAM,IAAI,cAAc;QAAE,OAAO,QAAQ,CAAC;IAE1D,4DAA4D;IAC5D,qEAAqE;IACrE,MAAM,WAAW,GAAe,EAAE,CAAC;IACnC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,gEAAgE;IAChE,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;IAE/E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QACjC,MAAM,KAAK,GAAa,CAAC,IAAI,CAAC,CAAC;QAC/B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEnB,wCAAwC;QACxC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,YAAY,EAAE,CAAC;YAClD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAClB,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,yDAAyD;IACzD,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACpE,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;QAAE,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAEtD,6BAA6B;IAC7B,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QAC1C,MAAM,GAAG,GAAG,QAAQ;aACjB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC;aACtE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAgC,EAAE,CAAC;IACnF,CAAC,CAAC,CAAC;IAEH,OAAO,iBAAiB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAC1C,CAAC;AAED,SAAS,iBAAiB,CAAC,QAAyB,EAAE,KAA8B;IAClF,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;YACtC,eAAe,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAChC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC5B,MAAM,aAAa,GAAG,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC/C,IAAI,aAAa,IAAI,aAAa,KAAK,OAAO,CAAC,IAAI,EAAE,CAAC;oBACpD,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC,CAAC;gBACnE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/handler-parser.d.ts

@@ -0,0 +1,82 @@
+/** A parsed type reference — supports primitives, entities, arrays, generics. */
+export interface ParsedType {
+    /** Raw type text as written in source (e.g. 'Pagination<Post>'). */
+    raw: string;
+    /** Base type name (e.g. 'Pagination', 'string', 'Post'). */
+    name: string;
+    /** Whether this is an array (T[] or Array<T>) — true at any depth. */
+    array?: boolean;
+    /**
+     * How MANY array levels: `string[]` is 1, `string[][]` is 2. `array` only ever said
+     * "at least one", which sufficed while one level meant one thing. It stopped sufficing
+     * when a presenter method started taking the page — there the outer level IS the page
+     * and what remains is the field, so telling `string[]` from `string[][]` is telling a
+     * computed string from a computed list.
+     */
+    arrayDepth?: number;
+    /** Generic type arguments (e.g. for Pagination<Post> → [{ name: 'Post' }]). */
+    generics?: ParsedType[];
+    /** Whether the type is nullable (T | null | undefined). */
+    nullable?: boolean;
+    /** Whether this is a Promise wrapper (unwrapped in output). */
+    promise?: boolean;
+}
+/** A parsed method parameter. */
+export interface ParsedParam {
+    name: string;
+    type: ParsedType;
+    optional?: boolean;
+}
+/** A parsed method signature from a handler source file. */
+export interface ParsedMethod {
+    name: string;
+    params: ParsedParam[];
+    returnType?: ParsedType;
+    /**
+     * Came from a base class, not from the file being scanned. What a prefab
+     * handler declares about its own ops beats this — the scan reads a signature
+     * and guesses, the builder knows.
+     */
+    inherited?: boolean;
+    /**
+     * The operation in words — the first sentence of the method's doc comment.
+     *
+     * Not a new thing to write: handlers already carry it (`/** Judge: the author,
+     * a draft… *&#47;`), the AST already holds it, and nothing read it. A caller that
+     * discovers an operation over the wire has its name and its schema; what the
+     * operation is FOR lived only in the source.
+     */
+    description?: string;
+}
+/**
+ * Parse ALL method signatures from a handler source file (CRUD included).
+ *
+ * Used by the binding algorithm — every operation gets a BindingPlan.
+ * When projectRoot is provided, follows heritage clauses to parse parent methods.
+ */
+/**
+ * What a handler file yielded — its methods, AND what the pass could not open.
+ *
+ * The second half is why this is a pair rather than an array: an unresolvable base
+ * class used to give the same answer as a base class with no method, so an op
+ * inherited from an installed package was missing from the façade in silence. The
+ * pair travels through the scan cache, which is why {@link PARSER_VERSION} moved.
+ */
+export interface HandlerParse {
+    methods: ParsedMethod[];
+    /** Base classes whose source this pass could not open. Empty is a claim. */
+    unresolvedHeritage: string[];
+}
+export declare function parseAllHandlerMethods(filePath: string, projectRoot?: string): Promise<HandlerParse>;
+/**
+ * Parse a presenter source file and extract all method signatures.
+ *
+ * Returns all methods (no CRUD filtering) — each method is a computed field.
+ */
+export declare function parsePresenterMethods(filePath: string): Promise<ParsedMethod[]>;
+/**
+ * Parse constructor parameter types from a source file's default class.
+ * Returns type names (e.g. ['PostOrm', 'Logger']) for DI resolution.
+ */
+export declare function parseConstructorParams(filePath: string): Promise<ParsedParam[]>;
+//# sourceMappingURL=handler-parser.d.ts.map

package/dist/handler-parser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"handler-parser.d.ts","sourceRoot":"","sources":["../src/handler-parser.ts"],"names":[],"mappings":"AAqBA,iFAAiF;AACjF,MAAM,WAAW,UAAU;IACzB,oEAAoE;IACpE,GAAG,EAAE,MAAM,CAAC;IACZ,4DAA4D;IAC5D,IAAI,EAAE,MAAM,CAAC;IACb,sEAAsE;IACtE,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,+EAA+E;IAC/E,QAAQ,CAAC,EAAE,UAAU,EAAE,CAAC;IACxB,2DAA2D;IAC3D,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,+DAA+D;IAC/D,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,iCAAiC;AACjC,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,UAAU,CAAC;IACjB,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED,4DAA4D;AAC5D,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,WAAW,EAAE,CAAC;IACtB,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB;;;;OAIG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;;;;;OAOG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AA6dD;;;;;GAKG;AACH;;;;;;;GAOG;AACH,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,4EAA4E;IAC5E,kBAAkB,EAAE,MAAM,EAAE,CAAC;CAC9B;AAED,wBAAsB,sBAAsB,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,CAG1G;AAED;;;;GAIG;AACH,wBAAsB,qBAAqB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAKrF;AAED;;;GAGG;AACH,wBAAsB,sBAAsB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAiBrF"}