@zbigniewsobiecki/squint 1.0.0

package/dist/commands/llm/features/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../src/commands/llm/features/types.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB"}

package/dist/commands/llm/features/types.js

@@ -0,0 +1,5 @@
+/**
+ * Shared types for the features module.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/commands/llm/features/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/commands/llm/features/types.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/commands/llm/features.d.ts

@@ -0,0 +1,7 @@
+import TargetCommand from '../features/generate.js';
+export default class LlmFeatures extends TargetCommand {
+    static description: string;
+    static hidden: boolean;
+    run(): Promise<void>;
+}
+//# sourceMappingURL=features.d.ts.map

package/dist/commands/llm/features.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"features.d.ts","sourceRoot":"","sources":["../../../src/commands/llm/features.ts"],"names":[],"mappings":"AACA,OAAO,aAAa,MAAM,yBAAyB,CAAC;AAEpD,MAAM,CAAC,OAAO,OAAO,WAAY,SAAQ,aAAa;IACpD,OAAgB,WAAW,SAAkD;IAC7E,OAAgB,MAAM,UAAQ;IAEjB,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;CAMlC"}

package/dist/commands/llm/features.js

@@ -0,0 +1,11 @@
+import chalk from 'chalk';
+import TargetCommand from '../features/generate.js';
+export default class LlmFeatures extends TargetCommand {
+    static description = '[Deprecated] Use "features generate" instead';
+    static hidden = true;
+    async run() {
+        process.stderr.write(chalk.yellow('Warning: "squint llm features" is deprecated. Use "squint features generate" instead.\n'));
+        return super.run();
+    }
+}
+//# sourceMappingURL=features.js.map

package/dist/commands/llm/features.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"features.js","sourceRoot":"","sources":["../../../src/commands/llm/features.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,OAAO,CAAC;AAC1B,OAAO,aAAa,MAAM,yBAAyB,CAAC;AAEpD,MAAM,CAAC,OAAO,OAAO,WAAY,SAAQ,aAAa;IACpD,MAAM,CAAU,WAAW,GAAG,8CAA8C,CAAC;IAC7E,MAAM,CAAU,MAAM,GAAG,IAAI,CAAC;IAEvB,KAAK,CAAC,GAAG;QACd,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,KAAK,CAAC,MAAM,CAAC,yFAAyF,CAAC,CACxG,CAAC;QACF,OAAO,KAAK,CAAC,GAAG,EAAE,CAAC;IACrB,CAAC"}

package/dist/commands/llm/flows/atomic-flow-builder.d.ts

@@ -0,0 +1,51 @@
+/**
+ * AtomicFlowBuilder - Deterministic tier-0 flow builder.
+ * Builds short atomic flows (1-3 interactions) from the interaction graph alone.
+ * No LLM calls — purely structural.
+ */
+import type { InteractionWithPaths, Module } from '../../../db/schema.js';
+import type { FlowSuggestion } from './types.js';
+export declare class AtomicFlowBuilder {
+    /**
+     * Build tier-0 atomic flows from interactions and modules.
+     * Each atomic flow has 1-3 interactions covering a small entity-scoped chain.
+     */
+    buildAtomicFlows(interactions: InteractionWithPaths[], modules: Module[]): FlowSuggestion[];
+    /**
+     * Group interactions by entity pair.
+     * Key = sorted(fromEntity, toEntity) for bidirectional grouping.
+     * Interactions between _generic modules get their own group per module pair.
+     */
+    private groupByEntityPair;
+    /**
+     * Find connected chains within a group of interactions.
+     * A chain is a sequence where one interaction's toModuleId matches the next's fromModuleId.
+     */
+    private findChains;
+    /**
+     * Split a chain longer than maxLen into overlapping segments.
+     * Each segment has at most maxLen interactions.
+     */
+    private splitChain;
+    /**
+     * Build a FlowSuggestion from a segment of interactions.
+     */
+    private buildFlowFromSegment;
+    /**
+     * Generate a name for an atomic flow from its interactions.
+     */
+    private generateAtomicName;
+    /**
+     * Generate a description for an atomic flow.
+     */
+    private generateAtomicDescription;
+    /**
+     * Get short module name from module.
+     */
+    private shortModuleName;
+    /**
+     * Infer stakeholder from module path (reuse same logic as FlowTracer).
+     */
+    private inferStakeholder;
+}
+//# sourceMappingURL=atomic-flow-builder.d.ts.map

package/dist/commands/llm/flows/atomic-flow-builder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"atomic-flow-builder.d.ts","sourceRoot":"","sources":["../../../../src/commands/llm/flows/atomic-flow-builder.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAE1E,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAgBjD,qBAAa,iBAAiB;IAC5B;;;OAGG;IACH,gBAAgB,CAAC,YAAY,EAAE,oBAAoB,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,cAAc,EAAE;IA+B3F;;;;OAIG;IACH,OAAO,CAAC,iBAAiB;IAiCzB;;;OAGG;IACH,OAAO,CAAC,UAAU;IAoDlB;;;OAGG;IACH,OAAO,CAAC,UAAU;IAUlB;;OAEG;IACH,OAAO,CAAC,oBAAoB;IA6C5B;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAoC1B;;OAEG;IACH,OAAO,CAAC,yBAAyB;IASjC;;OAEG;IACH,OAAO,CAAC,eAAe;IAKvB;;OAEG;IACH,OAAO,CAAC,gBAAgB;CAQzB"}

package/dist/commands/llm/flows/atomic-flow-builder.js

@@ -0,0 +1,247 @@
+/**
+ * AtomicFlowBuilder - Deterministic tier-0 flow builder.
+ * Builds short atomic flows (1-3 interactions) from the interaction graph alone.
+ * No LLM calls — purely structural.
+ */
+import { groupModulesByEntity } from '../_shared/entity-utils.js';
+/**
+ * Build a map from module ID to entity name using groupModulesByEntity.
+ */
+function buildModuleEntityMap(modules) {
+    const entityGroups = groupModulesByEntity(modules);
+    const map = new Map();
+    for (const [entity, mods] of entityGroups) {
+        for (const mod of mods) {
+            map.set(mod.id, entity);
+        }
+    }
+    return map;
+}
+export class AtomicFlowBuilder {
+    /**
+     * Build tier-0 atomic flows from interactions and modules.
+     * Each atomic flow has 1-3 interactions covering a small entity-scoped chain.
+     */
+    buildAtomicFlows(interactions, modules) {
+        // Filter out test-internal interactions
+        const relevant = interactions.filter((i) => i.pattern !== 'test-internal');
+        if (relevant.length === 0)
+            return [];
+        const moduleEntityMap = buildModuleEntityMap(modules);
+        const moduleById = new Map(modules.map((m) => [m.id, m]));
+        // Group interactions by entity pair
+        const groups = this.groupByEntityPair(relevant, moduleEntityMap);
+        // For each group, chain consecutive interactions and split into atomic flows
+        const atomicFlows = [];
+        const usedSlugs = new Set();
+        for (const [groupKey, groupInteractions] of groups) {
+            const chains = this.findChains(groupInteractions);
+            for (const chain of chains) {
+                const segments = this.splitChain(chain, 3);
+                for (const segment of segments) {
+                    const flow = this.buildFlowFromSegment(segment, groupKey, moduleById, moduleEntityMap, usedSlugs);
+                    if (flow) {
+                        atomicFlows.push(flow);
+                    }
+                }
+            }
+        }
+        return atomicFlows;
+    }
+    /**
+     * Group interactions by entity pair.
+     * Key = sorted(fromEntity, toEntity) for bidirectional grouping.
+     * Interactions between _generic modules get their own group per module pair.
+     */
+    groupByEntityPair(interactions, moduleEntityMap) {
+        const groups = new Map();
+        for (const interaction of interactions) {
+            const fromEntity = moduleEntityMap.get(interaction.fromModuleId) ?? '_generic';
+            const toEntity = moduleEntityMap.get(interaction.toModuleId) ?? '_generic';
+            let key;
+            if (fromEntity === '_generic' && toEntity === '_generic') {
+                // Both generic: group by specific module pair
+                const ids = [interaction.fromModuleId, interaction.toModuleId].sort((a, b) => a - b);
+                key = `_generic:${ids[0]}-${ids[1]}`;
+            }
+            else if (fromEntity === '_generic' || toEntity === '_generic') {
+                // One generic, one entity: group under the entity
+                const entity = fromEntity === '_generic' ? toEntity : fromEntity;
+                key = `${entity}:_generic`;
+            }
+            else {
+                // Both have entities: sort for bidirectional grouping
+                const sorted = [fromEntity, toEntity].sort();
+                key = `${sorted[0]}:${sorted[1]}`;
+            }
+            const list = groups.get(key) ?? [];
+            list.push(interaction);
+            groups.set(key, list);
+        }
+        return groups;
+    }
+    /**
+     * Find connected chains within a group of interactions.
+     * A chain is a sequence where one interaction's toModuleId matches the next's fromModuleId.
+     */
+    findChains(interactions) {
+        if (interactions.length === 0)
+            return [];
+        // Build adjacency: fromModuleId -> interactions originating from it
+        const fromIndex = new Map();
+        for (const i of interactions) {
+            const list = fromIndex.get(i.fromModuleId) ?? [];
+            list.push(i);
+            fromIndex.set(i.fromModuleId, list);
+        }
+        const used = new Set(); // interaction IDs already in a chain
+        const chains = [];
+        // Find chain starting points: interactions whose fromModule isn't a toModule of another in the group
+        const toModules = new Set(interactions.map((i) => i.toModuleId));
+        const startInteractions = interactions.filter((i) => !toModules.has(i.fromModuleId));
+        // If no clear starts (cycle), just start from the first unused
+        const starts = startInteractions.length > 0 ? startInteractions : [interactions[0]];
+        for (const start of starts) {
+            if (used.has(start.id))
+                continue;
+            const chain = [start];
+            used.add(start.id);
+            // Follow the chain forward
+            let currentToModule = start.toModuleId;
+            while (true) {
+                const nexts = fromIndex.get(currentToModule) ?? [];
+                const next = nexts.find((n) => !used.has(n.id));
+                if (!next)
+                    break;
+                chain.push(next);
+                used.add(next.id);
+                currentToModule = next.toModuleId;
+            }
+            chains.push(chain);
+        }
+        // Pick up any remaining interactions not in a chain
+        for (const i of interactions) {
+            if (!used.has(i.id)) {
+                chains.push([i]);
+                used.add(i.id);
+            }
+        }
+        return chains;
+    }
+    /**
+     * Split a chain longer than maxLen into overlapping segments.
+     * Each segment has at most maxLen interactions.
+     */
+    splitChain(chain, maxLen) {
+        if (chain.length <= maxLen)
+            return [chain];
+        const segments = [];
+        for (let i = 0; i < chain.length; i += maxLen) {
+            segments.push(chain.slice(i, i + maxLen));
+        }
+        return segments;
+    }
+    /**
+     * Build a FlowSuggestion from a segment of interactions.
+     */
+    buildFlowFromSegment(segment, _groupKey, moduleById, moduleEntityMap, usedSlugs) {
+        if (segment.length === 0)
+            return null;
+        const name = this.generateAtomicName(segment, moduleById, moduleEntityMap);
+        let slug = name
+            .toLowerCase()
+            .replace(/[^a-z0-9]+/g, '-')
+            .replace(/^-|-$/g, '');
+        // Deduplicate slugs
+        if (usedSlugs.has(slug)) {
+            let counter = 2;
+            while (usedSlugs.has(`${slug}-${counter}`))
+                counter++;
+            slug = `${slug}-${counter}`;
+        }
+        usedSlugs.add(slug);
+        const firstInteraction = segment[0];
+        const fromModule = moduleById.get(firstInteraction.fromModuleId);
+        const fromEntity = moduleEntityMap.get(firstInteraction.fromModuleId) ?? '_generic';
+        return {
+            name,
+            slug,
+            entryPointModuleId: firstInteraction.fromModuleId,
+            entryPointId: null,
+            entryPath: fromModule?.fullPath ?? '',
+            stakeholder: this.inferStakeholder(fromModule?.fullPath ?? ''),
+            description: this.generateAtomicDescription(segment),
+            interactionIds: segment.map((i) => i.id),
+            definitionSteps: [],
+            inferredSteps: [],
+            actionType: null,
+            targetEntity: fromEntity !== '_generic' ? fromEntity.toLowerCase() : null,
+            tier: 0,
+            subflowSlugs: [],
+        };
+    }
+    /**
+     * Generate a name for an atomic flow from its interactions.
+     */
+    generateAtomicName(segment, moduleById, moduleEntityMap) {
+        // Try using semantic annotation from the first interaction
+        const firstSemantic = segment[0].semantic;
+        if (firstSemantic && firstSemantic.length > 5) {
+            // Clean up and use as name
+            const clean = firstSemantic
+                .replace(/^(the |this )/i, '')
+                .replace(/[.!]$/, '')
+                .toLowerCase()
+                .slice(0, 60);
+            return clean;
+        }
+        // Fall back to module names: "hooks → api"
+        const fromMod = moduleById.get(segment[0].fromModuleId);
+        const toMod = moduleById.get(segment[segment.length - 1].toModuleId);
+        const fromName = this.shortModuleName(fromMod);
+        const toName = this.shortModuleName(toMod);
+        // Add entity prefix if available
+        const fromEntity = moduleEntityMap.get(segment[0].fromModuleId) ?? '_generic';
+        const toEntity = moduleEntityMap.get(segment[segment.length - 1].toModuleId) ?? '_generic';
+        const entity = fromEntity !== '_generic' ? fromEntity.toLowerCase() : toEntity !== '_generic' ? toEntity.toLowerCase() : null;
+        if (entity) {
+            return `${entity} ${fromName} calls ${toName}`;
+        }
+        return `${fromName} calls ${toName}`;
+    }
+    /**
+     * Generate a description for an atomic flow.
+     */
+    generateAtomicDescription(segment) {
+        const parts = segment.map((i) => {
+            const from = i.fromModulePath.split('.').pop() ?? '?';
+            const to = i.toModulePath.split('.').pop() ?? '?';
+            return `${from} → ${to}${i.semantic ? ` (${i.semantic})` : ''}`;
+        });
+        return parts.join(', ');
+    }
+    /**
+     * Get short module name from module.
+     */
+    shortModuleName(mod) {
+        if (!mod)
+            return '?';
+        return mod.fullPath.split('.').pop() ?? mod.name;
+    }
+    /**
+     * Infer stakeholder from module path (reuse same logic as FlowTracer).
+     */
+    inferStakeholder(path) {
+        const lower = path.toLowerCase();
+        if (lower.includes('admin'))
+            return 'admin';
+        if (lower.includes('api') || lower.includes('route'))
+            return 'external';
+        if (lower.includes('cron') || lower.includes('job') || lower.includes('worker'))
+            return 'system';
+        if (lower.includes('cli') || lower.includes('command'))
+            return 'developer';
+        return 'user';
+    }
+}
+//# sourceMappingURL=atomic-flow-builder.js.map

package/dist/commands/llm/flows/atomic-flow-builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"atomic-flow-builder.js","sourceRoot":"","sources":["../../../../src/commands/llm/flows/atomic-flow-builder.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,oBAAoB,EAAE,MAAM,4BAA4B,CAAC;AAGlE;;GAEG;AACH,SAAS,oBAAoB,CAAC,OAAiB;IAC7C,MAAM,YAAY,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;IACnD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,YAAY,EAAE,CAAC;QAC1C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,OAAO,iBAAiB;IAC5B;;;OAGG;IACH,gBAAgB,CAAC,YAAoC,EAAE,OAAiB;QACtE,wCAAwC;QACxC,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,eAAe,CAAC,CAAC;QAC3E,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,eAAe,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;QACtD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE1D,oCAAoC;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC;QAEjE,6EAA6E;QAC7E,MAAM,WAAW,GAAqB,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,KAAK,MAAM,CAAC,QAAQ,EAAE,iBAAiB,CAAC,IAAI,MAAM,EAAE,CAAC;YACnD,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,iBAAiB,CAAC,CAAC;YAClD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC3C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;oBAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,oBAAoB,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;oBAClG,IAAI,IAAI,EAAE,CAAC;wBACT,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACK,iBAAiB,CACvB,YAAoC,EACpC,eAAoC;QAEpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkC,CAAC;QAEzD,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;YACvC,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,WAAW,CAAC,YAAY,CAAC,IAAI,UAAU,CAAC;YAC/E,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC;YAE3E,IAAI,GAAW,CAAC;YAChB,IAAI,UAAU,KAAK,UAAU,IAAI,QAAQ,KAAK,UAAU,EAAE,CAAC;gBACzD,8CAA8C;gBAC9C,MAAM,GAAG,GAAG,CAAC,WAAW,CAAC,YAAY,EAAE,WAAW,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrF,GAAG,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACvC,CAAC;iBAAM,IAAI,UAAU,KAAK,UAAU,IAAI,QAAQ,KAAK,UAAU,EAAE,CAAC;gBAChE,kDAAkD;gBAClD,MAAM,MAAM,GAAG,UAAU,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC;gBACjE,GAAG,GAAG,GAAG,MAAM,WAAW,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,sDAAsD;gBACtD,MAAM,MAAM,GAAG,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC7C,GAAG,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YACpC,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACxB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,UAAU,CAAC,YAAoC;QACrD,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEzC,oEAAoE;QACpE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkC,CAAC;QAC5D,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YACjD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC,CAAC,qCAAqC;QACrE,MAAM,MAAM,GAA6B,EAAE,CAAC;QAE5C,qGAAqG;QACrG,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QACjE,MAAM,iBAAiB,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;QAErF,+DAA+D;QAC/D,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpF,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEjC,MAAM,KAAK,GAA2B,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAEnB,2BAA2B;YAC3B,IAAI,eAAe,GAAG,KAAK,CAAC,UAAU,CAAC;YACvC,OAAO,IAAI,EAAE,CAAC;gBACZ,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;gBACnD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAChD,IAAI,CAAC,IAAI;oBAAE,MAAM;gBACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAClB,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC;YACpC,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;QAED,oDAAoD;QACpD,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,UAAU,CAAC,KAA6B,EAAE,MAAc;QAC9D,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM;YAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAE3C,MAAM,QAAQ,GAA6B,EAAE,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC;YAC9C,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,oBAAoB,CAC1B,OAA+B,EAC/B,SAAiB,EACjB,UAA+B,EAC/B,eAAoC,EACpC,SAAsB;QAEtB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAEtC,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,UAAU,EAAE,eAAe,CAAC,CAAC;QAC3E,IAAI,IAAI,GAAG,IAAI;aACZ,WAAW,EAAE;aACb,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC;aAC3B,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAEzB,oBAAoB;QACpB,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,OAAO,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,IAAI,OAAO,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YACtD,IAAI,GAAG,GAAG,IAAI,IAAI,OAAO,EAAE,CAAC;QAC9B,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEpB,MAAM,gBAAgB,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,gBAAgB,CAAC,YAAY,CAAC,CAAC;QACjE,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,gBAAgB,CAAC,YAAY,CAAC,IAAI,UAAU,CAAC;QAEpF,OAAO;YACL,IAAI;YACJ,IAAI;YACJ,kBAAkB,EAAE,gBAAgB,CAAC,YAAY;YACjD,YAAY,EAAE,IAAI;YAClB,SAAS,EAAE,UAAU,EAAE,QAAQ,IAAI,EAAE;YACrC,WAAW,EAAE,IAAI,CAAC,gBAAgB,CAAC,UAAU,EAAE,QAAQ,IAAI,EAAE,CAAC;YAC9D,WAAW,EAAE,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC;YACpD,cAAc,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxC,eAAe,EAAE,EAAE;YACnB,aAAa,EAAE,EAAE;YACjB,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,UAAU,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI;YACzE,IAAI,EAAE,CAAC;YACP,YAAY,EAAE,EAAE;SACjB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,kBAAkB,CACxB,OAA+B,EAC/B,UAA+B,EAC/B,eAAoC;QAEpC,2DAA2D;QAC3D,MAAM,aAAa,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC1C,IAAI,aAAa,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,2BAA2B;YAC3B,MAAM,KAAK,GAAG,aAAa;iBACxB,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC;iBAC7B,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;iBACpB,WAAW,EAAE;iBACb,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAChB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,2CAA2C;QAC3C,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QACxD,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACrE,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAE3C,iCAAiC;QACjC,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,UAAU,CAAC;QAC9E,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC;QAC3F,MAAM,MAAM,GACV,UAAU,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QAEjH,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,GAAG,MAAM,IAAI,QAAQ,UAAU,MAAM,EAAE,CAAC;QACjD,CAAC;QAED,OAAO,GAAG,QAAQ,UAAU,MAAM,EAAE,CAAC;IACvC,CAAC;IAED;;OAEG;IACK,yBAAyB,CAAC,OAA+B;QAC/D,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC9B,MAAM,IAAI,GAAG,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC;YACtD,MAAM,EAAE,GAAG,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC;YAClD,OAAO,GAAG,IAAI,MAAM,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;QAClE,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,GAAuB;QAC7C,IAAI,CAAC,GAAG;YAAE,OAAO,GAAG,CAAC;QACrB,OAAO,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC;IACnD,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,IAAY;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC;QAC5C,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,OAAO,UAAU,CAAC;QACxE,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,OAAO,QAAQ,CAAC;QACjG,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC;YAAE,OAAO,WAAW,CAAC;QAC3E,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}

package/dist/commands/llm/flows/dedup.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Interaction-overlap deduplication for flows.
+ * Removes lower-quality flows when their interaction sets significantly overlap.
+ */
+import type { FlowSuggestion } from './types.js';
+/**
+ * Remove flows whose interaction sets overlap above the given threshold.
+ * When two flows overlap, the lower-quality one (per `pickFlowToDrop`) is removed.
+ *
+ * Overlap ratio = |intersection| / min(|A|, |B|)
+ */
+export declare function deduplicateByInteractionOverlap(flows: FlowSuggestion[], threshold?: number): FlowSuggestion[];
+/**
+ * Given two overlapping flows, decide which to drop.
+ * Prefer keeping: specific over catch-all > higher tier > more definitionSteps > fewer interactionIds (more focused) > earlier in array.
+ */
+export declare function pickFlowToDrop(a: FlowSuggestion, b: FlowSuggestion, idxA: number, idxB: number): number;
+//# sourceMappingURL=dedup.d.ts.map

package/dist/commands/llm/flows/dedup.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dedup.d.ts","sourceRoot":"","sources":["../../../../src/commands/llm/flows/dedup.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAEjD;;;;;GAKG;AACH,wBAAgB,+BAA+B,CAAC,KAAK,EAAE,cAAc,EAAE,EAAE,SAAS,SAAM,GAAG,cAAc,EAAE,CA0C1G;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAqBvG"}

package/dist/commands/llm/flows/dedup.js

@@ -0,0 +1,76 @@
+/**
+ * Interaction-overlap deduplication for flows.
+ * Removes lower-quality flows when their interaction sets significantly overlap.
+ */
+/**
+ * Remove flows whose interaction sets overlap above the given threshold.
+ * When two flows overlap, the lower-quality one (per `pickFlowToDrop`) is removed.
+ *
+ * Overlap ratio = |intersection| / min(|A|, |B|)
+ */
+export function deduplicateByInteractionOverlap(flows, threshold = 0.7) {
+    const dropped = new Set(); // indices into `flows`
+    for (let i = 0; i < flows.length; i++) {
+        if (dropped.has(i))
+            continue;
+        const a = flows[i];
+        if (a.interactionIds.length === 0)
+            continue;
+        const setA = new Set(a.interactionIds);
+        for (let j = i + 1; j < flows.length; j++) {
+            if (dropped.has(j))
+                continue;
+            const b = flows[j];
+            if (b.interactionIds.length === 0)
+                continue;
+            // Don't dedup flows that represent different user journeys
+            // (different specific actionType+targetEntity combos)
+            if (a.actionType && a.targetEntity && b.actionType && b.targetEntity) {
+                const aKey = `${a.actionType}:${a.targetEntity}`;
+                const bKey = `${b.actionType}:${b.targetEntity}`;
+                if (aKey !== bKey)
+                    continue;
+            }
+            const setB = new Set(b.interactionIds);
+            let intersectionSize = 0;
+            const smaller = setA.size <= setB.size ? setA : setB;
+            const larger = setA.size <= setB.size ? setB : setA;
+            for (const id of smaller) {
+                if (larger.has(id))
+                    intersectionSize++;
+            }
+            const minSize = Math.min(setA.size, setB.size);
+            const overlapRatio = intersectionSize / minSize;
+            if (overlapRatio > threshold) {
+                const dropIndex = pickFlowToDrop(a, b, i, j);
+                dropped.add(dropIndex);
+            }
+        }
+    }
+    return flows.filter((_, idx) => !dropped.has(idx));
+}
+/**
+ * Given two overlapping flows, decide which to drop.
+ * Prefer keeping: specific over catch-all > higher tier > more definitionSteps > fewer interactionIds (more focused) > earlier in array.
+ */
+export function pickFlowToDrop(a, b, idxA, idxB) {
+    // Specific flows (with actionType+targetEntity) beat catch-all flows (without)
+    const aSpecific = !!(a.actionType && a.targetEntity);
+    const bSpecific = !!(b.actionType && b.targetEntity);
+    if (aSpecific !== bSpecific)
+        return aSpecific ? idxB : idxA;
+    // Higher tier wins
+    if (a.tier !== b.tier)
+        return a.tier > b.tier ? idxB : idxA;
+    // More definition steps wins
+    if (a.definitionSteps.length !== b.definitionSteps.length) {
+        return a.definitionSteps.length > b.definitionSteps.length ? idxB : idxA;
+    }
+    // Fewer interaction IDs wins (more focused flow is better than catch-all)
+    if (a.interactionIds.length !== b.interactionIds.length) {
+        return a.interactionIds.length < b.interactionIds.length ? idxB : idxA;
+    }
+    // Earlier in array wins (drop the later one)
+    return idxB;
+}
+//# sourceMappingURL=dedup.js.map

package/dist/commands/llm/flows/dedup.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dedup.js","sourceRoot":"","sources":["../../../../src/commands/llm/flows/dedup.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;;;GAKG;AACH,MAAM,UAAU,+BAA+B,CAAC,KAAuB,EAAE,SAAS,GAAG,GAAG;IACtF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC,CAAC,uBAAuB;IAE1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC7B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC5C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;QAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC7B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAE5C,2DAA2D;YAC3D,sDAAsD;YACtD,IAAI,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;gBACrE,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;gBACjD,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;gBACjD,IAAI,IAAI,KAAK,IAAI;oBAAE,SAAS;YAC9B,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;YAEvC,IAAI,gBAAgB,GAAG,CAAC,CAAC;YACzB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;YACrD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;YACpD,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACzB,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,gBAAgB,EAAE,CAAC;YACzC,CAAC;YAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/C,MAAM,YAAY,GAAG,gBAAgB,GAAG,OAAO,CAAC;YAEhD,IAAI,YAAY,GAAG,SAAS,EAAE,CAAC;gBAC7B,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7C,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,CAAiB,EAAE,CAAiB,EAAE,IAAY,EAAE,IAAY;IAC7F,+EAA+E;IAC/E,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC;IACrD,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC;IACrD,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAE5D,mBAAmB;IACnB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAE5D,6BAA6B;IAC7B,IAAI,CAAC,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;QAC1D,OAAO,CAAC,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3E,CAAC;IAED,0EAA0E;IAC1E,IAAI,CAAC,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC;QACxD,OAAO,CAAC,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACzE,CAAC;IAED,6CAA6C;IAC7C,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/commands/llm/flows/entry-point-detector.d.ts

@@ -0,0 +1,41 @@
+/**
+ * EntryPointDetector - LLM-based entry point module classification.
+ * Identifies modules and their members that serve as entry points for user flows.
+ */
+import type { Command } from '@oclif/core';
+import type { IndexDatabase } from '../../../db/database.js';
+import type { EntryPointModuleInfo, LlmOptions, MemberClassification } from './types.js';
+export declare class EntryPointDetector {
+    private readonly db;
+    private readonly command;
+    private readonly isJson;
+    private readonly verbose;
+    private memberClassifications;
+    constructor(db: IndexDatabase, command: Command, isJson: boolean, verbose: boolean);
+    /**
+     * Detect entry point modules using LLM classification.
+     */
+    detectEntryPointModules(model: string, llmOptions: LlmOptions): Promise<EntryPointModuleInfo[]>;
+    /**
+     * Get stored member classifications (available after detectEntryPointModules is called).
+     */
+    getMemberClassifications(): MemberClassification[];
+    /**
+     * Use LLM to classify modules and their member functions for user journey detection.
+     */
+    private classifyModulesAsEntryPoints;
+    /**
+     * Use LLM to classify module members with action types and target entities.
+     */
+    private classifyModuleMembers;
+    private buildClassificationSystemPrompt;
+    private buildModuleContext;
+    private buildInteractionContext;
+    private buildRelationshipContext;
+    private parseMemberClassificationCSV;
+    private inferMemberActionType;
+    private isLikelyEntryPointMemberHeuristic;
+    private isLikelyEntryPointModuleHeuristic;
+    private buildEntryPointModules;
+}
+//# sourceMappingURL=entry-point-detector.d.ts.map

package/dist/commands/llm/flows/entry-point-detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entry-point-detector.d.ts","sourceRoot":"","sources":["../../../../src/commands/llm/flows/entry-point-detector.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAY7D,OAAO,KAAK,EAGV,oBAAoB,EACpB,UAAU,EACV,oBAAoB,EAErB,MAAM,YAAY,CAAC;AAEpB,qBAAa,kBAAkB;IAI3B,OAAO,CAAC,QAAQ,CAAC,EAAE;IACnB,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,OAAO;IAN1B,OAAO,CAAC,qBAAqB,CAA8B;gBAGxC,EAAE,EAAE,aAAa,EACjB,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,OAAO;IAGnC;;OAEG;IACG,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAC;IA4DrG;;OAEG;IACH,wBAAwB,IAAI,oBAAoB,EAAE;IAIlD;;OAEG;YACW,4BAA4B;IA8B1C;;OAEG;YACW,qBAAqB;IA8CnC,OAAO,CAAC,+BAA+B;IA4CvC,OAAO,CAAC,kBAAkB;IAe1B,OAAO,CAAC,uBAAuB;IAc/B,OAAO,CAAC,wBAAwB;IAShC,OAAO,CAAC,4BAA4B;IAwDpC,OAAO,CAAC,qBAAqB;IA8C7B,OAAO,CAAC,iCAAiC;IAWzC,OAAO,CAAC,iCAAiC;IAoBzC,OAAO,CAAC,sBAAsB;CAyD/B"}