@compass-ai/nova 1.0.73 → 1.0.74

package/dist/services/complexity-classifier.d.ts

@@ -0,0 +1,208 @@
+/**
+ * Complexity classification service for determining execution mode.
+ *
+ * This service analyzes the user request and gathered context to determine:
+ * - DIRECT: Simple changes that can be executed immediately
+ * - CLARIFICATION: Requires user input to clarify requirements
+ * - PLAN: Complex changes requiring a full implementation plan
+ */
+import { type AnthropicClient } from './anthropic-client.js';
+import type { PersonalityMode } from '../types/session.js';
+import type { Message } from '../types/anthropic.js';
+import type { ContextGatheringResult, ComplexityClassificationResult } from '../types/workflow.js';
+/**
+ * Options for LLM-based classification.
+ */
+export interface LLMClassificationOptions {
+    /** Use a specific AnthropicClient instance instead of singleton */
+    client?: AnthropicClient;
+    /** Fall back to heuristic mode if LLM fails (default: true) */
+    fallbackToHeuristic?: boolean;
+    /** Timeout for LLM call in milliseconds (default: 30000) */
+    timeout?: number;
+    /** Personality mode for consistent tone with main assistant (default: 'professional') */
+    personalityMode?: PersonalityMode;
+    /** Abort signal to cancel the classification request */
+    abortSignal?: AbortSignal;
+    /** Previous conversation history to provide context for classification */
+    conversationHistory?: Message[];
+    /** Current model being used (to determine provider-specific classifier model) */
+    currentModel?: string;
+}
+/**
+ * ComplexityClassifier analyzes requests and determines the execution mode.
+ */
+declare class ComplexityClassifier {
+    /**
+     * Gets the appropriate classifier model for the given model/provider.
+     * Validates that the classifier model is from the same provider as the current model.
+     * Falls back to Anthropic's haiku if provider cannot be determined or validation fails.
+     *
+     * @param currentModel - The current model ID or alias
+     * @returns The classifier model to use
+     */
+    private getClassifierModelForProvider;
+    /**
+     * Classifies the complexity of a user request based on gathered context.
+     */
+    classify(userRequest: string, context: ContextGatheringResult): ComplexityClassificationResult;
+    /**
+     * Classifies complexity using LLM for the final decision.
+     *
+     * This method:
+     * 1. Runs all existing heuristic factor analysis (preserving that value)
+     * 2. Gets the heuristic suggestion as a baseline
+     * 3. Calls the LLM with all gathered context for final decision
+     * 4. Falls back to heuristic if LLM fails
+     *
+     * The LLM can override the heuristic when it detects nuances that rules miss.
+     */
+    classifyWithLLM(userRequest: string, context: ContextGatheringResult, options?: LLMClassificationOptions): Promise<ComplexityClassificationResult>;
+    /**
+     * Classifies complexity with LLM as the primary decision maker.
+     *
+     * This method:
+     * 1. Checks for fast-path (obviously trivial tasks skip LLM)
+     * 2. Extracts code snippets from relevant files
+     * 3. Sends snippets to LLM for semantic analysis
+     * 4. LLM makes decision based on actual code relationships, not heuristics
+     *
+     * The LLM can see real code and understand that 20 files with the same
+     * simple change is easier than 3 files with complex interdependencies.
+     */
+    classifyWithLLMFirst(userRequest: string, context: ContextGatheringResult, options?: LLMClassificationOptions): Promise<ComplexityClassificationResult>;
+    /**
+     * Checks if the request qualifies for fast-path (skip LLM).
+     * Uses balanced approach: only skip for obviously trivial tasks.
+     */
+    private checkFastPath;
+    /**
+     * Builds a result for fast-path classification.
+     */
+    private buildFastPathResult;
+    /**
+     * Parses the LLM-first response JSON.
+     */
+    private parseLLMFirstResponse;
+    /**
+     * Generates minimal complexity factors from LLM decision.
+     * Used for compatibility with downstream code that expects factors.
+     */
+    private generateMinimalFactors;
+    /**
+     * Builds the prompt for LLM classification with all gathered context.
+     */
+    private buildLLMClassificationPrompt;
+    /**
+     * Parses the LLM response JSON.
+     */
+    private parseLLMResponse;
+    /**
+     * Maps LLM mode string to ExecutionMode enum.
+     */
+    private mapLLMMode;
+    /**
+     * Maps LLM clarification questions to ClarificationQuestion format.
+     */
+    private mapLLMQuestions;
+    /**
+     * Builds a heuristic-based result (used as fallback or when LLM is unavailable).
+     */
+    private buildHeuristicResult;
+    /**
+     * Analyzes complexity factors from the request and context.
+     */
+    private analyzeFactors;
+    /**
+     * Calculates context sufficiency based on available code context and relevance scores.
+     * High sufficiency means we have enough information to proceed without clarification.
+     */
+    private calculateContextSufficiency;
+    /**
+     * Detects if this is a project creation / greenfield scenario.
+     */
+    private detectsProjectCreation;
+    /**
+     * Estimates files that will be created based on request content.
+     * Used when there are no existing files to analyze.
+     */
+    private estimateFilesFromRequest;
+    /**
+     * Estimates the number of files that will be affected.
+     */
+    private estimateFilesAffected;
+    /**
+     * Estimates lines of code that will change.
+     */
+    private estimateLinesChanged;
+    /**
+     * Detects if the request involves creating new abstractions.
+     */
+    private detectsAbstractionCreation;
+    /**
+     * Detects if the request involves architectural changes.
+     */
+    private detectsArchitecturalChange;
+    /**
+     * Detects if the request may cause breaking changes.
+     */
+    private detectsBreakingChanges;
+    /**
+     * Detects if changes affect multiple subsystems.
+     */
+    private detectsCrossCuttingConcerns;
+    /**
+     * Assesses how clear and unambiguous the requirements are.
+     */
+    private assessRequirementClarity;
+    /**
+     * Counts potential implementation approaches.
+     */
+    private countImplementationApproaches;
+    /**
+     * Detects if a migration will be needed.
+     */
+    private detectsMigrationNeed;
+    /**
+     * Calculates overall risk level (1-10).
+     */
+    private calculateRiskLevel;
+    /**
+     * Determines the execution mode based on factors.
+     *
+     * Priority order (revised for better balance):
+     * 1. DIRECT - Simple, straightforward tasks
+     * 2. TODO_LIST (for non-greenfield with context) - Medium complexity with sufficient context
+     * 3. CLARIFICATION - Only when genuinely needed and context is insufficient
+     * 4. PLAN - Complex architectural changes
+     */
+    private determineMode;
+    /**
+     * Calculates confidence in the classification.
+     * For PLAN mode, strong complexity signals INCREASE confidence.
+     * For DIRECT mode, simple signals increase confidence.
+     */
+    private calculateConfidence;
+    /**
+     * Generates human-readable reasoning for the classification.
+     */
+    private generateReasoning;
+    /**
+     * Generates clarification questions based on the analysis.
+     */
+    private generateQuestions;
+    /**
+     * Generates an effort estimate description.
+     */
+    private estimateEffort;
+}
+/**
+ * Gets the singleton ComplexityClassifier instance.
+ */
+export declare function getComplexityClassifier(): ComplexityClassifier;
+/**
+ * Creates a new ComplexityClassifier instance.
+ */
+export declare function createComplexityClassifier(): ComplexityClassifier;
+export { ComplexityClassifier };
+//# sourceMappingURL=complexity-classifier.d.ts.map

package/dist/services/complexity-classifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"complexity-classifier.d.ts","sourceRoot":"","sources":["../../src/services/complexity-classifier.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,EAAsB,KAAK,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAEjF,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAG3D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,KAAK,EACV,sBAAsB,EACtB,8BAA8B,EAO/B,MAAM,sBAAsB,CAAC;AA6K9B;;GAEG;AACH,MAAM,WAAW,wBAAwB;IACvC,mEAAmE;IACnE,MAAM,CAAC,EAAE,eAAe,CAAC;IACzB,+DAA+D;IAC/D,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,4DAA4D;IAC5D,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,yFAAyF;IACzF,eAAe,CAAC,EAAE,eAAe,CAAC;IAClC,wDAAwD;IACxD,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,0EAA0E;IAC1E,mBAAmB,CAAC,EAAE,OAAO,EAAE,CAAC;IAChC,iFAAiF;IACjF,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AA+HD;;GAEG;AACH,cAAM,oBAAoB;IACxB;;;;;;;OAOG;IACH,OAAO,CAAC,6BAA6B;IAsDrC;;OAEG;IACH,QAAQ,CACN,WAAW,EAAE,MAAM,EACnB,OAAO,EAAE,sBAAsB,GAC9B,8BAA8B;IAiCjC;;;;;;;;;;OAUG;IACG,eAAe,CACnB,WAAW,EAAE,MAAM,EACnB,OAAO,EAAE,sBAAsB,EAC/B,OAAO,GAAE,wBAA6B,GACrC,OAAO,CAAC,8BAA8B,CAAC;IA+H1C;;;;;;;;;;;OAWG;IACG,oBAAoB,CACxB,WAAW,EAAE,MAAM,EACnB,OAAO,EAAE,sBAAsB,EAC/B,OAAO,GAAE,wBAA6B,GACrC,OAAO,CAAC,8BAA8B,CAAC;IAuJ1C;;;OAGG;IACH,OAAO,CAAC,aAAa;IAqCrB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAmC3B;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAuC7B;;;OAGG;IACH,OAAO,CAAC,sBAAsB;IAkD9B;;OAEG;IACH,OAAO,CAAC,4BAA4B;IAoCpC;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAgCxB;;OAEG;IACH,OAAO,CAAC,UAAU;IAqBlB;;OAEG;IACH,OAAO,CAAC,eAAe;IAgDvB;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAkC5B;;OAEG;IACH,OAAO,CAAC,cAAc;IAoFtB;;;OAGG;IACH,OAAO,CAAC,2BAA2B;IAoDnC;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAI9B;;;OAGG;IACH,OAAO,CAAC,wBAAwB;IAyBhC;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAQ7B;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAiB5B;;OAEG;IACH,OAAO,CAAC,0BAA0B;IASlC;;OAEG;IACH,OAAO,CAAC,0BAA0B;IAWlC;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAI9B;;OAEG;IACH,OAAO,CAAC,2BAA2B;IAOnC;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAgBhC;;OAEG;IACH,OAAO,CAAC,6BAA6B;IAqCrC;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAU5B;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAwB1B;;;;;;;;OAQG;IACH,OAAO,CAAC,aAAa;IAmErB;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IA0F3B;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAsDzB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IA4CzB;;OAEG;IACH,OAAO,CAAC,cAAc;CAqBvB;AAKD;;GAEG;AACH,wBAAgB,uBAAuB,IAAI,oBAAoB,CAK9D;AAED;;GAEG;AACH,wBAAgB,0BAA0B,IAAI,oBAAoB,CAEjE;AAED,OAAO,EAAE,oBAAoB,EAAE,CAAC"}