@hivehub/rulebook 5.5.2 → 5.8.0

package/dist/core/complexity-detector.js

@@ -1,334 +0,0 @@
-/**
- * Project Complexity Detector — v5.0
- *
- * Assesses project complexity to calibrate rule generation.
- * Complexity tiers determine which features are activated:
- *
- * - Small:   < 10K LOC, 1 language  → Tier 1 rules only
- * - Medium:  10-50K LOC, 1-2 langs  → + Tier 2 (decomposition, incremental tests)
- * - Large:   50K+ LOC, 2+ langs     → + Specialized agents, team coordination
- * - Complex: 100K+ LOC, 3+ langs    → + Reference workflow, blocker tracking, data-flow
- */
-import { existsSync, readdirSync, statSync, readFileSync } from 'fs';
-import { join, extname } from 'path';
-// ── LOC Estimation ──────────────────────────────────────────────────────
-const CODE_EXTENSIONS = new Set([
-    '.ts',
-    '.tsx',
-    '.js',
-    '.jsx',
-    '.mjs',
-    '.cjs',
-    '.py',
-    '.pyx',
-    '.rs',
-    '.go',
-    '.java',
-    '.kt',
-    '.scala',
-    '.cs',
-    '.cpp',
-    '.cc',
-    '.cxx',
-    '.c',
-    '.h',
-    '.hpp',
-    '.swift',
-    '.m',
-    '.mm',
-    '.rb',
-    '.php',
-    '.ex',
-    '.exs',
-    '.erl',
-    '.hrl',
-    '.zig',
-    '.sol',
-    '.dart',
-    '.r',
-    '.R',
-    '.hs',
-    '.lua',
-    '.hlsl',
-    '.glsl',
-    '.msl',
-    '.wgsl',
-    '.sql',
-    '.sh',
-    '.bash',
-    '.zsh',
-]);
-const IGNORE_DIRS = new Set([
-    'node_modules',
-    '.git',
-    'dist',
-    'build',
-    'out',
-    '.next',
-    '.nuxt',
-    'target',
-    'vendor',
-    '__pycache__',
-    '.venv',
-    'venv',
-    'env',
-    '.rulebook',
-    '.claude',
-    '.cursor',
-    'coverage',
-    '.cache',
-    'zig-cache',
-    'zig-out',
-    '.zig-cache',
-]);
-/**
- * Estimate lines of code by sampling files. Scans up to maxFiles to avoid
- * blocking on huge repos.
- */
-function estimateLoc(projectRoot, maxFiles = 500) {
-    let totalLoc = 0;
-    let filesScanned = 0;
-    const languages = new Set();
-    function walk(dir, depth) {
-        if (depth > 8 || filesScanned >= maxFiles)
-            return;
-        let entries;
-        try {
-            entries = readdirSync(dir);
-        }
-        catch {
-            return;
-        }
-        for (const entry of entries) {
-            if (filesScanned >= maxFiles)
-                return;
-            if (IGNORE_DIRS.has(entry) || entry.startsWith('.'))
-                continue;
-            const fullPath = join(dir, entry);
-            let stat;
-            try {
-                stat = statSync(fullPath);
-            }
-            catch {
-                continue;
-            }
-            if (stat.isDirectory()) {
-                walk(fullPath, depth + 1);
-            }
-            else if (stat.isFile()) {
-                const ext = extname(entry).toLowerCase();
-                if (CODE_EXTENSIONS.has(ext) && stat.size < 500000) {
-                    try {
-                        const content = readFileSync(fullPath, 'utf-8');
-                        const lines = content.split('\n').length;
-                        totalLoc += lines;
-                        languages.add(ext);
-                        filesScanned++;
-                    }
-                    catch {
-                        // Skip unreadable files
-                    }
-                }
-            }
-        }
-    }
-    walk(projectRoot, 0);
-    // If we hit the sample limit, extrapolate
-    if (filesScanned >= maxFiles) {
-        // Rough extrapolation: count remaining code files
-        const totalCodeFiles = countCodeFiles(projectRoot, maxFiles * 3);
-        if (totalCodeFiles > filesScanned) {
-            const avgLocPerFile = totalLoc / filesScanned;
-            totalLoc = Math.round(avgLocPerFile * totalCodeFiles);
-        }
-    }
-    return { loc: totalLoc, languages };
-}
-function countCodeFiles(projectRoot, max) {
-    let count = 0;
-    function walk(dir, depth) {
-        if (depth > 8 || count >= max)
-            return;
-        let entries;
-        try {
-            entries = readdirSync(dir);
-        }
-        catch {
-            return;
-        }
-        for (const entry of entries) {
-            if (count >= max)
-                return;
-            if (IGNORE_DIRS.has(entry) || entry.startsWith('.'))
-                continue;
-            const fullPath = join(dir, entry);
-            let stat;
-            try {
-                stat = statSync(fullPath);
-            }
-            catch {
-                continue;
-            }
-            if (stat.isDirectory()) {
-                walk(fullPath, depth + 1);
-            }
-            else if (stat.isFile()) {
-                const ext = extname(entry).toLowerCase();
-                if (CODE_EXTENSIONS.has(ext))
-                    count++;
-            }
-        }
-    }
-    walk(projectRoot, 0);
-    return count;
-}
-// ── Source Directory Count ───────────────────────────────────────────────
-function countSourceDirs(projectRoot) {
-    const srcDirs = [
-        'src',
-        'lib',
-        'app',
-        'pages',
-        'components',
-        'modules',
-        'packages',
-        'crates',
-        'cmd',
-        'pkg',
-        'internal',
-        'runtime',
-        'compiler',
-        'engine',
-        'core',
-        'server',
-        'client',
-        'api',
-    ];
-    let count = 0;
-    for (const dir of srcDirs) {
-        if (existsSync(join(projectRoot, dir)))
-            count++;
-    }
-    return count;
-}
-// ── Tool Detection ──────────────────────────────────────────────────────
-function detectTools(projectRoot) {
-    const tools = [];
-    if (existsSync(join(projectRoot, '.claude')) || existsSync(join(projectRoot, 'CLAUDE.md')))
-        tools.push('claude-code');
-    if (existsSync(join(projectRoot, '.cursor')))
-        tools.push('cursor');
-    if (existsSync(join(projectRoot, 'GEMINI.md')))
-        tools.push('gemini');
-    if (existsSync(join(projectRoot, '.windsurf')) || existsSync(join(projectRoot, '.windsurfrules')))
-        tools.push('windsurf');
-    if (existsSync(join(projectRoot, '.github', 'copilot-instructions.md')))
-        tools.push('copilot');
-    if (existsSync(join(projectRoot, '.continue')))
-        tools.push('continue');
-    return tools;
-}
-// ── Main Assessment ─────────────────────────────────────────────────────
-const EXT_TO_LANGUAGE = {
-    '.ts': 'TypeScript',
-    '.tsx': 'TypeScript',
-    '.js': 'JavaScript',
-    '.jsx': 'JavaScript',
-    '.py': 'Python',
-    '.rs': 'Rust',
-    '.go': 'Go',
-    '.java': 'Java',
-    '.kt': 'Kotlin',
-    '.cs': 'C#',
-    '.cpp': 'C++',
-    '.c': 'C',
-    '.h': 'C/C++',
-    '.hpp': 'C++',
-    '.swift': 'Swift',
-    '.rb': 'Ruby',
-    '.php': 'PHP',
-    '.dart': 'Dart',
-    '.hlsl': 'HLSL',
-    '.glsl': 'GLSL',
-    '.lua': 'Lua',
-    '.zig': 'Zig',
-    '.ex': 'Elixir',
-    '.erl': 'Erlang',
-    '.sol': 'Solidity',
-    '.hs': 'Haskell',
-    '.scala': 'Scala',
-    '.r': 'R',
-    '.R': 'R',
-};
-export function assessComplexity(projectRoot) {
-    const { loc, languages: langExts } = estimateLoc(projectRoot);
-    const uniqueLanguages = new Set();
-    for (const ext of langExts) {
-        const lang = EXT_TO_LANGUAGE[ext];
-        if (lang)
-            uniqueLanguages.add(lang);
-    }
-    const languageCount = uniqueLanguages.size;
-    const sourceDirectories = countSourceDirs(projectRoot);
-    const hasMultipleBuildTargets = (existsSync(join(projectRoot, 'Cargo.toml')) &&
-        existsSync(join(projectRoot, 'package.json'))) ||
-        (existsSync(join(projectRoot, 'CMakeLists.txt')) &&
-            existsSync(join(projectRoot, 'package.json'))) ||
-        (existsSync(join(projectRoot, 'build.zig')) && existsSync(join(projectRoot, 'package.json')));
-    const hasCustomMcpServer = existsSync(join(projectRoot, '.mcp.json')) || existsSync(join(projectRoot, 'mcp.json'));
-    const hasReferenceSource = false; // Detected from config, not file system
-    const detectedTools = detectTools(projectRoot);
-    // Score calculation
-    let score = 0;
-    if (loc >= 100000)
-        score += 40;
-    else if (loc >= 50000)
-        score += 30;
-    else if (loc >= 10000)
-        score += 20;
-    else
-        score += 10;
-    score += Math.min(languageCount * 10, 30);
-    score += Math.min(sourceDirectories * 3, 15);
-    if (hasMultipleBuildTargets)
-        score += 10;
-    if (hasCustomMcpServer)
-        score += 5;
-    // Tier determination
-    let tier;
-    if (score >= 60 || (loc >= 100000 && languageCount >= 3)) {
-        tier = 'complex';
-    }
-    else if (score >= 40 || (loc >= 50000 && languageCount >= 2)) {
-        tier = 'large';
-    }
-    else if (score >= 25 || (loc >= 10000 && languageCount >= 2)) {
-        tier = 'medium';
-    }
-    else {
-        tier = 'small';
-    }
-    return {
-        tier,
-        score,
-        metrics: {
-            estimatedLoc: loc,
-            languageCount,
-            sourceDirectories,
-            hasMultipleBuildTargets,
-            hasCustomMcpServer,
-            hasReferenceSource,
-        },
-        recommendations: {
-            tier1Rules: true, // Always
-            tier2Rules: tier !== 'small',
-            specializedAgents: tier === 'large' || tier === 'complex',
-            teamCoordination: tier === 'large' || tier === 'complex',
-            referenceWorkflow: tier === 'complex',
-            blockerTracking: tier === 'large' || tier === 'complex',
-            dataFlowPlanning: tier === 'complex',
-        },
-        detectedTools,
-    };
-}
-//# sourceMappingURL=complexity-detector.js.map

package/dist/core/complexity-detector.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"complexity-detector.js","sourceRoot":"","sources":["../../src/core/complexity-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AACrE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AA6BrC,2EAA2E;AAE3E,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC;IAC9B,KAAK;IACL,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,KAAK;IACL,MAAM;IACN,KAAK;IACL,KAAK;IACL,OAAO;IACP,KAAK;IACL,QAAQ;IACR,KAAK;IACL,MAAM;IACN,KAAK;IACL,MAAM;IACN,IAAI;IACJ,IAAI;IACJ,MAAM;IACN,QAAQ;IACR,IAAI;IACJ,KAAK;IACL,KAAK;IACL,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,OAAO;IACP,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,MAAM;IACN,OAAO;IACP,OAAO;IACP,MAAM;IACN,OAAO;IACP,MAAM;IACN,KAAK;IACL,OAAO;IACP,MAAM;CACP,CAAC,CAAC;AAEH,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC;IAC1B,cAAc;IACd,MAAM;IACN,MAAM;IACN,OAAO;IACP,KAAK;IACL,OAAO;IACP,OAAO;IACP,QAAQ;IACR,QAAQ;IACR,aAAa;IACb,OAAO;IACP,MAAM;IACN,KAAK;IACL,WAAW;IACX,SAAS;IACT,SAAS;IACT,UAAU;IACV,QAAQ;IACR,WAAW;IACX,SAAS;IACT,YAAY;CACb,CAAC,CAAC;AAEH;;;GAGG;AACH,SAAS,WAAW,CAClB,WAAmB,EACnB,WAAmB,GAAG;IAEtB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,SAAS,IAAI,CAAC,GAAW,EAAE,KAAa;QACtC,IAAI,KAAK,GAAG,CAAC,IAAI,YAAY,IAAI,QAAQ;YAAE,OAAO;QAElD,IAAI,OAAiB,CAAC;QACtB,IAAI,CAAC;YACH,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAC7B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO;QACT,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,YAAY,IAAI,QAAQ;gBAAE,OAAO;YACrC,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS;YAE9D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC;YACT,IAAI,CAAC;gBACH,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC5B,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YAED,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBACvB,IAAI,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC5B,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBACzB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;gBACzC,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,MAAM,EAAE,CAAC;oBACnD,IAAI,CAAC;wBACH,MAAM,OAAO,GAAG,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;wBAChD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;wBACzC,QAAQ,IAAI,KAAK,CAAC;wBAClB,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACnB,YAAY,EAAE,CAAC;oBACjB,CAAC;oBAAC,MAAM,CAAC;wBACP,wBAAwB;oBAC1B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAErB,0CAA0C;IAC1C,IAAI,YAAY,IAAI,QAAQ,EAAE,CAAC;QAC7B,kDAAkD;QAClD,MAAM,cAAc,GAAG,cAAc,CAAC,WAAW,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;QACjE,IAAI,cAAc,GAAG,YAAY,EAAE,CAAC;YAClC,MAAM,aAAa,GAAG,QAAQ,GAAG,YAAY,CAAC;YAC9C,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,cAAc,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAED,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;AACtC,CAAC;AAED,SAAS,cAAc,CAAC,WAAmB,EAAE,GAAW;IACtD,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,SAAS,IAAI,CAAC,GAAW,EAAE,KAAa;QACtC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG;YAAE,OAAO;QAEtC,IAAI,OAAiB,CAAC;QACtB,IAAI,CAAC;YACH,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAC7B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO;QACT,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,IAAI,GAAG;gBAAE,OAAO;YACzB,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS;YAE9D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC;YACT,IAAI,CAAC;gBACH,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC5B,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YAED,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBACvB,IAAI,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC5B,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBACzB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;gBACzC,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,KAAK,EAAE,CAAC;YACxC,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACrB,OAAO,KAAK,CAAC;AACf,CAAC;AAED,4EAA4E;AAE5E,SAAS,eAAe,CAAC,WAAmB;IAC1C,MAAM,OAAO,GAAG;QACd,KAAK;QACL,KAAK;QACL,KAAK;QACL,OAAO;QACP,YAAY;QACZ,SAAS;QACT,UAAU;QACV,QAAQ;QACR,KAAK;QACL,KAAK;QACL,UAAU;QACV,SAAS;QACT,UAAU;QACV,QAAQ;QACR,MAAM;QACN,QAAQ;QACR,QAAQ;QACR,KAAK;KACN,CAAC;IAEF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;YAAE,KAAK,EAAE,CAAC;IAClD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,2EAA2E;AAE3E,SAAS,WAAW,CAAC,WAAmB;IACtC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QACxF,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC5B,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnE,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACrE,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC;QAC/F,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACzB,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,EAAE,yBAAyB,CAAC,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/F,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACvE,OAAO,KAAK,CAAC;AACf,CAAC;AAED,2EAA2E;AAE3E,MAAM,eAAe,GAA2B;IAC9C,KAAK,EAAE,YAAY;IACnB,MAAM,EAAE,YAAY;IACpB,KAAK,EAAE,YAAY;IACnB,MAAM,EAAE,YAAY;IACpB,KAAK,EAAE,QAAQ;IACf,KAAK,EAAE,MAAM;IACb,KAAK,EAAE,IAAI;IACX,OAAO,EAAE,MAAM;IACf,KAAK,EAAE,QAAQ;IACf,KAAK,EAAE,IAAI;IACX,MAAM,EAAE,KAAK;IACb,IAAI,EAAE,GAAG;IACT,IAAI,EAAE,OAAO;IACb,MAAM,EAAE,KAAK;IACb,QAAQ,EAAE,OAAO;IACjB,KAAK,EAAE,MAAM;IACb,MAAM,EAAE,KAAK;IACb,OAAO,EAAE,MAAM;IACf,OAAO,EAAE,MAAM;IACf,OAAO,EAAE,MAAM;IACf,MAAM,EAAE,KAAK;IACb,MAAM,EAAE,KAAK;IACb,KAAK,EAAE,QAAQ;IACf,MAAM,EAAE,QAAQ;IAChB,MAAM,EAAE,UAAU;IAClB,KAAK,EAAE,SAAS;IAChB,QAAQ,EAAE,OAAO;IACjB,IAAI,EAAE,GAAG;IACT,IAAI,EAAE,GAAG;CACV,CAAC;AAEF,MAAM,UAAU,gBAAgB,CAAC,WAAmB;IAClD,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC,WAAW,CAAC,CAAC;IAC9D,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC1C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,IAAI;YAAE,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;IACD,MAAM,aAAa,GAAG,eAAe,CAAC,IAAI,CAAC;IAE3C,MAAM,iBAAiB,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;IACvD,MAAM,uBAAuB,GAC3B,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;QAC1C,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC,CAAC;QAChD,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC;YAC9C,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC,CAAC;QAChD,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;IAChG,MAAM,kBAAkB,GACtB,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC,CAAC;IAC1F,MAAM,kBAAkB,GAAG,KAAK,CAAC,CAAC,wCAAwC;IAE1E,MAAM,aAAa,GAAG,WAAW,CAAC,WAAW,CAAC,CAAC;IAE/C,oBAAoB;IACpB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,GAAG,IAAI,MAAM;QAAE,KAAK,IAAI,EAAE,CAAC;SAC1B,IAAI,GAAG,IAAI,KAAK;QAAE,KAAK,IAAI,EAAE,CAAC;SAC9B,IAAI,GAAG,IAAI,KAAK;QAAE,KAAK,IAAI,EAAE,CAAC;;QAC9B,KAAK,IAAI,EAAE,CAAC;IAEjB,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1C,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,iBAAiB,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IAC7C,IAAI,uBAAuB;QAAE,KAAK,IAAI,EAAE,CAAC;IACzC,IAAI,kBAAkB;QAAE,KAAK,IAAI,CAAC,CAAC;IAEnC,qBAAqB;IACrB,IAAI,IAAoB,CAAC;IACzB,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,MAAM,IAAI,aAAa,IAAI,CAAC,CAAC,EAAE,CAAC;QACzD,IAAI,GAAG,SAAS,CAAC;IACnB,CAAC;SAAM,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,KAAK,IAAI,aAAa,IAAI,CAAC,CAAC,EAAE,CAAC;QAC/D,IAAI,GAAG,OAAO,CAAC;IACjB,CAAC;SAAM,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,KAAK,IAAI,aAAa,IAAI,CAAC,CAAC,EAAE,CAAC;QAC/D,IAAI,GAAG,QAAQ,CAAC;IAClB,CAAC;SAAM,CAAC;QACN,IAAI,GAAG,OAAO,CAAC;IACjB,CAAC;IAED,OAAO;QACL,IAAI;QACJ,KAAK;QACL,OAAO,EAAE;YACP,YAAY,EAAE,GAAG;YACjB,aAAa;YACb,iBAAiB;YACjB,uBAAuB;YACvB,kBAAkB;YAClB,kBAAkB;SACnB;QACD,eAAe,EAAE;YACf,UAAU,EAAE,IAAI,EAAE,SAAS;YAC3B,UAAU,EAAE,IAAI,KAAK,OAAO;YAC5B,iBAAiB,EAAE,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,SAAS;YACzD,gBAAgB,EAAE,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,SAAS;YACxD,iBAAiB,EAAE,IAAI,KAAK,SAAS;YACrC,eAAe,EAAE,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,SAAS;YACvD,gBAAgB,EAAE,IAAI,KAAK,SAAS;SACrC;QACD,aAAa;KACd,CAAC;AACJ,CAAC"}

package/dist/core/compress/compressor.d.ts

@@ -1,60 +0,0 @@
-/**
- * Deterministic prose compressor for `rulebook compress`.
- *
- * Applies only SAFE transformations — filler-word removal, pleasantry
- * stripping, and redundant-phrase replacement. Never restructures
- * sentences, never touches code, URLs, paths, commands, dates, or
- * version numbers. That conservative scope is what makes the
- * validator in `validator.ts` a sufficient safety net.
- *
- * When richer compression is wanted (useMemo → stabilize, "implement
- * a solution for" → "fix"), the user can layer Claude-powered
- * rewriting on top of this module. The validator contract is
- * orthogonal to the rewriter — any future LLM-backed compressor gets
- * graded against the same invariants.
- *
- * Grounded in `.rulebook/specs/RULEBOOK_TERSE.md` §Compression
- * companion.
- */
-import { type ValidationResult } from './validator.js';
-export interface CompressResult {
-    output: string;
-    retries: number;
-    validation: ValidationResult;
-}
-export interface CompressOptions {
-    /** Max retry count after validation failure. Defaults to 2. */
-    maxRetries?: number;
-}
-interface Segment {
-    protected: boolean;
-    text: string;
-}
-/**
- * Split input into protected and prose segments.
- * Protected: fenced code blocks, inline code, URLs.
- * Everything else is prose.
- */
-declare function segment(input: string): Segment[];
-declare function compressProse(prose: string): string;
-/**
- * Compress `input` using the deterministic rewriter. Returns the
- * compressed output along with the validation result and retry count.
- *
- * The retry loop is defensive: on this conservative algorithm we
- * should never produce a validation failure (we only touch prose
- * segments), so a failure means either (a) a prose segment
- * contained a protected pattern we missed, or (b) an unusual edge
- * case in the splitter. Retries progressively disable classes of
- * transformations to preserve as much safety as possible.
- */
-export declare function compress(input: string, options?: CompressOptions): CompressResult;
-/**
- * Exported for tests.
- */
-export declare const __test__: {
-    compressProse: typeof compressProse;
-    segment: typeof segment;
-};
-export {};
-//# sourceMappingURL=compressor.d.ts.map

package/dist/core/compress/compressor.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"compressor.d.ts","sourceRoot":"","sources":["../../../src/core/compress/compressor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAwB,KAAK,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAE7E,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,gBAAgB,CAAC;CAC9B;AAED,MAAM,WAAW,eAAe;IAC9B,+DAA+D;IAC/D,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AA8DD,UAAU,OAAO;IACf,SAAS,EAAE,OAAO,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;;GAIG;AACH,iBAAS,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,EAAE,CA6CzC;AAaD,iBAAS,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CA8B5C;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,eAAoB,GAAG,cAAc,CA0BrF;AAyCD;;GAEG;AACH,eAAO,MAAM,QAAQ;;;CAA6B,CAAC"}

package/dist/core/compress/compressor.js

@@ -1,232 +0,0 @@
-/**
- * Deterministic prose compressor for `rulebook compress`.
- *
- * Applies only SAFE transformations — filler-word removal, pleasantry
- * stripping, and redundant-phrase replacement. Never restructures
- * sentences, never touches code, URLs, paths, commands, dates, or
- * version numbers. That conservative scope is what makes the
- * validator in `validator.ts` a sufficient safety net.
- *
- * When richer compression is wanted (useMemo → stabilize, "implement
- * a solution for" → "fix"), the user can layer Claude-powered
- * rewriting on top of this module. The validator contract is
- * orthogonal to the rewriter — any future LLM-backed compressor gets
- * graded against the same invariants.
- *
- * Grounded in `.rulebook/specs/RULEBOOK_TERSE.md` §Compression
- * companion.
- */
-import { extractors, validate } from './validator.js';
-// ── Transformation rules — order matters (phrase replacements first) ──
-/** Redundant phrases → shorter synonym. Applied to prose only. */
-const PHRASE_REPLACEMENTS = [
-    [/\bin order to\b/gi, 'to'],
-    [/\bmake sure to\b/gi, 'ensure'],
-    [/\bmake sure that\b/gi, 'ensure'],
-    [/\bthe reason is because\b/gi, 'because'],
-    [/\bthe reason why\b/gi, 'why'],
-    [/\bat this point in time\b/gi, 'now'],
-    [/\bwith regard to\b/gi, 'on'],
-    [/\bwith respect to\b/gi, 'on'],
-    [/\bdue to the fact that\b/gi, 'because'],
-    [/\ba number of\b/gi, 'several'],
-    [/\bfor the purpose of\b/gi, 'to'],
-    [/\bit is important to note that\b/gi, ''],
-    [/\bit should be noted that\b/gi, ''],
-];
-/** Leading pleasantries to strip from prose segments. */
-const PLEASANTRY_PREFIXES = [
-    /^\s*(sure|certainly|of course)[,!.]?\s+/i,
-    /^\s*(happy to help|great question|good point)[,!.]?\s+/i,
-    /^\s*(i'd|i would) be happy to[^.]*\.\s+/i,
-    /^\s*(let me)[^.]*\.\s+/i,
-];
-/** Filler words removed when they appear between word-boundaries. */
-const FILLER_WORDS = [
-    'just',
-    'really',
-    'basically',
-    'actually',
-    'simply',
-    'essentially',
-    'generally',
-    'frankly',
-    'honestly',
-    'literally',
-    'very',
-    'quite',
-    'perhaps',
-    'maybe',
-];
-/** Hedging phrases to remove. */
-const HEDGING_PATTERNS = [
-    /\bit might be worth\b/gi,
-    /\byou could consider\b/gi,
-    /\byou (?:may|might) want to\b/gi,
-    /\bi (?:think|believe|feel) that\b/gi,
-    // Lookahead uses `\s*\w` to tolerate whitespace collapsed by earlier
-    // substitutions (e.g. "I think  consider" after a "you might want to"
-    // strip leaves a double space before the next word).
-    /\bi (?:think|believe|feel)\s+(?=\w)/gi,
-    /\bin my opinion,?\s*/gi,
-];
-/**
- * Split input into protected and prose segments.
- * Protected: fenced code blocks, inline code, URLs.
- * Everything else is prose.
- */
-function segment(input) {
-    const segments = [];
-    // Layered matches: fenced code, inline code, URLs. First we build a
-    // mask of protected character ranges; prose is the complement.
-    const mask = new Array(input.length).fill(false);
-    const markRanges = (re) => {
-        const matches = input.matchAll(re);
-        for (const m of matches) {
-            if (m.index === undefined)
-                continue;
-            for (let i = m.index; i < m.index + m[0].length; i++)
-                mask[i] = true;
-        }
-    };
-    // Capture fenced code FIRST so inline-code inside ``` blocks doesn't
-    // get double-marked (it's already inside a fenced region).
-    markRanges(extractors.FENCED_CODE_RE);
-    // Inline code — recomputed on a version where fenced blocks are
-    // masked out so we don't match inside them.
-    const stripped = input
-        .split('')
-        .map((c, i) => (mask[i] ? ' ' : c))
-        .join('');
-    const inlineMatches = stripped.matchAll(extractors.INLINE_CODE_RE);
-    for (const m of inlineMatches) {
-        if (m.index === undefined)
-            continue;
-        for (let i = m.index; i < m.index + m[0].length; i++)
-            mask[i] = true;
-    }
-    markRanges(extractors.URL_RE);
-    markRanges(extractors.PATH_RE);
-    markRanges(extractors.DATE_RE);
-    markRanges(extractors.VERSION_RE);
-    // Now scan the mask to build contiguous segments.
-    let i = 0;
-    while (i < input.length) {
-        const isProtected = mask[i];
-        let j = i;
-        while (j < input.length && mask[j] === isProtected)
-            j++;
-        segments.push({ protected: isProtected, text: input.slice(i, j) });
-        i = j;
-    }
-    return segments;
-}
-// ── Prose rewriter ────────────────────────────────────────────────────
-function stripFillerWord(text, word) {
-    // Remove ", just," / " just " / " just." patterns but preserve
-    // sentence boundaries. Matches word only when surrounded by word
-    // boundaries and whitespace, not at the start of a capitalized
-    // sentence (where removal changes meaning more aggressively).
-    const pattern = new RegExp(`(?<=\\s|^)${word}\\s+(?=[a-zA-Z])`, 'gi');
-    return text.replace(pattern, '');
-}
-function compressProse(prose) {
-    let out = prose;
-    // 1. Strip leading pleasantries.
-    for (const re of PLEASANTRY_PREFIXES) {
-        out = out.replace(re, '');
-    }
-    // 2. Remove hedging phrases.
-    for (const re of HEDGING_PATTERNS) {
-        out = out.replace(re, '');
-    }
-    // 3. Apply phrase replacements.
-    for (const [re, repl] of PHRASE_REPLACEMENTS) {
-        out = out.replace(re, repl);
-    }
-    // 4. Remove filler words (as standalone mid-sentence tokens).
-    for (const word of FILLER_WORDS) {
-        out = stripFillerWord(out, word);
-    }
-    // 5. Normalize whitespace artifacts introduced by deletions.
-    out = out
-        .replace(/\s+([,.;:!?])/g, '$1') // collapse space-before-punct
-        .replace(/[ \t]{2,}/g, ' ') // collapse multiple spaces
-        .replace(/\n[ \t]+\n/g, '\n\n'); // trim trailing whitespace on blank lines
-    return out;
-}
-/**
- * Compress `input` using the deterministic rewriter. Returns the
- * compressed output along with the validation result and retry count.
- *
- * The retry loop is defensive: on this conservative algorithm we
- * should never produce a validation failure (we only touch prose
- * segments), so a failure means either (a) a prose segment
- * contained a protected pattern we missed, or (b) an unusual edge
- * case in the splitter. Retries progressively disable classes of
- * transformations to preserve as much safety as possible.
- */
-export function compress(input, options = {}) {
-    const maxRetries = options.maxRetries ?? 2;
-    let retries = 0;
-    let output = applyCompression(input, {
-        pleasantries: true,
-        hedging: true,
-        phraseReplacements: true,
-        fillerWords: true,
-    });
-    let validation = validate(input, output);
-    while (!validation.ok && retries < maxRetries) {
-        retries++;
-        // On retry 1 → disable filler words (most aggressive class).
-        // On retry 2 → also disable hedging.
-        // If still failing, fall through and return the failure state.
-        output = applyCompression(input, {
-            pleasantries: true,
-            hedging: retries < 2,
-            phraseReplacements: true,
-            fillerWords: false,
-        });
-        validation = validate(input, output);
-    }
-    return { output, retries, validation };
-}
-function applyCompression(input, enabled) {
-    const segs = segment(input);
-    const pieces = [];
-    for (const s of segs) {
-        if (s.protected) {
-            // Protected segments MUST pass through byte-identically.
-            // No whitespace normalization, no substitutions.
-            pieces.push(s.text);
-            continue;
-        }
-        let rewritten = s.text;
-        if (enabled.pleasantries) {
-            for (const re of PLEASANTRY_PREFIXES)
-                rewritten = rewritten.replace(re, '');
-        }
-        if (enabled.hedging) {
-            for (const re of HEDGING_PATTERNS)
-                rewritten = rewritten.replace(re, '');
-        }
-        if (enabled.phraseReplacements) {
-            for (const [re, repl] of PHRASE_REPLACEMENTS)
-                rewritten = rewritten.replace(re, repl);
-        }
-        if (enabled.fillerWords) {
-            for (const word of FILLER_WORDS)
-                rewritten = stripFillerWord(rewritten, word);
-        }
-        // Whitespace normalization INSIDE prose segments only. Keep
-        // inter-paragraph blank lines (don't collapse \n\n → \n).
-        rewritten = rewritten.replace(/ +([,.;:!?])/g, '$1').replace(/[ \t]{2,}/g, ' ');
-        pieces.push(rewritten);
-    }
-    return pieces.join('');
-}
-/**
- * Exported for tests.
- */
-export const __test__ = { compressProse, segment };
-//# sourceMappingURL=compressor.js.map

package/dist/core/compress/compressor.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"compressor.js","sourceRoot":"","sources":["../../../src/core/compress/compressor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAyB,MAAM,gBAAgB,CAAC;AAa7E,yEAAyE;AAEzE,kEAAkE;AAClE,MAAM,mBAAmB,GAAoC;IAC3D,CAAC,mBAAmB,EAAE,IAAI,CAAC;IAC3B,CAAC,oBAAoB,EAAE,QAAQ,CAAC;IAChC,CAAC,sBAAsB,EAAE,QAAQ,CAAC;IAClC,CAAC,6BAA6B,EAAE,SAAS,CAAC;IAC1C,CAAC,sBAAsB,EAAE,KAAK,CAAC;IAC/B,CAAC,6BAA6B,EAAE,KAAK,CAAC;IACtC,CAAC,sBAAsB,EAAE,IAAI,CAAC;IAC9B,CAAC,uBAAuB,EAAE,IAAI,CAAC;IAC/B,CAAC,4BAA4B,EAAE,SAAS,CAAC;IACzC,CAAC,mBAAmB,EAAE,SAAS,CAAC;IAChC,CAAC,0BAA0B,EAAE,IAAI,CAAC;IAClC,CAAC,oCAAoC,EAAE,EAAE,CAAC;IAC1C,CAAC,+BAA+B,EAAE,EAAE,CAAC;CACtC,CAAC;AAEF,yDAAyD;AACzD,MAAM,mBAAmB,GAA0B;IACjD,0CAA0C;IAC1C,yDAAyD;IACzD,0CAA0C;IAC1C,yBAAyB;CAC1B,CAAC;AAEF,qEAAqE;AACrE,MAAM,YAAY,GAA0B;IAC1C,MAAM;IACN,QAAQ;IACR,WAAW;IACX,UAAU;IACV,QAAQ;IACR,aAAa;IACb,WAAW;IACX,SAAS;IACT,UAAU;IACV,WAAW;IACX,MAAM;IACN,OAAO;IACP,SAAS;IACT,OAAO;CACR,CAAC;AAEF,iCAAiC;AACjC,MAAM,gBAAgB,GAA0B;IAC9C,yBAAyB;IACzB,0BAA0B;IAC1B,iCAAiC;IACjC,qCAAqC;IACrC,qEAAqE;IACrE,sEAAsE;IACtE,qDAAqD;IACrD,uCAAuC;IACvC,wBAAwB;CACzB,CAAC;AASF;;;;GAIG;AACH,SAAS,OAAO,CAAC,KAAa;IAC5B,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,oEAAoE;IACpE,+DAA+D;IAC/D,MAAM,IAAI,GAAG,IAAI,KAAK,CAAU,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAE1D,MAAM,UAAU,GAAG,CAAC,EAAU,EAAQ,EAAE;QACtC,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS;gBAAE,SAAS;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACvE,CAAC;IACH,CAAC,CAAC;IAEF,qEAAqE;IACrE,2DAA2D;IAC3D,UAAU,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;IACtC,gEAAgE;IAChE,4CAA4C;IAC5C,MAAM,QAAQ,GAAG,KAAK;SACnB,KAAK,CAAC,EAAE,CAAC;SACT,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClC,IAAI,CAAC,EAAE,CAAC,CAAC;IACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;IACnE,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS;YAAE,SAAS;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACvE,CAAC;IACD,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC9B,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAC/B,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAC/B,UAAU,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IAElC,kDAAkD;IAClD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACxB,MAAM,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,WAAW;YAAE,CAAC,EAAE,CAAC;QACxD,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACnE,CAAC,GAAG,CAAC,CAAC;IACR,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,yEAAyE;AAEzE,SAAS,eAAe,CAAC,IAAY,EAAE,IAAY;IACjD,+DAA+D;IAC/D,iEAAiE;IACjE,+DAA+D;IAC/D,8DAA8D;IAC9D,MAAM,OAAO,GAAG,IAAI,MAAM,CAAC,aAAa,IAAI,kBAAkB,EAAE,IAAI,CAAC,CAAC;IACtE,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,aAAa,CAAC,KAAa;IAClC,IAAI,GAAG,GAAG,KAAK,CAAC;IAEhB,iCAAiC;IACjC,KAAK,MAAM,EAAE,IAAI,mBAAmB,EAAE,CAAC;QACrC,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,6BAA6B;IAC7B,KAAK,MAAM,EAAE,IAAI,gBAAgB,EAAE,CAAC;QAClC,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,gCAAgC;IAChC,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,mBAAmB,EAAE,CAAC;QAC7C,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,8DAA8D;IAC9D,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,GAAG,GAAG,eAAe,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,6DAA6D;IAC7D,GAAG,GAAG,GAAG;SACN,OAAO,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC,8BAA8B;SAC9D,OAAO,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC,2BAA2B;SACtD,OAAO,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC,0CAA0C;IAE7E,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAa,EAAE,UAA2B,EAAE;IACnE,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,CAAC,CAAC;IAC3C,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE;QACnC,YAAY,EAAE,IAAI;QAClB,OAAO,EAAE,IAAI;QACb,kBAAkB,EAAE,IAAI;QACxB,WAAW,EAAE,IAAI;KAClB,CAAC,CAAC;IACH,IAAI,UAAU,GAAG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAEzC,OAAO,CAAC,UAAU,CAAC,EAAE,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;QAC9C,OAAO,EAAE,CAAC;QACV,6DAA6D;QAC7D,qCAAqC;QACrC,+DAA+D;QAC/D,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE;YAC/B,YAAY,EAAE,IAAI;YAClB,OAAO,EAAE,OAAO,GAAG,CAAC;YACpB,kBAAkB,EAAE,IAAI;YACxB,WAAW,EAAE,KAAK;SACnB,CAAC,CAAC;QACH,UAAU,GAAG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;AACzC,CAAC;AAED,SAAS,gBAAgB,CACvB,KAAa,EACb,OAKC;IAED,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAChB,yDAAyD;YACzD,iDAAiD;YACjD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACpB,SAAS;QACX,CAAC;QACD,IAAI,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC;QACvB,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;YACzB,KAAK,MAAM,EAAE,IAAI,mBAAmB;gBAAE,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9E,CAAC;QACD,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,EAAE,IAAI,gBAAgB;gBAAE,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAC;YAC/B,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,mBAAmB;gBAAE,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACxF,CAAC;QACD,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;YACxB,KAAK,MAAM,IAAI,IAAI,YAAY;gBAAE,SAAS,GAAG,eAAe,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAChF,CAAC;QACD,4DAA4D;QAC5D,0DAA0D;QAC1D,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,eAAe,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;QAChF,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC"}

package/dist/core/compress/discover.d.ts

@@ -1,19 +0,0 @@
-/**
- * Discover candidate markdown memory files in a project.
- *
- * Caveman-compress is advertised as a tool for the files the model
- * READS on every session, so this helper surfaces the same class of
- * files: project-root memory markdown (`CLAUDE.md`, `AGENTS.md`,
- * `AGENTS.override.md`) plus long-lived `.rulebook/` notes and
- * knowledge/learning entries.
- */
-export interface Candidate {
-    relPath: string;
-    absPath: string;
-    bytes: number;
-    hasBackup: boolean;
-    backupBytes?: number;
-    backupRatio?: number;
-}
-export declare function listCompressCandidates(projectRoot: string): Promise<Candidate[]>;
-//# sourceMappingURL=discover.d.ts.map

package/dist/core/compress/discover.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"discover.d.ts","sourceRoot":"","sources":["../../../src/core/compress/discover.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAKH,MAAM,WAAW,SAAS;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,OAAO,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AA0CD,wBAAsB,sBAAsB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,CAmDtF"}