@defai.digital/automatosx 8.0.19 → 8.0.21

package/dist/src/services/QueryRouter.d.ts

@@ -1,85 +0,0 @@
-/**
- * QueryRouter.ts
- *
- * Intelligent query router that detects user intent and routes to appropriate search backend
- * - Exact symbol search for identifier names
- * - Natural language search for descriptive queries
- * - Hybrid search combining both strategies
- */
-/**
- * Query intent classification
- */
-export declare enum QueryIntent {
-    SYMBOL = "symbol",// Exact symbol name lookup (e.g., "Calculator", "login")
-    NATURAL = "natural",// Natural language query (e.g., "user authentication logic")
-    HYBRID = "hybrid"
-}
-/**
- * Query analysis result
- */
-export interface QueryAnalysis {
-    intent: QueryIntent;
-    confidence: number;
-    query: string;
-    normalizedQuery: string;
-    features: {
-        isSingleWord: boolean;
-        hasOperators: boolean;
-        isIdentifier: boolean;
-        wordCount: number;
-        hasCommonWords: boolean;
-        hasSpecialChars: boolean;
-    };
-}
-/**
- * QueryRouter - Intelligent query intent detection and routing
- */
-export declare class QueryRouter {
-    private static readonly COMMON_WORDS;
-    private static readonly FTS5_OPERATORS;
-    /**
-     * Analyze query and determine intent
-     *
-     * @param query - User search query
-     * @returns Query analysis with intent and features
-     */
-    analyze(query: string): QueryAnalysis;
-    /**
-     * Determine query intent from features
-     */
-    private determineIntent;
-    /**
-     * Calculate confidence score for intent classification
-     */
-    private calculateConfidence;
-    /**
-     * Check if query has FTS5 boolean operators
-     */
-    private hasOperators;
-    /**
-     * Check if query looks like an identifier (PascalCase, camelCase, snake_case)
-     * For multi-word queries, checks if ANY word is an identifier
-     */
-    private isIdentifier;
-    /**
-     * Check if a single word is an identifier
-     */
-    private isIdentifierWord;
-    /**
-     * Check if query contains common English words
-     */
-    private hasCommonWords;
-    /**
-     * Check if query has special characters (indicating code search)
-     */
-    private hasSpecialChars;
-    /**
-     * Format analysis for display
-     */
-    formatAnalysis(analysis: QueryAnalysis): string;
-    /**
-     * Get search strategy explanation for user
-     */
-    getStrategyExplanation(intent: QueryIntent): string;
-}
-//# sourceMappingURL=QueryRouter.d.ts.map

package/dist/src/services/QueryRouter.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"QueryRouter.d.ts","sourceRoot":"","sources":["../../../src/services/QueryRouter.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;GAEG;AACH,oBAAY,WAAW;IACrB,MAAM,WAAW,CAAY,yDAAyD;IACtF,OAAO,YAAY,CAAU,6DAA6D;IAC1F,MAAM,WAAW;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,WAAW,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,EAAE;QACR,YAAY,EAAE,OAAO,CAAC;QACtB,YAAY,EAAE,OAAO,CAAC;QACtB,YAAY,EAAE,OAAO,CAAC;QACtB,SAAS,EAAE,MAAM,CAAC;QAClB,cAAc,EAAE,OAAO,CAAC;QACxB,eAAe,EAAE,OAAO,CAAC;KAC1B,CAAC;CACH;AAED;;GAEG;AACH,qBAAa,WAAW;IAEtB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CASjC;IAGH,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAwB;IAE9D;;;;;OAKG;IACH,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,aAAa;IA6BrC;;OAEG;IACH,OAAO,CAAC,eAAe;IAmCvB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IA4B3B;;OAEG;IACH,OAAO,CAAC,YAAY;IAOpB;;;OAGG;IACH,OAAO,CAAC,YAAY;IAUpB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAgBxB;;OAEG;IACH,OAAO,CAAC,cAAc;IAKtB;;OAEG;IACH,OAAO,CAAC,eAAe;IAKvB;;OAEG;IACH,cAAc,CAAC,QAAQ,EAAE,aAAa,GAAG,MAAM;IAa/C;;OAEG;IACH,sBAAsB,CAAC,MAAM,EAAE,WAAW,GAAG,MAAM;CAUpD"}

package/dist/src/services/QueryRouter.js

@@ -1,210 +0,0 @@
-/**
- * QueryRouter.ts
- *
- * Intelligent query router that detects user intent and routes to appropriate search backend
- * - Exact symbol search for identifier names
- * - Natural language search for descriptive queries
- * - Hybrid search combining both strategies
- */
-/**
- * Query intent classification
- */
-export var QueryIntent;
-(function (QueryIntent) {
-    QueryIntent["SYMBOL"] = "symbol";
-    QueryIntent["NATURAL"] = "natural";
-    QueryIntent["HYBRID"] = "hybrid";
-})(QueryIntent || (QueryIntent = {}));
-/**
- * QueryRouter - Intelligent query intent detection and routing
- */
-export class QueryRouter {
-    // Common English words that indicate natural language queries
-    static COMMON_WORDS = new Set([
-        'the', 'a', 'an', 'is', 'are', 'was', 'were', 'be', 'been', 'being',
-        'have', 'has', 'had', 'do', 'does', 'did', 'will', 'would', 'should',
-        'could', 'can', 'may', 'might', 'must', 'shall',
-        'this', 'that', 'these', 'those', 'what', 'which', 'who', 'when', 'where',
-        'how', 'why', 'with', 'for', 'from', 'to', 'in', 'on', 'at', 'by',
-        'all', 'any', 'some', 'few', 'many', 'much', 'more', 'most',
-        'get', 'set', 'find', 'search', 'show', 'display', 'list',
-        'code', 'function', 'method', 'class', 'logic', 'implementation',
-    ]);
-    // FTS5 boolean operators
-    static FTS5_OPERATORS = ['AND', 'OR', 'NOT'];
-    /**
-     * Analyze query and determine intent
-     *
-     * @param query - User search query
-     * @returns Query analysis with intent and features
-     */
-    analyze(query) {
-        const trimmed = query.trim();
-        const normalized = trimmed.toLowerCase();
-        const words = trimmed.split(/\s+/);
-        const wordCount = words.length;
-        // Extract features
-        const features = {
-            isSingleWord: wordCount === 1,
-            hasOperators: this.hasOperators(trimmed),
-            isIdentifier: this.isIdentifier(trimmed),
-            wordCount,
-            hasCommonWords: this.hasCommonWords(normalized),
-            hasSpecialChars: this.hasSpecialChars(trimmed),
-        };
-        // Determine intent based on features
-        const intent = this.determineIntent(features);
-        const confidence = this.calculateConfidence(features, intent);
-        return {
-            intent,
-            confidence,
-            query: trimmed,
-            normalizedQuery: normalized,
-            features,
-        };
-    }
-    /**
-     * Determine query intent from features
-     */
-    determineIntent(features) {
-        // Rule 1: Has FTS5 operators → Natural language search
-        if (features.hasOperators) {
-            return QueryIntent.NATURAL;
-        }
-        // Rule 2: Single word identifier (PascalCase, camelCase) → Symbol search
-        if (features.isSingleWord && features.isIdentifier && !features.hasCommonWords) {
-            return QueryIntent.SYMBOL;
-        }
-        // Rule 3: Multiple words with common words → Natural language search
-        if (features.wordCount > 1 && features.hasCommonWords) {
-            return QueryIntent.NATURAL;
-        }
-        // Rule 4: Multiple words with identifiers (no common words) → Hybrid search
-        if (features.wordCount > 1 && features.isIdentifier && !features.hasCommonWords) {
-            return QueryIntent.HYBRID;
-        }
-        // Rule 5: Single common word → Hybrid search
-        if (features.isSingleWord && features.hasCommonWords) {
-            return QueryIntent.HYBRID;
-        }
-        // Rule 6: Multiple words without operators → Natural language search
-        if (features.wordCount > 1) {
-            return QueryIntent.NATURAL;
-        }
-        // Default: Single word → Try symbol first, fallback to natural
-        return QueryIntent.SYMBOL;
-    }
-    /**
-     * Calculate confidence score for intent classification
-     */
-    calculateConfidence(features, intent) {
-        let confidence = 0.5; // Base confidence
-        if (intent === QueryIntent.SYMBOL) {
-            if (features.isSingleWord)
-                confidence += 0.1;
-            if (features.isIdentifier)
-                confidence += 0.1;
-            if (!features.hasCommonWords)
-                confidence += 0.2;
-            // Lower confidence for ambiguous single words
-            if (features.isSingleWord && features.wordCount === 1) {
-                const word = features.isIdentifier;
-                // Common identifier names that are also English words
-                confidence = Math.min(confidence, 0.7);
-            }
-        }
-        else if (intent === QueryIntent.NATURAL) {
-            if (features.hasOperators)
-                confidence += 0.3;
-            if (features.hasCommonWords)
-                confidence += 0.2;
-            if (features.wordCount > 2)
-                confidence += 0.1;
-        }
-        else if (intent === QueryIntent.HYBRID) {
-            // Hybrid has lower confidence by nature
-            confidence = 0.6;
-        }
-        return Math.min(1.0, confidence);
-    }
-    /**
-     * Check if query has FTS5 boolean operators
-     */
-    hasOperators(query) {
-        const upperQuery = query.toUpperCase();
-        return QueryRouter.FTS5_OPERATORS.some((op) => upperQuery.includes(` ${op} `));
-    }
-    /**
-     * Check if query looks like an identifier (PascalCase, camelCase, snake_case)
-     * For multi-word queries, checks if ANY word is an identifier
-     */
-    isIdentifier(query) {
-        // If multi-word, check if any word is an identifier
-        if (/\s/.test(query)) {
-            const words = query.split(/\s+/);
-            return words.some(word => this.isIdentifierWord(word));
-        }
-        return this.isIdentifierWord(query);
-    }
-    /**
-     * Check if a single word is an identifier
-     */
-    isIdentifierWord(word) {
-        // PascalCase: Calculator, UserManager
-        if (/^[A-Z][a-zA-Z0-9]*$/.test(word))
-            return true;
-        // camelCase: getUserById, validateEmail
-        if (/^[a-z][a-zA-Z0-9]*$/.test(word))
-            return true;
-        // snake_case: get_user_by_id, validate_email
-        if (/^[a-z][a-z0-9_]*$/.test(word))
-            return true;
-        // CONSTANT_CASE: MAX_SIZE, API_KEY
-        if (/^[A-Z][A-Z0-9_]*$/.test(word))
-            return true;
-        return false;
-    }
-    /**
-     * Check if query contains common English words
-     */
-    hasCommonWords(normalizedQuery) {
-        const words = normalizedQuery.split(/\s+/);
-        return words.some((word) => QueryRouter.COMMON_WORDS.has(word));
-    }
-    /**
-     * Check if query has special characters (indicating code search)
-     */
-    hasSpecialChars(query) {
-        // Common code characters: . : :: -> => < >
-        return /[.:<>]/.test(query);
-    }
-    /**
-     * Format analysis for display
-     */
-    formatAnalysis(analysis) {
-        const lines = [];
-        lines.push(`Query: "${analysis.query}"`);
-        lines.push(`Intent: ${analysis.intent.toUpperCase()} (confidence: ${(analysis.confidence * 100).toFixed(0)}%)`);
-        lines.push('Features:');
-        lines.push(`  - Single word: ${analysis.features.isSingleWord}`);
-        lines.push(`  - Identifier: ${analysis.features.isIdentifier}`);
-        lines.push(`  - Has operators: ${analysis.features.hasOperators}`);
-        lines.push(`  - Word count: ${analysis.features.wordCount}`);
-        lines.push(`  - Common words: ${analysis.features.hasCommonWords}`);
-        return lines.join('\n');
-    }
-    /**
-     * Get search strategy explanation for user
-     */
-    getStrategyExplanation(intent) {
-        switch (intent) {
-            case QueryIntent.SYMBOL:
-                return 'Exact symbol name search';
-            case QueryIntent.NATURAL:
-                return 'Natural language search (FTS5 + BM25)';
-            case QueryIntent.HYBRID:
-                return 'Hybrid search (symbols + natural language)';
-        }
-    }
-}
-//# sourceMappingURL=QueryRouter.js.map

package/dist/src/services/QueryRouter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"QueryRouter.js","sourceRoot":"","sources":["../../../src/services/QueryRouter.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;GAEG;AACH,MAAM,CAAN,IAAY,WAIX;AAJD,WAAY,WAAW;IACrB,gCAAiB,CAAA;IACjB,kCAAmB,CAAA;IACnB,gCAAiB,CAAA;AACnB,CAAC,EAJW,WAAW,KAAX,WAAW,QAItB;AAoBD;;GAEG;AACH,MAAM,OAAO,WAAW;IACtB,8DAA8D;IACtD,MAAM,CAAU,YAAY,GAAG,IAAI,GAAG,CAAC;QAC7C,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;QACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ;QACpE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO;QAC/C,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO;QACzE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;QACjE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;QAC3D,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM;QACzD,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,gBAAgB;KACjE,CAAC,CAAC;IAEH,yBAAyB;IACjB,MAAM,CAAU,cAAc,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAE9D;;;;;OAKG;IACH,OAAO,CAAC,KAAa;QACnB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;QAE/B,mBAAmB;QACnB,MAAM,QAAQ,GAAG;YACf,YAAY,EAAE,SAAS,KAAK,CAAC;YAC7B,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;YACxC,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;YACxC,SAAS;YACT,cAAc,EAAE,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC;YAC/C,eAAe,EAAE,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC;SAC/C,CAAC;QAEF,qCAAqC;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAE9D,OAAO;YACL,MAAM;YACN,UAAU;YACV,KAAK,EAAE,OAAO;YACd,eAAe,EAAE,UAAU;YAC3B,QAAQ;SACT,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,QAAmC;QACzD,uDAAuD;QACvD,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;YAC1B,OAAO,WAAW,CAAC,OAAO,CAAC;QAC7B,CAAC;QAED,yEAAyE;QACzE,IAAI,QAAQ,CAAC,YAAY,IAAI,QAAQ,CAAC,YAAY,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC;YAC/E,OAAO,WAAW,CAAC,MAAM,CAAC;QAC5B,CAAC;QAED,qEAAqE;QACrE,IAAI,QAAQ,CAAC,SAAS,GAAG,CAAC,IAAI,QAAQ,CAAC,cAAc,EAAE,CAAC;YACtD,OAAO,WAAW,CAAC,OAAO,CAAC;QAC7B,CAAC;QAED,4EAA4E;QAC5E,IAAI,QAAQ,CAAC,SAAS,GAAG,CAAC,IAAI,QAAQ,CAAC,YAAY,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC;YAChF,OAAO,WAAW,CAAC,MAAM,CAAC;QAC5B,CAAC;QAED,6CAA6C;QAC7C,IAAI,QAAQ,CAAC,YAAY,IAAI,QAAQ,CAAC,cAAc,EAAE,CAAC;YACrD,OAAO,WAAW,CAAC,MAAM,CAAC;QAC5B,CAAC;QAED,qEAAqE;QACrE,IAAI,QAAQ,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO,WAAW,CAAC,OAAO,CAAC;QAC7B,CAAC;QAED,+DAA+D;QAC/D,OAAO,WAAW,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,mBAAmB,CACzB,QAAmC,EACnC,MAAmB;QAEnB,IAAI,UAAU,GAAG,GAAG,CAAC,CAAC,kBAAkB;QAExC,IAAI,MAAM,KAAK,WAAW,CAAC,MAAM,EAAE,CAAC;YAClC,IAAI,QAAQ,CAAC,YAAY;gBAAE,UAAU,IAAI,GAAG,CAAC;YAC7C,IAAI,QAAQ,CAAC,YAAY;gBAAE,UAAU,IAAI,GAAG,CAAC;YAC7C,IAAI,CAAC,QAAQ,CAAC,cAAc;gBAAE,UAAU,IAAI,GAAG,CAAC;YAChD,8CAA8C;YAC9C,IAAI,QAAQ,CAAC,YAAY,IAAI,QAAQ,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;gBACtD,MAAM,IAAI,GAAG,QAAQ,CAAC,YAAY,CAAC;gBACnC,sDAAsD;gBACtD,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,KAAK,WAAW,CAAC,OAAO,EAAE,CAAC;YAC1C,IAAI,QAAQ,CAAC,YAAY;gBAAE,UAAU,IAAI,GAAG,CAAC;YAC7C,IAAI,QAAQ,CAAC,cAAc;gBAAE,UAAU,IAAI,GAAG,CAAC;YAC/C,IAAI,QAAQ,CAAC,SAAS,GAAG,CAAC;gBAAE,UAAU,IAAI,GAAG,CAAC;QAChD,CAAC;aAAM,IAAI,MAAM,KAAK,WAAW,CAAC,MAAM,EAAE,CAAC;YACzC,wCAAwC;YACxC,UAAU,GAAG,GAAG,CAAC;QACnB,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,KAAa;QAChC,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QACvC,OAAO,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAC5C,UAAU,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAC/B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,YAAY,CAAC,KAAa;QAChC,oDAAoD;QACpD,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,IAAY;QACnC,sCAAsC;QACtC,IAAI,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAElD,wCAAwC;QACxC,IAAI,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAElD,6CAA6C;QAC7C,IAAI,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAEhD,mCAAmC;QACnC,IAAI,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAEhD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,eAAuB;QAC5C,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC3C,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAClE,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,KAAa;QACnC,2CAA2C;QAC3C,OAAO,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,QAAuB;QACpC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,WAAW,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;QACzC,KAAK,CAAC,IAAI,CAAC,WAAW,QAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,iBAAiB,CAAC,QAAQ,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChH,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,oBAAoB,QAAQ,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAC;QACjE,KAAK,CAAC,IAAI,CAAC,mBAAmB,QAAQ,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAC;QAChE,KAAK,CAAC,IAAI,CAAC,sBAAsB,QAAQ,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAC;QACnE,KAAK,CAAC,IAAI,CAAC,mBAAmB,QAAQ,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC;QAC7D,KAAK,CAAC,IAAI,CAAC,qBAAqB,QAAQ,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;QACpE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,sBAAsB,CAAC,MAAmB;QACxC,QAAQ,MAAM,EAAE,CAAC;YACf,KAAK,WAAW,CAAC,MAAM;gBACrB,OAAO,0BAA0B,CAAC;YACpC,KAAK,WAAW,CAAC,OAAO;gBACtB,OAAO,uCAAuC,CAAC;YACjD,KAAK,WAAW,CAAC,MAAM;gBACrB,OAAO,4CAA4C,CAAC;QACxD,CAAC;IACH,CAAC"}

package/dist/src/services/RateLimiter.d.ts

@@ -1,104 +0,0 @@
-/**
- * RateLimiter.ts
- *
- * Token bucket rate limiter for telemetry submission
- * Prevents API abuse and enforces rate limits
- */
-/**
- * Rate limiter configuration
- */
-export interface RateLimiterConfig {
-    rate: number;
-    burst: number;
-}
-/**
- * Token bucket rate limiter
- *
- * Implements the token bucket algorithm for rate limiting:
- * - Tokens are added to the bucket at a constant rate
- * - Each event consumes one token
- * - Bucket has a maximum capacity (burst size)
- * - If bucket is empty, requests are rejected
- *
- * Features:
- * - Smooth rate limiting over time
- * - Allows controlled bursts
- * - Automatic token refill
- * - Thread-safe (single-threaded JavaScript)
- *
- * Example:
- * - Rate: 60 events/minute = 1 event/second
- * - Burst: 10 events
- * - Can submit 10 events immediately, then 1 event/second
- */
-export declare class RateLimiter {
-    private tokens;
-    private lastRefill;
-    private readonly rate;
-    private readonly burst;
-    /**
-     * Create a new rate limiter
-     *
-     * @param config - Rate limiter configuration
-     */
-    constructor(config: RateLimiterConfig);
-    /**
-     * Refill tokens based on elapsed time
-     *
-     * Tokens are added at the configured rate.
-     * Bucket cannot exceed burst capacity.
-     *
-     * @private
-     */
-    private refill;
-    /**
-     * Check if N events can be submitted without consuming tokens
-     *
-     * @param count - Number of events to check
-     * @returns True if sufficient tokens available
-     */
-    canSubmit(count: number): boolean;
-    /**
-     * Consume tokens for N events
-     *
-     * Attempts to consume the specified number of tokens.
-     * If insufficient tokens available, no tokens are consumed.
-     *
-     * @param count - Number of tokens to consume
-     * @returns True if tokens were consumed, false if insufficient
-     */
-    consume(count: number): boolean;
-    /**
-     * Get time (in milliseconds) until next token is available
-     *
-     * Useful for implementing backoff when rate limited.
-     *
-     * @returns Milliseconds until next token, or 0 if tokens available
-     */
-    getWaitTime(): number;
-    /**
-     * Get current token count
-     *
-     * @returns Current number of tokens available
-     */
-    getAvailableTokens(): number;
-    /**
-     * Get rate limit configuration
-     *
-     * @returns Events per minute
-     */
-    getRate(): number;
-    /**
-     * Get burst capacity
-     *
-     * @returns Maximum burst size
-     */
-    getBurst(): number;
-    /**
-     * Reset rate limiter to initial state
-     *
-     * Useful for testing or when rate limits change
-     */
-    reset(): void;
-}
-//# sourceMappingURL=RateLimiter.d.ts.map

package/dist/src/services/RateLimiter.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"RateLimiter.d.ts","sourceRoot":"","sources":["../../../src/services/RateLimiter.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,qBAAa,WAAW;IACtB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAS;IAC9B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAE/B;;;;OAIG;gBACS,MAAM,EAAE,iBAAiB;IAOrC;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM;IAcd;;;;;OAKG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAKjC;;;;;;;;OAQG;IACH,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAW/B;;;;;;OAMG;IACH,WAAW,IAAI,MAAM;IAcrB;;;;OAIG;IACH,kBAAkB,IAAI,MAAM;IAK5B;;;;OAIG;IACH,OAAO,IAAI,MAAM;IAIjB;;;;OAIG;IACH,QAAQ,IAAI,MAAM;IAIlB;;;;OAIG;IACH,KAAK,IAAI,IAAI;CAId"}

package/dist/src/services/RateLimiter.js

@@ -1,140 +0,0 @@
-/**
- * RateLimiter.ts
- *
- * Token bucket rate limiter for telemetry submission
- * Prevents API abuse and enforces rate limits
- */
-/**
- * Token bucket rate limiter
- *
- * Implements the token bucket algorithm for rate limiting:
- * - Tokens are added to the bucket at a constant rate
- * - Each event consumes one token
- * - Bucket has a maximum capacity (burst size)
- * - If bucket is empty, requests are rejected
- *
- * Features:
- * - Smooth rate limiting over time
- * - Allows controlled bursts
- * - Automatic token refill
- * - Thread-safe (single-threaded JavaScript)
- *
- * Example:
- * - Rate: 60 events/minute = 1 event/second
- * - Burst: 10 events
- * - Can submit 10 events immediately, then 1 event/second
- */
-export class RateLimiter {
-    tokens;
-    lastRefill;
-    rate; // Tokens per millisecond
-    burst; // Maximum tokens
-    /**
-     * Create a new rate limiter
-     *
-     * @param config - Rate limiter configuration
-     */
-    constructor(config) {
-        this.burst = config.burst;
-        this.tokens = config.burst; // Start with full bucket
-        this.rate = config.rate / 60000; // Convert events/minute to events/ms
-        this.lastRefill = Date.now();
-    }
-    /**
-     * Refill tokens based on elapsed time
-     *
-     * Tokens are added at the configured rate.
-     * Bucket cannot exceed burst capacity.
-     *
-     * @private
-     */
-    refill() {
-        const now = Date.now();
-        const elapsed = now - this.lastRefill;
-        // Calculate tokens to add based on elapsed time
-        const tokensToAdd = elapsed * this.rate;
-        // Add tokens, but don't exceed burst capacity
-        this.tokens = Math.min(this.burst, this.tokens + tokensToAdd);
-        // Update last refill time
-        this.lastRefill = now;
-    }
-    /**
-     * Check if N events can be submitted without consuming tokens
-     *
-     * @param count - Number of events to check
-     * @returns True if sufficient tokens available
-     */
-    canSubmit(count) {
-        this.refill();
-        return this.tokens >= count;
-    }
-    /**
-     * Consume tokens for N events
-     *
-     * Attempts to consume the specified number of tokens.
-     * If insufficient tokens available, no tokens are consumed.
-     *
-     * @param count - Number of tokens to consume
-     * @returns True if tokens were consumed, false if insufficient
-     */
-    consume(count) {
-        this.refill();
-        if (this.tokens >= count) {
-            this.tokens -= count;
-            return true;
-        }
-        return false;
-    }
-    /**
-     * Get time (in milliseconds) until next token is available
-     *
-     * Useful for implementing backoff when rate limited.
-     *
-     * @returns Milliseconds until next token, or 0 if tokens available
-     */
-    getWaitTime() {
-        this.refill();
-        if (this.tokens >= 1) {
-            return 0; // Tokens available now
-        }
-        // Calculate time needed for 1 token
-        const tokensNeeded = 1 - this.tokens;
-        const timeNeeded = tokensNeeded / this.rate;
-        return Math.ceil(timeNeeded);
-    }
-    /**
-     * Get current token count
-     *
-     * @returns Current number of tokens available
-     */
-    getAvailableTokens() {
-        this.refill();
-        return Math.floor(this.tokens);
-    }
-    /**
-     * Get rate limit configuration
-     *
-     * @returns Events per minute
-     */
-    getRate() {
-        return this.rate * 60000; // Convert back to events/minute
-    }
-    /**
-     * Get burst capacity
-     *
-     * @returns Maximum burst size
-     */
-    getBurst() {
-        return this.burst;
-    }
-    /**
-     * Reset rate limiter to initial state
-     *
-     * Useful for testing or when rate limits change
-     */
-    reset() {
-        this.tokens = this.burst;
-        this.lastRefill = Date.now();
-    }
-}
-//# sourceMappingURL=RateLimiter.js.map

package/dist/src/services/RateLimiter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"RateLimiter.js","sourceRoot":"","sources":["../../../src/services/RateLimiter.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAUH;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,WAAW;IACd,MAAM,CAAS;IACf,UAAU,CAAS;IACV,IAAI,CAAS,CAAC,yBAAyB;IACvC,KAAK,CAAS,CAAC,iBAAiB;IAEjD;;;;OAIG;IACH,YAAY,MAAyB;QACnC,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC1B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,yBAAyB;QACrD,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,qCAAqC;QACtE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC/B,CAAC;IAED;;;;;;;OAOG;IACK,MAAM;QACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QAEtC,gDAAgD;QAChD,MAAM,WAAW,GAAG,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QAExC,8CAA8C;QAC9C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC;QAE9D,0BAA0B;QAC1B,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;IACxB,CAAC;IAED;;;;;OAKG;IACH,SAAS,CAAC,KAAa;QACrB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC;IAC9B,CAAC;IAED;;;;;;;;OAQG;IACH,OAAO,CAAC,KAAa;QACnB,IAAI,CAAC,MAAM,EAAE,CAAC;QAEd,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;OAMG;IACH,WAAW;QACT,IAAI,CAAC,MAAM,EAAE,CAAC;QAEd,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACrB,OAAO,CAAC,CAAC,CAAC,uBAAuB;QACnC,CAAC;QAED,oCAAoC;QACpC,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACrC,MAAM,UAAU,GAAG,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC;QAE5C,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACH,kBAAkB;QAChB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,gCAAgC;IAC5D,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;OAIG;IACH,KAAK;QACH,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC/B,CAAC;CACF"}

package/dist/src/services/RetryManager.d.ts

@@ -1,88 +0,0 @@
-/**
- * RetryManager.ts
- *
- * Exponential backoff retry logic for telemetry submission
- * Implements smart retry delays with jitter to prevent thundering herd
- */
-/**
- * Retry configuration
- */
-export interface RetryConfig {
-    baseDelay?: number;
-    maxRetries?: number;
-    maxDelay?: number;
-    jitterFactor?: number;
-}
-/**
- * Manages retry timing with exponential backoff
- *
- * Features:
- * - Exponential backoff: delay = 2^retryCount * baseDelay
- * - Jitter to prevent thundering herd problem
- * - Configurable max retries and delay cap
- * - Simple, deterministic algorithm
- *
- * Example backoff schedule (default config):
- * - Retry 0: 1s (±250ms)
- * - Retry 1: 2s (±500ms)
- * - Retry 2: 4s (±1s)
- * - Retry 3: 8s (±2s)
- * - Retry 4: 16s (±4s)
- * - Retry 5+: Stops retrying
- */
-export declare class RetryManager {
-    private baseDelay;
-    private maxRetries;
-    private maxDelay;
-    private jitterFactor;
-    /**
-     * Create a new retry manager
-     *
-     * @param config - Retry configuration
-     */
-    constructor(config?: RetryConfig);
-    /**
-     * Calculate the next retry delay in milliseconds
-     *
-     * Uses exponential backoff with jitter:
-     * delay = min(2^retryCount * baseDelay, maxDelay)
-     * jitter = delay * jitterFactor * (random between -0.5 and 0.5)
-     *
-     * @param retryCount - Current retry count (0-based)
-     * @returns Delay in milliseconds until next retry
-     */
-    getNextRetryDelay(retryCount: number): number;
-    /**
-     * Check if should retry based on retry count
-     *
-     * @param retryCount - Current retry count (0-based)
-     * @returns True if should retry, false if max retries exceeded
-     */
-    shouldRetry(retryCount: number): boolean;
-    /**
-     * Get the timestamp for the next retry attempt
-     *
-     * @param retryCount - Current retry count (0-based)
-     * @returns Timestamp (milliseconds since epoch) for next retry
-     */
-    getNextRetryTimestamp(retryCount: number): number;
-    /**
-     * Get the base delay configuration
-     *
-     * @returns Base delay in milliseconds
-     */
-    getBaseDelay(): number;
-    /**
-     * Get the maximum retry count
-     *
-     * @returns Maximum number of retries
-     */
-    getMaxRetries(): number;
-    /**
-     * Get the maximum delay cap
-     *
-     * @returns Maximum delay in milliseconds
-     */
-    getMaxDelay(): number;
-}
-//# sourceMappingURL=RetryManager.d.ts.map

package/dist/src/services/RetryManager.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"RetryManager.d.ts","sourceRoot":"","sources":["../../../src/services/RetryManager.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,YAAY;IACvB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,YAAY,CAAS;IAE7B;;;;OAIG;gBACS,MAAM,CAAC,EAAE,WAAW;IAOhC;;;;;;;;;OASG;IACH,iBAAiB,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAiB7C;;;;;OAKG;IACH,WAAW,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAIxC;;;;;OAKG;IACH,qBAAqB,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAKjD;;;;OAIG;IACH,YAAY,IAAI,MAAM;IAItB;;;;OAIG;IACH,aAAa,IAAI,MAAM;IAIvB;;;;OAIG;IACH,WAAW,IAAI,MAAM;CAGtB"}