@sythos/js_barcode_universal 1.5.5 → 1.5.7

package/typings/compactpdf417/tables.d.ts

@@ -0,0 +1,84 @@
+/*!
+ * Sythos Barcode Suite
+ *
+ * MIT License
+ *
+ * Copyright (c) 2026 Sythos
+ *
+ * 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.
+ *
+ * SPDX-FileCopyrightText: 2026 Sythos (https://www.sythos.net)
+ * SPDX-License-Identifier: MIT
+ *
+ * Original work. No code from any other barcode implementation.
+ */
+/** PDF417 start pattern, in module widths. */
+export declare const COMPACT_PDF417_START = "81111113";
+/** Binary module representation of the start pattern. */
+export declare const COMPACT_PDF417_START_BITS = "11111111010101000";
+/** Compact PDF417's reduced stop is one dark module. */
+export declare const COMPACT_PDF417_STOP_MODULES = 1;
+/** Minimum/maximum number of rows and data columns. */
+export declare const COMPACT_PDF417_LIMITS: Readonly<{
+    minRows: 3;
+    maxRows: 90;
+    minColumns: 1;
+    maxColumns: 30;
+    maxCodewords: 928;
+}>;
+/**
+ * Return the printed width in modules for a compact symbol.
+ *
+ * 17 start + 17 left indicator + 17 per codeword column + 1 reduced stop.
+ * @param {number} columns
+ */
+export declare function compactPdf417Width(columns: number): number;
+/**
+ * Validate a compact matrix geometry and return its dimensions.
+ *
+ * @param {number} width
+ * @param {number} height
+ * @param {number} rowHeight
+ */
+export declare function compactPdf417Geometry(width: number, height: number, rowHeight?: number): {
+    rows: number;
+    columns: number;
+    rowHeight: number;
+    width: number;
+    height: number;
+};
+/**
+ * Validate encoder dimensions before codeword packing.
+ * @param {object} options
+ */
+export declare function validateCompactPdf417Options(options?: object): any;
+/**
+ * The row indicator values used by ordinary PDF417 are retained unchanged.
+ * Compact symbols omit only the right indicator, so the left indicator still
+ * carries the row group, row count, error-correction level and column count.
+ */
+export declare function compactPdf417Indicators(row: any, rows: any, columns: any, level: any): number;
+/**
+ * Return all standard ECC levels which agree with the observed left
+ * indicators. This is kept as a table helper so decoder and tests share the
+ * same compact-layout rule.
+ */
+export declare function compactPdf417MatchingLevels(leftIndicators: any, rows: any, columns: any): number[];
+/** Validate representative layout invariants. */
+export declare function validateCompactPdf417Tables(): string[];

package/typings/core/bit-buffer.d.ts

@@ -0,0 +1,78 @@
+/*!
+ * Sythos Barcode Suite
+ *
+ * MIT License
+ *
+ * Copyright (c) 2026 Sythos
+ *
+ * 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.
+ *
+ * SPDX-FileCopyrightText: 2026 Sythos (https://www.sythos.net)
+ * SPDX-License-Identifier: MIT
+ *
+ * Original work. No code from any other barcode implementation.
+ */
+/** Growable MSB-first bit writer. */
+export declare class BitWriter {
+    /** @type {number[]} Packed bytes; the last one may be partially filled. */
+    bytes: number[];
+    bitLength: number;
+    constructor();
+    /** @returns {number} Bits written so far. */
+    get length(): number;
+    /**
+     * Append the low `count` bits of `value`, most significant first.
+     *
+     * @param {number} value
+     * @param {number} count
+     */
+    put(value: number, count: number): void;
+    /** @param {boolean} bit */
+    putBit(bit: boolean): void;
+    /** @param {ArrayLike<number>} data */
+    putBytes(data: ArrayLike<number>): void;
+    /** Pad with zero bits until the length is a multiple of 8. */
+    padToByte(): void;
+    /**
+     * @returns {Uint8Array} Byte view; trailing bits of the final byte are zero.
+     */
+    toBytes(): Uint8Array;
+    /** @returns {string} Debug view, e.g. "0100 0011 0101". */
+    toString(): string;
+}
+/** MSB-first bit reader over a byte array. */
+export declare class BitReader {
+    bytes: ArrayLike<number>;
+    byteOffset: number;
+    bitOffset: number;
+    /** @param {ArrayLike<number>} bytes */
+    constructor(bytes: ArrayLike<number>);
+    /** @returns {number} Bits not yet consumed. */
+    available(): number;
+    /**
+     * Read `count` bits (1..32) as an unsigned integer, most significant first.
+     *
+     * @param {number} count
+     * @returns {number}
+     * @throws {FormatError} If the stream is exhausted.
+     */
+    read(count: number): number;
+    /** @returns {boolean} */
+    readBit(): boolean;
+}

package/typings/core/bit-matrix.d.ts

@@ -0,0 +1,129 @@
+/*!
+ * Sythos Barcode Suite
+ *
+ * MIT License
+ *
+ * Copyright (c) 2026 Sythos
+ *
+ * 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.
+ *
+ * SPDX-FileCopyrightText: 2026 Sythos (https://www.sythos.net)
+ * SPDX-License-Identifier: MIT
+ *
+ * Original work. No code from any other barcode implementation.
+ */
+/**
+ * A 2D bit grid — the common currency of this library.
+ *
+ * Every writer produces one; every reader consumes one; every renderer draws
+ * one. Keeping it as the single interchange type is what lets formats and
+ * output targets stay independent of each other.
+ *
+ * Storage is row-packed into a Uint32Array: one allocation, cache-friendly row
+ * scans, and cheap whole-row operations for the 1D readers.
+ *
+ * Convention: a set bit is a DARK module (ink). This matches how symbols are
+ * described in every specification, and renderers invert as needed.
+ *
+ * @module core/bit-matrix
+ */
+export declare class BitMatrix {
+    width: number;
+    height: number;
+    rowWords: number;
+    bits: Uint32Array<ArrayBuffer>;
+    /**
+     * @param {number} width
+     * @param {number} height
+     */
+    constructor(width: number, height?: number);
+    /**
+     * @param {number} x @param {number} y
+     * @returns {boolean} True if the module is dark.
+     */
+    get(x: number, y: number): boolean;
+    /** @param {number} x @param {number} y */
+    set(x: number, y: number): void;
+    /** @param {number} x @param {number} y */
+    unset(x: number, y: number): void;
+    /** @param {number} x @param {number} y */
+    flip(x: number, y: number): void;
+    /**
+     * @param {number} x @param {number} y @param {boolean} value
+     */
+    setValue(x: number, y: number, value: boolean): void;
+    /** Fill a rectangle. @param {number} x @param {number} y @param {number} w @param {number} h */
+    setRegion(x: number, y: number, w: number, h: number): void;
+    clear(): void;
+    /** @returns {BitMatrix} */
+    clone(): BitMatrix;
+    /**
+     * Copy row `y` into a reusable array, avoiding an allocation per row in the
+     * 1D scanning loops which run this thousands of times per image.
+     *
+     * @param {number} y
+     * @param {Uint8Array} [out]
+     * @returns {Uint8Array}
+     */
+    getRow(y: number, out?: Uint8Array): Uint8Array;
+    /**
+     * Add a uniform light border. Symbols need a quiet zone to be scannable at
+     * all, so this is applied by default when rendering.
+     *
+     * @param {number} size Modules of margin on every side.
+     * @returns {BitMatrix}
+     */
+    withMargin(size: number): BitMatrix;
+    /**
+     * Nearest-neighbour upscale. Integer factors only — a barcode resampled with
+     * interpolation stops being readable.
+     *
+     * @param {number} factor
+     * @returns {BitMatrix}
+     */
+    scale(factor: number): BitMatrix;
+    /**
+     * Bounding box of the dark modules, or null if the matrix is empty.
+     * @returns {{x: number, y: number, width: number, height: number} | null}
+     */
+    getBounds(): {
+        x: number;
+        y: number;
+        width: number;
+        height: number;
+    } | null;
+    /**
+     * Rotate 180 degrees, in place. Cheaper than re-detecting when a reader
+     * discovers a symbol is upside down.
+     */
+    rotate180(): void;
+    /**
+     * Build from a string of '1'/'X'/'#' (dark) and anything else (light),
+     * newline-separated. Test fixtures are far more legible this way.
+     *
+     * @param {string} text
+     * @returns {BitMatrix}
+     */
+    static parse(text: string): BitMatrix;
+    /**
+     * @param {string} [dark] @param {string} [light]
+     * @returns {string}
+     */
+    toString(dark?: string, light?: string): string;
+}

package/typings/core/errors.d.ts

@@ -0,0 +1,57 @@
+/*!
+ * Sythos Barcode Suite
+ *
+ * MIT License
+ *
+ * Copyright (c) 2026 Sythos
+ *
+ * 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.
+ *
+ * SPDX-FileCopyrightText: 2026 Sythos (https://www.sythos.net)
+ * SPDX-License-Identifier: MIT
+ *
+ * Original work. No code from any other barcode implementation.
+ */
+/**
+ * Error types.
+ *
+ * Decoding uses exceptions for control flow internally: a detector that fails
+ * on one candidate should be cheap to abandon, and a `try` around a candidate
+ * loop reads better than threading `null` through six call frames. The public
+ * API converts them to results.
+ *
+ * @module core/errors
+ */
+/** Base class so consumers can `catch (e) { if (e instanceof BarcodeError) ... }`. */
+export declare class BarcodeError extends Error {
+    /** @param {string} message */
+    constructor(message: string);
+}
+/** Input could not be encoded — bad payload, or it does not fit the symbology. */
+export declare class EncodeError extends BarcodeError {
+}
+/** No symbol was found in the image. Not an error condition for `decode()`. */
+export declare class NotFoundError extends BarcodeError {
+}
+/** A symbol was found, but its geometry or content is malformed. */
+export declare class FormatError extends BarcodeError {
+}
+/** A symbol was found and read, but error correction could not repair it. */
+export declare class ChecksumError extends BarcodeError {
+}

package/typings/core/galois-field.d.ts

@@ -0,0 +1,141 @@
+/*!
+ * Sythos Barcode Suite
+ *
+ * MIT License
+ *
+ * Copyright (c) 2026 Sythos
+ *
+ * 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.
+ *
+ * SPDX-FileCopyrightText: 2026 Sythos (https://www.sythos.net)
+ * SPDX-License-Identifier: MIT
+ *
+ * Original work. No code from any other barcode implementation.
+ */
+/**
+ * Finite field arithmetic.
+ *
+ * One class serves every field this suite needs:
+ *
+ *   GF(2^4)   Aztec, small layer counts
+ *   GF(2^6)   Aztec
+ *   GF(2^8)   QR Code, Data Matrix, Aztec
+ *   GF(2^10)  Aztec
+ *   GF(2^12)  Aztec
+ *   GF(929)   PDF417  <- a PRIME field, not a binary one
+ *
+ * ## The prime-field trap
+ *
+ * Multiplication unifies cleanly: exp/log tables work for the multiplicative
+ * group of any finite field. Addition does NOT.
+ *
+ *   binary GF(2^m):  a + b  ==  a - b  ==  a XOR b      (self-inverse)
+ *   prime  GF(p):    a + b  ==  (a+b) % p
+ *                    a - b  ==  (a-b+p) % p             (NOT self-inverse)
+ *
+ * So `add`, `sub` and `neg` are methods on the field, never inlined. Any code
+ * that writes a bare `^` for field arithmetic works perfectly for every binary
+ * field and silently corrupts PDF417 — the failure is invisible until a real
+ * scanner rejects the symbol. Route every operation through the field object.
+ *
+ * @module core/galois-field
+ */
+export declare class GaloisField {
+    size: number;
+    prime: boolean;
+    primitive: number;
+    generator: number;
+    name: string;
+    /** Multiplicative order: every non-zero element is generator^i for some i < order. */
+    order: number;
+    expTable: Int32Array<ArrayBuffer>;
+    logTable: Int32Array<ArrayBuffer>;
+    /**
+     * @param {object} opts
+     * @param {number} opts.size      Field order: 2^m for binary, p for prime.
+     * @param {boolean} [opts.prime]  True for a prime field (mod arithmetic).
+     * @param {number} [opts.primitive] Primitive polynomial, binary fields only.
+     * @param {number} [opts.generator] Multiplicative generator. Defaults to 2
+     *   for binary fields (x), and must be given explicitly for prime fields.
+     * @param {string} [opts.name]
+     */
+    constructor({ size, prime, primitive, generator, name }: {
+        size: number;
+        prime?: boolean;
+        primitive?: number;
+        generator?: number;
+        name?: string;
+    });
+    /** Additive identity is 0 and multiplicative identity is 1 in every field here. */
+    get zero(): number;
+    get one(): number;
+    /**
+     * a + b.
+     * @param {number} a @param {number} b @returns {number}
+     */
+    add(a: number, b: number): number;
+    /**
+     * a - b. Distinct from add() in prime fields — see the module note.
+     * @param {number} a @param {number} b @returns {number}
+     */
+    sub(a: number, b: number): number;
+    /**
+     * -a.
+     * @param {number} a @returns {number}
+     */
+    neg(a: number): number;
+    /**
+     * a * b.
+     * @param {number} a @param {number} b @returns {number}
+     */
+    mul(a: number, b: number): number;
+    /**
+     * a / b.
+     * @param {number} a @param {number} b @returns {number}
+     */
+    div(a: number, b: number): number;
+    /**
+     * 1 / a.
+     * @param {number} a @returns {number}
+     */
+    inv(a: number): number;
+    /**
+     * generator^i, for any integer i (negative included).
+     * @param {number} i @returns {number}
+     */
+    exp(i: number): number;
+    /**
+     * Discrete log base generator.
+     * @param {number} a @returns {number}
+     */
+    log(a: number): number;
+}
+/** QR Code, Data Matrix uses its own — see below. x^8 + x^4 + x^3 + x^2 + 1 */
+export declare const GF256_QR: GaloisField;
+/** Data Matrix ECC200. x^8 + x^5 + x^3 + x^2 + 1 */
+export declare const GF256_DM: GaloisField;
+/** Aztec's eight-bit data field is algebraically identical to Data Matrix's. */
+export declare const GF256_AZTEC: GaloisField;
+/** PDF417. Prime field; 3 is a primitive root modulo 929. */
+export declare const GF929: GaloisField;
+/** Aztec, by layer count. */
+export declare const GF16: GaloisField;
+export declare const GF64: GaloisField;
+export declare const GF1024: GaloisField;
+export declare const GF4096: GaloisField;

package/typings/core/index.d.ts

@@ -0,0 +1,40 @@
+/*!
+ * Sythos Barcode Suite
+ *
+ * MIT License
+ *
+ * Copyright (c) 2026 Sythos
+ *
+ * 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.
+ *
+ * SPDX-FileCopyrightText: 2026 Sythos (https://www.sythos.net)
+ * SPDX-License-Identifier: MIT
+ *
+ * Original work. No code from any other barcode implementation.
+ */
+/**
+ * Core primitives, re-exported.
+ *
+ * @module core
+ */
+export { BitMatrix } from './bit-matrix.js';
+export { BitWriter, BitReader } from './bit-buffer.js';
+export { GaloisField, GF256_QR, GF256_DM, GF929, GF16, GF64, GF1024, GF4096, } from './galois-field.js';
+export { rsEncode, rsDecode, generatorPoly } from './reed-solomon.js';
+export { BarcodeError, EncodeError, NotFoundError, FormatError, ChecksumError, } from './errors.js';

package/typings/core/reed-solomon.d.ts

@@ -0,0 +1,65 @@
+/*!
+ * Sythos Barcode Suite
+ *
+ * MIT License
+ *
+ * Copyright (c) 2026 Sythos
+ *
+ * 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.
+ *
+ * SPDX-FileCopyrightText: 2026 Sythos (https://www.sythos.net)
+ * SPDX-License-Identifier: MIT
+ *
+ * Original work. No code from any other barcode implementation.
+ */
+/**
+ * Build the generator polynomial for `eccLen` parity symbols.
+ *
+ *   g(x) = product over i of (x - a^(base + i)),  i = 0 .. eccLen-1
+ *
+ * `base` is 0 for QR; 1 for Aztec, Data Matrix and PDF417.
+ *
+ * @param {number} eccLen
+ * @param {import('./galois-field.js').GaloisField} field
+ * @param {number} [base]
+ * @returns {number[]} Monic, degree-descending, length eccLen + 1.
+ */
+export declare function generatorPoly(eccLen: number, field: import('./galois-field.js').GaloisField, base?: number): number[];
+/**
+ * Compute `eccLen` parity symbols for `data`.
+ *
+ * @param {ArrayLike<number>} data
+ * @param {number} eccLen
+ * @param {import('./galois-field.js').GaloisField} field
+ * @param {number} [base]
+ * @returns {number[]} The parity symbols alone, length eccLen.
+ */
+export declare function rsEncode(data: ArrayLike<number>, eccLen: number, field: import('./galois-field.js').GaloisField, base?: number): number[];
+/**
+ * Correct errors in a received codeword, in place.
+ *
+ * @param {number[]} received Data followed by parity, degree-descending.
+ * @param {number} eccLen
+ * @param {import('./galois-field.js').GaloisField} field
+ * @param {number} [base]
+ * @param {number[]} [erasures] Known damaged indexes, counted from wire order.
+ * @returns {number} Number of symbols corrected.
+ * @throws {ChecksumError} If the damage exceeds the correction capacity.
+ */
+export declare function rsDecode(received: number[], eccLen: number, field: import('./galois-field.js').GaloisField, base?: number, erasures?: number[]): number;

package/typings/databar/codec.d.ts

@@ -0,0 +1,78 @@
+/*!
+ * Sythos Barcode Suite
+ *
+ * MIT License
+ *
+ * Copyright (c) 2026 Sythos
+ *
+ * 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.
+ *
+ * SPDX-FileCopyrightText: 2026 Sythos (https://www.sythos.net)
+ * SPDX-License-Identifier: MIT
+ *
+ * Original work. No code from any other barcode implementation.
+ */
+/** Calculate the GS1 modulo-10 check digit for a GTIN body. */
+export declare function gtinCheckDigit(body: any): string;
+/** Return a checked 14-digit GTIN, preserving only its standardized digits. */
+export declare function normalizeGTIN(value: any): string;
+/** Build a checked GTIN-14 from its thirteen-digit data body. */
+export declare function makeGTIN14(body: any): string;
+/**
+ * Compact a GTIN into the four values shared by Omnidirectional, Truncated,
+ * Stacked and Stacked Omnidirectional. The `physicalCharacters` sequence is
+ * left-to-right on a linear DataBar-14 row: 1, 2, 4, 3.
+ */
+export declare function encodeDataBar14GTIN(value: any, options?: {}): Readonly<{
+    gtin: string;
+    linkage: boolean;
+    symbolValue: bigint;
+    leftPair: bigint;
+    rightPair: bigint;
+    logicalCharacters: Readonly<{
+        outerLeft: number;
+        innerLeft: number;
+        outerRight: number;
+        innerRight: number;
+    }>;
+    physicalCharacters: readonly number[];
+}>;
+/** Reconstruct and validate a GTIN from the four DataBar-14 character values. */
+export declare function decodeDataBar14GTIN(values: any): Readonly<{
+    linkage: boolean;
+    gtin: string;
+    leftPair: bigint;
+    rightPair: bigint;
+}>;
+/** Compact a DataBar Limited-eligible GTIN into its two data character values. */
+export declare function encodeDataBarLimitedGTIN(value: any, options?: {}): Readonly<{
+    gtin: string;
+    linkage: boolean;
+    symbolValue: bigint;
+    left: number;
+    right: number;
+}>;
+/** Reconstruct and validate a GTIN from DataBar Limited data character values. */
+export declare function decodeDataBarLimitedGTIN(values: any): Readonly<{
+    linkage: boolean;
+    gtin: string;
+    symbolValue: bigint;
+}>;
+/** GS1 transmitted form for the GTIN-only DataBar variants. */
+export declare function dataBarGtinTransmission(value: any): string;