@js-ak/excel-toolbox 1.2.5 → 1.2.7

package/build/cjs/lib/zip/utils/dos-time.js

@@ -0,0 +1,50 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.dosTime = dosTime;
+const node_buffer_1 = require("node:buffer");
+const to_bytes_js_1 = require("./to-bytes.js");
+/**
+ * Converts a JavaScript Date object to a 4-byte Buffer in MS-DOS date/time format
+ * as specified in the ZIP file format specification (PKZIP APPNOTE.TXT).
+ *
+ * The MS-DOS date/time format packs both date and time into 4 bytes (32 bits) with
+ * the following bit layout:
+ *
+ * Time portion (2 bytes/16 bits):
+ * - Bits 00-04: Seconds divided by 2 (0-29, representing 0-58 seconds)
+ * - Bits 05-10: Minutes (0-59)
+ * - Bits 11-15: Hours (0-23)
+ *
+ * Date portion (2 bytes/16 bits):
+ * - Bits 00-04: Day (1-31)
+ * - Bits 05-08: Month (1-12)
+ * - Bits 09-15: Year offset from 1980 (0-127, representing 1980-2107)
+ *
+ * @param {Date} date - The JavaScript Date object to convert
+ * @returns {Buffer} - 4-byte Buffer containing:
+ *                    - Bytes 0-1: DOS time (hours, minutes, seconds/2)
+ *                    - Bytes 2-3: DOS date (year-1980, month, day)
+ * @throws {RangeError} - If the date is before 1980 or after 2107
+ */
+function dosTime(date) {
+    // Pack time components into 2 bytes (16 bits):
+    // - Hours (5 bits) shifted left 11 positions (bits 11-15)
+    // - Minutes (6 bits) shifted left 5 positions (bits 5-10)
+    // - Seconds/2 (5 bits) in least significant bits (bits 0-4)
+    const time = (date.getHours() << 11) | // Hours occupy bits 11-15
+        (date.getMinutes() << 5) | // Minutes occupy bits 5-10
+        (Math.floor(date.getSeconds() / 2)); // Seconds/2 occupy bits 0-4
+    // Pack date components into 2 bytes (16 bits):
+    // - (Year-1980) (7 bits) shifted left 9 positions (bits 9-15)
+    // - Month (4 bits) shifted left 5 positions (bits 5-8)
+    // - Day (5 bits) in least significant bits (bits 0-4)
+    const day = ((date.getFullYear() - 1980) << 9) | // Years since 1980 (bits 9-15)
+        ((date.getMonth() + 1) << 5) | // Month 1-12 (bits 5-8)
+        date.getDate(); // Day 1-31 (bits 0-4)
+    // Combine both 2-byte values into a single 4-byte Buffer
+    // Note: Using little-endian byte order for each 2-byte segment
+    return node_buffer_1.Buffer.from([
+        ...(0, to_bytes_js_1.toBytes)(time, 2), // Convert time to 2 bytes (LSB first)
+        ...(0, to_bytes_js_1.toBytes)(day, 2), // Convert date to 2 bytes (LSB first)
+    ]);
+}

package/build/cjs/lib/zip/utils/find-data-descriptor.js

@@ -0,0 +1,29 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.findDataDescriptor = findDataDescriptor;
+/**
+ * Finds a Data Descriptor in a ZIP archive buffer.
+ *
+ * The Data Descriptor is an optional 16-byte structure that appears at the end of a file's compressed data.
+ * It contains the compressed size of the file, and must be used when the Local File Header does not contain this information.
+ *
+ * @param buffer - The buffer containing the ZIP archive data.
+ * @param start - The starting offset in the buffer to search for the Data Descriptor.
+ * @returns - An object with `offset` and `compressedSize` properties.
+ * @throws {Error} - If the Data Descriptor is not found.
+ */
+function findDataDescriptor(buffer, start) {
+    const DATA_DESCRIPTOR_SIGNATURE = 0x08074b50;
+    const DATA_DESCRIPTOR_TOTAL_LENGTH = 16;
+    const COMPRESSED_SIZE_OFFSET_FROM_SIGNATURE = 8;
+    for (let i = start; i <= buffer.length - DATA_DESCRIPTOR_TOTAL_LENGTH; i++) {
+        if (buffer.readUInt32LE(i) === DATA_DESCRIPTOR_SIGNATURE) {
+            const compressedSize = buffer.readUInt32LE(i + COMPRESSED_SIZE_OFFSET_FROM_SIGNATURE);
+            return {
+                compressedSize,
+                offset: i,
+            };
+        }
+    }
+    throw new Error("Data Descriptor not found");
+}

package/build/cjs/lib/zip/utils/index.js

@@ -0,0 +1,20 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./crc-32.js"), exports);
+__exportStar(require("./dos-time.js"), exports);
+__exportStar(require("./find-data-descriptor.js"), exports);
+__exportStar(require("./to-bytes.js"), exports);

package/build/cjs/lib/zip/utils/to-bytes.js

@@ -0,0 +1,37 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.toBytes = toBytes;
+const node_buffer_1 = require("node:buffer");
+/**
+ * Converts a numeric value into a fixed-length Buffer representation,
+ * storing the value in little-endian format with right-padding of zeros.
+ *
+ * This is particularly useful for binary protocols or file formats that
+ * require fixed-width numeric fields.
+ *
+ * @param {number} value - The numeric value to convert to bytes.
+ *        Note: JavaScript numbers are IEEE 754 doubles, but only the
+ *        integer portion will be used (up to 53-bit precision).
+ * @param {number} len - The desired length of the output Buffer in bytes.
+ *        Must be a positive integer.
+ * @returns {Buffer} - A new Buffer of exactly `len` bytes containing:
+ *        1. The value's bytes in little-endian order (least significant byte first)
+ *        2. Zero padding in any remaining higher-order bytes
+ * @throws {RangeError} - If the value requires more bytes than `len` to represent
+ *        (though this is currently not explicitly checked)
+ */
+function toBytes(value, len) {
+    // Allocate a new Buffer of the requested length, automatically zero-filled
+    const buf = node_buffer_1.Buffer.alloc(len);
+    // Process each byte position from least significant to most significant
+    for (let i = 0; i < len; i++) {
+        // Store the least significant byte of the current value
+        buf[i] = value & 0xff; // Mask to get bottom 8 bits
+        // Right-shift the value by 8 bits to process the next byte
+        // Note: This uses unsigned right shift (>>> would be signed)
+        value >>= 8;
+        // If the loop completes with value != 0, we've overflowed the buffer length,
+        // but this isn't currently checked/handled
+    }
+    return buf;
+}

package/build/esm/lib/merge-sheets-to-base-file-process.js

@@ -22,7 +22,7 @@ export function mergeSheetsToBaseFileProcess(data) {
     if (!baseFiles[basePath]) {
         throw new Error(`Base file does not contain ${basePath}`);
     }
-    const { lastRowNumber, mergeCells: baseMergeCells, rows: baseRows, } = Xml.extractRowsFromSheet(baseFiles[basePath]);
+    const { lastRowNumber, mergeCells: baseMergeCells, rows: baseRows, xml, } = Xml.extractRowsFromSheet(baseFiles[basePath]);
     const allRows = [...baseRows];
     const allMergeCells = [...baseMergeCells];
     let currentRowOffset = lastRowNumber + gap;
@@ -48,19 +48,19 @@ export function mergeSheetsToBaseFileProcess(data) {
             currentRowOffset += Utils.getMaxRowNumber(rows) + gap;
         }
     }
-    const mergedXml = Xml.buildMergedSheet(baseFiles[basePath], allRows, allMergeCells);
+    const mergedXml = Xml.buildMergedSheet(xml, allRows, allMergeCells);
     baseFiles[basePath] = mergedXml;
     for (const sheetIndex of sheetsToRemove) {
         const sheetPath = `xl/worksheets/sheet${sheetIndex}.xml`;
         delete baseFiles[sheetPath];
         if (baseFiles["xl/workbook.xml"]) {
-            baseFiles["xl/workbook.xml"] = Utils.removeSheetFromWorkbook(baseFiles["xl/workbook.xml"], sheetIndex);
+            baseFiles["xl/workbook.xml"] = Buffer.from(Utils.removeSheetFromWorkbook(baseFiles["xl/workbook.xml"].toString(), sheetIndex));
         }
         if (baseFiles["xl/_rels/workbook.xml.rels"]) {
-            baseFiles["xl/_rels/workbook.xml.rels"] = Utils.removeSheetFromRels(baseFiles["xl/_rels/workbook.xml.rels"], sheetIndex);
+            baseFiles["xl/_rels/workbook.xml.rels"] = Buffer.from(Utils.removeSheetFromRels(baseFiles["xl/_rels/workbook.xml.rels"].toString(), sheetIndex));
         }
         if (baseFiles["[Content_Types].xml"]) {
-            baseFiles["[Content_Types].xml"] = Utils.removeSheetFromContentTypes(baseFiles["[Content_Types].xml"], sheetIndex);
+            baseFiles["[Content_Types].xml"] = Buffer.from(Utils.removeSheetFromContentTypes(baseFiles["[Content_Types].xml"].toString(), sheetIndex));
         }
     }
     for (const sheetName of sheetNamesToRemove) {

package/build/esm/lib/utils/remove-sheet-by-name.js

@@ -5,8 +5,8 @@
  * @returns {void}
  */
 export function removeSheetByName(files, sheetName) {
-    const workbookXml = files["xl/workbook.xml"];
-    const relsXml = files["xl/_rels/workbook.xml.rels"];
+    const workbookXml = files["xl/workbook.xml"]?.toString();
+    const relsXml = files["xl/_rels/workbook.xml.rels"]?.toString();
     if (!workbookXml || !relsXml) {
         return;
     }
@@ -31,11 +31,13 @@ export function removeSheetByName(files, sheetName) {
         return;
     }
     const targetPath = `xl/${targetMatch[1]}`.replace(/\\/g, "/");
-    delete files[targetPath];
-    files["xl/workbook.xml"] = workbookXml.replace(sheetTag, "");
-    files["xl/_rels/workbook.xml.rels"] = relsXml.replace(relTag, "");
-    const contentTypes = files["[Content_Types].xml"];
+    if (targetPath) {
+        delete files[targetPath];
+    }
+    files["xl/workbook.xml"] = Buffer.from(workbookXml.replace(sheetTag, ""));
+    files["xl/_rels/workbook.xml.rels"] = Buffer.from(relsXml.replace(relTag, ""));
+    const contentTypes = files["[Content_Types].xml"]?.toString();
     if (contentTypes) {
-        files["[Content_Types].xml"] = contentTypes.replace(new RegExp(`<Override[^>]+PartName=["']/${targetPath}["'][^>]*/>`, "g"), "");
+        files["[Content_Types].xml"] = Buffer.from(contentTypes.replace(new RegExp(`<Override[^>]+PartName=["']/${targetPath}["'][^>]*/>`, "g"), ""));
     }
 }

package/build/esm/lib/xml/build-merged-sheet.js

@@ -9,7 +9,7 @@
  * @param {string[]} mergedRows - Array of XML strings representing each row in the merged sheet.
  * @param {Object[]} [mergeCells] - Optional array of merge cell definitions.
  *        Each object should have a 'ref' property specifying the merge range (e.g., "A1:B2").
- * @returns {string} - The reconstructed XML string with merged content.
+ * @returns {Buffer} - The reconstructed XML string with merged content.
  */
 export function buildMergedSheet(originalXml, mergedRows, mergeCells = []) {
     // Remove any existing <mergeCells> section from the XML
@@ -24,5 +24,5 @@ export function buildMergedSheet(originalXml, mergedRows, mergeCells = []) {
         // Insert <mergeCells> after </sheetData> and before the next XML tag
         xmlData = xmlData.replace(/(<\/sheetData>)(\s*<)/, `$1\n${mergeCellsXml}\n$2`);
     }
-    return xmlData;
+    return Buffer.from(xmlData);
 }

package/build/esm/lib/xml/extract-rows-from-sheet.js

@@ -57,5 +57,6 @@ export function extractRowsFromSheet(sheet) {
         lastRowNumber,
         mergeCells,
         rows,
+        xml,
     };
 }

package/build/esm/lib/zip/create-sync.js

@@ -1,6 +1,6 @@
 import { Buffer } from "node:buffer";
 import { deflateRawSync } from "node:zlib";
-import { crc32, dosTime, toBytes } from "./utils.js";
+import { crc32, dosTime, toBytes } from "./utils/index.js";
 import { CENTRAL_DIR_HEADER_SIG, END_OF_CENTRAL_DIR_SIG, LOCAL_FILE_HEADER_SIG, } from "./constants.js";
 /**
  * Creates a ZIP archive from a collection of files.

package/build/esm/lib/zip/create.js

@@ -2,7 +2,7 @@ import { Buffer } from "node:buffer";
 import util from "node:util";
 import zlib from "node:zlib";
 const deflateRaw = util.promisify(zlib.deflateRaw);
-import { crc32, dosTime, toBytes } from "./utils.js";
+import { crc32, dosTime, toBytes } from "./utils/index.js";
 import { CENTRAL_DIR_HEADER_SIG, END_OF_CENTRAL_DIR_SIG, LOCAL_FILE_HEADER_SIG, } from "./constants.js";
 /**
  * Creates a ZIP archive from a collection of files.

package/build/esm/lib/zip/read-sync.js

@@ -1,45 +1,58 @@
-import { inflateRawSync } from "node:zlib";
+import zlib from "node:zlib";
+import * as Utils from "./utils/index.js";
 /**
  * Parses a ZIP archive from a buffer and extracts the files within.
  *
  * @param {Buffer} buffer - The buffer containing the ZIP archive data.
- * @returns {Object.<string, string>} - An object where keys are file names and values are file contents.
+ * @returns {Object.<string, Buffer>} - An object where keys are file names and values are file contents as Buffers.
  * @throws {Error} - Throws an error if an unsupported compression method is encountered or if decompression fails.
  */
 export function readSync(buffer) {
     const files = {};
     let offset = 0;
-    while (offset + 4 <= buffer.length) {
+    while (offset + 30 <= buffer.length) {
         const signature = buffer.readUInt32LE(offset);
         if (signature !== 0x04034b50)
-            break;
+            break; // not a local file header
+        const generalPurposeBitFlag = buffer.readUInt16LE(offset + 6);
         const compressionMethod = buffer.readUInt16LE(offset + 8);
         const fileNameLength = buffer.readUInt16LE(offset + 26);
-        const extraLength = buffer.readUInt16LE(offset + 28);
+        const extraFieldLength = buffer.readUInt16LE(offset + 28);
         const fileNameStart = offset + 30;
         const fileNameEnd = fileNameStart + fileNameLength;
         const fileName = buffer.subarray(fileNameStart, fileNameEnd).toString();
-        const dataStart = fileNameEnd + extraLength;
-        let nextOffset = dataStart;
-        while (nextOffset + 4 <= buffer.length) {
-            if (buffer.readUInt32LE(nextOffset) === 0x04034b50)
-                break;
-            nextOffset++;
-        }
-        if (nextOffset + 4 > buffer.length) {
-            nextOffset = buffer.length;
-        }
-        const compressedData = buffer.subarray(dataStart, nextOffset);
-        let content = "";
+        const dataStart = fileNameEnd + extraFieldLength;
+        const useDataDescriptor = (generalPurposeBitFlag & 0x08) !== 0;
+        let compressedData;
+        let content;
         try {
-            if (compressionMethod === 0) {
-                content = compressedData.toString();
-            }
-            else if (compressionMethod === 8) {
-                content = inflateRawSync(new Uint8Array(compressedData)).toString();
+            if (useDataDescriptor) {
+                const { compressedSize, offset: ddOffset } = Utils.findDataDescriptor(buffer, dataStart);
+                compressedData = buffer.subarray(dataStart, dataStart + compressedSize);
+                if (compressionMethod === 0) {
+                    content = compressedData;
+                }
+                else if (compressionMethod === 8) {
+                    content = zlib.inflateRawSync(compressedData);
+                }
+                else {
+                    throw new Error(`Unsupported compression method ${compressionMethod}`);
+                }
+                offset = ddOffset + 16; // Skip over data descriptor
             }
             else {
-                throw new Error(`Unsupported compression method ${compressionMethod}`);
+                const compressedSize = buffer.readUInt32LE(offset + 18);
+                compressedData = buffer.subarray(dataStart, dataStart + compressedSize);
+                if (compressionMethod === 0) {
+                    content = compressedData;
+                }
+                else if (compressionMethod === 8) {
+                    content = zlib.inflateRawSync(compressedData);
+                }
+                else {
+                    throw new Error(`Unsupported compression method ${compressionMethod}`);
+                }
+                offset = dataStart + compressedSize;
             }
         }
         catch (error) {
@@ -47,7 +60,6 @@ export function readSync(buffer) {
             throw new Error(`Error unpacking file ${fileName}: ${message}`);
         }
         files[fileName] = content;
-        offset = nextOffset;
     }
     return files;
 }

package/build/esm/lib/zip/read.js

@@ -1,47 +1,60 @@
 import util from "node:util";
 import zlib from "node:zlib";
+import * as Utils from "./utils/index.js";
 const inflateRaw = util.promisify(zlib.inflateRaw);
 /**
  * Parses a ZIP archive from a buffer and extracts the files within.
  *
  * @param {Buffer} buffer - The buffer containing the ZIP archive data.
- * @returns {Object.<string, string>} - An object where keys are file names and values are file contents.
+ * @returns {Object.<string, Buffer>} - An object where keys are file names and values are file contents as Buffers.
  * @throws {Error} - Throws an error if an unsupported compression method is encountered or if decompression fails.
  */
 export async function read(buffer) {
     const files = {};
     let offset = 0;
-    while (offset + 4 <= buffer.length) {
+    while (offset + 30 <= buffer.length) {
         const signature = buffer.readUInt32LE(offset);
         if (signature !== 0x04034b50)
-            break;
+            break; // not a local file header
+        const generalPurposeBitFlag = buffer.readUInt16LE(offset + 6);
         const compressionMethod = buffer.readUInt16LE(offset + 8);
         const fileNameLength = buffer.readUInt16LE(offset + 26);
-        const extraLength = buffer.readUInt16LE(offset + 28);
+        const extraFieldLength = buffer.readUInt16LE(offset + 28);
         const fileNameStart = offset + 30;
         const fileNameEnd = fileNameStart + fileNameLength;
         const fileName = buffer.subarray(fileNameStart, fileNameEnd).toString();
-        const dataStart = fileNameEnd + extraLength;
-        let nextOffset = dataStart;
-        while (nextOffset + 4 <= buffer.length) {
-            if (buffer.readUInt32LE(nextOffset) === 0x04034b50)
-                break;
-            nextOffset++;
-        }
-        if (nextOffset + 4 > buffer.length) {
-            nextOffset = buffer.length;
-        }
-        const compressedData = buffer.subarray(dataStart, nextOffset);
-        let content = "";
+        const dataStart = fileNameEnd + extraFieldLength;
+        const useDataDescriptor = (generalPurposeBitFlag & 0x08) !== 0;
+        let compressedData;
+        let content;
         try {
-            if (compressionMethod === 0) {
-                content = compressedData.toString();
-            }
-            else if (compressionMethod === 8) {
-                content = (await inflateRaw(new Uint8Array(compressedData))).toString();
+            if (useDataDescriptor) {
+                const { compressedSize, offset: ddOffset } = Utils.findDataDescriptor(buffer, dataStart);
+                compressedData = buffer.subarray(dataStart, dataStart + compressedSize);
+                if (compressionMethod === 0) {
+                    content = compressedData;
+                }
+                else if (compressionMethod === 8) {
+                    content = await inflateRaw(compressedData);
+                }
+                else {
+                    throw new Error(`Unsupported compression method ${compressionMethod}`);
+                }
+                offset = ddOffset + 16; // Skip over data descriptor
             }
             else {
-                throw new Error(`Unsupported compression method ${compressionMethod}`);
+                const compressedSize = buffer.readUInt32LE(offset + 18);
+                compressedData = buffer.subarray(dataStart, dataStart + compressedSize);
+                if (compressionMethod === 0) {
+                    content = compressedData;
+                }
+                else if (compressionMethod === 8) {
+                    content = await inflateRaw(compressedData);
+                }
+                else {
+                    throw new Error(`Unsupported compression method ${compressionMethod}`);
+                }
+                offset = dataStart + compressedSize;
             }
         }
         catch (error) {
@@ -49,7 +62,6 @@ export async function read(buffer) {
             throw new Error(`Error unpacking file ${fileName}: ${message}`);
         }
         files[fileName] = content;
-        offset = nextOffset;
     }
     return files;
 }

package/build/esm/lib/zip/utils/crc-32.js

@@ -0,0 +1,73 @@
+/**
+ * Precomputed CRC-32 lookup table for optimized checksum calculation.
+ * The table is generated using the standard IEEE 802.3 (Ethernet) polynomial:
+ * 0xEDB88320 (reversed representation of 0x04C11DB7).
+ *
+ * The table is immediately invoked and cached as a constant for performance,
+ * following the common implementation pattern for CRC algorithms.
+ */
+const crcTable = (() => {
+    // Create a typed array for better performance with 256 32-bit unsigned integers
+    const table = new Uint32Array(256);
+    // Generate table entries for all possible byte values (0-255)
+    for (let i = 0; i < 256; i++) {
+        let crc = i; // Initialize with current byte value
+        // Process each bit (8 times)
+        for (let j = 0; j < 8; j++) {
+            /*
+             * CRC division algorithm:
+             * 1. If LSB is set (crc & 1), XOR with polynomial
+             * 2. Right-shift by 1 (unsigned)
+             *
+             * The polynomial 0xEDB88320 is:
+             * - Bit-reversed version of 0x04C11DB7
+             * - Uses reflected input/output algorithm
+             */
+            crc = crc & 1
+                ? 0xedb88320 ^ (crc >>> 1) // XOR with polynomial if LSB is set
+                : crc >>> 1; // Just shift right if LSB is not set
+        }
+        // Store final 32-bit value (>>> 0 ensures unsigned 32-bit representation)
+        table[i] = crc >>> 0;
+    }
+    return table;
+})();
+/**
+ * Computes a CRC-32 checksum for the given Buffer using the standard IEEE 802.3 polynomial.
+ * This implementation uses a precomputed lookup table for optimal performance.
+ *
+ * The algorithm follows these characteristics:
+ * - Polynomial: 0xEDB88320 (reversed representation of 0x04C11DB7)
+ * - Initial value: 0xFFFFFFFF (inverted by ~0)
+ * - Final XOR value: 0xFFFFFFFF (achieved by inverting the result)
+ * - Input and output reflection: Yes
+ *
+ * @param {Buffer} buf - The input buffer to calculate checksum for
+ * @returns {number} - The 32-bit unsigned CRC-32 checksum (0x00000000 to 0xFFFFFFFF)
+ */
+export function crc32(buf) {
+    // Initialize CRC with all 1's (0xFFFFFFFF) using bitwise NOT
+    let crc = ~0;
+    // Process each byte in the buffer
+    for (let i = 0; i < buf.length; i++) {
+        /*
+         * CRC update algorithm steps:
+         * 1. XOR current CRC with next byte (lowest 8 bits)
+         * 2. Use result as index in precomputed table (0-255)
+         * 3. XOR the table value with right-shifted CRC (8 bits)
+         *
+         * The operation breakdown:
+         * - (crc ^ buf[i]) - XOR with next byte
+         * - & 0xff - Isolate lowest 8 bits
+         * - crc >>> 8 - Shift CRC right by 8 bits (unsigned)
+         * - ^ crcTable[...] - XOR with precomputed table value
+         */
+        crc = (crc >>> 8) ^ crcTable[(crc ^ buf[i]) & 0xff];
+    }
+    /*
+     * Final processing:
+     * 1. Invert all bits (~crc) to match standard CRC-32 output
+     * 2. Convert to unsigned 32-bit integer (>>> 0)
+     */
+    return ~crc >>> 0;
+}

package/build/esm/lib/zip/utils/dos-time.js

@@ -0,0 +1,47 @@
+import { Buffer } from "node:buffer";
+import { toBytes } from "./to-bytes.js";
+/**
+ * Converts a JavaScript Date object to a 4-byte Buffer in MS-DOS date/time format
+ * as specified in the ZIP file format specification (PKZIP APPNOTE.TXT).
+ *
+ * The MS-DOS date/time format packs both date and time into 4 bytes (32 bits) with
+ * the following bit layout:
+ *
+ * Time portion (2 bytes/16 bits):
+ * - Bits 00-04: Seconds divided by 2 (0-29, representing 0-58 seconds)
+ * - Bits 05-10: Minutes (0-59)
+ * - Bits 11-15: Hours (0-23)
+ *
+ * Date portion (2 bytes/16 bits):
+ * - Bits 00-04: Day (1-31)
+ * - Bits 05-08: Month (1-12)
+ * - Bits 09-15: Year offset from 1980 (0-127, representing 1980-2107)
+ *
+ * @param {Date} date - The JavaScript Date object to convert
+ * @returns {Buffer} - 4-byte Buffer containing:
+ *                    - Bytes 0-1: DOS time (hours, minutes, seconds/2)
+ *                    - Bytes 2-3: DOS date (year-1980, month, day)
+ * @throws {RangeError} - If the date is before 1980 or after 2107
+ */
+export function dosTime(date) {
+    // Pack time components into 2 bytes (16 bits):
+    // - Hours (5 bits) shifted left 11 positions (bits 11-15)
+    // - Minutes (6 bits) shifted left 5 positions (bits 5-10)
+    // - Seconds/2 (5 bits) in least significant bits (bits 0-4)
+    const time = (date.getHours() << 11) | // Hours occupy bits 11-15
+        (date.getMinutes() << 5) | // Minutes occupy bits 5-10
+        (Math.floor(date.getSeconds() / 2)); // Seconds/2 occupy bits 0-4
+    // Pack date components into 2 bytes (16 bits):
+    // - (Year-1980) (7 bits) shifted left 9 positions (bits 9-15)
+    // - Month (4 bits) shifted left 5 positions (bits 5-8)
+    // - Day (5 bits) in least significant bits (bits 0-4)
+    const day = ((date.getFullYear() - 1980) << 9) | // Years since 1980 (bits 9-15)
+        ((date.getMonth() + 1) << 5) | // Month 1-12 (bits 5-8)
+        date.getDate(); // Day 1-31 (bits 0-4)
+    // Combine both 2-byte values into a single 4-byte Buffer
+    // Note: Using little-endian byte order for each 2-byte segment
+    return Buffer.from([
+        ...toBytes(time, 2), // Convert time to 2 bytes (LSB first)
+        ...toBytes(day, 2), // Convert date to 2 bytes (LSB first)
+    ]);
+}

package/build/esm/lib/zip/utils/find-data-descriptor.js

@@ -0,0 +1,26 @@
+/**
+ * Finds a Data Descriptor in a ZIP archive buffer.
+ *
+ * The Data Descriptor is an optional 16-byte structure that appears at the end of a file's compressed data.
+ * It contains the compressed size of the file, and must be used when the Local File Header does not contain this information.
+ *
+ * @param buffer - The buffer containing the ZIP archive data.
+ * @param start - The starting offset in the buffer to search for the Data Descriptor.
+ * @returns - An object with `offset` and `compressedSize` properties.
+ * @throws {Error} - If the Data Descriptor is not found.
+ */
+export function findDataDescriptor(buffer, start) {
+    const DATA_DESCRIPTOR_SIGNATURE = 0x08074b50;
+    const DATA_DESCRIPTOR_TOTAL_LENGTH = 16;
+    const COMPRESSED_SIZE_OFFSET_FROM_SIGNATURE = 8;
+    for (let i = start; i <= buffer.length - DATA_DESCRIPTOR_TOTAL_LENGTH; i++) {
+        if (buffer.readUInt32LE(i) === DATA_DESCRIPTOR_SIGNATURE) {
+            const compressedSize = buffer.readUInt32LE(i + COMPRESSED_SIZE_OFFSET_FROM_SIGNATURE);
+            return {
+                compressedSize,
+                offset: i,
+            };
+        }
+    }
+    throw new Error("Data Descriptor not found");
+}

package/build/esm/lib/zip/utils/index.js

@@ -0,0 +1,4 @@
+export * from "./crc-32.js";
+export * from "./dos-time.js";
+export * from "./find-data-descriptor.js";
+export * from "./to-bytes.js";

package/build/esm/lib/zip/utils/to-bytes.js

@@ -0,0 +1,34 @@
+import { Buffer } from "node:buffer";
+/**
+ * Converts a numeric value into a fixed-length Buffer representation,
+ * storing the value in little-endian format with right-padding of zeros.
+ *
+ * This is particularly useful for binary protocols or file formats that
+ * require fixed-width numeric fields.
+ *
+ * @param {number} value - The numeric value to convert to bytes.
+ *        Note: JavaScript numbers are IEEE 754 doubles, but only the
+ *        integer portion will be used (up to 53-bit precision).
+ * @param {number} len - The desired length of the output Buffer in bytes.
+ *        Must be a positive integer.
+ * @returns {Buffer} - A new Buffer of exactly `len` bytes containing:
+ *        1. The value's bytes in little-endian order (least significant byte first)
+ *        2. Zero padding in any remaining higher-order bytes
+ * @throws {RangeError} - If the value requires more bytes than `len` to represent
+ *        (though this is currently not explicitly checked)
+ */
+export function toBytes(value, len) {
+    // Allocate a new Buffer of the requested length, automatically zero-filled
+    const buf = Buffer.alloc(len);
+    // Process each byte position from least significant to most significant
+    for (let i = 0; i < len; i++) {
+        // Store the least significant byte of the current value
+        buf[i] = value & 0xff; // Mask to get bottom 8 bits
+        // Right-shift the value by 8 bits to process the next byte
+        // Note: This uses unsigned right shift (>>> would be signed)
+        value >>= 8;
+        // If the loop completes with value != 0, we've overflowed the buffer length,
+        // but this isn't currently checked/handled
+    }
+    return buf;
+}

package/build/types/lib/merge-sheets-to-base-file-process.d.ts

@@ -16,10 +16,10 @@
  */
 export declare function mergeSheetsToBaseFileProcess(data: {
     additions: {
-        files: Record<string, string>;
+        files: Record<string, Buffer>;
         sheetIndexes: number[];
     }[];
-    baseFiles: Record<string, string>;
+    baseFiles: Record<string, Buffer>;
     baseSheetIndex: number;
     gap: number;
     sheetNamesToRemove: string[];

package/build/types/lib/utils/remove-sheet-by-name.d.ts

@@ -4,4 +4,4 @@
  * @param {string} sheetName - The name of the sheet to remove.
  * @returns {void}
  */
-export declare function removeSheetByName(files: Record<string, string>, sheetName: string): void;
+export declare function removeSheetByName(files: Record<string, Buffer>, sheetName: string): void;