@eclesia/indexer-engine 2.10.0 → 2.11.0

package/dist/node_modules/.pnpm/@cosmjs_encoding@0.36.0/node_modules/@cosmjs/encoding/build/index.mjs

@@ -0,0 +1,103 @@
+import { __commonJS } from "../../../../../../../_virtual/rolldown_runtime.mjs";
+import { require_ascii } from "./ascii.mjs";
+import { require_base64 } from "./base64.mjs";
+import { require_bech32 } from "./bech32.mjs";
+import { require_hex } from "./hex.mjs";
+import { require_rfc3339 } from "./rfc3339.mjs";
+import { require_utf8 } from "./utf8.mjs";
+
+//#region ../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/index.js
+var require_build = /* @__PURE__ */ __commonJS({ "../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/index.js": ((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.toUtf8 = exports.fromUtf8 = exports.toRfc3339 = exports.fromRfc3339 = exports.toHex = exports.fromHex = exports.toBech32 = exports.normalizeBech32 = exports.fromBech32 = exports.toBase64 = exports.fromBase64 = exports.toAscii = exports.fromAscii = void 0;
+	var ascii_1 = require_ascii();
+	Object.defineProperty(exports, "fromAscii", {
+		enumerable: true,
+		get: function() {
+			return ascii_1.fromAscii;
+		}
+	});
+	Object.defineProperty(exports, "toAscii", {
+		enumerable: true,
+		get: function() {
+			return ascii_1.toAscii;
+		}
+	});
+	var base64_1 = require_base64();
+	Object.defineProperty(exports, "fromBase64", {
+		enumerable: true,
+		get: function() {
+			return base64_1.fromBase64;
+		}
+	});
+	Object.defineProperty(exports, "toBase64", {
+		enumerable: true,
+		get: function() {
+			return base64_1.toBase64;
+		}
+	});
+	var bech32_1 = require_bech32();
+	Object.defineProperty(exports, "fromBech32", {
+		enumerable: true,
+		get: function() {
+			return bech32_1.fromBech32;
+		}
+	});
+	Object.defineProperty(exports, "normalizeBech32", {
+		enumerable: true,
+		get: function() {
+			return bech32_1.normalizeBech32;
+		}
+	});
+	Object.defineProperty(exports, "toBech32", {
+		enumerable: true,
+		get: function() {
+			return bech32_1.toBech32;
+		}
+	});
+	var hex_1 = require_hex();
+	Object.defineProperty(exports, "fromHex", {
+		enumerable: true,
+		get: function() {
+			return hex_1.fromHex;
+		}
+	});
+	Object.defineProperty(exports, "toHex", {
+		enumerable: true,
+		get: function() {
+			return hex_1.toHex;
+		}
+	});
+	var rfc3339_1 = require_rfc3339();
+	Object.defineProperty(exports, "fromRfc3339", {
+		enumerable: true,
+		get: function() {
+			return rfc3339_1.fromRfc3339;
+		}
+	});
+	Object.defineProperty(exports, "toRfc3339", {
+		enumerable: true,
+		get: function() {
+			return rfc3339_1.toRfc3339;
+		}
+	});
+	var utf8_1 = require_utf8();
+	Object.defineProperty(exports, "fromUtf8", {
+		enumerable: true,
+		get: function() {
+			return utf8_1.fromUtf8;
+		}
+	});
+	Object.defineProperty(exports, "toUtf8", {
+		enumerable: true,
+		get: function() {
+			return utf8_1.toUtf8;
+		}
+	});
+}) });
+
+//#endregion
+export default require_build();
+
+export { require_build };
+//# sourceMappingURL=index.mjs.map

package/dist/node_modules/.pnpm/@cosmjs_encoding@0.36.0/node_modules/@cosmjs/encoding/build/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":[],"sources":["../../../../../../../../../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.toUtf8 = exports.fromUtf8 = exports.toRfc3339 = exports.fromRfc3339 = exports.toHex = exports.fromHex = exports.toBech32 = exports.normalizeBech32 = exports.fromBech32 = exports.toBase64 = exports.fromBase64 = exports.toAscii = exports.fromAscii = void 0;\nvar ascii_1 = require(\"./ascii\");\nObject.defineProperty(exports, \"fromAscii\", { enumerable: true, get: function () { return ascii_1.fromAscii; } });\nObject.defineProperty(exports, \"toAscii\", { enumerable: true, get: function () { return ascii_1.toAscii; } });\nvar base64_1 = require(\"./base64\");\nObject.defineProperty(exports, \"fromBase64\", { enumerable: true, get: function () { return base64_1.fromBase64; } });\nObject.defineProperty(exports, \"toBase64\", { enumerable: true, get: function () { return base64_1.toBase64; } });\nvar bech32_1 = require(\"./bech32\");\nObject.defineProperty(exports, \"fromBech32\", { enumerable: true, get: function () { return bech32_1.fromBech32; } });\nObject.defineProperty(exports, \"normalizeBech32\", { enumerable: true, get: function () { return bech32_1.normalizeBech32; } });\nObject.defineProperty(exports, \"toBech32\", { enumerable: true, get: function () { return bech32_1.toBech32; } });\nvar hex_1 = require(\"./hex\");\nObject.defineProperty(exports, \"fromHex\", { enumerable: true, get: function () { return hex_1.fromHex; } });\nObject.defineProperty(exports, \"toHex\", { enumerable: true, get: function () { return hex_1.toHex; } });\nvar rfc3339_1 = require(\"./rfc3339\");\nObject.defineProperty(exports, \"fromRfc3339\", { enumerable: true, get: function () { return rfc3339_1.fromRfc3339; } });\nObject.defineProperty(exports, \"toRfc3339\", { enumerable: true, get: function () { return rfc3339_1.toRfc3339; } });\nvar utf8_1 = require(\"./utf8\");\nObject.defineProperty(exports, \"fromUtf8\", { enumerable: true, get: function () { return utf8_1.fromUtf8; } });\nObject.defineProperty(exports, \"toUtf8\", { enumerable: true, get: function () { return utf8_1.toUtf8; } });\n//# sourceMappingURL=index.js.map"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;AACA,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM,CAAC;AAC7D,SAAQ,SAAS,QAAQ,WAAW,QAAQ,YAAY,QAAQ,cAAc,QAAQ,QAAQ,QAAQ,UAAU,QAAQ,WAAW,QAAQ,kBAAkB,QAAQ,aAAa,QAAQ,WAAW,QAAQ,aAAa,QAAQ,UAAU,QAAQ,YAAY,KAAK;CACrQ,IAAI;AACJ,QAAO,eAAe,SAAS,aAAa;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,QAAQ;;EAAc,CAAC;AACjH,QAAO,eAAe,SAAS,WAAW;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,QAAQ;;EAAY,CAAC;CAC7G,IAAI;AACJ,QAAO,eAAe,SAAS,cAAc;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,SAAS;;EAAe,CAAC;AACpH,QAAO,eAAe,SAAS,YAAY;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,SAAS;;EAAa,CAAC;CAChH,IAAI;AACJ,QAAO,eAAe,SAAS,cAAc;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,SAAS;;EAAe,CAAC;AACpH,QAAO,eAAe,SAAS,mBAAmB;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,SAAS;;EAAoB,CAAC;AAC9H,QAAO,eAAe,SAAS,YAAY;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,SAAS;;EAAa,CAAC;CAChH,IAAI;AACJ,QAAO,eAAe,SAAS,WAAW;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,MAAM;;EAAY,CAAC;AAC3G,QAAO,eAAe,SAAS,SAAS;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,MAAM;;EAAU,CAAC;CACvG,IAAI;AACJ,QAAO,eAAe,SAAS,eAAe;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,UAAU;;EAAgB,CAAC;AACvH,QAAO,eAAe,SAAS,aAAa;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,UAAU;;EAAc,CAAC;CACnH,IAAI;AACJ,QAAO,eAAe,SAAS,YAAY;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,OAAO;;EAAa,CAAC;AAC9G,QAAO,eAAe,SAAS,UAAU;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,OAAO;;EAAW,CAAC"}

package/dist/node_modules/.pnpm/@cosmjs_encoding@0.36.0/node_modules/@cosmjs/encoding/build/rfc3339.cjs

@@ -0,0 +1,52 @@
+const require_rolldown_runtime = require('../../../../../../../_virtual/rolldown_runtime.cjs');
+
+//#region ../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/rfc3339.js
+var require_rfc3339 = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/rfc3339.js": ((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.fromRfc3339 = fromRfc3339;
+	exports.toRfc3339 = toRfc3339;
+	const rfc3339Matcher = /^(\d{4})-(\d{2})-(\d{2})[T ](\d{2}):(\d{2}):(\d{2})(\.\d{1,9})?((?:[+-]\d{2}:\d{2})|Z)$/;
+	function padded(integer, length = 2) {
+		return integer.toString().padStart(length, "0");
+	}
+	function fromRfc3339(str) {
+		const matches = rfc3339Matcher.exec(str);
+		if (!matches) throw new Error("Date string is not in RFC3339 format");
+		const year = +matches[1];
+		const month = +matches[2];
+		const day = +matches[3];
+		const hour = +matches[4];
+		const minute = +matches[5];
+		const second = +matches[6];
+		const milliSeconds = matches[7] ? Math.floor(+matches[7] * 1e3) : 0;
+		let tzOffsetSign;
+		let tzOffsetHours;
+		let tzOffsetMinutes;
+		if (matches[8] === "Z") {
+			tzOffsetSign = 1;
+			tzOffsetHours = 0;
+			tzOffsetMinutes = 0;
+		} else {
+			tzOffsetSign = matches[8].substring(0, 1) === "-" ? -1 : 1;
+			tzOffsetHours = +matches[8].substring(1, 3);
+			tzOffsetMinutes = +matches[8].substring(4, 6);
+		}
+		const tzOffset = tzOffsetSign * (tzOffsetHours * 60 + tzOffsetMinutes) * 60;
+		const date = /* @__PURE__ */ new Date();
+		date.setUTCFullYear(year, month - 1, day);
+		date.setUTCHours(hour, minute, second, milliSeconds);
+		return /* @__PURE__ */ new Date(date.getTime() - tzOffset * 1e3);
+	}
+	function toRfc3339(date) {
+		return `${date.getUTCFullYear()}-${padded(date.getUTCMonth() + 1)}-${padded(date.getUTCDate())}T${padded(date.getUTCHours())}:${padded(date.getUTCMinutes())}:${padded(date.getUTCSeconds())}.${padded(date.getUTCMilliseconds(), 3)}Z`;
+	}
+}) });
+
+//#endregion
+Object.defineProperty(exports, 'default', {
+  enumerable: true,
+  get: function () {
+    return require_rfc3339();
+  }
+});
+//# sourceMappingURL=rfc3339.cjs.map

package/dist/node_modules/.pnpm/@cosmjs_encoding@0.36.0/node_modules/@cosmjs/encoding/build/rfc3339.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"rfc3339.cjs","names":[],"sources":["../../../../../../../../../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/rfc3339.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.fromRfc3339 = fromRfc3339;\nexports.toRfc3339 = toRfc3339;\nconst rfc3339Matcher = /^(\\d{4})-(\\d{2})-(\\d{2})[T ](\\d{2}):(\\d{2}):(\\d{2})(\\.\\d{1,9})?((?:[+-]\\d{2}:\\d{2})|Z)$/;\nfunction padded(integer, length = 2) {\n    return integer.toString().padStart(length, \"0\");\n}\nfunction fromRfc3339(str) {\n    const matches = rfc3339Matcher.exec(str);\n    if (!matches) {\n        throw new Error(\"Date string is not in RFC3339 format\");\n    }\n    const year = +matches[1];\n    const month = +matches[2];\n    const day = +matches[3];\n    const hour = +matches[4];\n    const minute = +matches[5];\n    const second = +matches[6];\n    // fractional seconds match either undefined or a string like \".1\", \".123456789\"\n    const milliSeconds = matches[7] ? Math.floor(+matches[7] * 1000) : 0;\n    let tzOffsetSign;\n    let tzOffsetHours;\n    let tzOffsetMinutes;\n    // if timezone is undefined, it must be Z or nothing (otherwise the group would have captured).\n    if (matches[8] === \"Z\") {\n        tzOffsetSign = 1;\n        tzOffsetHours = 0;\n        tzOffsetMinutes = 0;\n    }\n    else {\n        tzOffsetSign = matches[8].substring(0, 1) === \"-\" ? -1 : 1;\n        tzOffsetHours = +matches[8].substring(1, 3);\n        tzOffsetMinutes = +matches[8].substring(4, 6);\n    }\n    const tzOffset = tzOffsetSign * (tzOffsetHours * 60 + tzOffsetMinutes) * 60; // seconds\n    const date = new Date();\n    date.setUTCFullYear(year, month - 1, day);\n    date.setUTCHours(hour, minute, second, milliSeconds);\n    return new Date(date.getTime() - tzOffset * 1000);\n}\nfunction toRfc3339(date) {\n    const year = date.getUTCFullYear();\n    const month = padded(date.getUTCMonth() + 1);\n    const day = padded(date.getUTCDate());\n    const hour = padded(date.getUTCHours());\n    const minute = padded(date.getUTCMinutes());\n    const second = padded(date.getUTCSeconds());\n    const ms = padded(date.getUTCMilliseconds(), 3);\n    return `${year}-${month}-${day}T${hour}:${minute}:${second}.${ms}Z`;\n}\n//# sourceMappingURL=rfc3339.js.map"],"x_google_ignoreList":[0],"mappings":";;;;AACA,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM,CAAC;AAC7D,SAAQ,cAAc;AACtB,SAAQ,YAAY;CACpB,MAAM,iBAAiB;CACvB,SAAS,OAAO,SAAS,SAAS,GAAG;AACjC,SAAO,QAAQ,UAAU,CAAC,SAAS,QAAQ,IAAI;;CAEnD,SAAS,YAAY,KAAK;EACtB,MAAM,UAAU,eAAe,KAAK,IAAI;AACxC,MAAI,CAAC,QACD,OAAM,IAAI,MAAM,uCAAuC;EAE3D,MAAM,OAAO,CAAC,QAAQ;EACtB,MAAM,QAAQ,CAAC,QAAQ;EACvB,MAAM,MAAM,CAAC,QAAQ;EACrB,MAAM,OAAO,CAAC,QAAQ;EACtB,MAAM,SAAS,CAAC,QAAQ;EACxB,MAAM,SAAS,CAAC,QAAQ;EAExB,MAAM,eAAe,QAAQ,KAAK,KAAK,MAAM,CAAC,QAAQ,KAAK,IAAK,GAAG;EACnE,IAAI;EACJ,IAAI;EACJ,IAAI;AAEJ,MAAI,QAAQ,OAAO,KAAK;AACpB,kBAAe;AACf,mBAAgB;AAChB,qBAAkB;SAEjB;AACD,kBAAe,QAAQ,GAAG,UAAU,GAAG,EAAE,KAAK,MAAM,KAAK;AACzD,mBAAgB,CAAC,QAAQ,GAAG,UAAU,GAAG,EAAE;AAC3C,qBAAkB,CAAC,QAAQ,GAAG,UAAU,GAAG,EAAE;;EAEjD,MAAM,WAAW,gBAAgB,gBAAgB,KAAK,mBAAmB;EACzE,MAAM,uBAAO,IAAI,MAAM;AACvB,OAAK,eAAe,MAAM,QAAQ,GAAG,IAAI;AACzC,OAAK,YAAY,MAAM,QAAQ,QAAQ,aAAa;AACpD,yBAAO,IAAI,KAAK,KAAK,SAAS,GAAG,WAAW,IAAK;;CAErD,SAAS,UAAU,MAAM;AAQrB,SAAO,GAPM,KAAK,gBAAgB,CAOnB,GAND,OAAO,KAAK,aAAa,GAAG,EAAE,CAMpB,GALZ,OAAO,KAAK,YAAY,CAAC,CAKN,GAJlB,OAAO,KAAK,aAAa,CAAC,CAIA,GAHxB,OAAO,KAAK,eAAe,CAAC,CAGM,GAFlC,OAAO,KAAK,eAAe,CAAC,CAEgB,GADhD,OAAO,KAAK,oBAAoB,EAAE,EAAE,CACkB"}

package/dist/node_modules/.pnpm/@cosmjs_encoding@0.36.0/node_modules/@cosmjs/encoding/build/rfc3339.mjs

@@ -0,0 +1,49 @@
+import { __commonJS } from "../../../../../../../_virtual/rolldown_runtime.mjs";
+
+//#region ../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/rfc3339.js
+var require_rfc3339 = /* @__PURE__ */ __commonJS({ "../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/rfc3339.js": ((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.fromRfc3339 = fromRfc3339;
+	exports.toRfc3339 = toRfc3339;
+	const rfc3339Matcher = /^(\d{4})-(\d{2})-(\d{2})[T ](\d{2}):(\d{2}):(\d{2})(\.\d{1,9})?((?:[+-]\d{2}:\d{2})|Z)$/;
+	function padded(integer, length = 2) {
+		return integer.toString().padStart(length, "0");
+	}
+	function fromRfc3339(str) {
+		const matches = rfc3339Matcher.exec(str);
+		if (!matches) throw new Error("Date string is not in RFC3339 format");
+		const year = +matches[1];
+		const month = +matches[2];
+		const day = +matches[3];
+		const hour = +matches[4];
+		const minute = +matches[5];
+		const second = +matches[6];
+		const milliSeconds = matches[7] ? Math.floor(+matches[7] * 1e3) : 0;
+		let tzOffsetSign;
+		let tzOffsetHours;
+		let tzOffsetMinutes;
+		if (matches[8] === "Z") {
+			tzOffsetSign = 1;
+			tzOffsetHours = 0;
+			tzOffsetMinutes = 0;
+		} else {
+			tzOffsetSign = matches[8].substring(0, 1) === "-" ? -1 : 1;
+			tzOffsetHours = +matches[8].substring(1, 3);
+			tzOffsetMinutes = +matches[8].substring(4, 6);
+		}
+		const tzOffset = tzOffsetSign * (tzOffsetHours * 60 + tzOffsetMinutes) * 60;
+		const date = /* @__PURE__ */ new Date();
+		date.setUTCFullYear(year, month - 1, day);
+		date.setUTCHours(hour, minute, second, milliSeconds);
+		return /* @__PURE__ */ new Date(date.getTime() - tzOffset * 1e3);
+	}
+	function toRfc3339(date) {
+		return `${date.getUTCFullYear()}-${padded(date.getUTCMonth() + 1)}-${padded(date.getUTCDate())}T${padded(date.getUTCHours())}:${padded(date.getUTCMinutes())}:${padded(date.getUTCSeconds())}.${padded(date.getUTCMilliseconds(), 3)}Z`;
+	}
+}) });
+
+//#endregion
+export default require_rfc3339();
+
+export { require_rfc3339 };
+//# sourceMappingURL=rfc3339.mjs.map

package/dist/node_modules/.pnpm/@cosmjs_encoding@0.36.0/node_modules/@cosmjs/encoding/build/rfc3339.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"rfc3339.mjs","names":[],"sources":["../../../../../../../../../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/rfc3339.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.fromRfc3339 = fromRfc3339;\nexports.toRfc3339 = toRfc3339;\nconst rfc3339Matcher = /^(\\d{4})-(\\d{2})-(\\d{2})[T ](\\d{2}):(\\d{2}):(\\d{2})(\\.\\d{1,9})?((?:[+-]\\d{2}:\\d{2})|Z)$/;\nfunction padded(integer, length = 2) {\n    return integer.toString().padStart(length, \"0\");\n}\nfunction fromRfc3339(str) {\n    const matches = rfc3339Matcher.exec(str);\n    if (!matches) {\n        throw new Error(\"Date string is not in RFC3339 format\");\n    }\n    const year = +matches[1];\n    const month = +matches[2];\n    const day = +matches[3];\n    const hour = +matches[4];\n    const minute = +matches[5];\n    const second = +matches[6];\n    // fractional seconds match either undefined or a string like \".1\", \".123456789\"\n    const milliSeconds = matches[7] ? Math.floor(+matches[7] * 1000) : 0;\n    let tzOffsetSign;\n    let tzOffsetHours;\n    let tzOffsetMinutes;\n    // if timezone is undefined, it must be Z or nothing (otherwise the group would have captured).\n    if (matches[8] === \"Z\") {\n        tzOffsetSign = 1;\n        tzOffsetHours = 0;\n        tzOffsetMinutes = 0;\n    }\n    else {\n        tzOffsetSign = matches[8].substring(0, 1) === \"-\" ? -1 : 1;\n        tzOffsetHours = +matches[8].substring(1, 3);\n        tzOffsetMinutes = +matches[8].substring(4, 6);\n    }\n    const tzOffset = tzOffsetSign * (tzOffsetHours * 60 + tzOffsetMinutes) * 60; // seconds\n    const date = new Date();\n    date.setUTCFullYear(year, month - 1, day);\n    date.setUTCHours(hour, minute, second, milliSeconds);\n    return new Date(date.getTime() - tzOffset * 1000);\n}\nfunction toRfc3339(date) {\n    const year = date.getUTCFullYear();\n    const month = padded(date.getUTCMonth() + 1);\n    const day = padded(date.getUTCDate());\n    const hour = padded(date.getUTCHours());\n    const minute = padded(date.getUTCMinutes());\n    const second = padded(date.getUTCSeconds());\n    const ms = padded(date.getUTCMilliseconds(), 3);\n    return `${year}-${month}-${day}T${hour}:${minute}:${second}.${ms}Z`;\n}\n//# sourceMappingURL=rfc3339.js.map"],"x_google_ignoreList":[0],"mappings":";;;;AACA,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM,CAAC;AAC7D,SAAQ,cAAc;AACtB,SAAQ,YAAY;CACpB,MAAM,iBAAiB;CACvB,SAAS,OAAO,SAAS,SAAS,GAAG;AACjC,SAAO,QAAQ,UAAU,CAAC,SAAS,QAAQ,IAAI;;CAEnD,SAAS,YAAY,KAAK;EACtB,MAAM,UAAU,eAAe,KAAK,IAAI;AACxC,MAAI,CAAC,QACD,OAAM,IAAI,MAAM,uCAAuC;EAE3D,MAAM,OAAO,CAAC,QAAQ;EACtB,MAAM,QAAQ,CAAC,QAAQ;EACvB,MAAM,MAAM,CAAC,QAAQ;EACrB,MAAM,OAAO,CAAC,QAAQ;EACtB,MAAM,SAAS,CAAC,QAAQ;EACxB,MAAM,SAAS,CAAC,QAAQ;EAExB,MAAM,eAAe,QAAQ,KAAK,KAAK,MAAM,CAAC,QAAQ,KAAK,IAAK,GAAG;EACnE,IAAI;EACJ,IAAI;EACJ,IAAI;AAEJ,MAAI,QAAQ,OAAO,KAAK;AACpB,kBAAe;AACf,mBAAgB;AAChB,qBAAkB;SAEjB;AACD,kBAAe,QAAQ,GAAG,UAAU,GAAG,EAAE,KAAK,MAAM,KAAK;AACzD,mBAAgB,CAAC,QAAQ,GAAG,UAAU,GAAG,EAAE;AAC3C,qBAAkB,CAAC,QAAQ,GAAG,UAAU,GAAG,EAAE;;EAEjD,MAAM,WAAW,gBAAgB,gBAAgB,KAAK,mBAAmB;EACzE,MAAM,uBAAO,IAAI,MAAM;AACvB,OAAK,eAAe,MAAM,QAAQ,GAAG,IAAI;AACzC,OAAK,YAAY,MAAM,QAAQ,QAAQ,aAAa;AACpD,yBAAO,IAAI,KAAK,KAAK,SAAS,GAAG,WAAW,IAAK;;CAErD,SAAS,UAAU,MAAM;AAQrB,SAAO,GAPM,KAAK,gBAAgB,CAOnB,GAND,OAAO,KAAK,aAAa,GAAG,EAAE,CAMpB,GALZ,OAAO,KAAK,YAAY,CAAC,CAKN,GAJlB,OAAO,KAAK,aAAa,CAAC,CAIA,GAHxB,OAAO,KAAK,eAAe,CAAC,CAGM,GAFlC,OAAO,KAAK,eAAe,CAAC,CAEgB,GADhD,OAAO,KAAK,oBAAoB,EAAE,EAAE,CACkB"}

package/dist/node_modules/.pnpm/@cosmjs_encoding@0.36.0/node_modules/@cosmjs/encoding/build/utf8.cjs

@@ -0,0 +1,31 @@
+const require_rolldown_runtime = require('../../../../../../../_virtual/rolldown_runtime.cjs');
+
+//#region ../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/utf8.js
+var require_utf8 = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/utf8.js": ((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.toUtf8 = toUtf8;
+	exports.fromUtf8 = fromUtf8;
+	function toUtf8(str) {
+		return new TextEncoder().encode(str);
+	}
+	/**
+	* Takes UTF-8 data and decodes it to a string.
+	*
+	* In lossy mode, the [REPLACEMENT CHARACTER](https://en.wikipedia.org/wiki/Specials_(Unicode_block))
+	* is used to substitute invalid encodings.
+	* By default lossy mode is off and invalid data will lead to exceptions.
+	*/
+	function fromUtf8(data, lossy = false) {
+		const fatal = !lossy;
+		return new TextDecoder("utf-8", { fatal }).decode(data);
+	}
+}) });
+
+//#endregion
+Object.defineProperty(exports, 'default', {
+  enumerable: true,
+  get: function () {
+    return require_utf8();
+  }
+});
+//# sourceMappingURL=utf8.cjs.map

package/dist/node_modules/.pnpm/@cosmjs_encoding@0.36.0/node_modules/@cosmjs/encoding/build/utf8.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"utf8.cjs","names":[],"sources":["../../../../../../../../../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/utf8.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.toUtf8 = toUtf8;\nexports.fromUtf8 = fromUtf8;\nfunction toUtf8(str) {\n    return new TextEncoder().encode(str);\n}\n/**\n * Takes UTF-8 data and decodes it to a string.\n *\n * In lossy mode, the [REPLACEMENT CHARACTER](https://en.wikipedia.org/wiki/Specials_(Unicode_block))\n * is used to substitute invalid encodings.\n * By default lossy mode is off and invalid data will lead to exceptions.\n */\nfunction fromUtf8(data, lossy = false) {\n    const fatal = !lossy;\n    return new TextDecoder(\"utf-8\", { fatal }).decode(data);\n}\n//# sourceMappingURL=utf8.js.map"],"x_google_ignoreList":[0],"mappings":";;;;AACA,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM,CAAC;AAC7D,SAAQ,SAAS;AACjB,SAAQ,WAAW;CACnB,SAAS,OAAO,KAAK;AACjB,SAAO,IAAI,aAAa,CAAC,OAAO,IAAI;;;;;;;;;CASxC,SAAS,SAAS,MAAM,QAAQ,OAAO;EACnC,MAAM,QAAQ,CAAC;AACf,SAAO,IAAI,YAAY,SAAS,EAAE,OAAO,CAAC,CAAC,OAAO,KAAK"}

package/dist/node_modules/.pnpm/@cosmjs_encoding@0.36.0/node_modules/@cosmjs/encoding/build/utf8.mjs

@@ -0,0 +1,28 @@
+import { __commonJS } from "../../../../../../../_virtual/rolldown_runtime.mjs";
+
+//#region ../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/utf8.js
+var require_utf8 = /* @__PURE__ */ __commonJS({ "../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/utf8.js": ((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.toUtf8 = toUtf8;
+	exports.fromUtf8 = fromUtf8;
+	function toUtf8(str) {
+		return new TextEncoder().encode(str);
+	}
+	/**
+	* Takes UTF-8 data and decodes it to a string.
+	*
+	* In lossy mode, the [REPLACEMENT CHARACTER](https://en.wikipedia.org/wiki/Specials_(Unicode_block))
+	* is used to substitute invalid encodings.
+	* By default lossy mode is off and invalid data will lead to exceptions.
+	*/
+	function fromUtf8(data, lossy = false) {
+		const fatal = !lossy;
+		return new TextDecoder("utf-8", { fatal }).decode(data);
+	}
+}) });
+
+//#endregion
+export default require_utf8();
+
+export { require_utf8 };
+//# sourceMappingURL=utf8.mjs.map

package/dist/node_modules/.pnpm/@cosmjs_encoding@0.36.0/node_modules/@cosmjs/encoding/build/utf8.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"utf8.mjs","names":[],"sources":["../../../../../../../../../../node_modules/.pnpm/@cosmjs+encoding@0.36.0/node_modules/@cosmjs/encoding/build/utf8.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.toUtf8 = toUtf8;\nexports.fromUtf8 = fromUtf8;\nfunction toUtf8(str) {\n    return new TextEncoder().encode(str);\n}\n/**\n * Takes UTF-8 data and decodes it to a string.\n *\n * In lossy mode, the [REPLACEMENT CHARACTER](https://en.wikipedia.org/wiki/Specials_(Unicode_block))\n * is used to substitute invalid encodings.\n * By default lossy mode is off and invalid data will lead to exceptions.\n */\nfunction fromUtf8(data, lossy = false) {\n    const fatal = !lossy;\n    return new TextDecoder(\"utf-8\", { fatal }).decode(data);\n}\n//# sourceMappingURL=utf8.js.map"],"x_google_ignoreList":[0],"mappings":";;;;AACA,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM,CAAC;AAC7D,SAAQ,SAAS;AACjB,SAAQ,WAAW;CACnB,SAAS,OAAO,KAAK;AACjB,SAAO,IAAI,aAAa,CAAC,OAAO,IAAI;;;;;;;;;CASxC,SAAS,SAAS,MAAM,QAAQ,OAAO;EACnC,MAAM,QAAQ,CAAC;AACf,SAAO,IAAI,YAAY,SAAS,EAAE,OAAO,CAAC,CAAC,OAAO,KAAK"}

package/dist/node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.cjs

@@ -0,0 +1,98 @@
+const require_rolldown_runtime = require('../../../../../_virtual/rolldown_runtime.cjs');
+
+//#region ../../node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.js
+var require_base64_js = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.js": ((exports) => {
+	exports.byteLength = byteLength;
+	exports.toByteArray = toByteArray;
+	exports.fromByteArray = fromByteArray;
+	var lookup = [];
+	var revLookup = [];
+	var Arr = typeof Uint8Array !== "undefined" ? Uint8Array : Array;
+	var code = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+	for (var i = 0, len = code.length; i < len; ++i) {
+		lookup[i] = code[i];
+		revLookup[code.charCodeAt(i)] = i;
+	}
+	revLookup["-".charCodeAt(0)] = 62;
+	revLookup["_".charCodeAt(0)] = 63;
+	function getLens(b64) {
+		var len$1 = b64.length;
+		if (len$1 % 4 > 0) throw new Error("Invalid string. Length must be a multiple of 4");
+		var validLen = b64.indexOf("=");
+		if (validLen === -1) validLen = len$1;
+		var placeHoldersLen = validLen === len$1 ? 0 : 4 - validLen % 4;
+		return [validLen, placeHoldersLen];
+	}
+	function byteLength(b64) {
+		var lens = getLens(b64);
+		var validLen = lens[0];
+		var placeHoldersLen = lens[1];
+		return (validLen + placeHoldersLen) * 3 / 4 - placeHoldersLen;
+	}
+	function _byteLength(b64, validLen, placeHoldersLen) {
+		return (validLen + placeHoldersLen) * 3 / 4 - placeHoldersLen;
+	}
+	function toByteArray(b64) {
+		var tmp;
+		var lens = getLens(b64);
+		var validLen = lens[0];
+		var placeHoldersLen = lens[1];
+		var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen));
+		var curByte = 0;
+		var len$1 = placeHoldersLen > 0 ? validLen - 4 : validLen;
+		var i$1;
+		for (i$1 = 0; i$1 < len$1; i$1 += 4) {
+			tmp = revLookup[b64.charCodeAt(i$1)] << 18 | revLookup[b64.charCodeAt(i$1 + 1)] << 12 | revLookup[b64.charCodeAt(i$1 + 2)] << 6 | revLookup[b64.charCodeAt(i$1 + 3)];
+			arr[curByte++] = tmp >> 16 & 255;
+			arr[curByte++] = tmp >> 8 & 255;
+			arr[curByte++] = tmp & 255;
+		}
+		if (placeHoldersLen === 2) {
+			tmp = revLookup[b64.charCodeAt(i$1)] << 2 | revLookup[b64.charCodeAt(i$1 + 1)] >> 4;
+			arr[curByte++] = tmp & 255;
+		}
+		if (placeHoldersLen === 1) {
+			tmp = revLookup[b64.charCodeAt(i$1)] << 10 | revLookup[b64.charCodeAt(i$1 + 1)] << 4 | revLookup[b64.charCodeAt(i$1 + 2)] >> 2;
+			arr[curByte++] = tmp >> 8 & 255;
+			arr[curByte++] = tmp & 255;
+		}
+		return arr;
+	}
+	function tripletToBase64(num) {
+		return lookup[num >> 18 & 63] + lookup[num >> 12 & 63] + lookup[num >> 6 & 63] + lookup[num & 63];
+	}
+	function encodeChunk(uint8, start, end) {
+		var tmp;
+		var output = [];
+		for (var i$1 = start; i$1 < end; i$1 += 3) {
+			tmp = (uint8[i$1] << 16 & 16711680) + (uint8[i$1 + 1] << 8 & 65280) + (uint8[i$1 + 2] & 255);
+			output.push(tripletToBase64(tmp));
+		}
+		return output.join("");
+	}
+	function fromByteArray(uint8) {
+		var tmp;
+		var len$1 = uint8.length;
+		var extraBytes = len$1 % 3;
+		var parts = [];
+		var maxChunkLength = 16383;
+		for (var i$1 = 0, len2 = len$1 - extraBytes; i$1 < len2; i$1 += maxChunkLength) parts.push(encodeChunk(uint8, i$1, i$1 + maxChunkLength > len2 ? len2 : i$1 + maxChunkLength));
+		if (extraBytes === 1) {
+			tmp = uint8[len$1 - 1];
+			parts.push(lookup[tmp >> 2] + lookup[tmp << 4 & 63] + "==");
+		} else if (extraBytes === 2) {
+			tmp = (uint8[len$1 - 2] << 8) + uint8[len$1 - 1];
+			parts.push(lookup[tmp >> 10] + lookup[tmp >> 4 & 63] + lookup[tmp << 2 & 63] + "=");
+		}
+		return parts.join("");
+	}
+}) });
+
+//#endregion
+Object.defineProperty(exports, 'default', {
+  enumerable: true,
+  get: function () {
+    return require_base64_js();
+  }
+});
+//# sourceMappingURL=index.cjs.map

package/dist/node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","names":["len","i"],"sources":["../../../../../../../../node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.js"],"sourcesContent":["'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;AAEA,SAAQ,aAAa;AACrB,SAAQ,cAAc;AACtB,SAAQ,gBAAgB;CAExB,IAAI,SAAS,EAAE;CACf,IAAI,YAAY,EAAE;CAClB,IAAI,MAAM,OAAO,eAAe,cAAc,aAAa;CAE3D,IAAI,OAAO;AACX,MAAK,IAAI,IAAI,GAAG,MAAM,KAAK,QAAQ,IAAI,KAAK,EAAE,GAAG;AAC/C,SAAO,KAAK,KAAK;AACjB,YAAU,KAAK,WAAW,EAAE,IAAI;;AAKlC,WAAU,IAAI,WAAW,EAAE,IAAI;AAC/B,WAAU,IAAI,WAAW,EAAE,IAAI;CAE/B,SAAS,QAAS,KAAK;EACrB,IAAIA,QAAM,IAAI;AAEd,MAAIA,QAAM,IAAI,EACZ,OAAM,IAAI,MAAM,iDAAiD;EAKnE,IAAI,WAAW,IAAI,QAAQ,IAAI;AAC/B,MAAI,aAAa,GAAI,YAAWA;EAEhC,IAAI,kBAAkB,aAAaA,QAC/B,IACA,IAAK,WAAW;AAEpB,SAAO,CAAC,UAAU,gBAAgB;;CAIpC,SAAS,WAAY,KAAK;EACxB,IAAI,OAAO,QAAQ,IAAI;EACvB,IAAI,WAAW,KAAK;EACpB,IAAI,kBAAkB,KAAK;AAC3B,UAAS,WAAW,mBAAmB,IAAI,IAAK;;CAGlD,SAAS,YAAa,KAAK,UAAU,iBAAiB;AACpD,UAAS,WAAW,mBAAmB,IAAI,IAAK;;CAGlD,SAAS,YAAa,KAAK;EACzB,IAAI;EACJ,IAAI,OAAO,QAAQ,IAAI;EACvB,IAAI,WAAW,KAAK;EACpB,IAAI,kBAAkB,KAAK;EAE3B,IAAI,MAAM,IAAI,IAAI,YAAY,KAAK,UAAU,gBAAgB,CAAC;EAE9D,IAAI,UAAU;EAGd,IAAIA,QAAM,kBAAkB,IACxB,WAAW,IACX;EAEJ,IAAIC;AACJ,OAAK,MAAI,GAAGA,MAAID,OAAK,OAAK,GAAG;AAC3B,SACG,UAAU,IAAI,WAAWC,IAAE,KAAK,KAChC,UAAU,IAAI,WAAWA,MAAI,EAAE,KAAK,KACpC,UAAU,IAAI,WAAWA,MAAI,EAAE,KAAK,IACrC,UAAU,IAAI,WAAWA,MAAI,EAAE;AACjC,OAAI,aAAc,OAAO,KAAM;AAC/B,OAAI,aAAc,OAAO,IAAK;AAC9B,OAAI,aAAa,MAAM;;AAGzB,MAAI,oBAAoB,GAAG;AACzB,SACG,UAAU,IAAI,WAAWA,IAAE,KAAK,IAChC,UAAU,IAAI,WAAWA,MAAI,EAAE,KAAK;AACvC,OAAI,aAAa,MAAM;;AAGzB,MAAI,oBAAoB,GAAG;AACzB,SACG,UAAU,IAAI,WAAWA,IAAE,KAAK,KAChC,UAAU,IAAI,WAAWA,MAAI,EAAE,KAAK,IACpC,UAAU,IAAI,WAAWA,MAAI,EAAE,KAAK;AACvC,OAAI,aAAc,OAAO,IAAK;AAC9B,OAAI,aAAa,MAAM;;AAGzB,SAAO;;CAGT,SAAS,gBAAiB,KAAK;AAC7B,SAAO,OAAO,OAAO,KAAK,MACxB,OAAO,OAAO,KAAK,MACnB,OAAO,OAAO,IAAI,MAClB,OAAO,MAAM;;CAGjB,SAAS,YAAa,OAAO,OAAO,KAAK;EACvC,IAAI;EACJ,IAAI,SAAS,EAAE;AACf,OAAK,IAAIA,MAAI,OAAOA,MAAI,KAAK,OAAK,GAAG;AACnC,UACI,MAAMA,QAAM,KAAM,aAClB,MAAMA,MAAI,MAAM,IAAK,UACtB,MAAMA,MAAI,KAAK;AAClB,UAAO,KAAK,gBAAgB,IAAI,CAAC;;AAEnC,SAAO,OAAO,KAAK,GAAG;;CAGxB,SAAS,cAAe,OAAO;EAC7B,IAAI;EACJ,IAAID,QAAM,MAAM;EAChB,IAAI,aAAaA,QAAM;EACvB,IAAI,QAAQ,EAAE;EACd,IAAI,iBAAiB;AAGrB,OAAK,IAAIC,MAAI,GAAG,OAAOD,QAAM,YAAYC,MAAI,MAAM,OAAK,eACtD,OAAM,KAAK,YAAY,OAAOA,KAAIA,MAAI,iBAAkB,OAAO,OAAQA,MAAI,eAAgB,CAAC;AAI9F,MAAI,eAAe,GAAG;AACpB,SAAM,MAAMD,QAAM;AAClB,SAAM,KACJ,OAAO,OAAO,KACd,OAAQ,OAAO,IAAK,MACpB,KACD;aACQ,eAAe,GAAG;AAC3B,UAAO,MAAMA,QAAM,MAAM,KAAK,MAAMA,QAAM;AAC1C,SAAM,KACJ,OAAO,OAAO,MACd,OAAQ,OAAO,IAAK,MACpB,OAAQ,OAAO,IAAK,MACpB,IACD;;AAGH,SAAO,MAAM,KAAK,GAAG"}

package/dist/node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.mjs

@@ -0,0 +1,95 @@
+import { __commonJS } from "../../../../../_virtual/rolldown_runtime.mjs";
+
+//#region ../../node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.js
+var require_base64_js = /* @__PURE__ */ __commonJS({ "../../node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.js": ((exports) => {
+	exports.byteLength = byteLength;
+	exports.toByteArray = toByteArray;
+	exports.fromByteArray = fromByteArray;
+	var lookup = [];
+	var revLookup = [];
+	var Arr = typeof Uint8Array !== "undefined" ? Uint8Array : Array;
+	var code = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+	for (var i = 0, len = code.length; i < len; ++i) {
+		lookup[i] = code[i];
+		revLookup[code.charCodeAt(i)] = i;
+	}
+	revLookup["-".charCodeAt(0)] = 62;
+	revLookup["_".charCodeAt(0)] = 63;
+	function getLens(b64) {
+		var len$1 = b64.length;
+		if (len$1 % 4 > 0) throw new Error("Invalid string. Length must be a multiple of 4");
+		var validLen = b64.indexOf("=");
+		if (validLen === -1) validLen = len$1;
+		var placeHoldersLen = validLen === len$1 ? 0 : 4 - validLen % 4;
+		return [validLen, placeHoldersLen];
+	}
+	function byteLength(b64) {
+		var lens = getLens(b64);
+		var validLen = lens[0];
+		var placeHoldersLen = lens[1];
+		return (validLen + placeHoldersLen) * 3 / 4 - placeHoldersLen;
+	}
+	function _byteLength(b64, validLen, placeHoldersLen) {
+		return (validLen + placeHoldersLen) * 3 / 4 - placeHoldersLen;
+	}
+	function toByteArray(b64) {
+		var tmp;
+		var lens = getLens(b64);
+		var validLen = lens[0];
+		var placeHoldersLen = lens[1];
+		var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen));
+		var curByte = 0;
+		var len$1 = placeHoldersLen > 0 ? validLen - 4 : validLen;
+		var i$1;
+		for (i$1 = 0; i$1 < len$1; i$1 += 4) {
+			tmp = revLookup[b64.charCodeAt(i$1)] << 18 | revLookup[b64.charCodeAt(i$1 + 1)] << 12 | revLookup[b64.charCodeAt(i$1 + 2)] << 6 | revLookup[b64.charCodeAt(i$1 + 3)];
+			arr[curByte++] = tmp >> 16 & 255;
+			arr[curByte++] = tmp >> 8 & 255;
+			arr[curByte++] = tmp & 255;
+		}
+		if (placeHoldersLen === 2) {
+			tmp = revLookup[b64.charCodeAt(i$1)] << 2 | revLookup[b64.charCodeAt(i$1 + 1)] >> 4;
+			arr[curByte++] = tmp & 255;
+		}
+		if (placeHoldersLen === 1) {
+			tmp = revLookup[b64.charCodeAt(i$1)] << 10 | revLookup[b64.charCodeAt(i$1 + 1)] << 4 | revLookup[b64.charCodeAt(i$1 + 2)] >> 2;
+			arr[curByte++] = tmp >> 8 & 255;
+			arr[curByte++] = tmp & 255;
+		}
+		return arr;
+	}
+	function tripletToBase64(num) {
+		return lookup[num >> 18 & 63] + lookup[num >> 12 & 63] + lookup[num >> 6 & 63] + lookup[num & 63];
+	}
+	function encodeChunk(uint8, start, end) {
+		var tmp;
+		var output = [];
+		for (var i$1 = start; i$1 < end; i$1 += 3) {
+			tmp = (uint8[i$1] << 16 & 16711680) + (uint8[i$1 + 1] << 8 & 65280) + (uint8[i$1 + 2] & 255);
+			output.push(tripletToBase64(tmp));
+		}
+		return output.join("");
+	}
+	function fromByteArray(uint8) {
+		var tmp;
+		var len$1 = uint8.length;
+		var extraBytes = len$1 % 3;
+		var parts = [];
+		var maxChunkLength = 16383;
+		for (var i$1 = 0, len2 = len$1 - extraBytes; i$1 < len2; i$1 += maxChunkLength) parts.push(encodeChunk(uint8, i$1, i$1 + maxChunkLength > len2 ? len2 : i$1 + maxChunkLength));
+		if (extraBytes === 1) {
+			tmp = uint8[len$1 - 1];
+			parts.push(lookup[tmp >> 2] + lookup[tmp << 4 & 63] + "==");
+		} else if (extraBytes === 2) {
+			tmp = (uint8[len$1 - 2] << 8) + uint8[len$1 - 1];
+			parts.push(lookup[tmp >> 10] + lookup[tmp >> 4 & 63] + lookup[tmp << 2 & 63] + "=");
+		}
+		return parts.join("");
+	}
+}) });
+
+//#endregion
+export default require_base64_js();
+
+export { require_base64_js };
+//# sourceMappingURL=index.mjs.map

package/dist/node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":["len","i"],"sources":["../../../../../../../../node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.js"],"sourcesContent":["'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;AAEA,SAAQ,aAAa;AACrB,SAAQ,cAAc;AACtB,SAAQ,gBAAgB;CAExB,IAAI,SAAS,EAAE;CACf,IAAI,YAAY,EAAE;CAClB,IAAI,MAAM,OAAO,eAAe,cAAc,aAAa;CAE3D,IAAI,OAAO;AACX,MAAK,IAAI,IAAI,GAAG,MAAM,KAAK,QAAQ,IAAI,KAAK,EAAE,GAAG;AAC/C,SAAO,KAAK,KAAK;AACjB,YAAU,KAAK,WAAW,EAAE,IAAI;;AAKlC,WAAU,IAAI,WAAW,EAAE,IAAI;AAC/B,WAAU,IAAI,WAAW,EAAE,IAAI;CAE/B,SAAS,QAAS,KAAK;EACrB,IAAIA,QAAM,IAAI;AAEd,MAAIA,QAAM,IAAI,EACZ,OAAM,IAAI,MAAM,iDAAiD;EAKnE,IAAI,WAAW,IAAI,QAAQ,IAAI;AAC/B,MAAI,aAAa,GAAI,YAAWA;EAEhC,IAAI,kBAAkB,aAAaA,QAC/B,IACA,IAAK,WAAW;AAEpB,SAAO,CAAC,UAAU,gBAAgB;;CAIpC,SAAS,WAAY,KAAK;EACxB,IAAI,OAAO,QAAQ,IAAI;EACvB,IAAI,WAAW,KAAK;EACpB,IAAI,kBAAkB,KAAK;AAC3B,UAAS,WAAW,mBAAmB,IAAI,IAAK;;CAGlD,SAAS,YAAa,KAAK,UAAU,iBAAiB;AACpD,UAAS,WAAW,mBAAmB,IAAI,IAAK;;CAGlD,SAAS,YAAa,KAAK;EACzB,IAAI;EACJ,IAAI,OAAO,QAAQ,IAAI;EACvB,IAAI,WAAW,KAAK;EACpB,IAAI,kBAAkB,KAAK;EAE3B,IAAI,MAAM,IAAI,IAAI,YAAY,KAAK,UAAU,gBAAgB,CAAC;EAE9D,IAAI,UAAU;EAGd,IAAIA,QAAM,kBAAkB,IACxB,WAAW,IACX;EAEJ,IAAIC;AACJ,OAAK,MAAI,GAAGA,MAAID,OAAK,OAAK,GAAG;AAC3B,SACG,UAAU,IAAI,WAAWC,IAAE,KAAK,KAChC,UAAU,IAAI,WAAWA,MAAI,EAAE,KAAK,KACpC,UAAU,IAAI,WAAWA,MAAI,EAAE,KAAK,IACrC,UAAU,IAAI,WAAWA,MAAI,EAAE;AACjC,OAAI,aAAc,OAAO,KAAM;AAC/B,OAAI,aAAc,OAAO,IAAK;AAC9B,OAAI,aAAa,MAAM;;AAGzB,MAAI,oBAAoB,GAAG;AACzB,SACG,UAAU,IAAI,WAAWA,IAAE,KAAK,IAChC,UAAU,IAAI,WAAWA,MAAI,EAAE,KAAK;AACvC,OAAI,aAAa,MAAM;;AAGzB,MAAI,oBAAoB,GAAG;AACzB,SACG,UAAU,IAAI,WAAWA,IAAE,KAAK,KAChC,UAAU,IAAI,WAAWA,MAAI,EAAE,KAAK,IACpC,UAAU,IAAI,WAAWA,MAAI,EAAE,KAAK;AACvC,OAAI,aAAc,OAAO,IAAK;AAC9B,OAAI,aAAa,MAAM;;AAGzB,SAAO;;CAGT,SAAS,gBAAiB,KAAK;AAC7B,SAAO,OAAO,OAAO,KAAK,MACxB,OAAO,OAAO,KAAK,MACnB,OAAO,OAAO,IAAI,MAClB,OAAO,MAAM;;CAGjB,SAAS,YAAa,OAAO,OAAO,KAAK;EACvC,IAAI;EACJ,IAAI,SAAS,EAAE;AACf,OAAK,IAAIA,MAAI,OAAOA,MAAI,KAAK,OAAK,GAAG;AACnC,UACI,MAAMA,QAAM,KAAM,aAClB,MAAMA,MAAI,MAAM,IAAK,UACtB,MAAMA,MAAI,KAAK;AAClB,UAAO,KAAK,gBAAgB,IAAI,CAAC;;AAEnC,SAAO,OAAO,KAAK,GAAG;;CAGxB,SAAS,cAAe,OAAO;EAC7B,IAAI;EACJ,IAAID,QAAM,MAAM;EAChB,IAAI,aAAaA,QAAM;EACvB,IAAI,QAAQ,EAAE;EACd,IAAI,iBAAiB;AAGrB,OAAK,IAAIC,MAAI,GAAG,OAAOD,QAAM,YAAYC,MAAI,MAAM,OAAK,eACtD,OAAM,KAAK,YAAY,OAAOA,KAAIA,MAAI,iBAAkB,OAAO,OAAQA,MAAI,eAAgB,CAAC;AAI9F,MAAI,eAAe,GAAG;AACpB,SAAM,MAAMD,QAAM;AAClB,SAAM,KACJ,OAAO,OAAO,KACd,OAAQ,OAAO,IAAK,MACpB,KACD;aACQ,eAAe,GAAG;AAC3B,UAAO,MAAMA,QAAM,MAAM,KAAK,MAAMA,QAAM;AAC1C,SAAM,KACJ,OAAO,OAAO,MACd,OAAQ,OAAO,IAAK,MACpB,OAAQ,OAAO,IAAK,MACpB,IACD;;AAGH,SAAO,MAAM,KAAK,GAAG"}

package/dist/promise-queue/index.cjs

@@ -7,8 +7,21 @@
 * - size() is always at minimum 1 item which is the promise for the next enqueued item
 */
 var PromiseQueue = class {
+	/** Optional error handler for enqueue failures */
+	errorHandler;
+	/** Array of promises representing queued items */
+	items;
+	/** Function to resolve the next enqueued promise */
+	enqueuer;
+	/** Function to resolve the continue promise when space is available */
+	batcher;
+	/** Flag indicating if the queue is synced with the data source */
+	synced = false;
+	/** Maximum number of items to keep in the queue */
+	batchSize;
+	/** Promise that resolves when it's safe to enqueue more items */
+	continuePromise;
 	constructor(batchSize, errorHandler) {
-		this.synced = false;
 		const nextVal = new Promise((resolve, _reject) => {
 			this.enqueuer = resolve;
 		});
@@ -69,11 +82,27 @@ var PromiseQueue = class {
 * Used by the indexer for managing block processing queues
 */
 var CircularBuffer = class {
+	/** Optional error handler for enqueue failures */
+	errorHandler;
+	/** Fixed-size array of promises representing buffered items */
+	items;
+	/** Function to resolve the next enqueued promise */
+	enqueuer;
+	/** Current number of items in the buffer */
+	count = 0;
+	/** Index of the next item to dequeue */
+	next = 0;
+	/** Function to resolve the continue promise when space is available */
+	batcher;
+	/** Flag indicating if the buffer is synced with the data source */
+	synced = false;
+	/** Maximum number of items the buffer can hold */
+	batchSize;
+	/** Promise that resolves when it's safe to enqueue more items */
+	continuePromise;
+	/** Index of the next available slot for enqueueing */
+	nextAvail = 0;
 	constructor(batchSize, errorHandler) {
-		this.count = 0;
-		this.next = 0;
-		this.synced = false;
-		this.nextAvail = 0;
 		if (batchSize <= 1) throw new Error("Batch size must be greater than 1");
 		const nextVal = new Promise((resolve, _reject) => {
 			this.enqueuer = resolve;

package/dist/promise-queue/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","names":[],"sources":["../../src/promise-queue/index.ts"],"sourcesContent":["/**\n * Implements an \"infinite\" FIFO queue of fixed size using promises\n * - await `continue()` before enqueing items to ensure fixed size (resolves when space available)\n * - await `dequeue()` to pop an item (resolves when next item is available)\n * - size() is always at minimum 1 item which is the promise for the next enqueued item\n */\nexport class PromiseQueue<T> {\n  /** Optional error handler for enqueue failures */\n  private errorHandler?: (error: unknown) => void;\n  /** Array of promises representing queued items */\n  private items: Array<Promise<T>>;\n\n  /** Function to resolve the next enqueued promise */\n  private enqueuer!: (val: T | PromiseLike<T>) => void;\n\n  /** Function to resolve the continue promise when space is available */\n  private batcher!: (val: boolean) => void;\n\n  /** Flag indicating if the queue is synced with the data source */\n  public synced = false;\n\n  /** Maximum number of items to keep in the queue */\n  private batchSize: number;\n\n  /** Promise that resolves when it's safe to enqueue more items */\n  private continuePromise: Promise<boolean>;\n\n  constructor(batchSize: number, errorHandler?: (error: unknown) => void) {\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.batchSize = batchSize;\n    this.errorHandler = errorHandler;\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n    this.items = [nextVal];\n  }\n\n  enqueue(item: T | PromiseLike<T>) {\n    try {\n      this.enqueuer(item);\n      const nextVal = new Promise<T>((resolve, _reject) => {\n        this.enqueuer = resolve;\n      });\n      this.items.push(nextVal);\n      if (this.size() > this.batchSize) {\n        this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n          this.batcher = resolve;\n        });\n      }\n    }\n    catch (e) {\n      if (this.errorHandler) {\n        this.errorHandler(e);\n      }\n      // If no error handler provided, silently ignore (existing behavior for backward compatibility)\n    }\n  }\n\n  clear() {\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n    this.items = [nextVal];\n  }\n\n  dequeue() {\n    const item = this.items.shift();\n    if (this.size() <= this.batchSize) {\n      this.batcher(true);\n    }\n\n    return item as Promise<T>;\n  }\n\n  continue() {\n    return this.continuePromise;\n  }\n\n  setSynced() {\n    this.synced = true;\n  }\n\n  isEmpty() {\n    if (this.items.length == 0) {\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  size() {\n    return this.items.length;\n  }\n}\n\n/**\n * Circular buffer implementation using promises for efficient memory usage\n * Reuses array slots in a circular fashion to maintain constant memory footprint\n * Used by the indexer for managing block processing queues\n */\nexport class CircularBuffer<T> {\n  /** Optional error handler for enqueue failures */\n  private errorHandler?: (error: unknown) => void;\n\n  /** Fixed-size array of promises representing buffered items */\n  private items: Array<Promise<T>>;\n\n  /** Function to resolve the next enqueued promise */\n  private enqueuer!: (val: T | PromiseLike<T>) => void;\n\n  /** Current number of items in the buffer */\n  private count: number = 0;\n\n  /** Index of the next item to dequeue */\n  private next: number = 0;\n\n  /** Function to resolve the continue promise when space is available */\n  private batcher!: (val: boolean) => void;\n\n  /** Flag indicating if the buffer is synced with the data source */\n  public synced = false;\n\n  /** Maximum number of items the buffer can hold */\n  private batchSize: number;\n\n  /** Promise that resolves when it's safe to enqueue more items */\n  private continuePromise: Promise<boolean>;\n\n  /** Index of the next available slot for enqueueing */\n  private nextAvail: number = 0;\n\n  constructor(batchSize: number, errorHandler?: (error: unknown) => void) {\n    if (batchSize <= 1) {\n      throw new Error(\"Batch size must be greater than 1\");\n    }\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.items = new Array<Promise<T>>(batchSize);\n    this.batchSize = batchSize;\n    this.errorHandler = errorHandler;\n    this.items[this.nextAvail] = nextVal;\n    this.count = 1;\n    this.nextAvail++;\n    if (this.nextAvail >= this.batchSize) {\n      this.nextAvail = 0;\n    }\n\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n  }\n\n  enqueue(item: T | PromiseLike<T>) {\n    try {\n      this.enqueuer(item);\n      const nextVal = new Promise<T>((resolve, _reject) => {\n        this.enqueuer = resolve;\n      });\n      this.items[this.nextAvail] = nextVal;\n      this.count++;\n      this.nextAvail++;\n      if (this.nextAvail >= this.batchSize) {\n        this.nextAvail = 0;\n      }\n\n      if (this.nextAvail == this.next) {\n        this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n          this.batcher = resolve;\n        });\n      }\n    }\n    catch (e) {\n      if (this.errorHandler) {\n        this.errorHandler(e);\n      }\n      // If no error handler provided, silently ignore (existing behavior for backward compatibility)\n    }\n  }\n\n  dequeue() {\n    const item = this.items[this.next];\n    this.next++;\n    this.count--;\n    if (this.next >= this.batchSize) {\n      this.next = 0;\n    }\n    if (this.count <= this.batchSize) {\n      this.batcher(true);\n    }\n    return item;\n  }\n\n  clear() {\n    this.next = 0;\n    this.nextAvail = 0;\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.items = new Array<Promise<T>>(this.batchSize);\n    this.items[this.nextAvail] = nextVal;\n    this.synced = false;\n    this.count = 1;\n    this.nextAvail++;\n    if (this.nextAvail >= this.batchSize) {\n      this.nextAvail = 0;\n    }\n\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n  }\n\n  continue() {\n    return this.continuePromise;\n  }\n\n  setSynced() {\n    this.synced = true;\n  }\n\n  isEmpty() {\n    if (this.count == 0) {\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  size() {\n    return this.count;\n  }\n}\n"],"mappings":";;;;;;;;AAMA,IAAa,eAAb,MAA6B;CAqB3B,YAAY,WAAmB,cAAyC;OARjE,SAAS;EASd,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;AAClB,OAAK,QAAQ,CAAC,QAAQ;;CAGxB,QAAQ,MAA0B;AAChC,MAAI;AACF,QAAK,SAAS,KAAK;GACnB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,SAAK,WAAW;KAChB;AACF,QAAK,MAAM,KAAK,QAAQ;AACxB,OAAI,KAAK,MAAM,GAAG,KAAK,UACrB,MAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,SAAK,UAAU;KACf;WAGC,GAAG;AACR,OAAI,KAAK,aACP,MAAK,aAAa,EAAE;;;CAM1B,QAAQ;EACN,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;AAClB,OAAK,QAAQ,CAAC,QAAQ;;CAGxB,UAAU;EACR,MAAM,OAAO,KAAK,MAAM,OAAO;AAC/B,MAAI,KAAK,MAAM,IAAI,KAAK,UACtB,MAAK,QAAQ,KAAK;AAGpB,SAAO;;CAGT,WAAW;AACT,SAAO,KAAK;;CAGd,YAAY;AACV,OAAK,SAAS;;CAGhB,UAAU;AACR,MAAI,KAAK,MAAM,UAAU,EACvB,QAAO;MAGP,QAAO;;CAIX,OAAO;AACL,SAAO,KAAK,MAAM;;;;;;;;AAStB,IAAa,iBAAb,MAA+B;CA+B7B,YAAY,WAAmB,cAAyC;OApBhE,QAAgB;OAGhB,OAAe;OAMhB,SAAS;OASR,YAAoB;AAG1B,MAAI,aAAa,EACf,OAAM,IAAI,MAAM,oCAAoC;EAEtD,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,QAAQ,IAAI,MAAkB,UAAU;AAC7C,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,MAAM,KAAK,aAAa;AAC7B,OAAK,QAAQ;AACb,OAAK;AACL,MAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;;CAGpB,QAAQ,MAA0B;AAChC,MAAI;AACF,QAAK,SAAS,KAAK;GACnB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,SAAK,WAAW;KAChB;AACF,QAAK,MAAM,KAAK,aAAa;AAC7B,QAAK;AACL,QAAK;AACL,OAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAI,KAAK,aAAa,KAAK,KACzB,MAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,SAAK,UAAU;KACf;WAGC,GAAG;AACR,OAAI,KAAK,aACP,MAAK,aAAa,EAAE;;;CAM1B,UAAU;EACR,MAAM,OAAO,KAAK,MAAM,KAAK;AAC7B,OAAK;AACL,OAAK;AACL,MAAI,KAAK,QAAQ,KAAK,UACpB,MAAK,OAAO;AAEd,MAAI,KAAK,SAAS,KAAK,UACrB,MAAK,QAAQ,KAAK;AAEpB,SAAO;;CAGT,QAAQ;AACN,OAAK,OAAO;AACZ,OAAK,YAAY;EACjB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,QAAQ,IAAI,MAAkB,KAAK,UAAU;AAClD,OAAK,MAAM,KAAK,aAAa;AAC7B,OAAK,SAAS;AACd,OAAK,QAAQ;AACb,OAAK;AACL,MAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;;CAGpB,WAAW;AACT,SAAO,KAAK;;CAGd,YAAY;AACV,OAAK,SAAS;;CAGhB,UAAU;AACR,MAAI,KAAK,SAAS,EAChB,QAAO;MAGP,QAAO;;CAIX,OAAO;AACL,SAAO,KAAK"}
+{"version":3,"file":"index.cjs","names":[],"sources":["../../src/promise-queue/index.ts"],"sourcesContent":["/**\n * Implements an \"infinite\" FIFO queue of fixed size using promises\n * - await `continue()` before enqueing items to ensure fixed size (resolves when space available)\n * - await `dequeue()` to pop an item (resolves when next item is available)\n * - size() is always at minimum 1 item which is the promise for the next enqueued item\n */\nexport class PromiseQueue<T> {\n  /** Optional error handler for enqueue failures */\n  private errorHandler?: (error: unknown) => void;\n  /** Array of promises representing queued items */\n  private items: Array<Promise<T>>;\n\n  /** Function to resolve the next enqueued promise */\n  private enqueuer!: (val: T | PromiseLike<T>) => void;\n\n  /** Function to resolve the continue promise when space is available */\n  private batcher!: (val: boolean) => void;\n\n  /** Flag indicating if the queue is synced with the data source */\n  public synced = false;\n\n  /** Maximum number of items to keep in the queue */\n  private batchSize: number;\n\n  /** Promise that resolves when it's safe to enqueue more items */\n  private continuePromise: Promise<boolean>;\n\n  constructor(batchSize: number, errorHandler?: (error: unknown) => void) {\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.batchSize = batchSize;\n    this.errorHandler = errorHandler;\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n    this.items = [nextVal];\n  }\n\n  enqueue(item: T | PromiseLike<T>) {\n    try {\n      this.enqueuer(item);\n      const nextVal = new Promise<T>((resolve, _reject) => {\n        this.enqueuer = resolve;\n      });\n      this.items.push(nextVal);\n      if (this.size() > this.batchSize) {\n        this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n          this.batcher = resolve;\n        });\n      }\n    }\n    catch (e) {\n      if (this.errorHandler) {\n        this.errorHandler(e);\n      }\n      // If no error handler provided, silently ignore (existing behavior for backward compatibility)\n    }\n  }\n\n  clear() {\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n    this.items = [nextVal];\n  }\n\n  dequeue() {\n    const item = this.items.shift();\n    if (this.size() <= this.batchSize) {\n      this.batcher(true);\n    }\n\n    return item as Promise<T>;\n  }\n\n  continue() {\n    return this.continuePromise;\n  }\n\n  setSynced() {\n    this.synced = true;\n  }\n\n  isEmpty() {\n    if (this.items.length == 0) {\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  size() {\n    return this.items.length;\n  }\n}\n\n/**\n * Circular buffer implementation using promises for efficient memory usage\n * Reuses array slots in a circular fashion to maintain constant memory footprint\n * Used by the indexer for managing block processing queues\n */\nexport class CircularBuffer<T> {\n  /** Optional error handler for enqueue failures */\n  private errorHandler?: (error: unknown) => void;\n\n  /** Fixed-size array of promises representing buffered items */\n  private items: Array<Promise<T>>;\n\n  /** Function to resolve the next enqueued promise */\n  private enqueuer!: (val: T | PromiseLike<T>) => void;\n\n  /** Current number of items in the buffer */\n  private count: number = 0;\n\n  /** Index of the next item to dequeue */\n  private next: number = 0;\n\n  /** Function to resolve the continue promise when space is available */\n  private batcher!: (val: boolean) => void;\n\n  /** Flag indicating if the buffer is synced with the data source */\n  public synced = false;\n\n  /** Maximum number of items the buffer can hold */\n  private batchSize: number;\n\n  /** Promise that resolves when it's safe to enqueue more items */\n  private continuePromise: Promise<boolean>;\n\n  /** Index of the next available slot for enqueueing */\n  private nextAvail: number = 0;\n\n  constructor(batchSize: number, errorHandler?: (error: unknown) => void) {\n    if (batchSize <= 1) {\n      throw new Error(\"Batch size must be greater than 1\");\n    }\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.items = new Array<Promise<T>>(batchSize);\n    this.batchSize = batchSize;\n    this.errorHandler = errorHandler;\n    this.items[this.nextAvail] = nextVal;\n    this.count = 1;\n    this.nextAvail++;\n    if (this.nextAvail >= this.batchSize) {\n      this.nextAvail = 0;\n    }\n\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n  }\n\n  enqueue(item: T | PromiseLike<T>) {\n    try {\n      this.enqueuer(item);\n      const nextVal = new Promise<T>((resolve, _reject) => {\n        this.enqueuer = resolve;\n      });\n      this.items[this.nextAvail] = nextVal;\n      this.count++;\n      this.nextAvail++;\n      if (this.nextAvail >= this.batchSize) {\n        this.nextAvail = 0;\n      }\n\n      if (this.nextAvail == this.next) {\n        this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n          this.batcher = resolve;\n        });\n      }\n    }\n    catch (e) {\n      if (this.errorHandler) {\n        this.errorHandler(e);\n      }\n      // If no error handler provided, silently ignore (existing behavior for backward compatibility)\n    }\n  }\n\n  dequeue() {\n    const item = this.items[this.next];\n    this.next++;\n    this.count--;\n    if (this.next >= this.batchSize) {\n      this.next = 0;\n    }\n    if (this.count <= this.batchSize) {\n      this.batcher(true);\n    }\n    return item;\n  }\n\n  clear() {\n    this.next = 0;\n    this.nextAvail = 0;\n    const nextVal = new Promise<T>((resolve, _reject) => {\n      this.enqueuer = resolve;\n    });\n    this.items = new Array<Promise<T>>(this.batchSize);\n    this.items[this.nextAvail] = nextVal;\n    this.synced = false;\n    this.count = 1;\n    this.nextAvail++;\n    if (this.nextAvail >= this.batchSize) {\n      this.nextAvail = 0;\n    }\n\n    this.continuePromise = new Promise<boolean>((resolve, _reject) => {\n      this.batcher = resolve;\n    });\n    this.batcher(true);\n  }\n\n  continue() {\n    return this.continuePromise;\n  }\n\n  setSynced() {\n    this.synced = true;\n  }\n\n  isEmpty() {\n    if (this.count == 0) {\n      return true;\n    }\n    else {\n      return false;\n    }\n  }\n\n  size() {\n    return this.count;\n  }\n}\n"],"mappings":";;;;;;;;AAMA,IAAa,eAAb,MAA6B;;CAE3B,AAAQ;;CAER,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ;;CAGR,AAAO,SAAS;;CAGhB,AAAQ;;CAGR,AAAQ;CAER,YAAY,WAAmB,cAAyC;EACtE,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;AAClB,OAAK,QAAQ,CAAC,QAAQ;;CAGxB,QAAQ,MAA0B;AAChC,MAAI;AACF,QAAK,SAAS,KAAK;GACnB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,SAAK,WAAW;KAChB;AACF,QAAK,MAAM,KAAK,QAAQ;AACxB,OAAI,KAAK,MAAM,GAAG,KAAK,UACrB,MAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,SAAK,UAAU;KACf;WAGC,GAAG;AACR,OAAI,KAAK,aACP,MAAK,aAAa,EAAE;;;CAM1B,QAAQ;EACN,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;AAClB,OAAK,QAAQ,CAAC,QAAQ;;CAGxB,UAAU;EACR,MAAM,OAAO,KAAK,MAAM,OAAO;AAC/B,MAAI,KAAK,MAAM,IAAI,KAAK,UACtB,MAAK,QAAQ,KAAK;AAGpB,SAAO;;CAGT,WAAW;AACT,SAAO,KAAK;;CAGd,YAAY;AACV,OAAK,SAAS;;CAGhB,UAAU;AACR,MAAI,KAAK,MAAM,UAAU,EACvB,QAAO;MAGP,QAAO;;CAIX,OAAO;AACL,SAAO,KAAK,MAAM;;;;;;;;AAStB,IAAa,iBAAb,MAA+B;;CAE7B,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ,QAAgB;;CAGxB,AAAQ,OAAe;;CAGvB,AAAQ;;CAGR,AAAO,SAAS;;CAGhB,AAAQ;;CAGR,AAAQ;;CAGR,AAAQ,YAAoB;CAE5B,YAAY,WAAmB,cAAyC;AACtE,MAAI,aAAa,EACf,OAAM,IAAI,MAAM,oCAAoC;EAEtD,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,QAAQ,IAAI,MAAkB,UAAU;AAC7C,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,MAAM,KAAK,aAAa;AAC7B,OAAK,QAAQ;AACb,OAAK;AACL,MAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;;CAGpB,QAAQ,MAA0B;AAChC,MAAI;AACF,QAAK,SAAS,KAAK;GACnB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,SAAK,WAAW;KAChB;AACF,QAAK,MAAM,KAAK,aAAa;AAC7B,QAAK;AACL,QAAK;AACL,OAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAI,KAAK,aAAa,KAAK,KACzB,MAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,SAAK,UAAU;KACf;WAGC,GAAG;AACR,OAAI,KAAK,aACP,MAAK,aAAa,EAAE;;;CAM1B,UAAU;EACR,MAAM,OAAO,KAAK,MAAM,KAAK;AAC7B,OAAK;AACL,OAAK;AACL,MAAI,KAAK,QAAQ,KAAK,UACpB,MAAK,OAAO;AAEd,MAAI,KAAK,SAAS,KAAK,UACrB,MAAK,QAAQ,KAAK;AAEpB,SAAO;;CAGT,QAAQ;AACN,OAAK,OAAO;AACZ,OAAK,YAAY;EACjB,MAAM,UAAU,IAAI,SAAY,SAAS,YAAY;AACnD,QAAK,WAAW;IAChB;AACF,OAAK,QAAQ,IAAI,MAAkB,KAAK,UAAU;AAClD,OAAK,MAAM,KAAK,aAAa;AAC7B,OAAK,SAAS;AACd,OAAK,QAAQ;AACb,OAAK;AACL,MAAI,KAAK,aAAa,KAAK,UACzB,MAAK,YAAY;AAGnB,OAAK,kBAAkB,IAAI,SAAkB,SAAS,YAAY;AAChE,QAAK,UAAU;IACf;AACF,OAAK,QAAQ,KAAK;;CAGpB,WAAW;AACT,SAAO,KAAK;;CAGd,YAAY;AACV,OAAK,SAAS;;CAGhB,UAAU;AACR,MAAI,KAAK,SAAS,EAChB,QAAO;MAGP,QAAO;;CAIX,OAAO;AACL,SAAO,KAAK"}