@5ss/ai-tools 3.0.1 → 3.0.2

package/CHANGELOG.md

@@ -4,6 +4,8 @@ All notable changes to `@5ss/ai-tools` are documented here.
 
 Format follows [Keep a Changelog](https://keepachangelog.com/en/1.1.0/). Releases are cut by [semantic-release](https://semantic-release.gitbook.io/) from [conventional commits](https://www.conventionalcommits.org/).
 
+## [3.0.2](https://github.com/five-star-solutions-co/ai-tools/compare/v3.0.1...v3.0.2) (2026-08-12)
+
 ## [3.0.1](https://github.com/five-star-solutions-co/ai-tools/compare/v3.0.0...v3.0.1) (2026-08-12)
 
 ## [3.0.0](https://github.com/five-star-solutions-co/ai-tools/compare/v2.11.4...v3.0.0) (2026-08-10)

package/dist/vendors/amazon-sp-api/index.js

@@ -923,7 +923,7 @@ try {
 function reportDocumentError(message, code) {
 	throw new ToolError(message, { code });
 }
-async function decompressReportDocumentBytes(bytes, compressionAlgorithm, maxBytes) {
+function decompressReportDocumentBytes(bytes, compressionAlgorithm, maxBytes) {
 	if (bytes.byteLength > maxBytes) reportDocumentError("Amazon report document exceeds max_bytes", "too_large");
 	if (!compressionAlgorithm) return bytes;
 	if (compressionAlgorithm.toUpperCase() !== "GZIP") reportDocumentError(`Unsupported Amazon report compression: ${compressionAlgorithm}`, "unsupported");
@@ -986,10 +986,10 @@ function parseUsMoneyToSafeCents(raw) {
 	return n;
 }
 /** Decompress GZIP when report document uses compressionAlgorithm GZIP. */
-async function maybeGunzipReportBytes(bytes, compressionAlgorithm) {
+function maybeGunzipReportBytes(bytes, compressionAlgorithm) {
 	if (bytes.byteLength > 16777216) settlementError("Settlement report compressed body exceeds limit", "too_large");
 	try {
-		return await decompressReportDocumentBytes(bytes, compressionAlgorithm, SETTLEMENT_MAX_DECOMPRESSED_BYTES);
+		return decompressReportDocumentBytes(bytes, compressionAlgorithm, SETTLEMENT_MAX_DECOMPRESSED_BYTES);
 	} catch (error) {
 		if (error instanceof ToolError && error.code === "too_large") settlementError("Settlement report decompressed body exceeds limit", "too_large");
 		if (error instanceof ToolError && error.code === "unsupported") throw error;
@@ -1066,9 +1066,9 @@ function parseSettlementV2Tsv(text) {
 	};
 }
 /** Decode UTF-8 document bytes (after optional gunzip) and parse summary. */
-async function summarizeSettlementDocument(bytes, compressionAlgorithm) {
+function summarizeSettlementDocument(bytes, compressionAlgorithm) {
 	if (!compressionAlgorithm && bytes.byteLength > 67108864) settlementError("Settlement report body exceeds limit", "too_large");
-	const plain = await maybeGunzipReportBytes(bytes, compressionAlgorithm);
+	const plain = maybeGunzipReportBytes(bytes, compressionAlgorithm);
 	if (plain.byteLength > 67108864) settlementError("Settlement report body exceeds limit", "too_large");
 	return parseSettlementV2Tsv(new TextDecoder("utf-8", { fatal: false }).decode(plain));
 }
@@ -1354,7 +1354,7 @@ var AmazonSpApiClient = class AmazonSpApiClient {
 			details: { issues: parsedInput.error.issues.map((issue) => issue.message) }
 		});
 		const document = await this.getReportDocument({ report_document_id: parsedInput.data.report_document_id });
-		return await this.#downloadReportDocumentDescriptor(document, parsedInput.data.max_bytes);
+		return this.#downloadReportDocumentDescriptor(document, parsedInput.data.max_bytes);
 	}
 	async #downloadReportDocumentDescriptor(document, maxBytes) {
 		let compressionAlgorithm;
@@ -1366,7 +1366,7 @@ var AmazonSpApiClient = class AmazonSpApiClient {
 			label: "Amazon SP-API report document",
 			maxBytes
 		});
-		const bytes = await decompressReportDocumentBytes(result.bytes, compressionAlgorithm, maxBytes);
+		const bytes = decompressReportDocumentBytes(result.bytes, compressionAlgorithm, maxBytes);
 		const contentType = result.headers.get("content-type") ?? void 0;
 		const contentEncoding = result.headers.get("content-encoding") ?? void 0;
 		return {
@@ -1390,7 +1390,7 @@ var AmazonSpApiClient = class AmazonSpApiClient {
 			label: "Amazon SP-API settlement document",
 			maxBytes: SETTLEMENT_MAX_COMPRESSED_BYTES
 		});
-		return await summarizeSettlementDocument(bytes, doc.compression_algorithm);
+		return summarizeSettlementDocument(bytes, doc.compression_algorithm);
 	}
 	async #resolveSettlementReportDocumentId(input) {
 		if (input.report_id) {

package/dist/vendors/amazon-sp-api/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":["#auth","#lwa","#api","#download","#ensureAccessToken","#accessToken","#accessTokenExpiresAt","#spGet","#spPost","#requestInventorySummariesPage","#downloadReportDocumentDescriptor","#resolveSettlementReportDocumentId"],"sources":["../../../src/vendors/amazon-sp-api/contracts.ts","../../../src/vendors/amazon-sp-api/domain.ts","../../../node_modules/fflate/esm/index.mjs","../../../src/vendors/amazon-sp-api/domain/report-document.ts","../../../src/vendors/amazon-sp-api/domain/settlement.ts","../../../src/vendors/amazon-sp-api/client.ts","../../../src/vendors/amazon-sp-api/module.ts"],"sourcesContent":["import { z } from 'zod'\n\n/** SP-API regional endpoints. */\nexport const amazonSpApiEndpointSchema = z.enum([\n\t'https://sellingpartnerapi-na.amazon.com',\n\t'https://sellingpartnerapi-eu.amazon.com',\n\t'https://sellingpartnerapi-fe.amazon.com'\n])\n\nexport const amazonSpApiAuthSchema = z.object({\n\tclient_id: z.string().min(1).describe('LWA client id'),\n\tclient_secret: z.string().min(1).describe('LWA client secret'),\n\trefresh_token: z.string().min(1).describe('LWA refresh token for the selling partner'),\n\tendpoint: amazonSpApiEndpointSchema.describe('SP-API regional endpoint'),\n\tmarketplace_ids: z\n\t\t.array(z.string().min(1))\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Default marketplace ids when a tool call omits marketplace_ids'),\n\tuser_agent: z.string().min(1).describe('Application user agent sent with every SP-API request')\n})\n\nexport type AmazonSpApiAuth = z.infer<typeof amazonSpApiAuthSchema>\n\nexport const amazonSpApiLwaTokenResponseSchema = z.object({\n\taccess_token: z.string().min(1),\n\ttoken_type: z.string().min(1),\n\texpires_in: z.number().int().positive()\n})\n\nexport type AmazonSpApiLwaTokenResponse = z.infer<typeof amazonSpApiLwaTokenResponseSchema>\n\n// ─── Orders ───────────────────────────────────────────────────────────────────\n\nexport const amazonSpApiListOrdersInputSchema = z.object({\n\tmarketplace_ids: z\n\t\t.array(z.string().min(1))\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Marketplace ids; omit to use the configured defaults'),\n\tcreated_after: z.string().min(1).optional().describe('ISO 8601; orders created after'),\n\tcreated_before: z.string().min(1).optional().describe('ISO 8601; orders created before'),\n\tlast_updated_after: z.string().min(1).optional().describe('ISO 8601; orders updated after'),\n\torder_statuses: z.array(z.string().min(1)).optional().describe('Order status filter list'),\n\tcursor: z.string().min(1).optional().describe('NextToken from a prior page'),\n\tmax_results: z.int().min(1).max(100).optional().describe('Page size (1-100)')\n})\n\nexport const amazonSpApiOrderSchema = z.object({\n\tamazon_order_id: z.string(),\n\torder_status: z.string().optional(),\n\tpurchase_date: z.string().optional(),\n\tlast_update_date: z.string().optional(),\n\tmarketplace_id: z.string().optional(),\n\torder_total_amount: z.string().optional(),\n\torder_total_currency: z.string().optional(),\n\tfulfillment_channel: z.string().optional()\n})\n\nexport const amazonSpApiListOrdersOutputSchema = z.object({\n\titems: z.array(amazonSpApiOrderSchema),\n\tnext_cursor: z.string().optional(),\n\ttruncated: z.boolean()\n})\n\nexport const amazonSpApiGetOrderInputSchema = z.object({\n\tamazon_order_id: z.string().min(1).describe('Amazon order id')\n})\n\nexport const amazonSpApiGetOrderOutputSchema = z.object({\n\torder: amazonSpApiOrderSchema\n})\n\nexport const amazonSpApiGetOrderItemsInputSchema = z.object({\n\tamazon_order_id: z.string().min(1).describe('Amazon order id'),\n\tcursor: z.string().min(1).optional().describe('NextToken from a prior page')\n})\n\nexport const amazonSpApiOrderItemSchema = z.object({\n\torder_item_id: z.string(),\n\tasin: z.string().optional(),\n\tseller_sku: z.string().optional(),\n\ttitle: z.string().optional(),\n\tquantity_ordered: z.number().optional(),\n\tquantity_shipped: z.number().optional(),\n\titem_price_amount: z.string().optional(),\n\titem_price_currency: z.string().optional()\n})\n\nexport const amazonSpApiGetOrderItemsOutputSchema = z.object({\n\tamazon_order_id: z.string(),\n\titems: z.array(amazonSpApiOrderItemSchema),\n\tnext_cursor: z.string().optional(),\n\ttruncated: z.boolean()\n})\n\n// ─── Orders v2026-01-01 SearchOrders ──────────────────────────────────────────\n\nexport const amazonSpApiSearchOrdersInputSchema = z.object({\n\tcreated_after: z\n\t\t.string()\n\t\t.min(1)\n\t\t.describe('ISO 8601; orders created at or after this time (required for reconciliation)'),\n\tcreated_before: z.string().min(1).optional().describe('ISO 8601; orders created at or before this time'),\n\tmarketplace_ids: z\n\t\t.array(z.string().min(1))\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Marketplace ids; omit to use the configured defaults'),\n\tmax_results: z.int().min(1).max(100).optional().describe('Page size (1-100, default 100)'),\n\tcursor: z.string().min(1).optional().describe('paginationToken from a prior page'),\n\tmax_pages: z\n\t\t.int()\n\t\t.min(1)\n\t\t.max(50)\n\t\t.optional()\n\t\t.describe('When set, drains up to this many pages and returns a combined list (default 1)')\n})\n\nexport const amazonSpApiSearchOrderSchema = z.object({\n\torder_id: z.string().describe('Amazon order id'),\n\tcreated_time: z.string().optional().describe('Order created time (ISO 8601)'),\n\tfulfillment_status: z.string().optional().describe('Fulfillment status when FULFILLMENT data is included')\n})\n\nexport const amazonSpApiSearchOrdersOutputSchema = z.object({\n\titems: z.array(amazonSpApiSearchOrderSchema),\n\tnext_cursor: z.string().optional().describe('paginationToken for the next page when not fully drained'),\n\ttruncated: z.boolean()\n})\n\n// ─── Inventory ────────────────────────────────────────────────────────────────\n\nconst amazonInventoryDateTimeSchema = z.iso.datetime({ offset: true })\n\nfunction eighteenMonthsBeforeNow(): number {\n\tconst oldestAllowed = new Date()\n\tconst currentDay = oldestAllowed.getUTCDate()\n\toldestAllowed.setUTCDate(1)\n\toldestAllowed.setUTCMonth(oldestAllowed.getUTCMonth() - 18)\n\tconst lastDayOfTargetMonth = new Date(\n\t\tDate.UTC(oldestAllowed.getUTCFullYear(), oldestAllowed.getUTCMonth() + 1, 0)\n\t).getUTCDate()\n\toldestAllowed.setUTCDate(Math.min(currentDay, lastDayOfTargetMonth))\n\treturn oldestAllowed.getTime()\n}\n\nconst amazonInventoryFullPageInputSchema = z.strictObject({\n\tmode: z.literal('full'),\n\tmarketplace_id: z.string().min(1),\n\tnext_token: z.string().min(1).optional()\n})\n\nconst amazonInventoryIncrementalPageInputSchema = z.strictObject({\n\tmode: z.literal('incremental'),\n\tmarketplace_id: z.string().min(1),\n\tstart_date_time: amazonInventoryDateTimeSchema,\n\tnext_token: z.string().min(1).optional()\n})\n\nexport const amazonSpApiInventoryPageInputSchema = z\n\t.discriminatedUnion('mode', [amazonInventoryFullPageInputSchema, amazonInventoryIncrementalPageInputSchema])\n\t.superRefine((input, context) => {\n\t\tif (input.mode !== 'incremental') return\n\t\tif (Date.parse(input.start_date_time) < eighteenMonthsBeforeNow()) {\n\t\t\tcontext.addIssue({\n\t\t\t\tcode: 'custom',\n\t\t\t\tpath: ['start_date_time'],\n\t\t\t\tmessage: 'start_date_time cannot be more than 18 months in the past'\n\t\t\t})\n\t\t}\n\t})\n\nexport const amazonInventoryReservedQuantityRawSchema = z.looseObject({\n\ttotalReservedQuantity: z.number().optional(),\n\tpendingCustomerOrderQuantity: z.number().optional(),\n\tpendingTransshipmentQuantity: z.number().optional(),\n\tfcProcessingQuantity: z.number().optional()\n})\n\nexport const amazonInventoryResearchingQuantityBreakdownRawSchema = z.looseObject({\n\tname: z.enum(['researchingQuantityInShortTerm', 'researchingQuantityInMidTerm', 'researchingQuantityInLongTerm']),\n\tquantity: z.int()\n})\n\nexport const amazonInventoryResearchingQuantityRawSchema = z.looseObject({\n\ttotalResearchingQuantity: z.number().optional(),\n\tresearchingQuantityBreakdown: z.array(amazonInventoryResearchingQuantityBreakdownRawSchema).optional()\n})\n\nexport const amazonInventoryUnfulfillableQuantityRawSchema = z.looseObject({\n\ttotalUnfulfillableQuantity: z.number().optional(),\n\tcustomerDamagedQuantity: z.number().optional(),\n\twarehouseDamagedQuantity: z.number().optional(),\n\tdistributorDamagedQuantity: z.number().optional(),\n\tcarrierDamagedQuantity: z.number().optional(),\n\tdefectiveQuantity: z.number().optional(),\n\texpiredQuantity: z.number().optional()\n})\n\nexport const amazonInventoryDetailsRawSchema = z.looseObject({\n\tfulfillableQuantity: z.number().optional(),\n\tinboundWorkingQuantity: z.number().optional(),\n\tinboundShippedQuantity: z.number().optional(),\n\tinboundReceivingQuantity: z.number().optional(),\n\treservedQuantity: amazonInventoryReservedQuantityRawSchema.optional(),\n\tresearchingQuantity: amazonInventoryResearchingQuantityRawSchema.optional(),\n\tunfulfillableQuantity: amazonInventoryUnfulfillableQuantityRawSchema.optional()\n})\n\nexport const amazonInventorySummaryRawSchema = z.looseObject({\n\tasin: z.string().optional(),\n\tfnSku: z.string().optional(),\n\tsellerSku: z.string().optional(),\n\tcondition: z.string().optional(),\n\tproductName: z.string().optional(),\n\ttotalQuantity: z.number().optional(),\n\tlastUpdatedTime: z.string().optional(),\n\tstores: z.array(z.string()).optional(),\n\tinventoryDetails: amazonInventoryDetailsRawSchema.optional()\n})\n\nexport const amazonSpApiInventoryPageOutputSchema = z.object({\n\titems: z.array(amazonInventorySummaryRawSchema),\n\tnext_token: z.string().optional(),\n\trate_limit_per_second: z.number().optional(),\n\trequest_id: z.string().optional()\n})\n\nexport const amazonSpApiListInventorySummariesInputSchema = z.object({\n\tmarketplace_id: z.string().min(1).optional().describe('Marketplace id; omit to use the first configured default'),\n\tseller_skus: z.array(z.string().min(1)).max(50).optional().describe('Optional seller SKU filter (max 50)'),\n\tstart_date_time: z.string().min(1).optional().describe('ISO 8601; summaries changed after'),\n\tcursor: z.string().min(1).optional().describe('nextToken from a prior page')\n})\n\nexport const amazonSpApiInventorySummarySchema = z.object({\n\tseller_sku: z.string().optional(),\n\tasin: z.string().optional(),\n\tfn_sku: z.string().optional(),\n\tcondition: z.string().optional(),\n\ttotal_quantity: z.number().optional(),\n\tproduct_name: z.string().optional()\n})\n\nexport const amazonSpApiListInventorySummariesOutputSchema = z.object({\n\titems: z.array(amazonSpApiInventorySummarySchema),\n\tnext_cursor: z.string().optional(),\n\ttruncated: z.boolean()\n})\n\n// ─── Reports (2021-06-30) ─────────────────────────────────────────────────────\n\nexport const amazonSpApiCreateReportInputSchema = z.object({\n\treport_type: z.string().min(1).describe('Report type (e.g. GET_FLAT_FILE_OPEN_LISTINGS_DATA)'),\n\tmarketplace_ids: z\n\t\t.array(z.string().min(1))\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Marketplace ids; omit to use the configured defaults'),\n\tdata_start_time: z.string().min(1).optional().describe('ISO 8601 report data start'),\n\tdata_end_time: z.string().min(1).optional().describe('ISO 8601 report data end'),\n\treport_options: z.record(z.string(), z.string()).optional().describe('Optional report-type-specific options map')\n})\n\nexport const amazonSpApiCreateReportOutputSchema = z.object({\n\treport_id: z.string()\n})\n\nexport const amazonSpApiGetReportInputSchema = z.object({\n\treport_id: z.string().min(1).describe('Report id from createReport or listReports')\n})\n\nexport const amazonSpApiReportSchema = z.object({\n\treport_id: z.string(),\n\treport_type: z.string().optional(),\n\tprocessing_status: z.string().optional(),\n\tmarketplace_ids: z.array(z.string()).optional(),\n\tdata_start_time: z.string().optional(),\n\tdata_end_time: z.string().optional(),\n\treport_document_id: z.string().optional(),\n\tcreated_time: z.string().optional()\n})\n\nexport const amazonSpApiGetReportOutputSchema = z.object({\n\treport: amazonSpApiReportSchema\n})\n\nconst amazonSpApiListReportsInitialFields = {\n\treport_types: z.array(z.string().min(1)).min(1).max(10).describe('Filter by 1-10 report types'),\n\tprocessing_statuses: z\n\t\t.array(z.string().min(1))\n\t\t.optional()\n\t\t.describe('Filter by processing status (e.g. DONE, IN_QUEUE, IN_PROGRESS, CANCELLED, FATAL)'),\n\tmarketplace_ids: z\n\t\t.array(z.string().min(1))\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Marketplace ids filter; omit to use configured defaults when available'),\n\tpage_size: z.int().min(1).max(100).optional().describe('Page size (1-100)'),\n\tcreated_since: z.iso.datetime({ offset: true }).optional().describe('ISO 8601; reports created after'),\n\tcreated_until: z.iso.datetime({ offset: true }).optional().describe('ISO 8601; reports created before')\n}\n\nexport const amazonSpApiListReportsInitialInputSchema = z.strictObject(amazonSpApiListReportsInitialFields)\n\nconst amazonSpApiListReportsCursorInputSchema = z.strictObject({\n\tcursor: z.string().min(1).describe('nextToken from a prior page')\n})\n\nexport const amazonSpApiListReportsInputSchema = z.union([\n\tamazonSpApiListReportsInitialInputSchema,\n\tamazonSpApiListReportsCursorInputSchema\n])\n\nexport const amazonReportRawSchema = z.looseObject({\n\treportId: z.string().min(1),\n\treportType: z.string().optional(),\n\tprocessingStatus: z.string().optional(),\n\tmarketplaceIds: z.array(z.string()).optional(),\n\tdataStartTime: z.string().optional(),\n\tdataEndTime: z.string().optional(),\n\treportScheduleId: z.string().optional(),\n\tcreatedTime: z.string().optional(),\n\tprocessingStartTime: z.string().optional(),\n\tprocessingEndTime: z.string().optional(),\n\treportDocumentId: z.string().optional()\n})\n\nexport const amazonSpApiListReportsContinuationInputSchema = z.strictObject({\n\tnext_token: z.string().min(1)\n})\n\nexport const amazonSpApiListReportsPageInputSchema = z.union([\n\tamazonSpApiListReportsInitialInputSchema,\n\tamazonSpApiListReportsContinuationInputSchema\n])\n\nexport const amazonSpApiListReportsPageOutputSchema = z.object({\n\titems: z.array(amazonReportRawSchema),\n\tnext_token: z.string().optional(),\n\trate_limit_per_second: z.number().optional(),\n\trequest_id: z.string().optional()\n})\n\nexport const amazonSpApiListReportsOutputSchema = z.object({\n\titems: z.array(amazonSpApiReportSchema),\n\tnext_cursor: z.string().optional(),\n\ttruncated: z.boolean()\n})\n\nexport const amazonSpApiGetReportDocumentInputSchema = z.object({\n\treport_document_id: z.string().min(1).describe('Report document id from a completed report')\n})\n\nexport const amazonSpApiGetReportDocumentOutputSchema = z.object({\n\tdocument_id: z.string(),\n\turl: z.string(),\n\tcompression_algorithm: z.string().optional()\n})\n\nexport const amazonSpApiDownloadReportDocumentBytesInputSchema = z.strictObject({\n\treport_document_id: z.string().min(1),\n\tmax_bytes: z.int().positive()\n})\n\nexport const amazonSpApiDownloadReportDocumentBytesOutputSchema = z.object({\n\tbytes: z.custom<Uint8Array>((value) => value instanceof Uint8Array),\n\ttext: z.string(),\n\tbyte_length: z.int().nonnegative(),\n\tcontent_type: z.string().optional(),\n\tcontent_encoding: z.string().optional(),\n\tcompression_algorithm: z.enum(['GZIP']).optional()\n})\n\n// ─── Settlement summary (Flat File V2 composite) ──────────────────────────────\n\n/**\n * Composite input: pick newest completed V2 settlement report in the retention\n * window (default 90d), download one document, return eight summary fields only.\n */\nexport const amazonSpApiGetSettlementSummaryInputSchema = z.object({\n\treport_id: z\n\t\t.string()\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Optional report id; when set, uses this report instead of listing the newest DONE settlement report'),\n\tcreated_since: z\n\t\t.string()\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('ISO 8601 lower bound when listing reports (default: now minus 90 days)')\n})\n\n/** Eight summary fields only — never raw TSV rows. */\nexport const amazonSpApiSettlementSummarySchema = z.object({\n\tsettlement_id: z.string().describe('Amazon settlement id'),\n\tsettlement_start_date: z.string().describe('Settlement period start'),\n\tsettlement_end_date: z.string().describe('Settlement period end'),\n\tdeposit_date: z.string().describe('Deposit date when present; otherwise settlement end'),\n\tcurrency: z.string().describe('ISO currency code from the report'),\n\ttotal_amount_cents: z\n\t\t.number()\n\t\t.int()\n\t\t.describe('Report total-amount as safe integer cents (must equal amount_sum_cents)'),\n\tamount_sum_cents: z.number().int().describe('Sum of amount column as safe integer cents'),\n\trow_count: z.number().int().describe('Number of data rows in the TSV (excluding header)')\n})\n\nexport const amazonSpApiGetSettlementSummaryOutputSchema = amazonSpApiSettlementSummarySchema\n\n// ─── Catalog (2022-04-01) ─────────────────────────────────────────────────────\n\nexport const amazonSpApiSearchCatalogItemsInputSchema = z.object({\n\tkeywords: z.array(z.string().min(1)).min(1).describe('Search keywords'),\n\tmarketplace_ids: z\n\t\t.array(z.string().min(1))\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Marketplace ids; omit to use the configured defaults'),\n\tincluded_data: z\n\t\t.array(z.string().min(1))\n\t\t.optional()\n\t\t.describe('Data sets to include (e.g. summaries, images, attributes)'),\n\tpage_size: z.int().min(1).max(20).optional().describe('Page size (1-20)'),\n\tcursor: z.string().min(1).optional().describe('pageToken from a prior page')\n})\n\nexport const amazonSpApiCatalogItemSchema = z.object({\n\tasin: z.string(),\n\ttitle: z.string().optional(),\n\tbrand: z.string().optional(),\n\tproduct_type: z.string().optional(),\n\tmarketplace_id: z.string().optional()\n})\n\nexport const amazonSpApiSearchCatalogItemsOutputSchema = z.object({\n\titems: z.array(amazonSpApiCatalogItemSchema),\n\tnumber_of_results: z.number().optional(),\n\tnext_cursor: z.string().optional(),\n\ttruncated: z.boolean()\n})\n\n// ─── Types ────────────────────────────────────────────────────────────────────\n\nexport type AmazonSpApiListOrdersInput = z.infer<typeof amazonSpApiListOrdersInputSchema>\nexport type AmazonSpApiListOrdersOutput = z.infer<typeof amazonSpApiListOrdersOutputSchema>\nexport type AmazonSpApiGetOrderInput = z.infer<typeof amazonSpApiGetOrderInputSchema>\nexport type AmazonSpApiGetOrderOutput = z.infer<typeof amazonSpApiGetOrderOutputSchema>\nexport type AmazonSpApiGetOrderItemsInput = z.infer<typeof amazonSpApiGetOrderItemsInputSchema>\nexport type AmazonSpApiGetOrderItemsOutput = z.infer<typeof amazonSpApiGetOrderItemsOutputSchema>\nexport type AmazonSpApiListInventorySummariesInput = z.infer<typeof amazonSpApiListInventorySummariesInputSchema>\nexport type AmazonSpApiListInventorySummariesOutput = z.infer<typeof amazonSpApiListInventorySummariesOutputSchema>\nexport type AmazonSpApiInventoryPageInput = z.infer<typeof amazonSpApiInventoryPageInputSchema>\nexport type AmazonSpApiInventoryPageOutput = z.infer<typeof amazonSpApiInventoryPageOutputSchema>\nexport type AmazonInventorySummaryRaw = z.infer<typeof amazonInventorySummaryRawSchema>\nexport type AmazonSpApiCreateReportInput = z.infer<typeof amazonSpApiCreateReportInputSchema>\nexport type AmazonSpApiCreateReportOutput = z.infer<typeof amazonSpApiCreateReportOutputSchema>\nexport type AmazonSpApiGetReportInput = z.infer<typeof amazonSpApiGetReportInputSchema>\nexport type AmazonSpApiGetReportOutput = z.infer<typeof amazonSpApiGetReportOutputSchema>\nexport type AmazonSpApiListReportsInput = z.infer<typeof amazonSpApiListReportsInputSchema>\nexport type AmazonSpApiListReportsOutput = z.infer<typeof amazonSpApiListReportsOutputSchema>\nexport type AmazonSpApiListReportsInitialInput = z.infer<typeof amazonSpApiListReportsInitialInputSchema>\nexport type AmazonSpApiListReportsContinuationInput = z.infer<typeof amazonSpApiListReportsContinuationInputSchema>\nexport type AmazonSpApiListReportsPageInput = z.infer<typeof amazonSpApiListReportsPageInputSchema>\nexport type AmazonSpApiListReportsPageOutput = z.infer<typeof amazonSpApiListReportsPageOutputSchema>\nexport type AmazonReportRaw = z.infer<typeof amazonReportRawSchema>\nexport type AmazonSpApiGetReportDocumentInput = z.infer<typeof amazonSpApiGetReportDocumentInputSchema>\nexport type AmazonSpApiGetReportDocumentOutput = z.infer<typeof amazonSpApiGetReportDocumentOutputSchema>\nexport type AmazonSpApiDownloadReportDocumentBytesInput = z.infer<\n\ttypeof amazonSpApiDownloadReportDocumentBytesInputSchema\n>\nexport type AmazonSpApiDownloadReportDocumentBytesOutput = z.infer<\n\ttypeof amazonSpApiDownloadReportDocumentBytesOutputSchema\n>\nexport type AmazonSpApiSearchCatalogItemsInput = z.infer<typeof amazonSpApiSearchCatalogItemsInputSchema>\nexport type AmazonSpApiSearchCatalogItemsOutput = z.infer<typeof amazonSpApiSearchCatalogItemsOutputSchema>\nexport type AmazonSpApiSearchOrdersInput = z.infer<typeof amazonSpApiSearchOrdersInputSchema>\nexport type AmazonSpApiSearchOrdersOutput = z.infer<typeof amazonSpApiSearchOrdersOutputSchema>\nexport type AmazonSpApiSearchOrder = z.infer<typeof amazonSpApiSearchOrderSchema>\nexport type AmazonSpApiGetSettlementSummaryInput = z.infer<typeof amazonSpApiGetSettlementSummaryInputSchema>\nexport type AmazonSpApiGetSettlementSummaryOutput = z.infer<typeof amazonSpApiGetSettlementSummaryOutputSchema>\nexport type AmazonSpApiSettlementSummary = z.infer<typeof amazonSpApiSettlementSummarySchema>\nexport type AmazonSpApiOrder = z.infer<typeof amazonSpApiOrderSchema>\nexport type AmazonSpApiOrderItem = z.infer<typeof amazonSpApiOrderItemSchema>\nexport type AmazonSpApiInventorySummary = z.infer<typeof amazonSpApiInventorySummarySchema>\nexport type AmazonSpApiReport = z.infer<typeof amazonSpApiReportSchema>\nexport type AmazonSpApiCatalogItem = z.infer<typeof amazonSpApiCatalogItemSchema>\n","/**\n * Amazon SP-API: LWA body, order/inventory/report/catalog parse (no HTTP).\n */\n\nimport { z } from 'zod'\n\nimport { ToolError } from '../../core/errors'\nimport type {\n\tAmazonSpApiCatalogItem,\n\tAmazonSpApiInventorySummary,\n\tAmazonSpApiInventoryPageOutput,\n\tAmazonSpApiListReportsPageOutput,\n\tAmazonSpApiLwaTokenResponse,\n\tAmazonSpApiOrder,\n\tAmazonSpApiOrderItem,\n\tAmazonSpApiReport,\n\tAmazonSpApiSearchOrder\n} from './contracts'\nimport { amazonInventorySummaryRawSchema, amazonReportRawSchema, amazonSpApiLwaTokenResponseSchema } from './contracts'\n\nexport const LWA_TOKEN_URL = 'https://api.amazon.com/auth/o2/token'\n\nconst amazonMoneyRawSchema = z.looseObject({\n\tAmount: z.string().optional(),\n\tCurrencyCode: z.string().optional()\n})\n\nconst amazonOrderRawSchema = z.looseObject({\n\tAmazonOrderId: z.string().min(1),\n\tOrderStatus: z.string().optional(),\n\tPurchaseDate: z.string().optional(),\n\tLastUpdateDate: z.string().optional(),\n\tMarketplaceId: z.string().optional(),\n\tOrderTotal: amazonMoneyRawSchema.optional(),\n\tFulfillmentChannel: z.string().optional()\n})\n\nconst amazonOrdersResponseSchema = z.looseObject({\n\tpayload: z.looseObject({\n\t\tOrders: z.array(amazonOrderRawSchema),\n\t\tNextToken: z.string().min(1).optional()\n\t})\n})\n\nconst amazonSearchOrderRawSchema = z.looseObject({\n\torderId: z.string().min(1),\n\tcreatedTime: z.string().optional(),\n\tfulfillment: z.looseObject({ fulfillmentStatus: z.string().optional() }).optional()\n})\n\nconst amazonSearchOrdersRootSchema = z.looseObject({\n\torders: z.array(amazonSearchOrderRawSchema),\n\tpagination: z.looseObject({ nextToken: z.string().min(1).optional() }).optional()\n})\n\nconst amazonSearchOrdersWrappedResponseSchema = z.looseObject({ payload: amazonSearchOrdersRootSchema })\n\nconst amazonOrderItemRawSchema = z.looseObject({\n\tOrderItemId: z.string().min(1),\n\tASIN: z.string().optional(),\n\tSellerSKU: z.string().optional(),\n\tTitle: z.string().optional(),\n\tQuantityOrdered: z.number().optional(),\n\tQuantityShipped: z.number().optional(),\n\tItemPrice: amazonMoneyRawSchema.optional()\n})\n\nconst amazonOrderItemsResponseSchema = z.looseObject({\n\tpayload: z.looseObject({\n\t\tAmazonOrderId: z.string().min(1),\n\t\tOrderItems: z.array(amazonOrderItemRawSchema),\n\t\tNextToken: z.string().min(1).optional()\n\t})\n})\n\nconst amazonCatalogItemRawSchema = z.looseObject({\n\tasin: z.string().min(1),\n\tsummaries: z\n\t\t.array(\n\t\t\tz.looseObject({\n\t\t\t\titemName: z.string().optional(),\n\t\t\t\tbrandName: z.string().optional(),\n\t\t\t\tmarketplaceId: z.string().optional()\n\t\t\t})\n\t\t)\n\t\t.optional(),\n\tproductTypes: z.array(z.looseObject({ productType: z.string().optional() })).optional()\n})\n\nconst amazonCatalogSearchResponseSchema = z.looseObject({\n\titems: z.array(amazonCatalogItemRawSchema),\n\tnumberOfResults: z.number().optional(),\n\tpagination: z.looseObject({ nextToken: z.string().min(1).optional() }).optional()\n})\n\nexport function lwaTokenBody(auth: { client_id: string; client_secret: string; refresh_token: string }): string {\n\tconst params = new URLSearchParams({\n\t\tgrant_type: 'refresh_token',\n\t\trefresh_token: auth.refresh_token,\n\t\tclient_id: auth.client_id,\n\t\tclient_secret: auth.client_secret\n\t})\n\treturn params.toString()\n}\n\nexport function parseLwaTokenResponse(data: unknown): AmazonSpApiLwaTokenResponse {\n\tconst parsed = amazonSpApiLwaTokenResponseSchema.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon LWA returned an invalid token response', {\n\t\t\tcode: 'bad_auth',\n\t\t\tdetails: { issues: parsed.error.issues.map((issue) => issue.message) }\n\t\t})\n\t}\n\treturn parsed.data\n}\n\nexport function parseOrder(value: unknown): AmazonSpApiOrder {\n\tconst parsed = amazonOrderRawSchema.safeParse(value)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API returned an invalid order', { code: 'upstream' })\n\t}\n\treturn {\n\t\tamazon_order_id: parsed.data.AmazonOrderId,\n\t\t...(parsed.data.OrderStatus && { order_status: parsed.data.OrderStatus }),\n\t\t...(parsed.data.PurchaseDate && { purchase_date: parsed.data.PurchaseDate }),\n\t\t...(parsed.data.LastUpdateDate && { last_update_date: parsed.data.LastUpdateDate }),\n\t\t...(parsed.data.MarketplaceId && { marketplace_id: parsed.data.MarketplaceId }),\n\t\t...(parsed.data.OrderTotal?.Amount && { order_total_amount: parsed.data.OrderTotal.Amount }),\n\t\t...(parsed.data.OrderTotal?.CurrencyCode && { order_total_currency: parsed.data.OrderTotal.CurrencyCode }),\n\t\t...(parsed.data.FulfillmentChannel && { fulfillment_channel: parsed.data.FulfillmentChannel })\n\t}\n}\n\nexport function parseOrdersPayload(data: unknown): {\n\titems: AmazonSpApiOrder[]\n\tnextToken?: string\n} {\n\tconst parsed = amazonOrdersResponseSchema.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API orders payload invalid', { code: 'upstream' })\n\t}\n\treturn {\n\t\titems: parsed.data.payload.Orders.map(parseOrder),\n\t\t...(parsed.data.payload.NextToken && { nextToken: parsed.data.payload.NextToken })\n\t}\n}\n\nexport function parseOrderPayload(data: unknown): AmazonSpApiOrder {\n\tconst parsed = z.looseObject({ payload: amazonOrderRawSchema }).safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API get order payload invalid', { code: 'upstream' })\n\t}\n\treturn parseOrder(parsed.data.payload)\n}\n\n/** Orders API v2026-01-01 SearchOrders — camelCase body, not v0 payload wrapper. */\nexport function parseSearchOrder(value: unknown): AmazonSpApiSearchOrder {\n\tconst parsed = amazonSearchOrderRawSchema.safeParse(value)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API searchOrders returned an invalid order', { code: 'upstream' })\n\t}\n\treturn {\n\t\torder_id: parsed.data.orderId,\n\t\t...(parsed.data.createdTime && { created_time: parsed.data.createdTime }),\n\t\t...(parsed.data.fulfillment?.fulfillmentStatus && {\n\t\t\tfulfillment_status: parsed.data.fulfillment.fulfillmentStatus\n\t\t})\n\t}\n}\n\nexport function parseSearchOrdersPayload(data: unknown): {\n\titems: AmazonSpApiSearchOrder[]\n\tnextToken?: string\n} {\n\tconst wrapped = amazonSearchOrdersWrappedResponseSchema.safeParse(data)\n\tconst direct = amazonSearchOrdersRootSchema.safeParse(data)\n\tconst root = wrapped.success ? wrapped.data.payload : direct.success ? direct.data : undefined\n\tif (!root) {\n\t\tthrow new ToolError('Amazon SP-API searchOrders payload invalid', { code: 'upstream' })\n\t}\n\treturn {\n\t\titems: root.orders.map(parseSearchOrder),\n\t\t...(root.pagination?.nextToken && { nextToken: root.pagination.nextToken })\n\t}\n}\n\nexport function parseOrderItem(value: unknown): AmazonSpApiOrderItem {\n\tconst parsed = amazonOrderItemRawSchema.safeParse(value)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API returned an invalid order item', { code: 'upstream' })\n\t}\n\treturn {\n\t\torder_item_id: parsed.data.OrderItemId,\n\t\t...(parsed.data.ASIN && { asin: parsed.data.ASIN }),\n\t\t...(parsed.data.SellerSKU && { seller_sku: parsed.data.SellerSKU }),\n\t\t...(parsed.data.Title && { title: parsed.data.Title }),\n\t\t...(parsed.data.QuantityOrdered !== undefined && { quantity_ordered: parsed.data.QuantityOrdered }),\n\t\t...(parsed.data.QuantityShipped !== undefined && { quantity_shipped: parsed.data.QuantityShipped }),\n\t\t...(parsed.data.ItemPrice?.Amount && { item_price_amount: parsed.data.ItemPrice.Amount }),\n\t\t...(parsed.data.ItemPrice?.CurrencyCode && { item_price_currency: parsed.data.ItemPrice.CurrencyCode })\n\t}\n}\n\nexport function parseOrderItemsPayload(data: unknown): {\n\tamazon_order_id: string\n\titems: AmazonSpApiOrderItem[]\n\tnextToken?: string\n} {\n\tconst parsed = amazonOrderItemsResponseSchema.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API order items payload invalid', { code: 'upstream' })\n\t}\n\treturn {\n\t\tamazon_order_id: parsed.data.payload.AmazonOrderId,\n\t\titems: parsed.data.payload.OrderItems.map(parseOrderItem),\n\t\t...(parsed.data.payload.NextToken && { nextToken: parsed.data.payload.NextToken })\n\t}\n}\n\nexport function parseInventorySummary(value: unknown): AmazonSpApiInventorySummary {\n\tconst parsed = amazonInventorySummaryRawSchema.safeParse(value)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API returned an invalid inventory summary', {\n\t\t\tcode: 'upstream',\n\t\t\tdetails: { issues: parsed.error.issues.map((issue) => issue.message) }\n\t\t})\n\t}\n\treturn {\n\t\t...(parsed.data.sellerSku && { seller_sku: parsed.data.sellerSku }),\n\t\t...(parsed.data.asin && { asin: parsed.data.asin }),\n\t\t...(parsed.data.fnSku && { fn_sku: parsed.data.fnSku }),\n\t\t...(parsed.data.condition && { condition: parsed.data.condition }),\n\t\t...(parsed.data.totalQuantity !== undefined && { total_quantity: parsed.data.totalQuantity }),\n\t\t...(parsed.data.productName && { product_name: parsed.data.productName })\n\t}\n}\n\nconst inventoryPageResponseSchema = z.looseObject({\n\tpayload: z.looseObject({\n\t\tinventorySummaries: z.array(amazonInventorySummaryRawSchema)\n\t}),\n\tpagination: z.looseObject({ nextToken: z.string().min(1).optional() }).optional()\n})\n\nconst optionalAmazonRateLimitSchema = z.coerce.number().positive()\n\nexport function parseAmazonResponseMetadata(headers: Headers): {\n\trate_limit_per_second?: number\n\trequest_id?: string\n} {\n\tconst rawRateLimit = headers.get('x-amzn-ratelimit-limit')\n\tlet rateLimit: number | undefined\n\tif (rawRateLimit !== null) {\n\t\tconst parsedRateLimit = optionalAmazonRateLimitSchema.safeParse(rawRateLimit)\n\t\tif (!parsedRateLimit.success) {\n\t\t\tthrow new ToolError('Amazon SP-API returned an invalid rate-limit header', { code: 'upstream' })\n\t\t}\n\t\trateLimit = parsedRateLimit.data\n\t}\n\tconst requestId = headers.get('x-amzn-requestid') ?? headers.get('x-amzn-request-id') ?? undefined\n\treturn {\n\t\t...(rateLimit !== undefined && { rate_limit_per_second: rateLimit }),\n\t\t...(requestId && { request_id: requestId })\n\t}\n}\n\nexport function parseInventoryPagePayload(data: unknown, headers: Headers): AmazonSpApiInventoryPageOutput {\n\tconst parsed = inventoryPageResponseSchema.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API inventory page response invalid', {\n\t\t\tcode: 'upstream',\n\t\t\tdetails: { issues: parsed.error.issues.map((issue) => issue.message) }\n\t\t})\n\t}\n\treturn {\n\t\titems: parsed.data.payload.inventorySummaries,\n\t\t...(parsed.data.pagination?.nextToken && { next_token: parsed.data.pagination.nextToken }),\n\t\t...parseAmazonResponseMetadata(headers)\n\t}\n}\n\nexport function parseInventoryPayload(data: unknown): {\n\titems: AmazonSpApiInventorySummary[]\n\tnextToken?: string\n} {\n\tconst page = parseInventoryPagePayload(data, new Headers())\n\treturn { items: page.items.map(parseInventorySummary), ...(page.next_token && { nextToken: page.next_token }) }\n}\n\nexport function parseCreateReportPayload(data: unknown): { report_id: string } {\n\tconst parsed = z.looseObject({ reportId: z.string().min(1) }).safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API create report response invalid', { code: 'upstream' })\n\t}\n\treturn { report_id: parsed.data.reportId }\n}\n\nexport function parseReport(value: unknown): AmazonSpApiReport {\n\tconst parsed = amazonReportRawSchema.safeParse(value)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API returned an invalid report', {\n\t\t\tcode: 'upstream',\n\t\t\tdetails: { issues: parsed.error.issues.map((issue) => issue.message) }\n\t\t})\n\t}\n\treturn {\n\t\treport_id: parsed.data.reportId,\n\t\t...(parsed.data.reportType && { report_type: parsed.data.reportType }),\n\t\t...(parsed.data.processingStatus && { processing_status: parsed.data.processingStatus }),\n\t\t...(parsed.data.marketplaceIds &&\n\t\t\tparsed.data.marketplaceIds.length > 0 && {\n\t\t\t\tmarketplace_ids: parsed.data.marketplaceIds\n\t\t\t}),\n\t\t...(parsed.data.dataStartTime && { data_start_time: parsed.data.dataStartTime }),\n\t\t...(parsed.data.dataEndTime && { data_end_time: parsed.data.dataEndTime }),\n\t\t...(parsed.data.reportDocumentId && { report_document_id: parsed.data.reportDocumentId }),\n\t\t...(parsed.data.createdTime && { created_time: parsed.data.createdTime })\n\t}\n}\n\nexport function parseGetReportPayload(data: unknown): AmazonSpApiReport {\n\treturn parseReport(data)\n}\n\nexport function parseListReportsPayload(data: unknown): {\n\titems: AmazonSpApiReport[]\n\tnextToken?: string\n} {\n\tconst page = parseListReportsPagePayload(data, new Headers())\n\treturn { items: page.items.map(parseReport), ...(page.next_token && { nextToken: page.next_token }) }\n}\n\nconst listReportsPageResponseSchema = z.looseObject({\n\treports: z.array(amazonReportRawSchema),\n\tnextToken: z.string().min(1).optional()\n})\n\nexport function parseListReportsPagePayload(data: unknown, headers: Headers): AmazonSpApiListReportsPageOutput {\n\tconst parsed = listReportsPageResponseSchema.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API list reports page response invalid', {\n\t\t\tcode: 'upstream',\n\t\t\tdetails: { issues: parsed.error.issues.map((issue) => issue.message) }\n\t\t})\n\t}\n\treturn {\n\t\titems: parsed.data.reports,\n\t\t...(parsed.data.nextToken && { next_token: parsed.data.nextToken }),\n\t\t...parseAmazonResponseMetadata(headers)\n\t}\n}\n\nexport function parseReportDocumentPayload(data: unknown): {\n\tdocument_id: string\n\turl: string\n\tcompression_algorithm?: string\n} {\n\tconst parsed = z\n\t\t.looseObject({\n\t\t\treportDocumentId: z.string().min(1),\n\t\t\turl: z.url(),\n\t\t\tcompressionAlgorithm: z.string().min(1).optional()\n\t\t})\n\t\t.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API report document response invalid', { code: 'upstream' })\n\t}\n\treturn {\n\t\tdocument_id: parsed.data.reportDocumentId,\n\t\turl: parsed.data.url,\n\t\t...(parsed.data.compressionAlgorithm && { compression_algorithm: parsed.data.compressionAlgorithm })\n\t}\n}\n\nexport function parseCatalogItem(value: unknown): AmazonSpApiCatalogItem {\n\tconst parsed = amazonCatalogItemRawSchema.safeParse(value)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API returned an invalid catalog item', { code: 'upstream' })\n\t}\n\tconst summary = parsed.data.summaries?.[0]\n\tconst productType = parsed.data.productTypes?.[0]\n\treturn {\n\t\tasin: parsed.data.asin,\n\t\t...(summary?.itemName && { title: summary.itemName }),\n\t\t...(summary?.brandName && { brand: summary.brandName }),\n\t\t...(productType?.productType && { product_type: productType.productType }),\n\t\t...(summary?.marketplaceId && { marketplace_id: summary.marketplaceId })\n\t}\n}\n\nexport function parseSearchCatalogItemsPayload(data: unknown): {\n\titems: AmazonSpApiCatalogItem[]\n\tnumberOfResults?: number\n\tnextToken?: string\n} {\n\tconst parsed = amazonCatalogSearchResponseSchema.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API catalog search payload invalid', { code: 'upstream' })\n\t}\n\treturn {\n\t\titems: parsed.data.items.map(parseCatalogItem),\n\t\t...(parsed.data.numberOfResults !== undefined && { numberOfResults: parsed.data.numberOfResults }),\n\t\t...(parsed.data.pagination?.nextToken && { nextToken: parsed.data.pagination.nextToken })\n\t}\n}\n\nexport function requireMarketplaceIds(\n\tinputIds: string[] | undefined,\n\tauthIds: string[] | undefined,\n\tlabel: string\n): string[] {\n\tconst ids = inputIds ?? authIds\n\tif (!ids || ids.length === 0) {\n\t\tthrow new ToolError(`${label} requires marketplace_ids on the call or auth`, { code: 'bad_input' })\n\t}\n\treturn ids\n}\n","import { createRequire } from 'module';\nvar require = createRequire('/');\n// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar _a;\n// Mediocre shim\nvar Worker;\nvar isMarkedAsUntransferable;\nvar workerAdd = \";var __w=require('worker_threads');__w.parentPort.on('message',function(m){onmessage({data:m})}),postMessage=function(m,t){__w.parentPort.postMessage(m,t)},close=process.exit;self=global\";\ntry {\n    (_a = require('worker_threads'), Worker = _a.Worker, isMarkedAsUntransferable = _a.isMarkedAsUntransferable);\n}\ncatch (e) {\n}\nvar wk = Worker ? function (c, _, msg, transfer, cb) {\n    var done = false;\n    var w = new Worker(c + workerAdd, { eval: true })\n        .on('error', function (e) { return cb(e, null); })\n        .on('message', function (m) { return cb(null, m); })\n        .on('exit', function (c) {\n        if (c && !done)\n            cb(new Error('exited with code ' + c), null);\n    });\n    if (isMarkedAsUntransferable)\n        transfer = transfer.filter(function (t) { return !isMarkedAsUntransferable(t); });\n    w.postMessage(msg, transfer);\n    w.terminate = function () {\n        done = true;\n        return Worker.prototype.terminate.call(w);\n    };\n    return w;\n} : function (_, __, ___, ____, cb) {\n    setImmediate(function () { return cb(new Error('async operations unsupported - update to Node 12+ (or Node 10-11 with the --experimental-worker CLI flag)'), null); });\n    var NOP = function () { };\n    return {\n        terminate: NOP,\n        postMessage: NOP\n    };\n};\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */ 0, 0, /* impossible */ 0]);\n// fixed distance extra bits\nvar fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */ 0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function (eb, start) {\n    var b = new u16(31);\n    for (var i = 0; i < 31; ++i) {\n        b[i] = start += 1 << eb[i - 1];\n    }\n    // numbers here are at max 18 bits\n    var r = new i32(b[30]);\n    for (var i = 1; i < 30; ++i) {\n        for (var j = b[i]; j < b[i + 1]; ++j) {\n            r[j] = ((j - b[i]) << 5) | i;\n        }\n    }\n    return { b: b, r: r };\n};\nvar _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0), fd = _b.b, revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var i = 0; i < 32768; ++i) {\n    // reverse table algorithm from SO\n    var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);\n    x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);\n    x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);\n    rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = (function (cd, mb, r) {\n    var s = cd.length;\n    // index\n    var i = 0;\n    // u16 \"map\": index -> # of codes with bit length = index\n    var l = new u16(mb);\n    // length of cd must be 288 (total # of codes)\n    for (; i < s; ++i) {\n        if (cd[i])\n            ++l[cd[i] - 1];\n    }\n    // u16 \"map\": index -> minimum code for bit length = index\n    var le = new u16(mb);\n    for (i = 1; i < mb; ++i) {\n        le[i] = (le[i - 1] + l[i - 1]) << 1;\n    }\n    var co;\n    if (r) {\n        // u16 \"map\": index -> number of actual bits, symbol for code\n        co = new u16(1 << mb);\n        // bits to remove for reverser\n        var rvb = 15 - mb;\n        for (i = 0; i < s; ++i) {\n            // ignore 0 lengths\n            if (cd[i]) {\n                // num encoding both symbol and bits read\n                var sv = (i << 4) | cd[i];\n                // free bits\n                var r_1 = mb - cd[i];\n                // start value\n                var v = le[cd[i] - 1]++ << r_1;\n                // m is end value\n                for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {\n                    // every 16 bit value starting with the code yields the same result\n                    co[rev[v] >> rvb] = sv;\n                }\n            }\n        }\n    }\n    else {\n        co = new u16(s);\n        for (i = 0; i < s; ++i) {\n            if (cd[i]) {\n                co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);\n            }\n        }\n    }\n    return co;\n});\n// fixed length tree\nvar flt = new u8(288);\nfor (var i = 0; i < 144; ++i)\n    flt[i] = 8;\nfor (var i = 144; i < 256; ++i)\n    flt[i] = 9;\nfor (var i = 256; i < 280; ++i)\n    flt[i] = 7;\nfor (var i = 280; i < 288; ++i)\n    flt[i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var i = 0; i < 32; ++i)\n    fdt[i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/ hMap(flt, 9, 0), flrm = /*#__PURE__*/ hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/ hMap(fdt, 5, 0), fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);\n// find max of array\nvar max = function (a) {\n    var m = a[0];\n    for (var i = 1; i < a.length; ++i) {\n        if (a[i] > m)\n            m = a[i];\n    }\n    return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function (d, p, m) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function (d, p) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));\n};\n// get end of byte\nvar shft = function (p) { return ((p + 7) / 8) | 0; };\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function (v, s, e) {\n    if (s == null || s < 0)\n        s = 0;\n    if (e == null || e > v.length)\n        e = v.length;\n    // can't use .constructor in case user-supplied\n    return new u8(v.subarray(s, e));\n};\n/**\n * Codes for errors generated within this library\n */\nexport var FlateErrorCode = {\n    UnexpectedEOF: 0,\n    InvalidBlockType: 1,\n    InvalidLengthLiteral: 2,\n    InvalidDistance: 3,\n    StreamFinished: 4,\n    NoStreamHandler: 5,\n    InvalidHeader: 6,\n    NoCallback: 7,\n    InvalidUTF8: 8,\n    ExtraFieldTooLong: 9,\n    InvalidDate: 10,\n    FilenameTooLong: 11,\n    StreamFinishing: 12,\n    InvalidZipData: 13,\n    UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = [\n    'unexpected EOF',\n    'invalid block type',\n    'invalid length/literal',\n    'invalid distance',\n    'stream finished',\n    'no stream handler',\n    , // determined by compression function\n    'no callback',\n    'invalid UTF-8 data',\n    'extra field too long',\n    'date not in range 1980-2099',\n    'filename too long',\n    'stream finishing',\n    'invalid zip data'\n    // determined by unknown compression method\n];\n;\nvar err = function (ind, msg, nt) {\n    var e = new Error(msg || ec[ind]);\n    e.code = ind;\n    if (Error.captureStackTrace)\n        Error.captureStackTrace(e, err);\n    if (!nt)\n        throw e;\n    return e;\n};\n// expands raw DEFLATE data\nvar inflt = function (dat, st, buf, dict) {\n    // source length       dict length\n    var sl = dat.length, dl = dict ? dict.length : 0;\n    if (!sl || st.f && !st.l)\n        return buf || new u8(0);\n    var noBuf = !buf;\n    // have to estimate size\n    var resize = noBuf || st.i != 2;\n    // no state\n    var noSt = st.i;\n    // Assumes roughly 33% compression ratio average\n    if (noBuf)\n        buf = new u8(sl * 3);\n    // ensure buffer can fit at least l elements\n    var cbuf = function (l) {\n        var bl = buf.length;\n        // need to increase size to fit\n        if (l > bl) {\n            // Double or set to necessary, whichever is greater\n            var nbuf = new u8(Math.max(bl * 2, l));\n            nbuf.set(buf);\n            buf = nbuf;\n        }\n    };\n    //  last chunk         bitpos           bytes\n    var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;\n    // total bits\n    var tbts = sl * 8;\n    do {\n        if (!lm) {\n            // BFINAL - this is only 1 when last chunk is next\n            final = bits(dat, pos, 1);\n            // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman\n            var type = bits(dat, pos + 1, 3);\n            pos += 3;\n            if (!type) {\n                // go to end of byte boundary\n                var s = shft(pos) + 4, l = dat[s - 4] | (dat[s - 3] << 8), t = s + l;\n                if (t > sl) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                // ensure size\n                if (resize)\n                    cbuf(bt + l);\n                // Copy over uncompressed data\n                buf.set(dat.subarray(s, t), bt);\n                // Get new bitpos, update byte count\n                st.b = bt += l, st.p = pos = t * 8, st.f = final;\n                continue;\n            }\n            else if (type == 1)\n                lm = flrm, dm = fdrm, lbt = 9, dbt = 5;\n            else if (type == 2) {\n                //  literal                            lengths\n                var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;\n                var tl = hLit + bits(dat, pos + 5, 31) + 1;\n                pos += 14;\n                // length+distance tree\n                var ldt = new u8(tl);\n                // code length tree\n                var clt = new u8(19);\n                for (var i = 0; i < hcLen; ++i) {\n                    // use index map to get real code\n                    clt[clim[i]] = bits(dat, pos + i * 3, 7);\n                }\n                pos += hcLen * 3;\n                // code lengths bits\n                var clb = max(clt), clbmsk = (1 << clb) - 1;\n                // code lengths map\n                var clm = hMap(clt, clb, 1);\n                for (var i = 0; i < tl;) {\n                    var r = clm[bits(dat, pos, clbmsk)];\n                    // bits read\n                    pos += r & 15;\n                    // symbol\n                    var s = r >> 4;\n                    // code length to copy\n                    if (s < 16) {\n                        ldt[i++] = s;\n                    }\n                    else {\n                        //  copy   count\n                        var c = 0, n = 0;\n                        if (s == 16)\n                            n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];\n                        else if (s == 17)\n                            n = 3 + bits(dat, pos, 7), pos += 3;\n                        else if (s == 18)\n                            n = 11 + bits(dat, pos, 127), pos += 7;\n                        while (n--)\n                            ldt[i++] = c;\n                    }\n                }\n                //    length tree                 distance tree\n                var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);\n                // max length bits\n                lbt = max(lt);\n                // max dist bits\n                dbt = max(dt);\n                lm = hMap(lt, lbt, 1);\n                dm = hMap(dt, dbt, 1);\n            }\n            else\n                err(1);\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n        }\n        // Make sure the buffer can hold this + the largest possible addition\n        // Maximum chunk size (practically, theoretically infinite) is 2^17\n        if (resize)\n            cbuf(bt + 131072);\n        var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;\n        var lpos = pos;\n        for (;; lpos = pos) {\n            // bits read, code\n            var c = lm[bits16(dat, pos) & lms], sym = c >> 4;\n            pos += c & 15;\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n            if (!c)\n                err(2);\n            if (sym < 256)\n                buf[bt++] = sym;\n            else if (sym == 256) {\n                lpos = pos, lm = null;\n                break;\n            }\n            else {\n                var add = sym - 254;\n                // no extra bits needed if less\n                if (sym > 264) {\n                    // index\n                    var i = sym - 257, b = fleb[i];\n                    add = bits(dat, pos, (1 << b) - 1) + fl[i];\n                    pos += b;\n                }\n                // dist\n                var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;\n                if (!d)\n                    err(3);\n                pos += d & 15;\n                var dt = fd[dsym];\n                if (dsym > 3) {\n                    var b = fdeb[dsym];\n                    dt += bits16(dat, pos) & (1 << b) - 1, pos += b;\n                }\n                if (pos > tbts) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                if (resize)\n                    cbuf(bt + 131072);\n                var end = bt + add;\n                if (bt < dt) {\n                    var shift = dl - dt, dend = Math.min(dt, end);\n                    if (shift + bt < 0)\n                        err(3);\n                    for (; bt < dend; ++bt)\n                        buf[bt] = dict[shift + bt];\n                }\n                for (; bt < end; ++bt)\n                    buf[bt] = buf[bt - dt];\n            }\n        }\n        st.l = lm, st.p = lpos, st.b = bt, st.f = final;\n        if (lm)\n            final = 1, st.m = lbt, st.d = dm, st.n = dbt;\n    } while (!final);\n    // don't reallocate for streams or user buffers\n    return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);\n};\n// starting at p, write the minimum number of bits that can hold v to d\nvar wbits = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n};\n// starting at p, write the minimum number of bits (>8) that can hold v to d\nvar wbits16 = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n    d[o + 2] |= v >> 16;\n};\n// creates code lengths from a frequency table\nvar hTree = function (d, mb) {\n    // Need extra info to make a tree\n    var t = [];\n    for (var i = 0; i < d.length; ++i) {\n        if (d[i])\n            t.push({ s: i, f: d[i] });\n    }\n    var s = t.length;\n    var t2 = t.slice();\n    if (!s)\n        return { t: et, l: 0 };\n    if (s == 1) {\n        var v = new u8(t[0].s + 1);\n        v[t[0].s] = 1;\n        return { t: v, l: 1 };\n    }\n    t.sort(function (a, b) { return a.f - b.f; });\n    // after i2 reaches last ind, will be stopped\n    // freq must be greater than largest possible number of symbols\n    t.push({ s: -1, f: 25001 });\n    var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;\n    t[0] = { s: -1, f: l.f + r.f, l: l, r: r };\n    // efficient algorithm from UZIP.js\n    // i0 is lookbehind, i2 is lookahead - after processing two low-freq\n    // symbols that combined have high freq, will start processing i2 (high-freq,\n    // non-composite) symbols instead\n    // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/\n    while (i1 != s - 1) {\n        l = t[t[i0].f < t[i2].f ? i0++ : i2++];\n        r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];\n        t[i1++] = { s: -1, f: l.f + r.f, l: l, r: r };\n    }\n    var maxSym = t2[0].s;\n    for (var i = 1; i < s; ++i) {\n        if (t2[i].s > maxSym)\n            maxSym = t2[i].s;\n    }\n    // code lengths\n    var tr = new u16(maxSym + 1);\n    // max bits in tree\n    var mbt = ln(t[i1 - 1], tr, 0);\n    if (mbt > mb) {\n        // more algorithms from UZIP.js\n        // TODO: find out how this code works (debt)\n        //  ind    debt\n        var i = 0, dt = 0;\n        //    left            cost\n        var lft = mbt - mb, cst = 1 << lft;\n        t2.sort(function (a, b) { return tr[b.s] - tr[a.s] || a.f - b.f; });\n        for (; i < s; ++i) {\n            var i2_1 = t2[i].s;\n            if (tr[i2_1] > mb) {\n                dt += cst - (1 << (mbt - tr[i2_1]));\n                tr[i2_1] = mb;\n            }\n            else\n                break;\n        }\n        dt >>= lft;\n        while (dt > 0) {\n            var i2_2 = t2[i].s;\n            if (tr[i2_2] < mb)\n                dt -= 1 << (mb - tr[i2_2]++ - 1);\n            else\n                ++i;\n        }\n        for (; i >= 0 && dt; --i) {\n            var i2_3 = t2[i].s;\n            if (tr[i2_3] == mb) {\n                --tr[i2_3];\n                ++dt;\n            }\n        }\n        mbt = mb;\n    }\n    return { t: new u8(tr), l: mbt };\n};\n// get the max length and assign length codes\nvar ln = function (n, l, d) {\n    return n.s == -1\n        ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1))\n        : (l[n.s] = d);\n};\n// length codes generation\nvar lc = function (c) {\n    var s = c.length;\n    // Note that the semicolon was intentional\n    while (s && !c[--s])\n        ;\n    var cl = new u16(++s);\n    //  ind      num         streak\n    var cli = 0, cln = c[0], cls = 1;\n    var w = function (v) { cl[cli++] = v; };\n    for (var i = 1; i <= s; ++i) {\n        if (c[i] == cln && i != s)\n            ++cls;\n        else {\n            if (!cln && cls > 2) {\n                for (; cls > 138; cls -= 138)\n                    w(32754);\n                if (cls > 2) {\n                    w(cls > 10 ? ((cls - 11) << 5) | 28690 : ((cls - 3) << 5) | 12305);\n                    cls = 0;\n                }\n            }\n            else if (cls > 3) {\n                w(cln), --cls;\n                for (; cls > 6; cls -= 6)\n                    w(8304);\n                if (cls > 2)\n                    w(((cls - 3) << 5) | 8208), cls = 0;\n            }\n            while (cls--)\n                w(cln);\n            cls = 1;\n            cln = c[i];\n        }\n    }\n    return { c: cl.subarray(0, cli), n: s };\n};\n// calculate the length of output from tree, code lengths\nvar clen = function (cf, cl) {\n    var l = 0;\n    for (var i = 0; i < cl.length; ++i)\n        l += cf[i] * cl[i];\n    return l;\n};\n// writes a fixed block\n// returns the new bit pos\nvar wfblk = function (out, pos, dat) {\n    // no need to write 00 as type: TypedArray defaults to 0\n    var s = dat.length;\n    var o = shft(pos + 2);\n    out[o] = s & 255;\n    out[o + 1] = s >> 8;\n    out[o + 2] = out[o] ^ 255;\n    out[o + 3] = out[o + 1] ^ 255;\n    for (var i = 0; i < s; ++i)\n        out[o + i + 4] = dat[i];\n    return (o + 4 + s) * 8;\n};\n// writes a block\nvar wblk = function (dat, out, final, syms, lf, df, eb, li, bs, bl, p) {\n    wbits(out, p++, final);\n    ++lf[256];\n    var _a = hTree(lf, 15), dlt = _a.t, mlb = _a.l;\n    var _b = hTree(df, 15), ddt = _b.t, mdb = _b.l;\n    var _c = lc(dlt), lclt = _c.c, nlc = _c.n;\n    var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;\n    var lcfreq = new u16(19);\n    for (var i = 0; i < lclt.length; ++i)\n        ++lcfreq[lclt[i] & 31];\n    for (var i = 0; i < lcdt.length; ++i)\n        ++lcfreq[lcdt[i] & 31];\n    var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;\n    var nlcc = 19;\n    for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)\n        ;\n    var flen = (bl + 5) << 3;\n    var ftlen = clen(lf, flt) + clen(df, fdt) + eb;\n    var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];\n    if (bs >= 0 && flen <= ftlen && flen <= dtlen)\n        return wfblk(out, p, dat.subarray(bs, bs + bl));\n    var lm, ll, dm, dl;\n    wbits(out, p, 1 + (dtlen < ftlen)), p += 2;\n    if (dtlen < ftlen) {\n        lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;\n        var llm = hMap(lct, mlcb, 0);\n        wbits(out, p, nlc - 257);\n        wbits(out, p + 5, ndc - 1);\n        wbits(out, p + 10, nlcc - 4);\n        p += 14;\n        for (var i = 0; i < nlcc; ++i)\n            wbits(out, p + 3 * i, lct[clim[i]]);\n        p += 3 * nlcc;\n        var lcts = [lclt, lcdt];\n        for (var it = 0; it < 2; ++it) {\n            var clct = lcts[it];\n            for (var i = 0; i < clct.length; ++i) {\n                var len = clct[i] & 31;\n                wbits(out, p, llm[len]), p += lct[len];\n                if (len > 15)\n                    wbits(out, p, (clct[i] >> 5) & 127), p += clct[i] >> 12;\n            }\n        }\n    }\n    else {\n        lm = flm, ll = flt, dm = fdm, dl = fdt;\n    }\n    for (var i = 0; i < li; ++i) {\n        var sym = syms[i];\n        if (sym > 255) {\n            var len = (sym >> 18) & 31;\n            wbits16(out, p, lm[len + 257]), p += ll[len + 257];\n            if (len > 7)\n                wbits(out, p, (sym >> 23) & 31), p += fleb[len];\n            var dst = sym & 31;\n            wbits16(out, p, dm[dst]), p += dl[dst];\n            if (dst > 3)\n                wbits16(out, p, (sym >> 5) & 8191), p += fdeb[dst];\n        }\n        else {\n            wbits16(out, p, lm[sym]), p += ll[sym];\n        }\n    }\n    wbits16(out, p, lm[256]);\n    return p + ll[256];\n};\n// deflate options (nice << 13) | chain\nvar deo = /*#__PURE__*/ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);\n// empty\nvar et = /*#__PURE__*/ new u8(0);\n// compresses data into a raw DEFLATE buffer\nvar dflt = function (dat, lvl, plvl, pre, post, st) {\n    var s = st.z || dat.length;\n    var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);\n    // writing to this writes to the output buffer\n    var w = o.subarray(pre, o.length - post);\n    var lst = st.l;\n    var pos = (st.r || 0) & 7;\n    if (lvl) {\n        if (pos)\n            w[0] = st.r >> 3;\n        var opt = deo[lvl - 1];\n        var n = opt >> 13, c = opt & 8191;\n        var msk_1 = (1 << plvl) - 1;\n        //    prev 2-byte val map    curr 2-byte val map\n        var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);\n        var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;\n        var hsh = function (i) { return (dat[i] ^ (dat[i + 1] << bs1_1) ^ (dat[i + 2] << bs2_1)) & msk_1; };\n        // 24576 is an arbitrary number of maximum symbols per block\n        // 424 buffer for last block\n        var syms = new i32(25000);\n        // length/literal freq   distance freq\n        var lf = new u16(288), df = new u16(32);\n        //  l/lcnt  exbits  index          l/lind  waitdx          blkpos\n        var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;\n        for (; i + 2 < s; ++i) {\n            // hash value\n            var hv = hsh(i);\n            // index mod 32768    previous index mod\n            var imod = i & 32767, pimod = head[hv];\n            prev[imod] = pimod;\n            head[hv] = imod;\n            // We always should modify head and prev, but only add symbols if\n            // this data is not yet processed (\"wait\" for wait index)\n            if (wi <= i) {\n                // bytes remaining\n                var rem = s - i;\n                if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {\n                    pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);\n                    li = lc_1 = eb = 0, bs = i;\n                    for (var j = 0; j < 286; ++j)\n                        lf[j] = 0;\n                    for (var j = 0; j < 30; ++j)\n                        df[j] = 0;\n                }\n                //  len    dist   chain\n                var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;\n                if (rem > 2 && hv == hsh(i - dif)) {\n                    var maxn = Math.min(n, rem) - 1;\n                    var maxd = Math.min(32767, i);\n                    // max possible length\n                    // not capped at dif because decompressors implement \"rolling\" index population\n                    var ml = Math.min(258, rem);\n                    while (dif <= maxd && --ch_1 && imod != pimod) {\n                        if (dat[i + l] == dat[i + l - dif]) {\n                            var nl = 0;\n                            for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)\n                                ;\n                            if (nl > l) {\n                                l = nl, d = dif;\n                                // break out early when we reach \"nice\" (we are satisfied enough)\n                                if (nl > maxn)\n                                    break;\n                                // now, find the rarest 2-byte sequence within this\n                                // length of literals and search for that instead.\n                                // Much faster than just using the start\n                                var mmd = Math.min(dif, nl - 2);\n                                var md = 0;\n                                for (var j = 0; j < mmd; ++j) {\n                                    var ti = i - dif + j & 32767;\n                                    var pti = prev[ti];\n                                    var cd = ti - pti & 32767;\n                                    if (cd > md)\n                                        md = cd, pimod = ti;\n                                }\n                            }\n                        }\n                        // check the previous match\n                        imod = pimod, pimod = prev[imod];\n                        dif += imod - pimod & 32767;\n                    }\n                }\n                // d will be nonzero only when a match was found\n                if (d) {\n                    // store both dist and len data in one int32\n                    // Make sure this is recognized as a len/dist with 28th bit (2^28)\n                    syms[li++] = 268435456 | (revfl[l] << 18) | revfd[d];\n                    var lin = revfl[l] & 31, din = revfd[d] & 31;\n                    eb += fleb[lin] + fdeb[din];\n                    ++lf[257 + lin];\n                    ++df[din];\n                    wi = i + l;\n                    ++lc_1;\n                }\n                else {\n                    syms[li++] = dat[i];\n                    ++lf[dat[i]];\n                }\n            }\n        }\n        for (i = Math.max(i, wi); i < s; ++i) {\n            syms[li++] = dat[i];\n            ++lf[dat[i]];\n        }\n        pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);\n        if (!lst) {\n            st.r = (pos & 7) | w[(pos / 8) | 0] << 3;\n            // shft(pos) now 1 less if pos & 7 != 0\n            pos -= 7;\n            st.h = head, st.p = prev, st.i = i, st.w = wi;\n        }\n    }\n    else {\n        for (var i = st.w || 0; i < s + lst; i += 65535) {\n            // end\n            var e = i + 65535;\n            if (e >= s) {\n                // write final block\n                w[(pos / 8) | 0] = lst;\n                e = s;\n            }\n            pos = wfblk(w, pos + 1, dat.subarray(i, e));\n        }\n        st.i = s;\n    }\n    return slc(o, 0, pre + shft(pos) + post);\n};\n// CRC32 table\nvar crct = /*#__PURE__*/ (function () {\n    var t = new Int32Array(256);\n    for (var i = 0; i < 256; ++i) {\n        var c = i, k = 9;\n        while (--k)\n            c = ((c & 1) && -306674912) ^ (c >>> 1);\n        t[i] = c;\n    }\n    return t;\n})();\n// CRC32\nvar crc = function () {\n    var c = -1;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var cr = c;\n            for (var i = 0; i < d.length; ++i)\n                cr = crct[(cr & 255) ^ d[i]] ^ (cr >>> 8);\n            c = cr;\n        },\n        d: function () { return ~c; }\n    };\n};\n// Adler32\nvar adler = function () {\n    var a = 1, b = 0;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var n = a, m = b;\n            var l = d.length | 0;\n            for (var i = 0; i != l;) {\n                var e = Math.min(i + 2655, l);\n                for (; i < e; ++i)\n                    m += n += d[i];\n                n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);\n            }\n            a = n, b = m;\n        },\n        d: function () {\n            a %= 65521, b %= 65521;\n            return (a & 255) << 24 | (a & 0xFF00) << 8 | (b & 255) << 8 | (b >> 8);\n        }\n    };\n};\n;\n// deflate with opts\nvar dopt = function (dat, opt, pre, post, st) {\n    if (!st) {\n        st = { l: 1 };\n        if (opt.dictionary) {\n            var dict = opt.dictionary.subarray(-32768);\n            var newDat = new u8(dict.length + dat.length);\n            newDat.set(dict);\n            newDat.set(dat, dict.length);\n            dat = newDat;\n            st.w = dict.length;\n        }\n    }\n    return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? (st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20) : (12 + opt.mem), pre, post, st);\n};\n// Walmart object spread\nvar mrg = function (a, b) {\n    var o = {};\n    for (var k in a)\n        o[k] = a[k];\n    for (var k in b)\n        o[k] = b[k];\n    return o;\n};\n// worker clone\n// This is possibly the craziest part of the entire codebase, despite how simple it may seem.\n// The only parameter to this function is a closure that returns an array of variables outside of the function scope.\n// We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.\n// We will return an object mapping of true variable name to value (basically, the current scope as a JS object).\n// The reason we can't just use the original variable names is minifiers mangling the toplevel scope.\n// This took me three weeks to figure out how to do.\nvar wcln = function (fn, fnStr, td) {\n    var dt = fn();\n    var st = fn.toString();\n    var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/\\s+/g, '').split(',');\n    for (var i = 0; i < dt.length; ++i) {\n        var v = dt[i], k = ks[i];\n        if (typeof v == 'function') {\n            fnStr += ';' + k + '=';\n            var st_1 = v.toString();\n            if (v.prototype) {\n                // for global objects\n                if (st_1.indexOf('[native code]') != -1) {\n                    var spInd = st_1.indexOf(' ', 8) + 1;\n                    fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));\n                }\n                else {\n                    fnStr += st_1;\n                    for (var t in v.prototype)\n                        fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();\n                }\n            }\n            else\n                fnStr += st_1;\n        }\n        else\n            td[k] = v;\n    }\n    return fnStr;\n};\nvar ch = [];\n// clone bufs\nvar cbfs = function (v) {\n    var tl = [];\n    for (var k in v) {\n        if (v[k].buffer) {\n            tl.push((v[k] = new v[k].constructor(v[k])).buffer);\n        }\n    }\n    return tl;\n};\n// use a worker to execute code\nvar wrkr = function (fns, init, id, cb) {\n    if (!ch[id]) {\n        var fnStr = '', td_1 = {}, m = fns.length - 1;\n        for (var i = 0; i < m; ++i)\n            fnStr = wcln(fns[i], fnStr, td_1);\n        ch[id] = { c: wcln(fns[m], fnStr, td_1), e: td_1 };\n    }\n    var td = mrg({}, ch[id].e);\n    return wk(ch[id].c + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);\n};\n// base async inflate fn\nvar bInflt = function () { return [u8, u16, i32, fleb, fdeb, clim, fl, fd, flrm, fdrm, rev, ec, hMap, max, bits, bits16, shft, slc, err, inflt, inflateSync, pbf, gopt]; };\nvar bDflt = function () { return [u8, u16, i32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf]; };\n// gzip extra\nvar gze = function () { return [gzh, gzhl, wbytes, crc, crct]; };\n// gunzip extra\nvar guze = function () { return [gzs, gzl]; };\n// zlib extra\nvar zle = function () { return [zlh, wbytes, adler]; };\n// unzlib extra\nvar zule = function () { return [zls]; };\n// post buf\nvar pbf = function (msg) { return postMessage(msg, [msg.buffer]); };\n// get opts\nvar gopt = function (o) { return o && {\n    out: o.size && new u8(o.size),\n    dictionary: o.dictionary\n}; };\n// async helper\nvar cbify = function (dat, opts, fns, init, id, cb) {\n    var w = wrkr(fns, init, id, function (err, dat) {\n        w.terminate();\n        cb(err, dat);\n    });\n    w.postMessage([dat, opts], opts.consume ? [dat.buffer] : []);\n    return function () { w.terminate(); };\n};\n// auto stream\nvar astrm = function (strm) {\n    strm.ondata = function (dat, final) { return postMessage([dat, final], [dat.buffer]); };\n    return function (ev) {\n        if (ev.data[0]) {\n            strm.push(ev.data[0], ev.data[1]);\n            postMessage([ev.data[0].length]);\n        }\n        else\n            strm.flush(ev.data[1]);\n    };\n};\n// async stream attach\nvar astrmify = function (fns, strm, opts, init, id, flush, ext) {\n    var t;\n    var w = wrkr(fns, init, id, function (err, dat) {\n        if (err)\n            w.terminate(), strm.ondata.call(strm, err);\n        else if (!Array.isArray(dat))\n            ext(dat);\n        else if (dat.length == 1) {\n            strm.queuedSize -= dat[0];\n            if (strm.ondrain)\n                strm.ondrain(dat[0]);\n        }\n        else {\n            if (dat[1])\n                w.terminate();\n            strm.ondata.call(strm, err, dat[0], dat[1]);\n        }\n    });\n    w.postMessage(opts);\n    strm.queuedSize = 0;\n    strm.push = function (d, f) {\n        if (!strm.ondata)\n            err(5);\n        if (t)\n            strm.ondata(err(4, 0, 1), null, !!f);\n        strm.queuedSize += d.length;\n        // can fail for cross-realm Uint8Array, but ok - only a small performance penalty\n        w.postMessage([d, t = f], d.buffer instanceof ArrayBuffer ? [d.buffer] : []);\n    };\n    strm.terminate = function () { w.terminate(); };\n    if (flush) {\n        strm.flush = function (sync) { w.postMessage([0, sync]); };\n    }\n};\n// read 2 bytes\nvar b2 = function (d, b) { return d[b] | (d[b + 1] << 8); };\n// read 4 bytes\nvar b4 = function (d, b) { return (d[b] | (d[b + 1] << 8) | (d[b + 2] << 16) | (d[b + 3] << 24)) >>> 0; };\n// read 8 bytes\nvar b8 = function (d, b) { return b4(d, b) + (b4(d, b + 4) * 4294967296); };\n// write bytes\nvar wbytes = function (d, b, v) {\n    for (; v; ++b)\n        d[b] = v, v >>>= 8;\n};\n// gzip header\nvar gzh = function (c, o) {\n    var fn = o.filename;\n    c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix\n    if (o.mtime != 0)\n        wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));\n    if (fn) {\n        c[3] = 8;\n        for (var i = 0; i <= fn.length; ++i)\n            c[i + 10] = fn.charCodeAt(i);\n    }\n};\n// gzip footer: -8 to -4 = CRC, -4 to -0 is length\n// gzip start\nvar gzs = function (d) {\n    if (d[0] != 31 || d[1] != 139 || d[2] != 8)\n        err(6, 'invalid gzip data');\n    var flg = d[3];\n    var st = 10;\n    if (flg & 4)\n        st += (d[10] | d[11] << 8) + 2;\n    for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++])\n        ;\n    return st + (flg & 2);\n};\n// gzip length\nvar gzl = function (d) {\n    var l = d.length;\n    return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;\n};\n// gzip header length\nvar gzhl = function (o) { return 10 + (o.filename ? o.filename.length + 1 : 0); };\n// zlib header\nvar zlh = function (c, o) {\n    var lv = o.level, fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;\n    c[0] = 120, c[1] = (fl << 6) | (o.dictionary && 32);\n    c[1] |= 31 - ((c[0] << 8) | c[1]) % 31;\n    if (o.dictionary) {\n        var h = adler();\n        h.p(o.dictionary);\n        wbytes(c, 2, h.d());\n    }\n};\n// zlib start\nvar zls = function (d, dict) {\n    if ((d[0] & 15) != 8 || (d[0] >> 4) > 7 || ((d[0] << 8 | d[1]) % 31))\n        err(6, 'invalid zlib data');\n    if ((d[1] >> 5 & 1) == +!dict)\n        err(6, 'invalid zlib data: ' + (d[1] & 32 ? 'need' : 'unexpected') + ' dictionary');\n    return (d[1] >> 3 & 4) + 2;\n};\nfunction StrmOpt(opts, cb) {\n    if (typeof opts == 'function')\n        cb = opts, opts = {};\n    this.ondata = cb;\n    return opts;\n}\n/**\n * Streaming DEFLATE compression\n */\nvar Deflate = /*#__PURE__*/ (function () {\n    function Deflate(opts, cb) {\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        this.o = opts || {};\n        this.s = { l: 0, i: 32768, w: 32768, z: 32768 };\n        // Buffer length must always be 0 mod 32768 for index calculations to be correct when modifying head and prev\n        // 98304 = 32768 (lookback) + 65536 (common chunk size)\n        this.b = new u8(98304);\n        if (this.o.dictionary) {\n            var dict = this.o.dictionary.subarray(-32768);\n            this.b.set(dict, 32768 - dict.length);\n            this.s.i = 32768 - dict.length;\n        }\n    }\n    Deflate.prototype.p = function (c, f) {\n        this.ondata(dopt(c, this.o, 0, 0, this.s), f);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Deflate.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        var endLen = chunk.length + this.s.z;\n        if (endLen > this.b.length) {\n            if (endLen > 2 * this.b.length - 32768) {\n                var newBuf = new u8(endLen & -32768);\n                newBuf.set(this.b.subarray(0, this.s.z));\n                this.b = newBuf;\n            }\n            var split = this.b.length - this.s.z;\n            this.b.set(chunk.subarray(0, split), this.s.z);\n            this.s.z = this.b.length;\n            this.p(this.b, false);\n            this.b.set(this.b.subarray(-32768));\n            this.b.set(chunk.subarray(split), 32768);\n            this.s.z = chunk.length - split + 32768;\n            this.s.i = 32766, this.s.w = 32768;\n        }\n        else {\n            this.b.set(chunk, this.s.z);\n            this.s.z += chunk.length;\n        }\n        this.s.l = final & 1;\n        if (this.s.z > this.s.w + 8191 || final) {\n            this.p(this.b, final || false);\n            this.s.w = this.s.i, this.s.i -= 2;\n        }\n        if (final) {\n            // cleanup unneeded buffers/state to reduce memory usage\n            this.s = this.o = {};\n            this.b = et;\n        }\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * deflated output for small inputs.\n     * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n     *             extra bytes, but guarantees all pushed data is immediately\n     *             decompressible. A separate DEFLATE stream may be concatenated\n     *             with the current output after a sync flush.\n     */\n    Deflate.prototype.flush = function (sync) {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        this.p(this.b, false);\n        this.s.w = this.s.i, this.s.i -= 2;\n        // could technically skip writing the type-0 block for (this.s.r & 7) == 0,\n        // but the deterministic trailer (00 00 FF FF) is useful in some situations\n        if (sync) {\n            var c = new u8(6);\n            c[0] = this.s.r >> 3;\n            // write empty, non-final type-0 block\n            var ep = wfblk(c, this.s.r, et);\n            this.s.r = 0;\n            this.ondata(c.subarray(0, ep >> 3), false);\n        }\n    };\n    return Deflate;\n}());\nexport { Deflate };\n/**\n * Asynchronous streaming DEFLATE compression\n */\nvar AsyncDeflate = /*#__PURE__*/ (function () {\n    function AsyncDeflate(opts, cb) {\n        astrmify([\n            bDflt,\n            function () { return [astrm, Deflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Deflate(ev.data);\n            onmessage = astrm(strm);\n        }, 6, 1);\n    }\n    return AsyncDeflate;\n}());\nexport { AsyncDeflate };\nexport function deflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n    ], function (ev) { return pbf(deflateSync(ev.data[0], ev.data[1])); }, 0, cb);\n}\n/**\n * Compresses data with DEFLATE without any wrapper\n * @param data The data to compress\n * @param opts The compression options\n * @returns The deflated version of the data\n */\nexport function deflateSync(data, opts) {\n    return dopt(data, opts || {}, 0, 0);\n}\n/**\n * Streaming DEFLATE decompression\n */\nvar Inflate = /*#__PURE__*/ (function () {\n    function Inflate(opts, cb) {\n        // no StrmOpt here to avoid adding to workerizer\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        var dict = opts && opts.dictionary && opts.dictionary.subarray(-32768);\n        this.s = { i: 0, b: dict ? dict.length : 0 };\n        this.o = new u8(32768);\n        this.p = new u8(0);\n        if (dict)\n            this.o.set(dict);\n    }\n    Inflate.prototype.e = function (c) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        if (!this.p.length)\n            this.p = c;\n        else if (c.length) {\n            var n = new u8(this.p.length + c.length);\n            n.set(this.p), n.set(c, this.p.length), this.p = n;\n        }\n    };\n    Inflate.prototype.c = function (final) {\n        this.s.i = +(this.d = final || false);\n        var bts = this.s.b;\n        var dt = inflt(this.p, this.s, this.o);\n        this.ondata(slc(dt, bts, this.s.b), this.d);\n        this.o = slc(dt, this.s.b - 32768), this.s.b = this.o.length;\n        this.p = slc(this.p, (this.s.p / 8) | 0), this.s.p &= 7;\n    };\n    /**\n     * Pushes a chunk to be inflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the final chunk\n     */\n    Inflate.prototype.push = function (chunk, final) {\n        this.e(chunk), this.c(final);\n    };\n    return Inflate;\n}());\nexport { Inflate };\n/**\n * Asynchronous streaming DEFLATE decompression\n */\nvar AsyncInflate = /*#__PURE__*/ (function () {\n    function AsyncInflate(opts, cb) {\n        astrmify([\n            bInflt,\n            function () { return [astrm, Inflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Inflate(ev.data);\n            onmessage = astrm(strm);\n        }, 7, 0);\n    }\n    return AsyncInflate;\n}());\nexport { AsyncInflate };\nexport function inflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt\n    ], function (ev) { return pbf(inflateSync(ev.data[0], gopt(ev.data[1]))); }, 1, cb);\n}\nexport function inflateSync(data, opts) {\n    return inflt(data, { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// before you yell at me for not just using extends, my reason is that TS inheritance is hard to workerize.\n/**\n * Streaming GZIP compression\n */\nvar Gzip = /*#__PURE__*/ (function () {\n    function Gzip(opts, cb) {\n        this.c = crc();\n        this.l = 0;\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gzip.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        this.l += chunk.length;\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Gzip.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && gzhl(this.o), f && 8, this.s);\n        if (this.v)\n            gzh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 8, this.c.d()), wbytes(raw, raw.length - 4, this.l);\n        this.ondata(raw, f);\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * GZIPped output for small inputs.\n     * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n     *             extra bytes, but guarantees all pushed data is immediately\n     *             decompressible.\n     */\n    Gzip.prototype.flush = function (sync) {\n        Deflate.prototype.flush.call(this, sync);\n    };\n    return Gzip;\n}());\nexport { Gzip };\n/**\n * Asynchronous streaming GZIP compression\n */\nvar AsyncGzip = /*#__PURE__*/ (function () {\n    function AsyncGzip(opts, cb) {\n        astrmify([\n            bDflt,\n            gze,\n            function () { return [astrm, Deflate, Gzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gzip(ev.data);\n            onmessage = astrm(strm);\n        }, 8, 1);\n    }\n    return AsyncGzip;\n}());\nexport { AsyncGzip };\nexport function gzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        gze,\n        function () { return [gzipSync]; }\n    ], function (ev) { return pbf(gzipSync(ev.data[0], ev.data[1])); }, 2, cb);\n}\n/**\n * Compresses data with GZIP\n * @param data The data to compress\n * @param opts The compression options\n * @returns The gzipped version of the data\n */\nexport function gzipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var c = crc(), l = data.length;\n    c.p(data);\n    var d = dopt(data, opts, gzhl(opts), 8), s = d.length;\n    return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;\n}\n/**\n * Streaming single or multi-member GZIP decompression\n */\nvar Gunzip = /*#__PURE__*/ (function () {\n    function Gunzip(opts, cb) {\n        this.v = 1;\n        this.r = 0;\n        Inflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GUNZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gunzip.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        this.r += chunk.length;\n        if (this.v) {\n            var p = this.p.subarray(this.v - 1);\n            var s = p.length > 3 ? gzs(p) : 4;\n            if (s > p.length) {\n                if (!final)\n                    return;\n            }\n            else if (this.v > 1 && this.onmember) {\n                this.onmember(this.r - p.length);\n            }\n            this.p = p.subarray(s), this.v = 0;\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, 0);\n        // process concatenated GZIP\n        if (this.s.f && !this.s.l) {\n            this.v = shft(this.s.p) + 9;\n            this.s = { i: 0 };\n            this.o = new u8(0);\n            this.push(new u8(0), final);\n        }\n        else if (final) {\n            Inflate.prototype.c.call(this, final);\n        }\n    };\n    return Gunzip;\n}());\nexport { Gunzip };\n/**\n * Asynchronous streaming single or multi-member GZIP decompression\n */\nvar AsyncGunzip = /*#__PURE__*/ (function () {\n    function AsyncGunzip(opts, cb) {\n        var _this = this;\n        astrmify([\n            bInflt,\n            guze,\n            function () { return [astrm, Inflate, Gunzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gunzip(ev.data);\n            strm.onmember = function (offset) { return postMessage(offset); };\n            onmessage = astrm(strm);\n        }, 9, 0, function (offset) { return _this.onmember && _this.onmember(offset); });\n    }\n    return AsyncGunzip;\n}());\nexport { AsyncGunzip };\nexport function gunzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        guze,\n        function () { return [gunzipSync]; }\n    ], function (ev) { return pbf(gunzipSync(ev.data[0], ev.data[1])); }, 3, cb);\n}\nexport function gunzipSync(data, opts) {\n    var st = gzs(data);\n    if (st + 8 > data.length)\n        err(6, 'invalid gzip data');\n    return inflt(data.subarray(st, -8), { i: 2 }, opts && opts.out || new u8(gzl(data)), opts && opts.dictionary);\n}\n/**\n * Streaming Zlib compression\n */\nvar Zlib = /*#__PURE__*/ (function () {\n    function Zlib(opts, cb) {\n        this.c = adler();\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be zlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Zlib.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Zlib.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && (this.o.dictionary ? 6 : 2), f && 4, this.s);\n        if (this.v)\n            zlh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 4, this.c.d());\n        this.ondata(raw, f);\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * zlibbed output for small inputs.\n     * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n     *             extra bytes, but guarantees all pushed data is immediately\n     *             decompressible.\n     */\n    Zlib.prototype.flush = function (sync) {\n        Deflate.prototype.flush.call(this, sync);\n    };\n    return Zlib;\n}());\nexport { Zlib };\n/**\n * Asynchronous streaming Zlib compression\n */\nvar AsyncZlib = /*#__PURE__*/ (function () {\n    function AsyncZlib(opts, cb) {\n        astrmify([\n            bDflt,\n            zle,\n            function () { return [astrm, Deflate, Zlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Zlib(ev.data);\n            onmessage = astrm(strm);\n        }, 10, 1);\n    }\n    return AsyncZlib;\n}());\nexport { AsyncZlib };\nexport function zlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        zle,\n        function () { return [zlibSync]; }\n    ], function (ev) { return pbf(zlibSync(ev.data[0], ev.data[1])); }, 4, cb);\n}\n/**\n * Compress data with Zlib\n * @param data The data to compress\n * @param opts The compression options\n * @returns The zlib-compressed version of the data\n */\nexport function zlibSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var a = adler();\n    a.p(data);\n    var d = dopt(data, opts, opts.dictionary ? 6 : 2, 4);\n    return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;\n}\n/**\n * Streaming Zlib decompression\n */\nvar Unzlib = /*#__PURE__*/ (function () {\n    function Unzlib(opts, cb) {\n        Inflate.call(this, opts, cb);\n        this.v = opts && opts.dictionary ? 2 : 1;\n    }\n    /**\n     * Pushes a chunk to be unzlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzlib.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        if (this.v) {\n            if (this.p.length < 6 && !final)\n                return;\n            this.p = this.p.subarray(zls(this.p, this.v - 1)), this.v = 0;\n        }\n        if (final) {\n            if (this.p.length < 4)\n                err(6, 'invalid zlib data');\n            this.p = this.p.subarray(0, -4);\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n    };\n    return Unzlib;\n}());\nexport { Unzlib };\n/**\n * Asynchronous streaming Zlib decompression\n */\nvar AsyncUnzlib = /*#__PURE__*/ (function () {\n    function AsyncUnzlib(opts, cb) {\n        astrmify([\n            bInflt,\n            zule,\n            function () { return [astrm, Inflate, Unzlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Unzlib(ev.data);\n            onmessage = astrm(strm);\n        }, 11, 0);\n    }\n    return AsyncUnzlib;\n}());\nexport { AsyncUnzlib };\nexport function unzlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        zule,\n        function () { return [unzlibSync]; }\n    ], function (ev) { return pbf(unzlibSync(ev.data[0], gopt(ev.data[1]))); }, 5, cb);\n}\nexport function unzlibSync(data, opts) {\n    return inflt(data.subarray(zls(data, opts && opts.dictionary), -4), { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// Default algorithm for compression (used because having a known output size allows faster decompression)\nexport { gzip as compress, AsyncGzip as AsyncCompress };\nexport { gzipSync as compressSync, Gzip as Compress };\n/**\n * Streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar Decompress = /*#__PURE__*/ (function () {\n    function Decompress(opts, cb) {\n        this.o = StrmOpt.call(this, opts, cb) || {};\n        this.G = Gunzip;\n        this.I = Inflate;\n        this.Z = Unzlib;\n    }\n    // init substream\n    // overriden by AsyncDecompress\n    Decompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (dat, final) {\n            _this.ondata(dat, final);\n        };\n    };\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Decompress.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (!this.s) {\n            if (this.p && this.p.length) {\n                var n = new u8(this.p.length + chunk.length);\n                n.set(this.p), n.set(chunk, this.p.length);\n            }\n            else\n                this.p = chunk;\n            if (this.p.length > 2) {\n                this.s = (this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8)\n                    ? new this.G(this.o)\n                    : ((this.p[0] & 15) != 8 || (this.p[0] >> 4) > 7 || ((this.p[0] << 8 | this.p[1]) % 31))\n                        ? new this.I(this.o)\n                        : new this.Z(this.o);\n                this.i();\n                this.s.push(this.p, final);\n                this.p = null;\n            }\n        }\n        else\n            this.s.push(chunk, final);\n    };\n    return Decompress;\n}());\nexport { Decompress };\n/**\n * Asynchronous streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar AsyncDecompress = /*#__PURE__*/ (function () {\n    function AsyncDecompress(opts, cb) {\n        Decompress.call(this, opts, cb);\n        this.queuedSize = 0;\n        this.G = AsyncGunzip;\n        this.I = AsyncInflate;\n        this.Z = AsyncUnzlib;\n    }\n    AsyncDecompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        };\n        this.s.ondrain = function (size) {\n            _this.queuedSize -= size;\n            if (_this.ondrain)\n                _this.ondrain(size);\n        };\n    };\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncDecompress.prototype.push = function (chunk, final) {\n        this.queuedSize += chunk.length;\n        Decompress.prototype.push.call(this, chunk, final);\n    };\n    return AsyncDecompress;\n}());\nexport { AsyncDecompress };\nexport function decompress(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzip(data, opts, cb)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflate(data, opts, cb)\n            : unzlib(data, opts, cb);\n}\n/**\n * Expands compressed GZIP, Zlib, or raw DEFLATE data, automatically detecting the format\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function decompressSync(data, opts) {\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzipSync(data, opts)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflateSync(data, opts)\n            : unzlibSync(data, opts);\n}\n// flatten a directory structure\nvar fltn = function (d, p, t, o) {\n    for (var k in d) {\n        var val = d[k], n = p + k, op = o;\n        if (Array.isArray(val))\n            op = mrg(o, val[1]), val = val[0];\n        if (ArrayBuffer.isView(val))\n            t[n] = [val, op];\n        else {\n            t[n += '/'] = [new u8(0), op];\n            fltn(val, n, t, o);\n        }\n    }\n};\n// text encoder\nvar te = typeof TextEncoder != 'undefined' && /*#__PURE__*/ new TextEncoder();\n// text decoder\nvar td = typeof TextDecoder != 'undefined' && /*#__PURE__*/ new TextDecoder();\n// text decoder stream\nvar tds = 0;\ntry {\n    td.decode(et, { stream: true });\n    tds = 1;\n}\ncatch (e) { }\n// decode UTF8\nvar dutf8 = function (d) {\n    for (var r = '', i = 0;;) {\n        var c = d[i++];\n        var eb = (c > 127) + (c > 223) + (c > 239);\n        if (i + eb > d.length)\n            return { s: r, r: slc(d, i - 1) };\n        if (!eb)\n            r += String.fromCharCode(c);\n        else if (eb == 3) {\n            c = ((c & 15) << 18 | (d[i++] & 63) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63)) - 65536,\n                r += String.fromCharCode(55296 | (c >> 10), 56320 | (c & 1023));\n        }\n        else if (eb & 1)\n            r += String.fromCharCode((c & 31) << 6 | (d[i++] & 63));\n        else\n            r += String.fromCharCode((c & 15) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63));\n    }\n};\n/**\n * Streaming UTF-8 decoding\n */\nvar DecodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is decoded\n     */\n    function DecodeUTF8(cb) {\n        this.ondata = cb;\n        if (tds)\n            this.t = new TextDecoder();\n        else\n            this.p = et;\n    }\n    /**\n     * Pushes a chunk to be decoded from UTF-8 binary\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    DecodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        final = !!final;\n        if (this.t) {\n            this.ondata(this.t.decode(chunk, { stream: true }), final);\n            if (final) {\n                if (this.t.decode().length)\n                    err(8);\n                this.t = null;\n            }\n            return;\n        }\n        if (!this.p)\n            err(4);\n        var dat = new u8(this.p.length + chunk.length);\n        dat.set(this.p);\n        dat.set(chunk, this.p.length);\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (final) {\n            if (r.length)\n                err(8);\n            this.p = null;\n        }\n        else\n            this.p = r;\n        this.ondata(s, final);\n    };\n    return DecodeUTF8;\n}());\nexport { DecodeUTF8 };\n/**\n * Streaming UTF-8 encoding\n */\nvar EncodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is encoded\n     */\n    function EncodeUTF8(cb) {\n        this.ondata = cb;\n    }\n    /**\n     * Pushes a chunk to be encoded to UTF-8\n     * @param chunk The string data to push\n     * @param final Whether this is the last chunk\n     */\n    EncodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        this.ondata(strToU8(chunk), this.d = final || false);\n    };\n    return EncodeUTF8;\n}());\nexport { EncodeUTF8 };\n/**\n * Converts a string into a Uint8Array for use with compression/decompression methods\n * @param str The string to encode\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless decoding a binary string.\n * @returns The string encoded in UTF-8/Latin-1 binary\n */\nexport function strToU8(str, latin1) {\n    if (latin1) {\n        var ar_1 = new u8(str.length);\n        for (var i = 0; i < str.length; ++i)\n            ar_1[i] = str.charCodeAt(i);\n        return ar_1;\n    }\n    if (te)\n        return te.encode(str);\n    var l = str.length;\n    var ar = new u8(str.length + (str.length >> 1));\n    var ai = 0;\n    var w = function (v) { ar[ai++] = v; };\n    for (var i = 0; i < l; ++i) {\n        if (ai + 5 > ar.length) {\n            var n = new u8(ai + 8 + ((l - i) << 1));\n            n.set(ar);\n            ar = n;\n        }\n        var c = str.charCodeAt(i);\n        if (c < 128 || latin1)\n            w(c);\n        else if (c < 2048)\n            w(192 | (c >> 6)), w(128 | (c & 63));\n        else if (c > 55295 && c < 57344)\n            c = 65536 + (c & 1023 << 10) | (str.charCodeAt(++i) & 1023),\n                w(240 | (c >> 18)), w(128 | ((c >> 12) & 63)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n        else\n            w(224 | (c >> 12)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n    }\n    return slc(ar, 0, ai);\n}\n/**\n * Converts a Uint8Array to a string\n * @param dat The data to decode to string\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless encoding to binary string.\n * @returns The original UTF-8/Latin-1 string\n */\nexport function strFromU8(dat, latin1) {\n    if (latin1) {\n        var r = '';\n        for (var i = 0; i < dat.length; i += 16384)\n            r += String.fromCharCode.apply(null, dat.subarray(i, i + 16384));\n        return r;\n    }\n    else if (td) {\n        return td.decode(dat);\n    }\n    else {\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (r.length)\n            err(8);\n        return s;\n    }\n}\n;\n// deflate bit flag\nvar dbf = function (l) { return l == 1 ? 3 : l < 6 ? 2 : l == 9 ? 1 : 0; };\n// skip local zip header\nvar slzh = function (d, b) { return b + 30 + b2(d, b + 26) + b2(d, b + 28); };\n// read zip header\nvar zh = function (d, b, z) {\n    var fnl = b2(d, b + 28), efl = b2(d, b + 30), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl;\n    var _a = z64hs(d, es, efl, z, b4(d, b + 20), b4(d, b + 24), b4(d, b + 42)), sc = _a[0], su = _a[1], off = _a[2];\n    return [b2(d, b + 10), sc, su, fn, es + efl + b2(d, b + 32), off];\n};\n// read zip64 header sizes\nvar z64hs = function (d, b, l, z, sc, su, off) {\n    var nsc = sc == 4294967295, nsu = su == 4294967295, noff = off == 4294967295, e = b + l;\n    var nf = nsc + nsu + noff;\n    if (z && nf) {\n        for (; b + 4 < e; b += 4 + b2(d, b + 2)) {\n            if (b2(d, b) == 1) {\n                return [\n                    nsc ? b8(d, b + 4 + 8 * nsu) : sc,\n                    nsu ? b8(d, b + 4) : su,\n                    noff ? b8(d, b + 4 + 8 * (nsu + nsc)) : off,\n                    1\n                ];\n            }\n        }\n        // z == 2 for unknown whether or not zip64\n        if (z < 2)\n            err(13);\n    }\n    return [sc, su, off, 0];\n};\n// extra field length\nvar exfl = function (ex) {\n    var le = 0;\n    if (ex) {\n        for (var k in ex) {\n            var l = ex[k].length;\n            if (l > 65535)\n                err(9);\n            le += l + 4;\n        }\n    }\n    return le;\n};\n// write zip header\nvar wzh = function (d, b, f, fn, u, c, ce, co) {\n    var fl = fn.length, ex = f.extra, col = co && co.length;\n    var exl = exfl(ex);\n    wbytes(d, b, ce != null ? 0x2014B50 : 0x4034B50), b += 4;\n    if (ce != null)\n        d[b++] = 20, d[b++] = f.os;\n    d[b] = 20, b += 2; // spec compliance? what's that?\n    d[b++] = (f.flag << 1) | (c < 0 && 8), d[b++] = u && 8;\n    d[b++] = f.compression & 255, d[b++] = f.compression >> 8;\n    var dt = new Date(f.mtime == null ? Date.now() : f.mtime), y = dt.getFullYear() - 1980;\n    if (y < 0 || y > 119)\n        err(10);\n    wbytes(d, b, (y << 25) | ((dt.getMonth() + 1) << 21) | (dt.getDate() << 16) | (dt.getHours() << 11) | (dt.getMinutes() << 5) | (dt.getSeconds() >> 1)), b += 4;\n    if (c != -1) {\n        wbytes(d, b, f.crc);\n        wbytes(d, b + 4, c < 0 ? -c - 2 : c);\n        wbytes(d, b + 8, f.size);\n    }\n    wbytes(d, b + 12, fl);\n    wbytes(d, b + 14, exl), b += 16;\n    if (ce != null) {\n        wbytes(d, b, col);\n        wbytes(d, b + 6, f.attrs);\n        wbytes(d, b + 10, ce), b += 14;\n    }\n    d.set(fn, b);\n    b += fl;\n    if (exl) {\n        for (var k in ex) {\n            var exf = ex[k], l = exf.length;\n            wbytes(d, b, +k);\n            wbytes(d, b + 2, l);\n            d.set(exf, b + 4), b += 4 + l;\n        }\n    }\n    if (col)\n        d.set(co, b), b += col;\n    return b;\n};\n// write zip footer (end of central directory)\nvar wzf = function (o, b, c, d, e) {\n    wbytes(o, b, 0x6054B50); // skip disk\n    wbytes(o, b + 8, c);\n    wbytes(o, b + 10, c);\n    wbytes(o, b + 12, d);\n    wbytes(o, b + 16, e);\n};\n/**\n * A pass-through stream to keep data uncompressed in a ZIP archive.\n */\nvar ZipPassThrough = /*#__PURE__*/ (function () {\n    /**\n     * Creates a pass-through stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     */\n    function ZipPassThrough(filename) {\n        this.filename = filename;\n        this.c = crc();\n        this.size = 0;\n        this.compression = 0;\n    }\n    /**\n     * Processes a chunk and pushes to the output stream. You can override this\n     * method in a subclass for custom behavior, but by default this passes\n     * the data through. You must call this.ondata(err, chunk, final) at some\n     * point in this method.\n     * @param chunk The chunk to process\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.process = function (chunk, final) {\n        this.ondata(null, chunk, final);\n    };\n    /**\n     * Pushes a chunk to be added. If you are subclassing this with a custom\n     * compression algorithm, note that you must push data from the source\n     * file only, pre-compression.\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        this.c.p(chunk);\n        this.size += chunk.length;\n        if (final)\n            this.crc = this.c.d();\n        // we shouldn't really do this cast, but properly handling ArrayBufferLike\n        // makes the API unergonomic with Buffer\n        this.process(chunk, final || false);\n    };\n    return ZipPassThrough;\n}());\nexport { ZipPassThrough };\n// I don't extend because TypeScript extension adds 1kB of runtime bloat\n/**\n * Streaming DEFLATE compression for ZIP archives. Prefer using AsyncZipDeflate\n * for better performance\n */\nvar ZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function ZipDeflate(filename, opts) {\n        var _this = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new Deflate(opts, function (dat, final) {\n            _this.ondata(null, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n    }\n    ZipDeflate.prototype.process = function (chunk, final) {\n        try {\n            this.d.push(chunk, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return ZipDeflate;\n}());\nexport { ZipDeflate };\n/**\n * Asynchronous streaming DEFLATE compression for ZIP archives\n */\nvar AsyncZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates an asynchronous DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function AsyncZipDeflate(filename, opts) {\n        var _this = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new AsyncDeflate(opts, function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n        this.terminate = this.d.terminate;\n    }\n    AsyncZipDeflate.prototype.process = function (chunk, final) {\n        this.d.push(chunk, final);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return AsyncZipDeflate;\n}());\nexport { AsyncZipDeflate };\n// TODO: Better tree shaking\n/**\n * A zippable archive to which files can incrementally be added\n */\nvar Zip = /*#__PURE__*/ (function () {\n    /**\n     * Creates an empty ZIP archive to which files can be added\n     * @param cb The callback to call whenever data for the generated ZIP archive\n     *           is available\n     */\n    function Zip(cb) {\n        this.ondata = cb;\n        this.u = [];\n        this.d = 1;\n    }\n    /**\n     * Adds a file to the ZIP archive\n     * @param file The file stream to add\n     */\n    Zip.prototype.add = function (file) {\n        var _this = this;\n        if (!this.ondata)\n            err(5);\n        // finishing or finished\n        if (this.d & 2)\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, false);\n        else {\n            var f = strToU8(file.filename), fl_1 = f.length;\n            var com = file.comment, o = com && strToU8(com);\n            var u = fl_1 != file.filename.length || (o && (com.length != o.length));\n            var hl_1 = fl_1 + exfl(file.extra) + 30;\n            if (fl_1 > 65535)\n                this.ondata(err(11, 0, 1), null, false);\n            var header = new u8(hl_1);\n            wzh(header, 0, file, f, u, -1);\n            var chks_1 = [header];\n            var pAll_1 = function () {\n                for (var _i = 0, chks_2 = chks_1; _i < chks_2.length; _i++) {\n                    var chk = chks_2[_i];\n                    _this.ondata(null, chk, false);\n                }\n                chks_1 = [];\n            };\n            var tr_1 = this.d;\n            this.d = 0;\n            var ind_1 = this.u.length;\n            var uf_1 = mrg(file, {\n                f: f,\n                u: u,\n                o: o,\n                t: function () {\n                    if (file.terminate)\n                        file.terminate();\n                },\n                r: function () {\n                    pAll_1();\n                    if (tr_1) {\n                        var nxt = _this.u[ind_1 + 1];\n                        if (nxt)\n                            nxt.r();\n                        else\n                            _this.d = 1;\n                    }\n                    tr_1 = 1;\n                }\n            });\n            var cl_1 = 0;\n            file.ondata = function (err, dat, final) {\n                if (err) {\n                    _this.ondata(err, dat, final);\n                    _this.terminate();\n                }\n                else {\n                    cl_1 += dat.length;\n                    chks_1.push(dat);\n                    if (final) {\n                        var dd = new u8(16);\n                        wbytes(dd, 0, 0x8074B50);\n                        wbytes(dd, 4, file.crc);\n                        wbytes(dd, 8, cl_1);\n                        wbytes(dd, 12, file.size);\n                        chks_1.push(dd);\n                        uf_1.c = cl_1, uf_1.b = hl_1 + cl_1 + 16, uf_1.crc = file.crc, uf_1.size = file.size;\n                        if (tr_1)\n                            uf_1.r();\n                        tr_1 = 1;\n                    }\n                    else if (tr_1)\n                        pAll_1();\n                }\n            };\n            this.u.push(uf_1);\n        }\n    };\n    /**\n     * Ends the process of adding files and prepares to emit the final chunks.\n     * This *must* be called after adding all desired files for the resulting\n     * ZIP file to work properly.\n     */\n    Zip.prototype.end = function () {\n        var _this = this;\n        if (this.d & 2) {\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, true);\n            return;\n        }\n        if (this.d)\n            this.e();\n        else\n            this.u.push({\n                r: function () {\n                    if (!(_this.d & 1))\n                        return;\n                    _this.u.splice(-1, 1);\n                    _this.e();\n                },\n                t: function () { }\n            });\n        this.d = 3;\n    };\n    Zip.prototype.e = function () {\n        var bt = 0, l = 0, tl = 0;\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            tl += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0);\n        }\n        var out = new u8(tl + 22);\n        for (var _b = 0, _c = this.u; _b < _c.length; _b++) {\n            var f = _c[_b];\n            wzh(out, bt, f, f.f, f.u, -f.c - 2, l, f.o);\n            bt += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0), l += f.b;\n        }\n        wzf(out, bt, this.u.length, tl, l);\n        this.ondata(null, out, true);\n        this.d = 2;\n    };\n    /**\n     * A method to terminate any internal workers used by the stream. Subsequent\n     * calls to add() will fail.\n     */\n    Zip.prototype.terminate = function () {\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            f.t();\n        }\n        this.d = 2;\n    };\n    return Zip;\n}());\nexport { Zip };\nexport function zip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var r = {};\n    fltn(data, '', r, opts);\n    var k = Object.keys(r);\n    var lft = k.length, o = 0, tot = 0;\n    var slft = lft, files = new Array(lft);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var cbf = function () {\n        var out = new u8(tot + 22), oe = o, cdl = tot - o;\n        tot = 0;\n        for (var i = 0; i < slft; ++i) {\n            var f = files[i];\n            try {\n                var l = f.c.length;\n                wzh(out, tot, f, f.f, f.u, l);\n                var badd = 30 + f.f.length + exfl(f.extra);\n                var loc = tot + badd;\n                out.set(f.c, loc);\n                wzh(out, o, f, f.f, f.u, l, tot, f.m), o += 16 + badd + (f.m ? f.m.length : 0), tot = loc + l;\n            }\n            catch (e) {\n                return cbd(e, null);\n            }\n        }\n        wzf(out, o, files.length, cdl, oe);\n        cbd(null, out);\n    };\n    if (!lft)\n        cbf();\n    var _loop_1 = function (i) {\n        var fn = k[i];\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var c = crc(), size = file.length;\n        c.p(file);\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        var compression = p.level == 0 ? 0 : 8;\n        var cbl = function (e, d) {\n            if (e) {\n                tAll();\n                cbd(e, null);\n            }\n            else {\n                var l = d.length;\n                files[i] = mrg(p, {\n                    size: size,\n                    crc: c.d(),\n                    c: d,\n                    f: f,\n                    m: m,\n                    u: s != fn.length || (m && (com.length != ms)),\n                    compression: compression\n                });\n                o += 30 + s + exl + l;\n                tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n                if (!--lft)\n                    cbf();\n            }\n        };\n        if (s > 65535)\n            cbl(err(11, 0, 1), null);\n        if (!compression)\n            cbl(null, file);\n        else if (size < 160000) {\n            try {\n                cbl(null, deflateSync(file, p));\n            }\n            catch (e) {\n                cbl(e, null);\n            }\n        }\n        else\n            term.push(deflate(file, p, cbl));\n    };\n    // Cannot use lft because it can decrease\n    for (var i = 0; i < slft; ++i) {\n        _loop_1(i);\n    }\n    return tAll;\n}\n/**\n * Synchronously creates a ZIP file. Prefer using `zip` for better performance\n * with more than one file.\n * @param data The directory structure for the ZIP archive\n * @param opts The main options, merged with per-file options\n * @returns The generated ZIP archive\n */\nexport function zipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var r = {};\n    var files = [];\n    fltn(data, '', r, opts);\n    var o = 0;\n    var tot = 0;\n    for (var fn in r) {\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var compression = p.level == 0 ? 0 : 8;\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        if (s > 65535)\n            err(11);\n        var d = compression ? deflateSync(file, p) : file, l = d.length;\n        var c = crc();\n        c.p(file);\n        files.push(mrg(p, {\n            size: file.length,\n            crc: c.d(),\n            c: d,\n            f: f,\n            m: m,\n            u: s != fn.length || (m && (com.length != ms)),\n            o: o,\n            compression: compression\n        }));\n        o += 30 + s + exl + l;\n        tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n    }\n    var out = new u8(tot + 22), oe = o, cdl = tot - o;\n    for (var i = 0; i < files.length; ++i) {\n        var f = files[i];\n        wzh(out, f.o, f, f.f, f.u, f.c.length);\n        var badd = 30 + f.f.length + exfl(f.extra);\n        out.set(f.c, f.o + badd);\n        wzh(out, o, f, f.f, f.u, f.c.length, f.o, f.m), o += 16 + badd + (f.m ? f.m.length : 0);\n    }\n    wzf(out, o, files.length, cdl, oe);\n    return out;\n}\n/**\n * Streaming pass-through decompression for ZIP archives\n */\nvar UnzipPassThrough = /*#__PURE__*/ (function () {\n    function UnzipPassThrough() {\n    }\n    UnzipPassThrough.prototype.push = function (chunk, final) {\n        // same as ZipPassThrough: cast to retain Buffer ergonomics\n        this.ondata(null, chunk, final);\n    };\n    UnzipPassThrough.compression = 0;\n    return UnzipPassThrough;\n}());\nexport { UnzipPassThrough };\n/**\n * Streaming DEFLATE decompression for ZIP archives. Prefer AsyncZipInflate for\n * better performance.\n */\nvar UnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function UnzipInflate() {\n        var _this = this;\n        this.i = new Inflate(function (dat, final) {\n            _this.ondata(null, dat, final);\n        });\n    }\n    UnzipInflate.prototype.push = function (chunk, final) {\n        try {\n            this.i.push(chunk, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    UnzipInflate.compression = 8;\n    return UnzipInflate;\n}());\nexport { UnzipInflate };\n/**\n * Asynchronous streaming DEFLATE decompression for ZIP archives\n */\nvar AsyncUnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function AsyncUnzipInflate(_, sz) {\n        var _this = this;\n        if (sz < 320000) {\n            this.i = new Inflate(function (dat, final) {\n                _this.ondata(null, dat, final);\n            });\n        }\n        else {\n            this.i = new AsyncInflate(function (err, dat, final) {\n                _this.ondata(err, dat, final);\n            });\n            this.terminate = this.i.terminate;\n        }\n    }\n    AsyncUnzipInflate.prototype.push = function (chunk, final) {\n        if (this.i.terminate)\n            chunk = slc(chunk, 0);\n        this.i.push(chunk, final);\n    };\n    AsyncUnzipInflate.compression = 8;\n    return AsyncUnzipInflate;\n}());\nexport { AsyncUnzipInflate };\n/**\n * A ZIP archive decompression stream that emits files as they are discovered\n */\nvar Unzip = /*#__PURE__*/ (function () {\n    /**\n     * Creates a ZIP decompression stream\n     * @param cb The callback to call whenever a file in the ZIP archive is found\n     */\n    function Unzip(cb) {\n        this.onfile = cb;\n        this.k = [];\n        this.o = {\n            0: UnzipPassThrough\n        };\n        this.p = et;\n    }\n    /**\n     * Pushes a chunk to be unzipped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzip.prototype.push = function (chunk, final) {\n        var _this = this;\n        if (!this.onfile)\n            err(5);\n        if (!this.p)\n            err(4);\n        if (this.c > 0) {\n            var len = Math.min(this.c, chunk.length);\n            var toAdd = chunk.subarray(0, len);\n            this.c -= len;\n            if (this.d)\n                this.d.push(toAdd, !this.c);\n            else\n                this.k[0].push(toAdd);\n            chunk = chunk.subarray(len);\n            if (chunk.length)\n                return this.push(chunk, final);\n        }\n        else {\n            var f = 0, i = 0, is = void 0, buf = void 0;\n            if (!this.p.length)\n                buf = chunk;\n            else if (!chunk.length)\n                buf = this.p;\n            else {\n                buf = new u8(this.p.length + chunk.length);\n                buf.set(this.p), buf.set(chunk, this.p.length);\n            }\n            var l = buf.length, oc = this.c, add = oc && this.d;\n            var _loop_2 = function () {\n                var sig = b4(buf, i);\n                if (sig == 0x4034B50) {\n                    f = 1, is = i;\n                    this_1.d = null;\n                    this_1.c = 0;\n                    var bf = b2(buf, i + 6), cmp_1 = b2(buf, i + 8), u = bf & 2048, dd = bf & 8, fnl = b2(buf, i + 26), es = b2(buf, i + 28);\n                    if (l > i + 30 + fnl + es) {\n                        var chks_3 = [];\n                        this_1.k.unshift(chks_3);\n                        f = 2;\n                        var lsc = b4(buf, i + 18), lsu = b4(buf, i + 22);\n                        var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n                        var _a = z64hs(buf, i, es, 2, lsc, lsu, 0), sc_1 = _a[0], su_1 = _a[1], z64 = _a[3];\n                        if (dd)\n                            sc_1 = -1 - z64;\n                        i += es;\n                        this_1.c = sc_1;\n                        var d_1;\n                        var file_1 = {\n                            name: fn_1,\n                            compression: cmp_1,\n                            start: function () {\n                                if (!file_1.ondata)\n                                    err(5);\n                                if (!sc_1)\n                                    file_1.ondata(null, et, true);\n                                else {\n                                    var ctr = _this.o[cmp_1];\n                                    if (!ctr)\n                                        file_1.ondata(err(14, 'unknown compression type ' + cmp_1, 1), null, false);\n                                    d_1 = sc_1 < 0 ? new ctr(fn_1) : new ctr(fn_1, sc_1, su_1);\n                                    d_1.ondata = function (err, dat, final) { file_1.ondata(err, dat, final); };\n                                    for (var _i = 0, chks_4 = chks_3; _i < chks_4.length; _i++) {\n                                        var dat = chks_4[_i];\n                                        d_1.push(dat, false);\n                                    }\n                                    if (_this.k[0] == chks_3 && _this.c)\n                                        _this.d = d_1;\n                                    else\n                                        d_1.push(et, true);\n                                }\n                            },\n                            terminate: function () {\n                                if (d_1 && d_1.terminate)\n                                    d_1.terminate();\n                            }\n                        };\n                        if (sc_1 >= 0)\n                            file_1.size = sc_1, file_1.originalSize = su_1;\n                        this_1.onfile(file_1);\n                    }\n                    return \"break\";\n                }\n                else if (oc) {\n                    if (sig == 0x8074B50) {\n                        is = i += 12 + (oc == -2 && 8), f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                    else if (sig == 0x2014B50) {\n                        is = i -= 4, f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                }\n            };\n            var this_1 = this;\n            for (; i < l - 4; ++i) {\n                var state_1 = _loop_2();\n                if (state_1 === \"break\")\n                    break;\n            }\n            this.p = et;\n            if (oc < 0) {\n                var dat = f ? buf.subarray(0, is - 12 - (oc == -2 && 8) - (b4(buf, is - 16) == 0x8074B50 && 4)) : buf.subarray(0, i);\n                if (add)\n                    add.push(dat, !!f);\n                else\n                    this.k[+(f == 2)].push(dat);\n            }\n            if (f & 2)\n                return this.push(buf.subarray(i), final);\n            this.p = buf.subarray(i);\n        }\n        if (final) {\n            if (this.c)\n                err(13);\n            this.p = null;\n        }\n    };\n    /**\n     * Registers a decoder with the stream, allowing for files compressed with\n     * the compression type provided to be expanded correctly\n     * @param decoder The decoder constructor\n     */\n    Unzip.prototype.register = function (decoder) {\n        this.o[decoder.compression] = decoder;\n    };\n    return Unzip;\n}());\nexport { Unzip };\nvar mt = typeof queueMicrotask == 'function' ? queueMicrotask : typeof setTimeout == 'function' ? setTimeout : function (fn) { fn(); };\nexport function unzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var files = {};\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558) {\n            cbd(err(13, 0, 1), null);\n            return tAll;\n        }\n    }\n    ;\n    var lft = b2(data, e + 8);\n    if (lft) {\n        var c = lft;\n        var o = b4(data, e + 16);\n        var z = b4(data, e - 20) == 0x7064B50;\n        if (z) {\n            var ze = b4(data, e - 12);\n            z = b4(data, ze) == 0x6064B50;\n            if (z) {\n                c = lft = b4(data, ze + 32);\n                o = b4(data, ze + 48);\n            }\n        }\n        var fltr = opts && opts.filter;\n        var _loop_3 = function (i) {\n            var _a = zh(data, o, z), c_1 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n            o = no;\n            var cbl = function (e, d) {\n                if (e) {\n                    tAll();\n                    cbd(e, null);\n                }\n                else {\n                    if (d)\n                        files[fn] = d;\n                    if (!--lft)\n                        cbd(null, files);\n                }\n            };\n            if (!fltr || fltr({\n                name: fn,\n                size: sc,\n                originalSize: su,\n                compression: c_1\n            })) {\n                if (!c_1)\n                    cbl(null, slc(data, b, b + sc));\n                else if (c_1 == 8) {\n                    var infl = data.subarray(b, b + sc);\n                    // Synchronously decompress under 512KB, or barely-compressed data\n                    if (su < 524288 || sc > 0.8 * su) {\n                        try {\n                            cbl(null, inflateSync(infl, { out: new u8(su) }));\n                        }\n                        catch (e) {\n                            cbl(e, null);\n                        }\n                    }\n                    else\n                        term.push(inflate(infl, { size: su }, cbl));\n                }\n                else\n                    cbl(err(14, 'unknown compression type ' + c_1, 1), null);\n            }\n            else\n                cbl(null, null);\n        };\n        for (var i = 0; i < c; ++i) {\n            _loop_3(i);\n        }\n    }\n    else\n        cbd(null, {});\n    return tAll;\n}\n/**\n * Synchronously decompresses a ZIP archive. Prefer using `unzip` for better\n * performance with more than one file.\n * @param data The raw compressed ZIP file\n * @param opts The ZIP extraction options\n * @returns The decompressed files\n */\nexport function unzipSync(data, opts) {\n    var files = {};\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558)\n            err(13);\n    }\n    ;\n    var c = b2(data, e + 8);\n    if (!c)\n        return {};\n    var o = b4(data, e + 16);\n    var z = b4(data, e - 20) == 0x7064B50;\n    if (z) {\n        var ze = b4(data, e - 12);\n        z = b4(data, ze) == 0x6064B50;\n        if (z) {\n            c = b4(data, ze + 32);\n            o = b4(data, ze + 48);\n        }\n    }\n    var fltr = opts && opts.filter;\n    for (var i = 0; i < c; ++i) {\n        var _a = zh(data, o, z), c_2 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n        o = no;\n        if (!fltr || fltr({\n            name: fn,\n            size: sc,\n            originalSize: su,\n            compression: c_2\n        })) {\n            if (!c_2)\n                files[fn] = slc(data, b, b + sc);\n            else if (c_2 == 8)\n                files[fn] = inflateSync(data.subarray(b, b + sc), { out: new u8(su) });\n            else\n                err(14, 'unknown compression type ' + c_2);\n        }\n    }\n    return files;\n}\n","import { gunzipSync } from 'fflate'\n\nimport { ToolError } from '../../../core/errors'\n\nfunction reportDocumentError(message: string, code: 'too_large' | 'unsupported' | 'upstream'): never {\n\tthrow new ToolError(message, { code })\n}\n\nexport async function decompressReportDocumentBytes(\n\tbytes: Uint8Array,\n\tcompressionAlgorithm: string | undefined,\n\tmaxBytes: number\n): Promise<Uint8Array> {\n\tif (bytes.byteLength > maxBytes) {\n\t\treportDocumentError('Amazon report document exceeds max_bytes', 'too_large')\n\t}\n\tif (!compressionAlgorithm) return bytes\n\tif (compressionAlgorithm.toUpperCase() !== 'GZIP') {\n\t\treportDocumentError(`Unsupported Amazon report compression: ${compressionAlgorithm}`, 'unsupported')\n\t}\n\ttry {\n\t\tconst output = gunzipSync(bytes, { out: new Uint8Array(maxBytes + 1) })\n\t\tif (output.byteLength > maxBytes) {\n\t\t\treportDocumentError('Amazon report document exceeds max_bytes after decompression', 'too_large')\n\t\t}\n\t\treturn output.slice()\n\t} catch (error) {\n\t\tif (error instanceof ToolError) throw error\n\t\treportDocumentError('Failed to decompress Amazon report document', 'upstream')\n\t}\n}\n","/**\n * Amazon settlement report V2 (GET_V2_SETTLEMENT_REPORT_DATA_FLAT_FILE_V2).\n * TSV via papaparse; money via decimal.js. Never put raw row PII in errors/output.\n */\n\nimport Decimal from 'decimal.js'\nimport Papa from 'papaparse'\n\nimport { ToolError } from '../../../core/errors'\nimport type { AmazonSpApiSettlementSummary } from '../contracts'\nimport { decompressReportDocumentBytes } from './report-document'\n\n/** Report type for Flat File V2 Settlement (auto-scheduled by Amazon). */\nexport const SETTLEMENT_REPORT_TYPE_V2 = 'GET_V2_SETTLEMENT_REPORT_DATA_FLAT_FILE_V2'\n\n/** How far back listReports looks for completed settlement reports. */\nexport const SETTLEMENT_RETENTION_DAYS = 90\n\n/** Max compressed document body (bytes). */\nexport const SETTLEMENT_MAX_COMPRESSED_BYTES = 16 * 1024 * 1024\n\n/** Max decompressed TSV body (bytes). */\nexport const SETTLEMENT_MAX_DECOMPRESSED_BYTES = 64 * 1024 * 1024\n\n/** Max data rows (excluding header). */\nexport const SETTLEMENT_MAX_ROWS = 250_000\n\n/** Required V2 header names (order free after parse; extra trailing columns OK). */\nexport const SETTLEMENT_V2_REQUIRED_COLUMNS = [\n\t'settlement-id',\n\t'settlement-start-date',\n\t'settlement-end-date',\n\t'deposit-date',\n\t'total-amount',\n\t'currency',\n\t'amount'\n] as const\n\ntype SettlementRow = Record<string, string | undefined>\n\nfunction settlementError(\n\tmessage: string,\n\tcode: 'bad_input' | 'upstream' | 'too_large' | 'not_found' | 'unsupported' = 'upstream'\n): never {\n\tthrow new ToolError(message, { code })\n}\n\nfunction cell(row: SettlementRow, key: string): string {\n\treturn (row[key] ?? '').trim()\n}\n\n/**\n * Parse Amazon settlement amount strings to safe integer cents via decimal.js.\n * Empty → 0. Strips US thousands commas only (`1,234.56` → `1234.56`).\n */\nexport function parseUsMoneyToSafeCents(raw: string): number {\n\tconst trimmed = raw.trim()\n\tif (trimmed.length === 0) return 0\n\t// Amazon V2 is US-style; drop thousands separators so Decimal accepts the value.\n\tconst normalized = trimmed.replace(/,/g, '')\n\tlet value: Decimal\n\ttry {\n\t\tvalue = new Decimal(normalized)\n\t} catch {\n\t\tsettlementError('Settlement report has an invalid amount cell', 'upstream')\n\t}\n\tif (!value.isFinite()) {\n\t\tsettlementError('Settlement report has a non-numeric amount', 'upstream')\n\t}\n\tconst cents = value.times(100).toDecimalPlaces(0, Decimal.ROUND_HALF_UP)\n\tif (!cents.isInteger()) {\n\t\tsettlementError('Settlement report has a non-numeric amount', 'upstream')\n\t}\n\tconst n = cents.toNumber()\n\tif (!Number.isSafeInteger(n)) {\n\t\tsettlementError('Settlement amount exceeds safe integer cents range', 'upstream')\n\t}\n\treturn n\n}\n\n/** Decompress GZIP when report document uses compressionAlgorithm GZIP. */\nexport async function maybeGunzipReportBytes(\n\tbytes: Uint8Array,\n\tcompressionAlgorithm: string | undefined\n): Promise<Uint8Array> {\n\tif (bytes.byteLength > SETTLEMENT_MAX_COMPRESSED_BYTES) {\n\t\tsettlementError('Settlement report compressed body exceeds limit', 'too_large')\n\t}\n\ttry {\n\t\treturn await decompressReportDocumentBytes(bytes, compressionAlgorithm, SETTLEMENT_MAX_DECOMPRESSED_BYTES)\n\t} catch (error) {\n\t\tif (error instanceof ToolError && error.code === 'too_large') {\n\t\t\tsettlementError('Settlement report decompressed body exceeds limit', 'too_large')\n\t\t}\n\t\tif (error instanceof ToolError && error.code === 'unsupported') throw error\n\t\tsettlementError('Failed to decompress settlement report', 'upstream')\n\t}\n}\n\n/**\n * Parse Flat File V2 settlement TSV into the eight summary fields only.\n * Validates single settlement-id, currency, period, and amount sum vs total-amount.\n */\nexport function parseSettlementV2Tsv(text: string): AmazonSpApiSettlementSummary {\n\tconst result = Papa.parse<SettlementRow>(text, {\n\t\tdelimiter: '\\t',\n\t\theader: true,\n\t\tskipEmptyLines: 'greedy',\n\t\ttransformHeader: (header) => header.trim().replace(/^\\uFEFF/, '')\n\t})\n\n\tif (result.errors.length > 0) {\n\t\tsettlementError('Settlement report TSV could not be parsed', 'upstream')\n\t}\n\n\tconst fields = result.meta.fields ?? []\n\tfor (const required of SETTLEMENT_V2_REQUIRED_COLUMNS) {\n\t\tif (!fields.includes(required)) {\n\t\t\tsettlementError('Settlement report header columns do not match Flat File V2 schema', 'upstream')\n\t\t}\n\t}\n\n\tconst rows = result.data\n\tif (rows.length === 0) {\n\t\tsettlementError('Settlement report is empty or missing data rows', 'upstream')\n\t}\n\tif (rows.length > SETTLEMENT_MAX_ROWS) {\n\t\tsettlementError('Settlement report exceeds max row limit', 'too_large')\n\t}\n\n\tlet settlementId: string | undefined\n\tlet settlementStart: string | undefined\n\tlet settlementEnd: string | undefined\n\tlet depositDate: string | undefined\n\tlet currency: string | undefined\n\tlet totalAmountCents: number | undefined\n\tlet amountSum = new Decimal(0)\n\n\tfor (const row of rows) {\n\t\tconst rowSettlementId = cell(row, 'settlement-id')\n\t\tconst rowStart = cell(row, 'settlement-start-date')\n\t\tconst rowEnd = cell(row, 'settlement-end-date')\n\t\tconst rowDeposit = cell(row, 'deposit-date')\n\t\tconst rowTotal = cell(row, 'total-amount')\n\t\tconst rowCurrency = cell(row, 'currency')\n\t\tconst rowAmount = cell(row, 'amount')\n\n\t\tif (rowSettlementId.length === 0) {\n\t\t\tsettlementError('Settlement report row missing settlement-id', 'upstream')\n\t\t}\n\n\t\tconst rowTotalCents = parseUsMoneyToSafeCents(rowTotal)\n\t\tconst rowAmountCents = parseUsMoneyToSafeCents(rowAmount)\n\n\t\tif (settlementId === undefined) {\n\t\t\tsettlementId = rowSettlementId\n\t\t\tsettlementStart = rowStart\n\t\t\tsettlementEnd = rowEnd\n\t\t\tdepositDate = rowDeposit\n\t\t\tcurrency = rowCurrency\n\t\t\ttotalAmountCents = rowTotalCents\n\t\t} else {\n\t\t\tif (rowSettlementId !== settlementId) {\n\t\t\t\tsettlementError('Settlement report contains multiple settlement ids', 'upstream')\n\t\t\t}\n\t\t\tif (rowStart !== settlementStart || rowEnd !== settlementEnd) {\n\t\t\t\tsettlementError('Settlement report has inconsistent settlement period', 'upstream')\n\t\t\t}\n\t\t\tif (rowCurrency !== currency) {\n\t\t\t\tsettlementError('Settlement report has inconsistent currency', 'upstream')\n\t\t\t}\n\t\t\tif (rowTotalCents !== totalAmountCents) {\n\t\t\t\tsettlementError('Settlement report has inconsistent total-amount', 'upstream')\n\t\t\t}\n\t\t\tif (rowDeposit.length > 0) {\n\t\t\t\tif (depositDate && depositDate.length > 0 && rowDeposit !== depositDate) {\n\t\t\t\t\tsettlementError('Settlement report has inconsistent deposit-date', 'upstream')\n\t\t\t\t}\n\t\t\t\tif (!depositDate || depositDate.length === 0) depositDate = rowDeposit\n\t\t\t}\n\t\t}\n\n\t\tamountSum = amountSum.plus(rowAmountCents)\n\t}\n\n\tif (\n\t\tsettlementId === undefined ||\n\t\tsettlementStart === undefined ||\n\t\tsettlementEnd === undefined ||\n\t\tcurrency === undefined ||\n\t\ttotalAmountCents === undefined\n\t) {\n\t\tsettlementError('Settlement report has no usable data rows', 'upstream')\n\t}\n\n\tif (!amountSum.isInteger() || !Number.isSafeInteger(amountSum.toNumber())) {\n\t\tsettlementError('Settlement amount sum exceeds safe integer cents range', 'upstream')\n\t}\n\tconst amountSumCents = amountSum.toNumber()\n\tif (amountSumCents !== totalAmountCents) {\n\t\tsettlementError('Settlement amount sum does not match total-amount', 'upstream')\n\t}\n\n\treturn {\n\t\tsettlement_id: settlementId,\n\t\tsettlement_start_date: settlementStart,\n\t\tsettlement_end_date: settlementEnd,\n\t\tdeposit_date: depositDate && depositDate.length > 0 ? depositDate : settlementEnd,\n\t\tcurrency,\n\t\ttotal_amount_cents: totalAmountCents,\n\t\tamount_sum_cents: amountSumCents,\n\t\trow_count: rows.length\n\t}\n}\n\n/** Decode UTF-8 document bytes (after optional gunzip) and parse summary. */\nexport async function summarizeSettlementDocument(\n\tbytes: Uint8Array,\n\tcompressionAlgorithm: string | undefined\n): Promise<AmazonSpApiSettlementSummary> {\n\tif (!compressionAlgorithm && bytes.byteLength > SETTLEMENT_MAX_DECOMPRESSED_BYTES) {\n\t\tsettlementError('Settlement report body exceeds limit', 'too_large')\n\t}\n\tconst plain = await maybeGunzipReportBytes(bytes, compressionAlgorithm)\n\tif (plain.byteLength > SETTLEMENT_MAX_DECOMPRESSED_BYTES) {\n\t\tsettlementError('Settlement report body exceeds limit', 'too_large')\n\t}\n\tconst text = new TextDecoder('utf-8', { fatal: false }).decode(plain)\n\treturn parseSettlementV2Tsv(text)\n}\n\n/** ISO createdSince for listReports retention window. */\nexport function settlementCreatedSinceIso(now = new Date(), retentionDays = SETTLEMENT_RETENTION_DAYS): string {\n\tconst ms = retentionDays * 24 * 60 * 60 * 1000\n\treturn new Date(now.getTime() - ms).toISOString()\n}\n","/**\n * Amazon Selling Partner API vendor client.\n * Host: `new AmazonSpApiClient(auth)`. Agent tools: `fromContext(ctx)`.\n *\n * LWA refresh provides the access token used by SP-API HTTP requests.\n */\n\nimport { ToolError } from '../../core/errors'\nimport { requireAuth } from '../../core/provider'\nimport type { ToolContext } from '../../core/types'\nimport { bytesToUtf8 } from '../../shared/bytes'\nimport { HttpService } from '../../transport/http-service'\nimport type { HttpServiceOptions } from '../../transport/http-service'\nimport type {\n\tAmazonSpApiAuth,\n\tAmazonSpApiCreateReportInput,\n\tAmazonSpApiCreateReportOutput,\n\tAmazonSpApiDownloadReportDocumentBytesInput,\n\tAmazonSpApiDownloadReportDocumentBytesOutput,\n\tAmazonSpApiGetOrderInput,\n\tAmazonSpApiGetOrderItemsInput,\n\tAmazonSpApiGetOrderItemsOutput,\n\tAmazonSpApiGetOrderOutput,\n\tAmazonSpApiGetReportDocumentInput,\n\tAmazonSpApiGetReportDocumentOutput,\n\tAmazonSpApiGetReportInput,\n\tAmazonSpApiGetReportOutput,\n\tAmazonSpApiGetSettlementSummaryInput,\n\tAmazonSpApiGetSettlementSummaryOutput,\n\tAmazonSpApiInventoryPageInput,\n\tAmazonSpApiInventoryPageOutput,\n\tAmazonSpApiListInventorySummariesInput,\n\tAmazonSpApiListInventorySummariesOutput,\n\tAmazonSpApiListOrdersInput,\n\tAmazonSpApiListOrdersOutput,\n\tAmazonSpApiListReportsInput,\n\tAmazonSpApiListReportsOutput,\n\tAmazonSpApiListReportsPageInput,\n\tAmazonSpApiListReportsPageOutput,\n\tAmazonSpApiSearchCatalogItemsInput,\n\tAmazonSpApiSearchCatalogItemsOutput,\n\tAmazonSpApiSearchOrdersInput,\n\tAmazonSpApiSearchOrdersOutput\n} from './contracts'\nimport {\n\tamazonSpApiAuthSchema,\n\tamazonSpApiDownloadReportDocumentBytesInputSchema,\n\tamazonSpApiInventoryPageInputSchema,\n\tamazonSpApiListReportsInputSchema,\n\tamazonSpApiListReportsPageInputSchema\n} from './contracts'\nimport {\n\tLWA_TOKEN_URL,\n\tlwaTokenBody,\n\tparseCreateReportPayload,\n\tparseGetReportPayload,\n\tparseInventoryPagePayload,\n\tparseInventorySummary,\n\tparseListReportsPagePayload,\n\tparseLwaTokenResponse,\n\tparseOrderItemsPayload,\n\tparseOrderPayload,\n\tparseOrdersPayload,\n\tparseReport,\n\tparseReportDocumentPayload,\n\tparseSearchCatalogItemsPayload,\n\tparseSearchOrdersPayload,\n\trequireMarketplaceIds\n} from './domain'\nimport { decompressReportDocumentBytes } from './domain/report-document'\nimport {\n\tSETTLEMENT_MAX_COMPRESSED_BYTES,\n\tSETTLEMENT_REPORT_TYPE_V2,\n\tsettlementCreatedSinceIso,\n\tsummarizeSettlementDocument\n} from './domain/settlement'\n\nexport type AmazonSpApiClientOptions = Pick<HttpServiceOptions, 'fetch' | 'signal'>\n\nexport class AmazonSpApiClient {\n\treadonly #auth: AmazonSpApiAuth\n\treadonly #lwa: HttpService\n\treadonly #api: HttpService\n\t/** Absolute URL document download (report document URLs). */\n\treadonly #download: HttpService\n\t#accessToken: string | undefined\n\t#accessTokenExpiresAt = 0\n\n\tconstructor(auth: AmazonSpApiAuth, options: AmazonSpApiClientOptions = {}) {\n\t\tconst parsed = amazonSpApiAuthSchema.safeParse(auth)\n\t\tif (!parsed.success) {\n\t\t\tthrow new ToolError('Invalid Amazon SP-API auth credentials', {\n\t\t\t\tcode: 'bad_auth',\n\t\t\t\tdetails: { issues: parsed.error.issues.map((issue) => issue.message) }\n\t\t\t})\n\t\t}\n\t\tthis.#auth = parsed.data\n\t\tthis.#lwa = new HttpService({\n\t\t\t...options,\n\t\t\tlabel: 'Amazon LWA'\n\t\t})\n\t\tthis.#api = new HttpService({\n\t\t\t...options,\n\t\t\tbaseURL: this.#auth.endpoint,\n\t\t\theaders: { 'user-agent': this.#auth.user_agent },\n\t\t\tlabel: 'Amazon SP-API'\n\t\t})\n\t\tthis.#download = new HttpService({\n\t\t\t...options,\n\t\t\tlabel: 'Amazon SP-API report download'\n\t\t})\n\t}\n\n\tstatic fromContext(ctx: ToolContext): AmazonSpApiClient {\n\t\tconst auth = requireAuth(ctx, amazonSpApiAuthSchema)\n\t\treturn new AmazonSpApiClient(auth, {\n\t\t\t...(ctx.fetch && { fetch: ctx.fetch }),\n\t\t\t...(ctx.signal && { signal: ctx.signal })\n\t\t})\n\t}\n\n\tasync #ensureAccessToken(): Promise<string> {\n\t\tconst now = Date.now()\n\t\tif (this.#accessToken && now < this.#accessTokenExpiresAt) {\n\t\t\treturn this.#accessToken\n\t\t}\n\t\tconst { data } = await this.#lwa.post(LWA_TOKEN_URL, lwaTokenBody(this.#auth), {\n\t\t\tlabel: 'Amazon LWA token',\n\t\t\theaders: { 'Content-Type': 'application/x-www-form-urlencoded' }\n\t\t})\n\t\tconst token = parseLwaTokenResponse(data)\n\t\tthis.#accessToken = token.access_token\n\t\tthis.#accessTokenExpiresAt = now + Math.max(0, token.expires_in * 1000 - 60_000)\n\t\treturn token.access_token\n\t}\n\n\tasync #spGet(path: string, label: string, query?: Record<string, string | number | boolean | undefined>) {\n\t\tconst token = await this.#ensureAccessToken()\n\t\treturn this.#api.get(path, {\n\t\t\tlabel,\n\t\t\theaders: { 'x-amz-access-token': token },\n\t\t\t...(query && { query })\n\t\t})\n\t}\n\n\tasync #spPost(path: string, label: string, body: Record<string, unknown>) {\n\t\tconst token = await this.#ensureAccessToken()\n\t\treturn this.#api.post(path, body, {\n\t\t\tlabel,\n\t\t\theaders: {\n\t\t\t\t'x-amz-access-token': token,\n\t\t\t\t'Content-Type': 'application/json'\n\t\t\t}\n\t\t})\n\t}\n\n\t/** GET /orders/v0/orders */\n\tasync listOrders(input: AmazonSpApiListOrdersInput = {}): Promise<AmazonSpApiListOrdersOutput> {\n\t\tconst marketplaceIds = requireMarketplaceIds(\n\t\t\tinput.marketplace_ids,\n\t\t\tthis.#auth.marketplace_ids,\n\t\t\t'Amazon SP-API listOrders'\n\t\t)\n\t\tconst { data } = await this.#spGet('/orders/v0/orders', 'Amazon SP-API listOrders', {\n\t\t\tMarketplaceIds: marketplaceIds.join(','),\n\t\t\t...(input.created_after && { CreatedAfter: input.created_after }),\n\t\t\t...(input.created_before && { CreatedBefore: input.created_before }),\n\t\t\t...(input.last_updated_after && { LastUpdatedAfter: input.last_updated_after }),\n\t\t\t...(input.order_statuses &&\n\t\t\t\tinput.order_statuses.length > 0 && {\n\t\t\t\t\tOrderStatuses: input.order_statuses.join(',')\n\t\t\t\t}),\n\t\t\t...(input.cursor && { NextToken: input.cursor }),\n\t\t\t...(input.max_results !== undefined && { MaxResultsPerPage: input.max_results })\n\t\t})\n\t\tconst parsed = parseOrdersPayload(data)\n\t\treturn {\n\t\t\titems: parsed.items,\n\t\t\ttruncated: Boolean(parsed.nextToken),\n\t\t\t...(parsed.nextToken && { next_cursor: parsed.nextToken })\n\t\t}\n\t}\n\n\t/** GET /orders/v0/orders/{orderId} */\n\tasync getOrder(input: AmazonSpApiGetOrderInput): Promise<AmazonSpApiGetOrderOutput> {\n\t\tconst { data } = await this.#spGet(\n\t\t\t`/orders/v0/orders/${encodeURIComponent(input.amazon_order_id)}`,\n\t\t\t'Amazon SP-API getOrder'\n\t\t)\n\t\treturn { order: parseOrderPayload(data) }\n\t}\n\n\t/** GET /orders/v0/orders/{orderId}/orderItems */\n\tasync getOrderItems(input: AmazonSpApiGetOrderItemsInput): Promise<AmazonSpApiGetOrderItemsOutput> {\n\t\tconst query = input.cursor ? { NextToken: input.cursor } : undefined\n\t\tconst { data } = await this.#spGet(\n\t\t\t`/orders/v0/orders/${encodeURIComponent(input.amazon_order_id)}/orderItems`,\n\t\t\t'Amazon SP-API getOrderItems',\n\t\t\tquery\n\t\t)\n\t\tconst parsed = parseOrderItemsPayload(data)\n\t\treturn {\n\t\t\tamazon_order_id: parsed.amazon_order_id,\n\t\t\titems: parsed.items,\n\t\t\ttruncated: Boolean(parsed.nextToken),\n\t\t\t...(parsed.nextToken && { next_cursor: parsed.nextToken })\n\t\t}\n\t}\n\n\t/**\n\t * GET /orders/2026-01-01/orders (searchOrders).\n\t * Always requests includedData=FULFILLMENT for fulfillmentStatus.\n\t * Optional max_pages drains pages sequentially (bounded).\n\t */\n\tasync searchOrders(input: AmazonSpApiSearchOrdersInput): Promise<AmazonSpApiSearchOrdersOutput> {\n\t\tconst marketplaceIds = requireMarketplaceIds(\n\t\t\tinput.marketplace_ids,\n\t\t\tthis.#auth.marketplace_ids,\n\t\t\t'Amazon SP-API searchOrders'\n\t\t)\n\t\tconst maxPages = input.max_pages ?? 1\n\t\tconst pageSize = input.max_results ?? 100\n\t\tconst items: AmazonSpApiSearchOrdersOutput['items'] = []\n\t\tlet cursor: string | undefined = input.cursor\n\t\tlet pages = 0\n\t\tlet nextToken: string | undefined\n\n\t\twhile (pages < maxPages) {\n\t\t\tpages += 1\n\t\t\tconst { data } = await this.#spGet('/orders/2026-01-01/orders', 'Amazon SP-API searchOrders', {\n\t\t\t\tcreatedAfter: input.created_after,\n\t\t\t\t...(input.created_before && { createdBefore: input.created_before }),\n\t\t\t\tmarketplaceIds: marketplaceIds.join(','),\n\t\t\t\tincludedData: 'FULFILLMENT',\n\t\t\t\tmaxResultsPerPage: pageSize,\n\t\t\t\t...(cursor && { paginationToken: cursor })\n\t\t\t})\n\t\t\tconst parsed = parseSearchOrdersPayload(data)\n\t\t\titems.push(...parsed.items)\n\t\t\tnextToken = parsed.nextToken\n\t\t\tif (!nextToken) break\n\t\t\tcursor = nextToken\n\t\t}\n\n\t\treturn {\n\t\t\titems,\n\t\t\ttruncated: Boolean(nextToken),\n\t\t\t...(nextToken && { next_cursor: nextToken })\n\t\t}\n\t}\n\n\t/** GET /fba/inventory/v1/summaries */\n\tasync getInventorySummariesPage(input: AmazonSpApiInventoryPageInput): Promise<AmazonSpApiInventoryPageOutput> {\n\t\tconst parsedInput = amazonSpApiInventoryPageInputSchema.safeParse(input)\n\t\tif (!parsedInput.success) {\n\t\t\tthrow new ToolError('Invalid Amazon SP-API inventory page input', {\n\t\t\t\tcode: 'bad_input',\n\t\t\t\tdetails: { issues: parsedInput.error.issues.map((issue) => issue.message) }\n\t\t\t})\n\t\t}\n\t\treturn await this.#requestInventorySummariesPage({\n\t\t\tmarketplace_id: parsedInput.data.marketplace_id,\n\t\t\t...(parsedInput.data.mode === 'incremental' && { start_date_time: parsedInput.data.start_date_time }),\n\t\t\t...(parsedInput.data.next_token && { next_token: parsedInput.data.next_token })\n\t\t})\n\t}\n\n\tasync #requestInventorySummariesPage(input: {\n\t\tmarketplace_id: string\n\t\tstart_date_time?: string\n\t\tnext_token?: string\n\t\tseller_skus?: string[]\n\t}): Promise<AmazonSpApiInventoryPageOutput> {\n\t\tconst result = await this.#spGet('/fba/inventory/v1/summaries', 'Amazon SP-API getInventorySummariesPage', {\n\t\t\tdetails: true,\n\t\t\tgranularityType: 'Marketplace',\n\t\t\tgranularityId: input.marketplace_id,\n\t\t\tmarketplaceIds: input.marketplace_id,\n\t\t\t...(input.start_date_time && { startDateTime: input.start_date_time }),\n\t\t\t...(input.next_token && { nextToken: input.next_token }),\n\t\t\t...(input.seller_skus && input.seller_skus.length > 0 && { sellerSkus: input.seller_skus.join(',') })\n\t\t})\n\t\treturn parseInventoryPagePayload(result.data, result.headers)\n\t}\n\n\t/** Existing slim agent-facing projection over one raw inventory page. */\n\tasync listInventorySummaries(\n\t\tinput: AmazonSpApiListInventorySummariesInput = {}\n\t): Promise<AmazonSpApiListInventorySummariesOutput> {\n\t\tconst marketplaceIds = requireMarketplaceIds(\n\t\t\tinput.marketplace_id ? [input.marketplace_id] : undefined,\n\t\t\tthis.#auth.marketplace_ids,\n\t\t\t'Amazon SP-API listInventorySummaries'\n\t\t)\n\t\tconst marketplaceId = marketplaceIds[0]\n\t\tif (!marketplaceId) {\n\t\t\tthrow new ToolError('Amazon SP-API listInventorySummaries requires a marketplace_id', {\n\t\t\t\tcode: 'bad_input'\n\t\t\t})\n\t\t}\n\t\tconst pageInput: AmazonSpApiInventoryPageInput = input.start_date_time\n\t\t\t? {\n\t\t\t\t\tmode: 'incremental',\n\t\t\t\t\tmarketplace_id: marketplaceId,\n\t\t\t\t\tstart_date_time: input.start_date_time,\n\t\t\t\t\t...(input.cursor && { next_token: input.cursor })\n\t\t\t\t}\n\t\t\t: {\n\t\t\t\t\tmode: 'full',\n\t\t\t\t\tmarketplace_id: marketplaceId,\n\t\t\t\t\t...(input.cursor && { next_token: input.cursor })\n\t\t\t\t}\n\t\tconst parsedInput = amazonSpApiInventoryPageInputSchema.safeParse(pageInput)\n\t\tif (!parsedInput.success) {\n\t\t\tthrow new ToolError('Invalid Amazon SP-API inventory page input', {\n\t\t\t\tcode: 'bad_input',\n\t\t\t\tdetails: { issues: parsedInput.error.issues.map((issue) => issue.message) }\n\t\t\t})\n\t\t}\n\t\tconst page = await this.#requestInventorySummariesPage({\n\t\t\tmarketplace_id: marketplaceId,\n\t\t\t...(input.start_date_time && { start_date_time: input.start_date_time }),\n\t\t\t...(input.cursor && { next_token: input.cursor }),\n\t\t\t...(input.seller_skus && input.seller_skus.length > 0 && { seller_skus: input.seller_skus })\n\t\t})\n\t\treturn {\n\t\t\titems: page.items.map(parseInventorySummary),\n\t\t\ttruncated: Boolean(page.next_token),\n\t\t\t...(page.next_token && { next_cursor: page.next_token })\n\t\t}\n\t}\n\n\t/** POST /reports/2021-06-30/reports */\n\tasync createReport(input: AmazonSpApiCreateReportInput): Promise<AmazonSpApiCreateReportOutput> {\n\t\tconst marketplaceIds = requireMarketplaceIds(\n\t\t\tinput.marketplace_ids,\n\t\t\tthis.#auth.marketplace_ids,\n\t\t\t'Amazon SP-API createReport'\n\t\t)\n\t\tconst body: Record<string, unknown> = {\n\t\t\treportType: input.report_type,\n\t\t\tmarketplaceIds,\n\t\t\t...(input.data_start_time && { dataStartTime: input.data_start_time }),\n\t\t\t...(input.data_end_time && { dataEndTime: input.data_end_time }),\n\t\t\t...(input.report_options && { reportOptions: input.report_options })\n\t\t}\n\t\tconst { data } = await this.#spPost('/reports/2021-06-30/reports', 'Amazon SP-API createReport', body)\n\t\treturn parseCreateReportPayload(data)\n\t}\n\n\t/** GET /reports/2021-06-30/reports/{reportId} */\n\tasync getReport(input: AmazonSpApiGetReportInput): Promise<AmazonSpApiGetReportOutput> {\n\t\tconst { data } = await this.#spGet(\n\t\t\t`/reports/2021-06-30/reports/${encodeURIComponent(input.report_id)}`,\n\t\t\t'Amazon SP-API getReport'\n\t\t)\n\t\treturn { report: parseGetReportPayload(data) }\n\t}\n\n\t/** GET /reports/2021-06-30/reports */\n\tasync listReports(input: AmazonSpApiListReportsInput): Promise<AmazonSpApiListReportsOutput> {\n\t\tconst parsedInput = amazonSpApiListReportsInputSchema.safeParse(input)\n\t\tif (!parsedInput.success) {\n\t\t\tthrow new ToolError('Invalid Amazon SP-API listReports input', {\n\t\t\t\tcode: 'bad_input',\n\t\t\t\tdetails: { issues: parsedInput.error.issues.map((issue) => issue.message) }\n\t\t\t})\n\t\t}\n\t\tconst page =\n\t\t\t'cursor' in parsedInput.data\n\t\t\t\t? await this.listReportsPage({ next_token: parsedInput.data.cursor })\n\t\t\t\t: await this.listReportsPage({\n\t\t\t\t\t\treport_types: parsedInput.data.report_types,\n\t\t\t\t\t\t...(parsedInput.data.processing_statuses && {\n\t\t\t\t\t\t\tprocessing_statuses: parsedInput.data.processing_statuses\n\t\t\t\t\t\t}),\n\t\t\t\t\t\t...(parsedInput.data.marketplace_ids && { marketplace_ids: parsedInput.data.marketplace_ids }),\n\t\t\t\t\t\t...(parsedInput.data.page_size !== undefined && { page_size: parsedInput.data.page_size }),\n\t\t\t\t\t\t...(parsedInput.data.created_since && { created_since: parsedInput.data.created_since }),\n\t\t\t\t\t\t...(parsedInput.data.created_until && { created_until: parsedInput.data.created_until })\n\t\t\t\t\t})\n\t\treturn {\n\t\t\titems: page.items.map(parseReport),\n\t\t\ttruncated: Boolean(page.next_token),\n\t\t\t...(page.next_token && { next_cursor: page.next_token })\n\t\t}\n\t}\n\n\t/** One GET /reports/2021-06-30/reports request. Continuations send only nextToken. */\n\tasync listReportsPage(input: AmazonSpApiListReportsPageInput): Promise<AmazonSpApiListReportsPageOutput> {\n\t\tconst parsedInput = amazonSpApiListReportsPageInputSchema.safeParse(input)\n\t\tif (!parsedInput.success) {\n\t\t\tthrow new ToolError('Invalid Amazon SP-API reports page input', {\n\t\t\t\tcode: 'bad_input',\n\t\t\t\tdetails: { issues: parsedInput.error.issues.map((issue) => issue.message) }\n\t\t\t})\n\t\t}\n\t\tlet query: Record<string, string | number | boolean | undefined>\n\t\tif ('next_token' in parsedInput.data) {\n\t\t\tquery = { nextToken: parsedInput.data.next_token }\n\t\t} else {\n\t\t\tconst marketplaceIds = parsedInput.data.marketplace_ids ?? this.#auth.marketplace_ids\n\t\t\tquery = {\n\t\t\t\treportTypes: parsedInput.data.report_types.join(','),\n\t\t\t\t...(parsedInput.data.processing_statuses && {\n\t\t\t\t\tprocessingStatuses: parsedInput.data.processing_statuses.join(',')\n\t\t\t\t}),\n\t\t\t\t...(marketplaceIds && { marketplaceIds: marketplaceIds.join(',') }),\n\t\t\t\t...(parsedInput.data.page_size !== undefined && { pageSize: parsedInput.data.page_size }),\n\t\t\t\t...(parsedInput.data.created_since && { createdSince: parsedInput.data.created_since }),\n\t\t\t\t...(parsedInput.data.created_until && { createdUntil: parsedInput.data.created_until })\n\t\t\t}\n\t\t}\n\t\tconst result = await this.#spGet('/reports/2021-06-30/reports', 'Amazon SP-API listReportsPage', query)\n\t\treturn parseListReportsPagePayload(result.data, result.headers)\n\t}\n\n\t/** GET /reports/2021-06-30/documents/{reportDocumentId} */\n\tasync getReportDocument(input: AmazonSpApiGetReportDocumentInput): Promise<AmazonSpApiGetReportDocumentOutput> {\n\t\tconst { data } = await this.#spGet(\n\t\t\t`/reports/2021-06-30/documents/${encodeURIComponent(input.report_document_id)}`,\n\t\t\t'Amazon SP-API getReportDocument'\n\t\t)\n\t\treturn parseReportDocumentPayload(data)\n\t}\n\n\t/** Resolve and privately download an Amazon report document by id. */\n\tasync downloadReportDocumentBytes(\n\t\tinput: AmazonSpApiDownloadReportDocumentBytesInput\n\t): Promise<AmazonSpApiDownloadReportDocumentBytesOutput> {\n\t\tconst parsedInput = amazonSpApiDownloadReportDocumentBytesInputSchema.safeParse(input)\n\t\tif (!parsedInput.success) {\n\t\t\tthrow new ToolError('Invalid Amazon report document download input', {\n\t\t\t\tcode: 'bad_input',\n\t\t\t\tdetails: { issues: parsedInput.error.issues.map((issue) => issue.message) }\n\t\t\t})\n\t\t}\n\t\tconst document = await this.getReportDocument({ report_document_id: parsedInput.data.report_document_id })\n\t\treturn await this.#downloadReportDocumentDescriptor(document, parsedInput.data.max_bytes)\n\t}\n\n\tasync #downloadReportDocumentDescriptor(\n\t\tdocument: AmazonSpApiGetReportDocumentOutput,\n\t\tmaxBytes: number\n\t): Promise<AmazonSpApiDownloadReportDocumentBytesOutput> {\n\t\tlet compressionAlgorithm: 'GZIP' | undefined\n\t\tif (document.compression_algorithm) {\n\t\t\tif (document.compression_algorithm.toUpperCase() !== 'GZIP') {\n\t\t\t\tthrow new ToolError(`Unsupported Amazon report compression: ${document.compression_algorithm}`, {\n\t\t\t\t\tcode: 'unsupported'\n\t\t\t\t})\n\t\t\t}\n\t\t\tcompressionAlgorithm = 'GZIP'\n\t\t}\n\t\tconst result = await this.#download.bytes('GET', document.url, {\n\t\t\tlabel: 'Amazon SP-API report document',\n\t\t\tmaxBytes\n\t\t})\n\t\tconst bytes = await decompressReportDocumentBytes(result.bytes, compressionAlgorithm, maxBytes)\n\t\tconst contentType = result.headers.get('content-type') ?? undefined\n\t\tconst contentEncoding = result.headers.get('content-encoding') ?? undefined\n\t\treturn {\n\t\t\tbytes,\n\t\t\ttext: bytesToUtf8(bytes),\n\t\t\tbyte_length: bytes.byteLength,\n\t\t\t...(contentType && { content_type: contentType }),\n\t\t\t...(contentEncoding && { content_encoding: contentEncoding }),\n\t\t\t...(compressionAlgorithm && { compression_algorithm: compressionAlgorithm })\n\t\t}\n\t}\n\n\t/**\n\t * Composite: newest DONE Flat File V2 settlement report (or `report_id`) →\n\t * one document download → eight summary fields in safe integer cents.\n\t * Never returns raw TSV rows, order ids, skus, or document URLs.\n\t */\n\tasync getSettlementSummary(\n\t\tinput: AmazonSpApiGetSettlementSummaryInput = {}\n\t): Promise<AmazonSpApiGetSettlementSummaryOutput> {\n\t\tconst reportDocumentId = await this.#resolveSettlementReportDocumentId(input)\n\t\tconst doc = await this.getReportDocument({ report_document_id: reportDocumentId })\n\t\t// Download uses absolute URL from Amazon; do not put URL in errors downstream.\n\t\tconst { bytes } = await this.#download.bytes('GET', doc.url, {\n\t\t\tlabel: 'Amazon SP-API settlement document',\n\t\t\tmaxBytes: SETTLEMENT_MAX_COMPRESSED_BYTES\n\t\t})\n\t\treturn await summarizeSettlementDocument(bytes, doc.compression_algorithm)\n\t}\n\n\tasync #resolveSettlementReportDocumentId(input: AmazonSpApiGetSettlementSummaryInput): Promise<string> {\n\t\tif (input.report_id) {\n\t\t\tconst { report } = await this.getReport({ report_id: input.report_id })\n\t\t\tif (report.processing_status && report.processing_status !== 'DONE') {\n\t\t\t\tthrow new ToolError('Settlement report is not DONE', {\n\t\t\t\t\tcode: 'bad_input',\n\t\t\t\t\tdetails: { processing_status: report.processing_status }\n\t\t\t\t})\n\t\t\t}\n\t\t\tif (!report.report_document_id) {\n\t\t\t\tthrow new ToolError('Settlement report has no document id', { code: 'upstream' })\n\t\t\t}\n\t\t\treturn report.report_document_id\n\t\t}\n\n\t\tconst createdSince = input.created_since ?? settlementCreatedSinceIso()\n\t\t// Drain a few list pages; Amazon returns newest first for this endpoint.\n\t\tlet cursor: string | undefined\n\t\tfor (let page = 0; page < 5; page += 1) {\n\t\t\tconst listed = cursor\n\t\t\t\t? await this.listReports({ cursor })\n\t\t\t\t: await this.listReports({\n\t\t\t\t\t\treport_types: [SETTLEMENT_REPORT_TYPE_V2],\n\t\t\t\t\t\tprocessing_statuses: ['DONE'],\n\t\t\t\t\t\tcreated_since: createdSince,\n\t\t\t\t\t\tpage_size: 100\n\t\t\t\t\t})\n\t\t\tfor (const report of listed.items) {\n\t\t\t\tif (report.report_document_id) {\n\t\t\t\t\treturn report.report_document_id\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!listed.next_cursor) break\n\t\t\tcursor = listed.next_cursor\n\t\t}\n\n\t\tthrow new ToolError('No completed settlement report found in the retention window', {\n\t\t\tcode: 'not_found'\n\t\t})\n\t}\n\n\t/** GET /catalog/2022-04-01/items */\n\tasync searchCatalogItems(input: AmazonSpApiSearchCatalogItemsInput): Promise<AmazonSpApiSearchCatalogItemsOutput> {\n\t\tconst marketplaceIds = requireMarketplaceIds(\n\t\t\tinput.marketplace_ids,\n\t\t\tthis.#auth.marketplace_ids,\n\t\t\t'Amazon SP-API searchCatalogItems'\n\t\t)\n\t\tconst { data } = await this.#spGet('/catalog/2022-04-01/items', 'Amazon SP-API searchCatalogItems', {\n\t\t\tkeywords: input.keywords.join(','),\n\t\t\tmarketplaceIds: marketplaceIds.join(','),\n\t\t\t...(input.included_data &&\n\t\t\t\tinput.included_data.length > 0 && {\n\t\t\t\t\tincludedData: input.included_data.join(',')\n\t\t\t\t}),\n\t\t\t...(input.page_size !== undefined && { pageSize: input.page_size }),\n\t\t\t...(input.cursor && { pageToken: input.cursor })\n\t\t})\n\t\tconst parsed = parseSearchCatalogItemsPayload(data)\n\t\treturn {\n\t\t\titems: parsed.items,\n\t\t\ttruncated: Boolean(parsed.nextToken),\n\t\t\t...(parsed.numberOfResults !== undefined && { number_of_results: parsed.numberOfResults }),\n\t\t\t...(parsed.nextToken && { next_cursor: parsed.nextToken })\n\t\t}\n\t}\n}\n","import { defineModule, defineTool } from '../../core/define'\nimport { AmazonSpApiClient } from './client'\nimport {\n\tamazonSpApiAuthSchema,\n\tamazonSpApiCreateReportInputSchema,\n\tamazonSpApiCreateReportOutputSchema,\n\tamazonSpApiGetOrderInputSchema,\n\tamazonSpApiGetOrderItemsInputSchema,\n\tamazonSpApiGetOrderItemsOutputSchema,\n\tamazonSpApiGetOrderOutputSchema,\n\tamazonSpApiGetReportInputSchema,\n\tamazonSpApiGetReportOutputSchema,\n\tamazonSpApiListInventorySummariesInputSchema,\n\tamazonSpApiListInventorySummariesOutputSchema,\n\tamazonSpApiListOrdersInputSchema,\n\tamazonSpApiListOrdersOutputSchema,\n\tamazonSpApiListReportsInputSchema,\n\tamazonSpApiListReportsOutputSchema,\n\tamazonSpApiSearchCatalogItemsInputSchema,\n\tamazonSpApiSearchCatalogItemsOutputSchema,\n\tamazonSpApiSearchOrdersInputSchema,\n\tamazonSpApiSearchOrdersOutputSchema,\n\tamazonSpApiGetSettlementSummaryInputSchema,\n\tamazonSpApiGetSettlementSummaryOutputSchema\n} from './contracts'\n\nexport const amazonSpApiListOrdersTool = defineTool({\n\tid: 'amazon-sp-api-list-orders',\n\tname: 'amazonSpApiListOrders',\n\tdescription:\n\t\t'List Amazon SP-API orders for one or more marketplaces. Optional date and status filters. Paginate with next_cursor (NextToken).',\n\tinputSchema: amazonSpApiListOrdersInputSchema,\n\toutputSchema: amazonSpApiListOrdersOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).listOrders(input)\n})\n\nexport const amazonSpApiGetOrderTool = defineTool({\n\tid: 'amazon-sp-api-get-order',\n\tname: 'amazonSpApiGetOrder',\n\tdescription: 'Get one Amazon SP-API order by AmazonOrderId.',\n\tinputSchema: amazonSpApiGetOrderInputSchema,\n\toutputSchema: amazonSpApiGetOrderOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).getOrder(input)\n})\n\nexport const amazonSpApiGetOrderItemsTool = defineTool({\n\tid: 'amazon-sp-api-get-order-items',\n\tname: 'amazonSpApiGetOrderItems',\n\tdescription: 'List line items for one Amazon SP-API order. Paginate with next_cursor (NextToken).',\n\tinputSchema: amazonSpApiGetOrderItemsInputSchema,\n\toutputSchema: amazonSpApiGetOrderItemsOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).getOrderItems(input)\n})\n\nexport const amazonSpApiSearchOrdersTool = defineTool({\n\tid: 'amazon-sp-api-search-orders',\n\tname: 'amazonSpApiSearchOrders',\n\tdescription:\n\t\t'Search Amazon orders via Orders API v2026-01-01 (searchOrders). Filter by created_after (required) and optional created_before. Always includes FULFILLMENT data for fulfillment_status. Optional max_pages drains pages sequentially (max 50). Paginate with next_cursor when truncated.',\n\tinputSchema: amazonSpApiSearchOrdersInputSchema,\n\toutputSchema: amazonSpApiSearchOrdersOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).searchOrders(input)\n})\n\nexport const amazonSpApiListInventorySummariesTool = defineTool({\n\tid: 'amazon-sp-api-list-inventory-summaries',\n\tname: 'amazonSpApiListInventorySummaries',\n\tdescription:\n\t\t'List FBA inventory summaries for a marketplace. Optional seller SKUs and start_date_time. Paginate with next_cursor.',\n\tinputSchema: amazonSpApiListInventorySummariesInputSchema,\n\toutputSchema: amazonSpApiListInventorySummariesOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).listInventorySummaries(input)\n})\n\nexport const amazonSpApiCreateReportTool = defineTool({\n\tid: 'amazon-sp-api-create-report',\n\tname: 'amazonSpApiCreateReport',\n\tdescription:\n\t\t'Request an Amazon SP-API report for given marketplace(s) and optional date range. Returns report_id for later getReport polling.',\n\tinputSchema: amazonSpApiCreateReportInputSchema,\n\toutputSchema: amazonSpApiCreateReportOutputSchema,\n\tsideEffect: 'write',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).createReport(input)\n})\n\nexport const amazonSpApiGetReportTool = defineTool({\n\tid: 'amazon-sp-api-get-report',\n\tname: 'amazonSpApiGetReport',\n\tdescription:\n\t\t'Get one Amazon SP-API report by report_id, including processing_status and report_document_id when DONE.',\n\tinputSchema: amazonSpApiGetReportInputSchema,\n\toutputSchema: amazonSpApiGetReportOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).getReport(input)\n})\n\nexport const amazonSpApiListReportsTool = defineTool({\n\tid: 'amazon-sp-api-list-reports',\n\tname: 'amazonSpApiListReports',\n\tdescription:\n\t\t'List Amazon SP-API reports. Initial calls require report types and may use status, marketplace, and created-time filters. Continue with next_cursor.',\n\tinputSchema: amazonSpApiListReportsInputSchema,\n\toutputSchema: amazonSpApiListReportsOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).listReports(input)\n})\n\nexport const amazonSpApiSearchCatalogItemsTool = defineTool({\n\tid: 'amazon-sp-api-search-catalog-items',\n\tname: 'amazonSpApiSearchCatalogItems',\n\tdescription:\n\t\t'Search Amazon catalog items by keywords for marketplace(s). Optional included_data and page_size. Paginate with next_cursor (pageToken).',\n\tinputSchema: amazonSpApiSearchCatalogItemsInputSchema,\n\toutputSchema: amazonSpApiSearchCatalogItemsOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).searchCatalogItems(input)\n})\n\nexport const amazonSpApiGetSettlementSummaryTool = defineTool({\n\tid: 'amazon-sp-api-get-settlement-summary',\n\tname: 'amazonSpApiGetSettlementSummary',\n\tdescription:\n\t\t'Summarize the newest completed Amazon Flat File V2 settlement report (or a specific report_id): downloads one document, validates the TSV, and returns eight summary fields in integer cents (settlement id, period, deposit date, currency, total and amount sum, row count). Does not return line-level order or SKU data. Optional created_since (default last 90 days when listing).',\n\tinputSchema: amazonSpApiGetSettlementSummaryInputSchema,\n\toutputSchema: amazonSpApiGetSettlementSummaryOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).getSettlementSummary(input)\n})\n\nexport const amazonSpApiModule = defineModule({\n\tid: 'amazon-sp-api',\n\ttitle: 'Amazon SP-API',\n\tdescription:\n\t\t'Amazon Selling Partner API vendor pack: orders v0 and SearchOrders v2026, order items, FBA inventory summaries, reports (create/get/list), settlement V2 summary, and catalog item search.',\n\truntime: 'both',\n\tauth: { type: 'custom', schema: amazonSpApiAuthSchema },\n\tcategories: ['commerce', 'amazon'],\n\tclassification: 'pii',\n\ttags: ['orders', 'fba', 'reports'],\n\ttools: [\n\t\tamazonSpApiListOrdersTool,\n\t\tamazonSpApiGetOrderTool,\n\t\tamazonSpApiGetOrderItemsTool,\n\t\tamazonSpApiSearchOrdersTool,\n\t\tamazonSpApiListInventorySummariesTool,\n\t\tamazonSpApiCreateReportTool,\n\t\tamazonSpApiGetReportTool,\n\t\tamazonSpApiListReportsTool,\n\t\tamazonSpApiGetSettlementSummaryTool,\n\t\tamazonSpApiSearchCatalogItemsTool\n\t]\n})\n"],"x_google_ignoreList":[2],"mappings":";;;;;;;;;;;AAGA,MAAa,4BAA4B,EAAE,KAAK;CAC/C;CACA;CACA;AACD,CAAC;AAED,MAAa,wBAAwB,EAAE,OAAO;CAC7C,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,eAAe;CACrD,eAAe,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,mBAAmB;CAC7D,eAAe,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,2CAA2C;CACrF,UAAU,0BAA0B,SAAS,0BAA0B;CACvE,iBAAiB,EACf,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,gEAAgE;CAC3E,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,uDAAuD;AAC/F,CAAC;AAID,MAAa,oCAAoC,EAAE,OAAO;CACzD,cAAc,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC9B,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC5B,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS;AACvC,CAAC;AAMD,MAAa,mCAAmC,EAAE,OAAO;CACxD,iBAAiB,EACf,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,sDAAsD;CACjE,eAAe,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,gCAAgC;CACrF,gBAAgB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,iCAAiC;CACvF,oBAAoB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,gCAAgC;CAC1F,gBAAgB,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,0BAA0B;CACzF,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,6BAA6B;CAC3E,aAAa,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,mBAAmB;AAC7E,CAAC;AAED,MAAa,yBAAyB,EAAE,OAAO;CAC9C,iBAAiB,EAAE,OAAO;CAC1B,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;CAClC,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS;CACnC,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;CACtC,gBAAgB,EAAE,OAAO,CAAC,CAAC,SAAS;CACpC,oBAAoB,EAAE,OAAO,CAAC,CAAC,SAAS;CACxC,sBAAsB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1C,qBAAqB,EAAE,OAAO,CAAC,CAAC,SAAS;AAC1C,CAAC;AAED,MAAa,oCAAoC,EAAE,OAAO;CACzD,OAAO,EAAE,MAAM,sBAAsB;CACrC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,WAAW,EAAE,QAAQ;AACtB,CAAC;AAED,MAAa,iCAAiC,EAAE,OAAO,EACtD,iBAAiB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,iBAAiB,EAC9D,CAAC;AAED,MAAa,kCAAkC,EAAE,OAAO,EACvD,OAAO,uBACR,CAAC;AAED,MAAa,sCAAsC,EAAE,OAAO;CAC3D,iBAAiB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,iBAAiB;CAC7D,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,6BAA6B;AAC5E,CAAC;AAED,MAAa,6BAA6B,EAAE,OAAO;CAClD,eAAe,EAAE,OAAO;CACxB,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1B,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;CAChC,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3B,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;CACtC,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;CACtC,mBAAmB,EAAE,OAAO,CAAC,CAAC,SAAS;CACvC,qBAAqB,EAAE,OAAO,CAAC,CAAC,SAAS;AAC1C,CAAC;AAED,MAAa,uCAAuC,EAAE,OAAO;CAC5D,iBAAiB,EAAE,OAAO;CAC1B,OAAO,EAAE,MAAM,0BAA0B;CACzC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,WAAW,EAAE,QAAQ;AACtB,CAAC;AAID,MAAa,qCAAqC,EAAE,OAAO;CAC1D,eAAe,EACb,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,SAAS,8EAA8E;CACzF,gBAAgB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,iDAAiD;CACvG,iBAAiB,EACf,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,sDAAsD;CACjE,aAAa,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,gCAAgC;CACzF,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,mCAAmC;CACjF,WAAW,EACT,IAAI,CAAC,CACL,IAAI,CAAC,CAAC,CACN,IAAI,EAAE,CAAC,CACP,SAAS,CAAC,CACV,SAAS,gFAAgF;AAC5F,CAAC;AAED,MAAa,+BAA+B,EAAE,OAAO;CACpD,UAAU,EAAE,OAAO,CAAC,CAAC,SAAS,iBAAiB;CAC/C,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,+BAA+B;CAC5E,oBAAoB,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,sDAAsD;AAC1G,CAAC;AAED,MAAa,sCAAsC,EAAE,OAAO;CAC3D,OAAO,EAAE,MAAM,4BAA4B;CAC3C,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,0DAA0D;CACtG,WAAW,EAAE,QAAQ;AACtB,CAAC;AAID,MAAM,gCAAgC,EAAE,IAAI,SAAS,EAAE,QAAQ,KAAK,CAAC;AAErE,SAAS,0BAAkC;CAC1C,MAAM,gCAAgB,IAAI,KAAK;CAC/B,MAAM,aAAa,cAAc,WAAW;CAC5C,cAAc,WAAW,CAAC;CAC1B,cAAc,YAAY,cAAc,YAAY,IAAI,EAAE;CAC1D,MAAM,uBAAuB,IAAI,KAChC,KAAK,IAAI,cAAc,eAAe,GAAG,cAAc,YAAY,IAAI,GAAG,CAAC,CAC5E,CAAC,CAAC,WAAW;CACb,cAAc,WAAW,KAAK,IAAI,YAAY,oBAAoB,CAAC;CACnE,OAAO,cAAc,QAAQ;AAC9B;AAEA,MAAM,qCAAqC,EAAE,aAAa;CACzD,MAAM,EAAE,QAAQ,MAAM;CACtB,gBAAgB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAChC,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;AACxC,CAAC;AAED,MAAM,4CAA4C,EAAE,aAAa;CAChE,MAAM,EAAE,QAAQ,aAAa;CAC7B,gBAAgB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAChC,iBAAiB;CACjB,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;AACxC,CAAC;AAED,MAAa,sCAAsC,EACjD,mBAAmB,QAAQ,CAAC,oCAAoC,yCAAyC,CAAC,CAAC,CAC3G,aAAa,OAAO,YAAY;CAChC,IAAI,MAAM,SAAS,eAAe;CAClC,IAAI,KAAK,MAAM,MAAM,eAAe,IAAI,wBAAwB,GAC/D,QAAQ,SAAS;EAChB,MAAM;EACN,MAAM,CAAC,iBAAiB;EACxB,SAAS;CACV,CAAC;AAEH,CAAC;AAEF,MAAa,2CAA2C,EAAE,YAAY;CACrE,uBAAuB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3C,8BAA8B,EAAE,OAAO,CAAC,CAAC,SAAS;CAClD,8BAA8B,EAAE,OAAO,CAAC,CAAC,SAAS;CAClD,sBAAsB,EAAE,OAAO,CAAC,CAAC,SAAS;AAC3C,CAAC;AAED,MAAa,uDAAuD,EAAE,YAAY;CACjF,MAAM,EAAE,KAAK;EAAC;EAAkC;EAAgC;CAA+B,CAAC;CAChH,UAAU,EAAE,IAAI;AACjB,CAAC;AAED,MAAa,8CAA8C,EAAE,YAAY;CACxE,0BAA0B,EAAE,OAAO,CAAC,CAAC,SAAS;CAC9C,8BAA8B,EAAE,MAAM,oDAAoD,CAAC,CAAC,SAAS;AACtG,CAAC;AAED,MAAa,gDAAgD,EAAE,YAAY;CAC1E,4BAA4B,EAAE,OAAO,CAAC,CAAC,SAAS;CAChD,yBAAyB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC7C,0BAA0B,EAAE,OAAO,CAAC,CAAC,SAAS;CAC9C,4BAA4B,EAAE,OAAO,CAAC,CAAC,SAAS;CAChD,wBAAwB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC5C,mBAAmB,EAAE,OAAO,CAAC,CAAC,SAAS;CACvC,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;AACtC,CAAC;AAED,MAAa,kCAAkC,EAAE,YAAY;CAC5D,qBAAqB,EAAE,OAAO,CAAC,CAAC,SAAS;CACzC,wBAAwB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC5C,wBAAwB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC5C,0BAA0B,EAAE,OAAO,CAAC,CAAC,SAAS;CAC9C,kBAAkB,yCAAyC,SAAS;CACpE,qBAAqB,4CAA4C,SAAS;CAC1E,uBAAuB,8CAA8C,SAAS;AAC/E,CAAC;AAED,MAAa,kCAAkC,EAAE,YAAY;CAC5D,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1B,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3B,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS;CACnC,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;CACrC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS;CACrC,kBAAkB,gCAAgC,SAAS;AAC5D,CAAC;AAED,MAAa,uCAAuC,EAAE,OAAO;CAC5D,OAAO,EAAE,MAAM,+BAA+B;CAC9C,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;CAChC,uBAAuB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3C,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;AACjC,CAAC;AAED,MAAa,+CAA+C,EAAE,OAAO;CACpE,gBAAgB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,0DAA0D;CAChH,aAAa,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,qCAAqC;CACzG,iBAAiB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,mCAAmC;CAC1F,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,6BAA6B;AAC5E,CAAC;AAED,MAAa,oCAAoC,EAAE,OAAO;CACzD,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;CAChC,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1B,QAAQ,EAAE,OAAO,CAAC,CAAC,SAAS;CAC5B,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,gBAAgB,EAAE,OAAO,CAAC,CAAC,SAAS;CACpC,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;AACnC,CAAC;AAED,MAAa,gDAAgD,EAAE,OAAO;CACrE,OAAO,EAAE,MAAM,iCAAiC;CAChD,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,WAAW,EAAE,QAAQ;AACtB,CAAC;AAID,MAAa,qCAAqC,EAAE,OAAO;CAC1D,aAAa,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,qDAAqD;CAC7F,iBAAiB,EACf,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,sDAAsD;CACjE,iBAAiB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,4BAA4B;CACnF,eAAe,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,0BAA0B;CAC/E,gBAAgB,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,2CAA2C;AACjH,CAAC;AAED,MAAa,sCAAsC,EAAE,OAAO,EAC3D,WAAW,EAAE,OAAO,EACrB,CAAC;AAED,MAAa,kCAAkC,EAAE,OAAO,EACvD,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,4CAA4C,EACnF,CAAC;AAED,MAAa,0BAA0B,EAAE,OAAO;CAC/C,WAAW,EAAE,OAAO;CACpB,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,mBAAmB,EAAE,OAAO,CAAC,CAAC,SAAS;CACvC,iBAAiB,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS;CAC9C,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;CACrC,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS;CACnC,oBAAoB,EAAE,OAAO,CAAC,CAAC,SAAS;CACxC,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;AACnC,CAAC;AAED,MAAa,mCAAmC,EAAE,OAAO,EACxD,QAAQ,wBACT,CAAC;AAED,MAAM,sCAAsC;CAC3C,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS,6BAA6B;CAC9F,qBAAqB,EACnB,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,SAAS,CAAC,CACV,SAAS,kFAAkF;CAC7F,iBAAiB,EACf,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,wEAAwE;CACnF,WAAW,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,mBAAmB;CAC1E,eAAe,EAAE,IAAI,SAAS,EAAE,QAAQ,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,iCAAiC;CACrG,eAAe,EAAE,IAAI,SAAS,EAAE,QAAQ,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,kCAAkC;AACvG;AAEA,MAAa,2CAA2C,EAAE,aAAa,mCAAmC;AAE1G,MAAM,0CAA0C,EAAE,aAAa,EAC9D,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,6BAA6B,EACjE,CAAC;AAED,MAAa,oCAAoC,EAAE,MAAM,CACxD,0CACA,uCACD,CAAC;AAED,MAAa,wBAAwB,EAAE,YAAY;CAClD,UAAU,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC1B,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;CAChC,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;CACtC,gBAAgB,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS;CAC7C,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS;CACnC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;CACtC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,qBAAqB,EAAE,OAAO,CAAC,CAAC,SAAS;CACzC,mBAAmB,EAAE,OAAO,CAAC,CAAC,SAAS;CACvC,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;AACvC,CAAC;AAED,MAAa,gDAAgD,EAAE,aAAa,EAC3E,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,EAC7B,CAAC;AAED,MAAa,wCAAwC,EAAE,MAAM,CAC5D,0CACA,6CACD,CAAC;AAED,MAAa,yCAAyC,EAAE,OAAO;CAC9D,OAAO,EAAE,MAAM,qBAAqB;CACpC,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;CAChC,uBAAuB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3C,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;AACjC,CAAC;AAED,MAAa,qCAAqC,EAAE,OAAO;CAC1D,OAAO,EAAE,MAAM,uBAAuB;CACtC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,WAAW,EAAE,QAAQ;AACtB,CAAC;AAED,MAAa,0CAA0C,EAAE,OAAO,EAC/D,oBAAoB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,4CAA4C,EAC5F,CAAC;AAED,MAAa,2CAA2C,EAAE,OAAO;CAChE,aAAa,EAAE,OAAO;CACtB,KAAK,EAAE,OAAO;CACd,uBAAuB,EAAE,OAAO,CAAC,CAAC,SAAS;AAC5C,CAAC;AAED,MAAa,oDAAoD,EAAE,aAAa;CAC/E,oBAAoB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACpC,WAAW,EAAE,IAAI,CAAC,CAAC,SAAS;AAC7B,CAAC;AAED,MAAa,qDAAqD,EAAE,OAAO;CAC1E,OAAO,EAAE,QAAoB,UAAU,iBAAiB,UAAU;CAClE,MAAM,EAAE,OAAO;CACf,aAAa,EAAE,IAAI,CAAC,CAAC,YAAY;CACjC,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;CAClC,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;CACtC,uBAAuB,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;AAClD,CAAC;;;;;AAQD,MAAa,6CAA6C,EAAE,OAAO;CAClE,WAAW,EACT,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,qGAAqG;CAChH,eAAe,EACb,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,wEAAwE;AACpF,CAAC;;AAGD,MAAa,qCAAqC,EAAE,OAAO;CAC1D,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS,sBAAsB;CACzD,uBAAuB,EAAE,OAAO,CAAC,CAAC,SAAS,yBAAyB;CACpE,qBAAqB,EAAE,OAAO,CAAC,CAAC,SAAS,uBAAuB;CAChE,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS,qDAAqD;CACvF,UAAU,EAAE,OAAO,CAAC,CAAC,SAAS,mCAAmC;CACjE,oBAAoB,EAClB,OAAO,CAAC,CACR,IAAI,CAAC,CACL,SAAS,yEAAyE;CACpF,kBAAkB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,4CAA4C;CACxF,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,mDAAmD;AACzF,CAAC;AAED,MAAa,8CAA8C;AAI3D,MAAa,2CAA2C,EAAE,OAAO;CAChE,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,iBAAiB;CACtE,iBAAiB,EACf,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,sDAAsD;CACjE,eAAe,EACb,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,SAAS,CAAC,CACV,SAAS,2DAA2D;CACtE,WAAW,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,kBAAkB;CACxE,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,6BAA6B;AAC5E,CAAC;AAED,MAAa,+BAA+B,EAAE,OAAO;CACpD,MAAM,EAAE,OAAO;CACf,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3B,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3B,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;CAClC,gBAAgB,EAAE,OAAO,CAAC,CAAC,SAAS;AACrC,CAAC;AAED,MAAa,4CAA4C,EAAE,OAAO;CACjE,OAAO,EAAE,MAAM,4BAA4B;CAC3C,mBAAmB,EAAE,OAAO,CAAC,CAAC,SAAS;CACvC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,WAAW,EAAE,QAAQ;AACtB,CAAC;;;;;;ACraD,MAAa,gBAAgB;AAE7B,MAAM,uBAAuB,EAAE,YAAY;CAC1C,QAAQ,EAAE,OAAO,CAAC,CAAC,SAAS;CAC5B,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;AACnC,CAAC;AAED,MAAM,uBAAuB,EAAE,YAAY;CAC1C,eAAe,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC/B,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;CAClC,gBAAgB,EAAE,OAAO,CAAC,CAAC,SAAS;CACpC,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS;CACnC,YAAY,qBAAqB,SAAS;CAC1C,oBAAoB,EAAE,OAAO,CAAC,CAAC,SAAS;AACzC,CAAC;AAED,MAAM,6BAA6B,EAAE,YAAY,EAChD,SAAS,EAAE,YAAY;CACtB,QAAQ,EAAE,MAAM,oBAAoB;CACpC,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;AACvC,CAAC,EACF,CAAC;AAED,MAAM,6BAA6B,EAAE,YAAY;CAChD,SAAS,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACzB,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,aAAa,EAAE,YAAY,EAAE,mBAAmB,EAAE,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS;AACnF,CAAC;AAED,MAAM,+BAA+B,EAAE,YAAY;CAClD,QAAQ,EAAE,MAAM,0BAA0B;CAC1C,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS;AACjF,CAAC;AAED,MAAM,0CAA0C,EAAE,YAAY,EAAE,SAAS,6BAA6B,CAAC;AAEvG,MAAM,2BAA2B,EAAE,YAAY;CAC9C,aAAa,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC7B,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1B,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3B,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;CACrC,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;CACrC,WAAW,qBAAqB,SAAS;AAC1C,CAAC;AAED,MAAM,iCAAiC,EAAE,YAAY,EACpD,SAAS,EAAE,YAAY;CACtB,eAAe,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC/B,YAAY,EAAE,MAAM,wBAAwB;CAC5C,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;AACvC,CAAC,EACF,CAAC;AAED,MAAM,6BAA6B,EAAE,YAAY;CAChD,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACtB,WAAW,EACT,MACA,EAAE,YAAY;EACb,UAAU,EAAE,OAAO,CAAC,CAAC,SAAS;EAC9B,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;EAC/B,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS;CACpC,CAAC,CACF,CAAC,CACA,SAAS;CACX,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS;AACvF,CAAC;AAED,MAAM,oCAAoC,EAAE,YAAY;CACvD,OAAO,EAAE,MAAM,0BAA0B;CACzC,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;CACrC,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS;AACjF,CAAC;AAED,SAAgB,aAAa,MAAmF;CAO/G,OAAO,IANY,gBAAgB;EAClC,YAAY;EACZ,eAAe,KAAK;EACpB,WAAW,KAAK;EAChB,eAAe,KAAK;CACrB,CACY,CAAC,CAAC,SAAS;AACxB;AAEA,SAAgB,sBAAsB,MAA4C;CACjF,MAAM,SAAS,kCAAkC,UAAU,IAAI;CAC/D,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,iDAAiD;EACpE,MAAM;EACN,SAAS,EAAE,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;CACtE,CAAC;CAEF,OAAO,OAAO;AACf;AAEA,SAAgB,WAAW,OAAkC;CAC5D,MAAM,SAAS,qBAAqB,UAAU,KAAK;CACnD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,2CAA2C,EAAE,MAAM,WAAW,CAAC;CAEpF,OAAO;EACN,iBAAiB,OAAO,KAAK;EAC7B,GAAI,OAAO,KAAK,eAAe,EAAE,cAAc,OAAO,KAAK,YAAY;EACvE,GAAI,OAAO,KAAK,gBAAgB,EAAE,eAAe,OAAO,KAAK,aAAa;EAC1E,GAAI,OAAO,KAAK,kBAAkB,EAAE,kBAAkB,OAAO,KAAK,eAAe;EACjF,GAAI,OAAO,KAAK,iBAAiB,EAAE,gBAAgB,OAAO,KAAK,cAAc;EAC7E,GAAI,OAAO,KAAK,YAAY,UAAU,EAAE,oBAAoB,OAAO,KAAK,WAAW,OAAO;EAC1F,GAAI,OAAO,KAAK,YAAY,gBAAgB,EAAE,sBAAsB,OAAO,KAAK,WAAW,aAAa;EACxG,GAAI,OAAO,KAAK,sBAAsB,EAAE,qBAAqB,OAAO,KAAK,mBAAmB;CAC7F;AACD;AAEA,SAAgB,mBAAmB,MAGjC;CACD,MAAM,SAAS,2BAA2B,UAAU,IAAI;CACxD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,wCAAwC,EAAE,MAAM,WAAW,CAAC;CAEjF,OAAO;EACN,OAAO,OAAO,KAAK,QAAQ,OAAO,IAAI,UAAU;EAChD,GAAI,OAAO,KAAK,QAAQ,aAAa,EAAE,WAAW,OAAO,KAAK,QAAQ,UAAU;CACjF;AACD;AAEA,SAAgB,kBAAkB,MAAiC;CAClE,MAAM,SAAS,EAAE,YAAY,EAAE,SAAS,qBAAqB,CAAC,CAAC,CAAC,UAAU,IAAI;CAC9E,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,2CAA2C,EAAE,MAAM,WAAW,CAAC;CAEpF,OAAO,WAAW,OAAO,KAAK,OAAO;AACtC;;AAGA,SAAgB,iBAAiB,OAAwC;CACxE,MAAM,SAAS,2BAA2B,UAAU,KAAK;CACzD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,wDAAwD,EAAE,MAAM,WAAW,CAAC;CAEjG,OAAO;EACN,UAAU,OAAO,KAAK;EACtB,GAAI,OAAO,KAAK,eAAe,EAAE,cAAc,OAAO,KAAK,YAAY;EACvE,GAAI,OAAO,KAAK,aAAa,qBAAqB,EACjD,oBAAoB,OAAO,KAAK,YAAY,kBAC7C;CACD;AACD;AAEA,SAAgB,yBAAyB,MAGvC;CACD,MAAM,UAAU,wCAAwC,UAAU,IAAI;CACtE,MAAM,SAAS,6BAA6B,UAAU,IAAI;CAC1D,MAAM,OAAO,QAAQ,UAAU,QAAQ,KAAK,UAAU,OAAO,UAAU,OAAO,OAAO,KAAA;CACrF,IAAI,CAAC,MACJ,MAAM,IAAI,UAAU,8CAA8C,EAAE,MAAM,WAAW,CAAC;CAEvF,OAAO;EACN,OAAO,KAAK,OAAO,IAAI,gBAAgB;EACvC,GAAI,KAAK,YAAY,aAAa,EAAE,WAAW,KAAK,WAAW,UAAU;CAC1E;AACD;AAEA,SAAgB,eAAe,OAAsC;CACpE,MAAM,SAAS,yBAAyB,UAAU,KAAK;CACvD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,gDAAgD,EAAE,MAAM,WAAW,CAAC;CAEzF,OAAO;EACN,eAAe,OAAO,KAAK;EAC3B,GAAI,OAAO,KAAK,QAAQ,EAAE,MAAM,OAAO,KAAK,KAAK;EACjD,GAAI,OAAO,KAAK,aAAa,EAAE,YAAY,OAAO,KAAK,UAAU;EACjE,GAAI,OAAO,KAAK,SAAS,EAAE,OAAO,OAAO,KAAK,MAAM;EACpD,GAAI,OAAO,KAAK,oBAAoB,KAAA,KAAa,EAAE,kBAAkB,OAAO,KAAK,gBAAgB;EACjG,GAAI,OAAO,KAAK,oBAAoB,KAAA,KAAa,EAAE,kBAAkB,OAAO,KAAK,gBAAgB;EACjG,GAAI,OAAO,KAAK,WAAW,UAAU,EAAE,mBAAmB,OAAO,KAAK,UAAU,OAAO;EACvF,GAAI,OAAO,KAAK,WAAW,gBAAgB,EAAE,qBAAqB,OAAO,KAAK,UAAU,aAAa;CACtG;AACD;AAEA,SAAgB,uBAAuB,MAIrC;CACD,MAAM,SAAS,+BAA+B,UAAU,IAAI;CAC5D,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,6CAA6C,EAAE,MAAM,WAAW,CAAC;CAEtF,OAAO;EACN,iBAAiB,OAAO,KAAK,QAAQ;EACrC,OAAO,OAAO,KAAK,QAAQ,WAAW,IAAI,cAAc;EACxD,GAAI,OAAO,KAAK,QAAQ,aAAa,EAAE,WAAW,OAAO,KAAK,QAAQ,UAAU;CACjF;AACD;AAEA,SAAgB,sBAAsB,OAA6C;CAClF,MAAM,SAAS,gCAAgC,UAAU,KAAK;CAC9D,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,uDAAuD;EAC1E,MAAM;EACN,SAAS,EAAE,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;CACtE,CAAC;CAEF,OAAO;EACN,GAAI,OAAO,KAAK,aAAa,EAAE,YAAY,OAAO,KAAK,UAAU;EACjE,GAAI,OAAO,KAAK,QAAQ,EAAE,MAAM,OAAO,KAAK,KAAK;EACjD,GAAI,OAAO,KAAK,SAAS,EAAE,QAAQ,OAAO,KAAK,MAAM;EACrD,GAAI,OAAO,KAAK,aAAa,EAAE,WAAW,OAAO,KAAK,UAAU;EAChE,GAAI,OAAO,KAAK,kBAAkB,KAAA,KAAa,EAAE,gBAAgB,OAAO,KAAK,cAAc;EAC3F,GAAI,OAAO,KAAK,eAAe,EAAE,cAAc,OAAO,KAAK,YAAY;CACxE;AACD;AAEA,MAAM,8BAA8B,EAAE,YAAY;CACjD,SAAS,EAAE,YAAY,EACtB,oBAAoB,EAAE,MAAM,+BAA+B,EAC5D,CAAC;CACD,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS;AACjF,CAAC;AAED,MAAM,gCAAgC,EAAE,OAAO,OAAO,CAAC,CAAC,SAAS;AAEjE,SAAgB,4BAA4B,SAG1C;CACD,MAAM,eAAe,QAAQ,IAAI,wBAAwB;CACzD,IAAI;CACJ,IAAI,iBAAiB,MAAM;EAC1B,MAAM,kBAAkB,8BAA8B,UAAU,YAAY;EAC5E,IAAI,CAAC,gBAAgB,SACpB,MAAM,IAAI,UAAU,uDAAuD,EAAE,MAAM,WAAW,CAAC;EAEhG,YAAY,gBAAgB;CAC7B;CACA,MAAM,YAAY,QAAQ,IAAI,kBAAkB,KAAK,QAAQ,IAAI,mBAAmB,KAAK,KAAA;CACzF,OAAO;EACN,GAAI,cAAc,KAAA,KAAa,EAAE,uBAAuB,UAAU;EAClE,GAAI,aAAa,EAAE,YAAY,UAAU;CAC1C;AACD;AAEA,SAAgB,0BAA0B,MAAe,SAAkD;CAC1G,MAAM,SAAS,4BAA4B,UAAU,IAAI;CACzD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,iDAAiD;EACpE,MAAM;EACN,SAAS,EAAE,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;CACtE,CAAC;CAEF,OAAO;EACN,OAAO,OAAO,KAAK,QAAQ;EAC3B,GAAI,OAAO,KAAK,YAAY,aAAa,EAAE,YAAY,OAAO,KAAK,WAAW,UAAU;EACxF,GAAG,4BAA4B,OAAO;CACvC;AACD;AAUA,SAAgB,yBAAyB,MAAsC;CAC9E,MAAM,SAAS,EAAE,YAAY,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI;CAC5E,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,gDAAgD,EAAE,MAAM,WAAW,CAAC;CAEzF,OAAO,EAAE,WAAW,OAAO,KAAK,SAAS;AAC1C;AAEA,SAAgB,YAAY,OAAmC;CAC9D,MAAM,SAAS,sBAAsB,UAAU,KAAK;CACpD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,4CAA4C;EAC/D,MAAM;EACN,SAAS,EAAE,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;CACtE,CAAC;CAEF,OAAO;EACN,WAAW,OAAO,KAAK;EACvB,GAAI,OAAO,KAAK,cAAc,EAAE,aAAa,OAAO,KAAK,WAAW;EACpE,GAAI,OAAO,KAAK,oBAAoB,EAAE,mBAAmB,OAAO,KAAK,iBAAiB;EACtF,GAAI,OAAO,KAAK,kBACf,OAAO,KAAK,eAAe,SAAS,KAAK,EACxC,iBAAiB,OAAO,KAAK,eAC9B;EACD,GAAI,OAAO,KAAK,iBAAiB,EAAE,iBAAiB,OAAO,KAAK,cAAc;EAC9E,GAAI,OAAO,KAAK,eAAe,EAAE,eAAe,OAAO,KAAK,YAAY;EACxE,GAAI,OAAO,KAAK,oBAAoB,EAAE,oBAAoB,OAAO,KAAK,iBAAiB;EACvF,GAAI,OAAO,KAAK,eAAe,EAAE,cAAc,OAAO,KAAK,YAAY;CACxE;AACD;AAEA,SAAgB,sBAAsB,MAAkC;CACvE,OAAO,YAAY,IAAI;AACxB;AAUA,MAAM,gCAAgC,EAAE,YAAY;CACnD,SAAS,EAAE,MAAM,qBAAqB;CACtC,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;AACvC,CAAC;AAED,SAAgB,4BAA4B,MAAe,SAAoD;CAC9G,MAAM,SAAS,8BAA8B,UAAU,IAAI;CAC3D,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,oDAAoD;EACvE,MAAM;EACN,SAAS,EAAE,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;CACtE,CAAC;CAEF,OAAO;EACN,OAAO,OAAO,KAAK;EACnB,GAAI,OAAO,KAAK,aAAa,EAAE,YAAY,OAAO,KAAK,UAAU;EACjE,GAAG,4BAA4B,OAAO;CACvC;AACD;AAEA,SAAgB,2BAA2B,MAIzC;CACD,MAAM,SAAS,EACb,YAAY;EACZ,kBAAkB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EAClC,KAAK,EAAE,IAAI;EACX,sBAAsB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;CAClD,CAAC,CAAC,CACD,UAAU,IAAI;CAChB,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,kDAAkD,EAAE,MAAM,WAAW,CAAC;CAE3F,OAAO;EACN,aAAa,OAAO,KAAK;EACzB,KAAK,OAAO,KAAK;EACjB,GAAI,OAAO,KAAK,wBAAwB,EAAE,uBAAuB,OAAO,KAAK,qBAAqB;CACnG;AACD;AAEA,SAAgB,iBAAiB,OAAwC;CACxE,MAAM,SAAS,2BAA2B,UAAU,KAAK;CACzD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,kDAAkD,EAAE,MAAM,WAAW,CAAC;CAE3F,MAAM,UAAU,OAAO,KAAK,YAAY;CACxC,MAAM,cAAc,OAAO,KAAK,eAAe;CAC/C,OAAO;EACN,MAAM,OAAO,KAAK;EAClB,GAAI,SAAS,YAAY,EAAE,OAAO,QAAQ,SAAS;EACnD,GAAI,SAAS,aAAa,EAAE,OAAO,QAAQ,UAAU;EACrD,GAAI,aAAa,eAAe,EAAE,cAAc,YAAY,YAAY;EACxE,GAAI,SAAS,iBAAiB,EAAE,gBAAgB,QAAQ,cAAc;CACvE;AACD;AAEA,SAAgB,+BAA+B,MAI7C;CACD,MAAM,SAAS,kCAAkC,UAAU,IAAI;CAC/D,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,gDAAgD,EAAE,MAAM,WAAW,CAAC;CAEzF,OAAO;EACN,OAAO,OAAO,KAAK,MAAM,IAAI,gBAAgB;EAC7C,GAAI,OAAO,KAAK,oBAAoB,KAAA,KAAa,EAAE,iBAAiB,OAAO,KAAK,gBAAgB;EAChG,GAAI,OAAO,KAAK,YAAY,aAAa,EAAE,WAAW,OAAO,KAAK,WAAW,UAAU;CACxF;AACD;AAEA,SAAgB,sBACf,UACA,SACA,OACW;CACX,MAAM,MAAM,YAAY;CACxB,IAAI,CAAC,OAAO,IAAI,WAAW,GAC1B,MAAM,IAAI,UAAU,GAAG,MAAM,gDAAgD,EAAE,MAAM,YAAY,CAAC;CAEnG,OAAO;AACR;;;AC/ZA,IAAI,UAAU,cAAc,GAAG;AAU/B,IAAI;AAKJ,IAAI;CACA,KAAM,QAAQ,gBAAgB,GAAY,GAAG,QAAmC,GAAG;AACvF,SACO,GAAG,CACV;AA4BA,IAAI,KAAK;AAAY,IAAA,MAAM;AAAa,IAAA,MAAM;AAE9C,IAAI,OAAO,IAAI,GAAG;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAgB;CAAG;CAAoB;AAAC,CAAC;AAEhJ,IAAI,OAAO,IAAI,GAAG;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAiB;CAAG;AAAC,CAAC;AAEvI,IAAI,OAAO,IAAI,GAAG;CAAC;CAAI;CAAI;CAAI;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;AAAE,CAAC;AAEpF,IAAI,OAAO,SAAU,IAAI,OAAO;CAC5B,IAAI,IAAI,IAAI,IAAI,EAAE;CAClB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,EAAE,KAAK,SAAS,KAAK,GAAG,IAAI;CAGhC,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG;CACrB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,KAAK,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,GAC/B,EAAE,KAAO,IAAI,EAAE,MAAO,IAAK;CAGnC,OAAO;EAAK;EAAM;CAAE;AACxB;AACA,IAAI,KAAK,KAAK,MAAM,CAAC;AAAG,IAAA,KAAK,GAAG;AAAG,IAAA,QAAQ,GAAG;AAE9C,GAAG,MAAM,KAAK,MAAM,OAAO;AAC3B,IAAI,KAAK,KAAK,MAAM,CAAC;AAAG,IAAA,KAAK,GAAG;AAAW,GAAG;AAE9C,IAAI,MAAM,IAAI,IAAI,KAAK;AACvB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,EAAE,GAAG;CAE5B,IAAI,KAAM,IAAI,UAAW,KAAO,IAAI,UAAW;CAC/C,KAAM,IAAI,UAAW,KAAO,IAAI,UAAW;CAC3C,KAAM,IAAI,UAAW,KAAO,IAAI,SAAW;CAC3C,IAAI,OAAQ,IAAI,UAAW,KAAO,IAAI,QAAW,MAAO;AAC5D;AAIA,IAAI,QAAQ,SAAU,IAAI,IAAI,GAAG;CAC7B,IAAI,IAAI,GAAG;CAEX,IAAI,IAAI;CAER,IAAI,IAAI,IAAI,IAAI,EAAE;CAElB,OAAO,IAAI,GAAG,EAAE,GACZ,IAAI,GAAG,IACH,EAAE,EAAE,GAAG,KAAK;CAGpB,IAAI,KAAK,IAAI,IAAI,EAAE;CACnB,KAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAClB,GAAG,KAAM,GAAG,IAAI,KAAK,EAAE,IAAI,MAAO;CAEtC,IAAI;CACJ,IAAI,GAAG;EAEH,KAAK,IAAI,IAAI,KAAK,EAAE;EAEpB,IAAI,MAAM,KAAK;EACf,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAEjB,IAAI,GAAG,IAAI;GAEP,IAAI,KAAM,KAAK,IAAK,GAAG;GAEvB,IAAI,MAAM,KAAK,GAAG;GAElB,IAAI,IAAI,GAAG,GAAG,KAAK,EAAE,MAAM;GAE3B,KAAK,IAAI,IAAI,KAAM,KAAK,OAAO,GAAI,KAAK,GAAG,EAAE,GAEzC,GAAG,IAAI,MAAM,OAAO;EAE5B;CAER,OACK;EACD,KAAK,IAAI,IAAI,CAAC;EACd,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GACjB,IAAI,GAAG,IACH,GAAG,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,OAAQ,KAAK,GAAG;CAGrD;CACA,OAAO;AACX;AAEA,IAAI,MAAM,IAAI,GAAG,GAAG;AACpB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GACvB,IAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,IAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,IAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,IAAI,KAAK;AAEb,IAAI,MAAM,IAAI,GAAG,EAAE;AACnB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,IAAI,KAAK;AAE4B,IAAA,OAAqB,mBAAK,KAAK,GAAG,CAAC;AAEnC,IAAA,OAAqB,mBAAK,KAAK,GAAG,CAAC;AAE5E,IAAI,MAAM,SAAU,GAAG;CACnB,IAAI,IAAI,EAAE;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAC5B,IAAI,EAAE,KAAK,GACP,IAAI,EAAE;CAEd,OAAO;AACX;AAEA,IAAI,OAAO,SAAU,GAAG,GAAG,GAAG;CAC1B,IAAI,IAAK,IAAI,IAAK;CAClB,QAAS,EAAE,KAAM,EAAE,IAAI,MAAM,OAAQ,IAAI,KAAM;AACnD;AAEA,IAAI,SAAS,SAAU,GAAG,GAAG;CACzB,IAAI,IAAK,IAAI,IAAK;CAClB,QAAS,EAAE,KAAM,EAAE,IAAI,MAAM,IAAM,EAAE,IAAI,MAAM,QAAS,IAAI;AAChE;AAEA,IAAI,OAAO,SAAU,GAAG;CAAE,QAAS,IAAI,KAAK,IAAK;AAAG;AAGpD,IAAI,MAAM,SAAU,GAAG,GAAG,GAAG;CACzB,IAAI,KAAK,QAAQ,IAAI,GACjB,IAAI;CACR,IAAI,KAAK,QAAQ,IAAI,EAAE,QACnB,IAAI,EAAE;CAEV,OAAO,IAAI,GAAG,EAAE,SAAS,GAAG,CAAC,CAAC;AAClC;AAsBA,IAAI,KAAK;CACL;CACA;CACA;CACA;CACA;CACA;;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;AAEJ;AAEA,IAAI,MAAM,SAAU,KAAK,KAAK,IAAI;CAC9B,IAAI,IAAI,IAAI,MAAM,OAAO,GAAG,IAAI;CAChC,EAAE,OAAO;CACT,IAAI,MAAM,mBACN,MAAM,kBAAkB,GAAG,GAAG;CAClC,IAAI,CAAC,IACD,MAAM;CACV,OAAO;AACX;AAEA,IAAI,QAAQ,SAAU,KAAK,IAAI,KAAK,MAAM;CAEtC,IAAI,KAAK,IAAI,QAAQ,KAAK,OAAO,KAAK,SAAS;CAC/C,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,GACnB,OAAO,OAAO,IAAI,GAAG,CAAC;CAC1B,IAAI,QAAQ,CAAC;CAEb,IAAI,SAAS,SAAS,GAAG,KAAK;CAE9B,IAAI,OAAO,GAAG;CAEd,IAAI,OACA,MAAM,IAAI,GAAG,KAAK,CAAC;CAEvB,IAAI,OAAO,SAAU,GAAG;EACpB,IAAI,KAAK,IAAI;EAEb,IAAI,IAAI,IAAI;GAER,IAAI,OAAO,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG,CAAC,CAAC;GACrC,KAAK,IAAI,GAAG;GACZ,MAAM;EACV;CACJ;CAEA,IAAI,QAAQ,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,MAAM,GAAG,GAAG,MAAM,GAAG;CAEnG,IAAI,OAAO,KAAK;CAChB,GAAG;EACC,IAAI,CAAC,IAAI;GAEL,QAAQ,KAAK,KAAK,KAAK,CAAC;GAExB,IAAI,OAAO,KAAK,KAAK,MAAM,GAAG,CAAC;GAC/B,OAAO;GACP,IAAI,CAAC,MAAM;IAEP,IAAI,IAAI,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,KAAM,IAAI,IAAI,MAAM,GAAI,IAAI,IAAI;IACnE,IAAI,IAAI,IAAI;KACR,IAAI,MACA,IAAI,CAAC;KACT;IACJ;IAEA,IAAI,QACA,KAAK,KAAK,CAAC;IAEf,IAAI,IAAI,IAAI,SAAS,GAAG,CAAC,GAAG,EAAE;IAE9B,GAAG,IAAI,MAAM,GAAG,GAAG,IAAI,MAAM,IAAI,GAAG,GAAG,IAAI;IAC3C;GACJ,OACK,IAAI,QAAQ,GACb,KAAK,MAAM,KAAK,MAAM,MAAM,GAAG,MAAM;QACpC,IAAI,QAAQ,GAAG;IAEhB,IAAI,OAAO,KAAK,KAAK,KAAK,EAAE,IAAI,KAAK,QAAQ,KAAK,KAAK,MAAM,IAAI,EAAE,IAAI;IACvE,IAAI,KAAK,OAAO,KAAK,KAAK,MAAM,GAAG,EAAE,IAAI;IACzC,OAAO;IAEP,IAAI,MAAM,IAAI,GAAG,EAAE;IAEnB,IAAI,MAAM,IAAI,GAAG,EAAE;IACnB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,EAAE,GAEzB,IAAI,KAAK,MAAM,KAAK,KAAK,MAAM,IAAI,GAAG,CAAC;IAE3C,OAAO,QAAQ;IAEf,IAAI,MAAM,IAAI,GAAG,GAAG,UAAU,KAAK,OAAO;IAE1C,IAAI,MAAM,KAAK,KAAK,KAAK,CAAC;IAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK;KACrB,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,MAAM;KAEjC,OAAO,IAAI;KAEX,IAAI,IAAI,KAAK;KAEb,IAAI,IAAI,IACJ,IAAI,OAAO;UAEV;MAED,IAAI,IAAI,GAAG,IAAI;MACf,IAAI,KAAK,IACL,IAAI,IAAI,KAAK,KAAK,KAAK,CAAC,GAAG,OAAO,GAAG,IAAI,IAAI,IAAI;WAChD,IAAI,KAAK,IACV,IAAI,IAAI,KAAK,KAAK,KAAK,CAAC,GAAG,OAAO;WACjC,IAAI,KAAK,IACV,IAAI,KAAK,KAAK,KAAK,KAAK,GAAG,GAAG,OAAO;MACzC,OAAO,KACH,IAAI,OAAO;KACnB;IACJ;IAEA,IAAI,KAAK,IAAI,SAAS,GAAG,IAAI,GAAG,KAAK,IAAI,SAAS,IAAI;IAEtD,MAAM,IAAI,EAAE;IAEZ,MAAM,IAAI,EAAE;IACZ,KAAK,KAAK,IAAI,KAAK,CAAC;IACpB,KAAK,KAAK,IAAI,KAAK,CAAC;GACxB,OAEI,IAAI,CAAC;GACT,IAAI,MAAM,MAAM;IACZ,IAAI,MACA,IAAI,CAAC;IACT;GACJ;EACJ;EAGA,IAAI,QACA,KAAK,KAAK,MAAM;EACpB,IAAI,OAAO,KAAK,OAAO,GAAG,OAAO,KAAK,OAAO;EAC7C,IAAI,OAAO;EACX,QAAQ,OAAO,KAAK;GAEhB,IAAI,IAAI,GAAG,OAAO,KAAK,GAAG,IAAI,MAAM,MAAM,KAAK;GAC/C,OAAO,IAAI;GACX,IAAI,MAAM,MAAM;IACZ,IAAI,MACA,IAAI,CAAC;IACT;GACJ;GACA,IAAI,CAAC,GACD,IAAI,CAAC;GACT,IAAI,MAAM,KACN,IAAI,QAAQ;QACX,IAAI,OAAO,KAAK;IACjB,OAAO,KAAK,KAAK;IACjB;GACJ,OACK;IACD,IAAI,MAAM,MAAM;IAEhB,IAAI,MAAM,KAAK;KAEX,IAAI,IAAI,MAAM,KAAK,IAAI,KAAK;KAC5B,MAAM,KAAK,KAAK,MAAM,KAAK,KAAK,CAAC,IAAI,GAAG;KACxC,OAAO;IACX;IAEA,IAAI,IAAI,GAAG,OAAO,KAAK,GAAG,IAAI,MAAM,OAAO,KAAK;IAChD,IAAI,CAAC,GACD,IAAI,CAAC;IACT,OAAO,IAAI;IACX,IAAI,KAAK,GAAG;IACZ,IAAI,OAAO,GAAG;KACV,IAAI,IAAI,KAAK;KACb,MAAM,OAAO,KAAK,GAAG,KAAK,KAAK,KAAK,GAAG,OAAO;IAClD;IACA,IAAI,MAAM,MAAM;KACZ,IAAI,MACA,IAAI,CAAC;KACT;IACJ;IACA,IAAI,QACA,KAAK,KAAK,MAAM;IACpB,IAAI,MAAM,KAAK;IACf,IAAI,KAAK,IAAI;KACT,IAAI,QAAQ,KAAK,IAAI,OAAO,KAAK,IAAI,IAAI,GAAG;KAC5C,IAAI,QAAQ,KAAK,GACb,IAAI,CAAC;KACT,OAAO,KAAK,MAAM,EAAE,IAChB,IAAI,MAAM,KAAK,QAAQ;IAC/B;IACA,OAAO,KAAK,KAAK,EAAE,IACf,IAAI,MAAM,IAAI,KAAK;GAC3B;EACJ;EACA,GAAG,IAAI,IAAI,GAAG,IAAI,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;EAC1C,IAAI,IACA,QAAQ,GAAG,GAAG,IAAI,KAAK,GAAG,IAAI,IAAI,GAAG,IAAI;CACjD,SAAS,CAAC;CAEV,OAAO,MAAM,IAAI,UAAU,QAAQ,IAAI,KAAK,GAAG,EAAE,IAAI,IAAI,SAAS,GAAG,EAAE;AAC3E;AAoOA,IAAI,mBAAmB,IAAI,GAAG,CAAC;AAqW/B,IAAI,MAAM,SAAU,GAAG;CACnB,IAAI,EAAE,MAAM,MAAM,EAAE,MAAM,OAAO,EAAE,MAAM,GACrC,IAAI,GAAG,mBAAmB;CAC9B,IAAI,MAAM,EAAE;CACZ,IAAI,KAAK;CACT,IAAI,MAAM,GACN,OAAO,EAAE,MAAM,EAAE,OAAO,KAAK;CACjC,KAAK,IAAI,MAAM,OAAO,IAAI,MAAM,OAAO,IAAI,IAAI,KAAK,GAAG,MAAM,CAAC,EAAE;CAEhE,OAAO,MAAM,MAAM;AACvB;AAEA,IAAI,MAAM,SAAU,GAAG;CACnB,IAAI,IAAI,EAAE;CACV,QAAQ,EAAE,IAAI,KAAK,EAAE,IAAI,MAAM,IAAI,EAAE,IAAI,MAAM,KAAK,EAAE,IAAI,MAAM,QAAQ;AAC5E;AAqYA,SAAgB,WAAW,MAAM,MAAM;CACnC,IAAI,KAAK,IAAI,IAAI;CACjB,IAAI,KAAK,IAAI,KAAK,QACd,IAAI,GAAG,mBAAmB;CAC9B,OAAO,MAAM,KAAK,SAAS,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,QAAQ,KAAK,OAAO,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,QAAQ,KAAK,UAAU;AAChH;AAiRA,IAAI,KAAK,OAAO,eAAe,6BAA6B,IAAI,YAAY;AAG5E,IAAI;CACA,GAAG,OAAO,IAAI,EAAE,QAAQ,KAAK,CAAC;AAElC,SACO,GAAG,CAAE;;;AClpDZ,SAAS,oBAAoB,SAAiB,MAAuD;CACpG,MAAM,IAAI,UAAU,SAAS,EAAE,KAAK,CAAC;AACtC;AAEA,eAAsB,8BACrB,OACA,sBACA,UACsB;CACtB,IAAI,MAAM,aAAa,UACtB,oBAAoB,4CAA4C,WAAW;CAE5E,IAAI,CAAC,sBAAsB,OAAO;CAClC,IAAI,qBAAqB,YAAY,MAAM,QAC1C,oBAAoB,0CAA0C,wBAAwB,aAAa;CAEpG,IAAI;EACH,MAAM,SAAS,WAAW,OAAO,EAAE,KAAK,IAAI,WAAW,WAAW,CAAC,EAAE,CAAC;EACtE,IAAI,OAAO,aAAa,UACvB,oBAAoB,gEAAgE,WAAW;EAEhG,OAAO,OAAO,MAAM;CACrB,SAAS,OAAO;EACf,IAAI,iBAAiB,WAAW,MAAM;EACtC,oBAAoB,+CAA+C,UAAU;CAC9E;AACD;;;;;;;;ACjBA,MAAa,4BAA4B;;AAMzC,MAAa,kCAAkC,KAAK,OAAO;;AAG3D,MAAa,oCAAoC,KAAK,OAAO;;AAM7D,MAAa,iCAAiC;CAC7C;CACA;CACA;CACA;CACA;CACA;CACA;AACD;AAIA,SAAS,gBACR,SACA,OAA6E,YACrE;CACR,MAAM,IAAI,UAAU,SAAS,EAAE,KAAK,CAAC;AACtC;AAEA,SAAS,KAAK,KAAoB,KAAqB;CACtD,QAAQ,IAAI,QAAQ,GAAA,CAAI,KAAK;AAC9B;;;;;AAMA,SAAgB,wBAAwB,KAAqB;CAC5D,MAAM,UAAU,IAAI,KAAK;CACzB,IAAI,QAAQ,WAAW,GAAG,OAAO;CAEjC,MAAM,aAAa,QAAQ,QAAQ,MAAM,EAAE;CAC3C,IAAI;CACJ,IAAI;EACH,QAAQ,IAAI,QAAQ,UAAU;CAC/B,QAAQ;EACP,gBAAgB,gDAAgD,UAAU;CAC3E;CACA,IAAI,CAAC,MAAM,SAAS,GACnB,gBAAgB,8CAA8C,UAAU;CAEzE,MAAM,QAAQ,MAAM,MAAM,GAAG,CAAC,CAAC,gBAAgB,GAAG,QAAQ,aAAa;CACvE,IAAI,CAAC,MAAM,UAAU,GACpB,gBAAgB,8CAA8C,UAAU;CAEzE,MAAM,IAAI,MAAM,SAAS;CACzB,IAAI,CAAC,OAAO,cAAc,CAAC,GAC1B,gBAAgB,sDAAsD,UAAU;CAEjF,OAAO;AACR;;AAGA,eAAsB,uBACrB,OACA,sBACsB;CACtB,IAAI,MAAM,aAAA,UACT,gBAAgB,mDAAmD,WAAW;CAE/E,IAAI;EACH,OAAO,MAAM,8BAA8B,OAAO,sBAAsB,iCAAiC;CAC1G,SAAS,OAAO;EACf,IAAI,iBAAiB,aAAa,MAAM,SAAS,aAChD,gBAAgB,qDAAqD,WAAW;EAEjF,IAAI,iBAAiB,aAAa,MAAM,SAAS,eAAe,MAAM;EACtE,gBAAgB,0CAA0C,UAAU;CACrE;AACD;;;;;AAMA,SAAgB,qBAAqB,MAA4C;CAChF,MAAM,SAAS,KAAK,MAAqB,MAAM;EAC9C,WAAW;EACX,QAAQ;EACR,gBAAgB;EAChB,kBAAkB,WAAW,OAAO,KAAK,CAAC,CAAC,QAAQ,WAAW,EAAE;CACjE,CAAC;CAED,IAAI,OAAO,OAAO,SAAS,GAC1B,gBAAgB,6CAA6C,UAAU;CAGxE,MAAM,SAAS,OAAO,KAAK,UAAU,CAAC;CACtC,KAAK,MAAM,YAAY,gCACtB,IAAI,CAAC,OAAO,SAAS,QAAQ,GAC5B,gBAAgB,qEAAqE,UAAU;CAIjG,MAAM,OAAO,OAAO;CACpB,IAAI,KAAK,WAAW,GACnB,gBAAgB,mDAAmD,UAAU;CAE9E,IAAI,KAAK,SAAA,MACR,gBAAgB,2CAA2C,WAAW;CAGvE,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI,YAAY,IAAI,QAAQ,CAAC;CAE7B,KAAK,MAAM,OAAO,MAAM;EACvB,MAAM,kBAAkB,KAAK,KAAK,eAAe;EACjD,MAAM,WAAW,KAAK,KAAK,uBAAuB;EAClD,MAAM,SAAS,KAAK,KAAK,qBAAqB;EAC9C,MAAM,aAAa,KAAK,KAAK,cAAc;EAC3C,MAAM,WAAW,KAAK,KAAK,cAAc;EACzC,MAAM,cAAc,KAAK,KAAK,UAAU;EACxC,MAAM,YAAY,KAAK,KAAK,QAAQ;EAEpC,IAAI,gBAAgB,WAAW,GAC9B,gBAAgB,+CAA+C,UAAU;EAG1E,MAAM,gBAAgB,wBAAwB,QAAQ;EACtD,MAAM,iBAAiB,wBAAwB,SAAS;EAExD,IAAI,iBAAiB,KAAA,GAAW;GAC/B,eAAe;GACf,kBAAkB;GAClB,gBAAgB;GAChB,cAAc;GACd,WAAW;GACX,mBAAmB;EACpB,OAAO;GACN,IAAI,oBAAoB,cACvB,gBAAgB,sDAAsD,UAAU;GAEjF,IAAI,aAAa,mBAAmB,WAAW,eAC9C,gBAAgB,wDAAwD,UAAU;GAEnF,IAAI,gBAAgB,UACnB,gBAAgB,+CAA+C,UAAU;GAE1E,IAAI,kBAAkB,kBACrB,gBAAgB,mDAAmD,UAAU;GAE9E,IAAI,WAAW,SAAS,GAAG;IAC1B,IAAI,eAAe,YAAY,SAAS,KAAK,eAAe,aAC3D,gBAAgB,mDAAmD,UAAU;IAE9E,IAAI,CAAC,eAAe,YAAY,WAAW,GAAG,cAAc;GAC7D;EACD;EAEA,YAAY,UAAU,KAAK,cAAc;CAC1C;CAEA,IACC,iBAAiB,KAAA,KACjB,oBAAoB,KAAA,KACpB,kBAAkB,KAAA,KAClB,aAAa,KAAA,KACb,qBAAqB,KAAA,GAErB,gBAAgB,6CAA6C,UAAU;CAGxE,IAAI,CAAC,UAAU,UAAU,KAAK,CAAC,OAAO,cAAc,UAAU,SAAS,CAAC,GACvE,gBAAgB,0DAA0D,UAAU;CAErF,MAAM,iBAAiB,UAAU,SAAS;CAC1C,IAAI,mBAAmB,kBACtB,gBAAgB,qDAAqD,UAAU;CAGhF,OAAO;EACN,eAAe;EACf,uBAAuB;EACvB,qBAAqB;EACrB,cAAc,eAAe,YAAY,SAAS,IAAI,cAAc;EACpE;EACA,oBAAoB;EACpB,kBAAkB;EAClB,WAAW,KAAK;CACjB;AACD;;AAGA,eAAsB,4BACrB,OACA,sBACwC;CACxC,IAAI,CAAC,wBAAwB,MAAM,aAAA,UAClC,gBAAgB,wCAAwC,WAAW;CAEpE,MAAM,QAAQ,MAAM,uBAAuB,OAAO,oBAAoB;CACtE,IAAI,MAAM,aAAA,UACT,gBAAgB,wCAAwC,WAAW;CAGpE,OAAO,qBADM,IAAI,YAAY,SAAS,EAAE,OAAO,MAAM,CAAC,CAAC,CAAC,OAAO,KAChC,CAAC;AACjC;;AAGA,SAAgB,0BAA0B,sBAAM,IAAI,KAAK,GAAG,gBAAA,IAAmD;CAC9G,MAAM,KAAK,gBAAgB,KAAK,KAAK,KAAK;CAC1C,OAAO,IAAI,KAAK,IAAI,QAAQ,IAAI,EAAE,CAAC,CAAC,YAAY;AACjD;;;;;;;;;AC5JA,IAAa,oBAAb,MAAa,kBAAkB;CAC9B;CACA;CACA;;CAEA;CACA;CACA,wBAAwB;CAExB,YAAY,MAAuB,UAAoC,CAAC,GAAG;EAC1E,MAAM,SAAS,sBAAsB,UAAU,IAAI;EACnD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,0CAA0C;GAC7D,MAAM;GACN,SAAS,EAAE,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;EACtE,CAAC;EAEF,KAAKA,QAAQ,OAAO;EACpB,KAAKC,OAAO,IAAI,YAAY;GAC3B,GAAG;GACH,OAAO;EACR,CAAC;EACD,KAAKC,OAAO,IAAI,YAAY;GAC3B,GAAG;GACH,SAAS,KAAKF,MAAM;GACpB,SAAS,EAAE,cAAc,KAAKA,MAAM,WAAW;GAC/C,OAAO;EACR,CAAC;EACD,KAAKG,YAAY,IAAI,YAAY;GAChC,GAAG;GACH,OAAO;EACR,CAAC;CACF;CAEA,OAAO,YAAY,KAAqC;EACvD,MAAM,OAAO,YAAY,KAAK,qBAAqB;EACnD,OAAO,IAAI,kBAAkB,MAAM;GAClC,GAAI,IAAI,SAAS,EAAE,OAAO,IAAI,MAAM;GACpC,GAAI,IAAI,UAAU,EAAE,QAAQ,IAAI,OAAO;EACxC,CAAC;CACF;CAEA,MAAMC,qBAAsC;EAC3C,MAAM,MAAM,KAAK,IAAI;EACrB,IAAI,KAAKC,gBAAgB,MAAM,KAAKC,uBACnC,OAAO,KAAKD;EAEb,MAAM,EAAE,SAAS,MAAM,KAAKJ,KAAK,KAAK,eAAe,aAAa,KAAKD,KAAK,GAAG;GAC9E,OAAO;GACP,SAAS,EAAE,gBAAgB,oCAAoC;EAChE,CAAC;EACD,MAAM,QAAQ,sBAAsB,IAAI;EACxC,KAAKK,eAAe,MAAM;EAC1B,KAAKC,wBAAwB,MAAM,KAAK,IAAI,GAAG,MAAM,aAAa,MAAO,GAAM;EAC/E,OAAO,MAAM;CACd;CAEA,MAAMC,OAAO,MAAc,OAAe,OAA+D;EACxG,MAAM,QAAQ,MAAM,KAAKH,mBAAmB;EAC5C,OAAO,KAAKF,KAAK,IAAI,MAAM;GAC1B;GACA,SAAS,EAAE,sBAAsB,MAAM;GACvC,GAAI,SAAS,EAAE,MAAM;EACtB,CAAC;CACF;CAEA,MAAMM,QAAQ,MAAc,OAAe,MAA+B;EACzE,MAAM,QAAQ,MAAM,KAAKJ,mBAAmB;EAC5C,OAAO,KAAKF,KAAK,KAAK,MAAM,MAAM;GACjC;GACA,SAAS;IACR,sBAAsB;IACtB,gBAAgB;GACjB;EACD,CAAC;CACF;;CAGA,MAAM,WAAW,QAAoC,CAAC,GAAyC;EAC9F,MAAM,iBAAiB,sBACtB,MAAM,iBACN,KAAKF,MAAM,iBACX,0BACD;EACA,MAAM,EAAE,SAAS,MAAM,KAAKO,OAAO,qBAAqB,4BAA4B;GACnF,gBAAgB,eAAe,KAAK,GAAG;GACvC,GAAI,MAAM,iBAAiB,EAAE,cAAc,MAAM,cAAc;GAC/D,GAAI,MAAM,kBAAkB,EAAE,eAAe,MAAM,eAAe;GAClE,GAAI,MAAM,sBAAsB,EAAE,kBAAkB,MAAM,mBAAmB;GAC7E,GAAI,MAAM,kBACT,MAAM,eAAe,SAAS,KAAK,EAClC,eAAe,MAAM,eAAe,KAAK,GAAG,EAC7C;GACD,GAAI,MAAM,UAAU,EAAE,WAAW,MAAM,OAAO;GAC9C,GAAI,MAAM,gBAAgB,KAAA,KAAa,EAAE,mBAAmB,MAAM,YAAY;EAC/E,CAAC;EACD,MAAM,SAAS,mBAAmB,IAAI;EACtC,OAAO;GACN,OAAO,OAAO;GACd,WAAW,QAAQ,OAAO,SAAS;GACnC,GAAI,OAAO,aAAa,EAAE,aAAa,OAAO,UAAU;EACzD;CACD;;CAGA,MAAM,SAAS,OAAqE;EACnF,MAAM,EAAE,SAAS,MAAM,KAAKA,OAC3B,qBAAqB,mBAAmB,MAAM,eAAe,KAC7D,wBACD;EACA,OAAO,EAAE,OAAO,kBAAkB,IAAI,EAAE;CACzC;;CAGA,MAAM,cAAc,OAA+E;EAClG,MAAM,QAAQ,MAAM,SAAS,EAAE,WAAW,MAAM,OAAO,IAAI,KAAA;EAC3D,MAAM,EAAE,SAAS,MAAM,KAAKA,OAC3B,qBAAqB,mBAAmB,MAAM,eAAe,EAAE,cAC/D,+BACA,KACD;EACA,MAAM,SAAS,uBAAuB,IAAI;EAC1C,OAAO;GACN,iBAAiB,OAAO;GACxB,OAAO,OAAO;GACd,WAAW,QAAQ,OAAO,SAAS;GACnC,GAAI,OAAO,aAAa,EAAE,aAAa,OAAO,UAAU;EACzD;CACD;;;;;;CAOA,MAAM,aAAa,OAA6E;EAC/F,MAAM,iBAAiB,sBACtB,MAAM,iBACN,KAAKP,MAAM,iBACX,4BACD;EACA,MAAM,WAAW,MAAM,aAAa;EACpC,MAAM,WAAW,MAAM,eAAe;EACtC,MAAM,QAAgD,CAAC;EACvD,IAAI,SAA6B,MAAM;EACvC,IAAI,QAAQ;EACZ,IAAI;EAEJ,OAAO,QAAQ,UAAU;GACxB,SAAS;GACT,MAAM,EAAE,SAAS,MAAM,KAAKO,OAAO,6BAA6B,8BAA8B;IAC7F,cAAc,MAAM;IACpB,GAAI,MAAM,kBAAkB,EAAE,eAAe,MAAM,eAAe;IAClE,gBAAgB,eAAe,KAAK,GAAG;IACvC,cAAc;IACd,mBAAmB;IACnB,GAAI,UAAU,EAAE,iBAAiB,OAAO;GACzC,CAAC;GACD,MAAM,SAAS,yBAAyB,IAAI;GAC5C,MAAM,KAAK,GAAG,OAAO,KAAK;GAC1B,YAAY,OAAO;GACnB,IAAI,CAAC,WAAW;GAChB,SAAS;EACV;EAEA,OAAO;GACN;GACA,WAAW,QAAQ,SAAS;GAC5B,GAAI,aAAa,EAAE,aAAa,UAAU;EAC3C;CACD;;CAGA,MAAM,0BAA0B,OAA+E;EAC9G,MAAM,cAAc,oCAAoC,UAAU,KAAK;EACvE,IAAI,CAAC,YAAY,SAChB,MAAM,IAAI,UAAU,8CAA8C;GACjE,MAAM;GACN,SAAS,EAAE,QAAQ,YAAY,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;EAC3E,CAAC;EAEF,OAAO,MAAM,KAAKE,+BAA+B;GAChD,gBAAgB,YAAY,KAAK;GACjC,GAAI,YAAY,KAAK,SAAS,iBAAiB,EAAE,iBAAiB,YAAY,KAAK,gBAAgB;GACnG,GAAI,YAAY,KAAK,cAAc,EAAE,YAAY,YAAY,KAAK,WAAW;EAC9E,CAAC;CACF;CAEA,MAAMA,+BAA+B,OAKO;EAC3C,MAAM,SAAS,MAAM,KAAKF,OAAO,+BAA+B,2CAA2C;GAC1G,SAAS;GACT,iBAAiB;GACjB,eAAe,MAAM;GACrB,gBAAgB,MAAM;GACtB,GAAI,MAAM,mBAAmB,EAAE,eAAe,MAAM,gBAAgB;GACpE,GAAI,MAAM,cAAc,EAAE,WAAW,MAAM,WAAW;GACtD,GAAI,MAAM,eAAe,MAAM,YAAY,SAAS,KAAK,EAAE,YAAY,MAAM,YAAY,KAAK,GAAG,EAAE;EACpG,CAAC;EACD,OAAO,0BAA0B,OAAO,MAAM,OAAO,OAAO;CAC7D;;CAGA,MAAM,uBACL,QAAgD,CAAC,GACE;EAMnD,MAAM,gBALiB,sBACtB,MAAM,iBAAiB,CAAC,MAAM,cAAc,IAAI,KAAA,GAChD,KAAKP,MAAM,iBACX,sCAEkC,CAAC,CAAC;EACrC,IAAI,CAAC,eACJ,MAAM,IAAI,UAAU,kEAAkE,EACrF,MAAM,YACP,CAAC;EAEF,MAAM,YAA2C,MAAM,kBACpD;GACA,MAAM;GACN,gBAAgB;GAChB,iBAAiB,MAAM;GACvB,GAAI,MAAM,UAAU,EAAE,YAAY,MAAM,OAAO;EAChD,IACC;GACA,MAAM;GACN,gBAAgB;GAChB,GAAI,MAAM,UAAU,EAAE,YAAY,MAAM,OAAO;EAChD;EACF,MAAM,cAAc,oCAAoC,UAAU,SAAS;EAC3E,IAAI,CAAC,YAAY,SAChB,MAAM,IAAI,UAAU,8CAA8C;GACjE,MAAM;GACN,SAAS,EAAE,QAAQ,YAAY,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;EAC3E,CAAC;EAEF,MAAM,OAAO,MAAM,KAAKS,+BAA+B;GACtD,gBAAgB;GAChB,GAAI,MAAM,mBAAmB,EAAE,iBAAiB,MAAM,gBAAgB;GACtE,GAAI,MAAM,UAAU,EAAE,YAAY,MAAM,OAAO;GAC/C,GAAI,MAAM,eAAe,MAAM,YAAY,SAAS,KAAK,EAAE,aAAa,MAAM,YAAY;EAC3F,CAAC;EACD,OAAO;GACN,OAAO,KAAK,MAAM,IAAI,qBAAqB;GAC3C,WAAW,QAAQ,KAAK,UAAU;GAClC,GAAI,KAAK,cAAc,EAAE,aAAa,KAAK,WAAW;EACvD;CACD;;CAGA,MAAM,aAAa,OAA6E;EAC/F,MAAM,iBAAiB,sBACtB,MAAM,iBACN,KAAKT,MAAM,iBACX,4BACD;EACA,MAAM,OAAgC;GACrC,YAAY,MAAM;GAClB;GACA,GAAI,MAAM,mBAAmB,EAAE,eAAe,MAAM,gBAAgB;GACpE,GAAI,MAAM,iBAAiB,EAAE,aAAa,MAAM,cAAc;GAC9D,GAAI,MAAM,kBAAkB,EAAE,eAAe,MAAM,eAAe;EACnE;EACA,MAAM,EAAE,SAAS,MAAM,KAAKQ,QAAQ,+BAA+B,8BAA8B,IAAI;EACrG,OAAO,yBAAyB,IAAI;CACrC;;CAGA,MAAM,UAAU,OAAuE;EACtF,MAAM,EAAE,SAAS,MAAM,KAAKD,OAC3B,+BAA+B,mBAAmB,MAAM,SAAS,KACjE,yBACD;EACA,OAAO,EAAE,QAAQ,sBAAsB,IAAI,EAAE;CAC9C;;CAGA,MAAM,YAAY,OAA2E;EAC5F,MAAM,cAAc,kCAAkC,UAAU,KAAK;EACrE,IAAI,CAAC,YAAY,SAChB,MAAM,IAAI,UAAU,2CAA2C;GAC9D,MAAM;GACN,SAAS,EAAE,QAAQ,YAAY,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;EAC3E,CAAC;EAEF,MAAM,OACL,YAAY,YAAY,OACrB,MAAM,KAAK,gBAAgB,EAAE,YAAY,YAAY,KAAK,OAAO,CAAC,IAClE,MAAM,KAAK,gBAAgB;GAC3B,cAAc,YAAY,KAAK;GAC/B,GAAI,YAAY,KAAK,uBAAuB,EAC3C,qBAAqB,YAAY,KAAK,oBACvC;GACA,GAAI,YAAY,KAAK,mBAAmB,EAAE,iBAAiB,YAAY,KAAK,gBAAgB;GAC5F,GAAI,YAAY,KAAK,cAAc,KAAA,KAAa,EAAE,WAAW,YAAY,KAAK,UAAU;GACxF,GAAI,YAAY,KAAK,iBAAiB,EAAE,eAAe,YAAY,KAAK,cAAc;GACtF,GAAI,YAAY,KAAK,iBAAiB,EAAE,eAAe,YAAY,KAAK,cAAc;EACvF,CAAC;EACJ,OAAO;GACN,OAAO,KAAK,MAAM,IAAI,WAAW;GACjC,WAAW,QAAQ,KAAK,UAAU;GAClC,GAAI,KAAK,cAAc,EAAE,aAAa,KAAK,WAAW;EACvD;CACD;;CAGA,MAAM,gBAAgB,OAAmF;EACxG,MAAM,cAAc,sCAAsC,UAAU,KAAK;EACzE,IAAI,CAAC,YAAY,SAChB,MAAM,IAAI,UAAU,4CAA4C;GAC/D,MAAM;GACN,SAAS,EAAE,QAAQ,YAAY,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;EAC3E,CAAC;EAEF,IAAI;EACJ,IAAI,gBAAgB,YAAY,MAC/B,QAAQ,EAAE,WAAW,YAAY,KAAK,WAAW;OAC3C;GACN,MAAM,iBAAiB,YAAY,KAAK,mBAAmB,KAAKP,MAAM;GACtE,QAAQ;IACP,aAAa,YAAY,KAAK,aAAa,KAAK,GAAG;IACnD,GAAI,YAAY,KAAK,uBAAuB,EAC3C,oBAAoB,YAAY,KAAK,oBAAoB,KAAK,GAAG,EAClE;IACA,GAAI,kBAAkB,EAAE,gBAAgB,eAAe,KAAK,GAAG,EAAE;IACjE,GAAI,YAAY,KAAK,cAAc,KAAA,KAAa,EAAE,UAAU,YAAY,KAAK,UAAU;IACvF,GAAI,YAAY,KAAK,iBAAiB,EAAE,cAAc,YAAY,KAAK,cAAc;IACrF,GAAI,YAAY,KAAK,iBAAiB,EAAE,cAAc,YAAY,KAAK,cAAc;GACtF;EACD;EACA,MAAM,SAAS,MAAM,KAAKO,OAAO,+BAA+B,iCAAiC,KAAK;EACtG,OAAO,4BAA4B,OAAO,MAAM,OAAO,OAAO;CAC/D;;CAGA,MAAM,kBAAkB,OAAuF;EAC9G,MAAM,EAAE,SAAS,MAAM,KAAKA,OAC3B,iCAAiC,mBAAmB,MAAM,kBAAkB,KAC5E,iCACD;EACA,OAAO,2BAA2B,IAAI;CACvC;;CAGA,MAAM,4BACL,OACwD;EACxD,MAAM,cAAc,kDAAkD,UAAU,KAAK;EACrF,IAAI,CAAC,YAAY,SAChB,MAAM,IAAI,UAAU,iDAAiD;GACpE,MAAM;GACN,SAAS,EAAE,QAAQ,YAAY,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;EAC3E,CAAC;EAEF,MAAM,WAAW,MAAM,KAAK,kBAAkB,EAAE,oBAAoB,YAAY,KAAK,mBAAmB,CAAC;EACzG,OAAO,MAAM,KAAKG,kCAAkC,UAAU,YAAY,KAAK,SAAS;CACzF;CAEA,MAAMA,kCACL,UACA,UACwD;EACxD,IAAI;EACJ,IAAI,SAAS,uBAAuB;GACnC,IAAI,SAAS,sBAAsB,YAAY,MAAM,QACpD,MAAM,IAAI,UAAU,0CAA0C,SAAS,yBAAyB,EAC/F,MAAM,cACP,CAAC;GAEF,uBAAuB;EACxB;EACA,MAAM,SAAS,MAAM,KAAKP,UAAU,MAAM,OAAO,SAAS,KAAK;GAC9D,OAAO;GACP;EACD,CAAC;EACD,MAAM,QAAQ,MAAM,8BAA8B,OAAO,OAAO,sBAAsB,QAAQ;EAC9F,MAAM,cAAc,OAAO,QAAQ,IAAI,cAAc,KAAK,KAAA;EAC1D,MAAM,kBAAkB,OAAO,QAAQ,IAAI,kBAAkB,KAAK,KAAA;EAClE,OAAO;GACN;GACA,MAAM,YAAY,KAAK;GACvB,aAAa,MAAM;GACnB,GAAI,eAAe,EAAE,cAAc,YAAY;GAC/C,GAAI,mBAAmB,EAAE,kBAAkB,gBAAgB;GAC3D,GAAI,wBAAwB,EAAE,uBAAuB,qBAAqB;EAC3E;CACD;;;;;;CAOA,MAAM,qBACL,QAA8C,CAAC,GACE;EACjD,MAAM,mBAAmB,MAAM,KAAKQ,mCAAmC,KAAK;EAC5E,MAAM,MAAM,MAAM,KAAK,kBAAkB,EAAE,oBAAoB,iBAAiB,CAAC;EAEjF,MAAM,EAAE,UAAU,MAAM,KAAKR,UAAU,MAAM,OAAO,IAAI,KAAK;GAC5D,OAAO;GACP,UAAU;EACX,CAAC;EACD,OAAO,MAAM,4BAA4B,OAAO,IAAI,qBAAqB;CAC1E;CAEA,MAAMQ,mCAAmC,OAA8D;EACtG,IAAI,MAAM,WAAW;GACpB,MAAM,EAAE,WAAW,MAAM,KAAK,UAAU,EAAE,WAAW,MAAM,UAAU,CAAC;GACtE,IAAI,OAAO,qBAAqB,OAAO,sBAAsB,QAC5D,MAAM,IAAI,UAAU,iCAAiC;IACpD,MAAM;IACN,SAAS,EAAE,mBAAmB,OAAO,kBAAkB;GACxD,CAAC;GAEF,IAAI,CAAC,OAAO,oBACX,MAAM,IAAI,UAAU,wCAAwC,EAAE,MAAM,WAAW,CAAC;GAEjF,OAAO,OAAO;EACf;EAEA,MAAM,eAAe,MAAM,iBAAiB,0BAA0B;EAEtE,IAAI;EACJ,KAAK,IAAI,OAAO,GAAG,OAAO,GAAG,QAAQ,GAAG;GACvC,MAAM,SAAS,SACZ,MAAM,KAAK,YAAY,EAAE,OAAO,CAAC,IACjC,MAAM,KAAK,YAAY;IACvB,cAAc,CAAC,yBAAyB;IACxC,qBAAqB,CAAC,MAAM;IAC5B,eAAe;IACf,WAAW;GACZ,CAAC;GACH,KAAK,MAAM,UAAU,OAAO,OAC3B,IAAI,OAAO,oBACV,OAAO,OAAO;GAGhB,IAAI,CAAC,OAAO,aAAa;GACzB,SAAS,OAAO;EACjB;EAEA,MAAM,IAAI,UAAU,gEAAgE,EACnF,MAAM,YACP,CAAC;CACF;;CAGA,MAAM,mBAAmB,OAAyF;EACjH,MAAM,iBAAiB,sBACtB,MAAM,iBACN,KAAKX,MAAM,iBACX,kCACD;EACA,MAAM,EAAE,SAAS,MAAM,KAAKO,OAAO,6BAA6B,oCAAoC;GACnG,UAAU,MAAM,SAAS,KAAK,GAAG;GACjC,gBAAgB,eAAe,KAAK,GAAG;GACvC,GAAI,MAAM,iBACT,MAAM,cAAc,SAAS,KAAK,EACjC,cAAc,MAAM,cAAc,KAAK,GAAG,EAC3C;GACD,GAAI,MAAM,cAAc,KAAA,KAAa,EAAE,UAAU,MAAM,UAAU;GACjE,GAAI,MAAM,UAAU,EAAE,WAAW,MAAM,OAAO;EAC/C,CAAC;EACD,MAAM,SAAS,+BAA+B,IAAI;EAClD,OAAO;GACN,OAAO,OAAO;GACd,WAAW,QAAQ,OAAO,SAAS;GACnC,GAAI,OAAO,oBAAoB,KAAA,KAAa,EAAE,mBAAmB,OAAO,gBAAgB;GACxF,GAAI,OAAO,aAAa,EAAE,aAAa,OAAO,UAAU;EACzD;CACD;AACD;;;ACjhBA,MAAa,4BAA4B,WAAW;CACnD,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,WAAW,KAAK;AACnF,CAAC;AAED,MAAa,0BAA0B,WAAW;CACjD,IAAI;CACJ,MAAM;CACN,aAAa;CACb,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,SAAS,KAAK;AACjF,CAAC;AAED,MAAa,+BAA+B,WAAW;CACtD,IAAI;CACJ,MAAM;CACN,aAAa;CACb,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,cAAc,KAAK;AACtF,CAAC;AAED,MAAa,8BAA8B,WAAW;CACrD,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,aAAa,KAAK;AACrF,CAAC;AAED,MAAa,wCAAwC,WAAW;CAC/D,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,uBAAuB,KAAK;AAC/F,CAAC;AAED,MAAa,8BAA8B,WAAW;CACrD,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,aAAa,KAAK;AACrF,CAAC;AAED,MAAa,2BAA2B,WAAW;CAClD,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,UAAU,KAAK;AAClF,CAAC;AAED,MAAa,6BAA6B,WAAW;CACpD,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,YAAY,KAAK;AACpF,CAAC;AAED,MAAa,oCAAoC,WAAW;CAC3D,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,mBAAmB,KAAK;AAC3F,CAAC;AAED,MAAa,sCAAsC,WAAW;CAC7D,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,qBAAqB,KAAK;AAC7F,CAAC;AAED,MAAa,oBAAoB,aAAa;CAC7C,IAAI;CACJ,OAAO;CACP,aACC;CACD,SAAS;CACT,MAAM;EAAE,MAAM;EAAU,QAAQ;CAAsB;CACtD,YAAY,CAAC,YAAY,QAAQ;CACjC,gBAAgB;CAChB,MAAM;EAAC;EAAU;EAAO;CAAS;CACjC,OAAO;EACN;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACD;AACD,CAAC"}
+{"version":3,"file":"index.js","names":["#auth","#lwa","#api","#download","#ensureAccessToken","#accessToken","#accessTokenExpiresAt","#spGet","#spPost","#requestInventorySummariesPage","#downloadReportDocumentDescriptor","#resolveSettlementReportDocumentId"],"sources":["../../../src/vendors/amazon-sp-api/contracts.ts","../../../src/vendors/amazon-sp-api/domain.ts","../../../node_modules/fflate/esm/index.mjs","../../../src/vendors/amazon-sp-api/domain/report-document.ts","../../../src/vendors/amazon-sp-api/domain/settlement.ts","../../../src/vendors/amazon-sp-api/client.ts","../../../src/vendors/amazon-sp-api/module.ts"],"sourcesContent":["import { z } from 'zod'\n\n/** SP-API regional endpoints. */\nexport const amazonSpApiEndpointSchema = z.enum([\n\t'https://sellingpartnerapi-na.amazon.com',\n\t'https://sellingpartnerapi-eu.amazon.com',\n\t'https://sellingpartnerapi-fe.amazon.com'\n])\n\nexport const amazonSpApiAuthSchema = z.object({\n\tclient_id: z.string().min(1).describe('LWA client id'),\n\tclient_secret: z.string().min(1).describe('LWA client secret'),\n\trefresh_token: z.string().min(1).describe('LWA refresh token for the selling partner'),\n\tendpoint: amazonSpApiEndpointSchema.describe('SP-API regional endpoint'),\n\tmarketplace_ids: z\n\t\t.array(z.string().min(1))\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Default marketplace ids when a tool call omits marketplace_ids'),\n\tuser_agent: z.string().min(1).describe('Application user agent sent with every SP-API request')\n})\n\nexport type AmazonSpApiAuth = z.infer<typeof amazonSpApiAuthSchema>\n\nexport const amazonSpApiLwaTokenResponseSchema = z.object({\n\taccess_token: z.string().min(1),\n\ttoken_type: z.string().min(1),\n\texpires_in: z.number().int().positive()\n})\n\nexport type AmazonSpApiLwaTokenResponse = z.infer<typeof amazonSpApiLwaTokenResponseSchema>\n\n// ─── Orders ───────────────────────────────────────────────────────────────────\n\nexport const amazonSpApiListOrdersInputSchema = z.object({\n\tmarketplace_ids: z\n\t\t.array(z.string().min(1))\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Marketplace ids; omit to use the configured defaults'),\n\tcreated_after: z.string().min(1).optional().describe('ISO 8601; orders created after'),\n\tcreated_before: z.string().min(1).optional().describe('ISO 8601; orders created before'),\n\tlast_updated_after: z.string().min(1).optional().describe('ISO 8601; orders updated after'),\n\torder_statuses: z.array(z.string().min(1)).optional().describe('Order status filter list'),\n\tcursor: z.string().min(1).optional().describe('NextToken from a prior page'),\n\tmax_results: z.int().min(1).max(100).optional().describe('Page size (1-100)')\n})\n\nexport const amazonSpApiOrderSchema = z.object({\n\tamazon_order_id: z.string(),\n\torder_status: z.string().optional(),\n\tpurchase_date: z.string().optional(),\n\tlast_update_date: z.string().optional(),\n\tmarketplace_id: z.string().optional(),\n\torder_total_amount: z.string().optional(),\n\torder_total_currency: z.string().optional(),\n\tfulfillment_channel: z.string().optional()\n})\n\nexport const amazonSpApiListOrdersOutputSchema = z.object({\n\titems: z.array(amazonSpApiOrderSchema),\n\tnext_cursor: z.string().optional(),\n\ttruncated: z.boolean()\n})\n\nexport const amazonSpApiGetOrderInputSchema = z.object({\n\tamazon_order_id: z.string().min(1).describe('Amazon order id')\n})\n\nexport const amazonSpApiGetOrderOutputSchema = z.object({\n\torder: amazonSpApiOrderSchema\n})\n\nexport const amazonSpApiGetOrderItemsInputSchema = z.object({\n\tamazon_order_id: z.string().min(1).describe('Amazon order id'),\n\tcursor: z.string().min(1).optional().describe('NextToken from a prior page')\n})\n\nexport const amazonSpApiOrderItemSchema = z.object({\n\torder_item_id: z.string(),\n\tasin: z.string().optional(),\n\tseller_sku: z.string().optional(),\n\ttitle: z.string().optional(),\n\tquantity_ordered: z.number().optional(),\n\tquantity_shipped: z.number().optional(),\n\titem_price_amount: z.string().optional(),\n\titem_price_currency: z.string().optional()\n})\n\nexport const amazonSpApiGetOrderItemsOutputSchema = z.object({\n\tamazon_order_id: z.string(),\n\titems: z.array(amazonSpApiOrderItemSchema),\n\tnext_cursor: z.string().optional(),\n\ttruncated: z.boolean()\n})\n\n// ─── Orders v2026-01-01 SearchOrders ──────────────────────────────────────────\n\nexport const amazonSpApiSearchOrdersInputSchema = z.object({\n\tcreated_after: z\n\t\t.string()\n\t\t.min(1)\n\t\t.describe('ISO 8601; orders created at or after this time (required for reconciliation)'),\n\tcreated_before: z.string().min(1).optional().describe('ISO 8601; orders created at or before this time'),\n\tmarketplace_ids: z\n\t\t.array(z.string().min(1))\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Marketplace ids; omit to use the configured defaults'),\n\tmax_results: z.int().min(1).max(100).optional().describe('Page size (1-100, default 100)'),\n\tcursor: z.string().min(1).optional().describe('paginationToken from a prior page'),\n\tmax_pages: z\n\t\t.int()\n\t\t.min(1)\n\t\t.max(50)\n\t\t.optional()\n\t\t.describe('When set, drains up to this many pages and returns a combined list (default 1)')\n})\n\nexport const amazonSpApiSearchOrderSchema = z.object({\n\torder_id: z.string().describe('Amazon order id'),\n\tcreated_time: z.string().optional().describe('Order created time (ISO 8601)'),\n\tfulfillment_status: z.string().optional().describe('Fulfillment status when FULFILLMENT data is included')\n})\n\nexport const amazonSpApiSearchOrdersOutputSchema = z.object({\n\titems: z.array(amazonSpApiSearchOrderSchema),\n\tnext_cursor: z.string().optional().describe('paginationToken for the next page when not fully drained'),\n\ttruncated: z.boolean()\n})\n\n// ─── Inventory ────────────────────────────────────────────────────────────────\n\nconst amazonInventoryDateTimeSchema = z.iso.datetime({ offset: true })\n\nfunction eighteenMonthsBeforeNow(): number {\n\tconst oldestAllowed = new Date()\n\tconst currentDay = oldestAllowed.getUTCDate()\n\toldestAllowed.setUTCDate(1)\n\toldestAllowed.setUTCMonth(oldestAllowed.getUTCMonth() - 18)\n\tconst lastDayOfTargetMonth = new Date(\n\t\tDate.UTC(oldestAllowed.getUTCFullYear(), oldestAllowed.getUTCMonth() + 1, 0)\n\t).getUTCDate()\n\toldestAllowed.setUTCDate(Math.min(currentDay, lastDayOfTargetMonth))\n\treturn oldestAllowed.getTime()\n}\n\nconst amazonInventoryFullPageInputSchema = z.strictObject({\n\tmode: z.literal('full'),\n\tmarketplace_id: z.string().min(1),\n\tnext_token: z.string().min(1).optional()\n})\n\nconst amazonInventoryIncrementalPageInputSchema = z.strictObject({\n\tmode: z.literal('incremental'),\n\tmarketplace_id: z.string().min(1),\n\tstart_date_time: amazonInventoryDateTimeSchema,\n\tnext_token: z.string().min(1).optional()\n})\n\nexport const amazonSpApiInventoryPageInputSchema = z\n\t.discriminatedUnion('mode', [amazonInventoryFullPageInputSchema, amazonInventoryIncrementalPageInputSchema])\n\t.superRefine((input, context) => {\n\t\tif (input.mode !== 'incremental') return\n\t\tif (Date.parse(input.start_date_time) < eighteenMonthsBeforeNow()) {\n\t\t\tcontext.addIssue({\n\t\t\t\tcode: 'custom',\n\t\t\t\tpath: ['start_date_time'],\n\t\t\t\tmessage: 'start_date_time cannot be more than 18 months in the past'\n\t\t\t})\n\t\t}\n\t})\n\nexport const amazonInventoryReservedQuantityRawSchema = z.looseObject({\n\ttotalReservedQuantity: z.number().optional(),\n\tpendingCustomerOrderQuantity: z.number().optional(),\n\tpendingTransshipmentQuantity: z.number().optional(),\n\tfcProcessingQuantity: z.number().optional()\n})\n\nexport const amazonInventoryResearchingQuantityBreakdownRawSchema = z.looseObject({\n\tname: z.enum(['researchingQuantityInShortTerm', 'researchingQuantityInMidTerm', 'researchingQuantityInLongTerm']),\n\tquantity: z.int()\n})\n\nexport const amazonInventoryResearchingQuantityRawSchema = z.looseObject({\n\ttotalResearchingQuantity: z.number().optional(),\n\tresearchingQuantityBreakdown: z.array(amazonInventoryResearchingQuantityBreakdownRawSchema).optional()\n})\n\nexport const amazonInventoryUnfulfillableQuantityRawSchema = z.looseObject({\n\ttotalUnfulfillableQuantity: z.number().optional(),\n\tcustomerDamagedQuantity: z.number().optional(),\n\twarehouseDamagedQuantity: z.number().optional(),\n\tdistributorDamagedQuantity: z.number().optional(),\n\tcarrierDamagedQuantity: z.number().optional(),\n\tdefectiveQuantity: z.number().optional(),\n\texpiredQuantity: z.number().optional()\n})\n\nexport const amazonInventoryDetailsRawSchema = z.looseObject({\n\tfulfillableQuantity: z.number().optional(),\n\tinboundWorkingQuantity: z.number().optional(),\n\tinboundShippedQuantity: z.number().optional(),\n\tinboundReceivingQuantity: z.number().optional(),\n\treservedQuantity: amazonInventoryReservedQuantityRawSchema.optional(),\n\tresearchingQuantity: amazonInventoryResearchingQuantityRawSchema.optional(),\n\tunfulfillableQuantity: amazonInventoryUnfulfillableQuantityRawSchema.optional()\n})\n\nexport const amazonInventorySummaryRawSchema = z.looseObject({\n\tasin: z.string().optional(),\n\tfnSku: z.string().optional(),\n\tsellerSku: z.string().optional(),\n\tcondition: z.string().optional(),\n\tproductName: z.string().optional(),\n\ttotalQuantity: z.number().optional(),\n\tlastUpdatedTime: z.string().optional(),\n\tstores: z.array(z.string()).optional(),\n\tinventoryDetails: amazonInventoryDetailsRawSchema.optional()\n})\n\nexport const amazonSpApiInventoryPageOutputSchema = z.object({\n\titems: z.array(amazonInventorySummaryRawSchema),\n\tnext_token: z.string().optional(),\n\trate_limit_per_second: z.number().optional(),\n\trequest_id: z.string().optional()\n})\n\nexport const amazonSpApiListInventorySummariesInputSchema = z.object({\n\tmarketplace_id: z.string().min(1).optional().describe('Marketplace id; omit to use the first configured default'),\n\tseller_skus: z.array(z.string().min(1)).max(50).optional().describe('Optional seller SKU filter (max 50)'),\n\tstart_date_time: z.string().min(1).optional().describe('ISO 8601; summaries changed after'),\n\tcursor: z.string().min(1).optional().describe('nextToken from a prior page')\n})\n\nexport const amazonSpApiInventorySummarySchema = z.object({\n\tseller_sku: z.string().optional(),\n\tasin: z.string().optional(),\n\tfn_sku: z.string().optional(),\n\tcondition: z.string().optional(),\n\ttotal_quantity: z.number().optional(),\n\tproduct_name: z.string().optional()\n})\n\nexport const amazonSpApiListInventorySummariesOutputSchema = z.object({\n\titems: z.array(amazonSpApiInventorySummarySchema),\n\tnext_cursor: z.string().optional(),\n\ttruncated: z.boolean()\n})\n\n// ─── Reports (2021-06-30) ─────────────────────────────────────────────────────\n\nexport const amazonSpApiCreateReportInputSchema = z.object({\n\treport_type: z.string().min(1).describe('Report type (e.g. GET_FLAT_FILE_OPEN_LISTINGS_DATA)'),\n\tmarketplace_ids: z\n\t\t.array(z.string().min(1))\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Marketplace ids; omit to use the configured defaults'),\n\tdata_start_time: z.string().min(1).optional().describe('ISO 8601 report data start'),\n\tdata_end_time: z.string().min(1).optional().describe('ISO 8601 report data end'),\n\treport_options: z.record(z.string(), z.string()).optional().describe('Optional report-type-specific options map')\n})\n\nexport const amazonSpApiCreateReportOutputSchema = z.object({\n\treport_id: z.string()\n})\n\nexport const amazonSpApiGetReportInputSchema = z.object({\n\treport_id: z.string().min(1).describe('Report id from createReport or listReports')\n})\n\nexport const amazonSpApiReportSchema = z.object({\n\treport_id: z.string(),\n\treport_type: z.string().optional(),\n\tprocessing_status: z.string().optional(),\n\tmarketplace_ids: z.array(z.string()).optional(),\n\tdata_start_time: z.string().optional(),\n\tdata_end_time: z.string().optional(),\n\treport_document_id: z.string().optional(),\n\tcreated_time: z.string().optional()\n})\n\nexport const amazonSpApiGetReportOutputSchema = z.object({\n\treport: amazonSpApiReportSchema\n})\n\nconst amazonSpApiListReportsInitialFields = {\n\treport_types: z.array(z.string().min(1)).min(1).max(10).describe('Filter by 1-10 report types'),\n\tprocessing_statuses: z\n\t\t.array(z.string().min(1))\n\t\t.optional()\n\t\t.describe('Filter by processing status (e.g. DONE, IN_QUEUE, IN_PROGRESS, CANCELLED, FATAL)'),\n\tmarketplace_ids: z\n\t\t.array(z.string().min(1))\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Marketplace ids filter; omit to use configured defaults when available'),\n\tpage_size: z.int().min(1).max(100).optional().describe('Page size (1-100)'),\n\tcreated_since: z.iso.datetime({ offset: true }).optional().describe('ISO 8601; reports created after'),\n\tcreated_until: z.iso.datetime({ offset: true }).optional().describe('ISO 8601; reports created before')\n}\n\nexport const amazonSpApiListReportsInitialInputSchema = z.strictObject(amazonSpApiListReportsInitialFields)\n\nconst amazonSpApiListReportsCursorInputSchema = z.strictObject({\n\tcursor: z.string().min(1).describe('nextToken from a prior page')\n})\n\nexport const amazonSpApiListReportsInputSchema = z.union([\n\tamazonSpApiListReportsInitialInputSchema,\n\tamazonSpApiListReportsCursorInputSchema\n])\n\nexport const amazonReportRawSchema = z.looseObject({\n\treportId: z.string().min(1),\n\treportType: z.string().optional(),\n\tprocessingStatus: z.string().optional(),\n\tmarketplaceIds: z.array(z.string()).optional(),\n\tdataStartTime: z.string().optional(),\n\tdataEndTime: z.string().optional(),\n\treportScheduleId: z.string().optional(),\n\tcreatedTime: z.string().optional(),\n\tprocessingStartTime: z.string().optional(),\n\tprocessingEndTime: z.string().optional(),\n\treportDocumentId: z.string().optional()\n})\n\nexport const amazonSpApiListReportsContinuationInputSchema = z.strictObject({\n\tnext_token: z.string().min(1)\n})\n\nexport const amazonSpApiListReportsPageInputSchema = z.union([\n\tamazonSpApiListReportsInitialInputSchema,\n\tamazonSpApiListReportsContinuationInputSchema\n])\n\nexport const amazonSpApiListReportsPageOutputSchema = z.object({\n\titems: z.array(amazonReportRawSchema),\n\tnext_token: z.string().optional(),\n\trate_limit_per_second: z.number().optional(),\n\trequest_id: z.string().optional()\n})\n\nexport const amazonSpApiListReportsOutputSchema = z.object({\n\titems: z.array(amazonSpApiReportSchema),\n\tnext_cursor: z.string().optional(),\n\ttruncated: z.boolean()\n})\n\nexport const amazonSpApiGetReportDocumentInputSchema = z.object({\n\treport_document_id: z.string().min(1).describe('Report document id from a completed report')\n})\n\nexport const amazonSpApiGetReportDocumentOutputSchema = z.object({\n\tdocument_id: z.string(),\n\turl: z.string(),\n\tcompression_algorithm: z.string().optional()\n})\n\nexport const amazonSpApiDownloadReportDocumentBytesInputSchema = z.strictObject({\n\treport_document_id: z.string().min(1),\n\tmax_bytes: z.int().positive()\n})\n\nexport const amazonSpApiDownloadReportDocumentBytesOutputSchema = z.object({\n\tbytes: z.custom<Uint8Array>((value) => value instanceof Uint8Array),\n\ttext: z.string(),\n\tbyte_length: z.int().nonnegative(),\n\tcontent_type: z.string().optional(),\n\tcontent_encoding: z.string().optional(),\n\tcompression_algorithm: z.enum(['GZIP']).optional()\n})\n\n// ─── Settlement summary (Flat File V2 composite) ──────────────────────────────\n\n/**\n * Composite input: pick newest completed V2 settlement report in the retention\n * window (default 90d), download one document, return eight summary fields only.\n */\nexport const amazonSpApiGetSettlementSummaryInputSchema = z.object({\n\treport_id: z\n\t\t.string()\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Optional report id; when set, uses this report instead of listing the newest DONE settlement report'),\n\tcreated_since: z\n\t\t.string()\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('ISO 8601 lower bound when listing reports (default: now minus 90 days)')\n})\n\n/** Eight summary fields only — never raw TSV rows. */\nexport const amazonSpApiSettlementSummarySchema = z.object({\n\tsettlement_id: z.string().describe('Amazon settlement id'),\n\tsettlement_start_date: z.string().describe('Settlement period start'),\n\tsettlement_end_date: z.string().describe('Settlement period end'),\n\tdeposit_date: z.string().describe('Deposit date when present; otherwise settlement end'),\n\tcurrency: z.string().describe('ISO currency code from the report'),\n\ttotal_amount_cents: z\n\t\t.number()\n\t\t.int()\n\t\t.describe('Report total-amount as safe integer cents (must equal amount_sum_cents)'),\n\tamount_sum_cents: z.number().int().describe('Sum of amount column as safe integer cents'),\n\trow_count: z.number().int().describe('Number of data rows in the TSV (excluding header)')\n})\n\nexport const amazonSpApiGetSettlementSummaryOutputSchema = amazonSpApiSettlementSummarySchema\n\n// ─── Catalog (2022-04-01) ─────────────────────────────────────────────────────\n\nexport const amazonSpApiSearchCatalogItemsInputSchema = z.object({\n\tkeywords: z.array(z.string().min(1)).min(1).describe('Search keywords'),\n\tmarketplace_ids: z\n\t\t.array(z.string().min(1))\n\t\t.min(1)\n\t\t.optional()\n\t\t.describe('Marketplace ids; omit to use the configured defaults'),\n\tincluded_data: z\n\t\t.array(z.string().min(1))\n\t\t.optional()\n\t\t.describe('Data sets to include (e.g. summaries, images, attributes)'),\n\tpage_size: z.int().min(1).max(20).optional().describe('Page size (1-20)'),\n\tcursor: z.string().min(1).optional().describe('pageToken from a prior page')\n})\n\nexport const amazonSpApiCatalogItemSchema = z.object({\n\tasin: z.string(),\n\ttitle: z.string().optional(),\n\tbrand: z.string().optional(),\n\tproduct_type: z.string().optional(),\n\tmarketplace_id: z.string().optional()\n})\n\nexport const amazonSpApiSearchCatalogItemsOutputSchema = z.object({\n\titems: z.array(amazonSpApiCatalogItemSchema),\n\tnumber_of_results: z.number().optional(),\n\tnext_cursor: z.string().optional(),\n\ttruncated: z.boolean()\n})\n\n// ─── Types ────────────────────────────────────────────────────────────────────\n\nexport type AmazonSpApiListOrdersInput = z.infer<typeof amazonSpApiListOrdersInputSchema>\nexport type AmazonSpApiListOrdersOutput = z.infer<typeof amazonSpApiListOrdersOutputSchema>\nexport type AmazonSpApiGetOrderInput = z.infer<typeof amazonSpApiGetOrderInputSchema>\nexport type AmazonSpApiGetOrderOutput = z.infer<typeof amazonSpApiGetOrderOutputSchema>\nexport type AmazonSpApiGetOrderItemsInput = z.infer<typeof amazonSpApiGetOrderItemsInputSchema>\nexport type AmazonSpApiGetOrderItemsOutput = z.infer<typeof amazonSpApiGetOrderItemsOutputSchema>\nexport type AmazonSpApiListInventorySummariesInput = z.infer<typeof amazonSpApiListInventorySummariesInputSchema>\nexport type AmazonSpApiListInventorySummariesOutput = z.infer<typeof amazonSpApiListInventorySummariesOutputSchema>\nexport type AmazonSpApiInventoryPageInput = z.infer<typeof amazonSpApiInventoryPageInputSchema>\nexport type AmazonSpApiInventoryPageOutput = z.infer<typeof amazonSpApiInventoryPageOutputSchema>\nexport type AmazonInventorySummaryRaw = z.infer<typeof amazonInventorySummaryRawSchema>\nexport type AmazonSpApiCreateReportInput = z.infer<typeof amazonSpApiCreateReportInputSchema>\nexport type AmazonSpApiCreateReportOutput = z.infer<typeof amazonSpApiCreateReportOutputSchema>\nexport type AmazonSpApiGetReportInput = z.infer<typeof amazonSpApiGetReportInputSchema>\nexport type AmazonSpApiGetReportOutput = z.infer<typeof amazonSpApiGetReportOutputSchema>\nexport type AmazonSpApiListReportsInput = z.infer<typeof amazonSpApiListReportsInputSchema>\nexport type AmazonSpApiListReportsOutput = z.infer<typeof amazonSpApiListReportsOutputSchema>\nexport type AmazonSpApiListReportsInitialInput = z.infer<typeof amazonSpApiListReportsInitialInputSchema>\nexport type AmazonSpApiListReportsContinuationInput = z.infer<typeof amazonSpApiListReportsContinuationInputSchema>\nexport type AmazonSpApiListReportsPageInput = z.infer<typeof amazonSpApiListReportsPageInputSchema>\nexport type AmazonSpApiListReportsPageOutput = z.infer<typeof amazonSpApiListReportsPageOutputSchema>\nexport type AmazonReportRaw = z.infer<typeof amazonReportRawSchema>\nexport type AmazonSpApiGetReportDocumentInput = z.infer<typeof amazonSpApiGetReportDocumentInputSchema>\nexport type AmazonSpApiGetReportDocumentOutput = z.infer<typeof amazonSpApiGetReportDocumentOutputSchema>\nexport type AmazonSpApiDownloadReportDocumentBytesInput = z.infer<\n\ttypeof amazonSpApiDownloadReportDocumentBytesInputSchema\n>\nexport type AmazonSpApiDownloadReportDocumentBytesOutput = z.infer<\n\ttypeof amazonSpApiDownloadReportDocumentBytesOutputSchema\n>\nexport type AmazonSpApiSearchCatalogItemsInput = z.infer<typeof amazonSpApiSearchCatalogItemsInputSchema>\nexport type AmazonSpApiSearchCatalogItemsOutput = z.infer<typeof amazonSpApiSearchCatalogItemsOutputSchema>\nexport type AmazonSpApiSearchOrdersInput = z.infer<typeof amazonSpApiSearchOrdersInputSchema>\nexport type AmazonSpApiSearchOrdersOutput = z.infer<typeof amazonSpApiSearchOrdersOutputSchema>\nexport type AmazonSpApiSearchOrder = z.infer<typeof amazonSpApiSearchOrderSchema>\nexport type AmazonSpApiGetSettlementSummaryInput = z.infer<typeof amazonSpApiGetSettlementSummaryInputSchema>\nexport type AmazonSpApiGetSettlementSummaryOutput = z.infer<typeof amazonSpApiGetSettlementSummaryOutputSchema>\nexport type AmazonSpApiSettlementSummary = z.infer<typeof amazonSpApiSettlementSummarySchema>\nexport type AmazonSpApiOrder = z.infer<typeof amazonSpApiOrderSchema>\nexport type AmazonSpApiOrderItem = z.infer<typeof amazonSpApiOrderItemSchema>\nexport type AmazonSpApiInventorySummary = z.infer<typeof amazonSpApiInventorySummarySchema>\nexport type AmazonSpApiReport = z.infer<typeof amazonSpApiReportSchema>\nexport type AmazonSpApiCatalogItem = z.infer<typeof amazonSpApiCatalogItemSchema>\n","/**\n * Amazon SP-API: LWA body, order/inventory/report/catalog parse (no HTTP).\n */\n\nimport { z } from 'zod'\n\nimport { ToolError } from '../../core/errors'\nimport type {\n\tAmazonSpApiCatalogItem,\n\tAmazonSpApiInventorySummary,\n\tAmazonSpApiInventoryPageOutput,\n\tAmazonSpApiListReportsPageOutput,\n\tAmazonSpApiLwaTokenResponse,\n\tAmazonSpApiOrder,\n\tAmazonSpApiOrderItem,\n\tAmazonSpApiReport,\n\tAmazonSpApiSearchOrder\n} from './contracts'\nimport { amazonInventorySummaryRawSchema, amazonReportRawSchema, amazonSpApiLwaTokenResponseSchema } from './contracts'\n\nexport const LWA_TOKEN_URL = 'https://api.amazon.com/auth/o2/token'\n\nconst amazonMoneyRawSchema = z.looseObject({\n\tAmount: z.string().optional(),\n\tCurrencyCode: z.string().optional()\n})\n\nconst amazonOrderRawSchema = z.looseObject({\n\tAmazonOrderId: z.string().min(1),\n\tOrderStatus: z.string().optional(),\n\tPurchaseDate: z.string().optional(),\n\tLastUpdateDate: z.string().optional(),\n\tMarketplaceId: z.string().optional(),\n\tOrderTotal: amazonMoneyRawSchema.optional(),\n\tFulfillmentChannel: z.string().optional()\n})\n\nconst amazonOrdersResponseSchema = z.looseObject({\n\tpayload: z.looseObject({\n\t\tOrders: z.array(amazonOrderRawSchema),\n\t\tNextToken: z.string().min(1).optional()\n\t})\n})\n\nconst amazonSearchOrderRawSchema = z.looseObject({\n\torderId: z.string().min(1),\n\tcreatedTime: z.string().optional(),\n\tfulfillment: z.looseObject({ fulfillmentStatus: z.string().optional() }).optional()\n})\n\nconst amazonSearchOrdersRootSchema = z.looseObject({\n\torders: z.array(amazonSearchOrderRawSchema),\n\tpagination: z.looseObject({ nextToken: z.string().min(1).optional() }).optional()\n})\n\nconst amazonSearchOrdersWrappedResponseSchema = z.looseObject({ payload: amazonSearchOrdersRootSchema })\n\nconst amazonOrderItemRawSchema = z.looseObject({\n\tOrderItemId: z.string().min(1),\n\tASIN: z.string().optional(),\n\tSellerSKU: z.string().optional(),\n\tTitle: z.string().optional(),\n\tQuantityOrdered: z.number().optional(),\n\tQuantityShipped: z.number().optional(),\n\tItemPrice: amazonMoneyRawSchema.optional()\n})\n\nconst amazonOrderItemsResponseSchema = z.looseObject({\n\tpayload: z.looseObject({\n\t\tAmazonOrderId: z.string().min(1),\n\t\tOrderItems: z.array(amazonOrderItemRawSchema),\n\t\tNextToken: z.string().min(1).optional()\n\t})\n})\n\nconst amazonCatalogItemRawSchema = z.looseObject({\n\tasin: z.string().min(1),\n\tsummaries: z\n\t\t.array(\n\t\t\tz.looseObject({\n\t\t\t\titemName: z.string().optional(),\n\t\t\t\tbrandName: z.string().optional(),\n\t\t\t\tmarketplaceId: z.string().optional()\n\t\t\t})\n\t\t)\n\t\t.optional(),\n\tproductTypes: z.array(z.looseObject({ productType: z.string().optional() })).optional()\n})\n\nconst amazonCatalogSearchResponseSchema = z.looseObject({\n\titems: z.array(amazonCatalogItemRawSchema),\n\tnumberOfResults: z.number().optional(),\n\tpagination: z.looseObject({ nextToken: z.string().min(1).optional() }).optional()\n})\n\nexport function lwaTokenBody(auth: { client_id: string; client_secret: string; refresh_token: string }): string {\n\tconst params = new URLSearchParams({\n\t\tgrant_type: 'refresh_token',\n\t\trefresh_token: auth.refresh_token,\n\t\tclient_id: auth.client_id,\n\t\tclient_secret: auth.client_secret\n\t})\n\treturn params.toString()\n}\n\nexport function parseLwaTokenResponse(data: unknown): AmazonSpApiLwaTokenResponse {\n\tconst parsed = amazonSpApiLwaTokenResponseSchema.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon LWA returned an invalid token response', {\n\t\t\tcode: 'bad_auth',\n\t\t\tdetails: { issues: parsed.error.issues.map((issue) => issue.message) }\n\t\t})\n\t}\n\treturn parsed.data\n}\n\nexport function parseOrder(value: unknown): AmazonSpApiOrder {\n\tconst parsed = amazonOrderRawSchema.safeParse(value)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API returned an invalid order', { code: 'upstream' })\n\t}\n\treturn {\n\t\tamazon_order_id: parsed.data.AmazonOrderId,\n\t\t...(parsed.data.OrderStatus && { order_status: parsed.data.OrderStatus }),\n\t\t...(parsed.data.PurchaseDate && { purchase_date: parsed.data.PurchaseDate }),\n\t\t...(parsed.data.LastUpdateDate && { last_update_date: parsed.data.LastUpdateDate }),\n\t\t...(parsed.data.MarketplaceId && { marketplace_id: parsed.data.MarketplaceId }),\n\t\t...(parsed.data.OrderTotal?.Amount && { order_total_amount: parsed.data.OrderTotal.Amount }),\n\t\t...(parsed.data.OrderTotal?.CurrencyCode && { order_total_currency: parsed.data.OrderTotal.CurrencyCode }),\n\t\t...(parsed.data.FulfillmentChannel && { fulfillment_channel: parsed.data.FulfillmentChannel })\n\t}\n}\n\nexport function parseOrdersPayload(data: unknown): {\n\titems: AmazonSpApiOrder[]\n\tnextToken?: string\n} {\n\tconst parsed = amazonOrdersResponseSchema.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API orders payload invalid', { code: 'upstream' })\n\t}\n\treturn {\n\t\titems: parsed.data.payload.Orders.map(parseOrder),\n\t\t...(parsed.data.payload.NextToken && { nextToken: parsed.data.payload.NextToken })\n\t}\n}\n\nexport function parseOrderPayload(data: unknown): AmazonSpApiOrder {\n\tconst parsed = z.looseObject({ payload: amazonOrderRawSchema }).safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API get order payload invalid', { code: 'upstream' })\n\t}\n\treturn parseOrder(parsed.data.payload)\n}\n\n/** Orders API v2026-01-01 SearchOrders — camelCase body, not v0 payload wrapper. */\nexport function parseSearchOrder(value: unknown): AmazonSpApiSearchOrder {\n\tconst parsed = amazonSearchOrderRawSchema.safeParse(value)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API searchOrders returned an invalid order', { code: 'upstream' })\n\t}\n\treturn {\n\t\torder_id: parsed.data.orderId,\n\t\t...(parsed.data.createdTime && { created_time: parsed.data.createdTime }),\n\t\t...(parsed.data.fulfillment?.fulfillmentStatus && {\n\t\t\tfulfillment_status: parsed.data.fulfillment.fulfillmentStatus\n\t\t})\n\t}\n}\n\nexport function parseSearchOrdersPayload(data: unknown): {\n\titems: AmazonSpApiSearchOrder[]\n\tnextToken?: string\n} {\n\tconst wrapped = amazonSearchOrdersWrappedResponseSchema.safeParse(data)\n\tconst direct = amazonSearchOrdersRootSchema.safeParse(data)\n\tconst root = wrapped.success ? wrapped.data.payload : direct.success ? direct.data : undefined\n\tif (!root) {\n\t\tthrow new ToolError('Amazon SP-API searchOrders payload invalid', { code: 'upstream' })\n\t}\n\treturn {\n\t\titems: root.orders.map(parseSearchOrder),\n\t\t...(root.pagination?.nextToken && { nextToken: root.pagination.nextToken })\n\t}\n}\n\nexport function parseOrderItem(value: unknown): AmazonSpApiOrderItem {\n\tconst parsed = amazonOrderItemRawSchema.safeParse(value)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API returned an invalid order item', { code: 'upstream' })\n\t}\n\treturn {\n\t\torder_item_id: parsed.data.OrderItemId,\n\t\t...(parsed.data.ASIN && { asin: parsed.data.ASIN }),\n\t\t...(parsed.data.SellerSKU && { seller_sku: parsed.data.SellerSKU }),\n\t\t...(parsed.data.Title && { title: parsed.data.Title }),\n\t\t...(parsed.data.QuantityOrdered !== undefined && { quantity_ordered: parsed.data.QuantityOrdered }),\n\t\t...(parsed.data.QuantityShipped !== undefined && { quantity_shipped: parsed.data.QuantityShipped }),\n\t\t...(parsed.data.ItemPrice?.Amount && { item_price_amount: parsed.data.ItemPrice.Amount }),\n\t\t...(parsed.data.ItemPrice?.CurrencyCode && { item_price_currency: parsed.data.ItemPrice.CurrencyCode })\n\t}\n}\n\nexport function parseOrderItemsPayload(data: unknown): {\n\tamazon_order_id: string\n\titems: AmazonSpApiOrderItem[]\n\tnextToken?: string\n} {\n\tconst parsed = amazonOrderItemsResponseSchema.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API order items payload invalid', { code: 'upstream' })\n\t}\n\treturn {\n\t\tamazon_order_id: parsed.data.payload.AmazonOrderId,\n\t\titems: parsed.data.payload.OrderItems.map(parseOrderItem),\n\t\t...(parsed.data.payload.NextToken && { nextToken: parsed.data.payload.NextToken })\n\t}\n}\n\nexport function parseInventorySummary(value: unknown): AmazonSpApiInventorySummary {\n\tconst parsed = amazonInventorySummaryRawSchema.safeParse(value)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API returned an invalid inventory summary', {\n\t\t\tcode: 'upstream',\n\t\t\tdetails: { issues: parsed.error.issues.map((issue) => issue.message) }\n\t\t})\n\t}\n\treturn {\n\t\t...(parsed.data.sellerSku && { seller_sku: parsed.data.sellerSku }),\n\t\t...(parsed.data.asin && { asin: parsed.data.asin }),\n\t\t...(parsed.data.fnSku && { fn_sku: parsed.data.fnSku }),\n\t\t...(parsed.data.condition && { condition: parsed.data.condition }),\n\t\t...(parsed.data.totalQuantity !== undefined && { total_quantity: parsed.data.totalQuantity }),\n\t\t...(parsed.data.productName && { product_name: parsed.data.productName })\n\t}\n}\n\nconst inventoryPageResponseSchema = z.looseObject({\n\tpayload: z.looseObject({\n\t\tinventorySummaries: z.array(amazonInventorySummaryRawSchema)\n\t}),\n\tpagination: z.looseObject({ nextToken: z.string().min(1).optional() }).optional()\n})\n\nconst optionalAmazonRateLimitSchema = z.coerce.number().positive()\n\nexport function parseAmazonResponseMetadata(headers: Headers): {\n\trate_limit_per_second?: number\n\trequest_id?: string\n} {\n\tconst rawRateLimit = headers.get('x-amzn-ratelimit-limit')\n\tlet rateLimit: number | undefined\n\tif (rawRateLimit !== null) {\n\t\tconst parsedRateLimit = optionalAmazonRateLimitSchema.safeParse(rawRateLimit)\n\t\tif (!parsedRateLimit.success) {\n\t\t\tthrow new ToolError('Amazon SP-API returned an invalid rate-limit header', { code: 'upstream' })\n\t\t}\n\t\trateLimit = parsedRateLimit.data\n\t}\n\tconst requestId = headers.get('x-amzn-requestid') ?? headers.get('x-amzn-request-id') ?? undefined\n\treturn {\n\t\t...(rateLimit !== undefined && { rate_limit_per_second: rateLimit }),\n\t\t...(requestId && { request_id: requestId })\n\t}\n}\n\nexport function parseInventoryPagePayload(data: unknown, headers: Headers): AmazonSpApiInventoryPageOutput {\n\tconst parsed = inventoryPageResponseSchema.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API inventory page response invalid', {\n\t\t\tcode: 'upstream',\n\t\t\tdetails: { issues: parsed.error.issues.map((issue) => issue.message) }\n\t\t})\n\t}\n\treturn {\n\t\titems: parsed.data.payload.inventorySummaries,\n\t\t...(parsed.data.pagination?.nextToken && { next_token: parsed.data.pagination.nextToken }),\n\t\t...parseAmazonResponseMetadata(headers)\n\t}\n}\n\nexport function parseInventoryPayload(data: unknown): {\n\titems: AmazonSpApiInventorySummary[]\n\tnextToken?: string\n} {\n\tconst page = parseInventoryPagePayload(data, new Headers())\n\treturn { items: page.items.map(parseInventorySummary), ...(page.next_token && { nextToken: page.next_token }) }\n}\n\nexport function parseCreateReportPayload(data: unknown): { report_id: string } {\n\tconst parsed = z.looseObject({ reportId: z.string().min(1) }).safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API create report response invalid', { code: 'upstream' })\n\t}\n\treturn { report_id: parsed.data.reportId }\n}\n\nexport function parseReport(value: unknown): AmazonSpApiReport {\n\tconst parsed = amazonReportRawSchema.safeParse(value)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API returned an invalid report', {\n\t\t\tcode: 'upstream',\n\t\t\tdetails: { issues: parsed.error.issues.map((issue) => issue.message) }\n\t\t})\n\t}\n\treturn {\n\t\treport_id: parsed.data.reportId,\n\t\t...(parsed.data.reportType && { report_type: parsed.data.reportType }),\n\t\t...(parsed.data.processingStatus && { processing_status: parsed.data.processingStatus }),\n\t\t...(parsed.data.marketplaceIds &&\n\t\t\tparsed.data.marketplaceIds.length > 0 && {\n\t\t\t\tmarketplace_ids: parsed.data.marketplaceIds\n\t\t\t}),\n\t\t...(parsed.data.dataStartTime && { data_start_time: parsed.data.dataStartTime }),\n\t\t...(parsed.data.dataEndTime && { data_end_time: parsed.data.dataEndTime }),\n\t\t...(parsed.data.reportDocumentId && { report_document_id: parsed.data.reportDocumentId }),\n\t\t...(parsed.data.createdTime && { created_time: parsed.data.createdTime })\n\t}\n}\n\nexport function parseGetReportPayload(data: unknown): AmazonSpApiReport {\n\treturn parseReport(data)\n}\n\nexport function parseListReportsPayload(data: unknown): {\n\titems: AmazonSpApiReport[]\n\tnextToken?: string\n} {\n\tconst page = parseListReportsPagePayload(data, new Headers())\n\treturn { items: page.items.map(parseReport), ...(page.next_token && { nextToken: page.next_token }) }\n}\n\nconst listReportsPageResponseSchema = z.looseObject({\n\treports: z.array(amazonReportRawSchema),\n\tnextToken: z.string().min(1).optional()\n})\n\nexport function parseListReportsPagePayload(data: unknown, headers: Headers): AmazonSpApiListReportsPageOutput {\n\tconst parsed = listReportsPageResponseSchema.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API list reports page response invalid', {\n\t\t\tcode: 'upstream',\n\t\t\tdetails: { issues: parsed.error.issues.map((issue) => issue.message) }\n\t\t})\n\t}\n\treturn {\n\t\titems: parsed.data.reports,\n\t\t...(parsed.data.nextToken && { next_token: parsed.data.nextToken }),\n\t\t...parseAmazonResponseMetadata(headers)\n\t}\n}\n\nexport function parseReportDocumentPayload(data: unknown): {\n\tdocument_id: string\n\turl: string\n\tcompression_algorithm?: string\n} {\n\tconst parsed = z\n\t\t.looseObject({\n\t\t\treportDocumentId: z.string().min(1),\n\t\t\turl: z.url(),\n\t\t\tcompressionAlgorithm: z.string().min(1).optional()\n\t\t})\n\t\t.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API report document response invalid', { code: 'upstream' })\n\t}\n\treturn {\n\t\tdocument_id: parsed.data.reportDocumentId,\n\t\turl: parsed.data.url,\n\t\t...(parsed.data.compressionAlgorithm && { compression_algorithm: parsed.data.compressionAlgorithm })\n\t}\n}\n\nexport function parseCatalogItem(value: unknown): AmazonSpApiCatalogItem {\n\tconst parsed = amazonCatalogItemRawSchema.safeParse(value)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API returned an invalid catalog item', { code: 'upstream' })\n\t}\n\tconst summary = parsed.data.summaries?.[0]\n\tconst productType = parsed.data.productTypes?.[0]\n\treturn {\n\t\tasin: parsed.data.asin,\n\t\t...(summary?.itemName && { title: summary.itemName }),\n\t\t...(summary?.brandName && { brand: summary.brandName }),\n\t\t...(productType?.productType && { product_type: productType.productType }),\n\t\t...(summary?.marketplaceId && { marketplace_id: summary.marketplaceId })\n\t}\n}\n\nexport function parseSearchCatalogItemsPayload(data: unknown): {\n\titems: AmazonSpApiCatalogItem[]\n\tnumberOfResults?: number\n\tnextToken?: string\n} {\n\tconst parsed = amazonCatalogSearchResponseSchema.safeParse(data)\n\tif (!parsed.success) {\n\t\tthrow new ToolError('Amazon SP-API catalog search payload invalid', { code: 'upstream' })\n\t}\n\treturn {\n\t\titems: parsed.data.items.map(parseCatalogItem),\n\t\t...(parsed.data.numberOfResults !== undefined && { numberOfResults: parsed.data.numberOfResults }),\n\t\t...(parsed.data.pagination?.nextToken && { nextToken: parsed.data.pagination.nextToken })\n\t}\n}\n\nexport function requireMarketplaceIds(\n\tinputIds: string[] | undefined,\n\tauthIds: string[] | undefined,\n\tlabel: string\n): string[] {\n\tconst ids = inputIds ?? authIds\n\tif (!ids || ids.length === 0) {\n\t\tthrow new ToolError(`${label} requires marketplace_ids on the call or auth`, { code: 'bad_input' })\n\t}\n\treturn ids\n}\n","import { createRequire } from 'module';\nvar require = createRequire('/');\n// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar _a;\n// Mediocre shim\nvar Worker;\nvar isMarkedAsUntransferable;\nvar workerAdd = \";var __w=require('worker_threads');__w.parentPort.on('message',function(m){onmessage({data:m})}),postMessage=function(m,t){__w.parentPort.postMessage(m,t)},close=process.exit;self=global\";\ntry {\n    (_a = require('worker_threads'), Worker = _a.Worker, isMarkedAsUntransferable = _a.isMarkedAsUntransferable);\n}\ncatch (e) {\n}\nvar wk = Worker ? function (c, _, msg, transfer, cb) {\n    var done = false;\n    var w = new Worker(c + workerAdd, { eval: true })\n        .on('error', function (e) { return cb(e, null); })\n        .on('message', function (m) { return cb(null, m); })\n        .on('exit', function (c) {\n        if (c && !done)\n            cb(new Error('exited with code ' + c), null);\n    });\n    if (isMarkedAsUntransferable)\n        transfer = transfer.filter(function (t) { return !isMarkedAsUntransferable(t); });\n    w.postMessage(msg, transfer);\n    w.terminate = function () {\n        done = true;\n        return Worker.prototype.terminate.call(w);\n    };\n    return w;\n} : function (_, __, ___, ____, cb) {\n    setImmediate(function () { return cb(new Error('async operations unsupported - update to Node 12+ (or Node 10-11 with the --experimental-worker CLI flag)'), null); });\n    var NOP = function () { };\n    return {\n        terminate: NOP,\n        postMessage: NOP\n    };\n};\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */ 0, 0, /* impossible */ 0]);\n// fixed distance extra bits\nvar fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */ 0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function (eb, start) {\n    var b = new u16(31);\n    for (var i = 0; i < 31; ++i) {\n        b[i] = start += 1 << eb[i - 1];\n    }\n    // numbers here are at max 18 bits\n    var r = new i32(b[30]);\n    for (var i = 1; i < 30; ++i) {\n        for (var j = b[i]; j < b[i + 1]; ++j) {\n            r[j] = ((j - b[i]) << 5) | i;\n        }\n    }\n    return { b: b, r: r };\n};\nvar _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0), fd = _b.b, revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var i = 0; i < 32768; ++i) {\n    // reverse table algorithm from SO\n    var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);\n    x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);\n    x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);\n    rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = (function (cd, mb, r) {\n    var s = cd.length;\n    // index\n    var i = 0;\n    // u16 \"map\": index -> # of codes with bit length = index\n    var l = new u16(mb);\n    // length of cd must be 288 (total # of codes)\n    for (; i < s; ++i) {\n        if (cd[i])\n            ++l[cd[i] - 1];\n    }\n    // u16 \"map\": index -> minimum code for bit length = index\n    var le = new u16(mb);\n    for (i = 1; i < mb; ++i) {\n        le[i] = (le[i - 1] + l[i - 1]) << 1;\n    }\n    var co;\n    if (r) {\n        // u16 \"map\": index -> number of actual bits, symbol for code\n        co = new u16(1 << mb);\n        // bits to remove for reverser\n        var rvb = 15 - mb;\n        for (i = 0; i < s; ++i) {\n            // ignore 0 lengths\n            if (cd[i]) {\n                // num encoding both symbol and bits read\n                var sv = (i << 4) | cd[i];\n                // free bits\n                var r_1 = mb - cd[i];\n                // start value\n                var v = le[cd[i] - 1]++ << r_1;\n                // m is end value\n                for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {\n                    // every 16 bit value starting with the code yields the same result\n                    co[rev[v] >> rvb] = sv;\n                }\n            }\n        }\n    }\n    else {\n        co = new u16(s);\n        for (i = 0; i < s; ++i) {\n            if (cd[i]) {\n                co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);\n            }\n        }\n    }\n    return co;\n});\n// fixed length tree\nvar flt = new u8(288);\nfor (var i = 0; i < 144; ++i)\n    flt[i] = 8;\nfor (var i = 144; i < 256; ++i)\n    flt[i] = 9;\nfor (var i = 256; i < 280; ++i)\n    flt[i] = 7;\nfor (var i = 280; i < 288; ++i)\n    flt[i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var i = 0; i < 32; ++i)\n    fdt[i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/ hMap(flt, 9, 0), flrm = /*#__PURE__*/ hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/ hMap(fdt, 5, 0), fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);\n// find max of array\nvar max = function (a) {\n    var m = a[0];\n    for (var i = 1; i < a.length; ++i) {\n        if (a[i] > m)\n            m = a[i];\n    }\n    return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function (d, p, m) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function (d, p) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));\n};\n// get end of byte\nvar shft = function (p) { return ((p + 7) / 8) | 0; };\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function (v, s, e) {\n    if (s == null || s < 0)\n        s = 0;\n    if (e == null || e > v.length)\n        e = v.length;\n    // can't use .constructor in case user-supplied\n    return new u8(v.subarray(s, e));\n};\n/**\n * Codes for errors generated within this library\n */\nexport var FlateErrorCode = {\n    UnexpectedEOF: 0,\n    InvalidBlockType: 1,\n    InvalidLengthLiteral: 2,\n    InvalidDistance: 3,\n    StreamFinished: 4,\n    NoStreamHandler: 5,\n    InvalidHeader: 6,\n    NoCallback: 7,\n    InvalidUTF8: 8,\n    ExtraFieldTooLong: 9,\n    InvalidDate: 10,\n    FilenameTooLong: 11,\n    StreamFinishing: 12,\n    InvalidZipData: 13,\n    UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = [\n    'unexpected EOF',\n    'invalid block type',\n    'invalid length/literal',\n    'invalid distance',\n    'stream finished',\n    'no stream handler',\n    , // determined by compression function\n    'no callback',\n    'invalid UTF-8 data',\n    'extra field too long',\n    'date not in range 1980-2099',\n    'filename too long',\n    'stream finishing',\n    'invalid zip data'\n    // determined by unknown compression method\n];\n;\nvar err = function (ind, msg, nt) {\n    var e = new Error(msg || ec[ind]);\n    e.code = ind;\n    if (Error.captureStackTrace)\n        Error.captureStackTrace(e, err);\n    if (!nt)\n        throw e;\n    return e;\n};\n// expands raw DEFLATE data\nvar inflt = function (dat, st, buf, dict) {\n    // source length       dict length\n    var sl = dat.length, dl = dict ? dict.length : 0;\n    if (!sl || st.f && !st.l)\n        return buf || new u8(0);\n    var noBuf = !buf;\n    // have to estimate size\n    var resize = noBuf || st.i != 2;\n    // no state\n    var noSt = st.i;\n    // Assumes roughly 33% compression ratio average\n    if (noBuf)\n        buf = new u8(sl * 3);\n    // ensure buffer can fit at least l elements\n    var cbuf = function (l) {\n        var bl = buf.length;\n        // need to increase size to fit\n        if (l > bl) {\n            // Double or set to necessary, whichever is greater\n            var nbuf = new u8(Math.max(bl * 2, l));\n            nbuf.set(buf);\n            buf = nbuf;\n        }\n    };\n    //  last chunk         bitpos           bytes\n    var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;\n    // total bits\n    var tbts = sl * 8;\n    do {\n        if (!lm) {\n            // BFINAL - this is only 1 when last chunk is next\n            final = bits(dat, pos, 1);\n            // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman\n            var type = bits(dat, pos + 1, 3);\n            pos += 3;\n            if (!type) {\n                // go to end of byte boundary\n                var s = shft(pos) + 4, l = dat[s - 4] | (dat[s - 3] << 8), t = s + l;\n                if (t > sl) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                // ensure size\n                if (resize)\n                    cbuf(bt + l);\n                // Copy over uncompressed data\n                buf.set(dat.subarray(s, t), bt);\n                // Get new bitpos, update byte count\n                st.b = bt += l, st.p = pos = t * 8, st.f = final;\n                continue;\n            }\n            else if (type == 1)\n                lm = flrm, dm = fdrm, lbt = 9, dbt = 5;\n            else if (type == 2) {\n                //  literal                            lengths\n                var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;\n                var tl = hLit + bits(dat, pos + 5, 31) + 1;\n                pos += 14;\n                // length+distance tree\n                var ldt = new u8(tl);\n                // code length tree\n                var clt = new u8(19);\n                for (var i = 0; i < hcLen; ++i) {\n                    // use index map to get real code\n                    clt[clim[i]] = bits(dat, pos + i * 3, 7);\n                }\n                pos += hcLen * 3;\n                // code lengths bits\n                var clb = max(clt), clbmsk = (1 << clb) - 1;\n                // code lengths map\n                var clm = hMap(clt, clb, 1);\n                for (var i = 0; i < tl;) {\n                    var r = clm[bits(dat, pos, clbmsk)];\n                    // bits read\n                    pos += r & 15;\n                    // symbol\n                    var s = r >> 4;\n                    // code length to copy\n                    if (s < 16) {\n                        ldt[i++] = s;\n                    }\n                    else {\n                        //  copy   count\n                        var c = 0, n = 0;\n                        if (s == 16)\n                            n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];\n                        else if (s == 17)\n                            n = 3 + bits(dat, pos, 7), pos += 3;\n                        else if (s == 18)\n                            n = 11 + bits(dat, pos, 127), pos += 7;\n                        while (n--)\n                            ldt[i++] = c;\n                    }\n                }\n                //    length tree                 distance tree\n                var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);\n                // max length bits\n                lbt = max(lt);\n                // max dist bits\n                dbt = max(dt);\n                lm = hMap(lt, lbt, 1);\n                dm = hMap(dt, dbt, 1);\n            }\n            else\n                err(1);\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n        }\n        // Make sure the buffer can hold this + the largest possible addition\n        // Maximum chunk size (practically, theoretically infinite) is 2^17\n        if (resize)\n            cbuf(bt + 131072);\n        var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;\n        var lpos = pos;\n        for (;; lpos = pos) {\n            // bits read, code\n            var c = lm[bits16(dat, pos) & lms], sym = c >> 4;\n            pos += c & 15;\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n            if (!c)\n                err(2);\n            if (sym < 256)\n                buf[bt++] = sym;\n            else if (sym == 256) {\n                lpos = pos, lm = null;\n                break;\n            }\n            else {\n                var add = sym - 254;\n                // no extra bits needed if less\n                if (sym > 264) {\n                    // index\n                    var i = sym - 257, b = fleb[i];\n                    add = bits(dat, pos, (1 << b) - 1) + fl[i];\n                    pos += b;\n                }\n                // dist\n                var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;\n                if (!d)\n                    err(3);\n                pos += d & 15;\n                var dt = fd[dsym];\n                if (dsym > 3) {\n                    var b = fdeb[dsym];\n                    dt += bits16(dat, pos) & (1 << b) - 1, pos += b;\n                }\n                if (pos > tbts) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                if (resize)\n                    cbuf(bt + 131072);\n                var end = bt + add;\n                if (bt < dt) {\n                    var shift = dl - dt, dend = Math.min(dt, end);\n                    if (shift + bt < 0)\n                        err(3);\n                    for (; bt < dend; ++bt)\n                        buf[bt] = dict[shift + bt];\n                }\n                for (; bt < end; ++bt)\n                    buf[bt] = buf[bt - dt];\n            }\n        }\n        st.l = lm, st.p = lpos, st.b = bt, st.f = final;\n        if (lm)\n            final = 1, st.m = lbt, st.d = dm, st.n = dbt;\n    } while (!final);\n    // don't reallocate for streams or user buffers\n    return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);\n};\n// starting at p, write the minimum number of bits that can hold v to d\nvar wbits = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n};\n// starting at p, write the minimum number of bits (>8) that can hold v to d\nvar wbits16 = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n    d[o + 2] |= v >> 16;\n};\n// creates code lengths from a frequency table\nvar hTree = function (d, mb) {\n    // Need extra info to make a tree\n    var t = [];\n    for (var i = 0; i < d.length; ++i) {\n        if (d[i])\n            t.push({ s: i, f: d[i] });\n    }\n    var s = t.length;\n    var t2 = t.slice();\n    if (!s)\n        return { t: et, l: 0 };\n    if (s == 1) {\n        var v = new u8(t[0].s + 1);\n        v[t[0].s] = 1;\n        return { t: v, l: 1 };\n    }\n    t.sort(function (a, b) { return a.f - b.f; });\n    // after i2 reaches last ind, will be stopped\n    // freq must be greater than largest possible number of symbols\n    t.push({ s: -1, f: 25001 });\n    var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;\n    t[0] = { s: -1, f: l.f + r.f, l: l, r: r };\n    // efficient algorithm from UZIP.js\n    // i0 is lookbehind, i2 is lookahead - after processing two low-freq\n    // symbols that combined have high freq, will start processing i2 (high-freq,\n    // non-composite) symbols instead\n    // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/\n    while (i1 != s - 1) {\n        l = t[t[i0].f < t[i2].f ? i0++ : i2++];\n        r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];\n        t[i1++] = { s: -1, f: l.f + r.f, l: l, r: r };\n    }\n    var maxSym = t2[0].s;\n    for (var i = 1; i < s; ++i) {\n        if (t2[i].s > maxSym)\n            maxSym = t2[i].s;\n    }\n    // code lengths\n    var tr = new u16(maxSym + 1);\n    // max bits in tree\n    var mbt = ln(t[i1 - 1], tr, 0);\n    if (mbt > mb) {\n        // more algorithms from UZIP.js\n        // TODO: find out how this code works (debt)\n        //  ind    debt\n        var i = 0, dt = 0;\n        //    left            cost\n        var lft = mbt - mb, cst = 1 << lft;\n        t2.sort(function (a, b) { return tr[b.s] - tr[a.s] || a.f - b.f; });\n        for (; i < s; ++i) {\n            var i2_1 = t2[i].s;\n            if (tr[i2_1] > mb) {\n                dt += cst - (1 << (mbt - tr[i2_1]));\n                tr[i2_1] = mb;\n            }\n            else\n                break;\n        }\n        dt >>= lft;\n        while (dt > 0) {\n            var i2_2 = t2[i].s;\n            if (tr[i2_2] < mb)\n                dt -= 1 << (mb - tr[i2_2]++ - 1);\n            else\n                ++i;\n        }\n        for (; i >= 0 && dt; --i) {\n            var i2_3 = t2[i].s;\n            if (tr[i2_3] == mb) {\n                --tr[i2_3];\n                ++dt;\n            }\n        }\n        mbt = mb;\n    }\n    return { t: new u8(tr), l: mbt };\n};\n// get the max length and assign length codes\nvar ln = function (n, l, d) {\n    return n.s == -1\n        ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1))\n        : (l[n.s] = d);\n};\n// length codes generation\nvar lc = function (c) {\n    var s = c.length;\n    // Note that the semicolon was intentional\n    while (s && !c[--s])\n        ;\n    var cl = new u16(++s);\n    //  ind      num         streak\n    var cli = 0, cln = c[0], cls = 1;\n    var w = function (v) { cl[cli++] = v; };\n    for (var i = 1; i <= s; ++i) {\n        if (c[i] == cln && i != s)\n            ++cls;\n        else {\n            if (!cln && cls > 2) {\n                for (; cls > 138; cls -= 138)\n                    w(32754);\n                if (cls > 2) {\n                    w(cls > 10 ? ((cls - 11) << 5) | 28690 : ((cls - 3) << 5) | 12305);\n                    cls = 0;\n                }\n            }\n            else if (cls > 3) {\n                w(cln), --cls;\n                for (; cls > 6; cls -= 6)\n                    w(8304);\n                if (cls > 2)\n                    w(((cls - 3) << 5) | 8208), cls = 0;\n            }\n            while (cls--)\n                w(cln);\n            cls = 1;\n            cln = c[i];\n        }\n    }\n    return { c: cl.subarray(0, cli), n: s };\n};\n// calculate the length of output from tree, code lengths\nvar clen = function (cf, cl) {\n    var l = 0;\n    for (var i = 0; i < cl.length; ++i)\n        l += cf[i] * cl[i];\n    return l;\n};\n// writes a fixed block\n// returns the new bit pos\nvar wfblk = function (out, pos, dat) {\n    // no need to write 00 as type: TypedArray defaults to 0\n    var s = dat.length;\n    var o = shft(pos + 2);\n    out[o] = s & 255;\n    out[o + 1] = s >> 8;\n    out[o + 2] = out[o] ^ 255;\n    out[o + 3] = out[o + 1] ^ 255;\n    for (var i = 0; i < s; ++i)\n        out[o + i + 4] = dat[i];\n    return (o + 4 + s) * 8;\n};\n// writes a block\nvar wblk = function (dat, out, final, syms, lf, df, eb, li, bs, bl, p) {\n    wbits(out, p++, final);\n    ++lf[256];\n    var _a = hTree(lf, 15), dlt = _a.t, mlb = _a.l;\n    var _b = hTree(df, 15), ddt = _b.t, mdb = _b.l;\n    var _c = lc(dlt), lclt = _c.c, nlc = _c.n;\n    var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;\n    var lcfreq = new u16(19);\n    for (var i = 0; i < lclt.length; ++i)\n        ++lcfreq[lclt[i] & 31];\n    for (var i = 0; i < lcdt.length; ++i)\n        ++lcfreq[lcdt[i] & 31];\n    var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;\n    var nlcc = 19;\n    for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)\n        ;\n    var flen = (bl + 5) << 3;\n    var ftlen = clen(lf, flt) + clen(df, fdt) + eb;\n    var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];\n    if (bs >= 0 && flen <= ftlen && flen <= dtlen)\n        return wfblk(out, p, dat.subarray(bs, bs + bl));\n    var lm, ll, dm, dl;\n    wbits(out, p, 1 + (dtlen < ftlen)), p += 2;\n    if (dtlen < ftlen) {\n        lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;\n        var llm = hMap(lct, mlcb, 0);\n        wbits(out, p, nlc - 257);\n        wbits(out, p + 5, ndc - 1);\n        wbits(out, p + 10, nlcc - 4);\n        p += 14;\n        for (var i = 0; i < nlcc; ++i)\n            wbits(out, p + 3 * i, lct[clim[i]]);\n        p += 3 * nlcc;\n        var lcts = [lclt, lcdt];\n        for (var it = 0; it < 2; ++it) {\n            var clct = lcts[it];\n            for (var i = 0; i < clct.length; ++i) {\n                var len = clct[i] & 31;\n                wbits(out, p, llm[len]), p += lct[len];\n                if (len > 15)\n                    wbits(out, p, (clct[i] >> 5) & 127), p += clct[i] >> 12;\n            }\n        }\n    }\n    else {\n        lm = flm, ll = flt, dm = fdm, dl = fdt;\n    }\n    for (var i = 0; i < li; ++i) {\n        var sym = syms[i];\n        if (sym > 255) {\n            var len = (sym >> 18) & 31;\n            wbits16(out, p, lm[len + 257]), p += ll[len + 257];\n            if (len > 7)\n                wbits(out, p, (sym >> 23) & 31), p += fleb[len];\n            var dst = sym & 31;\n            wbits16(out, p, dm[dst]), p += dl[dst];\n            if (dst > 3)\n                wbits16(out, p, (sym >> 5) & 8191), p += fdeb[dst];\n        }\n        else {\n            wbits16(out, p, lm[sym]), p += ll[sym];\n        }\n    }\n    wbits16(out, p, lm[256]);\n    return p + ll[256];\n};\n// deflate options (nice << 13) | chain\nvar deo = /*#__PURE__*/ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);\n// empty\nvar et = /*#__PURE__*/ new u8(0);\n// compresses data into a raw DEFLATE buffer\nvar dflt = function (dat, lvl, plvl, pre, post, st) {\n    var s = st.z || dat.length;\n    var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);\n    // writing to this writes to the output buffer\n    var w = o.subarray(pre, o.length - post);\n    var lst = st.l;\n    var pos = (st.r || 0) & 7;\n    if (lvl) {\n        if (pos)\n            w[0] = st.r >> 3;\n        var opt = deo[lvl - 1];\n        var n = opt >> 13, c = opt & 8191;\n        var msk_1 = (1 << plvl) - 1;\n        //    prev 2-byte val map    curr 2-byte val map\n        var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);\n        var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;\n        var hsh = function (i) { return (dat[i] ^ (dat[i + 1] << bs1_1) ^ (dat[i + 2] << bs2_1)) & msk_1; };\n        // 24576 is an arbitrary number of maximum symbols per block\n        // 424 buffer for last block\n        var syms = new i32(25000);\n        // length/literal freq   distance freq\n        var lf = new u16(288), df = new u16(32);\n        //  l/lcnt  exbits  index          l/lind  waitdx          blkpos\n        var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;\n        for (; i + 2 < s; ++i) {\n            // hash value\n            var hv = hsh(i);\n            // index mod 32768    previous index mod\n            var imod = i & 32767, pimod = head[hv];\n            prev[imod] = pimod;\n            head[hv] = imod;\n            // We always should modify head and prev, but only add symbols if\n            // this data is not yet processed (\"wait\" for wait index)\n            if (wi <= i) {\n                // bytes remaining\n                var rem = s - i;\n                if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {\n                    pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);\n                    li = lc_1 = eb = 0, bs = i;\n                    for (var j = 0; j < 286; ++j)\n                        lf[j] = 0;\n                    for (var j = 0; j < 30; ++j)\n                        df[j] = 0;\n                }\n                //  len    dist   chain\n                var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;\n                if (rem > 2 && hv == hsh(i - dif)) {\n                    var maxn = Math.min(n, rem) - 1;\n                    var maxd = Math.min(32767, i);\n                    // max possible length\n                    // not capped at dif because decompressors implement \"rolling\" index population\n                    var ml = Math.min(258, rem);\n                    while (dif <= maxd && --ch_1 && imod != pimod) {\n                        if (dat[i + l] == dat[i + l - dif]) {\n                            var nl = 0;\n                            for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)\n                                ;\n                            if (nl > l) {\n                                l = nl, d = dif;\n                                // break out early when we reach \"nice\" (we are satisfied enough)\n                                if (nl > maxn)\n                                    break;\n                                // now, find the rarest 2-byte sequence within this\n                                // length of literals and search for that instead.\n                                // Much faster than just using the start\n                                var mmd = Math.min(dif, nl - 2);\n                                var md = 0;\n                                for (var j = 0; j < mmd; ++j) {\n                                    var ti = i - dif + j & 32767;\n                                    var pti = prev[ti];\n                                    var cd = ti - pti & 32767;\n                                    if (cd > md)\n                                        md = cd, pimod = ti;\n                                }\n                            }\n                        }\n                        // check the previous match\n                        imod = pimod, pimod = prev[imod];\n                        dif += imod - pimod & 32767;\n                    }\n                }\n                // d will be nonzero only when a match was found\n                if (d) {\n                    // store both dist and len data in one int32\n                    // Make sure this is recognized as a len/dist with 28th bit (2^28)\n                    syms[li++] = 268435456 | (revfl[l] << 18) | revfd[d];\n                    var lin = revfl[l] & 31, din = revfd[d] & 31;\n                    eb += fleb[lin] + fdeb[din];\n                    ++lf[257 + lin];\n                    ++df[din];\n                    wi = i + l;\n                    ++lc_1;\n                }\n                else {\n                    syms[li++] = dat[i];\n                    ++lf[dat[i]];\n                }\n            }\n        }\n        for (i = Math.max(i, wi); i < s; ++i) {\n            syms[li++] = dat[i];\n            ++lf[dat[i]];\n        }\n        pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);\n        if (!lst) {\n            st.r = (pos & 7) | w[(pos / 8) | 0] << 3;\n            // shft(pos) now 1 less if pos & 7 != 0\n            pos -= 7;\n            st.h = head, st.p = prev, st.i = i, st.w = wi;\n        }\n    }\n    else {\n        for (var i = st.w || 0; i < s + lst; i += 65535) {\n            // end\n            var e = i + 65535;\n            if (e >= s) {\n                // write final block\n                w[(pos / 8) | 0] = lst;\n                e = s;\n            }\n            pos = wfblk(w, pos + 1, dat.subarray(i, e));\n        }\n        st.i = s;\n    }\n    return slc(o, 0, pre + shft(pos) + post);\n};\n// CRC32 table\nvar crct = /*#__PURE__*/ (function () {\n    var t = new Int32Array(256);\n    for (var i = 0; i < 256; ++i) {\n        var c = i, k = 9;\n        while (--k)\n            c = ((c & 1) && -306674912) ^ (c >>> 1);\n        t[i] = c;\n    }\n    return t;\n})();\n// CRC32\nvar crc = function () {\n    var c = -1;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var cr = c;\n            for (var i = 0; i < d.length; ++i)\n                cr = crct[(cr & 255) ^ d[i]] ^ (cr >>> 8);\n            c = cr;\n        },\n        d: function () { return ~c; }\n    };\n};\n// Adler32\nvar adler = function () {\n    var a = 1, b = 0;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var n = a, m = b;\n            var l = d.length | 0;\n            for (var i = 0; i != l;) {\n                var e = Math.min(i + 2655, l);\n                for (; i < e; ++i)\n                    m += n += d[i];\n                n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);\n            }\n            a = n, b = m;\n        },\n        d: function () {\n            a %= 65521, b %= 65521;\n            return (a & 255) << 24 | (a & 0xFF00) << 8 | (b & 255) << 8 | (b >> 8);\n        }\n    };\n};\n;\n// deflate with opts\nvar dopt = function (dat, opt, pre, post, st) {\n    if (!st) {\n        st = { l: 1 };\n        if (opt.dictionary) {\n            var dict = opt.dictionary.subarray(-32768);\n            var newDat = new u8(dict.length + dat.length);\n            newDat.set(dict);\n            newDat.set(dat, dict.length);\n            dat = newDat;\n            st.w = dict.length;\n        }\n    }\n    return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? (st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20) : (12 + opt.mem), pre, post, st);\n};\n// Walmart object spread\nvar mrg = function (a, b) {\n    var o = {};\n    for (var k in a)\n        o[k] = a[k];\n    for (var k in b)\n        o[k] = b[k];\n    return o;\n};\n// worker clone\n// This is possibly the craziest part of the entire codebase, despite how simple it may seem.\n// The only parameter to this function is a closure that returns an array of variables outside of the function scope.\n// We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.\n// We will return an object mapping of true variable name to value (basically, the current scope as a JS object).\n// The reason we can't just use the original variable names is minifiers mangling the toplevel scope.\n// This took me three weeks to figure out how to do.\nvar wcln = function (fn, fnStr, td) {\n    var dt = fn();\n    var st = fn.toString();\n    var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/\\s+/g, '').split(',');\n    for (var i = 0; i < dt.length; ++i) {\n        var v = dt[i], k = ks[i];\n        if (typeof v == 'function') {\n            fnStr += ';' + k + '=';\n            var st_1 = v.toString();\n            if (v.prototype) {\n                // for global objects\n                if (st_1.indexOf('[native code]') != -1) {\n                    var spInd = st_1.indexOf(' ', 8) + 1;\n                    fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));\n                }\n                else {\n                    fnStr += st_1;\n                    for (var t in v.prototype)\n                        fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();\n                }\n            }\n            else\n                fnStr += st_1;\n        }\n        else\n            td[k] = v;\n    }\n    return fnStr;\n};\nvar ch = [];\n// clone bufs\nvar cbfs = function (v) {\n    var tl = [];\n    for (var k in v) {\n        if (v[k].buffer) {\n            tl.push((v[k] = new v[k].constructor(v[k])).buffer);\n        }\n    }\n    return tl;\n};\n// use a worker to execute code\nvar wrkr = function (fns, init, id, cb) {\n    if (!ch[id]) {\n        var fnStr = '', td_1 = {}, m = fns.length - 1;\n        for (var i = 0; i < m; ++i)\n            fnStr = wcln(fns[i], fnStr, td_1);\n        ch[id] = { c: wcln(fns[m], fnStr, td_1), e: td_1 };\n    }\n    var td = mrg({}, ch[id].e);\n    return wk(ch[id].c + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);\n};\n// base async inflate fn\nvar bInflt = function () { return [u8, u16, i32, fleb, fdeb, clim, fl, fd, flrm, fdrm, rev, ec, hMap, max, bits, bits16, shft, slc, err, inflt, inflateSync, pbf, gopt]; };\nvar bDflt = function () { return [u8, u16, i32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf]; };\n// gzip extra\nvar gze = function () { return [gzh, gzhl, wbytes, crc, crct]; };\n// gunzip extra\nvar guze = function () { return [gzs, gzl]; };\n// zlib extra\nvar zle = function () { return [zlh, wbytes, adler]; };\n// unzlib extra\nvar zule = function () { return [zls]; };\n// post buf\nvar pbf = function (msg) { return postMessage(msg, [msg.buffer]); };\n// get opts\nvar gopt = function (o) { return o && {\n    out: o.size && new u8(o.size),\n    dictionary: o.dictionary\n}; };\n// async helper\nvar cbify = function (dat, opts, fns, init, id, cb) {\n    var w = wrkr(fns, init, id, function (err, dat) {\n        w.terminate();\n        cb(err, dat);\n    });\n    w.postMessage([dat, opts], opts.consume ? [dat.buffer] : []);\n    return function () { w.terminate(); };\n};\n// auto stream\nvar astrm = function (strm) {\n    strm.ondata = function (dat, final) { return postMessage([dat, final], [dat.buffer]); };\n    return function (ev) {\n        if (ev.data[0]) {\n            strm.push(ev.data[0], ev.data[1]);\n            postMessage([ev.data[0].length]);\n        }\n        else\n            strm.flush(ev.data[1]);\n    };\n};\n// async stream attach\nvar astrmify = function (fns, strm, opts, init, id, flush, ext) {\n    var t;\n    var w = wrkr(fns, init, id, function (err, dat) {\n        if (err)\n            w.terminate(), strm.ondata.call(strm, err);\n        else if (!Array.isArray(dat))\n            ext(dat);\n        else if (dat.length == 1) {\n            strm.queuedSize -= dat[0];\n            if (strm.ondrain)\n                strm.ondrain(dat[0]);\n        }\n        else {\n            if (dat[1])\n                w.terminate();\n            strm.ondata.call(strm, err, dat[0], dat[1]);\n        }\n    });\n    w.postMessage(opts);\n    strm.queuedSize = 0;\n    strm.push = function (d, f) {\n        if (!strm.ondata)\n            err(5);\n        if (t)\n            strm.ondata(err(4, 0, 1), null, !!f);\n        strm.queuedSize += d.length;\n        // can fail for cross-realm Uint8Array, but ok - only a small performance penalty\n        w.postMessage([d, t = f], d.buffer instanceof ArrayBuffer ? [d.buffer] : []);\n    };\n    strm.terminate = function () { w.terminate(); };\n    if (flush) {\n        strm.flush = function (sync) { w.postMessage([0, sync]); };\n    }\n};\n// read 2 bytes\nvar b2 = function (d, b) { return d[b] | (d[b + 1] << 8); };\n// read 4 bytes\nvar b4 = function (d, b) { return (d[b] | (d[b + 1] << 8) | (d[b + 2] << 16) | (d[b + 3] << 24)) >>> 0; };\n// read 8 bytes\nvar b8 = function (d, b) { return b4(d, b) + (b4(d, b + 4) * 4294967296); };\n// write bytes\nvar wbytes = function (d, b, v) {\n    for (; v; ++b)\n        d[b] = v, v >>>= 8;\n};\n// gzip header\nvar gzh = function (c, o) {\n    var fn = o.filename;\n    c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix\n    if (o.mtime != 0)\n        wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));\n    if (fn) {\n        c[3] = 8;\n        for (var i = 0; i <= fn.length; ++i)\n            c[i + 10] = fn.charCodeAt(i);\n    }\n};\n// gzip footer: -8 to -4 = CRC, -4 to -0 is length\n// gzip start\nvar gzs = function (d) {\n    if (d[0] != 31 || d[1] != 139 || d[2] != 8)\n        err(6, 'invalid gzip data');\n    var flg = d[3];\n    var st = 10;\n    if (flg & 4)\n        st += (d[10] | d[11] << 8) + 2;\n    for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++])\n        ;\n    return st + (flg & 2);\n};\n// gzip length\nvar gzl = function (d) {\n    var l = d.length;\n    return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;\n};\n// gzip header length\nvar gzhl = function (o) { return 10 + (o.filename ? o.filename.length + 1 : 0); };\n// zlib header\nvar zlh = function (c, o) {\n    var lv = o.level, fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;\n    c[0] = 120, c[1] = (fl << 6) | (o.dictionary && 32);\n    c[1] |= 31 - ((c[0] << 8) | c[1]) % 31;\n    if (o.dictionary) {\n        var h = adler();\n        h.p(o.dictionary);\n        wbytes(c, 2, h.d());\n    }\n};\n// zlib start\nvar zls = function (d, dict) {\n    if ((d[0] & 15) != 8 || (d[0] >> 4) > 7 || ((d[0] << 8 | d[1]) % 31))\n        err(6, 'invalid zlib data');\n    if ((d[1] >> 5 & 1) == +!dict)\n        err(6, 'invalid zlib data: ' + (d[1] & 32 ? 'need' : 'unexpected') + ' dictionary');\n    return (d[1] >> 3 & 4) + 2;\n};\nfunction StrmOpt(opts, cb) {\n    if (typeof opts == 'function')\n        cb = opts, opts = {};\n    this.ondata = cb;\n    return opts;\n}\n/**\n * Streaming DEFLATE compression\n */\nvar Deflate = /*#__PURE__*/ (function () {\n    function Deflate(opts, cb) {\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        this.o = opts || {};\n        this.s = { l: 0, i: 32768, w: 32768, z: 32768 };\n        // Buffer length must always be 0 mod 32768 for index calculations to be correct when modifying head and prev\n        // 98304 = 32768 (lookback) + 65536 (common chunk size)\n        this.b = new u8(98304);\n        if (this.o.dictionary) {\n            var dict = this.o.dictionary.subarray(-32768);\n            this.b.set(dict, 32768 - dict.length);\n            this.s.i = 32768 - dict.length;\n        }\n    }\n    Deflate.prototype.p = function (c, f) {\n        this.ondata(dopt(c, this.o, 0, 0, this.s), f);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Deflate.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        var endLen = chunk.length + this.s.z;\n        if (endLen > this.b.length) {\n            if (endLen > 2 * this.b.length - 32768) {\n                var newBuf = new u8(endLen & -32768);\n                newBuf.set(this.b.subarray(0, this.s.z));\n                this.b = newBuf;\n            }\n            var split = this.b.length - this.s.z;\n            this.b.set(chunk.subarray(0, split), this.s.z);\n            this.s.z = this.b.length;\n            this.p(this.b, false);\n            this.b.set(this.b.subarray(-32768));\n            this.b.set(chunk.subarray(split), 32768);\n            this.s.z = chunk.length - split + 32768;\n            this.s.i = 32766, this.s.w = 32768;\n        }\n        else {\n            this.b.set(chunk, this.s.z);\n            this.s.z += chunk.length;\n        }\n        this.s.l = final & 1;\n        if (this.s.z > this.s.w + 8191 || final) {\n            this.p(this.b, final || false);\n            this.s.w = this.s.i, this.s.i -= 2;\n        }\n        if (final) {\n            // cleanup unneeded buffers/state to reduce memory usage\n            this.s = this.o = {};\n            this.b = et;\n        }\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * deflated output for small inputs.\n     * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n     *             extra bytes, but guarantees all pushed data is immediately\n     *             decompressible. A separate DEFLATE stream may be concatenated\n     *             with the current output after a sync flush.\n     */\n    Deflate.prototype.flush = function (sync) {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        this.p(this.b, false);\n        this.s.w = this.s.i, this.s.i -= 2;\n        // could technically skip writing the type-0 block for (this.s.r & 7) == 0,\n        // but the deterministic trailer (00 00 FF FF) is useful in some situations\n        if (sync) {\n            var c = new u8(6);\n            c[0] = this.s.r >> 3;\n            // write empty, non-final type-0 block\n            var ep = wfblk(c, this.s.r, et);\n            this.s.r = 0;\n            this.ondata(c.subarray(0, ep >> 3), false);\n        }\n    };\n    return Deflate;\n}());\nexport { Deflate };\n/**\n * Asynchronous streaming DEFLATE compression\n */\nvar AsyncDeflate = /*#__PURE__*/ (function () {\n    function AsyncDeflate(opts, cb) {\n        astrmify([\n            bDflt,\n            function () { return [astrm, Deflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Deflate(ev.data);\n            onmessage = astrm(strm);\n        }, 6, 1);\n    }\n    return AsyncDeflate;\n}());\nexport { AsyncDeflate };\nexport function deflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n    ], function (ev) { return pbf(deflateSync(ev.data[0], ev.data[1])); }, 0, cb);\n}\n/**\n * Compresses data with DEFLATE without any wrapper\n * @param data The data to compress\n * @param opts The compression options\n * @returns The deflated version of the data\n */\nexport function deflateSync(data, opts) {\n    return dopt(data, opts || {}, 0, 0);\n}\n/**\n * Streaming DEFLATE decompression\n */\nvar Inflate = /*#__PURE__*/ (function () {\n    function Inflate(opts, cb) {\n        // no StrmOpt here to avoid adding to workerizer\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        var dict = opts && opts.dictionary && opts.dictionary.subarray(-32768);\n        this.s = { i: 0, b: dict ? dict.length : 0 };\n        this.o = new u8(32768);\n        this.p = new u8(0);\n        if (dict)\n            this.o.set(dict);\n    }\n    Inflate.prototype.e = function (c) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        if (!this.p.length)\n            this.p = c;\n        else if (c.length) {\n            var n = new u8(this.p.length + c.length);\n            n.set(this.p), n.set(c, this.p.length), this.p = n;\n        }\n    };\n    Inflate.prototype.c = function (final) {\n        this.s.i = +(this.d = final || false);\n        var bts = this.s.b;\n        var dt = inflt(this.p, this.s, this.o);\n        this.ondata(slc(dt, bts, this.s.b), this.d);\n        this.o = slc(dt, this.s.b - 32768), this.s.b = this.o.length;\n        this.p = slc(this.p, (this.s.p / 8) | 0), this.s.p &= 7;\n    };\n    /**\n     * Pushes a chunk to be inflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the final chunk\n     */\n    Inflate.prototype.push = function (chunk, final) {\n        this.e(chunk), this.c(final);\n    };\n    return Inflate;\n}());\nexport { Inflate };\n/**\n * Asynchronous streaming DEFLATE decompression\n */\nvar AsyncInflate = /*#__PURE__*/ (function () {\n    function AsyncInflate(opts, cb) {\n        astrmify([\n            bInflt,\n            function () { return [astrm, Inflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Inflate(ev.data);\n            onmessage = astrm(strm);\n        }, 7, 0);\n    }\n    return AsyncInflate;\n}());\nexport { AsyncInflate };\nexport function inflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt\n    ], function (ev) { return pbf(inflateSync(ev.data[0], gopt(ev.data[1]))); }, 1, cb);\n}\nexport function inflateSync(data, opts) {\n    return inflt(data, { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// before you yell at me for not just using extends, my reason is that TS inheritance is hard to workerize.\n/**\n * Streaming GZIP compression\n */\nvar Gzip = /*#__PURE__*/ (function () {\n    function Gzip(opts, cb) {\n        this.c = crc();\n        this.l = 0;\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gzip.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        this.l += chunk.length;\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Gzip.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && gzhl(this.o), f && 8, this.s);\n        if (this.v)\n            gzh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 8, this.c.d()), wbytes(raw, raw.length - 4, this.l);\n        this.ondata(raw, f);\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * GZIPped output for small inputs.\n     * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n     *             extra bytes, but guarantees all pushed data is immediately\n     *             decompressible.\n     */\n    Gzip.prototype.flush = function (sync) {\n        Deflate.prototype.flush.call(this, sync);\n    };\n    return Gzip;\n}());\nexport { Gzip };\n/**\n * Asynchronous streaming GZIP compression\n */\nvar AsyncGzip = /*#__PURE__*/ (function () {\n    function AsyncGzip(opts, cb) {\n        astrmify([\n            bDflt,\n            gze,\n            function () { return [astrm, Deflate, Gzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gzip(ev.data);\n            onmessage = astrm(strm);\n        }, 8, 1);\n    }\n    return AsyncGzip;\n}());\nexport { AsyncGzip };\nexport function gzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        gze,\n        function () { return [gzipSync]; }\n    ], function (ev) { return pbf(gzipSync(ev.data[0], ev.data[1])); }, 2, cb);\n}\n/**\n * Compresses data with GZIP\n * @param data The data to compress\n * @param opts The compression options\n * @returns The gzipped version of the data\n */\nexport function gzipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var c = crc(), l = data.length;\n    c.p(data);\n    var d = dopt(data, opts, gzhl(opts), 8), s = d.length;\n    return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;\n}\n/**\n * Streaming single or multi-member GZIP decompression\n */\nvar Gunzip = /*#__PURE__*/ (function () {\n    function Gunzip(opts, cb) {\n        this.v = 1;\n        this.r = 0;\n        Inflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GUNZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gunzip.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        this.r += chunk.length;\n        if (this.v) {\n            var p = this.p.subarray(this.v - 1);\n            var s = p.length > 3 ? gzs(p) : 4;\n            if (s > p.length) {\n                if (!final)\n                    return;\n            }\n            else if (this.v > 1 && this.onmember) {\n                this.onmember(this.r - p.length);\n            }\n            this.p = p.subarray(s), this.v = 0;\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, 0);\n        // process concatenated GZIP\n        if (this.s.f && !this.s.l) {\n            this.v = shft(this.s.p) + 9;\n            this.s = { i: 0 };\n            this.o = new u8(0);\n            this.push(new u8(0), final);\n        }\n        else if (final) {\n            Inflate.prototype.c.call(this, final);\n        }\n    };\n    return Gunzip;\n}());\nexport { Gunzip };\n/**\n * Asynchronous streaming single or multi-member GZIP decompression\n */\nvar AsyncGunzip = /*#__PURE__*/ (function () {\n    function AsyncGunzip(opts, cb) {\n        var _this = this;\n        astrmify([\n            bInflt,\n            guze,\n            function () { return [astrm, Inflate, Gunzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gunzip(ev.data);\n            strm.onmember = function (offset) { return postMessage(offset); };\n            onmessage = astrm(strm);\n        }, 9, 0, function (offset) { return _this.onmember && _this.onmember(offset); });\n    }\n    return AsyncGunzip;\n}());\nexport { AsyncGunzip };\nexport function gunzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        guze,\n        function () { return [gunzipSync]; }\n    ], function (ev) { return pbf(gunzipSync(ev.data[0], ev.data[1])); }, 3, cb);\n}\nexport function gunzipSync(data, opts) {\n    var st = gzs(data);\n    if (st + 8 > data.length)\n        err(6, 'invalid gzip data');\n    return inflt(data.subarray(st, -8), { i: 2 }, opts && opts.out || new u8(gzl(data)), opts && opts.dictionary);\n}\n/**\n * Streaming Zlib compression\n */\nvar Zlib = /*#__PURE__*/ (function () {\n    function Zlib(opts, cb) {\n        this.c = adler();\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be zlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Zlib.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Zlib.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && (this.o.dictionary ? 6 : 2), f && 4, this.s);\n        if (this.v)\n            zlh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 4, this.c.d());\n        this.ondata(raw, f);\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * zlibbed output for small inputs.\n     * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n     *             extra bytes, but guarantees all pushed data is immediately\n     *             decompressible.\n     */\n    Zlib.prototype.flush = function (sync) {\n        Deflate.prototype.flush.call(this, sync);\n    };\n    return Zlib;\n}());\nexport { Zlib };\n/**\n * Asynchronous streaming Zlib compression\n */\nvar AsyncZlib = /*#__PURE__*/ (function () {\n    function AsyncZlib(opts, cb) {\n        astrmify([\n            bDflt,\n            zle,\n            function () { return [astrm, Deflate, Zlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Zlib(ev.data);\n            onmessage = astrm(strm);\n        }, 10, 1);\n    }\n    return AsyncZlib;\n}());\nexport { AsyncZlib };\nexport function zlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        zle,\n        function () { return [zlibSync]; }\n    ], function (ev) { return pbf(zlibSync(ev.data[0], ev.data[1])); }, 4, cb);\n}\n/**\n * Compress data with Zlib\n * @param data The data to compress\n * @param opts The compression options\n * @returns The zlib-compressed version of the data\n */\nexport function zlibSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var a = adler();\n    a.p(data);\n    var d = dopt(data, opts, opts.dictionary ? 6 : 2, 4);\n    return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;\n}\n/**\n * Streaming Zlib decompression\n */\nvar Unzlib = /*#__PURE__*/ (function () {\n    function Unzlib(opts, cb) {\n        Inflate.call(this, opts, cb);\n        this.v = opts && opts.dictionary ? 2 : 1;\n    }\n    /**\n     * Pushes a chunk to be unzlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzlib.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        if (this.v) {\n            if (this.p.length < 6 && !final)\n                return;\n            this.p = this.p.subarray(zls(this.p, this.v - 1)), this.v = 0;\n        }\n        if (final) {\n            if (this.p.length < 4)\n                err(6, 'invalid zlib data');\n            this.p = this.p.subarray(0, -4);\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n    };\n    return Unzlib;\n}());\nexport { Unzlib };\n/**\n * Asynchronous streaming Zlib decompression\n */\nvar AsyncUnzlib = /*#__PURE__*/ (function () {\n    function AsyncUnzlib(opts, cb) {\n        astrmify([\n            bInflt,\n            zule,\n            function () { return [astrm, Inflate, Unzlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Unzlib(ev.data);\n            onmessage = astrm(strm);\n        }, 11, 0);\n    }\n    return AsyncUnzlib;\n}());\nexport { AsyncUnzlib };\nexport function unzlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        zule,\n        function () { return [unzlibSync]; }\n    ], function (ev) { return pbf(unzlibSync(ev.data[0], gopt(ev.data[1]))); }, 5, cb);\n}\nexport function unzlibSync(data, opts) {\n    return inflt(data.subarray(zls(data, opts && opts.dictionary), -4), { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// Default algorithm for compression (used because having a known output size allows faster decompression)\nexport { gzip as compress, AsyncGzip as AsyncCompress };\nexport { gzipSync as compressSync, Gzip as Compress };\n/**\n * Streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar Decompress = /*#__PURE__*/ (function () {\n    function Decompress(opts, cb) {\n        this.o = StrmOpt.call(this, opts, cb) || {};\n        this.G = Gunzip;\n        this.I = Inflate;\n        this.Z = Unzlib;\n    }\n    // init substream\n    // overriden by AsyncDecompress\n    Decompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (dat, final) {\n            _this.ondata(dat, final);\n        };\n    };\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Decompress.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (!this.s) {\n            if (this.p && this.p.length) {\n                var n = new u8(this.p.length + chunk.length);\n                n.set(this.p), n.set(chunk, this.p.length);\n            }\n            else\n                this.p = chunk;\n            if (this.p.length > 2) {\n                this.s = (this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8)\n                    ? new this.G(this.o)\n                    : ((this.p[0] & 15) != 8 || (this.p[0] >> 4) > 7 || ((this.p[0] << 8 | this.p[1]) % 31))\n                        ? new this.I(this.o)\n                        : new this.Z(this.o);\n                this.i();\n                this.s.push(this.p, final);\n                this.p = null;\n            }\n        }\n        else\n            this.s.push(chunk, final);\n    };\n    return Decompress;\n}());\nexport { Decompress };\n/**\n * Asynchronous streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar AsyncDecompress = /*#__PURE__*/ (function () {\n    function AsyncDecompress(opts, cb) {\n        Decompress.call(this, opts, cb);\n        this.queuedSize = 0;\n        this.G = AsyncGunzip;\n        this.I = AsyncInflate;\n        this.Z = AsyncUnzlib;\n    }\n    AsyncDecompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        };\n        this.s.ondrain = function (size) {\n            _this.queuedSize -= size;\n            if (_this.ondrain)\n                _this.ondrain(size);\n        };\n    };\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncDecompress.prototype.push = function (chunk, final) {\n        this.queuedSize += chunk.length;\n        Decompress.prototype.push.call(this, chunk, final);\n    };\n    return AsyncDecompress;\n}());\nexport { AsyncDecompress };\nexport function decompress(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzip(data, opts, cb)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflate(data, opts, cb)\n            : unzlib(data, opts, cb);\n}\n/**\n * Expands compressed GZIP, Zlib, or raw DEFLATE data, automatically detecting the format\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function decompressSync(data, opts) {\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzipSync(data, opts)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflateSync(data, opts)\n            : unzlibSync(data, opts);\n}\n// flatten a directory structure\nvar fltn = function (d, p, t, o) {\n    for (var k in d) {\n        var val = d[k], n = p + k, op = o;\n        if (Array.isArray(val))\n            op = mrg(o, val[1]), val = val[0];\n        if (ArrayBuffer.isView(val))\n            t[n] = [val, op];\n        else {\n            t[n += '/'] = [new u8(0), op];\n            fltn(val, n, t, o);\n        }\n    }\n};\n// text encoder\nvar te = typeof TextEncoder != 'undefined' && /*#__PURE__*/ new TextEncoder();\n// text decoder\nvar td = typeof TextDecoder != 'undefined' && /*#__PURE__*/ new TextDecoder();\n// text decoder stream\nvar tds = 0;\ntry {\n    td.decode(et, { stream: true });\n    tds = 1;\n}\ncatch (e) { }\n// decode UTF8\nvar dutf8 = function (d) {\n    for (var r = '', i = 0;;) {\n        var c = d[i++];\n        var eb = (c > 127) + (c > 223) + (c > 239);\n        if (i + eb > d.length)\n            return { s: r, r: slc(d, i - 1) };\n        if (!eb)\n            r += String.fromCharCode(c);\n        else if (eb == 3) {\n            c = ((c & 15) << 18 | (d[i++] & 63) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63)) - 65536,\n                r += String.fromCharCode(55296 | (c >> 10), 56320 | (c & 1023));\n        }\n        else if (eb & 1)\n            r += String.fromCharCode((c & 31) << 6 | (d[i++] & 63));\n        else\n            r += String.fromCharCode((c & 15) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63));\n    }\n};\n/**\n * Streaming UTF-8 decoding\n */\nvar DecodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is decoded\n     */\n    function DecodeUTF8(cb) {\n        this.ondata = cb;\n        if (tds)\n            this.t = new TextDecoder();\n        else\n            this.p = et;\n    }\n    /**\n     * Pushes a chunk to be decoded from UTF-8 binary\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    DecodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        final = !!final;\n        if (this.t) {\n            this.ondata(this.t.decode(chunk, { stream: true }), final);\n            if (final) {\n                if (this.t.decode().length)\n                    err(8);\n                this.t = null;\n            }\n            return;\n        }\n        if (!this.p)\n            err(4);\n        var dat = new u8(this.p.length + chunk.length);\n        dat.set(this.p);\n        dat.set(chunk, this.p.length);\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (final) {\n            if (r.length)\n                err(8);\n            this.p = null;\n        }\n        else\n            this.p = r;\n        this.ondata(s, final);\n    };\n    return DecodeUTF8;\n}());\nexport { DecodeUTF8 };\n/**\n * Streaming UTF-8 encoding\n */\nvar EncodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is encoded\n     */\n    function EncodeUTF8(cb) {\n        this.ondata = cb;\n    }\n    /**\n     * Pushes a chunk to be encoded to UTF-8\n     * @param chunk The string data to push\n     * @param final Whether this is the last chunk\n     */\n    EncodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        this.ondata(strToU8(chunk), this.d = final || false);\n    };\n    return EncodeUTF8;\n}());\nexport { EncodeUTF8 };\n/**\n * Converts a string into a Uint8Array for use with compression/decompression methods\n * @param str The string to encode\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless decoding a binary string.\n * @returns The string encoded in UTF-8/Latin-1 binary\n */\nexport function strToU8(str, latin1) {\n    if (latin1) {\n        var ar_1 = new u8(str.length);\n        for (var i = 0; i < str.length; ++i)\n            ar_1[i] = str.charCodeAt(i);\n        return ar_1;\n    }\n    if (te)\n        return te.encode(str);\n    var l = str.length;\n    var ar = new u8(str.length + (str.length >> 1));\n    var ai = 0;\n    var w = function (v) { ar[ai++] = v; };\n    for (var i = 0; i < l; ++i) {\n        if (ai + 5 > ar.length) {\n            var n = new u8(ai + 8 + ((l - i) << 1));\n            n.set(ar);\n            ar = n;\n        }\n        var c = str.charCodeAt(i);\n        if (c < 128 || latin1)\n            w(c);\n        else if (c < 2048)\n            w(192 | (c >> 6)), w(128 | (c & 63));\n        else if (c > 55295 && c < 57344)\n            c = 65536 + (c & 1023 << 10) | (str.charCodeAt(++i) & 1023),\n                w(240 | (c >> 18)), w(128 | ((c >> 12) & 63)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n        else\n            w(224 | (c >> 12)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n    }\n    return slc(ar, 0, ai);\n}\n/**\n * Converts a Uint8Array to a string\n * @param dat The data to decode to string\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless encoding to binary string.\n * @returns The original UTF-8/Latin-1 string\n */\nexport function strFromU8(dat, latin1) {\n    if (latin1) {\n        var r = '';\n        for (var i = 0; i < dat.length; i += 16384)\n            r += String.fromCharCode.apply(null, dat.subarray(i, i + 16384));\n        return r;\n    }\n    else if (td) {\n        return td.decode(dat);\n    }\n    else {\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (r.length)\n            err(8);\n        return s;\n    }\n}\n;\n// deflate bit flag\nvar dbf = function (l) { return l == 1 ? 3 : l < 6 ? 2 : l == 9 ? 1 : 0; };\n// skip local zip header\nvar slzh = function (d, b) { return b + 30 + b2(d, b + 26) + b2(d, b + 28); };\n// read zip header\nvar zh = function (d, b, z) {\n    var fnl = b2(d, b + 28), efl = b2(d, b + 30), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl;\n    var _a = z64hs(d, es, efl, z, b4(d, b + 20), b4(d, b + 24), b4(d, b + 42)), sc = _a[0], su = _a[1], off = _a[2];\n    return [b2(d, b + 10), sc, su, fn, es + efl + b2(d, b + 32), off];\n};\n// read zip64 header sizes\nvar z64hs = function (d, b, l, z, sc, su, off) {\n    var nsc = sc == 4294967295, nsu = su == 4294967295, noff = off == 4294967295, e = b + l;\n    var nf = nsc + nsu + noff;\n    if (z && nf) {\n        for (; b + 4 < e; b += 4 + b2(d, b + 2)) {\n            if (b2(d, b) == 1) {\n                return [\n                    nsc ? b8(d, b + 4 + 8 * nsu) : sc,\n                    nsu ? b8(d, b + 4) : su,\n                    noff ? b8(d, b + 4 + 8 * (nsu + nsc)) : off,\n                    1\n                ];\n            }\n        }\n        // z == 2 for unknown whether or not zip64\n        if (z < 2)\n            err(13);\n    }\n    return [sc, su, off, 0];\n};\n// extra field length\nvar exfl = function (ex) {\n    var le = 0;\n    if (ex) {\n        for (var k in ex) {\n            var l = ex[k].length;\n            if (l > 65535)\n                err(9);\n            le += l + 4;\n        }\n    }\n    return le;\n};\n// write zip header\nvar wzh = function (d, b, f, fn, u, c, ce, co) {\n    var fl = fn.length, ex = f.extra, col = co && co.length;\n    var exl = exfl(ex);\n    wbytes(d, b, ce != null ? 0x2014B50 : 0x4034B50), b += 4;\n    if (ce != null)\n        d[b++] = 20, d[b++] = f.os;\n    d[b] = 20, b += 2; // spec compliance? what's that?\n    d[b++] = (f.flag << 1) | (c < 0 && 8), d[b++] = u && 8;\n    d[b++] = f.compression & 255, d[b++] = f.compression >> 8;\n    var dt = new Date(f.mtime == null ? Date.now() : f.mtime), y = dt.getFullYear() - 1980;\n    if (y < 0 || y > 119)\n        err(10);\n    wbytes(d, b, (y << 25) | ((dt.getMonth() + 1) << 21) | (dt.getDate() << 16) | (dt.getHours() << 11) | (dt.getMinutes() << 5) | (dt.getSeconds() >> 1)), b += 4;\n    if (c != -1) {\n        wbytes(d, b, f.crc);\n        wbytes(d, b + 4, c < 0 ? -c - 2 : c);\n        wbytes(d, b + 8, f.size);\n    }\n    wbytes(d, b + 12, fl);\n    wbytes(d, b + 14, exl), b += 16;\n    if (ce != null) {\n        wbytes(d, b, col);\n        wbytes(d, b + 6, f.attrs);\n        wbytes(d, b + 10, ce), b += 14;\n    }\n    d.set(fn, b);\n    b += fl;\n    if (exl) {\n        for (var k in ex) {\n            var exf = ex[k], l = exf.length;\n            wbytes(d, b, +k);\n            wbytes(d, b + 2, l);\n            d.set(exf, b + 4), b += 4 + l;\n        }\n    }\n    if (col)\n        d.set(co, b), b += col;\n    return b;\n};\n// write zip footer (end of central directory)\nvar wzf = function (o, b, c, d, e) {\n    wbytes(o, b, 0x6054B50); // skip disk\n    wbytes(o, b + 8, c);\n    wbytes(o, b + 10, c);\n    wbytes(o, b + 12, d);\n    wbytes(o, b + 16, e);\n};\n/**\n * A pass-through stream to keep data uncompressed in a ZIP archive.\n */\nvar ZipPassThrough = /*#__PURE__*/ (function () {\n    /**\n     * Creates a pass-through stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     */\n    function ZipPassThrough(filename) {\n        this.filename = filename;\n        this.c = crc();\n        this.size = 0;\n        this.compression = 0;\n    }\n    /**\n     * Processes a chunk and pushes to the output stream. You can override this\n     * method in a subclass for custom behavior, but by default this passes\n     * the data through. You must call this.ondata(err, chunk, final) at some\n     * point in this method.\n     * @param chunk The chunk to process\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.process = function (chunk, final) {\n        this.ondata(null, chunk, final);\n    };\n    /**\n     * Pushes a chunk to be added. If you are subclassing this with a custom\n     * compression algorithm, note that you must push data from the source\n     * file only, pre-compression.\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        this.c.p(chunk);\n        this.size += chunk.length;\n        if (final)\n            this.crc = this.c.d();\n        // we shouldn't really do this cast, but properly handling ArrayBufferLike\n        // makes the API unergonomic with Buffer\n        this.process(chunk, final || false);\n    };\n    return ZipPassThrough;\n}());\nexport { ZipPassThrough };\n// I don't extend because TypeScript extension adds 1kB of runtime bloat\n/**\n * Streaming DEFLATE compression for ZIP archives. Prefer using AsyncZipDeflate\n * for better performance\n */\nvar ZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function ZipDeflate(filename, opts) {\n        var _this = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new Deflate(opts, function (dat, final) {\n            _this.ondata(null, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n    }\n    ZipDeflate.prototype.process = function (chunk, final) {\n        try {\n            this.d.push(chunk, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return ZipDeflate;\n}());\nexport { ZipDeflate };\n/**\n * Asynchronous streaming DEFLATE compression for ZIP archives\n */\nvar AsyncZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates an asynchronous DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function AsyncZipDeflate(filename, opts) {\n        var _this = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new AsyncDeflate(opts, function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n        this.terminate = this.d.terminate;\n    }\n    AsyncZipDeflate.prototype.process = function (chunk, final) {\n        this.d.push(chunk, final);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return AsyncZipDeflate;\n}());\nexport { AsyncZipDeflate };\n// TODO: Better tree shaking\n/**\n * A zippable archive to which files can incrementally be added\n */\nvar Zip = /*#__PURE__*/ (function () {\n    /**\n     * Creates an empty ZIP archive to which files can be added\n     * @param cb The callback to call whenever data for the generated ZIP archive\n     *           is available\n     */\n    function Zip(cb) {\n        this.ondata = cb;\n        this.u = [];\n        this.d = 1;\n    }\n    /**\n     * Adds a file to the ZIP archive\n     * @param file The file stream to add\n     */\n    Zip.prototype.add = function (file) {\n        var _this = this;\n        if (!this.ondata)\n            err(5);\n        // finishing or finished\n        if (this.d & 2)\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, false);\n        else {\n            var f = strToU8(file.filename), fl_1 = f.length;\n            var com = file.comment, o = com && strToU8(com);\n            var u = fl_1 != file.filename.length || (o && (com.length != o.length));\n            var hl_1 = fl_1 + exfl(file.extra) + 30;\n            if (fl_1 > 65535)\n                this.ondata(err(11, 0, 1), null, false);\n            var header = new u8(hl_1);\n            wzh(header, 0, file, f, u, -1);\n            var chks_1 = [header];\n            var pAll_1 = function () {\n                for (var _i = 0, chks_2 = chks_1; _i < chks_2.length; _i++) {\n                    var chk = chks_2[_i];\n                    _this.ondata(null, chk, false);\n                }\n                chks_1 = [];\n            };\n            var tr_1 = this.d;\n            this.d = 0;\n            var ind_1 = this.u.length;\n            var uf_1 = mrg(file, {\n                f: f,\n                u: u,\n                o: o,\n                t: function () {\n                    if (file.terminate)\n                        file.terminate();\n                },\n                r: function () {\n                    pAll_1();\n                    if (tr_1) {\n                        var nxt = _this.u[ind_1 + 1];\n                        if (nxt)\n                            nxt.r();\n                        else\n                            _this.d = 1;\n                    }\n                    tr_1 = 1;\n                }\n            });\n            var cl_1 = 0;\n            file.ondata = function (err, dat, final) {\n                if (err) {\n                    _this.ondata(err, dat, final);\n                    _this.terminate();\n                }\n                else {\n                    cl_1 += dat.length;\n                    chks_1.push(dat);\n                    if (final) {\n                        var dd = new u8(16);\n                        wbytes(dd, 0, 0x8074B50);\n                        wbytes(dd, 4, file.crc);\n                        wbytes(dd, 8, cl_1);\n                        wbytes(dd, 12, file.size);\n                        chks_1.push(dd);\n                        uf_1.c = cl_1, uf_1.b = hl_1 + cl_1 + 16, uf_1.crc = file.crc, uf_1.size = file.size;\n                        if (tr_1)\n                            uf_1.r();\n                        tr_1 = 1;\n                    }\n                    else if (tr_1)\n                        pAll_1();\n                }\n            };\n            this.u.push(uf_1);\n        }\n    };\n    /**\n     * Ends the process of adding files and prepares to emit the final chunks.\n     * This *must* be called after adding all desired files for the resulting\n     * ZIP file to work properly.\n     */\n    Zip.prototype.end = function () {\n        var _this = this;\n        if (this.d & 2) {\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, true);\n            return;\n        }\n        if (this.d)\n            this.e();\n        else\n            this.u.push({\n                r: function () {\n                    if (!(_this.d & 1))\n                        return;\n                    _this.u.splice(-1, 1);\n                    _this.e();\n                },\n                t: function () { }\n            });\n        this.d = 3;\n    };\n    Zip.prototype.e = function () {\n        var bt = 0, l = 0, tl = 0;\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            tl += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0);\n        }\n        var out = new u8(tl + 22);\n        for (var _b = 0, _c = this.u; _b < _c.length; _b++) {\n            var f = _c[_b];\n            wzh(out, bt, f, f.f, f.u, -f.c - 2, l, f.o);\n            bt += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0), l += f.b;\n        }\n        wzf(out, bt, this.u.length, tl, l);\n        this.ondata(null, out, true);\n        this.d = 2;\n    };\n    /**\n     * A method to terminate any internal workers used by the stream. Subsequent\n     * calls to add() will fail.\n     */\n    Zip.prototype.terminate = function () {\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            f.t();\n        }\n        this.d = 2;\n    };\n    return Zip;\n}());\nexport { Zip };\nexport function zip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var r = {};\n    fltn(data, '', r, opts);\n    var k = Object.keys(r);\n    var lft = k.length, o = 0, tot = 0;\n    var slft = lft, files = new Array(lft);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var cbf = function () {\n        var out = new u8(tot + 22), oe = o, cdl = tot - o;\n        tot = 0;\n        for (var i = 0; i < slft; ++i) {\n            var f = files[i];\n            try {\n                var l = f.c.length;\n                wzh(out, tot, f, f.f, f.u, l);\n                var badd = 30 + f.f.length + exfl(f.extra);\n                var loc = tot + badd;\n                out.set(f.c, loc);\n                wzh(out, o, f, f.f, f.u, l, tot, f.m), o += 16 + badd + (f.m ? f.m.length : 0), tot = loc + l;\n            }\n            catch (e) {\n                return cbd(e, null);\n            }\n        }\n        wzf(out, o, files.length, cdl, oe);\n        cbd(null, out);\n    };\n    if (!lft)\n        cbf();\n    var _loop_1 = function (i) {\n        var fn = k[i];\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var c = crc(), size = file.length;\n        c.p(file);\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        var compression = p.level == 0 ? 0 : 8;\n        var cbl = function (e, d) {\n            if (e) {\n                tAll();\n                cbd(e, null);\n            }\n            else {\n                var l = d.length;\n                files[i] = mrg(p, {\n                    size: size,\n                    crc: c.d(),\n                    c: d,\n                    f: f,\n                    m: m,\n                    u: s != fn.length || (m && (com.length != ms)),\n                    compression: compression\n                });\n                o += 30 + s + exl + l;\n                tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n                if (!--lft)\n                    cbf();\n            }\n        };\n        if (s > 65535)\n            cbl(err(11, 0, 1), null);\n        if (!compression)\n            cbl(null, file);\n        else if (size < 160000) {\n            try {\n                cbl(null, deflateSync(file, p));\n            }\n            catch (e) {\n                cbl(e, null);\n            }\n        }\n        else\n            term.push(deflate(file, p, cbl));\n    };\n    // Cannot use lft because it can decrease\n    for (var i = 0; i < slft; ++i) {\n        _loop_1(i);\n    }\n    return tAll;\n}\n/**\n * Synchronously creates a ZIP file. Prefer using `zip` for better performance\n * with more than one file.\n * @param data The directory structure for the ZIP archive\n * @param opts The main options, merged with per-file options\n * @returns The generated ZIP archive\n */\nexport function zipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var r = {};\n    var files = [];\n    fltn(data, '', r, opts);\n    var o = 0;\n    var tot = 0;\n    for (var fn in r) {\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var compression = p.level == 0 ? 0 : 8;\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        if (s > 65535)\n            err(11);\n        var d = compression ? deflateSync(file, p) : file, l = d.length;\n        var c = crc();\n        c.p(file);\n        files.push(mrg(p, {\n            size: file.length,\n            crc: c.d(),\n            c: d,\n            f: f,\n            m: m,\n            u: s != fn.length || (m && (com.length != ms)),\n            o: o,\n            compression: compression\n        }));\n        o += 30 + s + exl + l;\n        tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n    }\n    var out = new u8(tot + 22), oe = o, cdl = tot - o;\n    for (var i = 0; i < files.length; ++i) {\n        var f = files[i];\n        wzh(out, f.o, f, f.f, f.u, f.c.length);\n        var badd = 30 + f.f.length + exfl(f.extra);\n        out.set(f.c, f.o + badd);\n        wzh(out, o, f, f.f, f.u, f.c.length, f.o, f.m), o += 16 + badd + (f.m ? f.m.length : 0);\n    }\n    wzf(out, o, files.length, cdl, oe);\n    return out;\n}\n/**\n * Streaming pass-through decompression for ZIP archives\n */\nvar UnzipPassThrough = /*#__PURE__*/ (function () {\n    function UnzipPassThrough() {\n    }\n    UnzipPassThrough.prototype.push = function (chunk, final) {\n        // same as ZipPassThrough: cast to retain Buffer ergonomics\n        this.ondata(null, chunk, final);\n    };\n    UnzipPassThrough.compression = 0;\n    return UnzipPassThrough;\n}());\nexport { UnzipPassThrough };\n/**\n * Streaming DEFLATE decompression for ZIP archives. Prefer AsyncZipInflate for\n * better performance.\n */\nvar UnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function UnzipInflate() {\n        var _this = this;\n        this.i = new Inflate(function (dat, final) {\n            _this.ondata(null, dat, final);\n        });\n    }\n    UnzipInflate.prototype.push = function (chunk, final) {\n        try {\n            this.i.push(chunk, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    UnzipInflate.compression = 8;\n    return UnzipInflate;\n}());\nexport { UnzipInflate };\n/**\n * Asynchronous streaming DEFLATE decompression for ZIP archives\n */\nvar AsyncUnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function AsyncUnzipInflate(_, sz) {\n        var _this = this;\n        if (sz < 320000) {\n            this.i = new Inflate(function (dat, final) {\n                _this.ondata(null, dat, final);\n            });\n        }\n        else {\n            this.i = new AsyncInflate(function (err, dat, final) {\n                _this.ondata(err, dat, final);\n            });\n            this.terminate = this.i.terminate;\n        }\n    }\n    AsyncUnzipInflate.prototype.push = function (chunk, final) {\n        if (this.i.terminate)\n            chunk = slc(chunk, 0);\n        this.i.push(chunk, final);\n    };\n    AsyncUnzipInflate.compression = 8;\n    return AsyncUnzipInflate;\n}());\nexport { AsyncUnzipInflate };\n/**\n * A ZIP archive decompression stream that emits files as they are discovered\n */\nvar Unzip = /*#__PURE__*/ (function () {\n    /**\n     * Creates a ZIP decompression stream\n     * @param cb The callback to call whenever a file in the ZIP archive is found\n     */\n    function Unzip(cb) {\n        this.onfile = cb;\n        this.k = [];\n        this.o = {\n            0: UnzipPassThrough\n        };\n        this.p = et;\n    }\n    /**\n     * Pushes a chunk to be unzipped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzip.prototype.push = function (chunk, final) {\n        var _this = this;\n        if (!this.onfile)\n            err(5);\n        if (!this.p)\n            err(4);\n        if (this.c > 0) {\n            var len = Math.min(this.c, chunk.length);\n            var toAdd = chunk.subarray(0, len);\n            this.c -= len;\n            if (this.d)\n                this.d.push(toAdd, !this.c);\n            else\n                this.k[0].push(toAdd);\n            chunk = chunk.subarray(len);\n            if (chunk.length)\n                return this.push(chunk, final);\n        }\n        else {\n            var f = 0, i = 0, is = void 0, buf = void 0;\n            if (!this.p.length)\n                buf = chunk;\n            else if (!chunk.length)\n                buf = this.p;\n            else {\n                buf = new u8(this.p.length + chunk.length);\n                buf.set(this.p), buf.set(chunk, this.p.length);\n            }\n            var l = buf.length, oc = this.c, add = oc && this.d;\n            var _loop_2 = function () {\n                var sig = b4(buf, i);\n                if (sig == 0x4034B50) {\n                    f = 1, is = i;\n                    this_1.d = null;\n                    this_1.c = 0;\n                    var bf = b2(buf, i + 6), cmp_1 = b2(buf, i + 8), u = bf & 2048, dd = bf & 8, fnl = b2(buf, i + 26), es = b2(buf, i + 28);\n                    if (l > i + 30 + fnl + es) {\n                        var chks_3 = [];\n                        this_1.k.unshift(chks_3);\n                        f = 2;\n                        var lsc = b4(buf, i + 18), lsu = b4(buf, i + 22);\n                        var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n                        var _a = z64hs(buf, i, es, 2, lsc, lsu, 0), sc_1 = _a[0], su_1 = _a[1], z64 = _a[3];\n                        if (dd)\n                            sc_1 = -1 - z64;\n                        i += es;\n                        this_1.c = sc_1;\n                        var d_1;\n                        var file_1 = {\n                            name: fn_1,\n                            compression: cmp_1,\n                            start: function () {\n                                if (!file_1.ondata)\n                                    err(5);\n                                if (!sc_1)\n                                    file_1.ondata(null, et, true);\n                                else {\n                                    var ctr = _this.o[cmp_1];\n                                    if (!ctr)\n                                        file_1.ondata(err(14, 'unknown compression type ' + cmp_1, 1), null, false);\n                                    d_1 = sc_1 < 0 ? new ctr(fn_1) : new ctr(fn_1, sc_1, su_1);\n                                    d_1.ondata = function (err, dat, final) { file_1.ondata(err, dat, final); };\n                                    for (var _i = 0, chks_4 = chks_3; _i < chks_4.length; _i++) {\n                                        var dat = chks_4[_i];\n                                        d_1.push(dat, false);\n                                    }\n                                    if (_this.k[0] == chks_3 && _this.c)\n                                        _this.d = d_1;\n                                    else\n                                        d_1.push(et, true);\n                                }\n                            },\n                            terminate: function () {\n                                if (d_1 && d_1.terminate)\n                                    d_1.terminate();\n                            }\n                        };\n                        if (sc_1 >= 0)\n                            file_1.size = sc_1, file_1.originalSize = su_1;\n                        this_1.onfile(file_1);\n                    }\n                    return \"break\";\n                }\n                else if (oc) {\n                    if (sig == 0x8074B50) {\n                        is = i += 12 + (oc == -2 && 8), f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                    else if (sig == 0x2014B50) {\n                        is = i -= 4, f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                }\n            };\n            var this_1 = this;\n            for (; i < l - 4; ++i) {\n                var state_1 = _loop_2();\n                if (state_1 === \"break\")\n                    break;\n            }\n            this.p = et;\n            if (oc < 0) {\n                var dat = f ? buf.subarray(0, is - 12 - (oc == -2 && 8) - (b4(buf, is - 16) == 0x8074B50 && 4)) : buf.subarray(0, i);\n                if (add)\n                    add.push(dat, !!f);\n                else\n                    this.k[+(f == 2)].push(dat);\n            }\n            if (f & 2)\n                return this.push(buf.subarray(i), final);\n            this.p = buf.subarray(i);\n        }\n        if (final) {\n            if (this.c)\n                err(13);\n            this.p = null;\n        }\n    };\n    /**\n     * Registers a decoder with the stream, allowing for files compressed with\n     * the compression type provided to be expanded correctly\n     * @param decoder The decoder constructor\n     */\n    Unzip.prototype.register = function (decoder) {\n        this.o[decoder.compression] = decoder;\n    };\n    return Unzip;\n}());\nexport { Unzip };\nvar mt = typeof queueMicrotask == 'function' ? queueMicrotask : typeof setTimeout == 'function' ? setTimeout : function (fn) { fn(); };\nexport function unzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var files = {};\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558) {\n            cbd(err(13, 0, 1), null);\n            return tAll;\n        }\n    }\n    ;\n    var lft = b2(data, e + 8);\n    if (lft) {\n        var c = lft;\n        var o = b4(data, e + 16);\n        var z = b4(data, e - 20) == 0x7064B50;\n        if (z) {\n            var ze = b4(data, e - 12);\n            z = b4(data, ze) == 0x6064B50;\n            if (z) {\n                c = lft = b4(data, ze + 32);\n                o = b4(data, ze + 48);\n            }\n        }\n        var fltr = opts && opts.filter;\n        var _loop_3 = function (i) {\n            var _a = zh(data, o, z), c_1 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n            o = no;\n            var cbl = function (e, d) {\n                if (e) {\n                    tAll();\n                    cbd(e, null);\n                }\n                else {\n                    if (d)\n                        files[fn] = d;\n                    if (!--lft)\n                        cbd(null, files);\n                }\n            };\n            if (!fltr || fltr({\n                name: fn,\n                size: sc,\n                originalSize: su,\n                compression: c_1\n            })) {\n                if (!c_1)\n                    cbl(null, slc(data, b, b + sc));\n                else if (c_1 == 8) {\n                    var infl = data.subarray(b, b + sc);\n                    // Synchronously decompress under 512KB, or barely-compressed data\n                    if (su < 524288 || sc > 0.8 * su) {\n                        try {\n                            cbl(null, inflateSync(infl, { out: new u8(su) }));\n                        }\n                        catch (e) {\n                            cbl(e, null);\n                        }\n                    }\n                    else\n                        term.push(inflate(infl, { size: su }, cbl));\n                }\n                else\n                    cbl(err(14, 'unknown compression type ' + c_1, 1), null);\n            }\n            else\n                cbl(null, null);\n        };\n        for (var i = 0; i < c; ++i) {\n            _loop_3(i);\n        }\n    }\n    else\n        cbd(null, {});\n    return tAll;\n}\n/**\n * Synchronously decompresses a ZIP archive. Prefer using `unzip` for better\n * performance with more than one file.\n * @param data The raw compressed ZIP file\n * @param opts The ZIP extraction options\n * @returns The decompressed files\n */\nexport function unzipSync(data, opts) {\n    var files = {};\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558)\n            err(13);\n    }\n    ;\n    var c = b2(data, e + 8);\n    if (!c)\n        return {};\n    var o = b4(data, e + 16);\n    var z = b4(data, e - 20) == 0x7064B50;\n    if (z) {\n        var ze = b4(data, e - 12);\n        z = b4(data, ze) == 0x6064B50;\n        if (z) {\n            c = b4(data, ze + 32);\n            o = b4(data, ze + 48);\n        }\n    }\n    var fltr = opts && opts.filter;\n    for (var i = 0; i < c; ++i) {\n        var _a = zh(data, o, z), c_2 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n        o = no;\n        if (!fltr || fltr({\n            name: fn,\n            size: sc,\n            originalSize: su,\n            compression: c_2\n        })) {\n            if (!c_2)\n                files[fn] = slc(data, b, b + sc);\n            else if (c_2 == 8)\n                files[fn] = inflateSync(data.subarray(b, b + sc), { out: new u8(su) });\n            else\n                err(14, 'unknown compression type ' + c_2);\n        }\n    }\n    return files;\n}\n","import { gunzipSync } from 'fflate'\n\nimport { ToolError } from '../../../core/errors'\n\nfunction reportDocumentError(message: string, code: 'too_large' | 'unsupported' | 'upstream'): never {\n\tthrow new ToolError(message, { code })\n}\n\nexport function decompressReportDocumentBytes(\n\tbytes: Uint8Array,\n\tcompressionAlgorithm: string | undefined,\n\tmaxBytes: number\n): Uint8Array {\n\tif (bytes.byteLength > maxBytes) {\n\t\treportDocumentError('Amazon report document exceeds max_bytes', 'too_large')\n\t}\n\tif (!compressionAlgorithm) return bytes\n\tif (compressionAlgorithm.toUpperCase() !== 'GZIP') {\n\t\treportDocumentError(`Unsupported Amazon report compression: ${compressionAlgorithm}`, 'unsupported')\n\t}\n\ttry {\n\t\tconst output = gunzipSync(bytes, { out: new Uint8Array(maxBytes + 1) })\n\t\tif (output.byteLength > maxBytes) {\n\t\t\treportDocumentError('Amazon report document exceeds max_bytes after decompression', 'too_large')\n\t\t}\n\t\treturn output.slice()\n\t} catch (error) {\n\t\tif (error instanceof ToolError) throw error\n\t\treportDocumentError('Failed to decompress Amazon report document', 'upstream')\n\t}\n}\n","/**\n * Amazon settlement report V2 (GET_V2_SETTLEMENT_REPORT_DATA_FLAT_FILE_V2).\n * TSV via papaparse; money via decimal.js. Never put raw row PII in errors/output.\n */\n\nimport Decimal from 'decimal.js'\nimport Papa from 'papaparse'\n\nimport { ToolError } from '../../../core/errors'\nimport type { AmazonSpApiSettlementSummary } from '../contracts'\nimport { decompressReportDocumentBytes } from './report-document'\n\n/** Report type for Flat File V2 Settlement (auto-scheduled by Amazon). */\nexport const SETTLEMENT_REPORT_TYPE_V2 = 'GET_V2_SETTLEMENT_REPORT_DATA_FLAT_FILE_V2'\n\n/** How far back listReports looks for completed settlement reports. */\nexport const SETTLEMENT_RETENTION_DAYS = 90\n\n/** Max compressed document body (bytes). */\nexport const SETTLEMENT_MAX_COMPRESSED_BYTES = 16 * 1024 * 1024\n\n/** Max decompressed TSV body (bytes). */\nexport const SETTLEMENT_MAX_DECOMPRESSED_BYTES = 64 * 1024 * 1024\n\n/** Max data rows (excluding header). */\nexport const SETTLEMENT_MAX_ROWS = 250_000\n\n/** Required V2 header names (order free after parse; extra trailing columns OK). */\nexport const SETTLEMENT_V2_REQUIRED_COLUMNS = [\n\t'settlement-id',\n\t'settlement-start-date',\n\t'settlement-end-date',\n\t'deposit-date',\n\t'total-amount',\n\t'currency',\n\t'amount'\n] as const\n\ntype SettlementRow = Record<string, string | undefined>\n\nfunction settlementError(\n\tmessage: string,\n\tcode: 'bad_input' | 'upstream' | 'too_large' | 'not_found' | 'unsupported' = 'upstream'\n): never {\n\tthrow new ToolError(message, { code })\n}\n\nfunction cell(row: SettlementRow, key: string): string {\n\treturn (row[key] ?? '').trim()\n}\n\n/**\n * Parse Amazon settlement amount strings to safe integer cents via decimal.js.\n * Empty → 0. Strips US thousands commas only (`1,234.56` → `1234.56`).\n */\nexport function parseUsMoneyToSafeCents(raw: string): number {\n\tconst trimmed = raw.trim()\n\tif (trimmed.length === 0) return 0\n\t// Amazon V2 is US-style; drop thousands separators so Decimal accepts the value.\n\tconst normalized = trimmed.replace(/,/g, '')\n\tlet value: Decimal\n\ttry {\n\t\tvalue = new Decimal(normalized)\n\t} catch {\n\t\tsettlementError('Settlement report has an invalid amount cell', 'upstream')\n\t}\n\tif (!value.isFinite()) {\n\t\tsettlementError('Settlement report has a non-numeric amount', 'upstream')\n\t}\n\tconst cents = value.times(100).toDecimalPlaces(0, Decimal.ROUND_HALF_UP)\n\tif (!cents.isInteger()) {\n\t\tsettlementError('Settlement report has a non-numeric amount', 'upstream')\n\t}\n\tconst n = cents.toNumber()\n\tif (!Number.isSafeInteger(n)) {\n\t\tsettlementError('Settlement amount exceeds safe integer cents range', 'upstream')\n\t}\n\treturn n\n}\n\n/** Decompress GZIP when report document uses compressionAlgorithm GZIP. */\nexport function maybeGunzipReportBytes(bytes: Uint8Array, compressionAlgorithm: string | undefined): Uint8Array {\n\tif (bytes.byteLength > SETTLEMENT_MAX_COMPRESSED_BYTES) {\n\t\tsettlementError('Settlement report compressed body exceeds limit', 'too_large')\n\t}\n\ttry {\n\t\treturn decompressReportDocumentBytes(bytes, compressionAlgorithm, SETTLEMENT_MAX_DECOMPRESSED_BYTES)\n\t} catch (error) {\n\t\tif (error instanceof ToolError && error.code === 'too_large') {\n\t\t\tsettlementError('Settlement report decompressed body exceeds limit', 'too_large')\n\t\t}\n\t\tif (error instanceof ToolError && error.code === 'unsupported') throw error\n\t\tsettlementError('Failed to decompress settlement report', 'upstream')\n\t}\n}\n\n/**\n * Parse Flat File V2 settlement TSV into the eight summary fields only.\n * Validates single settlement-id, currency, period, and amount sum vs total-amount.\n */\nexport function parseSettlementV2Tsv(text: string): AmazonSpApiSettlementSummary {\n\tconst result = Papa.parse<SettlementRow>(text, {\n\t\tdelimiter: '\\t',\n\t\theader: true,\n\t\tskipEmptyLines: 'greedy',\n\t\ttransformHeader: (header) => header.trim().replace(/^\\uFEFF/, '')\n\t})\n\n\tif (result.errors.length > 0) {\n\t\tsettlementError('Settlement report TSV could not be parsed', 'upstream')\n\t}\n\n\tconst fields = result.meta.fields ?? []\n\tfor (const required of SETTLEMENT_V2_REQUIRED_COLUMNS) {\n\t\tif (!fields.includes(required)) {\n\t\t\tsettlementError('Settlement report header columns do not match Flat File V2 schema', 'upstream')\n\t\t}\n\t}\n\n\tconst rows = result.data\n\tif (rows.length === 0) {\n\t\tsettlementError('Settlement report is empty or missing data rows', 'upstream')\n\t}\n\tif (rows.length > SETTLEMENT_MAX_ROWS) {\n\t\tsettlementError('Settlement report exceeds max row limit', 'too_large')\n\t}\n\n\tlet settlementId: string | undefined\n\tlet settlementStart: string | undefined\n\tlet settlementEnd: string | undefined\n\tlet depositDate: string | undefined\n\tlet currency: string | undefined\n\tlet totalAmountCents: number | undefined\n\tlet amountSum = new Decimal(0)\n\n\tfor (const row of rows) {\n\t\tconst rowSettlementId = cell(row, 'settlement-id')\n\t\tconst rowStart = cell(row, 'settlement-start-date')\n\t\tconst rowEnd = cell(row, 'settlement-end-date')\n\t\tconst rowDeposit = cell(row, 'deposit-date')\n\t\tconst rowTotal = cell(row, 'total-amount')\n\t\tconst rowCurrency = cell(row, 'currency')\n\t\tconst rowAmount = cell(row, 'amount')\n\n\t\tif (rowSettlementId.length === 0) {\n\t\t\tsettlementError('Settlement report row missing settlement-id', 'upstream')\n\t\t}\n\n\t\tconst rowTotalCents = parseUsMoneyToSafeCents(rowTotal)\n\t\tconst rowAmountCents = parseUsMoneyToSafeCents(rowAmount)\n\n\t\tif (settlementId === undefined) {\n\t\t\tsettlementId = rowSettlementId\n\t\t\tsettlementStart = rowStart\n\t\t\tsettlementEnd = rowEnd\n\t\t\tdepositDate = rowDeposit\n\t\t\tcurrency = rowCurrency\n\t\t\ttotalAmountCents = rowTotalCents\n\t\t} else {\n\t\t\tif (rowSettlementId !== settlementId) {\n\t\t\t\tsettlementError('Settlement report contains multiple settlement ids', 'upstream')\n\t\t\t}\n\t\t\tif (rowStart !== settlementStart || rowEnd !== settlementEnd) {\n\t\t\t\tsettlementError('Settlement report has inconsistent settlement period', 'upstream')\n\t\t\t}\n\t\t\tif (rowCurrency !== currency) {\n\t\t\t\tsettlementError('Settlement report has inconsistent currency', 'upstream')\n\t\t\t}\n\t\t\tif (rowTotalCents !== totalAmountCents) {\n\t\t\t\tsettlementError('Settlement report has inconsistent total-amount', 'upstream')\n\t\t\t}\n\t\t\tif (rowDeposit.length > 0) {\n\t\t\t\tif (depositDate && depositDate.length > 0 && rowDeposit !== depositDate) {\n\t\t\t\t\tsettlementError('Settlement report has inconsistent deposit-date', 'upstream')\n\t\t\t\t}\n\t\t\t\tif (!depositDate || depositDate.length === 0) depositDate = rowDeposit\n\t\t\t}\n\t\t}\n\n\t\tamountSum = amountSum.plus(rowAmountCents)\n\t}\n\n\tif (\n\t\tsettlementId === undefined ||\n\t\tsettlementStart === undefined ||\n\t\tsettlementEnd === undefined ||\n\t\tcurrency === undefined ||\n\t\ttotalAmountCents === undefined\n\t) {\n\t\tsettlementError('Settlement report has no usable data rows', 'upstream')\n\t}\n\n\tif (!amountSum.isInteger() || !Number.isSafeInteger(amountSum.toNumber())) {\n\t\tsettlementError('Settlement amount sum exceeds safe integer cents range', 'upstream')\n\t}\n\tconst amountSumCents = amountSum.toNumber()\n\tif (amountSumCents !== totalAmountCents) {\n\t\tsettlementError('Settlement amount sum does not match total-amount', 'upstream')\n\t}\n\n\treturn {\n\t\tsettlement_id: settlementId,\n\t\tsettlement_start_date: settlementStart,\n\t\tsettlement_end_date: settlementEnd,\n\t\tdeposit_date: depositDate && depositDate.length > 0 ? depositDate : settlementEnd,\n\t\tcurrency,\n\t\ttotal_amount_cents: totalAmountCents,\n\t\tamount_sum_cents: amountSumCents,\n\t\trow_count: rows.length\n\t}\n}\n\n/** Decode UTF-8 document bytes (after optional gunzip) and parse summary. */\nexport function summarizeSettlementDocument(\n\tbytes: Uint8Array,\n\tcompressionAlgorithm: string | undefined\n): AmazonSpApiSettlementSummary {\n\tif (!compressionAlgorithm && bytes.byteLength > SETTLEMENT_MAX_DECOMPRESSED_BYTES) {\n\t\tsettlementError('Settlement report body exceeds limit', 'too_large')\n\t}\n\tconst plain = maybeGunzipReportBytes(bytes, compressionAlgorithm)\n\tif (plain.byteLength > SETTLEMENT_MAX_DECOMPRESSED_BYTES) {\n\t\tsettlementError('Settlement report body exceeds limit', 'too_large')\n\t}\n\tconst text = new TextDecoder('utf-8', { fatal: false }).decode(plain)\n\treturn parseSettlementV2Tsv(text)\n}\n\n/** ISO createdSince for listReports retention window. */\nexport function settlementCreatedSinceIso(now = new Date(), retentionDays = SETTLEMENT_RETENTION_DAYS): string {\n\tconst ms = retentionDays * 24 * 60 * 60 * 1000\n\treturn new Date(now.getTime() - ms).toISOString()\n}\n","/**\n * Amazon Selling Partner API vendor client.\n * Host: `new AmazonSpApiClient(auth)`. Agent tools: `fromContext(ctx)`.\n *\n * LWA refresh provides the access token used by SP-API HTTP requests.\n */\n\nimport { ToolError } from '../../core/errors'\nimport { requireAuth } from '../../core/provider'\nimport type { ToolContext } from '../../core/types'\nimport { bytesToUtf8 } from '../../shared/bytes'\nimport { HttpService } from '../../transport/http-service'\nimport type { HttpServiceOptions } from '../../transport/http-service'\nimport type {\n\tAmazonSpApiAuth,\n\tAmazonSpApiCreateReportInput,\n\tAmazonSpApiCreateReportOutput,\n\tAmazonSpApiDownloadReportDocumentBytesInput,\n\tAmazonSpApiDownloadReportDocumentBytesOutput,\n\tAmazonSpApiGetOrderInput,\n\tAmazonSpApiGetOrderItemsInput,\n\tAmazonSpApiGetOrderItemsOutput,\n\tAmazonSpApiGetOrderOutput,\n\tAmazonSpApiGetReportDocumentInput,\n\tAmazonSpApiGetReportDocumentOutput,\n\tAmazonSpApiGetReportInput,\n\tAmazonSpApiGetReportOutput,\n\tAmazonSpApiGetSettlementSummaryInput,\n\tAmazonSpApiGetSettlementSummaryOutput,\n\tAmazonSpApiInventoryPageInput,\n\tAmazonSpApiInventoryPageOutput,\n\tAmazonSpApiListInventorySummariesInput,\n\tAmazonSpApiListInventorySummariesOutput,\n\tAmazonSpApiListOrdersInput,\n\tAmazonSpApiListOrdersOutput,\n\tAmazonSpApiListReportsInput,\n\tAmazonSpApiListReportsOutput,\n\tAmazonSpApiListReportsPageInput,\n\tAmazonSpApiListReportsPageOutput,\n\tAmazonSpApiSearchCatalogItemsInput,\n\tAmazonSpApiSearchCatalogItemsOutput,\n\tAmazonSpApiSearchOrdersInput,\n\tAmazonSpApiSearchOrdersOutput\n} from './contracts'\nimport {\n\tamazonSpApiAuthSchema,\n\tamazonSpApiDownloadReportDocumentBytesInputSchema,\n\tamazonSpApiInventoryPageInputSchema,\n\tamazonSpApiListReportsInputSchema,\n\tamazonSpApiListReportsPageInputSchema\n} from './contracts'\nimport {\n\tLWA_TOKEN_URL,\n\tlwaTokenBody,\n\tparseCreateReportPayload,\n\tparseGetReportPayload,\n\tparseInventoryPagePayload,\n\tparseInventorySummary,\n\tparseListReportsPagePayload,\n\tparseLwaTokenResponse,\n\tparseOrderItemsPayload,\n\tparseOrderPayload,\n\tparseOrdersPayload,\n\tparseReport,\n\tparseReportDocumentPayload,\n\tparseSearchCatalogItemsPayload,\n\tparseSearchOrdersPayload,\n\trequireMarketplaceIds\n} from './domain'\nimport { decompressReportDocumentBytes } from './domain/report-document'\nimport {\n\tSETTLEMENT_MAX_COMPRESSED_BYTES,\n\tSETTLEMENT_REPORT_TYPE_V2,\n\tsettlementCreatedSinceIso,\n\tsummarizeSettlementDocument\n} from './domain/settlement'\n\nexport type AmazonSpApiClientOptions = Pick<HttpServiceOptions, 'fetch' | 'signal'>\n\nexport class AmazonSpApiClient {\n\treadonly #auth: AmazonSpApiAuth\n\treadonly #lwa: HttpService\n\treadonly #api: HttpService\n\t/** Absolute URL document download (report document URLs). */\n\treadonly #download: HttpService\n\t#accessToken: string | undefined\n\t#accessTokenExpiresAt = 0\n\n\tconstructor(auth: AmazonSpApiAuth, options: AmazonSpApiClientOptions = {}) {\n\t\tconst parsed = amazonSpApiAuthSchema.safeParse(auth)\n\t\tif (!parsed.success) {\n\t\t\tthrow new ToolError('Invalid Amazon SP-API auth credentials', {\n\t\t\t\tcode: 'bad_auth',\n\t\t\t\tdetails: { issues: parsed.error.issues.map((issue) => issue.message) }\n\t\t\t})\n\t\t}\n\t\tthis.#auth = parsed.data\n\t\tthis.#lwa = new HttpService({\n\t\t\t...options,\n\t\t\tlabel: 'Amazon LWA'\n\t\t})\n\t\tthis.#api = new HttpService({\n\t\t\t...options,\n\t\t\tbaseURL: this.#auth.endpoint,\n\t\t\theaders: { 'user-agent': this.#auth.user_agent },\n\t\t\tlabel: 'Amazon SP-API'\n\t\t})\n\t\tthis.#download = new HttpService({\n\t\t\t...options,\n\t\t\tlabel: 'Amazon SP-API report download'\n\t\t})\n\t}\n\n\tstatic fromContext(ctx: ToolContext): AmazonSpApiClient {\n\t\tconst auth = requireAuth(ctx, amazonSpApiAuthSchema)\n\t\treturn new AmazonSpApiClient(auth, {\n\t\t\t...(ctx.fetch && { fetch: ctx.fetch }),\n\t\t\t...(ctx.signal && { signal: ctx.signal })\n\t\t})\n\t}\n\n\tasync #ensureAccessToken(): Promise<string> {\n\t\tconst now = Date.now()\n\t\tif (this.#accessToken && now < this.#accessTokenExpiresAt) {\n\t\t\treturn this.#accessToken\n\t\t}\n\t\tconst { data } = await this.#lwa.post(LWA_TOKEN_URL, lwaTokenBody(this.#auth), {\n\t\t\tlabel: 'Amazon LWA token',\n\t\t\theaders: { 'Content-Type': 'application/x-www-form-urlencoded' }\n\t\t})\n\t\tconst token = parseLwaTokenResponse(data)\n\t\tthis.#accessToken = token.access_token\n\t\tthis.#accessTokenExpiresAt = now + Math.max(0, token.expires_in * 1000 - 60_000)\n\t\treturn token.access_token\n\t}\n\n\tasync #spGet(path: string, label: string, query?: Record<string, string | number | boolean | undefined>) {\n\t\tconst token = await this.#ensureAccessToken()\n\t\treturn this.#api.get(path, {\n\t\t\tlabel,\n\t\t\theaders: { 'x-amz-access-token': token },\n\t\t\t...(query && { query })\n\t\t})\n\t}\n\n\tasync #spPost(path: string, label: string, body: Record<string, unknown>) {\n\t\tconst token = await this.#ensureAccessToken()\n\t\treturn this.#api.post(path, body, {\n\t\t\tlabel,\n\t\t\theaders: {\n\t\t\t\t'x-amz-access-token': token,\n\t\t\t\t'Content-Type': 'application/json'\n\t\t\t}\n\t\t})\n\t}\n\n\t/** GET /orders/v0/orders */\n\tasync listOrders(input: AmazonSpApiListOrdersInput = {}): Promise<AmazonSpApiListOrdersOutput> {\n\t\tconst marketplaceIds = requireMarketplaceIds(\n\t\t\tinput.marketplace_ids,\n\t\t\tthis.#auth.marketplace_ids,\n\t\t\t'Amazon SP-API listOrders'\n\t\t)\n\t\tconst { data } = await this.#spGet('/orders/v0/orders', 'Amazon SP-API listOrders', {\n\t\t\tMarketplaceIds: marketplaceIds.join(','),\n\t\t\t...(input.created_after && { CreatedAfter: input.created_after }),\n\t\t\t...(input.created_before && { CreatedBefore: input.created_before }),\n\t\t\t...(input.last_updated_after && { LastUpdatedAfter: input.last_updated_after }),\n\t\t\t...(input.order_statuses &&\n\t\t\t\tinput.order_statuses.length > 0 && {\n\t\t\t\t\tOrderStatuses: input.order_statuses.join(',')\n\t\t\t\t}),\n\t\t\t...(input.cursor && { NextToken: input.cursor }),\n\t\t\t...(input.max_results !== undefined && { MaxResultsPerPage: input.max_results })\n\t\t})\n\t\tconst parsed = parseOrdersPayload(data)\n\t\treturn {\n\t\t\titems: parsed.items,\n\t\t\ttruncated: Boolean(parsed.nextToken),\n\t\t\t...(parsed.nextToken && { next_cursor: parsed.nextToken })\n\t\t}\n\t}\n\n\t/** GET /orders/v0/orders/{orderId} */\n\tasync getOrder(input: AmazonSpApiGetOrderInput): Promise<AmazonSpApiGetOrderOutput> {\n\t\tconst { data } = await this.#spGet(\n\t\t\t`/orders/v0/orders/${encodeURIComponent(input.amazon_order_id)}`,\n\t\t\t'Amazon SP-API getOrder'\n\t\t)\n\t\treturn { order: parseOrderPayload(data) }\n\t}\n\n\t/** GET /orders/v0/orders/{orderId}/orderItems */\n\tasync getOrderItems(input: AmazonSpApiGetOrderItemsInput): Promise<AmazonSpApiGetOrderItemsOutput> {\n\t\tconst query = input.cursor ? { NextToken: input.cursor } : undefined\n\t\tconst { data } = await this.#spGet(\n\t\t\t`/orders/v0/orders/${encodeURIComponent(input.amazon_order_id)}/orderItems`,\n\t\t\t'Amazon SP-API getOrderItems',\n\t\t\tquery\n\t\t)\n\t\tconst parsed = parseOrderItemsPayload(data)\n\t\treturn {\n\t\t\tamazon_order_id: parsed.amazon_order_id,\n\t\t\titems: parsed.items,\n\t\t\ttruncated: Boolean(parsed.nextToken),\n\t\t\t...(parsed.nextToken && { next_cursor: parsed.nextToken })\n\t\t}\n\t}\n\n\t/**\n\t * GET /orders/2026-01-01/orders (searchOrders).\n\t * Always requests includedData=FULFILLMENT for fulfillmentStatus.\n\t * Optional max_pages drains pages sequentially (bounded).\n\t */\n\tasync searchOrders(input: AmazonSpApiSearchOrdersInput): Promise<AmazonSpApiSearchOrdersOutput> {\n\t\tconst marketplaceIds = requireMarketplaceIds(\n\t\t\tinput.marketplace_ids,\n\t\t\tthis.#auth.marketplace_ids,\n\t\t\t'Amazon SP-API searchOrders'\n\t\t)\n\t\tconst maxPages = input.max_pages ?? 1\n\t\tconst pageSize = input.max_results ?? 100\n\t\tconst items: AmazonSpApiSearchOrdersOutput['items'] = []\n\t\tlet cursor: string | undefined = input.cursor\n\t\tlet pages = 0\n\t\tlet nextToken: string | undefined\n\n\t\twhile (pages < maxPages) {\n\t\t\tpages += 1\n\t\t\tconst { data } = await this.#spGet('/orders/2026-01-01/orders', 'Amazon SP-API searchOrders', {\n\t\t\t\tcreatedAfter: input.created_after,\n\t\t\t\t...(input.created_before && { createdBefore: input.created_before }),\n\t\t\t\tmarketplaceIds: marketplaceIds.join(','),\n\t\t\t\tincludedData: 'FULFILLMENT',\n\t\t\t\tmaxResultsPerPage: pageSize,\n\t\t\t\t...(cursor && { paginationToken: cursor })\n\t\t\t})\n\t\t\tconst parsed = parseSearchOrdersPayload(data)\n\t\t\titems.push(...parsed.items)\n\t\t\tnextToken = parsed.nextToken\n\t\t\tif (!nextToken) break\n\t\t\tcursor = nextToken\n\t\t}\n\n\t\treturn {\n\t\t\titems,\n\t\t\ttruncated: Boolean(nextToken),\n\t\t\t...(nextToken && { next_cursor: nextToken })\n\t\t}\n\t}\n\n\t/** GET /fba/inventory/v1/summaries */\n\tasync getInventorySummariesPage(input: AmazonSpApiInventoryPageInput): Promise<AmazonSpApiInventoryPageOutput> {\n\t\tconst parsedInput = amazonSpApiInventoryPageInputSchema.safeParse(input)\n\t\tif (!parsedInput.success) {\n\t\t\tthrow new ToolError('Invalid Amazon SP-API inventory page input', {\n\t\t\t\tcode: 'bad_input',\n\t\t\t\tdetails: { issues: parsedInput.error.issues.map((issue) => issue.message) }\n\t\t\t})\n\t\t}\n\t\treturn await this.#requestInventorySummariesPage({\n\t\t\tmarketplace_id: parsedInput.data.marketplace_id,\n\t\t\t...(parsedInput.data.mode === 'incremental' && { start_date_time: parsedInput.data.start_date_time }),\n\t\t\t...(parsedInput.data.next_token && { next_token: parsedInput.data.next_token })\n\t\t})\n\t}\n\n\tasync #requestInventorySummariesPage(input: {\n\t\tmarketplace_id: string\n\t\tstart_date_time?: string\n\t\tnext_token?: string\n\t\tseller_skus?: string[]\n\t}): Promise<AmazonSpApiInventoryPageOutput> {\n\t\tconst result = await this.#spGet('/fba/inventory/v1/summaries', 'Amazon SP-API getInventorySummariesPage', {\n\t\t\tdetails: true,\n\t\t\tgranularityType: 'Marketplace',\n\t\t\tgranularityId: input.marketplace_id,\n\t\t\tmarketplaceIds: input.marketplace_id,\n\t\t\t...(input.start_date_time && { startDateTime: input.start_date_time }),\n\t\t\t...(input.next_token && { nextToken: input.next_token }),\n\t\t\t...(input.seller_skus && input.seller_skus.length > 0 && { sellerSkus: input.seller_skus.join(',') })\n\t\t})\n\t\treturn parseInventoryPagePayload(result.data, result.headers)\n\t}\n\n\t/** Existing slim agent-facing projection over one raw inventory page. */\n\tasync listInventorySummaries(\n\t\tinput: AmazonSpApiListInventorySummariesInput = {}\n\t): Promise<AmazonSpApiListInventorySummariesOutput> {\n\t\tconst marketplaceIds = requireMarketplaceIds(\n\t\t\tinput.marketplace_id ? [input.marketplace_id] : undefined,\n\t\t\tthis.#auth.marketplace_ids,\n\t\t\t'Amazon SP-API listInventorySummaries'\n\t\t)\n\t\tconst marketplaceId = marketplaceIds[0]\n\t\tif (!marketplaceId) {\n\t\t\tthrow new ToolError('Amazon SP-API listInventorySummaries requires a marketplace_id', {\n\t\t\t\tcode: 'bad_input'\n\t\t\t})\n\t\t}\n\t\tconst pageInput: AmazonSpApiInventoryPageInput = input.start_date_time\n\t\t\t? {\n\t\t\t\t\tmode: 'incremental',\n\t\t\t\t\tmarketplace_id: marketplaceId,\n\t\t\t\t\tstart_date_time: input.start_date_time,\n\t\t\t\t\t...(input.cursor && { next_token: input.cursor })\n\t\t\t\t}\n\t\t\t: {\n\t\t\t\t\tmode: 'full',\n\t\t\t\t\tmarketplace_id: marketplaceId,\n\t\t\t\t\t...(input.cursor && { next_token: input.cursor })\n\t\t\t\t}\n\t\tconst parsedInput = amazonSpApiInventoryPageInputSchema.safeParse(pageInput)\n\t\tif (!parsedInput.success) {\n\t\t\tthrow new ToolError('Invalid Amazon SP-API inventory page input', {\n\t\t\t\tcode: 'bad_input',\n\t\t\t\tdetails: { issues: parsedInput.error.issues.map((issue) => issue.message) }\n\t\t\t})\n\t\t}\n\t\tconst page = await this.#requestInventorySummariesPage({\n\t\t\tmarketplace_id: marketplaceId,\n\t\t\t...(input.start_date_time && { start_date_time: input.start_date_time }),\n\t\t\t...(input.cursor && { next_token: input.cursor }),\n\t\t\t...(input.seller_skus && input.seller_skus.length > 0 && { seller_skus: input.seller_skus })\n\t\t})\n\t\treturn {\n\t\t\titems: page.items.map(parseInventorySummary),\n\t\t\ttruncated: Boolean(page.next_token),\n\t\t\t...(page.next_token && { next_cursor: page.next_token })\n\t\t}\n\t}\n\n\t/** POST /reports/2021-06-30/reports */\n\tasync createReport(input: AmazonSpApiCreateReportInput): Promise<AmazonSpApiCreateReportOutput> {\n\t\tconst marketplaceIds = requireMarketplaceIds(\n\t\t\tinput.marketplace_ids,\n\t\t\tthis.#auth.marketplace_ids,\n\t\t\t'Amazon SP-API createReport'\n\t\t)\n\t\tconst body: Record<string, unknown> = {\n\t\t\treportType: input.report_type,\n\t\t\tmarketplaceIds,\n\t\t\t...(input.data_start_time && { dataStartTime: input.data_start_time }),\n\t\t\t...(input.data_end_time && { dataEndTime: input.data_end_time }),\n\t\t\t...(input.report_options && { reportOptions: input.report_options })\n\t\t}\n\t\tconst { data } = await this.#spPost('/reports/2021-06-30/reports', 'Amazon SP-API createReport', body)\n\t\treturn parseCreateReportPayload(data)\n\t}\n\n\t/** GET /reports/2021-06-30/reports/{reportId} */\n\tasync getReport(input: AmazonSpApiGetReportInput): Promise<AmazonSpApiGetReportOutput> {\n\t\tconst { data } = await this.#spGet(\n\t\t\t`/reports/2021-06-30/reports/${encodeURIComponent(input.report_id)}`,\n\t\t\t'Amazon SP-API getReport'\n\t\t)\n\t\treturn { report: parseGetReportPayload(data) }\n\t}\n\n\t/** GET /reports/2021-06-30/reports */\n\tasync listReports(input: AmazonSpApiListReportsInput): Promise<AmazonSpApiListReportsOutput> {\n\t\tconst parsedInput = amazonSpApiListReportsInputSchema.safeParse(input)\n\t\tif (!parsedInput.success) {\n\t\t\tthrow new ToolError('Invalid Amazon SP-API listReports input', {\n\t\t\t\tcode: 'bad_input',\n\t\t\t\tdetails: { issues: parsedInput.error.issues.map((issue) => issue.message) }\n\t\t\t})\n\t\t}\n\t\tconst page =\n\t\t\t'cursor' in parsedInput.data\n\t\t\t\t? await this.listReportsPage({ next_token: parsedInput.data.cursor })\n\t\t\t\t: await this.listReportsPage({\n\t\t\t\t\t\treport_types: parsedInput.data.report_types,\n\t\t\t\t\t\t...(parsedInput.data.processing_statuses && {\n\t\t\t\t\t\t\tprocessing_statuses: parsedInput.data.processing_statuses\n\t\t\t\t\t\t}),\n\t\t\t\t\t\t...(parsedInput.data.marketplace_ids && { marketplace_ids: parsedInput.data.marketplace_ids }),\n\t\t\t\t\t\t...(parsedInput.data.page_size !== undefined && { page_size: parsedInput.data.page_size }),\n\t\t\t\t\t\t...(parsedInput.data.created_since && { created_since: parsedInput.data.created_since }),\n\t\t\t\t\t\t...(parsedInput.data.created_until && { created_until: parsedInput.data.created_until })\n\t\t\t\t\t})\n\t\treturn {\n\t\t\titems: page.items.map(parseReport),\n\t\t\ttruncated: Boolean(page.next_token),\n\t\t\t...(page.next_token && { next_cursor: page.next_token })\n\t\t}\n\t}\n\n\t/** One GET /reports/2021-06-30/reports request. Continuations send only nextToken. */\n\tasync listReportsPage(input: AmazonSpApiListReportsPageInput): Promise<AmazonSpApiListReportsPageOutput> {\n\t\tconst parsedInput = amazonSpApiListReportsPageInputSchema.safeParse(input)\n\t\tif (!parsedInput.success) {\n\t\t\tthrow new ToolError('Invalid Amazon SP-API reports page input', {\n\t\t\t\tcode: 'bad_input',\n\t\t\t\tdetails: { issues: parsedInput.error.issues.map((issue) => issue.message) }\n\t\t\t})\n\t\t}\n\t\tlet query: Record<string, string | number | boolean | undefined>\n\t\tif ('next_token' in parsedInput.data) {\n\t\t\tquery = { nextToken: parsedInput.data.next_token }\n\t\t} else {\n\t\t\tconst marketplaceIds = parsedInput.data.marketplace_ids ?? this.#auth.marketplace_ids\n\t\t\tquery = {\n\t\t\t\treportTypes: parsedInput.data.report_types.join(','),\n\t\t\t\t...(parsedInput.data.processing_statuses && {\n\t\t\t\t\tprocessingStatuses: parsedInput.data.processing_statuses.join(',')\n\t\t\t\t}),\n\t\t\t\t...(marketplaceIds && { marketplaceIds: marketplaceIds.join(',') }),\n\t\t\t\t...(parsedInput.data.page_size !== undefined && { pageSize: parsedInput.data.page_size }),\n\t\t\t\t...(parsedInput.data.created_since && { createdSince: parsedInput.data.created_since }),\n\t\t\t\t...(parsedInput.data.created_until && { createdUntil: parsedInput.data.created_until })\n\t\t\t}\n\t\t}\n\t\tconst result = await this.#spGet('/reports/2021-06-30/reports', 'Amazon SP-API listReportsPage', query)\n\t\treturn parseListReportsPagePayload(result.data, result.headers)\n\t}\n\n\t/** GET /reports/2021-06-30/documents/{reportDocumentId} */\n\tasync getReportDocument(input: AmazonSpApiGetReportDocumentInput): Promise<AmazonSpApiGetReportDocumentOutput> {\n\t\tconst { data } = await this.#spGet(\n\t\t\t`/reports/2021-06-30/documents/${encodeURIComponent(input.report_document_id)}`,\n\t\t\t'Amazon SP-API getReportDocument'\n\t\t)\n\t\treturn parseReportDocumentPayload(data)\n\t}\n\n\t/** Resolve and privately download an Amazon report document by id. */\n\tasync downloadReportDocumentBytes(\n\t\tinput: AmazonSpApiDownloadReportDocumentBytesInput\n\t): Promise<AmazonSpApiDownloadReportDocumentBytesOutput> {\n\t\tconst parsedInput = amazonSpApiDownloadReportDocumentBytesInputSchema.safeParse(input)\n\t\tif (!parsedInput.success) {\n\t\t\tthrow new ToolError('Invalid Amazon report document download input', {\n\t\t\t\tcode: 'bad_input',\n\t\t\t\tdetails: { issues: parsedInput.error.issues.map((issue) => issue.message) }\n\t\t\t})\n\t\t}\n\t\tconst document = await this.getReportDocument({ report_document_id: parsedInput.data.report_document_id })\n\t\treturn this.#downloadReportDocumentDescriptor(document, parsedInput.data.max_bytes)\n\t}\n\n\tasync #downloadReportDocumentDescriptor(\n\t\tdocument: AmazonSpApiGetReportDocumentOutput,\n\t\tmaxBytes: number\n\t): Promise<AmazonSpApiDownloadReportDocumentBytesOutput> {\n\t\tlet compressionAlgorithm: 'GZIP' | undefined\n\t\tif (document.compression_algorithm) {\n\t\t\tif (document.compression_algorithm.toUpperCase() !== 'GZIP') {\n\t\t\t\tthrow new ToolError(`Unsupported Amazon report compression: ${document.compression_algorithm}`, {\n\t\t\t\t\tcode: 'unsupported'\n\t\t\t\t})\n\t\t\t}\n\t\t\tcompressionAlgorithm = 'GZIP'\n\t\t}\n\t\tconst result = await this.#download.bytes('GET', document.url, {\n\t\t\tlabel: 'Amazon SP-API report document',\n\t\t\tmaxBytes\n\t\t})\n\t\tconst bytes = decompressReportDocumentBytes(result.bytes, compressionAlgorithm, maxBytes)\n\t\tconst contentType = result.headers.get('content-type') ?? undefined\n\t\tconst contentEncoding = result.headers.get('content-encoding') ?? undefined\n\t\treturn {\n\t\t\tbytes,\n\t\t\ttext: bytesToUtf8(bytes),\n\t\t\tbyte_length: bytes.byteLength,\n\t\t\t...(contentType && { content_type: contentType }),\n\t\t\t...(contentEncoding && { content_encoding: contentEncoding }),\n\t\t\t...(compressionAlgorithm && { compression_algorithm: compressionAlgorithm })\n\t\t}\n\t}\n\n\t/**\n\t * Composite: newest DONE Flat File V2 settlement report (or `report_id`) →\n\t * one document download → eight summary fields in safe integer cents.\n\t * Never returns raw TSV rows, order ids, skus, or document URLs.\n\t */\n\tasync getSettlementSummary(\n\t\tinput: AmazonSpApiGetSettlementSummaryInput = {}\n\t): Promise<AmazonSpApiGetSettlementSummaryOutput> {\n\t\tconst reportDocumentId = await this.#resolveSettlementReportDocumentId(input)\n\t\tconst doc = await this.getReportDocument({ report_document_id: reportDocumentId })\n\t\t// Download uses absolute URL from Amazon; do not put URL in errors downstream.\n\t\tconst { bytes } = await this.#download.bytes('GET', doc.url, {\n\t\t\tlabel: 'Amazon SP-API settlement document',\n\t\t\tmaxBytes: SETTLEMENT_MAX_COMPRESSED_BYTES\n\t\t})\n\t\treturn summarizeSettlementDocument(bytes, doc.compression_algorithm)\n\t}\n\n\tasync #resolveSettlementReportDocumentId(input: AmazonSpApiGetSettlementSummaryInput): Promise<string> {\n\t\tif (input.report_id) {\n\t\t\tconst { report } = await this.getReport({ report_id: input.report_id })\n\t\t\tif (report.processing_status && report.processing_status !== 'DONE') {\n\t\t\t\tthrow new ToolError('Settlement report is not DONE', {\n\t\t\t\t\tcode: 'bad_input',\n\t\t\t\t\tdetails: { processing_status: report.processing_status }\n\t\t\t\t})\n\t\t\t}\n\t\t\tif (!report.report_document_id) {\n\t\t\t\tthrow new ToolError('Settlement report has no document id', { code: 'upstream' })\n\t\t\t}\n\t\t\treturn report.report_document_id\n\t\t}\n\n\t\tconst createdSince = input.created_since ?? settlementCreatedSinceIso()\n\t\t// Drain a few list pages; Amazon returns newest first for this endpoint.\n\t\tlet cursor: string | undefined\n\t\tfor (let page = 0; page < 5; page += 1) {\n\t\t\tconst listed = cursor\n\t\t\t\t? await this.listReports({ cursor })\n\t\t\t\t: await this.listReports({\n\t\t\t\t\t\treport_types: [SETTLEMENT_REPORT_TYPE_V2],\n\t\t\t\t\t\tprocessing_statuses: ['DONE'],\n\t\t\t\t\t\tcreated_since: createdSince,\n\t\t\t\t\t\tpage_size: 100\n\t\t\t\t\t})\n\t\t\tfor (const report of listed.items) {\n\t\t\t\tif (report.report_document_id) {\n\t\t\t\t\treturn report.report_document_id\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!listed.next_cursor) break\n\t\t\tcursor = listed.next_cursor\n\t\t}\n\n\t\tthrow new ToolError('No completed settlement report found in the retention window', {\n\t\t\tcode: 'not_found'\n\t\t})\n\t}\n\n\t/** GET /catalog/2022-04-01/items */\n\tasync searchCatalogItems(input: AmazonSpApiSearchCatalogItemsInput): Promise<AmazonSpApiSearchCatalogItemsOutput> {\n\t\tconst marketplaceIds = requireMarketplaceIds(\n\t\t\tinput.marketplace_ids,\n\t\t\tthis.#auth.marketplace_ids,\n\t\t\t'Amazon SP-API searchCatalogItems'\n\t\t)\n\t\tconst { data } = await this.#spGet('/catalog/2022-04-01/items', 'Amazon SP-API searchCatalogItems', {\n\t\t\tkeywords: input.keywords.join(','),\n\t\t\tmarketplaceIds: marketplaceIds.join(','),\n\t\t\t...(input.included_data &&\n\t\t\t\tinput.included_data.length > 0 && {\n\t\t\t\t\tincludedData: input.included_data.join(',')\n\t\t\t\t}),\n\t\t\t...(input.page_size !== undefined && { pageSize: input.page_size }),\n\t\t\t...(input.cursor && { pageToken: input.cursor })\n\t\t})\n\t\tconst parsed = parseSearchCatalogItemsPayload(data)\n\t\treturn {\n\t\t\titems: parsed.items,\n\t\t\ttruncated: Boolean(parsed.nextToken),\n\t\t\t...(parsed.numberOfResults !== undefined && { number_of_results: parsed.numberOfResults }),\n\t\t\t...(parsed.nextToken && { next_cursor: parsed.nextToken })\n\t\t}\n\t}\n}\n","import { defineModule, defineTool } from '../../core/define'\nimport { AmazonSpApiClient } from './client'\nimport {\n\tamazonSpApiAuthSchema,\n\tamazonSpApiCreateReportInputSchema,\n\tamazonSpApiCreateReportOutputSchema,\n\tamazonSpApiGetOrderInputSchema,\n\tamazonSpApiGetOrderItemsInputSchema,\n\tamazonSpApiGetOrderItemsOutputSchema,\n\tamazonSpApiGetOrderOutputSchema,\n\tamazonSpApiGetReportInputSchema,\n\tamazonSpApiGetReportOutputSchema,\n\tamazonSpApiListInventorySummariesInputSchema,\n\tamazonSpApiListInventorySummariesOutputSchema,\n\tamazonSpApiListOrdersInputSchema,\n\tamazonSpApiListOrdersOutputSchema,\n\tamazonSpApiListReportsInputSchema,\n\tamazonSpApiListReportsOutputSchema,\n\tamazonSpApiSearchCatalogItemsInputSchema,\n\tamazonSpApiSearchCatalogItemsOutputSchema,\n\tamazonSpApiSearchOrdersInputSchema,\n\tamazonSpApiSearchOrdersOutputSchema,\n\tamazonSpApiGetSettlementSummaryInputSchema,\n\tamazonSpApiGetSettlementSummaryOutputSchema\n} from './contracts'\n\nexport const amazonSpApiListOrdersTool = defineTool({\n\tid: 'amazon-sp-api-list-orders',\n\tname: 'amazonSpApiListOrders',\n\tdescription:\n\t\t'List Amazon SP-API orders for one or more marketplaces. Optional date and status filters. Paginate with next_cursor (NextToken).',\n\tinputSchema: amazonSpApiListOrdersInputSchema,\n\toutputSchema: amazonSpApiListOrdersOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).listOrders(input)\n})\n\nexport const amazonSpApiGetOrderTool = defineTool({\n\tid: 'amazon-sp-api-get-order',\n\tname: 'amazonSpApiGetOrder',\n\tdescription: 'Get one Amazon SP-API order by AmazonOrderId.',\n\tinputSchema: amazonSpApiGetOrderInputSchema,\n\toutputSchema: amazonSpApiGetOrderOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).getOrder(input)\n})\n\nexport const amazonSpApiGetOrderItemsTool = defineTool({\n\tid: 'amazon-sp-api-get-order-items',\n\tname: 'amazonSpApiGetOrderItems',\n\tdescription: 'List line items for one Amazon SP-API order. Paginate with next_cursor (NextToken).',\n\tinputSchema: amazonSpApiGetOrderItemsInputSchema,\n\toutputSchema: amazonSpApiGetOrderItemsOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).getOrderItems(input)\n})\n\nexport const amazonSpApiSearchOrdersTool = defineTool({\n\tid: 'amazon-sp-api-search-orders',\n\tname: 'amazonSpApiSearchOrders',\n\tdescription:\n\t\t'Search Amazon orders via Orders API v2026-01-01 (searchOrders). Filter by created_after (required) and optional created_before. Always includes FULFILLMENT data for fulfillment_status. Optional max_pages drains pages sequentially (max 50). Paginate with next_cursor when truncated.',\n\tinputSchema: amazonSpApiSearchOrdersInputSchema,\n\toutputSchema: amazonSpApiSearchOrdersOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).searchOrders(input)\n})\n\nexport const amazonSpApiListInventorySummariesTool = defineTool({\n\tid: 'amazon-sp-api-list-inventory-summaries',\n\tname: 'amazonSpApiListInventorySummaries',\n\tdescription:\n\t\t'List FBA inventory summaries for a marketplace. Optional seller SKUs and start_date_time. Paginate with next_cursor.',\n\tinputSchema: amazonSpApiListInventorySummariesInputSchema,\n\toutputSchema: amazonSpApiListInventorySummariesOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).listInventorySummaries(input)\n})\n\nexport const amazonSpApiCreateReportTool = defineTool({\n\tid: 'amazon-sp-api-create-report',\n\tname: 'amazonSpApiCreateReport',\n\tdescription:\n\t\t'Request an Amazon SP-API report for given marketplace(s) and optional date range. Returns report_id for later getReport polling.',\n\tinputSchema: amazonSpApiCreateReportInputSchema,\n\toutputSchema: amazonSpApiCreateReportOutputSchema,\n\tsideEffect: 'write',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).createReport(input)\n})\n\nexport const amazonSpApiGetReportTool = defineTool({\n\tid: 'amazon-sp-api-get-report',\n\tname: 'amazonSpApiGetReport',\n\tdescription:\n\t\t'Get one Amazon SP-API report by report_id, including processing_status and report_document_id when DONE.',\n\tinputSchema: amazonSpApiGetReportInputSchema,\n\toutputSchema: amazonSpApiGetReportOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).getReport(input)\n})\n\nexport const amazonSpApiListReportsTool = defineTool({\n\tid: 'amazon-sp-api-list-reports',\n\tname: 'amazonSpApiListReports',\n\tdescription:\n\t\t'List Amazon SP-API reports. Initial calls require report types and may use status, marketplace, and created-time filters. Continue with next_cursor.',\n\tinputSchema: amazonSpApiListReportsInputSchema,\n\toutputSchema: amazonSpApiListReportsOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).listReports(input)\n})\n\nexport const amazonSpApiSearchCatalogItemsTool = defineTool({\n\tid: 'amazon-sp-api-search-catalog-items',\n\tname: 'amazonSpApiSearchCatalogItems',\n\tdescription:\n\t\t'Search Amazon catalog items by keywords for marketplace(s). Optional included_data and page_size. Paginate with next_cursor (pageToken).',\n\tinputSchema: amazonSpApiSearchCatalogItemsInputSchema,\n\toutputSchema: amazonSpApiSearchCatalogItemsOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).searchCatalogItems(input)\n})\n\nexport const amazonSpApiGetSettlementSummaryTool = defineTool({\n\tid: 'amazon-sp-api-get-settlement-summary',\n\tname: 'amazonSpApiGetSettlementSummary',\n\tdescription:\n\t\t'Summarize the newest completed Amazon Flat File V2 settlement report (or a specific report_id): downloads one document, validates the TSV, and returns eight summary fields in integer cents (settlement id, period, deposit date, currency, total and amount sum, row count). Does not return line-level order or SKU data. Optional created_since (default last 90 days when listing).',\n\tinputSchema: amazonSpApiGetSettlementSummaryInputSchema,\n\toutputSchema: amazonSpApiGetSettlementSummaryOutputSchema,\n\tsideEffect: 'read',\n\truntime: 'both',\n\texecute: async (input, ctx) => AmazonSpApiClient.fromContext(ctx).getSettlementSummary(input)\n})\n\nexport const amazonSpApiModule = defineModule({\n\tid: 'amazon-sp-api',\n\ttitle: 'Amazon SP-API',\n\tdescription:\n\t\t'Amazon Selling Partner API vendor pack: orders v0 and SearchOrders v2026, order items, FBA inventory summaries, reports (create/get/list), settlement V2 summary, and catalog item search.',\n\truntime: 'both',\n\tauth: { type: 'custom', schema: amazonSpApiAuthSchema },\n\tcategories: ['commerce', 'amazon'],\n\tclassification: 'pii',\n\ttags: ['orders', 'fba', 'reports'],\n\ttools: [\n\t\tamazonSpApiListOrdersTool,\n\t\tamazonSpApiGetOrderTool,\n\t\tamazonSpApiGetOrderItemsTool,\n\t\tamazonSpApiSearchOrdersTool,\n\t\tamazonSpApiListInventorySummariesTool,\n\t\tamazonSpApiCreateReportTool,\n\t\tamazonSpApiGetReportTool,\n\t\tamazonSpApiListReportsTool,\n\t\tamazonSpApiGetSettlementSummaryTool,\n\t\tamazonSpApiSearchCatalogItemsTool\n\t]\n})\n"],"x_google_ignoreList":[2],"mappings":";;;;;;;;;;;AAGA,MAAa,4BAA4B,EAAE,KAAK;CAC/C;CACA;CACA;AACD,CAAC;AAED,MAAa,wBAAwB,EAAE,OAAO;CAC7C,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,eAAe;CACrD,eAAe,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,mBAAmB;CAC7D,eAAe,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,2CAA2C;CACrF,UAAU,0BAA0B,SAAS,0BAA0B;CACvE,iBAAiB,EACf,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,gEAAgE;CAC3E,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,uDAAuD;AAC/F,CAAC;AAID,MAAa,oCAAoC,EAAE,OAAO;CACzD,cAAc,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC9B,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC5B,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS;AACvC,CAAC;AAMD,MAAa,mCAAmC,EAAE,OAAO;CACxD,iBAAiB,EACf,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,sDAAsD;CACjE,eAAe,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,gCAAgC;CACrF,gBAAgB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,iCAAiC;CACvF,oBAAoB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,gCAAgC;CAC1F,gBAAgB,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,0BAA0B;CACzF,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,6BAA6B;CAC3E,aAAa,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,mBAAmB;AAC7E,CAAC;AAED,MAAa,yBAAyB,EAAE,OAAO;CAC9C,iBAAiB,EAAE,OAAO;CAC1B,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;CAClC,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS;CACnC,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;CACtC,gBAAgB,EAAE,OAAO,CAAC,CAAC,SAAS;CACpC,oBAAoB,EAAE,OAAO,CAAC,CAAC,SAAS;CACxC,sBAAsB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1C,qBAAqB,EAAE,OAAO,CAAC,CAAC,SAAS;AAC1C,CAAC;AAED,MAAa,oCAAoC,EAAE,OAAO;CACzD,OAAO,EAAE,MAAM,sBAAsB;CACrC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,WAAW,EAAE,QAAQ;AACtB,CAAC;AAED,MAAa,iCAAiC,EAAE,OAAO,EACtD,iBAAiB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,iBAAiB,EAC9D,CAAC;AAED,MAAa,kCAAkC,EAAE,OAAO,EACvD,OAAO,uBACR,CAAC;AAED,MAAa,sCAAsC,EAAE,OAAO;CAC3D,iBAAiB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,iBAAiB;CAC7D,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,6BAA6B;AAC5E,CAAC;AAED,MAAa,6BAA6B,EAAE,OAAO;CAClD,eAAe,EAAE,OAAO;CACxB,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1B,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;CAChC,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3B,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;CACtC,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;CACtC,mBAAmB,EAAE,OAAO,CAAC,CAAC,SAAS;CACvC,qBAAqB,EAAE,OAAO,CAAC,CAAC,SAAS;AAC1C,CAAC;AAED,MAAa,uCAAuC,EAAE,OAAO;CAC5D,iBAAiB,EAAE,OAAO;CAC1B,OAAO,EAAE,MAAM,0BAA0B;CACzC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,WAAW,EAAE,QAAQ;AACtB,CAAC;AAID,MAAa,qCAAqC,EAAE,OAAO;CAC1D,eAAe,EACb,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,SAAS,8EAA8E;CACzF,gBAAgB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,iDAAiD;CACvG,iBAAiB,EACf,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,sDAAsD;CACjE,aAAa,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,gCAAgC;CACzF,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,mCAAmC;CACjF,WAAW,EACT,IAAI,CAAC,CACL,IAAI,CAAC,CAAC,CACN,IAAI,EAAE,CAAC,CACP,SAAS,CAAC,CACV,SAAS,gFAAgF;AAC5F,CAAC;AAED,MAAa,+BAA+B,EAAE,OAAO;CACpD,UAAU,EAAE,OAAO,CAAC,CAAC,SAAS,iBAAiB;CAC/C,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,+BAA+B;CAC5E,oBAAoB,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,sDAAsD;AAC1G,CAAC;AAED,MAAa,sCAAsC,EAAE,OAAO;CAC3D,OAAO,EAAE,MAAM,4BAA4B;CAC3C,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,0DAA0D;CACtG,WAAW,EAAE,QAAQ;AACtB,CAAC;AAID,MAAM,gCAAgC,EAAE,IAAI,SAAS,EAAE,QAAQ,KAAK,CAAC;AAErE,SAAS,0BAAkC;CAC1C,MAAM,gCAAgB,IAAI,KAAK;CAC/B,MAAM,aAAa,cAAc,WAAW;CAC5C,cAAc,WAAW,CAAC;CAC1B,cAAc,YAAY,cAAc,YAAY,IAAI,EAAE;CAC1D,MAAM,uBAAuB,IAAI,KAChC,KAAK,IAAI,cAAc,eAAe,GAAG,cAAc,YAAY,IAAI,GAAG,CAAC,CAC5E,CAAC,CAAC,WAAW;CACb,cAAc,WAAW,KAAK,IAAI,YAAY,oBAAoB,CAAC;CACnE,OAAO,cAAc,QAAQ;AAC9B;AAEA,MAAM,qCAAqC,EAAE,aAAa;CACzD,MAAM,EAAE,QAAQ,MAAM;CACtB,gBAAgB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAChC,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;AACxC,CAAC;AAED,MAAM,4CAA4C,EAAE,aAAa;CAChE,MAAM,EAAE,QAAQ,aAAa;CAC7B,gBAAgB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAChC,iBAAiB;CACjB,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;AACxC,CAAC;AAED,MAAa,sCAAsC,EACjD,mBAAmB,QAAQ,CAAC,oCAAoC,yCAAyC,CAAC,CAAC,CAC3G,aAAa,OAAO,YAAY;CAChC,IAAI,MAAM,SAAS,eAAe;CAClC,IAAI,KAAK,MAAM,MAAM,eAAe,IAAI,wBAAwB,GAC/D,QAAQ,SAAS;EAChB,MAAM;EACN,MAAM,CAAC,iBAAiB;EACxB,SAAS;CACV,CAAC;AAEH,CAAC;AAEF,MAAa,2CAA2C,EAAE,YAAY;CACrE,uBAAuB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3C,8BAA8B,EAAE,OAAO,CAAC,CAAC,SAAS;CAClD,8BAA8B,EAAE,OAAO,CAAC,CAAC,SAAS;CAClD,sBAAsB,EAAE,OAAO,CAAC,CAAC,SAAS;AAC3C,CAAC;AAED,MAAa,uDAAuD,EAAE,YAAY;CACjF,MAAM,EAAE,KAAK;EAAC;EAAkC;EAAgC;CAA+B,CAAC;CAChH,UAAU,EAAE,IAAI;AACjB,CAAC;AAED,MAAa,8CAA8C,EAAE,YAAY;CACxE,0BAA0B,EAAE,OAAO,CAAC,CAAC,SAAS;CAC9C,8BAA8B,EAAE,MAAM,oDAAoD,CAAC,CAAC,SAAS;AACtG,CAAC;AAED,MAAa,gDAAgD,EAAE,YAAY;CAC1E,4BAA4B,EAAE,OAAO,CAAC,CAAC,SAAS;CAChD,yBAAyB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC7C,0BAA0B,EAAE,OAAO,CAAC,CAAC,SAAS;CAC9C,4BAA4B,EAAE,OAAO,CAAC,CAAC,SAAS;CAChD,wBAAwB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC5C,mBAAmB,EAAE,OAAO,CAAC,CAAC,SAAS;CACvC,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;AACtC,CAAC;AAED,MAAa,kCAAkC,EAAE,YAAY;CAC5D,qBAAqB,EAAE,OAAO,CAAC,CAAC,SAAS;CACzC,wBAAwB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC5C,wBAAwB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC5C,0BAA0B,EAAE,OAAO,CAAC,CAAC,SAAS;CAC9C,kBAAkB,yCAAyC,SAAS;CACpE,qBAAqB,4CAA4C,SAAS;CAC1E,uBAAuB,8CAA8C,SAAS;AAC/E,CAAC;AAED,MAAa,kCAAkC,EAAE,YAAY;CAC5D,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1B,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3B,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS;CACnC,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;CACrC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS;CACrC,kBAAkB,gCAAgC,SAAS;AAC5D,CAAC;AAED,MAAa,uCAAuC,EAAE,OAAO;CAC5D,OAAO,EAAE,MAAM,+BAA+B;CAC9C,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;CAChC,uBAAuB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3C,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;AACjC,CAAC;AAED,MAAa,+CAA+C,EAAE,OAAO;CACpE,gBAAgB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,0DAA0D;CAChH,aAAa,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,qCAAqC;CACzG,iBAAiB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,mCAAmC;CAC1F,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,6BAA6B;AAC5E,CAAC;AAED,MAAa,oCAAoC,EAAE,OAAO;CACzD,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;CAChC,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1B,QAAQ,EAAE,OAAO,CAAC,CAAC,SAAS;CAC5B,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,gBAAgB,EAAE,OAAO,CAAC,CAAC,SAAS;CACpC,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;AACnC,CAAC;AAED,MAAa,gDAAgD,EAAE,OAAO;CACrE,OAAO,EAAE,MAAM,iCAAiC;CAChD,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,WAAW,EAAE,QAAQ;AACtB,CAAC;AAID,MAAa,qCAAqC,EAAE,OAAO;CAC1D,aAAa,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,qDAAqD;CAC7F,iBAAiB,EACf,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,sDAAsD;CACjE,iBAAiB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,4BAA4B;CACnF,eAAe,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,0BAA0B;CAC/E,gBAAgB,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,2CAA2C;AACjH,CAAC;AAED,MAAa,sCAAsC,EAAE,OAAO,EAC3D,WAAW,EAAE,OAAO,EACrB,CAAC;AAED,MAAa,kCAAkC,EAAE,OAAO,EACvD,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,4CAA4C,EACnF,CAAC;AAED,MAAa,0BAA0B,EAAE,OAAO;CAC/C,WAAW,EAAE,OAAO;CACpB,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,mBAAmB,EAAE,OAAO,CAAC,CAAC,SAAS;CACvC,iBAAiB,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS;CAC9C,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;CACrC,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS;CACnC,oBAAoB,EAAE,OAAO,CAAC,CAAC,SAAS;CACxC,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;AACnC,CAAC;AAED,MAAa,mCAAmC,EAAE,OAAO,EACxD,QAAQ,wBACT,CAAC;AAED,MAAM,sCAAsC;CAC3C,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS,6BAA6B;CAC9F,qBAAqB,EACnB,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,SAAS,CAAC,CACV,SAAS,kFAAkF;CAC7F,iBAAiB,EACf,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,wEAAwE;CACnF,WAAW,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,mBAAmB;CAC1E,eAAe,EAAE,IAAI,SAAS,EAAE,QAAQ,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,iCAAiC;CACrG,eAAe,EAAE,IAAI,SAAS,EAAE,QAAQ,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,kCAAkC;AACvG;AAEA,MAAa,2CAA2C,EAAE,aAAa,mCAAmC;AAE1G,MAAM,0CAA0C,EAAE,aAAa,EAC9D,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,6BAA6B,EACjE,CAAC;AAED,MAAa,oCAAoC,EAAE,MAAM,CACxD,0CACA,uCACD,CAAC;AAED,MAAa,wBAAwB,EAAE,YAAY;CAClD,UAAU,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC1B,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;CAChC,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;CACtC,gBAAgB,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS;CAC7C,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS;CACnC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;CACtC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,qBAAqB,EAAE,OAAO,CAAC,CAAC,SAAS;CACzC,mBAAmB,EAAE,OAAO,CAAC,CAAC,SAAS;CACvC,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;AACvC,CAAC;AAED,MAAa,gDAAgD,EAAE,aAAa,EAC3E,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,EAC7B,CAAC;AAED,MAAa,wCAAwC,EAAE,MAAM,CAC5D,0CACA,6CACD,CAAC;AAED,MAAa,yCAAyC,EAAE,OAAO;CAC9D,OAAO,EAAE,MAAM,qBAAqB;CACpC,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;CAChC,uBAAuB,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3C,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;AACjC,CAAC;AAED,MAAa,qCAAqC,EAAE,OAAO;CAC1D,OAAO,EAAE,MAAM,uBAAuB;CACtC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,WAAW,EAAE,QAAQ;AACtB,CAAC;AAED,MAAa,0CAA0C,EAAE,OAAO,EAC/D,oBAAoB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,4CAA4C,EAC5F,CAAC;AAED,MAAa,2CAA2C,EAAE,OAAO;CAChE,aAAa,EAAE,OAAO;CACtB,KAAK,EAAE,OAAO;CACd,uBAAuB,EAAE,OAAO,CAAC,CAAC,SAAS;AAC5C,CAAC;AAED,MAAa,oDAAoD,EAAE,aAAa;CAC/E,oBAAoB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACpC,WAAW,EAAE,IAAI,CAAC,CAAC,SAAS;AAC7B,CAAC;AAED,MAAa,qDAAqD,EAAE,OAAO;CAC1E,OAAO,EAAE,QAAoB,UAAU,iBAAiB,UAAU;CAClE,MAAM,EAAE,OAAO;CACf,aAAa,EAAE,IAAI,CAAC,CAAC,YAAY;CACjC,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;CAClC,kBAAkB,EAAE,OAAO,CAAC,CAAC,SAAS;CACtC,uBAAuB,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;AAClD,CAAC;;;;;AAQD,MAAa,6CAA6C,EAAE,OAAO;CAClE,WAAW,EACT,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,qGAAqG;CAChH,eAAe,EACb,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,wEAAwE;AACpF,CAAC;;AAGD,MAAa,qCAAqC,EAAE,OAAO;CAC1D,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS,sBAAsB;CACzD,uBAAuB,EAAE,OAAO,CAAC,CAAC,SAAS,yBAAyB;CACpE,qBAAqB,EAAE,OAAO,CAAC,CAAC,SAAS,uBAAuB;CAChE,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS,qDAAqD;CACvF,UAAU,EAAE,OAAO,CAAC,CAAC,SAAS,mCAAmC;CACjE,oBAAoB,EAClB,OAAO,CAAC,CACR,IAAI,CAAC,CACL,SAAS,yEAAyE;CACpF,kBAAkB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,4CAA4C;CACxF,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,mDAAmD;AACzF,CAAC;AAED,MAAa,8CAA8C;AAI3D,MAAa,2CAA2C,EAAE,OAAO;CAChE,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,iBAAiB;CACtE,iBAAiB,EACf,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,IAAI,CAAC,CAAC,CACN,SAAS,CAAC,CACV,SAAS,sDAAsD;CACjE,eAAe,EACb,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACxB,SAAS,CAAC,CACV,SAAS,2DAA2D;CACtE,WAAW,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,kBAAkB;CACxE,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,6BAA6B;AAC5E,CAAC;AAED,MAAa,+BAA+B,EAAE,OAAO;CACpD,MAAM,EAAE,OAAO;CACf,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3B,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3B,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;CAClC,gBAAgB,EAAE,OAAO,CAAC,CAAC,SAAS;AACrC,CAAC;AAED,MAAa,4CAA4C,EAAE,OAAO;CACjE,OAAO,EAAE,MAAM,4BAA4B;CAC3C,mBAAmB,EAAE,OAAO,CAAC,CAAC,SAAS;CACvC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,WAAW,EAAE,QAAQ;AACtB,CAAC;;;;;;ACraD,MAAa,gBAAgB;AAE7B,MAAM,uBAAuB,EAAE,YAAY;CAC1C,QAAQ,EAAE,OAAO,CAAC,CAAC,SAAS;CAC5B,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;AACnC,CAAC;AAED,MAAM,uBAAuB,EAAE,YAAY;CAC1C,eAAe,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC/B,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;CAClC,gBAAgB,EAAE,OAAO,CAAC,CAAC,SAAS;CACpC,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS;CACnC,YAAY,qBAAqB,SAAS;CAC1C,oBAAoB,EAAE,OAAO,CAAC,CAAC,SAAS;AACzC,CAAC;AAED,MAAM,6BAA6B,EAAE,YAAY,EAChD,SAAS,EAAE,YAAY;CACtB,QAAQ,EAAE,MAAM,oBAAoB;CACpC,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;AACvC,CAAC,EACF,CAAC;AAED,MAAM,6BAA6B,EAAE,YAAY;CAChD,SAAS,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACzB,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS;CACjC,aAAa,EAAE,YAAY,EAAE,mBAAmB,EAAE,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS;AACnF,CAAC;AAED,MAAM,+BAA+B,EAAE,YAAY;CAClD,QAAQ,EAAE,MAAM,0BAA0B;CAC1C,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS;AACjF,CAAC;AAED,MAAM,0CAA0C,EAAE,YAAY,EAAE,SAAS,6BAA6B,CAAC;AAEvG,MAAM,2BAA2B,EAAE,YAAY;CAC9C,aAAa,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC7B,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1B,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3B,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;CACrC,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;CACrC,WAAW,qBAAqB,SAAS;AAC1C,CAAC;AAED,MAAM,iCAAiC,EAAE,YAAY,EACpD,SAAS,EAAE,YAAY;CACtB,eAAe,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC/B,YAAY,EAAE,MAAM,wBAAwB;CAC5C,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;AACvC,CAAC,EACF,CAAC;AAED,MAAM,6BAA6B,EAAE,YAAY;CAChD,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACtB,WAAW,EACT,MACA,EAAE,YAAY;EACb,UAAU,EAAE,OAAO,CAAC,CAAC,SAAS;EAC9B,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;EAC/B,eAAe,EAAE,OAAO,CAAC,CAAC,SAAS;CACpC,CAAC,CACF,CAAC,CACA,SAAS;CACX,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS;AACvF,CAAC;AAED,MAAM,oCAAoC,EAAE,YAAY;CACvD,OAAO,EAAE,MAAM,0BAA0B;CACzC,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;CACrC,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS;AACjF,CAAC;AAED,SAAgB,aAAa,MAAmF;CAO/G,OAAO,IANY,gBAAgB;EAClC,YAAY;EACZ,eAAe,KAAK;EACpB,WAAW,KAAK;EAChB,eAAe,KAAK;CACrB,CACY,CAAC,CAAC,SAAS;AACxB;AAEA,SAAgB,sBAAsB,MAA4C;CACjF,MAAM,SAAS,kCAAkC,UAAU,IAAI;CAC/D,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,iDAAiD;EACpE,MAAM;EACN,SAAS,EAAE,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;CACtE,CAAC;CAEF,OAAO,OAAO;AACf;AAEA,SAAgB,WAAW,OAAkC;CAC5D,MAAM,SAAS,qBAAqB,UAAU,KAAK;CACnD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,2CAA2C,EAAE,MAAM,WAAW,CAAC;CAEpF,OAAO;EACN,iBAAiB,OAAO,KAAK;EAC7B,GAAI,OAAO,KAAK,eAAe,EAAE,cAAc,OAAO,KAAK,YAAY;EACvE,GAAI,OAAO,KAAK,gBAAgB,EAAE,eAAe,OAAO,KAAK,aAAa;EAC1E,GAAI,OAAO,KAAK,kBAAkB,EAAE,kBAAkB,OAAO,KAAK,eAAe;EACjF,GAAI,OAAO,KAAK,iBAAiB,EAAE,gBAAgB,OAAO,KAAK,cAAc;EAC7E,GAAI,OAAO,KAAK,YAAY,UAAU,EAAE,oBAAoB,OAAO,KAAK,WAAW,OAAO;EAC1F,GAAI,OAAO,KAAK,YAAY,gBAAgB,EAAE,sBAAsB,OAAO,KAAK,WAAW,aAAa;EACxG,GAAI,OAAO,KAAK,sBAAsB,EAAE,qBAAqB,OAAO,KAAK,mBAAmB;CAC7F;AACD;AAEA,SAAgB,mBAAmB,MAGjC;CACD,MAAM,SAAS,2BAA2B,UAAU,IAAI;CACxD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,wCAAwC,EAAE,MAAM,WAAW,CAAC;CAEjF,OAAO;EACN,OAAO,OAAO,KAAK,QAAQ,OAAO,IAAI,UAAU;EAChD,GAAI,OAAO,KAAK,QAAQ,aAAa,EAAE,WAAW,OAAO,KAAK,QAAQ,UAAU;CACjF;AACD;AAEA,SAAgB,kBAAkB,MAAiC;CAClE,MAAM,SAAS,EAAE,YAAY,EAAE,SAAS,qBAAqB,CAAC,CAAC,CAAC,UAAU,IAAI;CAC9E,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,2CAA2C,EAAE,MAAM,WAAW,CAAC;CAEpF,OAAO,WAAW,OAAO,KAAK,OAAO;AACtC;;AAGA,SAAgB,iBAAiB,OAAwC;CACxE,MAAM,SAAS,2BAA2B,UAAU,KAAK;CACzD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,wDAAwD,EAAE,MAAM,WAAW,CAAC;CAEjG,OAAO;EACN,UAAU,OAAO,KAAK;EACtB,GAAI,OAAO,KAAK,eAAe,EAAE,cAAc,OAAO,KAAK,YAAY;EACvE,GAAI,OAAO,KAAK,aAAa,qBAAqB,EACjD,oBAAoB,OAAO,KAAK,YAAY,kBAC7C;CACD;AACD;AAEA,SAAgB,yBAAyB,MAGvC;CACD,MAAM,UAAU,wCAAwC,UAAU,IAAI;CACtE,MAAM,SAAS,6BAA6B,UAAU,IAAI;CAC1D,MAAM,OAAO,QAAQ,UAAU,QAAQ,KAAK,UAAU,OAAO,UAAU,OAAO,OAAO,KAAA;CACrF,IAAI,CAAC,MACJ,MAAM,IAAI,UAAU,8CAA8C,EAAE,MAAM,WAAW,CAAC;CAEvF,OAAO;EACN,OAAO,KAAK,OAAO,IAAI,gBAAgB;EACvC,GAAI,KAAK,YAAY,aAAa,EAAE,WAAW,KAAK,WAAW,UAAU;CAC1E;AACD;AAEA,SAAgB,eAAe,OAAsC;CACpE,MAAM,SAAS,yBAAyB,UAAU,KAAK;CACvD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,gDAAgD,EAAE,MAAM,WAAW,CAAC;CAEzF,OAAO;EACN,eAAe,OAAO,KAAK;EAC3B,GAAI,OAAO,KAAK,QAAQ,EAAE,MAAM,OAAO,KAAK,KAAK;EACjD,GAAI,OAAO,KAAK,aAAa,EAAE,YAAY,OAAO,KAAK,UAAU;EACjE,GAAI,OAAO,KAAK,SAAS,EAAE,OAAO,OAAO,KAAK,MAAM;EACpD,GAAI,OAAO,KAAK,oBAAoB,KAAA,KAAa,EAAE,kBAAkB,OAAO,KAAK,gBAAgB;EACjG,GAAI,OAAO,KAAK,oBAAoB,KAAA,KAAa,EAAE,kBAAkB,OAAO,KAAK,gBAAgB;EACjG,GAAI,OAAO,KAAK,WAAW,UAAU,EAAE,mBAAmB,OAAO,KAAK,UAAU,OAAO;EACvF,GAAI,OAAO,KAAK,WAAW,gBAAgB,EAAE,qBAAqB,OAAO,KAAK,UAAU,aAAa;CACtG;AACD;AAEA,SAAgB,uBAAuB,MAIrC;CACD,MAAM,SAAS,+BAA+B,UAAU,IAAI;CAC5D,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,6CAA6C,EAAE,MAAM,WAAW,CAAC;CAEtF,OAAO;EACN,iBAAiB,OAAO,KAAK,QAAQ;EACrC,OAAO,OAAO,KAAK,QAAQ,WAAW,IAAI,cAAc;EACxD,GAAI,OAAO,KAAK,QAAQ,aAAa,EAAE,WAAW,OAAO,KAAK,QAAQ,UAAU;CACjF;AACD;AAEA,SAAgB,sBAAsB,OAA6C;CAClF,MAAM,SAAS,gCAAgC,UAAU,KAAK;CAC9D,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,uDAAuD;EAC1E,MAAM;EACN,SAAS,EAAE,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;CACtE,CAAC;CAEF,OAAO;EACN,GAAI,OAAO,KAAK,aAAa,EAAE,YAAY,OAAO,KAAK,UAAU;EACjE,GAAI,OAAO,KAAK,QAAQ,EAAE,MAAM,OAAO,KAAK,KAAK;EACjD,GAAI,OAAO,KAAK,SAAS,EAAE,QAAQ,OAAO,KAAK,MAAM;EACrD,GAAI,OAAO,KAAK,aAAa,EAAE,WAAW,OAAO,KAAK,UAAU;EAChE,GAAI,OAAO,KAAK,kBAAkB,KAAA,KAAa,EAAE,gBAAgB,OAAO,KAAK,cAAc;EAC3F,GAAI,OAAO,KAAK,eAAe,EAAE,cAAc,OAAO,KAAK,YAAY;CACxE;AACD;AAEA,MAAM,8BAA8B,EAAE,YAAY;CACjD,SAAS,EAAE,YAAY,EACtB,oBAAoB,EAAE,MAAM,+BAA+B,EAC5D,CAAC;CACD,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS;AACjF,CAAC;AAED,MAAM,gCAAgC,EAAE,OAAO,OAAO,CAAC,CAAC,SAAS;AAEjE,SAAgB,4BAA4B,SAG1C;CACD,MAAM,eAAe,QAAQ,IAAI,wBAAwB;CACzD,IAAI;CACJ,IAAI,iBAAiB,MAAM;EAC1B,MAAM,kBAAkB,8BAA8B,UAAU,YAAY;EAC5E,IAAI,CAAC,gBAAgB,SACpB,MAAM,IAAI,UAAU,uDAAuD,EAAE,MAAM,WAAW,CAAC;EAEhG,YAAY,gBAAgB;CAC7B;CACA,MAAM,YAAY,QAAQ,IAAI,kBAAkB,KAAK,QAAQ,IAAI,mBAAmB,KAAK,KAAA;CACzF,OAAO;EACN,GAAI,cAAc,KAAA,KAAa,EAAE,uBAAuB,UAAU;EAClE,GAAI,aAAa,EAAE,YAAY,UAAU;CAC1C;AACD;AAEA,SAAgB,0BAA0B,MAAe,SAAkD;CAC1G,MAAM,SAAS,4BAA4B,UAAU,IAAI;CACzD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,iDAAiD;EACpE,MAAM;EACN,SAAS,EAAE,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;CACtE,CAAC;CAEF,OAAO;EACN,OAAO,OAAO,KAAK,QAAQ;EAC3B,GAAI,OAAO,KAAK,YAAY,aAAa,EAAE,YAAY,OAAO,KAAK,WAAW,UAAU;EACxF,GAAG,4BAA4B,OAAO;CACvC;AACD;AAUA,SAAgB,yBAAyB,MAAsC;CAC9E,MAAM,SAAS,EAAE,YAAY,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI;CAC5E,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,gDAAgD,EAAE,MAAM,WAAW,CAAC;CAEzF,OAAO,EAAE,WAAW,OAAO,KAAK,SAAS;AAC1C;AAEA,SAAgB,YAAY,OAAmC;CAC9D,MAAM,SAAS,sBAAsB,UAAU,KAAK;CACpD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,4CAA4C;EAC/D,MAAM;EACN,SAAS,EAAE,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;CACtE,CAAC;CAEF,OAAO;EACN,WAAW,OAAO,KAAK;EACvB,GAAI,OAAO,KAAK,cAAc,EAAE,aAAa,OAAO,KAAK,WAAW;EACpE,GAAI,OAAO,KAAK,oBAAoB,EAAE,mBAAmB,OAAO,KAAK,iBAAiB;EACtF,GAAI,OAAO,KAAK,kBACf,OAAO,KAAK,eAAe,SAAS,KAAK,EACxC,iBAAiB,OAAO,KAAK,eAC9B;EACD,GAAI,OAAO,KAAK,iBAAiB,EAAE,iBAAiB,OAAO,KAAK,cAAc;EAC9E,GAAI,OAAO,KAAK,eAAe,EAAE,eAAe,OAAO,KAAK,YAAY;EACxE,GAAI,OAAO,KAAK,oBAAoB,EAAE,oBAAoB,OAAO,KAAK,iBAAiB;EACvF,GAAI,OAAO,KAAK,eAAe,EAAE,cAAc,OAAO,KAAK,YAAY;CACxE;AACD;AAEA,SAAgB,sBAAsB,MAAkC;CACvE,OAAO,YAAY,IAAI;AACxB;AAUA,MAAM,gCAAgC,EAAE,YAAY;CACnD,SAAS,EAAE,MAAM,qBAAqB;CACtC,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;AACvC,CAAC;AAED,SAAgB,4BAA4B,MAAe,SAAoD;CAC9G,MAAM,SAAS,8BAA8B,UAAU,IAAI;CAC3D,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,oDAAoD;EACvE,MAAM;EACN,SAAS,EAAE,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;CACtE,CAAC;CAEF,OAAO;EACN,OAAO,OAAO,KAAK;EACnB,GAAI,OAAO,KAAK,aAAa,EAAE,YAAY,OAAO,KAAK,UAAU;EACjE,GAAG,4BAA4B,OAAO;CACvC;AACD;AAEA,SAAgB,2BAA2B,MAIzC;CACD,MAAM,SAAS,EACb,YAAY;EACZ,kBAAkB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EAClC,KAAK,EAAE,IAAI;EACX,sBAAsB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;CAClD,CAAC,CAAC,CACD,UAAU,IAAI;CAChB,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,kDAAkD,EAAE,MAAM,WAAW,CAAC;CAE3F,OAAO;EACN,aAAa,OAAO,KAAK;EACzB,KAAK,OAAO,KAAK;EACjB,GAAI,OAAO,KAAK,wBAAwB,EAAE,uBAAuB,OAAO,KAAK,qBAAqB;CACnG;AACD;AAEA,SAAgB,iBAAiB,OAAwC;CACxE,MAAM,SAAS,2BAA2B,UAAU,KAAK;CACzD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,kDAAkD,EAAE,MAAM,WAAW,CAAC;CAE3F,MAAM,UAAU,OAAO,KAAK,YAAY;CACxC,MAAM,cAAc,OAAO,KAAK,eAAe;CAC/C,OAAO;EACN,MAAM,OAAO,KAAK;EAClB,GAAI,SAAS,YAAY,EAAE,OAAO,QAAQ,SAAS;EACnD,GAAI,SAAS,aAAa,EAAE,OAAO,QAAQ,UAAU;EACrD,GAAI,aAAa,eAAe,EAAE,cAAc,YAAY,YAAY;EACxE,GAAI,SAAS,iBAAiB,EAAE,gBAAgB,QAAQ,cAAc;CACvE;AACD;AAEA,SAAgB,+BAA+B,MAI7C;CACD,MAAM,SAAS,kCAAkC,UAAU,IAAI;CAC/D,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,gDAAgD,EAAE,MAAM,WAAW,CAAC;CAEzF,OAAO;EACN,OAAO,OAAO,KAAK,MAAM,IAAI,gBAAgB;EAC7C,GAAI,OAAO,KAAK,oBAAoB,KAAA,KAAa,EAAE,iBAAiB,OAAO,KAAK,gBAAgB;EAChG,GAAI,OAAO,KAAK,YAAY,aAAa,EAAE,WAAW,OAAO,KAAK,WAAW,UAAU;CACxF;AACD;AAEA,SAAgB,sBACf,UACA,SACA,OACW;CACX,MAAM,MAAM,YAAY;CACxB,IAAI,CAAC,OAAO,IAAI,WAAW,GAC1B,MAAM,IAAI,UAAU,GAAG,MAAM,gDAAgD,EAAE,MAAM,YAAY,CAAC;CAEnG,OAAO;AACR;;;AC/ZA,IAAI,UAAU,cAAc,GAAG;AAU/B,IAAI;AAKJ,IAAI;CACA,KAAM,QAAQ,gBAAgB,GAAY,GAAG,QAAmC,GAAG;AACvF,SACO,GAAG,CACV;AA4BA,IAAI,KAAK;AAAY,IAAA,MAAM;AAAa,IAAA,MAAM;AAE9C,IAAI,OAAO,IAAI,GAAG;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAgB;CAAG;CAAoB;AAAC,CAAC;AAEhJ,IAAI,OAAO,IAAI,GAAG;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAiB;CAAG;AAAC,CAAC;AAEvI,IAAI,OAAO,IAAI,GAAG;CAAC;CAAI;CAAI;CAAI;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;AAAE,CAAC;AAEpF,IAAI,OAAO,SAAU,IAAI,OAAO;CAC5B,IAAI,IAAI,IAAI,IAAI,EAAE;CAClB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,EAAE,KAAK,SAAS,KAAK,GAAG,IAAI;CAGhC,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG;CACrB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,KAAK,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,GAC/B,EAAE,KAAO,IAAI,EAAE,MAAO,IAAK;CAGnC,OAAO;EAAK;EAAM;CAAE;AACxB;AACA,IAAI,KAAK,KAAK,MAAM,CAAC;AAAG,IAAA,KAAK,GAAG;AAAG,IAAA,QAAQ,GAAG;AAE9C,GAAG,MAAM,KAAK,MAAM,OAAO;AAC3B,IAAI,KAAK,KAAK,MAAM,CAAC;AAAG,IAAA,KAAK,GAAG;AAAW,GAAG;AAE9C,IAAI,MAAM,IAAI,IAAI,KAAK;AACvB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,EAAE,GAAG;CAE5B,IAAI,KAAM,IAAI,UAAW,KAAO,IAAI,UAAW;CAC/C,KAAM,IAAI,UAAW,KAAO,IAAI,UAAW;CAC3C,KAAM,IAAI,UAAW,KAAO,IAAI,SAAW;CAC3C,IAAI,OAAQ,IAAI,UAAW,KAAO,IAAI,QAAW,MAAO;AAC5D;AAIA,IAAI,QAAQ,SAAU,IAAI,IAAI,GAAG;CAC7B,IAAI,IAAI,GAAG;CAEX,IAAI,IAAI;CAER,IAAI,IAAI,IAAI,IAAI,EAAE;CAElB,OAAO,IAAI,GAAG,EAAE,GACZ,IAAI,GAAG,IACH,EAAE,EAAE,GAAG,KAAK;CAGpB,IAAI,KAAK,IAAI,IAAI,EAAE;CACnB,KAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAClB,GAAG,KAAM,GAAG,IAAI,KAAK,EAAE,IAAI,MAAO;CAEtC,IAAI;CACJ,IAAI,GAAG;EAEH,KAAK,IAAI,IAAI,KAAK,EAAE;EAEpB,IAAI,MAAM,KAAK;EACf,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAEjB,IAAI,GAAG,IAAI;GAEP,IAAI,KAAM,KAAK,IAAK,GAAG;GAEvB,IAAI,MAAM,KAAK,GAAG;GAElB,IAAI,IAAI,GAAG,GAAG,KAAK,EAAE,MAAM;GAE3B,KAAK,IAAI,IAAI,KAAM,KAAK,OAAO,GAAI,KAAK,GAAG,EAAE,GAEzC,GAAG,IAAI,MAAM,OAAO;EAE5B;CAER,OACK;EACD,KAAK,IAAI,IAAI,CAAC;EACd,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GACjB,IAAI,GAAG,IACH,GAAG,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,OAAQ,KAAK,GAAG;CAGrD;CACA,OAAO;AACX;AAEA,IAAI,MAAM,IAAI,GAAG,GAAG;AACpB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GACvB,IAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,IAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,IAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,IAAI,KAAK;AAEb,IAAI,MAAM,IAAI,GAAG,EAAE;AACnB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,IAAI,KAAK;AAE4B,IAAA,OAAqB,mBAAK,KAAK,GAAG,CAAC;AAEnC,IAAA,OAAqB,mBAAK,KAAK,GAAG,CAAC;AAE5E,IAAI,MAAM,SAAU,GAAG;CACnB,IAAI,IAAI,EAAE;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAC5B,IAAI,EAAE,KAAK,GACP,IAAI,EAAE;CAEd,OAAO;AACX;AAEA,IAAI,OAAO,SAAU,GAAG,GAAG,GAAG;CAC1B,IAAI,IAAK,IAAI,IAAK;CAClB,QAAS,EAAE,KAAM,EAAE,IAAI,MAAM,OAAQ,IAAI,KAAM;AACnD;AAEA,IAAI,SAAS,SAAU,GAAG,GAAG;CACzB,IAAI,IAAK,IAAI,IAAK;CAClB,QAAS,EAAE,KAAM,EAAE,IAAI,MAAM,IAAM,EAAE,IAAI,MAAM,QAAS,IAAI;AAChE;AAEA,IAAI,OAAO,SAAU,GAAG;CAAE,QAAS,IAAI,KAAK,IAAK;AAAG;AAGpD,IAAI,MAAM,SAAU,GAAG,GAAG,GAAG;CACzB,IAAI,KAAK,QAAQ,IAAI,GACjB,IAAI;CACR,IAAI,KAAK,QAAQ,IAAI,EAAE,QACnB,IAAI,EAAE;CAEV,OAAO,IAAI,GAAG,EAAE,SAAS,GAAG,CAAC,CAAC;AAClC;AAsBA,IAAI,KAAK;CACL;CACA;CACA;CACA;CACA;CACA;;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;AAEJ;AAEA,IAAI,MAAM,SAAU,KAAK,KAAK,IAAI;CAC9B,IAAI,IAAI,IAAI,MAAM,OAAO,GAAG,IAAI;CAChC,EAAE,OAAO;CACT,IAAI,MAAM,mBACN,MAAM,kBAAkB,GAAG,GAAG;CAClC,IAAI,CAAC,IACD,MAAM;CACV,OAAO;AACX;AAEA,IAAI,QAAQ,SAAU,KAAK,IAAI,KAAK,MAAM;CAEtC,IAAI,KAAK,IAAI,QAAQ,KAAK,OAAO,KAAK,SAAS;CAC/C,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,GACnB,OAAO,OAAO,IAAI,GAAG,CAAC;CAC1B,IAAI,QAAQ,CAAC;CAEb,IAAI,SAAS,SAAS,GAAG,KAAK;CAE9B,IAAI,OAAO,GAAG;CAEd,IAAI,OACA,MAAM,IAAI,GAAG,KAAK,CAAC;CAEvB,IAAI,OAAO,SAAU,GAAG;EACpB,IAAI,KAAK,IAAI;EAEb,IAAI,IAAI,IAAI;GAER,IAAI,OAAO,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG,CAAC,CAAC;GACrC,KAAK,IAAI,GAAG;GACZ,MAAM;EACV;CACJ;CAEA,IAAI,QAAQ,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,MAAM,GAAG,GAAG,MAAM,GAAG;CAEnG,IAAI,OAAO,KAAK;CAChB,GAAG;EACC,IAAI,CAAC,IAAI;GAEL,QAAQ,KAAK,KAAK,KAAK,CAAC;GAExB,IAAI,OAAO,KAAK,KAAK,MAAM,GAAG,CAAC;GAC/B,OAAO;GACP,IAAI,CAAC,MAAM;IAEP,IAAI,IAAI,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,KAAM,IAAI,IAAI,MAAM,GAAI,IAAI,IAAI;IACnE,IAAI,IAAI,IAAI;KACR,IAAI,MACA,IAAI,CAAC;KACT;IACJ;IAEA,IAAI,QACA,KAAK,KAAK,CAAC;IAEf,IAAI,IAAI,IAAI,SAAS,GAAG,CAAC,GAAG,EAAE;IAE9B,GAAG,IAAI,MAAM,GAAG,GAAG,IAAI,MAAM,IAAI,GAAG,GAAG,IAAI;IAC3C;GACJ,OACK,IAAI,QAAQ,GACb,KAAK,MAAM,KAAK,MAAM,MAAM,GAAG,MAAM;QACpC,IAAI,QAAQ,GAAG;IAEhB,IAAI,OAAO,KAAK,KAAK,KAAK,EAAE,IAAI,KAAK,QAAQ,KAAK,KAAK,MAAM,IAAI,EAAE,IAAI;IACvE,IAAI,KAAK,OAAO,KAAK,KAAK,MAAM,GAAG,EAAE,IAAI;IACzC,OAAO;IAEP,IAAI,MAAM,IAAI,GAAG,EAAE;IAEnB,IAAI,MAAM,IAAI,GAAG,EAAE;IACnB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,EAAE,GAEzB,IAAI,KAAK,MAAM,KAAK,KAAK,MAAM,IAAI,GAAG,CAAC;IAE3C,OAAO,QAAQ;IAEf,IAAI,MAAM,IAAI,GAAG,GAAG,UAAU,KAAK,OAAO;IAE1C,IAAI,MAAM,KAAK,KAAK,KAAK,CAAC;IAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK;KACrB,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,MAAM;KAEjC,OAAO,IAAI;KAEX,IAAI,IAAI,KAAK;KAEb,IAAI,IAAI,IACJ,IAAI,OAAO;UAEV;MAED,IAAI,IAAI,GAAG,IAAI;MACf,IAAI,KAAK,IACL,IAAI,IAAI,KAAK,KAAK,KAAK,CAAC,GAAG,OAAO,GAAG,IAAI,IAAI,IAAI;WAChD,IAAI,KAAK,IACV,IAAI,IAAI,KAAK,KAAK,KAAK,CAAC,GAAG,OAAO;WACjC,IAAI,KAAK,IACV,IAAI,KAAK,KAAK,KAAK,KAAK,GAAG,GAAG,OAAO;MACzC,OAAO,KACH,IAAI,OAAO;KACnB;IACJ;IAEA,IAAI,KAAK,IAAI,SAAS,GAAG,IAAI,GAAG,KAAK,IAAI,SAAS,IAAI;IAEtD,MAAM,IAAI,EAAE;IAEZ,MAAM,IAAI,EAAE;IACZ,KAAK,KAAK,IAAI,KAAK,CAAC;IACpB,KAAK,KAAK,IAAI,KAAK,CAAC;GACxB,OAEI,IAAI,CAAC;GACT,IAAI,MAAM,MAAM;IACZ,IAAI,MACA,IAAI,CAAC;IACT;GACJ;EACJ;EAGA,IAAI,QACA,KAAK,KAAK,MAAM;EACpB,IAAI,OAAO,KAAK,OAAO,GAAG,OAAO,KAAK,OAAO;EAC7C,IAAI,OAAO;EACX,QAAQ,OAAO,KAAK;GAEhB,IAAI,IAAI,GAAG,OAAO,KAAK,GAAG,IAAI,MAAM,MAAM,KAAK;GAC/C,OAAO,IAAI;GACX,IAAI,MAAM,MAAM;IACZ,IAAI,MACA,IAAI,CAAC;IACT;GACJ;GACA,IAAI,CAAC,GACD,IAAI,CAAC;GACT,IAAI,MAAM,KACN,IAAI,QAAQ;QACX,IAAI,OAAO,KAAK;IACjB,OAAO,KAAK,KAAK;IACjB;GACJ,OACK;IACD,IAAI,MAAM,MAAM;IAEhB,IAAI,MAAM,KAAK;KAEX,IAAI,IAAI,MAAM,KAAK,IAAI,KAAK;KAC5B,MAAM,KAAK,KAAK,MAAM,KAAK,KAAK,CAAC,IAAI,GAAG;KACxC,OAAO;IACX;IAEA,IAAI,IAAI,GAAG,OAAO,KAAK,GAAG,IAAI,MAAM,OAAO,KAAK;IAChD,IAAI,CAAC,GACD,IAAI,CAAC;IACT,OAAO,IAAI;IACX,IAAI,KAAK,GAAG;IACZ,IAAI,OAAO,GAAG;KACV,IAAI,IAAI,KAAK;KACb,MAAM,OAAO,KAAK,GAAG,KAAK,KAAK,KAAK,GAAG,OAAO;IAClD;IACA,IAAI,MAAM,MAAM;KACZ,IAAI,MACA,IAAI,CAAC;KACT;IACJ;IACA,IAAI,QACA,KAAK,KAAK,MAAM;IACpB,IAAI,MAAM,KAAK;IACf,IAAI,KAAK,IAAI;KACT,IAAI,QAAQ,KAAK,IAAI,OAAO,KAAK,IAAI,IAAI,GAAG;KAC5C,IAAI,QAAQ,KAAK,GACb,IAAI,CAAC;KACT,OAAO,KAAK,MAAM,EAAE,IAChB,IAAI,MAAM,KAAK,QAAQ;IAC/B;IACA,OAAO,KAAK,KAAK,EAAE,IACf,IAAI,MAAM,IAAI,KAAK;GAC3B;EACJ;EACA,GAAG,IAAI,IAAI,GAAG,IAAI,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;EAC1C,IAAI,IACA,QAAQ,GAAG,GAAG,IAAI,KAAK,GAAG,IAAI,IAAI,GAAG,IAAI;CACjD,SAAS,CAAC;CAEV,OAAO,MAAM,IAAI,UAAU,QAAQ,IAAI,KAAK,GAAG,EAAE,IAAI,IAAI,SAAS,GAAG,EAAE;AAC3E;AAoOA,IAAI,mBAAmB,IAAI,GAAG,CAAC;AAqW/B,IAAI,MAAM,SAAU,GAAG;CACnB,IAAI,EAAE,MAAM,MAAM,EAAE,MAAM,OAAO,EAAE,MAAM,GACrC,IAAI,GAAG,mBAAmB;CAC9B,IAAI,MAAM,EAAE;CACZ,IAAI,KAAK;CACT,IAAI,MAAM,GACN,OAAO,EAAE,MAAM,EAAE,OAAO,KAAK;CACjC,KAAK,IAAI,MAAM,OAAO,IAAI,MAAM,OAAO,IAAI,IAAI,KAAK,GAAG,MAAM,CAAC,EAAE;CAEhE,OAAO,MAAM,MAAM;AACvB;AAEA,IAAI,MAAM,SAAU,GAAG;CACnB,IAAI,IAAI,EAAE;CACV,QAAQ,EAAE,IAAI,KAAK,EAAE,IAAI,MAAM,IAAI,EAAE,IAAI,MAAM,KAAK,EAAE,IAAI,MAAM,QAAQ;AAC5E;AAqYA,SAAgB,WAAW,MAAM,MAAM;CACnC,IAAI,KAAK,IAAI,IAAI;CACjB,IAAI,KAAK,IAAI,KAAK,QACd,IAAI,GAAG,mBAAmB;CAC9B,OAAO,MAAM,KAAK,SAAS,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,QAAQ,KAAK,OAAO,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,QAAQ,KAAK,UAAU;AAChH;AAiRA,IAAI,KAAK,OAAO,eAAe,6BAA6B,IAAI,YAAY;AAG5E,IAAI;CACA,GAAG,OAAO,IAAI,EAAE,QAAQ,KAAK,CAAC;AAElC,SACO,GAAG,CAAE;;;AClpDZ,SAAS,oBAAoB,SAAiB,MAAuD;CACpG,MAAM,IAAI,UAAU,SAAS,EAAE,KAAK,CAAC;AACtC;AAEA,SAAgB,8BACf,OACA,sBACA,UACa;CACb,IAAI,MAAM,aAAa,UACtB,oBAAoB,4CAA4C,WAAW;CAE5E,IAAI,CAAC,sBAAsB,OAAO;CAClC,IAAI,qBAAqB,YAAY,MAAM,QAC1C,oBAAoB,0CAA0C,wBAAwB,aAAa;CAEpG,IAAI;EACH,MAAM,SAAS,WAAW,OAAO,EAAE,KAAK,IAAI,WAAW,WAAW,CAAC,EAAE,CAAC;EACtE,IAAI,OAAO,aAAa,UACvB,oBAAoB,gEAAgE,WAAW;EAEhG,OAAO,OAAO,MAAM;CACrB,SAAS,OAAO;EACf,IAAI,iBAAiB,WAAW,MAAM;EACtC,oBAAoB,+CAA+C,UAAU;CAC9E;AACD;;;;;;;;ACjBA,MAAa,4BAA4B;;AAMzC,MAAa,kCAAkC,KAAK,OAAO;;AAG3D,MAAa,oCAAoC,KAAK,OAAO;;AAM7D,MAAa,iCAAiC;CAC7C;CACA;CACA;CACA;CACA;CACA;CACA;AACD;AAIA,SAAS,gBACR,SACA,OAA6E,YACrE;CACR,MAAM,IAAI,UAAU,SAAS,EAAE,KAAK,CAAC;AACtC;AAEA,SAAS,KAAK,KAAoB,KAAqB;CACtD,QAAQ,IAAI,QAAQ,GAAA,CAAI,KAAK;AAC9B;;;;;AAMA,SAAgB,wBAAwB,KAAqB;CAC5D,MAAM,UAAU,IAAI,KAAK;CACzB,IAAI,QAAQ,WAAW,GAAG,OAAO;CAEjC,MAAM,aAAa,QAAQ,QAAQ,MAAM,EAAE;CAC3C,IAAI;CACJ,IAAI;EACH,QAAQ,IAAI,QAAQ,UAAU;CAC/B,QAAQ;EACP,gBAAgB,gDAAgD,UAAU;CAC3E;CACA,IAAI,CAAC,MAAM,SAAS,GACnB,gBAAgB,8CAA8C,UAAU;CAEzE,MAAM,QAAQ,MAAM,MAAM,GAAG,CAAC,CAAC,gBAAgB,GAAG,QAAQ,aAAa;CACvE,IAAI,CAAC,MAAM,UAAU,GACpB,gBAAgB,8CAA8C,UAAU;CAEzE,MAAM,IAAI,MAAM,SAAS;CACzB,IAAI,CAAC,OAAO,cAAc,CAAC,GAC1B,gBAAgB,sDAAsD,UAAU;CAEjF,OAAO;AACR;;AAGA,SAAgB,uBAAuB,OAAmB,sBAAsD;CAC/G,IAAI,MAAM,aAAA,UACT,gBAAgB,mDAAmD,WAAW;CAE/E,IAAI;EACH,OAAO,8BAA8B,OAAO,sBAAsB,iCAAiC;CACpG,SAAS,OAAO;EACf,IAAI,iBAAiB,aAAa,MAAM,SAAS,aAChD,gBAAgB,qDAAqD,WAAW;EAEjF,IAAI,iBAAiB,aAAa,MAAM,SAAS,eAAe,MAAM;EACtE,gBAAgB,0CAA0C,UAAU;CACrE;AACD;;;;;AAMA,SAAgB,qBAAqB,MAA4C;CAChF,MAAM,SAAS,KAAK,MAAqB,MAAM;EAC9C,WAAW;EACX,QAAQ;EACR,gBAAgB;EAChB,kBAAkB,WAAW,OAAO,KAAK,CAAC,CAAC,QAAQ,WAAW,EAAE;CACjE,CAAC;CAED,IAAI,OAAO,OAAO,SAAS,GAC1B,gBAAgB,6CAA6C,UAAU;CAGxE,MAAM,SAAS,OAAO,KAAK,UAAU,CAAC;CACtC,KAAK,MAAM,YAAY,gCACtB,IAAI,CAAC,OAAO,SAAS,QAAQ,GAC5B,gBAAgB,qEAAqE,UAAU;CAIjG,MAAM,OAAO,OAAO;CACpB,IAAI,KAAK,WAAW,GACnB,gBAAgB,mDAAmD,UAAU;CAE9E,IAAI,KAAK,SAAA,MACR,gBAAgB,2CAA2C,WAAW;CAGvE,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI,YAAY,IAAI,QAAQ,CAAC;CAE7B,KAAK,MAAM,OAAO,MAAM;EACvB,MAAM,kBAAkB,KAAK,KAAK,eAAe;EACjD,MAAM,WAAW,KAAK,KAAK,uBAAuB;EAClD,MAAM,SAAS,KAAK,KAAK,qBAAqB;EAC9C,MAAM,aAAa,KAAK,KAAK,cAAc;EAC3C,MAAM,WAAW,KAAK,KAAK,cAAc;EACzC,MAAM,cAAc,KAAK,KAAK,UAAU;EACxC,MAAM,YAAY,KAAK,KAAK,QAAQ;EAEpC,IAAI,gBAAgB,WAAW,GAC9B,gBAAgB,+CAA+C,UAAU;EAG1E,MAAM,gBAAgB,wBAAwB,QAAQ;EACtD,MAAM,iBAAiB,wBAAwB,SAAS;EAExD,IAAI,iBAAiB,KAAA,GAAW;GAC/B,eAAe;GACf,kBAAkB;GAClB,gBAAgB;GAChB,cAAc;GACd,WAAW;GACX,mBAAmB;EACpB,OAAO;GACN,IAAI,oBAAoB,cACvB,gBAAgB,sDAAsD,UAAU;GAEjF,IAAI,aAAa,mBAAmB,WAAW,eAC9C,gBAAgB,wDAAwD,UAAU;GAEnF,IAAI,gBAAgB,UACnB,gBAAgB,+CAA+C,UAAU;GAE1E,IAAI,kBAAkB,kBACrB,gBAAgB,mDAAmD,UAAU;GAE9E,IAAI,WAAW,SAAS,GAAG;IAC1B,IAAI,eAAe,YAAY,SAAS,KAAK,eAAe,aAC3D,gBAAgB,mDAAmD,UAAU;IAE9E,IAAI,CAAC,eAAe,YAAY,WAAW,GAAG,cAAc;GAC7D;EACD;EAEA,YAAY,UAAU,KAAK,cAAc;CAC1C;CAEA,IACC,iBAAiB,KAAA,KACjB,oBAAoB,KAAA,KACpB,kBAAkB,KAAA,KAClB,aAAa,KAAA,KACb,qBAAqB,KAAA,GAErB,gBAAgB,6CAA6C,UAAU;CAGxE,IAAI,CAAC,UAAU,UAAU,KAAK,CAAC,OAAO,cAAc,UAAU,SAAS,CAAC,GACvE,gBAAgB,0DAA0D,UAAU;CAErF,MAAM,iBAAiB,UAAU,SAAS;CAC1C,IAAI,mBAAmB,kBACtB,gBAAgB,qDAAqD,UAAU;CAGhF,OAAO;EACN,eAAe;EACf,uBAAuB;EACvB,qBAAqB;EACrB,cAAc,eAAe,YAAY,SAAS,IAAI,cAAc;EACpE;EACA,oBAAoB;EACpB,kBAAkB;EAClB,WAAW,KAAK;CACjB;AACD;;AAGA,SAAgB,4BACf,OACA,sBAC+B;CAC/B,IAAI,CAAC,wBAAwB,MAAM,aAAA,UAClC,gBAAgB,wCAAwC,WAAW;CAEpE,MAAM,QAAQ,uBAAuB,OAAO,oBAAoB;CAChE,IAAI,MAAM,aAAA,UACT,gBAAgB,wCAAwC,WAAW;CAGpE,OAAO,qBADM,IAAI,YAAY,SAAS,EAAE,OAAO,MAAM,CAAC,CAAC,CAAC,OAAO,KAChC,CAAC;AACjC;;AAGA,SAAgB,0BAA0B,sBAAM,IAAI,KAAK,GAAG,gBAAA,IAAmD;CAC9G,MAAM,KAAK,gBAAgB,KAAK,KAAK,KAAK;CAC1C,OAAO,IAAI,KAAK,IAAI,QAAQ,IAAI,EAAE,CAAC,CAAC,YAAY;AACjD;;;;;;;;;ACzJA,IAAa,oBAAb,MAAa,kBAAkB;CAC9B;CACA;CACA;;CAEA;CACA;CACA,wBAAwB;CAExB,YAAY,MAAuB,UAAoC,CAAC,GAAG;EAC1E,MAAM,SAAS,sBAAsB,UAAU,IAAI;EACnD,IAAI,CAAC,OAAO,SACX,MAAM,IAAI,UAAU,0CAA0C;GAC7D,MAAM;GACN,SAAS,EAAE,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;EACtE,CAAC;EAEF,KAAKA,QAAQ,OAAO;EACpB,KAAKC,OAAO,IAAI,YAAY;GAC3B,GAAG;GACH,OAAO;EACR,CAAC;EACD,KAAKC,OAAO,IAAI,YAAY;GAC3B,GAAG;GACH,SAAS,KAAKF,MAAM;GACpB,SAAS,EAAE,cAAc,KAAKA,MAAM,WAAW;GAC/C,OAAO;EACR,CAAC;EACD,KAAKG,YAAY,IAAI,YAAY;GAChC,GAAG;GACH,OAAO;EACR,CAAC;CACF;CAEA,OAAO,YAAY,KAAqC;EACvD,MAAM,OAAO,YAAY,KAAK,qBAAqB;EACnD,OAAO,IAAI,kBAAkB,MAAM;GAClC,GAAI,IAAI,SAAS,EAAE,OAAO,IAAI,MAAM;GACpC,GAAI,IAAI,UAAU,EAAE,QAAQ,IAAI,OAAO;EACxC,CAAC;CACF;CAEA,MAAMC,qBAAsC;EAC3C,MAAM,MAAM,KAAK,IAAI;EACrB,IAAI,KAAKC,gBAAgB,MAAM,KAAKC,uBACnC,OAAO,KAAKD;EAEb,MAAM,EAAE,SAAS,MAAM,KAAKJ,KAAK,KAAK,eAAe,aAAa,KAAKD,KAAK,GAAG;GAC9E,OAAO;GACP,SAAS,EAAE,gBAAgB,oCAAoC;EAChE,CAAC;EACD,MAAM,QAAQ,sBAAsB,IAAI;EACxC,KAAKK,eAAe,MAAM;EAC1B,KAAKC,wBAAwB,MAAM,KAAK,IAAI,GAAG,MAAM,aAAa,MAAO,GAAM;EAC/E,OAAO,MAAM;CACd;CAEA,MAAMC,OAAO,MAAc,OAAe,OAA+D;EACxG,MAAM,QAAQ,MAAM,KAAKH,mBAAmB;EAC5C,OAAO,KAAKF,KAAK,IAAI,MAAM;GAC1B;GACA,SAAS,EAAE,sBAAsB,MAAM;GACvC,GAAI,SAAS,EAAE,MAAM;EACtB,CAAC;CACF;CAEA,MAAMM,QAAQ,MAAc,OAAe,MAA+B;EACzE,MAAM,QAAQ,MAAM,KAAKJ,mBAAmB;EAC5C,OAAO,KAAKF,KAAK,KAAK,MAAM,MAAM;GACjC;GACA,SAAS;IACR,sBAAsB;IACtB,gBAAgB;GACjB;EACD,CAAC;CACF;;CAGA,MAAM,WAAW,QAAoC,CAAC,GAAyC;EAC9F,MAAM,iBAAiB,sBACtB,MAAM,iBACN,KAAKF,MAAM,iBACX,0BACD;EACA,MAAM,EAAE,SAAS,MAAM,KAAKO,OAAO,qBAAqB,4BAA4B;GACnF,gBAAgB,eAAe,KAAK,GAAG;GACvC,GAAI,MAAM,iBAAiB,EAAE,cAAc,MAAM,cAAc;GAC/D,GAAI,MAAM,kBAAkB,EAAE,eAAe,MAAM,eAAe;GAClE,GAAI,MAAM,sBAAsB,EAAE,kBAAkB,MAAM,mBAAmB;GAC7E,GAAI,MAAM,kBACT,MAAM,eAAe,SAAS,KAAK,EAClC,eAAe,MAAM,eAAe,KAAK,GAAG,EAC7C;GACD,GAAI,MAAM,UAAU,EAAE,WAAW,MAAM,OAAO;GAC9C,GAAI,MAAM,gBAAgB,KAAA,KAAa,EAAE,mBAAmB,MAAM,YAAY;EAC/E,CAAC;EACD,MAAM,SAAS,mBAAmB,IAAI;EACtC,OAAO;GACN,OAAO,OAAO;GACd,WAAW,QAAQ,OAAO,SAAS;GACnC,GAAI,OAAO,aAAa,EAAE,aAAa,OAAO,UAAU;EACzD;CACD;;CAGA,MAAM,SAAS,OAAqE;EACnF,MAAM,EAAE,SAAS,MAAM,KAAKA,OAC3B,qBAAqB,mBAAmB,MAAM,eAAe,KAC7D,wBACD;EACA,OAAO,EAAE,OAAO,kBAAkB,IAAI,EAAE;CACzC;;CAGA,MAAM,cAAc,OAA+E;EAClG,MAAM,QAAQ,MAAM,SAAS,EAAE,WAAW,MAAM,OAAO,IAAI,KAAA;EAC3D,MAAM,EAAE,SAAS,MAAM,KAAKA,OAC3B,qBAAqB,mBAAmB,MAAM,eAAe,EAAE,cAC/D,+BACA,KACD;EACA,MAAM,SAAS,uBAAuB,IAAI;EAC1C,OAAO;GACN,iBAAiB,OAAO;GACxB,OAAO,OAAO;GACd,WAAW,QAAQ,OAAO,SAAS;GACnC,GAAI,OAAO,aAAa,EAAE,aAAa,OAAO,UAAU;EACzD;CACD;;;;;;CAOA,MAAM,aAAa,OAA6E;EAC/F,MAAM,iBAAiB,sBACtB,MAAM,iBACN,KAAKP,MAAM,iBACX,4BACD;EACA,MAAM,WAAW,MAAM,aAAa;EACpC,MAAM,WAAW,MAAM,eAAe;EACtC,MAAM,QAAgD,CAAC;EACvD,IAAI,SAA6B,MAAM;EACvC,IAAI,QAAQ;EACZ,IAAI;EAEJ,OAAO,QAAQ,UAAU;GACxB,SAAS;GACT,MAAM,EAAE,SAAS,MAAM,KAAKO,OAAO,6BAA6B,8BAA8B;IAC7F,cAAc,MAAM;IACpB,GAAI,MAAM,kBAAkB,EAAE,eAAe,MAAM,eAAe;IAClE,gBAAgB,eAAe,KAAK,GAAG;IACvC,cAAc;IACd,mBAAmB;IACnB,GAAI,UAAU,EAAE,iBAAiB,OAAO;GACzC,CAAC;GACD,MAAM,SAAS,yBAAyB,IAAI;GAC5C,MAAM,KAAK,GAAG,OAAO,KAAK;GAC1B,YAAY,OAAO;GACnB,IAAI,CAAC,WAAW;GAChB,SAAS;EACV;EAEA,OAAO;GACN;GACA,WAAW,QAAQ,SAAS;GAC5B,GAAI,aAAa,EAAE,aAAa,UAAU;EAC3C;CACD;;CAGA,MAAM,0BAA0B,OAA+E;EAC9G,MAAM,cAAc,oCAAoC,UAAU,KAAK;EACvE,IAAI,CAAC,YAAY,SAChB,MAAM,IAAI,UAAU,8CAA8C;GACjE,MAAM;GACN,SAAS,EAAE,QAAQ,YAAY,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;EAC3E,CAAC;EAEF,OAAO,MAAM,KAAKE,+BAA+B;GAChD,gBAAgB,YAAY,KAAK;GACjC,GAAI,YAAY,KAAK,SAAS,iBAAiB,EAAE,iBAAiB,YAAY,KAAK,gBAAgB;GACnG,GAAI,YAAY,KAAK,cAAc,EAAE,YAAY,YAAY,KAAK,WAAW;EAC9E,CAAC;CACF;CAEA,MAAMA,+BAA+B,OAKO;EAC3C,MAAM,SAAS,MAAM,KAAKF,OAAO,+BAA+B,2CAA2C;GAC1G,SAAS;GACT,iBAAiB;GACjB,eAAe,MAAM;GACrB,gBAAgB,MAAM;GACtB,GAAI,MAAM,mBAAmB,EAAE,eAAe,MAAM,gBAAgB;GACpE,GAAI,MAAM,cAAc,EAAE,WAAW,MAAM,WAAW;GACtD,GAAI,MAAM,eAAe,MAAM,YAAY,SAAS,KAAK,EAAE,YAAY,MAAM,YAAY,KAAK,GAAG,EAAE;EACpG,CAAC;EACD,OAAO,0BAA0B,OAAO,MAAM,OAAO,OAAO;CAC7D;;CAGA,MAAM,uBACL,QAAgD,CAAC,GACE;EAMnD,MAAM,gBALiB,sBACtB,MAAM,iBAAiB,CAAC,MAAM,cAAc,IAAI,KAAA,GAChD,KAAKP,MAAM,iBACX,sCAEkC,CAAC,CAAC;EACrC,IAAI,CAAC,eACJ,MAAM,IAAI,UAAU,kEAAkE,EACrF,MAAM,YACP,CAAC;EAEF,MAAM,YAA2C,MAAM,kBACpD;GACA,MAAM;GACN,gBAAgB;GAChB,iBAAiB,MAAM;GACvB,GAAI,MAAM,UAAU,EAAE,YAAY,MAAM,OAAO;EAChD,IACC;GACA,MAAM;GACN,gBAAgB;GAChB,GAAI,MAAM,UAAU,EAAE,YAAY,MAAM,OAAO;EAChD;EACF,MAAM,cAAc,oCAAoC,UAAU,SAAS;EAC3E,IAAI,CAAC,YAAY,SAChB,MAAM,IAAI,UAAU,8CAA8C;GACjE,MAAM;GACN,SAAS,EAAE,QAAQ,YAAY,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;EAC3E,CAAC;EAEF,MAAM,OAAO,MAAM,KAAKS,+BAA+B;GACtD,gBAAgB;GAChB,GAAI,MAAM,mBAAmB,EAAE,iBAAiB,MAAM,gBAAgB;GACtE,GAAI,MAAM,UAAU,EAAE,YAAY,MAAM,OAAO;GAC/C,GAAI,MAAM,eAAe,MAAM,YAAY,SAAS,KAAK,EAAE,aAAa,MAAM,YAAY;EAC3F,CAAC;EACD,OAAO;GACN,OAAO,KAAK,MAAM,IAAI,qBAAqB;GAC3C,WAAW,QAAQ,KAAK,UAAU;GAClC,GAAI,KAAK,cAAc,EAAE,aAAa,KAAK,WAAW;EACvD;CACD;;CAGA,MAAM,aAAa,OAA6E;EAC/F,MAAM,iBAAiB,sBACtB,MAAM,iBACN,KAAKT,MAAM,iBACX,4BACD;EACA,MAAM,OAAgC;GACrC,YAAY,MAAM;GAClB;GACA,GAAI,MAAM,mBAAmB,EAAE,eAAe,MAAM,gBAAgB;GACpE,GAAI,MAAM,iBAAiB,EAAE,aAAa,MAAM,cAAc;GAC9D,GAAI,MAAM,kBAAkB,EAAE,eAAe,MAAM,eAAe;EACnE;EACA,MAAM,EAAE,SAAS,MAAM,KAAKQ,QAAQ,+BAA+B,8BAA8B,IAAI;EACrG,OAAO,yBAAyB,IAAI;CACrC;;CAGA,MAAM,UAAU,OAAuE;EACtF,MAAM,EAAE,SAAS,MAAM,KAAKD,OAC3B,+BAA+B,mBAAmB,MAAM,SAAS,KACjE,yBACD;EACA,OAAO,EAAE,QAAQ,sBAAsB,IAAI,EAAE;CAC9C;;CAGA,MAAM,YAAY,OAA2E;EAC5F,MAAM,cAAc,kCAAkC,UAAU,KAAK;EACrE,IAAI,CAAC,YAAY,SAChB,MAAM,IAAI,UAAU,2CAA2C;GAC9D,MAAM;GACN,SAAS,EAAE,QAAQ,YAAY,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;EAC3E,CAAC;EAEF,MAAM,OACL,YAAY,YAAY,OACrB,MAAM,KAAK,gBAAgB,EAAE,YAAY,YAAY,KAAK,OAAO,CAAC,IAClE,MAAM,KAAK,gBAAgB;GAC3B,cAAc,YAAY,KAAK;GAC/B,GAAI,YAAY,KAAK,uBAAuB,EAC3C,qBAAqB,YAAY,KAAK,oBACvC;GACA,GAAI,YAAY,KAAK,mBAAmB,EAAE,iBAAiB,YAAY,KAAK,gBAAgB;GAC5F,GAAI,YAAY,KAAK,cAAc,KAAA,KAAa,EAAE,WAAW,YAAY,KAAK,UAAU;GACxF,GAAI,YAAY,KAAK,iBAAiB,EAAE,eAAe,YAAY,KAAK,cAAc;GACtF,GAAI,YAAY,KAAK,iBAAiB,EAAE,eAAe,YAAY,KAAK,cAAc;EACvF,CAAC;EACJ,OAAO;GACN,OAAO,KAAK,MAAM,IAAI,WAAW;GACjC,WAAW,QAAQ,KAAK,UAAU;GAClC,GAAI,KAAK,cAAc,EAAE,aAAa,KAAK,WAAW;EACvD;CACD;;CAGA,MAAM,gBAAgB,OAAmF;EACxG,MAAM,cAAc,sCAAsC,UAAU,KAAK;EACzE,IAAI,CAAC,YAAY,SAChB,MAAM,IAAI,UAAU,4CAA4C;GAC/D,MAAM;GACN,SAAS,EAAE,QAAQ,YAAY,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;EAC3E,CAAC;EAEF,IAAI;EACJ,IAAI,gBAAgB,YAAY,MAC/B,QAAQ,EAAE,WAAW,YAAY,KAAK,WAAW;OAC3C;GACN,MAAM,iBAAiB,YAAY,KAAK,mBAAmB,KAAKP,MAAM;GACtE,QAAQ;IACP,aAAa,YAAY,KAAK,aAAa,KAAK,GAAG;IACnD,GAAI,YAAY,KAAK,uBAAuB,EAC3C,oBAAoB,YAAY,KAAK,oBAAoB,KAAK,GAAG,EAClE;IACA,GAAI,kBAAkB,EAAE,gBAAgB,eAAe,KAAK,GAAG,EAAE;IACjE,GAAI,YAAY,KAAK,cAAc,KAAA,KAAa,EAAE,UAAU,YAAY,KAAK,UAAU;IACvF,GAAI,YAAY,KAAK,iBAAiB,EAAE,cAAc,YAAY,KAAK,cAAc;IACrF,GAAI,YAAY,KAAK,iBAAiB,EAAE,cAAc,YAAY,KAAK,cAAc;GACtF;EACD;EACA,MAAM,SAAS,MAAM,KAAKO,OAAO,+BAA+B,iCAAiC,KAAK;EACtG,OAAO,4BAA4B,OAAO,MAAM,OAAO,OAAO;CAC/D;;CAGA,MAAM,kBAAkB,OAAuF;EAC9G,MAAM,EAAE,SAAS,MAAM,KAAKA,OAC3B,iCAAiC,mBAAmB,MAAM,kBAAkB,KAC5E,iCACD;EACA,OAAO,2BAA2B,IAAI;CACvC;;CAGA,MAAM,4BACL,OACwD;EACxD,MAAM,cAAc,kDAAkD,UAAU,KAAK;EACrF,IAAI,CAAC,YAAY,SAChB,MAAM,IAAI,UAAU,iDAAiD;GACpE,MAAM;GACN,SAAS,EAAE,QAAQ,YAAY,MAAM,OAAO,KAAK,UAAU,MAAM,OAAO,EAAE;EAC3E,CAAC;EAEF,MAAM,WAAW,MAAM,KAAK,kBAAkB,EAAE,oBAAoB,YAAY,KAAK,mBAAmB,CAAC;EACzG,OAAO,KAAKG,kCAAkC,UAAU,YAAY,KAAK,SAAS;CACnF;CAEA,MAAMA,kCACL,UACA,UACwD;EACxD,IAAI;EACJ,IAAI,SAAS,uBAAuB;GACnC,IAAI,SAAS,sBAAsB,YAAY,MAAM,QACpD,MAAM,IAAI,UAAU,0CAA0C,SAAS,yBAAyB,EAC/F,MAAM,cACP,CAAC;GAEF,uBAAuB;EACxB;EACA,MAAM,SAAS,MAAM,KAAKP,UAAU,MAAM,OAAO,SAAS,KAAK;GAC9D,OAAO;GACP;EACD,CAAC;EACD,MAAM,QAAQ,8BAA8B,OAAO,OAAO,sBAAsB,QAAQ;EACxF,MAAM,cAAc,OAAO,QAAQ,IAAI,cAAc,KAAK,KAAA;EAC1D,MAAM,kBAAkB,OAAO,QAAQ,IAAI,kBAAkB,KAAK,KAAA;EAClE,OAAO;GACN;GACA,MAAM,YAAY,KAAK;GACvB,aAAa,MAAM;GACnB,GAAI,eAAe,EAAE,cAAc,YAAY;GAC/C,GAAI,mBAAmB,EAAE,kBAAkB,gBAAgB;GAC3D,GAAI,wBAAwB,EAAE,uBAAuB,qBAAqB;EAC3E;CACD;;;;;;CAOA,MAAM,qBACL,QAA8C,CAAC,GACE;EACjD,MAAM,mBAAmB,MAAM,KAAKQ,mCAAmC,KAAK;EAC5E,MAAM,MAAM,MAAM,KAAK,kBAAkB,EAAE,oBAAoB,iBAAiB,CAAC;EAEjF,MAAM,EAAE,UAAU,MAAM,KAAKR,UAAU,MAAM,OAAO,IAAI,KAAK;GAC5D,OAAO;GACP,UAAU;EACX,CAAC;EACD,OAAO,4BAA4B,OAAO,IAAI,qBAAqB;CACpE;CAEA,MAAMQ,mCAAmC,OAA8D;EACtG,IAAI,MAAM,WAAW;GACpB,MAAM,EAAE,WAAW,MAAM,KAAK,UAAU,EAAE,WAAW,MAAM,UAAU,CAAC;GACtE,IAAI,OAAO,qBAAqB,OAAO,sBAAsB,QAC5D,MAAM,IAAI,UAAU,iCAAiC;IACpD,MAAM;IACN,SAAS,EAAE,mBAAmB,OAAO,kBAAkB;GACxD,CAAC;GAEF,IAAI,CAAC,OAAO,oBACX,MAAM,IAAI,UAAU,wCAAwC,EAAE,MAAM,WAAW,CAAC;GAEjF,OAAO,OAAO;EACf;EAEA,MAAM,eAAe,MAAM,iBAAiB,0BAA0B;EAEtE,IAAI;EACJ,KAAK,IAAI,OAAO,GAAG,OAAO,GAAG,QAAQ,GAAG;GACvC,MAAM,SAAS,SACZ,MAAM,KAAK,YAAY,EAAE,OAAO,CAAC,IACjC,MAAM,KAAK,YAAY;IACvB,cAAc,CAAC,yBAAyB;IACxC,qBAAqB,CAAC,MAAM;IAC5B,eAAe;IACf,WAAW;GACZ,CAAC;GACH,KAAK,MAAM,UAAU,OAAO,OAC3B,IAAI,OAAO,oBACV,OAAO,OAAO;GAGhB,IAAI,CAAC,OAAO,aAAa;GACzB,SAAS,OAAO;EACjB;EAEA,MAAM,IAAI,UAAU,gEAAgE,EACnF,MAAM,YACP,CAAC;CACF;;CAGA,MAAM,mBAAmB,OAAyF;EACjH,MAAM,iBAAiB,sBACtB,MAAM,iBACN,KAAKX,MAAM,iBACX,kCACD;EACA,MAAM,EAAE,SAAS,MAAM,KAAKO,OAAO,6BAA6B,oCAAoC;GACnG,UAAU,MAAM,SAAS,KAAK,GAAG;GACjC,gBAAgB,eAAe,KAAK,GAAG;GACvC,GAAI,MAAM,iBACT,MAAM,cAAc,SAAS,KAAK,EACjC,cAAc,MAAM,cAAc,KAAK,GAAG,EAC3C;GACD,GAAI,MAAM,cAAc,KAAA,KAAa,EAAE,UAAU,MAAM,UAAU;GACjE,GAAI,MAAM,UAAU,EAAE,WAAW,MAAM,OAAO;EAC/C,CAAC;EACD,MAAM,SAAS,+BAA+B,IAAI;EAClD,OAAO;GACN,OAAO,OAAO;GACd,WAAW,QAAQ,OAAO,SAAS;GACnC,GAAI,OAAO,oBAAoB,KAAA,KAAa,EAAE,mBAAmB,OAAO,gBAAgB;GACxF,GAAI,OAAO,aAAa,EAAE,aAAa,OAAO,UAAU;EACzD;CACD;AACD;;;ACjhBA,MAAa,4BAA4B,WAAW;CACnD,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,WAAW,KAAK;AACnF,CAAC;AAED,MAAa,0BAA0B,WAAW;CACjD,IAAI;CACJ,MAAM;CACN,aAAa;CACb,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,SAAS,KAAK;AACjF,CAAC;AAED,MAAa,+BAA+B,WAAW;CACtD,IAAI;CACJ,MAAM;CACN,aAAa;CACb,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,cAAc,KAAK;AACtF,CAAC;AAED,MAAa,8BAA8B,WAAW;CACrD,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,aAAa,KAAK;AACrF,CAAC;AAED,MAAa,wCAAwC,WAAW;CAC/D,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,uBAAuB,KAAK;AAC/F,CAAC;AAED,MAAa,8BAA8B,WAAW;CACrD,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,aAAa,KAAK;AACrF,CAAC;AAED,MAAa,2BAA2B,WAAW;CAClD,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,UAAU,KAAK;AAClF,CAAC;AAED,MAAa,6BAA6B,WAAW;CACpD,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,YAAY,KAAK;AACpF,CAAC;AAED,MAAa,oCAAoC,WAAW;CAC3D,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,mBAAmB,KAAK;AAC3F,CAAC;AAED,MAAa,sCAAsC,WAAW;CAC7D,IAAI;CACJ,MAAM;CACN,aACC;CACD,aAAa;CACb,cAAc;CACd,YAAY;CACZ,SAAS;CACT,SAAS,OAAO,OAAO,QAAQ,kBAAkB,YAAY,GAAG,CAAC,CAAC,qBAAqB,KAAK;AAC7F,CAAC;AAED,MAAa,oBAAoB,aAAa;CAC7C,IAAI;CACJ,OAAO;CACP,aACC;CACD,SAAS;CACT,MAAM;EAAE,MAAM;EAAU,QAAQ;CAAsB;CACtD,YAAY,CAAC,YAAY,QAAQ;CACjC,gBAAgB;CAChB,MAAM;EAAC;EAAU;EAAO;CAAS;CACjC,OAAO;EACN;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACD;AACD,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@5ss/ai-tools",
-	"version": "3.0.1",
+	"version": "3.0.2",
 	"description": "Reusable AI tools with strict schemas and model-facing contracts. Define once; project to Node, edge, Mastra, AI SDK, TanStack AI, Cloudflare Workers AI, or MCP.",
 	"license": "MIT",
 	"author": "harryy",
@@ -228,13 +228,14 @@
 		"integration:up:compose": "docker compose -f docker-compose.integration.yml up -d --wait qdrant minio && docker compose -f docker-compose.integration.yml up --no-deps minio-init",
 		"integration:up:supabase": "bunx supabase start",
 		"integration:env": "bun scripts/integration-env.ts",
-		"integration:up": "bun run --parallel integration:up:compose integration:up:supabase && bun run integration:env",
+		"integration:up": "bun scripts/integration-stack.ts up",
 		"integration:down:compose": "docker compose -f docker-compose.integration.yml down --remove-orphans",
 		"integration:down:supabase": "bunx supabase stop",
-		"integration:down": "bun run --parallel integration:down:compose integration:down:supabase",
+		"integration:down": "bun scripts/integration-stack.ts down",
 		"integration:logs": "docker compose -f docker-compose.integration.yml logs -f",
-		"integration:status": "docker compose -f docker-compose.integration.yml ps && bunx supabase status",
+		"integration:status": "bun scripts/integration-stack.ts status",
 		"integration:e2e": "bun scripts/integration-e2e.ts",
+		"integration:e2e:ci": "bun scripts/integration-e2e.ts --down",
 		"lint": "oxlint --type-aware src test scripts",
 		"lint:fix": "oxlint --type-aware --fix src test scripts",
 		"format": "oxfmt --write .",
@@ -262,7 +263,7 @@
 		"p-map": "7.0.6",
 		"p-retry": "8.0.0",
 		"papaparse": "5.5.4",
-		"postal-mime": "2.7.5",
+		"postal-mime": "3.0.0",
 		"sharp": "0.35.3",
 		"zod": "4.4.3"
 	},
@@ -276,16 +277,16 @@
 		"@semantic-release/github": "12.0.9",
 		"@semantic-release/npm": "13.1.5",
 		"@semantic-release/release-notes-generator": "14.1.1",
-		"@tanstack/ai": "0.43.0",
+		"@tanstack/ai": "0.44.0",
 		"@types/bun": "1.3.14",
 		"@types/html-to-text": "9.0.4",
 		"@types/papaparse": "5.5.2",
-		"ai": "7.0.55",
-		"conventional-changelog-conventionalcommits": "10.2.1",
+		"ai": "7.0.62",
+		"conventional-changelog-conventionalcommits": "10.3.0",
 		"lefthook": "2.1.10",
-		"oxc-parser": "0.143.0",
-		"oxfmt": "0.62.0",
-		"oxlint": "1.77.0",
+		"oxc-parser": "0.144.0",
+		"oxfmt": "0.63.0",
+		"oxlint": "1.78.0",
 		"oxlint-tsgolint": "7.0.2001",
 		"semantic-release": "25.0.9",
 		"tsdown": "0.22.14",