text-compress 2.0.0

package/dist/payload/tags.d.ts

@@ -0,0 +1,60 @@
+/**
+ * @module payload/tags
+ *
+ * Payload tagging — discriminated union over compressed blobs.
+ *
+ * After Brotli decompression the first byte tells the consumer what kind
+ * of payload follows. This is a lightweight **type tag** pattern (similar
+ * to MIME types or protobuf field numbers) that lets a single encoded
+ * string represent either UTF-8 text or a folder archive without external
+ * metadata.
+ *
+ * ## On-the-wire layout
+ *
+ * ```
+ *   [tag: u8][payload bytes…]
+ *        │         │
+ *        │         └── Brotli-compressed body (text UTF-8 or archive binary)
+ *        └── TAG_TEXT (0x01) or TAG_FOLDER (0x02)
+ * ```
+ *
+ * ## Full pipeline (compress)
+ *
+ * ```
+ *   raw data → wrapPayload(tag, data) → brotliCompress → encodeBuffer
+ * ```
+ *
+ * ## Full pipeline (decompress)
+ *
+ * ```
+ *   encoded string → decodeBuffer → brotliDecompress → read tag byte → route
+ * ```
+ */
+import type { Encoding } from "../types.js";
+/** Tag byte for UTF-8 text payloads. */
+export declare const TAG_TEXT = 1;
+/** Tag byte for folder archive payloads. */
+export declare const TAG_FOLDER = 2;
+/**
+ * Prepend a 1-byte type tag to raw payload bytes.
+ *
+ * @param tag - {@link TAG_TEXT} or {@link TAG_FOLDER}.
+ * @param data - Uncompressed payload body.
+ */
+export declare function wrapPayload(tag: number, data: Buffer): Buffer;
+/**
+ * Decode and decompress an encoded string, returning the tag and body.
+ *
+ * Low-level entry point used by both `decompress()` and `decompressToPath()`.
+ */
+export declare function decompressPayload(encoded: string, encoding: Encoding, password?: string): {
+    tag: number;
+    data: Buffer;
+};
+/**
+ * Compress, tag, and encode a raw buffer in one step.
+ *
+ * Shared helper for text and folder compression paths.
+ */
+export declare function compressTaggedPayload(tag: number, data: Buffer, encoding: Encoding, password?: string): string;
+//# sourceMappingURL=tags.d.ts.map

package/dist/payload/tags.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tags.d.ts","sourceRoot":"","sources":["../../src/payload/tags.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAMH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AAE3C,wCAAwC;AACxC,eAAO,MAAM,QAAQ,IAAO,CAAA;AAE5B,4CAA4C;AAC5C,eAAO,MAAM,UAAU,IAAO,CAAA;AAE9B;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAE7D;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,QAAQ,EAClB,QAAQ,CAAC,EAAE,MAAM,GAChB;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAU/B;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,EACZ,QAAQ,EAAE,QAAQ,EAClB,QAAQ,CAAC,EAAE,MAAM,GAChB,MAAM,CAMR"}

package/dist/payload/tags.js

@@ -0,0 +1,78 @@
+/**
+ * @module payload/tags
+ *
+ * Payload tagging — discriminated union over compressed blobs.
+ *
+ * After Brotli decompression the first byte tells the consumer what kind
+ * of payload follows. This is a lightweight **type tag** pattern (similar
+ * to MIME types or protobuf field numbers) that lets a single encoded
+ * string represent either UTF-8 text or a folder archive without external
+ * metadata.
+ *
+ * ## On-the-wire layout
+ *
+ * ```
+ *   [tag: u8][payload bytes…]
+ *        │         │
+ *        │         └── Brotli-compressed body (text UTF-8 or archive binary)
+ *        └── TAG_TEXT (0x01) or TAG_FOLDER (0x02)
+ * ```
+ *
+ * ## Full pipeline (compress)
+ *
+ * ```
+ *   raw data → wrapPayload(tag, data) → brotliCompress → encodeBuffer
+ * ```
+ *
+ * ## Full pipeline (decompress)
+ *
+ * ```
+ *   encoded string → decodeBuffer → brotliDecompress → read tag byte → route
+ * ```
+ */
+import { brotliDecompressSync } from "node:zlib";
+import { brotliCompress } from "../compression/brotli.js";
+import { decryptBuffer, encryptBuffer, isEncrypted } from "../crypto/password.js";
+import { decodeBuffer, encodeBuffer } from "../encoding/index.js";
+/** Tag byte for UTF-8 text payloads. */
+export const TAG_TEXT = 0x01;
+/** Tag byte for folder archive payloads. */
+export const TAG_FOLDER = 0x02;
+/**
+ * Prepend a 1-byte type tag to raw payload bytes.
+ *
+ * @param tag - {@link TAG_TEXT} or {@link TAG_FOLDER}.
+ * @param data - Uncompressed payload body.
+ */
+export function wrapPayload(tag, data) {
+    return Buffer.concat([Buffer.from([tag]), data]);
+}
+/**
+ * Decode and decompress an encoded string, returning the tag and body.
+ *
+ * Low-level entry point used by both `decompress()` and `decompressToPath()`.
+ */
+export function decompressPayload(encoded, encoding, password) {
+    let decoded = decodeBuffer(encoded, encoding);
+    if (isEncrypted(decoded)) {
+        if (!password) {
+            throw new Error("This payload is password-protected. Pass -p/--password to decompress.");
+        }
+        decoded = decryptBuffer(decoded, password);
+    }
+    const raw = brotliDecompressSync(decoded);
+    return { tag: raw[0], data: raw.subarray(1) };
+}
+/**
+ * Compress, tag, and encode a raw buffer in one step.
+ *
+ * Shared helper for text and folder compression paths.
+ */
+export function compressTaggedPayload(tag, data, encoding, password) {
+    let compressed = brotliCompress(wrapPayload(tag, data));
+    if (password) {
+        compressed = encryptBuffer(compressed, password);
+    }
+    return encodeBuffer(compressed, encoding);
+}
+//# sourceMappingURL=tags.js.map

package/dist/payload/tags.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tags.js","sourceRoot":"","sources":["../../src/payload/tags.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,WAAW,CAAA;AAChD,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAA;AACzD,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAA;AACjF,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAA;AAGjE,wCAAwC;AACxC,MAAM,CAAC,MAAM,QAAQ,GAAG,IAAI,CAAA;AAE5B,4CAA4C;AAC5C,MAAM,CAAC,MAAM,UAAU,GAAG,IAAI,CAAA;AAE9B;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,GAAW,EAAE,IAAY;IACnD,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAA;AAClD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAC/B,OAAe,EACf,QAAkB,EAClB,QAAiB;IAEjB,IAAI,OAAO,GAAG,YAAY,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;IAC7C,IAAI,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC;QACzB,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,uEAAuE,CAAC,CAAA;QAC1F,CAAC;QACD,OAAO,GAAG,aAAa,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;IAC5C,CAAC;IACD,MAAM,GAAG,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAA;IACzC,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAA;AAC/C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CACnC,GAAW,EACX,IAAY,EACZ,QAAkB,EAClB,QAAiB;IAEjB,IAAI,UAAU,GAAG,cAAc,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAA;IACvD,IAAI,QAAQ,EAAE,CAAC;QACb,UAAU,GAAG,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAA;IAClD,CAAC;IACD,OAAO,YAAY,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAA;AAC3C,CAAC"}

package/dist/split/parts.d.ts

@@ -0,0 +1,130 @@
+/**
+ * @module split/parts
+ *
+ * Split-file I/O for oversized compressed strings.
+ *
+ * Chat platforms and some editors impose character limits (~30 000–50 000).
+ * This module splits a long encoded string into numbered part files and
+ * reassembles them on read.
+ *
+ * ## v2 split format
+ *
+ * Each logical part is prefixed with a 12-byte header so order is encoded in
+ * file content, not filenames:
+ *
+ * ```
+ *   [magic: "TCP\x02"][partIndex: u32le][totalParts: u32le][payload…]
+ * ```
+ *
+ * Every part carries `totalParts`, so any single valid part reveals how many
+ * logical parts exist. A physical file may contain one or more consecutive
+ * parts. Parts can be read in any file order, and adjacent part files can be
+ * merged into fewer files.
+ *
+ * ## Compress naming (unchanged)
+ *
+ * ```
+ *   output.txt  →  output.1.txt, output.2.txt, … output.12.txt
+ *   archive     →  archive.1, archive.2, …
+ * ```
+ *
+ * Zero-padding width matches the total part count so lexical sort equals
+ * numeric sort (`output.02.txt` before `output.10.txt`).
+ *
+ * ## Decompress discovery
+ *
+ * Pass **any** sibling file. All files sharing the same prefix — the basename
+ * segment before the **first** `.` — are scanned (`file.1.md`, `file.7.txt`,
+ * … → prefix `file`). Extension and the numeric segment in the filename are
+ * ignored. Files without valid split headers are skipped.
+ *
+ * ## Auto-split threshold
+ *
+ * When no explicit `-s` size is given, outputs longer than
+ * {@link AUTO_SPLIT_CHARS} are automatically split.
+ */
+/** Default character threshold for automatic output splitting. */
+export declare const AUTO_SPLIT_CHARS = 30000;
+/** Magic bytes identifying a v2 split chunk header. */
+export declare const SPLIT_MAGIC: Buffer<ArrayBuffer>;
+/** One parsed logical part from split file content. */
+export interface SplitChunk {
+    partIndex: number;
+    totalParts: number;
+    payload: string;
+}
+/**
+ * Decide whether and how to split encoded output.
+ *
+ * @param encodedLength - Total characters in the encoded string.
+ * @param explicitSplit - User-provided `-s` value, if any.
+ * @returns Chunk size, or `undefined` when no split is needed.
+ */
+export declare function resolveSplitChunkSize(encodedLength: number, explicitSplit?: number): number | undefined;
+/**
+ * Split a string into fixed-size chunks (last chunk may be shorter).
+ *
+ * @throws If `chunkSize` is not a positive integer.
+ */
+export declare function splitString(value: string, chunkSize: number): string[];
+/** Build the 12-byte v2 split chunk header. */
+export declare function createSplitChunkHeader(partIndex: number, totalParts: number): Buffer;
+/**
+ * Wrap one encoded payload chunk with a v2 split header.
+ */
+export declare function wrapSplitChunk(partIndex: number, totalParts: number, payload: string): string;
+/**
+ * Parse split chunks from a buffer when it starts with a split header.
+ *
+ * @returns `null` when the buffer is not split data or is malformed.
+ */
+export declare function tryParseSplitChunks(buf: Buffer): SplitChunk[] | null;
+/**
+ * Parse all logical parts from one file's bytes.
+ *
+ * Files without a leading split header are treated as a single unsplit payload.
+ */
+export declare function parseSplitBuffer(buf: Buffer): SplitChunk[];
+/**
+ * Reassemble logical parts into one encoded string.
+ *
+ * Uses `totalParts` from the chunk headers — any valid part reveals the full count.
+ *
+ * @throws If parts are missing, duplicated, or disagree on total count.
+ */
+export declare function assembleSplitChunks(chunks: SplitChunk[]): string;
+/**
+ * Build the filesystem path for one part of a split output.
+ *
+ * Inserts `.<paddedIndex>` before the file extension.
+ */
+export declare function formatSplitOutputPath(outputPath: string, partIndex: number, totalParts: number): string;
+/** Basename segment before the first `.` — used to group split siblings on read. */
+export declare function extractFilenamePrefix(filePath: string): string;
+/**
+ * Return the filename prefix used to discover split siblings.
+ *
+ * @deprecated Use {@link extractFilenamePrefix} instead.
+ */
+export declare function parseSplitPartPath(filePath: string): {
+    prefix: string;
+};
+/**
+ * Resolve an input path to all prefix-sibling part files in the same directory.
+ *
+ * Any sibling may be passed; discovery uses the prefix before the first `.`.
+ * Falls back to the input file alone when no `prefix.*` siblings exist.
+ */
+export declare function resolveSplitInputPaths(inputPath: string): string[];
+/**
+ * Read and concatenate all parts for a split (or single) compressed input.
+ *
+ * Scans every prefix sibling, skips files without valid split headers, and
+ * reassembles using embedded part indices and `totalParts`. When no sibling
+ * contains split headers, reads the requested path as a single unsplit file.
+ */
+export declare function readSplitInput(inputPath: string): {
+    content: string;
+    partPaths: string[];
+};
+//# sourceMappingURL=parts.d.ts.map

package/dist/split/parts.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parts.d.ts","sourceRoot":"","sources":["../../src/split/parts.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AAKH,kEAAkE;AAClE,eAAO,MAAM,gBAAgB,QAAS,CAAA;AAEtC,uDAAuD;AACvD,eAAO,MAAM,WAAW,qBAAwC,CAAA;AAIhE,uDAAuD;AACvD,MAAM,WAAW,UAAU;IACzB,SAAS,EAAE,MAAM,CAAA;IACjB,UAAU,EAAE,MAAM,CAAA;IAClB,OAAO,EAAE,MAAM,CAAA;CAChB;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CACnC,aAAa,EAAE,MAAM,EACrB,aAAa,CAAC,EAAE,MAAM,GACrB,MAAM,GAAG,SAAS,CAIpB;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,CAWtE;AAED,+CAA+C;AAC/C,wBAAgB,sBAAsB,CAAC,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAMpF;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAK7F;AA4BD;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,EAAE,GAAG,IAAI,CAQpE;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,EAAE,CAS1D;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,CAmChE;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,GACjB,MAAM,CAUR;AAED,oFAAoF;AACpF,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAM9D;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,CAEvE;AAkBD;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,CAuBlE;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG;IACjD,OAAO,EAAE,MAAM,CAAA;IACf,SAAS,EAAE,MAAM,EAAE,CAAA;CACpB,CAoBA"}

package/dist/split/parts.js

@@ -0,0 +1,290 @@
+/**
+ * @module split/parts
+ *
+ * Split-file I/O for oversized compressed strings.
+ *
+ * Chat platforms and some editors impose character limits (~30 000–50 000).
+ * This module splits a long encoded string into numbered part files and
+ * reassembles them on read.
+ *
+ * ## v2 split format
+ *
+ * Each logical part is prefixed with a 12-byte header so order is encoded in
+ * file content, not filenames:
+ *
+ * ```
+ *   [magic: "TCP\x02"][partIndex: u32le][totalParts: u32le][payload…]
+ * ```
+ *
+ * Every part carries `totalParts`, so any single valid part reveals how many
+ * logical parts exist. A physical file may contain one or more consecutive
+ * parts. Parts can be read in any file order, and adjacent part files can be
+ * merged into fewer files.
+ *
+ * ## Compress naming (unchanged)
+ *
+ * ```
+ *   output.txt  →  output.1.txt, output.2.txt, … output.12.txt
+ *   archive     →  archive.1, archive.2, …
+ * ```
+ *
+ * Zero-padding width matches the total part count so lexical sort equals
+ * numeric sort (`output.02.txt` before `output.10.txt`).
+ *
+ * ## Decompress discovery
+ *
+ * Pass **any** sibling file. All files sharing the same prefix — the basename
+ * segment before the **first** `.` — are scanned (`file.1.md`, `file.7.txt`,
+ * … → prefix `file`). Extension and the numeric segment in the filename are
+ * ignored. Files without valid split headers are skipped.
+ *
+ * ## Auto-split threshold
+ *
+ * When no explicit `-s` size is given, outputs longer than
+ * {@link AUTO_SPLIT_CHARS} are automatically split.
+ */
+import { existsSync, readdirSync, readFileSync, statSync } from "node:fs";
+import { dirname, join } from "node:path";
+/** Default character threshold for automatic output splitting. */
+export const AUTO_SPLIT_CHARS = 30_000;
+/** Magic bytes identifying a v2 split chunk header. */
+export const SPLIT_MAGIC = Buffer.from([0x54, 0x43, 0x50, 0x02]);
+const SPLIT_HEADER_SIZE = 12;
+/**
+ * Decide whether and how to split encoded output.
+ *
+ * @param encodedLength - Total characters in the encoded string.
+ * @param explicitSplit - User-provided `-s` value, if any.
+ * @returns Chunk size, or `undefined` when no split is needed.
+ */
+export function resolveSplitChunkSize(encodedLength, explicitSplit) {
+    if (explicitSplit !== undefined)
+        return explicitSplit;
+    if (encodedLength > AUTO_SPLIT_CHARS)
+        return AUTO_SPLIT_CHARS;
+    return undefined;
+}
+/**
+ * Split a string into fixed-size chunks (last chunk may be shorter).
+ *
+ * @throws If `chunkSize` is not a positive integer.
+ */
+export function splitString(value, chunkSize) {
+    if (!Number.isInteger(chunkSize) || chunkSize < 1) {
+        throw new Error(`Split size must be a positive integer, got ${chunkSize}.`);
+    }
+    if (value.length === 0)
+        return [""];
+    const chunks = [];
+    for (let i = 0; i < value.length; i += chunkSize) {
+        chunks.push(value.slice(i, i + chunkSize));
+    }
+    return chunks;
+}
+/** Build the 12-byte v2 split chunk header. */
+export function createSplitChunkHeader(partIndex, totalParts) {
+    const header = Buffer.alloc(SPLIT_HEADER_SIZE);
+    SPLIT_MAGIC.copy(header, 0);
+    header.writeUInt32LE(partIndex, 4);
+    header.writeUInt32LE(totalParts, 8);
+    return header;
+}
+/**
+ * Wrap one encoded payload chunk with a v2 split header.
+ */
+export function wrapSplitChunk(partIndex, totalParts, payload) {
+    return Buffer.concat([
+        createSplitChunkHeader(partIndex, totalParts),
+        Buffer.from(payload, "utf-8"),
+    ]).toString("utf-8");
+}
+function readSplitChunks(buf) {
+    const chunks = [];
+    let offset = 0;
+    while (offset < buf.length) {
+        if (buf.length - offset < SPLIT_HEADER_SIZE) {
+            throw new Error("Invalid split format: truncated chunk header.");
+        }
+        if (!buf.subarray(offset, offset + SPLIT_MAGIC.length).equals(SPLIT_MAGIC)) {
+            throw new Error("Invalid split format: unexpected data between split chunks.");
+        }
+        const partIndex = buf.readUInt32LE(offset + 4);
+        const totalParts = buf.readUInt32LE(offset + 8);
+        offset += SPLIT_HEADER_SIZE;
+        const nextMagic = buf.indexOf(SPLIT_MAGIC, offset);
+        const end = nextMagic === -1 ? buf.length : nextMagic;
+        const payload = buf.subarray(offset, end).toString("utf-8");
+        chunks.push({ partIndex, totalParts, payload });
+        offset = end;
+    }
+    return chunks;
+}
+/**
+ * Parse split chunks from a buffer when it starts with a split header.
+ *
+ * @returns `null` when the buffer is not split data or is malformed.
+ */
+export function tryParseSplitChunks(buf) {
+    if (buf.length < SPLIT_HEADER_SIZE)
+        return null;
+    if (!buf.subarray(0, SPLIT_MAGIC.length).equals(SPLIT_MAGIC))
+        return null;
+    try {
+        return readSplitChunks(buf);
+    }
+    catch {
+        return null;
+    }
+}
+/**
+ * Parse all logical parts from one file's bytes.
+ *
+ * Files without a leading split header are treated as a single unsplit payload.
+ */
+export function parseSplitBuffer(buf) {
+    if (buf.length === 0) {
+        return [{ partIndex: 1, totalParts: 1, payload: "" }];
+    }
+    const splitChunks = tryParseSplitChunks(buf);
+    if (splitChunks)
+        return splitChunks;
+    return [{ partIndex: 1, totalParts: 1, payload: buf.toString("utf-8") }];
+}
+/**
+ * Reassemble logical parts into one encoded string.
+ *
+ * Uses `totalParts` from the chunk headers — any valid part reveals the full count.
+ *
+ * @throws If parts are missing, duplicated, or disagree on total count.
+ */
+export function assembleSplitChunks(chunks) {
+    if (chunks.length === 0) {
+        throw new Error("No split chunks found.");
+    }
+    if (chunks.length === 1 && chunks[0].totalParts === 1) {
+        return chunks[0].payload;
+    }
+    const totalParts = chunks[0].totalParts;
+    const byIndex = new Map();
+    for (const chunk of chunks) {
+        if (chunk.totalParts !== totalParts) {
+            throw new Error("Split parts disagree on total part count.");
+        }
+        if (!Number.isInteger(chunk.partIndex) || chunk.partIndex < 1 || chunk.partIndex > totalParts) {
+            throw new Error(`Invalid split part index ${chunk.partIndex}.`);
+        }
+        if (byIndex.has(chunk.partIndex)) {
+            throw new Error(`Duplicate split part ${chunk.partIndex}.`);
+        }
+        byIndex.set(chunk.partIndex, chunk.payload);
+    }
+    const parts = [];
+    for (let i = 1; i <= totalParts; i++) {
+        const payload = byIndex.get(i);
+        if (payload === undefined) {
+            throw new Error(`Missing split part ${i}.`);
+        }
+        parts.push(payload);
+    }
+    return parts.join("");
+}
+/**
+ * Build the filesystem path for one part of a split output.
+ *
+ * Inserts `.<paddedIndex>` before the file extension.
+ */
+export function formatSplitOutputPath(outputPath, partIndex, totalParts) {
+    const part = String(partIndex).padStart(String(totalParts).length, "0");
+    const slash = Math.max(outputPath.lastIndexOf("/"), outputPath.lastIndexOf("\\"));
+    const dot = outputPath.lastIndexOf(".");
+    const hasExtension = dot > slash;
+    if (hasExtension) {
+        return `${outputPath.slice(0, dot)}.${part}${outputPath.slice(dot)}`;
+    }
+    return `${outputPath}.${part}`;
+}
+/** Basename segment before the first `.` — used to group split siblings on read. */
+export function extractFilenamePrefix(filePath) {
+    const slash = Math.max(filePath.lastIndexOf("/"), filePath.lastIndexOf("\\"));
+    const name = filePath.slice(slash + 1);
+    const dot = name.indexOf(".");
+    if (dot <= 0)
+        return name;
+    return name.slice(0, dot);
+}
+/**
+ * Return the filename prefix used to discover split siblings.
+ *
+ * @deprecated Use {@link extractFilenamePrefix} instead.
+ */
+export function parseSplitPartPath(filePath) {
+    return { prefix: extractFilenamePrefix(filePath) };
+}
+/** List regular files in `dir` whose names start with `prefix.`. */
+function listPrefixSiblingPaths(dir, prefix) {
+    const marker = `${prefix}.`;
+    return readdirSync(dir)
+        .filter((name) => name.startsWith(marker))
+        .map((name) => join(dir, name))
+        .filter((path) => {
+        try {
+            return statSync(path).isFile();
+        }
+        catch {
+            return false;
+        }
+    })
+        .sort();
+}
+/**
+ * Resolve an input path to all prefix-sibling part files in the same directory.
+ *
+ * Any sibling may be passed; discovery uses the prefix before the first `.`.
+ * Falls back to the input file alone when no `prefix.*` siblings exist.
+ */
+export function resolveSplitInputPaths(inputPath) {
+    if (existsSync(inputPath)) {
+        const stat = statSync(inputPath);
+        if (stat.isDirectory()) {
+            throw new Error(`"${inputPath}" is a directory, not a compressed file. Pass the compressed .txt file.`);
+        }
+        if (!stat.isFile()) {
+            throw new Error(`Cannot read "${inputPath}": not a regular file.`);
+        }
+    }
+    const dir = dirname(inputPath);
+    const prefix = extractFilenamePrefix(inputPath);
+    const siblings = listPrefixSiblingPaths(dir, prefix);
+    if (siblings.length > 0)
+        return siblings;
+    if (existsSync(inputPath) && statSync(inputPath).isFile()) {
+        return [inputPath];
+    }
+    throw new Error(`Input file not found: ${inputPath}`);
+}
+/**
+ * Read and concatenate all parts for a split (or single) compressed input.
+ *
+ * Scans every prefix sibling, skips files without valid split headers, and
+ * reassembles using embedded part indices and `totalParts`. When no sibling
+ * contains split headers, reads the requested path as a single unsplit file.
+ */
+export function readSplitInput(inputPath) {
+    const partPaths = resolveSplitInputPaths(inputPath);
+    const chunks = [];
+    for (const path of partPaths) {
+        const parsed = tryParseSplitChunks(readFileSync(path));
+        if (parsed)
+            chunks.push(...parsed);
+    }
+    if (chunks.length > 0) {
+        const content = assembleSplitChunks(chunks);
+        return { content, partPaths };
+    }
+    if (!existsSync(inputPath) || !statSync(inputPath).isFile()) {
+        throw new Error(`No valid split parts found for prefix "${extractFilenamePrefix(inputPath)}".`);
+    }
+    const content = assembleSplitChunks(parseSplitBuffer(readFileSync(inputPath)));
+    return { content, partPaths: [inputPath] };
+}
+//# sourceMappingURL=parts.js.map

package/dist/split/parts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parts.js","sourceRoot":"","sources":["../../src/split/parts.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AAEH,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAA;AACzE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAEzC,kEAAkE;AAClE,MAAM,CAAC,MAAM,gBAAgB,GAAG,MAAM,CAAA;AAEtC,uDAAuD;AACvD,MAAM,CAAC,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAA;AAEhE,MAAM,iBAAiB,GAAG,EAAE,CAAA;AAS5B;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CACnC,aAAqB,EACrB,aAAsB;IAEtB,IAAI,aAAa,KAAK,SAAS;QAAE,OAAO,aAAa,CAAA;IACrD,IAAI,aAAa,GAAG,gBAAgB;QAAE,OAAO,gBAAgB,CAAA;IAC7D,OAAO,SAAS,CAAA;AAClB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,KAAa,EAAE,SAAiB;IAC1D,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,KAAK,CAAC,8CAA8C,SAAS,GAAG,CAAC,CAAA;IAC7E,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,EAAE,CAAC,CAAA;IAEnC,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;QACjD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAA;IAC5C,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,sBAAsB,CAAC,SAAiB,EAAE,UAAkB;IAC1E,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAA;IAC9C,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;IAC3B,MAAM,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;IAClC,MAAM,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC,CAAA;IACnC,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,SAAiB,EAAE,UAAkB,EAAE,OAAe;IACnF,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,sBAAsB,CAAC,SAAS,EAAE,UAAU,CAAC;QAC7C,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC;KAC9B,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAA;AACtB,CAAC;AAED,SAAS,eAAe,CAAC,GAAW;IAClC,MAAM,MAAM,GAAiB,EAAE,CAAA;IAC/B,IAAI,MAAM,GAAG,CAAC,CAAA;IAEd,OAAO,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;QAC3B,IAAI,GAAG,CAAC,MAAM,GAAG,MAAM,GAAG,iBAAiB,EAAE,CAAC;YAC5C,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAA;QAClE,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;YAC3E,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAA;QAChF,CAAC;QAED,MAAM,SAAS,GAAG,GAAG,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAC9C,MAAM,UAAU,GAAG,GAAG,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAC/C,MAAM,IAAI,iBAAiB,CAAA;QAE3B,MAAM,SAAS,GAAG,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,MAAM,CAAC,CAAA;QAClD,MAAM,GAAG,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAA;QACrD,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC3D,MAAM,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAA;QAC/C,MAAM,GAAG,GAAG,CAAA;IACd,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,GAAW;IAC7C,IAAI,GAAG,CAAC,MAAM,GAAG,iBAAiB;QAAE,OAAO,IAAI,CAAA;IAC/C,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC;QAAE,OAAO,IAAI,CAAA;IACzE,IAAI,CAAC;QACH,OAAO,eAAe,CAAC,GAAG,CAAC,CAAA;IAC7B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAA;IACb,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAW;IAC1C,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAA;IACvD,CAAC;IAED,MAAM,WAAW,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAA;IAC5C,IAAI,WAAW;QAAE,OAAO,WAAW,CAAA;IAEnC,OAAO,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;AAC1E,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAAoB;IACtD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAA;IAC3C,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;QACtD,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAA;IAC1B,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAA;IACvC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAA;IAEzC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,UAAU,KAAK,UAAU,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAA;QAC9D,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,SAAS,GAAG,CAAC,IAAI,KAAK,CAAC,SAAS,GAAG,UAAU,EAAE,CAAC;YAC9F,MAAM,IAAI,KAAK,CAAC,4BAA4B,KAAK,CAAC,SAAS,GAAG,CAAC,CAAA;QACjE,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,wBAAwB,KAAK,CAAC,SAAS,GAAG,CAAC,CAAA;QAC7D,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,CAAA;IAC7C,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC9B,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QAC7C,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACrB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;AACvB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CACnC,UAAkB,EAClB,SAAiB,EACjB,UAAkB;IAElB,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;IACvE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAA;IACjF,MAAM,GAAG,GAAG,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;IACvC,MAAM,YAAY,GAAG,GAAG,GAAG,KAAK,CAAA;IAEhC,IAAI,YAAY,EAAE,CAAC;QACjB,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAA;IACtE,CAAC;IACD,OAAO,GAAG,UAAU,IAAI,IAAI,EAAE,CAAA;AAChC,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,qBAAqB,CAAC,QAAgB;IACpD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAA;IAC7E,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;IACtC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC7B,IAAI,GAAG,IAAI,CAAC;QAAE,OAAO,IAAI,CAAA;IACzB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,QAAgB;IACjD,OAAO,EAAE,MAAM,EAAE,qBAAqB,CAAC,QAAQ,CAAC,EAAE,CAAA;AACpD,CAAC;AAED,oEAAoE;AACpE,SAAS,sBAAsB,CAAC,GAAW,EAAE,MAAc;IACzD,MAAM,MAAM,GAAG,GAAG,MAAM,GAAG,CAAA;IAC3B,OAAO,WAAW,CAAC,GAAG,CAAC;SACpB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;SACzC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;SAC9B,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QACf,IAAI,CAAC;YACH,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAA;QAChC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC,CAAC;SACD,IAAI,EAAE,CAAA;AACX,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CAAC,SAAiB;IACtD,IAAI,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAA;QAChC,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CACb,IAAI,SAAS,yEAAyE,CACvF,CAAA;QACH,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,gBAAgB,SAAS,wBAAwB,CAAC,CAAA;QACpE,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAG,OAAO,CAAC,SAAS,CAAC,CAAA;IAC9B,MAAM,MAAM,GAAG,qBAAqB,CAAC,SAAS,CAAC,CAAA;IAC/C,MAAM,QAAQ,GAAG,sBAAsB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;IACpD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAA;IAExC,IAAI,UAAU,CAAC,SAAS,CAAC,IAAI,QAAQ,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC1D,OAAO,CAAC,SAAS,CAAC,CAAA;IACpB,CAAC;IAED,MAAM,IAAI,KAAK,CAAC,yBAAyB,SAAS,EAAE,CAAC,CAAA;AACvD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,SAAiB;IAI9C,MAAM,SAAS,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAA;IACnD,MAAM,MAAM,GAAiB,EAAE,CAAA;IAE/B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,mBAAmB,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAA;QACtD,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAA;IACpC,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAA;QAC3C,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAA;IAC/B,CAAC;IAED,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC5D,MAAM,IAAI,KAAK,CAAC,0CAA0C,qBAAqB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;IACjG,CAAC;IAED,MAAM,OAAO,GAAG,mBAAmB,CAAC,gBAAgB,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;IAC9E,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,SAAS,CAAC,EAAE,CAAA;AAC5C,CAAC"}

package/dist/streaming/folder.d.ts

@@ -0,0 +1,49 @@
+/**
+ * @module streaming/folder
+ *
+ * Memory-efficient folder compression pipeline.
+ *
+ * Large directory trees may exceed available RAM if every file is loaded
+ * into a single buffer. This module streams each stage to disk:
+ *
+ * ```
+ *   walk tree → temp archive file
+ *            → stream Brotli → temp compressed file
+ *            → stream encode  → output .txt (possibly split)
+ * ```
+ *
+ * ## Pattern: staged pipeline with temp files
+ *
+ * Each stage reads from the previous stage's output file and writes to
+ * the next, keeping peak memory bounded by chunk buffer sizes rather than
+ * total archive size.
+ *
+ * ## Chunk sizes
+ *
+ * - `COPY_CHUNK` (1 MiB) — file content copied into the archive.
+ * - `ENCODE_READ_CHUNK` (3 MiB) — binary read buffer for Base64 streaming.
+ *   Base64 encoding is applied per-chunk for `encoding === 64`; Z85 requires
+ *   the full padded buffer and is loaded once (trade-off for correctness).
+ */
+import type { Encoding } from "../types.js";
+/** Statistics collected while building the archive. */
+interface ArchiveStats {
+    fileCount: number;
+    dirCount: number;
+    originalBytes: number;
+    archiveBytes: number;
+}
+/** Result of {@link compressFolderToPath}. */
+export interface CompressFolderToPathResult extends ArchiveStats {
+    outputPaths: string[];
+    compressedBytes: number;
+    splitChunkSize?: number;
+}
+/**
+ * Compress a folder to encoded text file(s) using the streaming pipeline.
+ *
+ * Creates a temporary working directory that is always cleaned up in `finally`.
+ */
+export declare function compressFolderToPath(dirPath: string, outputPath: string, encoding?: Encoding, split?: number, password?: string): Promise<CompressFolderToPathResult>;
+export {};
+//# sourceMappingURL=folder.d.ts.map

package/dist/streaming/folder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"folder.d.ts","sourceRoot":"","sources":["../../src/streaming/folder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAgCH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AAQ3C,uDAAuD;AACvD,UAAU,YAAY;IACpB,SAAS,EAAE,MAAM,CAAA;IACjB,QAAQ,EAAE,MAAM,CAAA;IAChB,aAAa,EAAE,MAAM,CAAA;IACrB,YAAY,EAAE,MAAM,CAAA;CACrB;AAuKD,8CAA8C;AAC9C,MAAM,WAAW,0BAA2B,SAAQ,YAAY;IAC9D,WAAW,EAAE,MAAM,EAAE,CAAA;IACrB,eAAe,EAAE,MAAM,CAAA;IACvB,cAAc,CAAC,EAAE,MAAM,CAAA;CACxB;AAED;;;;GAIG;AACH,wBAAsB,oBAAoB,CACxC,OAAO,EAAE,MAAM,EACf,UAAU,EAAE,MAAM,EAClB,QAAQ,GAAE,QAAa,EACvB,KAAK,CAAC,EAAE,MAAM,EACd,QAAQ,CAAC,EAAE,MAAM,GAChB,OAAO,CAAC,0BAA0B,CAAC,CA2BrC"}