@ac-kit/core 0.1.0

package/dist/big-int/pow.d.ts

@@ -0,0 +1,7 @@
+/**
+ * `base` raised to a non-negative integer `exponent`, by square-and-multiply.
+ *
+ * @throws {RangeError} When `exponent` is negative or not an integer.
+ */
+export declare function bigIntPow(base: bigint, exponent: number): bigint;
+//# sourceMappingURL=pow.d.ts.map

package/dist/big-int/pow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pow.d.ts","sourceRoot":"","sources":["../../src/big-int/pow.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAMhE"}

package/dist/big-int/pow.js

@@ -0,0 +1,12 @@
+/**
+ * `base` raised to a non-negative integer `exponent`, by square-and-multiply.
+ *
+ * @throws {RangeError} When `exponent` is negative or not an integer.
+ */
+export function bigIntPow(base, exponent) {
+    if (!Number.isInteger(exponent) || exponent < 0) {
+        throw new RangeError("Exponent must be a non-negative integer");
+    }
+    return base ** BigInt(exponent);
+}
+//# sourceMappingURL=pow.js.map

package/dist/big-int/pow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pow.js","sourceRoot":"","sources":["../../src/big-int/pow.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,QAAgB;IACvD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;QACjD,MAAM,IAAI,UAAU,CAAC,yCAAyC,CAAC,CAAC;IACjE,CAAC;IAED,OAAO,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC;AACjC,CAAC"}

package/dist/big-int/pow10.d.ts

@@ -0,0 +1,20 @@
+/**
+ * `10^exp` as a `bigint` for non-negative integer `exp`.
+ *
+ * Strategy:
+ *
+ * - `exp ∈ [0, 18]`: constant lookup in `_bigPowersOf10` (O(1))
+ * - `exp ∈ [19, 255]`: lazy-expanded mutable table, populated on first access by
+ *   multiplying the last entry by `10n`; expansion is idempotent (no locking
+ *   needed in a single-threaded JS runtime)
+ * - `exp > 255`: falls back to `10n ** BigInt(exp)` — no table entry
+ *
+ * @example
+ * 	```ts
+ * 	bigIntPow10(0); // → 1n
+ * 	bigIntPow10(18); // → 1000000000000000000n
+ * 	bigIntPow10(100); // → 10n**100n
+ * 	```;
+ */
+export declare function bigIntPow10(exp: number): bigint;
+//# sourceMappingURL=pow10.d.ts.map

package/dist/big-int/pow10.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pow10.d.ts","sourceRoot":"","sources":["../../src/big-int/pow10.ts"],"names":[],"mappings":"AASA;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAe/C"}

package/dist/big-int/pow10.js

@@ -0,0 +1,39 @@
+import { POWERS_OF_TEN } from "../number/integer/_powers-of-ten.js";
+// ---------------------------------------------------------------------------
+// Lazy-expanded bigint table: 10^0 … up to 10^255 (populated on demand)
+// ---------------------------------------------------------------------------
+const bigPowersOf10_ = POWERS_OF_TEN.map(BigInt);
+const BIG_POWERS_OF_10_MAX_EXPONENT_ = 255;
+/**
+ * `10^exp` as a `bigint` for non-negative integer `exp`.
+ *
+ * Strategy:
+ *
+ * - `exp ∈ [0, 18]`: constant lookup in `_bigPowersOf10` (O(1))
+ * - `exp ∈ [19, 255]`: lazy-expanded mutable table, populated on first access by
+ *   multiplying the last entry by `10n`; expansion is idempotent (no locking
+ *   needed in a single-threaded JS runtime)
+ * - `exp > 255`: falls back to `10n ** BigInt(exp)` — no table entry
+ *
+ * @example
+ * 	```ts
+ * 	bigIntPow10(0); // → 1n
+ * 	bigIntPow10(18); // → 1000000000000000000n
+ * 	bigIntPow10(100); // → 10n**100n
+ * 	```;
+ */
+export function bigIntPow10(exp) {
+    if (exp < bigPowersOf10_.length) {
+        return bigPowersOf10_[exp] ?? 1n;
+    }
+    if (exp <= BIG_POWERS_OF_10_MAX_EXPONENT_) {
+        // Expand lazily
+        while (bigPowersOf10_.length <= exp) {
+            const last = bigPowersOf10_[bigPowersOf10_.length - 1] ?? 1n;
+            bigPowersOf10_.push(last * 10n);
+        }
+        return bigPowersOf10_[exp] ?? 1n;
+    }
+    return 10n ** BigInt(exp);
+}
+//# sourceMappingURL=pow10.js.map

package/dist/big-int/pow10.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pow10.js","sourceRoot":"","sources":["../../src/big-int/pow10.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,qCAAqC,CAAC;AAEpE,8EAA8E;AAC9E,wEAAwE;AACxE,8EAA8E;AAC9E,MAAM,cAAc,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AAEjD,MAAM,8BAA8B,GAAG,GAAY,CAAC;AAEpD;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,WAAW,CAAC,GAAW;IACtC,IAAI,GAAG,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC;QACjC,OAAO,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IAClC,CAAC;IAED,IAAI,GAAG,IAAI,8BAA8B,EAAE,CAAC;QAC3C,gBAAgB;QAChB,OAAO,cAAc,CAAC,MAAM,IAAI,GAAG,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,cAAc,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YAC7D,cAAc,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IAClC,CAAC;IAED,OAAO,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC;AAC3B,CAAC"}

package/dist/big-int/power-of-two.d.ts

@@ -0,0 +1,4 @@
+export declare function bigIntIsPowerOfTwo(n: bigint): boolean;
+export declare function bigIntNextPowerOfTwo(n: bigint): bigint;
+export declare function bigIntPreviousPowerOfTwo(n: bigint): bigint;
+//# sourceMappingURL=power-of-two.d.ts.map

package/dist/big-int/power-of-two.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"power-of-two.d.ts","sourceRoot":"","sources":["../../src/big-int/power-of-two.ts"],"names":[],"mappings":"AAEA,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAGrD;AAED,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAKtD;AAED,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAQ1D"}

package/dist/big-int/power-of-two.js

@@ -0,0 +1,26 @@
+import { bigIntBitLength } from "./bit-length.js";
+export function bigIntIsPowerOfTwo(n) {
+    if (n < 0n)
+        throw new RangeError("Input must be a non-negative bigint.");
+    return n > 0n && (n & (n - 1n)) === 0n;
+}
+export function bigIntNextPowerOfTwo(n) {
+    if (n < 0n)
+        throw new RangeError("Input must be a non-negative bigint.");
+    if (n <= 1n)
+        return 1n;
+    if ((n & (n - 1n)) === 0n)
+        return n;
+    return 1n << BigInt(bigIntBitLength(n));
+}
+export function bigIntPreviousPowerOfTwo(n) {
+    if (n <= 0n) {
+        throw new RangeError("Input must be a positive bigint.");
+    }
+    if (n === 1n)
+        return 1n;
+    if ((n & (n - 1n)) === 0n)
+        return n;
+    return 1n << BigInt(bigIntBitLength(n) - 1);
+}
+//# sourceMappingURL=power-of-two.js.map

package/dist/big-int/power-of-two.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"power-of-two.js","sourceRoot":"","sources":["../../src/big-int/power-of-two.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAElD,MAAM,UAAU,kBAAkB,CAAC,CAAS;IAC3C,IAAI,CAAC,GAAG,EAAE;QAAE,MAAM,IAAI,UAAU,CAAC,sCAAsC,CAAC,CAAC;IACzE,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,CAAS;IAC7C,IAAI,CAAC,GAAG,EAAE;QAAE,MAAM,IAAI,UAAU,CAAC,sCAAsC,CAAC,CAAC;IACzE,IAAI,CAAC,IAAI,EAAE;QAAE,OAAO,EAAE,CAAC;IACvB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE;QAAE,OAAO,CAAC,CAAC;IACpC,OAAO,EAAE,IAAI,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,MAAM,UAAU,wBAAwB,CAAC,CAAS;IACjD,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACb,MAAM,IAAI,UAAU,CAAC,kCAAkC,CAAC,CAAC;IAC1D,CAAC;IACD,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IAExB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE;QAAE,OAAO,CAAC,CAAC;IACpC,OAAO,EAAE,IAAI,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7C,CAAC"}

package/dist/big-int/sign.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Sign of `value` — the `bigint` equivalent `Math.sign` does not accept.
+ *
+ * Returns a `number` rather than a `bigint`: the result is a three-way flag,
+ * and every consumer of one (comparators, index arithmetic) wants a `number`.
+ */
+export declare function bigIntSign(value: bigint): -1 | 0 | 1;
+//# sourceMappingURL=sign.d.ts.map

package/dist/big-int/sign.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sign.d.ts","sourceRoot":"","sources":["../../src/big-int/sign.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAMpD"}

package/dist/big-int/sign.js

@@ -0,0 +1,13 @@
+/**
+ * Sign of `value` — the `bigint` equivalent `Math.sign` does not accept.
+ *
+ * Returns a `number` rather than a `bigint`: the result is a three-way flag,
+ * and every consumer of one (comparators, index arithmetic) wants a `number`.
+ */
+export function bigIntSign(value) {
+    if (value < 0n) {
+        return -1;
+    }
+    return value > 0n ? 1 : 0;
+}
+//# sourceMappingURL=sign.js.map

package/dist/big-int/sign.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sign.js","sourceRoot":"","sources":["../../src/big-int/sign.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,KAAa;IACvC,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;QAChB,OAAO,CAAC,CAAC,CAAC;IACX,CAAC;IAED,OAAO,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3B,CAAC"}

package/dist/big-int/sqrt-exact.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Exact integer square root, or `null` when `value` is not a perfect square.
+ *
+ * @throws {RangeError} When `value` is negative.
+ */
+export declare function bigIntSqrtExact(value: bigint): bigint | null;
+//# sourceMappingURL=sqrt-exact.d.ts.map

package/dist/big-int/sqrt-exact.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqrt-exact.d.ts","sourceRoot":"","sources":["../../src/big-int/sqrt-exact.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAI5D"}

package/dist/big-int/sqrt-exact.js

@@ -0,0 +1,11 @@
+import { bigIntSqrt } from "./sqrt.js";
+/**
+ * Exact integer square root, or `null` when `value` is not a perfect square.
+ *
+ * @throws {RangeError} When `value` is negative.
+ */
+export function bigIntSqrtExact(value) {
+    const root = bigIntSqrt(value);
+    return root * root === value ? root : null;
+}
+//# sourceMappingURL=sqrt-exact.js.map

package/dist/big-int/sqrt-exact.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqrt-exact.js","sourceRoot":"","sources":["../../src/big-int/sqrt-exact.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAEvC;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC5C,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAE/B,OAAO,IAAI,GAAG,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5C,CAAC"}

package/dist/big-int/sqrt.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Floor of the integer square root: the largest `r` with `r² ≤ value`.
+ *
+ * @throws {RangeError} When `value` is negative.
+ */
+export declare function bigIntSqrt(value: bigint): bigint;
+//# sourceMappingURL=sqrt.d.ts.map

package/dist/big-int/sqrt.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqrt.d.ts","sourceRoot":"","sources":["../../src/big-int/sqrt.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAsBhD"}

package/dist/big-int/sqrt.js

@@ -0,0 +1,25 @@
+import { bigIntBitLength } from "./bit-length.js";
+/**
+ * Floor of the integer square root: the largest `r` with `r² ≤ value`.
+ *
+ * @throws {RangeError} When `value` is negative.
+ */
+export function bigIntSqrt(value) {
+    if (value < 0n) {
+        throw new RangeError("Square root of a negative integer is not real");
+    }
+    if (value < 2n) {
+        return value;
+    }
+    // Newton's method from a bit-length seed; the float path loses precision
+    // past 2⁵³, so it cannot be used to seed large values.
+    let guess = 1n << BigInt((bigIntBitLength(value) + 1) >> 1);
+    for (;;) {
+        const next = (guess + value / guess) >> 1n;
+        if (next >= guess) {
+            return guess;
+        }
+        guess = next;
+    }
+}
+//# sourceMappingURL=sqrt.js.map

package/dist/big-int/sqrt.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqrt.js","sourceRoot":"","sources":["../../src/big-int/sqrt.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAElD;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,KAAa;IACvC,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;QAChB,MAAM,IAAI,UAAU,CAAC,+CAA+C,CAAC,CAAC;IACvE,CAAC;IAED,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;QAChB,OAAO,KAAK,CAAC;IACd,CAAC;IAED,yEAAyE;IACzE,uDAAuD;IACvD,IAAI,KAAK,GAAG,EAAE,IAAI,MAAM,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAE5D,SAAS,CAAC;QACT,MAAM,IAAI,GAAG,CAAC,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QAE3C,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;YACnB,OAAO,KAAK,CAAC;QACd,CAAC;QAED,KAAK,GAAG,IAAI,CAAC;IACd,CAAC;AACF,CAAC"}

package/dist/buffer/bytes-is-equal.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Compares two `Uint8Array`s for byte-for-byte equality.
+ *
+ * @param a The first array to compare.
+ * @param b The second array to compare.
+ * @returns True if both arrays have the same length and contents.
+ */
+export declare function bytesIsEqual(a: Uint8Array, b: Uint8Array): boolean;
+//# sourceMappingURL=bytes-is-equal.d.ts.map

package/dist/buffer/bytes-is-equal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bytes-is-equal.d.ts","sourceRoot":"","sources":["../../src/buffer/bytes-is-equal.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,GAAG,OAAO,CAYlE"}

package/dist/buffer/bytes-is-equal.js

@@ -0,0 +1,19 @@
+/**
+ * Compares two `Uint8Array`s for byte-for-byte equality.
+ *
+ * @param a The first array to compare.
+ * @param b The second array to compare.
+ * @returns True if both arrays have the same length and contents.
+ */
+export function bytesIsEqual(a, b) {
+    if (a.length !== b.length) {
+        return false;
+    }
+    for (let index = 0; index < a.length; index++) {
+        if (a[index] !== b[index]) {
+            return false;
+        }
+    }
+    return true;
+}
+//# sourceMappingURL=bytes-is-equal.js.map

package/dist/buffer/bytes-is-equal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bytes-is-equal.js","sourceRoot":"","sources":["../../src/buffer/bytes-is-equal.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,CAAa,EAAE,CAAa;IACxD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC3B,OAAO,KAAK,CAAC;IACd,CAAC;IAED,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QAC/C,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,KAAK,CAAC;QACd,CAAC;IACF,CAAC;IAED,OAAO,IAAI,CAAC;AACb,CAAC"}

package/dist/buffer/chunk-bytes.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Splits `bytes` into consecutive views of at most `size` bytes each — the
+ * inverse of {@link concatBytes}. Each returned array is a `subarray` (no copy),
+ * so mutating one mutates `bytes` itself.
+ */
+export declare function chunkBytes(bytes: Uint8Array, size: number): Uint8Array[];
+//# sourceMappingURL=chunk-bytes.d.ts.map

package/dist/buffer/chunk-bytes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk-bytes.d.ts","sourceRoot":"","sources":["../../src/buffer/chunk-bytes.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,GAAG,UAAU,EAAE,CAQxE"}

package/dist/buffer/chunk-bytes.js

@@ -0,0 +1,13 @@
+/**
+ * Splits `bytes` into consecutive views of at most `size` bytes each — the
+ * inverse of {@link concatBytes}. Each returned array is a `subarray` (no copy),
+ * so mutating one mutates `bytes` itself.
+ */
+export function chunkBytes(bytes, size) {
+    const chunks = [];
+    for (let offset = 0; offset < bytes.length; offset += size) {
+        chunks.push(bytes.subarray(offset, offset + size));
+    }
+    return chunks;
+}
+//# sourceMappingURL=chunk-bytes.js.map

package/dist/buffer/chunk-bytes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk-bytes.js","sourceRoot":"","sources":["../../src/buffer/chunk-bytes.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,KAAiB,EAAE,IAAY;IACzD,MAAM,MAAM,GAAiB,EAAE,CAAC;IAEhC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,MAAM,IAAI,IAAI,EAAE,CAAC;QAC5D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;IACpD,CAAC;IAED,OAAO,MAAM,CAAC;AACf,CAAC"}

package/dist/buffer/codec/get-big-uint64-be.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Reads a big-endian unsigned integer from `data` at `offset`.
+ *
+ * The caller is responsible for ensuring that `byteLength` bytes are available
+ * at `offset`.
+ *
+ * @param data - The bytes to read from.
+ * @param offset - The index of the first byte to read.
+ * @param byteLength - How many bytes to read, in the 0..8 range. Defaults to 8
+ *   (a full word); fewer bytes read a narrower big-endian integer formed from
+ *   just those leading bytes.
+ * @returns The value as an unsigned 64-bit integer.
+ */
+export declare function getBigUint64Be(data: Uint8Array, offset: number, byteLength?: number): bigint;
+//# sourceMappingURL=get-big-uint64-be.d.ts.map

package/dist/buffer/codec/get-big-uint64-be.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-big-uint64-be.d.ts","sourceRoot":"","sources":["../../../src/buffer/codec/get-big-uint64-be.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,CAC7B,IAAI,EAAE,UAAU,EAChB,MAAM,EAAE,MAAM,EACd,UAAU,SAAI,GACZ,MAAM,CAYR"}

package/dist/buffer/codec/get-big-uint64-be.js

@@ -0,0 +1,24 @@
+import { getUint32Be } from "./get-uint32-be.js";
+/**
+ * Reads a big-endian unsigned integer from `data` at `offset`.
+ *
+ * The caller is responsible for ensuring that `byteLength` bytes are available
+ * at `offset`.
+ *
+ * @param data - The bytes to read from.
+ * @param offset - The index of the first byte to read.
+ * @param byteLength - How many bytes to read, in the 0..8 range. Defaults to 8
+ *   (a full word); fewer bytes read a narrower big-endian integer formed from
+ *   just those leading bytes.
+ * @returns The value as an unsigned 64-bit integer.
+ */
+export function getBigUint64Be(data, offset, byteLength = 8) {
+    const highByteLength = Math.max(0, Math.min(4, byteLength - 4));
+    const lowByteLength = Math.min(4, byteLength);
+    if (byteLength <= 4) {
+        return BigInt(getUint32Be(data, offset, lowByteLength));
+    }
+    return ((BigInt(getUint32Be(data, offset, highByteLength)) << 32n) |
+        BigInt(getUint32Be(data, offset + highByteLength, lowByteLength)));
+}
+//# sourceMappingURL=get-big-uint64-be.js.map

package/dist/buffer/codec/get-big-uint64-be.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-big-uint64-be.js","sourceRoot":"","sources":["../../../src/buffer/codec/get-big-uint64-be.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAEjD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,cAAc,CAC7B,IAAgB,EAChB,MAAc,EACd,UAAU,GAAG,CAAC;IAEd,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;IAChE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAE9C,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;QACrB,OAAO,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,OAAO,CACN,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC,IAAI,GAAG,CAAC;QAC1D,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,EAAE,aAAa,CAAC,CAAC,CACjE,CAAC;AACH,CAAC"}

package/dist/buffer/codec/get-big-uint64-le.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Reads a little-endian unsigned integer from `data` at `offset`.
+ *
+ * The caller is responsible for ensuring that `byteLength` bytes are available
+ * at `offset`.
+ *
+ * @param data - The bytes to read from.
+ * @param offset - The index of the first byte to read.
+ * @param byteLength - How many bytes to read, in the 0..8 range. Defaults to 8
+ *   (a full word); fewer bytes read a narrower little-endian integer formed
+ *   from just those leading bytes, which for little-endian is equivalent to
+ *   zero-padding the missing high bytes.
+ * @returns The value as an unsigned 64-bit integer.
+ */
+export declare function getBigUint64Le(data: Uint8Array, offset: number, byteLength?: number): bigint;
+//# sourceMappingURL=get-big-uint64-le.d.ts.map

package/dist/buffer/codec/get-big-uint64-le.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-big-uint64-le.d.ts","sourceRoot":"","sources":["../../../src/buffer/codec/get-big-uint64-le.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;GAaG;AACH,wBAAgB,cAAc,CAC7B,IAAI,EAAE,UAAU,EAChB,MAAM,EAAE,MAAM,EACd,UAAU,SAAI,GACZ,MAAM,CAYR"}

package/dist/buffer/codec/get-big-uint64-le.js

@@ -0,0 +1,25 @@
+import { getUint32Le } from "./get-uint32-le.js";
+/**
+ * Reads a little-endian unsigned integer from `data` at `offset`.
+ *
+ * The caller is responsible for ensuring that `byteLength` bytes are available
+ * at `offset`.
+ *
+ * @param data - The bytes to read from.
+ * @param offset - The index of the first byte to read.
+ * @param byteLength - How many bytes to read, in the 0..8 range. Defaults to 8
+ *   (a full word); fewer bytes read a narrower little-endian integer formed
+ *   from just those leading bytes, which for little-endian is equivalent to
+ *   zero-padding the missing high bytes.
+ * @returns The value as an unsigned 64-bit integer.
+ */
+export function getBigUint64Le(data, offset, byteLength = 8) {
+    const lowByteLength = Math.min(4, byteLength);
+    const highByteLength = Math.max(0, Math.min(4, byteLength - 4));
+    if (byteLength <= 4) {
+        return BigInt(getUint32Le(data, offset, lowByteLength));
+    }
+    return (BigInt(getUint32Le(data, offset, lowByteLength)) |
+        (BigInt(getUint32Le(data, offset + 4, highByteLength)) << 32n));
+}
+//# sourceMappingURL=get-big-uint64-le.js.map

package/dist/buffer/codec/get-big-uint64-le.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-big-uint64-le.js","sourceRoot":"","sources":["../../../src/buffer/codec/get-big-uint64-le.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAEjD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,cAAc,CAC7B,IAAgB,EAChB,MAAc,EACd,UAAU,GAAG,CAAC;IAEd,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAC9C,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhE,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;QACrB,OAAO,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,OAAO,CACN,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;QAChD,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC,IAAI,GAAG,CAAC,CAC9D,CAAC;AACH,CAAC"}

package/dist/buffer/codec/get-float32-be.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Reads a big-endian IEEE 754 single-precision (binary32) float from `data` at
+ * `offset`.
+ *
+ * @param data - The bytes to read from.
+ * @param offset - The index of the first byte to read.
+ * @returns The value as a `number`.
+ */
+export declare function getFloat32Be(data: Uint8Array, offset: number): number;
+//# sourceMappingURL=get-float32-be.d.ts.map

package/dist/buffer/codec/get-float32-be.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-float32-be.d.ts","sourceRoot":"","sources":["../../../src/buffer/codec/get-float32-be.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAKrE"}

package/dist/buffer/codec/get-float32-be.js

@@ -0,0 +1,12 @@
+/**
+ * Reads a big-endian IEEE 754 single-precision (binary32) float from `data` at
+ * `offset`.
+ *
+ * @param data - The bytes to read from.
+ * @param offset - The index of the first byte to read.
+ * @returns The value as a `number`.
+ */
+export function getFloat32Be(data, offset) {
+    return new DataView(data.buffer, data.byteOffset + offset, 4).getFloat32(0, false);
+}
+//# sourceMappingURL=get-float32-be.js.map

package/dist/buffer/codec/get-float32-be.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-float32-be.js","sourceRoot":"","sources":["../../../src/buffer/codec/get-float32-be.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,IAAgB,EAAE,MAAc;IAC5D,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,UAAU,CACvE,CAAC,EACD,KAAK,CACL,CAAC;AACH,CAAC"}

package/dist/buffer/codec/get-float32-le.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Reads a little-endian IEEE 754 single-precision (binary32) float from `data`
+ * at `offset`.
+ *
+ * @param data - The bytes to read from.
+ * @param offset - The index of the first byte to read.
+ * @returns The value as a `number`.
+ */
+export declare function getFloat32Le(data: Uint8Array, offset: number): number;
+//# sourceMappingURL=get-float32-le.d.ts.map

package/dist/buffer/codec/get-float32-le.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-float32-le.d.ts","sourceRoot":"","sources":["../../../src/buffer/codec/get-float32-le.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAKrE"}

package/dist/buffer/codec/get-float32-le.js

@@ -0,0 +1,12 @@
+/**
+ * Reads a little-endian IEEE 754 single-precision (binary32) float from `data`
+ * at `offset`.
+ *
+ * @param data - The bytes to read from.
+ * @param offset - The index of the first byte to read.
+ * @returns The value as a `number`.
+ */
+export function getFloat32Le(data, offset) {
+    return new DataView(data.buffer, data.byteOffset + offset, 4).getFloat32(0, true);
+}
+//# sourceMappingURL=get-float32-le.js.map

package/dist/buffer/codec/get-float32-le.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-float32-le.js","sourceRoot":"","sources":["../../../src/buffer/codec/get-float32-le.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,IAAgB,EAAE,MAAc;IAC5D,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,UAAU,CACvE,CAAC,EACD,IAAI,CACJ,CAAC;AACH,CAAC"}

package/dist/buffer/codec/get-float64-be.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Reads a big-endian IEEE 754 double-precision (binary64) float from `data` at
+ * `offset`.
+ *
+ * @param data - The bytes to read from.
+ * @param offset - The index of the first byte to read.
+ * @returns The value as a `number`.
+ */
+export declare function getFloat64Be(data: Uint8Array, offset: number): number;
+//# sourceMappingURL=get-float64-be.d.ts.map

package/dist/buffer/codec/get-float64-be.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-float64-be.d.ts","sourceRoot":"","sources":["../../../src/buffer/codec/get-float64-be.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAKrE"}

package/dist/buffer/codec/get-float64-be.js

@@ -0,0 +1,12 @@
+/**
+ * Reads a big-endian IEEE 754 double-precision (binary64) float from `data` at
+ * `offset`.
+ *
+ * @param data - The bytes to read from.
+ * @param offset - The index of the first byte to read.
+ * @returns The value as a `number`.
+ */
+export function getFloat64Be(data, offset) {
+    return new DataView(data.buffer, data.byteOffset + offset, 8).getFloat64(0, false);
+}
+//# sourceMappingURL=get-float64-be.js.map

package/dist/buffer/codec/get-float64-be.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-float64-be.js","sourceRoot":"","sources":["../../../src/buffer/codec/get-float64-be.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,IAAgB,EAAE,MAAc;IAC5D,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,UAAU,CACvE,CAAC,EACD,KAAK,CACL,CAAC;AACH,CAAC"}

package/dist/buffer/codec/get-float64-le.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Reads a little-endian IEEE 754 double-precision (binary64) float from `data`
+ * at `offset`.
+ *
+ * @param data - The bytes to read from.
+ * @param offset - The index of the first byte to read.
+ * @returns The value as a `number`.
+ */
+export declare function getFloat64Le(data: Uint8Array, offset: number): number;
+//# sourceMappingURL=get-float64-le.d.ts.map

package/dist/buffer/codec/get-float64-le.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-float64-le.d.ts","sourceRoot":"","sources":["../../../src/buffer/codec/get-float64-le.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAKrE"}

package/dist/buffer/codec/get-float64-le.js

@@ -0,0 +1,12 @@
+/**
+ * Reads a little-endian IEEE 754 double-precision (binary64) float from `data`
+ * at `offset`.
+ *
+ * @param data - The bytes to read from.
+ * @param offset - The index of the first byte to read.
+ * @returns The value as a `number`.
+ */
+export function getFloat64Le(data, offset) {
+    return new DataView(data.buffer, data.byteOffset + offset, 8).getFloat64(0, true);
+}
+//# sourceMappingURL=get-float64-le.js.map

package/dist/buffer/codec/get-float64-le.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-float64-le.js","sourceRoot":"","sources":["../../../src/buffer/codec/get-float64-le.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,IAAgB,EAAE,MAAc;IAC5D,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,UAAU,CACvE,CAAC,EACD,IAAI,CACJ,CAAC;AACH,CAAC"}

package/dist/buffer/codec/get-uint32-array-le.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Reads `byteLength` little-endian bytes from `data` at `offset` into a fresh
+ * `Uint32Array`.
+ *
+ * The inverse of `setUint32ArrayLe`. `byteLength` need not be a multiple of
+ * four — a partial final word reads only its leading bytes, which for
+ * little-endian is equivalent to zero-padding the missing high bytes, so a
+ * value narrower than a word never reads past its own span.
+ *
+ * @param data - The bytes to read from. The caller is responsible for ensuring
+ *   that `byteLength` bytes are available at `offset`.
+ * @param offset - The index of the first byte to read.
+ * @param byteLength - How many bytes to read.
+ * @returns `⌈byteLength / 4⌉` words.
+ */
+export declare function getUint32ArrayLe(data: Uint8Array, offset: number, byteLength: number): Uint32Array;
+//# sourceMappingURL=get-uint32-array-le.d.ts.map

package/dist/buffer/codec/get-uint32-array-le.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-uint32-array-le.d.ts","sourceRoot":"","sources":["../../../src/buffer/codec/get-uint32-array-le.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,gBAAgB,CAC/B,IAAI,EAAE,UAAU,EAChB,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,GAChB,WAAW,CAeb"}

package/dist/buffer/codec/get-uint32-array-le.js

@@ -0,0 +1,29 @@
+import { getUint32Le } from "./get-uint32-le.js";
+/**
+ * Reads `byteLength` little-endian bytes from `data` at `offset` into a fresh
+ * `Uint32Array`.
+ *
+ * The inverse of `setUint32ArrayLe`. `byteLength` need not be a multiple of
+ * four — a partial final word reads only its leading bytes, which for
+ * little-endian is equivalent to zero-padding the missing high bytes, so a
+ * value narrower than a word never reads past its own span.
+ *
+ * @param data - The bytes to read from. The caller is responsible for ensuring
+ *   that `byteLength` bytes are available at `offset`.
+ * @param offset - The index of the first byte to read.
+ * @param byteLength - How many bytes to read.
+ * @returns `⌈byteLength / 4⌉` words.
+ */
+export function getUint32ArrayLe(data, offset, byteLength) {
+    const words = new Uint32Array((byteLength + 3) >>> 2);
+    const fullWords = byteLength >> 2;
+    for (let word = 0; word < fullWords; word++) {
+        words[word] = getUint32Le(data, offset + word * 4);
+    }
+    const remainder = byteLength - fullWords * 4;
+    if (remainder > 0) {
+        words[fullWords] = getUint32Le(data, offset + fullWords * 4, remainder);
+    }
+    return words;
+}
+//# sourceMappingURL=get-uint32-array-le.js.map

package/dist/buffer/codec/get-uint32-array-le.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-uint32-array-le.js","sourceRoot":"","sources":["../../../src/buffer/codec/get-uint32-array-le.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAEjD;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,gBAAgB,CAC/B,IAAgB,EAChB,MAAc,EACd,UAAkB;IAElB,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACtD,MAAM,SAAS,GAAG,UAAU,IAAI,CAAC,CAAC;IAElC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,EAAE,CAAC;QAC7C,KAAK,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,SAAS,GAAG,UAAU,GAAG,SAAS,GAAG,CAAC,CAAC;IAE7C,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QACnB,KAAK,CAAC,SAAS,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;IACzE,CAAC;IAED,OAAO,KAAK,CAAC;AACd,CAAC"}