icechunk-js 0.5.0 → 0.6.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/dist/index.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/storage/storage.ts","../src/format/constants.ts","../src/format/object-id.ts","../src/format/flatbuffers/repo-parser.ts","../src/format/flatbuffers/generated/metadata-item.ts","../src/format/flatbuffers/generated/ref.ts","../src/format/flatbuffers/generated/repo-status.ts","../src/format/flatbuffers/generated/object-id12.ts","../src/format/flatbuffers/generated/snapshot-info.ts","../src/format/flatbuffers/generated/update.ts","../src/format/flatbuffers/generated/repo.ts","../src/vendor/fzstd/index.ts","../src/format/header.ts","../src/cache/lru.ts","../src/cache/single-flight.ts","../src/format/flatbuffers/types.ts","../src/format/flatbuffers/snapshot-parser.ts","../src/format/flatbuffers/generated/manifest-file-info.ts","../src/format/flatbuffers/generated/manifest-file-info-v2.ts","../src/format/flatbuffers/generated/dimension-name.ts","../src/format/flatbuffers/generated/dimension-shape.ts","../src/format/flatbuffers/generated/dimension-shape-v2.ts","../src/format/flatbuffers/generated/chunk-index-range.ts","../src/format/flatbuffers/generated/manifest-ref.ts","../src/format/flatbuffers/generated/array-node-data.ts","../src/format/flatbuffers/generated/object-id8.ts","../src/format/flatbuffers/generated/node-snapshot.ts","../src/format/flatbuffers/generated/snapshot.ts","../src/format/flatbuffers/manifest-parser.ts","../src/format/flatbuffers/generated/chunk-ref.ts","../src/format/flatbuffers/generated/array-manifest.ts","../src/format/flatbuffers/generated/manifest.ts","../src/format/flatbuffers/metadata.ts","../src/format/flatbuffers/transaction-log-parser.ts","../src/format/flatbuffers/generated/chunk-indices.ts","../src/format/flatbuffers/generated/array-updated-chunks.ts","../src/format/flatbuffers/generated/move-operation.ts","../src/format/flatbuffers/generated/transaction-log.ts","../src/reader/range-coalescer.ts","../src/reader/session.ts","../src/reader/repository.ts","../src/storage/http-storage.ts","../src/store.ts"],"sourcesContent":["/**\n * Storage interface for icechunk repositories.\n */\n\n/** Byte range for partial reads */\nexport interface ByteRange {\n /** Start offset (inclusive) */\n start: number;\n\n /** End offset (exclusive) */\n end: number;\n}\n\n/**\n * Pluggable HTTP client for virtual chunk fetching.\n *\n * Use this to:\n * - Generate pre-signed S3 URLs\n * - Add authentication headers\n * - Route through a proxy\n *\n * icechunk-js handles URL translation (s3:// → https://) and builds\n * all headers (Range, If-Match, etc.) before calling fetch().\n * The client only needs to execute the HTTP request.\n */\nexport interface FetchClient {\n fetch(url: string, init?: RequestInit): Promise<Response>;\n}\n\n/** Default FetchClient that delegates to globalThis.fetch. */\nexport class DefaultFetchClient implements FetchClient {\n fetch(url: string, init?: RequestInit): Promise<Response> {\n return globalThis.fetch(url, init);\n }\n}\n\n/** Options for storage request operations */\nexport interface RequestOptions {\n /** AbortSignal for request cancellation */\n signal?: AbortSignal;\n /** Pluggable HTTP client for virtual chunk fetching */\n fetchClient?: FetchClient;\n /**\n * Send If-Match / If-Unmodified-Since headers on virtual chunk requests.\n *\n * When true, the storage server will return 412 Precondition Failed if\n * the underlying file has changed since the snapshot recorded its checksum.\n *\n * Defaults to false because these headers trigger CORS preflight requests\n * in browsers, and most storage servers don't whitelist them by default.\n */\n validateChecksums?: boolean;\n /**\n * Azure storage account name for translating az:// and azure:// URLs.\n *\n * Required when virtual chunks reference az:// or azure:// URLs, since\n * these schemes encode only the container name (e.g., az://container/path).\n * The account is needed to build the HTTPS endpoint:\n * https://{account}.blob.core.windows.net/{container}/{path}\n *\n * Not needed for abfs:// URLs, which embed the account in the host.\n */\n azureAccount?: string;\n}\n\n/** Error thrown when an object is not found */\nexport class NotFoundError extends Error {\n constructor(public readonly path: string) {\n super(`Object not found: ${path}`);\n this.name = \"NotFoundError\";\n }\n}\n\n/** Error thrown for storage operations */\nexport class StorageError extends Error {\n constructor(\n message: string,\n public readonly cause?: Error,\n ) {\n super(message);\n this.name = \"StorageError\";\n }\n}\n\ntype ErrorWithName = { name: unknown };\n\nfunction hasErrorName(error: unknown): error is ErrorWithName {\n return typeof error === \"object\" && error !== null && \"name\" in error;\n}\n\n/** True for web-platform abort errors from fetch/AbortSignal. */\nexport function isAbortError(\n error: unknown,\n): error is ErrorWithName & { name: \"AbortError\" } {\n return hasErrorName(error) && error.name === \"AbortError\";\n}\n\n/**\n * Storage interface for reading icechunk data.\n *\n * Implementations should handle authentication, caching, etc.\n */\nexport interface Storage {\n /**\n * Get an object from storage.\n *\n * @param path - Path to the object (relative to repository root)\n * @param range - Optional byte range for partial reads\n * @param options - Optional request options (signal for cancellation)\n * @returns Object data as bytes\n * @throws NotFoundError if the object doesn't exist\n * @throws StorageError for other errors\n * @throws An error named \"AbortError\" if the operation was aborted\n */\n getObject(\n path: string,\n range?: ByteRange,\n options?: RequestOptions,\n ): Promise<Uint8Array>;\n\n /**\n * Check if an object exists.\n *\n * @param path - Path to the object\n * @param options - Optional request options (signal for cancellation)\n * @returns True if the object exists\n * @throws An error named \"AbortError\" if the operation was aborted\n */\n exists(path: string, options?: RequestOptions): Promise<boolean>;\n\n /**\n * List objects with a given prefix.\n *\n * @param prefix - Path prefix to filter by\n * @returns Async iterable of object paths\n */\n listPrefix(prefix: string): AsyncIterable<string>;\n}\n","/**\n * Icechunk format constants.\n */\n\n/** Storage path constants */\nexport const PATHS = {\n /** Refs directory */\n REFS: \"refs\",\n\n /** Snapshots directory */\n SNAPSHOTS: \"snapshots\",\n\n /** Manifests directory */\n MANIFESTS: \"manifests\",\n\n /** Chunks directory */\n CHUNKS: \"chunks\",\n\n /** Transaction logs directory */\n TRANSACTIONS: \"transactions\",\n} as const;\n\n/** Repository info file path (v2 format) */\nexport const REPO_INFO_PATH = \"repo\";\n\n/**\n * Get the storage path prefix for a branch ref directory.\n *\n * When storage supports listPrefix(), refs may use versioned filenames\n * (e.g., AAAAAAAA.json) for optimistic concurrency control. When listing\n * is not supported (e.g., HTTP storage), only the legacy ref.json path\n * is checked.\n *\n * @param name - Branch name\n * @returns Path to the branch ref directory (with trailing slash)\n */\nexport function getBranchRefDirPath(name: string): string {\n return `${PATHS.REFS}/branch.${name}/`;\n}\n\n/**\n * Get the storage path prefix for a tag ref directory.\n *\n * When storage supports listPrefix(), refs may use versioned filenames.\n * When listing is not supported (e.g., HTTP storage), only the legacy\n * ref.json path is checked.\n *\n * @param name - Tag name\n * @returns Path to the tag ref directory (with trailing slash)\n */\nexport function getTagRefDirPath(name: string): string {\n return `${PATHS.REFS}/tag.${name}/`;\n}\n\n/**\n * Default ref file name for legacy compatibility.\n * When storage supports listPrefix(), refs may use versioned filenames\n * for optimistic concurrency control. When listing is not supported,\n * this legacy filename is used as the fallback.\n */\nexport const REF_FILE_NAME = \"ref.json\";\n\n/**\n * Get the storage path for a branch ref file (legacy format).\n * Note: In production, refs use versioned filenames. Use getBranchRefDirPath\n * and findLatestRefFile for reading refs.\n *\n * @param name - Branch name\n * @returns Path to the branch ref file (legacy format)\n */\nexport function getBranchRefPath(name: string): string {\n return `${PATHS.REFS}/branch.${name}/${REF_FILE_NAME}`;\n}\n\n/**\n * Get the storage path for a tag ref file (legacy format).\n * Note: In production, refs use versioned filenames. Use getTagRefDirPath\n * and findLatestRefFile for reading refs.\n *\n * @param name - Tag name\n * @returns Path to the tag ref file (legacy format)\n */\nexport function getTagRefPath(name: string): string {\n return `${PATHS.REFS}/tag.${name}/${REF_FILE_NAME}`;\n}\n\n/**\n * Get the storage path for a snapshot.\n *\n * @param id - Snapshot ID as Base32 string\n * @returns Path to the snapshot file\n */\nexport function getSnapshotPath(id: string): string {\n return `${PATHS.SNAPSHOTS}/${id}`;\n}\n\n/**\n * Get the storage path for a manifest.\n *\n * @param id - Manifest ID as Base32 string\n * @returns Path to the manifest file\n */\nexport function getManifestPath(id: string): string {\n return `${PATHS.MANIFESTS}/${id}`;\n}\n\n/**\n * Get the storage path for a chunk.\n *\n * @param id - Chunk ID as Base32 string\n * @returns Path to the chunk file\n */\nexport function getChunkPath(id: string): string {\n return `${PATHS.CHUNKS}/${id}`;\n}\n\n/**\n * Get the storage path for a transaction log.\n *\n * @param id - Snapshot ID as Base32 string\n * @returns Path to the transaction log file\n */\nexport function getTransactionLogPath(id: string): string {\n return `${PATHS.TRANSACTIONS}/${id}`;\n}\n","/**\n * Object ID encoding/decoding using Base32 Crockford.\n *\n * Icechunk uses Base32 Crockford for encoding object IDs:\n * - 12-byte IDs (SnapshotId, ManifestId, ChunkId) → 20 characters\n * - 8-byte IDs (NodeId) → 13 characters\n *\n * Crockford Base32 alphabet: 0123456789ABCDEFGHJKMNPQRSTVWXYZ\n * (excludes I, L, O, U to avoid confusion)\n */\n\n/** Crockford Base32 encoding alphabet */\nconst ENCODE_ALPHABET = \"0123456789ABCDEFGHJKMNPQRSTVWXYZ\";\n\n/** Crockford Base32 decoding map (handles lowercase and common substitutions) */\nconst DECODE_MAP: Record<string, number> = {};\n\n// Build decode map\nfor (let i = 0; i < ENCODE_ALPHABET.length; i++) {\n const char = ENCODE_ALPHABET[i];\n DECODE_MAP[char] = i;\n DECODE_MAP[char.toLowerCase()] = i;\n}\n\n// Handle common substitutions\nDECODE_MAP[\"I\"] = DECODE_MAP[\"i\"] = 1; // I → 1\nDECODE_MAP[\"L\"] = DECODE_MAP[\"l\"] = 1; // L → 1\nDECODE_MAP[\"O\"] = DECODE_MAP[\"o\"] = 0; // O → 0\n\n/**\n * Encode bytes to Base32 Crockford string.\n *\n * @param bytes - Bytes to encode\n * @returns Base32 Crockford encoded string (uppercase)\n */\nexport function encodeBase32(bytes: Uint8Array): string {\n if (bytes.length === 0) return \"\";\n\n let result = \"\";\n let buffer = 0;\n let bitsLeft = 0;\n\n for (const byte of bytes) {\n buffer = (buffer << 8) | byte;\n bitsLeft += 8;\n\n while (bitsLeft >= 5) {\n bitsLeft -= 5;\n const index = (buffer >> bitsLeft) & 0x1f;\n result += ENCODE_ALPHABET[index];\n }\n }\n\n // Handle remaining bits\n if (bitsLeft > 0) {\n const index = (buffer << (5 - bitsLeft)) & 0x1f;\n result += ENCODE_ALPHABET[index];\n }\n\n return result;\n}\n\n/**\n * Decode Base32 Crockford string to bytes.\n *\n * @param str - Base32 Crockford encoded string\n * @returns Decoded bytes\n * @throws Error if the string contains invalid characters\n */\nexport function decodeBase32(str: string): Uint8Array {\n if (str.length === 0) return new Uint8Array(0);\n\n // Remove hyphens (Crockford allows hyphens for readability)\n str = str.replace(/-/g, \"\");\n\n const result: number[] = [];\n let buffer = 0;\n let bitsLeft = 0;\n\n for (const char of str) {\n const value = DECODE_MAP[char];\n if (value === undefined) {\n throw new Error(`Invalid Base32 Crockford character: ${char}`);\n }\n\n buffer = (buffer << 5) | value;\n bitsLeft += 5;\n\n if (bitsLeft >= 8) {\n bitsLeft -= 8;\n result.push((buffer >> bitsLeft) & 0xff);\n }\n }\n\n return new Uint8Array(result);\n}\n\n/**\n * Encode a 12-byte object ID to string.\n *\n * @param id - 12-byte ID\n * @returns Base32 Crockford encoded string (20 characters)\n */\nexport function encodeObjectId12(id: Uint8Array): string {\n if (id.length !== 12) {\n throw new Error(`Expected 12 bytes, got ${id.length}`);\n }\n return encodeBase32(id);\n}\n\n/**\n * Decode a string to 12-byte object ID.\n *\n * @param str - Base32 Crockford encoded string\n * @returns 12-byte ID\n */\nexport function decodeObjectId12(str: string): Uint8Array {\n const bytes = decodeBase32(str);\n if (bytes.length !== 12) {\n throw new Error(`Expected 12 bytes after decoding, got ${bytes.length}`);\n }\n return bytes;\n}\n\n/**\n * Encode an 8-byte object ID to string.\n *\n * @param id - 8-byte ID\n * @returns Base32 Crockford encoded string (13 characters)\n */\nexport function encodeObjectId8(id: Uint8Array): string {\n if (id.length !== 8) {\n throw new Error(`Expected 8 bytes, got ${id.length}`);\n }\n return encodeBase32(id);\n}\n\n/**\n * Decode a string to 8-byte object ID.\n *\n * @param str - Base32 Crockford encoded string\n * @returns 8-byte ID\n */\nexport function decodeObjectId8(str: string): Uint8Array {\n const bytes = decodeBase32(str);\n if (bytes.length !== 8) {\n throw new Error(`Expected 8 bytes after decoding, got ${bytes.length}`);\n }\n return bytes;\n}\n","/**\n * Parser for icechunk Repo FlatBuffer format (v2).\n *\n * Uses flatc-generated TypeScript classes for type-safe field access.\n */\n\nimport { ByteBuffer } from \"flatbuffers\";\nimport * as flexbuffers from \"flatbuffers/js/flexbuffers.js\";\nimport { Repo as FbsRepo } from \"./generated/repo.js\";\nimport { decompress } from \"../../vendor/fzstd/index.js\";\nimport {\n parseHeader,\n getDataAfterHeader,\n FileType,\n validateFileType,\n CompressionAlgorithm,\n HEADER_SIZE,\n} from \"../header.js\";\n\nconst SUPPORTED_SPEC_VERSION = 2;\n\n/** Parsed repo file with cached metadata */\nexport interface ParsedRepo {\n repo: FbsRepo;\n specVersion: number;\n snapshotsLength: number; // Cached for bounds checking\n /**\n * Map of Virtual Chunk Container name → `url_prefix` for resolving\n * relative `vcc://name/path` chunk locations. Empty when the repo has\n * no named containers (unnamed/legacy entries are excluded).\n */\n virtualChunkContainers: Map<string, string>;\n}\n\n/**\n * Parse a v2 repo file from raw file data (including icechunk header).\n *\n * @throws Error if header is invalid, file type is wrong, or spec_version is unsupported\n */\nexport function parseRepo(data: Uint8Array): ParsedRepo {\n // Validate minimum size\n if (data.length < HEADER_SIZE) {\n throw new Error(\n `Repo file too small: ${data.length} bytes, need at least ${HEADER_SIZE}`,\n );\n }\n\n // Parse and validate icechunk header\n const header = parseHeader(data);\n validateFileType(header, FileType.RepoInfo);\n\n // Get data after header and decompress if needed\n let fbData = getDataAfterHeader(data);\n if (header.compression === CompressionAlgorithm.Zstd) {\n fbData = decompress(fbData);\n }\n\n // Parse FlatBuffer root table\n const bb = new ByteBuffer(fbData);\n const repo = FbsRepo.getRootAsRepo(bb);\n const specVersion = repo.specVersion();\n\n if (specVersion !== SUPPORTED_SPEC_VERSION) {\n throw new Error(\n `Unsupported repo spec version: ${specVersion}, expected ${SUPPORTED_SPEC_VERSION}`,\n );\n }\n\n const snapshotsLength = repo.snapshotsLength();\n const virtualChunkContainers = parseVirtualChunkContainers(repo);\n\n return { repo, specVersion, snapshotsLength, virtualChunkContainers };\n}\n\n/**\n * Extract named Virtual Chunk Containers from the flexbuffers-encoded\n * RepositoryConfig on the repo table.\n *\n * Only containers with a non-null `name` are included — unnamed/legacy\n * containers cannot be referenced by `vcc://` URLs.\n *\n * Returns an empty map when the config is absent, malformed, or has no\n * named containers. Parsing failures are swallowed because virtual chunk\n * resolution is a best-effort path; callers that actually hit a `vcc://`\n * location with no matching name will surface a clear error at fetch time.\n */\nfunction parseVirtualChunkContainers(repo: FbsRepo): Map<string, string> {\n const result = new Map<string, string>();\n const configBytes = repo.configArray();\n if (!configBytes || configBytes.length === 0) return result;\n\n let config: unknown;\n try {\n const ab = configBytes.buffer.slice(\n configBytes.byteOffset,\n configBytes.byteOffset + configBytes.byteLength,\n ) as ArrayBuffer;\n config = flexbuffers.toObject(ab);\n } catch {\n return result;\n }\n\n if (!isRecord(config)) return result;\n const containers = config.virtual_chunk_containers;\n if (!isRecord(containers)) return result;\n\n for (const container of Object.values(containers)) {\n if (!isRecord(container)) continue;\n const { name, url_prefix: urlPrefix } = container;\n if (typeof name !== \"string\" || typeof urlPrefix !== \"string\") continue;\n result.set(name, urlPrefix);\n }\n\n return result;\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\n/**\n * Compare two byte arrays by UTF-8 byte order (matching Rust's Ord for String).\n */\nfunction compareUtf8ByteOrder(aBytes: Uint8Array, bBytes: Uint8Array): number {\n const minLen = Math.min(aBytes.length, bBytes.length);\n\n for (let i = 0; i < minLen; i++) {\n if (aBytes[i] < bBytes[i]) return -1;\n if (aBytes[i] > bBytes[i]) return 1;\n }\n\n return aBytes.length - bBytes.length;\n}\n\n/**\n * Binary search for a ref by name in tags or branches.\n *\n * @returns Snapshot ID bytes if found, null otherwise\n * @throws Error on corrupted data (null tables, invalid indices)\n */\nfunction binarySearchRef(\n parsedRepo: ParsedRepo,\n accessor: (index: number) => ReturnType<FbsRepo[\"tags\"]>,\n length: number,\n name: string,\n): Uint8Array | null {\n const { snapshotsLength } = parsedRepo;\n if (length === 0) return null;\n\n // Cache target bytes outside loop\n const targetBytes = new TextEncoder().encode(name);\n\n let low = 0;\n let high = length - 1;\n\n while (low <= high) {\n const mid = (low + high) >>> 1;\n const refTable = accessor(mid);\n\n if (!refTable) {\n throw new Error(`Corrupted repo file: null ref table at index ${mid}`);\n }\n\n const refName = refTable.name();\n if (refName === null) {\n throw new Error(`Corrupted repo file: null ref name at index ${mid}`);\n }\n\n const refNameBytes = new TextEncoder().encode(refName);\n const cmp = compareUtf8ByteOrder(refNameBytes, targetBytes);\n\n if (cmp < 0) {\n low = mid + 1;\n } else if (cmp > 0) {\n high = mid - 1;\n } else {\n // Found - validate and return snapshot ID\n const snapshotIndex = refTable.snapshotIndex();\n\n if (snapshotIndex >= snapshotsLength) {\n throw new Error(\n `Invalid snapshot index ${snapshotIndex} for ref '${name}', ` +\n `snapshots array has ${snapshotsLength} entries`,\n );\n }\n\n return getSnapshotIdByIndex(parsedRepo, snapshotIndex);\n }\n }\n\n return null;\n}\n\n/**\n * Get snapshot ID by index from the snapshots vector.\n *\n * @throws Error on corrupted data (null snapshot, missing id)\n */\nfunction getSnapshotIdByIndex(\n parsedRepo: ParsedRepo,\n index: number,\n): Uint8Array {\n const snapshotInfo = parsedRepo.repo.snapshots(index);\n if (!snapshotInfo) {\n throw new Error(`Corrupted repo file: null snapshot at index ${index}`);\n }\n\n const idObj = snapshotInfo.id();\n if (!idObj) {\n throw new Error(`Corrupted repo file: snapshot ${index} missing id`);\n }\n\n return idObj.bb!.bytes().slice(idObj.bb_pos, idObj.bb_pos + 12);\n}\n\n/**\n * List all ref names from tags or branches.\n *\n * @throws Error on corrupted data (null tables, null names)\n */\nfunction listRefs(\n accessor: (index: number) => ReturnType<FbsRepo[\"tags\"]>,\n length: number,\n): string[] {\n const names: string[] = [];\n\n for (let i = 0; i < length; i++) {\n const refTable = accessor(i);\n if (!refTable) {\n throw new Error(`Corrupted repo file: null ref table at index ${i}`);\n }\n const name = refTable.name();\n if (name === null) {\n throw new Error(`Corrupted repo file: null ref name at index ${i}`);\n }\n names.push(name);\n }\n\n return names;\n}\n\n/**\n * Resolve a branch name to its snapshot ID.\n *\n * @returns Snapshot ID bytes if found, null otherwise\n */\nexport function resolveBranch(\n parsedRepo: ParsedRepo,\n name: string,\n): Uint8Array | null {\n const { repo } = parsedRepo;\n return binarySearchRef(\n parsedRepo,\n (i) => repo.branches(i),\n repo.branchesLength(),\n name,\n );\n}\n\n/**\n * Resolve a tag name to its snapshot ID.\n *\n * @returns Snapshot ID bytes if found, null otherwise\n */\nexport function resolveTag(\n parsedRepo: ParsedRepo,\n name: string,\n): Uint8Array | null {\n const { repo } = parsedRepo;\n return binarySearchRef(\n parsedRepo,\n (i) => repo.tags(i),\n repo.tagsLength(),\n name,\n );\n}\n\n/**\n * List all branch names in the repository.\n *\n * @returns Array of branch names (in storage order, which is sorted)\n */\nexport function listBranchesFromRepo(parsedRepo: ParsedRepo): string[] {\n const { repo } = parsedRepo;\n return listRefs((i) => repo.branches(i), repo.branchesLength());\n}\n\n/**\n * List all active tag names in the repository.\n *\n * Note: Returns only active tags from the tags vector, not deleted_tags.\n *\n * @returns Array of tag names (in storage order, which is sorted)\n */\nexport function listTagsFromRepo(parsedRepo: ParsedRepo): string[] {\n const { repo } = parsedRepo;\n return listRefs((i) => repo.tags(i), repo.tagsLength());\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class MetadataItem {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): MetadataItem {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsMetadataItem(\n bb: flatbuffers.ByteBuffer,\n obj?: MetadataItem,\n ): MetadataItem {\n return (obj || new MetadataItem()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n name(): string | null;\n name(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n name(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n value(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n valueLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n valueArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class Ref {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): Ref {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsRef(bb: flatbuffers.ByteBuffer, obj?: Ref): Ref {\n return (obj || new Ref()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n name(): string | null;\n name(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n name(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n snapshotIndex(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.readUint32(this.bb_pos + offset) : 0;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { RepoAvailability } from \"../generated/repo-availability.js\";\n\nexport class RepoStatus {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): RepoStatus {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsRepoStatus(\n bb: flatbuffers.ByteBuffer,\n obj?: RepoStatus,\n ): RepoStatus {\n return (obj || new RepoStatus()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n availability(): RepoAvailability {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.readUint8(this.bb_pos + offset)\n : RepoAvailability.Online;\n }\n\n setAt(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n limitedAvailabilityReason(): string | null;\n limitedAvailabilityReason(\n optionalEncoding: flatbuffers.Encoding,\n ): string | Uint8Array | null;\n limitedAvailabilityReason(\n optionalEncoding?: any,\n ): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class ObjectId12 {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ObjectId12 {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n bytes(index: number): number | null {\n return this.bb!.readUint8(this.bb_pos + 0 + index);\n }\n\n static sizeOf(): number {\n return 12;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { MetadataItem } from \"../generated/metadata-item.js\";\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class SnapshotInfo {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): SnapshotInfo {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsSnapshotInfo(\n bb: flatbuffers.ByteBuffer,\n obj?: SnapshotInfo,\n ): SnapshotInfo {\n return (obj || new SnapshotInfo()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n id(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n parentOffset(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.readInt32(this.bb_pos + offset) : 0;\n }\n\n flushedAt(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n message(): string | null;\n message(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n message(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n metadata(index: number, obj?: MetadataItem): MetadataItem | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? (obj || new MetadataItem()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n metadataLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n prunedAncestorTxLogs(index: number, obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? (obj || new ObjectId12()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 12,\n this.bb!,\n )\n : null;\n }\n\n prunedAncestorTxLogsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { UpdateType } from \"../generated/update-type.js\";\n\nexport class Update {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): Update {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsUpdate(bb: flatbuffers.ByteBuffer, obj?: Update): Update {\n return (obj || new Update()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n updateTypeType(): UpdateType {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset ? this.bb!.readUint8(this.bb_pos + offset) : UpdateType.NONE;\n }\n\n updateType(obj: any): any | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__union(obj, this.bb_pos + offset) : null;\n }\n\n updatedAt(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n backupPath(): string | null;\n backupPath(\n optionalEncoding: flatbuffers.Encoding,\n ): string | Uint8Array | null;\n backupPath(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { MetadataItem } from \"../generated/metadata-item.js\";\nimport { Ref } from \"../generated/ref.js\";\nimport { RepoStatus } from \"../generated/repo-status.js\";\nimport { SnapshotInfo } from \"../generated/snapshot-info.js\";\nimport { Update } from \"../generated/update.js\";\n\nexport class Repo {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): Repo {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsRepo(bb: flatbuffers.ByteBuffer, obj?: Repo): Repo {\n return (obj || new Repo()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n specVersion(): number {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset ? this.bb!.readUint8(this.bb_pos + offset) : 0;\n }\n\n tags(index: number, obj?: Ref): Ref | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new Ref()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n tagsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n branches(index: number, obj?: Ref): Ref | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? (obj || new Ref()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n branchesLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n deletedTags(index: number): string;\n deletedTags(\n index: number,\n optionalEncoding: flatbuffers.Encoding,\n ): string | Uint8Array;\n deletedTags(\n index: number,\n optionalEncoding?: any,\n ): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? this.bb!.__string(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n optionalEncoding,\n )\n : null;\n }\n\n deletedTagsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n snapshots(index: number, obj?: SnapshotInfo): SnapshotInfo | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? (obj || new SnapshotInfo()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n snapshotsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n status(obj?: RepoStatus): RepoStatus | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? (obj || new RepoStatus()).__init(\n this.bb!.__indirect(this.bb_pos + offset),\n this.bb!,\n )\n : null;\n }\n\n metadata(index: number, obj?: MetadataItem): MetadataItem | null {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset\n ? (obj || new MetadataItem()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n metadataLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n latestUpdates(index: number, obj?: Update): Update | null {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset\n ? (obj || new Update()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n latestUpdatesLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n repoBeforeUpdates(): string | null;\n repoBeforeUpdates(\n optionalEncoding: flatbuffers.Encoding,\n ): string | Uint8Array | null;\n repoBeforeUpdates(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n config(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n configLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n configArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n enabledFeatureFlags(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 24);\n return offset\n ? this.bb!.readUint16(this.bb!.__vector(this.bb_pos + offset) + index * 2)\n : 0;\n }\n\n enabledFeatureFlagsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 24);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n enabledFeatureFlagsArray(): Uint16Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 24);\n return offset\n ? new Uint16Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n disabledFeatureFlags(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 26);\n return offset\n ? this.bb!.readUint16(this.bb!.__vector(this.bb_pos + offset) + index * 2)\n : 0;\n }\n\n disabledFeatureFlagsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 26);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n disabledFeatureFlagsArray(): Uint16Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 26);\n return offset\n ? new Uint16Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 28);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 28);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 28);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","/**\n * Vendored from fzstd — https://github.com/101arrowz/fzstd\n * MIT License, Copyright (c) 2020 Arjun Barrett. See ./LICENSE.\n *\n * Source: the unmerged dictionary-decompression PR #18\n * (https://github.com/101arrowz/fzstd/pull/18), branch\n * `handlerug:push-qxkytkvukoqs` @ a6aacee, which adds the optional `dic`\n * (dictionary) argument to `decompress()` and the `Decompress` stream.\n *\n * Why vendored: icechunk's dictionary-compressed virtual chunk locations need\n * zstd dictionary decompression, which released fzstd 0.1.1 lacks. PR #18 is\n * still unmerged/unreleased and the fork can't be cleanly npm-installed (no\n * committed dist, no prepare hook). The alternative decoder (zstdify) silently\n * corrupts ~32% of real icechunk metadata, so fzstd is the only correct option.\n * See ../../format/flatbuffers/manifest-parser.ts.\n *\n * This copy is byte-identical to the branch — no local edits. The branch now\n * includes both the dictionary/output-buffer aliasing fix (handlerug/fzstd#1)\n * and the dictionary history-window sizing fix (a6aacee) — both found and\n * contributed from here, now merged — so there is no longer a local patch to\n * re-apply. To update, re-vendor src/index.ts + LICENSE from the branch.\n *\n * Verified: byte-exact vs released fzstd on all 244 icechunk fixtures, plus\n * correct dictionary decode vs the reference `zstd` CLI.\n */\n/* eslint-disable */\n// @ts-nocheck\n\n// Some numerical data is initialized as -1 even when it doesn't need initialization to help the JIT infer types\n\n// aliases for shorter compressed code (most minifers don't do this)\nconst ab = ArrayBuffer, u8 = Uint8Array, u16 = Uint16Array, i16 = Int16Array, u32 = Uint32Array, i32 = Int32Array;\n\n// Huffman decoding table\ninterface HDT {\n // initial bits\n b: number;\n // symbols\n s: Uint8Array;\n // num bits\n n: Uint8Array;\n}\n\n// FSE decoding table\ninterface FSEDT extends HDT {\n // next state\n t: Uint16Array;\n}\n\n// decompress Zstandard state\ninterface DZstdState {\n // byte\n b: number;\n // out byte\n y: number;\n // dictionary ID\n d: number;\n // window\n w: Uint8Array;\n // max block size\n m: number;\n // uncompressed size\n u: number;\n // has checksum\n c: number;\n // offsets\n o: Int32Array;\n // window head\n e: number;\n // last huffman decoding table\n h?: HDT;\n // last FSE decoding tables\n t?: [FSEDT, FSEDT, FSEDT];\n // last block\n l: number;\n}\n\nconst slc = (v: Uint8Array, s: number, e?: number) => {\n if (u8.prototype.slice) return u8.prototype.slice.call(v, s, e);\n if (s == null || s < 0) s = 0;\n if (e == null || e > v.length) e = v.length;\n const n = new u8(e - s);\n n.set(v.subarray(s, e));\n return n;\n};\n\nconst fill = (v: Uint8Array, n: number, s?: number, e?: number) => {\n if (u8.prototype.fill) return u8.prototype.fill.call(v, n, s, e);\n if (s == null || s < 0) s = 0;\n if (e == null || e > v.length) e = v.length;\n for (; s < e; ++s) v[s] = n;\n return v;\n};\n\nconst cpw = (v: Uint8Array, t: number, s?: number, e?: number) => {\n if (u8.prototype.copyWithin) return u8.prototype.copyWithin.call(v, t, s, e);\n if (s == null || s < 0) s = 0;\n if (e == null || e > v.length) e = v.length;\n while (s < e) {\n v[t++] = v[s++];\n }\n};\n\n/**\n * Codes for errors generated within this library\n */\nexport const ZstdErrorCode = {\n InvalidData: 0,\n WindowSizeTooLarge: 1,\n InvalidBlockType: 2,\n FSEAccuracyTooHigh: 3,\n DistanceTooFarBack: 4,\n UnexpectedEOF: 5,\n WrongDictionary: 6\n} as const;\n\ntype ZEC = (typeof ZstdErrorCode)[keyof typeof ZstdErrorCode];\n\n// error codes\nconst ec: Record<ZEC, string | undefined> = [\n 'invalid zstd data',\n 'window size too large (>2046MB)',\n 'invalid block type',\n 'FSE accuracy too high',\n 'match distance too far back',\n 'unexpected EOF',\n 'wrong dictionary'\n];\n\n/**\n * An error generated within this library\n */\nexport interface ZstdError extends Error {\n /**\n * The code associated with this error\n */\n code: ZEC;\n}\n\nconst err = (ind: ZEC, msg?: string | 0, nt?: 1) => {\n const e: Partial<ZstdError> = new Error(msg || ec[ind]);\n e.code = ind;\n if (Error.captureStackTrace) Error.captureStackTrace(e, err);\n if (!nt) throw e;\n return e as ZstdError;\n};\n\nconst rb = (d: Uint8Array, b: number, n: number) => {\n let i = 0, o = 0;\n for (; i < n; ++i) o |= d[b++] << (i << 3);\n return o;\n};\n\nconst b4 = (d: Uint8Array, b: number) => (d[b] | (d[b + 1] << 8) | (d[b + 2] << 16) | (d[b + 3] << 24)) >>> 0;\n\n// apply a dictionary to decompressor state\nconst rdic = (dic: Uint8Array, st: DZstdState) => {\n if (b4(dic, 0) == 0xec30a437) {\n if (st.d && st.d !== b4(dic, 4)) err(6);\n let bt = 8;\n [bt, st.h] = rhu(dic, bt);\n let mlt: FSEDT, olt: FSEDT, llt: FSEDT;\n [bt, olt] = rfse(dic, bt, 8);\n [bt, mlt] = rfse(dic, bt, 9);\n [bt, llt] = rfse(dic, bt, 9);\n st.t = [mlt, olt, llt];\n st.o = new i32([b4(dic, bt), b4(dic, bt + 4), b4(dic, bt + 8)]);\n dic = dic.subarray(bt + 12);\n }\n const wl = Math.max(dic.length, st.u ? Math.min(st.e, dic.length + st.u) : st.e);\n st.w = new u8(wl);\n st.w.set(dic, wl - dic.length);\n st.e = wl;\n};\n\n// read Zstandard frame header\nconst rzfh = (dat: Uint8Array, w?: Uint8Array | 1): number | DZstdState => {\n const n3 = dat[0] | (dat[1] << 8) | (dat[2] << 16);\n if (n3 == 0x2FB528 && dat[3] == 253) {\n // Zstandard\n const flg = dat[4];\n // single segment checksum dict flag frame content flag\n const ss = (flg >> 5) & 1, cc = (flg >> 2) & 1, df = flg & 3, fcf = flg >> 6;\n if (flg & 8) err(0);\n // byte\n let bt = 6 - ss;\n // dict bytes\n const db = df == 3 ? 4 : df;\n // dictionary id\n const di = rb(dat, bt, db);\n bt += db;\n // frame size bytes\n const fsb = fcf ? (1 << fcf) : ss;\n // frame source size\n const fss = rb(dat, bt, fsb) + ((fcf == 1) && 256);\n // window size\n let ws = fss;\n if (!ss) {\n // window descriptor\n const wb = 1 << (10 + (dat[5] >> 3));\n ws = wb + (wb >> 3) * (dat[5] & 7);\n }\n if (ws > 2145386496) err(1);\n const buf = new u8((w == 1 ? (fss || ws) : w ? 0 : ws) + 12);\n buf[0] = 1, buf[4] = 4, buf[8] = 8;\n return {\n b: bt + fsb,\n y: 0,\n l: 0,\n d: di,\n w: (w && w != 1) ? w : buf.subarray(12),\n e: ws,\n o: new i32(buf.buffer, 0, 3),\n u: fss,\n c: cc,\n m: Math.min(131072, ws)\n };\n } else if (((n3 >> 4) | (dat[3] << 20)) == 0x184D2A5) {\n // skippable\n return b4(dat, 4) + 8;\n }\n err(0);\n};\n\n// most significant bit for nonzero\nconst msb = (val: number) => {\n let bits = 0;\n for (; (1 << bits) <= val; ++bits);\n return bits - 1;\n};\n\n// read finite state entropy\nconst rfse = (dat: Uint8Array, bt: number, mal: number): [number, FSEDT] => {\n // table pos\n let tpos = (bt << 3) + 4;\n // accuracy log\n const al = (dat[bt] & 15) + 5;\n if (al > mal) err(3);\n // size\n const sz = 1 << al;\n // probabilities symbols repeat index high threshold\n let probs = sz, sym = -1, re = -1, i = -1, ht = sz;\n // optimization: single allocation is much faster\n const buf = new ab(512 + (sz << 2));\n const freq = new i16(buf, 0, 256);\n // same view as freq\n const dstate = new u16(buf, 0, 256);\n const nstate = new u16(buf, 512, sz);\n const bb1 = 512 + (sz << 1);\n const syms = new u8(buf, bb1, sz);\n const nbits = new u8(buf, bb1 + sz);\n while (sym < 255 && probs > 0) {\n const bits = msb(probs + 1);\n const cbt = tpos >> 3;\n // mask\n const msk = (1 << (bits + 1)) - 1;\n let val = ((dat[cbt] | (dat[cbt + 1] << 8) | (dat[cbt + 2] << 16)) >> (tpos & 7)) & msk;\n // mask (1 fewer bit)\n const msk1fb = (1 << bits) - 1;\n // max small value\n const msv = msk - probs - 1;\n // small value\n const sval = val & msk1fb;\n if (sval < msv) tpos += bits, val = sval;\n else {\n tpos += bits + 1;\n if (val > msk1fb) val -= msv;\n }\n freq[++sym] = --val;\n if (val == -1) {\n probs += val;\n syms[--ht] = sym;\n } else probs -= val;\n if (!val) {\n do {\n // repeat byte\n const rbt = tpos >> 3;\n re = ((dat[rbt] | (dat[rbt + 1] << 8)) >> (tpos & 7)) & 3;\n tpos += 2;\n sym += re;\n } while (re == 3);\n }\n }\n if (sym > 255 || probs) err(0);\n let sympos = 0;\n // sym step (coprime with sz - formula from zstd source)\n const sstep = (sz >> 1) + (sz >> 3) + 3;\n // sym mask\n const smask = sz - 1;\n for (let s = 0; s <= sym; ++s) {\n const sf = freq[s];\n if (sf < 1) {\n dstate[s] = -sf;\n continue;\n }\n // This is split into two loops in zstd to avoid branching, but as JS is higher-level that is unnecessary\n for (i = 0; i < sf; ++i) {\n syms[sympos] = s;\n do {\n sympos = (sympos + sstep) & smask;\n } while (sympos >= ht);\n }\n }\n // After spreading symbols, should be zero again\n if (sympos) err(0);\n for (i = 0; i < sz; ++i) {\n // next state\n const ns = dstate[syms[i]]++;\n // num bits\n const nb = nbits[i] = al - msb(ns);\n nstate[i] = (ns << nb) - sz;\n }\n return [(tpos + 7) >> 3, {\n b: al,\n s: syms,\n n: nbits,\n t: nstate\n }];\n};\n\n// read huffman\nconst rhu = (dat: Uint8Array, bt: number): [number, HDT] => {\n // index weight count\n let i = 0, wc = -1;\n // buffer header byte\n const buf = new u8(292), hb = dat[bt];\n // huffman weights\n const hw = buf.subarray(0, 256);\n // rank count\n const rc = buf.subarray(256, 268);\n // rank index\n const ri = new u16(buf.buffer, 268);\n // NOTE: at this point bt is 1 less than expected\n if (hb < 128) {\n // end byte, fse decode table\n const [ebt, fdt] = rfse(dat, bt + 1, 6);\n bt += hb;\n const epos = ebt << 3;\n // last byte\n const lb = dat[bt];\n if (!lb) err(0);\n // state1 state2 state1 bits state2 bits\n let st1 = 0, st2 = 0, btr1 = fdt.b, btr2 = btr1;\n // fse pos\n // pre-increment to account for original deficit of 1\n let fpos = (++bt << 3) - 8 + msb(lb);\n for (;;) {\n fpos -= btr1;\n if (fpos < epos) break;\n let cbt = fpos >> 3;\n st1 += ((dat[cbt] | (dat[cbt + 1] << 8)) >> (fpos & 7)) & ((1 << btr1) - 1);\n hw[++wc] = fdt.s[st1];\n fpos -= btr2;\n if (fpos < epos) break;\n cbt = fpos >> 3;\n st2 += ((dat[cbt] | (dat[cbt + 1] << 8)) >> (fpos & 7)) & ((1 << btr2) - 1);\n hw[++wc] = fdt.s[st2];\n btr1 = fdt.n[st1];\n st1 = fdt.t[st1];\n btr2 = fdt.n[st2];\n st2 = fdt.t[st2];\n }\n if (++wc > 255) err(0);\n } else {\n wc = hb - 127;\n for (; i < wc; i += 2) {\n const byte = dat[++bt];\n hw[i] = byte >> 4;\n hw[i + 1] = byte & 15;\n }\n ++bt;\n }\n // weight exponential sum\n let wes = 0;\n for (i = 0; i < wc; ++i) {\n const wt = hw[i];\n // bits must be at most 11, same as weight\n if (wt > 11) err(0);\n wes += wt && (1 << (wt - 1));\n }\n // max bits\n const mb = msb(wes) + 1;\n // table size\n const ts = 1 << mb;\n // remaining sum\n const rem = ts - wes;\n // must be power of 2\n if (rem & (rem - 1)) err(0);\n hw[wc++] = msb(rem) + 1;\n for (i = 0; i < wc; ++i) {\n const wt = hw[i];\n ++rc[hw[i] = wt && (mb + 1 - wt)];\n }\n // huf buf\n const hbuf = new u8(ts << 1);\n // symbols num bits\n const syms = hbuf.subarray(0, ts), nb = hbuf.subarray(ts);\n ri[mb] = 0;\n for (i = mb; i > 0; --i) {\n const pv = ri[i];\n fill(nb, i, pv, ri[i - 1] = pv + rc[i] * (1 << (mb - i)));\n }\n if (ri[0] != ts) err(0);\n for (i = 0; i < wc; ++i) {\n const bits = hw[i];\n if (bits) {\n const code = ri[bits];\n fill(syms, i, code, ri[bits] = code + (1 << (mb - bits)));\n }\n }\n return [bt, {\n n: nb,\n b: mb,\n s: syms\n }];\n};\n\n// Tables generated using this:\n// https://gist.github.com/101arrowz/a979452d4355992cbf8f257cbffc9edd\n\n// default literal length table\nconst dllt = /*#__PURE__*/ rfse(/*#__PURE__*/ new u8([\n 81, 16, 99, 140, 49, 198, 24, 99, 12, 33, 196, 24, 99, 102, 102, 134, 70, 146, 4\n]), 0, 6)[1];\n\n// default match length table\nconst dmlt = /*#__PURE__*/ rfse(/*#__PURE__*/ new u8([\n 33, 20, 196, 24, 99, 140, 33, 132, 16, 66, 8, 33, 132, 16, 66, 8, 33, 68, 68, 68, 68, 68, 68, 68, 68, 36, 9\n]), 0, 6)[1];\n\n// default offset code table\nconst doct = /*#__PURE__ */ rfse(/*#__PURE__*/ new u8([\n 32, 132, 16, 66, 102, 70, 68, 68, 68, 68, 36, 73, 2\n]), 0, 5)[1];\n\n// bits to baseline\nconst b2bl = (b: Uint8Array, s: number) => {\n const len = b.length, bl = new i32(len);\n for (let i = 0; i < len; ++i) {\n bl[i] = s;\n s += 1 << b[i];\n }\n return bl;\n};\n\n// literal length bits\nconst llb = /*#__PURE__ */ new u8((/*#__PURE__ */ new i32([\n 0, 0, 0, 0, 16843009, 50528770, 134678020, 202050057, 269422093\n])).buffer, 0, 36);\n\n// literal length baseline\nconst llbl = /*#__PURE__ */ b2bl(llb, 0);\n\n// match length bits\nconst mlb = /*#__PURE__ */ new u8((/*#__PURE__ */ new i32([\n 0, 0, 0, 0, 0, 0, 0, 0, 16843009, 50528770, 117769220, 185207048, 252579084, 16\n])).buffer, 0, 53);\n\n// match length baseline\nconst mlbl = /*#__PURE__ */ b2bl(mlb, 3);\n\n// decode huffman stream\nconst dhu = (dat: Uint8Array, out: Uint8Array, hu: HDT) => {\n const len = dat.length, ss = out.length, lb = dat[len - 1], msk = (1 << hu.b) - 1, eb = -hu.b;\n if (!lb) err(0);\n let st = 0, btr = hu.b, pos = (len << 3) - 8 + msb(lb) - btr, i = -1;\n for (; pos > eb && i < ss;) {\n const cbt = pos >> 3;\n const val = (dat[cbt] | (dat[cbt + 1] << 8) | (dat[cbt + 2] << 16)) >> (pos & 7);\n st = ((st << btr) | val) & msk;\n out[++i] = hu.s[st];\n pos -= (btr = hu.n[st]);\n }\n if (pos != eb || i + 1 != ss) err(0);\n};\n\n// decode huffman stream 4x\n// TODO: use workers to parallelize\nconst dhu4 = (dat: Uint8Array, out: Uint8Array, hu: HDT) => {\n let bt = 6;\n const ss = out.length, sz1 = (ss + 3) >> 2, sz2 = sz1 << 1, sz3 = sz1 + sz2;\n dhu(dat.subarray(bt, bt += dat[0] | (dat[1] << 8)), out.subarray(0, sz1), hu);\n dhu(dat.subarray(bt, bt += dat[2] | (dat[3] << 8)), out.subarray(sz1, sz2), hu);\n dhu(dat.subarray(bt, bt += dat[4] | (dat[5] << 8)), out.subarray(sz2, sz3), hu);\n dhu(dat.subarray(bt), out.subarray(sz3), hu);\n};\n\n// read Zstandard block\nconst rzb = (dat: Uint8Array, st: DZstdState, out?: Uint8Array) => {\n let bt = st.b;\n // byte 0 block type\n const b0 = dat[bt], btype = (b0 >> 1) & 3;\n st.l = b0 & 1;\n const sz = (b0 >> 3) | (dat[bt + 1] << 5) | (dat[bt + 2] << 13);\n // end byte for block\n const ebt = (bt += 3) + sz;\n if (btype == 1) {\n if (bt >= dat.length) return;\n st.b = bt + 1;\n if (out) {\n fill(out, dat[bt], st.y, st.y += sz);\n return out;\n }\n return fill(new u8(sz), dat[bt]);\n }\n if (ebt > dat.length) return;\n if (btype == 0) {\n st.b = ebt;\n if (out) {\n out.set(dat.subarray(bt, ebt), st.y);\n st.y += sz;\n return out;\n }\n return slc(dat, bt, ebt);\n }\n if (btype == 2) {\n // byte 3 lit btype size format\n const b3 = dat[bt], lbt = b3 & 3, sf = (b3 >> 2) & 3;\n // lit src size lit cmp sz 4 streams\n let lss = b3 >> 4, lcs = 0, s4 = 0;\n if (lbt < 2) {\n if (sf & 1) lss |= (dat[++bt] << 4) | ((sf & 2) && (dat[++bt] << 12));\n else lss = b3 >> 3;\n } else {\n s4 = sf;\n if (sf < 2) lss |= ((dat[++bt] & 63) << 4), lcs = (dat[bt] >> 6) | (dat[++bt] << 2);\n else if (sf == 2) lss |= (dat[++bt] << 4) | ((dat[++bt] & 3) << 12), lcs = (dat[bt] >> 2) | (dat[++bt] << 6);\n else lss |= (dat[++bt] << 4) | ((dat[++bt] & 63) << 12), lcs = (dat[bt] >> 6) | (dat[++bt] << 2) | (dat[++bt] << 10);\n }\n ++bt;\n // add literals to end - can never overlap with backreferences because unused literals always appended\n let buf = out ? out.subarray(st.y, st.y + st.m) : new u8(st.m);\n // starting point for literals\n let spl = buf.length - lss;\n if (lbt == 0) buf.set(dat.subarray(bt, bt += lss), spl);\n else if (lbt == 1) fill(buf, dat[bt++], spl);\n else {\n // huffman table\n let hu = st.h;\n if (lbt == 2) {\n const hud = rhu(dat, bt);\n // subtract description length\n lcs += bt - (bt = hud[0]);\n st.h = hu = hud[1];\n }\n else if (!hu) err(0);\n (s4 ? dhu4 : dhu)(dat.subarray(bt, bt += lcs), buf.subarray(spl), hu);\n }\n // num sequences\n let ns = dat[bt++];\n if (ns) {\n if (ns == 255) ns = (dat[bt++] | (dat[bt++] << 8)) + 0x7F00;\n else if (ns > 127) ns = ((ns - 128) << 8) | dat[bt++];\n // symbol compression modes\n const scm = dat[bt++];\n if (scm & 3) err(0);\n const dts: [FSEDT, FSEDT, FSEDT] = [dmlt, doct, dllt];\n for (let i = 2; i > -1; --i) {\n const md = (scm >> ((i << 1) + 2)) & 3;\n if (md == 1) {\n // rle buf\n const rbuf = new u8([0, 0, dat[bt++]]);\n dts[i] = {\n s: rbuf.subarray(2, 3),\n n: rbuf.subarray(0, 1),\n t: new u16(rbuf.buffer, 0, 1),\n b: 0\n };\n } else if (md == 2) {\n // accuracy log 8 for offsets, 9 for others\n [bt, dts[i]] = rfse(dat, bt, 9 - (i & 1));\n } else if (md == 3) {\n if (!st.t) err(0);\n dts[i] = st.t[i];\n }\n }\n const [mlt, oct, llt] = st.t = dts;\n const lb = dat[ebt - 1];\n if (!lb) err(0);\n let spos = (ebt << 3) - 8 + msb(lb) - llt.b, cbt = spos >> 3, oubt = 0;\n let lst = ((dat[cbt] | (dat[cbt + 1] << 8)) >> (spos & 7)) & ((1 << llt.b) - 1);\n cbt = (spos -= oct.b) >> 3;\n let ost = ((dat[cbt] | (dat[cbt + 1] << 8)) >> (spos & 7)) & ((1 << oct.b) - 1);\n cbt = (spos -= mlt.b) >> 3;\n let mst = ((dat[cbt] | (dat[cbt + 1] << 8)) >> (spos & 7)) & ((1 << mlt.b) - 1);\n for (++ns; --ns;) {\n const llc = llt.s[lst];\n const lbtr = llt.n[lst];\n const mlc = mlt.s[mst];\n const mbtr = mlt.n[mst];\n const ofc = oct.s[ost];\n const obtr = oct.n[ost];\n\n cbt = (spos -= ofc) >> 3;\n const ofp = 1 << ofc;\n let off = ofp + (((dat[cbt] | (dat[cbt + 1] << 8) | (dat[cbt + 2] << 16) | (dat[cbt + 3] << 24)) >>> (spos & 7)) & (ofp - 1));\n cbt = (spos -= mlb[mlc]) >> 3;\n let ml = mlbl[mlc] + (((dat[cbt] | (dat[cbt + 1] << 8) | (dat[cbt + 2] << 16)) >> (spos & 7)) & ((1 << mlb[mlc]) - 1));\n cbt = (spos -= llb[llc]) >> 3;\n const ll = llbl[llc] + (((dat[cbt] | (dat[cbt + 1] << 8) | (dat[cbt + 2] << 16)) >> (spos & 7)) & ((1 << llb[llc]) - 1));\n\n cbt = (spos -= lbtr) >> 3;\n lst = llt.t[lst] + (((dat[cbt] | (dat[cbt + 1] << 8)) >> (spos & 7)) & ((1 << lbtr) - 1));\n cbt = (spos -= mbtr) >> 3;\n mst = mlt.t[mst] + (((dat[cbt] | (dat[cbt + 1] << 8)) >> (spos & 7)) & ((1 << mbtr) - 1));\n cbt = (spos -= obtr) >> 3;\n ost = oct.t[ost] + (((dat[cbt] | (dat[cbt + 1] << 8)) >> (spos & 7)) & ((1 << obtr) - 1));\n\n if (off > 3) {\n st.o[2] = st.o[1];\n st.o[1] = st.o[0];\n st.o[0] = off -= 3;\n } else {\n const idx = off - ((ll != 0) as unknown as number);\n if (idx) {\n off = idx == 3 ? st.o[0] - 1 : st.o[idx];\n if (idx > 1) st.o[2] = st.o[1];\n st.o[1] = st.o[0];\n st.o[0] = off;\n } else off = st.o[0];\n }\n for (let i = 0; i < ll; ++i) {\n buf[oubt + i] = buf[spl + i];\n }\n oubt += ll, spl += ll;\n let stin = oubt - off;\n if (stin < 0) {\n let len = -stin;\n const bs = st.e + stin;\n if (len > ml) len = ml;\n for (let i = 0; i < len; ++i) {\n buf[oubt + i] = st.w[bs + i];\n }\n oubt += len, ml -= len, stin = 0;\n }\n for (let i = 0; i < ml; ++i) {\n buf[oubt + i] = buf[stin + i];\n }\n oubt += ml;\n }\n if (oubt != spl) {\n while (spl < buf.length) {\n buf[oubt++] = buf[spl++];\n }\n } else oubt = buf.length;\n if (out) st.y += oubt;\n else buf = slc(buf, 0, oubt);\n } else if (out) {\n st.y += lss;\n if (spl) {\n for (let i = 0; i < lss; ++i) {\n buf[i] = buf[spl + i];\n }\n }\n } else if (spl) buf = slc(buf, spl);\n st.b = ebt;\n return buf;\n }\n err(2);\n};\n\n// concat\nconst cct = (bufs: Uint8Array[], ol: number) => {\n if (bufs.length == 1) return bufs[0];\n const buf = new u8(ol);\n for (let i = 0, b = 0; i < bufs.length; ++i) {\n const chk = bufs[i];\n buf.set(chk, b);\n b += chk.length;\n }\n return buf;\n};\n\n/**\n * Decompresses Zstandard data\n * @param dat The input data\n * @param buf The output buffer. If unspecified, the function will allocate\n * exactly enough memory to fit the decompressed data. If your\n * data has multiple frames and you know the output size, specifying\n * it will yield better performance.\n * @param dic The dictionary buffer. May be a Zstandard-formatted dictionary\n * (as generated by zstd --train) or raw content.\n * @returns The decompressed data\n */\nexport function decompress(dat: Uint8Array, buf?: Uint8Array, dic?: Uint8Array) {\n const bufs: Uint8Array[] = [], nb = +!buf as 0 | 1;\n let bt = 0, ol = 0;\n for (; dat.length;) {\n const st = rzfh(dat, nb || buf);\n if (typeof st == 'object') {\n if (st.d && !dic) err(6);\n if (dic) rdic(dic, st);\n if (nb) {\n buf = null;\n if (!dic && st.w.length == st.u) {\n bufs.push(buf = st.w);\n ol += st.u;\n }\n } else {\n bufs.push(buf);\n st.e = 0;\n }\n for (; !st.l;) {\n const blk = rzb(dat, st, buf);\n if (!blk) err(5);\n if (buf) st.e = st.y;\n else {\n bufs.push(blk);\n ol += blk.length;\n cpw(st.w, 0, blk.length);\n st.w.set(blk, st.w.length - blk.length);\n }\n }\n bt = st.b + (st.c * 4);\n } else bt = st;\n dat = dat.subarray(bt);\n }\n return cct(bufs, ol);\n}\n\n/**\n * Callback to handle data in Zstandard streams\n * @param data The data that was (de)compressed\n * @param final Whether this is the last chunk in the stream\n */\nexport type ZstdStreamHandler = (data: Uint8Array, final?: boolean) => unknown;\n\n/**\n * Decompressor for Zstandard streamed data\n */\nexport class Decompress {\n private s: DZstdState | number;\n private c: Uint8Array[];\n private l: number;\n private z: number;\n private d: Uint8Array;\n /**\n * Creates a Zstandard decompressor\n * @param ondata The handler for stream data\n */\n constructor(ondata?: ZstdStreamHandler) {\n this.ondata = ondata;\n this.c = [];\n this.l = 0;\n this.z = 0;\n }\n\n /**\n * Loads a dictionary\n * @param dic The dictionary buffer. May be a Zstandard-formatted dictionary\n * (as generated by zstd --train) or raw content.\n */\n loadDictionary(dic: Uint8Array) {\n this.d = dic;\n }\n\n /**\n * Pushes data to be decompressed\n * @param chunk The chunk of data to push\n * @param final Whether or not this is the last chunk in the stream\n */\n push(chunk: Uint8Array, final?: boolean) {\n if (typeof this.s == 'number') {\n const sub = Math.min(chunk.length, this.s as number);\n chunk = chunk.subarray(sub);\n (this.s as number) -= sub;\n }\n const sl = chunk.length;\n const ncs = sl + this.l;\n if (!this.s) {\n if (final) {\n if (!ncs) {\n this.ondata(new u8(0), true);\n return;\n }\n // min for frame + one block\n if (ncs < 5) err(5);\n } else if (ncs < 18) {\n this.c.push(chunk);\n this.l = ncs;\n return;\n }\n if (this.l) {\n this.c.push(chunk);\n chunk = cct(this.c, ncs);\n this.c = [];\n this.l = 0;\n }\n if (typeof (this.s = rzfh(chunk)) == 'number') return this.push(chunk, final);\n if (this.s.d && !this.d) err(6);\n if (this.d) rdic(this.d, this.s);\n }\n if (typeof this.s != 'number') {\n if (ncs < (this.z || 3)) {\n if (final) err(5);\n this.c.push(chunk);\n this.l = ncs;\n return;\n }\n if (this.l) {\n this.c.push(chunk);\n chunk = cct(this.c, ncs);\n this.c = [];\n this.l = 0;\n }\n if (!this.z && ncs < (this.z = (chunk[(this.s as DZstdState).b] & 2) ? 4 : 3 + ((chunk[(this.s as DZstdState).b] >> 3) | (chunk[(this.s as DZstdState).b + 1] << 5) | (chunk[(this.s as DZstdState).b + 2] << 13)))) {\n if (final) err(5);\n this.c.push(chunk);\n this.l = ncs;\n return;\n } else this.z = 0;\n for (;;) {\n const blk = rzb(chunk, this.s as DZstdState);\n if (!blk) {\n if (final) err(5);\n const adc = chunk.subarray((this.s as DZstdState).b);\n (this.s as DZstdState).b = 0;\n this.c.push(adc), this.l += adc.length;\n return;\n } else {\n this.ondata(blk, false);\n cpw((this.s as DZstdState).w, 0, blk.length);\n (this.s as DZstdState).w.set(blk, (this.s as DZstdState).w.length - blk.length);\n }\n if ((this.s as DZstdState).l) {\n const rest = chunk.subarray((this.s as DZstdState).b);\n this.s = (this.s as DZstdState).c * 4;\n this.push(rest, final);\n return;\n }\n }\n } else if (final) err(5);\n }\n\n /**\n * Handler called whenever data is decompressed\n */\n ondata: ZstdStreamHandler;\n}","/**\n * Icechunk binary file header parsing.\n *\n * Header format (39 bytes total):\n * - Bytes 0-11: Magic bytes \"ICE🧊CHUNK\" (12 bytes)\n * - Bytes 12-35: Implementation name (24 bytes, space-padded)\n * - Byte 36: Spec version (1 = v1.0, 2 = v2.0)\n * - Byte 37: File type (1-6)\n * - Byte 38: Compression algorithm (0 = none, 1 = zstd)\n */\n\n/** Header size in bytes */\nexport const HEADER_SIZE = 39;\n\n/** Magic bytes for icechunk format: \"ICE🧊CHUNK\" */\nexport const MAGIC_BYTES = new Uint8Array([\n 0x49,\n 0x43,\n 0x45, // ICE\n 0xf0,\n 0x9f,\n 0xa7,\n 0x8a, // 🧊 (U+1F9CA in UTF-8)\n 0x43,\n 0x48,\n 0x55,\n 0x4e,\n 0x4b, // CHUNK\n]);\n\n/** Spec version enum */\nexport enum SpecVersion {\n V1_0 = 1,\n V2_0 = 2,\n}\n\n/** File type enum */\nexport enum FileType {\n Snapshot = 1,\n Manifest = 2,\n Attributes = 3,\n TransactionLog = 4,\n Chunk = 5,\n RepoInfo = 6,\n}\n\n/** Compression algorithm enum */\nexport enum CompressionAlgorithm {\n None = 0,\n Zstd = 1,\n}\n\n/** Parsed header structure */\nexport interface IcechunkHeader {\n /** Implementation name (e.g., \"ic-1.0.0\") */\n implementation: string;\n\n /** Spec version */\n specVersion: SpecVersion;\n\n /** File type */\n fileType: FileType;\n\n /** Compression algorithm */\n compression: CompressionAlgorithm;\n}\n\n/** Error thrown when header parsing fails */\nexport class HeaderParseError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"HeaderParseError\";\n }\n}\n\n/**\n * Parse the header from a buffer.\n *\n * @param data - Buffer containing at least 39 bytes\n * @returns Parsed header\n * @throws HeaderParseError if the header is invalid\n */\nexport function parseHeader(data: Uint8Array): IcechunkHeader {\n if (data.length < HEADER_SIZE) {\n throw new HeaderParseError(\n `Buffer too small: expected at least ${HEADER_SIZE} bytes, got ${data.length}`,\n );\n }\n\n // Check magic bytes\n const magic = data.slice(0, 12);\n if (!compareMagic(magic, MAGIC_BYTES)) {\n throw new HeaderParseError(\"Invalid magic bytes: not an icechunk file\");\n }\n\n // Parse implementation name (bytes 12-35)\n const implementationBytes = data.slice(12, 36);\n const implementation = new TextDecoder()\n .decode(implementationBytes)\n .trimEnd();\n\n // Parse spec version (byte 36)\n const specVersionByte = data[36];\n if (\n specVersionByte !== SpecVersion.V1_0 &&\n specVersionByte !== SpecVersion.V2_0\n ) {\n throw new HeaderParseError(`Invalid spec version: ${specVersionByte}`);\n }\n const specVersion = specVersionByte as SpecVersion;\n\n // Parse file type (byte 37)\n const fileTypeByte = data[37];\n if (fileTypeByte < 1 || fileTypeByte > 6) {\n throw new HeaderParseError(`Invalid file type: ${fileTypeByte}`);\n }\n const fileType = fileTypeByte as FileType;\n\n // Parse compression (byte 38)\n const compressionByte = data[38];\n if (\n compressionByte !== CompressionAlgorithm.None &&\n compressionByte !== CompressionAlgorithm.Zstd\n ) {\n throw new HeaderParseError(\n `Invalid compression algorithm: ${compressionByte}`,\n );\n }\n const compression = compressionByte as CompressionAlgorithm;\n\n return {\n implementation,\n specVersion,\n fileType,\n compression,\n };\n}\n\n/**\n * Validate that a header matches an expected file type.\n *\n * @param header - Parsed header\n * @param expectedType - Expected file type\n * @throws HeaderParseError if the file type doesn't match\n */\nexport function validateFileType(\n header: IcechunkHeader,\n expectedType: FileType,\n): void {\n if (header.fileType !== expectedType) {\n const expected = FileType[expectedType];\n const actual = FileType[header.fileType];\n throw new HeaderParseError(\n `Invalid file type: expected ${expected}, got ${actual}`,\n );\n }\n}\n\n/**\n * Get the data portion of a buffer (after the header).\n *\n * @param data - Full buffer including header\n * @returns Data portion after the header\n */\nexport function getDataAfterHeader(data: Uint8Array): Uint8Array {\n return data.slice(HEADER_SIZE);\n}\n\n/** Compare two byte arrays */\nfunction compareMagic(a: Uint8Array, b: Uint8Array): boolean {\n if (a.length !== b.length) return false;\n for (let i = 0; i < a.length; i++) {\n if (a[i] !== b[i]) return false;\n }\n return true;\n}\n","/**\n * Simple LRU cache for manifests and snapshots.\n */\n\nexport class LRUCache<K, V> {\n private cache: Map<K, V>;\n private readonly maxSize: number;\n\n constructor(maxSize: number) {\n this.cache = new Map();\n this.maxSize = maxSize;\n }\n\n get(key: K): V | undefined {\n const value = this.cache.get(key);\n if (value !== undefined) {\n // Move to end (most recently used)\n this.cache.delete(key);\n this.cache.set(key, value);\n }\n return value;\n }\n\n set(key: K, value: V): void {\n if (this.maxSize <= 0) return;\n // If key exists, delete it first to update position\n if (this.cache.has(key)) {\n this.cache.delete(key);\n }\n\n // Evict oldest if at capacity\n if (this.cache.size >= this.maxSize) {\n const oldestKey = this.cache.keys().next().value;\n if (oldestKey !== undefined) {\n this.cache.delete(oldestKey);\n }\n }\n\n this.cache.set(key, value);\n }\n\n has(key: K): boolean {\n return this.cache.has(key);\n }\n\n delete(key: K): boolean {\n return this.cache.delete(key);\n }\n\n clear(): void {\n this.cache.clear();\n }\n\n get size(): number {\n return this.cache.size;\n }\n}\n","/**\n * Single-flight wrapper for cache-aside fetches.\n *\n * Wraps a result cache with an in-flight Map so concurrent misses for the\n * same key share one fetch. The shared fetch is reference-counted against\n * its waiters: each caller's `signal` rejects only that caller's wait,\n * but if every waiter has aborted the underlying fetch is aborted too and\n * the pending entry is dropped, so the next caller starts fresh instead of\n * being stuck behind a hung request. New waiters arriving while the fetch\n * is in flight bump the refcount, so a single straggler keeps the work\n * alive for everyone who follows.\n */\n\nexport interface CacheLike<K, V> {\n get(key: K): V | undefined;\n set(key: K, value: V): void;\n}\n\nexport interface SingleFlight<K, V> {\n /**\n * Resolve `key` from the cache, falling through to `fetcher` on miss.\n * Concurrent callers for the same key share one in-flight `fetcher`\n * invocation; the result is written to `cache` on success.\n *\n * `signal` rejects only the caller's await. The underlying fetch keeps\n * running unless every waiter has aborted, in which case the\n * `AbortSignal` passed to `fetcher` fires and the pending entry is\n * dropped so the next caller starts fresh.\n *\n * `fetcher` may throw synchronously; the throw is converted to a\n * rejected promise so `load`'s `Promise<V>` contract holds.\n */\n load(\n key: K,\n fetcher: (signal: AbortSignal) => Promise<V>,\n signal?: AbortSignal,\n ): Promise<V>;\n}\n\ninterface Pending<V> {\n promise: Promise<V>;\n controller: AbortController;\n refCount: number;\n}\n\n/** Build a SingleFlight backed by `cache`. */\nexport function singleFlight<K, V>(cache: CacheLike<K, V>): SingleFlight<K, V> {\n const pending = new Map<K, Pending<V>>();\n\n return {\n load(\n key: K,\n fetcher: (signal: AbortSignal) => Promise<V>,\n signal?: AbortSignal,\n ): Promise<V> {\n // Reject (don't throw) when the caller is already aborted — callers\n // expect a Promise back, including in the pre-aborted case.\n if (signal?.aborted) return Promise.reject(makeAbortError());\n\n const hit = cache.get(key);\n if (hit !== undefined) return Promise.resolve(hit);\n\n let entry = pending.get(key);\n if (!entry) {\n const controller = new AbortController();\n const promise = invokeFetcher(fetcher, controller.signal)\n .then((value) => {\n cache.set(key, value);\n return value;\n })\n .finally(() => {\n if (pending.get(key)?.promise === promise) pending.delete(key);\n });\n const fresh: Pending<V> = { promise, controller, refCount: 0 };\n pending.set(key, fresh);\n entry = fresh;\n }\n const owned = entry;\n owned.refCount++;\n\n const release = () => {\n owned.refCount--;\n if (owned.refCount > 0) return;\n // Last waiter just released. If the entry is still in `pending`\n // the fetch hasn't settled yet — drop the slot synchronously so\n // any new caller starts fresh, then abort the in-flight work.\n // If `.finally` already cleared it, the fetch resolved and the\n // controller.abort() is a no-op.\n if (pending.get(key) === owned) {\n pending.delete(key);\n owned.controller.abort();\n }\n };\n\n if (!signal) {\n return owned.promise.then(\n (value) => {\n release();\n return value;\n },\n (error) => {\n release();\n throw error;\n },\n );\n }\n\n return new Promise<V>((resolve, reject) => {\n let done = false;\n // `finish` ensures release runs exactly once per caller and wins\n // the resolve/reject race between abort and underlying settle.\n const finish = (): boolean => {\n if (done) return false;\n done = true;\n signal.removeEventListener(\"abort\", handleAbort);\n release();\n return true;\n };\n const handleAbort = () => {\n if (finish()) reject(makeAbortError());\n };\n signal.addEventListener(\"abort\", handleAbort, { once: true });\n owned.promise.then(\n (value) => {\n if (finish()) resolve(value);\n },\n (error) => {\n if (finish()) reject(error);\n },\n );\n });\n },\n };\n}\n\n/**\n * Invoke `fetcher`, converting a synchronous throw into a rejected\n * Promise so callers always observe a Promise-shaped failure.\n */\nfunction invokeFetcher<V>(\n fetcher: (signal: AbortSignal) => Promise<V>,\n signal: AbortSignal,\n): Promise<V> {\n try {\n return fetcher(signal);\n } catch (error) {\n return Promise.reject(error);\n }\n}\n\nfunction makeAbortError(): Error {\n return new DOMException(\"The operation was aborted.\", \"AbortError\");\n}\n","/**\n * TypeScript types matching the icechunk FlatBuffer schemas.\n *\n * These types represent the parsed/decoded data, not the binary format.\n */\n\n// =============================================================================\n// Common types (from common.fbs)\n// =============================================================================\n\n/** 12-byte object ID (SnapshotId, ManifestId, ChunkId) */\nexport type ObjectId12 = Uint8Array; // Always 12 bytes\n\n/** 8-byte object ID (NodeId) */\nexport type ObjectId8 = Uint8Array; // Always 8 bytes\n\n/**\n * Validate and cast a Uint8Array to ObjectId12.\n * @throws Error if the array is not exactly 12 bytes\n */\nexport function asObjectId12(bytes: Uint8Array): ObjectId12 {\n if (bytes.length !== 12) {\n throw new Error(\n `Invalid ObjectId12: expected 12 bytes, got ${bytes.length}`,\n );\n }\n return bytes as ObjectId12;\n}\n\n/**\n * Validate and cast a Uint8Array to ObjectId8.\n * @throws Error if the array is not exactly 8 bytes\n */\nexport function asObjectId8(bytes: Uint8Array): ObjectId8 {\n if (bytes.length !== 8) {\n throw new Error(`Invalid ObjectId8: expected 8 bytes, got ${bytes.length}`);\n }\n return bytes as ObjectId8;\n}\n\n/** Metadata key-value pair */\nexport interface MetadataItem {\n name: string;\n /** Value serialized as MessagePack (v1) or FlexBuffers (v2) */\n value: Uint8Array;\n}\n\n// =============================================================================\n// Manifest types (from manifest.fbs)\n// =============================================================================\n\n/** Reference to a chunk - can be inline, native, or virtual */\nexport interface ChunkRef {\n /** Chunk coordinates (N-dimensional) */\n index: number[];\n\n /** Inline chunk data (if present, this is an inline chunk) */\n inline: Uint8Array | null;\n\n /** Byte offset within the chunk file or virtual location */\n offset: number;\n\n /** Byte length of the chunk data */\n length: number;\n\n /** Chunk ID for native chunks (points to file in chunks/) */\n chunkId: ObjectId12 | null;\n\n /** URL for virtual chunks */\n location: string | null;\n\n /** ETag checksum for virtual chunks */\n checksumEtag: string | null;\n\n /** Last modified timestamp (seconds since epoch) for virtual chunks */\n checksumLastModified: number;\n}\n\n/** Chunk references for a single array */\nexport interface ArrayManifest {\n /** Node ID of the array */\n nodeId: ObjectId8;\n\n /** Chunk references, sorted by index */\n refs: ChunkRef[];\n}\n\n/** Manifest containing chunk references for multiple arrays */\nexport interface Manifest {\n /** Manifest ID */\n id: ObjectId12;\n\n /** Array manifests, sorted by nodeId */\n arrays: ArrayManifest[];\n}\n\n// =============================================================================\n// Snapshot types (from snapshot.fbs)\n// =============================================================================\n\n/** Info about a manifest file */\nexport interface ManifestFileInfo {\n /** Manifest ID */\n id: ObjectId12;\n\n /** Size in bytes */\n sizeBytes: number;\n\n /** Number of chunk refs in the manifest */\n numChunkRefs: number;\n}\n\n/** Range of chunk indices along one dimension */\nexport interface ChunkIndexRange {\n /** Inclusive start */\n from: number;\n\n /** Exclusive end */\n to: number;\n}\n\n/** Reference to a manifest with extent information */\nexport interface ManifestRef {\n /** Manifest object ID */\n objectId: ObjectId12;\n\n /** Chunk index ranges per dimension */\n extents: ChunkIndexRange[];\n}\n\n/** Shape of one dimension */\nexport interface DimensionShape {\n /** Length of the array along this dimension */\n arrayLength: number;\n\n /** Chunk size along this dimension (v1 format; approximate in v2) */\n chunkLength: number;\n\n /** Number of chunks along this dimension (v2 format) */\n numChunks?: number;\n}\n\n/** Group node data (empty - just a marker) */\nexport interface GroupNodeData {\n type: \"group\";\n}\n\n/** Array node data */\nexport interface ArrayNodeData {\n type: \"array\";\n\n /** Shape per dimension */\n shape: DimensionShape[];\n\n /** Optional dimension names */\n dimensionNames: (string | null)[];\n\n /** Manifest references */\n manifests: ManifestRef[];\n}\n\n/** Node data - either group or array */\nexport type NodeData = GroupNodeData | ArrayNodeData;\n\n/** Snapshot of a single node (array or group) */\nexport interface NodeSnapshot {\n /** Node ID */\n id: ObjectId8;\n\n /** Absolute path in the repository */\n path: string;\n\n /** User data (typically Zarr metadata JSON) */\n userData: Uint8Array;\n\n /** Node-specific data */\n nodeData: NodeData;\n}\n\n/** Complete snapshot of a repository state */\nexport interface Snapshot {\n /** Snapshot ID */\n id: ObjectId12;\n\n /** Parent snapshot ID (null for root snapshot) */\n parentId: ObjectId12 | null;\n\n /** Nodes in the snapshot, sorted by path */\n nodes: NodeSnapshot[];\n\n /** Timestamp when flushed (microseconds since epoch) */\n flushedAt: bigint;\n\n /** Commit message */\n message: string;\n\n /** Snapshot metadata */\n metadata: MetadataItem[];\n\n /** All manifest files referenced by this snapshot */\n manifestFiles: ManifestFileInfo[];\n}\n\n// =============================================================================\n// Chunk payload types (derived from ChunkRef for easier handling)\n// =============================================================================\n\n/** Inline chunk - data embedded in manifest */\nexport interface InlineChunkPayload {\n type: \"inline\";\n data: Uint8Array;\n}\n\n/** Native chunk - stored in repository's chunk storage */\nexport interface NativeChunkPayload {\n type: \"native\";\n chunkId: ObjectId12;\n offset: number;\n length: number;\n}\n\n/** Virtual chunk - stored externally */\nexport interface VirtualChunkPayload {\n type: \"virtual\";\n location: string;\n offset: number;\n length: number;\n checksumEtag: string | null;\n checksumLastModified: number;\n}\n\n/** Union of all chunk payload types */\nexport type ChunkPayload =\n | InlineChunkPayload\n | NativeChunkPayload\n | VirtualChunkPayload;\n\n// =============================================================================\n// Transaction log types (from transaction_log.fbs)\n// =============================================================================\n\n/** Chunk coordinates that were updated */\nexport interface UpdatedChunkIndices {\n coords: number[];\n}\n\n/** Updated chunks info for a single array */\nexport interface ArrayUpdatedChunksInfo {\n nodeId: ObjectId8;\n chunks: UpdatedChunkIndices[];\n}\n\n/** A node move operation */\nexport interface MoveOperationInfo {\n from: string;\n to: string;\n}\n\n/** A transaction log entry describing changes in a snapshot */\nexport interface TransactionLogEntry {\n id: ObjectId12;\n newGroups: ObjectId8[];\n newArrays: ObjectId8[];\n deletedGroups: ObjectId8[];\n deletedArrays: ObjectId8[];\n updatedArrays: ObjectId8[];\n updatedGroups: ObjectId8[];\n updatedChunks: ArrayUpdatedChunksInfo[];\n movedNodes: MoveOperationInfo[];\n}\n","/**\n * Parser for icechunk Snapshot FlatBuffer format.\n *\n * Uses flatc-generated TypeScript classes for type-safe field access.\n */\n\nimport { ByteBuffer } from \"flatbuffers\";\nimport { Snapshot as FbsSnapshot } from \"./generated/snapshot.js\";\nimport { NodeSnapshot as FbsNodeSnapshot } from \"./generated/node-snapshot.js\";\nimport { ArrayNodeData as FbsArrayNodeData } from \"./generated/array-node-data.js\";\nimport { ManifestRef as FbsManifestRef } from \"./generated/manifest-ref.js\";\nimport { NodeData as FbsNodeDataEnum } from \"./generated/node-data.js\";\nimport {\n asObjectId12,\n asObjectId8,\n type Snapshot,\n type NodeSnapshot,\n type NodeData,\n type ArrayNodeData,\n type ManifestRef,\n type ManifestFileInfo,\n type DimensionShape,\n type ChunkIndexRange,\n type MetadataItem,\n} from \"./types.js\";\n\n/** Extract bytes from a generated ObjectId12 struct */\nfunction readId12(bb: ByteBuffer, bbPos: number): Uint8Array {\n return bb.bytes().slice(bbPos, bbPos + 12);\n}\n\n/** Extract bytes from a generated ObjectId8 struct */\nfunction readId8(bb: ByteBuffer, bbPos: number): Uint8Array {\n return bb.bytes().slice(bbPos, bbPos + 8);\n}\n\n/** Parse a Snapshot from FlatBuffer data */\nexport function parseSnapshot(data: Uint8Array): Snapshot {\n const bb = new ByteBuffer(data);\n const fbsSnapshot = FbsSnapshot.getRootAsSnapshot(bb);\n\n // Parse ID (required)\n const idObj = fbsSnapshot.id();\n if (!idObj) throw new Error(\"Snapshot missing required id field\");\n const id = asObjectId12(readId12(idObj.bb!, idObj.bb_pos));\n\n // Parse parent ID (optional)\n const parentIdObj = fbsSnapshot.parentId();\n const parentId = parentIdObj\n ? asObjectId12(readId12(parentIdObj.bb!, parentIdObj.bb_pos))\n : null;\n\n // Parse nodes\n const nodesLength = fbsSnapshot.nodesLength();\n const nodes: NodeSnapshot[] = [];\n for (let i = 0; i < nodesLength; i++) {\n const fbsNode = fbsSnapshot.nodes(i);\n if (fbsNode) {\n nodes.push(parseNodeSnapshot(fbsNode));\n }\n }\n\n // Parse flushed_at\n const flushedAt = fbsSnapshot.flushedAt();\n\n // Parse message (required)\n const message = fbsSnapshot.message() ?? \"\";\n\n // Parse metadata\n const metadataLength = fbsSnapshot.metadataLength();\n const metadata: MetadataItem[] = [];\n for (let i = 0; i < metadataLength; i++) {\n const fbsMeta = fbsSnapshot.metadata(i);\n if (fbsMeta) {\n const name = fbsMeta.name();\n const value = fbsMeta.valueArray();\n if (name && value) {\n metadata.push({ name, value: new Uint8Array(value) });\n }\n }\n }\n\n // Parse manifest files — prefer v2 field, fall back to v1 struct vector\n const manifestFiles: ManifestFileInfo[] = [];\n const v2Length = fbsSnapshot.manifestFilesV2Length();\n if (v2Length > 0) {\n for (let i = 0; i < v2Length; i++) {\n const fbsMfi = fbsSnapshot.manifestFilesV2(i);\n if (fbsMfi) {\n const mfiIdObj = fbsMfi.id();\n if (!mfiIdObj) throw new Error(\"ManifestFileInfoV2 missing id\");\n manifestFiles.push({\n id: asObjectId12(readId12(mfiIdObj.bb!, mfiIdObj.bb_pos)),\n sizeBytes: Number(fbsMfi.sizeBytes()),\n numChunkRefs: fbsMfi.numChunkRefs(),\n });\n }\n }\n } else {\n const v1Length = fbsSnapshot.manifestFilesLength();\n for (let i = 0; i < v1Length; i++) {\n const fbsMfi = fbsSnapshot.manifestFiles(i);\n if (fbsMfi) {\n const mfiIdObj = fbsMfi.id();\n if (!mfiIdObj) throw new Error(\"ManifestFileInfo missing id\");\n manifestFiles.push({\n id: asObjectId12(readId12(mfiIdObj.bb!, mfiIdObj.bb_pos)),\n sizeBytes: Number(fbsMfi.sizeBytes()),\n numChunkRefs: fbsMfi.numChunkRefs(),\n });\n }\n }\n }\n\n return {\n id,\n parentId,\n nodes,\n flushedAt,\n message,\n metadata,\n manifestFiles,\n };\n}\n\nfunction parseNodeSnapshot(fbsNode: FbsNodeSnapshot): NodeSnapshot {\n // Parse ID (required)\n const idObj = fbsNode.id();\n if (!idObj) throw new Error(\"NodeSnapshot missing required id field\");\n const id = asObjectId8(readId8(idObj.bb!, idObj.bb_pos));\n\n // Parse path (required)\n const path = fbsNode.path() ?? \"\";\n\n // Parse user_data (required)\n const userData = fbsNode.userDataArray() ?? new Uint8Array(0);\n\n // Parse node_data (union)\n const nodeDataType = fbsNode.nodeDataType();\n const nodeData = parseNodeData(fbsNode, nodeDataType);\n\n return { id, path, userData, nodeData };\n}\n\nfunction parseNodeData(\n fbsNode: FbsNodeSnapshot,\n unionType: FbsNodeDataEnum,\n): NodeData {\n if (\n unionType === FbsNodeDataEnum.NONE ||\n unionType === FbsNodeDataEnum.Group\n ) {\n return { type: \"group\" };\n }\n\n if (unionType === FbsNodeDataEnum.Array) {\n const arrayData = fbsNode.nodeData(new FbsArrayNodeData());\n if (!arrayData) {\n throw new Error(\"ArrayNodeData union type but no table\");\n }\n return parseArrayNodeData(arrayData as FbsArrayNodeData);\n }\n\n throw new Error(`Unknown node data union type: ${unionType}`);\n}\n\nfunction parseArrayNodeData(fbsArray: FbsArrayNodeData): ArrayNodeData {\n // Parse shape — prefer v2 field, fall back to v1 struct vector\n const shape: DimensionShape[] = [];\n const shapeV2Length = fbsArray.shapeV2Length();\n if (shapeV2Length > 0) {\n for (let i = 0; i < shapeV2Length; i++) {\n const fbsShape = fbsArray.shapeV2(i);\n if (fbsShape) {\n const arrayLength = Number(fbsShape.arrayLength());\n const numChunks = fbsShape.numChunks();\n shape.push({\n arrayLength,\n chunkLength: numChunks > 0 ? Math.ceil(arrayLength / numChunks) : 0,\n numChunks,\n });\n }\n }\n } else {\n const shapeLength = fbsArray.shapeLength();\n for (let i = 0; i < shapeLength; i++) {\n const fbsShape = fbsArray.shape(i);\n if (fbsShape) {\n shape.push({\n arrayLength: Number(fbsShape.arrayLength()),\n chunkLength: Number(fbsShape.chunkLength()),\n });\n }\n }\n }\n\n // Parse dimension names (vector of tables)\n const dimNamesLength = fbsArray.dimensionNamesLength();\n const dimensionNames: (string | null)[] = [];\n for (let i = 0; i < dimNamesLength; i++) {\n const fbsDimName = fbsArray.dimensionNames(i);\n if (fbsDimName) {\n dimensionNames.push(fbsDimName.name());\n } else {\n dimensionNames.push(null);\n }\n }\n\n // Parse manifests (vector of tables)\n const manifestsLength = fbsArray.manifestsLength();\n const manifests: ManifestRef[] = [];\n for (let i = 0; i < manifestsLength; i++) {\n const fbsManifest = fbsArray.manifests(i);\n if (fbsManifest) {\n manifests.push(parseManifestRef(fbsManifest));\n }\n }\n\n return {\n type: \"array\",\n shape,\n dimensionNames,\n manifests,\n };\n}\n\nfunction parseManifestRef(fbsRef: FbsManifestRef): ManifestRef {\n // Object ID (inline struct)\n const objectIdObj = fbsRef.objectId();\n if (!objectIdObj) throw new Error(\"ManifestRef missing object_id\");\n const objectId = asObjectId12(readId12(objectIdObj.bb!, objectIdObj.bb_pos));\n\n // Extents (vector of ChunkIndexRange structs)\n const extentsLength = fbsRef.extentsLength();\n const extents: ChunkIndexRange[] = [];\n for (let i = 0; i < extentsLength; i++) {\n const fbsExtent = fbsRef.extents(i);\n if (fbsExtent) {\n extents.push({ from: fbsExtent.from(), to: fbsExtent.to() });\n }\n }\n\n return { objectId, extents };\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class ManifestFileInfo {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ManifestFileInfo {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n id(obj?: ObjectId12): ObjectId12 | null {\n return (obj || new ObjectId12()).__init(this.bb_pos, this.bb!);\n }\n\n sizeBytes(): bigint {\n return this.bb!.readUint64(this.bb_pos + 16);\n }\n\n numChunkRefs(): number {\n return this.bb!.readUint32(this.bb_pos + 24);\n }\n\n static sizeOf(): number {\n return 32;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class ManifestFileInfoV2 {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ManifestFileInfoV2 {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsManifestFileInfoV2(\n bb: flatbuffers.ByteBuffer,\n obj?: ManifestFileInfoV2,\n ): ManifestFileInfoV2 {\n return (obj || new ManifestFileInfoV2()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n id(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n sizeBytes(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n numChunkRefs(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.readUint32(this.bb_pos + offset) : 0;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class DimensionName {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): DimensionName {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsDimensionName(\n bb: flatbuffers.ByteBuffer,\n obj?: DimensionName,\n ): DimensionName {\n return (obj || new DimensionName()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n name(): string | null;\n name(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n name(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class DimensionShape {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): DimensionShape {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n arrayLength(): bigint {\n return this.bb!.readUint64(this.bb_pos);\n }\n\n chunkLength(): bigint {\n return this.bb!.readUint64(this.bb_pos + 8);\n }\n\n static sizeOf(): number {\n return 16;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class DimensionShapeV2 {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): DimensionShapeV2 {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsDimensionShapeV2(\n bb: flatbuffers.ByteBuffer,\n obj?: DimensionShapeV2,\n ): DimensionShapeV2 {\n return (obj || new DimensionShapeV2()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n arrayLength(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n numChunks(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.readUint32(this.bb_pos + offset) : 0;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class ChunkIndexRange {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ChunkIndexRange {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n from(): number {\n return this.bb!.readUint32(this.bb_pos);\n }\n\n to(): number {\n return this.bb!.readUint32(this.bb_pos + 4);\n }\n\n static sizeOf(): number {\n return 8;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ChunkIndexRange } from \"../generated/chunk-index-range.js\";\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class ManifestRef {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ManifestRef {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsManifestRef(\n bb: flatbuffers.ByteBuffer,\n obj?: ManifestRef,\n ): ManifestRef {\n return (obj || new ManifestRef()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n objectId(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n extents(index: number, obj?: ChunkIndexRange): ChunkIndexRange | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new ChunkIndexRange()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n extentsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { DimensionName } from \"../generated/dimension-name.js\";\nimport { DimensionShape } from \"../generated/dimension-shape.js\";\nimport { DimensionShapeV2 } from \"../generated/dimension-shape-v2.js\";\nimport { ManifestRef } from \"../generated/manifest-ref.js\";\n\nexport class ArrayNodeData {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ArrayNodeData {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsArrayNodeData(\n bb: flatbuffers.ByteBuffer,\n obj?: ArrayNodeData,\n ): ArrayNodeData {\n return (obj || new ArrayNodeData()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n shape(index: number, obj?: DimensionShape): DimensionShape | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new DimensionShape()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 16,\n this.bb!,\n )\n : null;\n }\n\n shapeLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n dimensionNames(index: number, obj?: DimensionName): DimensionName | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new DimensionName()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n dimensionNamesLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n manifests(index: number, obj?: ManifestRef): ManifestRef | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? (obj || new ManifestRef()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n manifestsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n shapeV2(index: number, obj?: DimensionShapeV2): DimensionShapeV2 | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? (obj || new DimensionShapeV2()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n shapeV2Length(): number {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class ObjectId8 {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ObjectId8 {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n bytes(index: number): number | null {\n return this.bb!.readUint8(this.bb_pos + 0 + index);\n }\n\n static sizeOf(): number {\n return 8;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { NodeData } from \"../generated/node-data.js\";\nimport { ObjectId8 } from \"../generated/object-id8.js\";\n\nexport class NodeSnapshot {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): NodeSnapshot {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsNodeSnapshot(\n bb: flatbuffers.ByteBuffer,\n obj?: NodeSnapshot,\n ): NodeSnapshot {\n return (obj || new NodeSnapshot()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n id(obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId8()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n path(): string | null;\n path(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n path(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n userData(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n userDataLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n userDataArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n nodeDataType(): NodeData {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.readUint8(this.bb_pos + offset) : NodeData.NONE;\n }\n\n nodeData(obj: any): any | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset ? this.bb!.__union(obj, this.bb_pos + offset) : null;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ManifestFileInfo } from \"../generated/manifest-file-info.js\";\nimport { ManifestFileInfoV2 } from \"../generated/manifest-file-info-v2.js\";\nimport { MetadataItem } from \"../generated/metadata-item.js\";\nimport { NodeSnapshot } from \"../generated/node-snapshot.js\";\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class Snapshot {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): Snapshot {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsSnapshot(\n bb: flatbuffers.ByteBuffer,\n obj?: Snapshot,\n ): Snapshot {\n return (obj || new Snapshot()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n id(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n parentId(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n nodes(index: number, obj?: NodeSnapshot): NodeSnapshot | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? (obj || new NodeSnapshot()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n nodesLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n flushedAt(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n message(): string | null;\n message(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n message(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n metadata(index: number, obj?: MetadataItem): MetadataItem | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? (obj || new MetadataItem()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n metadataLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n manifestFiles(\n index: number,\n obj?: ManifestFileInfo,\n ): ManifestFileInfo | null {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset\n ? (obj || new ManifestFileInfo()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 32,\n this.bb!,\n )\n : null;\n }\n\n manifestFilesLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n manifestFilesV2(\n index: number,\n obj?: ManifestFileInfoV2,\n ): ManifestFileInfoV2 | null {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset\n ? (obj || new ManifestFileInfoV2()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n manifestFilesV2Length(): number {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","/**\n * Parser for icechunk Manifest FlatBuffer format.\n *\n * Uses flatc-generated TypeScript classes for type-safe field access.\n */\n\nimport { ByteBuffer } from \"flatbuffers\";\nimport { decompress } from \"../../vendor/fzstd/index.js\";\nimport { Manifest as FbsManifest } from \"./generated/manifest.js\";\nimport { ArrayManifest as FbsArrayManifest } from \"./generated/array-manifest.js\";\nimport { ChunkRef as FbsChunkRef } from \"./generated/chunk-ref.js\";\nimport {\n asObjectId12,\n asObjectId8,\n type Manifest,\n type ArrayManifest,\n type ChunkRef,\n type ChunkPayload,\n type ObjectId8,\n} from \"./types.js\";\n\n/** compression_algorithm value for zstd dictionary-compressed locations. */\nconst COMPRESSION_ALG_ZSTD_DICT = 1;\n\n/** Upper bound on a decompressed location, matching the Rust\n * `MAX_DECOMPRESSED_LOCATION_SIZE`. */\nconst MAX_DECOMPRESSED_LOCATION_SIZE = 1024;\n\n/**\n * Upper bound on the bytes the vendored fzstd decoder will allocate for\n * `frame`, computed from the frame header *without* decompressing: the larger\n * of the up-front frame buffer (content size, falling back to window size, per\n * `rzfh`) and the sum of the per-block output buffers (per `rzb`). Requires\n * `frame` to be a single complete frame covering the whole input; returns\n * `Infinity` for a missing/short/unrecognized header, a malformed/reserved\n * block, or any trailing bytes (a concatenated second frame), so callers reject\n * rather than trust it.\n *\n * Used to bound allocation *before* decompressing an untrusted\n * `compressed_location`: the size check on the decompressed output alone is too\n * late, since the decoder allocates per the header — including RLE blocks that\n * expand a single input byte to a huge declared size — before that check runs.\n */\nfunction zstdFrameAllocSize(frame: Uint8Array): number {\n // Magic number 0xFD2FB528 (little-endian), then the frame header descriptor.\n if (\n frame.length < 5 ||\n frame[0] !== 0x28 ||\n frame[1] !== 0xb5 ||\n frame[2] !== 0x2f ||\n frame[3] !== 0xfd\n ) {\n return Infinity;\n }\n const flg = frame[4];\n const singleSegment = (flg >> 5) & 1;\n const contentChecksum = (flg >> 2) & 1;\n const dictIdFlag = flg & 3;\n const contentSizeFlag = flg >> 6;\n\n let pos = 5;\n let windowSize = 0;\n if (!singleSegment) {\n if (pos >= frame.length) return Infinity;\n const wd = frame[pos++];\n // Arithmetic (not bitwise `1 <<`/`>> 3`): the exponent can reach 41, which\n // would overflow 32-bit JS shifts and let a crafted window descriptor\n // compute a bogus small size that slips past the bound below.\n const base = 2 ** (10 + (wd >> 3));\n windowSize = base + (base / 8) * (wd & 7);\n }\n pos += dictIdFlag === 3 ? 4 : dictIdFlag; // skip dictionary id\n\n // Frame content size: 0/1/2/4/8 bytes per the flags (matching fzstd's rzfh).\n const fcsBytes = contentSizeFlag ? 1 << contentSizeFlag : singleSegment;\n let contentSize = 0;\n if (fcsBytes) {\n if (pos + fcsBytes > frame.length) return Infinity;\n for (let i = 0; i < fcsBytes; i++) {\n contentSize += frame[pos + i] * 2 ** (8 * i);\n }\n if (contentSizeFlag === 1) contentSize += 256;\n if (singleSegment) windowSize = contentSize;\n }\n pos += fcsBytes;\n\n // Walk the data blocks to the frame end, summing the output each block makes\n // the decoder allocate. This is essential, not just an EOF check: an RLE\n // block costs one input byte but expands to its declared size (up to ~2MB),\n // and a compressed block expands to one block-max regardless of input — so a\n // frame whose header advertises a tiny window/content size can still force a\n // huge allocation. We mirror the per-block allocations in the vendored fzstd\n // `rzb`: RLE/raw -> the block size, compressed -> min(windowSize, 128KiB).\n //\n // Also require exactly one complete frame covering the whole input:\n // `decompress()` decodes *every* concatenated frame and allocates per frame,\n // so trailing bytes (a second frame advertising a huge size) must be rejected.\n let blockOutput = 0;\n for (;;) {\n if (pos + 3 > frame.length) return Infinity;\n const blockHeader =\n frame[pos] | (frame[pos + 1] << 8) | (frame[pos + 2] << 16);\n pos += 3;\n const lastBlock = blockHeader & 1;\n const blockType = (blockHeader >> 1) & 3;\n const blockSize = blockHeader >> 3;\n if (blockType === 3) return Infinity; // reserved block type\n if (blockType === 1) {\n // RLE: one input byte, but the decoder allocates `blockSize` output bytes.\n blockOutput += blockSize;\n pos += 1;\n } else {\n // Raw (0): `blockSize` literal bytes, present in the input.\n // Compressed (2): decoder allocates one block-max, min(windowSize, 128KiB).\n blockOutput += blockType === 0 ? blockSize : Math.min(windowSize, 131072);\n pos += blockSize;\n }\n if (pos > frame.length) return Infinity;\n if (lastBlock) break;\n }\n if (contentChecksum) pos += 4;\n if (pos !== frame.length) return Infinity; // trailing/concatenated frame\n\n // The decoder allocates both the up-front frame buffer (content/window size)\n // and the per-block buffers; bound by the larger of the two.\n return Math.max(contentSize || windowSize, blockOutput);\n}\n\n/**\n * Decode a ChunkRef's `compressed_location` byte vector into a location string.\n * Throws if the manifest has no location dictionary, if the frame's declared\n * size exceeds the bound, or if the bytes aren't valid UTF-8.\n */\ntype LocationDecoder = (compressed: Uint8Array) => string;\n\n/** Parse a Manifest from FlatBuffer data */\nexport function parseManifest(data: Uint8Array): Manifest {\n const bb = new ByteBuffer(data);\n const fbsManifest = FbsManifest.getRootAsManifest(bb);\n\n // Parse ID (required)\n const idObj = fbsManifest.id();\n if (!idObj) throw new Error(\"Manifest missing required id field\");\n const id = asObjectId12(\n idObj.bb!.bytes().slice(idObj.bb_pos, idObj.bb_pos + 12),\n );\n\n // Build the location decoder once per manifest from its zstd dictionary.\n const decodeLocation = makeLocationDecoder(fbsManifest);\n\n // Parse arrays\n const arraysLength = fbsManifest.arraysLength();\n const arrays: ArrayManifest[] = [];\n for (let i = 0; i < arraysLength; i++) {\n const fbsArray = fbsManifest.arrays(i);\n if (fbsArray) {\n arrays.push(parseArrayManifest(fbsArray, decodeLocation));\n }\n }\n\n return { id, arrays };\n}\n\n/**\n * Build the function that turns a ChunkRef's `compressed_location` into a\n * location string, using the manifest's zstd dictionary.\n *\n * Mirrors the Rust `Manifest::decompressor`: a dictionary is only used when\n * `compression_algorithm == ZSTD_DICT` and `location_dictionary` is present.\n * When a `compressed_location` is encountered without a dictionary, decoding\n * throws (matching the Rust `MissingLocationCompressionDictionary` error).\n *\n * Note: `manifest.fbs` prose says `compression_algorithm == 0` means\n * `compressed_location` holds raw (uncompressed) bytes, but that path is not\n * implemented in the Rust reference — its writer only emits `compressed_location`\n * for ZSTD_DICT (otherwise it writes the plain `location` field) and its reader\n * errors here. We follow the reference behavior, not the (inconsistent) schema\n * comment. See earth-mover/icechunk manifest.fbs vs manifest.rs.\n */\nfunction makeLocationDecoder(fbsManifest: FbsManifest): LocationDecoder {\n const dictionary =\n fbsManifest.compressionAlgorithm() === COMPRESSION_ALG_ZSTD_DICT\n ? fbsManifest.locationDictionaryArray()\n : null;\n // `fatal` makes invalid UTF-8 throw, matching the Rust `String::from_utf8`.\n const textDecoder = new TextDecoder(\"utf-8\", { fatal: true });\n return (compressed: Uint8Array): string => {\n if (!dictionary) {\n throw new Error(\n \"ChunkRef has a compressed_location but the manifest has no location dictionary\",\n );\n }\n // Reject before decompressing: a malformed frame can advertise a huge size\n // and make the decoder allocate far beyond the bound (or OOM) before the\n // post-decompress length check below would run.\n if (zstdFrameAllocSize(compressed) > MAX_DECOMPRESSED_LOCATION_SIZE) {\n throw new Error(\n `Compressed location declares a size over ${MAX_DECOMPRESSED_LOCATION_SIZE} bytes`,\n );\n }\n const decompressed = decompress(compressed, undefined, dictionary);\n if (decompressed.length > MAX_DECOMPRESSED_LOCATION_SIZE) {\n throw new Error(\n `Decompressed location exceeds ${MAX_DECOMPRESSED_LOCATION_SIZE} bytes`,\n );\n }\n return textDecoder.decode(decompressed);\n };\n}\n\nfunction parseArrayManifest(\n fbsArray: FbsArrayManifest,\n decodeLocation: LocationDecoder,\n): ArrayManifest {\n // Parse node_id (required)\n const nodeIdObj = fbsArray.nodeId();\n if (!nodeIdObj)\n throw new Error(\"ArrayManifest missing required node_id field\");\n const nodeId = asObjectId8(\n nodeIdObj.bb!.bytes().slice(nodeIdObj.bb_pos, nodeIdObj.bb_pos + 8),\n );\n\n // Parse refs\n const refsLength = fbsArray.refsLength();\n const refs: ChunkRef[] = [];\n for (let i = 0; i < refsLength; i++) {\n const fbsRef = fbsArray.refs(i);\n if (fbsRef) {\n refs.push(parseChunkRef(fbsRef, decodeLocation));\n }\n }\n\n return { nodeId, refs };\n}\n\nfunction parseChunkRef(\n fbsRef: FbsChunkRef,\n decodeLocation: LocationDecoder,\n): ChunkRef {\n // Parse index (required, vector of uint32)\n const indexLength = fbsRef.indexLength();\n const index: number[] = [];\n for (let i = 0; i < indexLength; i++) {\n index.push(fbsRef.index(i)!);\n }\n\n // Parse inline (optional byte vector)\n const inlineData = fbsRef.inlineArray();\n const inline = inlineData ? new Uint8Array(inlineData) : null;\n\n // Parse offset and length\n const offset = Number(fbsRef.offset());\n const length = Number(fbsRef.length());\n\n // Parse chunk_id (optional inline struct)\n const chunkIdObj = fbsRef.chunkId();\n const chunkId = chunkIdObj\n ? asObjectId12(\n chunkIdObj.bb!.bytes().slice(chunkIdObj.bb_pos, chunkIdObj.bb_pos + 12),\n )\n : null;\n\n // Parse checksum fields\n const checksumEtag = fbsRef.checksumEtag();\n const checksumLastModified = fbsRef.checksumLastModified();\n\n const ref: ChunkRef = {\n index,\n inline,\n offset,\n length,\n chunkId,\n location: fbsRef.location(),\n checksumEtag,\n checksumLastModified,\n };\n\n // A dictionary-compressed location takes precedence over the plain `location`\n // string (Rust `ref_to_payload` priority: chunk_id -> compressed_location ->\n // location). `chunk_id` refs are native, not virtual, so they never carry a\n // location. Decode lazily on first read of `location` — mirroring the Rust\n // reader, which decompresses in `ref_to_payload` — so parsing a manifest\n // never decompresses locations the caller doesn't access (the binary search\n // in findChunkRef touches only `index`), and a single malformed frame fails\n // just its own ref instead of aborting the whole manifest parse.\n if (chunkId === null) {\n const compressed = fbsRef.compressedLocationArray();\n if (compressed) {\n let decoded: string | null = null;\n let resolved = false;\n Object.defineProperty(ref, \"location\", {\n configurable: true,\n enumerable: true,\n get() {\n if (!resolved) {\n decoded = decodeLocation(compressed);\n resolved = true;\n }\n return decoded;\n },\n });\n }\n }\n\n return ref;\n}\n\n/**\n * Find a chunk reference by node ID and coordinates.\n *\n * Uses binary search since both arrays and refs are sorted.\n */\nexport function findChunkRef(\n manifest: Manifest,\n nodeId: ObjectId8,\n coords: number[],\n): ChunkRef | null {\n // Binary search for the array manifest (arrays are sorted by nodeId)\n const arrayManifest = binarySearchArrayManifest(manifest.arrays, nodeId);\n\n if (!arrayManifest) return null;\n\n // Binary search for the chunk ref (refs are sorted by index)\n return binarySearchChunkRef(arrayManifest.refs, coords);\n}\n\n/** Binary search for an array manifest by node ID */\nfunction binarySearchArrayManifest(\n arrays: ArrayManifest[],\n nodeId: ObjectId8,\n): ArrayManifest | null {\n let low = 0;\n let high = arrays.length - 1;\n\n while (low <= high) {\n const mid = Math.floor((low + high) / 2);\n const cmp = compareBytes(arrays[mid].nodeId, nodeId);\n\n if (cmp === 0) {\n return arrays[mid];\n } else if (cmp < 0) {\n low = mid + 1;\n } else {\n high = mid - 1;\n }\n }\n\n return null;\n}\n\n/** Compare two byte arrays lexicographically */\nfunction compareBytes(a: Uint8Array, b: Uint8Array): number {\n const minLen = Math.min(a.length, b.length);\n for (let i = 0; i < minLen; i++) {\n if (a[i] !== b[i]) return a[i] - b[i];\n }\n return a.length - b.length;\n}\n\n/** Compare two coordinate arrays lexicographically */\nfunction compareCoords(a: number[], b: number[]): number {\n const minLen = Math.min(a.length, b.length);\n for (let i = 0; i < minLen; i++) {\n if (a[i] !== b[i]) return a[i] - b[i];\n }\n return a.length - b.length;\n}\n\n/** Binary search for a chunk ref by coordinates */\nfunction binarySearchChunkRef(\n refs: ChunkRef[],\n coords: number[],\n): ChunkRef | null {\n let low = 0;\n let high = refs.length - 1;\n\n while (low <= high) {\n const mid = Math.floor((low + high) / 2);\n const cmp = compareCoords(refs[mid].index, coords);\n\n if (cmp === 0) {\n return refs[mid];\n } else if (cmp < 0) {\n low = mid + 1;\n } else {\n high = mid - 1;\n }\n }\n\n return null;\n}\n\n/**\n * Extract the payload type from a ChunkRef.\n *\n * Priority matches the Rust `ref_to_payload`: chunk_id (native) ->\n * location (virtual) -> inline. Reading `ref.location` decodes a\n * dictionary-compressed location lazily, and may throw on a malformed frame.\n */\nexport function getChunkPayload(ref: ChunkRef): ChunkPayload {\n if (ref.chunkId !== null) {\n return {\n type: \"native\",\n chunkId: ref.chunkId,\n offset: ref.offset,\n length: ref.length,\n };\n }\n\n if (ref.location !== null) {\n return {\n type: \"virtual\",\n location: ref.location,\n offset: ref.offset,\n length: ref.length,\n checksumEtag: ref.checksumEtag,\n checksumLastModified: ref.checksumLastModified,\n };\n }\n\n if (ref.inline !== null) {\n return { type: \"inline\", data: ref.inline };\n }\n\n throw new Error(\"Invalid ChunkRef: no chunkId, location, or inline\");\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class ChunkRef {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ChunkRef {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsChunkRef(\n bb: flatbuffers.ByteBuffer,\n obj?: ChunkRef,\n ): ChunkRef {\n return (obj || new ChunkRef()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n index(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.readUint32(this.bb!.__vector(this.bb_pos + offset) + index * 4)\n : 0;\n }\n\n indexLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n indexArray(): Uint32Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? new Uint32Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n inline(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n inlineLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n inlineArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n offset(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n length(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n chunkId(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n location(): string | null;\n location(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n location(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n checksumEtag(): string | null;\n checksumEtag(\n optionalEncoding: flatbuffers.Encoding,\n ): string | Uint8Array | null;\n checksumEtag(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n checksumLastModified(): number {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset ? this.bb!.readUint32(this.bb_pos + offset) : 0;\n }\n\n compressedLocation(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n compressedLocationLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n compressedLocationArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ChunkRef } from \"../generated/chunk-ref.js\";\nimport { ObjectId8 } from \"../generated/object-id8.js\";\n\nexport class ArrayManifest {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ArrayManifest {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsArrayManifest(\n bb: flatbuffers.ByteBuffer,\n obj?: ArrayManifest,\n ): ArrayManifest {\n return (obj || new ArrayManifest()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n nodeId(obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId8()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n refs(index: number, obj?: ChunkRef): ChunkRef | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new ChunkRef()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n refsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ArrayManifest } from \"../generated/array-manifest.js\";\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class Manifest {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): Manifest {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsManifest(\n bb: flatbuffers.ByteBuffer,\n obj?: Manifest,\n ): Manifest {\n return (obj || new Manifest()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n id(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n arrays(index: number, obj?: ArrayManifest): ArrayManifest | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new ArrayManifest()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n arraysLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n locationDictionary(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n locationDictionaryLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n locationDictionaryArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n compressionAlgorithm(): number {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.readUint8(this.bb_pos + offset) : 1;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","/**\n * Metadata deserialization for icechunk snapshot metadata.\n *\n * v1 snapshots use MessagePack encoding, v2 uses FlexBuffers.\n */\n\nimport { decode } from \"@msgpack/msgpack\";\nimport * as flexbuffers from \"flatbuffers/js/flexbuffers.js\";\nimport { SpecVersion } from \"../header.js\";\nimport type { MetadataItem } from \"./types.js\";\n\n/**\n * Deserialize snapshot metadata items into a key-value record.\n *\n * @param items - Raw metadata items from the snapshot\n * @param specVersion - Spec version determines encoding format\n * @returns Deserialized metadata as a plain object\n */\nexport function deserializeMetadata(\n items: MetadataItem[],\n specVersion: SpecVersion,\n): Record<string, unknown> {\n const result: Record<string, unknown> = Object.create(null);\n for (const item of items) {\n result[item.name] =\n specVersion === SpecVersion.V1_0\n ? decode(item.value)\n : flexbuffers.toObject(\n item.value.buffer.slice(\n item.value.byteOffset,\n item.value.byteOffset + item.value.byteLength,\n ) as ArrayBuffer,\n );\n }\n return result;\n}\n","/**\n * Parser for icechunk TransactionLog FlatBuffer format.\n *\n * Uses flatc-generated TypeScript classes for type-safe field access.\n */\n\nimport { ByteBuffer } from \"flatbuffers\";\nimport { TransactionLog as FbsTransactionLog } from \"./generated/transaction-log.js\";\nimport {\n asObjectId12,\n asObjectId8,\n type ObjectId8,\n type TransactionLogEntry,\n type ArrayUpdatedChunksInfo,\n type UpdatedChunkIndices,\n type MoveOperationInfo,\n} from \"./types.js\";\n\n/** Extract bytes from a generated ObjectId12 struct */\nfunction readId12(bb: ByteBuffer, bbPos: number): Uint8Array {\n return bb.bytes().slice(bbPos, bbPos + 12);\n}\n\n/** Extract bytes from a generated ObjectId8 struct */\nfunction readId8(bb: ByteBuffer, bbPos: number): Uint8Array {\n return bb.bytes().slice(bbPos, bbPos + 8);\n}\n\n/** Read a vector of ObjectId8 values from a FlatBuffer accessor */\nfunction readId8Vector(\n length: number,\n accessor: (index: number) => { bb: ByteBuffer | null; bb_pos: number } | null,\n): ObjectId8[] {\n const result: ObjectId8[] = [];\n for (let i = 0; i < length; i++) {\n const obj = accessor(i);\n if (obj && obj.bb) {\n result.push(asObjectId8(readId8(obj.bb, obj.bb_pos)));\n }\n }\n return result;\n}\n\n/** Parse a TransactionLog from FlatBuffer data */\nexport function parseTransactionLog(data: Uint8Array): TransactionLogEntry {\n const bb = new ByteBuffer(data);\n const fbs = FbsTransactionLog.getRootAsTransactionLog(bb);\n\n // Parse ID (required)\n const idObj = fbs.id();\n if (!idObj) throw new Error(\"TransactionLog missing required id field\");\n const id = asObjectId12(readId12(idObj.bb!, idObj.bb_pos));\n\n // Parse ObjectId8 vectors\n const newGroups = readId8Vector(fbs.newGroupsLength(), (i) =>\n fbs.newGroups(i),\n );\n const newArrays = readId8Vector(fbs.newArraysLength(), (i) =>\n fbs.newArrays(i),\n );\n const deletedGroups = readId8Vector(fbs.deletedGroupsLength(), (i) =>\n fbs.deletedGroups(i),\n );\n const deletedArrays = readId8Vector(fbs.deletedArraysLength(), (i) =>\n fbs.deletedArrays(i),\n );\n const updatedArrays = readId8Vector(fbs.updatedArraysLength(), (i) =>\n fbs.updatedArrays(i),\n );\n const updatedGroups = readId8Vector(fbs.updatedGroupsLength(), (i) =>\n fbs.updatedGroups(i),\n );\n\n // Parse updated chunks\n const updatedChunks: ArrayUpdatedChunksInfo[] = [];\n for (let i = 0; i < fbs.updatedChunksLength(); i++) {\n const fbsChunk = fbs.updatedChunks(i);\n if (!fbsChunk) continue;\n\n const nodeIdObj = fbsChunk.nodeId();\n if (!nodeIdObj || !nodeIdObj.bb) continue;\n const nodeId = asObjectId8(readId8(nodeIdObj.bb, nodeIdObj.bb_pos));\n\n const chunks: UpdatedChunkIndices[] = [];\n for (let j = 0; j < fbsChunk.chunksLength(); j++) {\n const fbsIndices = fbsChunk.chunks(j);\n if (!fbsIndices) continue;\n\n const coords: number[] = [];\n for (let k = 0; k < fbsIndices.coordsLength(); k++) {\n const coord = fbsIndices.coords(k);\n if (coord !== null) coords.push(coord);\n }\n chunks.push({ coords });\n }\n\n updatedChunks.push({ nodeId, chunks });\n }\n\n // Parse moved nodes\n const movedNodes: MoveOperationInfo[] = [];\n for (let i = 0; i < fbs.movedNodesLength(); i++) {\n const fbsMove = fbs.movedNodes(i);\n if (!fbsMove) continue;\n\n const from = fbsMove.from();\n const to = fbsMove.to();\n if (from !== null && to !== null) {\n movedNodes.push({ from, to });\n }\n }\n\n return {\n id,\n newGroups,\n newArrays,\n deletedGroups,\n deletedArrays,\n updatedArrays,\n updatedGroups,\n updatedChunks,\n movedNodes,\n };\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class ChunkIndices {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ChunkIndices {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsChunkIndices(\n bb: flatbuffers.ByteBuffer,\n obj?: ChunkIndices,\n ): ChunkIndices {\n return (obj || new ChunkIndices()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n coords(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.readUint32(this.bb!.__vector(this.bb_pos + offset) + index * 4)\n : 0;\n }\n\n coordsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n coordsArray(): Uint32Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? new Uint32Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ChunkIndices } from \"../generated/chunk-indices.js\";\nimport { ObjectId8 } from \"../generated/object-id8.js\";\n\nexport class ArrayUpdatedChunks {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ArrayUpdatedChunks {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsArrayUpdatedChunks(\n bb: flatbuffers.ByteBuffer,\n obj?: ArrayUpdatedChunks,\n ): ArrayUpdatedChunks {\n return (obj || new ArrayUpdatedChunks()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n nodeId(obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId8()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n chunks(index: number, obj?: ChunkIndices): ChunkIndices | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new ChunkIndices()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n chunksLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { NodeType } from \"../generated/node-type.js\";\nimport { ObjectId8 } from \"../generated/object-id8.js\";\n\nexport class MoveOperation {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): MoveOperation {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsMoveOperation(\n bb: flatbuffers.ByteBuffer,\n obj?: MoveOperation,\n ): MoveOperation {\n return (obj || new MoveOperation()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n from(): string | null;\n from(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n from(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n to(): string | null;\n to(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n to(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n nodeId(obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? (obj || new ObjectId8()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n nodeType(): NodeType {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.readUint8(this.bb_pos + offset) : NodeType.Group;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ArrayUpdatedChunks } from \"../generated/array-updated-chunks.js\";\nimport { MoveOperation } from \"../generated/move-operation.js\";\nimport { ObjectId12 } from \"../generated/object-id12.js\";\nimport { ObjectId8 } from \"../generated/object-id8.js\";\n\nexport class TransactionLog {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): TransactionLog {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsTransactionLog(\n bb: flatbuffers.ByteBuffer,\n obj?: TransactionLog,\n ): TransactionLog {\n return (obj || new TransactionLog()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n id(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n newGroups(index: number, obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new ObjectId8()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n newGroupsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n newArrays(index: number, obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? (obj || new ObjectId8()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n newArraysLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n deletedGroups(index: number, obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? (obj || new ObjectId8()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n deletedGroupsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n deletedArrays(index: number, obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? (obj || new ObjectId8()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n deletedArraysLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n updatedArrays(index: number, obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? (obj || new ObjectId8()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n updatedArraysLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n updatedGroups(index: number, obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset\n ? (obj || new ObjectId8()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n updatedGroupsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n updatedChunks(\n index: number,\n obj?: ArrayUpdatedChunks,\n ): ArrayUpdatedChunks | null {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset\n ? (obj || new ArrayUpdatedChunks()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n updatedChunksLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n movedNodes(index: number, obj?: MoveOperation): MoveOperation | null {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset\n ? (obj || new MoveOperation()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n movedNodesLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","/**\n * Adapters for zarrita's `withRangeCoalescing` (added in zarrita 0.7).\n *\n * The coalescer works over any range-readable store keyed by object path.\n * These adapters expose icechunk's two backing-object cases in that shape:\n *\n * - `makeUrlStore` fetches ranges from one external virtual-chunk URL.\n * - `makeStorageStore` fetches ranges from repository storage objects.\n *\n * Callers pass `zarrita.withRangeCoalescing` into icechunk-js explicitly when\n * they want coalescing, keeping zarrita a true optional dependency.\n */\n\nimport type { FetchClient, Storage } from \"../storage/storage.js\";\n\n// Minimal structural mirror of zarrita's `AsyncReadable`. Kept local so\n// this module has no required import from zarrita — the peer dep is\n// optional and may not resolve at build time for some consumers.\ntype RangeQuery = { offset: number; length: number } | { suffixLength: number };\ninterface GetOptions {\n signal?: AbortSignal;\n}\nexport interface AsyncReadable {\n get(key: string, options?: GetOptions): Promise<Uint8Array | undefined>;\n getRange(\n key: string,\n range: RangeQuery,\n options?: GetOptions,\n ): Promise<Uint8Array | undefined>;\n}\n\nexport type RangeCoalescingFn = (\n store: AsyncReadable,\n opts?: { coalesceSize?: number },\n) => AsyncReadable;\n\nexport interface MakeUrlStoreOptions {\n /** Absolute HTTP URL this store always fetches. */\n url: string;\n /** Pluggable HTTP client; defaults to `globalThis.fetch`. */\n fetchClient?: FetchClient;\n /**\n * Conditional request headers (`If-Match`, `If-Unmodified-Since`) baked\n * into every fetch. Used to carry `validateChecksums` semantics through\n * the coalesced path — all payloads sharing this store are assumed to\n * share the same checksum, so `ReadSession.getVirtualStoreForPayload`\n * partitions stores by checksum to avoid mixing conditional headers.\n *\n * Kept opt-in because these headers trigger CORS preflight requests in\n * browsers, and most storage servers don't whitelist them by default.\n */\n conditionalHeaders?: Record<string, string>;\n}\n\nfunction expectedRangeLength(range: RangeQuery): number {\n return \"suffixLength\" in range ? range.suffixLength : range.length;\n}\n\n/**\n * Build a minimal `AsyncReadable` that services every `getRange` by\n * fetching the configured URL with the requested byte range. The zarr\n * key is ignored — when wrapped by `withRangeCoalescing`, all requests\n * converge on the same path and become eligible for range-merging.\n */\nexport function makeUrlStore(opts: MakeUrlStoreOptions): AsyncReadable {\n const { url, fetchClient, conditionalHeaders } = opts;\n\n async function doFetch(init: RequestInit): Promise<Response> {\n return fetchClient\n ? await fetchClient.fetch(url, init)\n : await fetch(url, init);\n }\n\n return {\n async get() {\n throw new Error(\n `Virtual chunk URL store for ${url} only supports ranged reads`,\n );\n },\n async getRange(_key, range, options) {\n const headers: Record<string, string> = conditionalHeaders\n ? { ...conditionalHeaders }\n : {};\n headers.Range =\n \"suffixLength\" in range\n ? `bytes=-${range.suffixLength}`\n : `bytes=${range.offset}-${range.offset + range.length - 1}`;\n\n const response = await doFetch({ headers, signal: options?.signal });\n\n if (response.status === 412) {\n throw new Error(\n `Virtual chunk at ${url} failed integrity check — data has been modified since snapshot was created`,\n );\n }\n if (response.status !== 200 && response.status !== 206) {\n throw new Error(\n `Failed to fetch virtual chunk from ${url}: ${response.status} ${response.statusText}`,\n );\n }\n\n const data = new Uint8Array(await response.arrayBuffer());\n\n // 206 (Partial Content) is the happy path only when the response body\n // is exactly the requested range. Coalescers slice from this buffer by\n // offset, so accepting an overlong partial response can shift data.\n if (response.status === 206) {\n const expected = expectedRangeLength(range);\n if (data.length === expected) return data;\n throw new Error(\n `Virtual range response size mismatch for ${url}: expected ${expected} bytes, got ${data.length}`,\n );\n }\n\n // 200 means the server ignored the Range header and sent the full\n // object. Slice out the requested window so callers don't have to\n // know the distinction.\n if (\"offset\" in range) {\n const end = range.offset + range.length;\n if (data.length >= end) return data.slice(range.offset, end);\n throw new Error(\n `Virtual range request not honored for ${url}: need at least ${end} bytes for fallback slicing, got ${data.length}`,\n );\n }\n // Suffix-length on a 200 fallback: take the trailing suffixLength bytes.\n if (data.length >= range.suffixLength) {\n return data.slice(data.length - range.suffixLength);\n }\n throw new Error(\n `Virtual suffix range request not honored for ${url}: need at least ${range.suffixLength} bytes for fallback slicing, got ${data.length}`,\n );\n },\n };\n}\n\n/**\n * Build a minimal `AsyncReadable` over icechunk repository storage objects.\n *\n * This lets native chunk payloads use the same zarrita range-coalescing\n * wrapper as virtual chunks. The key remains the repository object path, so\n * zarrita only merges ranges that target the same chunk object.\n */\nexport function makeStorageStore(storage: Storage): AsyncReadable {\n return {\n async get(key, options) {\n const storageOptions = options?.signal\n ? { signal: options.signal }\n : undefined;\n return storage.getObject(key, undefined, storageOptions);\n },\n async getRange(key, range, options) {\n const storageOptions = options?.signal\n ? { signal: options.signal }\n : undefined;\n if (\"suffixLength\" in range) {\n throw new Error(\n `Storage suffix ranges are not supported for ${key}; convert suffixLength to offset/length before reading`,\n );\n }\n\n const storageRange = {\n start: range.offset,\n end: range.offset + range.length,\n };\n const data = await storage.getObject(key, storageRange, storageOptions);\n if (data.length === range.length) return data;\n\n // Range header may be ignored (e.g. HTTP 200 full body). If the full\n // object is available, slice out the requested window explicitly.\n if (data.length >= storageRange.end) {\n return data.slice(storageRange.start, storageRange.end);\n }\n\n throw new Error(\n `Storage returned ${data.length} bytes for ${key} range ${storageRange.start}-${storageRange.end - 1}; expected ${range.length} bytes`,\n );\n },\n };\n}\n","/**\n * ReadSession - Read-only session for accessing icechunk data.\n */\n\nimport type {\n FetchClient,\n Storage,\n RequestOptions,\n} from \"../storage/storage.js\";\nimport { decompress } from \"../vendor/fzstd/index.js\";\nimport { LRUCache } from \"../cache/lru.js\";\nimport { singleFlight, type SingleFlight } from \"../cache/single-flight.js\";\nimport {\n parseHeader,\n validateFileType,\n getDataAfterHeader,\n FileType,\n CompressionAlgorithm,\n SpecVersion,\n} from \"../format/header.js\";\nimport {\n getSnapshotPath,\n getManifestPath,\n getChunkPath,\n getTransactionLogPath,\n} from \"../format/constants.js\";\nimport { encodeObjectId12 } from \"../format/object-id.js\";\nimport {\n parseSnapshot,\n parseManifest,\n parseTransactionLog,\n findChunkRef,\n getChunkPayload,\n deserializeMetadata,\n type Snapshot,\n type Manifest,\n type NodeSnapshot,\n type ChunkPayload,\n type ObjectId12,\n type TransactionLogEntry,\n} from \"../format/flatbuffers/index.js\";\nimport { NotFoundError } from \"../storage/storage.js\";\nimport {\n makeStorageStore,\n makeUrlStore,\n type AsyncReadable,\n type RangeCoalescingFn,\n} from \"./range-coalescer.js\";\n\n/** Default byte-gap threshold for zarrita's range coalescer (matches its own default). */\nconst RANGE_COALESCE_SIZE = 32 * 1024;\n// Per-session cap on wrapped range stores. Eviction only reduces future\n// coalescing reuse for older backing objects; it does not affect read\n// correctness. 256 keeps the cache bounded while covering many active virtual\n// URLs or native objects in typical concurrent reads.\nconst RANGE_STORE_CACHE_SIZE = 256;\ntype RangeStoreKeyPart = string | number | null | readonly RangeStoreKeyPart[];\n\nfunction makeRangeStoreCacheKey(parts: readonly RangeStoreKeyPart[]): string {\n return JSON.stringify(parts);\n}\n\n/** Options for chunk reads from a ReadSession. */\nexport interface ReadOptions extends RequestOptions {\n /**\n * Zarrita-backed range coalescing function for chunk payload reads.\n *\n * Pass `zarrita.withRangeCoalescing` to opt in. Concurrent range reads\n * against the same backing object may be merged into one larger request,\n * matching zarrita's abort behavior for merged signals.\n */\n withRangeCoalescing?: RangeCoalescingFn;\n}\n\n/**\n * ReadSession provides read access to a specific snapshot.\n *\n * Use this class to:\n * - Get nodes (arrays/groups) by path\n * - Read chunk data\n * - Access Zarr metadata\n */\nexport class ReadSession {\n private storage: Storage;\n private snapshot: Snapshot;\n private specVersion: SpecVersion;\n private manifestCache: LRUCache<string, Manifest>;\n /**\n * Single-flight loader over `manifestCache`: concurrent misses for the\n * same manifest share one fetch instead of racing N identical GETs.\n * Critical for fan-out reads that all need the same manifest (e.g. the\n * many parallel chunk reads issued when a renderer crosses into a new\n * pyramid level).\n */\n private manifestLoader: SingleFlight<string, Manifest>;\n /**\n * Bounded cache of `AsyncReadable`s wrapped with zarrita's range coalescer.\n * The cache key includes request-option identities that must not share one\n * coalescing queue, notably virtual fetch clients and checksum headers.\n *\n * Promise slots are inserted synchronously on first use, so\n * concurrent requests for the same partition share one coalescing window\n * instead of racing to create parallel stores.\n */\n private rangeStores?: LRUCache<string, Promise<AsyncReadable>>;\n private nativeStore?: AsyncReadable;\n private fetchClientIds?: WeakMap<FetchClient, number>;\n private nextFetchClientId = 1;\n private rangeCoalescerIds?: WeakMap<RangeCoalescingFn, number>;\n private nextRangeCoalescerId = 1;\n /** VCC name → url_prefix map for resolving `vcc://` chunk locations. */\n private virtualChunkContainers: Map<string, string>;\n\n private constructor(\n storage: Storage,\n snapshot: Snapshot,\n specVersion: SpecVersion,\n maxManifestCacheSize: number = 100,\n virtualChunkContainers?: Map<string, string>,\n ) {\n this.storage = storage;\n this.snapshot = snapshot;\n this.specVersion = specVersion;\n this.manifestCache = new LRUCache(maxManifestCacheSize);\n this.manifestLoader = singleFlight(this.manifestCache);\n this.virtualChunkContainers = virtualChunkContainers ?? new Map();\n }\n\n private getFetchClientKey(fetchClient: FetchClient | undefined): string {\n if (!fetchClient) return \"default\";\n if (!this.fetchClientIds) this.fetchClientIds = new WeakMap();\n\n let id = this.fetchClientIds.get(fetchClient);\n if (id === undefined) {\n id = this.nextFetchClientId;\n this.nextFetchClientId = id + 1;\n this.fetchClientIds.set(fetchClient, id);\n }\n return String(id);\n }\n\n private getRangeCoalescerKey(withRangeCoalescing: RangeCoalescingFn): string {\n if (!this.rangeCoalescerIds) this.rangeCoalescerIds = new WeakMap();\n\n let id = this.rangeCoalescerIds.get(withRangeCoalescing);\n if (id === undefined) {\n id = this.nextRangeCoalescerId;\n this.nextRangeCoalescerId = id + 1;\n this.rangeCoalescerIds.set(withRangeCoalescing, id);\n }\n return String(id);\n }\n\n private getRangeStore(\n partitionKey: readonly RangeStoreKeyPart[],\n createStore: () => AsyncReadable,\n withRangeCoalescing: RangeCoalescingFn,\n ): Promise<AsyncReadable> {\n if (!this.rangeStores) {\n this.rangeStores = new LRUCache(RANGE_STORE_CACHE_SIZE);\n }\n const stores = this.rangeStores;\n const cacheKey = makeRangeStoreCacheKey([\n ...partitionKey,\n [\"coalescer\", this.getRangeCoalescerKey(withRangeCoalescing)],\n ]);\n\n const cached = stores.get(cacheKey);\n if (cached) return cached;\n\n const raw = createStore();\n const promise: Promise<AsyncReadable> = Promise.resolve()\n .then(() =>\n withRangeCoalescing(raw, { coalesceSize: RANGE_COALESCE_SIZE }),\n )\n .catch((error: unknown) => {\n if (stores.get(cacheKey) === promise) stores.delete(cacheKey);\n throw error;\n });\n stores.set(cacheKey, promise);\n return promise;\n }\n\n private getNativeStore(options?: ReadOptions): Promise<AsyncReadable> {\n if (!this.nativeStore) {\n this.nativeStore = makeStorageStore(this.storage);\n }\n const raw = this.nativeStore;\n const withRangeCoalescing = options?.withRangeCoalescing;\n if (!withRangeCoalescing) {\n return Promise.resolve(raw);\n }\n return this.getRangeStore([\"native\"], () => raw, withRangeCoalescing);\n }\n\n private getVirtualStoreForPayload(\n httpUrl: string,\n payload: {\n checksumEtag: string | null;\n checksumLastModified: number;\n },\n options: ReadOptions | undefined,\n ): Promise<AsyncReadable> {\n const validate = !!options?.validateChecksums;\n let conditionalHeaders: Record<string, string> | undefined;\n if (validate) {\n conditionalHeaders = {};\n if (payload.checksumEtag) {\n conditionalHeaders[\"If-Match\"] = payload.checksumEtag;\n }\n if (payload.checksumLastModified > 0) {\n conditionalHeaders[\"If-Unmodified-Since\"] = new Date(\n payload.checksumLastModified * 1000,\n ).toUTCString();\n }\n }\n\n const checksumKey = validate\n ? [\"checked\", payload.checksumEtag ?? \"\", payload.checksumLastModified]\n : [\"unchecked\"];\n\n const createStore = () =>\n makeUrlStore({\n url: httpUrl,\n fetchClient: options?.fetchClient,\n conditionalHeaders,\n });\n\n const withRangeCoalescing = options?.withRangeCoalescing;\n if (!withRangeCoalescing) {\n return Promise.resolve(createStore());\n }\n\n return this.getRangeStore(\n [\n \"virtual\",\n httpUrl,\n [\"fetch\", this.getFetchClientKey(options?.fetchClient)],\n checksumKey,\n ],\n createStore,\n withRangeCoalescing,\n );\n }\n\n /**\n * Open a read session for a specific snapshot.\n *\n * @param storage - Storage backend\n * @param snapshotId - Snapshot ID (12 bytes)\n * @param options - Optional request options (signal for cancellation)\n * @returns ReadSession instance\n */\n static async open(\n storage: Storage,\n snapshotId: Uint8Array,\n options?: RequestOptions & {\n maxManifestCacheSize?: number;\n virtualChunkContainers?: Map<string, string>;\n },\n ): Promise<ReadSession> {\n const { snapshot, specVersion } = await ReadSession.loadSnapshot(\n storage,\n snapshotId,\n options,\n );\n return new ReadSession(\n storage,\n snapshot,\n specVersion,\n options?.maxManifestCacheSize,\n options?.virtualChunkContainers,\n );\n }\n\n /** Load and parse a snapshot from storage */\n private static async loadSnapshot(\n storage: Storage,\n snapshotId: Uint8Array,\n options?: RequestOptions,\n ): Promise<{ snapshot: Snapshot; specVersion: SpecVersion }> {\n const path = getSnapshotPath(encodeObjectId12(snapshotId));\n const data = await storage.getObject(path, undefined, options);\n\n // Parse header\n const header = parseHeader(data);\n validateFileType(header, FileType.Snapshot);\n\n // Decompress if needed\n let flatbufferData = getDataAfterHeader(data);\n if (header.compression === CompressionAlgorithm.Zstd) {\n flatbufferData = decompress(flatbufferData);\n }\n\n // Parse FlatBuffer\n return {\n snapshot: parseSnapshot(flatbufferData),\n specVersion: header.specVersion,\n };\n }\n\n /**\n * Load and parse a manifest from storage.\n *\n * Concurrent calls for the same manifest are coalesced through\n * `manifestLoader` so a fan-out of chunk reads — the typical case\n * when many tiles cross into a new pyramid level at once — issues one\n * HTTP GET instead of one per caller. A caller's `signal` rejects only\n * that caller's await; the shared fetch is aborted only once every\n * active waiter has aborted.\n */\n private loadManifest(\n manifestId: ObjectId12,\n options?: RequestOptions,\n ): Promise<Manifest> {\n const idStr = encodeObjectId12(manifestId);\n return this.manifestLoader.load(\n idStr,\n (signal) => this.fetchManifest(idStr, signal),\n options?.signal,\n );\n }\n\n /**\n * Fetch and parse a single manifest. The `signal` here is the\n * single-flight loader's own signal — it fires only when every waiter\n * has aborted, so a hung manifest fetch doesn't trap later callers\n * behind it.\n */\n private async fetchManifest(\n idStr: string,\n signal: AbortSignal,\n ): Promise<Manifest> {\n const path = getManifestPath(idStr);\n const data = await this.storage.getObject(path, undefined, { signal });\n\n const header = parseHeader(data);\n validateFileType(header, FileType.Manifest);\n\n let flatbufferData = getDataAfterHeader(data);\n if (header.compression === CompressionAlgorithm.Zstd) {\n flatbufferData = decompress(flatbufferData);\n }\n\n return parseManifest(flatbufferData);\n }\n\n /**\n * Get the snapshot ID.\n */\n getSnapshotId(): ObjectId12 {\n return this.snapshot.id;\n }\n\n /**\n * Get the spec version of the snapshot.\n */\n getSpecVersion(): SpecVersion {\n return this.specVersion;\n }\n\n /**\n * Get the parent snapshot ID, or null for root snapshots.\n */\n getParentSnapshotId(): ObjectId12 | null {\n return this.snapshot.parentId;\n }\n\n /**\n * Get the commit message for this snapshot.\n */\n getMessage(): string {\n return this.snapshot.message;\n }\n\n /**\n * Get the timestamp when this snapshot was created.\n */\n getFlushedAt(): Date {\n // flushedAt is microseconds since epoch\n return new Date(Number(this.snapshot.flushedAt / 1000n));\n }\n\n /**\n * Get deserialized snapshot metadata.\n *\n * Decodes MessagePack (v1) or FlexBuffers (v2) metadata items\n * into a plain key-value object.\n */\n getSnapshotMetadata(): Record<string, unknown> {\n return deserializeMetadata(this.snapshot.metadata, this.specVersion);\n }\n\n /**\n * Load and parse the transaction log for this snapshot.\n *\n * Returns null if no transaction log exists (e.g., root snapshot).\n *\n * @param options - Optional request options (signal for cancellation)\n * @returns Parsed transaction log entry or null\n */\n async loadTransactionLog(\n options?: RequestOptions,\n ): Promise<TransactionLogEntry | null> {\n const path = getTransactionLogPath(encodeObjectId12(this.snapshot.id));\n\n let data: Uint8Array;\n try {\n data = await this.storage.getObject(path, undefined, options);\n } catch (error) {\n if (error instanceof NotFoundError) return null;\n throw error;\n }\n\n const header = parseHeader(data);\n validateFileType(header, FileType.TransactionLog);\n\n let flatbufferData = getDataAfterHeader(data);\n if (header.compression === CompressionAlgorithm.Zstd) {\n flatbufferData = decompress(flatbufferData);\n }\n\n return parseTransactionLog(flatbufferData);\n }\n\n /**\n * Get a node by path.\n *\n * @param path - Absolute path (e.g., \"/array\" or \"/group/nested\")\n * @returns NodeSnapshot or null if not found\n */\n getNode(path: string): NodeSnapshot | null {\n // Normalize path\n const normalizedPath = path.startsWith(\"/\") ? path : `/${path}`;\n\n // Binary search since nodes are sorted by path\n return this.binarySearchNode(normalizedPath);\n }\n\n /**\n * List all nodes in the snapshot.\n *\n * @returns Array of all nodes\n */\n listNodes(): NodeSnapshot[] {\n return [...this.snapshot.nodes];\n }\n\n /**\n * List children of a group.\n *\n * @param parentPath - Path to the parent group (use \"/\" for root)\n * @returns Array of child nodes\n */\n listChildren(parentPath: string): NodeSnapshot[] {\n const normalizedParent = parentPath === \"/\" ? \"\" : parentPath;\n const prefix = normalizedParent + \"/\";\n\n return this.snapshot.nodes.filter((node) => {\n if (!node.path.startsWith(prefix)) return false;\n // Check it's a direct child (no more slashes after prefix)\n const rest = node.path.slice(prefix.length);\n return !rest.includes(\"/\");\n });\n }\n\n /**\n * Get the Zarr metadata for a node.\n *\n * @param path - Path to the node\n * @returns Parsed JSON metadata or null if node not found\n */\n getMetadata(path: string): unknown | null {\n const node = this.getNode(path);\n if (!node) return null;\n\n const json = new TextDecoder().decode(node.userData);\n return JSON.parse(json);\n }\n\n /**\n * Get raw user data (Zarr metadata bytes) for a node.\n *\n * @param path - Path to the node\n * @returns Raw metadata bytes or null if node not found\n */\n getRawMetadata(path: string): Uint8Array | null {\n const node = this.getNode(path);\n if (!node) return null;\n return node.userData;\n }\n\n /**\n * Read chunk data for an array.\n *\n * @param path - Path to the array\n * @param coords - Chunk coordinates (N-dimensional)\n * @param options - Optional request options (signal for cancellation)\n * @returns Chunk data bytes or null if not found\n */\n async getChunk(\n path: string,\n coords: number[],\n options?: ReadOptions,\n ): Promise<Uint8Array | null> {\n options?.signal?.throwIfAborted();\n const requestOptions = toRequestOptions(options);\n\n const node = this.getNode(path);\n if (!node || node.nodeData.type !== \"array\") {\n return null;\n }\n\n // Find the manifest that contains this chunk\n const arrayData = node.nodeData;\n\n for (const manifestRef of arrayData.manifests) {\n // Check if this manifest covers the requested coordinates\n if (!this.coordsInExtents(coords, manifestRef.extents)) {\n continue;\n }\n\n // Load the manifest with signal\n const manifest = await this.loadManifest(\n manifestRef.objectId,\n requestOptions,\n );\n\n // Find the chunk reference\n const chunkRef = findChunkRef(manifest, node.id, coords);\n if (!chunkRef) continue;\n\n // Fetch the chunk data based on payload type with signal\n const payload = getChunkPayload(chunkRef);\n return this.fetchChunkPayload(payload, options);\n }\n\n return null;\n }\n\n /**\n * Read a byte range of chunk data for an array.\n *\n * Like getChunk, but fetches only the requested byte range from storage\n * instead of the full chunk. Used by IcechunkStore.getRange to support\n * zarrita's sharded array reads efficiently.\n *\n * @param path - Path to the array\n * @param coords - Chunk coordinates (N-dimensional)\n * @param range - Byte range within the chunk data\n * @param options - Optional request options (signal for cancellation)\n * @returns Chunk data bytes or null if not found\n */\n async getChunkRange(\n path: string,\n coords: number[],\n range: { offset: number; length: number } | { suffixLength: number },\n options?: ReadOptions,\n ): Promise<Uint8Array | null> {\n options?.signal?.throwIfAborted();\n const requestOptions = toRequestOptions(options);\n\n const node = this.getNode(path);\n if (!node || node.nodeData.type !== \"array\") {\n return null;\n }\n\n const arrayData = node.nodeData;\n\n for (const manifestRef of arrayData.manifests) {\n if (!this.coordsInExtents(coords, manifestRef.extents)) {\n continue;\n }\n\n const manifest = await this.loadManifest(\n manifestRef.objectId,\n requestOptions,\n );\n const chunkRef = findChunkRef(manifest, node.id, coords);\n if (!chunkRef) continue;\n\n const payload = getChunkPayload(chunkRef);\n return this.fetchChunkPayloadRange(payload, range, options);\n }\n\n return null;\n }\n\n /** Check if coordinates fall within extent ranges */\n private coordsInExtents(\n coords: number[],\n extents: Array<{ from: number; to: number }>,\n ): boolean {\n if (coords.length !== extents.length) return false;\n\n for (let i = 0; i < coords.length; i++) {\n const { from, to } = extents[i];\n if (coords[i] < from || coords[i] >= to) {\n return false;\n }\n }\n\n return true;\n }\n\n /** Fetch chunk data based on payload type */\n private async fetchChunkPayload(\n payload: ChunkPayload,\n options?: ReadOptions,\n ): Promise<Uint8Array> {\n switch (payload.type) {\n case \"inline\":\n return payload.data;\n\n case \"native\": {\n const path = getChunkPath(encodeObjectId12(payload.chunkId));\n const requestedStart = payload.offset;\n const requestedEnd = payload.offset + payload.length;\n const store = await this.getNativeStore(options);\n const data = await store.getRange(\n path,\n { offset: requestedStart, length: payload.length },\n { signal: options?.signal },\n );\n if (!data) {\n throw new Error(\n `Failed to fetch native chunk from ${path} range ${requestedStart}-${requestedEnd - 1}: empty response`,\n );\n }\n if (data.length === payload.length) return data;\n\n throw new Error(\n `Storage returned ${data.length} bytes for ${path} range ${requestedStart}-${requestedEnd - 1}; expected ${payload.length} bytes`,\n );\n }\n\n case \"virtual\": {\n // Virtual chunks reference external URLs\n // Expand any vcc://name/path → absolute URL, then translate s3:// etc. → HTTPS\n const absoluteLocation = expandVccUrl(\n payload.location,\n this.virtualChunkContainers,\n );\n const httpUrl = translateToHttpUrl(\n absoluteLocation,\n options?.azureAccount,\n );\n\n const store = await this.getVirtualStoreForPayload(\n httpUrl,\n payload,\n options,\n );\n const data = await store.getRange(\n \"/\",\n { offset: payload.offset, length: payload.length },\n { signal: options?.signal },\n );\n if (!data) {\n throw new Error(\n `Failed to fetch virtual chunk from ${httpUrl}: empty response`,\n );\n }\n if (data.length !== payload.length) {\n throw new Error(\n `Virtual range response size mismatch for ${httpUrl}: expected ${payload.length} bytes, got ${data.length}`,\n );\n }\n return data;\n }\n }\n }\n\n /** Fetch a byte range of chunk data based on payload type */\n private async fetchChunkPayloadRange(\n payload: ChunkPayload,\n range: { offset: number; length: number } | { suffixLength: number },\n options?: ReadOptions,\n ): Promise<Uint8Array> {\n // Compute absolute start/end within the chunk's data\n let rangeStart: number;\n let rangeEnd: number;\n\n if (\"suffixLength\" in range) {\n rangeStart =\n payload.type === \"inline\"\n ? payload.data.length - range.suffixLength\n : payload.length - range.suffixLength;\n rangeEnd =\n payload.type === \"inline\" ? payload.data.length : payload.length;\n } else {\n rangeStart = range.offset;\n rangeEnd = range.offset + range.length;\n }\n\n switch (payload.type) {\n case \"inline\":\n return payload.data.slice(rangeStart, rangeEnd);\n\n case \"native\": {\n const path = getChunkPath(encodeObjectId12(payload.chunkId));\n const requestedStart = payload.offset + rangeStart;\n const expectedSize = rangeEnd - rangeStart;\n const requestedEnd = requestedStart + expectedSize;\n const store = await this.getNativeStore(options);\n const data = await store.getRange(\n path,\n { offset: requestedStart, length: expectedSize },\n { signal: options?.signal },\n );\n if (!data) {\n throw new Error(\n `Failed to fetch native chunk from ${path} range ${requestedStart}-${requestedEnd - 1}: empty response`,\n );\n }\n if (data.length === expectedSize) return data;\n\n throw new Error(\n `Storage returned ${data.length} bytes for ${path} range ${requestedStart}-${requestedEnd - 1}; expected ${expectedSize} bytes`,\n );\n }\n\n case \"virtual\": {\n const absoluteStart = payload.offset + rangeStart;\n const expectedSize = rangeEnd - rangeStart;\n\n const absoluteLocation = expandVccUrl(\n payload.location,\n this.virtualChunkContainers,\n );\n const httpUrl = translateToHttpUrl(\n absoluteLocation,\n options?.azureAccount,\n );\n\n const store = await this.getVirtualStoreForPayload(\n httpUrl,\n payload,\n options,\n );\n const data = await store.getRange(\n \"/\",\n { offset: absoluteStart, length: expectedSize },\n { signal: options?.signal },\n );\n if (!data) {\n throw new Error(\n `Failed to fetch virtual chunk from ${httpUrl}: empty response`,\n );\n }\n if (data.length !== expectedSize) {\n throw new Error(\n `Virtual range response size mismatch for ${httpUrl}: expected ${expectedSize} bytes, got ${data.length}`,\n );\n }\n return data;\n }\n }\n }\n\n /** Binary search for a node by path */\n private binarySearchNode(path: string): NodeSnapshot | null {\n const nodes = this.snapshot.nodes;\n let low = 0;\n let high = nodes.length - 1;\n\n while (low <= high) {\n const mid = Math.floor((low + high) / 2);\n const cmp = compareUtf8Bytes(nodes[mid].path, path);\n\n if (cmp === 0) {\n return nodes[mid];\n } else if (cmp < 0) {\n low = mid + 1;\n } else {\n high = mid - 1;\n }\n }\n\n return null;\n }\n}\n\n/** UTF-8 encoder for byte comparisons */\nconst utf8Encoder = new TextEncoder();\n\nfunction toRequestOptions(options?: ReadOptions): RequestOptions | undefined {\n if (!options) return undefined;\n return {\n ...(options.signal && { signal: options.signal }),\n ...(options.fetchClient && { fetchClient: options.fetchClient }),\n ...(options.validateChecksums !== undefined && {\n validateChecksums: options.validateChecksums,\n }),\n ...(options.azureAccount !== undefined && {\n azureAccount: options.azureAccount,\n }),\n };\n}\n\n/**\n * Compare two strings by UTF-8 byte order to match Rust's str::cmp.\n *\n * JavaScript's native string comparison uses UTF-16 code units, which differs\n * from UTF-8 byte order for characters outside the Basic Multilingual Plane\n * (code points > 0xFFFF, like emoji).\n */\nfunction compareUtf8Bytes(a: string, b: string): number {\n const bytesA = utf8Encoder.encode(a);\n const bytesB = utf8Encoder.encode(b);\n\n const minLen = Math.min(bytesA.length, bytesB.length);\n for (let i = 0; i < minLen; i++) {\n if (bytesA[i] !== bytesB[i]) {\n return bytesA[i] - bytesB[i];\n }\n }\n\n return bytesA.length - bytesB.length;\n}\n\n/** URL scheme for relative Virtual Chunk Container references. */\nconst VCC_SCHEME = \"vcc://\";\n\n/**\n * Expand a `vcc://name/relative/path` chunk location to an absolute URL using\n * the repo's Virtual Chunk Container map. Pass-through for any location that\n * doesn't start with `vcc://`.\n *\n * When the map is empty (e.g. a `ReadSession` constructed without a\n * `Repository`), vcc:// locations pass through unchanged so a caller's\n * `fetchClient` can still handle them. When the map is non-empty but the\n * referenced name is missing, we throw — that signals a real config /\n * manifest mismatch the caller should surface.\n *\n * Persisted repo configs may contain legacy/migrated prefixes without a\n * trailing slash. Normalize those before joining so `vcc://name/path`\n * resolves under the configured container root instead of being appended to\n * the last prefix segment.\n *\n * @throws Error when the URL is malformed or the name is unknown despite a\n * populated container map.\n */\nexport function expandVccUrl(\n location: string,\n containers: Map<string, string>,\n): string {\n if (!location.startsWith(VCC_SCHEME)) return location;\n\n const rest = location.slice(VCC_SCHEME.length);\n const slash = rest.indexOf(\"/\");\n if (slash === -1) {\n throw new Error(\n `Invalid vcc:// URL \"${location}\": missing \"/\" after container name`,\n );\n }\n\n const name = rest.slice(0, slash);\n const relativePath = rest.slice(slash + 1);\n const urlPrefix = containers.get(name);\n if (urlPrefix === undefined) {\n if (containers.size === 0) return location;\n throw new Error(\n `Unknown virtual chunk container \"${name}\" referenced by ${location}`,\n );\n }\n\n const normalizedPrefix = urlPrefix.endsWith(\"/\")\n ? urlPrefix\n : `${urlPrefix}/`;\n return normalizedPrefix + relativePath;\n}\n\n/**\n * Translate cloud storage URLs to HTTP(S) endpoints for public buckets.\n *\n * Supports:\n * - s3://bucket/key → https://bucket.s3.amazonaws.com/key (or path-style for dotted buckets)\n * - gs://bucket/key or gcs://bucket/key → https://storage.googleapis.com/bucket/key\n * - az://container/path or azure://container/path → https://{azureAccount}.blob.core.windows.net/container/path\n * - abfs://container@account.dfs.core.windows.net/path → https://account.blob.core.windows.net/container/path\n * - http(s):// URLs pass through unchanged\n *\n * Azure az:// and azure:// URLs follow the Rust convention where the host is\n * the container name (not the account). The account must be supplied separately\n * via the azureAccount parameter.\n *\n * Note: S3 URLs use virtual-hosted style for simple bucket names, but fall back to\n * path-style for buckets containing dots (which break SSL certificate validation).\n * For buckets in specific regions, S3 will redirect to the correct endpoint.\n */\nfunction translateToHttpUrl(url: string, azureAccount?: string): string {\n // S3: s3://bucket/key → https://bucket.s3.amazonaws.com/key\n // For buckets with dots, use path-style: https://s3.amazonaws.com/bucket/key\n if (url.startsWith(\"s3://\")) {\n const rest = url.slice(5); // Remove 's3://'\n const slashIndex = rest.indexOf(\"/\");\n if (slashIndex === -1) {\n // Just bucket, no key\n const bucket = rest;\n if (bucket.includes(\".\")) {\n return `https://s3.amazonaws.com/${bucket}/`;\n }\n return `https://${bucket}.s3.amazonaws.com/`;\n }\n const bucket = rest.slice(0, slashIndex);\n const key = rest.slice(slashIndex + 1);\n // Use path-style for buckets with dots (virtual-hosted fails SSL validation)\n if (bucket.includes(\".\")) {\n return `https://s3.amazonaws.com/${bucket}/${key}`;\n }\n return `https://${bucket}.s3.amazonaws.com/${key}`;\n }\n\n // GCS: gs://bucket/key or gcs://bucket/key → https://storage.googleapis.com/bucket/key\n if (url.startsWith(\"gs://\") || url.startsWith(\"gcs://\")) {\n const prefixLen = url.startsWith(\"gs://\") ? 5 : 6;\n const rest = url.slice(prefixLen);\n return `https://storage.googleapis.com/${rest}`;\n }\n\n // Azure: az://container/path or azure://container/path\n // → https://{azureAccount}.blob.core.windows.net/container/path\n // Matches Rust convention: container is in the host position, account from config.\n if (url.startsWith(\"az://\") || url.startsWith(\"azure://\")) {\n if (!azureAccount) {\n throw new Error(\n `Cannot translate Azure URL \"${url}\": azureAccount option is required. ` +\n `az:// and azure:// URLs encode only the container name; ` +\n `pass azureAccount in store options to supply the storage account.`,\n );\n }\n const prefixLen = url.startsWith(\"az://\") ? 5 : 8;\n const rest = url.slice(prefixLen);\n const firstSlash = rest.indexOf(\"/\");\n if (firstSlash === -1) {\n // Just container, no path\n return `https://${azureAccount}.blob.core.windows.net/${rest}`;\n }\n const container = rest.slice(0, firstSlash);\n const path = rest.slice(firstSlash + 1);\n return `https://${azureAccount}.blob.core.windows.net/${container}/${path}`;\n }\n\n // ABFS: abfs://container@account.dfs.core.windows.net/path\n // → https://account.blob.core.windows.net/container/path\n if (url.startsWith(\"abfs://\")) {\n const rest = url.slice(7); // Remove 'abfs://'\n const atIndex = rest.indexOf(\"@\");\n if (atIndex !== -1) {\n const container = rest.slice(0, atIndex);\n const hostAndPath = rest.slice(atIndex + 1);\n // Extract account from account.dfs.core.windows.net/path\n const firstSlash = hostAndPath.indexOf(\"/\");\n const host =\n firstSlash === -1 ? hostAndPath : hostAndPath.slice(0, firstSlash);\n const path = firstSlash === -1 ? \"\" : hostAndPath.slice(firstSlash + 1);\n // Extract account name from host (account.dfs.core.windows.net)\n const dotIndex = host.indexOf(\".\");\n const account = dotIndex === -1 ? host : host.slice(0, dotIndex);\n const suffix = path ? `${container}/${path}` : container;\n return `https://${account}.blob.core.windows.net/${suffix}`;\n }\n }\n\n // Already HTTP(S) or unsupported scheme - pass through\n return url;\n}\n","/**\n * Repository - Entry point for reading icechunk repositories.\n */\n\nimport type { Storage, RequestOptions } from \"../storage/storage.js\";\nimport { NotFoundError, isAbortError } from \"../storage/storage.js\";\nimport {\n getBranchRefDirPath,\n getBranchRefPath,\n getTagRefDirPath,\n getTagRefPath,\n PATHS,\n REPO_INFO_PATH,\n} from \"../format/constants.js\";\nimport { decodeObjectId12, encodeObjectId12 } from \"../format/object-id.js\";\nimport {\n parseRepo,\n resolveBranch,\n resolveTag,\n listBranchesFromRepo,\n listTagsFromRepo,\n type ParsedRepo,\n} from \"../format/flatbuffers/repo-parser.js\";\nimport { ReadSession } from \"./session.js\";\n\n/** Reference data stored in ref.json files */\nexport interface RefData {\n /** Base32-encoded snapshot ID */\n snapshot: string;\n}\n\n/** Options for opening a repository */\nexport interface RepositoryOptions {\n /** Storage backend to use */\n storage: Storage;\n /** Format version hint to skip auto-detection. 'v1' skips /repo request. */\n formatVersion?: \"v1\" | \"v2\";\n}\n\n/**\n * Repository provides access to an icechunk repository.\n *\n * Use this class to:\n * - List branches and tags\n * - Checkout a specific version to get a ReadSession\n */\nexport class Repository {\n private storage: Storage;\n private repoInfo: ParsedRepo | null = null;\n private repoInfoAttempted = false;\n\n private constructor(storage: Storage) {\n this.storage = storage;\n }\n\n /**\n * Load and cache the v2 repo info file.\n *\n * Uses getObject() directly to avoid race conditions with exists().\n * - NotFoundError => v1 format (no repo file)\n * - Any other error => hard error (parse failure, etc.)\n *\n * @param options - Optional request options (signal for cancellation)\n * @returns ParsedRepo if v2 format, null if v1 format\n * @throws Error if repo file exists but fails to parse\n * @throws An error named \"AbortError\" if the operation was aborted\n */\n private async loadRepoInfo(\n options?: RequestOptions,\n ): Promise<ParsedRepo | null> {\n if (this.repoInfoAttempted) {\n return this.repoInfo;\n }\n this.repoInfoAttempted = true;\n\n try {\n const data = await this.storage.getObject(\n REPO_INFO_PATH,\n undefined,\n options,\n );\n this.repoInfo = parseRepo(data);\n return this.repoInfo;\n } catch (error) {\n // Propagate abort errors\n if (isAbortError(error)) {\n this.repoInfoAttempted = false; // Allow retry\n throw error;\n }\n // NotFoundError means v1 format (no repo file)\n if (error instanceof NotFoundError) {\n return null;\n }\n // Any other error is fatal\n throw new Error(\n `Failed to parse v2 repo file: ${error instanceof Error ? error.message : error}`,\n );\n }\n }\n\n /**\n * Open an icechunk repository.\n *\n * - Try to load and parse repo info file (v2+ format)\n * - If NotFoundError, check for main branch (v1 format)\n * - Parse failures are hard errors (matching Rust behavior)\n *\n * @param options - Repository options including storage backend\n * @param requestOptions - Optional request options (signal for cancellation)\n * @returns A Repository instance\n */\n static async open(\n options: RepositoryOptions,\n requestOptions?: RequestOptions,\n ): Promise<Repository> {\n const repo = new Repository(options.storage);\n\n if (options.formatVersion === \"v1\") {\n // User asserts v1 format - skip all validation, defer errors to checkout\n repo.repoInfoAttempted = true;\n return repo;\n }\n\n // Try v2 format first - load and parse to fail fast on corruption\n const repoInfo = await repo.loadRepoInfo(requestOptions);\n if (repoInfo) {\n return repo; // v2 format - repo file exists and parsed successfully\n }\n if (options.formatVersion === \"v2\") {\n throw new Error(\"Repository info not found but v2 format was specified\");\n }\n\n // Auto-detect: check for main branch (v1 format)\n const mainBranchDir = getBranchRefDirPath(\"main\");\n const mainExists = await repo.hasAnyRefFile(\n mainBranchDir,\n getBranchRefPath(\"main\"),\n requestOptions,\n );\n if (mainExists) {\n return repo;\n }\n\n throw new Error(\n \"Not a valid icechunk repository: neither repo info file nor main branch found\",\n );\n }\n\n /**\n * Check if any ref file exists in a directory.\n * Ref files are .json files that are not .deleted files.\n *\n * @param dirPrefix - Directory prefix to check\n * @param legacyPath - Optional legacy ref.json path to check if listing fails\n * @param options - Optional request options (signal for cancellation)\n */\n private async hasAnyRefFile(\n dirPrefix: string,\n legacyPath?: string,\n options?: RequestOptions,\n ): Promise<boolean> {\n try {\n for await (const path of this.storage.listPrefix(dirPrefix)) {\n if (path.endsWith(\".json\") && !path.endsWith(\".deleted\")) {\n return true;\n }\n }\n } catch (error) {\n // Propagate abort errors\n if (isAbortError(error)) {\n throw error;\n }\n // Listing not supported - try legacy path only\n if (legacyPath) {\n return await this.storage.exists(legacyPath, options);\n }\n }\n return false;\n }\n\n /**\n * Find the latest non-deleted ref file in a directory.\n * When storage supports listPrefix(), refs may use versioned filenames\n * (e.g., AAAAAAAA.json) for optimistic concurrency control. The latest\n * version has the highest filename. Deletion tombstones are checked.\n *\n * When listing is not supported (e.g., HTTP storage), only the legacy\n * ref.json path is returned (caller must handle NotFoundError on read).\n *\n * @param dirPrefix - Directory prefix to search\n * @param legacyPath - Optional legacy ref.json path to try if listing fails\n */\n private async findLatestRefFile(\n dirPrefix: string,\n legacyPath?: string,\n ): Promise<string | null> {\n const jsonFiles: string[] = [];\n const deletedFiles = new Set<string>();\n\n try {\n for await (const path of this.storage.listPrefix(dirPrefix)) {\n if (path.endsWith(\".deleted\")) {\n // Track deletion tombstones (e.g., \"ABC.json.deleted\" -> \"ABC.json\")\n deletedFiles.add(path.slice(0, -\".deleted\".length));\n } else if (path.endsWith(\".json\")) {\n jsonFiles.push(path);\n }\n }\n } catch (error) {\n // Propagate abort errors\n if (isAbortError(error)) {\n throw error;\n }\n // Listing not supported - return legacy path without checking exists.\n // Caller will handle NotFoundError when reading.\n return legacyPath || null;\n }\n\n if (jsonFiles.length === 0) {\n return null;\n }\n\n // Sort lexicographically and find the latest non-deleted version\n jsonFiles.sort();\n\n // Start from the latest and find the first non-deleted file\n for (let i = jsonFiles.length - 1; i >= 0; i--) {\n if (!deletedFiles.has(jsonFiles[i])) {\n return jsonFiles[i];\n }\n }\n\n // All versions are deleted\n return null;\n }\n\n /**\n * List all branches in the repository.\n *\n * Unlike tags, branches in icechunk v1 have no tombstone mechanism —\n * deletion removes the ref file outright. A branch is present iff it has\n * at least one ref file in its directory.\n *\n * @returns Array of branch names\n */\n async listBranches(): Promise<string[]> {\n // Try v2 format first\n const repoInfo = await this.loadRepoInfo();\n if (repoInfo) {\n return listBranchesFromRepo(repoInfo);\n }\n\n // V1 fallback - file-based lookup\n const branches = new Set<string>();\n\n try {\n for await (const path of this.storage.listPrefix(\n `${PATHS.REFS}/branch.`,\n )) {\n // Match ref files like \"refs/branch.main/ref.json\" (ignore tombstones\n // for defensiveness — Rust never writes them for branches).\n const match = path.match(/^refs\\/branch\\.(.+)\\/([^/]+\\.json)$/);\n if (match) {\n branches.add(match[1]);\n }\n }\n } catch (error) {\n if (isAbortError(error)) {\n throw error;\n }\n throw new Error(\"Cannot list branches: storage does not support listing\");\n }\n\n return [...branches];\n }\n\n /**\n * List all tags in the repository.\n *\n * Tags with deletion tombstones on their latest ref file are excluded.\n *\n * @returns Array of tag names\n */\n async listTags(): Promise<string[]> {\n // Try v2 format first\n const repoInfo = await this.loadRepoInfo();\n if (repoInfo) {\n return listTagsFromRepo(repoInfo);\n }\n\n // V1 fallback - file-based lookup\n // Track files per tag: tag name -> { jsonFiles, deletedFiles }\n const tagFiles = new Map<\n string,\n { jsonFiles: string[]; deletedFiles: Set<string> }\n >();\n\n try {\n for await (const path of this.storage.listPrefix(`${PATHS.REFS}/tag.`)) {\n // Extract tag name from paths like:\n // - \"refs/tag.v1.0/ZZZZZZZZ.json\" (versioned)\n // - \"refs/tag.v1.0/ref.json\" (legacy)\n // - \"refs/tag.v1.0/ZZZZZZZZ.json.deleted\" (deletion tombstone)\n const jsonMatch = path.match(/^refs\\/tag\\.(.+)\\/([^/]+\\.json)$/);\n const deletedMatch = path.match(\n /^refs\\/tag\\.(.+)\\/([^/]+\\.json)\\.deleted$/,\n );\n\n if (deletedMatch) {\n const tagName = deletedMatch[1];\n const refFile = `refs/tag.${tagName}/${deletedMatch[2]}`;\n if (!tagFiles.has(tagName)) {\n tagFiles.set(tagName, { jsonFiles: [], deletedFiles: new Set() });\n }\n tagFiles.get(tagName)!.deletedFiles.add(refFile);\n } else if (jsonMatch) {\n const tagName = jsonMatch[1];\n if (!tagFiles.has(tagName)) {\n tagFiles.set(tagName, { jsonFiles: [], deletedFiles: new Set() });\n }\n tagFiles.get(tagName)!.jsonFiles.push(path);\n }\n }\n } catch (error) {\n if (isAbortError(error)) {\n throw error;\n }\n throw new Error(\"Cannot list tags: storage does not support listing\");\n }\n\n // Filter to only include tags where latest ref is not deleted\n const result: string[] = [];\n for (const [tagName, { jsonFiles, deletedFiles }] of tagFiles) {\n if (jsonFiles.length === 0) continue;\n\n // Sort to find latest\n jsonFiles.sort();\n const latestRef = jsonFiles[jsonFiles.length - 1];\n\n // Include only if latest ref is not deleted\n if (!deletedFiles.has(latestRef)) {\n result.push(tagName);\n }\n }\n\n return result;\n }\n\n /**\n * Checkout a branch to get a read session.\n *\n * @param name - Branch name\n * @param options - Optional request options (signal for cancellation)\n * @returns Read session at the branch's current snapshot\n */\n async checkoutBranch(\n name: string,\n options?: RequestOptions,\n ): Promise<ReadSession> {\n // Try v2 format first\n const repoInfo = await this.loadRepoInfo(options);\n if (repoInfo) {\n const snapshotId = resolveBranch(repoInfo, name);\n if (!snapshotId) {\n throw new Error(`Branch not found: ${name}`);\n }\n return ReadSession.open(this.storage, snapshotId, {\n ...options,\n virtualChunkContainers: repoInfo.virtualChunkContainers,\n });\n }\n\n // V1 fallback - file-based lookup\n const refDirPath = getBranchRefDirPath(name);\n const refPath = await this.findLatestRefFile(\n refDirPath,\n getBranchRefPath(name),\n );\n if (!refPath) {\n throw new Error(`Reference not found: ${refDirPath}`);\n }\n const snapshotId = await this.readSnapshotIdFromRef(refPath, options);\n return ReadSession.open(this.storage, snapshotId, options);\n }\n\n /**\n * Checkout a tag to get a read session.\n *\n * @param name - Tag name\n * @param options - Optional request options (signal for cancellation)\n * @returns Read session at the tag's snapshot\n */\n async checkoutTag(\n name: string,\n options?: RequestOptions,\n ): Promise<ReadSession> {\n // Try v2 format first\n const repoInfo = await this.loadRepoInfo(options);\n if (repoInfo) {\n const snapshotId = resolveTag(repoInfo, name);\n if (!snapshotId) {\n throw new Error(`Tag not found: ${name}`);\n }\n return ReadSession.open(this.storage, snapshotId, {\n ...options,\n virtualChunkContainers: repoInfo.virtualChunkContainers,\n });\n }\n\n // V1 fallback - file-based lookup\n const refDirPath = getTagRefDirPath(name);\n const legacyPath = getTagRefPath(name);\n const refPath = await this.findLatestRefFile(refDirPath, legacyPath);\n if (!refPath) {\n throw new Error(`Reference not found: ${refDirPath}`);\n }\n\n // Check for tombstone only in no-list fallback path (list-capable storage\n // already handles tombstones in findLatestRefFile). Matches Rust behavior.\n if (\n refPath === legacyPath &&\n (await this.storage.exists(`${refPath}.deleted`, options))\n ) {\n throw new Error(`Tag not found: ${name}`);\n }\n\n const snapshotId = await this.readSnapshotIdFromRef(refPath, options);\n return ReadSession.open(this.storage, snapshotId, options);\n }\n\n /**\n * Checkout a specific snapshot by ID.\n *\n * @param snapshotId - Snapshot ID (12 bytes or Base32 string)\n * @param options - Optional request options (signal for cancellation)\n * @returns Read session at the specified snapshot\n */\n async checkoutSnapshot(\n snapshotId: Uint8Array | string,\n options?: RequestOptions,\n ): Promise<ReadSession> {\n const id =\n typeof snapshotId === \"string\"\n ? decodeObjectId12(snapshotId)\n : snapshotId;\n // Load repo info opportunistically so v2 sessions get VCC resolution;\n // v1 repos return null here and sessions run with an empty container map.\n const repoInfo = await this.loadRepoInfo(options);\n const virtualChunkContainers = repoInfo?.virtualChunkContainers;\n return ReadSession.open(this.storage, id, {\n ...options,\n ...(virtualChunkContainers && { virtualChunkContainers }),\n });\n }\n\n /**\n * Walk the snapshot history chain starting from the given session.\n *\n * Yields `{ id, message, flushedAt, metadata }` for each snapshot,\n * walking from the current snapshot back to the root.\n *\n * @param session - Read session to start from\n * @param options - Optional request options (signal for cancellation)\n */\n async *walkHistory(\n session: ReadSession,\n options?: RequestOptions,\n ): AsyncGenerator<{\n id: string;\n message: string;\n flushedAt: Date;\n metadata: Record<string, unknown>;\n }> {\n let current: ReadSession | null = session;\n\n while (current) {\n yield {\n id: encodeObjectId12(current.getSnapshotId()),\n message: current.getMessage(),\n flushedAt: current.getFlushedAt(),\n metadata: current.getSnapshotMetadata(),\n };\n\n const parentId = current.getParentSnapshotId();\n if (!parentId) break;\n\n current = await this.checkoutSnapshot(parentId, options);\n }\n }\n\n /**\n * Get the storage backend.\n */\n getStorage(): Storage {\n return this.storage;\n }\n\n /** Read and parse a ref file */\n private async readRef(\n path: string,\n options?: RequestOptions,\n ): Promise<RefData> {\n const data = await this.storage.getObject(path, undefined, options);\n const json = new TextDecoder().decode(data);\n return JSON.parse(json) as RefData;\n }\n\n /** Read snapshot ID from a ref file */\n private async readSnapshotIdFromRef(\n path: string,\n options?: RequestOptions,\n ): Promise<Uint8Array> {\n try {\n const ref = await this.readRef(path, options);\n return decodeObjectId12(ref.snapshot);\n } catch (error) {\n if (error instanceof NotFoundError) {\n throw new Error(`Reference not found: ${path}`);\n }\n throw error;\n }\n }\n}\n","/**\n * HTTP/HTTPS storage backend using the Fetch API.\n *\n * Works in both Node.js 18+ and browsers.\n */\n\nimport type { Storage, ByteRange, RequestOptions } from \"./storage.js\";\nimport { NotFoundError, StorageError, isAbortError } from \"./storage.js\";\n\n/** Options for HTTP storage */\nexport interface HttpStorageOptions {\n /** Additional headers to include in requests */\n headers?: Record<string, string>;\n\n /** Fetch credentials mode */\n credentials?: RequestCredentials;\n\n /** Fetch cache mode */\n cache?: RequestCache;\n}\n\n/**\n * HTTP/HTTPS storage backend.\n *\n * Reads objects from a base URL using HTTP GET requests.\n * Supports byte range requests for partial reads.\n */\nexport class HttpStorage implements Storage {\n private baseUrl: string;\n private options: HttpStorageOptions;\n\n /**\n * Create an HTTP storage backend.\n *\n * @param baseUrl - Base URL for the repository (e.g., \"https://example.com/repo\")\n * @param options - Additional options\n */\n constructor(baseUrl: string, options: HttpStorageOptions = {}) {\n // Normalize URL (remove trailing slash)\n this.baseUrl = baseUrl.replace(/\\/$/, \"\");\n this.options = options;\n }\n\n /** Build full URL for a path */\n private getUrl(path: string): string {\n // Ensure path doesn't start with slash (we add it)\n const normalizedPath = path.startsWith(\"/\") ? path.slice(1) : path;\n return `${this.baseUrl}/${normalizedPath}`;\n }\n\n /** Build headers for a request */\n private getHeaders(range?: ByteRange): HeadersInit {\n const headers: HeadersInit = { ...this.options.headers };\n\n if (range) {\n // HTTP Range header uses inclusive end\n headers[\"Range\"] = `bytes=${range.start}-${range.end - 1}`;\n }\n\n return headers;\n }\n\n async getObject(\n path: string,\n range?: ByteRange,\n options?: RequestOptions,\n ): Promise<Uint8Array> {\n options?.signal?.throwIfAborted();\n\n const url = this.getUrl(path);\n const headers = this.getHeaders(range);\n\n let response: Response;\n try {\n response = await fetch(url, {\n method: \"GET\",\n headers,\n credentials: this.options.credentials,\n cache: this.options.cache,\n signal: options?.signal,\n });\n } catch (error) {\n if (isAbortError(error)) throw error;\n throw new StorageError(\n `Failed to fetch ${url}: ${error instanceof Error ? error.message : String(error)}`,\n error instanceof Error ? error : undefined,\n );\n }\n\n if (response.status === 404) {\n throw new NotFoundError(path);\n }\n\n // 200 for full content, 206 for partial content\n if (response.status !== 200 && response.status !== 206) {\n throw new StorageError(\n `HTTP ${response.status} ${response.statusText} for ${url}`,\n );\n }\n\n const arrayBuffer = await response.arrayBuffer();\n return new Uint8Array(arrayBuffer);\n }\n\n async exists(path: string, options?: RequestOptions): Promise<boolean> {\n options?.signal?.throwIfAborted();\n\n const url = this.getUrl(path);\n\n try {\n const response = await fetch(url, {\n method: \"HEAD\",\n headers: this.options.headers,\n credentials: this.options.credentials,\n signal: options?.signal,\n });\n\n return response.ok;\n } catch (error) {\n if (isAbortError(error)) throw error;\n return false;\n }\n }\n\n async *listPrefix(_prefix: string): AsyncIterable<string> {\n // HTTP storage typically doesn't support listing.\n // This would require server-side support (e.g., S3 XML API).\n throw new StorageError(\n \"Listing not supported for HTTP storage. Use S3Storage for listing.\",\n );\n }\n}\n","/**\n * IcechunkStore - zarrita-compatible store adapter.\n *\n * Implements zarrita's AsyncReadable interface to allow using\n * zarrita for array operations on icechunk repositories.\n */\n\nimport { Repository } from \"./reader/repository.js\";\nimport { ReadSession } from \"./reader/session.js\";\nimport { HttpStorage } from \"./storage/http-storage.js\";\nimport type { Storage, FetchClient } from \"./storage/storage.js\";\nimport { NotFoundError } from \"./storage/storage.js\";\nimport type { NodeSnapshot } from \"./format/flatbuffers/types.js\";\nimport type { RangeCoalescingFn } from \"./reader/range-coalescer.js\";\n\n/**\n * zarrita's AbsolutePath type - paths must start with \"/\"\n */\nexport type AbsolutePath<Rest extends string = string> = `/${Rest}`;\n\n/**\n * zarrita's RangeQuery type for partial reads\n */\nexport type RangeQuery =\n | { offset: number; length: number }\n | { suffixLength: number };\n\n/**\n * zarrita's AsyncReadable interface\n */\nexport interface AsyncReadable<Options = unknown> {\n get(key: AbsolutePath, opts?: Options): Promise<Uint8Array | undefined>;\n getRange?(\n key: AbsolutePath,\n range: RangeQuery,\n opts?: Options,\n ): Promise<Uint8Array | undefined>;\n}\n\n/** Options for IcechunkStore */\nexport interface IcechunkStoreOptions {\n /** Branch name to checkout (default: \"main\") */\n branch?: string;\n\n /** Tag name to checkout (mutually exclusive with branch) */\n tag?: string;\n\n /** Specific snapshot ID to checkout (Base32 string) */\n snapshot?: string;\n\n /** AbortSignal for cancelling initialization */\n signal?: AbortSignal;\n\n /** Format version hint to skip auto-detection. 'v1' skips /repo request. */\n formatVersion?: \"v1\" | \"v2\";\n\n /**\n * Pluggable HTTP client for virtual chunk fetching.\n *\n * Use this to:\n * - Generate pre-signed S3 URLs\n * - Add authentication headers\n * - Route through a proxy\n */\n fetchClient?: FetchClient;\n\n /** Maximum number of manifests to cache in the LRU cache (default: 100) */\n maxManifestCacheSize?: number;\n\n /**\n * Zarrita-backed range coalescing function for chunk payload reads.\n *\n * Pass `zarrita.withRangeCoalescing` to opt in. Concurrent range reads\n * against the same backing object may be merged into one larger request.\n */\n withRangeCoalescing?: RangeCoalescingFn;\n\n /**\n * Send If-Match / If-Unmodified-Since headers on virtual chunk requests.\n *\n * Defaults to false because these headers trigger CORS preflight in browsers.\n */\n validateChecksums?: boolean;\n\n /**\n * Azure storage account name for translating az:// and azure:// URLs.\n *\n * Required when virtual chunks reference az:// or azure:// URLs.\n * Not needed for abfs:// URLs which embed the account in the host.\n */\n azureAccount?: string;\n}\n\n/**\n * IcechunkStore - zarrita-compatible store for icechunk repositories.\n *\n * This store implements zarrita's AsyncReadable interface, allowing you\n * to use zarrita's array operations on icechunk data.\n *\n * @example\n * ```typescript\n * import { IcechunkStore } from 'icechunk-js';\n * import { open, get } from 'zarrita';\n *\n * const store = await IcechunkStore.open('https://bucket.s3.amazonaws.com/repo');\n * const array = await open(store.resolve('/temperature'), { kind: 'array' });\n * const data = await get(array, [0, 0, null]);\n * ```\n */\nexport class IcechunkStore implements AsyncReadable {\n /** The underlying read session. Exposed for advanced usage. */\n readonly session: ReadSession;\n private fetchClient?: FetchClient;\n private validateChecksums: boolean;\n private azureAccount?: string;\n private withRangeCoalescing?: RangeCoalescingFn;\n private basePath: string = \"\";\n\n private constructor(\n session: ReadSession,\n fetchClient?: FetchClient,\n validateChecksums?: boolean,\n azureAccount?: string,\n withRangeCoalescing?: RangeCoalescingFn,\n ) {\n if (!(session instanceof ReadSession)) {\n throw new Error(\n \"IcechunkStore constructor is private. Use IcechunkStore.open() instead.\",\n );\n }\n this.session = session;\n this.fetchClient = fetchClient;\n this.validateChecksums = validateChecksums ?? false;\n this.azureAccount = azureAccount;\n this.withRangeCoalescing = withRangeCoalescing;\n }\n\n /**\n * Open an IcechunkStore from a URL.\n *\n * @param url - URL to the icechunk repository\n * @param options - Store options (branch, tag, or snapshot to checkout)\n */\n static async open(\n url: string,\n options?: IcechunkStoreOptions,\n ): Promise<IcechunkStore>;\n\n /**\n * Open an IcechunkStore from an existing ReadSession.\n *\n * @param session - Existing ReadSession\n * @param options - Store options for virtual chunk reads\n */\n static async open(\n session: ReadSession,\n options?: Pick<\n IcechunkStoreOptions,\n | \"fetchClient\"\n | \"validateChecksums\"\n | \"azureAccount\"\n | \"withRangeCoalescing\"\n >,\n ): Promise<IcechunkStore>;\n\n /**\n * Open an IcechunkStore from a custom Storage backend.\n *\n * @param storage - Custom Storage implementation\n * @param options - Store options (branch, tag, or snapshot to checkout)\n */\n static async open(\n storage: Storage,\n options?: IcechunkStoreOptions,\n ): Promise<IcechunkStore>;\n\n static async open(\n arg: string | ReadSession | Storage,\n options: IcechunkStoreOptions = {},\n ): Promise<IcechunkStore> {\n if (arg instanceof ReadSession) {\n return new IcechunkStore(\n arg,\n options.fetchClient,\n options.validateChecksums,\n options.azureAccount,\n options.withRangeCoalescing,\n );\n }\n\n const storage = typeof arg === \"string\" ? new HttpStorage(arg) : arg;\n const requestOptions = options.signal\n ? { signal: options.signal }\n : undefined;\n const repo = await Repository.open(\n { storage, formatVersion: options.formatVersion },\n requestOptions,\n );\n\n // Build session options: merge request options with cache size\n const sessionOptions = {\n ...requestOptions,\n maxManifestCacheSize: options.maxManifestCacheSize,\n };\n\n let session: ReadSession;\n if (options.snapshot) {\n session = await repo.checkoutSnapshot(options.snapshot, sessionOptions);\n } else if (options.tag) {\n session = await repo.checkoutTag(options.tag, sessionOptions);\n } else {\n session = await repo.checkoutBranch(\n options.branch ?? \"main\",\n sessionOptions,\n );\n }\n\n return new IcechunkStore(\n session,\n options.fetchClient,\n options.validateChecksums,\n options.azureAccount,\n options.withRangeCoalescing,\n );\n }\n\n /**\n * Get data for a zarr key.\n *\n * zarrita calls this method with keys like:\n * - \"/zarr.json\" - root metadata\n * - \"/array/zarr.json\" - array metadata\n * - \"/array/c/0/1/2\" - chunk at coords [0, 1, 2]\n *\n * @param key - Absolute path (must start with \"/\")\n * @param opts - Optional request options (supports AbortSignal for cancellation)\n * @returns Data bytes or undefined if not found\n */\n async get(\n key: AbsolutePath,\n opts?: { signal?: AbortSignal },\n ): Promise<Uint8Array | undefined> {\n opts?.signal?.throwIfAborted();\n\n const parsed = parseZarrKey(key);\n const resolvedPath = this.resolvePath(parsed.path);\n\n try {\n if (parsed.type === \"metadata\") {\n const data = this.session.getRawMetadata(resolvedPath);\n return data ?? undefined;\n }\n\n const chunk = await this.session.getChunk(resolvedPath, parsed.coords, {\n signal: opts?.signal,\n ...(this.fetchClient && { fetchClient: this.fetchClient }),\n validateChecksums: this.validateChecksums,\n azureAccount: this.azureAccount,\n ...(this.withRangeCoalescing && {\n withRangeCoalescing: this.withRangeCoalescing,\n }),\n });\n return chunk ?? undefined;\n } catch (err) {\n // Only treat \"chunk legitimately absent\" as undefined. Propagate\n // everything else — swallowing aborts/network errors here causes\n // zarrita's Array.getChunk to return a fillValue chunk, which\n // downstream consumers cache as valid data (e.g. zarr-layer commits\n // it to region.data, producing permanent blank regions even after\n // repainting).\n if (err instanceof NotFoundError) return undefined;\n throw err;\n }\n }\n\n /**\n * Get partial data for a zarr key.\n *\n * Required by zarrita for sharded arrays. zarrita uses this to read the\n * shard index (via suffixLength) and extract individual inner chunks\n * (via offset/length) from shard data.\n *\n * @param key - Absolute path\n * @param range - Byte range to fetch\n * @param opts - Optional request options (supports AbortSignal for cancellation)\n * @returns Data bytes or undefined if not found\n */\n async getRange(\n key: AbsolutePath,\n range: RangeQuery,\n opts?: { signal?: AbortSignal },\n ): Promise<Uint8Array | undefined> {\n opts?.signal?.throwIfAborted();\n\n const parsed = parseZarrKey(key);\n const resolvedPath = this.resolvePath(parsed.path);\n\n try {\n if (parsed.type === \"chunk\") {\n // Use targeted byte-range read through the session\n const data = await this.session.getChunkRange(\n resolvedPath,\n parsed.coords,\n range,\n {\n signal: opts?.signal,\n ...(this.fetchClient && { fetchClient: this.fetchClient }),\n validateChecksums: this.validateChecksums,\n azureAccount: this.azureAccount,\n ...(this.withRangeCoalescing && {\n withRangeCoalescing: this.withRangeCoalescing,\n }),\n },\n );\n return data ?? undefined;\n }\n\n // For metadata keys, fetch full data and slice\n const data = this.session.getRawMetadata(resolvedPath);\n if (!data) return undefined;\n\n if (\"suffixLength\" in range) {\n return data.slice(-range.suffixLength);\n }\n return data.slice(range.offset, range.offset + range.length);\n } catch (err) {\n // Same rationale as `get()`: don't swallow aborts or real errors,\n // or zarrita will silently fall back to a fillValue chunk and\n // consumers will cache that garbage as valid data.\n if (err instanceof NotFoundError) return undefined;\n throw err;\n }\n }\n\n /** Prepend basePath to a parsed path. */\n private resolvePath(path: string): string {\n if (!this.basePath) return path;\n // path is \"/\" for root or \"/group/array\" for nested\n if (path === \"/\") return `/${this.basePath}`;\n return `/${this.basePath}${path}`;\n }\n\n /**\n * Create a store scoped to a subpath.\n *\n * The returned store shares the same session (and manifest cache)\n * but prepends `path` to all key lookups. This matches zarrita's\n * `root(store).resolve(path)` pattern.\n *\n * @param path - Subpath to scope to (e.g., \"group/array\")\n * @returns A new IcechunkStore scoped to the subpath\n */\n resolve(path: string): IcechunkStore {\n const scoped = new IcechunkStore(\n this.session,\n this.fetchClient,\n this.validateChecksums,\n this.azureAccount,\n this.withRangeCoalescing,\n );\n const cleanPath = path.replace(/^\\/+|\\/+$/g, \"\");\n scoped.basePath = this.basePath\n ? `${this.basePath}/${cleanPath}`\n : cleanPath;\n return scoped;\n }\n\n /**\n * List direct children of a group by name.\n *\n * @param parentPath - Path to the parent group (use \"/\" for root).\n * When omitted, uses the store's base path (or root).\n * @returns Array of child names (e.g., [\"temperature\", \"precipitation\"])\n */\n listChildren(parentPath?: string): string[] {\n let path: string;\n if (parentPath == null) {\n path = this.basePath ? `/${this.basePath}` : \"/\";\n } else if (this.basePath) {\n path =\n `/${this.basePath}/${parentPath.replace(/^\\//, \"\")}`\n .replace(/\\/+/g, \"/\")\n .replace(/\\/+$/, \"\") || \"/\";\n } else {\n // Normalize: ensure leading slash, strip trailing slashes\n path =\n (parentPath.startsWith(\"/\") ? parentPath : `/${parentPath}`).replace(\n /\\/+$/,\n \"\",\n ) || \"/\";\n }\n const nodes = this.session.listChildren(path);\n return nodes.map((node) => {\n // Extract the last path segment as the child name\n const segments = node.path.split(\"/\");\n return segments[segments.length - 1];\n });\n }\n\n /**\n * List all nodes in the snapshot.\n *\n * @returns Array of all nodes\n */\n listNodes(): NodeSnapshot[] {\n return this.session.listNodes();\n }\n\n /**\n * Get a node by path.\n *\n * @param path - Absolute path (e.g., \"/array\" or \"/group/nested\")\n * @returns NodeSnapshot or null if not found\n */\n getNode(path: string): NodeSnapshot | null {\n const fullPath =\n (this.basePath\n ? `/${this.basePath}/${path.replace(/^\\//, \"\")}`.replace(/\\/+/g, \"/\")\n : path\n ).replace(/\\/+$/, \"\") || \"/\";\n return this.session.getNode(fullPath);\n }\n\n /**\n * Get parsed Zarr metadata for a node.\n *\n * @param path - Path to the node\n * @returns Parsed JSON metadata or null if node not found\n */\n getMetadata(path: string): unknown | null {\n const fullPath =\n (this.basePath\n ? `/${this.basePath}/${path.replace(/^\\//, \"\")}`.replace(/\\/+/g, \"/\")\n : path\n ).replace(/\\/+$/, \"\") || \"/\";\n return this.session.getMetadata(fullPath);\n }\n}\n\n/** Parsed zarr key */\ntype ParsedKey =\n | { type: \"metadata\"; path: string }\n | { type: \"chunk\"; path: string; coords: number[] };\n\n/**\n * Parse a zarr key into its components.\n *\n * Keys follow the pattern:\n * - \"/zarr.json\" → root metadata\n * - \"/path/to/node/zarr.json\" → node metadata\n * - \"/path/to/array/c/0/1/2\" → chunk at coords [0, 1, 2]\n */\nfunction parseZarrKey(key: AbsolutePath): ParsedKey {\n // Remove leading slash for easier parsing\n const path = key.slice(1);\n\n // Root metadata\n if (path === \"zarr.json\") {\n return { type: \"metadata\", path: \"/\" };\n }\n\n // Node metadata\n if (path.endsWith(\"/zarr.json\")) {\n const nodePath = \"/\" + path.slice(0, -\"/zarr.json\".length);\n return { type: \"metadata\", path: nodePath };\n }\n\n // Chunk key: \"path/to/array/c/0/1/2\" or \"c/0/1/2\" for root arrays\n const chunkMatch = path.match(/^(?:(.*)\\/)?c(?:\\/(.*))?$/);\n if (chunkMatch) {\n const arrayPath = chunkMatch[1] ? \"/\" + chunkMatch[1] : \"/\";\n const coordsStr = chunkMatch[2] ?? \"\";\n const coords = coordsStr ? coordsStr.split(\"/\").map(Number) : [];\n return { type: \"chunk\", path: arrayPath, coords };\n }\n\n // Default to metadata\n return { type: \"metadata\", path: \"/\" + path };\n}\n"],"mappings":";AA8BO,IAAM,qBAAN,MAAgD;AAAA,EACrD,MAAM,KAAa,MAAuC;AACxD,WAAO,WAAW,MAAM,KAAK,IAAI;AAAA,EACnC;AACF;AAgCO,IAAM,gBAAN,cAA4B,MAAM;AAAA,EACvC,YAA4B,MAAc;AACxC,UAAM,qBAAqB,IAAI,EAAE;AADP;AAE1B,SAAK,OAAO;AAAA,EACd;AACF;AAGO,IAAM,eAAN,cAA2B,MAAM;AAAA,EACtC,YACE,SACgB,OAChB;AACA,UAAM,OAAO;AAFG;AAGhB,SAAK,OAAO;AAAA,EACd;AACF;AAIA,SAAS,aAAa,OAAwC;AAC5D,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,UAAU;AAClE;AAGO,SAAS,aACd,OACiD;AACjD,SAAO,aAAa,KAAK,KAAK,MAAM,SAAS;AAC/C;;;AC1FO,IAAM,QAAQ;AAAA;AAAA,EAEnB,MAAM;AAAA;AAAA,EAGN,WAAW;AAAA;AAAA,EAGX,WAAW;AAAA;AAAA,EAGX,QAAQ;AAAA;AAAA,EAGR,cAAc;AAChB;AAGO,IAAM,iBAAiB;AAavB,SAAS,oBAAoB,MAAsB;AACxD,SAAO,GAAG,MAAM,IAAI,WAAW,IAAI;AACrC;AAYO,SAAS,iBAAiB,MAAsB;AACrD,SAAO,GAAG,MAAM,IAAI,QAAQ,IAAI;AAClC;AAQO,IAAM,gBAAgB;AAUtB,SAAS,iBAAiB,MAAsB;AACrD,SAAO,GAAG,MAAM,IAAI,WAAW,IAAI,IAAI,aAAa;AACtD;AAUO,SAAS,cAAc,MAAsB;AAClD,SAAO,GAAG,MAAM,IAAI,QAAQ,IAAI,IAAI,aAAa;AACnD;AAQO,SAAS,gBAAgB,IAAoB;AAClD,SAAO,GAAG,MAAM,SAAS,IAAI,EAAE;AACjC;AAQO,SAAS,gBAAgB,IAAoB;AAClD,SAAO,GAAG,MAAM,SAAS,IAAI,EAAE;AACjC;AAQO,SAAS,aAAa,IAAoB;AAC/C,SAAO,GAAG,MAAM,MAAM,IAAI,EAAE;AAC9B;AAQO,SAAS,sBAAsB,IAAoB;AACxD,SAAO,GAAG,MAAM,YAAY,IAAI,EAAE;AACpC;;;AChHA,IAAM,kBAAkB;AAGxB,IAAM,aAAqC,CAAC;AAG5C,SAAS,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;AAC/C,QAAM,OAAO,gBAAgB,CAAC;AAC9B,aAAW,IAAI,IAAI;AACnB,aAAW,KAAK,YAAY,CAAC,IAAI;AACnC;AAGA,WAAW,GAAG,IAAI,WAAW,GAAG,IAAI;AACpC,WAAW,GAAG,IAAI,WAAW,GAAG,IAAI;AACpC,WAAW,GAAG,IAAI,WAAW,GAAG,IAAI;AAQ7B,SAAS,aAAa,OAA2B;AACtD,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,WAAW;AAEf,aAAW,QAAQ,OAAO;AACxB,aAAU,UAAU,IAAK;AACzB,gBAAY;AAEZ,WAAO,YAAY,GAAG;AACpB,kBAAY;AACZ,YAAM,QAAS,UAAU,WAAY;AACrC,gBAAU,gBAAgB,KAAK;AAAA,IACjC;AAAA,EACF;AAGA,MAAI,WAAW,GAAG;AAChB,UAAM,QAAS,UAAW,IAAI,WAAa;AAC3C,cAAU,gBAAgB,KAAK;AAAA,EACjC;AAEA,SAAO;AACT;AASO,SAAS,aAAa,KAAyB;AACpD,MAAI,IAAI,WAAW,EAAG,QAAO,IAAI,WAAW,CAAC;AAG7C,QAAM,IAAI,QAAQ,MAAM,EAAE;AAE1B,QAAM,SAAmB,CAAC;AAC1B,MAAI,SAAS;AACb,MAAI,WAAW;AAEf,aAAW,QAAQ,KAAK;AACtB,UAAM,QAAQ,WAAW,IAAI;AAC7B,QAAI,UAAU,QAAW;AACvB,YAAM,IAAI,MAAM,uCAAuC,IAAI,EAAE;AAAA,IAC/D;AAEA,aAAU,UAAU,IAAK;AACzB,gBAAY;AAEZ,QAAI,YAAY,GAAG;AACjB,kBAAY;AACZ,aAAO,KAAM,UAAU,WAAY,GAAI;AAAA,IACzC;AAAA,EACF;AAEA,SAAO,IAAI,WAAW,MAAM;AAC9B;AAQO,SAAS,iBAAiB,IAAwB;AACvD,MAAI,GAAG,WAAW,IAAI;AACpB,UAAM,IAAI,MAAM,0BAA0B,GAAG,MAAM,EAAE;AAAA,EACvD;AACA,SAAO,aAAa,EAAE;AACxB;AAQO,SAAS,iBAAiB,KAAyB;AACxD,QAAM,QAAQ,aAAa,GAAG;AAC9B,MAAI,MAAM,WAAW,IAAI;AACvB,UAAM,IAAI,MAAM,yCAAyC,MAAM,MAAM,EAAE;AAAA,EACzE;AACA,SAAO;AACT;AAQO,SAAS,gBAAgB,IAAwB;AACtD,MAAI,GAAG,WAAW,GAAG;AACnB,UAAM,IAAI,MAAM,yBAAyB,GAAG,MAAM,EAAE;AAAA,EACtD;AACA,SAAO,aAAa,EAAE;AACxB;AAQO,SAAS,gBAAgB,KAAyB;AACvD,QAAM,QAAQ,aAAa,GAAG;AAC9B,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,MAAM,wCAAwC,MAAM,MAAM,EAAE;AAAA,EACxE;AACA,SAAO;AACT;;;AC/IA,SAAS,kBAAkB;AAC3B,YAAY,iBAAiB;;;ACHtB,IAAM,eAAN,MAAM,cAAa;AAAA,EACxB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA0C;AAC1D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,sBACL,IACA,KACc;AACd,YAAQ,OAAO,IAAI,cAAa,GAAG;AAAA,MACjC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAIA,KAAK,kBAAoD;AACvD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;AClDO,IAAM,MAAN,MAAM,KAAI;AAAA,EACf,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAiC;AACjD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,aAAa,IAA4B,KAAgB;AAC9D,YAAQ,OAAO,IAAI,KAAI,GAAG;AAAA,MACxB,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAIA,KAAK,kBAAoD;AACvD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,gBAAwB;AACtB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI;AAAA,EAC9D;AACF;;;AC3BO,IAAM,aAAN,MAAM,YAAW;AAAA,EACtB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAwC;AACxD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,oBACL,IACA,KACY;AACZ,YAAQ,OAAO,IAAI,YAAW,GAAG;AAAA,MAC/B,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,eAAiC;AAC/B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM;AAAA,EAE7C;AAAA,EAEA,QAAgB;AACd,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAMA,0BACE,kBAC4B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AACF;;;AC7CO,IAAM,aAAN,MAAiB;AAAA,EACtB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAwC;AACxD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,OAA8B;AAClC,WAAO,KAAK,GAAI,UAAU,KAAK,SAAS,IAAI,KAAK;AAAA,EACnD;AAAA,EAEA,OAAO,SAAiB;AACtB,WAAO;AAAA,EACT;AACF;;;ACbO,IAAM,eAAN,MAAM,cAAa;AAAA,EACxB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA0C;AAC1D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,sBACL,IACA,KACc;AACd,YAAQ,OAAO,IAAI,cAAa,GAAG;AAAA,MACjC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,GAAG,KAAqC;AACtC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM,IAAI;AAAA,EAC7D;AAAA,EAEA,YAAoB;AAClB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAIA,QAAQ,kBAAoD;AAC1D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,SAAS,OAAe,KAAyC;AAC/D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,aAAa,GAAG;AAAA,MAC1B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,iBAAyB;AACvB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,qBAAqB,OAAe,KAAqC;AACvE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,WAAW,GAAG;AAAA,MACxB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,6BAAqC;AACnC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AACF;;;AC7EO,IAAM,SAAN,MAAM,QAAO;AAAA,EAClB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAoC;AACpD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,gBAAgB,IAA4B,KAAsB;AACvE,YAAQ,OAAO,IAAI,QAAO,GAAG;AAAA,MAC3B,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,iBAA6B;AAC3B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM;AAAA,EACzD;AAAA,EAEA,WAAW,KAAsB;AAC/B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,QAAQ,KAAK,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,YAAoB;AAClB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAMA,WAAW,kBAAoD;AAC7D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AACF;;;ACrCO,IAAM,OAAN,MAAM,MAAK;AAAA,EAChB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAkC;AAClD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,cAAc,IAA4B,KAAkB;AACjE,YAAQ,OAAO,IAAI,MAAK,GAAG;AAAA,MACzB,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM,IAAI;AAAA,EAC7D;AAAA,EAEA,KAAK,OAAe,KAAuB;AACzC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,IAAI,GAAG;AAAA,MACjB,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,aAAqB;AACnB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,SAAS,OAAe,KAAuB;AAC7C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,IAAI,GAAG;AAAA,MACjB,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,iBAAyB;AACvB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAOA,YACE,OACA,kBAC4B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI;AAAA,MACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD;AAAA,IACF,IACA;AAAA,EACN;AAAA,EAEA,oBAA4B;AAC1B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,UAAU,OAAe,KAAyC;AAChE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,aAAa,GAAG;AAAA,MAC1B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,kBAA0B;AACxB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,OAAO,KAAqC;AAC1C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,WAAW,GAAG;AAAA,MACxB,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM;AAAA,MACxC,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,SAAS,OAAe,KAAyC;AAC/D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,aAAa,GAAG;AAAA,MAC1B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,iBAAyB;AACvB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAc,OAAe,KAA6B;AACxD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,OAAO,GAAG;AAAA,MACpB,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAMA,kBAAkB,kBAAoD;AACpE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,OAAO,OAA8B;AACnC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAiC;AAC/B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,oBAAoB,OAA8B;AAChD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,WAAW,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ,CAAC,IACvE;AAAA,EACN;AAAA,EAEA,4BAAoC;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,2BAA+C;AAC7C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,qBAAqB,OAA8B;AACjD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,WAAW,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ,CAAC,IACvE;AAAA,EACN;AAAA,EAEA,6BAAqC;AACnC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,4BAAgD;AAC9C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;AC5NA,IAAM,KAAK;AAAX,IAAwB,KAAK;AAA7B,IAAyC,MAAM;AAA/C,IAA4D,MAAM;AAAlE,IAAiG,MAAM;AA8CvG,IAAM,MAAM,CAAC,GAAe,GAAW,MAAe;AACpD,MAAI,GAAG,UAAU,MAAO,QAAO,GAAG,UAAU,MAAM,KAAK,GAAG,GAAG,CAAC;AAC9D,MAAI,KAAK,QAAQ,IAAI,EAAG,KAAI;AAC5B,MAAI,KAAK,QAAQ,IAAI,EAAE,OAAQ,KAAI,EAAE;AACrC,QAAM,IAAI,IAAI,GAAG,IAAI,CAAC;AACtB,IAAE,IAAI,EAAE,SAAS,GAAG,CAAC,CAAC;AACtB,SAAO;AACT;AAEA,IAAM,OAAO,CAAC,GAAe,GAAW,GAAY,MAAe;AACjE,MAAI,GAAG,UAAU,KAAM,QAAO,GAAG,UAAU,KAAK,KAAK,GAAG,GAAG,GAAG,CAAC;AAC/D,MAAI,KAAK,QAAQ,IAAI,EAAG,KAAI;AAC5B,MAAI,KAAK,QAAQ,IAAI,EAAE,OAAQ,KAAI,EAAE;AACrC,SAAO,IAAI,GAAG,EAAE,EAAG,GAAE,CAAC,IAAI;AAC1B,SAAO;AACT;AAEA,IAAM,MAAM,CAAC,GAAe,GAAW,GAAY,MAAe;AAChE,MAAI,GAAG,UAAU,WAAY,QAAO,GAAG,UAAU,WAAW,KAAK,GAAG,GAAG,GAAG,CAAC;AAC3E,MAAI,KAAK,QAAQ,IAAI,EAAG,KAAI;AAC5B,MAAI,KAAK,QAAQ,IAAI,EAAE,OAAQ,KAAI,EAAE;AACrC,SAAO,IAAI,GAAG;AACZ,MAAE,GAAG,IAAI,EAAE,GAAG;AAAA,EAChB;AACF;AAkBA,IAAM,KAAsC;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAYA,IAAM,MAAM,CAAC,KAAU,KAAkB,OAAW;AAClD,QAAM,IAAwB,IAAI,MAAM,OAAO,GAAG,GAAG,CAAC;AACtD,IAAE,OAAO;AACT,MAAI,MAAM,kBAAmB,OAAM,kBAAkB,GAAG,GAAG;AAC3D,MAAI,CAAC,GAAI,OAAM;AACf,SAAO;AACT;AAEA,IAAM,KAAK,CAAC,GAAe,GAAW,MAAc;AAClD,MAAI,IAAI,GAAG,IAAI;AACf,SAAO,IAAI,GAAG,EAAE,EAAG,MAAK,EAAE,GAAG,MAAM,KAAK;AACxC,SAAO;AACT;AAEA,IAAM,KAAK,CAAC,GAAe,OAAe,EAAE,CAAC,IAAK,EAAE,IAAI,CAAC,KAAK,IAAM,EAAE,IAAI,CAAC,KAAK,KAAO,EAAE,IAAI,CAAC,KAAK,QAAS;AAG5G,IAAM,OAAO,CAAC,KAAiB,OAAmB;AAChD,MAAI,GAAG,KAAK,CAAC,KAAK,YAAY;AAC5B,QAAI,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,CAAC,EAAG,KAAI,CAAC;AACtC,QAAI,KAAK;AACT,KAAC,IAAI,GAAG,CAAC,IAAI,IAAI,KAAK,EAAE;AACxB,QAAI,KAAY,KAAY;AAC5B,KAAC,IAAI,GAAG,IAAI,KAAK,KAAK,IAAI,CAAC;AAC3B,KAAC,IAAI,GAAG,IAAI,KAAK,KAAK,IAAI,CAAC;AAC3B,KAAC,IAAI,GAAG,IAAI,KAAK,KAAK,IAAI,CAAC;AAC3B,OAAG,IAAI,CAAC,KAAK,KAAK,GAAG;AACrB,OAAG,IAAI,IAAI,IAAI,CAAC,GAAG,KAAK,EAAE,GAAG,GAAG,KAAK,KAAK,CAAC,GAAG,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC;AAC9D,UAAM,IAAI,SAAS,KAAK,EAAE;AAAA,EAC5B;AACA,QAAM,KAAK,KAAK,IAAI,IAAI,QAAQ,GAAG,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI,SAAS,GAAG,CAAC,IAAI,GAAG,CAAC;AAC/E,KAAG,IAAI,IAAI,GAAG,EAAE;AAChB,KAAG,EAAE,IAAI,KAAK,KAAK,IAAI,MAAM;AAC7B,KAAG,IAAI;AACT;AAGA,IAAM,OAAO,CAAC,KAAiB,MAA4C;AACzE,QAAM,KAAK,IAAI,CAAC,IAAK,IAAI,CAAC,KAAK,IAAM,IAAI,CAAC,KAAK;AAC/C,MAAI,MAAM,WAAY,IAAI,CAAC,KAAK,KAAK;AAEnC,UAAM,MAAM,IAAI,CAAC;AAEjB,UAAM,KAAM,OAAO,IAAK,GAAG,KAAM,OAAO,IAAK,GAAG,KAAK,MAAM,GAAG,MAAM,OAAO;AAC3E,QAAI,MAAM,EAAG,KAAI,CAAC;AAElB,QAAI,KAAK,IAAI;AAEb,UAAM,KAAK,MAAM,IAAI,IAAI;AAEzB,UAAM,KAAK,GAAG,KAAK,IAAI,EAAE;AACzB,UAAM;AAEN,UAAM,MAAM,MAAO,KAAK,MAAO;AAE/B,UAAM,MAAM,GAAG,KAAK,IAAI,GAAG,KAAM,OAAO,KAAM;AAE9C,QAAI,KAAK;AACT,QAAI,CAAC,IAAI;AAEP,YAAM,KAAK,KAAM,MAAM,IAAI,CAAC,KAAK;AACjC,WAAK,MAAM,MAAM,MAAM,IAAI,CAAC,IAAI;AAAA,IAClC;AACA,QAAI,KAAK,WAAY,KAAI,CAAC;AAC1B,UAAM,MAAM,IAAI,IAAI,KAAK,IAAK,OAAO,KAAM,IAAI,IAAI,MAAM,EAAE;AAC3D,QAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;AACjC,WAAO;AAAA,MACL,GAAG,KAAK;AAAA,MACR,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAI,KAAK,KAAK,IAAK,IAAI,IAAI,SAAS,EAAE;AAAA,MACtC,GAAG;AAAA,MACH,GAAG,IAAI,IAAI,IAAI,QAAQ,GAAG,CAAC;AAAA,MAC3B,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG,KAAK,IAAI,QAAQ,EAAE;AAAA,IACxB;AAAA,EACF,YAAa,MAAM,IAAM,IAAI,CAAC,KAAK,OAAQ,UAAW;AAEpD,WAAO,GAAG,KAAK,CAAC,IAAI;AAAA,EACtB;AACA,MAAI,CAAC;AACP;AAGA,IAAM,MAAM,CAAC,QAAgB;AAC3B,MAAI,OAAO;AACX,SAAQ,KAAK,QAAS,KAAK,EAAE,KAAK;AAClC,SAAO,OAAO;AAChB;AAGA,IAAM,OAAO,CAAC,KAAiB,IAAY,QAAiC;AAE1E,MAAI,QAAQ,MAAM,KAAK;AAEvB,QAAM,MAAM,IAAI,EAAE,IAAI,MAAM;AAC5B,MAAI,KAAK,IAAK,KAAI,CAAC;AAEnB,QAAM,KAAK,KAAK;AAEhB,MAAI,QAAQ,IAAI,MAAM,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK;AAEhD,QAAM,MAAM,IAAI,GAAG,OAAO,MAAM,EAAE;AAClC,QAAM,OAAO,IAAI,IAAI,KAAK,GAAG,GAAG;AAEhC,QAAM,SAAS,IAAI,IAAI,KAAK,GAAG,GAAG;AAClC,QAAM,SAAS,IAAI,IAAI,KAAK,KAAK,EAAE;AACnC,QAAM,MAAM,OAAO,MAAM;AACzB,QAAM,OAAO,IAAI,GAAG,KAAK,KAAK,EAAE;AAChC,QAAM,QAAQ,IAAI,GAAG,KAAK,MAAM,EAAE;AAClC,SAAO,MAAM,OAAO,QAAQ,GAAG;AAC7B,UAAM,OAAO,IAAI,QAAQ,CAAC;AAC1B,UAAM,MAAM,QAAQ;AAEpB,UAAM,OAAO,KAAM,OAAO,KAAM;AAChC,QAAI,OAAQ,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,IAAM,IAAI,MAAM,CAAC,KAAK,QAAS,OAAO,KAAM;AAEpF,UAAM,UAAU,KAAK,QAAQ;AAE7B,UAAM,MAAM,MAAM,QAAQ;AAE1B,UAAM,OAAO,MAAM;AACnB,QAAI,OAAO,IAAK,SAAQ,MAAM,MAAM;AAAA,SAC/B;AACH,cAAQ,OAAO;AACf,UAAI,MAAM,OAAQ,QAAO;AAAA,IAC3B;AACA,SAAK,EAAE,GAAG,IAAI,EAAE;AAChB,QAAI,OAAO,IAAI;AACb,eAAS;AACT,WAAK,EAAE,EAAE,IAAI;AAAA,IACf,MAAO,UAAS;AAChB,QAAI,CAAC,KAAK;AACR,SAAG;AAED,cAAM,MAAM,QAAQ;AACpB,cAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,KAAM;AACxD,gBAAQ;AACR,eAAO;AAAA,MACT,SAAS,MAAM;AAAA,IACjB;AAAA,EACF;AACA,MAAI,MAAM,OAAO,MAAO,KAAI,CAAC;AAC7B,MAAI,SAAS;AAEb,QAAM,SAAS,MAAM,MAAM,MAAM,KAAK;AAEtC,QAAM,QAAQ,KAAK;AACnB,WAAS,IAAI,GAAG,KAAK,KAAK,EAAE,GAAG;AAC7B,UAAM,KAAK,KAAK,CAAC;AACjB,QAAI,KAAK,GAAG;AACV,aAAO,CAAC,IAAI,CAAC;AACb;AAAA,IACF;AAEA,SAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AACvB,WAAK,MAAM,IAAI;AACf,SAAG;AACD,iBAAU,SAAS,QAAS;AAAA,MAC9B,SAAS,UAAU;AAAA,IACrB;AAAA,EACF;AAEA,MAAI,OAAQ,KAAI,CAAC;AACjB,OAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAEvB,UAAM,KAAK,OAAO,KAAK,CAAC,CAAC;AAEzB,UAAM,KAAK,MAAM,CAAC,IAAI,KAAK,IAAI,EAAE;AACjC,WAAO,CAAC,KAAK,MAAM,MAAM;AAAA,EAC3B;AACA,SAAO,CAAE,OAAO,KAAM,GAAG;AAAA,IACvB,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACL,CAAC;AACH;AAGA,IAAM,MAAM,CAAC,KAAiB,OAA8B;AAE1D,MAAI,IAAI,GAAG,KAAK;AAEhB,QAAM,MAAM,IAAI,GAAG,GAAG,GAAG,KAAK,IAAI,EAAE;AAEpC,QAAM,KAAK,IAAI,SAAS,GAAG,GAAG;AAE9B,QAAM,KAAK,IAAI,SAAS,KAAK,GAAG;AAEhC,QAAM,KAAK,IAAI,IAAI,IAAI,QAAQ,GAAG;AAElC,MAAI,KAAK,KAAK;AAEZ,UAAM,CAAC,KAAK,GAAG,IAAI,KAAK,KAAK,KAAK,GAAG,CAAC;AACtC,UAAM;AACN,UAAM,OAAO,OAAO;AAEpB,UAAM,KAAK,IAAI,EAAE;AACjB,QAAI,CAAC,GAAI,KAAI,CAAC;AAEd,QAAI,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI,GAAG,OAAO;AAG3C,QAAI,QAAQ,EAAE,MAAM,KAAK,IAAI,IAAI,EAAE;AACnC,eAAS;AACP,cAAQ;AACR,UAAI,OAAO,KAAM;AACjB,UAAI,MAAM,QAAQ;AAClB,cAAS,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,QAAQ;AACzE,SAAG,EAAE,EAAE,IAAI,IAAI,EAAE,GAAG;AACpB,cAAQ;AACR,UAAI,OAAO,KAAM;AACjB,YAAM,QAAQ;AACd,cAAS,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,QAAQ;AACzE,SAAG,EAAE,EAAE,IAAI,IAAI,EAAE,GAAG;AACpB,aAAO,IAAI,EAAE,GAAG;AAChB,YAAM,IAAI,EAAE,GAAG;AACf,aAAO,IAAI,EAAE,GAAG;AAChB,YAAM,IAAI,EAAE,GAAG;AAAA,IACjB;AACA,QAAI,EAAE,KAAK,IAAK,KAAI,CAAC;AAAA,EACvB,OAAO;AACL,SAAK,KAAK;AACV,WAAO,IAAI,IAAI,KAAK,GAAG;AACrB,YAAM,OAAO,IAAI,EAAE,EAAE;AACrB,SAAG,CAAC,IAAI,QAAQ;AAChB,SAAG,IAAI,CAAC,IAAI,OAAO;AAAA,IACrB;AACA,MAAE;AAAA,EACJ;AAEA,MAAI,MAAM;AACV,OAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AACvB,UAAM,KAAK,GAAG,CAAC;AAEf,QAAI,KAAK,GAAI,KAAI,CAAC;AAClB,WAAO,MAAO,KAAM,KAAK;AAAA,EAC3B;AAEA,QAAM,KAAK,IAAI,GAAG,IAAI;AAEtB,QAAM,KAAK,KAAK;AAEhB,QAAM,MAAM,KAAK;AAEjB,MAAI,MAAO,MAAM,EAAI,KAAI,CAAC;AAC1B,KAAG,IAAI,IAAI,IAAI,GAAG,IAAI;AACtB,OAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AACvB,UAAM,KAAK,GAAG,CAAC;AACf,MAAE,GAAG,GAAG,CAAC,IAAI,MAAO,KAAK,IAAI,EAAG;AAAA,EAClC;AAEA,QAAM,OAAO,IAAI,GAAG,MAAM,CAAC;AAE3B,QAAM,OAAO,KAAK,SAAS,GAAG,EAAE,GAAG,KAAK,KAAK,SAAS,EAAE;AACxD,KAAG,EAAE,IAAI;AACT,OAAK,IAAI,IAAI,IAAI,GAAG,EAAE,GAAG;AACvB,UAAM,KAAK,GAAG,CAAC;AACf,SAAK,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,KAAK,KAAM,KAAK,EAAG;AAAA,EAC1D;AACA,MAAI,GAAG,CAAC,KAAK,GAAI,KAAI,CAAC;AACtB,OAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AACvB,UAAM,OAAO,GAAG,CAAC;AACjB,QAAI,MAAM;AACR,YAAM,OAAO,GAAG,IAAI;AACpB,WAAK,MAAM,GAAG,MAAM,GAAG,IAAI,IAAI,QAAQ,KAAM,KAAK,KAAM;AAAA,IAC1D;AAAA,EACF;AACA,SAAO,CAAC,IAAI;AAAA,IACV,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACL,CAAC;AACH;AAMA,IAAM,OAAqB,KAAmB,oBAAI,GAAG;AAAA,EACnD;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAI;AAAA,EAAK;AACjF,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;AAGX,IAAM,OAAqB,KAAmB,oBAAI,GAAG;AAAA,EACnD;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAC5G,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;AAGX,IAAM,OAAsB,KAAmB,oBAAI,GAAG;AAAA,EACpD;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AACpD,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;AAGX,IAAM,OAAO,CAAC,GAAe,MAAc;AACzC,QAAM,MAAM,EAAE,QAAQ,KAAK,IAAI,IAAI,GAAG;AACtC,WAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,OAAG,CAAC,IAAI;AACR,SAAK,KAAK,EAAE,CAAC;AAAA,EACf;AACA,SAAO;AACT;AAGA,IAAM,MAAqB,oBAAI,IAAmB,oBAAI,IAAI;AAAA,EACxD;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAU;AAAA,EAAU;AAAA,EAAW;AAAA,EAAW;AACxD,CAAC,GAAG,QAAQ,GAAG,EAAE;AAGjB,IAAM,OAAsB,qBAAK,KAAK,CAAC;AAGvC,IAAM,MAAqB,oBAAI,IAAmB,oBAAI,IAAI;AAAA,EACxD;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAU;AAAA,EAAU;AAAA,EAAW;AAAA,EAAW;AAAA,EAAW;AAC/E,CAAC,GAAG,QAAQ,GAAG,EAAE;AAGjB,IAAM,OAAsB,qBAAK,KAAK,CAAC;AAGvC,IAAM,MAAM,CAAC,KAAiB,KAAiB,OAAY;AACzD,QAAM,MAAM,IAAI,QAAQ,KAAK,IAAI,QAAQ,KAAK,IAAI,MAAM,CAAC,GAAG,OAAO,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,GAAG;AAC5F,MAAI,CAAC,GAAI,KAAI,CAAC;AACd,MAAI,KAAK,GAAG,MAAM,GAAG,GAAG,OAAO,OAAO,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI;AAClE,SAAO,MAAM,MAAM,IAAI,MAAK;AAC1B,UAAM,MAAM,OAAO;AACnB,UAAM,OAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,IAAM,IAAI,MAAM,CAAC,KAAK,QAAS,MAAM;AAC9E,UAAO,MAAM,MAAO,OAAO;AAC3B,QAAI,EAAE,CAAC,IAAI,GAAG,EAAE,EAAE;AAClB,WAAQ,MAAM,GAAG,EAAE,EAAE;AAAA,EACvB;AACA,MAAI,OAAO,MAAM,IAAI,KAAK,GAAI,KAAI,CAAC;AACrC;AAIA,IAAM,OAAO,CAAC,KAAiB,KAAiB,OAAY;AAC1D,MAAI,KAAK;AACT,QAAM,KAAK,IAAI,QAAQ,MAAO,KAAK,KAAM,GAAG,MAAM,OAAO,GAAG,MAAM,MAAM;AACxE,MAAI,IAAI,SAAS,IAAI,MAAM,IAAI,CAAC,IAAK,IAAI,CAAC,KAAK,CAAE,GAAG,IAAI,SAAS,GAAG,GAAG,GAAG,EAAE;AAC5E,MAAI,IAAI,SAAS,IAAI,MAAM,IAAI,CAAC,IAAK,IAAI,CAAC,KAAK,CAAE,GAAG,IAAI,SAAS,KAAK,GAAG,GAAG,EAAE;AAC9E,MAAI,IAAI,SAAS,IAAI,MAAM,IAAI,CAAC,IAAK,IAAI,CAAC,KAAK,CAAE,GAAG,IAAI,SAAS,KAAK,GAAG,GAAG,EAAE;AAC9E,MAAI,IAAI,SAAS,EAAE,GAAG,IAAI,SAAS,GAAG,GAAG,EAAE;AAC7C;AAGA,IAAM,MAAM,CAAC,KAAiB,IAAgB,QAAqB;AACjE,MAAI,KAAK,GAAG;AAEZ,QAAM,KAAK,IAAI,EAAE,GAAG,QAAS,MAAM,IAAK;AACxC,KAAG,IAAI,KAAK;AACZ,QAAM,KAAM,MAAM,IAAM,IAAI,KAAK,CAAC,KAAK,IAAM,IAAI,KAAK,CAAC,KAAK;AAE5D,QAAM,OAAO,MAAM,KAAK;AACxB,MAAI,SAAS,GAAG;AACd,QAAI,MAAM,IAAI,OAAQ;AACtB,OAAG,IAAI,KAAK;AACZ,QAAI,KAAK;AACP,WAAK,KAAK,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,KAAK,EAAE;AACnC,aAAO;AAAA,IACT;AACA,WAAO,KAAK,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;AAAA,EACjC;AACA,MAAI,MAAM,IAAI,OAAQ;AACtB,MAAI,SAAS,GAAG;AACd,OAAG,IAAI;AACP,QAAI,KAAK;AACP,UAAI,IAAI,IAAI,SAAS,IAAI,GAAG,GAAG,GAAG,CAAC;AACnC,SAAG,KAAK;AACR,aAAO;AAAA,IACT;AACA,WAAO,IAAI,KAAK,IAAI,GAAG;AAAA,EACzB;AACA,MAAI,SAAS,GAAG;AAEd,UAAM,KAAK,IAAI,EAAE,GAAG,MAAM,KAAK,GAAG,KAAM,MAAM,IAAK;AAEnD,QAAI,MAAM,MAAM,GAAG,MAAM,GAAG,KAAK;AACjC,QAAI,MAAM,GAAG;AACX,UAAI,KAAK,EAAG,QAAQ,IAAI,EAAE,EAAE,KAAK,KAAO,KAAK,KAAO,IAAI,EAAE,EAAE,KAAK;AAAA,UAC5D,OAAM,MAAM;AAAA,IACnB,OAAO;AACL,WAAK;AACL,UAAI,KAAK,EAAG,SAAS,IAAI,EAAE,EAAE,IAAI,OAAO,GAAI,MAAO,IAAI,EAAE,KAAK,IAAM,IAAI,EAAE,EAAE,KAAK;AAAA,eACxE,MAAM,EAAG,QAAQ,IAAI,EAAE,EAAE,KAAK,KAAO,IAAI,EAAE,EAAE,IAAI,MAAM,IAAK,MAAO,IAAI,EAAE,KAAK,IAAM,IAAI,EAAE,EAAE,KAAK;AAAA,UACrG,QAAQ,IAAI,EAAE,EAAE,KAAK,KAAO,IAAI,EAAE,EAAE,IAAI,OAAO,IAAK,MAAO,IAAI,EAAE,KAAK,IAAM,IAAI,EAAE,EAAE,KAAK,IAAM,IAAI,EAAE,EAAE,KAAK;AAAA,IACnH;AACA,MAAE;AAEF,QAAI,MAAM,MAAM,IAAI,SAAS,GAAG,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,GAAG,CAAC;AAE7D,QAAI,MAAM,IAAI,SAAS;AACvB,QAAI,OAAO,EAAG,KAAI,IAAI,IAAI,SAAS,IAAI,MAAM,GAAG,GAAG,GAAG;AAAA,aAC7C,OAAO,EAAG,MAAK,KAAK,IAAI,IAAI,GAAG,GAAG;AAAA,SACtC;AAEH,UAAI,KAAK,GAAG;AACZ,UAAI,OAAO,GAAG;AACZ,cAAM,MAAM,IAAI,KAAK,EAAE;AAEvB,eAAO,MAAM,KAAK,IAAI,CAAC;AACvB,WAAG,IAAI,KAAK,IAAI,CAAC;AAAA,MACnB,WACS,CAAC,GAAI,KAAI,CAAC;AACnB,OAAC,KAAK,OAAO,KAAK,IAAI,SAAS,IAAI,MAAM,GAAG,GAAG,IAAI,SAAS,GAAG,GAAG,EAAE;AAAA,IACtE;AAEA,QAAI,KAAK,IAAI,IAAI;AACjB,QAAI,IAAI;AACN,UAAI,MAAM,IAAK,OAAM,IAAI,IAAI,IAAK,IAAI,IAAI,KAAK,KAAM;AAAA,eAC5C,KAAK,IAAK,MAAO,KAAK,OAAQ,IAAK,IAAI,IAAI;AAEpD,YAAM,MAAM,IAAI,IAAI;AACpB,UAAI,MAAM,EAAG,KAAI,CAAC;AAClB,YAAM,MAA6B,CAAC,MAAM,MAAM,IAAI;AACpD,eAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,cAAM,KAAM,QAAS,KAAK,KAAK,IAAM;AACrC,YAAI,MAAM,GAAG;AAEX,gBAAM,OAAO,IAAI,GAAG,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,CAAC;AACrC,cAAI,CAAC,IAAI;AAAA,YACP,GAAG,KAAK,SAAS,GAAG,CAAC;AAAA,YACrB,GAAG,KAAK,SAAS,GAAG,CAAC;AAAA,YACrB,GAAG,IAAI,IAAI,KAAK,QAAQ,GAAG,CAAC;AAAA,YAC5B,GAAG;AAAA,UACL;AAAA,QACF,WAAW,MAAM,GAAG;AAElB,WAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI,EAAE;AAAA,QAC1C,WAAW,MAAM,GAAG;AAClB,cAAI,CAAC,GAAG,EAAG,KAAI,CAAC;AAChB,cAAI,CAAC,IAAI,GAAG,EAAE,CAAC;AAAA,QACjB;AAAA,MACF;AACA,YAAM,CAAC,KAAK,KAAK,GAAG,IAAI,GAAG,IAAI;AAC/B,YAAM,KAAK,IAAI,MAAM,CAAC;AACtB,UAAI,CAAC,GAAI,KAAI,CAAC;AACd,UAAI,QAAQ,OAAO,KAAK,IAAI,IAAI,EAAE,IAAI,IAAI,GAAG,MAAM,QAAQ,GAAG,OAAO;AACrE,UAAI,OAAQ,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,IAAI,KAAK;AAC7E,aAAO,QAAQ,IAAI,MAAM;AACzB,UAAI,OAAQ,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,IAAI,KAAK;AAC7E,aAAO,QAAQ,IAAI,MAAM;AACzB,UAAI,OAAQ,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,IAAI,KAAK;AAC7E,WAAK,EAAE,IAAI,EAAE,MAAK;AAChB,cAAM,MAAM,IAAI,EAAE,GAAG;AACrB,cAAM,OAAO,IAAI,EAAE,GAAG;AACtB,cAAM,MAAM,IAAI,EAAE,GAAG;AACrB,cAAM,OAAO,IAAI,EAAE,GAAG;AACtB,cAAM,MAAM,IAAI,EAAE,GAAG;AACrB,cAAM,OAAO,IAAI,EAAE,GAAG;AAEtB,eAAO,QAAQ,QAAQ;AACvB,cAAM,MAAM,KAAK;AACjB,YAAI,MAAM,QAAS,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,IAAM,IAAI,MAAM,CAAC,KAAK,KAAO,IAAI,MAAM,CAAC,KAAK,SAAU,OAAO,KAAO,MAAM;AAC1H,eAAO,QAAQ,IAAI,GAAG,MAAM;AAC5B,YAAI,KAAK,KAAK,GAAG,MAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,IAAM,IAAI,MAAM,CAAC,KAAK,QAAS,OAAO,MAAQ,KAAK,IAAI,GAAG,KAAK;AACnH,eAAO,QAAQ,IAAI,GAAG,MAAM;AAC5B,cAAM,KAAK,KAAK,GAAG,MAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,IAAM,IAAI,MAAM,CAAC,KAAK,QAAS,OAAO,MAAQ,KAAK,IAAI,GAAG,KAAK;AAErH,eAAO,QAAQ,SAAS;AACxB,cAAM,IAAI,EAAE,GAAG,MAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,QAAQ;AACtF,eAAO,QAAQ,SAAS;AACxB,cAAM,IAAI,EAAE,GAAG,MAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,QAAQ;AACtF,eAAO,QAAQ,SAAS;AACxB,cAAM,IAAI,EAAE,GAAG,MAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,QAAQ;AAEtF,YAAI,MAAM,GAAG;AACX,aAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;AAChB,aAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;AAChB,aAAG,EAAE,CAAC,IAAI,OAAO;AAAA,QACnB,OAAO;AACL,gBAAM,MAAM,OAAQ,MAAM;AAC1B,cAAI,KAAK;AACP,kBAAM,OAAO,IAAI,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG,EAAE,GAAG;AACvC,gBAAI,MAAM,EAAG,IAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;AAC7B,eAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;AAChB,eAAG,EAAE,CAAC,IAAI;AAAA,UACZ,MAAO,OAAM,GAAG,EAAE,CAAC;AAAA,QACrB;AACA,iBAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,cAAI,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC;AAAA,QAC7B;AACA,gBAAQ,IAAI,OAAO;AACnB,YAAI,OAAO,OAAO;AAClB,YAAI,OAAO,GAAG;AACZ,cAAI,MAAM,CAAC;AACX,gBAAM,KAAK,GAAG,IAAI;AAClB,cAAI,MAAM,GAAI,OAAM;AACpB,mBAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,gBAAI,OAAO,CAAC,IAAI,GAAG,EAAE,KAAK,CAAC;AAAA,UAC7B;AACA,kBAAQ,KAAK,MAAM,KAAK,OAAO;AAAA,QACjC;AACA,iBAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,cAAI,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC;AAAA,QAC9B;AACA,gBAAQ;AAAA,MACV;AACA,UAAI,QAAQ,KAAK;AACf,eAAO,MAAM,IAAI,QAAQ;AACvB,cAAI,MAAM,IAAI,IAAI,KAAK;AAAA,QACzB;AAAA,MACF,MAAO,QAAO,IAAI;AAClB,UAAI,IAAK,IAAG,KAAK;AAAA,UACZ,OAAM,IAAI,KAAK,GAAG,IAAI;AAAA,IAC7B,WAAW,KAAK;AACd,SAAG,KAAK;AACR,UAAI,KAAK;AACP,iBAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,cAAI,CAAC,IAAI,IAAI,MAAM,CAAC;AAAA,QACtB;AAAA,MACF;AAAA,IACF,WAAW,IAAK,OAAM,IAAI,KAAK,GAAG;AAClC,OAAG,IAAI;AACP,WAAO;AAAA,EACT;AACA,MAAI,CAAC;AACP;AAGA,IAAM,MAAM,CAAC,MAAoB,OAAe;AAC9C,MAAI,KAAK,UAAU,EAAG,QAAO,KAAK,CAAC;AACnC,QAAM,MAAM,IAAI,GAAG,EAAE;AACrB,WAAS,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAC3C,UAAM,MAAM,KAAK,CAAC;AAClB,QAAI,IAAI,KAAK,CAAC;AACd,SAAK,IAAI;AAAA,EACX;AACA,SAAO;AACT;AAaO,SAAS,WAAW,KAAiB,KAAkB,KAAkB;AAC9E,QAAM,OAAqB,CAAC,GAAG,KAAK,CAAC,CAAC;AACtC,MAAI,KAAK,GAAG,KAAK;AACjB,SAAO,IAAI,UAAS;AAClB,UAAM,KAAK,KAAK,KAAK,MAAM,GAAG;AAC9B,QAAI,OAAO,MAAM,UAAU;AACzB,UAAI,GAAG,KAAK,CAAC,IAAK,KAAI,CAAC;AACvB,UAAI,IAAK,MAAK,KAAK,EAAE;AACrB,UAAI,IAAI;AACN,cAAM;AACN,YAAI,CAAC,OAAO,GAAG,EAAE,UAAU,GAAG,GAAG;AAC/B,eAAK,KAAK,MAAM,GAAG,CAAC;AACpB,gBAAM,GAAG;AAAA,QACX;AAAA,MACF,OAAO;AACL,aAAK,KAAK,GAAG;AACb,WAAG,IAAI;AAAA,MACT;AACA,aAAO,CAAC,GAAG,KAAI;AACb,cAAM,MAAM,IAAI,KAAK,IAAI,GAAG;AAC5B,YAAI,CAAC,IAAK,KAAI,CAAC;AACf,YAAI,IAAK,IAAG,IAAI,GAAG;AAAA,aACd;AACH,eAAK,KAAK,GAAG;AACb,gBAAM,IAAI;AACV,cAAI,GAAG,GAAG,GAAG,IAAI,MAAM;AACvB,aAAG,EAAE,IAAI,KAAK,GAAG,EAAE,SAAS,IAAI,MAAM;AAAA,QACxC;AAAA,MACF;AACA,WAAK,GAAG,IAAK,GAAG,IAAI;AAAA,IACtB,MAAO,MAAK;AACZ,UAAM,IAAI,SAAS,EAAE;AAAA,EACvB;AACA,SAAO,IAAI,MAAM,EAAE;AACrB;;;AClsBO,IAAM,cAAc;AAGpB,IAAM,cAAc,IAAI,WAAW;AAAA,EACxC;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AACF,CAAC;AAGM,IAAK,cAAL,kBAAKA,iBAAL;AACL,EAAAA,0BAAA,UAAO,KAAP;AACA,EAAAA,0BAAA,UAAO,KAAP;AAFU,SAAAA;AAAA,GAAA;AAML,IAAK,WAAL,kBAAKC,cAAL;AACL,EAAAA,oBAAA,cAAW,KAAX;AACA,EAAAA,oBAAA,cAAW,KAAX;AACA,EAAAA,oBAAA,gBAAa,KAAb;AACA,EAAAA,oBAAA,oBAAiB,KAAjB;AACA,EAAAA,oBAAA,WAAQ,KAAR;AACA,EAAAA,oBAAA,cAAW,KAAX;AANU,SAAAA;AAAA,GAAA;AAUL,IAAK,uBAAL,kBAAKC,0BAAL;AACL,EAAAA,4CAAA,UAAO,KAAP;AACA,EAAAA,4CAAA,UAAO,KAAP;AAFU,SAAAA;AAAA,GAAA;AAqBL,IAAM,mBAAN,cAA+B,MAAM;AAAA,EAC1C,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AASO,SAAS,YAAY,MAAkC;AAC5D,MAAI,KAAK,SAAS,aAAa;AAC7B,UAAM,IAAI;AAAA,MACR,uCAAuC,WAAW,eAAe,KAAK,MAAM;AAAA,IAC9E;AAAA,EACF;AAGA,QAAM,QAAQ,KAAK,MAAM,GAAG,EAAE;AAC9B,MAAI,CAAC,aAAa,OAAO,WAAW,GAAG;AACrC,UAAM,IAAI,iBAAiB,2CAA2C;AAAA,EACxE;AAGA,QAAM,sBAAsB,KAAK,MAAM,IAAI,EAAE;AAC7C,QAAM,iBAAiB,IAAI,YAAY,EACpC,OAAO,mBAAmB,EAC1B,QAAQ;AAGX,QAAM,kBAAkB,KAAK,EAAE;AAC/B,MACE,oBAAoB,gBACpB,oBAAoB,cACpB;AACA,UAAM,IAAI,iBAAiB,yBAAyB,eAAe,EAAE;AAAA,EACvE;AACA,QAAM,cAAc;AAGpB,QAAM,eAAe,KAAK,EAAE;AAC5B,MAAI,eAAe,KAAK,eAAe,GAAG;AACxC,UAAM,IAAI,iBAAiB,sBAAsB,YAAY,EAAE;AAAA,EACjE;AACA,QAAM,WAAW;AAGjB,QAAM,kBAAkB,KAAK,EAAE;AAC/B,MACE,oBAAoB,gBACpB,oBAAoB,cACpB;AACA,UAAM,IAAI;AAAA,MACR,kCAAkC,eAAe;AAAA,IACnD;AAAA,EACF;AACA,QAAM,cAAc;AAEpB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AASO,SAAS,iBACd,QACA,cACM;AACN,MAAI,OAAO,aAAa,cAAc;AACpC,UAAM,WAAW,SAAS,YAAY;AACtC,UAAM,SAAS,SAAS,OAAO,QAAQ;AACvC,UAAM,IAAI;AAAA,MACR,+BAA+B,QAAQ,SAAS,MAAM;AAAA,IACxD;AAAA,EACF;AACF;AAQO,SAAS,mBAAmB,MAA8B;AAC/D,SAAO,KAAK,MAAM,WAAW;AAC/B;AAGA,SAAS,aAAa,GAAe,GAAwB;AAC3D,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,QAAI,EAAE,CAAC,MAAM,EAAE,CAAC,EAAG,QAAO;AAAA,EAC5B;AACA,SAAO;AACT;;;AT5JA,IAAM,yBAAyB;AAoBxB,SAAS,UAAU,MAA8B;AAEtD,MAAI,KAAK,SAAS,aAAa;AAC7B,UAAM,IAAI;AAAA,MACR,wBAAwB,KAAK,MAAM,yBAAyB,WAAW;AAAA,IACzE;AAAA,EACF;AAGA,QAAM,SAAS,YAAY,IAAI;AAC/B,mBAAiB,wBAAyB;AAG1C,MAAI,SAAS,mBAAmB,IAAI;AACpC,MAAI,OAAO,8BAA2C;AACpD,aAAS,WAAW,MAAM;AAAA,EAC5B;AAGA,QAAM,KAAK,IAAI,WAAW,MAAM;AAChC,QAAM,OAAO,KAAQ,cAAc,EAAE;AACrC,QAAM,cAAc,KAAK,YAAY;AAErC,MAAI,gBAAgB,wBAAwB;AAC1C,UAAM,IAAI;AAAA,MACR,kCAAkC,WAAW,cAAc,sBAAsB;AAAA,IACnF;AAAA,EACF;AAEA,QAAM,kBAAkB,KAAK,gBAAgB;AAC7C,QAAM,yBAAyB,4BAA4B,IAAI;AAE/D,SAAO,EAAE,MAAM,aAAa,iBAAiB,uBAAuB;AACtE;AAcA,SAAS,4BAA4B,MAAoC;AACvE,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,cAAc,KAAK,YAAY;AACrC,MAAI,CAAC,eAAe,YAAY,WAAW,EAAG,QAAO;AAErD,MAAI;AACJ,MAAI;AACF,UAAMC,MAAK,YAAY,OAAO;AAAA,MAC5B,YAAY;AAAA,MACZ,YAAY,aAAa,YAAY;AAAA,IACvC;AACA,aAAqB,qBAASA,GAAE;AAAA,EAClC,QAAQ;AACN,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,SAAS,MAAM,EAAG,QAAO;AAC9B,QAAM,aAAa,OAAO;AAC1B,MAAI,CAAC,SAAS,UAAU,EAAG,QAAO;AAElC,aAAW,aAAa,OAAO,OAAO,UAAU,GAAG;AACjD,QAAI,CAAC,SAAS,SAAS,EAAG;AAC1B,UAAM,EAAE,MAAM,YAAY,UAAU,IAAI;AACxC,QAAI,OAAO,SAAS,YAAY,OAAO,cAAc,SAAU;AAC/D,WAAO,IAAI,MAAM,SAAS;AAAA,EAC5B;AAEA,SAAO;AACT;AAEA,SAAS,SAAS,OAAkD;AAClE,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;AAKA,SAAS,qBAAqB,QAAoB,QAA4B;AAC5E,QAAM,SAAS,KAAK,IAAI,OAAO,QAAQ,OAAO,MAAM;AAEpD,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,OAAO,CAAC,IAAI,OAAO,CAAC,EAAG,QAAO;AAClC,QAAI,OAAO,CAAC,IAAI,OAAO,CAAC,EAAG,QAAO;AAAA,EACpC;AAEA,SAAO,OAAO,SAAS,OAAO;AAChC;AAQA,SAAS,gBACP,YACA,UACA,QACA,MACmB;AACnB,QAAM,EAAE,gBAAgB,IAAI;AAC5B,MAAI,WAAW,EAAG,QAAO;AAGzB,QAAM,cAAc,IAAI,YAAY,EAAE,OAAO,IAAI;AAEjD,MAAI,MAAM;AACV,MAAI,OAAO,SAAS;AAEpB,SAAO,OAAO,MAAM;AAClB,UAAM,MAAO,MAAM,SAAU;AAC7B,UAAM,WAAW,SAAS,GAAG;AAE7B,QAAI,CAAC,UAAU;AACb,YAAM,IAAI,MAAM,gDAAgD,GAAG,EAAE;AAAA,IACvE;AAEA,UAAM,UAAU,SAAS,KAAK;AAC9B,QAAI,YAAY,MAAM;AACpB,YAAM,IAAI,MAAM,+CAA+C,GAAG,EAAE;AAAA,IACtE;AAEA,UAAM,eAAe,IAAI,YAAY,EAAE,OAAO,OAAO;AACrD,UAAM,MAAM,qBAAqB,cAAc,WAAW;AAE1D,QAAI,MAAM,GAAG;AACX,YAAM,MAAM;AAAA,IACd,WAAW,MAAM,GAAG;AAClB,aAAO,MAAM;AAAA,IACf,OAAO;AAEL,YAAM,gBAAgB,SAAS,cAAc;AAE7C,UAAI,iBAAiB,iBAAiB;AACpC,cAAM,IAAI;AAAA,UACR,0BAA0B,aAAa,aAAa,IAAI,0BAC/B,eAAe;AAAA,QAC1C;AAAA,MACF;AAEA,aAAO,qBAAqB,YAAY,aAAa;AAAA,IACvD;AAAA,EACF;AAEA,SAAO;AACT;AAOA,SAAS,qBACP,YACA,OACY;AACZ,QAAM,eAAe,WAAW,KAAK,UAAU,KAAK;AACpD,MAAI,CAAC,cAAc;AACjB,UAAM,IAAI,MAAM,+CAA+C,KAAK,EAAE;AAAA,EACxE;AAEA,QAAM,QAAQ,aAAa,GAAG;AAC9B,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,MAAM,iCAAiC,KAAK,aAAa;AAAA,EACrE;AAEA,SAAO,MAAM,GAAI,MAAM,EAAE,MAAM,MAAM,QAAQ,MAAM,SAAS,EAAE;AAChE;AAOA,SAAS,SACP,UACA,QACU;AACV,QAAM,QAAkB,CAAC;AAEzB,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAM,WAAW,SAAS,CAAC;AAC3B,QAAI,CAAC,UAAU;AACb,YAAM,IAAI,MAAM,gDAAgD,CAAC,EAAE;AAAA,IACrE;AACA,UAAM,OAAO,SAAS,KAAK;AAC3B,QAAI,SAAS,MAAM;AACjB,YAAM,IAAI,MAAM,+CAA+C,CAAC,EAAE;AAAA,IACpE;AACA,UAAM,KAAK,IAAI;AAAA,EACjB;AAEA,SAAO;AACT;AAOO,SAAS,cACd,YACA,MACmB;AACnB,QAAM,EAAE,KAAK,IAAI;AACjB,SAAO;AAAA,IACL;AAAA,IACA,CAAC,MAAM,KAAK,SAAS,CAAC;AAAA,IACtB,KAAK,eAAe;AAAA,IACpB;AAAA,EACF;AACF;AAOO,SAAS,WACd,YACA,MACmB;AACnB,QAAM,EAAE,KAAK,IAAI;AACjB,SAAO;AAAA,IACL;AAAA,IACA,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,IAClB,KAAK,WAAW;AAAA,IAChB;AAAA,EACF;AACF;AAOO,SAAS,qBAAqB,YAAkC;AACrE,QAAM,EAAE,KAAK,IAAI;AACjB,SAAO,SAAS,CAAC,MAAM,KAAK,SAAS,CAAC,GAAG,KAAK,eAAe,CAAC;AAChE;AASO,SAAS,iBAAiB,YAAkC;AACjE,QAAM,EAAE,KAAK,IAAI;AACjB,SAAO,SAAS,CAAC,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,WAAW,CAAC;AACxD;;;AUrSO,IAAM,WAAN,MAAqB;AAAA,EAClB;AAAA,EACS;AAAA,EAEjB,YAAY,SAAiB;AAC3B,SAAK,QAAQ,oBAAI,IAAI;AACrB,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,IAAI,KAAuB;AACzB,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAChC,QAAI,UAAU,QAAW;AAEvB,WAAK,MAAM,OAAO,GAAG;AACrB,WAAK,MAAM,IAAI,KAAK,KAAK;AAAA,IAC3B;AACA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,KAAQ,OAAgB;AAC1B,QAAI,KAAK,WAAW,EAAG;AAEvB,QAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACvB,WAAK,MAAM,OAAO,GAAG;AAAA,IACvB;AAGA,QAAI,KAAK,MAAM,QAAQ,KAAK,SAAS;AACnC,YAAM,YAAY,KAAK,MAAM,KAAK,EAAE,KAAK,EAAE;AAC3C,UAAI,cAAc,QAAW;AAC3B,aAAK,MAAM,OAAO,SAAS;AAAA,MAC7B;AAAA,IACF;AAEA,SAAK,MAAM,IAAI,KAAK,KAAK;AAAA,EAC3B;AAAA,EAEA,IAAI,KAAiB;AACnB,WAAO,KAAK,MAAM,IAAI,GAAG;AAAA,EAC3B;AAAA,EAEA,OAAO,KAAiB;AACtB,WAAO,KAAK,MAAM,OAAO,GAAG;AAAA,EAC9B;AAAA,EAEA,QAAc;AACZ,SAAK,MAAM,MAAM;AAAA,EACnB;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK,MAAM;AAAA,EACpB;AACF;;;ACVO,SAAS,aAAmB,OAA4C;AAC7E,QAAM,UAAU,oBAAI,IAAmB;AAEvC,SAAO;AAAA,IACL,KACE,KACA,SACA,QACY;AAGZ,UAAI,QAAQ,QAAS,QAAO,QAAQ,OAAO,eAAe,CAAC;AAE3D,YAAM,MAAM,MAAM,IAAI,GAAG;AACzB,UAAI,QAAQ,OAAW,QAAO,QAAQ,QAAQ,GAAG;AAEjD,UAAI,QAAQ,QAAQ,IAAI,GAAG;AAC3B,UAAI,CAAC,OAAO;AACV,cAAM,aAAa,IAAI,gBAAgB;AACvC,cAAM,UAAU,cAAc,SAAS,WAAW,MAAM,EACrD,KAAK,CAAC,UAAU;AACf,gBAAM,IAAI,KAAK,KAAK;AACpB,iBAAO;AAAA,QACT,CAAC,EACA,QAAQ,MAAM;AACb,cAAI,QAAQ,IAAI,GAAG,GAAG,YAAY,QAAS,SAAQ,OAAO,GAAG;AAAA,QAC/D,CAAC;AACH,cAAM,QAAoB,EAAE,SAAS,YAAY,UAAU,EAAE;AAC7D,gBAAQ,IAAI,KAAK,KAAK;AACtB,gBAAQ;AAAA,MACV;AACA,YAAM,QAAQ;AACd,YAAM;AAEN,YAAM,UAAU,MAAM;AACpB,cAAM;AACN,YAAI,MAAM,WAAW,EAAG;AAMxB,YAAI,QAAQ,IAAI,GAAG,MAAM,OAAO;AAC9B,kBAAQ,OAAO,GAAG;AAClB,gBAAM,WAAW,MAAM;AAAA,QACzB;AAAA,MACF;AAEA,UAAI,CAAC,QAAQ;AACX,eAAO,MAAM,QAAQ;AAAA,UACnB,CAAC,UAAU;AACT,oBAAQ;AACR,mBAAO;AAAA,UACT;AAAA,UACA,CAAC,UAAU;AACT,oBAAQ;AACR,kBAAM;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAEA,aAAO,IAAI,QAAW,CAAC,SAAS,WAAW;AACzC,YAAI,OAAO;AAGX,cAAM,SAAS,MAAe;AAC5B,cAAI,KAAM,QAAO;AACjB,iBAAO;AACP,iBAAO,oBAAoB,SAAS,WAAW;AAC/C,kBAAQ;AACR,iBAAO;AAAA,QACT;AACA,cAAM,cAAc,MAAM;AACxB,cAAI,OAAO,EAAG,QAAO,eAAe,CAAC;AAAA,QACvC;AACA,eAAO,iBAAiB,SAAS,aAAa,EAAE,MAAM,KAAK,CAAC;AAC5D,cAAM,QAAQ;AAAA,UACZ,CAAC,UAAU;AACT,gBAAI,OAAO,EAAG,SAAQ,KAAK;AAAA,UAC7B;AAAA,UACA,CAAC,UAAU;AACT,gBAAI,OAAO,EAAG,QAAO,KAAK;AAAA,UAC5B;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAMA,SAAS,cACP,SACA,QACY;AACZ,MAAI;AACF,WAAO,QAAQ,MAAM;AAAA,EACvB,SAAS,OAAO;AACd,WAAO,QAAQ,OAAO,KAAK;AAAA,EAC7B;AACF;AAEA,SAAS,iBAAwB;AAC/B,SAAO,IAAI,aAAa,8BAA8B,YAAY;AACpE;;;ACpIO,SAAS,aAAa,OAA+B;AAC1D,MAAI,MAAM,WAAW,IAAI;AACvB,UAAM,IAAI;AAAA,MACR,8CAA8C,MAAM,MAAM;AAAA,IAC5D;AAAA,EACF;AACA,SAAO;AACT;AAMO,SAAS,YAAY,OAA8B;AACxD,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,MAAM,4CAA4C,MAAM,MAAM,EAAE;AAAA,EAC5E;AACA,SAAO;AACT;;;AChCA,SAAS,cAAAC,mBAAkB;;;ACApB,IAAM,mBAAN,MAAuB;AAAA,EAC5B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA8C;AAC9D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,GAAG,KAAqC;AACtC,YAAQ,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,QAAQ,KAAK,EAAG;AAAA,EAC/D;AAAA,EAEA,YAAoB;AAClB,WAAO,KAAK,GAAI,WAAW,KAAK,SAAS,EAAE;AAAA,EAC7C;AAAA,EAEA,eAAuB;AACrB,WAAO,KAAK,GAAI,WAAW,KAAK,SAAS,EAAE;AAAA,EAC7C;AAAA,EAEA,OAAO,SAAiB;AACtB,WAAO;AAAA,EACT;AACF;;;ACxBO,IAAM,qBAAN,MAAM,oBAAmB;AAAA,EAC9B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAgD;AAChE,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,4BACL,IACA,KACoB;AACpB,YAAQ,OAAO,IAAI,oBAAmB,GAAG;AAAA,MACvC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,GAAG,KAAqC;AACtC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,YAAoB;AAClB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI;AAAA,EAC9D;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;AC5DO,IAAM,gBAAN,MAAM,eAAc;AAAA,EACzB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA2C;AAC3D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,uBACL,IACA,KACe;AACf,YAAQ,OAAO,IAAI,eAAc,GAAG;AAAA,MAClC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAIA,KAAK,kBAAoD;AACvD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AACF;;;AC3BO,IAAM,iBAAN,MAAqB;AAAA,EAC1B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA4C;AAC5D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,cAAsB;AACpB,WAAO,KAAK,GAAI,WAAW,KAAK,MAAM;AAAA,EACxC;AAAA,EAEA,cAAsB;AACpB,WAAO,KAAK,GAAI,WAAW,KAAK,SAAS,CAAC;AAAA,EAC5C;AAAA,EAEA,OAAO,SAAiB;AACtB,WAAO;AAAA,EACT;AACF;;;ACpBO,IAAM,mBAAN,MAAM,kBAAiB;AAAA,EAC5B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA8C;AAC9D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,0BACL,IACA,KACkB;AAClB,YAAQ,OAAO,IAAI,kBAAiB,GAAG;AAAA,MACrC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAEA,YAAoB;AAClB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI;AAAA,EAC9D;AACF;;;AC5BO,IAAM,kBAAN,MAAsB;AAAA,EAC3B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA6C;AAC7D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAe;AACb,WAAO,KAAK,GAAI,WAAW,KAAK,MAAM;AAAA,EACxC;AAAA,EAEA,KAAa;AACX,WAAO,KAAK,GAAI,WAAW,KAAK,SAAS,CAAC;AAAA,EAC5C;AAAA,EAEA,OAAO,SAAiB;AACtB,WAAO;AAAA,EACT;AACF;;;ACjBO,IAAM,cAAN,MAAM,aAAY;AAAA,EACvB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAyC;AACzD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,qBACL,IACA,KACa;AACb,YAAQ,OAAO,IAAI,aAAY,GAAG;AAAA,MAChC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,SAAS,KAAqC;AAC5C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,QAAQ,OAAe,KAA+C;AACpE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,gBAAgB,GAAG;AAAA,MAC7B,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,gBAAwB;AACtB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AACF;;;ACtCO,IAAM,gBAAN,MAAM,eAAc;AAAA,EACzB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA2C;AAC3D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,uBACL,IACA,KACe;AACf,YAAQ,OAAO,IAAI,eAAc,GAAG;AAAA,MAClC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,OAAe,KAA6C;AAChE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,eAAe,GAAG;AAAA,MAC5B,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,eAAe,OAAe,KAA2C;AACvE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,cAAc,GAAG;AAAA,MAC3B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,uBAA+B;AAC7B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,UAAU,OAAe,KAAuC;AAC9D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,YAAY,GAAG;AAAA,MACzB,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,kBAA0B;AACxB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,QAAQ,OAAe,KAAiD;AACtE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,iBAAiB,GAAG;AAAA,MAC9B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,gBAAwB;AACtB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AACF;;;ACzFO,IAAM,YAAN,MAAgB;AAAA,EACrB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAuC;AACvD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,OAA8B;AAClC,WAAO,KAAK,GAAI,UAAU,KAAK,SAAS,IAAI,KAAK;AAAA,EACnD;AAAA,EAEA,OAAO,SAAiB;AACtB,WAAO;AAAA,EACT;AACF;;;ACbO,IAAM,eAAN,MAAM,cAAa;AAAA,EACxB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA0C;AAC1D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,sBACL,IACA,KACc;AACd,YAAQ,OAAO,IAAI,cAAa,GAAG;AAAA,MACjC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,GAAG,KAAmC;AACpC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,UAAU,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC9D;AAAA,EACN;AAAA,EAIA,KAAK,kBAAoD;AACvD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,SAAS,OAA8B;AACrC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,iBAAyB;AACvB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,gBAAmC;AACjC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,eAAyB;AACvB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM;AAAA,EACzD;AAAA,EAEA,SAAS,KAAsB;AAC7B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,QAAQ,KAAK,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;ACvFO,IAAM,WAAN,MAAM,UAAS;AAAA,EACpB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAsC;AACtD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,kBACL,IACA,KACU;AACV,YAAQ,OAAO,IAAI,UAAS,GAAG;AAAA,MAC7B,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,GAAG,KAAqC;AACtC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,SAAS,KAAqC;AAC5C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,MAAM,OAAe,KAAyC;AAC5D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,aAAa,GAAG;AAAA,MAC1B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,YAAoB;AAClB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAIA,QAAQ,kBAAoD;AAC1D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,SAAS,OAAe,KAAyC;AAC/D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,aAAa,GAAG;AAAA,MAC1B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,iBAAyB;AACvB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cACE,OACA,KACyB;AACzB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,iBAAiB,GAAG;AAAA,MAC9B,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,gBACE,OACA,KAC2B;AAC3B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,mBAAmB,GAAG;AAAA,MAChC,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,wBAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;AX5HA,SAAS,SAAS,IAAgB,OAA2B;AAC3D,SAAO,GAAG,MAAM,EAAE,MAAM,OAAO,QAAQ,EAAE;AAC3C;AAGA,SAAS,QAAQ,IAAgB,OAA2B;AAC1D,SAAO,GAAG,MAAM,EAAE,MAAM,OAAO,QAAQ,CAAC;AAC1C;AAGO,SAAS,cAAc,MAA4B;AACxD,QAAM,KAAK,IAAIC,YAAW,IAAI;AAC9B,QAAM,cAAc,SAAY,kBAAkB,EAAE;AAGpD,QAAM,QAAQ,YAAY,GAAG;AAC7B,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,oCAAoC;AAChE,QAAM,KAAK,aAAa,SAAS,MAAM,IAAK,MAAM,MAAM,CAAC;AAGzD,QAAM,cAAc,YAAY,SAAS;AACzC,QAAM,WAAW,cACb,aAAa,SAAS,YAAY,IAAK,YAAY,MAAM,CAAC,IAC1D;AAGJ,QAAM,cAAc,YAAY,YAAY;AAC5C,QAAM,QAAwB,CAAC;AAC/B,WAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,UAAM,UAAU,YAAY,MAAM,CAAC;AACnC,QAAI,SAAS;AACX,YAAM,KAAK,kBAAkB,OAAO,CAAC;AAAA,IACvC;AAAA,EACF;AAGA,QAAM,YAAY,YAAY,UAAU;AAGxC,QAAM,UAAU,YAAY,QAAQ,KAAK;AAGzC,QAAM,iBAAiB,YAAY,eAAe;AAClD,QAAM,WAA2B,CAAC;AAClC,WAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,UAAM,UAAU,YAAY,SAAS,CAAC;AACtC,QAAI,SAAS;AACX,YAAM,OAAO,QAAQ,KAAK;AAC1B,YAAM,QAAQ,QAAQ,WAAW;AACjC,UAAI,QAAQ,OAAO;AACjB,iBAAS,KAAK,EAAE,MAAM,OAAO,IAAI,WAAW,KAAK,EAAE,CAAC;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAGA,QAAM,gBAAoC,CAAC;AAC3C,QAAM,WAAW,YAAY,sBAAsB;AACnD,MAAI,WAAW,GAAG;AAChB,aAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,YAAM,SAAS,YAAY,gBAAgB,CAAC;AAC5C,UAAI,QAAQ;AACV,cAAM,WAAW,OAAO,GAAG;AAC3B,YAAI,CAAC,SAAU,OAAM,IAAI,MAAM,+BAA+B;AAC9D,sBAAc,KAAK;AAAA,UACjB,IAAI,aAAa,SAAS,SAAS,IAAK,SAAS,MAAM,CAAC;AAAA,UACxD,WAAW,OAAO,OAAO,UAAU,CAAC;AAAA,UACpC,cAAc,OAAO,aAAa;AAAA,QACpC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,OAAO;AACL,UAAM,WAAW,YAAY,oBAAoB;AACjD,aAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,YAAM,SAAS,YAAY,cAAc,CAAC;AAC1C,UAAI,QAAQ;AACV,cAAM,WAAW,OAAO,GAAG;AAC3B,YAAI,CAAC,SAAU,OAAM,IAAI,MAAM,6BAA6B;AAC5D,sBAAc,KAAK;AAAA,UACjB,IAAI,aAAa,SAAS,SAAS,IAAK,SAAS,MAAM,CAAC;AAAA,UACxD,WAAW,OAAO,OAAO,UAAU,CAAC;AAAA,UACpC,cAAc,OAAO,aAAa;AAAA,QACpC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,kBAAkB,SAAwC;AAEjE,QAAM,QAAQ,QAAQ,GAAG;AACzB,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,wCAAwC;AACpE,QAAM,KAAK,YAAY,QAAQ,MAAM,IAAK,MAAM,MAAM,CAAC;AAGvD,QAAM,OAAO,QAAQ,KAAK,KAAK;AAG/B,QAAM,WAAW,QAAQ,cAAc,KAAK,IAAI,WAAW,CAAC;AAG5D,QAAM,eAAe,QAAQ,aAAa;AAC1C,QAAM,WAAW,cAAc,SAAS,YAAY;AAEpD,SAAO,EAAE,IAAI,MAAM,UAAU,SAAS;AACxC;AAEA,SAAS,cACP,SACA,WACU;AACV,MACE,8BACA,6BACA;AACA,WAAO,EAAE,MAAM,QAAQ;AAAA,EACzB;AAEA,MAAI,6BAAqC;AACvC,UAAM,YAAY,QAAQ,SAAS,IAAI,cAAiB,CAAC;AACzD,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MAAM,uCAAuC;AAAA,IACzD;AACA,WAAO,mBAAmB,SAA6B;AAAA,EACzD;AAEA,QAAM,IAAI,MAAM,iCAAiC,SAAS,EAAE;AAC9D;AAEA,SAAS,mBAAmB,UAA2C;AAErE,QAAM,QAA0B,CAAC;AACjC,QAAM,gBAAgB,SAAS,cAAc;AAC7C,MAAI,gBAAgB,GAAG;AACrB,aAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,YAAM,WAAW,SAAS,QAAQ,CAAC;AACnC,UAAI,UAAU;AACZ,cAAM,cAAc,OAAO,SAAS,YAAY,CAAC;AACjD,cAAM,YAAY,SAAS,UAAU;AACrC,cAAM,KAAK;AAAA,UACT;AAAA,UACA,aAAa,YAAY,IAAI,KAAK,KAAK,cAAc,SAAS,IAAI;AAAA,UAClE;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,OAAO;AACL,UAAM,cAAc,SAAS,YAAY;AACzC,aAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,YAAM,WAAW,SAAS,MAAM,CAAC;AACjC,UAAI,UAAU;AACZ,cAAM,KAAK;AAAA,UACT,aAAa,OAAO,SAAS,YAAY,CAAC;AAAA,UAC1C,aAAa,OAAO,SAAS,YAAY,CAAC;AAAA,QAC5C,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAGA,QAAM,iBAAiB,SAAS,qBAAqB;AACrD,QAAM,iBAAoC,CAAC;AAC3C,WAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,UAAM,aAAa,SAAS,eAAe,CAAC;AAC5C,QAAI,YAAY;AACd,qBAAe,KAAK,WAAW,KAAK,CAAC;AAAA,IACvC,OAAO;AACL,qBAAe,KAAK,IAAI;AAAA,IAC1B;AAAA,EACF;AAGA,QAAM,kBAAkB,SAAS,gBAAgB;AACjD,QAAM,YAA2B,CAAC;AAClC,WAAS,IAAI,GAAG,IAAI,iBAAiB,KAAK;AACxC,UAAM,cAAc,SAAS,UAAU,CAAC;AACxC,QAAI,aAAa;AACf,gBAAU,KAAK,iBAAiB,WAAW,CAAC;AAAA,IAC9C;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,QAAqC;AAE7D,QAAM,cAAc,OAAO,SAAS;AACpC,MAAI,CAAC,YAAa,OAAM,IAAI,MAAM,+BAA+B;AACjE,QAAM,WAAW,aAAa,SAAS,YAAY,IAAK,YAAY,MAAM,CAAC;AAG3E,QAAM,gBAAgB,OAAO,cAAc;AAC3C,QAAM,UAA6B,CAAC;AACpC,WAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,UAAM,YAAY,OAAO,QAAQ,CAAC;AAClC,QAAI,WAAW;AACb,cAAQ,KAAK,EAAE,MAAM,UAAU,KAAK,GAAG,IAAI,UAAU,GAAG,EAAE,CAAC;AAAA,IAC7D;AAAA,EACF;AAEA,SAAO,EAAE,UAAU,QAAQ;AAC7B;;;AY7OA,SAAS,cAAAC,mBAAkB;;;ACApB,IAAM,WAAN,MAAM,UAAS;AAAA,EACpB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAsC;AACtD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,kBACL,IACA,KACU;AACV,YAAQ,OAAO,IAAI,UAAS,GAAG;AAAA,MAC7B,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,WAAW,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ,CAAC,IACvE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAiC;AAC/B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,OAAO,OAA8B;AACnC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAiC;AAC/B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,SAAiB;AACf,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAEA,SAAiB;AACf,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAEA,QAAQ,KAAqC;AAC3C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAIA,SAAS,kBAAoD;AAC3D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAMA,aAAa,kBAAoD;AAC/D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,uBAA+B;AAC7B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI;AAAA,EAC9D;AAAA,EAEA,mBAAmB,OAA8B;AAC/C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,2BAAmC;AACjC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,0BAA6C;AAC3C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;ACvJO,IAAM,gBAAN,MAAM,eAAc;AAAA,EACzB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA2C;AAC3D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,uBACL,IACA,KACe;AACf,YAAQ,OAAO,IAAI,eAAc,GAAG;AAAA,MAClC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,OAAO,KAAmC;AACxC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,UAAU,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC9D;AAAA,EACN;AAAA,EAEA,KAAK,OAAe,KAAiC;AACnD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,SAAS,GAAG;AAAA,MACtB,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,aAAqB;AACnB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;ACjEO,IAAM,WAAN,MAAM,UAAS;AAAA,EACpB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAsC;AACtD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,kBACL,IACA,KACU;AACV,YAAQ,OAAO,IAAI,UAAS,GAAG;AAAA,MAC7B,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,GAAG,KAAqC;AACtC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,OAAO,OAAe,KAA2C;AAC/D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,cAAc,GAAG;AAAA,MAC3B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,mBAAmB,OAA8B;AAC/C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,2BAAmC;AACjC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,0BAA6C;AAC3C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,uBAA+B;AAC7B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM,IAAI;AAAA,EAC7D;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;AH9EA,IAAM,4BAA4B;AAIlC,IAAM,iCAAiC;AAiBvC,SAAS,mBAAmB,OAA2B;AAErD,MACE,MAAM,SAAS,KACf,MAAM,CAAC,MAAM,MACb,MAAM,CAAC,MAAM,OACb,MAAM,CAAC,MAAM,MACb,MAAM,CAAC,MAAM,KACb;AACA,WAAO;AAAA,EACT;AACA,QAAM,MAAM,MAAM,CAAC;AACnB,QAAM,gBAAiB,OAAO,IAAK;AACnC,QAAM,kBAAmB,OAAO,IAAK;AACrC,QAAM,aAAa,MAAM;AACzB,QAAM,kBAAkB,OAAO;AAE/B,MAAI,MAAM;AACV,MAAI,aAAa;AACjB,MAAI,CAAC,eAAe;AAClB,QAAI,OAAO,MAAM,OAAQ,QAAO;AAChC,UAAM,KAAK,MAAM,KAAK;AAItB,UAAM,OAAO,MAAM,MAAM,MAAM;AAC/B,iBAAa,OAAQ,OAAO,KAAM,KAAK;AAAA,EACzC;AACA,SAAO,eAAe,IAAI,IAAI;AAG9B,QAAM,WAAW,kBAAkB,KAAK,kBAAkB;AAC1D,MAAI,cAAc;AAClB,MAAI,UAAU;AACZ,QAAI,MAAM,WAAW,MAAM,OAAQ,QAAO;AAC1C,aAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,qBAAe,MAAM,MAAM,CAAC,IAAI,MAAM,IAAI;AAAA,IAC5C;AACA,QAAI,oBAAoB,EAAG,gBAAe;AAC1C,QAAI,cAAe,cAAa;AAAA,EAClC;AACA,SAAO;AAaP,MAAI,cAAc;AAClB,aAAS;AACP,QAAI,MAAM,IAAI,MAAM,OAAQ,QAAO;AACnC,UAAM,cACJ,MAAM,GAAG,IAAK,MAAM,MAAM,CAAC,KAAK,IAAM,MAAM,MAAM,CAAC,KAAK;AAC1D,WAAO;AACP,UAAM,YAAY,cAAc;AAChC,UAAM,YAAa,eAAe,IAAK;AACvC,UAAM,YAAY,eAAe;AACjC,QAAI,cAAc,EAAG,QAAO;AAC5B,QAAI,cAAc,GAAG;AAEnB,qBAAe;AACf,aAAO;AAAA,IACT,OAAO;AAGL,qBAAe,cAAc,IAAI,YAAY,KAAK,IAAI,YAAY,MAAM;AACxE,aAAO;AAAA,IACT;AACA,QAAI,MAAM,MAAM,OAAQ,QAAO;AAC/B,QAAI,UAAW;AAAA,EACjB;AACA,MAAI,gBAAiB,QAAO;AAC5B,MAAI,QAAQ,MAAM,OAAQ,QAAO;AAIjC,SAAO,KAAK,IAAI,eAAe,YAAY,WAAW;AACxD;AAUO,SAAS,cAAc,MAA4B;AACxD,QAAM,KAAK,IAAIC,YAAW,IAAI;AAC9B,QAAM,cAAc,SAAY,kBAAkB,EAAE;AAGpD,QAAM,QAAQ,YAAY,GAAG;AAC7B,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,oCAAoC;AAChE,QAAM,KAAK;AAAA,IACT,MAAM,GAAI,MAAM,EAAE,MAAM,MAAM,QAAQ,MAAM,SAAS,EAAE;AAAA,EACzD;AAGA,QAAM,iBAAiB,oBAAoB,WAAW;AAGtD,QAAM,eAAe,YAAY,aAAa;AAC9C,QAAM,SAA0B,CAAC;AACjC,WAAS,IAAI,GAAG,IAAI,cAAc,KAAK;AACrC,UAAM,WAAW,YAAY,OAAO,CAAC;AACrC,QAAI,UAAU;AACZ,aAAO,KAAK,mBAAmB,UAAU,cAAc,CAAC;AAAA,IAC1D;AAAA,EACF;AAEA,SAAO,EAAE,IAAI,OAAO;AACtB;AAkBA,SAAS,oBAAoB,aAA2C;AACtE,QAAM,aACJ,YAAY,qBAAqB,MAAM,4BACnC,YAAY,wBAAwB,IACpC;AAEN,QAAM,cAAc,IAAI,YAAY,SAAS,EAAE,OAAO,KAAK,CAAC;AAC5D,SAAO,CAAC,eAAmC;AACzC,QAAI,CAAC,YAAY;AACf,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAIA,QAAI,mBAAmB,UAAU,IAAI,gCAAgC;AACnE,YAAM,IAAI;AAAA,QACR,4CAA4C,8BAA8B;AAAA,MAC5E;AAAA,IACF;AACA,UAAM,eAAe,WAAW,YAAY,QAAW,UAAU;AACjE,QAAI,aAAa,SAAS,gCAAgC;AACxD,YAAM,IAAI;AAAA,QACR,iCAAiC,8BAA8B;AAAA,MACjE;AAAA,IACF;AACA,WAAO,YAAY,OAAO,YAAY;AAAA,EACxC;AACF;AAEA,SAAS,mBACP,UACA,gBACe;AAEf,QAAM,YAAY,SAAS,OAAO;AAClC,MAAI,CAAC;AACH,UAAM,IAAI,MAAM,8CAA8C;AAChE,QAAM,SAAS;AAAA,IACb,UAAU,GAAI,MAAM,EAAE,MAAM,UAAU,QAAQ,UAAU,SAAS,CAAC;AAAA,EACpE;AAGA,QAAM,aAAa,SAAS,WAAW;AACvC,QAAM,OAAmB,CAAC;AAC1B,WAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,UAAM,SAAS,SAAS,KAAK,CAAC;AAC9B,QAAI,QAAQ;AACV,WAAK,KAAK,cAAc,QAAQ,cAAc,CAAC;AAAA,IACjD;AAAA,EACF;AAEA,SAAO,EAAE,QAAQ,KAAK;AACxB;AAEA,SAAS,cACP,QACA,gBACU;AAEV,QAAM,cAAc,OAAO,YAAY;AACvC,QAAM,QAAkB,CAAC;AACzB,WAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,UAAM,KAAK,OAAO,MAAM,CAAC,CAAE;AAAA,EAC7B;AAGA,QAAM,aAAa,OAAO,YAAY;AACtC,QAAM,SAAS,aAAa,IAAI,WAAW,UAAU,IAAI;AAGzD,QAAM,SAAS,OAAO,OAAO,OAAO,CAAC;AACrC,QAAM,SAAS,OAAO,OAAO,OAAO,CAAC;AAGrC,QAAM,aAAa,OAAO,QAAQ;AAClC,QAAM,UAAU,aACZ;AAAA,IACE,WAAW,GAAI,MAAM,EAAE,MAAM,WAAW,QAAQ,WAAW,SAAS,EAAE;AAAA,EACxE,IACA;AAGJ,QAAM,eAAe,OAAO,aAAa;AACzC,QAAM,uBAAuB,OAAO,qBAAqB;AAEzD,QAAM,MAAgB;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,OAAO,SAAS;AAAA,IAC1B;AAAA,IACA;AAAA,EACF;AAUA,MAAI,YAAY,MAAM;AACpB,UAAM,aAAa,OAAO,wBAAwB;AAClD,QAAI,YAAY;AACd,UAAI,UAAyB;AAC7B,UAAI,WAAW;AACf,aAAO,eAAe,KAAK,YAAY;AAAA,QACrC,cAAc;AAAA,QACd,YAAY;AAAA,QACZ,MAAM;AACJ,cAAI,CAAC,UAAU;AACb,sBAAU,eAAe,UAAU;AACnC,uBAAW;AAAA,UACb;AACA,iBAAO;AAAA,QACT;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAOO,SAAS,aACd,UACA,QACA,QACiB;AAEjB,QAAM,gBAAgB,0BAA0B,SAAS,QAAQ,MAAM;AAEvE,MAAI,CAAC,cAAe,QAAO;AAG3B,SAAO,qBAAqB,cAAc,MAAM,MAAM;AACxD;AAGA,SAAS,0BACP,QACA,QACsB;AACtB,MAAI,MAAM;AACV,MAAI,OAAO,OAAO,SAAS;AAE3B,SAAO,OAAO,MAAM;AAClB,UAAM,MAAM,KAAK,OAAO,MAAM,QAAQ,CAAC;AACvC,UAAM,MAAM,aAAa,OAAO,GAAG,EAAE,QAAQ,MAAM;AAEnD,QAAI,QAAQ,GAAG;AACb,aAAO,OAAO,GAAG;AAAA,IACnB,WAAW,MAAM,GAAG;AAClB,YAAM,MAAM;AAAA,IACd,OAAO;AACL,aAAO,MAAM;AAAA,IACf;AAAA,EACF;AAEA,SAAO;AACT;AAGA,SAAS,aAAa,GAAe,GAAuB;AAC1D,QAAM,SAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AAC1C,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,EAAE,CAAC,MAAM,EAAE,CAAC,EAAG,QAAO,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,EACtC;AACA,SAAO,EAAE,SAAS,EAAE;AACtB;AAGA,SAAS,cAAc,GAAa,GAAqB;AACvD,QAAM,SAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AAC1C,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,EAAE,CAAC,MAAM,EAAE,CAAC,EAAG,QAAO,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,EACtC;AACA,SAAO,EAAE,SAAS,EAAE;AACtB;AAGA,SAAS,qBACP,MACA,QACiB;AACjB,MAAI,MAAM;AACV,MAAI,OAAO,KAAK,SAAS;AAEzB,SAAO,OAAO,MAAM;AAClB,UAAM,MAAM,KAAK,OAAO,MAAM,QAAQ,CAAC;AACvC,UAAM,MAAM,cAAc,KAAK,GAAG,EAAE,OAAO,MAAM;AAEjD,QAAI,QAAQ,GAAG;AACb,aAAO,KAAK,GAAG;AAAA,IACjB,WAAW,MAAM,GAAG;AAClB,YAAM,MAAM;AAAA,IACd,OAAO;AACL,aAAO,MAAM;AAAA,IACf;AAAA,EACF;AAEA,SAAO;AACT;AASO,SAAS,gBAAgB,KAA6B;AAC3D,MAAI,IAAI,YAAY,MAAM;AACxB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,SAAS,IAAI;AAAA,MACb,QAAQ,IAAI;AAAA,MACZ,QAAQ,IAAI;AAAA,IACd;AAAA,EACF;AAEA,MAAI,IAAI,aAAa,MAAM;AACzB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,UAAU,IAAI;AAAA,MACd,QAAQ,IAAI;AAAA,MACZ,QAAQ,IAAI;AAAA,MACZ,cAAc,IAAI;AAAA,MAClB,sBAAsB,IAAI;AAAA,IAC5B;AAAA,EACF;AAEA,MAAI,IAAI,WAAW,MAAM;AACvB,WAAO,EAAE,MAAM,UAAU,MAAM,IAAI,OAAO;AAAA,EAC5C;AAEA,QAAM,IAAI,MAAM,mDAAmD;AACrE;;;AInaA,SAAS,cAAc;AACvB,YAAYC,kBAAiB;AAWtB,SAAS,oBACd,OACA,aACyB;AACzB,QAAM,SAAkC,uBAAO,OAAO,IAAI;AAC1D,aAAW,QAAQ,OAAO;AACxB,WAAO,KAAK,IAAI,IACd,+BACI,OAAO,KAAK,KAAK,IACL;AAAA,MACV,KAAK,MAAM,OAAO;AAAA,QAChB,KAAK,MAAM;AAAA,QACX,KAAK,MAAM,aAAa,KAAK,MAAM;AAAA,MACrC;AAAA,IACF;AAAA,EACR;AACA,SAAO;AACT;;;AC7BA,SAAS,cAAAC,mBAAkB;;;ACFpB,IAAM,eAAN,MAAM,cAAa;AAAA,EACxB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA0C;AAC1D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,sBACL,IACA,KACc;AACd,YAAQ,OAAO,IAAI,cAAa,GAAG;AAAA,MACjC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,OAAO,OAA8B;AACnC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,WAAW,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ,CAAC,IACvE;AAAA,EACN;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAkC;AAChC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;ACtCO,IAAM,qBAAN,MAAM,oBAAmB;AAAA,EAC9B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAgD;AAChE,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,4BACL,IACA,KACoB;AACpB,YAAQ,OAAO,IAAI,oBAAmB,GAAG;AAAA,MACvC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,OAAO,KAAmC;AACxC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,UAAU,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC9D;AAAA,EACN;AAAA,EAEA,OAAO,OAAe,KAAyC;AAC7D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,aAAa,GAAG;AAAA,MAC1B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AACF;;;AC1CO,IAAM,gBAAN,MAAM,eAAc;AAAA,EACzB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA2C;AAC3D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,uBACL,IACA,KACe;AACf,YAAQ,OAAO,IAAI,eAAc,GAAG;AAAA,MAClC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAIA,KAAK,kBAAoD;AACvD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAIA,GAAG,kBAAoD;AACrD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,OAAO,KAAmC;AACxC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,UAAU,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC9D;AAAA,EACN;AAAA,EAEA,WAAqB;AACnB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM;AAAA,EACzD;AACF;;;AC9CO,IAAM,iBAAN,MAAM,gBAAe;AAAA,EAC1B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA4C;AAC5D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,wBACL,IACA,KACgB;AAChB,YAAQ,OAAO,IAAI,gBAAe,GAAG;AAAA,MACnC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,GAAG,KAAqC;AACtC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,UAAU,OAAe,KAAmC;AAC1D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,UAAU,GAAG;AAAA,MACvB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,kBAA0B;AACxB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,UAAU,OAAe,KAAmC;AAC1D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,UAAU,GAAG;AAAA,MACvB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,kBAA0B;AACxB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAc,OAAe,KAAmC;AAC9D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,UAAU,GAAG;AAAA,MACvB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAc,OAAe,KAAmC;AAC9D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,UAAU,GAAG;AAAA,MACvB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAc,OAAe,KAAmC;AAC9D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,UAAU,GAAG;AAAA,MACvB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAc,OAAe,KAAmC;AAC9D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,UAAU,GAAG;AAAA,MACvB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cACE,OACA,KAC2B;AAC3B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,mBAAmB,GAAG;AAAA,MAChC,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,WAAW,OAAe,KAA2C;AACnE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,cAAc,GAAG;AAAA,MAC3B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,mBAA2B;AACzB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;AJrKA,SAASC,UAAS,IAAgB,OAA2B;AAC3D,SAAO,GAAG,MAAM,EAAE,MAAM,OAAO,QAAQ,EAAE;AAC3C;AAGA,SAASC,SAAQ,IAAgB,OAA2B;AAC1D,SAAO,GAAG,MAAM,EAAE,MAAM,OAAO,QAAQ,CAAC;AAC1C;AAGA,SAAS,cACP,QACA,UACa;AACb,QAAM,SAAsB,CAAC;AAC7B,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAM,MAAM,SAAS,CAAC;AACtB,QAAI,OAAO,IAAI,IAAI;AACjB,aAAO,KAAK,YAAYA,SAAQ,IAAI,IAAI,IAAI,MAAM,CAAC,CAAC;AAAA,IACtD;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,oBAAoB,MAAuC;AACzE,QAAM,KAAK,IAAIC,YAAW,IAAI;AAC9B,QAAM,MAAM,eAAkB,wBAAwB,EAAE;AAGxD,QAAM,QAAQ,IAAI,GAAG;AACrB,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,0CAA0C;AACtE,QAAM,KAAK,aAAaF,UAAS,MAAM,IAAK,MAAM,MAAM,CAAC;AAGzD,QAAM,YAAY;AAAA,IAAc,IAAI,gBAAgB;AAAA,IAAG,CAAC,MACtD,IAAI,UAAU,CAAC;AAAA,EACjB;AACA,QAAM,YAAY;AAAA,IAAc,IAAI,gBAAgB;AAAA,IAAG,CAAC,MACtD,IAAI,UAAU,CAAC;AAAA,EACjB;AACA,QAAM,gBAAgB;AAAA,IAAc,IAAI,oBAAoB;AAAA,IAAG,CAAC,MAC9D,IAAI,cAAc,CAAC;AAAA,EACrB;AACA,QAAM,gBAAgB;AAAA,IAAc,IAAI,oBAAoB;AAAA,IAAG,CAAC,MAC9D,IAAI,cAAc,CAAC;AAAA,EACrB;AACA,QAAM,gBAAgB;AAAA,IAAc,IAAI,oBAAoB;AAAA,IAAG,CAAC,MAC9D,IAAI,cAAc,CAAC;AAAA,EACrB;AACA,QAAM,gBAAgB;AAAA,IAAc,IAAI,oBAAoB;AAAA,IAAG,CAAC,MAC9D,IAAI,cAAc,CAAC;AAAA,EACrB;AAGA,QAAM,gBAA0C,CAAC;AACjD,WAAS,IAAI,GAAG,IAAI,IAAI,oBAAoB,GAAG,KAAK;AAClD,UAAM,WAAW,IAAI,cAAc,CAAC;AACpC,QAAI,CAAC,SAAU;AAEf,UAAM,YAAY,SAAS,OAAO;AAClC,QAAI,CAAC,aAAa,CAAC,UAAU,GAAI;AACjC,UAAM,SAAS,YAAYC,SAAQ,UAAU,IAAI,UAAU,MAAM,CAAC;AAElE,UAAM,SAAgC,CAAC;AACvC,aAAS,IAAI,GAAG,IAAI,SAAS,aAAa,GAAG,KAAK;AAChD,YAAM,aAAa,SAAS,OAAO,CAAC;AACpC,UAAI,CAAC,WAAY;AAEjB,YAAM,SAAmB,CAAC;AAC1B,eAAS,IAAI,GAAG,IAAI,WAAW,aAAa,GAAG,KAAK;AAClD,cAAM,QAAQ,WAAW,OAAO,CAAC;AACjC,YAAI,UAAU,KAAM,QAAO,KAAK,KAAK;AAAA,MACvC;AACA,aAAO,KAAK,EAAE,OAAO,CAAC;AAAA,IACxB;AAEA,kBAAc,KAAK,EAAE,QAAQ,OAAO,CAAC;AAAA,EACvC;AAGA,QAAM,aAAkC,CAAC;AACzC,WAAS,IAAI,GAAG,IAAI,IAAI,iBAAiB,GAAG,KAAK;AAC/C,UAAM,UAAU,IAAI,WAAW,CAAC;AAChC,QAAI,CAAC,QAAS;AAEd,UAAM,OAAO,QAAQ,KAAK;AAC1B,UAAM,KAAK,QAAQ,GAAG;AACtB,QAAI,SAAS,QAAQ,OAAO,MAAM;AAChC,iBAAW,KAAK,EAAE,MAAM,GAAG,CAAC;AAAA,IAC9B;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AKrEA,SAAS,oBAAoB,OAA2B;AACtD,SAAO,kBAAkB,QAAQ,MAAM,eAAe,MAAM;AAC9D;AAQO,SAAS,aAAa,MAA0C;AACrE,QAAM,EAAE,KAAK,aAAa,mBAAmB,IAAI;AAEjD,iBAAe,QAAQ,MAAsC;AAC3D,WAAO,cACH,MAAM,YAAY,MAAM,KAAK,IAAI,IACjC,MAAM,MAAM,KAAK,IAAI;AAAA,EAC3B;AAEA,SAAO;AAAA,IACL,MAAM,MAAM;AACV,YAAM,IAAI;AAAA,QACR,+BAA+B,GAAG;AAAA,MACpC;AAAA,IACF;AAAA,IACA,MAAM,SAAS,MAAM,OAAO,SAAS;AACnC,YAAM,UAAkC,qBACpC,EAAE,GAAG,mBAAmB,IACxB,CAAC;AACL,cAAQ,QACN,kBAAkB,QACd,UAAU,MAAM,YAAY,KAC5B,SAAS,MAAM,MAAM,IAAI,MAAM,SAAS,MAAM,SAAS,CAAC;AAE9D,YAAM,WAAW,MAAM,QAAQ,EAAE,SAAS,QAAQ,SAAS,OAAO,CAAC;AAEnE,UAAI,SAAS,WAAW,KAAK;AAC3B,cAAM,IAAI;AAAA,UACR,oBAAoB,GAAG;AAAA,QACzB;AAAA,MACF;AACA,UAAI,SAAS,WAAW,OAAO,SAAS,WAAW,KAAK;AACtD,cAAM,IAAI;AAAA,UACR,sCAAsC,GAAG,KAAK,SAAS,MAAM,IAAI,SAAS,UAAU;AAAA,QACtF;AAAA,MACF;AAEA,YAAM,OAAO,IAAI,WAAW,MAAM,SAAS,YAAY,CAAC;AAKxD,UAAI,SAAS,WAAW,KAAK;AAC3B,cAAM,WAAW,oBAAoB,KAAK;AAC1C,YAAI,KAAK,WAAW,SAAU,QAAO;AACrC,cAAM,IAAI;AAAA,UACR,4CAA4C,GAAG,cAAc,QAAQ,eAAe,KAAK,MAAM;AAAA,QACjG;AAAA,MACF;AAKA,UAAI,YAAY,OAAO;AACrB,cAAM,MAAM,MAAM,SAAS,MAAM;AACjC,YAAI,KAAK,UAAU,IAAK,QAAO,KAAK,MAAM,MAAM,QAAQ,GAAG;AAC3D,cAAM,IAAI;AAAA,UACR,yCAAyC,GAAG,mBAAmB,GAAG,oCAAoC,KAAK,MAAM;AAAA,QACnH;AAAA,MACF;AAEA,UAAI,KAAK,UAAU,MAAM,cAAc;AACrC,eAAO,KAAK,MAAM,KAAK,SAAS,MAAM,YAAY;AAAA,MACpD;AACA,YAAM,IAAI;AAAA,QACR,gDAAgD,GAAG,mBAAmB,MAAM,YAAY,oCAAoC,KAAK,MAAM;AAAA,MACzI;AAAA,IACF;AAAA,EACF;AACF;AASO,SAAS,iBAAiB,SAAiC;AAChE,SAAO;AAAA,IACL,MAAM,IAAI,KAAK,SAAS;AACtB,YAAM,iBAAiB,SAAS,SAC5B,EAAE,QAAQ,QAAQ,OAAO,IACzB;AACJ,aAAO,QAAQ,UAAU,KAAK,QAAW,cAAc;AAAA,IACzD;AAAA,IACA,MAAM,SAAS,KAAK,OAAO,SAAS;AAClC,YAAM,iBAAiB,SAAS,SAC5B,EAAE,QAAQ,QAAQ,OAAO,IACzB;AACJ,UAAI,kBAAkB,OAAO;AAC3B,cAAM,IAAI;AAAA,UACR,+CAA+C,GAAG;AAAA,QACpD;AAAA,MACF;AAEA,YAAM,eAAe;AAAA,QACnB,OAAO,MAAM;AAAA,QACb,KAAK,MAAM,SAAS,MAAM;AAAA,MAC5B;AACA,YAAM,OAAO,MAAM,QAAQ,UAAU,KAAK,cAAc,cAAc;AACtE,UAAI,KAAK,WAAW,MAAM,OAAQ,QAAO;AAIzC,UAAI,KAAK,UAAU,aAAa,KAAK;AACnC,eAAO,KAAK,MAAM,aAAa,OAAO,aAAa,GAAG;AAAA,MACxD;AAEA,YAAM,IAAI;AAAA,QACR,oBAAoB,KAAK,MAAM,cAAc,GAAG,UAAU,aAAa,KAAK,IAAI,aAAa,MAAM,CAAC,cAAc,MAAM,MAAM;AAAA,MAChI;AAAA,IACF;AAAA,EACF;AACF;;;AChIA,IAAM,sBAAsB,KAAK;AAKjC,IAAM,yBAAyB;AAG/B,SAAS,uBAAuB,OAA6C;AAC3E,SAAO,KAAK,UAAU,KAAK;AAC7B;AAsBO,IAAM,cAAN,MAAM,aAAY;AAAA,EACf;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA;AAAA,EACA;AAAA,EACA;AAAA,EACA,oBAAoB;AAAA,EACpB;AAAA,EACA,uBAAuB;AAAA;AAAA,EAEvB;AAAA,EAEA,YACN,SACA,UACA,aACA,uBAA+B,KAC/B,wBACA;AACA,SAAK,UAAU;AACf,SAAK,WAAW;AAChB,SAAK,cAAc;AACnB,SAAK,gBAAgB,IAAI,SAAS,oBAAoB;AACtD,SAAK,iBAAiB,aAAa,KAAK,aAAa;AACrD,SAAK,yBAAyB,0BAA0B,oBAAI,IAAI;AAAA,EAClE;AAAA,EAEQ,kBAAkB,aAA8C;AACtE,QAAI,CAAC,YAAa,QAAO;AACzB,QAAI,CAAC,KAAK,eAAgB,MAAK,iBAAiB,oBAAI,QAAQ;AAE5D,QAAI,KAAK,KAAK,eAAe,IAAI,WAAW;AAC5C,QAAI,OAAO,QAAW;AACpB,WAAK,KAAK;AACV,WAAK,oBAAoB,KAAK;AAC9B,WAAK,eAAe,IAAI,aAAa,EAAE;AAAA,IACzC;AACA,WAAO,OAAO,EAAE;AAAA,EAClB;AAAA,EAEQ,qBAAqB,qBAAgD;AAC3E,QAAI,CAAC,KAAK,kBAAmB,MAAK,oBAAoB,oBAAI,QAAQ;AAElE,QAAI,KAAK,KAAK,kBAAkB,IAAI,mBAAmB;AACvD,QAAI,OAAO,QAAW;AACpB,WAAK,KAAK;AACV,WAAK,uBAAuB,KAAK;AACjC,WAAK,kBAAkB,IAAI,qBAAqB,EAAE;AAAA,IACpD;AACA,WAAO,OAAO,EAAE;AAAA,EAClB;AAAA,EAEQ,cACN,cACA,aACA,qBACwB;AACxB,QAAI,CAAC,KAAK,aAAa;AACrB,WAAK,cAAc,IAAI,SAAS,sBAAsB;AAAA,IACxD;AACA,UAAM,SAAS,KAAK;AACpB,UAAM,WAAW,uBAAuB;AAAA,MACtC,GAAG;AAAA,MACH,CAAC,aAAa,KAAK,qBAAqB,mBAAmB,CAAC;AAAA,IAC9D,CAAC;AAED,UAAM,SAAS,OAAO,IAAI,QAAQ;AAClC,QAAI,OAAQ,QAAO;AAEnB,UAAM,MAAM,YAAY;AACxB,UAAM,UAAkC,QAAQ,QAAQ,EACrD;AAAA,MAAK,MACJ,oBAAoB,KAAK,EAAE,cAAc,oBAAoB,CAAC;AAAA,IAChE,EACC,MAAM,CAAC,UAAmB;AACzB,UAAI,OAAO,IAAI,QAAQ,MAAM,QAAS,QAAO,OAAO,QAAQ;AAC5D,YAAM;AAAA,IACR,CAAC;AACH,WAAO,IAAI,UAAU,OAAO;AAC5B,WAAO;AAAA,EACT;AAAA,EAEQ,eAAe,SAA+C;AACpE,QAAI,CAAC,KAAK,aAAa;AACrB,WAAK,cAAc,iBAAiB,KAAK,OAAO;AAAA,IAClD;AACA,UAAM,MAAM,KAAK;AACjB,UAAM,sBAAsB,SAAS;AACrC,QAAI,CAAC,qBAAqB;AACxB,aAAO,QAAQ,QAAQ,GAAG;AAAA,IAC5B;AACA,WAAO,KAAK,cAAc,CAAC,QAAQ,GAAG,MAAM,KAAK,mBAAmB;AAAA,EACtE;AAAA,EAEQ,0BACN,SACA,SAIA,SACwB;AACxB,UAAM,WAAW,CAAC,CAAC,SAAS;AAC5B,QAAI;AACJ,QAAI,UAAU;AACZ,2BAAqB,CAAC;AACtB,UAAI,QAAQ,cAAc;AACxB,2BAAmB,UAAU,IAAI,QAAQ;AAAA,MAC3C;AACA,UAAI,QAAQ,uBAAuB,GAAG;AACpC,2BAAmB,qBAAqB,IAAI,IAAI;AAAA,UAC9C,QAAQ,uBAAuB;AAAA,QACjC,EAAE,YAAY;AAAA,MAChB;AAAA,IACF;AAEA,UAAM,cAAc,WAChB,CAAC,WAAW,QAAQ,gBAAgB,IAAI,QAAQ,oBAAoB,IACpE,CAAC,WAAW;AAEhB,UAAM,cAAc,MAClB,aAAa;AAAA,MACX,KAAK;AAAA,MACL,aAAa,SAAS;AAAA,MACtB;AAAA,IACF,CAAC;AAEH,UAAM,sBAAsB,SAAS;AACrC,QAAI,CAAC,qBAAqB;AACxB,aAAO,QAAQ,QAAQ,YAAY,CAAC;AAAA,IACtC;AAEA,WAAO,KAAK;AAAA,MACV;AAAA,QACE;AAAA,QACA;AAAA,QACA,CAAC,SAAS,KAAK,kBAAkB,SAAS,WAAW,CAAC;AAAA,QACtD;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,aAAa,KACX,SACA,YACA,SAIsB;AACtB,UAAM,EAAE,UAAU,YAAY,IAAI,MAAM,aAAY;AAAA,MAClD;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,WAAO,IAAI;AAAA,MACT;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AAAA,EACF;AAAA;AAAA,EAGA,aAAqB,aACnB,SACA,YACA,SAC2D;AAC3D,UAAM,OAAO,gBAAgB,iBAAiB,UAAU,CAAC;AACzD,UAAM,OAAO,MAAM,QAAQ,UAAU,MAAM,QAAW,OAAO;AAG7D,UAAM,SAAS,YAAY,IAAI;AAC/B,qBAAiB,wBAAyB;AAG1C,QAAI,iBAAiB,mBAAmB,IAAI;AAC5C,QAAI,OAAO,8BAA2C;AACpD,uBAAiB,WAAW,cAAc;AAAA,IAC5C;AAGA,WAAO;AAAA,MACL,UAAU,cAAc,cAAc;AAAA,MACtC,aAAa,OAAO;AAAA,IACtB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,aACN,YACA,SACmB;AACnB,UAAM,QAAQ,iBAAiB,UAAU;AACzC,WAAO,KAAK,eAAe;AAAA,MACzB;AAAA,MACA,CAAC,WAAW,KAAK,cAAc,OAAO,MAAM;AAAA,MAC5C,SAAS;AAAA,IACX;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAc,cACZ,OACA,QACmB;AACnB,UAAM,OAAO,gBAAgB,KAAK;AAClC,UAAM,OAAO,MAAM,KAAK,QAAQ,UAAU,MAAM,QAAW,EAAE,OAAO,CAAC;AAErE,UAAM,SAAS,YAAY,IAAI;AAC/B,qBAAiB,wBAAyB;AAE1C,QAAI,iBAAiB,mBAAmB,IAAI;AAC5C,QAAI,OAAO,8BAA2C;AACpD,uBAAiB,WAAW,cAAc;AAAA,IAC5C;AAEA,WAAO,cAAc,cAAc;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA,EAKA,gBAA4B;AAC1B,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,iBAA8B;AAC5B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,sBAAyC;AACvC,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,aAAqB;AACnB,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,eAAqB;AAEnB,WAAO,IAAI,KAAK,OAAO,KAAK,SAAS,YAAY,KAAK,CAAC;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,sBAA+C;AAC7C,WAAO,oBAAoB,KAAK,SAAS,UAAU,KAAK,WAAW;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,mBACJ,SACqC;AACrC,UAAM,OAAO,sBAAsB,iBAAiB,KAAK,SAAS,EAAE,CAAC;AAErE,QAAI;AACJ,QAAI;AACF,aAAO,MAAM,KAAK,QAAQ,UAAU,MAAM,QAAW,OAAO;AAAA,IAC9D,SAAS,OAAO;AACd,UAAI,iBAAiB,cAAe,QAAO;AAC3C,YAAM;AAAA,IACR;AAEA,UAAM,SAAS,YAAY,IAAI;AAC/B,qBAAiB,8BAA+B;AAEhD,QAAI,iBAAiB,mBAAmB,IAAI;AAC5C,QAAI,OAAO,8BAA2C;AACpD,uBAAiB,WAAW,cAAc;AAAA,IAC5C;AAEA,WAAO,oBAAoB,cAAc;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAQ,MAAmC;AAEzC,UAAM,iBAAiB,KAAK,WAAW,GAAG,IAAI,OAAO,IAAI,IAAI;AAG7D,WAAO,KAAK,iBAAiB,cAAc;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAA4B;AAC1B,WAAO,CAAC,GAAG,KAAK,SAAS,KAAK;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,aAAa,YAAoC;AAC/C,UAAM,mBAAmB,eAAe,MAAM,KAAK;AACnD,UAAM,SAAS,mBAAmB;AAElC,WAAO,KAAK,SAAS,MAAM,OAAO,CAAC,SAAS;AAC1C,UAAI,CAAC,KAAK,KAAK,WAAW,MAAM,EAAG,QAAO;AAE1C,YAAM,OAAO,KAAK,KAAK,MAAM,OAAO,MAAM;AAC1C,aAAO,CAAC,KAAK,SAAS,GAAG;AAAA,IAC3B,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,YAAY,MAA8B;AACxC,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,QAAI,CAAC,KAAM,QAAO;AAElB,UAAM,OAAO,IAAI,YAAY,EAAE,OAAO,KAAK,QAAQ;AACnD,WAAO,KAAK,MAAM,IAAI;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,eAAe,MAAiC;AAC9C,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,QAAI,CAAC,KAAM,QAAO;AAClB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,SACJ,MACA,QACA,SAC4B;AAC5B,aAAS,QAAQ,eAAe;AAChC,UAAM,iBAAiB,iBAAiB,OAAO;AAE/C,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,QAAI,CAAC,QAAQ,KAAK,SAAS,SAAS,SAAS;AAC3C,aAAO;AAAA,IACT;AAGA,UAAM,YAAY,KAAK;AAEvB,eAAW,eAAe,UAAU,WAAW;AAE7C,UAAI,CAAC,KAAK,gBAAgB,QAAQ,YAAY,OAAO,GAAG;AACtD;AAAA,MACF;AAGA,YAAM,WAAW,MAAM,KAAK;AAAA,QAC1B,YAAY;AAAA,QACZ;AAAA,MACF;AAGA,YAAM,WAAW,aAAa,UAAU,KAAK,IAAI,MAAM;AACvD,UAAI,CAAC,SAAU;AAGf,YAAM,UAAU,gBAAgB,QAAQ;AACxC,aAAO,KAAK,kBAAkB,SAAS,OAAO;AAAA,IAChD;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,MAAM,cACJ,MACA,QACA,OACA,SAC4B;AAC5B,aAAS,QAAQ,eAAe;AAChC,UAAM,iBAAiB,iBAAiB,OAAO;AAE/C,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,QAAI,CAAC,QAAQ,KAAK,SAAS,SAAS,SAAS;AAC3C,aAAO;AAAA,IACT;AAEA,UAAM,YAAY,KAAK;AAEvB,eAAW,eAAe,UAAU,WAAW;AAC7C,UAAI,CAAC,KAAK,gBAAgB,QAAQ,YAAY,OAAO,GAAG;AACtD;AAAA,MACF;AAEA,YAAM,WAAW,MAAM,KAAK;AAAA,QAC1B,YAAY;AAAA,QACZ;AAAA,MACF;AACA,YAAM,WAAW,aAAa,UAAU,KAAK,IAAI,MAAM;AACvD,UAAI,CAAC,SAAU;AAEf,YAAM,UAAU,gBAAgB,QAAQ;AACxC,aAAO,KAAK,uBAAuB,SAAS,OAAO,OAAO;AAAA,IAC5D;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAGQ,gBACN,QACA,SACS;AACT,QAAI,OAAO,WAAW,QAAQ,OAAQ,QAAO;AAE7C,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,YAAM,EAAE,MAAM,GAAG,IAAI,QAAQ,CAAC;AAC9B,UAAI,OAAO,CAAC,IAAI,QAAQ,OAAO,CAAC,KAAK,IAAI;AACvC,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAc,kBACZ,SACA,SACqB;AACrB,YAAQ,QAAQ,MAAM;AAAA,MACpB,KAAK;AACH,eAAO,QAAQ;AAAA,MAEjB,KAAK,UAAU;AACb,cAAM,OAAO,aAAa,iBAAiB,QAAQ,OAAO,CAAC;AAC3D,cAAM,iBAAiB,QAAQ;AAC/B,cAAM,eAAe,QAAQ,SAAS,QAAQ;AAC9C,cAAM,QAAQ,MAAM,KAAK,eAAe,OAAO;AAC/C,cAAM,OAAO,MAAM,MAAM;AAAA,UACvB;AAAA,UACA,EAAE,QAAQ,gBAAgB,QAAQ,QAAQ,OAAO;AAAA,UACjD,EAAE,QAAQ,SAAS,OAAO;AAAA,QAC5B;AACA,YAAI,CAAC,MAAM;AACT,gBAAM,IAAI;AAAA,YACR,qCAAqC,IAAI,UAAU,cAAc,IAAI,eAAe,CAAC;AAAA,UACvF;AAAA,QACF;AACA,YAAI,KAAK,WAAW,QAAQ,OAAQ,QAAO;AAE3C,cAAM,IAAI;AAAA,UACR,oBAAoB,KAAK,MAAM,cAAc,IAAI,UAAU,cAAc,IAAI,eAAe,CAAC,cAAc,QAAQ,MAAM;AAAA,QAC3H;AAAA,MACF;AAAA,MAEA,KAAK,WAAW;AAGd,cAAM,mBAAmB;AAAA,UACvB,QAAQ;AAAA,UACR,KAAK;AAAA,QACP;AACA,cAAM,UAAU;AAAA,UACd;AAAA,UACA,SAAS;AAAA,QACX;AAEA,cAAM,QAAQ,MAAM,KAAK;AAAA,UACvB;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,cAAM,OAAO,MAAM,MAAM;AAAA,UACvB;AAAA,UACA,EAAE,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,OAAO;AAAA,UACjD,EAAE,QAAQ,SAAS,OAAO;AAAA,QAC5B;AACA,YAAI,CAAC,MAAM;AACT,gBAAM,IAAI;AAAA,YACR,sCAAsC,OAAO;AAAA,UAC/C;AAAA,QACF;AACA,YAAI,KAAK,WAAW,QAAQ,QAAQ;AAClC,gBAAM,IAAI;AAAA,YACR,4CAA4C,OAAO,cAAc,QAAQ,MAAM,eAAe,KAAK,MAAM;AAAA,UAC3G;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,MAAc,uBACZ,SACA,OACA,SACqB;AAErB,QAAI;AACJ,QAAI;AAEJ,QAAI,kBAAkB,OAAO;AAC3B,mBACE,QAAQ,SAAS,WACb,QAAQ,KAAK,SAAS,MAAM,eAC5B,QAAQ,SAAS,MAAM;AAC7B,iBACE,QAAQ,SAAS,WAAW,QAAQ,KAAK,SAAS,QAAQ;AAAA,IAC9D,OAAO;AACL,mBAAa,MAAM;AACnB,iBAAW,MAAM,SAAS,MAAM;AAAA,IAClC;AAEA,YAAQ,QAAQ,MAAM;AAAA,MACpB,KAAK;AACH,eAAO,QAAQ,KAAK,MAAM,YAAY,QAAQ;AAAA,MAEhD,KAAK,UAAU;AACb,cAAM,OAAO,aAAa,iBAAiB,QAAQ,OAAO,CAAC;AAC3D,cAAM,iBAAiB,QAAQ,SAAS;AACxC,cAAM,eAAe,WAAW;AAChC,cAAM,eAAe,iBAAiB;AACtC,cAAM,QAAQ,MAAM,KAAK,eAAe,OAAO;AAC/C,cAAM,OAAO,MAAM,MAAM;AAAA,UACvB;AAAA,UACA,EAAE,QAAQ,gBAAgB,QAAQ,aAAa;AAAA,UAC/C,EAAE,QAAQ,SAAS,OAAO;AAAA,QAC5B;AACA,YAAI,CAAC,MAAM;AACT,gBAAM,IAAI;AAAA,YACR,qCAAqC,IAAI,UAAU,cAAc,IAAI,eAAe,CAAC;AAAA,UACvF;AAAA,QACF;AACA,YAAI,KAAK,WAAW,aAAc,QAAO;AAEzC,cAAM,IAAI;AAAA,UACR,oBAAoB,KAAK,MAAM,cAAc,IAAI,UAAU,cAAc,IAAI,eAAe,CAAC,cAAc,YAAY;AAAA,QACzH;AAAA,MACF;AAAA,MAEA,KAAK,WAAW;AACd,cAAM,gBAAgB,QAAQ,SAAS;AACvC,cAAM,eAAe,WAAW;AAEhC,cAAM,mBAAmB;AAAA,UACvB,QAAQ;AAAA,UACR,KAAK;AAAA,QACP;AACA,cAAM,UAAU;AAAA,UACd;AAAA,UACA,SAAS;AAAA,QACX;AAEA,cAAM,QAAQ,MAAM,KAAK;AAAA,UACvB;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,cAAM,OAAO,MAAM,MAAM;AAAA,UACvB;AAAA,UACA,EAAE,QAAQ,eAAe,QAAQ,aAAa;AAAA,UAC9C,EAAE,QAAQ,SAAS,OAAO;AAAA,QAC5B;AACA,YAAI,CAAC,MAAM;AACT,gBAAM,IAAI;AAAA,YACR,sCAAsC,OAAO;AAAA,UAC/C;AAAA,QACF;AACA,YAAI,KAAK,WAAW,cAAc;AAChC,gBAAM,IAAI;AAAA,YACR,4CAA4C,OAAO,cAAc,YAAY,eAAe,KAAK,MAAM;AAAA,UACzG;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGQ,iBAAiB,MAAmC;AAC1D,UAAM,QAAQ,KAAK,SAAS;AAC5B,QAAI,MAAM;AACV,QAAI,OAAO,MAAM,SAAS;AAE1B,WAAO,OAAO,MAAM;AAClB,YAAM,MAAM,KAAK,OAAO,MAAM,QAAQ,CAAC;AACvC,YAAM,MAAM,iBAAiB,MAAM,GAAG,EAAE,MAAM,IAAI;AAElD,UAAI,QAAQ,GAAG;AACb,eAAO,MAAM,GAAG;AAAA,MAClB,WAAW,MAAM,GAAG;AAClB,cAAM,MAAM;AAAA,MACd,OAAO;AACL,eAAO,MAAM;AAAA,MACf;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAGA,IAAM,cAAc,IAAI,YAAY;AAEpC,SAAS,iBAAiB,SAAmD;AAC3E,MAAI,CAAC,QAAS,QAAO;AACrB,SAAO;AAAA,IACL,GAAI,QAAQ,UAAU,EAAE,QAAQ,QAAQ,OAAO;AAAA,IAC/C,GAAI,QAAQ,eAAe,EAAE,aAAa,QAAQ,YAAY;AAAA,IAC9D,GAAI,QAAQ,sBAAsB,UAAa;AAAA,MAC7C,mBAAmB,QAAQ;AAAA,IAC7B;AAAA,IACA,GAAI,QAAQ,iBAAiB,UAAa;AAAA,MACxC,cAAc,QAAQ;AAAA,IACxB;AAAA,EACF;AACF;AASA,SAAS,iBAAiB,GAAW,GAAmB;AACtD,QAAM,SAAS,YAAY,OAAO,CAAC;AACnC,QAAM,SAAS,YAAY,OAAO,CAAC;AAEnC,QAAM,SAAS,KAAK,IAAI,OAAO,QAAQ,OAAO,MAAM;AACpD,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,OAAO,CAAC,MAAM,OAAO,CAAC,GAAG;AAC3B,aAAO,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO,OAAO,SAAS,OAAO;AAChC;AAGA,IAAM,aAAa;AAqBZ,SAAS,aACd,UACA,YACQ;AACR,MAAI,CAAC,SAAS,WAAW,UAAU,EAAG,QAAO;AAE7C,QAAM,OAAO,SAAS,MAAM,WAAW,MAAM;AAC7C,QAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,MAAI,UAAU,IAAI;AAChB,UAAM,IAAI;AAAA,MACR,uBAAuB,QAAQ;AAAA,IACjC;AAAA,EACF;AAEA,QAAM,OAAO,KAAK,MAAM,GAAG,KAAK;AAChC,QAAM,eAAe,KAAK,MAAM,QAAQ,CAAC;AACzC,QAAM,YAAY,WAAW,IAAI,IAAI;AACrC,MAAI,cAAc,QAAW;AAC3B,QAAI,WAAW,SAAS,EAAG,QAAO;AAClC,UAAM,IAAI;AAAA,MACR,oCAAoC,IAAI,mBAAmB,QAAQ;AAAA,IACrE;AAAA,EACF;AAEA,QAAM,mBAAmB,UAAU,SAAS,GAAG,IAC3C,YACA,GAAG,SAAS;AAChB,SAAO,mBAAmB;AAC5B;AAoBA,SAAS,mBAAmB,KAAa,cAA+B;AAGtE,MAAI,IAAI,WAAW,OAAO,GAAG;AAC3B,UAAM,OAAO,IAAI,MAAM,CAAC;AACxB,UAAM,aAAa,KAAK,QAAQ,GAAG;AACnC,QAAI,eAAe,IAAI;AAErB,YAAME,UAAS;AACf,UAAIA,QAAO,SAAS,GAAG,GAAG;AACxB,eAAO,4BAA4BA,OAAM;AAAA,MAC3C;AACA,aAAO,WAAWA,OAAM;AAAA,IAC1B;AACA,UAAM,SAAS,KAAK,MAAM,GAAG,UAAU;AACvC,UAAM,MAAM,KAAK,MAAM,aAAa,CAAC;AAErC,QAAI,OAAO,SAAS,GAAG,GAAG;AACxB,aAAO,4BAA4B,MAAM,IAAI,GAAG;AAAA,IAClD;AACA,WAAO,WAAW,MAAM,qBAAqB,GAAG;AAAA,EAClD;AAGA,MAAI,IAAI,WAAW,OAAO,KAAK,IAAI,WAAW,QAAQ,GAAG;AACvD,UAAM,YAAY,IAAI,WAAW,OAAO,IAAI,IAAI;AAChD,UAAM,OAAO,IAAI,MAAM,SAAS;AAChC,WAAO,kCAAkC,IAAI;AAAA,EAC/C;AAKA,MAAI,IAAI,WAAW,OAAO,KAAK,IAAI,WAAW,UAAU,GAAG;AACzD,QAAI,CAAC,cAAc;AACjB,YAAM,IAAI;AAAA,QACR,+BAA+B,GAAG;AAAA,MAGpC;AAAA,IACF;AACA,UAAM,YAAY,IAAI,WAAW,OAAO,IAAI,IAAI;AAChD,UAAM,OAAO,IAAI,MAAM,SAAS;AAChC,UAAM,aAAa,KAAK,QAAQ,GAAG;AACnC,QAAI,eAAe,IAAI;AAErB,aAAO,WAAW,YAAY,0BAA0B,IAAI;AAAA,IAC9D;AACA,UAAM,YAAY,KAAK,MAAM,GAAG,UAAU;AAC1C,UAAM,OAAO,KAAK,MAAM,aAAa,CAAC;AACtC,WAAO,WAAW,YAAY,0BAA0B,SAAS,IAAI,IAAI;AAAA,EAC3E;AAIA,MAAI,IAAI,WAAW,SAAS,GAAG;AAC7B,UAAM,OAAO,IAAI,MAAM,CAAC;AACxB,UAAM,UAAU,KAAK,QAAQ,GAAG;AAChC,QAAI,YAAY,IAAI;AAClB,YAAM,YAAY,KAAK,MAAM,GAAG,OAAO;AACvC,YAAM,cAAc,KAAK,MAAM,UAAU,CAAC;AAE1C,YAAM,aAAa,YAAY,QAAQ,GAAG;AAC1C,YAAM,OACJ,eAAe,KAAK,cAAc,YAAY,MAAM,GAAG,UAAU;AACnE,YAAM,OAAO,eAAe,KAAK,KAAK,YAAY,MAAM,aAAa,CAAC;AAEtE,YAAM,WAAW,KAAK,QAAQ,GAAG;AACjC,YAAM,UAAU,aAAa,KAAK,OAAO,KAAK,MAAM,GAAG,QAAQ;AAC/D,YAAM,SAAS,OAAO,GAAG,SAAS,IAAI,IAAI,KAAK;AAC/C,aAAO,WAAW,OAAO,0BAA0B,MAAM;AAAA,IAC3D;AAAA,EACF;AAGA,SAAO;AACT;;;ACz5BO,IAAM,aAAN,MAAM,YAAW;AAAA,EACd;AAAA,EACA,WAA8B;AAAA,EAC9B,oBAAoB;AAAA,EAEpB,YAAY,SAAkB;AACpC,SAAK,UAAU;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,MAAc,aACZ,SAC4B;AAC5B,QAAI,KAAK,mBAAmB;AAC1B,aAAO,KAAK;AAAA,IACd;AACA,SAAK,oBAAoB;AAEzB,QAAI;AACF,YAAM,OAAO,MAAM,KAAK,QAAQ;AAAA,QAC9B;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,WAAK,WAAW,UAAU,IAAI;AAC9B,aAAO,KAAK;AAAA,IACd,SAAS,OAAO;AAEd,UAAI,aAAa,KAAK,GAAG;AACvB,aAAK,oBAAoB;AACzB,cAAM;AAAA,MACR;AAEA,UAAI,iBAAiB,eAAe;AAClC,eAAO;AAAA,MACT;AAEA,YAAM,IAAI;AAAA,QACR,iCAAiC,iBAAiB,QAAQ,MAAM,UAAU,KAAK;AAAA,MACjF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,aAAa,KACX,SACA,gBACqB;AACrB,UAAM,OAAO,IAAI,YAAW,QAAQ,OAAO;AAE3C,QAAI,QAAQ,kBAAkB,MAAM;AAElC,WAAK,oBAAoB;AACzB,aAAO;AAAA,IACT;AAGA,UAAM,WAAW,MAAM,KAAK,aAAa,cAAc;AACvD,QAAI,UAAU;AACZ,aAAO;AAAA,IACT;AACA,QAAI,QAAQ,kBAAkB,MAAM;AAClC,YAAM,IAAI,MAAM,uDAAuD;AAAA,IACzE;AAGA,UAAM,gBAAgB,oBAAoB,MAAM;AAChD,UAAM,aAAa,MAAM,KAAK;AAAA,MAC5B;AAAA,MACA,iBAAiB,MAAM;AAAA,MACvB;AAAA,IACF;AACA,QAAI,YAAY;AACd,aAAO;AAAA,IACT;AAEA,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAc,cACZ,WACA,YACA,SACkB;AAClB,QAAI;AACF,uBAAiB,QAAQ,KAAK,QAAQ,WAAW,SAAS,GAAG;AAC3D,YAAI,KAAK,SAAS,OAAO,KAAK,CAAC,KAAK,SAAS,UAAU,GAAG;AACxD,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AAEd,UAAI,aAAa,KAAK,GAAG;AACvB,cAAM;AAAA,MACR;AAEA,UAAI,YAAY;AACd,eAAO,MAAM,KAAK,QAAQ,OAAO,YAAY,OAAO;AAAA,MACtD;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,MAAc,kBACZ,WACA,YACwB;AACxB,UAAM,YAAsB,CAAC;AAC7B,UAAM,eAAe,oBAAI,IAAY;AAErC,QAAI;AACF,uBAAiB,QAAQ,KAAK,QAAQ,WAAW,SAAS,GAAG;AAC3D,YAAI,KAAK,SAAS,UAAU,GAAG;AAE7B,uBAAa,IAAI,KAAK,MAAM,GAAG,CAAC,WAAW,MAAM,CAAC;AAAA,QACpD,WAAW,KAAK,SAAS,OAAO,GAAG;AACjC,oBAAU,KAAK,IAAI;AAAA,QACrB;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AAEd,UAAI,aAAa,KAAK,GAAG;AACvB,cAAM;AAAA,MACR;AAGA,aAAO,cAAc;AAAA,IACvB;AAEA,QAAI,UAAU,WAAW,GAAG;AAC1B,aAAO;AAAA,IACT;AAGA,cAAU,KAAK;AAGf,aAAS,IAAI,UAAU,SAAS,GAAG,KAAK,GAAG,KAAK;AAC9C,UAAI,CAAC,aAAa,IAAI,UAAU,CAAC,CAAC,GAAG;AACnC,eAAO,UAAU,CAAC;AAAA,MACpB;AAAA,IACF;AAGA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,eAAkC;AAEtC,UAAM,WAAW,MAAM,KAAK,aAAa;AACzC,QAAI,UAAU;AACZ,aAAO,qBAAqB,QAAQ;AAAA,IACtC;AAGA,UAAM,WAAW,oBAAI,IAAY;AAEjC,QAAI;AACF,uBAAiB,QAAQ,KAAK,QAAQ;AAAA,QACpC,GAAG,MAAM,IAAI;AAAA,MACf,GAAG;AAGD,cAAM,QAAQ,KAAK,MAAM,qCAAqC;AAC9D,YAAI,OAAO;AACT,mBAAS,IAAI,MAAM,CAAC,CAAC;AAAA,QACvB;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,UAAI,aAAa,KAAK,GAAG;AACvB,cAAM;AAAA,MACR;AACA,YAAM,IAAI,MAAM,wDAAwD;AAAA,IAC1E;AAEA,WAAO,CAAC,GAAG,QAAQ;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,WAA8B;AAElC,UAAM,WAAW,MAAM,KAAK,aAAa;AACzC,QAAI,UAAU;AACZ,aAAO,iBAAiB,QAAQ;AAAA,IAClC;AAIA,UAAM,WAAW,oBAAI,IAGnB;AAEF,QAAI;AACF,uBAAiB,QAAQ,KAAK,QAAQ,WAAW,GAAG,MAAM,IAAI,OAAO,GAAG;AAKtE,cAAM,YAAY,KAAK,MAAM,kCAAkC;AAC/D,cAAM,eAAe,KAAK;AAAA,UACxB;AAAA,QACF;AAEA,YAAI,cAAc;AAChB,gBAAM,UAAU,aAAa,CAAC;AAC9B,gBAAM,UAAU,YAAY,OAAO,IAAI,aAAa,CAAC,CAAC;AACtD,cAAI,CAAC,SAAS,IAAI,OAAO,GAAG;AAC1B,qBAAS,IAAI,SAAS,EAAE,WAAW,CAAC,GAAG,cAAc,oBAAI,IAAI,EAAE,CAAC;AAAA,UAClE;AACA,mBAAS,IAAI,OAAO,EAAG,aAAa,IAAI,OAAO;AAAA,QACjD,WAAW,WAAW;AACpB,gBAAM,UAAU,UAAU,CAAC;AAC3B,cAAI,CAAC,SAAS,IAAI,OAAO,GAAG;AAC1B,qBAAS,IAAI,SAAS,EAAE,WAAW,CAAC,GAAG,cAAc,oBAAI,IAAI,EAAE,CAAC;AAAA,UAClE;AACA,mBAAS,IAAI,OAAO,EAAG,UAAU,KAAK,IAAI;AAAA,QAC5C;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,UAAI,aAAa,KAAK,GAAG;AACvB,cAAM;AAAA,MACR;AACA,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AAGA,UAAM,SAAmB,CAAC;AAC1B,eAAW,CAAC,SAAS,EAAE,WAAW,aAAa,CAAC,KAAK,UAAU;AAC7D,UAAI,UAAU,WAAW,EAAG;AAG5B,gBAAU,KAAK;AACf,YAAM,YAAY,UAAU,UAAU,SAAS,CAAC;AAGhD,UAAI,CAAC,aAAa,IAAI,SAAS,GAAG;AAChC,eAAO,KAAK,OAAO;AAAA,MACrB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,eACJ,MACA,SACsB;AAEtB,UAAM,WAAW,MAAM,KAAK,aAAa,OAAO;AAChD,QAAI,UAAU;AACZ,YAAMC,cAAa,cAAc,UAAU,IAAI;AAC/C,UAAI,CAACA,aAAY;AACf,cAAM,IAAI,MAAM,qBAAqB,IAAI,EAAE;AAAA,MAC7C;AACA,aAAO,YAAY,KAAK,KAAK,SAASA,aAAY;AAAA,QAChD,GAAG;AAAA,QACH,wBAAwB,SAAS;AAAA,MACnC,CAAC;AAAA,IACH;AAGA,UAAM,aAAa,oBAAoB,IAAI;AAC3C,UAAM,UAAU,MAAM,KAAK;AAAA,MACzB;AAAA,MACA,iBAAiB,IAAI;AAAA,IACvB;AACA,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,wBAAwB,UAAU,EAAE;AAAA,IACtD;AACA,UAAM,aAAa,MAAM,KAAK,sBAAsB,SAAS,OAAO;AACpE,WAAO,YAAY,KAAK,KAAK,SAAS,YAAY,OAAO;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,YACJ,MACA,SACsB;AAEtB,UAAM,WAAW,MAAM,KAAK,aAAa,OAAO;AAChD,QAAI,UAAU;AACZ,YAAMA,cAAa,WAAW,UAAU,IAAI;AAC5C,UAAI,CAACA,aAAY;AACf,cAAM,IAAI,MAAM,kBAAkB,IAAI,EAAE;AAAA,MAC1C;AACA,aAAO,YAAY,KAAK,KAAK,SAASA,aAAY;AAAA,QAChD,GAAG;AAAA,QACH,wBAAwB,SAAS;AAAA,MACnC,CAAC;AAAA,IACH;AAGA,UAAM,aAAa,iBAAiB,IAAI;AACxC,UAAM,aAAa,cAAc,IAAI;AACrC,UAAM,UAAU,MAAM,KAAK,kBAAkB,YAAY,UAAU;AACnE,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,wBAAwB,UAAU,EAAE;AAAA,IACtD;AAIA,QACE,YAAY,cACX,MAAM,KAAK,QAAQ,OAAO,GAAG,OAAO,YAAY,OAAO,GACxD;AACA,YAAM,IAAI,MAAM,kBAAkB,IAAI,EAAE;AAAA,IAC1C;AAEA,UAAM,aAAa,MAAM,KAAK,sBAAsB,SAAS,OAAO;AACpE,WAAO,YAAY,KAAK,KAAK,SAAS,YAAY,OAAO;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,iBACJ,YACA,SACsB;AACtB,UAAM,KACJ,OAAO,eAAe,WAClB,iBAAiB,UAAU,IAC3B;AAGN,UAAM,WAAW,MAAM,KAAK,aAAa,OAAO;AAChD,UAAM,yBAAyB,UAAU;AACzC,WAAO,YAAY,KAAK,KAAK,SAAS,IAAI;AAAA,MACxC,GAAG;AAAA,MACH,GAAI,0BAA0B,EAAE,uBAAuB;AAAA,IACzD,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,OAAO,YACL,SACA,SAMC;AACD,QAAI,UAA8B;AAElC,WAAO,SAAS;AACd,YAAM;AAAA,QACJ,IAAI,iBAAiB,QAAQ,cAAc,CAAC;AAAA,QAC5C,SAAS,QAAQ,WAAW;AAAA,QAC5B,WAAW,QAAQ,aAAa;AAAA,QAChC,UAAU,QAAQ,oBAAoB;AAAA,MACxC;AAEA,YAAM,WAAW,QAAQ,oBAAoB;AAC7C,UAAI,CAAC,SAAU;AAEf,gBAAU,MAAM,KAAK,iBAAiB,UAAU,OAAO;AAAA,IACzD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,aAAsB;AACpB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,MAAc,QACZ,MACA,SACkB;AAClB,UAAM,OAAO,MAAM,KAAK,QAAQ,UAAU,MAAM,QAAW,OAAO;AAClE,UAAM,OAAO,IAAI,YAAY,EAAE,OAAO,IAAI;AAC1C,WAAO,KAAK,MAAM,IAAI;AAAA,EACxB;AAAA;AAAA,EAGA,MAAc,sBACZ,MACA,SACqB;AACrB,QAAI;AACF,YAAM,MAAM,MAAM,KAAK,QAAQ,MAAM,OAAO;AAC5C,aAAO,iBAAiB,IAAI,QAAQ;AAAA,IACtC,SAAS,OAAO;AACd,UAAI,iBAAiB,eAAe;AAClC,cAAM,IAAI,MAAM,wBAAwB,IAAI,EAAE;AAAA,MAChD;AACA,YAAM;AAAA,IACR;AAAA,EACF;AACF;;;AC/eO,IAAM,cAAN,MAAqC;AAAA,EAClC;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQR,YAAY,SAAiB,UAA8B,CAAC,GAAG;AAE7D,SAAK,UAAU,QAAQ,QAAQ,OAAO,EAAE;AACxC,SAAK,UAAU;AAAA,EACjB;AAAA;AAAA,EAGQ,OAAO,MAAsB;AAEnC,UAAM,iBAAiB,KAAK,WAAW,GAAG,IAAI,KAAK,MAAM,CAAC,IAAI;AAC9D,WAAO,GAAG,KAAK,OAAO,IAAI,cAAc;AAAA,EAC1C;AAAA;AAAA,EAGQ,WAAW,OAAgC;AACjD,UAAM,UAAuB,EAAE,GAAG,KAAK,QAAQ,QAAQ;AAEvD,QAAI,OAAO;AAET,cAAQ,OAAO,IAAI,SAAS,MAAM,KAAK,IAAI,MAAM,MAAM,CAAC;AAAA,IAC1D;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,UACJ,MACA,OACA,SACqB;AACrB,aAAS,QAAQ,eAAe;AAEhC,UAAM,MAAM,KAAK,OAAO,IAAI;AAC5B,UAAM,UAAU,KAAK,WAAW,KAAK;AAErC,QAAI;AACJ,QAAI;AACF,iBAAW,MAAM,MAAM,KAAK;AAAA,QAC1B,QAAQ;AAAA,QACR;AAAA,QACA,aAAa,KAAK,QAAQ;AAAA,QAC1B,OAAO,KAAK,QAAQ;AAAA,QACpB,QAAQ,SAAS;AAAA,MACnB,CAAC;AAAA,IACH,SAAS,OAAO;AACd,UAAI,aAAa,KAAK,EAAG,OAAM;AAC/B,YAAM,IAAI;AAAA,QACR,mBAAmB,GAAG,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,QACjF,iBAAiB,QAAQ,QAAQ;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,SAAS,WAAW,KAAK;AAC3B,YAAM,IAAI,cAAc,IAAI;AAAA,IAC9B;AAGA,QAAI,SAAS,WAAW,OAAO,SAAS,WAAW,KAAK;AACtD,YAAM,IAAI;AAAA,QACR,QAAQ,SAAS,MAAM,IAAI,SAAS,UAAU,QAAQ,GAAG;AAAA,MAC3D;AAAA,IACF;AAEA,UAAM,cAAc,MAAM,SAAS,YAAY;AAC/C,WAAO,IAAI,WAAW,WAAW;AAAA,EACnC;AAAA,EAEA,MAAM,OAAO,MAAc,SAA4C;AACrE,aAAS,QAAQ,eAAe;AAEhC,UAAM,MAAM,KAAK,OAAO,IAAI;AAE5B,QAAI;AACF,YAAM,WAAW,MAAM,MAAM,KAAK;AAAA,QAChC,QAAQ;AAAA,QACR,SAAS,KAAK,QAAQ;AAAA,QACtB,aAAa,KAAK,QAAQ;AAAA,QAC1B,QAAQ,SAAS;AAAA,MACnB,CAAC;AAED,aAAO,SAAS;AAAA,IAClB,SAAS,OAAO;AACd,UAAI,aAAa,KAAK,EAAG,OAAM;AAC/B,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,OAAO,WAAW,SAAwC;AAGxD,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACF;;;ACtBO,IAAM,gBAAN,MAAM,eAAuC;AAAA;AAAA,EAEzC;AAAA,EACD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,WAAmB;AAAA,EAEnB,YACN,SACA,aACA,mBACA,cACA,qBACA;AACA,QAAI,EAAE,mBAAmB,cAAc;AACrC,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,SAAK,UAAU;AACf,SAAK,cAAc;AACnB,SAAK,oBAAoB,qBAAqB;AAC9C,SAAK,eAAe;AACpB,SAAK,sBAAsB;AAAA,EAC7B;AAAA,EAyCA,aAAa,KACX,KACA,UAAgC,CAAC,GACT;AACxB,QAAI,eAAe,aAAa;AAC9B,aAAO,IAAI;AAAA,QACT;AAAA,QACA,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,MACV;AAAA,IACF;AAEA,UAAM,UAAU,OAAO,QAAQ,WAAW,IAAI,YAAY,GAAG,IAAI;AACjE,UAAM,iBAAiB,QAAQ,SAC3B,EAAE,QAAQ,QAAQ,OAAO,IACzB;AACJ,UAAM,OAAO,MAAM,WAAW;AAAA,MAC5B,EAAE,SAAS,eAAe,QAAQ,cAAc;AAAA,MAChD;AAAA,IACF;AAGA,UAAM,iBAAiB;AAAA,MACrB,GAAG;AAAA,MACH,sBAAsB,QAAQ;AAAA,IAChC;AAEA,QAAI;AACJ,QAAI,QAAQ,UAAU;AACpB,gBAAU,MAAM,KAAK,iBAAiB,QAAQ,UAAU,cAAc;AAAA,IACxE,WAAW,QAAQ,KAAK;AACtB,gBAAU,MAAM,KAAK,YAAY,QAAQ,KAAK,cAAc;AAAA,IAC9D,OAAO;AACL,gBAAU,MAAM,KAAK;AAAA,QACnB,QAAQ,UAAU;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAEA,WAAO,IAAI;AAAA,MACT;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,IACV;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,MAAM,IACJ,KACA,MACiC;AACjC,UAAM,QAAQ,eAAe;AAE7B,UAAM,SAAS,aAAa,GAAG;AAC/B,UAAM,eAAe,KAAK,YAAY,OAAO,IAAI;AAEjD,QAAI;AACF,UAAI,OAAO,SAAS,YAAY;AAC9B,cAAM,OAAO,KAAK,QAAQ,eAAe,YAAY;AACrD,eAAO,QAAQ;AAAA,MACjB;AAEA,YAAM,QAAQ,MAAM,KAAK,QAAQ,SAAS,cAAc,OAAO,QAAQ;AAAA,QACrE,QAAQ,MAAM;AAAA,QACd,GAAI,KAAK,eAAe,EAAE,aAAa,KAAK,YAAY;AAAA,QACxD,mBAAmB,KAAK;AAAA,QACxB,cAAc,KAAK;AAAA,QACnB,GAAI,KAAK,uBAAuB;AAAA,UAC9B,qBAAqB,KAAK;AAAA,QAC5B;AAAA,MACF,CAAC;AACD,aAAO,SAAS;AAAA,IAClB,SAASC,MAAK;AAOZ,UAAIA,gBAAe,cAAe,QAAO;AACzC,YAAMA;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,MAAM,SACJ,KACA,OACA,MACiC;AACjC,UAAM,QAAQ,eAAe;AAE7B,UAAM,SAAS,aAAa,GAAG;AAC/B,UAAM,eAAe,KAAK,YAAY,OAAO,IAAI;AAEjD,QAAI;AACF,UAAI,OAAO,SAAS,SAAS;AAE3B,cAAMC,QAAO,MAAM,KAAK,QAAQ;AAAA,UAC9B;AAAA,UACA,OAAO;AAAA,UACP;AAAA,UACA;AAAA,YACE,QAAQ,MAAM;AAAA,YACd,GAAI,KAAK,eAAe,EAAE,aAAa,KAAK,YAAY;AAAA,YACxD,mBAAmB,KAAK;AAAA,YACxB,cAAc,KAAK;AAAA,YACnB,GAAI,KAAK,uBAAuB;AAAA,cAC9B,qBAAqB,KAAK;AAAA,YAC5B;AAAA,UACF;AAAA,QACF;AACA,eAAOA,SAAQ;AAAA,MACjB;AAGA,YAAM,OAAO,KAAK,QAAQ,eAAe,YAAY;AACrD,UAAI,CAAC,KAAM,QAAO;AAElB,UAAI,kBAAkB,OAAO;AAC3B,eAAO,KAAK,MAAM,CAAC,MAAM,YAAY;AAAA,MACvC;AACA,aAAO,KAAK,MAAM,MAAM,QAAQ,MAAM,SAAS,MAAM,MAAM;AAAA,IAC7D,SAASD,MAAK;AAIZ,UAAIA,gBAAe,cAAe,QAAO;AACzC,YAAMA;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGQ,YAAY,MAAsB;AACxC,QAAI,CAAC,KAAK,SAAU,QAAO;AAE3B,QAAI,SAAS,IAAK,QAAO,IAAI,KAAK,QAAQ;AAC1C,WAAO,IAAI,KAAK,QAAQ,GAAG,IAAI;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,QAAQ,MAA6B;AACnC,UAAM,SAAS,IAAI;AAAA,MACjB,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,UAAM,YAAY,KAAK,QAAQ,cAAc,EAAE;AAC/C,WAAO,WAAW,KAAK,WACnB,GAAG,KAAK,QAAQ,IAAI,SAAS,KAC7B;AACJ,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,aAAa,YAA+B;AAC1C,QAAI;AACJ,QAAI,cAAc,MAAM;AACtB,aAAO,KAAK,WAAW,IAAI,KAAK,QAAQ,KAAK;AAAA,IAC/C,WAAW,KAAK,UAAU;AACxB,aACE,IAAI,KAAK,QAAQ,IAAI,WAAW,QAAQ,OAAO,EAAE,CAAC,GAC/C,QAAQ,QAAQ,GAAG,EACnB,QAAQ,QAAQ,EAAE,KAAK;AAAA,IAC9B,OAAO;AAEL,cACG,WAAW,WAAW,GAAG,IAAI,aAAa,IAAI,UAAU,IAAI;AAAA,QAC3D;AAAA,QACA;AAAA,MACF,KAAK;AAAA,IACT;AACA,UAAM,QAAQ,KAAK,QAAQ,aAAa,IAAI;AAC5C,WAAO,MAAM,IAAI,CAAC,SAAS;AAEzB,YAAM,WAAW,KAAK,KAAK,MAAM,GAAG;AACpC,aAAO,SAAS,SAAS,SAAS,CAAC;AAAA,IACrC,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAA4B;AAC1B,WAAO,KAAK,QAAQ,UAAU;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAQ,MAAmC;AACzC,UAAM,YACH,KAAK,WACF,IAAI,KAAK,QAAQ,IAAI,KAAK,QAAQ,OAAO,EAAE,CAAC,GAAG,QAAQ,QAAQ,GAAG,IAClE,MACF,QAAQ,QAAQ,EAAE,KAAK;AAC3B,WAAO,KAAK,QAAQ,QAAQ,QAAQ;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,YAAY,MAA8B;AACxC,UAAM,YACH,KAAK,WACF,IAAI,KAAK,QAAQ,IAAI,KAAK,QAAQ,OAAO,EAAE,CAAC,GAAG,QAAQ,QAAQ,GAAG,IAClE,MACF,QAAQ,QAAQ,EAAE,KAAK;AAC3B,WAAO,KAAK,QAAQ,YAAY,QAAQ;AAAA,EAC1C;AACF;AAeA,SAAS,aAAa,KAA8B;AAElD,QAAM,OAAO,IAAI,MAAM,CAAC;AAGxB,MAAI,SAAS,aAAa;AACxB,WAAO,EAAE,MAAM,YAAY,MAAM,IAAI;AAAA,EACvC;AAGA,MAAI,KAAK,SAAS,YAAY,GAAG;AAC/B,UAAM,WAAW,MAAM,KAAK,MAAM,GAAG,CAAC,aAAa,MAAM;AACzD,WAAO,EAAE,MAAM,YAAY,MAAM,SAAS;AAAA,EAC5C;AAGA,QAAM,aAAa,KAAK,MAAM,2BAA2B;AACzD,MAAI,YAAY;AACd,UAAM,YAAY,WAAW,CAAC,IAAI,MAAM,WAAW,CAAC,IAAI;AACxD,UAAM,YAAY,WAAW,CAAC,KAAK;AACnC,UAAM,SAAS,YAAY,UAAU,MAAM,GAAG,EAAE,IAAI,MAAM,IAAI,CAAC;AAC/D,WAAO,EAAE,MAAM,SAAS,MAAM,WAAW,OAAO;AAAA,EAClD;AAGA,SAAO,EAAE,MAAM,YAAY,MAAM,MAAM,KAAK;AAC9C;","names":["SpecVersion","FileType","CompressionAlgorithm","ab","ByteBuffer","ByteBuffer","ByteBuffer","ByteBuffer","flexbuffers","ByteBuffer","readId12","readId8","ByteBuffer","bucket","snapshotId","err","data"]}
1
+ {"version":3,"sources":["../src/storage/storage.ts","../src/format/constants.ts","../src/format/object-id.ts","../src/format/flatbuffers/repo-parser.ts","../src/format/flatbuffers/generated/metadata-item.ts","../src/format/flatbuffers/generated/ref.ts","../src/format/flatbuffers/generated/repo-status.ts","../src/format/flatbuffers/generated/object-id12.ts","../src/format/flatbuffers/generated/snapshot-info.ts","../src/format/flatbuffers/generated/update.ts","../src/format/flatbuffers/generated/repo.ts","../src/vendor/fzstd/index.ts","../src/format/header.ts","../src/cache/lru.ts","../src/cache/single-flight.ts","../src/format/flatbuffers/types.ts","../src/format/flatbuffers/snapshot-parser.ts","../src/format/flatbuffers/generated/manifest-file-info.ts","../src/format/flatbuffers/generated/manifest-file-info-v2.ts","../src/format/flatbuffers/generated/dimension-name.ts","../src/format/flatbuffers/generated/dimension-shape.ts","../src/format/flatbuffers/generated/dimension-shape-v2.ts","../src/format/flatbuffers/generated/chunk-index-range.ts","../src/format/flatbuffers/generated/manifest-ref.ts","../src/format/flatbuffers/generated/array-node-data.ts","../src/format/flatbuffers/generated/object-id8.ts","../src/format/flatbuffers/generated/node-snapshot.ts","../src/format/flatbuffers/generated/snapshot.ts","../src/format/flatbuffers/manifest-parser.ts","../src/format/flatbuffers/generated/chunk-ref.ts","../src/format/flatbuffers/generated/array-manifest.ts","../src/format/flatbuffers/generated/manifest.ts","../src/format/flatbuffers/metadata.ts","../src/format/flatbuffers/transaction-log-parser.ts","../src/format/flatbuffers/generated/chunk-indices.ts","../src/format/flatbuffers/generated/array-updated-chunks.ts","../src/format/flatbuffers/generated/move-operation.ts","../src/format/flatbuffers/generated/transaction-log.ts","../src/reader/range-coalescer.ts","../src/reader/session.ts","../src/reader/repository.ts","../src/storage/http-storage.ts","../src/store.ts"],"sourcesContent":["/**\n * Storage interface for icechunk repositories.\n */\n\n/** Byte range for partial reads */\nexport interface ByteRange {\n /** Start offset (inclusive) */\n start: number;\n\n /** End offset (exclusive) */\n end: number;\n}\n\n/**\n * Pluggable HTTP client for virtual chunk fetching.\n *\n * Use this to:\n * - Generate pre-signed S3 URLs\n * - Add authentication headers\n * - Route through a proxy\n *\n * icechunk-js handles URL translation (s3:// → https://) and builds\n * all headers (Range, If-Match, etc.) before calling fetch().\n * The client only needs to execute the HTTP request.\n */\nexport interface FetchClient {\n fetch(url: string, init?: RequestInit): Promise<Response>;\n}\n\n/** Default FetchClient that delegates to globalThis.fetch. */\nexport class DefaultFetchClient implements FetchClient {\n fetch(url: string, init?: RequestInit): Promise<Response> {\n return globalThis.fetch(url, init);\n }\n}\n\n/** Options for storage request operations */\nexport interface RequestOptions {\n /** AbortSignal for request cancellation */\n signal?: AbortSignal;\n /** Pluggable HTTP client for virtual chunk fetching */\n fetchClient?: FetchClient;\n /**\n * Send If-Match / If-Unmodified-Since headers on virtual chunk requests.\n *\n * When true, the storage server will return 412 Precondition Failed if\n * the underlying file has changed since the snapshot recorded its checksum.\n *\n * Defaults to false because these headers trigger CORS preflight requests\n * in browsers, and most storage servers don't whitelist them by default.\n */\n validateChecksums?: boolean;\n /**\n * Azure storage account name for translating az:// and azure:// URLs.\n *\n * Required when virtual chunks reference az:// or azure:// URLs, since\n * these schemes encode only the container name (e.g., az://container/path).\n * The account is needed to build the HTTPS endpoint:\n * https://{account}.blob.core.windows.net/{container}/{path}\n *\n * Not needed for abfs:// URLs, which embed the account in the host.\n */\n azureAccount?: string;\n}\n\n/** Error thrown when an object is not found */\nexport class NotFoundError extends Error {\n constructor(public readonly path: string) {\n super(`Object not found: ${path}`);\n this.name = \"NotFoundError\";\n }\n}\n\n/** Error thrown for storage operations */\nexport class StorageError extends Error {\n constructor(\n message: string,\n public readonly cause?: Error,\n ) {\n super(message);\n this.name = \"StorageError\";\n }\n}\n\ntype ErrorWithName = { name: unknown };\n\nfunction hasErrorName(error: unknown): error is ErrorWithName {\n return typeof error === \"object\" && error !== null && \"name\" in error;\n}\n\n/** True for web-platform abort errors from fetch/AbortSignal. */\nexport function isAbortError(\n error: unknown,\n): error is ErrorWithName & { name: \"AbortError\" } {\n return hasErrorName(error) && error.name === \"AbortError\";\n}\n\n/**\n * Storage interface for reading icechunk data.\n *\n * Implementations should handle authentication, caching, etc.\n */\nexport interface Storage {\n /**\n * Get an object from storage.\n *\n * @param path - Path to the object (relative to repository root)\n * @param range - Optional byte range for partial reads\n * @param options - Optional request options (signal for cancellation)\n * @returns Object data as bytes\n * @throws NotFoundError if the object doesn't exist\n * @throws StorageError for other errors\n * @throws An error named \"AbortError\" if the operation was aborted\n */\n getObject(\n path: string,\n range?: ByteRange,\n options?: RequestOptions,\n ): Promise<Uint8Array>;\n\n /**\n * Check if an object exists.\n *\n * @param path - Path to the object\n * @param options - Optional request options (signal for cancellation)\n * @returns True if the object exists\n * @throws An error named \"AbortError\" if the operation was aborted\n */\n exists(path: string, options?: RequestOptions): Promise<boolean>;\n\n /**\n * List objects with a given prefix.\n *\n * @param prefix - Path prefix to filter by\n * @returns Async iterable of object paths\n */\n listPrefix(prefix: string): AsyncIterable<string>;\n}\n","/**\n * Icechunk format constants.\n */\n\n/** Storage path constants */\nexport const PATHS = {\n /** Refs directory */\n REFS: \"refs\",\n\n /** Snapshots directory */\n SNAPSHOTS: \"snapshots\",\n\n /** Manifests directory */\n MANIFESTS: \"manifests\",\n\n /** Chunks directory */\n CHUNKS: \"chunks\",\n\n /** Transaction logs directory */\n TRANSACTIONS: \"transactions\",\n} as const;\n\n/** Repository info file path (v2 format) */\nexport const REPO_INFO_PATH = \"repo\";\n\n/**\n * Get the storage path prefix for a branch ref directory.\n *\n * When storage supports listPrefix(), refs may use versioned filenames\n * (e.g., AAAAAAAA.json) for optimistic concurrency control. When listing\n * is not supported (e.g., HTTP storage), only the legacy ref.json path\n * is checked.\n *\n * @param name - Branch name\n * @returns Path to the branch ref directory (with trailing slash)\n */\nexport function getBranchRefDirPath(name: string): string {\n return `${PATHS.REFS}/branch.${name}/`;\n}\n\n/**\n * Get the storage path prefix for a tag ref directory.\n *\n * When storage supports listPrefix(), refs may use versioned filenames.\n * When listing is not supported (e.g., HTTP storage), only the legacy\n * ref.json path is checked.\n *\n * @param name - Tag name\n * @returns Path to the tag ref directory (with trailing slash)\n */\nexport function getTagRefDirPath(name: string): string {\n return `${PATHS.REFS}/tag.${name}/`;\n}\n\n/**\n * Default ref file name for legacy compatibility.\n * When storage supports listPrefix(), refs may use versioned filenames\n * for optimistic concurrency control. When listing is not supported,\n * this legacy filename is used as the fallback.\n */\nexport const REF_FILE_NAME = \"ref.json\";\n\n/**\n * Get the storage path for a branch ref file (legacy format).\n * Note: In production, refs use versioned filenames. Use getBranchRefDirPath\n * and findLatestRefFile for reading refs.\n *\n * @param name - Branch name\n * @returns Path to the branch ref file (legacy format)\n */\nexport function getBranchRefPath(name: string): string {\n return `${PATHS.REFS}/branch.${name}/${REF_FILE_NAME}`;\n}\n\n/**\n * Get the storage path for a tag ref file (legacy format).\n * Note: In production, refs use versioned filenames. Use getTagRefDirPath\n * and findLatestRefFile for reading refs.\n *\n * @param name - Tag name\n * @returns Path to the tag ref file (legacy format)\n */\nexport function getTagRefPath(name: string): string {\n return `${PATHS.REFS}/tag.${name}/${REF_FILE_NAME}`;\n}\n\n/**\n * Get the storage path for a snapshot.\n *\n * @param id - Snapshot ID as Base32 string\n * @returns Path to the snapshot file\n */\nexport function getSnapshotPath(id: string): string {\n return `${PATHS.SNAPSHOTS}/${id}`;\n}\n\n/**\n * Get the storage path for a manifest.\n *\n * @param id - Manifest ID as Base32 string\n * @returns Path to the manifest file\n */\nexport function getManifestPath(id: string): string {\n return `${PATHS.MANIFESTS}/${id}`;\n}\n\n/**\n * Get the storage path for a chunk.\n *\n * @param id - Chunk ID as Base32 string\n * @returns Path to the chunk file\n */\nexport function getChunkPath(id: string): string {\n return `${PATHS.CHUNKS}/${id}`;\n}\n\n/**\n * Get the storage path for a transaction log.\n *\n * @param id - Snapshot ID as Base32 string\n * @returns Path to the transaction log file\n */\nexport function getTransactionLogPath(id: string): string {\n return `${PATHS.TRANSACTIONS}/${id}`;\n}\n","/**\n * Object ID encoding/decoding using Base32 Crockford.\n *\n * Icechunk uses Base32 Crockford for encoding object IDs:\n * - 12-byte IDs (SnapshotId, ManifestId, ChunkId) → 20 characters\n * - 8-byte IDs (NodeId) → 13 characters\n *\n * Crockford Base32 alphabet: 0123456789ABCDEFGHJKMNPQRSTVWXYZ\n * (excludes I, L, O, U to avoid confusion)\n */\n\n/** Crockford Base32 encoding alphabet */\nconst ENCODE_ALPHABET = \"0123456789ABCDEFGHJKMNPQRSTVWXYZ\";\n\n/** Crockford Base32 decoding map (handles lowercase and common substitutions) */\nconst DECODE_MAP: Record<string, number> = {};\n\n// Build decode map\nfor (let i = 0; i < ENCODE_ALPHABET.length; i++) {\n const char = ENCODE_ALPHABET[i];\n DECODE_MAP[char] = i;\n DECODE_MAP[char.toLowerCase()] = i;\n}\n\n// Handle common substitutions\nDECODE_MAP[\"I\"] = DECODE_MAP[\"i\"] = 1; // I → 1\nDECODE_MAP[\"L\"] = DECODE_MAP[\"l\"] = 1; // L → 1\nDECODE_MAP[\"O\"] = DECODE_MAP[\"o\"] = 0; // O → 0\n\n/**\n * Encode bytes to Base32 Crockford string.\n *\n * @param bytes - Bytes to encode\n * @returns Base32 Crockford encoded string (uppercase)\n */\nexport function encodeBase32(bytes: Uint8Array): string {\n if (bytes.length === 0) return \"\";\n\n let result = \"\";\n let buffer = 0;\n let bitsLeft = 0;\n\n for (const byte of bytes) {\n buffer = (buffer << 8) | byte;\n bitsLeft += 8;\n\n while (bitsLeft >= 5) {\n bitsLeft -= 5;\n const index = (buffer >> bitsLeft) & 0x1f;\n result += ENCODE_ALPHABET[index];\n }\n }\n\n // Handle remaining bits\n if (bitsLeft > 0) {\n const index = (buffer << (5 - bitsLeft)) & 0x1f;\n result += ENCODE_ALPHABET[index];\n }\n\n return result;\n}\n\n/**\n * Decode Base32 Crockford string to bytes.\n *\n * @param str - Base32 Crockford encoded string\n * @returns Decoded bytes\n * @throws Error if the string contains invalid characters\n */\nexport function decodeBase32(str: string): Uint8Array {\n if (str.length === 0) return new Uint8Array(0);\n\n // Remove hyphens (Crockford allows hyphens for readability)\n str = str.replace(/-/g, \"\");\n\n const result: number[] = [];\n let buffer = 0;\n let bitsLeft = 0;\n\n for (const char of str) {\n const value = DECODE_MAP[char];\n if (value === undefined) {\n throw new Error(`Invalid Base32 Crockford character: ${char}`);\n }\n\n buffer = (buffer << 5) | value;\n bitsLeft += 5;\n\n if (bitsLeft >= 8) {\n bitsLeft -= 8;\n result.push((buffer >> bitsLeft) & 0xff);\n }\n }\n\n return new Uint8Array(result);\n}\n\n/**\n * Encode a 12-byte object ID to string.\n *\n * @param id - 12-byte ID\n * @returns Base32 Crockford encoded string (20 characters)\n */\nexport function encodeObjectId12(id: Uint8Array): string {\n if (id.length !== 12) {\n throw new Error(`Expected 12 bytes, got ${id.length}`);\n }\n return encodeBase32(id);\n}\n\n/**\n * Decode a string to 12-byte object ID.\n *\n * @param str - Base32 Crockford encoded string\n * @returns 12-byte ID\n */\nexport function decodeObjectId12(str: string): Uint8Array {\n const bytes = decodeBase32(str);\n if (bytes.length !== 12) {\n throw new Error(`Expected 12 bytes after decoding, got ${bytes.length}`);\n }\n return bytes;\n}\n\n/**\n * Encode an 8-byte object ID to string.\n *\n * @param id - 8-byte ID\n * @returns Base32 Crockford encoded string (13 characters)\n */\nexport function encodeObjectId8(id: Uint8Array): string {\n if (id.length !== 8) {\n throw new Error(`Expected 8 bytes, got ${id.length}`);\n }\n return encodeBase32(id);\n}\n\n/**\n * Decode a string to 8-byte object ID.\n *\n * @param str - Base32 Crockford encoded string\n * @returns 8-byte ID\n */\nexport function decodeObjectId8(str: string): Uint8Array {\n const bytes = decodeBase32(str);\n if (bytes.length !== 8) {\n throw new Error(`Expected 8 bytes after decoding, got ${bytes.length}`);\n }\n return bytes;\n}\n","/**\n * Parser for icechunk Repo FlatBuffer format (v2).\n *\n * Uses flatc-generated TypeScript classes for type-safe field access.\n */\n\nimport { ByteBuffer } from \"flatbuffers\";\nimport * as flexbuffers from \"flatbuffers/js/flexbuffers.js\";\nimport { Repo as FbsRepo } from \"./generated/repo.js\";\nimport { decompress } from \"../../vendor/fzstd/index.js\";\nimport {\n parseHeader,\n getDataAfterHeader,\n FileType,\n validateFileType,\n CompressionAlgorithm,\n HEADER_SIZE,\n} from \"../header.js\";\n\nconst SUPPORTED_SPEC_VERSION = 2;\n\n/**\n * S3 store config carried by a virtual chunk container, mirroring Rust's\n * `S3Options`. Drives endpoint/addressing when translating `s3://` chunk\n * locations to HTTPS — notably `region`, which lets dotted-name buckets\n * address their regional endpoint directly (required for browser CORS, since\n * the global endpoint's region redirect carries no CORS headers).\n */\nexport interface S3ContainerConfig {\n region?: string;\n endpointUrl?: string;\n forcePathStyle?: boolean;\n}\n\n/**\n * A virtual chunk container from the repo config, mirroring Rust's\n * `VirtualChunkContainer`. `name` resolves `vcc://name/...` references;\n * `urlPrefix` matches absolute chunk locations (longest prefix wins).\n */\nexport interface VirtualChunkContainer {\n name: string | null;\n urlPrefix: string;\n s3?: S3ContainerConfig;\n}\n\n/** Parsed repo file with cached metadata */\nexport interface ParsedRepo {\n repo: FbsRepo;\n specVersion: number;\n snapshotsLength: number; // Cached for bounds checking\n /**\n * Virtual chunk containers from the repo config, sorted by descending\n * `urlPrefix` length so the most specific container matches an absolute\n * location first. Empty when the repo declares no containers.\n */\n virtualChunkContainers: VirtualChunkContainer[];\n}\n\n/**\n * Parse a v2 repo file from raw file data (including icechunk header).\n *\n * @throws Error if header is invalid, file type is wrong, or spec_version is unsupported\n */\nexport function parseRepo(data: Uint8Array): ParsedRepo {\n // Validate minimum size\n if (data.length < HEADER_SIZE) {\n throw new Error(\n `Repo file too small: ${data.length} bytes, need at least ${HEADER_SIZE}`,\n );\n }\n\n // Parse and validate icechunk header\n const header = parseHeader(data);\n validateFileType(header, FileType.RepoInfo);\n\n // Get data after header and decompress if needed\n let fbData = getDataAfterHeader(data);\n if (header.compression === CompressionAlgorithm.Zstd) {\n fbData = decompress(fbData);\n }\n\n // Parse FlatBuffer root table\n const bb = new ByteBuffer(fbData);\n const repo = FbsRepo.getRootAsRepo(bb);\n const specVersion = repo.specVersion();\n\n if (specVersion !== SUPPORTED_SPEC_VERSION) {\n throw new Error(\n `Unsupported repo spec version: ${specVersion}, expected ${SUPPORTED_SPEC_VERSION}`,\n );\n }\n\n const snapshotsLength = repo.snapshotsLength();\n const virtualChunkContainers = parseVirtualChunkContainers(repo);\n\n return { repo, specVersion, snapshotsLength, virtualChunkContainers };\n}\n\n/**\n * Extract virtual chunk containers from the flexbuffers-encoded\n * RepositoryConfig, including each container's S3 store config (region/\n * endpoint/addressing). Unnamed containers are included too — they still\n * match absolute chunk locations by `urlPrefix` even though they can't be\n * referenced by `vcc://name`. Returned sorted by descending `urlPrefix`\n * length so the most specific container matches first.\n *\n * Returns an empty array when the config is absent or malformed. Parsing\n * failures are swallowed because virtual chunk resolution is best-effort; a\n * `vcc://` location with no matching name surfaces a clear error at fetch time.\n */\nfunction parseVirtualChunkContainers(repo: FbsRepo): VirtualChunkContainer[] {\n const result: VirtualChunkContainer[] = [];\n const configBytes = repo.configArray();\n if (!configBytes || configBytes.length === 0) return result;\n\n let config: unknown;\n try {\n const ab = configBytes.buffer.slice(\n configBytes.byteOffset,\n configBytes.byteOffset + configBytes.byteLength,\n ) as ArrayBuffer;\n config = flexbuffers.toObject(ab);\n } catch {\n return result;\n }\n\n if (!isRecord(config)) return result;\n const containers = config.virtual_chunk_containers;\n if (!isRecord(containers)) return result;\n\n for (const container of Object.values(containers)) {\n if (!isRecord(container)) continue;\n const urlPrefix = container.url_prefix;\n if (typeof urlPrefix !== \"string\") continue;\n const name = typeof container.name === \"string\" ? container.name : null;\n const s3 = parseS3Store(container.store);\n result.push(s3 ? { name, urlPrefix, s3 } : { name, urlPrefix });\n }\n\n // Most specific (longest) url_prefix first, so absolute-location matching\n // prefers the narrowest container.\n result.sort((a, b) => b.urlPrefix.length - a.urlPrefix.length);\n return result;\n}\n\n/**\n * Parse the S3-family store config from a container's `store`. The `s3`,\n * `s3_compatible`, and `tigris` ObjectStoreConfig variants all share Rust's\n * `S3Options` shape; gcs/azure/http/local stores yield undefined.\n */\nfunction parseS3Store(store: unknown): S3ContainerConfig | undefined {\n if (!isRecord(store)) return undefined;\n const s3 = store.s3 ?? store.s3_compatible ?? store.tigris;\n if (!isRecord(s3)) return undefined;\n const cfg: S3ContainerConfig = {};\n if (typeof s3.region === \"string\") cfg.region = s3.region;\n if (typeof s3.endpoint_url === \"string\") cfg.endpointUrl = s3.endpoint_url;\n if (typeof s3.force_path_style === \"boolean\") {\n cfg.forcePathStyle = s3.force_path_style;\n }\n return cfg;\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\n/**\n * Compare two byte arrays by UTF-8 byte order (matching Rust's Ord for String).\n */\nfunction compareUtf8ByteOrder(aBytes: Uint8Array, bBytes: Uint8Array): number {\n const minLen = Math.min(aBytes.length, bBytes.length);\n\n for (let i = 0; i < minLen; i++) {\n if (aBytes[i] < bBytes[i]) return -1;\n if (aBytes[i] > bBytes[i]) return 1;\n }\n\n return aBytes.length - bBytes.length;\n}\n\n/**\n * Binary search for a ref by name in tags or branches.\n *\n * @returns Snapshot ID bytes if found, null otherwise\n * @throws Error on corrupted data (null tables, invalid indices)\n */\nfunction binarySearchRef(\n parsedRepo: ParsedRepo,\n accessor: (index: number) => ReturnType<FbsRepo[\"tags\"]>,\n length: number,\n name: string,\n): Uint8Array | null {\n const { snapshotsLength } = parsedRepo;\n if (length === 0) return null;\n\n // Cache target bytes outside loop\n const targetBytes = new TextEncoder().encode(name);\n\n let low = 0;\n let high = length - 1;\n\n while (low <= high) {\n const mid = (low + high) >>> 1;\n const refTable = accessor(mid);\n\n if (!refTable) {\n throw new Error(`Corrupted repo file: null ref table at index ${mid}`);\n }\n\n const refName = refTable.name();\n if (refName === null) {\n throw new Error(`Corrupted repo file: null ref name at index ${mid}`);\n }\n\n const refNameBytes = new TextEncoder().encode(refName);\n const cmp = compareUtf8ByteOrder(refNameBytes, targetBytes);\n\n if (cmp < 0) {\n low = mid + 1;\n } else if (cmp > 0) {\n high = mid - 1;\n } else {\n // Found - validate and return snapshot ID\n const snapshotIndex = refTable.snapshotIndex();\n\n if (snapshotIndex >= snapshotsLength) {\n throw new Error(\n `Invalid snapshot index ${snapshotIndex} for ref '${name}', ` +\n `snapshots array has ${snapshotsLength} entries`,\n );\n }\n\n return getSnapshotIdByIndex(parsedRepo, snapshotIndex);\n }\n }\n\n return null;\n}\n\n/**\n * Get snapshot ID by index from the snapshots vector.\n *\n * @throws Error on corrupted data (null snapshot, missing id)\n */\nfunction getSnapshotIdByIndex(\n parsedRepo: ParsedRepo,\n index: number,\n): Uint8Array {\n const snapshotInfo = parsedRepo.repo.snapshots(index);\n if (!snapshotInfo) {\n throw new Error(`Corrupted repo file: null snapshot at index ${index}`);\n }\n\n const idObj = snapshotInfo.id();\n if (!idObj) {\n throw new Error(`Corrupted repo file: snapshot ${index} missing id`);\n }\n\n return idObj.bb!.bytes().slice(idObj.bb_pos, idObj.bb_pos + 12);\n}\n\n/**\n * List all ref names from tags or branches.\n *\n * @throws Error on corrupted data (null tables, null names)\n */\nfunction listRefs(\n accessor: (index: number) => ReturnType<FbsRepo[\"tags\"]>,\n length: number,\n): string[] {\n const names: string[] = [];\n\n for (let i = 0; i < length; i++) {\n const refTable = accessor(i);\n if (!refTable) {\n throw new Error(`Corrupted repo file: null ref table at index ${i}`);\n }\n const name = refTable.name();\n if (name === null) {\n throw new Error(`Corrupted repo file: null ref name at index ${i}`);\n }\n names.push(name);\n }\n\n return names;\n}\n\n/**\n * Resolve a branch name to its snapshot ID.\n *\n * @returns Snapshot ID bytes if found, null otherwise\n */\nexport function resolveBranch(\n parsedRepo: ParsedRepo,\n name: string,\n): Uint8Array | null {\n const { repo } = parsedRepo;\n return binarySearchRef(\n parsedRepo,\n (i) => repo.branches(i),\n repo.branchesLength(),\n name,\n );\n}\n\n/**\n * Resolve a tag name to its snapshot ID.\n *\n * @returns Snapshot ID bytes if found, null otherwise\n */\nexport function resolveTag(\n parsedRepo: ParsedRepo,\n name: string,\n): Uint8Array | null {\n const { repo } = parsedRepo;\n return binarySearchRef(\n parsedRepo,\n (i) => repo.tags(i),\n repo.tagsLength(),\n name,\n );\n}\n\n/**\n * List all branch names in the repository.\n *\n * @returns Array of branch names (in storage order, which is sorted)\n */\nexport function listBranchesFromRepo(parsedRepo: ParsedRepo): string[] {\n const { repo } = parsedRepo;\n return listRefs((i) => repo.branches(i), repo.branchesLength());\n}\n\n/**\n * List all active tag names in the repository.\n *\n * Note: Returns only active tags from the tags vector, not deleted_tags.\n *\n * @returns Array of tag names (in storage order, which is sorted)\n */\nexport function listTagsFromRepo(parsedRepo: ParsedRepo): string[] {\n const { repo } = parsedRepo;\n return listRefs((i) => repo.tags(i), repo.tagsLength());\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class MetadataItem {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): MetadataItem {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsMetadataItem(\n bb: flatbuffers.ByteBuffer,\n obj?: MetadataItem,\n ): MetadataItem {\n return (obj || new MetadataItem()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n name(): string | null;\n name(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n name(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n value(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n valueLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n valueArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class Ref {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): Ref {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsRef(bb: flatbuffers.ByteBuffer, obj?: Ref): Ref {\n return (obj || new Ref()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n name(): string | null;\n name(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n name(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n snapshotIndex(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.readUint32(this.bb_pos + offset) : 0;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { RepoAvailability } from \"../generated/repo-availability.js\";\n\nexport class RepoStatus {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): RepoStatus {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsRepoStatus(\n bb: flatbuffers.ByteBuffer,\n obj?: RepoStatus,\n ): RepoStatus {\n return (obj || new RepoStatus()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n availability(): RepoAvailability {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.readUint8(this.bb_pos + offset)\n : RepoAvailability.Online;\n }\n\n setAt(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n limitedAvailabilityReason(): string | null;\n limitedAvailabilityReason(\n optionalEncoding: flatbuffers.Encoding,\n ): string | Uint8Array | null;\n limitedAvailabilityReason(\n optionalEncoding?: any,\n ): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class ObjectId12 {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ObjectId12 {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n bytes(index: number): number | null {\n return this.bb!.readUint8(this.bb_pos + 0 + index);\n }\n\n static sizeOf(): number {\n return 12;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { MetadataItem } from \"../generated/metadata-item.js\";\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class SnapshotInfo {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): SnapshotInfo {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsSnapshotInfo(\n bb: flatbuffers.ByteBuffer,\n obj?: SnapshotInfo,\n ): SnapshotInfo {\n return (obj || new SnapshotInfo()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n id(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n parentOffset(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.readInt32(this.bb_pos + offset) : 0;\n }\n\n flushedAt(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n message(): string | null;\n message(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n message(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n metadata(index: number, obj?: MetadataItem): MetadataItem | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? (obj || new MetadataItem()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n metadataLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n prunedAncestorTxLogs(index: number, obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? (obj || new ObjectId12()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 12,\n this.bb!,\n )\n : null;\n }\n\n prunedAncestorTxLogsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { UpdateType } from \"../generated/update-type.js\";\n\nexport class Update {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): Update {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsUpdate(bb: flatbuffers.ByteBuffer, obj?: Update): Update {\n return (obj || new Update()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n updateTypeType(): UpdateType {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset ? this.bb!.readUint8(this.bb_pos + offset) : UpdateType.NONE;\n }\n\n updateType(obj: any): any | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__union(obj, this.bb_pos + offset) : null;\n }\n\n updatedAt(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n backupPath(): string | null;\n backupPath(\n optionalEncoding: flatbuffers.Encoding,\n ): string | Uint8Array | null;\n backupPath(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { MetadataItem } from \"../generated/metadata-item.js\";\nimport { Ref } from \"../generated/ref.js\";\nimport { RepoStatus } from \"../generated/repo-status.js\";\nimport { SnapshotInfo } from \"../generated/snapshot-info.js\";\nimport { Update } from \"../generated/update.js\";\n\nexport class Repo {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): Repo {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsRepo(bb: flatbuffers.ByteBuffer, obj?: Repo): Repo {\n return (obj || new Repo()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n specVersion(): number {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset ? this.bb!.readUint8(this.bb_pos + offset) : 0;\n }\n\n tags(index: number, obj?: Ref): Ref | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new Ref()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n tagsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n branches(index: number, obj?: Ref): Ref | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? (obj || new Ref()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n branchesLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n deletedTags(index: number): string;\n deletedTags(\n index: number,\n optionalEncoding: flatbuffers.Encoding,\n ): string | Uint8Array;\n deletedTags(\n index: number,\n optionalEncoding?: any,\n ): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? this.bb!.__string(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n optionalEncoding,\n )\n : null;\n }\n\n deletedTagsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n snapshots(index: number, obj?: SnapshotInfo): SnapshotInfo | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? (obj || new SnapshotInfo()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n snapshotsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n status(obj?: RepoStatus): RepoStatus | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? (obj || new RepoStatus()).__init(\n this.bb!.__indirect(this.bb_pos + offset),\n this.bb!,\n )\n : null;\n }\n\n metadata(index: number, obj?: MetadataItem): MetadataItem | null {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset\n ? (obj || new MetadataItem()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n metadataLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n latestUpdates(index: number, obj?: Update): Update | null {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset\n ? (obj || new Update()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n latestUpdatesLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n repoBeforeUpdates(): string | null;\n repoBeforeUpdates(\n optionalEncoding: flatbuffers.Encoding,\n ): string | Uint8Array | null;\n repoBeforeUpdates(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n config(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n configLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n configArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n enabledFeatureFlags(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 24);\n return offset\n ? this.bb!.readUint16(this.bb!.__vector(this.bb_pos + offset) + index * 2)\n : 0;\n }\n\n enabledFeatureFlagsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 24);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n enabledFeatureFlagsArray(): Uint16Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 24);\n return offset\n ? new Uint16Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n disabledFeatureFlags(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 26);\n return offset\n ? this.bb!.readUint16(this.bb!.__vector(this.bb_pos + offset) + index * 2)\n : 0;\n }\n\n disabledFeatureFlagsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 26);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n disabledFeatureFlagsArray(): Uint16Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 26);\n return offset\n ? new Uint16Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 28);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 28);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 28);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","/**\n * Vendored from fzstd — https://github.com/101arrowz/fzstd\n * MIT License, Copyright (c) 2020 Arjun Barrett. See ./LICENSE.\n *\n * Source: the unmerged dictionary-decompression PR #18\n * (https://github.com/101arrowz/fzstd/pull/18), branch\n * `handlerug:push-qxkytkvukoqs` @ a6aacee, which adds the optional `dic`\n * (dictionary) argument to `decompress()` and the `Decompress` stream.\n *\n * Why vendored: icechunk's dictionary-compressed virtual chunk locations need\n * zstd dictionary decompression, which released fzstd 0.1.1 lacks. PR #18 is\n * still unmerged/unreleased and the fork can't be cleanly npm-installed (no\n * committed dist, no prepare hook). The alternative decoder (zstdify) silently\n * corrupts ~32% of real icechunk metadata, so fzstd is the only correct option.\n * See ../../format/flatbuffers/manifest-parser.ts.\n *\n * This copy is byte-identical to the branch — no local edits. The branch now\n * includes both the dictionary/output-buffer aliasing fix (handlerug/fzstd#1)\n * and the dictionary history-window sizing fix (a6aacee) — both found and\n * contributed from here, now merged — so there is no longer a local patch to\n * re-apply. To update, re-vendor src/index.ts + LICENSE from the branch.\n *\n * Verified: byte-exact vs released fzstd on all 244 icechunk fixtures, plus\n * correct dictionary decode vs the reference `zstd` CLI.\n */\n/* eslint-disable */\n// @ts-nocheck\n\n// Some numerical data is initialized as -1 even when it doesn't need initialization to help the JIT infer types\n\n// aliases for shorter compressed code (most minifers don't do this)\nconst ab = ArrayBuffer, u8 = Uint8Array, u16 = Uint16Array, i16 = Int16Array, u32 = Uint32Array, i32 = Int32Array;\n\n// Huffman decoding table\ninterface HDT {\n // initial bits\n b: number;\n // symbols\n s: Uint8Array;\n // num bits\n n: Uint8Array;\n}\n\n// FSE decoding table\ninterface FSEDT extends HDT {\n // next state\n t: Uint16Array;\n}\n\n// decompress Zstandard state\ninterface DZstdState {\n // byte\n b: number;\n // out byte\n y: number;\n // dictionary ID\n d: number;\n // window\n w: Uint8Array;\n // max block size\n m: number;\n // uncompressed size\n u: number;\n // has checksum\n c: number;\n // offsets\n o: Int32Array;\n // window head\n e: number;\n // last huffman decoding table\n h?: HDT;\n // last FSE decoding tables\n t?: [FSEDT, FSEDT, FSEDT];\n // last block\n l: number;\n}\n\nconst slc = (v: Uint8Array, s: number, e?: number) => {\n if (u8.prototype.slice) return u8.prototype.slice.call(v, s, e);\n if (s == null || s < 0) s = 0;\n if (e == null || e > v.length) e = v.length;\n const n = new u8(e - s);\n n.set(v.subarray(s, e));\n return n;\n};\n\nconst fill = (v: Uint8Array, n: number, s?: number, e?: number) => {\n if (u8.prototype.fill) return u8.prototype.fill.call(v, n, s, e);\n if (s == null || s < 0) s = 0;\n if (e == null || e > v.length) e = v.length;\n for (; s < e; ++s) v[s] = n;\n return v;\n};\n\nconst cpw = (v: Uint8Array, t: number, s?: number, e?: number) => {\n if (u8.prototype.copyWithin) return u8.prototype.copyWithin.call(v, t, s, e);\n if (s == null || s < 0) s = 0;\n if (e == null || e > v.length) e = v.length;\n while (s < e) {\n v[t++] = v[s++];\n }\n};\n\n/**\n * Codes for errors generated within this library\n */\nexport const ZstdErrorCode = {\n InvalidData: 0,\n WindowSizeTooLarge: 1,\n InvalidBlockType: 2,\n FSEAccuracyTooHigh: 3,\n DistanceTooFarBack: 4,\n UnexpectedEOF: 5,\n WrongDictionary: 6\n} as const;\n\ntype ZEC = (typeof ZstdErrorCode)[keyof typeof ZstdErrorCode];\n\n// error codes\nconst ec: Record<ZEC, string | undefined> = [\n 'invalid zstd data',\n 'window size too large (>2046MB)',\n 'invalid block type',\n 'FSE accuracy too high',\n 'match distance too far back',\n 'unexpected EOF',\n 'wrong dictionary'\n];\n\n/**\n * An error generated within this library\n */\nexport interface ZstdError extends Error {\n /**\n * The code associated with this error\n */\n code: ZEC;\n}\n\nconst err = (ind: ZEC, msg?: string | 0, nt?: 1) => {\n const e: Partial<ZstdError> = new Error(msg || ec[ind]);\n e.code = ind;\n if (Error.captureStackTrace) Error.captureStackTrace(e, err);\n if (!nt) throw e;\n return e as ZstdError;\n};\n\nconst rb = (d: Uint8Array, b: number, n: number) => {\n let i = 0, o = 0;\n for (; i < n; ++i) o |= d[b++] << (i << 3);\n return o;\n};\n\nconst b4 = (d: Uint8Array, b: number) => (d[b] | (d[b + 1] << 8) | (d[b + 2] << 16) | (d[b + 3] << 24)) >>> 0;\n\n// apply a dictionary to decompressor state\nconst rdic = (dic: Uint8Array, st: DZstdState) => {\n if (b4(dic, 0) == 0xec30a437) {\n if (st.d && st.d !== b4(dic, 4)) err(6);\n let bt = 8;\n [bt, st.h] = rhu(dic, bt);\n let mlt: FSEDT, olt: FSEDT, llt: FSEDT;\n [bt, olt] = rfse(dic, bt, 8);\n [bt, mlt] = rfse(dic, bt, 9);\n [bt, llt] = rfse(dic, bt, 9);\n st.t = [mlt, olt, llt];\n st.o = new i32([b4(dic, bt), b4(dic, bt + 4), b4(dic, bt + 8)]);\n dic = dic.subarray(bt + 12);\n }\n const wl = Math.max(dic.length, st.u ? Math.min(st.e, dic.length + st.u) : st.e);\n st.w = new u8(wl);\n st.w.set(dic, wl - dic.length);\n st.e = wl;\n};\n\n// read Zstandard frame header\nconst rzfh = (dat: Uint8Array, w?: Uint8Array | 1): number | DZstdState => {\n const n3 = dat[0] | (dat[1] << 8) | (dat[2] << 16);\n if (n3 == 0x2FB528 && dat[3] == 253) {\n // Zstandard\n const flg = dat[4];\n // single segment checksum dict flag frame content flag\n const ss = (flg >> 5) & 1, cc = (flg >> 2) & 1, df = flg & 3, fcf = flg >> 6;\n if (flg & 8) err(0);\n // byte\n let bt = 6 - ss;\n // dict bytes\n const db = df == 3 ? 4 : df;\n // dictionary id\n const di = rb(dat, bt, db);\n bt += db;\n // frame size bytes\n const fsb = fcf ? (1 << fcf) : ss;\n // frame source size\n const fss = rb(dat, bt, fsb) + ((fcf == 1) && 256);\n // window size\n let ws = fss;\n if (!ss) {\n // window descriptor\n const wb = 1 << (10 + (dat[5] >> 3));\n ws = wb + (wb >> 3) * (dat[5] & 7);\n }\n if (ws > 2145386496) err(1);\n const buf = new u8((w == 1 ? (fss || ws) : w ? 0 : ws) + 12);\n buf[0] = 1, buf[4] = 4, buf[8] = 8;\n return {\n b: bt + fsb,\n y: 0,\n l: 0,\n d: di,\n w: (w && w != 1) ? w : buf.subarray(12),\n e: ws,\n o: new i32(buf.buffer, 0, 3),\n u: fss,\n c: cc,\n m: Math.min(131072, ws)\n };\n } else if (((n3 >> 4) | (dat[3] << 20)) == 0x184D2A5) {\n // skippable\n return b4(dat, 4) + 8;\n }\n err(0);\n};\n\n// most significant bit for nonzero\nconst msb = (val: number) => {\n let bits = 0;\n for (; (1 << bits) <= val; ++bits);\n return bits - 1;\n};\n\n// read finite state entropy\nconst rfse = (dat: Uint8Array, bt: number, mal: number): [number, FSEDT] => {\n // table pos\n let tpos = (bt << 3) + 4;\n // accuracy log\n const al = (dat[bt] & 15) + 5;\n if (al > mal) err(3);\n // size\n const sz = 1 << al;\n // probabilities symbols repeat index high threshold\n let probs = sz, sym = -1, re = -1, i = -1, ht = sz;\n // optimization: single allocation is much faster\n const buf = new ab(512 + (sz << 2));\n const freq = new i16(buf, 0, 256);\n // same view as freq\n const dstate = new u16(buf, 0, 256);\n const nstate = new u16(buf, 512, sz);\n const bb1 = 512 + (sz << 1);\n const syms = new u8(buf, bb1, sz);\n const nbits = new u8(buf, bb1 + sz);\n while (sym < 255 && probs > 0) {\n const bits = msb(probs + 1);\n const cbt = tpos >> 3;\n // mask\n const msk = (1 << (bits + 1)) - 1;\n let val = ((dat[cbt] | (dat[cbt + 1] << 8) | (dat[cbt + 2] << 16)) >> (tpos & 7)) & msk;\n // mask (1 fewer bit)\n const msk1fb = (1 << bits) - 1;\n // max small value\n const msv = msk - probs - 1;\n // small value\n const sval = val & msk1fb;\n if (sval < msv) tpos += bits, val = sval;\n else {\n tpos += bits + 1;\n if (val > msk1fb) val -= msv;\n }\n freq[++sym] = --val;\n if (val == -1) {\n probs += val;\n syms[--ht] = sym;\n } else probs -= val;\n if (!val) {\n do {\n // repeat byte\n const rbt = tpos >> 3;\n re = ((dat[rbt] | (dat[rbt + 1] << 8)) >> (tpos & 7)) & 3;\n tpos += 2;\n sym += re;\n } while (re == 3);\n }\n }\n if (sym > 255 || probs) err(0);\n let sympos = 0;\n // sym step (coprime with sz - formula from zstd source)\n const sstep = (sz >> 1) + (sz >> 3) + 3;\n // sym mask\n const smask = sz - 1;\n for (let s = 0; s <= sym; ++s) {\n const sf = freq[s];\n if (sf < 1) {\n dstate[s] = -sf;\n continue;\n }\n // This is split into two loops in zstd to avoid branching, but as JS is higher-level that is unnecessary\n for (i = 0; i < sf; ++i) {\n syms[sympos] = s;\n do {\n sympos = (sympos + sstep) & smask;\n } while (sympos >= ht);\n }\n }\n // After spreading symbols, should be zero again\n if (sympos) err(0);\n for (i = 0; i < sz; ++i) {\n // next state\n const ns = dstate[syms[i]]++;\n // num bits\n const nb = nbits[i] = al - msb(ns);\n nstate[i] = (ns << nb) - sz;\n }\n return [(tpos + 7) >> 3, {\n b: al,\n s: syms,\n n: nbits,\n t: nstate\n }];\n};\n\n// read huffman\nconst rhu = (dat: Uint8Array, bt: number): [number, HDT] => {\n // index weight count\n let i = 0, wc = -1;\n // buffer header byte\n const buf = new u8(292), hb = dat[bt];\n // huffman weights\n const hw = buf.subarray(0, 256);\n // rank count\n const rc = buf.subarray(256, 268);\n // rank index\n const ri = new u16(buf.buffer, 268);\n // NOTE: at this point bt is 1 less than expected\n if (hb < 128) {\n // end byte, fse decode table\n const [ebt, fdt] = rfse(dat, bt + 1, 6);\n bt += hb;\n const epos = ebt << 3;\n // last byte\n const lb = dat[bt];\n if (!lb) err(0);\n // state1 state2 state1 bits state2 bits\n let st1 = 0, st2 = 0, btr1 = fdt.b, btr2 = btr1;\n // fse pos\n // pre-increment to account for original deficit of 1\n let fpos = (++bt << 3) - 8 + msb(lb);\n for (;;) {\n fpos -= btr1;\n if (fpos < epos) break;\n let cbt = fpos >> 3;\n st1 += ((dat[cbt] | (dat[cbt + 1] << 8)) >> (fpos & 7)) & ((1 << btr1) - 1);\n hw[++wc] = fdt.s[st1];\n fpos -= btr2;\n if (fpos < epos) break;\n cbt = fpos >> 3;\n st2 += ((dat[cbt] | (dat[cbt + 1] << 8)) >> (fpos & 7)) & ((1 << btr2) - 1);\n hw[++wc] = fdt.s[st2];\n btr1 = fdt.n[st1];\n st1 = fdt.t[st1];\n btr2 = fdt.n[st2];\n st2 = fdt.t[st2];\n }\n if (++wc > 255) err(0);\n } else {\n wc = hb - 127;\n for (; i < wc; i += 2) {\n const byte = dat[++bt];\n hw[i] = byte >> 4;\n hw[i + 1] = byte & 15;\n }\n ++bt;\n }\n // weight exponential sum\n let wes = 0;\n for (i = 0; i < wc; ++i) {\n const wt = hw[i];\n // bits must be at most 11, same as weight\n if (wt > 11) err(0);\n wes += wt && (1 << (wt - 1));\n }\n // max bits\n const mb = msb(wes) + 1;\n // table size\n const ts = 1 << mb;\n // remaining sum\n const rem = ts - wes;\n // must be power of 2\n if (rem & (rem - 1)) err(0);\n hw[wc++] = msb(rem) + 1;\n for (i = 0; i < wc; ++i) {\n const wt = hw[i];\n ++rc[hw[i] = wt && (mb + 1 - wt)];\n }\n // huf buf\n const hbuf = new u8(ts << 1);\n // symbols num bits\n const syms = hbuf.subarray(0, ts), nb = hbuf.subarray(ts);\n ri[mb] = 0;\n for (i = mb; i > 0; --i) {\n const pv = ri[i];\n fill(nb, i, pv, ri[i - 1] = pv + rc[i] * (1 << (mb - i)));\n }\n if (ri[0] != ts) err(0);\n for (i = 0; i < wc; ++i) {\n const bits = hw[i];\n if (bits) {\n const code = ri[bits];\n fill(syms, i, code, ri[bits] = code + (1 << (mb - bits)));\n }\n }\n return [bt, {\n n: nb,\n b: mb,\n s: syms\n }];\n};\n\n// Tables generated using this:\n// https://gist.github.com/101arrowz/a979452d4355992cbf8f257cbffc9edd\n\n// default literal length table\nconst dllt = /*#__PURE__*/ rfse(/*#__PURE__*/ new u8([\n 81, 16, 99, 140, 49, 198, 24, 99, 12, 33, 196, 24, 99, 102, 102, 134, 70, 146, 4\n]), 0, 6)[1];\n\n// default match length table\nconst dmlt = /*#__PURE__*/ rfse(/*#__PURE__*/ new u8([\n 33, 20, 196, 24, 99, 140, 33, 132, 16, 66, 8, 33, 132, 16, 66, 8, 33, 68, 68, 68, 68, 68, 68, 68, 68, 36, 9\n]), 0, 6)[1];\n\n// default offset code table\nconst doct = /*#__PURE__ */ rfse(/*#__PURE__*/ new u8([\n 32, 132, 16, 66, 102, 70, 68, 68, 68, 68, 36, 73, 2\n]), 0, 5)[1];\n\n// bits to baseline\nconst b2bl = (b: Uint8Array, s: number) => {\n const len = b.length, bl = new i32(len);\n for (let i = 0; i < len; ++i) {\n bl[i] = s;\n s += 1 << b[i];\n }\n return bl;\n};\n\n// literal length bits\nconst llb = /*#__PURE__ */ new u8((/*#__PURE__ */ new i32([\n 0, 0, 0, 0, 16843009, 50528770, 134678020, 202050057, 269422093\n])).buffer, 0, 36);\n\n// literal length baseline\nconst llbl = /*#__PURE__ */ b2bl(llb, 0);\n\n// match length bits\nconst mlb = /*#__PURE__ */ new u8((/*#__PURE__ */ new i32([\n 0, 0, 0, 0, 0, 0, 0, 0, 16843009, 50528770, 117769220, 185207048, 252579084, 16\n])).buffer, 0, 53);\n\n// match length baseline\nconst mlbl = /*#__PURE__ */ b2bl(mlb, 3);\n\n// decode huffman stream\nconst dhu = (dat: Uint8Array, out: Uint8Array, hu: HDT) => {\n const len = dat.length, ss = out.length, lb = dat[len - 1], msk = (1 << hu.b) - 1, eb = -hu.b;\n if (!lb) err(0);\n let st = 0, btr = hu.b, pos = (len << 3) - 8 + msb(lb) - btr, i = -1;\n for (; pos > eb && i < ss;) {\n const cbt = pos >> 3;\n const val = (dat[cbt] | (dat[cbt + 1] << 8) | (dat[cbt + 2] << 16)) >> (pos & 7);\n st = ((st << btr) | val) & msk;\n out[++i] = hu.s[st];\n pos -= (btr = hu.n[st]);\n }\n if (pos != eb || i + 1 != ss) err(0);\n};\n\n// decode huffman stream 4x\n// TODO: use workers to parallelize\nconst dhu4 = (dat: Uint8Array, out: Uint8Array, hu: HDT) => {\n let bt = 6;\n const ss = out.length, sz1 = (ss + 3) >> 2, sz2 = sz1 << 1, sz3 = sz1 + sz2;\n dhu(dat.subarray(bt, bt += dat[0] | (dat[1] << 8)), out.subarray(0, sz1), hu);\n dhu(dat.subarray(bt, bt += dat[2] | (dat[3] << 8)), out.subarray(sz1, sz2), hu);\n dhu(dat.subarray(bt, bt += dat[4] | (dat[5] << 8)), out.subarray(sz2, sz3), hu);\n dhu(dat.subarray(bt), out.subarray(sz3), hu);\n};\n\n// read Zstandard block\nconst rzb = (dat: Uint8Array, st: DZstdState, out?: Uint8Array) => {\n let bt = st.b;\n // byte 0 block type\n const b0 = dat[bt], btype = (b0 >> 1) & 3;\n st.l = b0 & 1;\n const sz = (b0 >> 3) | (dat[bt + 1] << 5) | (dat[bt + 2] << 13);\n // end byte for block\n const ebt = (bt += 3) + sz;\n if (btype == 1) {\n if (bt >= dat.length) return;\n st.b = bt + 1;\n if (out) {\n fill(out, dat[bt], st.y, st.y += sz);\n return out;\n }\n return fill(new u8(sz), dat[bt]);\n }\n if (ebt > dat.length) return;\n if (btype == 0) {\n st.b = ebt;\n if (out) {\n out.set(dat.subarray(bt, ebt), st.y);\n st.y += sz;\n return out;\n }\n return slc(dat, bt, ebt);\n }\n if (btype == 2) {\n // byte 3 lit btype size format\n const b3 = dat[bt], lbt = b3 & 3, sf = (b3 >> 2) & 3;\n // lit src size lit cmp sz 4 streams\n let lss = b3 >> 4, lcs = 0, s4 = 0;\n if (lbt < 2) {\n if (sf & 1) lss |= (dat[++bt] << 4) | ((sf & 2) && (dat[++bt] << 12));\n else lss = b3 >> 3;\n } else {\n s4 = sf;\n if (sf < 2) lss |= ((dat[++bt] & 63) << 4), lcs = (dat[bt] >> 6) | (dat[++bt] << 2);\n else if (sf == 2) lss |= (dat[++bt] << 4) | ((dat[++bt] & 3) << 12), lcs = (dat[bt] >> 2) | (dat[++bt] << 6);\n else lss |= (dat[++bt] << 4) | ((dat[++bt] & 63) << 12), lcs = (dat[bt] >> 6) | (dat[++bt] << 2) | (dat[++bt] << 10);\n }\n ++bt;\n // add literals to end - can never overlap with backreferences because unused literals always appended\n let buf = out ? out.subarray(st.y, st.y + st.m) : new u8(st.m);\n // starting point for literals\n let spl = buf.length - lss;\n if (lbt == 0) buf.set(dat.subarray(bt, bt += lss), spl);\n else if (lbt == 1) fill(buf, dat[bt++], spl);\n else {\n // huffman table\n let hu = st.h;\n if (lbt == 2) {\n const hud = rhu(dat, bt);\n // subtract description length\n lcs += bt - (bt = hud[0]);\n st.h = hu = hud[1];\n }\n else if (!hu) err(0);\n (s4 ? dhu4 : dhu)(dat.subarray(bt, bt += lcs), buf.subarray(spl), hu);\n }\n // num sequences\n let ns = dat[bt++];\n if (ns) {\n if (ns == 255) ns = (dat[bt++] | (dat[bt++] << 8)) + 0x7F00;\n else if (ns > 127) ns = ((ns - 128) << 8) | dat[bt++];\n // symbol compression modes\n const scm = dat[bt++];\n if (scm & 3) err(0);\n const dts: [FSEDT, FSEDT, FSEDT] = [dmlt, doct, dllt];\n for (let i = 2; i > -1; --i) {\n const md = (scm >> ((i << 1) + 2)) & 3;\n if (md == 1) {\n // rle buf\n const rbuf = new u8([0, 0, dat[bt++]]);\n dts[i] = {\n s: rbuf.subarray(2, 3),\n n: rbuf.subarray(0, 1),\n t: new u16(rbuf.buffer, 0, 1),\n b: 0\n };\n } else if (md == 2) {\n // accuracy log 8 for offsets, 9 for others\n [bt, dts[i]] = rfse(dat, bt, 9 - (i & 1));\n } else if (md == 3) {\n if (!st.t) err(0);\n dts[i] = st.t[i];\n }\n }\n const [mlt, oct, llt] = st.t = dts;\n const lb = dat[ebt - 1];\n if (!lb) err(0);\n let spos = (ebt << 3) - 8 + msb(lb) - llt.b, cbt = spos >> 3, oubt = 0;\n let lst = ((dat[cbt] | (dat[cbt + 1] << 8)) >> (spos & 7)) & ((1 << llt.b) - 1);\n cbt = (spos -= oct.b) >> 3;\n let ost = ((dat[cbt] | (dat[cbt + 1] << 8)) >> (spos & 7)) & ((1 << oct.b) - 1);\n cbt = (spos -= mlt.b) >> 3;\n let mst = ((dat[cbt] | (dat[cbt + 1] << 8)) >> (spos & 7)) & ((1 << mlt.b) - 1);\n for (++ns; --ns;) {\n const llc = llt.s[lst];\n const lbtr = llt.n[lst];\n const mlc = mlt.s[mst];\n const mbtr = mlt.n[mst];\n const ofc = oct.s[ost];\n const obtr = oct.n[ost];\n\n cbt = (spos -= ofc) >> 3;\n const ofp = 1 << ofc;\n let off = ofp + (((dat[cbt] | (dat[cbt + 1] << 8) | (dat[cbt + 2] << 16) | (dat[cbt + 3] << 24)) >>> (spos & 7)) & (ofp - 1));\n cbt = (spos -= mlb[mlc]) >> 3;\n let ml = mlbl[mlc] + (((dat[cbt] | (dat[cbt + 1] << 8) | (dat[cbt + 2] << 16)) >> (spos & 7)) & ((1 << mlb[mlc]) - 1));\n cbt = (spos -= llb[llc]) >> 3;\n const ll = llbl[llc] + (((dat[cbt] | (dat[cbt + 1] << 8) | (dat[cbt + 2] << 16)) >> (spos & 7)) & ((1 << llb[llc]) - 1));\n\n cbt = (spos -= lbtr) >> 3;\n lst = llt.t[lst] + (((dat[cbt] | (dat[cbt + 1] << 8)) >> (spos & 7)) & ((1 << lbtr) - 1));\n cbt = (spos -= mbtr) >> 3;\n mst = mlt.t[mst] + (((dat[cbt] | (dat[cbt + 1] << 8)) >> (spos & 7)) & ((1 << mbtr) - 1));\n cbt = (spos -= obtr) >> 3;\n ost = oct.t[ost] + (((dat[cbt] | (dat[cbt + 1] << 8)) >> (spos & 7)) & ((1 << obtr) - 1));\n\n if (off > 3) {\n st.o[2] = st.o[1];\n st.o[1] = st.o[0];\n st.o[0] = off -= 3;\n } else {\n const idx = off - ((ll != 0) as unknown as number);\n if (idx) {\n off = idx == 3 ? st.o[0] - 1 : st.o[idx];\n if (idx > 1) st.o[2] = st.o[1];\n st.o[1] = st.o[0];\n st.o[0] = off;\n } else off = st.o[0];\n }\n for (let i = 0; i < ll; ++i) {\n buf[oubt + i] = buf[spl + i];\n }\n oubt += ll, spl += ll;\n let stin = oubt - off;\n if (stin < 0) {\n let len = -stin;\n const bs = st.e + stin;\n if (len > ml) len = ml;\n for (let i = 0; i < len; ++i) {\n buf[oubt + i] = st.w[bs + i];\n }\n oubt += len, ml -= len, stin = 0;\n }\n for (let i = 0; i < ml; ++i) {\n buf[oubt + i] = buf[stin + i];\n }\n oubt += ml;\n }\n if (oubt != spl) {\n while (spl < buf.length) {\n buf[oubt++] = buf[spl++];\n }\n } else oubt = buf.length;\n if (out) st.y += oubt;\n else buf = slc(buf, 0, oubt);\n } else if (out) {\n st.y += lss;\n if (spl) {\n for (let i = 0; i < lss; ++i) {\n buf[i] = buf[spl + i];\n }\n }\n } else if (spl) buf = slc(buf, spl);\n st.b = ebt;\n return buf;\n }\n err(2);\n};\n\n// concat\nconst cct = (bufs: Uint8Array[], ol: number) => {\n if (bufs.length == 1) return bufs[0];\n const buf = new u8(ol);\n for (let i = 0, b = 0; i < bufs.length; ++i) {\n const chk = bufs[i];\n buf.set(chk, b);\n b += chk.length;\n }\n return buf;\n};\n\n/**\n * Decompresses Zstandard data\n * @param dat The input data\n * @param buf The output buffer. If unspecified, the function will allocate\n * exactly enough memory to fit the decompressed data. If your\n * data has multiple frames and you know the output size, specifying\n * it will yield better performance.\n * @param dic The dictionary buffer. May be a Zstandard-formatted dictionary\n * (as generated by zstd --train) or raw content.\n * @returns The decompressed data\n */\nexport function decompress(dat: Uint8Array, buf?: Uint8Array, dic?: Uint8Array) {\n const bufs: Uint8Array[] = [], nb = +!buf as 0 | 1;\n let bt = 0, ol = 0;\n for (; dat.length;) {\n const st = rzfh(dat, nb || buf);\n if (typeof st == 'object') {\n if (st.d && !dic) err(6);\n if (dic) rdic(dic, st);\n if (nb) {\n buf = null;\n if (!dic && st.w.length == st.u) {\n bufs.push(buf = st.w);\n ol += st.u;\n }\n } else {\n bufs.push(buf);\n st.e = 0;\n }\n for (; !st.l;) {\n const blk = rzb(dat, st, buf);\n if (!blk) err(5);\n if (buf) st.e = st.y;\n else {\n bufs.push(blk);\n ol += blk.length;\n cpw(st.w, 0, blk.length);\n st.w.set(blk, st.w.length - blk.length);\n }\n }\n bt = st.b + (st.c * 4);\n } else bt = st;\n dat = dat.subarray(bt);\n }\n return cct(bufs, ol);\n}\n\n/**\n * Callback to handle data in Zstandard streams\n * @param data The data that was (de)compressed\n * @param final Whether this is the last chunk in the stream\n */\nexport type ZstdStreamHandler = (data: Uint8Array, final?: boolean) => unknown;\n\n/**\n * Decompressor for Zstandard streamed data\n */\nexport class Decompress {\n private s: DZstdState | number;\n private c: Uint8Array[];\n private l: number;\n private z: number;\n private d: Uint8Array;\n /**\n * Creates a Zstandard decompressor\n * @param ondata The handler for stream data\n */\n constructor(ondata?: ZstdStreamHandler) {\n this.ondata = ondata;\n this.c = [];\n this.l = 0;\n this.z = 0;\n }\n\n /**\n * Loads a dictionary\n * @param dic The dictionary buffer. May be a Zstandard-formatted dictionary\n * (as generated by zstd --train) or raw content.\n */\n loadDictionary(dic: Uint8Array) {\n this.d = dic;\n }\n\n /**\n * Pushes data to be decompressed\n * @param chunk The chunk of data to push\n * @param final Whether or not this is the last chunk in the stream\n */\n push(chunk: Uint8Array, final?: boolean) {\n if (typeof this.s == 'number') {\n const sub = Math.min(chunk.length, this.s as number);\n chunk = chunk.subarray(sub);\n (this.s as number) -= sub;\n }\n const sl = chunk.length;\n const ncs = sl + this.l;\n if (!this.s) {\n if (final) {\n if (!ncs) {\n this.ondata(new u8(0), true);\n return;\n }\n // min for frame + one block\n if (ncs < 5) err(5);\n } else if (ncs < 18) {\n this.c.push(chunk);\n this.l = ncs;\n return;\n }\n if (this.l) {\n this.c.push(chunk);\n chunk = cct(this.c, ncs);\n this.c = [];\n this.l = 0;\n }\n if (typeof (this.s = rzfh(chunk)) == 'number') return this.push(chunk, final);\n if (this.s.d && !this.d) err(6);\n if (this.d) rdic(this.d, this.s);\n }\n if (typeof this.s != 'number') {\n if (ncs < (this.z || 3)) {\n if (final) err(5);\n this.c.push(chunk);\n this.l = ncs;\n return;\n }\n if (this.l) {\n this.c.push(chunk);\n chunk = cct(this.c, ncs);\n this.c = [];\n this.l = 0;\n }\n if (!this.z && ncs < (this.z = (chunk[(this.s as DZstdState).b] & 2) ? 4 : 3 + ((chunk[(this.s as DZstdState).b] >> 3) | (chunk[(this.s as DZstdState).b + 1] << 5) | (chunk[(this.s as DZstdState).b + 2] << 13)))) {\n if (final) err(5);\n this.c.push(chunk);\n this.l = ncs;\n return;\n } else this.z = 0;\n for (;;) {\n const blk = rzb(chunk, this.s as DZstdState);\n if (!blk) {\n if (final) err(5);\n const adc = chunk.subarray((this.s as DZstdState).b);\n (this.s as DZstdState).b = 0;\n this.c.push(adc), this.l += adc.length;\n return;\n } else {\n this.ondata(blk, false);\n cpw((this.s as DZstdState).w, 0, blk.length);\n (this.s as DZstdState).w.set(blk, (this.s as DZstdState).w.length - blk.length);\n }\n if ((this.s as DZstdState).l) {\n const rest = chunk.subarray((this.s as DZstdState).b);\n this.s = (this.s as DZstdState).c * 4;\n this.push(rest, final);\n return;\n }\n }\n } else if (final) err(5);\n }\n\n /**\n * Handler called whenever data is decompressed\n */\n ondata: ZstdStreamHandler;\n}","/**\n * Icechunk binary file header parsing.\n *\n * Header format (39 bytes total):\n * - Bytes 0-11: Magic bytes \"ICE🧊CHUNK\" (12 bytes)\n * - Bytes 12-35: Implementation name (24 bytes, space-padded)\n * - Byte 36: Spec version (1 = v1.0, 2 = v2.0)\n * - Byte 37: File type (1-6)\n * - Byte 38: Compression algorithm (0 = none, 1 = zstd)\n */\n\n/** Header size in bytes */\nexport const HEADER_SIZE = 39;\n\n/** Magic bytes for icechunk format: \"ICE🧊CHUNK\" */\nexport const MAGIC_BYTES = new Uint8Array([\n 0x49,\n 0x43,\n 0x45, // ICE\n 0xf0,\n 0x9f,\n 0xa7,\n 0x8a, // 🧊 (U+1F9CA in UTF-8)\n 0x43,\n 0x48,\n 0x55,\n 0x4e,\n 0x4b, // CHUNK\n]);\n\n/** Spec version enum */\nexport enum SpecVersion {\n V1_0 = 1,\n V2_0 = 2,\n}\n\n/** File type enum */\nexport enum FileType {\n Snapshot = 1,\n Manifest = 2,\n Attributes = 3,\n TransactionLog = 4,\n Chunk = 5,\n RepoInfo = 6,\n}\n\n/** Compression algorithm enum */\nexport enum CompressionAlgorithm {\n None = 0,\n Zstd = 1,\n}\n\n/** Parsed header structure */\nexport interface IcechunkHeader {\n /** Implementation name (e.g., \"ic-1.0.0\") */\n implementation: string;\n\n /** Spec version */\n specVersion: SpecVersion;\n\n /** File type */\n fileType: FileType;\n\n /** Compression algorithm */\n compression: CompressionAlgorithm;\n}\n\n/** Error thrown when header parsing fails */\nexport class HeaderParseError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"HeaderParseError\";\n }\n}\n\n/**\n * Parse the header from a buffer.\n *\n * @param data - Buffer containing at least 39 bytes\n * @returns Parsed header\n * @throws HeaderParseError if the header is invalid\n */\nexport function parseHeader(data: Uint8Array): IcechunkHeader {\n if (data.length < HEADER_SIZE) {\n throw new HeaderParseError(\n `Buffer too small: expected at least ${HEADER_SIZE} bytes, got ${data.length}`,\n );\n }\n\n // Check magic bytes\n const magic = data.slice(0, 12);\n if (!compareMagic(magic, MAGIC_BYTES)) {\n throw new HeaderParseError(\"Invalid magic bytes: not an icechunk file\");\n }\n\n // Parse implementation name (bytes 12-35)\n const implementationBytes = data.slice(12, 36);\n const implementation = new TextDecoder()\n .decode(implementationBytes)\n .trimEnd();\n\n // Parse spec version (byte 36)\n const specVersionByte = data[36];\n if (\n specVersionByte !== SpecVersion.V1_0 &&\n specVersionByte !== SpecVersion.V2_0\n ) {\n throw new HeaderParseError(`Invalid spec version: ${specVersionByte}`);\n }\n const specVersion = specVersionByte as SpecVersion;\n\n // Parse file type (byte 37)\n const fileTypeByte = data[37];\n if (fileTypeByte < 1 || fileTypeByte > 6) {\n throw new HeaderParseError(`Invalid file type: ${fileTypeByte}`);\n }\n const fileType = fileTypeByte as FileType;\n\n // Parse compression (byte 38)\n const compressionByte = data[38];\n if (\n compressionByte !== CompressionAlgorithm.None &&\n compressionByte !== CompressionAlgorithm.Zstd\n ) {\n throw new HeaderParseError(\n `Invalid compression algorithm: ${compressionByte}`,\n );\n }\n const compression = compressionByte as CompressionAlgorithm;\n\n return {\n implementation,\n specVersion,\n fileType,\n compression,\n };\n}\n\n/**\n * Validate that a header matches an expected file type.\n *\n * @param header - Parsed header\n * @param expectedType - Expected file type\n * @throws HeaderParseError if the file type doesn't match\n */\nexport function validateFileType(\n header: IcechunkHeader,\n expectedType: FileType,\n): void {\n if (header.fileType !== expectedType) {\n const expected = FileType[expectedType];\n const actual = FileType[header.fileType];\n throw new HeaderParseError(\n `Invalid file type: expected ${expected}, got ${actual}`,\n );\n }\n}\n\n/**\n * Get the data portion of a buffer (after the header).\n *\n * @param data - Full buffer including header\n * @returns Data portion after the header\n */\nexport function getDataAfterHeader(data: Uint8Array): Uint8Array {\n return data.slice(HEADER_SIZE);\n}\n\n/** Compare two byte arrays */\nfunction compareMagic(a: Uint8Array, b: Uint8Array): boolean {\n if (a.length !== b.length) return false;\n for (let i = 0; i < a.length; i++) {\n if (a[i] !== b[i]) return false;\n }\n return true;\n}\n","/**\n * Simple LRU cache for manifests and snapshots.\n */\n\nexport class LRUCache<K, V> {\n private cache: Map<K, V>;\n private readonly maxSize: number;\n\n constructor(maxSize: number) {\n this.cache = new Map();\n this.maxSize = maxSize;\n }\n\n get(key: K): V | undefined {\n const value = this.cache.get(key);\n if (value !== undefined) {\n // Move to end (most recently used)\n this.cache.delete(key);\n this.cache.set(key, value);\n }\n return value;\n }\n\n set(key: K, value: V): void {\n if (this.maxSize <= 0) return;\n // If key exists, delete it first to update position\n if (this.cache.has(key)) {\n this.cache.delete(key);\n }\n\n // Evict oldest if at capacity\n if (this.cache.size >= this.maxSize) {\n const oldestKey = this.cache.keys().next().value;\n if (oldestKey !== undefined) {\n this.cache.delete(oldestKey);\n }\n }\n\n this.cache.set(key, value);\n }\n\n has(key: K): boolean {\n return this.cache.has(key);\n }\n\n delete(key: K): boolean {\n return this.cache.delete(key);\n }\n\n clear(): void {\n this.cache.clear();\n }\n\n get size(): number {\n return this.cache.size;\n }\n}\n","/**\n * Single-flight wrapper for cache-aside fetches.\n *\n * Wraps a result cache with an in-flight Map so concurrent misses for the\n * same key share one fetch. The shared fetch is reference-counted against\n * its waiters: each caller's `signal` rejects only that caller's wait,\n * but if every waiter has aborted the underlying fetch is aborted too and\n * the pending entry is dropped, so the next caller starts fresh instead of\n * being stuck behind a hung request. New waiters arriving while the fetch\n * is in flight bump the refcount, so a single straggler keeps the work\n * alive for everyone who follows.\n */\n\nexport interface CacheLike<K, V> {\n get(key: K): V | undefined;\n set(key: K, value: V): void;\n}\n\nexport interface SingleFlight<K, V> {\n /**\n * Resolve `key` from the cache, falling through to `fetcher` on miss.\n * Concurrent callers for the same key share one in-flight `fetcher`\n * invocation; the result is written to `cache` on success.\n *\n * `signal` rejects only the caller's await. The underlying fetch keeps\n * running unless every waiter has aborted, in which case the\n * `AbortSignal` passed to `fetcher` fires and the pending entry is\n * dropped so the next caller starts fresh.\n *\n * `fetcher` may throw synchronously; the throw is converted to a\n * rejected promise so `load`'s `Promise<V>` contract holds.\n */\n load(\n key: K,\n fetcher: (signal: AbortSignal) => Promise<V>,\n signal?: AbortSignal,\n ): Promise<V>;\n}\n\ninterface Pending<V> {\n promise: Promise<V>;\n controller: AbortController;\n refCount: number;\n}\n\n/** Build a SingleFlight backed by `cache`. */\nexport function singleFlight<K, V>(cache: CacheLike<K, V>): SingleFlight<K, V> {\n const pending = new Map<K, Pending<V>>();\n\n return {\n load(\n key: K,\n fetcher: (signal: AbortSignal) => Promise<V>,\n signal?: AbortSignal,\n ): Promise<V> {\n // Reject (don't throw) when the caller is already aborted — callers\n // expect a Promise back, including in the pre-aborted case.\n if (signal?.aborted) return Promise.reject(makeAbortError());\n\n const hit = cache.get(key);\n if (hit !== undefined) return Promise.resolve(hit);\n\n let entry = pending.get(key);\n if (!entry) {\n const controller = new AbortController();\n const promise = invokeFetcher(fetcher, controller.signal)\n .then((value) => {\n cache.set(key, value);\n return value;\n })\n .finally(() => {\n if (pending.get(key)?.promise === promise) pending.delete(key);\n });\n const fresh: Pending<V> = { promise, controller, refCount: 0 };\n pending.set(key, fresh);\n entry = fresh;\n }\n const owned = entry;\n owned.refCount++;\n\n const release = () => {\n owned.refCount--;\n if (owned.refCount > 0) return;\n // Last waiter just released. If the entry is still in `pending`\n // the fetch hasn't settled yet — drop the slot synchronously so\n // any new caller starts fresh, then abort the in-flight work.\n // If `.finally` already cleared it, the fetch resolved and the\n // controller.abort() is a no-op.\n if (pending.get(key) === owned) {\n pending.delete(key);\n owned.controller.abort();\n }\n };\n\n if (!signal) {\n return owned.promise.then(\n (value) => {\n release();\n return value;\n },\n (error) => {\n release();\n throw error;\n },\n );\n }\n\n return new Promise<V>((resolve, reject) => {\n let done = false;\n // `finish` ensures release runs exactly once per caller and wins\n // the resolve/reject race between abort and underlying settle.\n const finish = (): boolean => {\n if (done) return false;\n done = true;\n signal.removeEventListener(\"abort\", handleAbort);\n release();\n return true;\n };\n const handleAbort = () => {\n if (finish()) reject(makeAbortError());\n };\n signal.addEventListener(\"abort\", handleAbort, { once: true });\n owned.promise.then(\n (value) => {\n if (finish()) resolve(value);\n },\n (error) => {\n if (finish()) reject(error);\n },\n );\n });\n },\n };\n}\n\n/**\n * Invoke `fetcher`, converting a synchronous throw into a rejected\n * Promise so callers always observe a Promise-shaped failure.\n */\nfunction invokeFetcher<V>(\n fetcher: (signal: AbortSignal) => Promise<V>,\n signal: AbortSignal,\n): Promise<V> {\n try {\n return fetcher(signal);\n } catch (error) {\n return Promise.reject(error);\n }\n}\n\nfunction makeAbortError(): Error {\n return new DOMException(\"The operation was aborted.\", \"AbortError\");\n}\n","/**\n * TypeScript types matching the icechunk FlatBuffer schemas.\n *\n * These types represent the parsed/decoded data, not the binary format.\n */\n\n// =============================================================================\n// Common types (from common.fbs)\n// =============================================================================\n\n/** 12-byte object ID (SnapshotId, ManifestId, ChunkId) */\nexport type ObjectId12 = Uint8Array; // Always 12 bytes\n\n/** 8-byte object ID (NodeId) */\nexport type ObjectId8 = Uint8Array; // Always 8 bytes\n\n/**\n * Validate and cast a Uint8Array to ObjectId12.\n * @throws Error if the array is not exactly 12 bytes\n */\nexport function asObjectId12(bytes: Uint8Array): ObjectId12 {\n if (bytes.length !== 12) {\n throw new Error(\n `Invalid ObjectId12: expected 12 bytes, got ${bytes.length}`,\n );\n }\n return bytes as ObjectId12;\n}\n\n/**\n * Validate and cast a Uint8Array to ObjectId8.\n * @throws Error if the array is not exactly 8 bytes\n */\nexport function asObjectId8(bytes: Uint8Array): ObjectId8 {\n if (bytes.length !== 8) {\n throw new Error(`Invalid ObjectId8: expected 8 bytes, got ${bytes.length}`);\n }\n return bytes as ObjectId8;\n}\n\n/** Metadata key-value pair */\nexport interface MetadataItem {\n name: string;\n /** Value serialized as MessagePack (v1) or FlexBuffers (v2) */\n value: Uint8Array;\n}\n\n// =============================================================================\n// Manifest types (from manifest.fbs)\n// =============================================================================\n\n/** Reference to a chunk - can be inline, native, or virtual */\nexport interface ChunkRef {\n /** Chunk coordinates (N-dimensional) */\n index: number[];\n\n /** Inline chunk data (if present, this is an inline chunk) */\n inline: Uint8Array | null;\n\n /** Byte offset within the chunk file or virtual location */\n offset: number;\n\n /** Byte length of the chunk data */\n length: number;\n\n /** Chunk ID for native chunks (points to file in chunks/) */\n chunkId: ObjectId12 | null;\n\n /** URL for virtual chunks */\n location: string | null;\n\n /** ETag checksum for virtual chunks */\n checksumEtag: string | null;\n\n /** Last modified timestamp (seconds since epoch) for virtual chunks */\n checksumLastModified: number;\n}\n\n/**\n * Chunk references for a single array, resolved lazily from the manifest's\n * FlatBuffer. Keeping refs in the buffer avoids building a JS object per chunk,\n * which would OOM on large virtual shards.\n */\nexport interface ArrayManifest {\n /** Node ID of the array */\n nodeId: ObjectId8;\n\n /** Number of chunk refs (sorted by index). */\n readonly numRefs: number;\n\n /** Coordinate index of ref `i`, for the binary search in `findChunkRef`. */\n refIndex(i: number): number[];\n\n /** Materialize the full `ChunkRef` at position `i`. */\n refAt(i: number): ChunkRef;\n}\n\n/** Manifest containing chunk references for multiple arrays */\nexport interface Manifest {\n /** Manifest ID */\n id: ObjectId12;\n\n /** Array manifests, sorted by nodeId */\n arrays: ArrayManifest[];\n}\n\n// =============================================================================\n// Snapshot types (from snapshot.fbs)\n// =============================================================================\n\n/** Info about a manifest file */\nexport interface ManifestFileInfo {\n /** Manifest ID */\n id: ObjectId12;\n\n /** Size in bytes */\n sizeBytes: number;\n\n /** Number of chunk refs in the manifest */\n numChunkRefs: number;\n}\n\n/** Range of chunk indices along one dimension */\nexport interface ChunkIndexRange {\n /** Inclusive start */\n from: number;\n\n /** Exclusive end */\n to: number;\n}\n\n/** Reference to a manifest with extent information */\nexport interface ManifestRef {\n /** Manifest object ID */\n objectId: ObjectId12;\n\n /** Chunk index ranges per dimension */\n extents: ChunkIndexRange[];\n}\n\n/** Shape of one dimension */\nexport interface DimensionShape {\n /** Length of the array along this dimension */\n arrayLength: number;\n\n /** Chunk size along this dimension (v1 format; approximate in v2) */\n chunkLength: number;\n\n /** Number of chunks along this dimension (v2 format) */\n numChunks?: number;\n}\n\n/** Group node data (empty - just a marker) */\nexport interface GroupNodeData {\n type: \"group\";\n}\n\n/** Array node data */\nexport interface ArrayNodeData {\n type: \"array\";\n\n /** Shape per dimension */\n shape: DimensionShape[];\n\n /** Optional dimension names */\n dimensionNames: (string | null)[];\n\n /** Manifest references */\n manifests: ManifestRef[];\n}\n\n/** Node data - either group or array */\nexport type NodeData = GroupNodeData | ArrayNodeData;\n\n/** Snapshot of a single node (array or group) */\nexport interface NodeSnapshot {\n /** Node ID */\n id: ObjectId8;\n\n /** Absolute path in the repository */\n path: string;\n\n /** User data (typically Zarr metadata JSON) */\n userData: Uint8Array;\n\n /** Node-specific data */\n nodeData: NodeData;\n}\n\n/** Complete snapshot of a repository state */\nexport interface Snapshot {\n /** Snapshot ID */\n id: ObjectId12;\n\n /** Parent snapshot ID (null for root snapshot) */\n parentId: ObjectId12 | null;\n\n /** Nodes in the snapshot, sorted by path */\n nodes: NodeSnapshot[];\n\n /** Timestamp when flushed (microseconds since epoch) */\n flushedAt: bigint;\n\n /** Commit message */\n message: string;\n\n /** Snapshot metadata */\n metadata: MetadataItem[];\n\n /** All manifest files referenced by this snapshot */\n manifestFiles: ManifestFileInfo[];\n}\n\n// =============================================================================\n// Chunk payload types (derived from ChunkRef for easier handling)\n// =============================================================================\n\n/** Inline chunk - data embedded in manifest */\nexport interface InlineChunkPayload {\n type: \"inline\";\n data: Uint8Array;\n}\n\n/** Native chunk - stored in repository's chunk storage */\nexport interface NativeChunkPayload {\n type: \"native\";\n chunkId: ObjectId12;\n offset: number;\n length: number;\n}\n\n/** Virtual chunk - stored externally */\nexport interface VirtualChunkPayload {\n type: \"virtual\";\n location: string;\n offset: number;\n length: number;\n checksumEtag: string | null;\n checksumLastModified: number;\n}\n\n/** Union of all chunk payload types */\nexport type ChunkPayload =\n | InlineChunkPayload\n | NativeChunkPayload\n | VirtualChunkPayload;\n\n// =============================================================================\n// Transaction log types (from transaction_log.fbs)\n// =============================================================================\n\n/** Chunk coordinates that were updated */\nexport interface UpdatedChunkIndices {\n coords: number[];\n}\n\n/** Updated chunks info for a single array */\nexport interface ArrayUpdatedChunksInfo {\n nodeId: ObjectId8;\n chunks: UpdatedChunkIndices[];\n}\n\n/** A node move operation */\nexport interface MoveOperationInfo {\n from: string;\n to: string;\n}\n\n/** A transaction log entry describing changes in a snapshot */\nexport interface TransactionLogEntry {\n id: ObjectId12;\n newGroups: ObjectId8[];\n newArrays: ObjectId8[];\n deletedGroups: ObjectId8[];\n deletedArrays: ObjectId8[];\n updatedArrays: ObjectId8[];\n updatedGroups: ObjectId8[];\n updatedChunks: ArrayUpdatedChunksInfo[];\n movedNodes: MoveOperationInfo[];\n}\n","/**\n * Parser for icechunk Snapshot FlatBuffer format.\n *\n * Uses flatc-generated TypeScript classes for type-safe field access.\n */\n\nimport { ByteBuffer } from \"flatbuffers\";\nimport { Snapshot as FbsSnapshot } from \"./generated/snapshot.js\";\nimport { NodeSnapshot as FbsNodeSnapshot } from \"./generated/node-snapshot.js\";\nimport { ArrayNodeData as FbsArrayNodeData } from \"./generated/array-node-data.js\";\nimport { ManifestRef as FbsManifestRef } from \"./generated/manifest-ref.js\";\nimport { NodeData as FbsNodeDataEnum } from \"./generated/node-data.js\";\nimport {\n asObjectId12,\n asObjectId8,\n type Snapshot,\n type NodeSnapshot,\n type NodeData,\n type ArrayNodeData,\n type ManifestRef,\n type ManifestFileInfo,\n type DimensionShape,\n type ChunkIndexRange,\n type MetadataItem,\n} from \"./types.js\";\n\n/** Extract bytes from a generated ObjectId12 struct */\nfunction readId12(bb: ByteBuffer, bbPos: number): Uint8Array {\n return bb.bytes().slice(bbPos, bbPos + 12);\n}\n\n/** Extract bytes from a generated ObjectId8 struct */\nfunction readId8(bb: ByteBuffer, bbPos: number): Uint8Array {\n return bb.bytes().slice(bbPos, bbPos + 8);\n}\n\n/** Parse a Snapshot from FlatBuffer data */\nexport function parseSnapshot(data: Uint8Array): Snapshot {\n const bb = new ByteBuffer(data);\n const fbsSnapshot = FbsSnapshot.getRootAsSnapshot(bb);\n\n // Parse ID (required)\n const idObj = fbsSnapshot.id();\n if (!idObj) throw new Error(\"Snapshot missing required id field\");\n const id = asObjectId12(readId12(idObj.bb!, idObj.bb_pos));\n\n // Parse parent ID (optional)\n const parentIdObj = fbsSnapshot.parentId();\n const parentId = parentIdObj\n ? asObjectId12(readId12(parentIdObj.bb!, parentIdObj.bb_pos))\n : null;\n\n // Parse nodes\n const nodesLength = fbsSnapshot.nodesLength();\n const nodes: NodeSnapshot[] = [];\n for (let i = 0; i < nodesLength; i++) {\n const fbsNode = fbsSnapshot.nodes(i);\n if (fbsNode) {\n nodes.push(parseNodeSnapshot(fbsNode));\n }\n }\n\n // Parse flushed_at\n const flushedAt = fbsSnapshot.flushedAt();\n\n // Parse message (required)\n const message = fbsSnapshot.message() ?? \"\";\n\n // Parse metadata\n const metadataLength = fbsSnapshot.metadataLength();\n const metadata: MetadataItem[] = [];\n for (let i = 0; i < metadataLength; i++) {\n const fbsMeta = fbsSnapshot.metadata(i);\n if (fbsMeta) {\n const name = fbsMeta.name();\n const value = fbsMeta.valueArray();\n if (name && value) {\n metadata.push({ name, value: new Uint8Array(value) });\n }\n }\n }\n\n // Parse manifest files — prefer v2 field, fall back to v1 struct vector\n const manifestFiles: ManifestFileInfo[] = [];\n const v2Length = fbsSnapshot.manifestFilesV2Length();\n if (v2Length > 0) {\n for (let i = 0; i < v2Length; i++) {\n const fbsMfi = fbsSnapshot.manifestFilesV2(i);\n if (fbsMfi) {\n const mfiIdObj = fbsMfi.id();\n if (!mfiIdObj) throw new Error(\"ManifestFileInfoV2 missing id\");\n manifestFiles.push({\n id: asObjectId12(readId12(mfiIdObj.bb!, mfiIdObj.bb_pos)),\n sizeBytes: Number(fbsMfi.sizeBytes()),\n numChunkRefs: fbsMfi.numChunkRefs(),\n });\n }\n }\n } else {\n const v1Length = fbsSnapshot.manifestFilesLength();\n for (let i = 0; i < v1Length; i++) {\n const fbsMfi = fbsSnapshot.manifestFiles(i);\n if (fbsMfi) {\n const mfiIdObj = fbsMfi.id();\n if (!mfiIdObj) throw new Error(\"ManifestFileInfo missing id\");\n manifestFiles.push({\n id: asObjectId12(readId12(mfiIdObj.bb!, mfiIdObj.bb_pos)),\n sizeBytes: Number(fbsMfi.sizeBytes()),\n numChunkRefs: fbsMfi.numChunkRefs(),\n });\n }\n }\n }\n\n return {\n id,\n parentId,\n nodes,\n flushedAt,\n message,\n metadata,\n manifestFiles,\n };\n}\n\nfunction parseNodeSnapshot(fbsNode: FbsNodeSnapshot): NodeSnapshot {\n // Parse ID (required)\n const idObj = fbsNode.id();\n if (!idObj) throw new Error(\"NodeSnapshot missing required id field\");\n const id = asObjectId8(readId8(idObj.bb!, idObj.bb_pos));\n\n // Parse path (required)\n const path = fbsNode.path() ?? \"\";\n\n // Parse user_data (required)\n const userData = fbsNode.userDataArray() ?? new Uint8Array(0);\n\n // Parse node_data (union)\n const nodeDataType = fbsNode.nodeDataType();\n const nodeData = parseNodeData(fbsNode, nodeDataType);\n\n return { id, path, userData, nodeData };\n}\n\nfunction parseNodeData(\n fbsNode: FbsNodeSnapshot,\n unionType: FbsNodeDataEnum,\n): NodeData {\n if (\n unionType === FbsNodeDataEnum.NONE ||\n unionType === FbsNodeDataEnum.Group\n ) {\n return { type: \"group\" };\n }\n\n if (unionType === FbsNodeDataEnum.Array) {\n const arrayData = fbsNode.nodeData(new FbsArrayNodeData());\n if (!arrayData) {\n throw new Error(\"ArrayNodeData union type but no table\");\n }\n return parseArrayNodeData(arrayData as FbsArrayNodeData);\n }\n\n throw new Error(`Unknown node data union type: ${unionType}`);\n}\n\nfunction parseArrayNodeData(fbsArray: FbsArrayNodeData): ArrayNodeData {\n // Parse shape — prefer v2 field, fall back to v1 struct vector\n const shape: DimensionShape[] = [];\n const shapeV2Length = fbsArray.shapeV2Length();\n if (shapeV2Length > 0) {\n for (let i = 0; i < shapeV2Length; i++) {\n const fbsShape = fbsArray.shapeV2(i);\n if (fbsShape) {\n const arrayLength = Number(fbsShape.arrayLength());\n const numChunks = fbsShape.numChunks();\n shape.push({\n arrayLength,\n chunkLength: numChunks > 0 ? Math.ceil(arrayLength / numChunks) : 0,\n numChunks,\n });\n }\n }\n } else {\n const shapeLength = fbsArray.shapeLength();\n for (let i = 0; i < shapeLength; i++) {\n const fbsShape = fbsArray.shape(i);\n if (fbsShape) {\n shape.push({\n arrayLength: Number(fbsShape.arrayLength()),\n chunkLength: Number(fbsShape.chunkLength()),\n });\n }\n }\n }\n\n // Parse dimension names (vector of tables)\n const dimNamesLength = fbsArray.dimensionNamesLength();\n const dimensionNames: (string | null)[] = [];\n for (let i = 0; i < dimNamesLength; i++) {\n const fbsDimName = fbsArray.dimensionNames(i);\n if (fbsDimName) {\n dimensionNames.push(fbsDimName.name());\n } else {\n dimensionNames.push(null);\n }\n }\n\n // Parse manifests (vector of tables)\n const manifestsLength = fbsArray.manifestsLength();\n const manifests: ManifestRef[] = [];\n for (let i = 0; i < manifestsLength; i++) {\n const fbsManifest = fbsArray.manifests(i);\n if (fbsManifest) {\n manifests.push(parseManifestRef(fbsManifest));\n }\n }\n\n return {\n type: \"array\",\n shape,\n dimensionNames,\n manifests,\n };\n}\n\nfunction parseManifestRef(fbsRef: FbsManifestRef): ManifestRef {\n // Object ID (inline struct)\n const objectIdObj = fbsRef.objectId();\n if (!objectIdObj) throw new Error(\"ManifestRef missing object_id\");\n const objectId = asObjectId12(readId12(objectIdObj.bb!, objectIdObj.bb_pos));\n\n // Extents (vector of ChunkIndexRange structs)\n const extentsLength = fbsRef.extentsLength();\n const extents: ChunkIndexRange[] = [];\n for (let i = 0; i < extentsLength; i++) {\n const fbsExtent = fbsRef.extents(i);\n if (fbsExtent) {\n extents.push({ from: fbsExtent.from(), to: fbsExtent.to() });\n }\n }\n\n return { objectId, extents };\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class ManifestFileInfo {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ManifestFileInfo {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n id(obj?: ObjectId12): ObjectId12 | null {\n return (obj || new ObjectId12()).__init(this.bb_pos, this.bb!);\n }\n\n sizeBytes(): bigint {\n return this.bb!.readUint64(this.bb_pos + 16);\n }\n\n numChunkRefs(): number {\n return this.bb!.readUint32(this.bb_pos + 24);\n }\n\n static sizeOf(): number {\n return 32;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class ManifestFileInfoV2 {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ManifestFileInfoV2 {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsManifestFileInfoV2(\n bb: flatbuffers.ByteBuffer,\n obj?: ManifestFileInfoV2,\n ): ManifestFileInfoV2 {\n return (obj || new ManifestFileInfoV2()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n id(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n sizeBytes(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n numChunkRefs(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.readUint32(this.bb_pos + offset) : 0;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class DimensionName {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): DimensionName {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsDimensionName(\n bb: flatbuffers.ByteBuffer,\n obj?: DimensionName,\n ): DimensionName {\n return (obj || new DimensionName()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n name(): string | null;\n name(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n name(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class DimensionShape {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): DimensionShape {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n arrayLength(): bigint {\n return this.bb!.readUint64(this.bb_pos);\n }\n\n chunkLength(): bigint {\n return this.bb!.readUint64(this.bb_pos + 8);\n }\n\n static sizeOf(): number {\n return 16;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class DimensionShapeV2 {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): DimensionShapeV2 {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsDimensionShapeV2(\n bb: flatbuffers.ByteBuffer,\n obj?: DimensionShapeV2,\n ): DimensionShapeV2 {\n return (obj || new DimensionShapeV2()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n arrayLength(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n numChunks(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.readUint32(this.bb_pos + offset) : 0;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class ChunkIndexRange {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ChunkIndexRange {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n from(): number {\n return this.bb!.readUint32(this.bb_pos);\n }\n\n to(): number {\n return this.bb!.readUint32(this.bb_pos + 4);\n }\n\n static sizeOf(): number {\n return 8;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ChunkIndexRange } from \"../generated/chunk-index-range.js\";\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class ManifestRef {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ManifestRef {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsManifestRef(\n bb: flatbuffers.ByteBuffer,\n obj?: ManifestRef,\n ): ManifestRef {\n return (obj || new ManifestRef()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n objectId(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n extents(index: number, obj?: ChunkIndexRange): ChunkIndexRange | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new ChunkIndexRange()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n extentsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { DimensionName } from \"../generated/dimension-name.js\";\nimport { DimensionShape } from \"../generated/dimension-shape.js\";\nimport { DimensionShapeV2 } from \"../generated/dimension-shape-v2.js\";\nimport { ManifestRef } from \"../generated/manifest-ref.js\";\n\nexport class ArrayNodeData {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ArrayNodeData {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsArrayNodeData(\n bb: flatbuffers.ByteBuffer,\n obj?: ArrayNodeData,\n ): ArrayNodeData {\n return (obj || new ArrayNodeData()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n shape(index: number, obj?: DimensionShape): DimensionShape | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new DimensionShape()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 16,\n this.bb!,\n )\n : null;\n }\n\n shapeLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n dimensionNames(index: number, obj?: DimensionName): DimensionName | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new DimensionName()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n dimensionNamesLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n manifests(index: number, obj?: ManifestRef): ManifestRef | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? (obj || new ManifestRef()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n manifestsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n shapeV2(index: number, obj?: DimensionShapeV2): DimensionShapeV2 | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? (obj || new DimensionShapeV2()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n shapeV2Length(): number {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class ObjectId8 {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ObjectId8 {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n bytes(index: number): number | null {\n return this.bb!.readUint8(this.bb_pos + 0 + index);\n }\n\n static sizeOf(): number {\n return 8;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { NodeData } from \"../generated/node-data.js\";\nimport { ObjectId8 } from \"../generated/object-id8.js\";\n\nexport class NodeSnapshot {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): NodeSnapshot {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsNodeSnapshot(\n bb: flatbuffers.ByteBuffer,\n obj?: NodeSnapshot,\n ): NodeSnapshot {\n return (obj || new NodeSnapshot()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n id(obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId8()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n path(): string | null;\n path(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n path(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n userData(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n userDataLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n userDataArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n nodeDataType(): NodeData {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.readUint8(this.bb_pos + offset) : NodeData.NONE;\n }\n\n nodeData(obj: any): any | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset ? this.bb!.__union(obj, this.bb_pos + offset) : null;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ManifestFileInfo } from \"../generated/manifest-file-info.js\";\nimport { ManifestFileInfoV2 } from \"../generated/manifest-file-info-v2.js\";\nimport { MetadataItem } from \"../generated/metadata-item.js\";\nimport { NodeSnapshot } from \"../generated/node-snapshot.js\";\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class Snapshot {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): Snapshot {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsSnapshot(\n bb: flatbuffers.ByteBuffer,\n obj?: Snapshot,\n ): Snapshot {\n return (obj || new Snapshot()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n id(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n parentId(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n nodes(index: number, obj?: NodeSnapshot): NodeSnapshot | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? (obj || new NodeSnapshot()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n nodesLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n flushedAt(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n message(): string | null;\n message(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n message(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n metadata(index: number, obj?: MetadataItem): MetadataItem | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? (obj || new MetadataItem()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n metadataLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n manifestFiles(\n index: number,\n obj?: ManifestFileInfo,\n ): ManifestFileInfo | null {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset\n ? (obj || new ManifestFileInfo()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 32,\n this.bb!,\n )\n : null;\n }\n\n manifestFilesLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n manifestFilesV2(\n index: number,\n obj?: ManifestFileInfoV2,\n ): ManifestFileInfoV2 | null {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset\n ? (obj || new ManifestFileInfoV2()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n manifestFilesV2Length(): number {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","/**\n * Parser for icechunk Manifest FlatBuffer format.\n *\n * Uses flatc-generated TypeScript classes for type-safe field access.\n */\n\nimport { ByteBuffer } from \"flatbuffers\";\nimport { decompress } from \"../../vendor/fzstd/index.js\";\nimport { Manifest as FbsManifest } from \"./generated/manifest.js\";\nimport { ArrayManifest as FbsArrayManifest } from \"./generated/array-manifest.js\";\nimport { ChunkRef as FbsChunkRef } from \"./generated/chunk-ref.js\";\nimport {\n asObjectId12,\n asObjectId8,\n type Manifest,\n type ArrayManifest,\n type ChunkRef,\n type ChunkPayload,\n type ObjectId8,\n} from \"./types.js\";\n\n/** compression_algorithm value for zstd dictionary-compressed locations. */\nconst COMPRESSION_ALG_ZSTD_DICT = 1;\n\n/** Upper bound on a decompressed location, matching the Rust\n * `MAX_DECOMPRESSED_LOCATION_SIZE`. */\nconst MAX_DECOMPRESSED_LOCATION_SIZE = 1024;\n\n/**\n * Upper bound on the bytes the vendored fzstd decoder will allocate for\n * `frame`, computed from the frame header *without* decompressing: the larger\n * of the up-front frame buffer (content size, falling back to window size, per\n * `rzfh`) and the sum of the per-block output buffers (per `rzb`). Requires\n * `frame` to be a single complete frame covering the whole input; returns\n * `Infinity` for a missing/short/unrecognized header, a malformed/reserved\n * block, or any trailing bytes (a concatenated second frame), so callers reject\n * rather than trust it.\n *\n * Used to bound allocation *before* decompressing an untrusted\n * `compressed_location`: the size check on the decompressed output alone is too\n * late, since the decoder allocates per the header — including RLE blocks that\n * expand a single input byte to a huge declared size — before that check runs.\n */\nfunction zstdFrameAllocSize(frame: Uint8Array): number {\n // Magic number 0xFD2FB528 (little-endian), then the frame header descriptor.\n if (\n frame.length < 5 ||\n frame[0] !== 0x28 ||\n frame[1] !== 0xb5 ||\n frame[2] !== 0x2f ||\n frame[3] !== 0xfd\n ) {\n return Infinity;\n }\n const flg = frame[4];\n const singleSegment = (flg >> 5) & 1;\n const contentChecksum = (flg >> 2) & 1;\n const dictIdFlag = flg & 3;\n const contentSizeFlag = flg >> 6;\n\n let pos = 5;\n let windowSize = 0;\n if (!singleSegment) {\n if (pos >= frame.length) return Infinity;\n const wd = frame[pos++];\n // Arithmetic (not bitwise `1 <<`/`>> 3`): the exponent can reach 41, which\n // would overflow 32-bit JS shifts and let a crafted window descriptor\n // compute a bogus small size that slips past the bound below.\n const base = 2 ** (10 + (wd >> 3));\n windowSize = base + (base / 8) * (wd & 7);\n }\n pos += dictIdFlag === 3 ? 4 : dictIdFlag; // skip dictionary id\n\n // Frame content size: 0/1/2/4/8 bytes per the flags (matching fzstd's rzfh).\n const fcsBytes = contentSizeFlag ? 1 << contentSizeFlag : singleSegment;\n let contentSize = 0;\n if (fcsBytes) {\n if (pos + fcsBytes > frame.length) return Infinity;\n for (let i = 0; i < fcsBytes; i++) {\n contentSize += frame[pos + i] * 2 ** (8 * i);\n }\n if (contentSizeFlag === 1) contentSize += 256;\n if (singleSegment) windowSize = contentSize;\n }\n pos += fcsBytes;\n\n // Walk the data blocks to the frame end, summing the output each block makes\n // the decoder allocate. This is essential, not just an EOF check: an RLE\n // block costs one input byte but expands to its declared size (up to ~2MB),\n // and a compressed block expands to one block-max regardless of input — so a\n // frame whose header advertises a tiny window/content size can still force a\n // huge allocation. We mirror the per-block allocations in the vendored fzstd\n // `rzb`: RLE/raw -> the block size, compressed -> min(windowSize, 128KiB).\n //\n // Also require exactly one complete frame covering the whole input:\n // `decompress()` decodes *every* concatenated frame and allocates per frame,\n // so trailing bytes (a second frame advertising a huge size) must be rejected.\n let blockOutput = 0;\n for (;;) {\n if (pos + 3 > frame.length) return Infinity;\n const blockHeader =\n frame[pos] | (frame[pos + 1] << 8) | (frame[pos + 2] << 16);\n pos += 3;\n const lastBlock = blockHeader & 1;\n const blockType = (blockHeader >> 1) & 3;\n const blockSize = blockHeader >> 3;\n if (blockType === 3) return Infinity; // reserved block type\n if (blockType === 1) {\n // RLE: one input byte, but the decoder allocates `blockSize` output bytes.\n blockOutput += blockSize;\n pos += 1;\n } else {\n // Raw (0): `blockSize` literal bytes, present in the input.\n // Compressed (2): decoder allocates one block-max, min(windowSize, 128KiB).\n blockOutput += blockType === 0 ? blockSize : Math.min(windowSize, 131072);\n pos += blockSize;\n }\n if (pos > frame.length) return Infinity;\n if (lastBlock) break;\n }\n if (contentChecksum) pos += 4;\n if (pos !== frame.length) return Infinity; // trailing/concatenated frame\n\n // The decoder allocates both the up-front frame buffer (content/window size)\n // and the per-block buffers; bound by the larger of the two.\n return Math.max(contentSize || windowSize, blockOutput);\n}\n\n/**\n * Decode a ChunkRef's `compressed_location` byte vector into a location string.\n * Throws if the manifest has no location dictionary, if the frame's declared\n * size exceeds the bound, or if the bytes aren't valid UTF-8.\n */\ntype LocationDecoder = (compressed: Uint8Array) => string;\n\n/** Parse a Manifest from FlatBuffer data */\nexport function parseManifest(data: Uint8Array): Manifest {\n const bb = new ByteBuffer(data);\n const fbsManifest = FbsManifest.getRootAsManifest(bb);\n\n // Parse ID (required)\n const idObj = fbsManifest.id();\n if (!idObj) throw new Error(\"Manifest missing required id field\");\n const id = asObjectId12(\n idObj.bb!.bytes().slice(idObj.bb_pos, idObj.bb_pos + 12),\n );\n\n // Build the location decoder once per manifest from its zstd dictionary.\n const decodeLocation = makeLocationDecoder(fbsManifest);\n\n // One entry per array node; refs stay in the buffer and resolve lazily so a\n // single chunk read doesn't build a JS object per ref.\n const arraysLength = fbsManifest.arraysLength();\n const arrays: ArrayManifest[] = [];\n for (let i = 0; i < arraysLength; i++) {\n const fbsArray = fbsManifest.arrays(i);\n if (fbsArray) {\n arrays.push(makeArrayManifest(fbsArray, decodeLocation));\n }\n }\n\n return { id, arrays };\n}\n\n/**\n * Build the function that turns a ChunkRef's `compressed_location` into a\n * location string, using the manifest's zstd dictionary.\n *\n * Mirrors the Rust `Manifest::decompressor`: a dictionary is only used when\n * `compression_algorithm == ZSTD_DICT` and `location_dictionary` is present.\n * When a `compressed_location` is encountered without a dictionary, decoding\n * throws (matching the Rust `MissingLocationCompressionDictionary` error).\n *\n * Note: `manifest.fbs` prose says `compression_algorithm == 0` means\n * `compressed_location` holds raw (uncompressed) bytes, but that path is not\n * implemented in the Rust reference — its writer only emits `compressed_location`\n * for ZSTD_DICT (otherwise it writes the plain `location` field) and its reader\n * errors here. We follow the reference behavior, not the (inconsistent) schema\n * comment. See earth-mover/icechunk manifest.fbs vs manifest.rs.\n */\nfunction makeLocationDecoder(fbsManifest: FbsManifest): LocationDecoder {\n const dictionary =\n fbsManifest.compressionAlgorithm() === COMPRESSION_ALG_ZSTD_DICT\n ? fbsManifest.locationDictionaryArray()\n : null;\n // `fatal` makes invalid UTF-8 throw, matching the Rust `String::from_utf8`.\n const textDecoder = new TextDecoder(\"utf-8\", { fatal: true });\n return (compressed: Uint8Array): string => {\n if (!dictionary) {\n throw new Error(\n \"ChunkRef has a compressed_location but the manifest has no location dictionary\",\n );\n }\n // Reject before decompressing: a malformed frame can advertise a huge size\n // and make the decoder allocate far beyond the bound (or OOM) before the\n // post-decompress length check below would run.\n if (zstdFrameAllocSize(compressed) > MAX_DECOMPRESSED_LOCATION_SIZE) {\n throw new Error(\n `Compressed location declares a size over ${MAX_DECOMPRESSED_LOCATION_SIZE} bytes`,\n );\n }\n const decompressed = decompress(compressed, undefined, dictionary);\n if (decompressed.length > MAX_DECOMPRESSED_LOCATION_SIZE) {\n throw new Error(\n `Decompressed location exceeds ${MAX_DECOMPRESSED_LOCATION_SIZE} bytes`,\n );\n }\n return textDecoder.decode(decompressed);\n };\n}\n\n/** Lazy {@link ArrayManifest} over one array's refs in the FlatBuffer. */\nfunction makeArrayManifest(\n fbsArray: FbsArrayManifest,\n decodeLocation: LocationDecoder,\n): ArrayManifest {\n // Parse node_id (required)\n const nodeIdObj = fbsArray.nodeId();\n if (!nodeIdObj)\n throw new Error(\"ArrayManifest missing required node_id field\");\n const nodeId = asObjectId8(\n nodeIdObj.bb!.bytes().slice(nodeIdObj.bb_pos, nodeIdObj.bb_pos + 8),\n );\n\n const numRefs = fbsArray.refsLength();\n // Reused across `refIndex` probes: `refs(i, obj)` re-inits `obj` in place, so\n // binary search allocates no per-probe ChunkRef.\n const probe = new FbsChunkRef();\n\n return {\n nodeId,\n numRefs,\n refIndex(i: number): number[] {\n const fbsRef = fbsArray.refs(i, probe);\n if (!fbsRef) throw new Error(`Manifest ref ${i} out of range`);\n const indexLength = fbsRef.indexLength();\n const index = new Array<number>(indexLength);\n for (let d = 0; d < indexLength; d++) index[d] = fbsRef.index(d)!;\n return index;\n },\n refAt(i: number): ChunkRef {\n const fbsRef = fbsArray.refs(i);\n if (!fbsRef) throw new Error(`Manifest ref ${i} out of range`);\n return parseChunkRef(fbsRef, decodeLocation);\n },\n };\n}\n\nfunction parseChunkRef(\n fbsRef: FbsChunkRef,\n decodeLocation: LocationDecoder,\n): ChunkRef {\n // Parse index (required, vector of uint32)\n const indexLength = fbsRef.indexLength();\n const index: number[] = [];\n for (let i = 0; i < indexLength; i++) {\n index.push(fbsRef.index(i)!);\n }\n\n // Parse inline (optional byte vector)\n const inlineData = fbsRef.inlineArray();\n const inline = inlineData ? new Uint8Array(inlineData) : null;\n\n // Parse offset and length\n const offset = Number(fbsRef.offset());\n const length = Number(fbsRef.length());\n\n // Parse chunk_id (optional inline struct)\n const chunkIdObj = fbsRef.chunkId();\n const chunkId = chunkIdObj\n ? asObjectId12(\n chunkIdObj.bb!.bytes().slice(chunkIdObj.bb_pos, chunkIdObj.bb_pos + 12),\n )\n : null;\n\n // Parse checksum fields\n const checksumEtag = fbsRef.checksumEtag();\n const checksumLastModified = fbsRef.checksumLastModified();\n\n const ref: ChunkRef = {\n index,\n inline,\n offset,\n length,\n chunkId,\n location: fbsRef.location(),\n checksumEtag,\n checksumLastModified,\n };\n\n // A dictionary-compressed location takes precedence over the plain `location`\n // string (Rust `ref_to_payload` priority: chunk_id -> compressed_location ->\n // location). `chunk_id` refs are native, not virtual, so they never carry a\n // location. Decode lazily on first read of `location` — mirroring the Rust\n // reader, which decompresses in `ref_to_payload` — so parsing a manifest\n // never decompresses locations the caller doesn't access (the binary search\n // in findChunkRef touches only `index`), and a single malformed frame fails\n // just its own ref instead of aborting the whole manifest parse.\n if (chunkId === null) {\n const compressed = fbsRef.compressedLocationArray();\n if (compressed) {\n let decoded: string | null = null;\n let resolved = false;\n Object.defineProperty(ref, \"location\", {\n configurable: true,\n enumerable: true,\n get() {\n if (!resolved) {\n decoded = decodeLocation(compressed);\n resolved = true;\n }\n return decoded;\n },\n });\n }\n }\n\n return ref;\n}\n\n/**\n * Find a chunk reference by node ID and coordinates.\n *\n * Uses binary search since both arrays and refs are sorted.\n */\nexport function findChunkRef(\n manifest: Manifest,\n nodeId: ObjectId8,\n coords: number[],\n): ChunkRef | null {\n // Binary search for the array manifest (arrays are sorted by nodeId)\n const arrayManifest = binarySearchArrayManifest(manifest.arrays, nodeId);\n\n if (!arrayManifest) return null;\n\n // Binary search for the chunk ref (refs are sorted by index)\n return binarySearchChunkRef(arrayManifest, coords);\n}\n\n/** Binary search for an array manifest by node ID */\nfunction binarySearchArrayManifest(\n arrays: ArrayManifest[],\n nodeId: ObjectId8,\n): ArrayManifest | null {\n let low = 0;\n let high = arrays.length - 1;\n\n while (low <= high) {\n const mid = Math.floor((low + high) / 2);\n const cmp = compareBytes(arrays[mid].nodeId, nodeId);\n\n if (cmp === 0) {\n return arrays[mid];\n } else if (cmp < 0) {\n low = mid + 1;\n } else {\n high = mid - 1;\n }\n }\n\n return null;\n}\n\n/** Compare two byte arrays lexicographically */\nfunction compareBytes(a: Uint8Array, b: Uint8Array): number {\n const minLen = Math.min(a.length, b.length);\n for (let i = 0; i < minLen; i++) {\n if (a[i] !== b[i]) return a[i] - b[i];\n }\n return a.length - b.length;\n}\n\n/** Compare two coordinate arrays lexicographically */\nfunction compareCoords(a: number[], b: number[]): number {\n const minLen = Math.min(a.length, b.length);\n for (let i = 0; i < minLen; i++) {\n if (a[i] !== b[i]) return a[i] - b[i];\n }\n return a.length - b.length;\n}\n\n/** Binary search for a chunk ref by coordinates, materializing only the match. */\nfunction binarySearchChunkRef(\n array: ArrayManifest,\n coords: number[],\n): ChunkRef | null {\n let low = 0;\n let high = array.numRefs - 1;\n\n while (low <= high) {\n const mid = Math.floor((low + high) / 2);\n const cmp = compareCoords(array.refIndex(mid), coords);\n\n if (cmp === 0) {\n return array.refAt(mid);\n } else if (cmp < 0) {\n low = mid + 1;\n } else {\n high = mid - 1;\n }\n }\n\n return null;\n}\n\n/**\n * Extract the payload type from a ChunkRef.\n *\n * Priority matches the Rust `ref_to_payload`: chunk_id (native) ->\n * location (virtual) -> inline. Reading `ref.location` decodes a\n * dictionary-compressed location lazily, and may throw on a malformed frame.\n */\nexport function getChunkPayload(ref: ChunkRef): ChunkPayload {\n if (ref.chunkId !== null) {\n return {\n type: \"native\",\n chunkId: ref.chunkId,\n offset: ref.offset,\n length: ref.length,\n };\n }\n\n if (ref.location !== null) {\n return {\n type: \"virtual\",\n location: ref.location,\n offset: ref.offset,\n length: ref.length,\n checksumEtag: ref.checksumEtag,\n checksumLastModified: ref.checksumLastModified,\n };\n }\n\n if (ref.inline !== null) {\n return { type: \"inline\", data: ref.inline };\n }\n\n throw new Error(\"Invalid ChunkRef: no chunkId, location, or inline\");\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class ChunkRef {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ChunkRef {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsChunkRef(\n bb: flatbuffers.ByteBuffer,\n obj?: ChunkRef,\n ): ChunkRef {\n return (obj || new ChunkRef()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n index(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.readUint32(this.bb!.__vector(this.bb_pos + offset) + index * 4)\n : 0;\n }\n\n indexLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n indexArray(): Uint32Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? new Uint32Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n inline(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n inlineLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n inlineArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n offset(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n length(): bigint {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.readUint64(this.bb_pos + offset) : BigInt(\"0\");\n }\n\n chunkId(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n location(): string | null;\n location(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n location(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n checksumEtag(): string | null;\n checksumEtag(\n optionalEncoding: flatbuffers.Encoding,\n ): string | Uint8Array | null;\n checksumEtag(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n checksumLastModified(): number {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset ? this.bb!.readUint32(this.bb_pos + offset) : 0;\n }\n\n compressedLocation(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n compressedLocationLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n compressedLocationArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ChunkRef } from \"../generated/chunk-ref.js\";\nimport { ObjectId8 } from \"../generated/object-id8.js\";\n\nexport class ArrayManifest {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ArrayManifest {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsArrayManifest(\n bb: flatbuffers.ByteBuffer,\n obj?: ArrayManifest,\n ): ArrayManifest {\n return (obj || new ArrayManifest()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n nodeId(obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId8()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n refs(index: number, obj?: ChunkRef): ChunkRef | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new ChunkRef()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n refsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ArrayManifest } from \"../generated/array-manifest.js\";\nimport { ObjectId12 } from \"../generated/object-id12.js\";\n\nexport class Manifest {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): Manifest {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsManifest(\n bb: flatbuffers.ByteBuffer,\n obj?: Manifest,\n ): Manifest {\n return (obj || new Manifest()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n id(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n arrays(index: number, obj?: ArrayManifest): ArrayManifest | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new ArrayManifest()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n arraysLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n locationDictionary(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n locationDictionaryLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n locationDictionaryArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n\n compressionAlgorithm(): number {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.readUint8(this.bb_pos + offset) : 1;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","/**\n * Metadata deserialization for icechunk snapshot metadata.\n *\n * v1 snapshots use MessagePack encoding, v2 uses FlexBuffers.\n */\n\nimport { decode } from \"@msgpack/msgpack\";\nimport * as flexbuffers from \"flatbuffers/js/flexbuffers.js\";\nimport { SpecVersion } from \"../header.js\";\nimport type { MetadataItem } from \"./types.js\";\n\n/**\n * Deserialize snapshot metadata items into a key-value record.\n *\n * @param items - Raw metadata items from the snapshot\n * @param specVersion - Spec version determines encoding format\n * @returns Deserialized metadata as a plain object\n */\nexport function deserializeMetadata(\n items: MetadataItem[],\n specVersion: SpecVersion,\n): Record<string, unknown> {\n const result: Record<string, unknown> = Object.create(null);\n for (const item of items) {\n result[item.name] =\n specVersion === SpecVersion.V1_0\n ? decode(item.value)\n : flexbuffers.toObject(\n item.value.buffer.slice(\n item.value.byteOffset,\n item.value.byteOffset + item.value.byteLength,\n ) as ArrayBuffer,\n );\n }\n return result;\n}\n","/**\n * Parser for icechunk TransactionLog FlatBuffer format.\n *\n * Uses flatc-generated TypeScript classes for type-safe field access.\n */\n\nimport { ByteBuffer } from \"flatbuffers\";\nimport { TransactionLog as FbsTransactionLog } from \"./generated/transaction-log.js\";\nimport {\n asObjectId12,\n asObjectId8,\n type ObjectId8,\n type TransactionLogEntry,\n type ArrayUpdatedChunksInfo,\n type UpdatedChunkIndices,\n type MoveOperationInfo,\n} from \"./types.js\";\n\n/** Extract bytes from a generated ObjectId12 struct */\nfunction readId12(bb: ByteBuffer, bbPos: number): Uint8Array {\n return bb.bytes().slice(bbPos, bbPos + 12);\n}\n\n/** Extract bytes from a generated ObjectId8 struct */\nfunction readId8(bb: ByteBuffer, bbPos: number): Uint8Array {\n return bb.bytes().slice(bbPos, bbPos + 8);\n}\n\n/** Read a vector of ObjectId8 values from a FlatBuffer accessor */\nfunction readId8Vector(\n length: number,\n accessor: (index: number) => { bb: ByteBuffer | null; bb_pos: number } | null,\n): ObjectId8[] {\n const result: ObjectId8[] = [];\n for (let i = 0; i < length; i++) {\n const obj = accessor(i);\n if (obj && obj.bb) {\n result.push(asObjectId8(readId8(obj.bb, obj.bb_pos)));\n }\n }\n return result;\n}\n\n/** Parse a TransactionLog from FlatBuffer data */\nexport function parseTransactionLog(data: Uint8Array): TransactionLogEntry {\n const bb = new ByteBuffer(data);\n const fbs = FbsTransactionLog.getRootAsTransactionLog(bb);\n\n // Parse ID (required)\n const idObj = fbs.id();\n if (!idObj) throw new Error(\"TransactionLog missing required id field\");\n const id = asObjectId12(readId12(idObj.bb!, idObj.bb_pos));\n\n // Parse ObjectId8 vectors\n const newGroups = readId8Vector(fbs.newGroupsLength(), (i) =>\n fbs.newGroups(i),\n );\n const newArrays = readId8Vector(fbs.newArraysLength(), (i) =>\n fbs.newArrays(i),\n );\n const deletedGroups = readId8Vector(fbs.deletedGroupsLength(), (i) =>\n fbs.deletedGroups(i),\n );\n const deletedArrays = readId8Vector(fbs.deletedArraysLength(), (i) =>\n fbs.deletedArrays(i),\n );\n const updatedArrays = readId8Vector(fbs.updatedArraysLength(), (i) =>\n fbs.updatedArrays(i),\n );\n const updatedGroups = readId8Vector(fbs.updatedGroupsLength(), (i) =>\n fbs.updatedGroups(i),\n );\n\n // Parse updated chunks\n const updatedChunks: ArrayUpdatedChunksInfo[] = [];\n for (let i = 0; i < fbs.updatedChunksLength(); i++) {\n const fbsChunk = fbs.updatedChunks(i);\n if (!fbsChunk) continue;\n\n const nodeIdObj = fbsChunk.nodeId();\n if (!nodeIdObj || !nodeIdObj.bb) continue;\n const nodeId = asObjectId8(readId8(nodeIdObj.bb, nodeIdObj.bb_pos));\n\n const chunks: UpdatedChunkIndices[] = [];\n for (let j = 0; j < fbsChunk.chunksLength(); j++) {\n const fbsIndices = fbsChunk.chunks(j);\n if (!fbsIndices) continue;\n\n const coords: number[] = [];\n for (let k = 0; k < fbsIndices.coordsLength(); k++) {\n const coord = fbsIndices.coords(k);\n if (coord !== null) coords.push(coord);\n }\n chunks.push({ coords });\n }\n\n updatedChunks.push({ nodeId, chunks });\n }\n\n // Parse moved nodes\n const movedNodes: MoveOperationInfo[] = [];\n for (let i = 0; i < fbs.movedNodesLength(); i++) {\n const fbsMove = fbs.movedNodes(i);\n if (!fbsMove) continue;\n\n const from = fbsMove.from();\n const to = fbsMove.to();\n if (from !== null && to !== null) {\n movedNodes.push({ from, to });\n }\n }\n\n return {\n id,\n newGroups,\n newArrays,\n deletedGroups,\n deletedArrays,\n updatedArrays,\n updatedGroups,\n updatedChunks,\n movedNodes,\n };\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nexport class ChunkIndices {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ChunkIndices {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsChunkIndices(\n bb: flatbuffers.ByteBuffer,\n obj?: ChunkIndices,\n ): ChunkIndices {\n return (obj || new ChunkIndices()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n coords(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.readUint32(this.bb!.__vector(this.bb_pos + offset) + index * 4)\n : 0;\n }\n\n coordsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n coordsArray(): Uint32Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? new Uint32Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ChunkIndices } from \"../generated/chunk-indices.js\";\nimport { ObjectId8 } from \"../generated/object-id8.js\";\n\nexport class ArrayUpdatedChunks {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): ArrayUpdatedChunks {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsArrayUpdatedChunks(\n bb: flatbuffers.ByteBuffer,\n obj?: ArrayUpdatedChunks,\n ): ArrayUpdatedChunks {\n return (obj || new ArrayUpdatedChunks()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n nodeId(obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId8()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n chunks(index: number, obj?: ChunkIndices): ChunkIndices | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new ChunkIndices()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n chunksLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { NodeType } from \"../generated/node-type.js\";\nimport { ObjectId8 } from \"../generated/object-id8.js\";\n\nexport class MoveOperation {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): MoveOperation {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsMoveOperation(\n bb: flatbuffers.ByteBuffer,\n obj?: MoveOperation,\n ): MoveOperation {\n return (obj || new MoveOperation()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n from(): string | null;\n from(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n from(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n to(): string | null;\n to(optionalEncoding: flatbuffers.Encoding): string | Uint8Array | null;\n to(optionalEncoding?: any): string | Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? this.bb!.__string(this.bb_pos + offset, optionalEncoding)\n : null;\n }\n\n nodeId(obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? (obj || new ObjectId8()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n nodeType(): NodeType {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.readUint8(this.bb_pos + offset) : NodeType.Group;\n }\n}\n","// automatically generated by the FlatBuffers compiler, do not modify\n\nimport * as flatbuffers from \"flatbuffers\";\n\nimport { ArrayUpdatedChunks } from \"../generated/array-updated-chunks.js\";\nimport { MoveOperation } from \"../generated/move-operation.js\";\nimport { ObjectId12 } from \"../generated/object-id12.js\";\nimport { ObjectId8 } from \"../generated/object-id8.js\";\n\nexport class TransactionLog {\n bb: flatbuffers.ByteBuffer | null = null;\n bb_pos = 0;\n __init(i: number, bb: flatbuffers.ByteBuffer): TransactionLog {\n this.bb_pos = i;\n this.bb = bb;\n return this;\n }\n\n static getRootAsTransactionLog(\n bb: flatbuffers.ByteBuffer,\n obj?: TransactionLog,\n ): TransactionLog {\n return (obj || new TransactionLog()).__init(\n bb.readInt32(bb.position()) + bb.position(),\n bb,\n );\n }\n\n id(obj?: ObjectId12): ObjectId12 | null {\n const offset = this.bb!.__offset(this.bb_pos, 4);\n return offset\n ? (obj || new ObjectId12()).__init(this.bb_pos + offset, this.bb!)\n : null;\n }\n\n newGroups(index: number, obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset\n ? (obj || new ObjectId8()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n newGroupsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 6);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n newArrays(index: number, obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset\n ? (obj || new ObjectId8()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n newArraysLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 8);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n deletedGroups(index: number, obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset\n ? (obj || new ObjectId8()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n deletedGroupsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 10);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n deletedArrays(index: number, obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset\n ? (obj || new ObjectId8()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n deletedArraysLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 12);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n updatedArrays(index: number, obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset\n ? (obj || new ObjectId8()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n updatedArraysLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 14);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n updatedGroups(index: number, obj?: ObjectId8): ObjectId8 | null {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset\n ? (obj || new ObjectId8()).__init(\n this.bb!.__vector(this.bb_pos + offset) + index * 8,\n this.bb!,\n )\n : null;\n }\n\n updatedGroupsLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 16);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n updatedChunks(\n index: number,\n obj?: ArrayUpdatedChunks,\n ): ArrayUpdatedChunks | null {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset\n ? (obj || new ArrayUpdatedChunks()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n updatedChunksLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 18);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n movedNodes(index: number, obj?: MoveOperation): MoveOperation | null {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset\n ? (obj || new MoveOperation()).__init(\n this.bb!.__indirect(\n this.bb!.__vector(this.bb_pos + offset) + index * 4,\n ),\n this.bb!,\n )\n : null;\n }\n\n movedNodesLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 20);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extra(index: number): number | null {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset\n ? this.bb!.readUint8(this.bb!.__vector(this.bb_pos + offset) + index)\n : 0;\n }\n\n extraLength(): number {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset ? this.bb!.__vector_len(this.bb_pos + offset) : 0;\n }\n\n extraArray(): Uint8Array | null {\n const offset = this.bb!.__offset(this.bb_pos, 22);\n return offset\n ? new Uint8Array(\n this.bb!.bytes().buffer,\n this.bb!.bytes().byteOffset + this.bb!.__vector(this.bb_pos + offset),\n this.bb!.__vector_len(this.bb_pos + offset),\n )\n : null;\n }\n}\n","/**\n * Adapters for zarrita's `withRangeCoalescing` (added in zarrita 0.7).\n *\n * The coalescer works over any range-readable store keyed by object path.\n * These adapters expose icechunk's two backing-object cases in that shape:\n *\n * - `makeUrlStore` fetches ranges from one external virtual-chunk URL.\n * - `makeStorageStore` fetches ranges from repository storage objects.\n *\n * Callers pass `zarrita.withRangeCoalescing` into icechunk-js explicitly when\n * they want coalescing, keeping zarrita a true optional dependency.\n */\n\nimport type { FetchClient, Storage } from \"../storage/storage.js\";\n\n// Minimal structural mirror of zarrita's `AsyncReadable`. Kept local so\n// this module has no required import from zarrita — the peer dep is\n// optional and may not resolve at build time for some consumers.\ntype RangeQuery = { offset: number; length: number } | { suffixLength: number };\ninterface GetOptions {\n signal?: AbortSignal;\n}\nexport interface AsyncReadable {\n get(key: string, options?: GetOptions): Promise<Uint8Array | undefined>;\n getRange(\n key: string,\n range: RangeQuery,\n options?: GetOptions,\n ): Promise<Uint8Array | undefined>;\n}\n\nexport type RangeCoalescingFn = (\n store: AsyncReadable,\n opts?: { coalesceSize?: number },\n) => AsyncReadable;\n\nexport interface MakeUrlStoreOptions {\n /** Absolute HTTP URL this store always fetches. */\n url: string;\n /** Pluggable HTTP client; defaults to `globalThis.fetch`. */\n fetchClient?: FetchClient;\n /**\n * Conditional request headers (`If-Match`, `If-Unmodified-Since`) baked\n * into every fetch. Used to carry `validateChecksums` semantics through\n * the coalesced path — all payloads sharing this store are assumed to\n * share the same checksum, so `ReadSession.getVirtualStoreForPayload`\n * partitions stores by checksum to avoid mixing conditional headers.\n *\n * Kept opt-in because these headers trigger CORS preflight requests in\n * browsers, and most storage servers don't whitelist them by default.\n */\n conditionalHeaders?: Record<string, string>;\n}\n\nfunction expectedRangeLength(range: RangeQuery): number {\n return \"suffixLength\" in range ? range.suffixLength : range.length;\n}\n\n/**\n * Map an S3 path-style global-endpoint region redirect to the regional URL to\n * retry. For buckets outside `us-east-1`, `s3.amazonaws.com` answers 301 with\n * no `Location` header (so `fetch` can't follow it) and reports the region in\n * `x-amz-bucket-region`; this rebuilds the URL against `s3.<region>.amazonaws.com`.\n * Returns null when the response isn't that redirect.\n */\nfunction regionalS3RedirectUrl(url: string, response: Response): string | null {\n if (response.status !== 301 && response.status !== 307) return null;\n const region = response.headers.get(\"x-amz-bucket-region\");\n if (!region) return null;\n const globalPrefix = \"https://s3.amazonaws.com/\";\n if (!url.startsWith(globalPrefix)) return null;\n return `https://s3.${region}.amazonaws.com/${url.slice(globalPrefix.length)}`;\n}\n\n/**\n * Build a minimal `AsyncReadable` that services every `getRange` by\n * fetching the configured URL with the requested byte range. The zarr\n * key is ignored — when wrapped by `withRangeCoalescing`, all requests\n * converge on the same path and become eligible for range-merging.\n */\nexport function makeUrlStore(opts: MakeUrlStoreOptions): AsyncReadable {\n const { fetchClient, conditionalHeaders } = opts;\n // Hint shared across reads: once one read resolves an S3 regional redirect,\n // later reads start from the regional host. Each read works off its own\n // `requestUrl` copy, so this value is an optimization, not a source of truth.\n let pinnedUrl = opts.url;\n\n async function doFetch(target: string, init: RequestInit): Promise<Response> {\n return fetchClient\n ? await fetchClient.fetch(target, init)\n : await fetch(target, init);\n }\n\n return {\n async get() {\n throw new Error(\n `Virtual chunk URL store for ${pinnedUrl} only supports ranged reads`,\n );\n },\n async getRange(_key, range, options) {\n const headers: Record<string, string> = conditionalHeaders\n ? { ...conditionalHeaders }\n : {};\n headers.Range =\n \"suffixLength\" in range\n ? `bytes=-${range.suffixLength}`\n : `bytes=${range.offset}-${range.offset + range.length - 1}`;\n\n // Copy the endpoint locally so a concurrent read updating the shared pin\n // can't change which URL this request detects and retries against.\n let requestUrl = pinnedUrl;\n let response = await doFetch(requestUrl, {\n headers,\n signal: options?.signal,\n });\n\n // Resolve a global-endpoint region redirect and retry once on the\n // regional host, re-pinning it for later reads.\n const regionalUrl = regionalS3RedirectUrl(requestUrl, response);\n if (regionalUrl) {\n // Free the discarded redirect body so Node can reuse the connection.\n response.body?.cancel().catch(() => {});\n requestUrl = regionalUrl;\n pinnedUrl = regionalUrl;\n response = await doFetch(requestUrl, {\n headers,\n signal: options?.signal,\n });\n }\n\n if (response.status === 412) {\n throw new Error(\n `Virtual chunk at ${requestUrl} failed integrity check — data has been modified since snapshot was created`,\n );\n }\n if (response.status !== 200 && response.status !== 206) {\n throw new Error(\n `Failed to fetch virtual chunk from ${requestUrl}: ${response.status} ${response.statusText}`,\n );\n }\n\n const data = new Uint8Array(await response.arrayBuffer());\n\n // 206 (Partial Content) is the happy path only when the response body\n // is exactly the requested range. Coalescers slice from this buffer by\n // offset, so accepting an overlong partial response can shift data.\n if (response.status === 206) {\n const expected = expectedRangeLength(range);\n if (data.length === expected) return data;\n throw new Error(\n `Virtual range response size mismatch for ${requestUrl}: expected ${expected} bytes, got ${data.length}`,\n );\n }\n\n // 200 means the server ignored the Range header and sent the full\n // object. Slice out the requested window so callers don't have to\n // know the distinction.\n if (\"offset\" in range) {\n const end = range.offset + range.length;\n if (data.length >= end) return data.slice(range.offset, end);\n throw new Error(\n `Virtual range request not honored for ${requestUrl}: need at least ${end} bytes for fallback slicing, got ${data.length}`,\n );\n }\n // Suffix-length on a 200 fallback: take the trailing suffixLength bytes.\n if (data.length >= range.suffixLength) {\n return data.slice(data.length - range.suffixLength);\n }\n throw new Error(\n `Virtual suffix range request not honored for ${requestUrl}: need at least ${range.suffixLength} bytes for fallback slicing, got ${data.length}`,\n );\n },\n };\n}\n\n/**\n * Build a minimal `AsyncReadable` over icechunk repository storage objects.\n *\n * This lets native chunk payloads use the same zarrita range-coalescing\n * wrapper as virtual chunks. The key remains the repository object path, so\n * zarrita only merges ranges that target the same chunk object.\n */\nexport function makeStorageStore(storage: Storage): AsyncReadable {\n return {\n async get(key, options) {\n const storageOptions = options?.signal\n ? { signal: options.signal }\n : undefined;\n return storage.getObject(key, undefined, storageOptions);\n },\n async getRange(key, range, options) {\n const storageOptions = options?.signal\n ? { signal: options.signal }\n : undefined;\n if (\"suffixLength\" in range) {\n throw new Error(\n `Storage suffix ranges are not supported for ${key}; convert suffixLength to offset/length before reading`,\n );\n }\n\n const storageRange = {\n start: range.offset,\n end: range.offset + range.length,\n };\n const data = await storage.getObject(key, storageRange, storageOptions);\n if (data.length === range.length) return data;\n\n // Range header may be ignored (e.g. HTTP 200 full body). If the full\n // object is available, slice out the requested window explicitly.\n if (data.length >= storageRange.end) {\n return data.slice(storageRange.start, storageRange.end);\n }\n\n throw new Error(\n `Storage returned ${data.length} bytes for ${key} range ${storageRange.start}-${storageRange.end - 1}; expected ${range.length} bytes`,\n );\n },\n };\n}\n","/**\n * ReadSession - Read-only session for accessing icechunk data.\n */\n\nimport type {\n FetchClient,\n Storage,\n RequestOptions,\n} from \"../storage/storage.js\";\nimport { decompress } from \"../vendor/fzstd/index.js\";\nimport { LRUCache } from \"../cache/lru.js\";\nimport { singleFlight, type SingleFlight } from \"../cache/single-flight.js\";\nimport {\n parseHeader,\n validateFileType,\n getDataAfterHeader,\n FileType,\n CompressionAlgorithm,\n SpecVersion,\n} from \"../format/header.js\";\nimport {\n getSnapshotPath,\n getManifestPath,\n getChunkPath,\n getTransactionLogPath,\n} from \"../format/constants.js\";\nimport { encodeObjectId12 } from \"../format/object-id.js\";\nimport {\n parseSnapshot,\n parseManifest,\n parseTransactionLog,\n findChunkRef,\n getChunkPayload,\n deserializeMetadata,\n type Snapshot,\n type Manifest,\n type NodeSnapshot,\n type ChunkPayload,\n type ObjectId12,\n type TransactionLogEntry,\n} from \"../format/flatbuffers/index.js\";\nimport { NotFoundError } from \"../storage/storage.js\";\nimport {\n makeStorageStore,\n makeUrlStore,\n type AsyncReadable,\n type RangeCoalescingFn,\n} from \"./range-coalescer.js\";\nimport type {\n VirtualChunkContainer,\n S3ContainerConfig,\n} from \"../format/flatbuffers/repo-parser.js\";\n\n/** Default byte-gap threshold for zarrita's range coalescer (matches its own default). */\nconst RANGE_COALESCE_SIZE = 32 * 1024;\n// Per-session cap on wrapped range stores. Eviction only reduces future\n// coalescing reuse for older backing objects; it does not affect read\n// correctness. 256 keeps the cache bounded while covering many active virtual\n// URLs or native objects in typical concurrent reads.\nconst RANGE_STORE_CACHE_SIZE = 256;\ntype RangeStoreKeyPart = string | number | null | readonly RangeStoreKeyPart[];\n\nfunction makeRangeStoreCacheKey(parts: readonly RangeStoreKeyPart[]): string {\n return JSON.stringify(parts);\n}\n\n/** Options for chunk reads from a ReadSession. */\nexport interface ReadOptions extends RequestOptions {\n /**\n * Zarrita-backed range coalescing function for chunk payload reads.\n *\n * Pass `zarrita.withRangeCoalescing` to opt in. Concurrent range reads\n * against the same backing object may be merged into one larger request,\n * matching zarrita's abort behavior for merged signals.\n */\n withRangeCoalescing?: RangeCoalescingFn;\n}\n\n/**\n * ReadSession provides read access to a specific snapshot.\n *\n * Use this class to:\n * - Get nodes (arrays/groups) by path\n * - Read chunk data\n * - Access Zarr metadata\n */\nexport class ReadSession {\n private storage: Storage;\n private snapshot: Snapshot;\n private specVersion: SpecVersion;\n private manifestCache: LRUCache<string, Manifest>;\n /**\n * Single-flight loader over `manifestCache`: concurrent misses for the\n * same manifest share one fetch instead of racing N identical GETs.\n * Critical for fan-out reads that all need the same manifest (e.g. the\n * many parallel chunk reads issued when a renderer crosses into a new\n * pyramid level).\n */\n private manifestLoader: SingleFlight<string, Manifest>;\n /**\n * Bounded cache of `AsyncReadable`s wrapped with zarrita's range coalescer.\n * The cache key includes request-option identities that must not share one\n * coalescing queue, notably virtual fetch clients and checksum headers.\n *\n * Promise slots are inserted synchronously on first use, so\n * concurrent requests for the same partition share one coalescing window\n * instead of racing to create parallel stores.\n */\n private rangeStores?: LRUCache<string, Promise<AsyncReadable>>;\n private nativeStore?: AsyncReadable;\n private fetchClientIds?: WeakMap<FetchClient, number>;\n private nextFetchClientId = 1;\n private rangeCoalescerIds?: WeakMap<RangeCoalescingFn, number>;\n private nextRangeCoalescerId = 1;\n /** Virtual chunk containers (from repo config) for resolving chunk locations. */\n private virtualChunkContainers: VirtualChunkContainer[];\n\n private constructor(\n storage: Storage,\n snapshot: Snapshot,\n specVersion: SpecVersion,\n maxManifestCacheSize: number = 100,\n virtualChunkContainers?: VirtualChunkContainer[],\n ) {\n this.storage = storage;\n this.snapshot = snapshot;\n this.specVersion = specVersion;\n this.manifestCache = new LRUCache(maxManifestCacheSize);\n this.manifestLoader = singleFlight(this.manifestCache);\n this.virtualChunkContainers = virtualChunkContainers ?? [];\n }\n\n private getFetchClientKey(fetchClient: FetchClient | undefined): string {\n if (!fetchClient) return \"default\";\n if (!this.fetchClientIds) this.fetchClientIds = new WeakMap();\n\n let id = this.fetchClientIds.get(fetchClient);\n if (id === undefined) {\n id = this.nextFetchClientId;\n this.nextFetchClientId = id + 1;\n this.fetchClientIds.set(fetchClient, id);\n }\n return String(id);\n }\n\n private getRangeCoalescerKey(withRangeCoalescing: RangeCoalescingFn): string {\n if (!this.rangeCoalescerIds) this.rangeCoalescerIds = new WeakMap();\n\n let id = this.rangeCoalescerIds.get(withRangeCoalescing);\n if (id === undefined) {\n id = this.nextRangeCoalescerId;\n this.nextRangeCoalescerId = id + 1;\n this.rangeCoalescerIds.set(withRangeCoalescing, id);\n }\n return String(id);\n }\n\n private getRangeStore(\n partitionKey: readonly RangeStoreKeyPart[],\n createStore: () => AsyncReadable,\n withRangeCoalescing: RangeCoalescingFn,\n ): Promise<AsyncReadable> {\n if (!this.rangeStores) {\n this.rangeStores = new LRUCache(RANGE_STORE_CACHE_SIZE);\n }\n const stores = this.rangeStores;\n const cacheKey = makeRangeStoreCacheKey([\n ...partitionKey,\n [\"coalescer\", this.getRangeCoalescerKey(withRangeCoalescing)],\n ]);\n\n const cached = stores.get(cacheKey);\n if (cached) return cached;\n\n const raw = createStore();\n const promise: Promise<AsyncReadable> = Promise.resolve()\n .then(() =>\n withRangeCoalescing(raw, { coalesceSize: RANGE_COALESCE_SIZE }),\n )\n .catch((error: unknown) => {\n if (stores.get(cacheKey) === promise) stores.delete(cacheKey);\n throw error;\n });\n stores.set(cacheKey, promise);\n return promise;\n }\n\n private getNativeStore(options?: ReadOptions): Promise<AsyncReadable> {\n if (!this.nativeStore) {\n this.nativeStore = makeStorageStore(this.storage);\n }\n const raw = this.nativeStore;\n const withRangeCoalescing = options?.withRangeCoalescing;\n if (!withRangeCoalescing) {\n return Promise.resolve(raw);\n }\n return this.getRangeStore([\"native\"], () => raw, withRangeCoalescing);\n }\n\n private getVirtualStoreForPayload(\n httpUrl: string,\n payload: {\n checksumEtag: string | null;\n checksumLastModified: number;\n },\n options: ReadOptions | undefined,\n ): Promise<AsyncReadable> {\n const validate = !!options?.validateChecksums;\n let conditionalHeaders: Record<string, string> | undefined;\n if (validate) {\n conditionalHeaders = {};\n if (payload.checksumEtag) {\n conditionalHeaders[\"If-Match\"] = payload.checksumEtag;\n }\n if (payload.checksumLastModified > 0) {\n conditionalHeaders[\"If-Unmodified-Since\"] = new Date(\n payload.checksumLastModified * 1000,\n ).toUTCString();\n }\n }\n\n const checksumKey = validate\n ? [\"checked\", payload.checksumEtag ?? \"\", payload.checksumLastModified]\n : [\"unchecked\"];\n\n const createStore = () =>\n makeUrlStore({\n url: httpUrl,\n fetchClient: options?.fetchClient,\n conditionalHeaders,\n });\n\n const withRangeCoalescing = options?.withRangeCoalescing;\n if (!withRangeCoalescing) {\n return Promise.resolve(createStore());\n }\n\n return this.getRangeStore(\n [\n \"virtual\",\n httpUrl,\n [\"fetch\", this.getFetchClientKey(options?.fetchClient)],\n checksumKey,\n ],\n createStore,\n withRangeCoalescing,\n );\n }\n\n /**\n * Open a read session for a specific snapshot.\n *\n * @param storage - Storage backend\n * @param snapshotId - Snapshot ID (12 bytes)\n * @param options - Optional request options (signal for cancellation)\n * @returns ReadSession instance\n */\n static async open(\n storage: Storage,\n snapshotId: Uint8Array,\n options?: RequestOptions & {\n maxManifestCacheSize?: number;\n virtualChunkContainers?: VirtualChunkContainer[];\n },\n ): Promise<ReadSession> {\n const { snapshot, specVersion } = await ReadSession.loadSnapshot(\n storage,\n snapshotId,\n options,\n );\n return new ReadSession(\n storage,\n snapshot,\n specVersion,\n options?.maxManifestCacheSize,\n options?.virtualChunkContainers,\n );\n }\n\n /** Load and parse a snapshot from storage */\n private static async loadSnapshot(\n storage: Storage,\n snapshotId: Uint8Array,\n options?: RequestOptions,\n ): Promise<{ snapshot: Snapshot; specVersion: SpecVersion }> {\n const path = getSnapshotPath(encodeObjectId12(snapshotId));\n const data = await storage.getObject(path, undefined, options);\n\n // Parse header\n const header = parseHeader(data);\n validateFileType(header, FileType.Snapshot);\n\n // Decompress if needed\n let flatbufferData = getDataAfterHeader(data);\n if (header.compression === CompressionAlgorithm.Zstd) {\n flatbufferData = decompress(flatbufferData);\n }\n\n // Parse FlatBuffer\n return {\n snapshot: parseSnapshot(flatbufferData),\n specVersion: header.specVersion,\n };\n }\n\n /**\n * Load and parse a manifest from storage.\n *\n * Concurrent calls for the same manifest are coalesced through\n * `manifestLoader` so a fan-out of chunk reads — the typical case\n * when many tiles cross into a new pyramid level at once — issues one\n * HTTP GET instead of one per caller. A caller's `signal` rejects only\n * that caller's await; the shared fetch is aborted only once every\n * active waiter has aborted.\n */\n private loadManifest(\n manifestId: ObjectId12,\n options?: RequestOptions,\n ): Promise<Manifest> {\n const idStr = encodeObjectId12(manifestId);\n return this.manifestLoader.load(\n idStr,\n (signal) => this.fetchManifest(idStr, signal),\n options?.signal,\n );\n }\n\n /**\n * Fetch and parse a single manifest. The `signal` here is the\n * single-flight loader's own signal — it fires only when every waiter\n * has aborted, so a hung manifest fetch doesn't trap later callers\n * behind it.\n */\n private async fetchManifest(\n idStr: string,\n signal: AbortSignal,\n ): Promise<Manifest> {\n const path = getManifestPath(idStr);\n const data = await this.storage.getObject(path, undefined, { signal });\n\n const header = parseHeader(data);\n validateFileType(header, FileType.Manifest);\n\n let flatbufferData = getDataAfterHeader(data);\n if (header.compression === CompressionAlgorithm.Zstd) {\n flatbufferData = decompress(flatbufferData);\n }\n\n return parseManifest(flatbufferData);\n }\n\n /**\n * Get the snapshot ID.\n */\n getSnapshotId(): ObjectId12 {\n return this.snapshot.id;\n }\n\n /**\n * Get the spec version of the snapshot.\n */\n getSpecVersion(): SpecVersion {\n return this.specVersion;\n }\n\n /**\n * Get the parent snapshot ID, or null for root snapshots.\n */\n getParentSnapshotId(): ObjectId12 | null {\n return this.snapshot.parentId;\n }\n\n /**\n * Get the commit message for this snapshot.\n */\n getMessage(): string {\n return this.snapshot.message;\n }\n\n /**\n * Get the timestamp when this snapshot was created.\n */\n getFlushedAt(): Date {\n // flushedAt is microseconds since epoch\n return new Date(Number(this.snapshot.flushedAt / 1000n));\n }\n\n /**\n * Get deserialized snapshot metadata.\n *\n * Decodes MessagePack (v1) or FlexBuffers (v2) metadata items\n * into a plain key-value object.\n */\n getSnapshotMetadata(): Record<string, unknown> {\n return deserializeMetadata(this.snapshot.metadata, this.specVersion);\n }\n\n /**\n * Load and parse the transaction log for this snapshot.\n *\n * Returns null if no transaction log exists (e.g., root snapshot).\n *\n * @param options - Optional request options (signal for cancellation)\n * @returns Parsed transaction log entry or null\n */\n async loadTransactionLog(\n options?: RequestOptions,\n ): Promise<TransactionLogEntry | null> {\n const path = getTransactionLogPath(encodeObjectId12(this.snapshot.id));\n\n let data: Uint8Array;\n try {\n data = await this.storage.getObject(path, undefined, options);\n } catch (error) {\n if (error instanceof NotFoundError) return null;\n throw error;\n }\n\n const header = parseHeader(data);\n validateFileType(header, FileType.TransactionLog);\n\n let flatbufferData = getDataAfterHeader(data);\n if (header.compression === CompressionAlgorithm.Zstd) {\n flatbufferData = decompress(flatbufferData);\n }\n\n return parseTransactionLog(flatbufferData);\n }\n\n /**\n * Get a node by path.\n *\n * @param path - Absolute path (e.g., \"/array\" or \"/group/nested\")\n * @returns NodeSnapshot or null if not found\n */\n getNode(path: string): NodeSnapshot | null {\n // Normalize path\n const normalizedPath = path.startsWith(\"/\") ? path : `/${path}`;\n\n // Binary search since nodes are sorted by path\n return this.binarySearchNode(normalizedPath);\n }\n\n /**\n * List all nodes in the snapshot.\n *\n * @returns Array of all nodes\n */\n listNodes(): NodeSnapshot[] {\n return [...this.snapshot.nodes];\n }\n\n /**\n * List children of a group.\n *\n * @param parentPath - Path to the parent group (use \"/\" for root)\n * @returns Array of child nodes\n */\n listChildren(parentPath: string): NodeSnapshot[] {\n const normalizedParent = parentPath === \"/\" ? \"\" : parentPath;\n const prefix = normalizedParent + \"/\";\n\n return this.snapshot.nodes.filter((node) => {\n if (!node.path.startsWith(prefix)) return false;\n // Check it's a direct child (no more slashes after prefix)\n const rest = node.path.slice(prefix.length);\n return !rest.includes(\"/\");\n });\n }\n\n /**\n * Get the Zarr metadata for a node.\n *\n * @param path - Path to the node\n * @returns Parsed JSON metadata or null if node not found\n */\n getMetadata(path: string): unknown | null {\n const node = this.getNode(path);\n if (!node) return null;\n\n const json = new TextDecoder().decode(node.userData);\n return JSON.parse(json);\n }\n\n /**\n * Get raw user data (Zarr metadata bytes) for a node.\n *\n * @param path - Path to the node\n * @returns Raw metadata bytes or null if node not found\n */\n getRawMetadata(path: string): Uint8Array | null {\n const node = this.getNode(path);\n if (!node) return null;\n return node.userData;\n }\n\n /**\n * Read chunk data for an array.\n *\n * @param path - Path to the array\n * @param coords - Chunk coordinates (N-dimensional)\n * @param options - Optional request options (signal for cancellation)\n * @returns Chunk data bytes or null if not found\n */\n async getChunk(\n path: string,\n coords: number[],\n options?: ReadOptions,\n ): Promise<Uint8Array | null> {\n options?.signal?.throwIfAborted();\n const requestOptions = toRequestOptions(options);\n\n const node = this.getNode(path);\n if (!node || node.nodeData.type !== \"array\") {\n return null;\n }\n\n // Find the manifest that contains this chunk\n const arrayData = node.nodeData;\n\n for (const manifestRef of arrayData.manifests) {\n // Check if this manifest covers the requested coordinates\n if (!this.coordsInExtents(coords, manifestRef.extents)) {\n continue;\n }\n\n // Load the manifest with signal\n const manifest = await this.loadManifest(\n manifestRef.objectId,\n requestOptions,\n );\n\n // Find the chunk reference\n const chunkRef = findChunkRef(manifest, node.id, coords);\n if (!chunkRef) continue;\n\n // Fetch the chunk data based on payload type with signal\n const payload = getChunkPayload(chunkRef);\n return this.fetchChunkPayload(payload, options);\n }\n\n return null;\n }\n\n /**\n * Read a byte range of chunk data for an array.\n *\n * Like getChunk, but fetches only the requested byte range from storage\n * instead of the full chunk. Used by IcechunkStore.getRange to support\n * zarrita's sharded array reads efficiently.\n *\n * @param path - Path to the array\n * @param coords - Chunk coordinates (N-dimensional)\n * @param range - Byte range within the chunk data\n * @param options - Optional request options (signal for cancellation)\n * @returns Chunk data bytes or null if not found\n */\n async getChunkRange(\n path: string,\n coords: number[],\n range: { offset: number; length: number } | { suffixLength: number },\n options?: ReadOptions,\n ): Promise<Uint8Array | null> {\n options?.signal?.throwIfAborted();\n const requestOptions = toRequestOptions(options);\n\n const node = this.getNode(path);\n if (!node || node.nodeData.type !== \"array\") {\n return null;\n }\n\n const arrayData = node.nodeData;\n\n for (const manifestRef of arrayData.manifests) {\n if (!this.coordsInExtents(coords, manifestRef.extents)) {\n continue;\n }\n\n const manifest = await this.loadManifest(\n manifestRef.objectId,\n requestOptions,\n );\n const chunkRef = findChunkRef(manifest, node.id, coords);\n if (!chunkRef) continue;\n\n const payload = getChunkPayload(chunkRef);\n return this.fetchChunkPayloadRange(payload, range, options);\n }\n\n return null;\n }\n\n /** Check if coordinates fall within extent ranges */\n private coordsInExtents(\n coords: number[],\n extents: Array<{ from: number; to: number }>,\n ): boolean {\n if (coords.length !== extents.length) return false;\n\n for (let i = 0; i < coords.length; i++) {\n const { from, to } = extents[i];\n if (coords[i] < from || coords[i] >= to) {\n return false;\n }\n }\n\n return true;\n }\n\n /** Fetch chunk data based on payload type */\n private async fetchChunkPayload(\n payload: ChunkPayload,\n options?: ReadOptions,\n ): Promise<Uint8Array> {\n switch (payload.type) {\n case \"inline\":\n return payload.data;\n\n case \"native\": {\n const path = getChunkPath(encodeObjectId12(payload.chunkId));\n const requestedStart = payload.offset;\n const requestedEnd = payload.offset + payload.length;\n const store = await this.getNativeStore(options);\n const data = await store.getRange(\n path,\n { offset: requestedStart, length: payload.length },\n { signal: options?.signal },\n );\n if (!data) {\n throw new Error(\n `Failed to fetch native chunk from ${path} range ${requestedStart}-${requestedEnd - 1}: empty response`,\n );\n }\n if (data.length === payload.length) return data;\n\n throw new Error(\n `Storage returned ${data.length} bytes for ${path} range ${requestedStart}-${requestedEnd - 1}; expected ${payload.length} bytes`,\n );\n }\n\n case \"virtual\": {\n // Virtual chunks reference external URLs\n // Expand any vcc://name/path → absolute URL, then translate s3:// etc. → HTTPS\n const { url: absoluteLocation, container } =\n resolveVirtualChunkLocation(\n payload.location,\n this.virtualChunkContainers,\n );\n const httpUrl = translateToHttpUrl(absoluteLocation, {\n azureAccount: options?.azureAccount,\n s3: container?.s3,\n });\n\n const store = await this.getVirtualStoreForPayload(\n httpUrl,\n payload,\n options,\n );\n const data = await store.getRange(\n \"/\",\n { offset: payload.offset, length: payload.length },\n { signal: options?.signal },\n );\n if (!data) {\n throw new Error(\n `Failed to fetch virtual chunk from ${httpUrl}: empty response`,\n );\n }\n if (data.length !== payload.length) {\n throw new Error(\n `Virtual range response size mismatch for ${httpUrl}: expected ${payload.length} bytes, got ${data.length}`,\n );\n }\n return data;\n }\n }\n }\n\n /** Fetch a byte range of chunk data based on payload type */\n private async fetchChunkPayloadRange(\n payload: ChunkPayload,\n range: { offset: number; length: number } | { suffixLength: number },\n options?: ReadOptions,\n ): Promise<Uint8Array> {\n // Compute absolute start/end within the chunk's data\n let rangeStart: number;\n let rangeEnd: number;\n\n if (\"suffixLength\" in range) {\n rangeStart =\n payload.type === \"inline\"\n ? payload.data.length - range.suffixLength\n : payload.length - range.suffixLength;\n rangeEnd =\n payload.type === \"inline\" ? payload.data.length : payload.length;\n } else {\n rangeStart = range.offset;\n rangeEnd = range.offset + range.length;\n }\n\n switch (payload.type) {\n case \"inline\":\n return payload.data.slice(rangeStart, rangeEnd);\n\n case \"native\": {\n const path = getChunkPath(encodeObjectId12(payload.chunkId));\n const requestedStart = payload.offset + rangeStart;\n const expectedSize = rangeEnd - rangeStart;\n const requestedEnd = requestedStart + expectedSize;\n const store = await this.getNativeStore(options);\n const data = await store.getRange(\n path,\n { offset: requestedStart, length: expectedSize },\n { signal: options?.signal },\n );\n if (!data) {\n throw new Error(\n `Failed to fetch native chunk from ${path} range ${requestedStart}-${requestedEnd - 1}: empty response`,\n );\n }\n if (data.length === expectedSize) return data;\n\n throw new Error(\n `Storage returned ${data.length} bytes for ${path} range ${requestedStart}-${requestedEnd - 1}; expected ${expectedSize} bytes`,\n );\n }\n\n case \"virtual\": {\n const absoluteStart = payload.offset + rangeStart;\n const expectedSize = rangeEnd - rangeStart;\n\n const { url: absoluteLocation, container } =\n resolveVirtualChunkLocation(\n payload.location,\n this.virtualChunkContainers,\n );\n const httpUrl = translateToHttpUrl(absoluteLocation, {\n azureAccount: options?.azureAccount,\n s3: container?.s3,\n });\n\n const store = await this.getVirtualStoreForPayload(\n httpUrl,\n payload,\n options,\n );\n const data = await store.getRange(\n \"/\",\n { offset: absoluteStart, length: expectedSize },\n { signal: options?.signal },\n );\n if (!data) {\n throw new Error(\n `Failed to fetch virtual chunk from ${httpUrl}: empty response`,\n );\n }\n if (data.length !== expectedSize) {\n throw new Error(\n `Virtual range response size mismatch for ${httpUrl}: expected ${expectedSize} bytes, got ${data.length}`,\n );\n }\n return data;\n }\n }\n }\n\n /** Binary search for a node by path */\n private binarySearchNode(path: string): NodeSnapshot | null {\n const nodes = this.snapshot.nodes;\n let low = 0;\n let high = nodes.length - 1;\n\n while (low <= high) {\n const mid = Math.floor((low + high) / 2);\n const cmp = compareUtf8Bytes(nodes[mid].path, path);\n\n if (cmp === 0) {\n return nodes[mid];\n } else if (cmp < 0) {\n low = mid + 1;\n } else {\n high = mid - 1;\n }\n }\n\n return null;\n }\n}\n\n/** UTF-8 encoder for byte comparisons */\nconst utf8Encoder = new TextEncoder();\n\nfunction toRequestOptions(options?: ReadOptions): RequestOptions | undefined {\n if (!options) return undefined;\n return {\n ...(options.signal && { signal: options.signal }),\n ...(options.fetchClient && { fetchClient: options.fetchClient }),\n ...(options.validateChecksums !== undefined && {\n validateChecksums: options.validateChecksums,\n }),\n ...(options.azureAccount !== undefined && {\n azureAccount: options.azureAccount,\n }),\n };\n}\n\n/**\n * Compare two strings by UTF-8 byte order to match Rust's str::cmp.\n *\n * JavaScript's native string comparison uses UTF-16 code units, which differs\n * from UTF-8 byte order for characters outside the Basic Multilingual Plane\n * (code points > 0xFFFF, like emoji).\n */\nfunction compareUtf8Bytes(a: string, b: string): number {\n const bytesA = utf8Encoder.encode(a);\n const bytesB = utf8Encoder.encode(b);\n\n const minLen = Math.min(bytesA.length, bytesB.length);\n for (let i = 0; i < minLen; i++) {\n if (bytesA[i] !== bytesB[i]) {\n return bytesA[i] - bytesB[i];\n }\n }\n\n return bytesA.length - bytesB.length;\n}\n\n/** URL scheme for relative Virtual Chunk Container references. */\nconst VCC_SCHEME = \"vcc://\";\n\n/**\n * Resolve a virtual chunk location to an absolute URL and its matching\n * container. `vcc://name/...` references resolve by container name; absolute\n * locations match the container whose `urlPrefix` is a prefix (the list is\n * pre-sorted longest-first, so the most specific wins). The matched\n * container's S3 store config drives endpoint/region selection in\n * `translateToHttpUrl`.\n *\n * Pass-through with no container when the location isn't `vcc://` and no\n * prefix matches, or when there are no containers at all (e.g. a `ReadSession`\n * built without a `Repository`, where a caller's `fetchClient` resolves\n * `vcc://` itself).\n *\n * Persisted configs may carry legacy prefixes without a trailing slash;\n * normalize before joining so `vcc://name/path` resolves under the container\n * root rather than against the last prefix segment.\n *\n * @throws Error when a `vcc://` URL is malformed, or names an unknown\n * container despite a populated container list.\n */\nexport function resolveVirtualChunkLocation(\n location: string,\n containers: VirtualChunkContainer[],\n): { url: string; container?: VirtualChunkContainer } {\n if (location.startsWith(VCC_SCHEME)) {\n const rest = location.slice(VCC_SCHEME.length);\n const slash = rest.indexOf(\"/\");\n if (slash === -1) {\n throw new Error(\n `Invalid vcc:// URL \"${location}\": missing \"/\" after container name`,\n );\n }\n const name = rest.slice(0, slash);\n const relativePath = rest.slice(slash + 1);\n const container = containers.find((c) => c.name === name);\n if (!container) {\n if (containers.length === 0) return { url: location };\n throw new Error(\n `Unknown virtual chunk container \"${name}\" referenced by ${location}`,\n );\n }\n return {\n url: ensureTrailingSlash(container.urlPrefix) + relativePath,\n container,\n };\n }\n\n // Match on a normalized (trailing-slash) prefix so a legacy prefix like\n // `s3://bucket` can't claim a sibling such as `s3://bucket2/key`.\n const container = containers.find((c) =>\n location.startsWith(ensureTrailingSlash(c.urlPrefix)),\n );\n return { url: location, container };\n}\n\n/** Append a trailing `/` if absent, so prefix matches respect a path boundary. */\nfunction ensureTrailingSlash(prefix: string): string {\n return prefix.endsWith(\"/\") ? prefix : `${prefix}/`;\n}\n\n/**\n * Build an HTTPS URL for an `s3://bucket/key` location, honoring the\n * container's S3 store config (mirrors how Rust builds the request):\n *\n * - `endpointUrl` (S3-compatible / Tigris) overrides the host, path-style.\n * - dotted bucket names force path-style — virtual-hosted breaks TLS cert\n * validation; `forcePathStyle` forces it for any bucket.\n * - `region`, when known, targets the regional endpoint directly. This is\n * required for browser reads of dotted buckets: the global endpoint's\n * region redirect carries no CORS headers, so the browser can't follow it.\n * Without a region we use the global endpoint and `makeUrlStore` resolves\n * the redirect at fetch time (works server-side only).\n */\nfunction buildS3HttpUrl(\n bucket: string,\n key: string,\n s3?: S3ContainerConfig,\n): string {\n if (s3?.endpointUrl) {\n const base = s3.endpointUrl.replace(/\\/+$/, \"\");\n return `${base}/${bucket}/${key}`;\n }\n const region = s3?.region;\n const pathStyle = s3?.forcePathStyle === true || bucket.includes(\".\");\n if (pathStyle) {\n const host = region\n ? `s3.${region}.${awsEndpointSuffix(region)}`\n : \"s3.amazonaws.com\";\n return `https://${host}/${bucket}/${key}`;\n }\n const host = region\n ? `${bucket}.s3.${region}.${awsEndpointSuffix(region)}`\n : `${bucket}.s3.amazonaws.com`;\n return `https://${host}/${key}`;\n}\n\n/**\n * AWS partition endpoint suffix for an S3 region. China (`cn-*`) uses\n * `amazonaws.com.cn`; GovCloud uses the commercial suffix, and ISO partitions\n * are air-gapped (not web-reachable), so the commercial suffix covers them.\n */\nfunction awsEndpointSuffix(region: string): string {\n return region.startsWith(\"cn-\") ? \"amazonaws.com.cn\" : \"amazonaws.com\";\n}\n\n/**\n * Translate cloud storage URLs to HTTP(S) endpoints for public buckets.\n *\n * Supports:\n * - s3://bucket/key → https://bucket.s3.amazonaws.com/key (or path-style for dotted buckets)\n * - gs://bucket/key or gcs://bucket/key → https://storage.googleapis.com/bucket/key\n * - az://container/path or azure://container/path → https://{azureAccount}.blob.core.windows.net/container/path\n * - abfs://container@account.dfs.core.windows.net/path → https://account.blob.core.windows.net/container/path\n * - http(s):// URLs pass through unchanged\n *\n * Azure az:// and azure:// URLs follow the Rust convention where the host is\n * the container name (not the account). The account must be supplied separately\n * via the azureAccount parameter.\n *\n * Note: S3 addressing follows the container's store config (region, endpoint,\n * path-style); see `buildS3HttpUrl`. When no region is known, dotted-name\n * buckets use the global path-style endpoint, whose region redirect\n * `makeUrlStore` resolves at fetch time (server only).\n */\nfunction translateToHttpUrl(\n url: string,\n options?: { azureAccount?: string; s3?: S3ContainerConfig },\n): string {\n const azureAccount = options?.azureAccount;\n // S3: addressing is driven by the container's S3 store config — see\n // buildS3HttpUrl for the virtual-hosted vs path-style and region rules.\n if (url.startsWith(\"s3://\")) {\n const rest = url.slice(5); // Remove 's3://'\n const slashIndex = rest.indexOf(\"/\");\n const bucket = slashIndex === -1 ? rest : rest.slice(0, slashIndex);\n const key = slashIndex === -1 ? \"\" : rest.slice(slashIndex + 1);\n return buildS3HttpUrl(bucket, key, options?.s3);\n }\n\n // GCS: gs://bucket/key or gcs://bucket/key → https://storage.googleapis.com/bucket/key\n if (url.startsWith(\"gs://\") || url.startsWith(\"gcs://\")) {\n const prefixLen = url.startsWith(\"gs://\") ? 5 : 6;\n const rest = url.slice(prefixLen);\n return `https://storage.googleapis.com/${rest}`;\n }\n\n // Azure: az://container/path or azure://container/path\n // → https://{azureAccount}.blob.core.windows.net/container/path\n // Matches Rust convention: container is in the host position, account from config.\n if (url.startsWith(\"az://\") || url.startsWith(\"azure://\")) {\n if (!azureAccount) {\n throw new Error(\n `Cannot translate Azure URL \"${url}\": azureAccount option is required. ` +\n `az:// and azure:// URLs encode only the container name; ` +\n `pass azureAccount in store options to supply the storage account.`,\n );\n }\n const prefixLen = url.startsWith(\"az://\") ? 5 : 8;\n const rest = url.slice(prefixLen);\n const firstSlash = rest.indexOf(\"/\");\n if (firstSlash === -1) {\n // Just container, no path\n return `https://${azureAccount}.blob.core.windows.net/${rest}`;\n }\n const container = rest.slice(0, firstSlash);\n const path = rest.slice(firstSlash + 1);\n return `https://${azureAccount}.blob.core.windows.net/${container}/${path}`;\n }\n\n // ABFS: abfs://container@account.dfs.core.windows.net/path\n // → https://account.blob.core.windows.net/container/path\n if (url.startsWith(\"abfs://\")) {\n const rest = url.slice(7); // Remove 'abfs://'\n const atIndex = rest.indexOf(\"@\");\n if (atIndex !== -1) {\n const container = rest.slice(0, atIndex);\n const hostAndPath = rest.slice(atIndex + 1);\n // Extract account from account.dfs.core.windows.net/path\n const firstSlash = hostAndPath.indexOf(\"/\");\n const host =\n firstSlash === -1 ? hostAndPath : hostAndPath.slice(0, firstSlash);\n const path = firstSlash === -1 ? \"\" : hostAndPath.slice(firstSlash + 1);\n // Extract account name from host (account.dfs.core.windows.net)\n const dotIndex = host.indexOf(\".\");\n const account = dotIndex === -1 ? host : host.slice(0, dotIndex);\n const suffix = path ? `${container}/${path}` : container;\n return `https://${account}.blob.core.windows.net/${suffix}`;\n }\n }\n\n // Already HTTP(S) or unsupported scheme - pass through\n return url;\n}\n","/**\n * Repository - Entry point for reading icechunk repositories.\n */\n\nimport type { Storage, RequestOptions } from \"../storage/storage.js\";\nimport { NotFoundError, isAbortError } from \"../storage/storage.js\";\nimport {\n getBranchRefDirPath,\n getBranchRefPath,\n getTagRefDirPath,\n getTagRefPath,\n PATHS,\n REPO_INFO_PATH,\n} from \"../format/constants.js\";\nimport { decodeObjectId12, encodeObjectId12 } from \"../format/object-id.js\";\nimport {\n parseRepo,\n resolveBranch,\n resolveTag,\n listBranchesFromRepo,\n listTagsFromRepo,\n type ParsedRepo,\n} from \"../format/flatbuffers/repo-parser.js\";\nimport { ReadSession } from \"./session.js\";\n\n/** Reference data stored in ref.json files */\nexport interface RefData {\n /** Base32-encoded snapshot ID */\n snapshot: string;\n}\n\n/** Options for opening a repository */\nexport interface RepositoryOptions {\n /** Storage backend to use */\n storage: Storage;\n /** Format version hint to skip auto-detection. 'v1' skips /repo request. */\n formatVersion?: \"v1\" | \"v2\";\n}\n\n/**\n * Repository provides access to an icechunk repository.\n *\n * Use this class to:\n * - List branches and tags\n * - Checkout a specific version to get a ReadSession\n */\nexport class Repository {\n private storage: Storage;\n private repoInfo: ParsedRepo | null = null;\n private repoInfoAttempted = false;\n\n private constructor(storage: Storage) {\n this.storage = storage;\n }\n\n /**\n * Load and cache the v2 repo info file.\n *\n * Uses getObject() directly to avoid race conditions with exists().\n * - NotFoundError => v1 format (no repo file)\n * - Any other error => hard error (parse failure, etc.)\n *\n * @param options - Optional request options (signal for cancellation)\n * @returns ParsedRepo if v2 format, null if v1 format\n * @throws Error if repo file exists but fails to parse\n * @throws An error named \"AbortError\" if the operation was aborted\n */\n private async loadRepoInfo(\n options?: RequestOptions,\n ): Promise<ParsedRepo | null> {\n if (this.repoInfoAttempted) {\n return this.repoInfo;\n }\n this.repoInfoAttempted = true;\n\n try {\n const data = await this.storage.getObject(\n REPO_INFO_PATH,\n undefined,\n options,\n );\n this.repoInfo = parseRepo(data);\n return this.repoInfo;\n } catch (error) {\n // Propagate abort errors\n if (isAbortError(error)) {\n this.repoInfoAttempted = false; // Allow retry\n throw error;\n }\n // NotFoundError means v1 format (no repo file)\n if (error instanceof NotFoundError) {\n return null;\n }\n // Any other error is fatal\n throw new Error(\n `Failed to parse v2 repo file: ${error instanceof Error ? error.message : error}`,\n );\n }\n }\n\n /**\n * Open an icechunk repository.\n *\n * - Try to load and parse repo info file (v2+ format)\n * - If NotFoundError, check for main branch (v1 format)\n * - Parse failures are hard errors (matching Rust behavior)\n *\n * @param options - Repository options including storage backend\n * @param requestOptions - Optional request options (signal for cancellation)\n * @returns A Repository instance\n */\n static async open(\n options: RepositoryOptions,\n requestOptions?: RequestOptions,\n ): Promise<Repository> {\n const repo = new Repository(options.storage);\n\n if (options.formatVersion === \"v1\") {\n // User asserts v1 format - skip all validation, defer errors to checkout\n repo.repoInfoAttempted = true;\n return repo;\n }\n\n // Try v2 format first - load and parse to fail fast on corruption\n const repoInfo = await repo.loadRepoInfo(requestOptions);\n if (repoInfo) {\n return repo; // v2 format - repo file exists and parsed successfully\n }\n if (options.formatVersion === \"v2\") {\n throw new Error(\"Repository info not found but v2 format was specified\");\n }\n\n // Auto-detect: check for main branch (v1 format)\n const mainBranchDir = getBranchRefDirPath(\"main\");\n const mainExists = await repo.hasAnyRefFile(\n mainBranchDir,\n getBranchRefPath(\"main\"),\n requestOptions,\n );\n if (mainExists) {\n return repo;\n }\n\n throw new Error(\n \"Not a valid icechunk repository: neither repo info file nor main branch found\",\n );\n }\n\n /**\n * Check if any ref file exists in a directory.\n * Ref files are .json files that are not .deleted files.\n *\n * @param dirPrefix - Directory prefix to check\n * @param legacyPath - Optional legacy ref.json path to check if listing fails\n * @param options - Optional request options (signal for cancellation)\n */\n private async hasAnyRefFile(\n dirPrefix: string,\n legacyPath?: string,\n options?: RequestOptions,\n ): Promise<boolean> {\n try {\n for await (const path of this.storage.listPrefix(dirPrefix)) {\n if (path.endsWith(\".json\") && !path.endsWith(\".deleted\")) {\n return true;\n }\n }\n } catch (error) {\n // Propagate abort errors\n if (isAbortError(error)) {\n throw error;\n }\n // Listing not supported - try legacy path only\n if (legacyPath) {\n return await this.storage.exists(legacyPath, options);\n }\n }\n return false;\n }\n\n /**\n * Find the latest non-deleted ref file in a directory.\n * When storage supports listPrefix(), refs may use versioned filenames\n * (e.g., AAAAAAAA.json) for optimistic concurrency control. The latest\n * version has the highest filename. Deletion tombstones are checked.\n *\n * When listing is not supported (e.g., HTTP storage), only the legacy\n * ref.json path is returned (caller must handle NotFoundError on read).\n *\n * @param dirPrefix - Directory prefix to search\n * @param legacyPath - Optional legacy ref.json path to try if listing fails\n */\n private async findLatestRefFile(\n dirPrefix: string,\n legacyPath?: string,\n ): Promise<string | null> {\n const jsonFiles: string[] = [];\n const deletedFiles = new Set<string>();\n\n try {\n for await (const path of this.storage.listPrefix(dirPrefix)) {\n if (path.endsWith(\".deleted\")) {\n // Track deletion tombstones (e.g., \"ABC.json.deleted\" -> \"ABC.json\")\n deletedFiles.add(path.slice(0, -\".deleted\".length));\n } else if (path.endsWith(\".json\")) {\n jsonFiles.push(path);\n }\n }\n } catch (error) {\n // Propagate abort errors\n if (isAbortError(error)) {\n throw error;\n }\n // Listing not supported - return legacy path without checking exists.\n // Caller will handle NotFoundError when reading.\n return legacyPath || null;\n }\n\n if (jsonFiles.length === 0) {\n return null;\n }\n\n // Sort lexicographically and find the latest non-deleted version\n jsonFiles.sort();\n\n // Start from the latest and find the first non-deleted file\n for (let i = jsonFiles.length - 1; i >= 0; i--) {\n if (!deletedFiles.has(jsonFiles[i])) {\n return jsonFiles[i];\n }\n }\n\n // All versions are deleted\n return null;\n }\n\n /**\n * List all branches in the repository.\n *\n * Unlike tags, branches in icechunk v1 have no tombstone mechanism —\n * deletion removes the ref file outright. A branch is present iff it has\n * at least one ref file in its directory.\n *\n * @returns Array of branch names\n */\n async listBranches(): Promise<string[]> {\n // Try v2 format first\n const repoInfo = await this.loadRepoInfo();\n if (repoInfo) {\n return listBranchesFromRepo(repoInfo);\n }\n\n // V1 fallback - file-based lookup\n const branches = new Set<string>();\n\n try {\n for await (const path of this.storage.listPrefix(\n `${PATHS.REFS}/branch.`,\n )) {\n // Match ref files like \"refs/branch.main/ref.json\" (ignore tombstones\n // for defensiveness — Rust never writes them for branches).\n const match = path.match(/^refs\\/branch\\.(.+)\\/([^/]+\\.json)$/);\n if (match) {\n branches.add(match[1]);\n }\n }\n } catch (error) {\n if (isAbortError(error)) {\n throw error;\n }\n throw new Error(\"Cannot list branches: storage does not support listing\");\n }\n\n return [...branches];\n }\n\n /**\n * List all tags in the repository.\n *\n * Tags with deletion tombstones on their latest ref file are excluded.\n *\n * @returns Array of tag names\n */\n async listTags(): Promise<string[]> {\n // Try v2 format first\n const repoInfo = await this.loadRepoInfo();\n if (repoInfo) {\n return listTagsFromRepo(repoInfo);\n }\n\n // V1 fallback - file-based lookup\n // Track files per tag: tag name -> { jsonFiles, deletedFiles }\n const tagFiles = new Map<\n string,\n { jsonFiles: string[]; deletedFiles: Set<string> }\n >();\n\n try {\n for await (const path of this.storage.listPrefix(`${PATHS.REFS}/tag.`)) {\n // Extract tag name from paths like:\n // - \"refs/tag.v1.0/ZZZZZZZZ.json\" (versioned)\n // - \"refs/tag.v1.0/ref.json\" (legacy)\n // - \"refs/tag.v1.0/ZZZZZZZZ.json.deleted\" (deletion tombstone)\n const jsonMatch = path.match(/^refs\\/tag\\.(.+)\\/([^/]+\\.json)$/);\n const deletedMatch = path.match(\n /^refs\\/tag\\.(.+)\\/([^/]+\\.json)\\.deleted$/,\n );\n\n if (deletedMatch) {\n const tagName = deletedMatch[1];\n const refFile = `refs/tag.${tagName}/${deletedMatch[2]}`;\n if (!tagFiles.has(tagName)) {\n tagFiles.set(tagName, { jsonFiles: [], deletedFiles: new Set() });\n }\n tagFiles.get(tagName)!.deletedFiles.add(refFile);\n } else if (jsonMatch) {\n const tagName = jsonMatch[1];\n if (!tagFiles.has(tagName)) {\n tagFiles.set(tagName, { jsonFiles: [], deletedFiles: new Set() });\n }\n tagFiles.get(tagName)!.jsonFiles.push(path);\n }\n }\n } catch (error) {\n if (isAbortError(error)) {\n throw error;\n }\n throw new Error(\"Cannot list tags: storage does not support listing\");\n }\n\n // Filter to only include tags where latest ref is not deleted\n const result: string[] = [];\n for (const [tagName, { jsonFiles, deletedFiles }] of tagFiles) {\n if (jsonFiles.length === 0) continue;\n\n // Sort to find latest\n jsonFiles.sort();\n const latestRef = jsonFiles[jsonFiles.length - 1];\n\n // Include only if latest ref is not deleted\n if (!deletedFiles.has(latestRef)) {\n result.push(tagName);\n }\n }\n\n return result;\n }\n\n /**\n * Checkout a branch to get a read session.\n *\n * @param name - Branch name\n * @param options - Optional request options (signal for cancellation)\n * @returns Read session at the branch's current snapshot\n */\n async checkoutBranch(\n name: string,\n options?: RequestOptions,\n ): Promise<ReadSession> {\n // Try v2 format first\n const repoInfo = await this.loadRepoInfo(options);\n if (repoInfo) {\n const snapshotId = resolveBranch(repoInfo, name);\n if (!snapshotId) {\n throw new Error(`Branch not found: ${name}`);\n }\n return ReadSession.open(this.storage, snapshotId, {\n ...options,\n virtualChunkContainers: repoInfo.virtualChunkContainers,\n });\n }\n\n // V1 fallback - file-based lookup\n const refDirPath = getBranchRefDirPath(name);\n const refPath = await this.findLatestRefFile(\n refDirPath,\n getBranchRefPath(name),\n );\n if (!refPath) {\n throw new Error(`Reference not found: ${refDirPath}`);\n }\n const snapshotId = await this.readSnapshotIdFromRef(refPath, options);\n return ReadSession.open(this.storage, snapshotId, options);\n }\n\n /**\n * Checkout a tag to get a read session.\n *\n * @param name - Tag name\n * @param options - Optional request options (signal for cancellation)\n * @returns Read session at the tag's snapshot\n */\n async checkoutTag(\n name: string,\n options?: RequestOptions,\n ): Promise<ReadSession> {\n // Try v2 format first\n const repoInfo = await this.loadRepoInfo(options);\n if (repoInfo) {\n const snapshotId = resolveTag(repoInfo, name);\n if (!snapshotId) {\n throw new Error(`Tag not found: ${name}`);\n }\n return ReadSession.open(this.storage, snapshotId, {\n ...options,\n virtualChunkContainers: repoInfo.virtualChunkContainers,\n });\n }\n\n // V1 fallback - file-based lookup\n const refDirPath = getTagRefDirPath(name);\n const legacyPath = getTagRefPath(name);\n const refPath = await this.findLatestRefFile(refDirPath, legacyPath);\n if (!refPath) {\n throw new Error(`Reference not found: ${refDirPath}`);\n }\n\n // Check for tombstone only in no-list fallback path (list-capable storage\n // already handles tombstones in findLatestRefFile). Matches Rust behavior.\n if (\n refPath === legacyPath &&\n (await this.storage.exists(`${refPath}.deleted`, options))\n ) {\n throw new Error(`Tag not found: ${name}`);\n }\n\n const snapshotId = await this.readSnapshotIdFromRef(refPath, options);\n return ReadSession.open(this.storage, snapshotId, options);\n }\n\n /**\n * Checkout a specific snapshot by ID.\n *\n * @param snapshotId - Snapshot ID (12 bytes or Base32 string)\n * @param options - Optional request options (signal for cancellation)\n * @returns Read session at the specified snapshot\n */\n async checkoutSnapshot(\n snapshotId: Uint8Array | string,\n options?: RequestOptions,\n ): Promise<ReadSession> {\n const id =\n typeof snapshotId === \"string\"\n ? decodeObjectId12(snapshotId)\n : snapshotId;\n // Load repo info opportunistically so v2 sessions get VCC resolution;\n // v1 repos return null here and sessions run with an empty container map.\n const repoInfo = await this.loadRepoInfo(options);\n const virtualChunkContainers = repoInfo?.virtualChunkContainers;\n return ReadSession.open(this.storage, id, {\n ...options,\n ...(virtualChunkContainers && { virtualChunkContainers }),\n });\n }\n\n /**\n * Walk the snapshot history chain starting from the given session.\n *\n * Yields `{ id, message, flushedAt, metadata }` for each snapshot,\n * walking from the current snapshot back to the root.\n *\n * @param session - Read session to start from\n * @param options - Optional request options (signal for cancellation)\n */\n async *walkHistory(\n session: ReadSession,\n options?: RequestOptions,\n ): AsyncGenerator<{\n id: string;\n message: string;\n flushedAt: Date;\n metadata: Record<string, unknown>;\n }> {\n let current: ReadSession | null = session;\n\n while (current) {\n yield {\n id: encodeObjectId12(current.getSnapshotId()),\n message: current.getMessage(),\n flushedAt: current.getFlushedAt(),\n metadata: current.getSnapshotMetadata(),\n };\n\n const parentId = current.getParentSnapshotId();\n if (!parentId) break;\n\n current = await this.checkoutSnapshot(parentId, options);\n }\n }\n\n /**\n * Get the storage backend.\n */\n getStorage(): Storage {\n return this.storage;\n }\n\n /** Read and parse a ref file */\n private async readRef(\n path: string,\n options?: RequestOptions,\n ): Promise<RefData> {\n const data = await this.storage.getObject(path, undefined, options);\n const json = new TextDecoder().decode(data);\n return JSON.parse(json) as RefData;\n }\n\n /** Read snapshot ID from a ref file */\n private async readSnapshotIdFromRef(\n path: string,\n options?: RequestOptions,\n ): Promise<Uint8Array> {\n try {\n const ref = await this.readRef(path, options);\n return decodeObjectId12(ref.snapshot);\n } catch (error) {\n if (error instanceof NotFoundError) {\n throw new Error(`Reference not found: ${path}`);\n }\n throw error;\n }\n }\n}\n","/**\n * HTTP/HTTPS storage backend using the Fetch API.\n *\n * Works in both Node.js 18+ and browsers.\n */\n\nimport type { Storage, ByteRange, RequestOptions } from \"./storage.js\";\nimport { NotFoundError, StorageError, isAbortError } from \"./storage.js\";\n\n/** Options for HTTP storage */\nexport interface HttpStorageOptions {\n /** Additional headers to include in requests */\n headers?: Record<string, string>;\n\n /** Fetch credentials mode */\n credentials?: RequestCredentials;\n\n /** Fetch cache mode */\n cache?: RequestCache;\n}\n\n/**\n * HTTP/HTTPS storage backend.\n *\n * Reads objects from a base URL using HTTP GET requests.\n * Supports byte range requests for partial reads.\n */\nexport class HttpStorage implements Storage {\n private baseUrl: string;\n private options: HttpStorageOptions;\n\n /**\n * Create an HTTP storage backend.\n *\n * @param baseUrl - Base URL for the repository (e.g., \"https://example.com/repo\")\n * @param options - Additional options\n */\n constructor(baseUrl: string, options: HttpStorageOptions = {}) {\n // Normalize URL (remove trailing slash)\n this.baseUrl = baseUrl.replace(/\\/$/, \"\");\n this.options = options;\n }\n\n /** Build full URL for a path */\n private getUrl(path: string): string {\n // Ensure path doesn't start with slash (we add it)\n const normalizedPath = path.startsWith(\"/\") ? path.slice(1) : path;\n return `${this.baseUrl}/${normalizedPath}`;\n }\n\n /** Build headers for a request */\n private getHeaders(range?: ByteRange): HeadersInit {\n const headers: HeadersInit = { ...this.options.headers };\n\n if (range) {\n // HTTP Range header uses inclusive end\n headers[\"Range\"] = `bytes=${range.start}-${range.end - 1}`;\n }\n\n return headers;\n }\n\n async getObject(\n path: string,\n range?: ByteRange,\n options?: RequestOptions,\n ): Promise<Uint8Array> {\n options?.signal?.throwIfAborted();\n\n const url = this.getUrl(path);\n const headers = this.getHeaders(range);\n\n let response: Response;\n try {\n response = await fetch(url, {\n method: \"GET\",\n headers,\n credentials: this.options.credentials,\n cache: this.options.cache,\n signal: options?.signal,\n });\n } catch (error) {\n if (isAbortError(error)) throw error;\n throw new StorageError(\n `Failed to fetch ${url}: ${error instanceof Error ? error.message : String(error)}`,\n error instanceof Error ? error : undefined,\n );\n }\n\n if (response.status === 404) {\n throw new NotFoundError(path);\n }\n\n // 200 for full content, 206 for partial content\n if (response.status !== 200 && response.status !== 206) {\n throw new StorageError(\n `HTTP ${response.status} ${response.statusText} for ${url}`,\n );\n }\n\n const arrayBuffer = await response.arrayBuffer();\n return new Uint8Array(arrayBuffer);\n }\n\n async exists(path: string, options?: RequestOptions): Promise<boolean> {\n options?.signal?.throwIfAborted();\n\n const url = this.getUrl(path);\n\n try {\n const response = await fetch(url, {\n method: \"HEAD\",\n headers: this.options.headers,\n credentials: this.options.credentials,\n signal: options?.signal,\n });\n\n return response.ok;\n } catch (error) {\n if (isAbortError(error)) throw error;\n return false;\n }\n }\n\n async *listPrefix(_prefix: string): AsyncIterable<string> {\n // HTTP storage typically doesn't support listing.\n // This would require server-side support (e.g., S3 XML API).\n throw new StorageError(\n \"Listing not supported for HTTP storage. Use S3Storage for listing.\",\n );\n }\n}\n","/**\n * IcechunkStore - zarrita-compatible store adapter.\n *\n * Implements zarrita's AsyncReadable interface to allow using\n * zarrita for array operations on icechunk repositories.\n */\n\nimport { Repository } from \"./reader/repository.js\";\nimport { ReadSession } from \"./reader/session.js\";\nimport { HttpStorage } from \"./storage/http-storage.js\";\nimport type { Storage, FetchClient } from \"./storage/storage.js\";\nimport { NotFoundError } from \"./storage/storage.js\";\nimport type { NodeSnapshot } from \"./format/flatbuffers/types.js\";\nimport type { RangeCoalescingFn } from \"./reader/range-coalescer.js\";\n\n/**\n * zarrita's AbsolutePath type - paths must start with \"/\"\n */\nexport type AbsolutePath<Rest extends string = string> = `/${Rest}`;\n\n/**\n * zarrita's RangeQuery type for partial reads\n */\nexport type RangeQuery =\n | { offset: number; length: number }\n | { suffixLength: number };\n\n/**\n * zarrita's AsyncReadable interface\n */\nexport interface AsyncReadable<Options = unknown> {\n get(key: AbsolutePath, opts?: Options): Promise<Uint8Array | undefined>;\n getRange?(\n key: AbsolutePath,\n range: RangeQuery,\n opts?: Options,\n ): Promise<Uint8Array | undefined>;\n}\n\n/** Options for IcechunkStore */\nexport interface IcechunkStoreOptions {\n /** Branch name to checkout (default: \"main\") */\n branch?: string;\n\n /** Tag name to checkout (mutually exclusive with branch) */\n tag?: string;\n\n /** Specific snapshot ID to checkout (Base32 string) */\n snapshot?: string;\n\n /** AbortSignal for cancelling initialization */\n signal?: AbortSignal;\n\n /** Format version hint to skip auto-detection. 'v1' skips /repo request. */\n formatVersion?: \"v1\" | \"v2\";\n\n /**\n * Pluggable HTTP client for virtual chunk fetching.\n *\n * Use this to:\n * - Generate pre-signed S3 URLs\n * - Add authentication headers\n * - Route through a proxy\n */\n fetchClient?: FetchClient;\n\n /**\n * Maximum number of manifests to keep in the LRU cache (default: 100).\n *\n * This bounds the *number* of cached manifests, not their total bytes. Each\n * entry retains a whole decompressed manifest shard — hundreds of MB for\n * fine-level virtual stores — so a single oversized shard, or a few held at\n * once, can still dominate memory. Lower this when reading stores with very\n * large manifests.\n */\n maxManifestCacheSize?: number;\n\n /**\n * Zarrita-backed range coalescing function for chunk payload reads.\n *\n * Pass `zarrita.withRangeCoalescing` to opt in. Concurrent range reads\n * against the same backing object may be merged into one larger request.\n */\n withRangeCoalescing?: RangeCoalescingFn;\n\n /**\n * Send If-Match / If-Unmodified-Since headers on virtual chunk requests.\n *\n * Defaults to false because these headers trigger CORS preflight in browsers.\n */\n validateChecksums?: boolean;\n\n /**\n * Azure storage account name for translating az:// and azure:// URLs.\n *\n * Required when virtual chunks reference az:// or azure:// URLs.\n * Not needed for abfs:// URLs which embed the account in the host.\n */\n azureAccount?: string;\n}\n\n/**\n * IcechunkStore - zarrita-compatible store for icechunk repositories.\n *\n * This store implements zarrita's AsyncReadable interface, allowing you\n * to use zarrita's array operations on icechunk data.\n *\n * @example\n * ```typescript\n * import { IcechunkStore } from 'icechunk-js';\n * import { open, get } from 'zarrita';\n *\n * const store = await IcechunkStore.open('https://bucket.s3.amazonaws.com/repo');\n * const array = await open(store.resolve('/temperature'), { kind: 'array' });\n * const data = await get(array, [0, 0, null]);\n * ```\n */\nexport class IcechunkStore implements AsyncReadable {\n /** The underlying read session. Exposed for advanced usage. */\n readonly session: ReadSession;\n private fetchClient?: FetchClient;\n private validateChecksums: boolean;\n private azureAccount?: string;\n private withRangeCoalescing?: RangeCoalescingFn;\n private basePath: string = \"\";\n\n private constructor(\n session: ReadSession,\n fetchClient?: FetchClient,\n validateChecksums?: boolean,\n azureAccount?: string,\n withRangeCoalescing?: RangeCoalescingFn,\n ) {\n if (!(session instanceof ReadSession)) {\n throw new Error(\n \"IcechunkStore constructor is private. Use IcechunkStore.open() instead.\",\n );\n }\n this.session = session;\n this.fetchClient = fetchClient;\n this.validateChecksums = validateChecksums ?? false;\n this.azureAccount = azureAccount;\n this.withRangeCoalescing = withRangeCoalescing;\n }\n\n /**\n * Open an IcechunkStore from a URL.\n *\n * @param url - URL to the icechunk repository\n * @param options - Store options (branch, tag, or snapshot to checkout)\n */\n static async open(\n url: string,\n options?: IcechunkStoreOptions,\n ): Promise<IcechunkStore>;\n\n /**\n * Open an IcechunkStore from an existing ReadSession.\n *\n * @param session - Existing ReadSession\n * @param options - Store options for virtual chunk reads\n */\n static async open(\n session: ReadSession,\n options?: Pick<\n IcechunkStoreOptions,\n | \"fetchClient\"\n | \"validateChecksums\"\n | \"azureAccount\"\n | \"withRangeCoalescing\"\n >,\n ): Promise<IcechunkStore>;\n\n /**\n * Open an IcechunkStore from a custom Storage backend.\n *\n * @param storage - Custom Storage implementation\n * @param options - Store options (branch, tag, or snapshot to checkout)\n */\n static async open(\n storage: Storage,\n options?: IcechunkStoreOptions,\n ): Promise<IcechunkStore>;\n\n static async open(\n arg: string | ReadSession | Storage,\n options: IcechunkStoreOptions = {},\n ): Promise<IcechunkStore> {\n if (arg instanceof ReadSession) {\n return new IcechunkStore(\n arg,\n options.fetchClient,\n options.validateChecksums,\n options.azureAccount,\n options.withRangeCoalescing,\n );\n }\n\n const storage = typeof arg === \"string\" ? new HttpStorage(arg) : arg;\n const requestOptions = options.signal\n ? { signal: options.signal }\n : undefined;\n const repo = await Repository.open(\n { storage, formatVersion: options.formatVersion },\n requestOptions,\n );\n\n // Build session options: merge request options with cache size\n const sessionOptions = {\n ...requestOptions,\n maxManifestCacheSize: options.maxManifestCacheSize,\n };\n\n let session: ReadSession;\n if (options.snapshot) {\n session = await repo.checkoutSnapshot(options.snapshot, sessionOptions);\n } else if (options.tag) {\n session = await repo.checkoutTag(options.tag, sessionOptions);\n } else {\n session = await repo.checkoutBranch(\n options.branch ?? \"main\",\n sessionOptions,\n );\n }\n\n return new IcechunkStore(\n session,\n options.fetchClient,\n options.validateChecksums,\n options.azureAccount,\n options.withRangeCoalescing,\n );\n }\n\n /**\n * Get data for a zarr key.\n *\n * zarrita calls this method with keys like:\n * - \"/zarr.json\" - root metadata\n * - \"/array/zarr.json\" - array metadata\n * - \"/array/c/0/1/2\" - chunk at coords [0, 1, 2]\n *\n * @param key - Absolute path (must start with \"/\")\n * @param opts - Optional request options (supports AbortSignal for cancellation)\n * @returns Data bytes or undefined if not found\n */\n async get(\n key: AbsolutePath,\n opts?: { signal?: AbortSignal },\n ): Promise<Uint8Array | undefined> {\n opts?.signal?.throwIfAborted();\n\n const parsed = parseZarrKey(key);\n const resolvedPath = this.resolvePath(parsed.path);\n\n try {\n if (parsed.type === \"metadata\") {\n const data = this.session.getRawMetadata(resolvedPath);\n return data ?? undefined;\n }\n\n const chunk = await this.session.getChunk(resolvedPath, parsed.coords, {\n signal: opts?.signal,\n ...(this.fetchClient && { fetchClient: this.fetchClient }),\n validateChecksums: this.validateChecksums,\n azureAccount: this.azureAccount,\n ...(this.withRangeCoalescing && {\n withRangeCoalescing: this.withRangeCoalescing,\n }),\n });\n return chunk ?? undefined;\n } catch (err) {\n // Only treat \"chunk legitimately absent\" as undefined. Propagate\n // everything else — swallowing aborts/network errors here causes\n // zarrita's Array.getChunk to return a fillValue chunk, which\n // downstream consumers cache as valid data (e.g. zarr-layer commits\n // it to region.data, producing permanent blank regions even after\n // repainting).\n if (err instanceof NotFoundError) return undefined;\n throw err;\n }\n }\n\n /**\n * Get partial data for a zarr key.\n *\n * Required by zarrita for sharded arrays. zarrita uses this to read the\n * shard index (via suffixLength) and extract individual inner chunks\n * (via offset/length) from shard data.\n *\n * @param key - Absolute path\n * @param range - Byte range to fetch\n * @param opts - Optional request options (supports AbortSignal for cancellation)\n * @returns Data bytes or undefined if not found\n */\n async getRange(\n key: AbsolutePath,\n range: RangeQuery,\n opts?: { signal?: AbortSignal },\n ): Promise<Uint8Array | undefined> {\n opts?.signal?.throwIfAborted();\n\n const parsed = parseZarrKey(key);\n const resolvedPath = this.resolvePath(parsed.path);\n\n try {\n if (parsed.type === \"chunk\") {\n // Use targeted byte-range read through the session\n const data = await this.session.getChunkRange(\n resolvedPath,\n parsed.coords,\n range,\n {\n signal: opts?.signal,\n ...(this.fetchClient && { fetchClient: this.fetchClient }),\n validateChecksums: this.validateChecksums,\n azureAccount: this.azureAccount,\n ...(this.withRangeCoalescing && {\n withRangeCoalescing: this.withRangeCoalescing,\n }),\n },\n );\n return data ?? undefined;\n }\n\n // For metadata keys, fetch full data and slice\n const data = this.session.getRawMetadata(resolvedPath);\n if (!data) return undefined;\n\n if (\"suffixLength\" in range) {\n return data.slice(-range.suffixLength);\n }\n return data.slice(range.offset, range.offset + range.length);\n } catch (err) {\n // Same rationale as `get()`: don't swallow aborts or real errors,\n // or zarrita will silently fall back to a fillValue chunk and\n // consumers will cache that garbage as valid data.\n if (err instanceof NotFoundError) return undefined;\n throw err;\n }\n }\n\n /** Prepend basePath to a parsed path. */\n private resolvePath(path: string): string {\n if (!this.basePath) return path;\n // path is \"/\" for root or \"/group/array\" for nested\n if (path === \"/\") return `/${this.basePath}`;\n return `/${this.basePath}${path}`;\n }\n\n /**\n * Create a store scoped to a subpath.\n *\n * The returned store shares the same session (and manifest cache)\n * but prepends `path` to all key lookups. This matches zarrita's\n * `root(store).resolve(path)` pattern.\n *\n * @param path - Subpath to scope to (e.g., \"group/array\")\n * @returns A new IcechunkStore scoped to the subpath\n */\n resolve(path: string): IcechunkStore {\n const scoped = new IcechunkStore(\n this.session,\n this.fetchClient,\n this.validateChecksums,\n this.azureAccount,\n this.withRangeCoalescing,\n );\n const cleanPath = path.replace(/^\\/+|\\/+$/g, \"\");\n scoped.basePath = this.basePath\n ? `${this.basePath}/${cleanPath}`\n : cleanPath;\n return scoped;\n }\n\n /**\n * List direct children of a group by name.\n *\n * @param parentPath - Path to the parent group (use \"/\" for root).\n * When omitted, uses the store's base path (or root).\n * @returns Array of child names (e.g., [\"temperature\", \"precipitation\"])\n */\n listChildren(parentPath?: string): string[] {\n let path: string;\n if (parentPath == null) {\n path = this.basePath ? `/${this.basePath}` : \"/\";\n } else if (this.basePath) {\n path =\n `/${this.basePath}/${parentPath.replace(/^\\//, \"\")}`\n .replace(/\\/+/g, \"/\")\n .replace(/\\/+$/, \"\") || \"/\";\n } else {\n // Normalize: ensure leading slash, strip trailing slashes\n path =\n (parentPath.startsWith(\"/\") ? parentPath : `/${parentPath}`).replace(\n /\\/+$/,\n \"\",\n ) || \"/\";\n }\n const nodes = this.session.listChildren(path);\n return nodes.map((node) => {\n // Extract the last path segment as the child name\n const segments = node.path.split(\"/\");\n return segments[segments.length - 1];\n });\n }\n\n /**\n * List all nodes in the snapshot.\n *\n * @returns Array of all nodes\n */\n listNodes(): NodeSnapshot[] {\n return this.session.listNodes();\n }\n\n /**\n * Get a node by path.\n *\n * @param path - Absolute path (e.g., \"/array\" or \"/group/nested\")\n * @returns NodeSnapshot or null if not found\n */\n getNode(path: string): NodeSnapshot | null {\n const fullPath =\n (this.basePath\n ? `/${this.basePath}/${path.replace(/^\\//, \"\")}`.replace(/\\/+/g, \"/\")\n : path\n ).replace(/\\/+$/, \"\") || \"/\";\n return this.session.getNode(fullPath);\n }\n\n /**\n * Get parsed Zarr metadata for a node.\n *\n * @param path - Path to the node\n * @returns Parsed JSON metadata or null if node not found\n */\n getMetadata(path: string): unknown | null {\n const fullPath =\n (this.basePath\n ? `/${this.basePath}/${path.replace(/^\\//, \"\")}`.replace(/\\/+/g, \"/\")\n : path\n ).replace(/\\/+$/, \"\") || \"/\";\n return this.session.getMetadata(fullPath);\n }\n}\n\n/** Parsed zarr key */\ntype ParsedKey =\n | { type: \"metadata\"; path: string }\n | { type: \"chunk\"; path: string; coords: number[] };\n\n/**\n * Parse a zarr key into its components.\n *\n * Keys follow the pattern:\n * - \"/zarr.json\" → root metadata\n * - \"/path/to/node/zarr.json\" → node metadata\n * - \"/path/to/array/c/0/1/2\" → chunk at coords [0, 1, 2]\n */\nfunction parseZarrKey(key: AbsolutePath): ParsedKey {\n // Remove leading slash for easier parsing\n const path = key.slice(1);\n\n // Root metadata\n if (path === \"zarr.json\") {\n return { type: \"metadata\", path: \"/\" };\n }\n\n // Node metadata\n if (path.endsWith(\"/zarr.json\")) {\n const nodePath = \"/\" + path.slice(0, -\"/zarr.json\".length);\n return { type: \"metadata\", path: nodePath };\n }\n\n // Chunk key: \"path/to/array/c/0/1/2\" or \"c/0/1/2\" for root arrays\n const chunkMatch = path.match(/^(?:(.*)\\/)?c(?:\\/(.*))?$/);\n if (chunkMatch) {\n const arrayPath = chunkMatch[1] ? \"/\" + chunkMatch[1] : \"/\";\n const coordsStr = chunkMatch[2] ?? \"\";\n const coords = coordsStr ? coordsStr.split(\"/\").map(Number) : [];\n return { type: \"chunk\", path: arrayPath, coords };\n }\n\n // Default to metadata\n return { type: \"metadata\", path: \"/\" + path };\n}\n"],"mappings":";AA8BO,IAAM,qBAAN,MAAgD;AAAA,EACrD,MAAM,KAAa,MAAuC;AACxD,WAAO,WAAW,MAAM,KAAK,IAAI;AAAA,EACnC;AACF;AAgCO,IAAM,gBAAN,cAA4B,MAAM;AAAA,EACvC,YAA4B,MAAc;AACxC,UAAM,qBAAqB,IAAI,EAAE;AADP;AAE1B,SAAK,OAAO;AAAA,EACd;AACF;AAGO,IAAM,eAAN,cAA2B,MAAM;AAAA,EACtC,YACE,SACgB,OAChB;AACA,UAAM,OAAO;AAFG;AAGhB,SAAK,OAAO;AAAA,EACd;AACF;AAIA,SAAS,aAAa,OAAwC;AAC5D,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,UAAU;AAClE;AAGO,SAAS,aACd,OACiD;AACjD,SAAO,aAAa,KAAK,KAAK,MAAM,SAAS;AAC/C;;;AC1FO,IAAM,QAAQ;AAAA;AAAA,EAEnB,MAAM;AAAA;AAAA,EAGN,WAAW;AAAA;AAAA,EAGX,WAAW;AAAA;AAAA,EAGX,QAAQ;AAAA;AAAA,EAGR,cAAc;AAChB;AAGO,IAAM,iBAAiB;AAavB,SAAS,oBAAoB,MAAsB;AACxD,SAAO,GAAG,MAAM,IAAI,WAAW,IAAI;AACrC;AAYO,SAAS,iBAAiB,MAAsB;AACrD,SAAO,GAAG,MAAM,IAAI,QAAQ,IAAI;AAClC;AAQO,IAAM,gBAAgB;AAUtB,SAAS,iBAAiB,MAAsB;AACrD,SAAO,GAAG,MAAM,IAAI,WAAW,IAAI,IAAI,aAAa;AACtD;AAUO,SAAS,cAAc,MAAsB;AAClD,SAAO,GAAG,MAAM,IAAI,QAAQ,IAAI,IAAI,aAAa;AACnD;AAQO,SAAS,gBAAgB,IAAoB;AAClD,SAAO,GAAG,MAAM,SAAS,IAAI,EAAE;AACjC;AAQO,SAAS,gBAAgB,IAAoB;AAClD,SAAO,GAAG,MAAM,SAAS,IAAI,EAAE;AACjC;AAQO,SAAS,aAAa,IAAoB;AAC/C,SAAO,GAAG,MAAM,MAAM,IAAI,EAAE;AAC9B;AAQO,SAAS,sBAAsB,IAAoB;AACxD,SAAO,GAAG,MAAM,YAAY,IAAI,EAAE;AACpC;;;AChHA,IAAM,kBAAkB;AAGxB,IAAM,aAAqC,CAAC;AAG5C,SAAS,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;AAC/C,QAAM,OAAO,gBAAgB,CAAC;AAC9B,aAAW,IAAI,IAAI;AACnB,aAAW,KAAK,YAAY,CAAC,IAAI;AACnC;AAGA,WAAW,GAAG,IAAI,WAAW,GAAG,IAAI;AACpC,WAAW,GAAG,IAAI,WAAW,GAAG,IAAI;AACpC,WAAW,GAAG,IAAI,WAAW,GAAG,IAAI;AAQ7B,SAAS,aAAa,OAA2B;AACtD,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,WAAW;AAEf,aAAW,QAAQ,OAAO;AACxB,aAAU,UAAU,IAAK;AACzB,gBAAY;AAEZ,WAAO,YAAY,GAAG;AACpB,kBAAY;AACZ,YAAM,QAAS,UAAU,WAAY;AACrC,gBAAU,gBAAgB,KAAK;AAAA,IACjC;AAAA,EACF;AAGA,MAAI,WAAW,GAAG;AAChB,UAAM,QAAS,UAAW,IAAI,WAAa;AAC3C,cAAU,gBAAgB,KAAK;AAAA,EACjC;AAEA,SAAO;AACT;AASO,SAAS,aAAa,KAAyB;AACpD,MAAI,IAAI,WAAW,EAAG,QAAO,IAAI,WAAW,CAAC;AAG7C,QAAM,IAAI,QAAQ,MAAM,EAAE;AAE1B,QAAM,SAAmB,CAAC;AAC1B,MAAI,SAAS;AACb,MAAI,WAAW;AAEf,aAAW,QAAQ,KAAK;AACtB,UAAM,QAAQ,WAAW,IAAI;AAC7B,QAAI,UAAU,QAAW;AACvB,YAAM,IAAI,MAAM,uCAAuC,IAAI,EAAE;AAAA,IAC/D;AAEA,aAAU,UAAU,IAAK;AACzB,gBAAY;AAEZ,QAAI,YAAY,GAAG;AACjB,kBAAY;AACZ,aAAO,KAAM,UAAU,WAAY,GAAI;AAAA,IACzC;AAAA,EACF;AAEA,SAAO,IAAI,WAAW,MAAM;AAC9B;AAQO,SAAS,iBAAiB,IAAwB;AACvD,MAAI,GAAG,WAAW,IAAI;AACpB,UAAM,IAAI,MAAM,0BAA0B,GAAG,MAAM,EAAE;AAAA,EACvD;AACA,SAAO,aAAa,EAAE;AACxB;AAQO,SAAS,iBAAiB,KAAyB;AACxD,QAAM,QAAQ,aAAa,GAAG;AAC9B,MAAI,MAAM,WAAW,IAAI;AACvB,UAAM,IAAI,MAAM,yCAAyC,MAAM,MAAM,EAAE;AAAA,EACzE;AACA,SAAO;AACT;AAQO,SAAS,gBAAgB,IAAwB;AACtD,MAAI,GAAG,WAAW,GAAG;AACnB,UAAM,IAAI,MAAM,yBAAyB,GAAG,MAAM,EAAE;AAAA,EACtD;AACA,SAAO,aAAa,EAAE;AACxB;AAQO,SAAS,gBAAgB,KAAyB;AACvD,QAAM,QAAQ,aAAa,GAAG;AAC9B,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,MAAM,wCAAwC,MAAM,MAAM,EAAE;AAAA,EACxE;AACA,SAAO;AACT;;;AC/IA,SAAS,kBAAkB;AAC3B,YAAY,iBAAiB;;;ACHtB,IAAM,eAAN,MAAM,cAAa;AAAA,EACxB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA0C;AAC1D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,sBACL,IACA,KACc;AACd,YAAQ,OAAO,IAAI,cAAa,GAAG;AAAA,MACjC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAIA,KAAK,kBAAoD;AACvD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;AClDO,IAAM,MAAN,MAAM,KAAI;AAAA,EACf,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAiC;AACjD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,aAAa,IAA4B,KAAgB;AAC9D,YAAQ,OAAO,IAAI,KAAI,GAAG;AAAA,MACxB,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAIA,KAAK,kBAAoD;AACvD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,gBAAwB;AACtB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI;AAAA,EAC9D;AACF;;;AC3BO,IAAM,aAAN,MAAM,YAAW;AAAA,EACtB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAwC;AACxD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,oBACL,IACA,KACY;AACZ,YAAQ,OAAO,IAAI,YAAW,GAAG;AAAA,MAC/B,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,eAAiC;AAC/B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM;AAAA,EAE7C;AAAA,EAEA,QAAgB;AACd,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAMA,0BACE,kBAC4B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AACF;;;AC7CO,IAAM,aAAN,MAAiB;AAAA,EACtB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAwC;AACxD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,OAA8B;AAClC,WAAO,KAAK,GAAI,UAAU,KAAK,SAAS,IAAI,KAAK;AAAA,EACnD;AAAA,EAEA,OAAO,SAAiB;AACtB,WAAO;AAAA,EACT;AACF;;;ACbO,IAAM,eAAN,MAAM,cAAa;AAAA,EACxB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA0C;AAC1D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,sBACL,IACA,KACc;AACd,YAAQ,OAAO,IAAI,cAAa,GAAG;AAAA,MACjC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,GAAG,KAAqC;AACtC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM,IAAI;AAAA,EAC7D;AAAA,EAEA,YAAoB;AAClB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAIA,QAAQ,kBAAoD;AAC1D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,SAAS,OAAe,KAAyC;AAC/D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,aAAa,GAAG;AAAA,MAC1B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,iBAAyB;AACvB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,qBAAqB,OAAe,KAAqC;AACvE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,WAAW,GAAG;AAAA,MACxB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,6BAAqC;AACnC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AACF;;;AC7EO,IAAM,SAAN,MAAM,QAAO;AAAA,EAClB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAoC;AACpD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,gBAAgB,IAA4B,KAAsB;AACvE,YAAQ,OAAO,IAAI,QAAO,GAAG;AAAA,MAC3B,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,iBAA6B;AAC3B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM;AAAA,EACzD;AAAA,EAEA,WAAW,KAAsB;AAC/B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,QAAQ,KAAK,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,YAAoB;AAClB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAMA,WAAW,kBAAoD;AAC7D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AACF;;;ACrCO,IAAM,OAAN,MAAM,MAAK;AAAA,EAChB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAkC;AAClD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,cAAc,IAA4B,KAAkB;AACjE,YAAQ,OAAO,IAAI,MAAK,GAAG;AAAA,MACzB,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM,IAAI;AAAA,EAC7D;AAAA,EAEA,KAAK,OAAe,KAAuB;AACzC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,IAAI,GAAG;AAAA,MACjB,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,aAAqB;AACnB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,SAAS,OAAe,KAAuB;AAC7C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,IAAI,GAAG;AAAA,MACjB,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,iBAAyB;AACvB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAOA,YACE,OACA,kBAC4B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI;AAAA,MACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD;AAAA,IACF,IACA;AAAA,EACN;AAAA,EAEA,oBAA4B;AAC1B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,UAAU,OAAe,KAAyC;AAChE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,aAAa,GAAG;AAAA,MAC1B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,kBAA0B;AACxB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,OAAO,KAAqC;AAC1C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,WAAW,GAAG;AAAA,MACxB,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM;AAAA,MACxC,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,SAAS,OAAe,KAAyC;AAC/D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,aAAa,GAAG;AAAA,MAC1B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,iBAAyB;AACvB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAc,OAAe,KAA6B;AACxD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,OAAO,GAAG;AAAA,MACpB,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAMA,kBAAkB,kBAAoD;AACpE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,OAAO,OAA8B;AACnC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAiC;AAC/B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,oBAAoB,OAA8B;AAChD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,WAAW,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ,CAAC,IACvE;AAAA,EACN;AAAA,EAEA,4BAAoC;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,2BAA+C;AAC7C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,qBAAqB,OAA8B;AACjD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,WAAW,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ,CAAC,IACvE;AAAA,EACN;AAAA,EAEA,6BAAqC;AACnC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,4BAAgD;AAC9C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;AC5NA,IAAM,KAAK;AAAX,IAAwB,KAAK;AAA7B,IAAyC,MAAM;AAA/C,IAA4D,MAAM;AAAlE,IAAiG,MAAM;AA8CvG,IAAM,MAAM,CAAC,GAAe,GAAW,MAAe;AACpD,MAAI,GAAG,UAAU,MAAO,QAAO,GAAG,UAAU,MAAM,KAAK,GAAG,GAAG,CAAC;AAC9D,MAAI,KAAK,QAAQ,IAAI,EAAG,KAAI;AAC5B,MAAI,KAAK,QAAQ,IAAI,EAAE,OAAQ,KAAI,EAAE;AACrC,QAAM,IAAI,IAAI,GAAG,IAAI,CAAC;AACtB,IAAE,IAAI,EAAE,SAAS,GAAG,CAAC,CAAC;AACtB,SAAO;AACT;AAEA,IAAM,OAAO,CAAC,GAAe,GAAW,GAAY,MAAe;AACjE,MAAI,GAAG,UAAU,KAAM,QAAO,GAAG,UAAU,KAAK,KAAK,GAAG,GAAG,GAAG,CAAC;AAC/D,MAAI,KAAK,QAAQ,IAAI,EAAG,KAAI;AAC5B,MAAI,KAAK,QAAQ,IAAI,EAAE,OAAQ,KAAI,EAAE;AACrC,SAAO,IAAI,GAAG,EAAE,EAAG,GAAE,CAAC,IAAI;AAC1B,SAAO;AACT;AAEA,IAAM,MAAM,CAAC,GAAe,GAAW,GAAY,MAAe;AAChE,MAAI,GAAG,UAAU,WAAY,QAAO,GAAG,UAAU,WAAW,KAAK,GAAG,GAAG,GAAG,CAAC;AAC3E,MAAI,KAAK,QAAQ,IAAI,EAAG,KAAI;AAC5B,MAAI,KAAK,QAAQ,IAAI,EAAE,OAAQ,KAAI,EAAE;AACrC,SAAO,IAAI,GAAG;AACZ,MAAE,GAAG,IAAI,EAAE,GAAG;AAAA,EAChB;AACF;AAkBA,IAAM,KAAsC;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAYA,IAAM,MAAM,CAAC,KAAU,KAAkB,OAAW;AAClD,QAAM,IAAwB,IAAI,MAAM,OAAO,GAAG,GAAG,CAAC;AACtD,IAAE,OAAO;AACT,MAAI,MAAM,kBAAmB,OAAM,kBAAkB,GAAG,GAAG;AAC3D,MAAI,CAAC,GAAI,OAAM;AACf,SAAO;AACT;AAEA,IAAM,KAAK,CAAC,GAAe,GAAW,MAAc;AAClD,MAAI,IAAI,GAAG,IAAI;AACf,SAAO,IAAI,GAAG,EAAE,EAAG,MAAK,EAAE,GAAG,MAAM,KAAK;AACxC,SAAO;AACT;AAEA,IAAM,KAAK,CAAC,GAAe,OAAe,EAAE,CAAC,IAAK,EAAE,IAAI,CAAC,KAAK,IAAM,EAAE,IAAI,CAAC,KAAK,KAAO,EAAE,IAAI,CAAC,KAAK,QAAS;AAG5G,IAAM,OAAO,CAAC,KAAiB,OAAmB;AAChD,MAAI,GAAG,KAAK,CAAC,KAAK,YAAY;AAC5B,QAAI,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,CAAC,EAAG,KAAI,CAAC;AACtC,QAAI,KAAK;AACT,KAAC,IAAI,GAAG,CAAC,IAAI,IAAI,KAAK,EAAE;AACxB,QAAI,KAAY,KAAY;AAC5B,KAAC,IAAI,GAAG,IAAI,KAAK,KAAK,IAAI,CAAC;AAC3B,KAAC,IAAI,GAAG,IAAI,KAAK,KAAK,IAAI,CAAC;AAC3B,KAAC,IAAI,GAAG,IAAI,KAAK,KAAK,IAAI,CAAC;AAC3B,OAAG,IAAI,CAAC,KAAK,KAAK,GAAG;AACrB,OAAG,IAAI,IAAI,IAAI,CAAC,GAAG,KAAK,EAAE,GAAG,GAAG,KAAK,KAAK,CAAC,GAAG,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC;AAC9D,UAAM,IAAI,SAAS,KAAK,EAAE;AAAA,EAC5B;AACA,QAAM,KAAK,KAAK,IAAI,IAAI,QAAQ,GAAG,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI,SAAS,GAAG,CAAC,IAAI,GAAG,CAAC;AAC/E,KAAG,IAAI,IAAI,GAAG,EAAE;AAChB,KAAG,EAAE,IAAI,KAAK,KAAK,IAAI,MAAM;AAC7B,KAAG,IAAI;AACT;AAGA,IAAM,OAAO,CAAC,KAAiB,MAA4C;AACzE,QAAM,KAAK,IAAI,CAAC,IAAK,IAAI,CAAC,KAAK,IAAM,IAAI,CAAC,KAAK;AAC/C,MAAI,MAAM,WAAY,IAAI,CAAC,KAAK,KAAK;AAEnC,UAAM,MAAM,IAAI,CAAC;AAEjB,UAAM,KAAM,OAAO,IAAK,GAAG,KAAM,OAAO,IAAK,GAAG,KAAK,MAAM,GAAG,MAAM,OAAO;AAC3E,QAAI,MAAM,EAAG,KAAI,CAAC;AAElB,QAAI,KAAK,IAAI;AAEb,UAAM,KAAK,MAAM,IAAI,IAAI;AAEzB,UAAM,KAAK,GAAG,KAAK,IAAI,EAAE;AACzB,UAAM;AAEN,UAAM,MAAM,MAAO,KAAK,MAAO;AAE/B,UAAM,MAAM,GAAG,KAAK,IAAI,GAAG,KAAM,OAAO,KAAM;AAE9C,QAAI,KAAK;AACT,QAAI,CAAC,IAAI;AAEP,YAAM,KAAK,KAAM,MAAM,IAAI,CAAC,KAAK;AACjC,WAAK,MAAM,MAAM,MAAM,IAAI,CAAC,IAAI;AAAA,IAClC;AACA,QAAI,KAAK,WAAY,KAAI,CAAC;AAC1B,UAAM,MAAM,IAAI,IAAI,KAAK,IAAK,OAAO,KAAM,IAAI,IAAI,MAAM,EAAE;AAC3D,QAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;AACjC,WAAO;AAAA,MACL,GAAG,KAAK;AAAA,MACR,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAI,KAAK,KAAK,IAAK,IAAI,IAAI,SAAS,EAAE;AAAA,MACtC,GAAG;AAAA,MACH,GAAG,IAAI,IAAI,IAAI,QAAQ,GAAG,CAAC;AAAA,MAC3B,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG,KAAK,IAAI,QAAQ,EAAE;AAAA,IACxB;AAAA,EACF,YAAa,MAAM,IAAM,IAAI,CAAC,KAAK,OAAQ,UAAW;AAEpD,WAAO,GAAG,KAAK,CAAC,IAAI;AAAA,EACtB;AACA,MAAI,CAAC;AACP;AAGA,IAAM,MAAM,CAAC,QAAgB;AAC3B,MAAI,OAAO;AACX,SAAQ,KAAK,QAAS,KAAK,EAAE,KAAK;AAClC,SAAO,OAAO;AAChB;AAGA,IAAM,OAAO,CAAC,KAAiB,IAAY,QAAiC;AAE1E,MAAI,QAAQ,MAAM,KAAK;AAEvB,QAAM,MAAM,IAAI,EAAE,IAAI,MAAM;AAC5B,MAAI,KAAK,IAAK,KAAI,CAAC;AAEnB,QAAM,KAAK,KAAK;AAEhB,MAAI,QAAQ,IAAI,MAAM,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK;AAEhD,QAAM,MAAM,IAAI,GAAG,OAAO,MAAM,EAAE;AAClC,QAAM,OAAO,IAAI,IAAI,KAAK,GAAG,GAAG;AAEhC,QAAM,SAAS,IAAI,IAAI,KAAK,GAAG,GAAG;AAClC,QAAM,SAAS,IAAI,IAAI,KAAK,KAAK,EAAE;AACnC,QAAM,MAAM,OAAO,MAAM;AACzB,QAAM,OAAO,IAAI,GAAG,KAAK,KAAK,EAAE;AAChC,QAAM,QAAQ,IAAI,GAAG,KAAK,MAAM,EAAE;AAClC,SAAO,MAAM,OAAO,QAAQ,GAAG;AAC7B,UAAM,OAAO,IAAI,QAAQ,CAAC;AAC1B,UAAM,MAAM,QAAQ;AAEpB,UAAM,OAAO,KAAM,OAAO,KAAM;AAChC,QAAI,OAAQ,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,IAAM,IAAI,MAAM,CAAC,KAAK,QAAS,OAAO,KAAM;AAEpF,UAAM,UAAU,KAAK,QAAQ;AAE7B,UAAM,MAAM,MAAM,QAAQ;AAE1B,UAAM,OAAO,MAAM;AACnB,QAAI,OAAO,IAAK,SAAQ,MAAM,MAAM;AAAA,SAC/B;AACH,cAAQ,OAAO;AACf,UAAI,MAAM,OAAQ,QAAO;AAAA,IAC3B;AACA,SAAK,EAAE,GAAG,IAAI,EAAE;AAChB,QAAI,OAAO,IAAI;AACb,eAAS;AACT,WAAK,EAAE,EAAE,IAAI;AAAA,IACf,MAAO,UAAS;AAChB,QAAI,CAAC,KAAK;AACR,SAAG;AAED,cAAM,MAAM,QAAQ;AACpB,cAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,KAAM;AACxD,gBAAQ;AACR,eAAO;AAAA,MACT,SAAS,MAAM;AAAA,IACjB;AAAA,EACF;AACA,MAAI,MAAM,OAAO,MAAO,KAAI,CAAC;AAC7B,MAAI,SAAS;AAEb,QAAM,SAAS,MAAM,MAAM,MAAM,KAAK;AAEtC,QAAM,QAAQ,KAAK;AACnB,WAAS,IAAI,GAAG,KAAK,KAAK,EAAE,GAAG;AAC7B,UAAM,KAAK,KAAK,CAAC;AACjB,QAAI,KAAK,GAAG;AACV,aAAO,CAAC,IAAI,CAAC;AACb;AAAA,IACF;AAEA,SAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AACvB,WAAK,MAAM,IAAI;AACf,SAAG;AACD,iBAAU,SAAS,QAAS;AAAA,MAC9B,SAAS,UAAU;AAAA,IACrB;AAAA,EACF;AAEA,MAAI,OAAQ,KAAI,CAAC;AACjB,OAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAEvB,UAAM,KAAK,OAAO,KAAK,CAAC,CAAC;AAEzB,UAAM,KAAK,MAAM,CAAC,IAAI,KAAK,IAAI,EAAE;AACjC,WAAO,CAAC,KAAK,MAAM,MAAM;AAAA,EAC3B;AACA,SAAO,CAAE,OAAO,KAAM,GAAG;AAAA,IACvB,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACL,CAAC;AACH;AAGA,IAAM,MAAM,CAAC,KAAiB,OAA8B;AAE1D,MAAI,IAAI,GAAG,KAAK;AAEhB,QAAM,MAAM,IAAI,GAAG,GAAG,GAAG,KAAK,IAAI,EAAE;AAEpC,QAAM,KAAK,IAAI,SAAS,GAAG,GAAG;AAE9B,QAAM,KAAK,IAAI,SAAS,KAAK,GAAG;AAEhC,QAAM,KAAK,IAAI,IAAI,IAAI,QAAQ,GAAG;AAElC,MAAI,KAAK,KAAK;AAEZ,UAAM,CAAC,KAAK,GAAG,IAAI,KAAK,KAAK,KAAK,GAAG,CAAC;AACtC,UAAM;AACN,UAAM,OAAO,OAAO;AAEpB,UAAM,KAAK,IAAI,EAAE;AACjB,QAAI,CAAC,GAAI,KAAI,CAAC;AAEd,QAAI,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI,GAAG,OAAO;AAG3C,QAAI,QAAQ,EAAE,MAAM,KAAK,IAAI,IAAI,EAAE;AACnC,eAAS;AACP,cAAQ;AACR,UAAI,OAAO,KAAM;AACjB,UAAI,MAAM,QAAQ;AAClB,cAAS,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,QAAQ;AACzE,SAAG,EAAE,EAAE,IAAI,IAAI,EAAE,GAAG;AACpB,cAAQ;AACR,UAAI,OAAO,KAAM;AACjB,YAAM,QAAQ;AACd,cAAS,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,QAAQ;AACzE,SAAG,EAAE,EAAE,IAAI,IAAI,EAAE,GAAG;AACpB,aAAO,IAAI,EAAE,GAAG;AAChB,YAAM,IAAI,EAAE,GAAG;AACf,aAAO,IAAI,EAAE,GAAG;AAChB,YAAM,IAAI,EAAE,GAAG;AAAA,IACjB;AACA,QAAI,EAAE,KAAK,IAAK,KAAI,CAAC;AAAA,EACvB,OAAO;AACL,SAAK,KAAK;AACV,WAAO,IAAI,IAAI,KAAK,GAAG;AACrB,YAAM,OAAO,IAAI,EAAE,EAAE;AACrB,SAAG,CAAC,IAAI,QAAQ;AAChB,SAAG,IAAI,CAAC,IAAI,OAAO;AAAA,IACrB;AACA,MAAE;AAAA,EACJ;AAEA,MAAI,MAAM;AACV,OAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AACvB,UAAM,KAAK,GAAG,CAAC;AAEf,QAAI,KAAK,GAAI,KAAI,CAAC;AAClB,WAAO,MAAO,KAAM,KAAK;AAAA,EAC3B;AAEA,QAAM,KAAK,IAAI,GAAG,IAAI;AAEtB,QAAM,KAAK,KAAK;AAEhB,QAAM,MAAM,KAAK;AAEjB,MAAI,MAAO,MAAM,EAAI,KAAI,CAAC;AAC1B,KAAG,IAAI,IAAI,IAAI,GAAG,IAAI;AACtB,OAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AACvB,UAAM,KAAK,GAAG,CAAC;AACf,MAAE,GAAG,GAAG,CAAC,IAAI,MAAO,KAAK,IAAI,EAAG;AAAA,EAClC;AAEA,QAAM,OAAO,IAAI,GAAG,MAAM,CAAC;AAE3B,QAAM,OAAO,KAAK,SAAS,GAAG,EAAE,GAAG,KAAK,KAAK,SAAS,EAAE;AACxD,KAAG,EAAE,IAAI;AACT,OAAK,IAAI,IAAI,IAAI,GAAG,EAAE,GAAG;AACvB,UAAM,KAAK,GAAG,CAAC;AACf,SAAK,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,KAAK,KAAM,KAAK,EAAG;AAAA,EAC1D;AACA,MAAI,GAAG,CAAC,KAAK,GAAI,KAAI,CAAC;AACtB,OAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AACvB,UAAM,OAAO,GAAG,CAAC;AACjB,QAAI,MAAM;AACR,YAAM,OAAO,GAAG,IAAI;AACpB,WAAK,MAAM,GAAG,MAAM,GAAG,IAAI,IAAI,QAAQ,KAAM,KAAK,KAAM;AAAA,IAC1D;AAAA,EACF;AACA,SAAO,CAAC,IAAI;AAAA,IACV,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACL,CAAC;AACH;AAMA,IAAM,OAAqB,KAAmB,oBAAI,GAAG;AAAA,EACnD;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAI;AAAA,EAAK;AACjF,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;AAGX,IAAM,OAAqB,KAAmB,oBAAI,GAAG;AAAA,EACnD;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAC5G,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;AAGX,IAAM,OAAsB,KAAmB,oBAAI,GAAG;AAAA,EACpD;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AACpD,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;AAGX,IAAM,OAAO,CAAC,GAAe,MAAc;AACzC,QAAM,MAAM,EAAE,QAAQ,KAAK,IAAI,IAAI,GAAG;AACtC,WAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,OAAG,CAAC,IAAI;AACR,SAAK,KAAK,EAAE,CAAC;AAAA,EACf;AACA,SAAO;AACT;AAGA,IAAM,MAAqB,oBAAI,IAAmB,oBAAI,IAAI;AAAA,EACxD;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAU;AAAA,EAAU;AAAA,EAAW;AAAA,EAAW;AACxD,CAAC,GAAG,QAAQ,GAAG,EAAE;AAGjB,IAAM,OAAsB,qBAAK,KAAK,CAAC;AAGvC,IAAM,MAAqB,oBAAI,IAAmB,oBAAI,IAAI;AAAA,EACxD;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAU;AAAA,EAAU;AAAA,EAAW;AAAA,EAAW;AAAA,EAAW;AAC/E,CAAC,GAAG,QAAQ,GAAG,EAAE;AAGjB,IAAM,OAAsB,qBAAK,KAAK,CAAC;AAGvC,IAAM,MAAM,CAAC,KAAiB,KAAiB,OAAY;AACzD,QAAM,MAAM,IAAI,QAAQ,KAAK,IAAI,QAAQ,KAAK,IAAI,MAAM,CAAC,GAAG,OAAO,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,GAAG;AAC5F,MAAI,CAAC,GAAI,KAAI,CAAC;AACd,MAAI,KAAK,GAAG,MAAM,GAAG,GAAG,OAAO,OAAO,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI;AAClE,SAAO,MAAM,MAAM,IAAI,MAAK;AAC1B,UAAM,MAAM,OAAO;AACnB,UAAM,OAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,IAAM,IAAI,MAAM,CAAC,KAAK,QAAS,MAAM;AAC9E,UAAO,MAAM,MAAO,OAAO;AAC3B,QAAI,EAAE,CAAC,IAAI,GAAG,EAAE,EAAE;AAClB,WAAQ,MAAM,GAAG,EAAE,EAAE;AAAA,EACvB;AACA,MAAI,OAAO,MAAM,IAAI,KAAK,GAAI,KAAI,CAAC;AACrC;AAIA,IAAM,OAAO,CAAC,KAAiB,KAAiB,OAAY;AAC1D,MAAI,KAAK;AACT,QAAM,KAAK,IAAI,QAAQ,MAAO,KAAK,KAAM,GAAG,MAAM,OAAO,GAAG,MAAM,MAAM;AACxE,MAAI,IAAI,SAAS,IAAI,MAAM,IAAI,CAAC,IAAK,IAAI,CAAC,KAAK,CAAE,GAAG,IAAI,SAAS,GAAG,GAAG,GAAG,EAAE;AAC5E,MAAI,IAAI,SAAS,IAAI,MAAM,IAAI,CAAC,IAAK,IAAI,CAAC,KAAK,CAAE,GAAG,IAAI,SAAS,KAAK,GAAG,GAAG,EAAE;AAC9E,MAAI,IAAI,SAAS,IAAI,MAAM,IAAI,CAAC,IAAK,IAAI,CAAC,KAAK,CAAE,GAAG,IAAI,SAAS,KAAK,GAAG,GAAG,EAAE;AAC9E,MAAI,IAAI,SAAS,EAAE,GAAG,IAAI,SAAS,GAAG,GAAG,EAAE;AAC7C;AAGA,IAAM,MAAM,CAAC,KAAiB,IAAgB,QAAqB;AACjE,MAAI,KAAK,GAAG;AAEZ,QAAM,KAAK,IAAI,EAAE,GAAG,QAAS,MAAM,IAAK;AACxC,KAAG,IAAI,KAAK;AACZ,QAAM,KAAM,MAAM,IAAM,IAAI,KAAK,CAAC,KAAK,IAAM,IAAI,KAAK,CAAC,KAAK;AAE5D,QAAM,OAAO,MAAM,KAAK;AACxB,MAAI,SAAS,GAAG;AACd,QAAI,MAAM,IAAI,OAAQ;AACtB,OAAG,IAAI,KAAK;AACZ,QAAI,KAAK;AACP,WAAK,KAAK,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,KAAK,EAAE;AACnC,aAAO;AAAA,IACT;AACA,WAAO,KAAK,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;AAAA,EACjC;AACA,MAAI,MAAM,IAAI,OAAQ;AACtB,MAAI,SAAS,GAAG;AACd,OAAG,IAAI;AACP,QAAI,KAAK;AACP,UAAI,IAAI,IAAI,SAAS,IAAI,GAAG,GAAG,GAAG,CAAC;AACnC,SAAG,KAAK;AACR,aAAO;AAAA,IACT;AACA,WAAO,IAAI,KAAK,IAAI,GAAG;AAAA,EACzB;AACA,MAAI,SAAS,GAAG;AAEd,UAAM,KAAK,IAAI,EAAE,GAAG,MAAM,KAAK,GAAG,KAAM,MAAM,IAAK;AAEnD,QAAI,MAAM,MAAM,GAAG,MAAM,GAAG,KAAK;AACjC,QAAI,MAAM,GAAG;AACX,UAAI,KAAK,EAAG,QAAQ,IAAI,EAAE,EAAE,KAAK,KAAO,KAAK,KAAO,IAAI,EAAE,EAAE,KAAK;AAAA,UAC5D,OAAM,MAAM;AAAA,IACnB,OAAO;AACL,WAAK;AACL,UAAI,KAAK,EAAG,SAAS,IAAI,EAAE,EAAE,IAAI,OAAO,GAAI,MAAO,IAAI,EAAE,KAAK,IAAM,IAAI,EAAE,EAAE,KAAK;AAAA,eACxE,MAAM,EAAG,QAAQ,IAAI,EAAE,EAAE,KAAK,KAAO,IAAI,EAAE,EAAE,IAAI,MAAM,IAAK,MAAO,IAAI,EAAE,KAAK,IAAM,IAAI,EAAE,EAAE,KAAK;AAAA,UACrG,QAAQ,IAAI,EAAE,EAAE,KAAK,KAAO,IAAI,EAAE,EAAE,IAAI,OAAO,IAAK,MAAO,IAAI,EAAE,KAAK,IAAM,IAAI,EAAE,EAAE,KAAK,IAAM,IAAI,EAAE,EAAE,KAAK;AAAA,IACnH;AACA,MAAE;AAEF,QAAI,MAAM,MAAM,IAAI,SAAS,GAAG,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,GAAG,CAAC;AAE7D,QAAI,MAAM,IAAI,SAAS;AACvB,QAAI,OAAO,EAAG,KAAI,IAAI,IAAI,SAAS,IAAI,MAAM,GAAG,GAAG,GAAG;AAAA,aAC7C,OAAO,EAAG,MAAK,KAAK,IAAI,IAAI,GAAG,GAAG;AAAA,SACtC;AAEH,UAAI,KAAK,GAAG;AACZ,UAAI,OAAO,GAAG;AACZ,cAAM,MAAM,IAAI,KAAK,EAAE;AAEvB,eAAO,MAAM,KAAK,IAAI,CAAC;AACvB,WAAG,IAAI,KAAK,IAAI,CAAC;AAAA,MACnB,WACS,CAAC,GAAI,KAAI,CAAC;AACnB,OAAC,KAAK,OAAO,KAAK,IAAI,SAAS,IAAI,MAAM,GAAG,GAAG,IAAI,SAAS,GAAG,GAAG,EAAE;AAAA,IACtE;AAEA,QAAI,KAAK,IAAI,IAAI;AACjB,QAAI,IAAI;AACN,UAAI,MAAM,IAAK,OAAM,IAAI,IAAI,IAAK,IAAI,IAAI,KAAK,KAAM;AAAA,eAC5C,KAAK,IAAK,MAAO,KAAK,OAAQ,IAAK,IAAI,IAAI;AAEpD,YAAM,MAAM,IAAI,IAAI;AACpB,UAAI,MAAM,EAAG,KAAI,CAAC;AAClB,YAAM,MAA6B,CAAC,MAAM,MAAM,IAAI;AACpD,eAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,cAAM,KAAM,QAAS,KAAK,KAAK,IAAM;AACrC,YAAI,MAAM,GAAG;AAEX,gBAAM,OAAO,IAAI,GAAG,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,CAAC;AACrC,cAAI,CAAC,IAAI;AAAA,YACP,GAAG,KAAK,SAAS,GAAG,CAAC;AAAA,YACrB,GAAG,KAAK,SAAS,GAAG,CAAC;AAAA,YACrB,GAAG,IAAI,IAAI,KAAK,QAAQ,GAAG,CAAC;AAAA,YAC5B,GAAG;AAAA,UACL;AAAA,QACF,WAAW,MAAM,GAAG;AAElB,WAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI,EAAE;AAAA,QAC1C,WAAW,MAAM,GAAG;AAClB,cAAI,CAAC,GAAG,EAAG,KAAI,CAAC;AAChB,cAAI,CAAC,IAAI,GAAG,EAAE,CAAC;AAAA,QACjB;AAAA,MACF;AACA,YAAM,CAAC,KAAK,KAAK,GAAG,IAAI,GAAG,IAAI;AAC/B,YAAM,KAAK,IAAI,MAAM,CAAC;AACtB,UAAI,CAAC,GAAI,KAAI,CAAC;AACd,UAAI,QAAQ,OAAO,KAAK,IAAI,IAAI,EAAE,IAAI,IAAI,GAAG,MAAM,QAAQ,GAAG,OAAO;AACrE,UAAI,OAAQ,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,IAAI,KAAK;AAC7E,aAAO,QAAQ,IAAI,MAAM;AACzB,UAAI,OAAQ,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,IAAI,KAAK;AAC7E,aAAO,QAAQ,IAAI,MAAM;AACzB,UAAI,OAAQ,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,IAAI,KAAK;AAC7E,WAAK,EAAE,IAAI,EAAE,MAAK;AAChB,cAAM,MAAM,IAAI,EAAE,GAAG;AACrB,cAAM,OAAO,IAAI,EAAE,GAAG;AACtB,cAAM,MAAM,IAAI,EAAE,GAAG;AACrB,cAAM,OAAO,IAAI,EAAE,GAAG;AACtB,cAAM,MAAM,IAAI,EAAE,GAAG;AACrB,cAAM,OAAO,IAAI,EAAE,GAAG;AAEtB,eAAO,QAAQ,QAAQ;AACvB,cAAM,MAAM,KAAK;AACjB,YAAI,MAAM,QAAS,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,IAAM,IAAI,MAAM,CAAC,KAAK,KAAO,IAAI,MAAM,CAAC,KAAK,SAAU,OAAO,KAAO,MAAM;AAC1H,eAAO,QAAQ,IAAI,GAAG,MAAM;AAC5B,YAAI,KAAK,KAAK,GAAG,MAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,IAAM,IAAI,MAAM,CAAC,KAAK,QAAS,OAAO,MAAQ,KAAK,IAAI,GAAG,KAAK;AACnH,eAAO,QAAQ,IAAI,GAAG,MAAM;AAC5B,cAAM,KAAK,KAAK,GAAG,MAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,IAAM,IAAI,MAAM,CAAC,KAAK,QAAS,OAAO,MAAQ,KAAK,IAAI,GAAG,KAAK;AAErH,eAAO,QAAQ,SAAS;AACxB,cAAM,IAAI,EAAE,GAAG,MAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,QAAQ;AACtF,eAAO,QAAQ,SAAS;AACxB,cAAM,IAAI,EAAE,GAAG,MAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,QAAQ;AACtF,eAAO,QAAQ,SAAS;AACxB,cAAM,IAAI,EAAE,GAAG,MAAO,IAAI,GAAG,IAAK,IAAI,MAAM,CAAC,KAAK,OAAQ,OAAO,MAAQ,KAAK,QAAQ;AAEtF,YAAI,MAAM,GAAG;AACX,aAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;AAChB,aAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;AAChB,aAAG,EAAE,CAAC,IAAI,OAAO;AAAA,QACnB,OAAO;AACL,gBAAM,MAAM,OAAQ,MAAM;AAC1B,cAAI,KAAK;AACP,kBAAM,OAAO,IAAI,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG,EAAE,GAAG;AACvC,gBAAI,MAAM,EAAG,IAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;AAC7B,eAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;AAChB,eAAG,EAAE,CAAC,IAAI;AAAA,UACZ,MAAO,OAAM,GAAG,EAAE,CAAC;AAAA,QACrB;AACA,iBAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,cAAI,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC;AAAA,QAC7B;AACA,gBAAQ,IAAI,OAAO;AACnB,YAAI,OAAO,OAAO;AAClB,YAAI,OAAO,GAAG;AACZ,cAAI,MAAM,CAAC;AACX,gBAAM,KAAK,GAAG,IAAI;AAClB,cAAI,MAAM,GAAI,OAAM;AACpB,mBAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,gBAAI,OAAO,CAAC,IAAI,GAAG,EAAE,KAAK,CAAC;AAAA,UAC7B;AACA,kBAAQ,KAAK,MAAM,KAAK,OAAO;AAAA,QACjC;AACA,iBAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,cAAI,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC;AAAA,QAC9B;AACA,gBAAQ;AAAA,MACV;AACA,UAAI,QAAQ,KAAK;AACf,eAAO,MAAM,IAAI,QAAQ;AACvB,cAAI,MAAM,IAAI,IAAI,KAAK;AAAA,QACzB;AAAA,MACF,MAAO,QAAO,IAAI;AAClB,UAAI,IAAK,IAAG,KAAK;AAAA,UACZ,OAAM,IAAI,KAAK,GAAG,IAAI;AAAA,IAC7B,WAAW,KAAK;AACd,SAAG,KAAK;AACR,UAAI,KAAK;AACP,iBAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,cAAI,CAAC,IAAI,IAAI,MAAM,CAAC;AAAA,QACtB;AAAA,MACF;AAAA,IACF,WAAW,IAAK,OAAM,IAAI,KAAK,GAAG;AAClC,OAAG,IAAI;AACP,WAAO;AAAA,EACT;AACA,MAAI,CAAC;AACP;AAGA,IAAM,MAAM,CAAC,MAAoB,OAAe;AAC9C,MAAI,KAAK,UAAU,EAAG,QAAO,KAAK,CAAC;AACnC,QAAM,MAAM,IAAI,GAAG,EAAE;AACrB,WAAS,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAC3C,UAAM,MAAM,KAAK,CAAC;AAClB,QAAI,IAAI,KAAK,CAAC;AACd,SAAK,IAAI;AAAA,EACX;AACA,SAAO;AACT;AAaO,SAAS,WAAW,KAAiB,KAAkB,KAAkB;AAC9E,QAAM,OAAqB,CAAC,GAAG,KAAK,CAAC,CAAC;AACtC,MAAI,KAAK,GAAG,KAAK;AACjB,SAAO,IAAI,UAAS;AAClB,UAAM,KAAK,KAAK,KAAK,MAAM,GAAG;AAC9B,QAAI,OAAO,MAAM,UAAU;AACzB,UAAI,GAAG,KAAK,CAAC,IAAK,KAAI,CAAC;AACvB,UAAI,IAAK,MAAK,KAAK,EAAE;AACrB,UAAI,IAAI;AACN,cAAM;AACN,YAAI,CAAC,OAAO,GAAG,EAAE,UAAU,GAAG,GAAG;AAC/B,eAAK,KAAK,MAAM,GAAG,CAAC;AACpB,gBAAM,GAAG;AAAA,QACX;AAAA,MACF,OAAO;AACL,aAAK,KAAK,GAAG;AACb,WAAG,IAAI;AAAA,MACT;AACA,aAAO,CAAC,GAAG,KAAI;AACb,cAAM,MAAM,IAAI,KAAK,IAAI,GAAG;AAC5B,YAAI,CAAC,IAAK,KAAI,CAAC;AACf,YAAI,IAAK,IAAG,IAAI,GAAG;AAAA,aACd;AACH,eAAK,KAAK,GAAG;AACb,gBAAM,IAAI;AACV,cAAI,GAAG,GAAG,GAAG,IAAI,MAAM;AACvB,aAAG,EAAE,IAAI,KAAK,GAAG,EAAE,SAAS,IAAI,MAAM;AAAA,QACxC;AAAA,MACF;AACA,WAAK,GAAG,IAAK,GAAG,IAAI;AAAA,IACtB,MAAO,MAAK;AACZ,UAAM,IAAI,SAAS,EAAE;AAAA,EACvB;AACA,SAAO,IAAI,MAAM,EAAE;AACrB;;;AClsBO,IAAM,cAAc;AAGpB,IAAM,cAAc,IAAI,WAAW;AAAA,EACxC;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AACF,CAAC;AAGM,IAAK,cAAL,kBAAKA,iBAAL;AACL,EAAAA,0BAAA,UAAO,KAAP;AACA,EAAAA,0BAAA,UAAO,KAAP;AAFU,SAAAA;AAAA,GAAA;AAML,IAAK,WAAL,kBAAKC,cAAL;AACL,EAAAA,oBAAA,cAAW,KAAX;AACA,EAAAA,oBAAA,cAAW,KAAX;AACA,EAAAA,oBAAA,gBAAa,KAAb;AACA,EAAAA,oBAAA,oBAAiB,KAAjB;AACA,EAAAA,oBAAA,WAAQ,KAAR;AACA,EAAAA,oBAAA,cAAW,KAAX;AANU,SAAAA;AAAA,GAAA;AAUL,IAAK,uBAAL,kBAAKC,0BAAL;AACL,EAAAA,4CAAA,UAAO,KAAP;AACA,EAAAA,4CAAA,UAAO,KAAP;AAFU,SAAAA;AAAA,GAAA;AAqBL,IAAM,mBAAN,cAA+B,MAAM;AAAA,EAC1C,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AASO,SAAS,YAAY,MAAkC;AAC5D,MAAI,KAAK,SAAS,aAAa;AAC7B,UAAM,IAAI;AAAA,MACR,uCAAuC,WAAW,eAAe,KAAK,MAAM;AAAA,IAC9E;AAAA,EACF;AAGA,QAAM,QAAQ,KAAK,MAAM,GAAG,EAAE;AAC9B,MAAI,CAAC,aAAa,OAAO,WAAW,GAAG;AACrC,UAAM,IAAI,iBAAiB,2CAA2C;AAAA,EACxE;AAGA,QAAM,sBAAsB,KAAK,MAAM,IAAI,EAAE;AAC7C,QAAM,iBAAiB,IAAI,YAAY,EACpC,OAAO,mBAAmB,EAC1B,QAAQ;AAGX,QAAM,kBAAkB,KAAK,EAAE;AAC/B,MACE,oBAAoB,gBACpB,oBAAoB,cACpB;AACA,UAAM,IAAI,iBAAiB,yBAAyB,eAAe,EAAE;AAAA,EACvE;AACA,QAAM,cAAc;AAGpB,QAAM,eAAe,KAAK,EAAE;AAC5B,MAAI,eAAe,KAAK,eAAe,GAAG;AACxC,UAAM,IAAI,iBAAiB,sBAAsB,YAAY,EAAE;AAAA,EACjE;AACA,QAAM,WAAW;AAGjB,QAAM,kBAAkB,KAAK,EAAE;AAC/B,MACE,oBAAoB,gBACpB,oBAAoB,cACpB;AACA,UAAM,IAAI;AAAA,MACR,kCAAkC,eAAe;AAAA,IACnD;AAAA,EACF;AACA,QAAM,cAAc;AAEpB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AASO,SAAS,iBACd,QACA,cACM;AACN,MAAI,OAAO,aAAa,cAAc;AACpC,UAAM,WAAW,SAAS,YAAY;AACtC,UAAM,SAAS,SAAS,OAAO,QAAQ;AACvC,UAAM,IAAI;AAAA,MACR,+BAA+B,QAAQ,SAAS,MAAM;AAAA,IACxD;AAAA,EACF;AACF;AAQO,SAAS,mBAAmB,MAA8B;AAC/D,SAAO,KAAK,MAAM,WAAW;AAC/B;AAGA,SAAS,aAAa,GAAe,GAAwB;AAC3D,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,QAAI,EAAE,CAAC,MAAM,EAAE,CAAC,EAAG,QAAO;AAAA,EAC5B;AACA,SAAO;AACT;;;AT5JA,IAAM,yBAAyB;AA4CxB,SAAS,UAAU,MAA8B;AAEtD,MAAI,KAAK,SAAS,aAAa;AAC7B,UAAM,IAAI;AAAA,MACR,wBAAwB,KAAK,MAAM,yBAAyB,WAAW;AAAA,IACzE;AAAA,EACF;AAGA,QAAM,SAAS,YAAY,IAAI;AAC/B,mBAAiB,wBAAyB;AAG1C,MAAI,SAAS,mBAAmB,IAAI;AACpC,MAAI,OAAO,8BAA2C;AACpD,aAAS,WAAW,MAAM;AAAA,EAC5B;AAGA,QAAM,KAAK,IAAI,WAAW,MAAM;AAChC,QAAM,OAAO,KAAQ,cAAc,EAAE;AACrC,QAAM,cAAc,KAAK,YAAY;AAErC,MAAI,gBAAgB,wBAAwB;AAC1C,UAAM,IAAI;AAAA,MACR,kCAAkC,WAAW,cAAc,sBAAsB;AAAA,IACnF;AAAA,EACF;AAEA,QAAM,kBAAkB,KAAK,gBAAgB;AAC7C,QAAM,yBAAyB,4BAA4B,IAAI;AAE/D,SAAO,EAAE,MAAM,aAAa,iBAAiB,uBAAuB;AACtE;AAcA,SAAS,4BAA4B,MAAwC;AAC3E,QAAM,SAAkC,CAAC;AACzC,QAAM,cAAc,KAAK,YAAY;AACrC,MAAI,CAAC,eAAe,YAAY,WAAW,EAAG,QAAO;AAErD,MAAI;AACJ,MAAI;AACF,UAAMC,MAAK,YAAY,OAAO;AAAA,MAC5B,YAAY;AAAA,MACZ,YAAY,aAAa,YAAY;AAAA,IACvC;AACA,aAAqB,qBAASA,GAAE;AAAA,EAClC,QAAQ;AACN,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,SAAS,MAAM,EAAG,QAAO;AAC9B,QAAM,aAAa,OAAO;AAC1B,MAAI,CAAC,SAAS,UAAU,EAAG,QAAO;AAElC,aAAW,aAAa,OAAO,OAAO,UAAU,GAAG;AACjD,QAAI,CAAC,SAAS,SAAS,EAAG;AAC1B,UAAM,YAAY,UAAU;AAC5B,QAAI,OAAO,cAAc,SAAU;AACnC,UAAM,OAAO,OAAO,UAAU,SAAS,WAAW,UAAU,OAAO;AACnE,UAAM,KAAK,aAAa,UAAU,KAAK;AACvC,WAAO,KAAK,KAAK,EAAE,MAAM,WAAW,GAAG,IAAI,EAAE,MAAM,UAAU,CAAC;AAAA,EAChE;AAIA,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,UAAU,SAAS,EAAE,UAAU,MAAM;AAC7D,SAAO;AACT;AAOA,SAAS,aAAa,OAA+C;AACnE,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO;AAC7B,QAAM,KAAK,MAAM,MAAM,MAAM,iBAAiB,MAAM;AACpD,MAAI,CAAC,SAAS,EAAE,EAAG,QAAO;AAC1B,QAAM,MAAyB,CAAC;AAChC,MAAI,OAAO,GAAG,WAAW,SAAU,KAAI,SAAS,GAAG;AACnD,MAAI,OAAO,GAAG,iBAAiB,SAAU,KAAI,cAAc,GAAG;AAC9D,MAAI,OAAO,GAAG,qBAAqB,WAAW;AAC5C,QAAI,iBAAiB,GAAG;AAAA,EAC1B;AACA,SAAO;AACT;AAEA,SAAS,SAAS,OAAkD;AAClE,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;AAKA,SAAS,qBAAqB,QAAoB,QAA4B;AAC5E,QAAM,SAAS,KAAK,IAAI,OAAO,QAAQ,OAAO,MAAM;AAEpD,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,OAAO,CAAC,IAAI,OAAO,CAAC,EAAG,QAAO;AAClC,QAAI,OAAO,CAAC,IAAI,OAAO,CAAC,EAAG,QAAO;AAAA,EACpC;AAEA,SAAO,OAAO,SAAS,OAAO;AAChC;AAQA,SAAS,gBACP,YACA,UACA,QACA,MACmB;AACnB,QAAM,EAAE,gBAAgB,IAAI;AAC5B,MAAI,WAAW,EAAG,QAAO;AAGzB,QAAM,cAAc,IAAI,YAAY,EAAE,OAAO,IAAI;AAEjD,MAAI,MAAM;AACV,MAAI,OAAO,SAAS;AAEpB,SAAO,OAAO,MAAM;AAClB,UAAM,MAAO,MAAM,SAAU;AAC7B,UAAM,WAAW,SAAS,GAAG;AAE7B,QAAI,CAAC,UAAU;AACb,YAAM,IAAI,MAAM,gDAAgD,GAAG,EAAE;AAAA,IACvE;AAEA,UAAM,UAAU,SAAS,KAAK;AAC9B,QAAI,YAAY,MAAM;AACpB,YAAM,IAAI,MAAM,+CAA+C,GAAG,EAAE;AAAA,IACtE;AAEA,UAAM,eAAe,IAAI,YAAY,EAAE,OAAO,OAAO;AACrD,UAAM,MAAM,qBAAqB,cAAc,WAAW;AAE1D,QAAI,MAAM,GAAG;AACX,YAAM,MAAM;AAAA,IACd,WAAW,MAAM,GAAG;AAClB,aAAO,MAAM;AAAA,IACf,OAAO;AAEL,YAAM,gBAAgB,SAAS,cAAc;AAE7C,UAAI,iBAAiB,iBAAiB;AACpC,cAAM,IAAI;AAAA,UACR,0BAA0B,aAAa,aAAa,IAAI,0BAC/B,eAAe;AAAA,QAC1C;AAAA,MACF;AAEA,aAAO,qBAAqB,YAAY,aAAa;AAAA,IACvD;AAAA,EACF;AAEA,SAAO;AACT;AAOA,SAAS,qBACP,YACA,OACY;AACZ,QAAM,eAAe,WAAW,KAAK,UAAU,KAAK;AACpD,MAAI,CAAC,cAAc;AACjB,UAAM,IAAI,MAAM,+CAA+C,KAAK,EAAE;AAAA,EACxE;AAEA,QAAM,QAAQ,aAAa,GAAG;AAC9B,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,MAAM,iCAAiC,KAAK,aAAa;AAAA,EACrE;AAEA,SAAO,MAAM,GAAI,MAAM,EAAE,MAAM,MAAM,QAAQ,MAAM,SAAS,EAAE;AAChE;AAOA,SAAS,SACP,UACA,QACU;AACV,QAAM,QAAkB,CAAC;AAEzB,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAM,WAAW,SAAS,CAAC;AAC3B,QAAI,CAAC,UAAU;AACb,YAAM,IAAI,MAAM,gDAAgD,CAAC,EAAE;AAAA,IACrE;AACA,UAAM,OAAO,SAAS,KAAK;AAC3B,QAAI,SAAS,MAAM;AACjB,YAAM,IAAI,MAAM,+CAA+C,CAAC,EAAE;AAAA,IACpE;AACA,UAAM,KAAK,IAAI;AAAA,EACjB;AAEA,SAAO;AACT;AAOO,SAAS,cACd,YACA,MACmB;AACnB,QAAM,EAAE,KAAK,IAAI;AACjB,SAAO;AAAA,IACL;AAAA,IACA,CAAC,MAAM,KAAK,SAAS,CAAC;AAAA,IACtB,KAAK,eAAe;AAAA,IACpB;AAAA,EACF;AACF;AAOO,SAAS,WACd,YACA,MACmB;AACnB,QAAM,EAAE,KAAK,IAAI;AACjB,SAAO;AAAA,IACL;AAAA,IACA,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,IAClB,KAAK,WAAW;AAAA,IAChB;AAAA,EACF;AACF;AAOO,SAAS,qBAAqB,YAAkC;AACrE,QAAM,EAAE,KAAK,IAAI;AACjB,SAAO,SAAS,CAAC,MAAM,KAAK,SAAS,CAAC,GAAG,KAAK,eAAe,CAAC;AAChE;AASO,SAAS,iBAAiB,YAAkC;AACjE,QAAM,EAAE,KAAK,IAAI;AACjB,SAAO,SAAS,CAAC,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,WAAW,CAAC;AACxD;;;AUpVO,IAAM,WAAN,MAAqB;AAAA,EAClB;AAAA,EACS;AAAA,EAEjB,YAAY,SAAiB;AAC3B,SAAK,QAAQ,oBAAI,IAAI;AACrB,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,IAAI,KAAuB;AACzB,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAChC,QAAI,UAAU,QAAW;AAEvB,WAAK,MAAM,OAAO,GAAG;AACrB,WAAK,MAAM,IAAI,KAAK,KAAK;AAAA,IAC3B;AACA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,KAAQ,OAAgB;AAC1B,QAAI,KAAK,WAAW,EAAG;AAEvB,QAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACvB,WAAK,MAAM,OAAO,GAAG;AAAA,IACvB;AAGA,QAAI,KAAK,MAAM,QAAQ,KAAK,SAAS;AACnC,YAAM,YAAY,KAAK,MAAM,KAAK,EAAE,KAAK,EAAE;AAC3C,UAAI,cAAc,QAAW;AAC3B,aAAK,MAAM,OAAO,SAAS;AAAA,MAC7B;AAAA,IACF;AAEA,SAAK,MAAM,IAAI,KAAK,KAAK;AAAA,EAC3B;AAAA,EAEA,IAAI,KAAiB;AACnB,WAAO,KAAK,MAAM,IAAI,GAAG;AAAA,EAC3B;AAAA,EAEA,OAAO,KAAiB;AACtB,WAAO,KAAK,MAAM,OAAO,GAAG;AAAA,EAC9B;AAAA,EAEA,QAAc;AACZ,SAAK,MAAM,MAAM;AAAA,EACnB;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK,MAAM;AAAA,EACpB;AACF;;;ACVO,SAAS,aAAmB,OAA4C;AAC7E,QAAM,UAAU,oBAAI,IAAmB;AAEvC,SAAO;AAAA,IACL,KACE,KACA,SACA,QACY;AAGZ,UAAI,QAAQ,QAAS,QAAO,QAAQ,OAAO,eAAe,CAAC;AAE3D,YAAM,MAAM,MAAM,IAAI,GAAG;AACzB,UAAI,QAAQ,OAAW,QAAO,QAAQ,QAAQ,GAAG;AAEjD,UAAI,QAAQ,QAAQ,IAAI,GAAG;AAC3B,UAAI,CAAC,OAAO;AACV,cAAM,aAAa,IAAI,gBAAgB;AACvC,cAAM,UAAU,cAAc,SAAS,WAAW,MAAM,EACrD,KAAK,CAAC,UAAU;AACf,gBAAM,IAAI,KAAK,KAAK;AACpB,iBAAO;AAAA,QACT,CAAC,EACA,QAAQ,MAAM;AACb,cAAI,QAAQ,IAAI,GAAG,GAAG,YAAY,QAAS,SAAQ,OAAO,GAAG;AAAA,QAC/D,CAAC;AACH,cAAM,QAAoB,EAAE,SAAS,YAAY,UAAU,EAAE;AAC7D,gBAAQ,IAAI,KAAK,KAAK;AACtB,gBAAQ;AAAA,MACV;AACA,YAAM,QAAQ;AACd,YAAM;AAEN,YAAM,UAAU,MAAM;AACpB,cAAM;AACN,YAAI,MAAM,WAAW,EAAG;AAMxB,YAAI,QAAQ,IAAI,GAAG,MAAM,OAAO;AAC9B,kBAAQ,OAAO,GAAG;AAClB,gBAAM,WAAW,MAAM;AAAA,QACzB;AAAA,MACF;AAEA,UAAI,CAAC,QAAQ;AACX,eAAO,MAAM,QAAQ;AAAA,UACnB,CAAC,UAAU;AACT,oBAAQ;AACR,mBAAO;AAAA,UACT;AAAA,UACA,CAAC,UAAU;AACT,oBAAQ;AACR,kBAAM;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAEA,aAAO,IAAI,QAAW,CAAC,SAAS,WAAW;AACzC,YAAI,OAAO;AAGX,cAAM,SAAS,MAAe;AAC5B,cAAI,KAAM,QAAO;AACjB,iBAAO;AACP,iBAAO,oBAAoB,SAAS,WAAW;AAC/C,kBAAQ;AACR,iBAAO;AAAA,QACT;AACA,cAAM,cAAc,MAAM;AACxB,cAAI,OAAO,EAAG,QAAO,eAAe,CAAC;AAAA,QACvC;AACA,eAAO,iBAAiB,SAAS,aAAa,EAAE,MAAM,KAAK,CAAC;AAC5D,cAAM,QAAQ;AAAA,UACZ,CAAC,UAAU;AACT,gBAAI,OAAO,EAAG,SAAQ,KAAK;AAAA,UAC7B;AAAA,UACA,CAAC,UAAU;AACT,gBAAI,OAAO,EAAG,QAAO,KAAK;AAAA,UAC5B;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAMA,SAAS,cACP,SACA,QACY;AACZ,MAAI;AACF,WAAO,QAAQ,MAAM;AAAA,EACvB,SAAS,OAAO;AACd,WAAO,QAAQ,OAAO,KAAK;AAAA,EAC7B;AACF;AAEA,SAAS,iBAAwB;AAC/B,SAAO,IAAI,aAAa,8BAA8B,YAAY;AACpE;;;ACpIO,SAAS,aAAa,OAA+B;AAC1D,MAAI,MAAM,WAAW,IAAI;AACvB,UAAM,IAAI;AAAA,MACR,8CAA8C,MAAM,MAAM;AAAA,IAC5D;AAAA,EACF;AACA,SAAO;AACT;AAMO,SAAS,YAAY,OAA8B;AACxD,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,MAAM,4CAA4C,MAAM,MAAM,EAAE;AAAA,EAC5E;AACA,SAAO;AACT;;;AChCA,SAAS,cAAAC,mBAAkB;;;ACApB,IAAM,mBAAN,MAAuB;AAAA,EAC5B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA8C;AAC9D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,GAAG,KAAqC;AACtC,YAAQ,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,QAAQ,KAAK,EAAG;AAAA,EAC/D;AAAA,EAEA,YAAoB;AAClB,WAAO,KAAK,GAAI,WAAW,KAAK,SAAS,EAAE;AAAA,EAC7C;AAAA,EAEA,eAAuB;AACrB,WAAO,KAAK,GAAI,WAAW,KAAK,SAAS,EAAE;AAAA,EAC7C;AAAA,EAEA,OAAO,SAAiB;AACtB,WAAO;AAAA,EACT;AACF;;;ACxBO,IAAM,qBAAN,MAAM,oBAAmB;AAAA,EAC9B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAgD;AAChE,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,4BACL,IACA,KACoB;AACpB,YAAQ,OAAO,IAAI,oBAAmB,GAAG;AAAA,MACvC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,GAAG,KAAqC;AACtC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,YAAoB;AAClB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI;AAAA,EAC9D;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;AC5DO,IAAM,gBAAN,MAAM,eAAc;AAAA,EACzB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA2C;AAC3D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,uBACL,IACA,KACe;AACf,YAAQ,OAAO,IAAI,eAAc,GAAG;AAAA,MAClC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAIA,KAAK,kBAAoD;AACvD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AACF;;;AC3BO,IAAM,iBAAN,MAAqB;AAAA,EAC1B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA4C;AAC5D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,cAAsB;AACpB,WAAO,KAAK,GAAI,WAAW,KAAK,MAAM;AAAA,EACxC;AAAA,EAEA,cAAsB;AACpB,WAAO,KAAK,GAAI,WAAW,KAAK,SAAS,CAAC;AAAA,EAC5C;AAAA,EAEA,OAAO,SAAiB;AACtB,WAAO;AAAA,EACT;AACF;;;ACpBO,IAAM,mBAAN,MAAM,kBAAiB;AAAA,EAC5B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA8C;AAC9D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,0BACL,IACA,KACkB;AAClB,YAAQ,OAAO,IAAI,kBAAiB,GAAG;AAAA,MACrC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAEA,YAAoB;AAClB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI;AAAA,EAC9D;AACF;;;AC5BO,IAAM,kBAAN,MAAsB;AAAA,EAC3B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA6C;AAC7D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAe;AACb,WAAO,KAAK,GAAI,WAAW,KAAK,MAAM;AAAA,EACxC;AAAA,EAEA,KAAa;AACX,WAAO,KAAK,GAAI,WAAW,KAAK,SAAS,CAAC;AAAA,EAC5C;AAAA,EAEA,OAAO,SAAiB;AACtB,WAAO;AAAA,EACT;AACF;;;ACjBO,IAAM,cAAN,MAAM,aAAY;AAAA,EACvB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAyC;AACzD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,qBACL,IACA,KACa;AACb,YAAQ,OAAO,IAAI,aAAY,GAAG;AAAA,MAChC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,SAAS,KAAqC;AAC5C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,QAAQ,OAAe,KAA+C;AACpE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,gBAAgB,GAAG;AAAA,MAC7B,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,gBAAwB;AACtB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AACF;;;ACtCO,IAAM,gBAAN,MAAM,eAAc;AAAA,EACzB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA2C;AAC3D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,uBACL,IACA,KACe;AACf,YAAQ,OAAO,IAAI,eAAc,GAAG;AAAA,MAClC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,OAAe,KAA6C;AAChE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,eAAe,GAAG;AAAA,MAC5B,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,eAAe,OAAe,KAA2C;AACvE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,cAAc,GAAG;AAAA,MAC3B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,uBAA+B;AAC7B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,UAAU,OAAe,KAAuC;AAC9D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,YAAY,GAAG;AAAA,MACzB,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,kBAA0B;AACxB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,QAAQ,OAAe,KAAiD;AACtE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,iBAAiB,GAAG;AAAA,MAC9B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,gBAAwB;AACtB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AACF;;;ACzFO,IAAM,YAAN,MAAgB;AAAA,EACrB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAuC;AACvD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,OAA8B;AAClC,WAAO,KAAK,GAAI,UAAU,KAAK,SAAS,IAAI,KAAK;AAAA,EACnD;AAAA,EAEA,OAAO,SAAiB;AACtB,WAAO;AAAA,EACT;AACF;;;ACbO,IAAM,eAAN,MAAM,cAAa;AAAA,EACxB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA0C;AAC1D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,sBACL,IACA,KACc;AACd,YAAQ,OAAO,IAAI,cAAa,GAAG;AAAA,MACjC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,GAAG,KAAmC;AACpC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,UAAU,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC9D;AAAA,EACN;AAAA,EAIA,KAAK,kBAAoD;AACvD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,SAAS,OAA8B;AACrC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,iBAAyB;AACvB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,gBAAmC;AACjC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,eAAyB;AACvB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM;AAAA,EACzD;AAAA,EAEA,SAAS,KAAsB;AAC7B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,QAAQ,KAAK,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;ACvFO,IAAM,WAAN,MAAM,UAAS;AAAA,EACpB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAsC;AACtD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,kBACL,IACA,KACU;AACV,YAAQ,OAAO,IAAI,UAAS,GAAG;AAAA,MAC7B,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,GAAG,KAAqC;AACtC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,SAAS,KAAqC;AAC5C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,MAAM,OAAe,KAAyC;AAC5D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,aAAa,GAAG;AAAA,MAC1B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,YAAoB;AAClB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAIA,QAAQ,kBAAoD;AAC1D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,SAAS,OAAe,KAAyC;AAC/D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,aAAa,GAAG;AAAA,MAC1B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,iBAAyB;AACvB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cACE,OACA,KACyB;AACzB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,iBAAiB,GAAG;AAAA,MAC9B,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,gBACE,OACA,KAC2B;AAC3B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,mBAAmB,GAAG;AAAA,MAChC,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,wBAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;AX5HA,SAAS,SAAS,IAAgB,OAA2B;AAC3D,SAAO,GAAG,MAAM,EAAE,MAAM,OAAO,QAAQ,EAAE;AAC3C;AAGA,SAAS,QAAQ,IAAgB,OAA2B;AAC1D,SAAO,GAAG,MAAM,EAAE,MAAM,OAAO,QAAQ,CAAC;AAC1C;AAGO,SAAS,cAAc,MAA4B;AACxD,QAAM,KAAK,IAAIC,YAAW,IAAI;AAC9B,QAAM,cAAc,SAAY,kBAAkB,EAAE;AAGpD,QAAM,QAAQ,YAAY,GAAG;AAC7B,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,oCAAoC;AAChE,QAAM,KAAK,aAAa,SAAS,MAAM,IAAK,MAAM,MAAM,CAAC;AAGzD,QAAM,cAAc,YAAY,SAAS;AACzC,QAAM,WAAW,cACb,aAAa,SAAS,YAAY,IAAK,YAAY,MAAM,CAAC,IAC1D;AAGJ,QAAM,cAAc,YAAY,YAAY;AAC5C,QAAM,QAAwB,CAAC;AAC/B,WAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,UAAM,UAAU,YAAY,MAAM,CAAC;AACnC,QAAI,SAAS;AACX,YAAM,KAAK,kBAAkB,OAAO,CAAC;AAAA,IACvC;AAAA,EACF;AAGA,QAAM,YAAY,YAAY,UAAU;AAGxC,QAAM,UAAU,YAAY,QAAQ,KAAK;AAGzC,QAAM,iBAAiB,YAAY,eAAe;AAClD,QAAM,WAA2B,CAAC;AAClC,WAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,UAAM,UAAU,YAAY,SAAS,CAAC;AACtC,QAAI,SAAS;AACX,YAAM,OAAO,QAAQ,KAAK;AAC1B,YAAM,QAAQ,QAAQ,WAAW;AACjC,UAAI,QAAQ,OAAO;AACjB,iBAAS,KAAK,EAAE,MAAM,OAAO,IAAI,WAAW,KAAK,EAAE,CAAC;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAGA,QAAM,gBAAoC,CAAC;AAC3C,QAAM,WAAW,YAAY,sBAAsB;AACnD,MAAI,WAAW,GAAG;AAChB,aAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,YAAM,SAAS,YAAY,gBAAgB,CAAC;AAC5C,UAAI,QAAQ;AACV,cAAM,WAAW,OAAO,GAAG;AAC3B,YAAI,CAAC,SAAU,OAAM,IAAI,MAAM,+BAA+B;AAC9D,sBAAc,KAAK;AAAA,UACjB,IAAI,aAAa,SAAS,SAAS,IAAK,SAAS,MAAM,CAAC;AAAA,UACxD,WAAW,OAAO,OAAO,UAAU,CAAC;AAAA,UACpC,cAAc,OAAO,aAAa;AAAA,QACpC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,OAAO;AACL,UAAM,WAAW,YAAY,oBAAoB;AACjD,aAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,YAAM,SAAS,YAAY,cAAc,CAAC;AAC1C,UAAI,QAAQ;AACV,cAAM,WAAW,OAAO,GAAG;AAC3B,YAAI,CAAC,SAAU,OAAM,IAAI,MAAM,6BAA6B;AAC5D,sBAAc,KAAK;AAAA,UACjB,IAAI,aAAa,SAAS,SAAS,IAAK,SAAS,MAAM,CAAC;AAAA,UACxD,WAAW,OAAO,OAAO,UAAU,CAAC;AAAA,UACpC,cAAc,OAAO,aAAa;AAAA,QACpC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,kBAAkB,SAAwC;AAEjE,QAAM,QAAQ,QAAQ,GAAG;AACzB,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,wCAAwC;AACpE,QAAM,KAAK,YAAY,QAAQ,MAAM,IAAK,MAAM,MAAM,CAAC;AAGvD,QAAM,OAAO,QAAQ,KAAK,KAAK;AAG/B,QAAM,WAAW,QAAQ,cAAc,KAAK,IAAI,WAAW,CAAC;AAG5D,QAAM,eAAe,QAAQ,aAAa;AAC1C,QAAM,WAAW,cAAc,SAAS,YAAY;AAEpD,SAAO,EAAE,IAAI,MAAM,UAAU,SAAS;AACxC;AAEA,SAAS,cACP,SACA,WACU;AACV,MACE,8BACA,6BACA;AACA,WAAO,EAAE,MAAM,QAAQ;AAAA,EACzB;AAEA,MAAI,6BAAqC;AACvC,UAAM,YAAY,QAAQ,SAAS,IAAI,cAAiB,CAAC;AACzD,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MAAM,uCAAuC;AAAA,IACzD;AACA,WAAO,mBAAmB,SAA6B;AAAA,EACzD;AAEA,QAAM,IAAI,MAAM,iCAAiC,SAAS,EAAE;AAC9D;AAEA,SAAS,mBAAmB,UAA2C;AAErE,QAAM,QAA0B,CAAC;AACjC,QAAM,gBAAgB,SAAS,cAAc;AAC7C,MAAI,gBAAgB,GAAG;AACrB,aAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,YAAM,WAAW,SAAS,QAAQ,CAAC;AACnC,UAAI,UAAU;AACZ,cAAM,cAAc,OAAO,SAAS,YAAY,CAAC;AACjD,cAAM,YAAY,SAAS,UAAU;AACrC,cAAM,KAAK;AAAA,UACT;AAAA,UACA,aAAa,YAAY,IAAI,KAAK,KAAK,cAAc,SAAS,IAAI;AAAA,UAClE;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,OAAO;AACL,UAAM,cAAc,SAAS,YAAY;AACzC,aAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,YAAM,WAAW,SAAS,MAAM,CAAC;AACjC,UAAI,UAAU;AACZ,cAAM,KAAK;AAAA,UACT,aAAa,OAAO,SAAS,YAAY,CAAC;AAAA,UAC1C,aAAa,OAAO,SAAS,YAAY,CAAC;AAAA,QAC5C,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAGA,QAAM,iBAAiB,SAAS,qBAAqB;AACrD,QAAM,iBAAoC,CAAC;AAC3C,WAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,UAAM,aAAa,SAAS,eAAe,CAAC;AAC5C,QAAI,YAAY;AACd,qBAAe,KAAK,WAAW,KAAK,CAAC;AAAA,IACvC,OAAO;AACL,qBAAe,KAAK,IAAI;AAAA,IAC1B;AAAA,EACF;AAGA,QAAM,kBAAkB,SAAS,gBAAgB;AACjD,QAAM,YAA2B,CAAC;AAClC,WAAS,IAAI,GAAG,IAAI,iBAAiB,KAAK;AACxC,UAAM,cAAc,SAAS,UAAU,CAAC;AACxC,QAAI,aAAa;AACf,gBAAU,KAAK,iBAAiB,WAAW,CAAC;AAAA,IAC9C;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,QAAqC;AAE7D,QAAM,cAAc,OAAO,SAAS;AACpC,MAAI,CAAC,YAAa,OAAM,IAAI,MAAM,+BAA+B;AACjE,QAAM,WAAW,aAAa,SAAS,YAAY,IAAK,YAAY,MAAM,CAAC;AAG3E,QAAM,gBAAgB,OAAO,cAAc;AAC3C,QAAM,UAA6B,CAAC;AACpC,WAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,UAAM,YAAY,OAAO,QAAQ,CAAC;AAClC,QAAI,WAAW;AACb,cAAQ,KAAK,EAAE,MAAM,UAAU,KAAK,GAAG,IAAI,UAAU,GAAG,EAAE,CAAC;AAAA,IAC7D;AAAA,EACF;AAEA,SAAO,EAAE,UAAU,QAAQ;AAC7B;;;AY7OA,SAAS,cAAAC,mBAAkB;;;ACApB,IAAM,WAAN,MAAM,UAAS;AAAA,EACpB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAsC;AACtD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,kBACL,IACA,KACU;AACV,YAAQ,OAAO,IAAI,UAAS,GAAG;AAAA,MAC7B,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,WAAW,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ,CAAC,IACvE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAiC;AAC/B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,OAAO,OAA8B;AACnC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAiC;AAC/B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,SAAiB;AACf,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAEA,SAAiB;AACf,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI,OAAO,GAAG;AAAA,EACxE;AAAA,EAEA,QAAQ,KAAqC;AAC3C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAIA,SAAS,kBAAoD;AAC3D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAMA,aAAa,kBAAoD;AAC/D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,uBAA+B;AAC7B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,WAAW,KAAK,SAAS,MAAM,IAAI;AAAA,EAC9D;AAAA,EAEA,mBAAmB,OAA8B;AAC/C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,2BAAmC;AACjC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,0BAA6C;AAC3C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;ACvJO,IAAM,gBAAN,MAAM,eAAc;AAAA,EACzB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA2C;AAC3D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,uBACL,IACA,KACe;AACf,YAAQ,OAAO,IAAI,eAAc,GAAG;AAAA,MAClC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,OAAO,KAAmC;AACxC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,UAAU,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC9D;AAAA,EACN;AAAA,EAEA,KAAK,OAAe,KAAiC;AACnD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,SAAS,GAAG;AAAA,MACtB,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,aAAqB;AACnB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;ACjEO,IAAM,WAAN,MAAM,UAAS;AAAA,EACpB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAsC;AACtD,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,kBACL,IACA,KACU;AACV,YAAQ,OAAO,IAAI,UAAS,GAAG;AAAA,MAC7B,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,GAAG,KAAqC;AACtC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,OAAO,OAAe,KAA2C;AAC/D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,cAAc,GAAG;AAAA,MAC3B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,mBAAmB,OAA8B;AAC/C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,2BAAmC;AACjC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,0BAA6C;AAC3C,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AAAA,EAEA,uBAA+B;AAC7B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM,IAAI;AAAA,EAC7D;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;AH9EA,IAAM,4BAA4B;AAIlC,IAAM,iCAAiC;AAiBvC,SAAS,mBAAmB,OAA2B;AAErD,MACE,MAAM,SAAS,KACf,MAAM,CAAC,MAAM,MACb,MAAM,CAAC,MAAM,OACb,MAAM,CAAC,MAAM,MACb,MAAM,CAAC,MAAM,KACb;AACA,WAAO;AAAA,EACT;AACA,QAAM,MAAM,MAAM,CAAC;AACnB,QAAM,gBAAiB,OAAO,IAAK;AACnC,QAAM,kBAAmB,OAAO,IAAK;AACrC,QAAM,aAAa,MAAM;AACzB,QAAM,kBAAkB,OAAO;AAE/B,MAAI,MAAM;AACV,MAAI,aAAa;AACjB,MAAI,CAAC,eAAe;AAClB,QAAI,OAAO,MAAM,OAAQ,QAAO;AAChC,UAAM,KAAK,MAAM,KAAK;AAItB,UAAM,OAAO,MAAM,MAAM,MAAM;AAC/B,iBAAa,OAAQ,OAAO,KAAM,KAAK;AAAA,EACzC;AACA,SAAO,eAAe,IAAI,IAAI;AAG9B,QAAM,WAAW,kBAAkB,KAAK,kBAAkB;AAC1D,MAAI,cAAc;AAClB,MAAI,UAAU;AACZ,QAAI,MAAM,WAAW,MAAM,OAAQ,QAAO;AAC1C,aAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,qBAAe,MAAM,MAAM,CAAC,IAAI,MAAM,IAAI;AAAA,IAC5C;AACA,QAAI,oBAAoB,EAAG,gBAAe;AAC1C,QAAI,cAAe,cAAa;AAAA,EAClC;AACA,SAAO;AAaP,MAAI,cAAc;AAClB,aAAS;AACP,QAAI,MAAM,IAAI,MAAM,OAAQ,QAAO;AACnC,UAAM,cACJ,MAAM,GAAG,IAAK,MAAM,MAAM,CAAC,KAAK,IAAM,MAAM,MAAM,CAAC,KAAK;AAC1D,WAAO;AACP,UAAM,YAAY,cAAc;AAChC,UAAM,YAAa,eAAe,IAAK;AACvC,UAAM,YAAY,eAAe;AACjC,QAAI,cAAc,EAAG,QAAO;AAC5B,QAAI,cAAc,GAAG;AAEnB,qBAAe;AACf,aAAO;AAAA,IACT,OAAO;AAGL,qBAAe,cAAc,IAAI,YAAY,KAAK,IAAI,YAAY,MAAM;AACxE,aAAO;AAAA,IACT;AACA,QAAI,MAAM,MAAM,OAAQ,QAAO;AAC/B,QAAI,UAAW;AAAA,EACjB;AACA,MAAI,gBAAiB,QAAO;AAC5B,MAAI,QAAQ,MAAM,OAAQ,QAAO;AAIjC,SAAO,KAAK,IAAI,eAAe,YAAY,WAAW;AACxD;AAUO,SAAS,cAAc,MAA4B;AACxD,QAAM,KAAK,IAAIC,YAAW,IAAI;AAC9B,QAAM,cAAc,SAAY,kBAAkB,EAAE;AAGpD,QAAM,QAAQ,YAAY,GAAG;AAC7B,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,oCAAoC;AAChE,QAAM,KAAK;AAAA,IACT,MAAM,GAAI,MAAM,EAAE,MAAM,MAAM,QAAQ,MAAM,SAAS,EAAE;AAAA,EACzD;AAGA,QAAM,iBAAiB,oBAAoB,WAAW;AAItD,QAAM,eAAe,YAAY,aAAa;AAC9C,QAAM,SAA0B,CAAC;AACjC,WAAS,IAAI,GAAG,IAAI,cAAc,KAAK;AACrC,UAAM,WAAW,YAAY,OAAO,CAAC;AACrC,QAAI,UAAU;AACZ,aAAO,KAAK,kBAAkB,UAAU,cAAc,CAAC;AAAA,IACzD;AAAA,EACF;AAEA,SAAO,EAAE,IAAI,OAAO;AACtB;AAkBA,SAAS,oBAAoB,aAA2C;AACtE,QAAM,aACJ,YAAY,qBAAqB,MAAM,4BACnC,YAAY,wBAAwB,IACpC;AAEN,QAAM,cAAc,IAAI,YAAY,SAAS,EAAE,OAAO,KAAK,CAAC;AAC5D,SAAO,CAAC,eAAmC;AACzC,QAAI,CAAC,YAAY;AACf,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAIA,QAAI,mBAAmB,UAAU,IAAI,gCAAgC;AACnE,YAAM,IAAI;AAAA,QACR,4CAA4C,8BAA8B;AAAA,MAC5E;AAAA,IACF;AACA,UAAM,eAAe,WAAW,YAAY,QAAW,UAAU;AACjE,QAAI,aAAa,SAAS,gCAAgC;AACxD,YAAM,IAAI;AAAA,QACR,iCAAiC,8BAA8B;AAAA,MACjE;AAAA,IACF;AACA,WAAO,YAAY,OAAO,YAAY;AAAA,EACxC;AACF;AAGA,SAAS,kBACP,UACA,gBACe;AAEf,QAAM,YAAY,SAAS,OAAO;AAClC,MAAI,CAAC;AACH,UAAM,IAAI,MAAM,8CAA8C;AAChE,QAAM,SAAS;AAAA,IACb,UAAU,GAAI,MAAM,EAAE,MAAM,UAAU,QAAQ,UAAU,SAAS,CAAC;AAAA,EACpE;AAEA,QAAM,UAAU,SAAS,WAAW;AAGpC,QAAM,QAAQ,IAAI,SAAY;AAE9B,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,SAAS,GAAqB;AAC5B,YAAM,SAAS,SAAS,KAAK,GAAG,KAAK;AACrC,UAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,gBAAgB,CAAC,eAAe;AAC7D,YAAM,cAAc,OAAO,YAAY;AACvC,YAAM,QAAQ,IAAI,MAAc,WAAW;AAC3C,eAAS,IAAI,GAAG,IAAI,aAAa,IAAK,OAAM,CAAC,IAAI,OAAO,MAAM,CAAC;AAC/D,aAAO;AAAA,IACT;AAAA,IACA,MAAM,GAAqB;AACzB,YAAM,SAAS,SAAS,KAAK,CAAC;AAC9B,UAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,gBAAgB,CAAC,eAAe;AAC7D,aAAO,cAAc,QAAQ,cAAc;AAAA,IAC7C;AAAA,EACF;AACF;AAEA,SAAS,cACP,QACA,gBACU;AAEV,QAAM,cAAc,OAAO,YAAY;AACvC,QAAM,QAAkB,CAAC;AACzB,WAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,UAAM,KAAK,OAAO,MAAM,CAAC,CAAE;AAAA,EAC7B;AAGA,QAAM,aAAa,OAAO,YAAY;AACtC,QAAM,SAAS,aAAa,IAAI,WAAW,UAAU,IAAI;AAGzD,QAAM,SAAS,OAAO,OAAO,OAAO,CAAC;AACrC,QAAM,SAAS,OAAO,OAAO,OAAO,CAAC;AAGrC,QAAM,aAAa,OAAO,QAAQ;AAClC,QAAM,UAAU,aACZ;AAAA,IACE,WAAW,GAAI,MAAM,EAAE,MAAM,WAAW,QAAQ,WAAW,SAAS,EAAE;AAAA,EACxE,IACA;AAGJ,QAAM,eAAe,OAAO,aAAa;AACzC,QAAM,uBAAuB,OAAO,qBAAqB;AAEzD,QAAM,MAAgB;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,OAAO,SAAS;AAAA,IAC1B;AAAA,IACA;AAAA,EACF;AAUA,MAAI,YAAY,MAAM;AACpB,UAAM,aAAa,OAAO,wBAAwB;AAClD,QAAI,YAAY;AACd,UAAI,UAAyB;AAC7B,UAAI,WAAW;AACf,aAAO,eAAe,KAAK,YAAY;AAAA,QACrC,cAAc;AAAA,QACd,YAAY;AAAA,QACZ,MAAM;AACJ,cAAI,CAAC,UAAU;AACb,sBAAU,eAAe,UAAU;AACnC,uBAAW;AAAA,UACb;AACA,iBAAO;AAAA,QACT;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAOO,SAAS,aACd,UACA,QACA,QACiB;AAEjB,QAAM,gBAAgB,0BAA0B,SAAS,QAAQ,MAAM;AAEvE,MAAI,CAAC,cAAe,QAAO;AAG3B,SAAO,qBAAqB,eAAe,MAAM;AACnD;AAGA,SAAS,0BACP,QACA,QACsB;AACtB,MAAI,MAAM;AACV,MAAI,OAAO,OAAO,SAAS;AAE3B,SAAO,OAAO,MAAM;AAClB,UAAM,MAAM,KAAK,OAAO,MAAM,QAAQ,CAAC;AACvC,UAAM,MAAM,aAAa,OAAO,GAAG,EAAE,QAAQ,MAAM;AAEnD,QAAI,QAAQ,GAAG;AACb,aAAO,OAAO,GAAG;AAAA,IACnB,WAAW,MAAM,GAAG;AAClB,YAAM,MAAM;AAAA,IACd,OAAO;AACL,aAAO,MAAM;AAAA,IACf;AAAA,EACF;AAEA,SAAO;AACT;AAGA,SAAS,aAAa,GAAe,GAAuB;AAC1D,QAAM,SAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AAC1C,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,EAAE,CAAC,MAAM,EAAE,CAAC,EAAG,QAAO,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,EACtC;AACA,SAAO,EAAE,SAAS,EAAE;AACtB;AAGA,SAAS,cAAc,GAAa,GAAqB;AACvD,QAAM,SAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AAC1C,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,EAAE,CAAC,MAAM,EAAE,CAAC,EAAG,QAAO,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,EACtC;AACA,SAAO,EAAE,SAAS,EAAE;AACtB;AAGA,SAAS,qBACP,OACA,QACiB;AACjB,MAAI,MAAM;AACV,MAAI,OAAO,MAAM,UAAU;AAE3B,SAAO,OAAO,MAAM;AAClB,UAAM,MAAM,KAAK,OAAO,MAAM,QAAQ,CAAC;AACvC,UAAM,MAAM,cAAc,MAAM,SAAS,GAAG,GAAG,MAAM;AAErD,QAAI,QAAQ,GAAG;AACb,aAAO,MAAM,MAAM,GAAG;AAAA,IACxB,WAAW,MAAM,GAAG;AAClB,YAAM,MAAM;AAAA,IACd,OAAO;AACL,aAAO,MAAM;AAAA,IACf;AAAA,EACF;AAEA,SAAO;AACT;AASO,SAAS,gBAAgB,KAA6B;AAC3D,MAAI,IAAI,YAAY,MAAM;AACxB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,SAAS,IAAI;AAAA,MACb,QAAQ,IAAI;AAAA,MACZ,QAAQ,IAAI;AAAA,IACd;AAAA,EACF;AAEA,MAAI,IAAI,aAAa,MAAM;AACzB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,UAAU,IAAI;AAAA,MACd,QAAQ,IAAI;AAAA,MACZ,QAAQ,IAAI;AAAA,MACZ,cAAc,IAAI;AAAA,MAClB,sBAAsB,IAAI;AAAA,IAC5B;AAAA,EACF;AAEA,MAAI,IAAI,WAAW,MAAM;AACvB,WAAO,EAAE,MAAM,UAAU,MAAM,IAAI,OAAO;AAAA,EAC5C;AAEA,QAAM,IAAI,MAAM,mDAAmD;AACrE;;;AIhbA,SAAS,cAAc;AACvB,YAAYC,kBAAiB;AAWtB,SAAS,oBACd,OACA,aACyB;AACzB,QAAM,SAAkC,uBAAO,OAAO,IAAI;AAC1D,aAAW,QAAQ,OAAO;AACxB,WAAO,KAAK,IAAI,IACd,+BACI,OAAO,KAAK,KAAK,IACL;AAAA,MACV,KAAK,MAAM,OAAO;AAAA,QAChB,KAAK,MAAM;AAAA,QACX,KAAK,MAAM,aAAa,KAAK,MAAM;AAAA,MACrC;AAAA,IACF;AAAA,EACR;AACA,SAAO;AACT;;;AC7BA,SAAS,cAAAC,mBAAkB;;;ACFpB,IAAM,eAAN,MAAM,cAAa;AAAA,EACxB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA0C;AAC1D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,sBACL,IACA,KACc;AACd,YAAQ,OAAO,IAAI,cAAa,GAAG;AAAA,MACjC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,OAAO,OAA8B;AACnC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,WAAW,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ,CAAC,IACvE;AAAA,EACN;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAkC;AAChC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;ACtCO,IAAM,qBAAN,MAAM,oBAAmB;AAAA,EAC9B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAAgD;AAChE,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,4BACL,IACA,KACoB;AACpB,YAAQ,OAAO,IAAI,oBAAmB,GAAG;AAAA,MACvC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,OAAO,KAAmC;AACxC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,UAAU,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC9D;AAAA,EACN;AAAA,EAEA,OAAO,OAAe,KAAyC;AAC7D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,aAAa,GAAG;AAAA,MAC1B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,eAAuB;AACrB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AACF;;;AC1CO,IAAM,gBAAN,MAAM,eAAc;AAAA,EACzB,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA2C;AAC3D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,uBACL,IACA,KACe;AACf,YAAQ,OAAO,IAAI,eAAc,GAAG;AAAA,MAClC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAIA,KAAK,kBAAoD;AACvD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAIA,GAAG,kBAAoD;AACrD,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SACH,KAAK,GAAI,SAAS,KAAK,SAAS,QAAQ,gBAAgB,IACxD;AAAA,EACN;AAAA,EAEA,OAAO,KAAmC;AACxC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,UAAU,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC9D;AAAA,EACN;AAAA,EAEA,WAAqB;AACnB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,UAAU,KAAK,SAAS,MAAM;AAAA,EACzD;AACF;;;AC9CO,IAAM,iBAAN,MAAM,gBAAe;AAAA,EAC1B,KAAoC;AAAA,EACpC,SAAS;AAAA,EACT,OAAO,GAAW,IAA4C;AAC5D,SAAK,SAAS;AACd,SAAK,KAAK;AACV,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,wBACL,IACA,KACgB;AAChB,YAAQ,OAAO,IAAI,gBAAe,GAAG;AAAA,MACnC,GAAG,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,GAAG,KAAqC;AACtC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,KAAK,EAAG,IAC/D;AAAA,EACN;AAAA,EAEA,UAAU,OAAe,KAAmC;AAC1D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,UAAU,GAAG;AAAA,MACvB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,kBAA0B;AACxB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,UAAU,OAAe,KAAmC;AAC1D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,UACF,OAAO,IAAI,UAAU,GAAG;AAAA,MACvB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,kBAA0B;AACxB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,CAAC;AAC/C,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAc,OAAe,KAAmC;AAC9D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,UAAU,GAAG;AAAA,MACvB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAc,OAAe,KAAmC;AAC9D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,UAAU,GAAG;AAAA,MACvB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAc,OAAe,KAAmC;AAC9D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,UAAU,GAAG;AAAA,MACvB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cAAc,OAAe,KAAmC;AAC9D,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,UAAU,GAAG;AAAA,MACvB,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MAClD,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,cACE,OACA,KAC2B;AAC3B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,mBAAmB,GAAG;AAAA,MAChC,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,sBAA8B;AAC5B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,WAAW,OAAe,KAA2C;AACnE,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,UACF,OAAO,IAAI,cAAc,GAAG;AAAA,MAC3B,KAAK,GAAI;AAAA,QACP,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,QAAQ;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,IACP,IACA;AAAA,EACN;AAAA,EAEA,mBAA2B;AACzB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,MAAM,OAA8B;AAClC,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,KAAK,GAAI,UAAU,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM,IAAI,KAAK,IAClE;AAAA,EACN;AAAA,EAEA,cAAsB;AACpB,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SAAS,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM,IAAI;AAAA,EAChE;AAAA,EAEA,aAAgC;AAC9B,UAAM,SAAS,KAAK,GAAI,SAAS,KAAK,QAAQ,EAAE;AAChD,WAAO,SACH,IAAI;AAAA,MACF,KAAK,GAAI,MAAM,EAAE;AAAA,MACjB,KAAK,GAAI,MAAM,EAAE,aAAa,KAAK,GAAI,SAAS,KAAK,SAAS,MAAM;AAAA,MACpE,KAAK,GAAI,aAAa,KAAK,SAAS,MAAM;AAAA,IAC5C,IACA;AAAA,EACN;AACF;;;AJrKA,SAASC,UAAS,IAAgB,OAA2B;AAC3D,SAAO,GAAG,MAAM,EAAE,MAAM,OAAO,QAAQ,EAAE;AAC3C;AAGA,SAASC,SAAQ,IAAgB,OAA2B;AAC1D,SAAO,GAAG,MAAM,EAAE,MAAM,OAAO,QAAQ,CAAC;AAC1C;AAGA,SAAS,cACP,QACA,UACa;AACb,QAAM,SAAsB,CAAC;AAC7B,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAM,MAAM,SAAS,CAAC;AACtB,QAAI,OAAO,IAAI,IAAI;AACjB,aAAO,KAAK,YAAYA,SAAQ,IAAI,IAAI,IAAI,MAAM,CAAC,CAAC;AAAA,IACtD;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,oBAAoB,MAAuC;AACzE,QAAM,KAAK,IAAIC,YAAW,IAAI;AAC9B,QAAM,MAAM,eAAkB,wBAAwB,EAAE;AAGxD,QAAM,QAAQ,IAAI,GAAG;AACrB,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,0CAA0C;AACtE,QAAM,KAAK,aAAaF,UAAS,MAAM,IAAK,MAAM,MAAM,CAAC;AAGzD,QAAM,YAAY;AAAA,IAAc,IAAI,gBAAgB;AAAA,IAAG,CAAC,MACtD,IAAI,UAAU,CAAC;AAAA,EACjB;AACA,QAAM,YAAY;AAAA,IAAc,IAAI,gBAAgB;AAAA,IAAG,CAAC,MACtD,IAAI,UAAU,CAAC;AAAA,EACjB;AACA,QAAM,gBAAgB;AAAA,IAAc,IAAI,oBAAoB;AAAA,IAAG,CAAC,MAC9D,IAAI,cAAc,CAAC;AAAA,EACrB;AACA,QAAM,gBAAgB;AAAA,IAAc,IAAI,oBAAoB;AAAA,IAAG,CAAC,MAC9D,IAAI,cAAc,CAAC;AAAA,EACrB;AACA,QAAM,gBAAgB;AAAA,IAAc,IAAI,oBAAoB;AAAA,IAAG,CAAC,MAC9D,IAAI,cAAc,CAAC;AAAA,EACrB;AACA,QAAM,gBAAgB;AAAA,IAAc,IAAI,oBAAoB;AAAA,IAAG,CAAC,MAC9D,IAAI,cAAc,CAAC;AAAA,EACrB;AAGA,QAAM,gBAA0C,CAAC;AACjD,WAAS,IAAI,GAAG,IAAI,IAAI,oBAAoB,GAAG,KAAK;AAClD,UAAM,WAAW,IAAI,cAAc,CAAC;AACpC,QAAI,CAAC,SAAU;AAEf,UAAM,YAAY,SAAS,OAAO;AAClC,QAAI,CAAC,aAAa,CAAC,UAAU,GAAI;AACjC,UAAM,SAAS,YAAYC,SAAQ,UAAU,IAAI,UAAU,MAAM,CAAC;AAElE,UAAM,SAAgC,CAAC;AACvC,aAAS,IAAI,GAAG,IAAI,SAAS,aAAa,GAAG,KAAK;AAChD,YAAM,aAAa,SAAS,OAAO,CAAC;AACpC,UAAI,CAAC,WAAY;AAEjB,YAAM,SAAmB,CAAC;AAC1B,eAAS,IAAI,GAAG,IAAI,WAAW,aAAa,GAAG,KAAK;AAClD,cAAM,QAAQ,WAAW,OAAO,CAAC;AACjC,YAAI,UAAU,KAAM,QAAO,KAAK,KAAK;AAAA,MACvC;AACA,aAAO,KAAK,EAAE,OAAO,CAAC;AAAA,IACxB;AAEA,kBAAc,KAAK,EAAE,QAAQ,OAAO,CAAC;AAAA,EACvC;AAGA,QAAM,aAAkC,CAAC;AACzC,WAAS,IAAI,GAAG,IAAI,IAAI,iBAAiB,GAAG,KAAK;AAC/C,UAAM,UAAU,IAAI,WAAW,CAAC;AAChC,QAAI,CAAC,QAAS;AAEd,UAAM,OAAO,QAAQ,KAAK;AAC1B,UAAM,KAAK,QAAQ,GAAG;AACtB,QAAI,SAAS,QAAQ,OAAO,MAAM;AAChC,iBAAW,KAAK,EAAE,MAAM,GAAG,CAAC;AAAA,IAC9B;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AKrEA,SAAS,oBAAoB,OAA2B;AACtD,SAAO,kBAAkB,QAAQ,MAAM,eAAe,MAAM;AAC9D;AASA,SAAS,sBAAsB,KAAa,UAAmC;AAC7E,MAAI,SAAS,WAAW,OAAO,SAAS,WAAW,IAAK,QAAO;AAC/D,QAAM,SAAS,SAAS,QAAQ,IAAI,qBAAqB;AACzD,MAAI,CAAC,OAAQ,QAAO;AACpB,QAAM,eAAe;AACrB,MAAI,CAAC,IAAI,WAAW,YAAY,EAAG,QAAO;AAC1C,SAAO,cAAc,MAAM,kBAAkB,IAAI,MAAM,aAAa,MAAM,CAAC;AAC7E;AAQO,SAAS,aAAa,MAA0C;AACrE,QAAM,EAAE,aAAa,mBAAmB,IAAI;AAI5C,MAAI,YAAY,KAAK;AAErB,iBAAe,QAAQ,QAAgB,MAAsC;AAC3E,WAAO,cACH,MAAM,YAAY,MAAM,QAAQ,IAAI,IACpC,MAAM,MAAM,QAAQ,IAAI;AAAA,EAC9B;AAEA,SAAO;AAAA,IACL,MAAM,MAAM;AACV,YAAM,IAAI;AAAA,QACR,+BAA+B,SAAS;AAAA,MAC1C;AAAA,IACF;AAAA,IACA,MAAM,SAAS,MAAM,OAAO,SAAS;AACnC,YAAM,UAAkC,qBACpC,EAAE,GAAG,mBAAmB,IACxB,CAAC;AACL,cAAQ,QACN,kBAAkB,QACd,UAAU,MAAM,YAAY,KAC5B,SAAS,MAAM,MAAM,IAAI,MAAM,SAAS,MAAM,SAAS,CAAC;AAI9D,UAAI,aAAa;AACjB,UAAI,WAAW,MAAM,QAAQ,YAAY;AAAA,QACvC;AAAA,QACA,QAAQ,SAAS;AAAA,MACnB,CAAC;AAID,YAAM,cAAc,sBAAsB,YAAY,QAAQ;AAC9D,UAAI,aAAa;AAEf,iBAAS,MAAM,OAAO,EAAE,MAAM,MAAM;AAAA,QAAC,CAAC;AACtC,qBAAa;AACb,oBAAY;AACZ,mBAAW,MAAM,QAAQ,YAAY;AAAA,UACnC;AAAA,UACA,QAAQ,SAAS;AAAA,QACnB,CAAC;AAAA,MACH;AAEA,UAAI,SAAS,WAAW,KAAK;AAC3B,cAAM,IAAI;AAAA,UACR,oBAAoB,UAAU;AAAA,QAChC;AAAA,MACF;AACA,UAAI,SAAS,WAAW,OAAO,SAAS,WAAW,KAAK;AACtD,cAAM,IAAI;AAAA,UACR,sCAAsC,UAAU,KAAK,SAAS,MAAM,IAAI,SAAS,UAAU;AAAA,QAC7F;AAAA,MACF;AAEA,YAAM,OAAO,IAAI,WAAW,MAAM,SAAS,YAAY,CAAC;AAKxD,UAAI,SAAS,WAAW,KAAK;AAC3B,cAAM,WAAW,oBAAoB,KAAK;AAC1C,YAAI,KAAK,WAAW,SAAU,QAAO;AACrC,cAAM,IAAI;AAAA,UACR,4CAA4C,UAAU,cAAc,QAAQ,eAAe,KAAK,MAAM;AAAA,QACxG;AAAA,MACF;AAKA,UAAI,YAAY,OAAO;AACrB,cAAM,MAAM,MAAM,SAAS,MAAM;AACjC,YAAI,KAAK,UAAU,IAAK,QAAO,KAAK,MAAM,MAAM,QAAQ,GAAG;AAC3D,cAAM,IAAI;AAAA,UACR,yCAAyC,UAAU,mBAAmB,GAAG,oCAAoC,KAAK,MAAM;AAAA,QAC1H;AAAA,MACF;AAEA,UAAI,KAAK,UAAU,MAAM,cAAc;AACrC,eAAO,KAAK,MAAM,KAAK,SAAS,MAAM,YAAY;AAAA,MACpD;AACA,YAAM,IAAI;AAAA,QACR,gDAAgD,UAAU,mBAAmB,MAAM,YAAY,oCAAoC,KAAK,MAAM;AAAA,MAChJ;AAAA,IACF;AAAA,EACF;AACF;AASO,SAAS,iBAAiB,SAAiC;AAChE,SAAO;AAAA,IACL,MAAM,IAAI,KAAK,SAAS;AACtB,YAAM,iBAAiB,SAAS,SAC5B,EAAE,QAAQ,QAAQ,OAAO,IACzB;AACJ,aAAO,QAAQ,UAAU,KAAK,QAAW,cAAc;AAAA,IACzD;AAAA,IACA,MAAM,SAAS,KAAK,OAAO,SAAS;AAClC,YAAM,iBAAiB,SAAS,SAC5B,EAAE,QAAQ,QAAQ,OAAO,IACzB;AACJ,UAAI,kBAAkB,OAAO;AAC3B,cAAM,IAAI;AAAA,UACR,+CAA+C,GAAG;AAAA,QACpD;AAAA,MACF;AAEA,YAAM,eAAe;AAAA,QACnB,OAAO,MAAM;AAAA,QACb,KAAK,MAAM,SAAS,MAAM;AAAA,MAC5B;AACA,YAAM,OAAO,MAAM,QAAQ,UAAU,KAAK,cAAc,cAAc;AACtE,UAAI,KAAK,WAAW,MAAM,OAAQ,QAAO;AAIzC,UAAI,KAAK,UAAU,aAAa,KAAK;AACnC,eAAO,KAAK,MAAM,aAAa,OAAO,aAAa,GAAG;AAAA,MACxD;AAEA,YAAM,IAAI;AAAA,QACR,oBAAoB,KAAK,MAAM,cAAc,GAAG,UAAU,aAAa,KAAK,IAAI,aAAa,MAAM,CAAC,cAAc,MAAM,MAAM;AAAA,MAChI;AAAA,IACF;AAAA,EACF;AACF;;;ACpKA,IAAM,sBAAsB,KAAK;AAKjC,IAAM,yBAAyB;AAG/B,SAAS,uBAAuB,OAA6C;AAC3E,SAAO,KAAK,UAAU,KAAK;AAC7B;AAsBO,IAAM,cAAN,MAAM,aAAY;AAAA,EACf;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA;AAAA,EACA;AAAA,EACA;AAAA,EACA,oBAAoB;AAAA,EACpB;AAAA,EACA,uBAAuB;AAAA;AAAA,EAEvB;AAAA,EAEA,YACN,SACA,UACA,aACA,uBAA+B,KAC/B,wBACA;AACA,SAAK,UAAU;AACf,SAAK,WAAW;AAChB,SAAK,cAAc;AACnB,SAAK,gBAAgB,IAAI,SAAS,oBAAoB;AACtD,SAAK,iBAAiB,aAAa,KAAK,aAAa;AACrD,SAAK,yBAAyB,0BAA0B,CAAC;AAAA,EAC3D;AAAA,EAEQ,kBAAkB,aAA8C;AACtE,QAAI,CAAC,YAAa,QAAO;AACzB,QAAI,CAAC,KAAK,eAAgB,MAAK,iBAAiB,oBAAI,QAAQ;AAE5D,QAAI,KAAK,KAAK,eAAe,IAAI,WAAW;AAC5C,QAAI,OAAO,QAAW;AACpB,WAAK,KAAK;AACV,WAAK,oBAAoB,KAAK;AAC9B,WAAK,eAAe,IAAI,aAAa,EAAE;AAAA,IACzC;AACA,WAAO,OAAO,EAAE;AAAA,EAClB;AAAA,EAEQ,qBAAqB,qBAAgD;AAC3E,QAAI,CAAC,KAAK,kBAAmB,MAAK,oBAAoB,oBAAI,QAAQ;AAElE,QAAI,KAAK,KAAK,kBAAkB,IAAI,mBAAmB;AACvD,QAAI,OAAO,QAAW;AACpB,WAAK,KAAK;AACV,WAAK,uBAAuB,KAAK;AACjC,WAAK,kBAAkB,IAAI,qBAAqB,EAAE;AAAA,IACpD;AACA,WAAO,OAAO,EAAE;AAAA,EAClB;AAAA,EAEQ,cACN,cACA,aACA,qBACwB;AACxB,QAAI,CAAC,KAAK,aAAa;AACrB,WAAK,cAAc,IAAI,SAAS,sBAAsB;AAAA,IACxD;AACA,UAAM,SAAS,KAAK;AACpB,UAAM,WAAW,uBAAuB;AAAA,MACtC,GAAG;AAAA,MACH,CAAC,aAAa,KAAK,qBAAqB,mBAAmB,CAAC;AAAA,IAC9D,CAAC;AAED,UAAM,SAAS,OAAO,IAAI,QAAQ;AAClC,QAAI,OAAQ,QAAO;AAEnB,UAAM,MAAM,YAAY;AACxB,UAAM,UAAkC,QAAQ,QAAQ,EACrD;AAAA,MAAK,MACJ,oBAAoB,KAAK,EAAE,cAAc,oBAAoB,CAAC;AAAA,IAChE,EACC,MAAM,CAAC,UAAmB;AACzB,UAAI,OAAO,IAAI,QAAQ,MAAM,QAAS,QAAO,OAAO,QAAQ;AAC5D,YAAM;AAAA,IACR,CAAC;AACH,WAAO,IAAI,UAAU,OAAO;AAC5B,WAAO;AAAA,EACT;AAAA,EAEQ,eAAe,SAA+C;AACpE,QAAI,CAAC,KAAK,aAAa;AACrB,WAAK,cAAc,iBAAiB,KAAK,OAAO;AAAA,IAClD;AACA,UAAM,MAAM,KAAK;AACjB,UAAM,sBAAsB,SAAS;AACrC,QAAI,CAAC,qBAAqB;AACxB,aAAO,QAAQ,QAAQ,GAAG;AAAA,IAC5B;AACA,WAAO,KAAK,cAAc,CAAC,QAAQ,GAAG,MAAM,KAAK,mBAAmB;AAAA,EACtE;AAAA,EAEQ,0BACN,SACA,SAIA,SACwB;AACxB,UAAM,WAAW,CAAC,CAAC,SAAS;AAC5B,QAAI;AACJ,QAAI,UAAU;AACZ,2BAAqB,CAAC;AACtB,UAAI,QAAQ,cAAc;AACxB,2BAAmB,UAAU,IAAI,QAAQ;AAAA,MAC3C;AACA,UAAI,QAAQ,uBAAuB,GAAG;AACpC,2BAAmB,qBAAqB,IAAI,IAAI;AAAA,UAC9C,QAAQ,uBAAuB;AAAA,QACjC,EAAE,YAAY;AAAA,MAChB;AAAA,IACF;AAEA,UAAM,cAAc,WAChB,CAAC,WAAW,QAAQ,gBAAgB,IAAI,QAAQ,oBAAoB,IACpE,CAAC,WAAW;AAEhB,UAAM,cAAc,MAClB,aAAa;AAAA,MACX,KAAK;AAAA,MACL,aAAa,SAAS;AAAA,MACtB;AAAA,IACF,CAAC;AAEH,UAAM,sBAAsB,SAAS;AACrC,QAAI,CAAC,qBAAqB;AACxB,aAAO,QAAQ,QAAQ,YAAY,CAAC;AAAA,IACtC;AAEA,WAAO,KAAK;AAAA,MACV;AAAA,QACE;AAAA,QACA;AAAA,QACA,CAAC,SAAS,KAAK,kBAAkB,SAAS,WAAW,CAAC;AAAA,QACtD;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,aAAa,KACX,SACA,YACA,SAIsB;AACtB,UAAM,EAAE,UAAU,YAAY,IAAI,MAAM,aAAY;AAAA,MAClD;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,WAAO,IAAI;AAAA,MACT;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AAAA,EACF;AAAA;AAAA,EAGA,aAAqB,aACnB,SACA,YACA,SAC2D;AAC3D,UAAM,OAAO,gBAAgB,iBAAiB,UAAU,CAAC;AACzD,UAAM,OAAO,MAAM,QAAQ,UAAU,MAAM,QAAW,OAAO;AAG7D,UAAM,SAAS,YAAY,IAAI;AAC/B,qBAAiB,wBAAyB;AAG1C,QAAI,iBAAiB,mBAAmB,IAAI;AAC5C,QAAI,OAAO,8BAA2C;AACpD,uBAAiB,WAAW,cAAc;AAAA,IAC5C;AAGA,WAAO;AAAA,MACL,UAAU,cAAc,cAAc;AAAA,MACtC,aAAa,OAAO;AAAA,IACtB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,aACN,YACA,SACmB;AACnB,UAAM,QAAQ,iBAAiB,UAAU;AACzC,WAAO,KAAK,eAAe;AAAA,MACzB;AAAA,MACA,CAAC,WAAW,KAAK,cAAc,OAAO,MAAM;AAAA,MAC5C,SAAS;AAAA,IACX;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAc,cACZ,OACA,QACmB;AACnB,UAAM,OAAO,gBAAgB,KAAK;AAClC,UAAM,OAAO,MAAM,KAAK,QAAQ,UAAU,MAAM,QAAW,EAAE,OAAO,CAAC;AAErE,UAAM,SAAS,YAAY,IAAI;AAC/B,qBAAiB,wBAAyB;AAE1C,QAAI,iBAAiB,mBAAmB,IAAI;AAC5C,QAAI,OAAO,8BAA2C;AACpD,uBAAiB,WAAW,cAAc;AAAA,IAC5C;AAEA,WAAO,cAAc,cAAc;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA,EAKA,gBAA4B;AAC1B,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,iBAA8B;AAC5B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,sBAAyC;AACvC,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,aAAqB;AACnB,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,eAAqB;AAEnB,WAAO,IAAI,KAAK,OAAO,KAAK,SAAS,YAAY,KAAK,CAAC;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,sBAA+C;AAC7C,WAAO,oBAAoB,KAAK,SAAS,UAAU,KAAK,WAAW;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,mBACJ,SACqC;AACrC,UAAM,OAAO,sBAAsB,iBAAiB,KAAK,SAAS,EAAE,CAAC;AAErE,QAAI;AACJ,QAAI;AACF,aAAO,MAAM,KAAK,QAAQ,UAAU,MAAM,QAAW,OAAO;AAAA,IAC9D,SAAS,OAAO;AACd,UAAI,iBAAiB,cAAe,QAAO;AAC3C,YAAM;AAAA,IACR;AAEA,UAAM,SAAS,YAAY,IAAI;AAC/B,qBAAiB,8BAA+B;AAEhD,QAAI,iBAAiB,mBAAmB,IAAI;AAC5C,QAAI,OAAO,8BAA2C;AACpD,uBAAiB,WAAW,cAAc;AAAA,IAC5C;AAEA,WAAO,oBAAoB,cAAc;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAQ,MAAmC;AAEzC,UAAM,iBAAiB,KAAK,WAAW,GAAG,IAAI,OAAO,IAAI,IAAI;AAG7D,WAAO,KAAK,iBAAiB,cAAc;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAA4B;AAC1B,WAAO,CAAC,GAAG,KAAK,SAAS,KAAK;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,aAAa,YAAoC;AAC/C,UAAM,mBAAmB,eAAe,MAAM,KAAK;AACnD,UAAM,SAAS,mBAAmB;AAElC,WAAO,KAAK,SAAS,MAAM,OAAO,CAAC,SAAS;AAC1C,UAAI,CAAC,KAAK,KAAK,WAAW,MAAM,EAAG,QAAO;AAE1C,YAAM,OAAO,KAAK,KAAK,MAAM,OAAO,MAAM;AAC1C,aAAO,CAAC,KAAK,SAAS,GAAG;AAAA,IAC3B,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,YAAY,MAA8B;AACxC,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,QAAI,CAAC,KAAM,QAAO;AAElB,UAAM,OAAO,IAAI,YAAY,EAAE,OAAO,KAAK,QAAQ;AACnD,WAAO,KAAK,MAAM,IAAI;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,eAAe,MAAiC;AAC9C,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,QAAI,CAAC,KAAM,QAAO;AAClB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,SACJ,MACA,QACA,SAC4B;AAC5B,aAAS,QAAQ,eAAe;AAChC,UAAM,iBAAiB,iBAAiB,OAAO;AAE/C,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,QAAI,CAAC,QAAQ,KAAK,SAAS,SAAS,SAAS;AAC3C,aAAO;AAAA,IACT;AAGA,UAAM,YAAY,KAAK;AAEvB,eAAW,eAAe,UAAU,WAAW;AAE7C,UAAI,CAAC,KAAK,gBAAgB,QAAQ,YAAY,OAAO,GAAG;AACtD;AAAA,MACF;AAGA,YAAM,WAAW,MAAM,KAAK;AAAA,QAC1B,YAAY;AAAA,QACZ;AAAA,MACF;AAGA,YAAM,WAAW,aAAa,UAAU,KAAK,IAAI,MAAM;AACvD,UAAI,CAAC,SAAU;AAGf,YAAM,UAAU,gBAAgB,QAAQ;AACxC,aAAO,KAAK,kBAAkB,SAAS,OAAO;AAAA,IAChD;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,MAAM,cACJ,MACA,QACA,OACA,SAC4B;AAC5B,aAAS,QAAQ,eAAe;AAChC,UAAM,iBAAiB,iBAAiB,OAAO;AAE/C,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,QAAI,CAAC,QAAQ,KAAK,SAAS,SAAS,SAAS;AAC3C,aAAO;AAAA,IACT;AAEA,UAAM,YAAY,KAAK;AAEvB,eAAW,eAAe,UAAU,WAAW;AAC7C,UAAI,CAAC,KAAK,gBAAgB,QAAQ,YAAY,OAAO,GAAG;AACtD;AAAA,MACF;AAEA,YAAM,WAAW,MAAM,KAAK;AAAA,QAC1B,YAAY;AAAA,QACZ;AAAA,MACF;AACA,YAAM,WAAW,aAAa,UAAU,KAAK,IAAI,MAAM;AACvD,UAAI,CAAC,SAAU;AAEf,YAAM,UAAU,gBAAgB,QAAQ;AACxC,aAAO,KAAK,uBAAuB,SAAS,OAAO,OAAO;AAAA,IAC5D;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAGQ,gBACN,QACA,SACS;AACT,QAAI,OAAO,WAAW,QAAQ,OAAQ,QAAO;AAE7C,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,YAAM,EAAE,MAAM,GAAG,IAAI,QAAQ,CAAC;AAC9B,UAAI,OAAO,CAAC,IAAI,QAAQ,OAAO,CAAC,KAAK,IAAI;AACvC,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAc,kBACZ,SACA,SACqB;AACrB,YAAQ,QAAQ,MAAM;AAAA,MACpB,KAAK;AACH,eAAO,QAAQ;AAAA,MAEjB,KAAK,UAAU;AACb,cAAM,OAAO,aAAa,iBAAiB,QAAQ,OAAO,CAAC;AAC3D,cAAM,iBAAiB,QAAQ;AAC/B,cAAM,eAAe,QAAQ,SAAS,QAAQ;AAC9C,cAAM,QAAQ,MAAM,KAAK,eAAe,OAAO;AAC/C,cAAM,OAAO,MAAM,MAAM;AAAA,UACvB;AAAA,UACA,EAAE,QAAQ,gBAAgB,QAAQ,QAAQ,OAAO;AAAA,UACjD,EAAE,QAAQ,SAAS,OAAO;AAAA,QAC5B;AACA,YAAI,CAAC,MAAM;AACT,gBAAM,IAAI;AAAA,YACR,qCAAqC,IAAI,UAAU,cAAc,IAAI,eAAe,CAAC;AAAA,UACvF;AAAA,QACF;AACA,YAAI,KAAK,WAAW,QAAQ,OAAQ,QAAO;AAE3C,cAAM,IAAI;AAAA,UACR,oBAAoB,KAAK,MAAM,cAAc,IAAI,UAAU,cAAc,IAAI,eAAe,CAAC,cAAc,QAAQ,MAAM;AAAA,QAC3H;AAAA,MACF;AAAA,MAEA,KAAK,WAAW;AAGd,cAAM,EAAE,KAAK,kBAAkB,UAAU,IACvC;AAAA,UACE,QAAQ;AAAA,UACR,KAAK;AAAA,QACP;AACF,cAAM,UAAU,mBAAmB,kBAAkB;AAAA,UACnD,cAAc,SAAS;AAAA,UACvB,IAAI,WAAW;AAAA,QACjB,CAAC;AAED,cAAM,QAAQ,MAAM,KAAK;AAAA,UACvB;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,cAAM,OAAO,MAAM,MAAM;AAAA,UACvB;AAAA,UACA,EAAE,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,OAAO;AAAA,UACjD,EAAE,QAAQ,SAAS,OAAO;AAAA,QAC5B;AACA,YAAI,CAAC,MAAM;AACT,gBAAM,IAAI;AAAA,YACR,sCAAsC,OAAO;AAAA,UAC/C;AAAA,QACF;AACA,YAAI,KAAK,WAAW,QAAQ,QAAQ;AAClC,gBAAM,IAAI;AAAA,YACR,4CAA4C,OAAO,cAAc,QAAQ,MAAM,eAAe,KAAK,MAAM;AAAA,UAC3G;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,MAAc,uBACZ,SACA,OACA,SACqB;AAErB,QAAI;AACJ,QAAI;AAEJ,QAAI,kBAAkB,OAAO;AAC3B,mBACE,QAAQ,SAAS,WACb,QAAQ,KAAK,SAAS,MAAM,eAC5B,QAAQ,SAAS,MAAM;AAC7B,iBACE,QAAQ,SAAS,WAAW,QAAQ,KAAK,SAAS,QAAQ;AAAA,IAC9D,OAAO;AACL,mBAAa,MAAM;AACnB,iBAAW,MAAM,SAAS,MAAM;AAAA,IAClC;AAEA,YAAQ,QAAQ,MAAM;AAAA,MACpB,KAAK;AACH,eAAO,QAAQ,KAAK,MAAM,YAAY,QAAQ;AAAA,MAEhD,KAAK,UAAU;AACb,cAAM,OAAO,aAAa,iBAAiB,QAAQ,OAAO,CAAC;AAC3D,cAAM,iBAAiB,QAAQ,SAAS;AACxC,cAAM,eAAe,WAAW;AAChC,cAAM,eAAe,iBAAiB;AACtC,cAAM,QAAQ,MAAM,KAAK,eAAe,OAAO;AAC/C,cAAM,OAAO,MAAM,MAAM;AAAA,UACvB;AAAA,UACA,EAAE,QAAQ,gBAAgB,QAAQ,aAAa;AAAA,UAC/C,EAAE,QAAQ,SAAS,OAAO;AAAA,QAC5B;AACA,YAAI,CAAC,MAAM;AACT,gBAAM,IAAI;AAAA,YACR,qCAAqC,IAAI,UAAU,cAAc,IAAI,eAAe,CAAC;AAAA,UACvF;AAAA,QACF;AACA,YAAI,KAAK,WAAW,aAAc,QAAO;AAEzC,cAAM,IAAI;AAAA,UACR,oBAAoB,KAAK,MAAM,cAAc,IAAI,UAAU,cAAc,IAAI,eAAe,CAAC,cAAc,YAAY;AAAA,QACzH;AAAA,MACF;AAAA,MAEA,KAAK,WAAW;AACd,cAAM,gBAAgB,QAAQ,SAAS;AACvC,cAAM,eAAe,WAAW;AAEhC,cAAM,EAAE,KAAK,kBAAkB,UAAU,IACvC;AAAA,UACE,QAAQ;AAAA,UACR,KAAK;AAAA,QACP;AACF,cAAM,UAAU,mBAAmB,kBAAkB;AAAA,UACnD,cAAc,SAAS;AAAA,UACvB,IAAI,WAAW;AAAA,QACjB,CAAC;AAED,cAAM,QAAQ,MAAM,KAAK;AAAA,UACvB;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,cAAM,OAAO,MAAM,MAAM;AAAA,UACvB;AAAA,UACA,EAAE,QAAQ,eAAe,QAAQ,aAAa;AAAA,UAC9C,EAAE,QAAQ,SAAS,OAAO;AAAA,QAC5B;AACA,YAAI,CAAC,MAAM;AACT,gBAAM,IAAI;AAAA,YACR,sCAAsC,OAAO;AAAA,UAC/C;AAAA,QACF;AACA,YAAI,KAAK,WAAW,cAAc;AAChC,gBAAM,IAAI;AAAA,YACR,4CAA4C,OAAO,cAAc,YAAY,eAAe,KAAK,MAAM;AAAA,UACzG;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGQ,iBAAiB,MAAmC;AAC1D,UAAM,QAAQ,KAAK,SAAS;AAC5B,QAAI,MAAM;AACV,QAAI,OAAO,MAAM,SAAS;AAE1B,WAAO,OAAO,MAAM;AAClB,YAAM,MAAM,KAAK,OAAO,MAAM,QAAQ,CAAC;AACvC,YAAM,MAAM,iBAAiB,MAAM,GAAG,EAAE,MAAM,IAAI;AAElD,UAAI,QAAQ,GAAG;AACb,eAAO,MAAM,GAAG;AAAA,MAClB,WAAW,MAAM,GAAG;AAClB,cAAM,MAAM;AAAA,MACd,OAAO;AACL,eAAO,MAAM;AAAA,MACf;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAGA,IAAM,cAAc,IAAI,YAAY;AAEpC,SAAS,iBAAiB,SAAmD;AAC3E,MAAI,CAAC,QAAS,QAAO;AACrB,SAAO;AAAA,IACL,GAAI,QAAQ,UAAU,EAAE,QAAQ,QAAQ,OAAO;AAAA,IAC/C,GAAI,QAAQ,eAAe,EAAE,aAAa,QAAQ,YAAY;AAAA,IAC9D,GAAI,QAAQ,sBAAsB,UAAa;AAAA,MAC7C,mBAAmB,QAAQ;AAAA,IAC7B;AAAA,IACA,GAAI,QAAQ,iBAAiB,UAAa;AAAA,MACxC,cAAc,QAAQ;AAAA,IACxB;AAAA,EACF;AACF;AASA,SAAS,iBAAiB,GAAW,GAAmB;AACtD,QAAM,SAAS,YAAY,OAAO,CAAC;AACnC,QAAM,SAAS,YAAY,OAAO,CAAC;AAEnC,QAAM,SAAS,KAAK,IAAI,OAAO,QAAQ,OAAO,MAAM;AACpD,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,OAAO,CAAC,MAAM,OAAO,CAAC,GAAG;AAC3B,aAAO,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO,OAAO,SAAS,OAAO;AAChC;AAGA,IAAM,aAAa;AAsBZ,SAAS,4BACd,UACA,YACoD;AACpD,MAAI,SAAS,WAAW,UAAU,GAAG;AACnC,UAAM,OAAO,SAAS,MAAM,WAAW,MAAM;AAC7C,UAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,QAAI,UAAU,IAAI;AAChB,YAAM,IAAI;AAAA,QACR,uBAAuB,QAAQ;AAAA,MACjC;AAAA,IACF;AACA,UAAM,OAAO,KAAK,MAAM,GAAG,KAAK;AAChC,UAAM,eAAe,KAAK,MAAM,QAAQ,CAAC;AACzC,UAAME,aAAY,WAAW,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI;AACxD,QAAI,CAACA,YAAW;AACd,UAAI,WAAW,WAAW,EAAG,QAAO,EAAE,KAAK,SAAS;AACpD,YAAM,IAAI;AAAA,QACR,oCAAoC,IAAI,mBAAmB,QAAQ;AAAA,MACrE;AAAA,IACF;AACA,WAAO;AAAA,MACL,KAAK,oBAAoBA,WAAU,SAAS,IAAI;AAAA,MAChD,WAAAA;AAAA,IACF;AAAA,EACF;AAIA,QAAM,YAAY,WAAW;AAAA,IAAK,CAAC,MACjC,SAAS,WAAW,oBAAoB,EAAE,SAAS,CAAC;AAAA,EACtD;AACA,SAAO,EAAE,KAAK,UAAU,UAAU;AACpC;AAGA,SAAS,oBAAoB,QAAwB;AACnD,SAAO,OAAO,SAAS,GAAG,IAAI,SAAS,GAAG,MAAM;AAClD;AAeA,SAAS,eACP,QACA,KACA,IACQ;AACR,MAAI,IAAI,aAAa;AACnB,UAAM,OAAO,GAAG,YAAY,QAAQ,QAAQ,EAAE;AAC9C,WAAO,GAAG,IAAI,IAAI,MAAM,IAAI,GAAG;AAAA,EACjC;AACA,QAAM,SAAS,IAAI;AACnB,QAAM,YAAY,IAAI,mBAAmB,QAAQ,OAAO,SAAS,GAAG;AACpE,MAAI,WAAW;AACb,UAAMC,QAAO,SACT,MAAM,MAAM,IAAI,kBAAkB,MAAM,CAAC,KACzC;AACJ,WAAO,WAAWA,KAAI,IAAI,MAAM,IAAI,GAAG;AAAA,EACzC;AACA,QAAM,OAAO,SACT,GAAG,MAAM,OAAO,MAAM,IAAI,kBAAkB,MAAM,CAAC,KACnD,GAAG,MAAM;AACb,SAAO,WAAW,IAAI,IAAI,GAAG;AAC/B;AAOA,SAAS,kBAAkB,QAAwB;AACjD,SAAO,OAAO,WAAW,KAAK,IAAI,qBAAqB;AACzD;AAqBA,SAAS,mBACP,KACA,SACQ;AACR,QAAM,eAAe,SAAS;AAG9B,MAAI,IAAI,WAAW,OAAO,GAAG;AAC3B,UAAM,OAAO,IAAI,MAAM,CAAC;AACxB,UAAM,aAAa,KAAK,QAAQ,GAAG;AACnC,UAAM,SAAS,eAAe,KAAK,OAAO,KAAK,MAAM,GAAG,UAAU;AAClE,UAAM,MAAM,eAAe,KAAK,KAAK,KAAK,MAAM,aAAa,CAAC;AAC9D,WAAO,eAAe,QAAQ,KAAK,SAAS,EAAE;AAAA,EAChD;AAGA,MAAI,IAAI,WAAW,OAAO,KAAK,IAAI,WAAW,QAAQ,GAAG;AACvD,UAAM,YAAY,IAAI,WAAW,OAAO,IAAI,IAAI;AAChD,UAAM,OAAO,IAAI,MAAM,SAAS;AAChC,WAAO,kCAAkC,IAAI;AAAA,EAC/C;AAKA,MAAI,IAAI,WAAW,OAAO,KAAK,IAAI,WAAW,UAAU,GAAG;AACzD,QAAI,CAAC,cAAc;AACjB,YAAM,IAAI;AAAA,QACR,+BAA+B,GAAG;AAAA,MAGpC;AAAA,IACF;AACA,UAAM,YAAY,IAAI,WAAW,OAAO,IAAI,IAAI;AAChD,UAAM,OAAO,IAAI,MAAM,SAAS;AAChC,UAAM,aAAa,KAAK,QAAQ,GAAG;AACnC,QAAI,eAAe,IAAI;AAErB,aAAO,WAAW,YAAY,0BAA0B,IAAI;AAAA,IAC9D;AACA,UAAM,YAAY,KAAK,MAAM,GAAG,UAAU;AAC1C,UAAM,OAAO,KAAK,MAAM,aAAa,CAAC;AACtC,WAAO,WAAW,YAAY,0BAA0B,SAAS,IAAI,IAAI;AAAA,EAC3E;AAIA,MAAI,IAAI,WAAW,SAAS,GAAG;AAC7B,UAAM,OAAO,IAAI,MAAM,CAAC;AACxB,UAAM,UAAU,KAAK,QAAQ,GAAG;AAChC,QAAI,YAAY,IAAI;AAClB,YAAM,YAAY,KAAK,MAAM,GAAG,OAAO;AACvC,YAAM,cAAc,KAAK,MAAM,UAAU,CAAC;AAE1C,YAAM,aAAa,YAAY,QAAQ,GAAG;AAC1C,YAAM,OACJ,eAAe,KAAK,cAAc,YAAY,MAAM,GAAG,UAAU;AACnE,YAAM,OAAO,eAAe,KAAK,KAAK,YAAY,MAAM,aAAa,CAAC;AAEtE,YAAM,WAAW,KAAK,QAAQ,GAAG;AACjC,YAAM,UAAU,aAAa,KAAK,OAAO,KAAK,MAAM,GAAG,QAAQ;AAC/D,YAAM,SAAS,OAAO,GAAG,SAAS,IAAI,IAAI,KAAK;AAC/C,aAAO,WAAW,OAAO,0BAA0B,MAAM;AAAA,IAC3D;AAAA,EACF;AAGA,SAAO;AACT;;;ACh9BO,IAAM,aAAN,MAAM,YAAW;AAAA,EACd;AAAA,EACA,WAA8B;AAAA,EAC9B,oBAAoB;AAAA,EAEpB,YAAY,SAAkB;AACpC,SAAK,UAAU;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,MAAc,aACZ,SAC4B;AAC5B,QAAI,KAAK,mBAAmB;AAC1B,aAAO,KAAK;AAAA,IACd;AACA,SAAK,oBAAoB;AAEzB,QAAI;AACF,YAAM,OAAO,MAAM,KAAK,QAAQ;AAAA,QAC9B;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,WAAK,WAAW,UAAU,IAAI;AAC9B,aAAO,KAAK;AAAA,IACd,SAAS,OAAO;AAEd,UAAI,aAAa,KAAK,GAAG;AACvB,aAAK,oBAAoB;AACzB,cAAM;AAAA,MACR;AAEA,UAAI,iBAAiB,eAAe;AAClC,eAAO;AAAA,MACT;AAEA,YAAM,IAAI;AAAA,QACR,iCAAiC,iBAAiB,QAAQ,MAAM,UAAU,KAAK;AAAA,MACjF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,aAAa,KACX,SACA,gBACqB;AACrB,UAAM,OAAO,IAAI,YAAW,QAAQ,OAAO;AAE3C,QAAI,QAAQ,kBAAkB,MAAM;AAElC,WAAK,oBAAoB;AACzB,aAAO;AAAA,IACT;AAGA,UAAM,WAAW,MAAM,KAAK,aAAa,cAAc;AACvD,QAAI,UAAU;AACZ,aAAO;AAAA,IACT;AACA,QAAI,QAAQ,kBAAkB,MAAM;AAClC,YAAM,IAAI,MAAM,uDAAuD;AAAA,IACzE;AAGA,UAAM,gBAAgB,oBAAoB,MAAM;AAChD,UAAM,aAAa,MAAM,KAAK;AAAA,MAC5B;AAAA,MACA,iBAAiB,MAAM;AAAA,MACvB;AAAA,IACF;AACA,QAAI,YAAY;AACd,aAAO;AAAA,IACT;AAEA,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAc,cACZ,WACA,YACA,SACkB;AAClB,QAAI;AACF,uBAAiB,QAAQ,KAAK,QAAQ,WAAW,SAAS,GAAG;AAC3D,YAAI,KAAK,SAAS,OAAO,KAAK,CAAC,KAAK,SAAS,UAAU,GAAG;AACxD,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AAEd,UAAI,aAAa,KAAK,GAAG;AACvB,cAAM;AAAA,MACR;AAEA,UAAI,YAAY;AACd,eAAO,MAAM,KAAK,QAAQ,OAAO,YAAY,OAAO;AAAA,MACtD;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,MAAc,kBACZ,WACA,YACwB;AACxB,UAAM,YAAsB,CAAC;AAC7B,UAAM,eAAe,oBAAI,IAAY;AAErC,QAAI;AACF,uBAAiB,QAAQ,KAAK,QAAQ,WAAW,SAAS,GAAG;AAC3D,YAAI,KAAK,SAAS,UAAU,GAAG;AAE7B,uBAAa,IAAI,KAAK,MAAM,GAAG,CAAC,WAAW,MAAM,CAAC;AAAA,QACpD,WAAW,KAAK,SAAS,OAAO,GAAG;AACjC,oBAAU,KAAK,IAAI;AAAA,QACrB;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AAEd,UAAI,aAAa,KAAK,GAAG;AACvB,cAAM;AAAA,MACR;AAGA,aAAO,cAAc;AAAA,IACvB;AAEA,QAAI,UAAU,WAAW,GAAG;AAC1B,aAAO;AAAA,IACT;AAGA,cAAU,KAAK;AAGf,aAAS,IAAI,UAAU,SAAS,GAAG,KAAK,GAAG,KAAK;AAC9C,UAAI,CAAC,aAAa,IAAI,UAAU,CAAC,CAAC,GAAG;AACnC,eAAO,UAAU,CAAC;AAAA,MACpB;AAAA,IACF;AAGA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,eAAkC;AAEtC,UAAM,WAAW,MAAM,KAAK,aAAa;AACzC,QAAI,UAAU;AACZ,aAAO,qBAAqB,QAAQ;AAAA,IACtC;AAGA,UAAM,WAAW,oBAAI,IAAY;AAEjC,QAAI;AACF,uBAAiB,QAAQ,KAAK,QAAQ;AAAA,QACpC,GAAG,MAAM,IAAI;AAAA,MACf,GAAG;AAGD,cAAM,QAAQ,KAAK,MAAM,qCAAqC;AAC9D,YAAI,OAAO;AACT,mBAAS,IAAI,MAAM,CAAC,CAAC;AAAA,QACvB;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,UAAI,aAAa,KAAK,GAAG;AACvB,cAAM;AAAA,MACR;AACA,YAAM,IAAI,MAAM,wDAAwD;AAAA,IAC1E;AAEA,WAAO,CAAC,GAAG,QAAQ;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,WAA8B;AAElC,UAAM,WAAW,MAAM,KAAK,aAAa;AACzC,QAAI,UAAU;AACZ,aAAO,iBAAiB,QAAQ;AAAA,IAClC;AAIA,UAAM,WAAW,oBAAI,IAGnB;AAEF,QAAI;AACF,uBAAiB,QAAQ,KAAK,QAAQ,WAAW,GAAG,MAAM,IAAI,OAAO,GAAG;AAKtE,cAAM,YAAY,KAAK,MAAM,kCAAkC;AAC/D,cAAM,eAAe,KAAK;AAAA,UACxB;AAAA,QACF;AAEA,YAAI,cAAc;AAChB,gBAAM,UAAU,aAAa,CAAC;AAC9B,gBAAM,UAAU,YAAY,OAAO,IAAI,aAAa,CAAC,CAAC;AACtD,cAAI,CAAC,SAAS,IAAI,OAAO,GAAG;AAC1B,qBAAS,IAAI,SAAS,EAAE,WAAW,CAAC,GAAG,cAAc,oBAAI,IAAI,EAAE,CAAC;AAAA,UAClE;AACA,mBAAS,IAAI,OAAO,EAAG,aAAa,IAAI,OAAO;AAAA,QACjD,WAAW,WAAW;AACpB,gBAAM,UAAU,UAAU,CAAC;AAC3B,cAAI,CAAC,SAAS,IAAI,OAAO,GAAG;AAC1B,qBAAS,IAAI,SAAS,EAAE,WAAW,CAAC,GAAG,cAAc,oBAAI,IAAI,EAAE,CAAC;AAAA,UAClE;AACA,mBAAS,IAAI,OAAO,EAAG,UAAU,KAAK,IAAI;AAAA,QAC5C;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,UAAI,aAAa,KAAK,GAAG;AACvB,cAAM;AAAA,MACR;AACA,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AAGA,UAAM,SAAmB,CAAC;AAC1B,eAAW,CAAC,SAAS,EAAE,WAAW,aAAa,CAAC,KAAK,UAAU;AAC7D,UAAI,UAAU,WAAW,EAAG;AAG5B,gBAAU,KAAK;AACf,YAAM,YAAY,UAAU,UAAU,SAAS,CAAC;AAGhD,UAAI,CAAC,aAAa,IAAI,SAAS,GAAG;AAChC,eAAO,KAAK,OAAO;AAAA,MACrB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,eACJ,MACA,SACsB;AAEtB,UAAM,WAAW,MAAM,KAAK,aAAa,OAAO;AAChD,QAAI,UAAU;AACZ,YAAMC,cAAa,cAAc,UAAU,IAAI;AAC/C,UAAI,CAACA,aAAY;AACf,cAAM,IAAI,MAAM,qBAAqB,IAAI,EAAE;AAAA,MAC7C;AACA,aAAO,YAAY,KAAK,KAAK,SAASA,aAAY;AAAA,QAChD,GAAG;AAAA,QACH,wBAAwB,SAAS;AAAA,MACnC,CAAC;AAAA,IACH;AAGA,UAAM,aAAa,oBAAoB,IAAI;AAC3C,UAAM,UAAU,MAAM,KAAK;AAAA,MACzB;AAAA,MACA,iBAAiB,IAAI;AAAA,IACvB;AACA,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,wBAAwB,UAAU,EAAE;AAAA,IACtD;AACA,UAAM,aAAa,MAAM,KAAK,sBAAsB,SAAS,OAAO;AACpE,WAAO,YAAY,KAAK,KAAK,SAAS,YAAY,OAAO;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,YACJ,MACA,SACsB;AAEtB,UAAM,WAAW,MAAM,KAAK,aAAa,OAAO;AAChD,QAAI,UAAU;AACZ,YAAMA,cAAa,WAAW,UAAU,IAAI;AAC5C,UAAI,CAACA,aAAY;AACf,cAAM,IAAI,MAAM,kBAAkB,IAAI,EAAE;AAAA,MAC1C;AACA,aAAO,YAAY,KAAK,KAAK,SAASA,aAAY;AAAA,QAChD,GAAG;AAAA,QACH,wBAAwB,SAAS;AAAA,MACnC,CAAC;AAAA,IACH;AAGA,UAAM,aAAa,iBAAiB,IAAI;AACxC,UAAM,aAAa,cAAc,IAAI;AACrC,UAAM,UAAU,MAAM,KAAK,kBAAkB,YAAY,UAAU;AACnE,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,wBAAwB,UAAU,EAAE;AAAA,IACtD;AAIA,QACE,YAAY,cACX,MAAM,KAAK,QAAQ,OAAO,GAAG,OAAO,YAAY,OAAO,GACxD;AACA,YAAM,IAAI,MAAM,kBAAkB,IAAI,EAAE;AAAA,IAC1C;AAEA,UAAM,aAAa,MAAM,KAAK,sBAAsB,SAAS,OAAO;AACpE,WAAO,YAAY,KAAK,KAAK,SAAS,YAAY,OAAO;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,iBACJ,YACA,SACsB;AACtB,UAAM,KACJ,OAAO,eAAe,WAClB,iBAAiB,UAAU,IAC3B;AAGN,UAAM,WAAW,MAAM,KAAK,aAAa,OAAO;AAChD,UAAM,yBAAyB,UAAU;AACzC,WAAO,YAAY,KAAK,KAAK,SAAS,IAAI;AAAA,MACxC,GAAG;AAAA,MACH,GAAI,0BAA0B,EAAE,uBAAuB;AAAA,IACzD,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,OAAO,YACL,SACA,SAMC;AACD,QAAI,UAA8B;AAElC,WAAO,SAAS;AACd,YAAM;AAAA,QACJ,IAAI,iBAAiB,QAAQ,cAAc,CAAC;AAAA,QAC5C,SAAS,QAAQ,WAAW;AAAA,QAC5B,WAAW,QAAQ,aAAa;AAAA,QAChC,UAAU,QAAQ,oBAAoB;AAAA,MACxC;AAEA,YAAM,WAAW,QAAQ,oBAAoB;AAC7C,UAAI,CAAC,SAAU;AAEf,gBAAU,MAAM,KAAK,iBAAiB,UAAU,OAAO;AAAA,IACzD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,aAAsB;AACpB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,MAAc,QACZ,MACA,SACkB;AAClB,UAAM,OAAO,MAAM,KAAK,QAAQ,UAAU,MAAM,QAAW,OAAO;AAClE,UAAM,OAAO,IAAI,YAAY,EAAE,OAAO,IAAI;AAC1C,WAAO,KAAK,MAAM,IAAI;AAAA,EACxB;AAAA;AAAA,EAGA,MAAc,sBACZ,MACA,SACqB;AACrB,QAAI;AACF,YAAM,MAAM,MAAM,KAAK,QAAQ,MAAM,OAAO;AAC5C,aAAO,iBAAiB,IAAI,QAAQ;AAAA,IACtC,SAAS,OAAO;AACd,UAAI,iBAAiB,eAAe;AAClC,cAAM,IAAI,MAAM,wBAAwB,IAAI,EAAE;AAAA,MAChD;AACA,YAAM;AAAA,IACR;AAAA,EACF;AACF;;;AC/eO,IAAM,cAAN,MAAqC;AAAA,EAClC;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQR,YAAY,SAAiB,UAA8B,CAAC,GAAG;AAE7D,SAAK,UAAU,QAAQ,QAAQ,OAAO,EAAE;AACxC,SAAK,UAAU;AAAA,EACjB;AAAA;AAAA,EAGQ,OAAO,MAAsB;AAEnC,UAAM,iBAAiB,KAAK,WAAW,GAAG,IAAI,KAAK,MAAM,CAAC,IAAI;AAC9D,WAAO,GAAG,KAAK,OAAO,IAAI,cAAc;AAAA,EAC1C;AAAA;AAAA,EAGQ,WAAW,OAAgC;AACjD,UAAM,UAAuB,EAAE,GAAG,KAAK,QAAQ,QAAQ;AAEvD,QAAI,OAAO;AAET,cAAQ,OAAO,IAAI,SAAS,MAAM,KAAK,IAAI,MAAM,MAAM,CAAC;AAAA,IAC1D;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,UACJ,MACA,OACA,SACqB;AACrB,aAAS,QAAQ,eAAe;AAEhC,UAAM,MAAM,KAAK,OAAO,IAAI;AAC5B,UAAM,UAAU,KAAK,WAAW,KAAK;AAErC,QAAI;AACJ,QAAI;AACF,iBAAW,MAAM,MAAM,KAAK;AAAA,QAC1B,QAAQ;AAAA,QACR;AAAA,QACA,aAAa,KAAK,QAAQ;AAAA,QAC1B,OAAO,KAAK,QAAQ;AAAA,QACpB,QAAQ,SAAS;AAAA,MACnB,CAAC;AAAA,IACH,SAAS,OAAO;AACd,UAAI,aAAa,KAAK,EAAG,OAAM;AAC/B,YAAM,IAAI;AAAA,QACR,mBAAmB,GAAG,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,QACjF,iBAAiB,QAAQ,QAAQ;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,SAAS,WAAW,KAAK;AAC3B,YAAM,IAAI,cAAc,IAAI;AAAA,IAC9B;AAGA,QAAI,SAAS,WAAW,OAAO,SAAS,WAAW,KAAK;AACtD,YAAM,IAAI;AAAA,QACR,QAAQ,SAAS,MAAM,IAAI,SAAS,UAAU,QAAQ,GAAG;AAAA,MAC3D;AAAA,IACF;AAEA,UAAM,cAAc,MAAM,SAAS,YAAY;AAC/C,WAAO,IAAI,WAAW,WAAW;AAAA,EACnC;AAAA,EAEA,MAAM,OAAO,MAAc,SAA4C;AACrE,aAAS,QAAQ,eAAe;AAEhC,UAAM,MAAM,KAAK,OAAO,IAAI;AAE5B,QAAI;AACF,YAAM,WAAW,MAAM,MAAM,KAAK;AAAA,QAChC,QAAQ;AAAA,QACR,SAAS,KAAK,QAAQ;AAAA,QACtB,aAAa,KAAK,QAAQ;AAAA,QAC1B,QAAQ,SAAS;AAAA,MACnB,CAAC;AAED,aAAO,SAAS;AAAA,IAClB,SAAS,OAAO;AACd,UAAI,aAAa,KAAK,EAAG,OAAM;AAC/B,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,OAAO,WAAW,SAAwC;AAGxD,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACF;;;ACdO,IAAM,gBAAN,MAAM,eAAuC;AAAA;AAAA,EAEzC;AAAA,EACD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,WAAmB;AAAA,EAEnB,YACN,SACA,aACA,mBACA,cACA,qBACA;AACA,QAAI,EAAE,mBAAmB,cAAc;AACrC,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,SAAK,UAAU;AACf,SAAK,cAAc;AACnB,SAAK,oBAAoB,qBAAqB;AAC9C,SAAK,eAAe;AACpB,SAAK,sBAAsB;AAAA,EAC7B;AAAA,EAyCA,aAAa,KACX,KACA,UAAgC,CAAC,GACT;AACxB,QAAI,eAAe,aAAa;AAC9B,aAAO,IAAI;AAAA,QACT;AAAA,QACA,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,MACV;AAAA,IACF;AAEA,UAAM,UAAU,OAAO,QAAQ,WAAW,IAAI,YAAY,GAAG,IAAI;AACjE,UAAM,iBAAiB,QAAQ,SAC3B,EAAE,QAAQ,QAAQ,OAAO,IACzB;AACJ,UAAM,OAAO,MAAM,WAAW;AAAA,MAC5B,EAAE,SAAS,eAAe,QAAQ,cAAc;AAAA,MAChD;AAAA,IACF;AAGA,UAAM,iBAAiB;AAAA,MACrB,GAAG;AAAA,MACH,sBAAsB,QAAQ;AAAA,IAChC;AAEA,QAAI;AACJ,QAAI,QAAQ,UAAU;AACpB,gBAAU,MAAM,KAAK,iBAAiB,QAAQ,UAAU,cAAc;AAAA,IACxE,WAAW,QAAQ,KAAK;AACtB,gBAAU,MAAM,KAAK,YAAY,QAAQ,KAAK,cAAc;AAAA,IAC9D,OAAO;AACL,gBAAU,MAAM,KAAK;AAAA,QACnB,QAAQ,UAAU;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAEA,WAAO,IAAI;AAAA,MACT;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,IACV;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,MAAM,IACJ,KACA,MACiC;AACjC,UAAM,QAAQ,eAAe;AAE7B,UAAM,SAAS,aAAa,GAAG;AAC/B,UAAM,eAAe,KAAK,YAAY,OAAO,IAAI;AAEjD,QAAI;AACF,UAAI,OAAO,SAAS,YAAY;AAC9B,cAAM,OAAO,KAAK,QAAQ,eAAe,YAAY;AACrD,eAAO,QAAQ;AAAA,MACjB;AAEA,YAAM,QAAQ,MAAM,KAAK,QAAQ,SAAS,cAAc,OAAO,QAAQ;AAAA,QACrE,QAAQ,MAAM;AAAA,QACd,GAAI,KAAK,eAAe,EAAE,aAAa,KAAK,YAAY;AAAA,QACxD,mBAAmB,KAAK;AAAA,QACxB,cAAc,KAAK;AAAA,QACnB,GAAI,KAAK,uBAAuB;AAAA,UAC9B,qBAAqB,KAAK;AAAA,QAC5B;AAAA,MACF,CAAC;AACD,aAAO,SAAS;AAAA,IAClB,SAASC,MAAK;AAOZ,UAAIA,gBAAe,cAAe,QAAO;AACzC,YAAMA;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,MAAM,SACJ,KACA,OACA,MACiC;AACjC,UAAM,QAAQ,eAAe;AAE7B,UAAM,SAAS,aAAa,GAAG;AAC/B,UAAM,eAAe,KAAK,YAAY,OAAO,IAAI;AAEjD,QAAI;AACF,UAAI,OAAO,SAAS,SAAS;AAE3B,cAAMC,QAAO,MAAM,KAAK,QAAQ;AAAA,UAC9B;AAAA,UACA,OAAO;AAAA,UACP;AAAA,UACA;AAAA,YACE,QAAQ,MAAM;AAAA,YACd,GAAI,KAAK,eAAe,EAAE,aAAa,KAAK,YAAY;AAAA,YACxD,mBAAmB,KAAK;AAAA,YACxB,cAAc,KAAK;AAAA,YACnB,GAAI,KAAK,uBAAuB;AAAA,cAC9B,qBAAqB,KAAK;AAAA,YAC5B;AAAA,UACF;AAAA,QACF;AACA,eAAOA,SAAQ;AAAA,MACjB;AAGA,YAAM,OAAO,KAAK,QAAQ,eAAe,YAAY;AACrD,UAAI,CAAC,KAAM,QAAO;AAElB,UAAI,kBAAkB,OAAO;AAC3B,eAAO,KAAK,MAAM,CAAC,MAAM,YAAY;AAAA,MACvC;AACA,aAAO,KAAK,MAAM,MAAM,QAAQ,MAAM,SAAS,MAAM,MAAM;AAAA,IAC7D,SAASD,MAAK;AAIZ,UAAIA,gBAAe,cAAe,QAAO;AACzC,YAAMA;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGQ,YAAY,MAAsB;AACxC,QAAI,CAAC,KAAK,SAAU,QAAO;AAE3B,QAAI,SAAS,IAAK,QAAO,IAAI,KAAK,QAAQ;AAC1C,WAAO,IAAI,KAAK,QAAQ,GAAG,IAAI;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,QAAQ,MAA6B;AACnC,UAAM,SAAS,IAAI;AAAA,MACjB,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,UAAM,YAAY,KAAK,QAAQ,cAAc,EAAE;AAC/C,WAAO,WAAW,KAAK,WACnB,GAAG,KAAK,QAAQ,IAAI,SAAS,KAC7B;AACJ,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,aAAa,YAA+B;AAC1C,QAAI;AACJ,QAAI,cAAc,MAAM;AACtB,aAAO,KAAK,WAAW,IAAI,KAAK,QAAQ,KAAK;AAAA,IAC/C,WAAW,KAAK,UAAU;AACxB,aACE,IAAI,KAAK,QAAQ,IAAI,WAAW,QAAQ,OAAO,EAAE,CAAC,GAC/C,QAAQ,QAAQ,GAAG,EACnB,QAAQ,QAAQ,EAAE,KAAK;AAAA,IAC9B,OAAO;AAEL,cACG,WAAW,WAAW,GAAG,IAAI,aAAa,IAAI,UAAU,IAAI;AAAA,QAC3D;AAAA,QACA;AAAA,MACF,KAAK;AAAA,IACT;AACA,UAAM,QAAQ,KAAK,QAAQ,aAAa,IAAI;AAC5C,WAAO,MAAM,IAAI,CAAC,SAAS;AAEzB,YAAM,WAAW,KAAK,KAAK,MAAM,GAAG;AACpC,aAAO,SAAS,SAAS,SAAS,CAAC;AAAA,IACrC,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAA4B;AAC1B,WAAO,KAAK,QAAQ,UAAU;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAQ,MAAmC;AACzC,UAAM,YACH,KAAK,WACF,IAAI,KAAK,QAAQ,IAAI,KAAK,QAAQ,OAAO,EAAE,CAAC,GAAG,QAAQ,QAAQ,GAAG,IAClE,MACF,QAAQ,QAAQ,EAAE,KAAK;AAC3B,WAAO,KAAK,QAAQ,QAAQ,QAAQ;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,YAAY,MAA8B;AACxC,UAAM,YACH,KAAK,WACF,IAAI,KAAK,QAAQ,IAAI,KAAK,QAAQ,OAAO,EAAE,CAAC,GAAG,QAAQ,QAAQ,GAAG,IAClE,MACF,QAAQ,QAAQ,EAAE,KAAK;AAC3B,WAAO,KAAK,QAAQ,YAAY,QAAQ;AAAA,EAC1C;AACF;AAeA,SAAS,aAAa,KAA8B;AAElD,QAAM,OAAO,IAAI,MAAM,CAAC;AAGxB,MAAI,SAAS,aAAa;AACxB,WAAO,EAAE,MAAM,YAAY,MAAM,IAAI;AAAA,EACvC;AAGA,MAAI,KAAK,SAAS,YAAY,GAAG;AAC/B,UAAM,WAAW,MAAM,KAAK,MAAM,GAAG,CAAC,aAAa,MAAM;AACzD,WAAO,EAAE,MAAM,YAAY,MAAM,SAAS;AAAA,EAC5C;AAGA,QAAM,aAAa,KAAK,MAAM,2BAA2B;AACzD,MAAI,YAAY;AACd,UAAM,YAAY,WAAW,CAAC,IAAI,MAAM,WAAW,CAAC,IAAI;AACxD,UAAM,YAAY,WAAW,CAAC,KAAK;AACnC,UAAM,SAAS,YAAY,UAAU,MAAM,GAAG,EAAE,IAAI,MAAM,IAAI,CAAC;AAC/D,WAAO,EAAE,MAAM,SAAS,MAAM,WAAW,OAAO;AAAA,EAClD;AAGA,SAAO,EAAE,MAAM,YAAY,MAAM,MAAM,KAAK;AAC9C;","names":["SpecVersion","FileType","CompressionAlgorithm","ab","ByteBuffer","ByteBuffer","ByteBuffer","ByteBuffer","flexbuffers","ByteBuffer","readId12","readId8","ByteBuffer","container","host","snapshotId","err","data"]}