@gscdump/engine 7.6.0 → 7.8.0

package/dist/iceberg/catalog.d.mts

@@ -1,9 +1,9 @@
 import { EngineError } from "../errors.mjs";
 import { IcebergTableName, PartitionKeyEncoding } from "./schema.mjs";
-import { icebergCreateTable } from "../node_modules/.pnpm/icebird@0.8.30_patch_hash_a400e343a199b1ca18601f96348011745ac6518fc07ffa71d5adfdd2ccc7d14f/node_modules/icebird/types/write/write.mjs";
-import "../node_modules/.pnpm/icebird@0.8.30_patch_hash_a400e343a199b1ca18601f96348011745ac6518fc07ffa71d5adfdd2ccc7d14f/node_modules/icebird/types/index.mjs";
+import { icebergCreateTable } from "../node_modules/.pnpm/icebird@0.8.30_patch_hash_1359a91da68522a736babe444880ae391f19455fbe47c346f76cec92c5c2e471/node_modules/icebird/types/write/write.mjs";
+import "../node_modules/.pnpm/icebird@0.8.30_patch_hash_1359a91da68522a736babe444880ae391f19455fbe47c346f76cec92c5c2e471/node_modules/icebird/types/index.mjs";
 import { Result } from "gscdump/result";
-import { CommitRetryOptions, ConnectIcebergOptions, IcebergCatalogConfig, IcebergConnection, IcebergListedDataFile, QueryProfiler } from "@gscdump/lakehouse";
+import { CommitRetryOptions, ConnectIcebergOptions, IcebergCatalogConfig, IcebergConnection, IcebergListedDataFile, ManifestReadLimits, QueryProfiler } from "@gscdump/lakehouse";
 type IcebirdCreateTableOptions = Parameters<typeof icebergCreateTable>[0];
 type IcebirdSchema = NonNullable<IcebirdCreateTableOptions['schema']>;
 type IcebirdPartitionSpec = NonNullable<IcebirdCreateTableOptions['partitionSpec']>;
@@ -62,6 +62,8 @@ export interface ListIcebergDataFilesOptions {
   cache?: import('@gscdump/lakehouse').CatalogCache;
   clock?: () => number;
   profiler?: QueryProfiler;
+  /** Uncached Avro read limits; catalog metadata/snapshot caching is unchanged. */
+  readLimits?: ManifestReadLimits;
 }
 /**
  * List the parquet data files in the current snapshot of `table`, filtered to

package/dist/iceberg/catalog.mjs

@@ -2,8 +2,8 @@ import { engineErrors } from "../errors.mjs";
 import { TABLE_METADATA } from "../drizzle-schema.mjs";
 import "../schema.mjs";
 import { DEFAULT_PARTITION_KEY_ENCODING, ICEBERG_PARTITION_SPEC, ICEBERG_TABLES, icebergSchemasFor } from "./schema.mjs";
-import { icebergCreateTable } from "../node_modules/.pnpm/icebird@0.8.30_patch_hash_a400e343a199b1ca18601f96348011745ac6518fc07ffa71d5adfdd2ccc7d14f/node_modules/icebird/src/write/write.mjs";
-import "../node_modules/.pnpm/icebird@0.8.30_patch_hash_a400e343a199b1ca18601f96348011745ac6518fc07ffa71d5adfdd2ccc7d14f/node_modules/icebird/src/index.mjs";
+import { icebergCreateTable } from "../node_modules/.pnpm/icebird@0.8.30_patch_hash_1359a91da68522a736babe444880ae391f19455fbe47c346f76cec92c5c2e471/node_modules/icebird/src/write/write.mjs";
+import "../node_modules/.pnpm/icebird@0.8.30_patch_hash_1359a91da68522a736babe444880ae391f19455fbe47c346f76cec92c5c2e471/node_modules/icebird/src/index.mjs";
 import { err, ok } from "gscdump/result";
 import { ICEBERG_TYPE_MAP, connectIcebergCatalog, dropIcebergTables, resolveIcebergDataFiles } from "@gscdump/lakehouse";
 import { icebergAppendRetrying } from "@gscdump/lakehouse/unsafe-raw";
@@ -103,7 +103,8 @@ async function listIcebergDataFiles(conn, opts) {
 		range: opts.range,
 		cache: opts.cache,
 		clock: opts.clock,
-		profiler: opts.profiler
+		profiler: opts.profiler,
+		readLimits: opts.readLimits
 	});
 }
 export { connectIcebergCatalog, createIcebergTables, dropIcebergTables$1 as dropIcebergTables, icebergAppendRetrying, icebergPartitionSpecFor, icebergSchemaFor, icebergSortOrderFor, listIcebergDataFiles };

package/dist/node_modules/.pnpm/hyparquet-compressors@1.1.2_patch_hash_3f8f44805c034b2563763dcd5d37050ea6b1d5d45b46ea37adc4a721e748a1c5/node_modules/hyparquet-compressors/src/gzip.mjs

@@ -0,0 +1,196 @@
+import { fixedDistance, fixedDistanceExtraBits, fixedDistanceMap, fixedLength, fixedLengthExtraBits, fixedLengthMap, huffMap } from "./gzip.huffman.mjs";
+const codeLengthIndexMap = new Uint8Array([
+	16,
+	17,
+	18,
+	0,
+	8,
+	7,
+	9,
+	6,
+	10,
+	5,
+	11,
+	4,
+	12,
+	3,
+	13,
+	2,
+	14,
+	1,
+	15
+]);
+function bits(input, pos, mask) {
+	const o = pos / 8 | 0;
+	return (input[o] | input[o + 1] << 8) >> (pos & 7) & mask;
+}
+function bits16(d, p) {
+	const o = p / 8 | 0;
+	return (d[o] | d[o + 1] << 8 | d[o + 2] << 16) >> (p & 7);
+}
+function shft(p) {
+	return (p + 7) / 8 | 0;
+}
+function gzipStart(input, i) {
+	if (input[i++] !== 31 || input[i++] !== 139 || input[i++] !== 8) return 0;
+	const flag = input[i++];
+	if (flag & 224) throw new Error("invalid gzip header flags");
+	i += 6;
+	if (flag & 4) i += (input[i] | input[i + 1] << 8) + 2;
+	for (let zs = (flag >> 3 & 1) + (flag >> 4 & 1); zs > 0; zs -= Number(!input[i++]));
+	return i + (flag & 2);
+}
+function gunzip(input, output, inputIndex = 0, outputIndex = 0, limits) {
+	const maximum = limits?.maxOutputBytes;
+	if (limits && (limits.raw !== true || !Number.isSafeInteger(maximum) || maximum < 0 || output || inputIndex !== 0 || outputIndex !== 0)) throw new RangeError("Invalid bounded raw DEFLATE options");
+	let out = output ?? new Uint8Array(limits ? Math.min(1024, maximum) : 1024);
+	if (limits && !input.length) throw new Error("unexpected EOF");
+	if (!(input.length - inputIndex)) return out;
+	const totalBits = input.length * 8;
+	function ensureSize(length) {
+		if (limits && (!Number.isSafeInteger(length) || length > maximum)) throw new RangeError("DEFLATE output byte limit exceeded");
+		if (!output && length > out.length) {
+			const old = out;
+			out = new Uint8Array(limits ? Math.min(maximum, Math.max(old.length * 2, length)) : Math.max(old.length * 2, length));
+			out.set(old);
+		}
+	}
+	let memberStart = inputIndex;
+	for (;;) {
+		const payloadStart = limits ? 0 : gzipStart(input, memberStart);
+		const isGzip = !limits && payloadStart > 0;
+		if (isGzip && payloadStart === input.length - 8) break;
+		if (isGzip && payloadStart > input.length - 8) throw new Error("unexpected EOF");
+		const pos = inflate(payloadStart * 8);
+		if (limits && Math.ceil(pos / 8) !== input.length) throw new Error("trailing raw DEFLATE bytes");
+		if (!isGzip || output && outputIndex >= out.length) break;
+		const nextBlock = Math.ceil(pos / 8) + 8;
+		if (nextBlock > input.length) throw new Error("unexpected EOF");
+		if (nextBlock === input.length) break;
+		if (input[nextBlock] !== 31 || input[nextBlock + 1] !== 139 || input[nextBlock + 2] !== 8) throw new Error("invalid gzip member");
+		memberStart = nextBlock;
+	}
+	function inflate(pos) {
+		let final = 0;
+		let lengthBits = 0;
+		let distBits = 0;
+		let lengthMap;
+		let distMap;
+		do {
+			if (!lengthMap) {
+				final = bits(input, pos, 1);
+				const type = bits(input, pos + 1, 3);
+				pos += 3;
+				if (!type) {
+					const s = shft(pos) + 4;
+					const l = input[s - 4] | input[s - 3] << 8;
+					if (limits && (s > input.length || ((input[s - 2] | input[s - 1] << 8) ^ l) !== 65535)) throw new Error("invalid stored block length");
+					const t = s + l;
+					if (t > input.length) throw new Error("unexpected EOF");
+					ensureSize(outputIndex + l);
+					out.set(input.subarray(s, t), outputIndex);
+					outputIndex += l;
+					pos = t * 8;
+					continue;
+				} else if (type === 1) {
+					lengthMap = fixedLengthMap;
+					distMap = fixedDistanceMap;
+					lengthBits = 9;
+					distBits = 5;
+				} else if (type === 2) {
+					const hLiteral = bits(input, pos, 31) + 257;
+					const hcLengths = bits(input, pos + 10, 15) + 4;
+					const tl = hLiteral + bits(input, pos + 5, 31) + 1;
+					pos += 14;
+					const lengthDistanceTree = new Uint8Array(tl);
+					const codeLengthTree = /* @__PURE__ */ new Uint8Array(19);
+					for (let i = 0; i < hcLengths; ++i) codeLengthTree[codeLengthIndexMap[i]] = bits(input, pos + i * 3, 7);
+					pos += hcLengths * 3;
+					const codeLengthBits = Math.max(...codeLengthTree);
+					const clbMask = (1 << codeLengthBits) - 1;
+					const codeLengthMap = huffMap(codeLengthTree, codeLengthBits, 1);
+					for (let i = 0; i < tl;) {
+						const r = codeLengthMap[bits(input, pos, clbMask)];
+						if (limits && !r) throw new Error("invalid code length");
+						pos += r & 15;
+						const symbol = r >> 4;
+						if (symbol < 16) lengthDistanceTree[i++] = symbol;
+						else {
+							let copy = 0;
+							let n = 0;
+							if (symbol === 16) {
+								if (limits && i === 0) throw new Error("invalid code length repeat");
+								n = 3 + bits(input, pos, 3);
+								pos += 2;
+								copy = lengthDistanceTree[i - 1];
+							} else if (symbol === 17) {
+								n = 3 + bits(input, pos, 7);
+								pos += 3;
+							} else if (symbol === 18) {
+								n = 11 + bits(input, pos, 127);
+								pos += 7;
+							}
+							if (limits && i + n > tl) throw new Error("invalid code length repeat");
+							while (n--) lengthDistanceTree[i++] = copy;
+						}
+					}
+					const lengthTree = lengthDistanceTree.subarray(0, hLiteral);
+					const distanceTree = lengthDistanceTree.subarray(hLiteral);
+					lengthBits = Math.max(...lengthTree);
+					distBits = Math.max(...distanceTree);
+					lengthMap = huffMap(lengthTree, lengthBits, 1);
+					distMap = huffMap(distanceTree, distBits, 1);
+				} else throw new Error("invalid block type");
+				if (pos > totalBits) throw new Error("unexpected EOF");
+			}
+			ensureSize(limits ? Math.min(maximum, outputIndex + 131072) : outputIndex + 131072);
+			const lms = (1 << lengthBits) - 1;
+			const dms = (1 << distBits) - 1;
+			for (;;) {
+				const code = lengthMap[bits16(input, pos) & lms];
+				const sym = code >> 4;
+				pos += code & 15;
+				if (pos > totalBits) throw new Error("unexpected EOF");
+				if (!code) throw new Error("invalid length/literal");
+				if (sym < 256) {
+					if (limits) ensureSize(outputIndex + 1);
+					out[outputIndex++] = sym;
+				} else if (sym === 256) {
+					lengthMap = void 0;
+					break;
+				} else {
+					let add = sym - 254;
+					if (sym > 264) {
+						const index = sym - 257;
+						const b = fixedLengthExtraBits[index];
+						add = bits(input, pos, (1 << b) - 1) + fixedLength[index];
+						pos += b;
+					}
+					if (!distMap) throw new Error("invalid distance map");
+					const d = distMap[bits16(input, pos) & dms];
+					const dsym = d >> 4;
+					if (!d) throw new Error("invalid distance");
+					if (limits && dsym > 29) throw new Error("invalid distance symbol");
+					pos += d & 15;
+					let dt = fixedDistance[dsym];
+					if (dsym > 3) {
+						const b = fixedDistanceExtraBits[dsym];
+						dt += bits16(input, pos) & (1 << b) - 1;
+						pos += b;
+					}
+					if (pos > totalBits) throw new Error("unexpected EOF");
+					const end = outputIndex + add;
+					if (outputIndex < dt) throw new Error("unexpected dictionary case");
+					ensureSize(end);
+					for (; outputIndex < end; outputIndex++) out[outputIndex] = out[outputIndex - dt];
+				}
+			}
+			if (lengthMap) final = 1;
+		} while (!final);
+		return pos;
+	}
+	if (limits && outputIndex !== out.length) return out.slice(0, outputIndex);
+	if (!output) return out.subarray(0, outputIndex);
+	return out;
+}
+export { gunzip };

package/dist/node_modules/.pnpm/{icebird@0.8.30_patch_hash_a400e343a199b1ca18601f96348011745ac6518fc07ffa71d5adfdd2ccc7d14f → icebird@0.8.30_patch_hash_1359a91da68522a736babe444880ae391f19455fbe47c346f76cec92c5c2e471}/node_modules/icebird/src/avro/avro.metadata.mjs

@@ -1,2 +1,3 @@
+import "./avro.budget.mjs";
 Array.from({ length: 128 }, (_, i) => BigInt(i >>> 1 ^ -(i & 1)));
 export {};

package/dist/node_modules/.pnpm/icebird@0.8.30_patch_hash_1359a91da68522a736babe444880ae391f19455fbe47c346f76cec92c5c2e471/node_modules/icebird/src/avro/avro.read.mjs

@@ -0,0 +1,6 @@
+import "../../../../../hyparquet@1.31.1/node_modules/hyparquet/src/convert.mjs";
+import "../../../../../hyparquet-compressors@1.1.2_patch_hash_3f8f44805c034b2563763dcd5d37050ea6b1d5d45b46ea37adc4a721e748a1c5/node_modules/hyparquet-compressors/src/index.mjs";
+import "./avro.budget.mjs";
+import "./avro.metadata.mjs";
+new TextDecoder();
+export {};

package/dist/node_modules/.pnpm/{icebird@0.8.30_patch_hash_a400e343a199b1ca18601f96348011745ac6518fc07ffa71d5adfdd2ccc7d14f → icebird@0.8.30_patch_hash_1359a91da68522a736babe444880ae391f19455fbe47c346f76cec92c5c2e471}/node_modules/icebird/src/fetch.mjs

@@ -1,6 +1,6 @@
 import "../../../../hyparquet@1.31.1/node_modules/hyparquet/src/node.mjs";
 import "../../../../hyparquet-writer@0.16.10_patch_hash_d26d002aede61ad95dd633d6557b56897cdcbc45dfc3a5d93fa0e9075ad5425f/node_modules/hyparquet-writer/src/node.mjs";
-import "../../../../hyparquet-compressors@1.1.2/node_modules/hyparquet-compressors/src/index.mjs";
+import "../../../../hyparquet-compressors@1.1.2_patch_hash_3f8f44805c034b2563763dcd5d37050ea6b1d5d45b46ea37adc4a721e748a1c5/node_modules/hyparquet-compressors/src/index.mjs";
 import "./avro/avro.metadata.mjs";
 import "./avro/avro.read.mjs";
 import "./utils.mjs";

package/dist/node_modules/.pnpm/{icebird@0.8.30_patch_hash_a400e343a199b1ca18601f96348011745ac6518fc07ffa71d5adfdd2ccc7d14f → icebird@0.8.30_patch_hash_1359a91da68522a736babe444880ae391f19455fbe47c346f76cec92c5c2e471}/node_modules/icebird/src/manifest.mjs

@@ -1,3 +1,4 @@
+import "./avro/avro.budget.mjs";
 import "./avro/avro.metadata.mjs";
 import "./avro/avro.read.mjs";
 import "./fetch.mjs";

package/dist/node_modules/.pnpm/{icebird@0.8.30_patch_hash_a400e343a199b1ca18601f96348011745ac6518fc07ffa71d5adfdd2ccc7d14f → icebird@0.8.30_patch_hash_1359a91da68522a736babe444880ae391f19455fbe47c346f76cec92c5c2e471}/node_modules/icebird/src/read.mjs

@@ -2,7 +2,7 @@ import "../../../../hyparquet@1.31.1/node_modules/hyparquet/src/schema.mjs";
 import "../../../../hyparquet@1.31.1/node_modules/hyparquet/src/utils.mjs";
 import "../../../../hyparquet@1.31.1/node_modules/hyparquet/src/filter.mjs";
 import "../../../../hyparquet@1.31.1/node_modules/hyparquet/src/node.mjs";
-import "../../../../hyparquet-compressors@1.1.2/node_modules/hyparquet-compressors/src/index.mjs";
+import "../../../../hyparquet-compressors@1.1.2_patch_hash_3f8f44805c034b2563763dcd5d37050ea6b1d5d45b46ea37adc4a721e748a1c5/node_modules/hyparquet-compressors/src/index.mjs";
 import "./utils.mjs";
 import "./delete.mjs";
 import "./fetch.mjs";

package/dist/node_modules/.pnpm/icebird@0.8.30_patch_hash_1359a91da68522a736babe444880ae391f19455fbe47c346f76cec92c5c2e471/node_modules/icebird/src/write/geospatial.mjs

@@ -0,0 +1 @@
+export {};

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@gscdump/engine",
   "type": "module",
-  "version": "7.6.0",
+  "version": "7.8.0",
   "description": "Append-only Parquet/DuckDB storage engine + planner + adapters for the gscdump pipeline. Node + edge runtimes; opt-in heavy peers.",
   "author": {
     "name": "Harlan Wilton",
@@ -189,10 +189,10 @@
     }
   },
   "dependencies": {
-    "@gscdump/contracts": "^7.6.0",
-    "@gscdump/lakehouse": "^7.6.0",
+    "@gscdump/contracts": "^7.8.0",
+    "@gscdump/lakehouse": "^7.8.0",
     "drizzle-orm": "1.0.0-rc.4",
-    "gscdump": "^7.6.0",
+    "gscdump": "^7.8.0",
     "pathe": "^2.0.3",
     "proper-lockfile": "^4.1.2"
   },

package/dist/node_modules/.pnpm/hyparquet-compressors@1.1.2/node_modules/hyparquet-compressors/src/gzip.mjs

@@ -1,173 +0,0 @@
-import { fixedDistance, fixedDistanceExtraBits, fixedDistanceMap, fixedLength, fixedLengthExtraBits, fixedLengthMap, huffMap } from "./gzip.huffman.mjs";
-const codeLengthIndexMap = new Uint8Array([
-	16,
-	17,
-	18,
-	0,
-	8,
-	7,
-	9,
-	6,
-	10,
-	5,
-	11,
-	4,
-	12,
-	3,
-	13,
-	2,
-	14,
-	1,
-	15
-]);
-function bits(input, pos, mask) {
-	const o = pos / 8 | 0;
-	return (input[o] | input[o + 1] << 8) >> (pos & 7) & mask;
-}
-function bits16(d, p) {
-	const o = p / 8 | 0;
-	return (d[o] | d[o + 1] << 8 | d[o + 2] << 16) >> (p & 7);
-}
-function shft(p) {
-	return (p + 7) / 8 | 0;
-}
-function gzipStart(input, i) {
-	if (input[i++] !== 31 || input[i++] !== 139 || input[i++] !== 8) return 0;
-	const flag = input[i++];
-	i += 6;
-	if (flag & 4) i += (input[i + 10] | input[i + 11] << 8) + 2;
-	for (let zs = (flag >> 3 & 1) + (flag >> 4 & 1); zs > 0; zs -= Number(!input[i++]));
-	return i + (flag & 2);
-}
-function gunzip(input, output, inputIndex = 0, outputIndex = 0) {
-	let out = output ?? /* @__PURE__ */ new Uint8Array(1024);
-	if (!(input.length - inputIndex)) return out;
-	const payloadStart = gzipStart(input, inputIndex);
-	if (payloadStart === input.length - 8) return out;
-	if (payloadStart > input.length - 8) throw new Error("unexpected EOF");
-	let pos = payloadStart * 8;
-	let final = 0;
-	let lengthBits = 0;
-	let distBits = 0;
-	let lengthMap;
-	let distMap;
-	const totalBits = input.length * 8;
-	function ensureSize(length) {
-		if (!output && length > out.length) {
-			const old = out;
-			out = new Uint8Array(Math.max(old.length * 2, length));
-			out.set(old);
-		}
-	}
-	do {
-		if (!lengthMap) {
-			final = bits(input, pos, 1);
-			const type = bits(input, pos + 1, 3);
-			pos += 3;
-			if (!type) {
-				const s = shft(pos) + 4;
-				const l = input[s - 4] | input[s - 3] << 8;
-				const t = s + l;
-				if (t > input.length) throw new Error("unexpected EOF");
-				ensureSize(outputIndex + l);
-				out.set(input.subarray(s, t), outputIndex);
-				outputIndex += l;
-				pos = t * 8;
-				continue;
-			} else if (type === 1) {
-				lengthMap = fixedLengthMap;
-				distMap = fixedDistanceMap;
-				lengthBits = 9;
-				distBits = 5;
-			} else if (type === 2) {
-				const hLiteral = bits(input, pos, 31) + 257;
-				const hcLengths = bits(input, pos + 10, 15) + 4;
-				const tl = hLiteral + bits(input, pos + 5, 31) + 1;
-				pos += 14;
-				const lengthDistanceTree = new Uint8Array(tl);
-				const codeLengthTree = /* @__PURE__ */ new Uint8Array(19);
-				for (let i = 0; i < hcLengths; ++i) codeLengthTree[codeLengthIndexMap[i]] = bits(input, pos + i * 3, 7);
-				pos += hcLengths * 3;
-				const codeLengthBits = Math.max(...codeLengthTree);
-				const clbMask = (1 << codeLengthBits) - 1;
-				const codeLengthMap = huffMap(codeLengthTree, codeLengthBits, 1);
-				for (let i = 0; i < tl;) {
-					const r = codeLengthMap[bits(input, pos, clbMask)];
-					pos += r & 15;
-					const symbol = r >> 4;
-					if (symbol < 16) lengthDistanceTree[i++] = symbol;
-					else {
-						let copy = 0;
-						let n = 0;
-						if (symbol === 16) {
-							n = 3 + bits(input, pos, 3);
-							pos += 2;
-							copy = lengthDistanceTree[i - 1];
-						} else if (symbol === 17) {
-							n = 3 + bits(input, pos, 7);
-							pos += 3;
-						} else if (symbol === 18) {
-							n = 11 + bits(input, pos, 127);
-							pos += 7;
-						}
-						while (n--) lengthDistanceTree[i++] = copy;
-					}
-				}
-				const lengthTree = lengthDistanceTree.subarray(0, hLiteral);
-				const distanceTree = lengthDistanceTree.subarray(hLiteral);
-				lengthBits = Math.max(...lengthTree);
-				distBits = Math.max(...distanceTree);
-				lengthMap = huffMap(lengthTree, lengthBits, 1);
-				distMap = huffMap(distanceTree, distBits, 1);
-			} else throw new Error("invalid block type");
-			if (pos > totalBits) throw new Error("unexpected EOF");
-		}
-		ensureSize(outputIndex + 131072);
-		const lms = (1 << lengthBits) - 1;
-		const dms = (1 << distBits) - 1;
-		for (;;) {
-			const code = lengthMap[bits16(input, pos) & lms];
-			const sym = code >> 4;
-			pos += code & 15;
-			if (pos > totalBits) throw new Error("unexpected EOF");
-			if (!code) throw new Error("invalid length/literal");
-			if (sym < 256) out[outputIndex++] = sym;
-			else if (sym === 256) {
-				lengthMap = void 0;
-				break;
-			} else {
-				let add = sym - 254;
-				if (sym > 264) {
-					const index = sym - 257;
-					const b = fixedLengthExtraBits[index];
-					add = bits(input, pos, (1 << b) - 1) + fixedLength[index];
-					pos += b;
-				}
-				if (!distMap) throw new Error("invalid distance map");
-				const d = distMap[bits16(input, pos) & dms];
-				const dsym = d >> 4;
-				if (!d) throw new Error("invalid distance");
-				pos += d & 15;
-				let dt = fixedDistance[dsym];
-				if (dsym > 3) {
-					const b = fixedDistanceExtraBits[dsym];
-					dt += bits16(input, pos) & (1 << b) - 1;
-					pos += b;
-				}
-				if (pos > totalBits) throw new Error("unexpected EOF");
-				const end = outputIndex + add;
-				if (outputIndex < dt) throw new Error("unexpected dictionary case");
-				ensureSize(end);
-				for (; outputIndex < end; outputIndex++) out[outputIndex] = out[outputIndex - dt];
-			}
-		}
-		if (lengthMap) final = 1;
-	} while (!final);
-	if (outputIndex < out.length) {
-		const nextBlock = Math.ceil(pos / 8) + 8;
-		gunzip(input, out, nextBlock, outputIndex);
-	}
-	if (!output) return out.subarray(0, outputIndex);
-	return out;
-}
-export { gunzip };

package/dist/node_modules/.pnpm/icebird@0.8.30_patch_hash_a400e343a199b1ca18601f96348011745ac6518fc07ffa71d5adfdd2ccc7d14f/node_modules/icebird/src/avro/avro.read.mjs

@@ -1,5 +0,0 @@
-import "../../../../../hyparquet@1.31.1/node_modules/hyparquet/src/convert.mjs";
-import "../../../../../hyparquet-compressors@1.1.2/node_modules/hyparquet-compressors/src/index.mjs";
-import "./avro.metadata.mjs";
-new TextDecoder();
-export {};