smol-logs 1.0.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2024
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,208 @@
+# smol-logs
+
+A CLI tool to compress verbose text output (logs, test output, build logs) into a human-readable, AI-friendly format. Reduces token usage when working with AI tools by intelligently encoding repetition.
+
+## Installation
+
+```bash
+npm install -g smol-logs
+```
+
+Or run directly with npx:
+```bash
+npx smol-logs
+```
+
+## Usage
+
+```bash
+# Pipe input from stdin
+cat test.log | smol
+
+# Read from file
+smol test.log
+
+# Write to file
+smol test.log -o compressed.txt
+
+# Adjust similarity threshold for pattern detection
+smol test.log -t 0.9
+
+# Exclude metadata header
+smol test.log --no-meta
+```
+
+## How It Works
+
+smol uses three compression strategies:
+
+### 1. Run-Length Encoding (RLE)
+Collapses consecutive identical lines:
+
+**Input:**
+```
+Loading config...
+Loading config...
+Loading config...
+Server started
+```
+
+**Output:**
+```
+Loading config...
+  ↑ repeated 3 times
+Server started
+```
+
+### 2. Global Deduplication
+Removes non-consecutive duplicate lines:
+
+**Input:**
+```
+  console.log
+    Message 1
+  console.log
+    Message 2
+  console.log
+    Message 3
+```
+
+**Output:**
+```
+  console.log
+  ↑ appears 3 times
+    Message 1
+    Message 2
+    Message 3
+```
+
+### 3. Pattern Templates
+Detects near-duplicate lines and extracts variable parts:
+
+**Input:**
+```
+[INFO] Server ready on port 8080
+[INFO] Server ready on port 8081
+[INFO] Server ready on port 8082
+```
+
+**Output:**
+```
+"[INFO] Server ready on port {port}"
+  ↑ pattern matched 3 times: port = 8080, 8081, 8082
+```
+
+## Output Format
+
+```
+=== COMPRESSION: 1247 → 89 lines (93%) ===
+
+Loading config...
+  ↑ repeated 3 times
+
+Server started
+
+"[INFO] Server ready on port {port}"
+  ↑ pattern matched 5 times: port = 8080, 8081, 8082, 8083, 8084
+
+"[ERROR] Connection failed: {error}"
+  ↑ pattern matched 12 times: error = timeout, refused, reset, ...3 more
+  ↑ time range: 10:15:06 - 10:17:23
+
+Done
+```
+
+### Format Elements
+
+| Element | Syntax | Meaning |
+|---------|--------|---------|
+| Repeated line | `line` + `↑ repeated N times` | Line appeared N consecutive times |
+| Deduplicated | `line` + `↑ appears N times` | Line appeared N times (non-consecutive) |
+| Pattern | `"template"` + `↑ pattern matched` | Near-duplicate lines with variables |
+| Unique line | just the line | Single occurrence |
+
+## CLI Options
+
+| Option | Description | Default |
+|--------|-------------|---------|
+| `-o, --output <file>` | Output file (stdout if not provided) | - |
+| `-t, --threshold <n>` | Similarity threshold for patterns (0-1) | 0.8 |
+| `--no-meta` | Exclude compression stats header | false |
+| `-p, --max-patterns <n>` | Maximum patterns to extract | 10 |
+| `-v, --verbose` | Show compression statistics | false |
+
+## Examples
+
+### Compress Test Output
+
+```bash
+npm test 2>&1 | smol
+```
+
+### Compress Build Logs
+
+```bash
+npm run build 2>&1 | smol -o build-summary.txt
+```
+
+### Use with AI Tools
+
+```bash
+# Compress and copy to clipboard (macOS)
+cat verbose.log | smol | pbcopy
+
+# Compress and copy to clipboard (Windows)
+type verbose.log | smol | clip
+```
+
+## API Usage
+
+You can also use the compressor programmatically:
+
+```typescript
+import { compress, compressVerbose } from 'smol-logs';
+
+const input = `
+Loading...
+Loading...
+Server started
+`;
+
+// Basic compression
+const output = compress(input);
+console.log(output);
+
+// With options
+const output2 = compress(input, {
+  threshold: 0.9,
+  includeMeta: false,
+});
+
+// With statistics
+const { output: result, stats } = compressVerbose(input);
+console.log(`Compression: ${stats.totalLines} → ${stats.compressedItems} items`);
+```
+
+## Development
+
+```bash
+# Clone the repository
+git clone https://github.com/anthropics/smol-logs
+cd smol-logs
+
+# Install dependencies
+npm install
+
+# Run tests
+npm test
+
+# Build
+npm run build
+
+# Run in development
+npm run dev sample.log
+```
+
+## License
+
+MIT

package/dist/blocks.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Block detection for repeated sequences of lines
+ * Uses content-defined chunking concepts to find natural boundaries
+ * and detect repeated blocks
+ */
+import { LineInfo, DetectedBlock, BlockResult, CompressorOptions } from './types';
+/**
+ * Detect repeated blocks of lines
+ * @param lines - Array of LineInfo
+ * @param options - Compressor options
+ * @returns BlockResult with detected blocks
+ */
+export declare function detectBlocks(lines: LineInfo[], options: CompressorOptions): BlockResult;
+/**
+ * Get block coverage info for debugging
+ * @param blocks - Detected blocks
+ * @param totalLines - Total number of lines
+ * @returns Coverage statistics
+ */
+export declare function getBlockCoverage(blocks: DetectedBlock[], totalLines: number): {
+    coveredLines: number;
+    percentage: string;
+};
+//# sourceMappingURL=blocks.d.ts.map

package/dist/blocks.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blocks.d.ts","sourceRoot":"","sources":["../src/blocks.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AA0IlF;;;;;GAKG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,QAAQ,EAAE,EACjB,OAAO,EAAE,iBAAiB,GACzB,WAAW,CA8Eb;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,aAAa,EAAE,EACvB,UAAU,EAAE,MAAM,GACjB;IAAE,YAAY,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAe9C"}

package/dist/blocks.js

@@ -0,0 +1,214 @@
+"use strict";
+/**
+ * Block detection for repeated sequences of lines
+ * Uses content-defined chunking concepts to find natural boundaries
+ * and detect repeated blocks
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.detectBlocks = detectBlocks;
+exports.getBlockCoverage = getBlockCoverage;
+const hashing_1 = require("./hashing");
+/** Gear table for rolling hash (256 random values) */
+const GEAR_TABLE = (() => {
+    // Deterministic pseudo-random values using a simple LCG
+    const table = [];
+    let seed = 0x12345678;
+    for (let i = 0; i < 256; i++) {
+        seed = Math.imul(seed, 1103515245) + 12345;
+        table.push(seed >>> 0);
+    }
+    return table;
+})();
+/**
+ * Compute a hash for a sequence of lines
+ * @param lines - Array of line strings
+ * @returns Hash of the combined lines
+ */
+function hashLineSequence(lines) {
+    return (0, hashing_1.fnv1a)(lines.join('\n'));
+}
+/**
+ * Find block boundaries using line content patterns
+ * Blocks are natural groupings where we see clear separators
+ * @param lines - Array of LineInfo
+ * @returns Array of boundary indices
+ */
+function findBlockBoundaries(lines) {
+    const boundaries = [0]; // Start is always a boundary
+    // Common block separator patterns
+    const separatorPatterns = [
+        /^={3,}/, // ===...
+        /^-{3,}/, // ---...
+        /^#{3,}/, // ###...
+        /^\*{3,}/, // ***...
+        /^~{3,}/, // ~~~...
+        /^$/, // Empty line
+        /^(Test|Describe|Context|Suite|PASS|FAIL)[\s:]/i, // Test markers
+        /^\[?(INFO|ERROR|WARN|DEBUG)\]?[\s:]/i, // Log level changes
+    ];
+    for (let i = 1; i < lines.length; i++) {
+        const text = lines[i].text.trim();
+        // Check if line matches any separator pattern
+        const isSeparator = separatorPatterns.some((p) => p.test(text));
+        // Also check for significant content changes (header-like lines)
+        const isHeader = /^={2,}\s*\w/.test(text) || // === Something ===
+            /^#{1,3}\s/.test(text); // # Header
+        if (isSeparator || isHeader) {
+            boundaries.push(i);
+        }
+    }
+    boundaries.push(lines.length); // End is always a boundary
+    return [...new Set(boundaries)].sort((a, b) => a - b);
+}
+/**
+ * Extract blocks between boundaries and identify repeats
+ * @param lines - Array of LineInfo
+ * @param boundaries - Block boundary indices
+ * @param minBlockSize - Minimum lines to consider as block
+ * @returns Map of block hash to block info
+ */
+function extractBlocks(lines, boundaries, minBlockSize) {
+    const blockMap = new Map();
+    for (let i = 0; i < boundaries.length - 1; i++) {
+        const start = boundaries[i];
+        const end = boundaries[i + 1];
+        const blockLines = lines.slice(start, end).map((l) => l.text);
+        // Skip blocks that are too small
+        if (blockLines.length < minBlockSize) {
+            continue;
+        }
+        const hash = hashLineSequence(blockLines);
+        const existing = blockMap.get(hash);
+        if (existing) {
+            existing.indices.push(start);
+        }
+        else {
+            blockMap.set(hash, { lines: blockLines, indices: [start] });
+        }
+    }
+    return blockMap;
+}
+/**
+ * Find repeated subsequences within the lines using sliding window
+ * @param lines - Array of LineInfo
+ * @param minBlockSize - Minimum block size
+ * @returns Map of hash to block info
+ */
+function findRepeatedSubsequences(lines, minBlockSize) {
+    const blockMap = new Map();
+    // Try different window sizes from minBlockSize up to a reasonable max
+    const maxWindowSize = Math.min(20, Math.floor(lines.length / 2));
+    for (let windowSize = minBlockSize; windowSize <= maxWindowSize; windowSize++) {
+        for (let i = 0; i <= lines.length - windowSize; i++) {
+            const windowLines = lines.slice(i, i + windowSize).map((l) => l.text);
+            const hash = hashLineSequence(windowLines);
+            const existing = blockMap.get(hash);
+            if (existing) {
+                // Check if this is a new occurrence (not overlapping)
+                const lastIndex = existing.indices[existing.indices.length - 1];
+                if (i >= lastIndex + existing.lines.length) {
+                    existing.indices.push(i);
+                }
+            }
+            else {
+                blockMap.set(hash, { lines: windowLines, indices: [i] });
+            }
+        }
+    }
+    return blockMap;
+}
+/**
+ * Detect repeated blocks of lines
+ * @param lines - Array of LineInfo
+ * @param options - Compressor options
+ * @returns BlockResult with detected blocks
+ */
+function detectBlocks(lines, options) {
+    const { minBlockSize } = options;
+    // First try natural boundary detection
+    const boundaries = findBlockBoundaries(lines);
+    let blockMap = extractBlocks(lines, boundaries, minBlockSize);
+    // Also look for repeated subsequences that might not align with boundaries
+    const subseqBlocks = findRepeatedSubsequences(lines, minBlockSize);
+    // Merge results, preferring longer blocks
+    for (const [hash, info] of subseqBlocks) {
+        if (info.indices.length > 1) {
+            const existing = blockMap.get(hash);
+            if (!existing || info.lines.length > existing.lines.length) {
+                blockMap.set(hash, info);
+            }
+        }
+    }
+    // Filter to only blocks that appear more than once
+    const repeatedBlocks = [];
+    let blockId = 1;
+    const coveredIndices = new Set();
+    // Sort by occurrence count descending, then by size descending
+    const sortedBlocks = [...blockMap.entries()]
+        .filter(([_, info]) => info.indices.length > 1)
+        .sort((a, b) => {
+        const countDiff = b[1].indices.length - a[1].indices.length;
+        if (countDiff !== 0)
+            return countDiff;
+        return b[1].lines.length - a[1].lines.length;
+    });
+    for (const [hash, info] of sortedBlocks) {
+        // Check if any of these indices are already covered
+        const uncoveredIndices = info.indices.filter((idx) => {
+            for (let i = 0; i < info.lines.length; i++) {
+                if (coveredIndices.has(idx + i)) {
+                    return false;
+                }
+            }
+            return true;
+        });
+        if (uncoveredIndices.length > 1) {
+            const block = {
+                id: `B${blockId++}`,
+                startIndex: uncoveredIndices[0],
+                lines: info.lines,
+                hash,
+                occurrences: uncoveredIndices.length,
+                indices: uncoveredIndices,
+            };
+            repeatedBlocks.push(block);
+            // Mark these indices as covered
+            for (const idx of uncoveredIndices) {
+                for (let i = 0; i < info.lines.length; i++) {
+                    coveredIndices.add(idx + i);
+                }
+            }
+        }
+    }
+    // Calculate remaining indices
+    const remainingIndices = new Set();
+    for (let i = 0; i < lines.length; i++) {
+        if (!coveredIndices.has(i)) {
+            remainingIndices.add(i);
+        }
+    }
+    return {
+        blocks: repeatedBlocks,
+        remainingIndices,
+    };
+}
+/**
+ * Get block coverage info for debugging
+ * @param blocks - Detected blocks
+ * @param totalLines - Total number of lines
+ * @returns Coverage statistics
+ */
+function getBlockCoverage(blocks, totalLines) {
+    const covered = new Set();
+    for (const block of blocks) {
+        for (const idx of block.indices) {
+            for (let i = 0; i < block.lines.length; i++) {
+                covered.add(idx + i);
+            }
+        }
+    }
+    const coveredLines = covered.size;
+    const percentage = ((coveredLines / totalLines) * 100).toFixed(1);
+    return { coveredLines, percentage: `${percentage}%` };
+}
+//# sourceMappingURL=blocks.js.map

package/dist/blocks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blocks.js","sourceRoot":"","sources":["../src/blocks.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;AAkJH,oCAiFC;AAQD,4CAkBC;AA1PD,uCAAkC;AAElC,sDAAsD;AACtD,MAAM,UAAU,GAAa,CAAC,GAAG,EAAE;IACjC,wDAAwD;IACxD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,KAAK,CAAC;QAC3C,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC,EAAE,CAAC;AAEL;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,KAAe;IACvC,OAAO,IAAA,eAAK,EAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AACjC,CAAC;AAED;;;;;GAKG;AACH,SAAS,mBAAmB,CAAC,KAAiB;IAC5C,MAAM,UAAU,GAAa,CAAC,CAAC,CAAC,CAAC,CAAC,6BAA6B;IAE/D,kCAAkC;IAClC,MAAM,iBAAiB,GAAG;QACxB,QAAQ,EAAE,SAAS;QACnB,QAAQ,EAAE,SAAS;QACnB,QAAQ,EAAE,SAAS;QACnB,SAAS,EAAE,SAAS;QACpB,QAAQ,EAAE,SAAS;QACnB,IAAI,EAAE,aAAa;QACnB,gDAAgD,EAAE,eAAe;QACjE,sCAAsC,EAAE,oBAAoB;KAC7D,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAElC,8CAA8C;QAC9C,MAAM,WAAW,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAEhE,iEAAiE;QACjE,MAAM,QAAQ,GACZ,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,oBAAoB;YAChD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW;QAErC,IAAI,WAAW,IAAI,QAAQ,EAAE,CAAC;YAC5B,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,2BAA2B;IAC1D,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACxD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,aAAa,CACpB,KAAiB,EACjB,UAAoB,EACpB,YAAoB;IAEpB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkD,CAAC;IAE3E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAE9D,iCAAiC;QACjC,IAAI,UAAU,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;YACrC,SAAS;QACX,CAAC;QAED,MAAM,IAAI,GAAG,gBAAgB,CAAC,UAAU,CAAC,CAAC;QAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEpC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,SAAS,wBAAwB,CAC/B,KAAiB,EACjB,YAAoB;IAEpB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkD,CAAC;IAE3E,sEAAsE;IACtE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEjE,KAAK,IAAI,UAAU,GAAG,YAAY,EAAE,UAAU,IAAI,aAAa,EAAE,UAAU,EAAE,EAAE,CAAC;QAC9E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACtE,MAAM,IAAI,GAAG,gBAAgB,CAAC,WAAW,CAAC,CAAC;YAE3C,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,QAAQ,EAAE,CAAC;gBACb,sDAAsD;gBACtD,MAAM,SAAS,GAAG,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,IAAI,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;oBAC3C,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAC1B,KAAiB,EACjB,OAA0B;IAE1B,MAAM,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC;IAEjC,uCAAuC;IACvC,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;IAC9C,IAAI,QAAQ,GAAG,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;IAE9D,2EAA2E;IAC3E,MAAM,YAAY,GAAG,wBAAwB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IAEnE,0CAA0C;IAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,YAAY,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBAC3D,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAED,mDAAmD;IACnD,MAAM,cAAc,GAAoB,EAAE,CAAC;IAC3C,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IAEzC,+DAA+D;IAC/D,MAAM,YAAY,GAAG,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;SACzC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;SAC9C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACb,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;QAC5D,IAAI,SAAS,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACtC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEL,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,YAAY,EAAE,CAAC;QACxC,oDAAoD;QACpD,MAAM,gBAAgB,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC;oBAChC,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QAEH,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,KAAK,GAAkB;gBAC3B,EAAE,EAAE,IAAI,OAAO,EAAE,EAAE;gBACnB,UAAU,EAAE,gBAAgB,CAAC,CAAC,CAAC;gBAC/B,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,IAAI;gBACJ,WAAW,EAAE,gBAAgB,CAAC,MAAM;gBACpC,OAAO,EAAE,gBAAgB;aAC1B,CAAC;YAEF,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAE3B,gCAAgC;YAChC,KAAK,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3C,cAAc,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,8BAA8B;IAC9B,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3B,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM,EAAE,cAAc;QACtB,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAgB,gBAAgB,CAC9B,MAAuB,EACvB,UAAkB;IAElB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC;IAClC,MAAM,UAAU,GAAG,CAAC,CAAC,YAAY,GAAG,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAElE,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,GAAG,UAAU,GAAG,EAAE,CAAC;AACxD,CAAC"}

package/dist/compressor.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Main compression orchestrator
+ * Coordinates all compression phases and produces final output
+ */
+import { CompressorOptions } from './types';
+/**
+ * Parse input text into lines
+ * Handles different line endings
+ */
+declare function parseLines(input: string): string[];
+/**
+ * Main compression function
+ * @param input - Raw input text
+ * @param options - Compression options (partial, merged with defaults)
+ * @returns Compressed output string
+ */
+export declare function compress(input: string, options?: Partial<CompressorOptions>): string;
+/**
+ * Compress with verbose output for debugging
+ */
+export declare function compressVerbose(input: string, options?: Partial<CompressorOptions>): {
+    output: string;
+    stats: Record<string, unknown>;
+};
+export { parseLines };
+//# sourceMappingURL=compressor.d.ts.map

package/dist/compressor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compressor.d.ts","sourceRoot":"","sources":["../src/compressor.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACL,iBAAiB,EASlB,MAAM,SAAS,CAAC;AAMjB;;;GAGG;AACH,iBAAS,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAG3C;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CACtB,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,OAAO,CAAC,iBAAiB,CAAM,GACvC,MAAM,CAgCR;AA4JD;;GAEG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,OAAO,CAAC,iBAAiB,CAAM,GACvC;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAAE,CAkBpD;AAGD,OAAO,EAAE,UAAU,EAAE,CAAC"}