@blockcast/mmt-container 0.1.0-main.0399efef1f07

package/dist/wasm-mmtp-container-parser.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../mmt-alta-parse/src/index.ts", "../../mmt-base/src/mmtp.ts", "../src/mfu-reassembler.ts", "../src/sample-combiner.ts", "../src/codec-utils.ts", "../src/mfu-reassembly-policy.ts", "../src/iso-bmff-timing.ts", "../src/mmtp-container-parser.ts", "../src/wasm-mfu-reassembler.ts", "../src/wasm-mmtp-container-parser.ts"],
+  "sourcesContent": ["/**\n * Zero-dependency helper for extracting the detached ALTA authenticator trailer\n * from an MMTP source packet.\n *\n * Lives in its own leaf package so both `@blockcast/mmt-container` (wire-path\n * parsing) and `@blockcast/fec-worker` (FEC-recovered-source parsing) can share\n * one implementation without creating a package cycle between them.\n *\n * Spec: ISO/IEC 23008-1:2023 + draft-ramadan-moq-mmt \u00A712 (detached trailer, Path 2).\n */\n\n// --- Private MMTP/MPU/MFU constants (ISO/IEC 23008-1 \u00A79.2.2\u20139.2.3) ---\n// Duplicated here as immutable spec values so this package stays a leaf with\n// zero `@blockcast/*` dependencies. Re-deriving from `mmt-container` would\n// reintroduce the package cycle this split exists to avoid.\n\nconst MMTP_HEADER_SIZE = 12\nconst MPU_HEADER_SIZE = 8\nconst MPU_LENGTH_FIELD_SIZE = 2\nconst MPU_HEADER_REMAINDER_SIZE = MPU_HEADER_SIZE - MPU_LENGTH_FIELD_SIZE\nconst TIMED_MFU_DU_HEADER_SIZE = 14\nconst NONTIMED_MFU_DU_HEADER_SIZE = 4\nconst PACKET_TYPE_MPU = 0x00\n\n// --- Public ALTA trailer constants ---\n\n/**\n * MMTP header-extension ext_type assigned to the detached ALTA authenticator\n * trailer (Path 2 / 08-07). Carried in an `[ext_type][ext_length][auth]`\n * block appended after the MPU's declared payload bytes, before the 4-byte\n * Source FEC Payload ID. MMTP X-bit stays 0 \u2014 non-ALTA MMTP receivers treat\n * the trailer as bytes past `payload_length` and skip it (per ISO 23008-1\n * \u00A79.2.2 \"may be discarded without impacting correct processing\").\n */\nexport const MMTP_EXT_TYPE_ALTA_AUTH = 0xf0a1\n\n/** Fixed size of the trailer's `[ext_type][ext_length]` prefix (2 + 2 BE). */\nexport const MMTP_EXT_TRAILER_HEADER_SIZE = 4\n\n/** Result of extracting the detached ALTA authenticator from an MMTP packet. */\nexport interface AltaTrailer {\n  /** Authenticator bytes (no ext_type/ext_length prefix, no trailing padding). */\n  auth: Uint8Array\n  /**\n   * Wire-packet byte offset where the signed payload ends, i.e. where the\n   * trailer begins. Caller uses this to produce\n   * `payload = wirePacket.subarray(0, signedEnd)` for verify_detached.\n   */\n  signedEnd: number\n}\n\n/**\n * Extract the detached ALTA authenticator trailer from an MMTP source packet.\n *\n * Wire layout:\n *   `[MMTP hdr][length(2)][remaining MPU hdr(6)][DU?][media][TRAILER][SS_ID?]`\n *   `payload_length = 6 + DU bytes + media bytes`\n *\n * Returns `null` when:\n * - the packet is too small / malformed,\n * - `payload_length` cannot contain the remaining six MPU-header bytes,\n * - the declared payload overruns the packet,\n * - no bytes remain between `payload_length` and the SS_ID,\n * - the trailer's `ext_type` isn't {@link MMTP_EXT_TYPE_ALTA_AUTH},\n * - the declared `ext_length` would extend past the SS_ID boundary.\n *\n * Non-MPU packets (repair, signaling) always return `null`.\n *\n * @param options.skipFecId When true, do NOT reserve 4 trailing bytes for the\n *   Source FEC Payload ID. Use on FEC-recovered symbols where the PID has\n *   already been stripped upstream.\n */\nexport function extractAltaTrailer(\n  mmtpPacket: Uint8Array,\n  options?: { skipFecId?: boolean },\n): AltaTrailer | null {\n  if (mmtpPacket.length < MMTP_HEADER_SIZE + MPU_HEADER_SIZE) return null\n  // ISO/IEC 23008-1:2023 Figure 8 places V=0 packet_type in the low six bits.\n  const packetType = mmtpPacket[1]! & 0x3f\n  if (packetType !== PACKET_TYPE_MPU) return null\n\n  const fecType = (mmtpPacket[0]! >> 3) & 0x03\n  let headerLength = MMTP_HEADER_SIZE\n  if (fecType < 2 && (mmtpPacket[0]! & 0x20) !== 0) headerLength += 4\n  if (fecType < 2 && (mmtpPacket[0]! & 0x02) !== 0) {\n    if (headerLength + 4 > mmtpPacket.length) return null\n    const extensionLength = new DataView(\n      mmtpPacket.buffer,\n      mmtpPacket.byteOffset + headerLength + 2,\n      2,\n    ).getUint16(0, false)\n    headerLength += 4 + extensionLength\n  }\n  if (headerLength + MPU_HEADER_SIZE > mmtpPacket.length) return null\n\n  const payload = mmtpPacket.subarray(headerLength)\n\n  // Inline a minimal MPU-header read \u2014 only the fields extractAltaTrailer needs.\n  // payloadLength: 16 BE at bytes 0-1.\n  // Byte 2 packs FT(4) | T(1) | FI(2) | A(1).\n  const payloadLength = (payload[0]! << 8) | payload[1]!\n  const flagsByte = payload[2]!\n  const fragmentType = (flagsByte >> 4) & 0x0f\n  const timed = ((flagsByte >> 3) & 0x01) === 1\n  const fragmentationIndicator = (flagsByte >> 1) & 0x03\n\n  // Only MFU packets (FT=2) carry the detached trailer.\n  if (fragmentType !== 2) return null\n\n  // FI=0/1 structurally carries a DU header; FI=2/3 does not. Require at\n  // least one media byte after that deterministic layout so the bytes at the\n  // declared boundary cannot impersonate ALTA for a header-only fragment.\n  const dataUnitHeaderSize = fragmentationIndicator <= 1\n    ? (timed ? TIMED_MFU_DU_HEADER_SIZE : NONTIMED_MFU_DU_HEADER_SIZE)\n    : 0\n  if (payloadLength <= MPU_HEADER_REMAINDER_SIZE + dataUnitHeaderSize) return null\n\n  if (fecType > 1) return null\n  const hasFecId = !options?.skipFecId && fecType === 1\n  const payloadEnd = hasFecId ? payload.length - 4 : payload.length\n  const declaredEnd = MPU_LENGTH_FIELD_SIZE + payloadLength\n  if (declaredEnd > payloadEnd) return null\n\n  if (declaredEnd + MMTP_EXT_TRAILER_HEADER_SIZE > payloadEnd) return null\n  const extType = (payload[declaredEnd]! << 8) | payload[declaredEnd + 1]!\n  if (extType !== MMTP_EXT_TYPE_ALTA_AUTH) return null\n  const extLen = (payload[declaredEnd + 2]! << 8) | payload[declaredEnd + 3]!\n\n  const authStart = declaredEnd + MMTP_EXT_TRAILER_HEADER_SIZE\n  if (authStart + extLen !== payloadEnd) return null\n\n  return {\n    auth: payload.subarray(authStart, payloadEnd),\n    signedEnd: headerLength + declaredEnd,\n  }\n}\n", "import {\n  MMTP_EXT_TYPE_ALTA_AUTH as _LEAF_MMTP_EXT_TYPE_ALTA_AUTH,\n  MMTP_EXT_TRAILER_HEADER_SIZE as _LEAF_MMTP_EXT_TRAILER_HEADER_SIZE,\n  extractAltaTrailer as _leafExtractAltaTrailer,\n  type AltaTrailer as _LeafAltaTrailer,\n} from '@blockcast/mmt-alta-parse'\n\n/**\n * @mmt/container - MMTP Parser\n *\n * MMTP (MMT Protocol) packet parser based on ISO/IEC 23008-1:2023 Section 9.2\n *\n * MMTP header format (12 bytes):\n * - Byte 0: V(2) | C(1) | FEC_type(2) | r(1) | X(1) | R(1)\n * - Byte 1: reserved(2) | packet_type(6)\n * - Bytes 2-3: packet_id (big-endian)\n * - Bytes 4-7: timestamp (big-endian, 32-bit)\n * - Bytes 8-11: sequence_number (big-endian)\n *\n * FEC_type values:\n * - 0: No FEC / source packet\n * - 1: FEC mode 0 (source with FEC payload ID)\n * - 2: FEC repair packet mode 0\n * - 3: FEC repair packet mode 1\n *\n * @packageDocumentation\n */\n\nexport interface MMTPHeader {\n  version: number\n  /** Packet type: 0x00=MPU, 0x02=Signaling, 0x03=Repair */\n  packetType: number\n  packetId: number\n  timestamp: bigint\n  sequenceNumber: number\n  payloadLength: number\n  fecType: number\n  /** C flag: header carries a 32-bit packet_counter. */\n  packetCounterFlag: boolean\n  packetCounter?: number\n  /** X flag: header carries an extension header and value. */\n  extensionFlag: boolean\n  extension?: { type: number; data: Uint8Array }\n  /** Byte offset at which the MMTP payload begins. */\n  headerLength: number\n  /** Random Access Point flag - indicates keyframe (ISO 23008-1, byte 0 bit 0) */\n  rapFlag: boolean\n}\n\nexport interface MPUHeader {\n  mpuSequenceNumber: number\n  fragmentationIndicator: number // FI: 0=complete, 1=first, 2=middle, 3=last\n  /** 8-bit MPU fragment_counter from byte 3. */\n  fragmentCounter: number\n  /** T flag: 1=timed media (14-byte MFU DU header), 0=non-timed (4-byte header) */\n  timedFlag: number\n  /** A flag: aggregated MPU payload. This strict profile requires A=0. */\n  aggregationFlag: boolean\n  /** MPU payload_length (bytes 0-1): bytes after the length field, including\n   *  the remaining six MPU-header bytes and all data-unit bytes. */\n  payloadLength: number\n}\n\nexport interface MFUDuHeader {\n  movieFragmentSequenceNumber: number\n  sampleNumber: number\n  offset: number\n  priority: number\n  dependencyCounter: number\n}\n\nexport interface MMTPPacket {\n  header: MMTPHeader\n  payload: Uint8Array\n}\n\nexport const MMTP_HEADER_SIZE = 12\nexport const MPU_HEADER_SIZE = 8\nexport const MFU_DU_HEADER_SIZE_TIMED = 14    // T=1: timed media (video/audio samples)\nexport const MFU_DU_HEADER_SIZE_NONTIMED = 4  // T=0: non-timed media (item_id only)\n\nconst MPU_LENGTH_FIELD_SIZE = 2\nconst MPU_HEADER_REMAINDER_SIZE = MPU_HEADER_SIZE - MPU_LENGTH_FIELD_SIZE\nconst SOURCE_FEC_PAYLOAD_ID_SIZE = 4\n\n// MMTP Packet Types (ISO/IEC 23008-1:2023 Section 9.2.2)\nexport const PACKET_TYPE_MPU = 0x00\nexport const PACKET_TYPE_SIGNALING = 0x02\nexport const PACKET_TYPE_REPAIR = 0x03\n\n// AL-FEC Signaling Message ID (ISO/IEC 23008-1:2023 Amendment 1:2025)\nexport const ALFEC_MESSAGE_ID = 0x0203\n\n// FEC Code IDs\nexport const FEC_CODE_XOR = 1\nexport const FEC_CODE_RAPTORQ = 2\n\n/**\n * Parse MMTP header from buffer\n */\nexport function parseMMTPHeader(buffer: Uint8Array): MMTPHeader {\n  if (buffer.length < MMTP_HEADER_SIZE) {\n    throw new Error(`MMTP packet too small: ${buffer.length} bytes`)\n  }\n\n  const view = new DataView(buffer.buffer, buffer.byteOffset, buffer.byteLength)\n\n  const version = (buffer[0]! >> 6) & 0x03\n  if (version !== 0) {\n    throw new Error(`Unsupported MMTP version: ${version}`)\n  }\n\n  // Extract FEC type from byte 0, bits 3-4\n  const fecType = (buffer[0]! >> 3) & 0x03\n  const packetCounterFlag = (buffer[0]! & 0x20) !== 0\n  const extensionFlag = (buffer[0]! & 0x02) !== 0\n\n  // Extract RAP flag from byte 0, bit 0 (R bit - Random Access Point)\n  const rapFlag = (buffer[0]! & 0x01) === 1\n\n  // ISO/IEC 23008-1:2023 Figure 8 (V=0) places reserved(2) before\n  // packet_type(6), so packet_type occupies the low six bits of byte 1.\n  const packetType = buffer[1]! & 0x3F\n\n  let offset = 2\n\n  // Packet ID (2 bytes, big-endian)\n  const packetId = view.getUint16(offset, false)\n  offset += 2\n\n  // Timestamp (4 bytes, big-endian)\n  const timestamp = BigInt(view.getUint32(offset, false))\n  offset += 4\n\n  // Sequence number (4 bytes, big-endian)\n  const sequenceNumber = view.getUint32(offset, false)\n  offset += 4\n\n  let packetCounter: number | undefined\n  if (packetCounterFlag) {\n    if (offset + 4 > buffer.length) throw new Error('MMTP packet truncated in packet_counter')\n    packetCounter = view.getUint32(offset, false)\n    offset += 4\n  }\n\n  let extension: { type: number; data: Uint8Array } | undefined\n  if (extensionFlag) {\n    if (offset + 4 > buffer.length) throw new Error('MMTP packet truncated in header extension')\n    const type = view.getUint16(offset, false)\n    const length = view.getUint16(offset + 2, false)\n    offset += 4\n    if (offset + length > buffer.length) throw new Error('MMTP packet truncated in header extension value')\n    extension = { type, data: buffer.subarray(offset, offset + length) }\n    offset += length\n  }\n\n  return {\n    version,\n    packetType,\n    packetId,\n    timestamp,\n    sequenceNumber,\n    payloadLength: buffer.length - offset,\n    fecType,\n    packetCounterFlag,\n    packetCounter,\n    extensionFlag,\n    extension,\n    headerLength: offset,\n    rapFlag,\n  }\n}\n\n/**\n * Unwrap MMTP packet to extract payload\n */\nexport function unwrapMMTP(buffer: Uint8Array): MMTPPacket {\n  const header = parseMMTPHeader(buffer)\n  const payload = buffer.subarray(header.headerLength)\n\n  return { header, payload }\n}\n\n/**\n * Parse MPU header from payload\n * ISO/IEC 23008-1:2023 Section 9.2.3.3\n *\n * MPU Header format (8 bytes) as written by FFmpeg/libmmt:\n * - Bytes 0-1: payload_length (16 bits, big-endian)\n * - Byte 2: FT(4) | T(1) | FI(2) | A(1)\n * - Byte 3: fragment_counter (8 bits)\n * - Bytes 4-7: MPU_sequence_number (32 bits, big-endian)\n */\nexport function parseMPUHeader(payload: Uint8Array): MPUHeader {\n  if (payload.length < MPU_HEADER_SIZE) {\n    throw new Error(`Payload too small for MPU header: ${payload.length} bytes`)\n  }\n\n  const view = new DataView(payload.buffer, payload.byteOffset, payload.byteLength)\n\n  // Bytes 0-1: payload_length (16 bits, big-endian)\n  const payloadLength = view.getUint16(0, false)\n\n  // Byte 2: FT(4) | T(1) | FI(2) | A(1)\n  const flagsByte = payload[2]!\n  const timedFlag = (flagsByte >> 3) & 0x01\n  const fragmentationIndicator = (flagsByte >> 1) & 0x03\n  const aggregationFlag = (flagsByte & 0x01) !== 0\n\n  // Byte 3: fragment_counter (8 bits). The high bit is part of the counter in\n  // the current libmmt/FFmpeg writer ABI.\n  const fragmentCounter = payload[3]!\n\n  // Bytes 4-7: MPU_sequence_number (32 bits, big-endian)\n  const mpuSequenceNumber = view.getUint32(4, false)\n\n  return {\n    mpuSequenceNumber,\n    fragmentationIndicator,\n    fragmentCounter,\n    timedFlag,\n    aggregationFlag,\n    payloadLength,\n  }\n}\n\nexport function parseTimedMfuDuHeader(payload: Uint8Array, offset: number): MFUDuHeader | null {\n  if (offset < 0 || offset + MFU_DU_HEADER_SIZE_TIMED > payload.length) return null\n  const view = new DataView(payload.buffer, payload.byteOffset + offset, MFU_DU_HEADER_SIZE_TIMED)\n  return {\n    movieFragmentSequenceNumber: view.getUint32(0, false),\n    sampleNumber: view.getUint32(4, false),\n    offset: view.getUint32(8, false),\n    priority: payload[offset + 12]!,\n    dependencyCounter: payload[offset + 13]!,\n  }\n}\n\n/**\n * Why `extractMFUPayload` refused a packet.\n *\n * These identifiers are part of the public contract: callers surface them in\n * diagnostics, so renaming one is a breaking change.\n */\nexport type MFURejectionGate =\n  | 'packet-shorter-than-mmtp-plus-mpu-header'\n  | 'mmtp-header-unparseable'\n  | 'not-an-mpu-packet'\n  | 'payload-shorter-than-mpu-header'\n  | 'aggregation-flag-set'\n  | 'mpu-payload-length-below-header-remainder'\n  | 'mpu-declared-end-exceeds-payload'\n  | 'mfu-offset-at-or-past-declared-end'\n  | 'source-fec-payload-id-width-mismatch'\n  | 'declared-trailers-unresolved'\n\nexport interface MFURejection {\n  gate: MFURejectionGate\n  /** Human-readable detail, including the byte arithmetic that decided it. */\n  detail: string\n}\n\ninterface MfuPayloadLayout {\n  hasMfuDuHeader: boolean\n  mfuOffset: number\n  dataEnd: number\n}\n\nfunction resolveMfuPayloadLayout(\n  mpu: MPUHeader,\n  fragmentType: number,\n  payload: Uint8Array,\n): { layout: MfuPayloadLayout } | { rejection: MFURejection } {\n  if (mpu.payloadLength < MPU_HEADER_REMAINDER_SIZE) {\n    return {\n      rejection: {\n        gate: 'mpu-payload-length-below-header-remainder',\n        detail: `payload_length=${mpu.payloadLength} < ${MPU_HEADER_REMAINDER_SIZE}`,\n      },\n    }\n  }\n\n  // ISO/IEC 23008-1 defines payload_length from immediately after its own\n  // two-byte field. It therefore includes the remaining six MPU-header bytes.\n  const declaredEnd = MPU_LENGTH_FIELD_SIZE + mpu.payloadLength\n  if (declaredEnd > payload.length) {\n    return {\n      rejection: {\n        gate: 'mpu-declared-end-exceeds-payload',\n        detail:\n          `payload_length=${mpu.payloadLength} implies end=${declaredEnd}, ` +\n          `payload is ${payload.length} bytes`,\n      },\n    }\n  }\n\n  const hasHeader = fragmentType === 2 && mpu.fragmentationIndicator <= 1\n  const mfuHeaderSize = mpu.timedFlag ? MFU_DU_HEADER_SIZE_TIMED : MFU_DU_HEADER_SIZE_NONTIMED\n  const mfuOffset = MPU_HEADER_SIZE + (hasHeader ? mfuHeaderSize : 0)\n  if (mfuOffset >= declaredEnd) {\n    return {\n      rejection: {\n        gate: 'mfu-offset-at-or-past-declared-end',\n        detail: `mfuOffset=${mfuOffset} >= declaredEnd=${declaredEnd}`,\n      },\n    }\n  }\n\n  return {\n    layout: {\n      hasMfuDuHeader: hasHeader,\n      mfuOffset,\n      dataEnd: declaredEnd,\n    },\n  }\n}\n\nfunction isEmptyOrExactAltaTrailer(payload: Uint8Array, start: number, end: number): boolean {\n  if (start === end) return true\n  if (start < 0 || end > payload.length || start + _LEAF_MMTP_EXT_TRAILER_HEADER_SIZE > end) {\n    return false\n  }\n\n  const view = new DataView(\n    payload.buffer,\n    payload.byteOffset + start,\n    end - start,\n  )\n  if (view.getUint16(0, false) !== _LEAF_MMTP_EXT_TYPE_ALTA_AUTH) return false\n\n  const authLength = view.getUint16(2, false)\n  return start + _LEAF_MMTP_EXT_TRAILER_HEADER_SIZE + authLength === end\n}\n\ninterface DeclaredTrailerLayout {\n  hasFecId: boolean\n}\n\nfunction resolveDeclaredTrailers(\n  payload: Uint8Array,\n  declaredEnd: number,\n  fecType: number,\n  options?: { skipFecId?: boolean },\n): DeclaredTrailerLayout | null {\n  if (declaredEnd > payload.length) return null\n\n  if (options?.skipFecId) {\n    return isEmptyOrExactAltaTrailer(payload, declaredEnd, payload.length)\n      ? { hasFecId: false }\n      : null\n  }\n\n  if (fecType === 1) {\n    const fecStart = payload.length - SOURCE_FEC_PAYLOAD_ID_SIZE\n    if (fecStart < declaredEnd || !isEmptyOrExactAltaTrailer(payload, declaredEnd, fecStart)) {\n      return null\n    }\n    return { hasFecId: true }\n  }\n  if (fecType !== 0) return null\n\n  if (isEmptyOrExactAltaTrailer(payload, declaredEnd, payload.length)) {\n    return { hasFecId: false }\n  }\n\n  return null\n}\n\n/**\n * Extract NAL unit payload from MMTP packet\n */\nexport function extractNALUnit(mmtpPacket: Uint8Array): Uint8Array {\n  const extraction = extractMFUPayload(mmtpPacket)\n  if (!extraction) throw new Error('Malformed MMTP MPU payload')\n  return extraction.data\n}\n\n/** Result of extracting MFU payload from an MMTP packet */\nexport interface MFUExtraction {\n  /** MMTP header fields */\n  header: MMTPHeader\n  /** MPU header fields */\n  mpu: MPUHeader\n  /** Fragment type (FT field, 4 bits): 0=metadata, 2=MFU data */\n  fragmentType: number\n  /** MFU payload data (video/audio bytes, headers stripped, FEC ID excluded) */\n  data: Uint8Array\n  /** Parsed timed MFU DU header when present, otherwise null */\n  mfuDuHeader: MFUDuHeader | null\n  /** Non-timed MFU Item_ID when the 4-byte DU header is present. */\n  itemId: number | null\n  /** Source FEC Payload ID if present (`FEC_type == 1`), or null */\n  fecPayloadId: { ssId: number } | null\n}\n\n/**\n * Extract MFU payload from a raw MMTP packet.\n *\n * Handles all the byte arithmetic for:\n * - MMTP header (12 bytes)\n * - MPU sub-header (8 bytes, payloadLength field)\n * - MFU DU header (14 bytes timed / 4 bytes non-timed, only for FI \u2264 1)\n * - Source FEC Payload ID (4 bytes at end, only when `FEC_type == 1`)\n *\n * `payloadLength` is the ISO length-after-field value: six remaining MPU-header\n * bytes, then the MFU DU header when present, then media. ALTA and Source FEC\n * trailers are outside that declared span and must consume the exact suffix.\n *\n * @param mmtpPacket Raw MMTP packet (from multicast or MoQ)\n * @param options.skipFecId When true, do NOT subtract the 4-byte Source FEC Payload ID\n *   from the payload boundary, even if fecType >= 1 in the MMTP header.  Use this for\n *   FEC-recovered symbols where the FEC PID was already stripped before WASM decoding\n *   but the fecType bits in byte 0 still reflect the original packet (FEC Type=1 per\n *   draft-ramadan-moq-mmt-00 \u00A73.1).\n * @returns Extracted MFU data + metadata, or null if packet is too small\n */\ninterface MfuPlan {\n  header: MMTPHeader\n  payload: Uint8Array\n  mpu: MPUHeader\n  fragmentType: number\n  layout: MfuPayloadLayout\n  trailerLayout: DeclaredTrailerLayout\n}\n\n/**\n * Single source of truth for whether a packet yields an MFU payload.\n *\n * `extractMFUPayload` and `explainMFURejection` both delegate here, so the\n * reason reported to operators can never drift from the decision the parser\n * actually made.\n */\nfunction planMfuExtraction(\n  mmtpPacket: Uint8Array,\n  options?: { skipFecId?: boolean },\n): { plan: MfuPlan } | { rejection: MFURejection } {\n  if (mmtpPacket.length < MMTP_HEADER_SIZE + MPU_HEADER_SIZE) {\n    return {\n      rejection: {\n        gate: 'packet-shorter-than-mmtp-plus-mpu-header',\n        detail: `${mmtpPacket.length} bytes < ${MMTP_HEADER_SIZE + MPU_HEADER_SIZE}`,\n      },\n    }\n  }\n\n  let header: MMTPHeader\n  try {\n    header = parseMMTPHeader(mmtpPacket)\n  } catch (error) {\n    return {\n      rejection: {\n        gate: 'mmtp-header-unparseable',\n        detail: error instanceof Error ? error.message : String(error),\n      },\n    }\n  }\n  if (header.packetType !== PACKET_TYPE_MPU) {\n    return {\n      rejection: {\n        gate: 'not-an-mpu-packet',\n        detail: `packetType=0x${header.packetType.toString(16).padStart(2, '0')}`,\n      },\n    }\n  }\n\n  const payload = mmtpPacket.subarray(header.headerLength)\n  if (payload.length < MPU_HEADER_SIZE) {\n    return {\n      rejection: {\n        gate: 'payload-shorter-than-mpu-header',\n        detail: `${payload.length} bytes < ${MPU_HEADER_SIZE}`,\n      },\n    }\n  }\n\n  const mpu = parseMPUHeader(payload)\n  if (mpu.aggregationFlag) {\n    return {\n      rejection: { gate: 'aggregation-flag-set', detail: 'strict profile requires A=0' },\n    }\n  }\n\n  // Fragment type from byte 2 upper nibble (not returned by parseMPUHeader)\n  const fragmentType = (payload[2]! >> 4) & 0x0f\n\n  const layoutResult = resolveMfuPayloadLayout(mpu, fragmentType, payload)\n  if ('rejection' in layoutResult) return layoutResult\n  const { layout } = layoutResult\n\n  const trailerLayout = resolveDeclaredTrailers(\n    payload,\n    layout.dataEnd,\n    header.fecType,\n    options,\n  )\n  if (!trailerLayout) {\n    // The most common cause is a producer whose Source FEC Payload ID width\n    // disagrees with ISO/IEC 23008-1 \u00A7C.5.2. Name that explicitly rather than\n    // leaving operators to infer it from a generic trailer error.\n    if (!options?.skipFecId && header.fecType === 1) {\n      const observed = payload.length - layout.dataEnd\n      if (observed !== SOURCE_FEC_PAYLOAD_ID_SIZE) {\n        return {\n          rejection: {\n            gate: 'source-fec-payload-id-width-mismatch',\n            detail:\n              `producer wrote a ${observed}-byte Source FEC Payload ID, ` +\n              `ISO/IEC 23008-1 \u00A7C.5.2 requires ${SOURCE_FEC_PAYLOAD_ID_SIZE} ` +\n              `(payload=${payload.length}, declaredEnd=${layout.dataEnd})`,\n          },\n        }\n      }\n    }\n    return {\n      rejection: {\n        gate: 'declared-trailers-unresolved',\n        detail:\n          `trailer bytes [${layout.dataEnd}, ${payload.length}) are neither empty ` +\n          `nor an exact ALTA trailer (fecType=${header.fecType})`,\n      },\n    }\n  }\n\n  return { plan: { header, payload, mpu, fragmentType, layout, trailerLayout } }\n}\n\n/**\n * Report why `extractMFUPayload` would refuse this packet, or null if it would\n * accept it.\n *\n * `extractMFUPayload` returns bare `null` on ten distinct conditions, which\n * makes a producer/consumer framing disagreement indistinguishable from a\n * publisher that never started \u2014 both render as silence. Use this wherever\n * that distinction matters: diagnostics, contract tests, and operator-facing\n * logs.\n */\nexport function explainMFURejection(\n  mmtpPacket: Uint8Array,\n  options?: { skipFecId?: boolean },\n): MFURejection | null {\n  const result = planMfuExtraction(mmtpPacket, options)\n  return 'rejection' in result ? result.rejection : null\n}\n\nexport function extractMFUPayload(\n  mmtpPacket: Uint8Array,\n  options?: { skipFecId?: boolean },\n): MFUExtraction | null {\n  const result = planMfuExtraction(mmtpPacket, options)\n  if ('rejection' in result) return null\n  const { header, payload, mpu, fragmentType, layout, trailerLayout } = result.plan\n\n  const mfuDuHeaderPresent = layout.hasMfuDuHeader\n  const mfuOffset = layout.mfuOffset\n  const dataEnd = layout.dataEnd\n\n  const mfuDuHeader =\n    mfuDuHeaderPresent && mpu.timedFlag === 1\n      ? parseTimedMfuDuHeader(payload, MPU_HEADER_SIZE)\n      : null\n  const itemId =\n    mfuDuHeaderPresent && mpu.timedFlag === 0\n      ? new DataView(payload.buffer, payload.byteOffset + MPU_HEADER_SIZE, 4).getUint32(0, false)\n      : null\n\n  const data = payload.subarray(mfuOffset, dataEnd)\n\n  const fecPayloadId = trailerLayout.hasFecId\n    ? {\n        ssId: new DataView(\n          mmtpPacket.buffer,\n          mmtpPacket.byteOffset + mmtpPacket.length - SOURCE_FEC_PAYLOAD_ID_SIZE,\n          SOURCE_FEC_PAYLOAD_ID_SIZE,\n        ).getUint32(0, false),\n      }\n    : null\n\n  return { header, mpu, fragmentType, data, mfuDuHeader, itemId, fecPayloadId }\n}\n\n/**\n * Extract timestamp from MMTP packet\n */\nexport function extractTimestamp(mmtpPacket: Uint8Array): bigint {\n  const { header } = unwrapMMTP(mmtpPacket)\n  return header.timestamp\n}\n\n/**\n * Check if MMTP packet is an FEC repair packet\n * FEC_type 2 and 3 are repair packets\n */\nexport function isFecRepairPacket(mmtpPacket: Uint8Array): boolean {\n  if (mmtpPacket.length < 1) return false\n  const fecType = (mmtpPacket[0]! >> 3) & 0x03\n  return fecType >= 2\n}\n\n/**\n * Extract Source FEC Payload ID (SS_ID) from the last 4 bytes of an MMTP\n * source packet per ISO/IEC 23008-1:2023 Section C.5.2 Figure C.10.\n *\n * SS_ID is a flat 32-bit monotonic counter (incremented by 1 per packet\n * for ssbg_mode0 and ssbg_mode1). Block membership and ESI use the\n * configured K; repair SS_Start identifies the first SS_ID of the block and\n * SSB_length records the authored source-symbol count:\n *   SBN = floor(SS_ID / K), ESI = SS_ID % K\n *   SS_Start = SBN * K  (first SS_ID of the block)\n *\n * This matches FFmpeg moqenc_mmt.c, the drafts (draft-ramadan-moq-fec \u00A76.2),\n * and ATSC A/331 \u00A78.1.2.5 which defers to ISO 23008-1 Annex C.\n */\nexport function extractFecPayloadId(mmtpPacket: Uint8Array): { ssId: number } | null {\n  if (!hasSourceFecPayloadId(mmtpPacket)) return null\n  // Flat 4-byte SS_ID: encoder writes block_id * K + symbol_id\n  const off = mmtpPacket.length - SOURCE_FEC_PAYLOAD_ID_SIZE\n  const view = new DataView(\n    mmtpPacket.buffer,\n    mmtpPacket.byteOffset + off,\n    SOURCE_FEC_PAYLOAD_ID_SIZE,\n  )\n  return { ssId: view.getUint32(0, false) }\n}\n\n/**\n * Return true when FEC_type=1 and the exact suffix after the ISO-declared MPU\n * payload contains a four-byte Source FEC Payload ID.\n */\nexport function hasSourceFecPayloadId(mmtpPacket: Uint8Array): boolean {\n  if (mmtpPacket.length < MMTP_HEADER_SIZE + MPU_HEADER_SIZE) return false\n\n  let header: MMTPHeader\n  try {\n    header = parseMMTPHeader(mmtpPacket)\n  } catch {\n    return false\n  }\n  if (header.packetType !== PACKET_TYPE_MPU) return false\n\n  const payload = mmtpPacket.subarray(header.headerLength)\n  if (payload.length < MPU_HEADER_SIZE) return false\n  const mpu = parseMPUHeader(payload)\n  if (mpu.payloadLength < MPU_HEADER_REMAINDER_SIZE) return false\n  const declaredEnd = MPU_LENGTH_FIELD_SIZE + mpu.payloadLength\n  return resolveDeclaredTrailers(payload, declaredEnd, header.fecType)?.hasFecId ?? false\n}\n\n/**\n * MMTP header-extension ext_type assigned to the detached ALTA authenticator\n * trailer (Path 2 / 08-07). Carried in an `[ext_type][ext_length][auth]`\n * block appended after the MPU's declared payload bytes, before the 4-byte\n * Source FEC Payload ID. MMTP X-bit stays 0 \u2014 non-ALTA MMTP receivers treat\n * the trailer as bytes past `payload_length` and skip it (per ISO 23008-1\n * \u00A79.2.2 \"may be discarded without impacting correct processing\").\n */\n// Re-export the ALTA trailer helper from the zero-dep leaf package. The leaf\n// owns the implementation so container and FEC consumers share one parser\n// without creating a package cycle.\nexport const MMTP_EXT_TYPE_ALTA_AUTH = _LEAF_MMTP_EXT_TYPE_ALTA_AUTH\nexport const MMTP_EXT_TRAILER_HEADER_SIZE = _LEAF_MMTP_EXT_TRAILER_HEADER_SIZE\nexport type AltaTrailer = _LeafAltaTrailer\nexport const extractAltaTrailer = _leafExtractAltaTrailer\n\n/** Size of Repair FEC Payload ID per ISO/IEC 23008-1 Section C.5.3 */\nexport const REPAIR_FEC_PID_SIZE = 13\n\n/** Parse the 13-byte Repair FEC Payload ID after the complete dynamic MMTP header. */\nfunction readRepairFecPayloadIdFields(mmtpPacket: Uint8Array): {\n  packetId: number; ssStart: number; rsbLength: number; rsId: number; ssbLength: number; dataOffset: number\n} | null {\n  let header: MMTPHeader\n  try {\n    header = parseMMTPHeader(mmtpPacket)\n  } catch {\n    return null\n  }\n  if (header.packetType !== PACKET_TYPE_REPAIR || header.fecType !== 2) return null\n\n  const off = header.headerLength\n  if (mmtpPacket.length < off + REPAIR_FEC_PID_SIZE) return null\n  const view = new DataView(mmtpPacket.buffer, mmtpPacket.byteOffset + off, REPAIR_FEC_PID_SIZE)\n  const ssStart = view.getUint32(0, false)  // 32 bits\n  const rsbLength = (mmtpPacket[off + 4]! << 16) | (mmtpPacket[off + 5]! << 8) | mmtpPacket[off + 6]!  // 24 bits\n  const rsId = (mmtpPacket[off + 7]! << 16) | (mmtpPacket[off + 8]! << 8) | mmtpPacket[off + 9]!  // 24 bits\n  const ssbLength = (mmtpPacket[off + 10]! << 16) | (mmtpPacket[off + 11]! << 8) | mmtpPacket[off + 12]!  // 24 bits\n  return {\n    packetId: header.packetId,\n    ssStart,\n    rsbLength,\n    rsId,\n    ssbLength,\n    dataOffset: off + REPAIR_FEC_PID_SIZE,\n  }\n}\n\n/**\n * Extract Repair FEC Payload ID from a raw-multicast MMTP repair packet.\n * Per ISO/IEC 23008-1:2023 Section C.5.3 (ssbg_mode0, one-stage, no FFSRP_TS):\n *   [MMTP header][SS_Start:4][RSB_length:3][RS_ID:3][SSB_length:3][repair data]\n * OTI is delivered via AL-FEC signaling message (Table C.3), not per-packet.\n *\n * Byte 1 is reserved(2)|packet_type(6) for V=0, so repair type 0x03 is 0x03.\n * Pre-migration high-bits bytes (0x0c) are rejected \u2014 no compatibility decode.\n */\nexport function extractRepairFecPayloadId(mmtpPacket: Uint8Array): {\n  ssStart: number; rsbLength: number; rsId: number; ssbLength: number\n} | null {\n  const fields = readRepairFecPayloadIdFields(mmtpPacket)\n  if (!fields) return null\n  return {\n    ssStart: fields.ssStart,\n    rsbLength: fields.rsbLength,\n    rsId: fields.rsId,\n    ssbLength: fields.ssbLength,\n  }\n}\n\n/** Parsed MoQ repair frame per ISO/IEC 23008-1 Section C.4.3 + C.5.3 */\nexport interface MoqRepairFrame {\n  /** MMTP packetId (1=video, 2=audio) \u2014 for routing to correct FEC decoder */\n  packetId: number\n  /** SS_Start (32 bits): SS_ID of first source symbol in block */\n  ssStart: number\n  /** RSB_length (24 bits): number of repair symbols (P) */\n  rsbLength: number\n  /** RS_ID (24 bits): repair symbol index (0-based) */\n  rsId: number\n  /** SSB_length (24 bits): authored source-symbol count (1..=configured K) */\n  ssbLength: number\n  /** Repair symbol data after the dynamic MMTP header and 13-byte FEC payload ID. */\n  symbolData: Uint8Array\n}\n\n/**\n * Parse a MoQ repair frame (ISO/IEC 23008-1 Annex C format).\n *\n * Wire format per ISO 23008-1 \u00A7C.4.3 + \u00A7C.5.3:\n *   MMTP Header: fixed 12 bytes plus C/X optional fields\n *   then SS_Start (4 bytes) \u2192 block identifier\n *   then RSB_length (3 bytes) \u2192 P\n *   then RS_ID (3 bytes) \u2192 ESI = K + RS_ID\n *   then SSB_length (3 bytes) \u2192 authored source-symbol count (1..=K)\n *   then Repair Symbol Data (T bytes)\n *\n * @param frame - Raw MoQ repair frame bytes\n * @returns Parsed frame or null if invalid\n */\nexport function parseMoqRepairFrame(frame: Uint8Array): MoqRepairFrame | null {\n  const repairId = readRepairFecPayloadIdFields(frame)\n  if (!repairId) return null\n\n  const symbolData = frame.subarray(repairId.dataOffset)\n  if (\n    repairId.rsbLength === 0 ||\n    repairId.ssbLength === 0 ||\n    repairId.rsId >= repairId.rsbLength ||\n    symbolData.length === 0\n  ) return null\n\n  return {\n    packetId: repairId.packetId,\n    ssStart: repairId.ssStart,\n    rsbLength: repairId.rsbLength,\n    rsId: repairId.rsId,\n    ssbLength: repairId.ssbLength,\n    symbolData,\n  }\n}\n\n/**\n * AL-FEC signaling configuration parsed from ISO/IEC 23008-1:2023 Table C.3 message.\n */\nexport interface AlFecConfig {\n  fecCodeId: number\n  fecPayloadIdMode: 0\n  repairSymbolSize: number\n  maximumK: number\n  maximumP: number\n  interleaveDepth: number\n  oti: Uint8Array\n}\n\nfunction canonicalRaptorQOtiK(oti: Uint8Array, repairSymbolSize: number): number | null {\n  if (oti.length !== 12 || oti[5] !== 0) return null\n  const transferLength = (oti[0]! * 0x1_0000_0000) +\n    (((oti[1]! << 24) | (oti[2]! << 16) | (oti[3]! << 8) | oti[4]!) >>> 0)\n  const symbolSize = (oti[6]! << 8) | oti[7]!\n  const sourceBlocks = oti[8]!\n  const subBlocks = (oti[9]! << 8) | oti[10]!\n  const alignment = oti[11]!\n  if (!Number.isSafeInteger(transferLength) || transferLength <= 0 ||\n      symbolSize !== repairSymbolSize || symbolSize === 0 || symbolSize % 8 !== 0 ||\n      sourceBlocks !== 1 || subBlocks !== 1 || alignment !== 8 ||\n      transferLength % symbolSize !== 0) {\n    return null\n  }\n  const k = transferLength / symbolSize\n  return Number.isInteger(k) && k >= 1 && k <= 56_403 ? k : null\n}\n\n/**\n * Parse AL-FEC signaling message from a full MMTP signaling packet.\n *\n * Wire format (ISO/IEC 23008-1:2023 Table C.3, Amendment 1:2025):\n *   [12-byte MMTP header (packet_type=0x02)]\n *   message_id(2)        = 0x0203\n *   version(1)\n *   message_length(2)    = length of remaining payload\n *   flags(1)             = fec_flag(1) | private_fec_flag(1) | reserved(6)\n *   fec_flow_descriptor:\n *     length(2)\n *     num_flows(1)\n *     per flow:\n *       fec_flow_id(1), source_flow_id(1), num_assets(1), packet_ids(2*N),\n *       coding_params(1), repair_symbol_size(2),\n *       [one-stage]: repair_flow_id(2), fec_code_id(1),\n *       [private_fec_flag]: private_header(1){flag(1)|len(7)},\n *         current RaptorQ profile OTI(12) + interleave_depth(1)\n *       max_k(3), max_p(3), protection_window_time(4), protection_window_size(4)\n *\n * @param mmtpPacket Full MMTP packet including 12-byte header\n * @returns Parsed config or null if not an AL-FEC signaling message\n */\nexport function parseAlFecMessage(mmtpPacket: Uint8Array): AlFecConfig | null {\n  if (mmtpPacket.length < MMTP_HEADER_SIZE + 9) return null\n  let header: MMTPHeader\n  try {\n    header = parseMMTPHeader(mmtpPacket)\n  } catch {\n    return null\n  }\n  if (header.packetType !== PACKET_TYPE_SIGNALING || header.fecType !== 0) return null\n  const payload = mmtpPacket.subarray(header.headerLength)\n  if (payload.length < 9) return null\n  const view = new DataView(payload.buffer, payload.byteOffset, payload.byteLength)\n  let off = 0\n\n  const messageId = view.getUint16(off, false); off += 2\n  if (messageId !== ALFEC_MESSAGE_ID) return null\n  const version = payload[off]!; off += 1\n  const messageLength = view.getUint16(off, false); off += 2\n  if (version !== 1 || messageLength === 0 || messageLength !== payload.length - off) return null\n\n  const flags = payload[off]!; off += 1\n  const fecFlag = (flags >> 7) & 1\n  const privateFecFlag = (flags >> 6) & 1\n  if (fecFlag !== 1 || privateFecFlag !== 1 || (flags & 0x3f) !== 0x3f) return null\n\n  if (off + 2 > payload.length) return null\n  const descriptorLength = view.getUint16(off, false); off += 2\n  const descriptorEnd = off + descriptorLength\n  if (descriptorLength === 0 || descriptorEnd !== payload.length) return null\n\n  const numFlows = payload[off]!; off += 1\n  if (numFlows !== 1 || off + 3 > descriptorEnd) return null\n\n  off += 2 // fec_flow_id, source_flow_id\n  const numAssets = payload[off]!; off += 1\n  if (numAssets === 0 || off + (numAssets * 2) > descriptorEnd) return null\n  off += numAssets * 2\n\n  if (off + 3 > descriptorEnd) return null\n  const codingParams = payload[off]!; off += 1\n  const fecCodingStructure = (codingParams >> 4) & 0x0f\n  const ssbgMode = (codingParams >> 2) & 0x03\n  const ffsrptsFlag = (codingParams >> 1) & 0x01\n  const fecPayloadIdMode = codingParams & 0x01\n  if (fecCodingStructure !== 1 || ssbgMode !== 0 || ffsrptsFlag !== 0 || fecPayloadIdMode !== 0) {\n    return null\n  }\n  const repairSymbolSize = view.getUint16(off, false); off += 2\n  if (repairSymbolSize === 0 || repairSymbolSize % 8 !== 0) return null\n\n  if (off + 4 > descriptorEnd) return null\n  off += 2 // Amendment 1:2025 replaces Table C.3 with a 16-bit repair_flow_id\n  const fecCodeId = payload[off]!; off += 1\n  if (fecCodeId !== FEC_CODE_RAPTORQ) return null\n  const privateHeader = payload[off]!; off += 1\n  const privateFlag = privateHeader >> 7\n  const privateFieldLength = privateHeader & 0x7f\n  if (privateFlag !== 1 || privateFieldLength !== 13 || off + 13 > descriptorEnd) return null\n  const oti = payload.slice(off, off + 12); off += 12\n  const interleaveDepth = payload[off]!; off += 1\n  const otiK = canonicalRaptorQOtiK(oti, repairSymbolSize)\n  if (otiK === null || interleaveDepth === 0) return null\n\n  if (off + 14 !== descriptorEnd) return null\n  const maximumK = (payload[off]! << 16) | (payload[off + 1]! << 8) | payload[off + 2]!\n  off += 3\n  const maximumP = (payload[off]! << 16) | (payload[off + 1]! << 8) | payload[off + 2]!\n  off += 3\n  if (maximumK !== otiK || maximumP === 0 || maximumK + maximumP - 1 > 0x00ff_ffff) {\n    return null\n  }\n  off += 8 // protection_window_time, protection_window_size\n  if (off !== descriptorEnd) return null\n\n  return { fecCodeId, fecPayloadIdMode, repairSymbolSize, maximumK, maximumP, interleaveDepth, oti }\n}\n", "/**\n * @mmt/container - MFU Fragment Reassembler\n *\n * Handles authored fragmented MFUs (Media Fragment Units) according to\n * ISO/IEC 23008-1:2023 Section 9.2.3.3. Fragmented runs are admitted in the\n * exact FI/fragment_counter countdown carried on the wire. FI=1 supplies the\n * intrinsic data-unit key. Every fragmented fragment is addressed by\n * (stream scope, MPU, packetSequenceNumber + fragmentCounter mod 2^32); a\n * continuation joins, parks under, or is stale against the one run holding\n * its address, and other runs are never consulted.\n *\n * Fragmentation Indicator (FI) values:\n * - 0: Complete MFU (single packet, no fragmentation)\n * - 1: First fragment\n * - 2: Middle fragment\n * - 3: Last fragment\n *\n * @packageDocumentation\n */\n\nimport { extractMFUPayload, isFecRepairPacket } from '@blockcast/mmt-base'\n\n/** Source transport admitted by the MMTP router. */\nexport type MmtpSourcePath = 'multicast' | 'moq'\n\n/**\n * Strict whole-frame delivery provenance, folded over EVERY contributing\n * fragment rather than the head fragment alone.\n *\n * This is deliberately NOT `source`. `source` answers a routing question \u2014\n * \"is this the reliable-MoQ copy that must not confirm multicast takeover?\" \u2014\n * and head-fragment-wins is the documented, deterministic answer to it.\n * Provenance answers an evidence question: \"did every byte of this frame\n * physically arrive over multicast?\" A frame with a multicast head and a\n * QUIC-delivered tail is a legitimate routing win for `source: 'multicast'`\n * and is emphatically NOT multicast-exclusive delivery.\n *\n *   - 'multicast' \u2014 every contributing fragment was explicitly multicast.\n *     The ONLY value that may be counted as physical-delivery evidence.\n *   - 'mixed'     \u2014 at least one contributing fragment arrived over MoQ.\n *   - 'unknown'   \u2014 no fragment arrived over MoQ, but at least one carried no\n *     attribution at all. Absence is preserved as its own state rather than\n *     defaulted, so a consumer cannot mistake \"never recorded\" for \"proven\".\n */\nexport type MmtpDeliveryProvenance = 'multicast' | 'mixed' | 'unknown'\n\n/**\n * Fold one fragment's `source` into a running provenance verdict.\n *\n * Fail-closed, order-independent and associative: 'mixed' absorbs everything,\n * a missing attribution degrades 'multicast' to 'unknown', and nothing ever\n * upgrades a verdict. Fold over an empty set is 'unknown' \u2014 no fragment ever\n * proved anything.\n */\nexport function foldDeliveryProvenance(\n  verdict: MmtpDeliveryProvenance,\n  source: MmtpSourcePath | undefined\n): MmtpDeliveryProvenance {\n  if (verdict === 'mixed') return 'mixed'\n  if (source === 'moq') return 'mixed'\n  if (source === undefined) return 'unknown'\n  return verdict\n}\n\n/**\n * One fragment's own provenance.\n *\n * An explicit `deliveryProvenance` wins: FEC-recovered fragments carry no\n * `source` (they were never delivered as themselves) but their block's symbol\n * provenance IS known, and the router supplies it. Falling back to `source`\n * keeps directly-delivered fragments working unchanged.\n */\nfunction fragmentProvenance(fragment: {\n  source?: MmtpSourcePath\n  deliveryProvenance?: MmtpDeliveryProvenance\n}): MmtpDeliveryProvenance {\n  if (fragment.deliveryProvenance !== undefined) return fragment.deliveryProvenance\n  if (fragment.source === 'moq') return 'mixed'\n  if (fragment.source === 'multicast') return 'multicast'\n  return 'unknown'\n}\n\n/** Strict provenance for a complete fragment set. */\nexport function deliveryProvenanceOf(\n  fragments: readonly {\n    source?: MmtpSourcePath\n    deliveryProvenance?: MmtpDeliveryProvenance\n  }[]\n): MmtpDeliveryProvenance {\n  if (fragments.length === 0) return 'unknown'\n  let verdict: MmtpDeliveryProvenance = 'multicast'\n  for (const fragment of fragments) {\n    const own = fragmentProvenance(fragment)\n    verdict =\n      verdict === 'mixed' || own === 'mixed'\n        ? 'mixed'\n        : verdict === 'unknown' || own === 'unknown'\n          ? 'unknown'\n          : 'multicast'\n  }\n  return verdict\n}\n\n/**\n * MFU Fragment for reassembly\n */\nexport interface MFUFragment {\n  fragmentationIndicator: number\n  mpuSequenceNumber: number\n  fragmentCounter: number\n  data: Uint8Array\n  timestamp: bigint\n  /** Random Access Point flag from MMTP header - indicates keyframe */\n  rapFlag: boolean\n  /** MFU DU priority. FFmpeg marks random-access samples with high priority. */\n  priority?: number\n  sampleNumber?: number\n  movieFragmentSequenceNumber?: number\n  sampleOffset?: number\n  /** Non-timed MFU Item_ID from the 4-byte DU header. */\n  itemId?: number\n  /** Authored u32 MMTP packet_sequence_number, including on recovered packets. */\n  packetSequenceNumber?: number\n  /** True when this accepted source packet was reconstructed by FEC. */\n  recovered?: boolean\n  /** Transport that supplied this accepted fragment. Absent for recovered data. */\n  source?: MmtpSourcePath\n  /**\n   * Explicit provenance for this fragment, overriding what `source` implies.\n   * Set by the router for FEC-recovered fragments, which have no `source` of\n   * their own but whose FEC block's symbol provenance is known.\n   */\n  deliveryProvenance?: MmtpDeliveryProvenance\n  /** Immutable catalog identity supplied by the owning ingress subscription. */\n  catalogTrackName?: string\n  /** Physical MMTP stream identity when no catalog identity is available. */\n  packetId?: number\n}\n\n/**\n * Reassembled MFU result\n */\nexport interface ReassembledMFU {\n  mpuSequenceNumber: number\n  /** MMTP packet_sequence_number of the first fragment in delivery order. */\n  packetSequenceNumber?: number\n  /** Every authoritative MMTP source-packet sequence that formed this MFU. */\n  packetSequenceNumbers?: number[]\n  /** Subset of packetSequenceNumbers reconstructed by FEC. */\n  repairedPacketSequenceNumbers?: number[]\n  data: Uint8Array\n  timestamp: bigint\n  fragmentCount: number\n  /** Random Access Point flag - indicates keyframe (from first fragment) */\n  rapFlag: boolean\n  /** MFU DU priority from the first fragment that carried it. */\n  priority?: number\n  sampleNumber?: number\n  movieFragmentSequenceNumber?: number\n  /**\n   * This DU's authored base byte offset within its sample (moqcast #37). 0\n   * for a whole-sample DU; nonzero identifies one subsample DU among\n   * siblings partitioning an oversized sample. Constant across the DU's own\n   * fragments \u2014 feed into a sample combiner to reassemble the full sample.\n   */\n  sampleOffset?: number\n  /**\n   * Transport that supplied the accepted FI=1 head fragment (or the complete\n   * FI=0 frame). This is the deterministic winner for mixed-path assembly.\n   *\n   * ROUTING ONLY. It describes one fragment, so it is not evidence about the\n   * whole frame \u2014 read {@link ReassembledMFU.deliveryProvenance} for that.\n   */\n  source?: MmtpSourcePath\n  /**\n   * Strict provenance folded over every contributing fragment. Only\n   * 'multicast' proves multicast-exclusive delivery of this frame.\n   */\n  deliveryProvenance: MmtpDeliveryProvenance\n  /** Catalog identity from the accepted FI=1 head fragment, or FI=0 frame. */\n  catalogTrackName?: string\n}\n\n/**\n * Reassembler statistics\n */\nexport interface ReassemblerStats {\n  totalFragments: number\n  reassembledMFUs: number\n  /** Fragments rejected by strict authored DU-state validation. */\n  rejectedFragments: number\n  /** Incomplete MFUs discarded after their configured deadline. */\n  timedOutMFUs: number\n  /** Incomplete MFUs discarded to enforce the configured memory bound. */\n  evictedMemoryLimit: number\n  outOfOrderFragments: number\n}\n\nexport const MFU_REASSEMBLY_ERROR_CODES = [\n  'invalid-fragment-state',\n  'missing-data-unit-identity',\n  'missing-packet-sequence',\n  'conflicting-data-unit-identity',\n  'overlapping-data-unit',\n  'fragment-counter-mismatch',\n  'data-unit-identity-mismatch',\n  'offset-overflow',\n  'active-data-unit-limit',\n  'incomplete-terminal-fragment',\n  'ambiguous-continuation',\n] as const\n\nexport type MfuReassemblyErrorCode = (typeof MFU_REASSEMBLY_ERROR_CODES)[number]\n\nconst mfuReassemblyErrorCodes = new Set<string>(MFU_REASSEMBLY_ERROR_CODES)\n\nexport function isMfuReassemblyErrorCode(value: unknown): value is MfuReassemblyErrorCode {\n  return typeof value === 'string' && mfuReassemblyErrorCodes.has(value)\n}\n\nexport class MfuReassemblyError extends Error {\n  readonly name = 'MfuReassemblyError'\n\n  constructor(\n    readonly code: MfuReassemblyErrorCode,\n    message: string\n  ) {\n    super(message)\n  }\n}\n\n/**\n * Identity-free test for a reassembly rejection.\n *\n * Consumers that inline `@blockcast/mmt-container` more than once (a component\n * bundle whose `@blockcast/*` dependencies each carry their own copy) end up\n * with several distinct `MfuReassemblyError` classes. An `instanceof` check\n * against one copy then misses rejections raised by another, and a per-fragment\n * rejection escapes as an uncaught throw that aborts the rest of the packet's\n * processing. The wire contract of a rejection is its name plus one of the\n * closed error codes, so that is what this guard checks.\n */\nexport function isMfuReassemblyError(error: unknown): error is MfuReassemblyError {\n  if (error instanceof MfuReassemblyError) return true\n  if (typeof error !== 'object' || error === null) return false\n  return (\n    Reflect.get(error, 'name') === 'MfuReassemblyError' &&\n    isMfuReassemblyErrorCode(Reflect.get(error, 'code'))\n  )\n}\n\nfunction assembledPacketSequences(fragments: readonly MFUFragment[]): {\n  packetSequenceNumbers?: number[]\n  repairedPacketSequenceNumbers?: number[]\n} {\n  const packetSequenceNumbers: number[] = []\n  const repairedPacketSequenceNumbers: number[] = []\n  const seen = new Set<number>()\n  const repaired = new Set<number>()\n  for (const fragment of fragments) {\n    const sequence = fragment.packetSequenceNumber\n    if (typeof sequence !== 'number' || !Number.isSafeInteger(sequence) || sequence < 0 || sequence > 0xffffffff) {\n      return {}\n    }\n    if (!seen.has(sequence)) {\n      seen.add(sequence)\n      packetSequenceNumbers.push(sequence)\n    }\n    if (fragment.recovered === true && !repaired.has(sequence)) {\n      repaired.add(sequence)\n      repairedPacketSequenceNumbers.push(sequence)\n    }\n  }\n  return { packetSequenceNumbers, repairedPacketSequenceNumbers }\n}\n\nexport interface PendingMfuDebug {\n  key: string\n  fragments: number\n  fi0: number\n  fi1: number\n  fi2: number\n  fi3: number\n  firstFi: number\n  lastFi: number\n  firstOrder: number\n  lastOrder: number\n  minCounter: number\n  maxCounter: number\n  minOffset?: number\n  maxOffset?: number\n  movieFragmentSequenceNumber?: number\n  sampleNumber?: number\n  mpuSequenceNumber?: number\n  sortedHead: Array<{\n    fi: number\n    counter: number\n    order: number\n    seq?: number\n    offset?: number\n  }>\n  sortedTail: Array<{\n    fi: number\n    counter: number\n    order: number\n    seq?: number\n    offset?: number\n  }>\n}\n\nexport interface MFUReassemblerOptions {\n  /** Timeout (ms) for incomplete MFUs. Derive from frame duration or FEC interleaveDepthMs.\n   *  Pass null for live clock-free operation; memory remains bounded by maxBuffered. */\n  timeoutMs: number | null\n  /** Max concurrent incomplete MFUs, including continuations awaiting FI=1. */\n  maxBuffered?: number\n}\n\n/** Reassembly surface consumed by MmtpContainerParser and MmtpRouter.\n * Implemented by both the TypeScript engine and the shared\n * Rust/WASM IFC adapter. */\nexport interface MfuReassemblerBackend {\n  timeoutMs: number | null\n  readonly stats: ReassemblerStats\n  onDeferredAssembly?: (result: ReassembledMFU) => void\n  /** Returns null only for a valid incomplete DU; strict rejection throws\n   * `MfuReassemblyError`. */\n  addFragment(fragment: MFUFragment): ReassembledMFU | null\n  flush(): void\n  resetStream(catalogTrackName: string): void\n  reset(): void\n  readonly pendingCount: number\n  getStatus(): {\n    bufferedMFUs: number\n    pendingFragments: number\n    pendingSamples: PendingMfuDebug[]\n    stats: ReassemblerStats\n  }\n}\n\nfunction streamScope(fragment: MFUFragment): readonly [kind: string, identity: string | number | null] {\n  if (fragment.catalogTrackName !== undefined) return ['catalog', fragment.catalogTrackName]\n  if (fragment.packetId !== undefined) return ['packet', fragment.packetId]\n  return ['unspecified', null]\n}\n\nfunction isU32(value: unknown): value is number {\n  return typeof value === 'number' && Number.isInteger(value) && value >= 0 && value <= 0xffffffff\n}\n\n/**\n * Wire address of one fragmented data unit: the physical stream scope, the\n * MPU, and `packetSequenceNumber + fragmentCounter` mod 2^32. Under the\n * contiguous-source producer profile every fragment of one data unit occupies\n * consecutive packet sequence numbers on its packet ID while\n * `fragmentCounter` counts the payloads that follow, so the sum is the\n * sequence number of the data unit's last fragment: equal for every fragment\n * of one data unit and distinct between data units of one MPU. Transport\n * association only; objectKey remains the intrinsic DU identity.\n */\nfunction dataUnitAddress(fragment: MFUFragment, packetSequenceNumber: number): string {\n  return JSON.stringify([\n    ...streamScope(fragment),\n    fragment.mpuSequenceNumber,\n    (packetSequenceNumber + fragment.fragmentCounter) >>> 0,\n  ])\n}\n\nfunction hasAnySampleIdentityField(fragment: MFUFragment): boolean {\n  return (\n    fragment.movieFragmentSequenceNumber !== undefined ||\n    fragment.sampleNumber !== undefined ||\n    fragment.sampleOffset !== undefined\n  )\n}\n\ntype IdentifiedSampleFragment = MFUFragment &\n  Required<Pick<MFUFragment, 'movieFragmentSequenceNumber' | 'sampleNumber' | 'sampleOffset'>>\n\nfunction hasSampleIdentity(fragment: MFUFragment): fragment is IdentifiedSampleFragment {\n  return (\n    isU32(fragment.movieFragmentSequenceNumber) &&\n    fragment.movieFragmentSequenceNumber > 0 &&\n    isU32(fragment.sampleNumber) &&\n    fragment.sampleNumber > 0 &&\n    isU32(fragment.sampleOffset)\n  )\n}\n\nfunction hasValidFragmentHeader(fragment: MFUFragment): boolean {\n  const { fragmentationIndicator: fi, fragmentCounter: counter } = fragment\n  if (!Number.isInteger(fi) || fi < 0 || fi > 3) return false\n  if (!Number.isInteger(counter) || counter < 0 || counter > 0xff) return false\n  return fi === 0 || fi === 3 ? counter === 0 : counter > 0\n}\n\nfunction fragmentCounterOrder(fragment: MFUFragment): number {\n  return 0xff - fragment.fragmentCounter\n}\n\nfunction objectKey(fragment: MFUFragment): string {\n  const scope = streamScope(fragment)\n  if (fragment.itemId !== undefined) {\n    return JSON.stringify([...scope, fragment.mpuSequenceNumber, 'item', fragment.itemId])\n  }\n  if (hasSampleIdentity(fragment)) {\n    return JSON.stringify([\n      ...scope,\n      fragment.mpuSequenceNumber,\n      'sample',\n      fragment.movieFragmentSequenceNumber,\n      fragment.sampleNumber,\n      // The DU's authored base offset (moqcast #37): sibling subsample DUs\n      // of one sample get distinct keys instead of colliding. Only ever\n      // called with the unmutated FI=1 (or FI=0) fragment, whose\n      // sampleOffset is that authored base -- never the accumulating\n      // per-continuation value written by #associateDataUnit.\n      fragment.sampleOffset,\n    ])\n  }\n  return JSON.stringify([...scope, fragment.mpuSequenceNumber, 'unidentified'])\n}\n\nfunction ordersByOffset(fragments: MFUFragment[]): boolean {\n  return fragments.every(fragment => hasSampleIdentity(fragment))\n}\n\ntype ActiveDataUnit = {\n  /** Wire address every continuation of this data unit carries. */\n  address: string\n  bufferKey: string\n  nextFragmentCounter: number\n  /** Monotonic admission ordinal of this data unit's slot. Never a clock. */\n  admissionSeq: number\n  catalogTrackName?: string\n} & (\n  | {\n      kind: 'sample'\n      movieFragmentSequenceNumber: number\n      sampleNumber: number\n      nextOffset: number\n    }\n  | {\n      kind: 'item'\n      itemId: number\n    }\n)\n\ninterface DataUnitAssociation {\n  bufferKey: string\n  first: boolean\n  terminal: boolean\n}\n\ninterface PendingContinuationRun {\n  fragments: Map<number, MFUFragment>\n  startedAt: number\n  /** Monotonic admission ordinal of this data unit's slot. Never a clock. */\n  admissionSeq: number\n  timeoutId?: ReturnType<typeof setTimeout>\n}\n\ninterface BufferTimeoutState {\n  startedAt: number\n  timeoutId?: ReturnType<typeof setTimeout>\n}\n\nfunction checkedSampleEnd(offset: number, byteLength: number): number | null {\n  const end = offset + byteLength\n  return Number.isSafeInteger(end) && end <= 0xffffffff ? end : null\n}\n\n/**\n * MFU Reassembler with bounded reordered-fragment association\n * Based on ISO/IEC 23008-1:2023 Section 9.2.3.3\n */\n\n/**\n * Completed-address window, as a multiple of maxBuffered. A late continuation\n * is refused as stale while its data unit's address is within this window and\n * parks as a headless data unit once the address has been forgotten. The\n * value is a cross-engine invariant shared with the Rust reassembler\n * (mmt-core COMPLETED_ADDRESS_WINDOW_MULTIPLE); change both together.\n */\nexport const COMPLETED_ADDRESS_WINDOW_MULTIPLE = 2\n\n/**\n * Cross-engine anchors for the clock-free eviction guard. The bound itself is\n * `maxBuffered`, a host parameter \u2014 these fix the one scenario both regression\n * corpora drive so the Rust and TypeScript guards assert the same boundary\n * rather than each deriving its own. Shared with the Rust reassembler\n * (`EVICTION_GUARD_MAX_BUFFERED` / `EVICTION_GUARD_DATA_UNITS` in\n * `mmt-core/src/reassembler/policy/mmt.rs`); change both together.\n *\n * `EVICTION_GUARD_DATA_UNITS` headless data units admitted against a bound of\n * `EVICTION_GUARD_MAX_BUFFERED` must evict exactly the difference.\n */\nexport const EVICTION_GUARD_MAX_BUFFERED = 4\nexport const EVICTION_GUARD_DATA_UNITS = 12\n\n/**\n * Does a parked continuation queue hold a `maxBuffered` slot of its own?\n *\n * One rule, four call sites. Two read the bound: the queue that is *counted*\n * toward it (`#unopenedParkedRunCount`) is exactly the queue that is *offered*\n * to eviction (`#evictLeastRecentlyAdmitted`). Two gate admission against it:\n * `#parkContinuation` and the FI=1 arm of `#associateDataUnit` each ask whether\n * this address is already charged before moving the bound. Stating the rule once\n * is what keeps those four answers from drifting apart \u2014 a queue that charges a\n * slot no eviction can reclaim wedges the receiver, because the bound then\n * refuses every new data unit forever with `active-data-unit-limit`.\n *\n * Two exclusions, for two different reasons:\n *\n * - **An open run owns the address.** The data unit is already charged through\n *   that run, so its queue costs nothing further.\n * - **The queue is empty.** It holds nothing, so it charges nothing and offers\n *   nothing.\n *\n * The emptiness half is belt-and-braces, not load-bearing. Both engines discard\n * an emptied queue eagerly \u2014 `#deletePendingRun` here on every drain exit,\n * `discard_empty_parked_run` in Rust \u2014 and `#parkContinuation` always inserts\n * into a queue it just created, so an empty queue is not observable today.\n * Correctness must not depend on that invariant holding in all three places per\n * engine: routing every site that asks the question through this one predicate\n * is what keeps the engines agreeing if a future edit ever misses one of them.\n *\n * Scope: this rule decides *slot accounting* \u2014 counted, offered, admitted. A\n * queue carries two further per-slot facts, its admission ordinal and its\n * retention anchor (`startedAt` plus the timer armed from it), and both must\n * move when an empty queue is charged again. `#parkContinuation` resets them\n * explicitly; Rust gets the same contract structurally, by deriving each from\n * the queue's live entries. Same contract, two mechanisms.\n *\n * The *reap schedule* asks the same question, and every site that arms a\n * parked queue reaches one function, `#armHeadlessPendingTimeout`, which takes\n * the test through this rule: `set timeoutMs` calls it for every queue when\n * the policy changes, `#parkContinuation` calls it after a created or\n * re-anchored queue holds its first fragment, and a run closing without\n * completing calls it for the queue it leaves behind. It never arms a timer\n * for an empty queue, because a timeout reports a data unit that failed to\n * complete in time and an empty queue holds no such data unit. Charging one\n * would record an MFU that never existed. No site installs a parked-queue\n * timer of its own, so neither the slot rule nor the `startedAt` anchoring can\n * drift one site at a time.\n *\n * That is the answer Rust reaches structurally: `next_timeout_at` derives\n * candidate deadlines from the queue's live entries, so an empty queue yields\n * none and no sweep is ever scheduled on its account, and `cleanup_timeouts`\n * retains by `parked_run_holds_a_slot`, so a sweep arriving for any *other*\n * queue leaves an empty one in place rather than charging\n * `record_policy_timeout` for it. Both engines therefore agree on when the\n * reap is scheduled, and the recorded statistic is unchanged for every queue\n * that really did hold a data unit: `#onPendingTimeout` charges\n * `stats.timedOutMFUs`, the shape Rust's `record_policy_timeout` produces, and\n * takes the same slot test before charging, so the statistic cannot be\n * recorded for an empty queue whatever order the arming sites run in.\n *\n * The trade this makes, in both engines: a queue that is emptied without being\n * discarded is invisible to the reap schedule, to the slot count, and to\n * eviction, so nothing reclaims it until `reset()` clears the policy state.\n * Disposal of an emptied queue therefore rests entirely on the eager discard\n * sites (`#deletePendingRun` here, `discard_empty_parked_run` in Rust), where\n * it is housekeeping rather than an expiry; a drain exit that skips that call\n * leaks the queue for the life of the reassembler rather than charging a\n * phantom timeout for it. Converged under BLO-32420. The arming half of this\n * rule is pinned in `mfu-reassembler-eviction.test.ts`: a headless queue that\n * holds fragments is armed by `set timeoutMs` and by its run closing, and\n * disarmed by `timeoutMs = null`. The emptiness half is Rust-only, because\n * `#pendingContinuations` is unreachable from this package's tests.\n *\n * The public counters are a separate matter and *are* governed: `pendingCount`\n * \u2014 and through it `getStatus().bufferedMFUs` \u2014 delegates to\n * `#unopenedParkedRunCount`, exactly as Rust's `buffered_count` is built on\n * `unopened_parked_run_count`. Filtering either on the open run alone makes the\n * engines report different numbers for the same state out of a host-observable\n * API.\n *\n * Twin of `parked_run_holds_a_slot` in\n * `mmt-core/src/reassembler/policy/mmt.rs`; change both together.\n */\nexport function parkedRunHoldsASlot(hasOpenRun: boolean, fragmentCount: number): boolean {\n  return !hasOpenRun && fragmentCount > 0\n}\n\nexport class MFUReassembler {\n  // Fragment buffers and active runs use the authored MFU DU identity.\n  // Continuations may wait in one counter-indexed queue per data-unit address\n  // until FI=1 supplies that identity. The address is transport association\n  // only; the object key stays the intrinsic DU identity.\n  #buffers: Map<string, MFUFragment[]> = new Map()\n  #timeouts: Map<string, BufferTimeoutState> = new Map()\n  #activeDataUnits: Map<string, ActiveDataUnit> = new Map()\n  #pendingContinuations: Map<string, PendingContinuationRun> = new Map()\n  #emitted: Set<string> = new Set() // same sample keys, so FEC-recovered duplicate heads are dropped\n  #emittedOrder: string[] = []\n  // Addresses of emitted data units. A continuation addressed to one of them\n  // is a late copy of a fragment the run already consumed (FEC recovery\n  // supplied it first), so it is rejected as stale rather than parked as a\n  // headless data unit that would hold a slot until reset. Bounded at\n  // COMPLETED_ADDRESS_WINDOW_MULTIPLE x maxBuffered, the same window the Rust\n  // engine keeps, so both engines forget an address after the same number of\n  // completions. (#emitted is a separate, per-engine window: this engine keeps\n  // maxBuffered sample keys where Rust keeps 2x; the completed set does not\n  // derive from it.)\n  #completed: Set<string> = new Set()\n  #completedOrder: string[] = []\n  #timeoutMs: number | null\n  #maxBuffered: number\n  /**\n   * Monotonic admission ordinal. Counts slot admissions, never reads a clock,\n   * so eviction order survives on hosts that run `timeoutMs: null`.\n   */\n  #nextAdmissionSeq = 0\n\n  /** Statistics for debugging */\n  readonly stats: ReassemblerStats = {\n    totalFragments: 0,\n    reassembledMFUs: 0,\n    rejectedFragments: 0,\n    timedOutMFUs: 0,\n    evictedMemoryLimit: 0,\n    outOfOrderFragments: 0,\n  }\n\n  constructor(options: MFUReassemblerOptions) {\n    if (options.timeoutMs !== null && (!Number.isFinite(options.timeoutMs) || options.timeoutMs <= 0)) {\n      throw new Error('[MFUReassembler] timeoutMs must be > 0 (derive from frame duration or FEC config)')\n    }\n    const maxBuffered = options.maxBuffered ?? 100\n    if (!Number.isInteger(maxBuffered) || maxBuffered <= 0) {\n      throw new Error('[MFUReassembler] maxBuffered must be a positive integer')\n    }\n    this.#timeoutMs = options.timeoutMs\n    this.#maxBuffered = maxBuffered\n  }\n\n  /** Update the expiry policy for all retained and future incomplete MFUs. */\n  set timeoutMs(ms: number | null) {\n    if (ms !== null && (!Number.isFinite(ms) || ms <= 0)) {\n      throw new Error('[MFUReassembler] timeoutMs must be > 0 (derive from frame duration or FEC config)')\n    }\n    this.#timeoutMs = ms\n    const now = Date.now()\n    for (const [bufferKey, state] of this.#timeouts) {\n      if (state.timeoutId !== undefined) clearTimeout(state.timeoutId)\n      delete state.timeoutId\n      if (ms !== null) {\n        state.timeoutId = setTimeout(() => this.#onTimeout(bufferKey), Math.max(0, state.startedAt + ms - now))\n      }\n    }\n    // Parked queues re-arm through the one arming function, which reads the\n    // new policy from `#timeoutMs` (assigned above) and keeps each queue on its\n    // own `startedAt` anchor. Clearing first releases any timer armed under the\n    // old policy so the helper's already-armed guard cannot skip the re-arm.\n    for (const address of this.#pendingContinuations.keys()) {\n      this.#clearPendingTimeout(address)\n      this.#armHeadlessPendingTimeout(address)\n    }\n  }\n  get timeoutMs(): number | null {\n    return this.#timeoutMs\n  }\n\n  /**\n   * Add a fragment and return reassembled MFU if complete\n   */\n  addFragment(fragment: MFUFragment): ReassembledMFU | null {\n    this.stats.totalFragments++\n\n    if (!hasValidFragmentHeader(fragment)) {\n      this.#reject('invalid-fragment-state', 'invalid MFU fragmentation indicator or counter')\n    }\n    if (fragment.itemId !== undefined && hasAnySampleIdentityField(fragment)) {\n      this.#reject('conflicting-data-unit-identity', 'MFU carries timed and non-timed DU identities')\n    }\n\n    const { mpuSequenceNumber, fragmentationIndicator } = fragment\n\n    // A complete FT=2 data unit still requires its intrinsic DU identity.\n    // The transport parser strips the deterministic timed/non-timed DU header\n    // before calling this layer; direct callers must provide the same identity.\n    // Don't check or update #emitted: in MMTP over MoQ, multiple complete MFUs\n    // share the same mpuSequenceNumber (all frames in a GOP have the same mpuSeq).\n    // Blocking FI=0 would prevent keyframe fragment assembly at the same mpuSeq.\n    if (fragmentationIndicator === 0) {\n      const sampleIdentity = hasSampleIdentity(fragment)\n      const hasSampleFields = hasAnySampleIdentityField(fragment)\n      const hasItemIdentity = fragment.itemId !== undefined\n      if (!sampleIdentity && !hasItemIdentity) {\n        this.#reject('missing-data-unit-identity', 'complete MFU has no intrinsic DU identity')\n      }\n      if (hasSampleFields && !sampleIdentity) {\n        this.#reject('missing-data-unit-identity', 'complete MFU has an incomplete sample identity')\n      }\n      if (hasItemIdentity && !isU32(fragment.itemId)) {\n        this.#reject('missing-data-unit-identity', 'complete MFU has an invalid Item_ID')\n      }\n      this.stats.reassembledMFUs++\n      return {\n        mpuSequenceNumber,\n        packetSequenceNumber: fragment.packetSequenceNumber,\n        ...assembledPacketSequences([fragment]),\n        data: fragment.data,\n        timestamp: fragment.timestamp,\n        fragmentCount: 1,\n        rapFlag: fragment.rapFlag,\n        priority: fragment.priority,\n        sampleNumber: fragment.sampleNumber,\n        movieFragmentSequenceNumber: fragment.movieFragmentSequenceNumber,\n        sampleOffset: fragment.sampleOffset,\n        source: fragment.source,\n        deliveryProvenance: deliveryProvenanceOf([fragment]),\n        catalogTrackName: fragment.catalogTrackName,\n      }\n    }\n\n    const sequence = fragment.packetSequenceNumber\n    if (!isU32(sequence)) {\n      this.#reject('missing-packet-sequence', 'fragmented MFU has no MMTP packet sequence number')\n    }\n    const address = dataUnitAddress(fragment, sequence)\n\n    if (fragmentationIndicator !== 1) {\n      // Attribution is an exact per-data-unit lookup. The continuation joins\n      // the one open run holding its address when its counter is that run's\n      // next. It is stale when the run has already counted past the counter,\n      // or when the data unit was already emitted: the position was accepted\n      // once, so no run can ever take it again. Otherwise (no open run at this\n      // address, or the run has not reached the counter yet) it parks under\n      // its own address. Other runs' counters are never consulted.\n      const open = this.#openRunAt(address)\n      if (open === undefined) {\n        if (this.#completed.has(address)) {\n          this.#reject('fragment-counter-mismatch', 'MFU continuation names a data unit that already completed')\n        }\n        this.#parkContinuation(address, fragment)\n        return null\n      }\n      const [runKey, active] = open\n      if (active.nextFragmentCounter > fragment.fragmentCounter) {\n        this.#parkContinuation(address, fragment)\n        return null\n      }\n      if (active.nextFragmentCounter < fragment.fragmentCounter) {\n        this.#reject('fragment-counter-mismatch', 'MFU continuation is behind the authored fragment-counter countdown')\n      }\n      const result = this.#addAssociatedFragment(fragment, runKey, address)\n      if (result !== null) return result\n      return this.#drainPendingContinuations(address, runKey)\n    }\n\n    const runKey = objectKey(fragment)\n    if ((hasSampleIdentity(fragment) || isU32(fragment.itemId)) && this.#emitted.has(runKey)) {\n      // The identity already emitted, so this first fragment is a duplicate\n      // and is dropped. Queues under other addresses belong to other data\n      // units and are untouched.\n      return null\n    }\n    if (this.#activeDataUnits.has(runKey)) {\n      this.#reject('overlapping-data-unit', 'fragmented MFU overlaps an active data unit')\n    }\n    // Two heads with one address are one data unit delivered twice or an\n    // identity clash on the wire. The established run keeps the address.\n    if (this.#openRunAt(address) !== undefined) {\n      this.#reject('overlapping-data-unit', 'fragmented MFU opens on an address held by an open data unit')\n    }\n    const pending = this.#pendingContinuations.get(address)\n    // A parked continuation of this data unit cannot carry a counter at or\n    // above its own head's countdown.\n    if (pending !== undefined && [...pending.fragments.keys()].some(counter => counter >= fragment.fragmentCounter)) {\n      this.#reject(\n        'fragment-counter-mismatch',\n        'queued continuation counter is not below the authored first-fragment counter'\n      )\n    }\n\n    // The run's deadline starts at the earliest arrival of its own fragments.\n    const result = this.#addAssociatedFragment(fragment, runKey, address, pending?.startedAt)\n    this.#clearPendingTimeout(address)\n    if (result !== null) return result\n    return this.#drainPendingContinuations(address, runKey)\n  }\n\n  #addAssociatedFragment(\n    fragment: MFUFragment,\n    runKey: string,\n    address: string,\n    startedAt?: number\n  ): ReassembledMFU | null {\n    const association = this.#associateDataUnit(fragment, runKey, address)\n    const { bufferKey, first, terminal } = association\n\n    let fragments = this.#buffers.get(bufferKey)\n    if (first) {\n      if (fragments !== undefined) {\n        this.#reject('overlapping-data-unit', 'intrinsic data-unit buffer already exists')\n      }\n      fragments = []\n      this.#buffers.set(bufferKey, fragments)\n    } else if (fragments === undefined) {\n      throw new Error('[MFUReassembler] active data unit has no fragment buffer')\n    }\n\n    // A lossy-path deadline is measured from the first received fragment,\n    // including a continuation that arrived before FI=1. Reliable paths are\n    // clock-free and never install this timer.\n    if (first) this.#setTimeout(bufferKey, startedAt)\n    fragments.push(fragment)\n\n    if (!terminal) return null\n    const result = this.#tryReassemble(bufferKey)\n    this.#activeDataUnits.delete(runKey)\n    if (result === null) {\n      this.#clearTimeout(bufferKey)\n      this.#buffers.delete(bufferKey)\n      this.#reject('incomplete-terminal-fragment', 'validated terminal fragment did not complete its data unit')\n    }\n    this.#markCompleted(address)\n    return result\n  }\n\n  #parkContinuation(address: string, fragment: MFUFragment): void {\n    let pending = this.#pendingContinuations.get(address)\n    const open = this.#openRunAt(address)\n    // A data unit is charged one slot: through its open run, or through its\n    // queue while no run is open. Parking under an address that is already\n    // charged adds nothing to the bound, so admission is judged by what this\n    // fragment would add, not by the total alone. The queue half routes through\n    // `parkedRunHoldsASlot` rather than restating it, so this gate cannot drift\n    // from the sites that count and evict by it: an empty queue charges nothing\n    // here for the same reason it is offered nothing there. Gating on\n    // `pending === undefined` instead would skip the bound entirely for a queue\n    // that exists but holds nothing, overshooting `maxBuffered` by one while\n    // Rust evicts \u2014 the cross-engine split BLO-31813 exists to close.\n    const alreadyCharged =\n      open !== undefined || parkedRunHoldsASlot(open !== undefined, pending?.fragments.size ?? 0)\n    if (!alreadyCharged && this.#incompleteRunCount() >= this.#maxBuffered) {\n      // `open` and `pending` are captured above, and eviction can delete from\n      // `#pendingContinuations` \u2014 so both are read across a mutation. Neither\n      // goes stale, and the predicate is what makes that true: eviction only\n      // runs when `open === undefined`, and an empty queue is not a candidate,\n      // so the record the `else if` below writes to cannot be the one released\n      // here. Re-read both if that rule is ever loosened.\n      if (!this.#evictLeastRecentlyAdmitted()) {\n        this.#reject('active-data-unit-limit', 'active MFU data-unit limit reached')\n      }\n    }\n    // Both branches below leave the timer to `#armHeadlessPendingTimeout`,\n    // called once the fragment is in, so the queue is armed only while it\n    // holds a data unit and through the same slot rule as every other site.\n    let armAfterInsert = false\n    if (pending === undefined) {\n      // A queue opened under an already-charged address inherits that slot's\n      // ordinal, so a run does not renew its admission by parking a fragment.\n      // The arm below is a no-op under an open run: the run's own deadline\n      // covers the data unit, and `#armHeadlessPendingTimeout` tests for it.\n      pending = {\n        fragments: new Map(),\n        startedAt: Date.now(),\n        admissionSeq: open !== undefined ? open[1].admissionSeq : this.#nextAdmissionSeq++,\n      }\n      this.#pendingContinuations.set(address, pending)\n      armAfterInsert = true\n    } else if (!alreadyCharged) {\n      // A queue that exists but holds nothing charged no slot, so this fragment\n      // is a fresh admission \u2014 and every per-slot fact the record still carries\n      // describes an occupancy that ended when its last entry left. Rust derives\n      // all of them from the queue's *live* entries, so re-parking moves them\n      // together; TypeScript caches them as fields written once at creation, so\n      // they have to be reset together here or the queue goes transparent to the\n      // bound while staying stale on its deadline:\n      //\n      // - Ordinal. `slot_admission_seq` mins over the entries and an empty queue\n      //   has none, so Rust mints a fresh one. Decides victim ordering.\n      // - Retention anchor. `cleanup_timeouts` retains on `min(received_at)`,\n      //   which a re-parked entry moves forward. Left stale, `#onPendingTimeout`\n      //   can discard the queue on the emptied queue's deadline while it holds a\n      //   fragment that was just charged a slot \u2014 and that may have evicted\n      //   another data unit to get it.\n      // - Armed timer. `#armHeadlessPendingTimeout` anchors on `startedAt` and\n      //   arms only a queue that holds a fragment, so the re-arm runs once this\n      //   fragment is in (below), where the creation branch arms too, rather\n      //   than here, where the queue is still empty and the call would arm\n      //   nothing. Any timer left on the record is cleared first so the queue\n      //   cannot keep running on the old anchor.\n      //\n      // `Date.now()` here is the same retention anchor the queue-creation branch\n      // above already reads, not a clock in the admission order: the ordinal\n      // stays a monotonic sequence, so eviction remains clock-free per PR #93.\n      //\n      // Unreachable while every drain exit discards an emptied queue; pinned so\n      // the engines cannot pick different victims \u2014 or different expiries \u2014 if\n      // one ever misses a discard site.\n      pending.admissionSeq = this.#nextAdmissionSeq++\n      pending.startedAt = Date.now()\n      this.#clearPendingTimeout(address)\n      armAfterInsert = true\n    }\n    // The same data unit naming the same countdown position twice: the first\n    // parked copy is kept.\n    if (pending.fragments.has(fragment.fragmentCounter)) {\n      this.#reject('fragment-counter-mismatch', 'duplicate queued continuation counter would replace retained media')\n    }\n    pending.fragments.set(fragment.fragmentCounter, fragment)\n    // A created or re-anchored queue holds its first fragment only now, so this\n    // is the first point at which `#armHeadlessPendingTimeout` arms it. With\n    // `startedAt` set one tick earlier the deadline it computes is the full\n    // `timeoutMs`, the same schedule a raw timer armed at creation would have\n    // kept. The duplicate check above cannot reject on this path: both branches\n    // that set the flag run exactly when the queue is empty.\n    if (armAfterInsert) this.#armHeadlessPendingTimeout(address)\n  }\n\n  #drainPendingContinuations(address: string, runKey: string): ReassembledMFU | null {\n    while (true) {\n      const active = this.#activeDataUnits.get(runKey)\n      const pending = this.#pendingContinuations.get(address)\n      if (active === undefined) {\n        // The run closed. Its queue holds only this data unit's fragments;\n        // drop it once empty so it is not counted as a headless data unit.\n        if (pending?.fragments.size === 0) this.#deletePendingRun(address)\n        return null\n      }\n      const fragment = pending?.fragments.get(active.nextFragmentCounter)\n      if (fragment === undefined) {\n        if (pending?.fragments.size === 0) this.#deletePendingRun(address)\n        return null\n      }\n      pending!.fragments.delete(active.nextFragmentCounter)\n      if (pending!.fragments.size === 0) this.#deletePendingRun(address)\n      const result = this.#addAssociatedFragment(fragment, runKey, address)\n      if (result !== null) {\n        return result\n      }\n    }\n  }\n\n  /** Parked data units that hold a `maxBuffered` slot of their own. Membership\n   * is `parkedRunHoldsASlot`, the same rule #evictLeastRecentlyAdmitted offers\n   * as candidates, so nothing can be counted here that eviction cannot reclaim.\n   *\n   * One site, two callers \u2014 `#incompleteRunCount` and `pendingCount` \u2014 mirroring\n   * Rust's `unopened_parked_run_count`, which `incomplete_run_count` and\n   * `buffered_count` both delegate to. Both callers used to inline this loop\n   * verbatim, so converging the *rule* moved one copy and left the other as the\n   * divergence (Ally's review of #400). The rule can no longer drift now that\n   * every site routes through `parkedRunHoldsASlot`; keeping the loop itself at\n   * one site is what stops the scaffolding drifting the next time this question\n   * grows an argument. */\n  #unopenedParkedRunCount(): number {\n    let count = 0\n    for (const [address, pending] of this.#pendingContinuations) {\n      if (parkedRunHoldsASlot(this.#openRunAt(address) !== undefined, pending.fragments.size)) {\n        count++\n      }\n    }\n    return count\n  }\n\n  /** Every open run plus every headless parked data unit that holds a slot,\n   * one slot each. This is the quantity maxBuffered bounds. The parked term is\n   * `#unopenedParkedRunCount`, whose membership is `parkedRunHoldsASlot` \u2014 the\n   * same rule #evictLeastRecentlyAdmitted offers as candidates, so nothing can\n   * be counted here that eviction cannot reclaim. */\n  #incompleteRunCount(): number {\n    return this.#activeDataUnits.size + this.#unopenedParkedRunCount()\n  }\n\n  /**\n   * Drop the incomplete data unit admitted longest ago so a newly arriving one\n   * can take its slot. Selection is by monotonic admission ordinal, never by\n   * wall clock, so this is a bounded-capacity replacement policy and not a\n   * timeout: it behaves identically on hosts that never drive `cleanup_timeouts`\n   * (`timeoutMs: null`). Only incomplete data units are candidates \u2014 a data\n   * unit that completed has already left both maps.\n   *\n   * Returns false only if no slot is charged, which cannot happen at the bound\n   * (`maxBuffered` is a positive integer); admission then falls back to the\n   * fail-closed `active-data-unit-limit` reject, which stays a stable host code.\n   * That holds because the candidate set here is built from the same\n   * `parkedRunHoldsASlot` rule `#incompleteRunCount` counts by, so reaching the\n   * bound implies at least one candidate. Filtering one and not the other would\n   * make the claim false: a queue counted but not offered charges a slot no\n   * eviction can reclaim, and the receiver refuses every later data unit\n   * permanently.\n   */\n  #evictLeastRecentlyAdmitted(): boolean {\n    let victimAddress: string | undefined\n    let victimSeq = Number.POSITIVE_INFINITY\n    for (const [, active] of this.#activeDataUnits) {\n      if (active.admissionSeq < victimSeq) {\n        victimSeq = active.admissionSeq\n        victimAddress = active.address\n      }\n    }\n    for (const [address, pending] of this.#pendingContinuations) {\n      // Exactly the queues #incompleteRunCount charges a slot to: a queue under\n      // an open run is that run's slot, already considered above, and an empty\n      // queue holds nothing to evict.\n      if (!parkedRunHoldsASlot(this.#openRunAt(address) !== undefined, pending.fragments.size)) {\n        continue\n      }\n      if (pending.admissionSeq < victimSeq) {\n        victimSeq = pending.admissionSeq\n        victimAddress = address\n      }\n    }\n    if (victimAddress === undefined) return false\n    this.#releaseSlot(victimAddress)\n    this.stats.evictedMemoryLimit++\n    return true\n  }\n\n  /**\n   * Release every form of state one address holds: its open run, that run's\n   * buffered fragments and deadline, and its continuation queue. The address is\n   * deliberately not marked completed \u2014 the data unit never emitted, so a later\n   * fragment of it may open a fresh slot rather than being rejected as stale.\n   */\n  #releaseSlot(address: string): void {\n    const open = this.#openRunAt(address)\n    if (open !== undefined) {\n      const [runKey, active] = open\n      this.#activeDataUnits.delete(runKey)\n      this.#clearTimeout(active.bufferKey)\n      this.#buffers.delete(active.bufferKey)\n    }\n    this.#deletePendingRun(address)\n  }\n\n  #reject(code: MfuReassemblyErrorCode, message: string): never {\n    this.stats.rejectedFragments++\n    throw new MfuReassemblyError(code, message)\n  }\n\n  #associateDataUnit(fragment: MFUFragment, runKey: string, address: string): DataUnitAssociation {\n    const fi = fragment.fragmentationIndicator\n    if (fi === 1) {\n      // Opening a run is free when this data unit already holds a parked\n      // slot: the run inherits it, so the bound does not move.\n      //\n      // A second head on an open address is refused upstream, so no run is open\n      // here. Read that live rather than assume it, and route the answer through\n      // `parkedRunHoldsASlot`, so this gate is the fourth site of one rule\n      // instead of a fourth restatement of it. `parked` is non-null wherever\n      // this is true, because the rule requires a non-empty queue.\n      const parked = this.#pendingContinuations.get(address)\n      const inheritsParkedSlot = parkedRunHoldsASlot(\n        this.#openRunAt(address) !== undefined,\n        parked?.fragments.size ?? 0,\n      )\n\n      // Resolve identity and byte extent BEFORE taking a slot. Eviction\n      // replaces a healthy data unit, so it must only ever run for a fragment\n      // that is going to be admitted -- a reject reached after eviction would\n      // destroy valid state and break the contract these rejects exist to\n      // uphold (\"without advancing or replacing valid state\"). addFragment\n      // pre-validates only the FI/counter pair and the itemId/sample-field\n      // conflict, so every reject below is reachable at the bound.\n      const sampleIdentity = hasSampleIdentity(fragment)\n      const hasSampleFields = hasAnySampleIdentityField(fragment)\n      const hasItemIdentity = fragment.itemId !== undefined\n      if (sampleIdentity && hasItemIdentity) {\n        this.#reject('conflicting-data-unit-identity', 'fragmented MFU carries timed and non-timed DU identities')\n      }\n      if (!sampleIdentity && !hasItemIdentity) {\n        this.#reject('missing-data-unit-identity', 'first fragment has no intrinsic DU identity')\n      }\n      if (hasSampleFields && !sampleIdentity) {\n        this.#reject('missing-data-unit-identity', 'first fragment has an incomplete sample identity')\n      }\n      if (hasItemIdentity && !isU32(fragment.itemId)) {\n        this.#reject('missing-data-unit-identity', 'first fragment has an invalid Item_ID')\n      }\n\n      const bufferKey = objectKey(fragment)\n      if (this.#buffers.has(bufferKey)) {\n        this.#reject('overlapping-data-unit', 'intrinsic data-unit buffer already exists')\n      }\n\n      let sampleEnd: number | null = null\n      if (sampleIdentity) {\n        sampleEnd = checkedSampleEnd(fragment.sampleOffset, fragment.data.byteLength)\n        if (sampleEnd === null) this.#reject('offset-overflow', 'sample byte offset overflow')\n      }\n\n      // The fragment is admissible from here on, so charging it a slot cannot\n      // be undone by a later reject. A second head on an open address was\n      // already refused upstream, so this address holds no run and can never\n      // be its own eviction victim.\n      if (!inheritsParkedSlot && this.#incompleteRunCount() >= this.#maxBuffered) {\n        if (!this.#evictLeastRecentlyAdmitted()) {\n          this.#reject('active-data-unit-limit', 'active MFU data-unit limit reached')\n        }\n      }\n      // An inherited slot keeps the ordinal it was admitted with: the head\n      // arriving late does not make the data unit younger than one parked\n      // after it.\n      const admissionSeq = inheritsParkedSlot ? parked!.admissionSeq : this.#nextAdmissionSeq++\n\n      let active: ActiveDataUnit\n      if (sampleIdentity) {\n        active = {\n          address,\n          kind: 'sample',\n          bufferKey,\n          nextFragmentCounter: fragment.fragmentCounter - 1,\n          admissionSeq,\n          movieFragmentSequenceNumber: fragment.movieFragmentSequenceNumber,\n          sampleNumber: fragment.sampleNumber,\n          nextOffset: sampleEnd!,\n          ...(fragment.catalogTrackName === undefined ? {} : { catalogTrackName: fragment.catalogTrackName }),\n        }\n      } else {\n        active = {\n          address,\n          kind: 'item',\n          bufferKey,\n          nextFragmentCounter: fragment.fragmentCounter - 1,\n          admissionSeq,\n          itemId: fragment.itemId!,\n          ...(fragment.catalogTrackName === undefined ? {} : { catalogTrackName: fragment.catalogTrackName }),\n        }\n      }\n      this.#activeDataUnits.set(objectKey(fragment), active)\n      return { bufferKey, first: true, terminal: false }\n    }\n\n    const active = this.#activeDataUnits.get(runKey)\n    if (active === undefined) {\n      throw new Error('[MFUReassembler] continuation was not parked before association')\n    }\n    if (fragment.fragmentCounter !== active.nextFragmentCounter) {\n      this.#reject(\n        'fragment-counter-mismatch',\n        'MFU continuation does not follow the authored fragment-counter countdown'\n      )\n    }\n\n    if (active.kind === 'sample') {\n      if (fragment.itemId !== undefined) {\n        this.#reject('data-unit-identity-mismatch', 'sample continuation carries an Item_ID')\n      }\n      if (\n        hasAnySampleIdentityField(fragment) &&\n        (!hasSampleIdentity(fragment) ||\n          fragment.movieFragmentSequenceNumber !== active.movieFragmentSequenceNumber ||\n          fragment.sampleNumber !== active.sampleNumber ||\n          fragment.sampleOffset !== active.nextOffset)\n      ) {\n        this.#reject('data-unit-identity-mismatch', 'sample continuation identity does not match')\n      }\n      const nextOffset = checkedSampleEnd(active.nextOffset, fragment.data.byteLength)\n      if (nextOffset === null) this.#reject('offset-overflow', 'sample byte offset overflow')\n      fragment.movieFragmentSequenceNumber = active.movieFragmentSequenceNumber\n      fragment.sampleNumber = active.sampleNumber\n      fragment.sampleOffset = active.nextOffset\n      if (fi === 2) {\n        active.nextOffset = nextOffset\n        active.nextFragmentCounter = fragment.fragmentCounter - 1\n      }\n    } else {\n      if (hasAnySampleIdentityField(fragment) || (fragment.itemId !== undefined && fragment.itemId !== active.itemId)) {\n        this.#reject('data-unit-identity-mismatch', 'Item_ID continuation identity does not match')\n      }\n      fragment.itemId = active.itemId\n      if (fi === 2) active.nextFragmentCounter = fragment.fragmentCounter - 1\n    }\n\n    return {\n      bufferKey: active.bufferKey,\n      first: false,\n      terminal: fi === 3,\n    }\n  }\n\n  #tryReassemble(bufferKey: string): ReassembledMFU | null {\n    const fragments = this.#buffers.get(bufferKey)\n    if (!fragments || fragments.length === 0) {\n      return null\n    }\n\n    const sorted = [...fragments].sort((a, b) => this.#orderValue(a) - this.#orderValue(b))\n\n    if (sorted[0]!.fragmentationIndicator !== 1 || sorted[sorted.length - 1]!.fragmentationIndicator !== 3) {\n      return null\n    }\n    if (sorted.slice(1, -1).some(fragment => fragment.fragmentationIndicator !== 2)) {\n      return null\n    }\n\n    // ISO fragment_counter is the number of succeeding payloads. After\n    // normalization (`255 - counter`), a complete non-wrapping chain is strictly\n    // consecutive. This also caps a data unit at 256 payloads.\n    for (let i = 1; i < sorted.length; i++) {\n      if (this.#orderValue(sorted[i]!) !== this.#orderValue(sorted[i - 1]!) + 1) {\n        return null\n      }\n    }\n\n    // When every fragment carries a timed-MFU byte offset, independently prove\n    // byte adjacency within this data unit. Counter order remains authoritative;\n    // conflicting offsets fail closed instead of changing the fragment order.\n    // sorted[0]'s offset is this DU's authored base (moqcast #37: zero for a\n    // whole-sample DU, nonzero for one subsample DU of a partitioned sample) --\n    // never asserted against a literal zero.\n    if (ordersByOffset(sorted)) {\n      for (let i = 1; i < sorted.length; i++) {\n        const previous = sorted[i - 1]!\n        if (sorted[i]!.sampleOffset !== previous.sampleOffset! + previous.data.byteLength) {\n          return null\n        }\n      }\n    }\n\n    fragments.splice(0, fragments.length, ...sorted)\n    return this.#assemble(bufferKey, fragments)\n  }\n\n  #assemble(bufferKey: string, fragments: MFUFragment[]): ReassembledMFU {\n    // Reassemble: concatenate all fragment data\n    const totalSize = fragments.reduce((sum, f) => sum + f.data.length, 0)\n    const data = new Uint8Array(totalSize)\n\n    let offset = 0\n    for (const fragment of fragments) {\n      data.set(fragment.data, offset)\n      offset += fragment.data.length\n    }\n\n    // Cleanup + mark the intrinsic identity as emitted to prevent a recovered\n    // duplicate from starting another fragmented run.\n    this.#clearTimeout(bufferKey)\n    this.#buffers.delete(bufferKey)\n    this.#markEmitted(bufferKey)\n    this.stats.reassembledMFUs++\n\n    return {\n      mpuSequenceNumber: fragments[0]!.mpuSequenceNumber,\n      packetSequenceNumber: fragments[0]!.packetSequenceNumber,\n      ...assembledPacketSequences(fragments),\n      data,\n      timestamp: fragments[0]!.timestamp,\n      fragmentCount: fragments.length,\n      rapFlag: fragments[0]!.rapFlag,\n      priority: fragments.find(f => f.priority !== undefined)?.priority,\n      sampleNumber: fragments[0]!.sampleNumber,\n      movieFragmentSequenceNumber: fragments[0]!.movieFragmentSequenceNumber,\n      sampleOffset: fragments[0]!.sampleOffset,\n      source: fragments[0]!.source,\n      deliveryProvenance: deliveryProvenanceOf(fragments),\n      catalogTrackName: fragments[0]!.catalogTrackName,\n    }\n  }\n\n  #setTimeout(bufferKey: string, startedAt = Date.now()): void {\n    const state: BufferTimeoutState = { startedAt }\n    if (this.#timeoutMs !== null) {\n      state.timeoutId = setTimeout(\n        () => this.#onTimeout(bufferKey),\n        Math.max(0, startedAt + this.#timeoutMs - Date.now())\n      )\n    }\n    this.#timeouts.set(bufferKey, state)\n  }\n\n  #clearPendingTimeout(address: string): void {\n    const pending = this.#pendingContinuations.get(address)\n    if (pending?.timeoutId !== undefined) clearTimeout(pending.timeoutId)\n    if (pending !== undefined) {\n      delete pending.timeoutId\n    }\n  }\n\n  /**\n   * A queue whose run closed without completing is headless again and expires\n   * from its own first arrival, exactly as it would had the head never come.\n   *\n   * An empty queue is not armed: it holds no data unit that could fail to\n   * complete, so there is nothing for a deadline to expire. Every arming site\n   * reaches this function, which takes that test through `parkedRunHoldsASlot`\n   * rather than filtering on the open run alone, which is how this engine\n   * reaches Rust's answer: its\n   * `next_timeout_at` derives candidate deadlines from the queue's live\n   * entries, so an empty queue yields none (BLO-32420).\n   */\n  #armHeadlessPendingTimeout(address: string): void {\n    const pending = this.#pendingContinuations.get(address)\n    if (pending === undefined || pending.timeoutId !== undefined || this.#timeoutMs === null) return\n    if (!parkedRunHoldsASlot(this.#openRunAt(address) !== undefined, pending.fragments.size)) return\n    pending.timeoutId = setTimeout(\n      () => this.#onPendingTimeout(address),\n      Math.max(0, pending.startedAt + this.#timeoutMs - Date.now())\n    )\n  }\n\n  #deletePendingRun(address: string): void {\n    this.#clearPendingTimeout(address)\n    this.#pendingContinuations.delete(address)\n  }\n\n  #onPendingTimeout(address: string): void {\n    const pending = this.#pendingContinuations.get(address)\n    if (pending === undefined) return\n    // The charging site takes the same slot rule as the arming sites, evaluated\n    // live at expiry the way Rust's `cleanup_timeouts` evaluates it at sweep\n    // time: a queue that holds no slot is retained rather than charged\n    // `record_policy_timeout`. That makes \"an empty queue is never charged a\n    // timeout\" a property of this method, not of arming order. The fired timer\n    // is released so a later re-park can arm the queue again.\n    if (!parkedRunHoldsASlot(this.#openRunAt(address) !== undefined, pending.fragments.size)) {\n      this.#clearPendingTimeout(address)\n      return\n    }\n    this.stats.timedOutMFUs++\n    console.warn(\n      `[MfuReassembler] timeout: run=${address} fragments=${pending.fragments.size} ` +\n        '(continuations awaiting first fragment, discarded)'\n    )\n    this.#pendingContinuations.delete(address)\n  }\n\n  #clearTimeout(bufferKey: string): void {\n    const state = this.#timeouts.get(bufferKey)\n    if (state !== undefined) {\n      if (state.timeoutId !== undefined) clearTimeout(state.timeoutId)\n      this.#timeouts.delete(bufferKey)\n    }\n  }\n\n  /** Callback for deferred assembly results (set by caller for async frame delivery) */\n  onDeferredAssembly?: (result: ReassembledMFU) => void\n\n  #markEmitted(bufferKey: string): void {\n    if (this.#emitted.has(bufferKey)) return\n    this.#emitted.add(bufferKey)\n    this.#emittedOrder.push(bufferKey)\n    while (this.#emittedOrder.length > this.#maxBuffered) {\n      const oldest = this.#emittedOrder.shift()\n      if (oldest !== undefined) this.#emitted.delete(oldest)\n    }\n  }\n\n  #markCompleted(address: string): void {\n    if (this.#completed.has(address)) return\n    this.#completed.add(address)\n    this.#completedOrder.push(address)\n    const cap = this.#maxBuffered * COMPLETED_ADDRESS_WINDOW_MULTIPLE\n    while (this.#completedOrder.length > cap) {\n      const oldest = this.#completedOrder.shift()\n      if (oldest !== undefined) this.#completed.delete(oldest)\n    }\n  }\n\n  #orderValue(fragment: MFUFragment): number {\n    return fragmentCounterOrder(fragment)\n  }\n\n  /** Close the run behind an expired buffer. Early arrivals parked under its\n   * address stay, now headless, and expire from their own arrival. */\n  #removeActiveDataUnitForBuffer(bufferKey: string): void {\n    for (const [objectKey, active] of this.#activeDataUnits) {\n      if (active.bufferKey === bufferKey) {\n        this.#activeDataUnits.delete(objectKey)\n        this.#armHeadlessPendingTimeout(active.address)\n      }\n    }\n  }\n\n  /** The one open run holding this address, with its object key. Admission\n   * rejects a second head on an open address, so at most one run can match. */\n  #openRunAt(address: string): readonly [string, ActiveDataUnit] | undefined {\n    for (const entry of this.#activeDataUnits) {\n      if (entry[1].address === address) return entry\n    }\n    return undefined\n  }\n\n  #onTimeout(bufferKey: string): void {\n    const fragments = this.#buffers.get(bufferKey)\n    if (!fragments || fragments.length === 0) {\n      this.#buffers.delete(bufferKey)\n      this.#timeouts.delete(bufferKey)\n      this.#removeActiveDataUnitForBuffer(bufferKey)\n      this.stats.timedOutMFUs++\n      console.warn(`[MfuReassembler] timeout: key=${bufferKey} fragments=0 (no data buffered)`)\n      return\n    }\n\n    // Discard partial MFUs \u2014 incomplete AVCC data crashes WebCodecs with\n    // \"Unable to determine size of bitstream buffer\".  FEC recovery handles\n    // loss; partial assembly only produces garbage frames.\n    this.stats.timedOutMFUs++\n    console.warn(`[MfuReassembler] timeout: key=${bufferKey} fragments=${fragments.length} (partial, discarded)`)\n\n    this.#buffers.delete(bufferKey)\n    this.#timeouts.delete(bufferKey)\n    this.#removeActiveDataUnitForBuffer(bufferKey)\n  }\n\n  /**\n   * Flush all buffered fragments\n   */\n  flush(): void {\n    for (const key of this.#buffers.keys()) {\n      this.#clearTimeout(key)\n    }\n    this.#buffers.clear()\n    this.#timeouts.clear()\n    this.#activeDataUnits.clear()\n    for (const address of this.#pendingContinuations.keys()) {\n      this.#clearPendingTimeout(address)\n    }\n    this.#pendingContinuations.clear()\n    this.#emitted.clear()\n    this.#emittedOrder.length = 0\n    this.#completed.clear()\n    this.#completedOrder.length = 0\n  }\n\n  /** Drop one catalog stream's incomplete and dedup state. */\n  resetStream(catalogTrackName: string): void {\n    const belongsToStream = (key: string): boolean => {\n      try {\n        const decoded = JSON.parse(key)\n        return Array.isArray(decoded) && decoded[0] === 'catalog' && decoded[1] === catalogTrackName\n      } catch {\n        return false\n      }\n    }\n    const discarded = new Set<string>()\n    for (const [key, fragments] of this.#buffers) {\n      if (fragments.some(fragment => fragment.catalogTrackName === catalogTrackName)) {\n        discarded.add(key)\n      }\n    }\n    for (const [objectKey, active] of this.#activeDataUnits) {\n      if (active.catalogTrackName === catalogTrackName) {\n        discarded.add(active.bufferKey)\n        this.#activeDataUnits.delete(objectKey)\n      }\n    }\n    for (const [address, pending] of this.#pendingContinuations) {\n      if (\n        [...pending.fragments.values()].some(fragment => fragment.catalogTrackName === catalogTrackName) ||\n        belongsToStream(address)\n      )\n        this.#deletePendingRun(address)\n    }\n    for (const key of this.#emitted) {\n      if (belongsToStream(key)) discarded.add(key)\n    }\n    for (const key of discarded) {\n      this.#clearTimeout(key)\n      this.#buffers.delete(key)\n      this.#emitted.delete(key)\n    }\n    this.#emittedOrder = this.#emittedOrder.filter(key => !discarded.has(key))\n    for (const address of this.#completed) {\n      if (belongsToStream(address)) this.#completed.delete(address)\n    }\n    this.#completedOrder = this.#completedOrder.filter(address => this.#completed.has(address))\n  }\n\n  /** Reset all state \u2014 flush buffers and zero stats */\n  reset(): void {\n    this.flush()\n    this.stats.totalFragments = 0\n    this.stats.reassembledMFUs = 0\n    this.stats.rejectedFragments = 0\n    this.stats.timedOutMFUs = 0\n    this.stats.evictedMemoryLimit = 0\n    this.stats.outOfOrderFragments = 0\n  }\n\n  /**\n   * Get number of pending MFUs: engine buffers plus every headless parked data\n   * unit that holds a slot.\n   *\n   * This is not one of the four charging sites, but it shares their second term,\n   * so it takes the same rule \u2014 by delegating to `#unopenedParkedRunCount`, the\n   * one site that applies it. Rust's public `buffered_count()` is\n   * `inner.buffered_count() + unopened_parked_run_count()`, and that count is\n   * `parked_run_holds_a_slot` \u2014 so filtering here on the open run alone would\n   * report a phantom slot for an empty published queue in TypeScript and not in\n   * Rust, out of a *host-observable* counter (`getStatus().bufferedMFUs`). Same\n   * state, two numbers, decided by which engine the host loaded: the divergence\n   * class this file exists to close, so the public counters have to agree too.\n   *\n   * Distinct from `#incompleteRunCount`, which sums `#activeDataUnits` rather\n   * than `#buffers`. Those are different quantities by design and are not being\n   * merged; only the parked term they share is required to agree, which is what\n   * routing both through one method makes structural rather than conventional.\n   */\n  get pendingCount(): number {\n    return this.#buffers.size + this.#unopenedParkedRunCount()\n  }\n\n  /**\n   * Get current buffer status\n   */\n  getStatus(): {\n    bufferedMFUs: number\n    pendingFragments: number\n    pendingSamples: PendingMfuDebug[]\n    stats: ReassemblerStats\n  } {\n    let pendingFragments = 0\n    for (const fragments of this.#buffers.values()) {\n      pendingFragments += fragments.length\n    }\n    for (const pending of this.#pendingContinuations.values()) {\n      pendingFragments += pending.fragments.size\n    }\n\n    return {\n      bufferedMFUs: this.pendingCount,\n      pendingFragments,\n      pendingSamples: this.#pendingDebugSamples(),\n      stats: { ...this.stats },\n    }\n  }\n\n  #pendingDebugSamples(): PendingMfuDebug[] {\n    const out: PendingMfuDebug[] = []\n    for (const [key, fragments] of this.#buffers) {\n      if (fragments.length === 0) continue\n      const sorted = [...fragments].sort((a, b) => this.#orderValue(a) - this.#orderValue(b))\n      const fiCounts = [0, 0, 0, 0]\n      let minCounter = Infinity\n      let maxCounter = -Infinity\n      let minOffset = Infinity\n      let maxOffset = -Infinity\n      for (const fragment of sorted) {\n        fiCounts[fragment.fragmentationIndicator] = (fiCounts[fragment.fragmentationIndicator] ?? 0) + 1\n        minCounter = Math.min(minCounter, fragment.fragmentCounter)\n        maxCounter = Math.max(maxCounter, fragment.fragmentCounter)\n        if (typeof fragment.sampleOffset === 'number') {\n          minOffset = Math.min(minOffset, fragment.sampleOffset)\n          maxOffset = Math.max(maxOffset, fragment.sampleOffset)\n        }\n      }\n      const point = (fragment: MFUFragment) => ({\n        fi: fragment.fragmentationIndicator,\n        counter: fragment.fragmentCounter,\n        order: this.#orderValue(fragment),\n        ...(typeof fragment.packetSequenceNumber === 'number' ? { seq: fragment.packetSequenceNumber } : {}),\n        ...(typeof fragment.sampleOffset === 'number' ? { offset: fragment.sampleOffset } : {}),\n      })\n      const summary: PendingMfuDebug = {\n        key,\n        fragments: sorted.length,\n        fi0: fiCounts[0] ?? 0,\n        fi1: fiCounts[1] ?? 0,\n        fi2: fiCounts[2] ?? 0,\n        fi3: fiCounts[3] ?? 0,\n        firstFi: sorted[0]!.fragmentationIndicator,\n        lastFi: sorted[sorted.length - 1]!.fragmentationIndicator,\n        firstOrder: this.#orderValue(sorted[0]!),\n        lastOrder: this.#orderValue(sorted[sorted.length - 1]!),\n        minCounter,\n        maxCounter,\n        movieFragmentSequenceNumber: sorted.find(f => f.movieFragmentSequenceNumber !== undefined)\n          ?.movieFragmentSequenceNumber,\n        sampleNumber: sorted.find(f => f.sampleNumber !== undefined)?.sampleNumber,\n        mpuSequenceNumber: sorted[0]!.mpuSequenceNumber,\n        sortedHead: sorted.slice(0, 6).map(point),\n        sortedTail: sorted.slice(-6).map(point),\n      }\n      if (minOffset !== Infinity) summary.minOffset = minOffset\n      if (maxOffset !== -Infinity) summary.maxOffset = maxOffset\n      out.push(summary)\n      if (out.length >= 12) break\n    }\n    return out\n  }\n}\n\n/**\n * Create MFU fragment from MMTP packet for reassembly\n */\nexport function createFragment(mmtpPacket: Uint8Array): MFUFragment {\n  const extraction = extractMFUPayload(mmtpPacket)\n  if (!extraction) throw new Error('Unable to extract MFU payload from MMTP packet')\n  const { header, mpu, data, mfuDuHeader, itemId } = extraction\n\n  return {\n    fragmentationIndicator: mpu.fragmentationIndicator,\n    mpuSequenceNumber: mpu.mpuSequenceNumber,\n    fragmentCounter: mpu.fragmentCounter,\n    data,\n    timestamp: header.timestamp,\n    rapFlag: header.rapFlag,\n    sampleNumber: mfuDuHeader?.sampleNumber,\n    movieFragmentSequenceNumber: mfuDuHeader?.movieFragmentSequenceNumber,\n    sampleOffset: mfuDuHeader?.offset,\n    priority: mfuDuHeader?.priority,\n    itemId: itemId ?? undefined,\n    packetSequenceNumber: header.sequenceNumber,\n    packetId: header.packetId,\n  }\n}\n\n/**\n * Process MMTP packet with fragment reassembly\n */\nexport function processMMTPWithReassembly(mmtpPacket: Uint8Array, reassembler: MFUReassembler): ReassembledMFU | null {\n  // Skip FEC repair packets\n  if (isFecRepairPacket(mmtpPacket)) {\n    return null\n  }\n\n  const fragment = createFragment(mmtpPacket)\n  return reassembler.addFragment(fragment)\n}\n\n// =============================================================================\n// Inline Tests (vitest)\n// =============================================================================\n\nif (import.meta.vitest) {\n  const { describe, test, expect, vi } = import.meta.vitest\n\n  const expectRejection = (call: () => unknown, code: MfuReassemblyErrorCode): void => {\n    let rejection: unknown\n    try {\n      call()\n    } catch (error) {\n      rejection = error\n    }\n    expect(rejection).toBeInstanceOf(MfuReassemblyError)\n    expect((rejection as MfuReassemblyError).code).toBe(code)\n  }\n\n  const testPacketSequence = (mpu: number, counter: number, run = 0): number =>\n    (mpu * 1000 + run - counter + 0x1_0000_0000) % 0x1_0000_0000\n\n  describe('MFUReassembler', () => {\n    test('should return complete MFU for FI=0', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const result = reassembler.addFragment({\n        fragmentationIndicator: 0,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 0,\n        itemId: 1,\n        data: new Uint8Array([1, 2, 3, 4]),\n        timestamp: 1000n,\n\n        rapFlag: true,\n      })\n      expect(result).not.toBeNull()\n      expect(result?.data).toEqual(new Uint8Array([1, 2, 3, 4]))\n      expect(result?.fragmentCount).toBe(1)\n      expect(result?.rapFlag).toBe(true)\n    })\n\n    test('rejects a complete MFU without a valid sample identity', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const complete = (identity: Partial<MFUFragment>): MFUFragment => ({\n        fragmentationIndicator: 0,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 0,\n        data: new Uint8Array([1]),\n        timestamp: 1000n,\n        rapFlag: true,\n        ...identity,\n      })\n      expectRejection(() => reassembler.addFragment(complete({})), 'missing-data-unit-identity')\n      expectRejection(\n        () =>\n          reassembler.addFragment(\n            complete({\n              movieFragmentSequenceNumber: 2,\n              sampleNumber: 1,\n            })\n          ),\n        'missing-data-unit-identity'\n      )\n    })\n\n    test('accepts a complete subsample MFU with a nonzero authored offset', () => {\n      // moqcast #37: a subsample DU's offset is its authored base byte\n      // position within the sample -- nonzero identifies one subsample DU\n      // among siblings partitioning an oversized sample.\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const result = reassembler.addFragment({\n        fragmentationIndicator: 0,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 0,\n        movieFragmentSequenceNumber: 2,\n        sampleNumber: 1,\n        sampleOffset: 4,\n        data: new Uint8Array([1]),\n        timestamp: 1000n,\n        rapFlag: true,\n      })\n      expect(result).not.toBeNull()\n      expect(result?.sampleOffset).toBe(4)\n    })\n\n    test('accepts a fragmented subsample DU whose first fragment has a nonzero authored offset', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: 2,\n          fragmentCounter: 1,\n          movieFragmentSequenceNumber: 2,\n          sampleNumber: 1,\n          sampleOffset: 4,\n          packetSequenceNumber: testPacketSequence(2, 1),\n          data: new Uint8Array([0xa1]),\n          timestamp: 1000n,\n          rapFlag: true,\n        })\n      ).toBeNull()\n      expect(reassembler.pendingCount).toBe(1)\n      expect(reassembler.getStatus().pendingFragments).toBe(1)\n\n      const out = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 2,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xa2]),\n        timestamp: 1001n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(2, 0),\n      })\n      expect(out?.data).toEqual(new Uint8Array([0xa1, 0xa2]))\n      expect(out?.sampleOffset).toBe(4)\n    })\n\n    // Rust twin: `a_mid_data_unit_sequence_gap_strands_the_data_unit` in\n    // `mmt-core/src/reassembler/policy/mmt.rs`.\n    //\n    // One data unit's fragments occupy sequences 100, 102, 103 with an\n    // unrelated complete unit at 101 -- an interleave *inside* the fragmented\n    // unit rather than after it. ISO/IEC 23008-1 permits that, so this is the\n    // boundary of the contiguous-source producer profile, not a bug within it.\n    //\n    // This test exists because no fixture in either corpus could previously\n    // express a mid-data-unit sequence gap at all: the helpers derive\n    // continuation sequences arithmetically from the head, so every fixture\n    // was contiguous by construction and the profile's edge was untestable\n    // (BLO-33550). It pins current behaviour rather than the guarantee we\n    // would prefer -- change the association path and update it deliberately.\n    test('a mid-data-unit packet sequence gap strands the data unit', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: null, maxBuffered: 10 })\n\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: 7,\n          fragmentCounter: 2,\n          movieFragmentSequenceNumber: 9,\n          sampleNumber: 17,\n          sampleOffset: 0,\n          packetSequenceNumber: 100,\n          data: new Uint8Array([0xa1]),\n          timestamp: 1100n,\n          rapFlag: true,\n        })\n      ).toBeNull()\n\n      // An unrelated complete unit of the same MPU consumes sequence 101,\n      // *between* the fragmented unit's head and its next fragment.\n      const interleaved = reassembler.addFragment({\n        fragmentationIndicator: 0,\n        mpuSequenceNumber: 7,\n        fragmentCounter: 0,\n        movieFragmentSequenceNumber: 9,\n        sampleNumber: 18,\n        sampleOffset: 0,\n        packetSequenceNumber: 101,\n        data: new Uint8Array([0xff]),\n        timestamp: 1101n,\n        rapFlag: true,\n      })\n      expect(interleaved?.data).toEqual(new Uint8Array([0xff]))\n\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 2,\n          mpuSequenceNumber: 7,\n          fragmentCounter: 1,\n          packetSequenceNumber: 102,\n          data: new Uint8Array([0xa2]),\n          timestamp: 1102n,\n          rapFlag: false,\n        })\n      ).toBeNull()\n\n      const output = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 7,\n        fragmentCounter: 0,\n        packetSequenceNumber: 103,\n        data: new Uint8Array([0xa3]),\n        timestamp: 1103n,\n        rapFlag: false,\n      })\n\n      // What we would want, and do not get: `output` carrying a1 a2 a3. The\n      // head addresses 100+2=102; both continuations address 102+1 = 103+0 =\n      // 103, so they are two data units and neither can complete.\n      expect(output).toBeNull()\n\n      // Fail-closed, not corrupt: only the interleaver emitted, and no\n      // fragment was donated across data units.\n      expect(reassembler.stats.reassembledMFUs).toBe(1)\n      expect(reassembler.stats.rejectedFragments).toBe(0)\n\n      // The loss is invisible at this scale -- since BLO-31513 the bound is\n      // enforced by replacement, so at `maxBuffered` this same stranding is\n      // charged only to `evictedMemoryLimit` and presents as intermittent\n      // missing media rather than an error.\n      expect(reassembler.stats.evictedMemoryLimit).toBe(0)\n\n      // Two slots for one data unit -- the open run at 102 plus the headless\n      // parked queue at 103 -- so sustained profile-violating interleave\n      // consumes `maxBuffered` at twice the expected rate and evicts healthy\n      // data units alongside the stranded one. Matches the Rust twin's\n      // `buffered_count() == 2` / `pending_fragment_count() == 3`.\n      expect(reassembler.getStatus().bufferedMFUs).toBe(2)\n      expect(reassembler.getStatus().pendingFragments).toBe(3)\n    })\n\n    test('sibling subsample DUs of one sample reassemble independently by offset', () => {\n      // moqcast #37: each subsample DU of a partitioned sample runs its own\n      // FI chain and gets its own buffer, keyed in part by its authored base\n      // offset -- distinct from a sibling DU sharing (movie, sample).\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n      expect(\n        reassembler.addFragment({\n          mpuSequenceNumber: 3,\n          movieFragmentSequenceNumber: 5,\n          sampleNumber: 9,\n          fragmentationIndicator: 1,\n          fragmentCounter: 1,\n          sampleOffset: 0,\n          data: new Uint8Array([0xa1]),\n          timestamp: 2000n,\n          rapFlag: true,\n          packetSequenceNumber: testPacketSequence(3, 1, 0),\n        })\n      ).toBeNull()\n      // The sibling's head sits at its own packet sequence, so its address\n      // (packetSequenceNumber + fragmentCounter) differs from the first's.\n      // Both stay open at once and every headerless continuation names exactly\n      // one of them by that address. A second head on an already-open address\n      // is refused instead ('rejects an overlapping non-timed item without\n      // replacing the active run').\n      expect(\n        reassembler.addFragment({\n          mpuSequenceNumber: 3,\n          movieFragmentSequenceNumber: 5,\n          sampleNumber: 9,\n          fragmentationIndicator: 1,\n          fragmentCounter: 2,\n          sampleOffset: 3,\n          data: new Uint8Array([0xb1]),\n          timestamp: 2001n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(3, 1, 1),\n        })\n      ).toBeNull()\n      expect(reassembler.pendingCount).toBe(2)\n\n      const first = reassembler.addFragment({\n        mpuSequenceNumber: 3,\n        fragmentationIndicator: 3,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xa2]),\n        timestamp: 2000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(3, 0, 0),\n      })\n      expect(first?.data).toEqual(new Uint8Array([0xa1, 0xa2]))\n      expect(first?.sampleOffset).toBe(0)\n\n      expect(\n        reassembler.addFragment({\n          mpuSequenceNumber: 3,\n          fragmentationIndicator: 2,\n          fragmentCounter: 1,\n          data: new Uint8Array([0xb2]),\n          timestamp: 2001n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(3, 0, 1),\n        })\n      ).toBeNull()\n      const second = reassembler.addFragment({\n        mpuSequenceNumber: 3,\n        fragmentationIndicator: 3,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xb3]),\n        timestamp: 2001n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(3, 0, 2),\n      })\n      expect(second?.data).toEqual(new Uint8Array([0xb1, 0xb2, 0xb3]))\n      expect(second?.sampleOffset).toBe(3)\n      expect(reassembler.pendingCount).toBe(0)\n    })\n\n    test('isolates colliding fragment coordinates by catalog track identity', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const fragment = (\n        catalogTrackName: string,\n        fragmentationIndicator: number,\n        fragmentCounter: number,\n        byte: number\n      ): MFUFragment => ({\n        itemId: 1,\n        fragmentationIndicator,\n        fragmentCounter,\n        mpuSequenceNumber: 1,\n        data: new Uint8Array([byte]),\n        timestamp: 1000n,\n        rapFlag: fragmentationIndicator === 1,\n        catalogTrackName,\n        packetSequenceNumber: testPacketSequence(1, fragmentCounter),\n      })\n\n      expect(reassembler.addFragment(fragment('video/720p', 1, 1, 0x71))).toBeNull()\n      expect(reassembler.addFragment(fragment('video/540p', 1, 1, 0x51))).toBeNull()\n      const high = reassembler.addFragment(fragment('video/720p', 3, 0, 0x72))\n      const low = reassembler.addFragment(fragment('video/540p', 3, 0, 0x52))\n\n      expect(high?.data).toEqual(new Uint8Array([0x71, 0x72]))\n      expect(high?.catalogTrackName).toBe('video/720p')\n      expect(low?.data).toEqual(new Uint8Array([0x51, 0x52]))\n      expect(low?.catalogTrackName).toBe('video/540p')\n    })\n\n    test('rejects an overlapping non-timed item without replacing the active run', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const fragment = (\n        itemId: number,\n        fragmentationIndicator: number,\n        fragmentCounter: number,\n        byte: number\n      ): MFUFragment => ({\n        itemId,\n        fragmentationIndicator,\n        fragmentCounter,\n        mpuSequenceNumber: 1,\n        data: new Uint8Array([byte]),\n        timestamp: 1000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, fragmentCounter),\n      })\n\n      expect(reassembler.addFragment(fragment(10, 1, 1, 0x10))).toBeNull()\n      expectRejection(() => reassembler.addFragment(fragment(20, 1, 1, 0x20)), 'overlapping-data-unit')\n      expect(reassembler.pendingCount).toBe(1)\n      expect(reassembler.addFragment(fragment(10, 3, 0, 0x11))?.data).toEqual(new Uint8Array([0x10, 0x11]))\n      expect(reassembler.pendingCount).toBe(0)\n    })\n\n    test('associates continuations by authored state when packet timestamps change', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const fragment = (\n        itemId: number | undefined,\n        fragmentationIndicator: number,\n        fragmentCounter: number,\n        byte: number,\n        timestamp: bigint\n      ): MFUFragment => ({\n        ...(itemId === undefined ? {} : { itemId }),\n        fragmentationIndicator,\n        fragmentCounter,\n        mpuSequenceNumber: 1,\n        data: new Uint8Array([byte]),\n        timestamp,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, fragmentCounter),\n      })\n\n      expect(reassembler.addFragment(fragment(10, 1, 2, 0x10, 1000n))).toBeNull()\n      expect(reassembler.addFragment(fragment(undefined, 2, 1, 0x11, 1001n))).toBeNull()\n      const out = reassembler.addFragment(fragment(undefined, 3, 0, 0x12, 1002n))\n      expect(out?.data).toEqual(new Uint8Array([0x10, 0x11, 0x12]))\n      expect(out?.timestamp).toBe(1000n)\n    })\n\n    test('should buffer and reassemble 2 fragments', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n      // First fragment (FI=1)\n      const result1 = reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 1,\n        itemId: 1,\n        data: new Uint8Array([1, 2]),\n        timestamp: 1000n,\n        rapFlag: true,\n        packetSequenceNumber: testPacketSequence(1, 1),\n      })\n      expect(result1).toBeNull()\n\n      // Last fragment (FI=3)\n      const result2 = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 0,\n        data: new Uint8Array([3, 4]),\n        timestamp: 1000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, 0),\n      })\n      expect(result2).not.toBeNull()\n      expect(result2?.data).toEqual(new Uint8Array([1, 2, 3, 4]))\n      expect(result2?.fragmentCount).toBe(2)\n      expect(result2?.rapFlag).toBe(true) // Should use first fragment's rapFlag\n    })\n\n    test('buffers a terminal continuation until its authored first fragment arrives', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n      // Last fragment first (FI=3)\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 3,\n          mpuSequenceNumber: 1,\n          fragmentCounter: 0,\n          data: new Uint8Array([3, 4]),\n          timestamp: 1000n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(1, 0),\n        })\n      ).toBeNull()\n      expect(reassembler.pendingCount).toBe(1)\n\n      // Then first fragment (FI=1)\n      const completed = reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 1,\n        itemId: 1,\n        data: new Uint8Array([1, 2]),\n        timestamp: 1000n,\n        rapFlag: true,\n        packetSequenceNumber: testPacketSequence(1, 1),\n      })\n\n      expect(completed?.data).toEqual(new Uint8Array([1, 2, 3, 4]))\n      expect(completed?.rapFlag).toBe(true)\n      expect(reassembler.pendingCount).toBe(0)\n    })\n\n    test('clock-free mode keeps an admitted MFU until completion', async () => {\n      const reassembler = new MFUReassembler({ timeoutMs: null })\n\n      reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 1,\n        itemId: 1,\n        data: new Uint8Array([1, 2]),\n        timestamp: 1000n,\n        rapFlag: true,\n        packetSequenceNumber: testPacketSequence(1, 1),\n      })\n\n      await new Promise(resolve => setTimeout(resolve, 5))\n\n      const result = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 0,\n        data: new Uint8Array([3, 4]),\n        timestamp: 1000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, 0),\n      })\n\n      expect(result).not.toBeNull()\n      expect(result?.data).toEqual(new Uint8Array([1, 2, 3, 4]))\n      expect(reassembler.stats.timedOutMFUs).toBe(0)\n    })\n\n    test('should track pending count', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      expect(reassembler.pendingCount).toBe(0)\n\n      reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 1,\n        itemId: 1,\n        data: new Uint8Array([1]),\n        timestamp: 1000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, 1),\n      })\n      expect(reassembler.pendingCount).toBe(1)\n\n      reassembler.flush()\n      expect(reassembler.pendingCount).toBe(0)\n    })\n\n    test('should reassemble 3 fragments (FI=1, FI=2, FI=3)', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n      // First fragment\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: 10,\n          fragmentCounter: 2,\n          itemId: 1,\n          data: new Uint8Array([0xaa, 0xbb]),\n          timestamp: 5000n,\n          rapFlag: true,\n          packetSequenceNumber: testPacketSequence(10, 2),\n        })\n      ).toBeNull()\n\n      // Middle fragment\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 2,\n          mpuSequenceNumber: 10,\n          fragmentCounter: 1,\n          data: new Uint8Array([0xcc, 0xdd]),\n          timestamp: 5000n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(10, 1),\n        })\n      ).toBeNull()\n\n      // Last fragment \u2014 triggers reassembly\n      const result = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 10,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xee, 0xff]),\n        timestamp: 5000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(10, 0),\n      })\n\n      expect(result).not.toBeNull()\n      expect(result!.data).toEqual(new Uint8Array([0xaa, 0xbb, 0xcc, 0xdd, 0xee, 0xff]))\n      expect(result!.fragmentCount).toBe(3)\n      expect(result!.rapFlag).toBe(true) // from first fragment\n      expect(result!.mpuSequenceNumber).toBe(10)\n    })\n\n    test('should handle interleaved MPU sequences', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n      // MPU 1: first fragment\n      reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 1,\n        itemId: 1,\n        data: new Uint8Array([0x01]),\n        timestamp: 100n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, 1),\n      })\n      // MPU 2: complete (FI=0)\n      const r2 = reassembler.addFragment({\n        fragmentationIndicator: 0,\n        mpuSequenceNumber: 2,\n        fragmentCounter: 0,\n        itemId: 2,\n        data: new Uint8Array([0x02]),\n        timestamp: 200n,\n        rapFlag: false,\n      })\n      expect(r2).not.toBeNull()\n      expect(r2!.mpuSequenceNumber).toBe(2)\n\n      // MPU 1: last fragment\n      const r1 = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 0,\n        data: new Uint8Array([0x03]),\n        timestamp: 100n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, 0),\n      })\n      expect(r1).not.toBeNull()\n      expect(r1!.data).toEqual(new Uint8Array([0x01, 0x03]))\n    })\n\n    test('rejects overlapping fragmented MFUs sharing one stream and MPU', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const mpuSeq = 5\n\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: mpuSeq,\n          fragmentCounter: 1,\n          itemId: 10,\n          data: new Uint8Array([0xa1]),\n          timestamp: 100n,\n          rapFlag: true,\n          packetSequenceNumber: testPacketSequence(mpuSeq, 1),\n        })\n      ).toBeNull()\n      expectRejection(\n        () =>\n          reassembler.addFragment({\n            fragmentationIndicator: 1,\n            mpuSequenceNumber: mpuSeq,\n            fragmentCounter: 1,\n            itemId: 20,\n            data: new Uint8Array([0xb1]),\n            timestamp: 200n,\n            rapFlag: false,\n            packetSequenceNumber: testPacketSequence(mpuSeq, 1),\n          }),\n        'overlapping-data-unit'\n      )\n      expect(reassembler.pendingCount).toBe(1)\n\n      const a = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: mpuSeq,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xa2]),\n        timestamp: 101n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(mpuSeq, 0),\n      })\n      expect(a).not.toBeNull()\n      expect(a!.data).toEqual(new Uint8Array([0xa1, 0xa2]))\n      expect(a!.rapFlag).toBe(true) // from A's first fragment\n\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: mpuSeq,\n          fragmentCounter: 1,\n          itemId: 20,\n          data: new Uint8Array([0xb1]),\n          timestamp: 200n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(mpuSeq, 1, 10),\n        })\n      ).toBeNull()\n      const b = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: mpuSeq,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xb2]),\n        timestamp: 201n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(mpuSeq, 0, 10),\n      })\n      expect(b).not.toBeNull()\n      expect(b!.data).toEqual(new Uint8Array([0xb1, 0xb2]))\n    })\n\n    test('reassembles FFmpeg timed MFU fragments by sample number and byte offset', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const common = {\n        mpuSequenceNumber: 0,\n        movieFragmentSequenceNumber: 9,\n        sampleNumber: 17,\n      }\n\n      expect(\n        reassembler.addFragment({\n          ...common,\n          fragmentationIndicator: 1,\n          fragmentCounter: 2,\n          sampleOffset: 0,\n          data: new Uint8Array([0xa1]),\n          timestamp: 1000n,\n          rapFlag: true,\n          packetSequenceNumber: testPacketSequence(0, 2),\n        })\n      ).toBeNull()\n      expect(\n        reassembler.addFragment({\n          ...common,\n          fragmentationIndicator: 2,\n          fragmentCounter: 1,\n          sampleOffset: 1,\n          data: new Uint8Array([0xb2]),\n          timestamp: 1001n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(0, 1),\n        })\n      ).toBeNull()\n      const out = reassembler.addFragment({\n        ...common,\n        fragmentationIndicator: 3,\n        fragmentCounter: 0,\n        sampleOffset: 2,\n        data: new Uint8Array([0xc3]),\n        timestamp: 1002n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(0, 0),\n      })\n\n      expect(out).not.toBeNull()\n      expect(out!.data).toEqual(new Uint8Array([0xa1, 0xb2, 0xc3]))\n      expect(out!.timestamp).toBe(1000n)\n      expect(out!.sampleNumber).toBe(17)\n      expect(out!.movieFragmentSequenceNumber).toBe(9)\n    })\n\n    test('buffers a counter gap without advancing the active data unit', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const common = {\n        mpuSequenceNumber: 0,\n        movieFragmentSequenceNumber: 9,\n        sampleNumber: 17,\n        timestamp: 1000n,\n        rapFlag: true,\n      }\n\n      expect(\n        reassembler.addFragment({\n          ...common,\n          fragmentationIndicator: 1,\n          fragmentCounter: 2,\n          sampleOffset: 0,\n          data: new Uint8Array([0xa1, 0xa2]),\n          packetSequenceNumber: testPacketSequence(0, 2),\n        })\n      ).toBeNull()\n      expect(\n        reassembler.addFragment({\n          ...common,\n          fragmentationIndicator: 3,\n          fragmentCounter: 0,\n          sampleOffset: 4,\n          data: new Uint8Array([0xc1, 0xc2]),\n          packetSequenceNumber: testPacketSequence(0, 0),\n        })\n      ).toBeNull()\n      expect(reassembler.pendingCount).toBe(1)\n\n      const out = reassembler.addFragment({\n        ...common,\n        fragmentationIndicator: 2,\n        fragmentCounter: 1,\n        sampleOffset: 2,\n        data: new Uint8Array([0xb1, 0xb2]),\n        packetSequenceNumber: testPacketSequence(0, 1),\n      })\n      expect(out?.data).toEqual(new Uint8Array([0xa1, 0xa2, 0xb1, 0xb2, 0xc1, 0xc2]))\n    })\n\n    test('reassembles first-only DU-header fragments across changing packet timestamps', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: 44,\n          fragmentCounter: 2,\n          movieFragmentSequenceNumber: 9,\n          sampleNumber: 17,\n          sampleOffset: 0,\n          data: new Uint8Array([0xa1]),\n          timestamp: 12345n,\n          rapFlag: true,\n          packetSequenceNumber: testPacketSequence(44, 2),\n        })\n      ).toBeNull()\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 2,\n          mpuSequenceNumber: 44,\n          fragmentCounter: 1,\n          data: new Uint8Array([0xb2]),\n          timestamp: 12346n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(44, 1),\n        })\n      ).toBeNull()\n      const out = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 44,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xc3]),\n        timestamp: 12347n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(44, 0),\n      })\n\n      expect(out).not.toBeNull()\n      expect(out!.data).toEqual(new Uint8Array([0xa1, 0xb2, 0xc3]))\n      expect(out!.timestamp).toBe(12345n)\n      expect(out!.sampleNumber).toBe(17)\n      expect(out!.movieFragmentSequenceNumber).toBe(9)\n    })\n\n    test('reassembles first-only DU-header fragments with an ISO countdown', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const timestamp = 12345n\n\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: 44,\n          fragmentCounter: 3,\n          movieFragmentSequenceNumber: 9,\n          sampleNumber: 17,\n          sampleOffset: 0,\n          data: new Uint8Array([0xa1]),\n          timestamp,\n          rapFlag: true,\n          packetSequenceNumber: testPacketSequence(44, 3),\n        })\n      ).toBeNull()\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 2,\n          mpuSequenceNumber: 44,\n          fragmentCounter: 2,\n          data: new Uint8Array([0xb2]),\n          timestamp,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(44, 2),\n        })\n      ).toBeNull()\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 2,\n          mpuSequenceNumber: 44,\n          fragmentCounter: 1,\n          data: new Uint8Array([0xc3]),\n          timestamp,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(44, 1),\n        })\n      ).toBeNull()\n      const out = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 44,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xd4]),\n        timestamp,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(44, 0),\n      })\n\n      expect(out).not.toBeNull()\n      expect(out!.data).toEqual(new Uint8Array([0xa1, 0xb2, 0xc3, 0xd4]))\n      expect(out!.sampleNumber).toBe(17)\n      expect(out!.movieFragmentSequenceNumber).toBe(9)\n    })\n\n    test('rejects fragmented MFUs without an authored DU identity', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const timestamp = 22222n\n\n      expectRejection(\n        () =>\n          reassembler.addFragment({\n            fragmentationIndicator: 1,\n            mpuSequenceNumber: 55,\n            fragmentCounter: 2,\n            data: new Uint8Array([0xa1]),\n            timestamp,\n            rapFlag: true,\n            packetSequenceNumber: testPacketSequence(55, 2),\n          }),\n        'missing-data-unit-identity'\n      )\n      expect(reassembler.pendingCount).toBe(0)\n    })\n\n    test('rejects fragmented MFUs without an authored packet sequence', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      expectRejection(\n        () =>\n          reassembler.addFragment({\n            fragmentationIndicator: 1,\n            mpuSequenceNumber: 55,\n            fragmentCounter: 1,\n            itemId: 1,\n            data: new Uint8Array([0xa1]),\n            timestamp: 22222n,\n            rapFlag: true,\n          }),\n        'missing-packet-sequence'\n      )\n      expect(reassembler.pendingCount).toBe(0)\n    })\n\n    test('rejects fragmented MFUs whose authored packet sequence is not u32', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      for (const packetSequenceNumber of [-1, 0x1_0000_0000, 1.5, Number.NaN]) {\n        expectRejection(\n          () =>\n            reassembler.addFragment({\n              fragmentationIndicator: 1,\n              mpuSequenceNumber: 55,\n              fragmentCounter: 1,\n              itemId: 1,\n              data: new Uint8Array([0xa1]),\n              timestamp: 22222n,\n              rapFlag: true,\n              packetSequenceNumber,\n            }),\n          'missing-packet-sequence'\n        )\n      }\n      expect(reassembler.pendingCount).toBe(0)\n    })\n\n    test('a packet sequence gap inside a fragmented DU splits it and never completes', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const timestamp = 66666n\n\n      // The head is addressed 1000 + 3 = 1003. One unrelated same-pid packet\n      // consumed psn 1001, so every later fragment is addressed 1004: a\n      // second data unit on the wire, parked headless and never merged with\n      // the head by scope, counter, timestamp, or arrival order.\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: 80,\n          fragmentCounter: 3,\n          movieFragmentSequenceNumber: 241,\n          sampleNumber: 1,\n          sampleOffset: 0,\n          packetSequenceNumber: 1000,\n          data: new Uint8Array([0xa0]),\n          timestamp,\n          rapFlag: true,\n        })\n      ).toBeNull()\n      for (const [counter, psn] of [\n        [2, 1002],\n        [1, 1003],\n      ] as const) {\n        expect(\n          reassembler.addFragment({\n            fragmentationIndicator: 2,\n            mpuSequenceNumber: 80,\n            fragmentCounter: counter,\n            packetSequenceNumber: psn,\n            data: new Uint8Array([0xa0 + counter]),\n            timestamp,\n            rapFlag: false,\n          })\n        ).toBeNull()\n      }\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 3,\n          mpuSequenceNumber: 80,\n          fragmentCounter: 0,\n          packetSequenceNumber: 1004,\n          data: new Uint8Array([0xb1]),\n          timestamp,\n          rapFlag: false,\n        })\n      ).toBeNull()\n\n      // The open head plus one headless parked data unit, one slot each.\n      expect(reassembler.pendingCount).toBe(2)\n      expect(reassembler.getStatus().pendingFragments).toBe(4)\n      expect(reassembler.stats.reassembledMFUs).toBe(0)\n      expect(reassembler.stats.rejectedFragments).toBe(0)\n    })\n\n    test('keeps adjacent MFUs with equal countdowns in one MPU separate', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const common = { mpuSequenceNumber: 80, packetId: 7, timestamp: 66666n }\n\n      // Two adjacent samples of one MPU fragmented into the same countdown are\n      // both open at once. Each continuation carries its unit's terminal\n      // sequence (100 + 1 and 102 + 1), so each run completes with its own\n      // terminal fragment.\n      expect(\n        reassembler.addFragment({\n          ...common,\n          fragmentationIndicator: 1,\n          fragmentCounter: 1,\n          packetSequenceNumber: 100,\n          movieFragmentSequenceNumber: 241,\n          sampleNumber: 1,\n          sampleOffset: 0,\n          data: new Uint8Array([0xa1]),\n          rapFlag: true,\n        })\n      ).toBeNull()\n      expect(\n        reassembler.addFragment({\n          ...common,\n          fragmentationIndicator: 1,\n          fragmentCounter: 1,\n          packetSequenceNumber: 102,\n          movieFragmentSequenceNumber: 241,\n          sampleNumber: 2,\n          sampleOffset: 0,\n          data: new Uint8Array([0xb1]),\n          rapFlag: false,\n        })\n      ).toBeNull()\n      expect(reassembler.pendingCount).toBe(2)\n\n      const earlier = reassembler.addFragment({\n        ...common,\n        fragmentationIndicator: 3,\n        fragmentCounter: 0,\n        packetSequenceNumber: 101,\n        data: new Uint8Array([0xa2]),\n        rapFlag: false,\n      })\n      expect(earlier?.data).toEqual(new Uint8Array([0xa1, 0xa2]))\n      expect(earlier?.packetSequenceNumbers).toEqual([100, 101])\n\n      const later = reassembler.addFragment({\n        ...common,\n        fragmentationIndicator: 3,\n        fragmentCounter: 0,\n        packetSequenceNumber: 103,\n        data: new Uint8Array([0xb2]),\n        rapFlag: false,\n      })\n      expect(later?.data).toEqual(new Uint8Array([0xb1, 0xb2]))\n      expect(later?.packetSequenceNumbers).toEqual([102, 103])\n      expect(reassembler.pendingCount).toBe(0)\n    })\n\n    test('wraps the fragmented run coordinate at u32 packet sequence', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: 81,\n          fragmentCounter: 1,\n          packetSequenceNumber: 0xffffffff,\n          itemId: 1,\n          data: new Uint8Array([0xa1]),\n          timestamp: 66666n,\n          rapFlag: true,\n        })\n      ).toBeNull()\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 3,\n          mpuSequenceNumber: 81,\n          fragmentCounter: 0,\n          packetSequenceNumber: 0,\n          data: new Uint8Array([0xa2]),\n          timestamp: 66667n,\n          rapFlag: false,\n        })?.data\n      ).toEqual(new Uint8Array([0xa1, 0xa2]))\n    })\n\n    test('dedupes recovered copies by ISO fragment-counter position', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const timestamp = 44444n\n\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: 77,\n          fragmentCounter: 2,\n          movieFragmentSequenceNumber: 12,\n          sampleNumber: 1,\n          sampleOffset: 0,\n          packetSequenceNumber: 2000,\n          data: new Uint8Array([0xa1]),\n          timestamp,\n          rapFlag: true,\n        })\n      ).toBeNull()\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 2,\n          mpuSequenceNumber: 77,\n          fragmentCounter: 1,\n          packetSequenceNumber: 2001,\n          data: new Uint8Array([0xb2]),\n          timestamp,\n          rapFlag: false,\n        })\n      ).toBeNull()\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 3,\n          mpuSequenceNumber: 77,\n          fragmentCounter: 0,\n          packetSequenceNumber: 2002,\n          data: new Uint8Array([0xc3]),\n          timestamp,\n          rapFlag: false,\n        })\n      ).not.toBeNull()\n\n      reassembler.flush()\n\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: 78,\n          fragmentCounter: 2,\n          movieFragmentSequenceNumber: 13,\n          sampleNumber: 1,\n          sampleOffset: 0,\n          packetSequenceNumber: 3000,\n          data: new Uint8Array([0xd4]),\n          timestamp,\n          rapFlag: true,\n        })\n      ).toBeNull()\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 2,\n          mpuSequenceNumber: 78,\n          fragmentCounter: 1,\n          packetSequenceNumber: 3001,\n          data: new Uint8Array([0xe5]),\n          timestamp,\n          rapFlag: false,\n        })\n      ).toBeNull()\n      expectRejection(\n        () =>\n          reassembler.addFragment({\n            fragmentationIndicator: 2,\n            mpuSequenceNumber: 78,\n            fragmentCounter: 1,\n            packetSequenceNumber: 3001,\n            data: new Uint8Array([0xe5]),\n            timestamp,\n            rapFlag: false,\n          }),\n        'fragment-counter-mismatch'\n      )\n      const out = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 78,\n        fragmentCounter: 0,\n        packetSequenceNumber: 3002,\n        data: new Uint8Array([0xf6]),\n        timestamp,\n        rapFlag: false,\n      })\n\n      expect(out).not.toBeNull()\n      expect(out!.data).toEqual(new Uint8Array([0xd4, 0xe5, 0xf6]))\n    })\n\n    test('reassembles middle and terminal continuations that arrive before first', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const timestamp = 54321n\n\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 2,\n          mpuSequenceNumber: 45,\n          fragmentCounter: 1,\n          data: new Uint8Array([0xb2]),\n          timestamp,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(45, 1),\n        })\n      ).toBeNull()\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 3,\n          mpuSequenceNumber: 45,\n          fragmentCounter: 0,\n          data: new Uint8Array([0xc3]),\n          timestamp: timestamp + 1n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(45, 0),\n        })\n      ).toBeNull()\n      expect(reassembler.pendingCount).toBe(1)\n      const out = reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 45,\n        fragmentCounter: 2,\n        movieFragmentSequenceNumber: 10,\n        sampleNumber: 18,\n        sampleOffset: 0,\n        data: new Uint8Array([0xa1]),\n        timestamp,\n        rapFlag: true,\n        packetSequenceNumber: testPacketSequence(45, 2),\n      })\n\n      expect(out).not.toBeNull()\n      expect(out!.data).toEqual(new Uint8Array([0xa1, 0xb2, 0xc3]))\n      expect(out!.sampleNumber).toBe(18)\n      expect(out!.movieFragmentSequenceNumber).toBe(10)\n      expect(reassembler.pendingCount).toBe(0)\n    })\n\n    test('rejects a duplicate continuation before first without replacing retained media', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const timestamp = 54322n\n\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 3,\n          mpuSequenceNumber: 46,\n          fragmentCounter: 0,\n          data: new Uint8Array([0xc3]),\n          timestamp,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(46, 0),\n        })\n      ).toBeNull()\n      expectRejection(\n        () =>\n          reassembler.addFragment({\n            fragmentationIndicator: 3,\n            mpuSequenceNumber: 46,\n            fragmentCounter: 0,\n            data: new Uint8Array([0xff]),\n            timestamp: timestamp + 1n,\n            rapFlag: false,\n            packetSequenceNumber: testPacketSequence(46, 0),\n          }),\n        'fragment-counter-mismatch'\n      )\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 2,\n          mpuSequenceNumber: 46,\n          fragmentCounter: 1,\n          data: new Uint8Array([0xb2]),\n          timestamp: timestamp + 2n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(46, 1),\n        })\n      ).toBeNull()\n\n      const out = reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 46,\n        fragmentCounter: 2,\n        movieFragmentSequenceNumber: 10,\n        sampleNumber: 19,\n        sampleOffset: 0,\n        data: new Uint8Array([0xa1]),\n        timestamp: timestamp + 3n,\n        rapFlag: true,\n        packetSequenceNumber: testPacketSequence(46, 2),\n      })\n\n      expect(out).not.toBeNull()\n      expect(out!.data).toEqual(new Uint8Array([0xa1, 0xb2, 0xc3]))\n      expect(reassembler.pendingCount).toBe(0)\n    })\n\n    test('rejects invalid ISO fragmentation-indicator and counter combinations', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const invalidHeaders = [\n        { fragmentationIndicator: 0, fragmentCounter: 1 },\n        { fragmentationIndicator: 3, fragmentCounter: 1 },\n        { fragmentationIndicator: 1, fragmentCounter: 0 },\n        { fragmentationIndicator: 2, fragmentCounter: 0 },\n        { fragmentationIndicator: -1, fragmentCounter: 1 },\n        { fragmentationIndicator: 4, fragmentCounter: 1 },\n        { fragmentationIndicator: 1.5, fragmentCounter: 1 },\n        { fragmentationIndicator: 1, fragmentCounter: -1 },\n        { fragmentationIndicator: 1, fragmentCounter: 256 },\n        { fragmentationIndicator: 1, fragmentCounter: 1.5 },\n        { fragmentationIndicator: 1, fragmentCounter: Number.NaN },\n      ]\n\n      for (const header of invalidHeaders) {\n        expectRejection(\n          () =>\n            reassembler.addFragment({\n              ...header,\n              mpuSequenceNumber: 48,\n              data: new Uint8Array([0xa1]),\n              timestamp: 54324n,\n              rapFlag: false,\n            }),\n          'invalid-fragment-state'\n        )\n      }\n\n      expect(reassembler.pendingCount).toBe(0)\n      expect(reassembler.stats.reassembledMFUs).toBe(0)\n    })\n\n    test('reassembles the maximum ISO chain of 256 payloads', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: null })\n      const common = {\n        mpuSequenceNumber: 47,\n        timestamp: 54323n,\n        rapFlag: false,\n      }\n\n      expect(\n        reassembler.addFragment({\n          ...common,\n          fragmentationIndicator: 1,\n          fragmentCounter: 255,\n          itemId: 1,\n          data: new Uint8Array([0]),\n          rapFlag: true,\n          packetSequenceNumber: testPacketSequence(47, 255),\n        })\n      ).toBeNull()\n      for (let counter = 254; counter > 0; counter--) {\n        expect(\n          reassembler.addFragment({\n            ...common,\n            fragmentationIndicator: 2,\n            fragmentCounter: counter,\n            data: new Uint8Array([255 - counter]),\n            packetSequenceNumber: testPacketSequence(47, counter),\n          })\n        ).toBeNull()\n      }\n      const out = reassembler.addFragment({\n        ...common,\n        fragmentationIndicator: 3,\n        fragmentCounter: 0,\n        data: new Uint8Array([255]),\n        packetSequenceNumber: testPacketSequence(47, 0),\n      })\n\n      expect(out?.fragmentCount).toBe(256)\n      expect(out?.data).toEqual(Uint8Array.from({ length: 256 }, (_, index) => index))\n    })\n\n    test('should not reassemble without last fragment (FI=3)', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 2,\n        itemId: 1,\n        data: new Uint8Array([1]),\n        timestamp: 1000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, 2),\n      })\n      const result = reassembler.addFragment({\n        fragmentationIndicator: 2,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 1,\n        data: new Uint8Array([2]),\n        timestamp: 1000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, 1),\n      })\n      expect(result).toBeNull()\n      expect(reassembler.pendingCount).toBe(1)\n    })\n\n    test('bounds continuations that arrive before their first fragments', () => {\n      const reassembler = new MFUReassembler({\n        timeoutMs: null,\n        maxBuffered: 1,\n      })\n      // Data unit 1 parks headless at address 1000 and takes the only slot.\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 3,\n          mpuSequenceNumber: 1,\n          fragmentCounter: 0,\n          data: new Uint8Array([1]),\n          timestamp: 1000n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(1, 0),\n        })\n      ).toBeNull()\n      expect(reassembler.pendingCount).toBe(1)\n\n      // Data unit 2 parks headless at address 2000. The bound holds by\n      // replacement: data unit 1, admitted first, yields its slot.\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 3,\n          mpuSequenceNumber: 2,\n          fragmentCounter: 0,\n          data: new Uint8Array([2]),\n          timestamp: 1000n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(2, 0),\n        })\n      ).toBeNull()\n      expect(reassembler.pendingCount).toBe(1)\n      expect(reassembler.getStatus().pendingFragments).toBe(1)\n      expect(reassembler.stats.evictedMemoryLimit).toBe(1)\n\n      // Data unit 2's head inherits the slot its queue already holds, so it\n      // evicts nothing and completes from the parked continuation.\n      const completed = reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 2,\n        fragmentCounter: 1,\n        itemId: 2,\n        data: new Uint8Array([4]),\n        timestamp: 1000n,\n        rapFlag: true,\n        packetSequenceNumber: testPacketSequence(2, 1),\n      })\n      expect(completed?.data).toEqual(new Uint8Array([4, 2]))\n      expect(reassembler.stats.evictedMemoryLimit).toBe(1)\n      expect(reassembler.pendingCount).toBe(0)\n\n      // Data unit 1's continuation was released with its slot, so its head\n      // opens a fresh run and waits rather than completing from evicted state.\n      const result = reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 1,\n        itemId: 1,\n        data: new Uint8Array([3]),\n        timestamp: 1000n,\n        rapFlag: true,\n        packetSequenceNumber: testPacketSequence(1, 1),\n      })\n      expect(result).toBeNull()\n      expect(reassembler.pendingCount).toBe(1)\n    })\n\n    test('expires a continuation that never receives its first fragment', () => {\n      vi.useFakeTimers()\n      try {\n        const reassembler = new MFUReassembler({\n          timeoutMs: 50,\n          maxBuffered: 1,\n        })\n        expect(\n          reassembler.addFragment({\n            fragmentationIndicator: 3,\n            mpuSequenceNumber: 1,\n            fragmentCounter: 0,\n            data: new Uint8Array([1]),\n            timestamp: 1000n,\n            rapFlag: false,\n            packetSequenceNumber: testPacketSequence(1, 0),\n          })\n        ).toBeNull()\n        vi.advanceTimersByTime(50)\n        expect(reassembler.pendingCount).toBe(0)\n        expect(reassembler.stats.timedOutMFUs).toBe(1)\n      } finally {\n        vi.useRealTimers()\n      }\n    })\n\n    test('retimes retained continuations when the timeout policy changes', () => {\n      vi.useFakeTimers()\n      try {\n        const enabled = new MFUReassembler({ timeoutMs: null, maxBuffered: 1 })\n        expect(\n          enabled.addFragment({\n            fragmentationIndicator: 3,\n            mpuSequenceNumber: 1,\n            fragmentCounter: 0,\n            data: new Uint8Array([1]),\n            timestamp: 1000n,\n            rapFlag: false,\n            packetSequenceNumber: testPacketSequence(1, 0),\n          })\n        ).toBeNull()\n        enabled.timeoutMs = 10\n        vi.advanceTimersByTime(10)\n        expect(enabled.pendingCount).toBe(0)\n\n        const disabled = new MFUReassembler({ timeoutMs: 10, maxBuffered: 1 })\n        expect(\n          disabled.addFragment({\n            fragmentationIndicator: 3,\n            mpuSequenceNumber: 2,\n            fragmentCounter: 0,\n            data: new Uint8Array([2]),\n            timestamp: 1000n,\n            rapFlag: false,\n            packetSequenceNumber: testPacketSequence(2, 0),\n          })\n        ).toBeNull()\n        disabled.timeoutMs = null\n        vi.advanceTimersByTime(10)\n        expect(disabled.pendingCount).toBe(1)\n        disabled.flush()\n      } finally {\n        vi.useRealTimers()\n      }\n    })\n\n    test('bounds active data units by evicting the oldest at maxBuffered', () => {\n      const reassembler = new MFUReassembler({\n        timeoutMs: 1000,\n        maxBuffered: 2,\n      })\n\n      // Two runs remain active; the third first fragment displaces the run\n      // admitted longest ago instead of being refused.\n      for (let i = 0; i < 2; i++) {\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: i,\n          fragmentCounter: 1,\n          itemId: i,\n          data: new Uint8Array([i]),\n          timestamp: BigInt(i * 100),\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(i, 1),\n        })\n      }\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 1,\n          mpuSequenceNumber: 2,\n          fragmentCounter: 1,\n          itemId: 2,\n          data: new Uint8Array([2]),\n          timestamp: 200n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(2, 1),\n        })\n      ).toBeNull()\n      expect(reassembler.pendingCount).toBe(2)\n      // Eviction is a replacement policy, not a deadline: it must not be\n      // reported as a timeout, and it must be separately countable.\n      expect(reassembler.stats.timedOutMFUs).toBe(0)\n      expect(reassembler.stats.evictedMemoryLimit).toBe(1)\n\n      // The evicted run's continuation no longer has a run to join; it parks\n      // as a fresh headless data unit, which displaces the next-oldest run.\n      expect(\n        reassembler.addFragment({\n          fragmentationIndicator: 3,\n          mpuSequenceNumber: 0,\n          fragmentCounter: 0,\n          data: new Uint8Array([9]),\n          timestamp: 300n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(0, 0),\n        })\n      ).toBeNull()\n      expect(reassembler.pendingCount).toBe(2)\n      expect(reassembler.stats.evictedMemoryLimit).toBe(2)\n      expect(reassembler.stats.timedOutMFUs).toBe(0)\n    })\n\n    test('should report stats correctly', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n      // One complete MFU\n      reassembler.addFragment({\n        fragmentationIndicator: 0,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 0,\n        itemId: 1,\n        data: new Uint8Array([1]),\n        timestamp: 1000n,\n        rapFlag: false,\n      })\n\n      const status = reassembler.getStatus()\n      expect(status.bufferedMFUs).toBe(0)\n      expect(status.stats.totalFragments).toBe(1)\n      expect(status.stats.reassembledMFUs).toBe(1)\n    })\n\n    test('rejects an overlapping first without replacing the original fragment', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n      reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 1,\n        itemId: 1,\n        data: new Uint8Array([0xaa]),\n        timestamp: 1000n,\n        rapFlag: true,\n        source: 'multicast',\n        packetSequenceNumber: testPacketSequence(1, 1),\n      })\n      // Duplicate of fragmentCounter=1\n      expectRejection(\n        () =>\n          reassembler.addFragment({\n            fragmentationIndicator: 1,\n            mpuSequenceNumber: 1,\n            fragmentCounter: 1,\n            itemId: 2,\n            data: new Uint8Array([0xbb]),\n            timestamp: 1000n,\n            rapFlag: true,\n            source: 'moq',\n            packetSequenceNumber: testPacketSequence(1, 1),\n          }),\n        'overlapping-data-unit'\n      )\n\n      const result = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xcc]),\n        timestamp: 1000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, 0),\n      })\n      expect(result).not.toBeNull()\n      expect(result!.data).toEqual(new Uint8Array([0xaa, 0xcc]))\n      expect(result!.fragmentCount).toBe(2)\n      expect(result!.source).toBe('multicast')\n    })\n  })\n\n  test('should retain an assembly with a gap in fragment counters', () => {\n    const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n    // First fragment declares three succeeding payloads.\n    reassembler.addFragment({\n      fragmentationIndicator: 1,\n      mpuSequenceNumber: 1,\n      fragmentCounter: 3,\n      itemId: 1,\n      data: new Uint8Array([0xaa]),\n      timestamp: 1000n,\n      rapFlag: true,\n      packetSequenceNumber: testPacketSequence(1, 3),\n    })\n    // Counter 1 arrives while counter 2 is missing.\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 2,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 1,\n        data: new Uint8Array([0xcc]),\n        timestamp: 1000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, 1),\n      })\n    ).toBeNull()\n    // Last fragment has the required zero counter.\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xdd]),\n        timestamp: 1000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, 0),\n      })\n    ).toBeNull()\n    expect(reassembler.pendingCount).toBe(1)\n    expect(reassembler.getStatus().pendingFragments).toBe(3)\n  })\n\n  test('accepts a reordered countdown and rejects a stale duplicate', () => {\n    const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n    // Counters 3, 1, 0 arrive (gap at 2).\n    reassembler.addFragment({\n      fragmentationIndicator: 1,\n      mpuSequenceNumber: 1,\n      fragmentCounter: 3,\n      itemId: 1,\n      data: new Uint8Array([0xaa]),\n      timestamp: 1000n,\n      rapFlag: true,\n      packetSequenceNumber: testPacketSequence(1, 3),\n    })\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 2,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 1,\n        data: new Uint8Array([0xcc]),\n        timestamp: 1000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, 1),\n      })\n    ).toBeNull()\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 2,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 2,\n        data: new Uint8Array([0xbb]),\n        timestamp: 1000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(1, 2),\n      })\n    ).toBeNull()\n    expectRejection(\n      () =>\n        reassembler.addFragment({\n          fragmentationIndicator: 2,\n          mpuSequenceNumber: 1,\n          fragmentCounter: 1,\n          data: new Uint8Array([0xcc]),\n          timestamp: 1001n,\n          rapFlag: false,\n          packetSequenceNumber: testPacketSequence(1, 1),\n        }),\n      'fragment-counter-mismatch'\n    )\n    const result = reassembler.addFragment({\n      fragmentationIndicator: 3,\n      mpuSequenceNumber: 1,\n      fragmentCounter: 0,\n      data: new Uint8Array([0xdd]),\n      timestamp: 1002n,\n      rapFlag: false,\n      packetSequenceNumber: testPacketSequence(1, 0),\n    })\n    expect(result).not.toBeNull()\n    expect(result!.data).toEqual(new Uint8Array([0xaa, 0xbb, 0xcc, 0xdd]))\n    expect(result!.fragmentCount).toBe(4)\n  })\n\n  test('rejects an overlapping first without discarding queued continuations', () => {\n    const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n    const fragment = (fragmentationIndicator: number, fragmentCounter: number, byte: number): MFUFragment => ({\n      fragmentationIndicator,\n      mpuSequenceNumber: 2,\n      fragmentCounter,\n      data: new Uint8Array([byte]),\n      timestamp: 1000n,\n      rapFlag: fragmentationIndicator === 1,\n      packetSequenceNumber: testPacketSequence(2, fragmentCounter),\n      ...(fragmentationIndicator === 1 ? { itemId: 9 } : {}),\n    })\n\n    expect(reassembler.addFragment(fragment(1, 3, 0xaa))).toBeNull()\n    expect(reassembler.addFragment(fragment(2, 1, 0xcc))).toBeNull()\n    expectRejection(() => reassembler.addFragment(fragment(1, 1, 0xee)), 'overlapping-data-unit')\n    expect(reassembler.addFragment(fragment(2, 2, 0xbb))).toBeNull()\n    expect(reassembler.addFragment(fragment(3, 0, 0xdd))?.data).toEqual(new Uint8Array([0xaa, 0xbb, 0xcc, 0xdd]))\n  })\n\n  test('rejects a duplicate emitted intrinsic identity', () => {\n    const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 42,\n        fragmentCounter: 1,\n        itemId: 1,\n        data: new Uint8Array([0xaa]),\n        timestamp: 1000n,\n        rapFlag: true,\n        packetSequenceNumber: testPacketSequence(42, 1),\n      })\n    ).toBeNull()\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 42,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xab]),\n        timestamp: 1001n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(42, 0),\n      })\n    ).not.toBeNull()\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 42,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xbc]),\n        timestamp: 1002n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(42, 0, 10),\n      })\n    ).toBeNull()\n    expect(reassembler.pendingCount).toBe(1)\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 42,\n        fragmentCounter: 1,\n        itemId: 1,\n        data: new Uint8Array([0xbb]),\n        timestamp: 2000n,\n        rapFlag: true,\n        packetSequenceNumber: testPacketSequence(42, 1, 10),\n      })\n    ).toBeNull()\n    // The queued FI=3 above is addressed to a data unit of MPU 42 whose own\n    // FI=1 has not arrived. This duplicate head names that same address, but\n    // its identity already emitted, so it is dropped before it can open a run\n    // and touches nothing: the queue is retained and reclaimed by its own\n    // arrival timeout.\n    expect(reassembler.pendingCount).toBe(1)\n\n    const result = reassembler.addFragment({\n      fragmentationIndicator: 1,\n      mpuSequenceNumber: 43,\n      fragmentCounter: 1,\n      itemId: 1,\n      data: new Uint8Array([0xcc]),\n      timestamp: 2000n,\n      rapFlag: false,\n      packetSequenceNumber: testPacketSequence(43, 1),\n    })\n    expect(result).toBeNull()\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 43,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xdd]),\n        timestamp: 2001n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(43, 0),\n      })?.data\n    ).toEqual(new Uint8Array([0xcc, 0xdd]))\n  })\n\n  test('does not create active state for an emitted identity duplicate', () => {\n    const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 50,\n        fragmentCounter: 1,\n        movieFragmentSequenceNumber: 10,\n        sampleNumber: 18,\n        sampleOffset: 0,\n        data: new Uint8Array([0xa1]),\n        timestamp: 1000n,\n        rapFlag: true,\n        packetSequenceNumber: testPacketSequence(50, 1),\n      })\n    ).toBeNull()\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 50,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xb2]),\n        timestamp: 1000n,\n        rapFlag: false,\n        packetSequenceNumber: testPacketSequence(50, 0),\n      })?.data\n    ).toEqual(new Uint8Array([0xa1, 0xb2]))\n    expect(reassembler.pendingCount).toBe(0)\n\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 50,\n        fragmentCounter: 1,\n        movieFragmentSequenceNumber: 10,\n        sampleNumber: 18,\n        sampleOffset: 0,\n        data: new Uint8Array([0xa1]),\n        timestamp: 2000n,\n        rapFlag: true,\n        packetSequenceNumber: testPacketSequence(50, 1, 10),\n      })\n    ).toBeNull()\n    expect(reassembler.pendingCount).toBe(0)\n  })\n\n  test('flush should clear emitted set and allow re-assembly', () => {\n    const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n\n    // Use fragmented MFU (FI=1 start + FI=3 end) \u2014 only fragmented MFUs\n    // go through the #emitted dedup set. FI=0 (complete) bypasses it.\n    const first = reassembler.addFragment({\n      fragmentationIndicator: 1,\n      mpuSequenceNumber: 42,\n      fragmentCounter: 1,\n      itemId: 1,\n      data: new Uint8Array([0xaa]),\n      timestamp: 1000n,\n      rapFlag: true,\n      packetSequenceNumber: testPacketSequence(42, 1),\n    })\n    expect(first).toBeNull() // first fragment, not yet complete\n    const assembled = reassembler.addFragment({\n      fragmentationIndicator: 3,\n      mpuSequenceNumber: 42,\n      fragmentCounter: 0,\n      data: new Uint8Array([0xbb]),\n      timestamp: 1000n,\n      rapFlag: true,\n      packetSequenceNumber: testPacketSequence(42, 0),\n    })\n    expect(assembled).not.toBeNull() // complete \u2014 mpuSeq 42 now in emitted set\n\n    // Rejected before flush \u2014 same mpuSeq already emitted\n    expect(\n      reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 42,\n        fragmentCounter: 1,\n        itemId: 1,\n        data: new Uint8Array([0xcc]),\n        timestamp: 1000n,\n        rapFlag: true,\n        packetSequenceNumber: testPacketSequence(42, 1, 10),\n      })\n    ).toBeNull()\n\n    // After flush, same mpuSeq should work again\n    reassembler.flush()\n    const r2 = reassembler.addFragment({\n      fragmentationIndicator: 1,\n      mpuSequenceNumber: 42,\n      fragmentCounter: 1,\n      itemId: 1,\n      data: new Uint8Array([0xdd]),\n      timestamp: 1000n,\n      rapFlag: true,\n      packetSequenceNumber: testPacketSequence(42, 1),\n    })\n    expect(r2).toBeNull() // first fragment of new assembly\n    const r3 = reassembler.addFragment({\n      fragmentationIndicator: 3,\n      mpuSequenceNumber: 42,\n      fragmentCounter: 0,\n      data: new Uint8Array([0xee]),\n      timestamp: 1000n,\n      rapFlag: true,\n      packetSequenceNumber: testPacketSequence(42, 0),\n    })\n    expect(r3).not.toBeNull()\n    expect(r3!.data).toEqual(new Uint8Array([0xdd, 0xee]))\n  })\n\n  describe('createFragment', () => {\n    test('should create fragment from complete timed MMTP packet', () => {\n      // Build: MMTP(12) + MPU(8, T=1 FI=0 payloadLength=25) + MFU_DU(14) + data(5)\n      const packet = new Uint8Array(12 + 8 + 14 + 5)\n      // MMTP header: byte0 = rap=1, byte1 = MPU type\n      packet[0] = 0x01 // RAP flag set\n      packet[1] = 0x00 // packet_type = MPU\n      // packetId = 1\n      const view = new DataView(packet.buffer)\n      view.setUint16(2, 1, false)\n      view.setUint32(4, 42, false) // timestamp\n      view.setUint32(8, 100, false) // sequence number\n\n      // MPU header at offset 12\n      view.setUint16(12, 25, false) // 6 remaining MPU bytes + 14 DU + 5 media\n      packet[14] = 0x28 // FT=2, T=1, FI=0, A=0\n      packet[15] = 0 // fragment_counter\n      view.setUint32(16, 999, false) // mpuSequenceNumber\n\n      // MFU DU header (14 bytes) at offset 20.\n      view.setUint32(20, 7, false) // movie_fragment_sequence_number\n      view.setUint32(24, 1, false) // sample_number\n      // Video data at offset 34\n      packet[34] = 0xde\n      packet[35] = 0xad\n      packet[36] = 0xbe\n      packet[37] = 0xef\n      packet[38] = 0x01\n\n      const frag = createFragment(packet)\n      expect(frag.mpuSequenceNumber).toBe(999)\n      expect(frag.fragmentationIndicator).toBe(0)\n      expect(frag.rapFlag).toBe(true)\n      expect(frag.movieFragmentSequenceNumber).toBe(7)\n      expect(frag.sampleNumber).toBe(1)\n      expect(frag.sampleOffset).toBe(0)\n      expect(frag.data.length).toBe(5) // 5 bytes of video data\n    })\n\n    test('reads Item_ID from a non-timed MFU DU header', () => {\n      const packet = new Uint8Array(12 + 8 + 4 + 2)\n      const view = new DataView(packet.buffer)\n      view.setUint16(2, 1, false)\n      view.setUint32(4, 42, false)\n      view.setUint32(8, 100, false)\n      view.setUint16(12, 12, false) // 6 remaining MPU bytes + 4 DU + 2 media\n      packet[14] = 0x20 // FT=2, T=0, FI=0\n      view.setUint32(16, 999, false)\n      view.setUint32(20, 0x01020304, false)\n      packet.set([0xde, 0xad], 24)\n\n      const fragment = createFragment(packet)\n      expect(fragment.itemId).toBe(0x01020304)\n      expect(fragment.data).toEqual(new Uint8Array([0xde, 0xad]))\n    })\n  })\n\n  describe('processMMTPWithReassembly', () => {\n    test('should skip FEC repair packets', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const packet = new Uint8Array(12 + 8 + 14 + 4)\n      packet[0] = 0x10 // fecType=2 (repair)\n      const result = processMMTPWithReassembly(packet, reassembler)\n      expect(result).toBeNull()\n    })\n\n    test('should return reassembled MFU for complete packet', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const packet = new Uint8Array(12 + 8 + 14 + 4)\n      packet[0] = 0x01 // RAP\n      packet[1] = 0x00 // MPU\n      const view = new DataView(packet.buffer)\n      view.setUint16(2, 1, false) // packetId\n      view.setUint32(4, 100, false) // timestamp\n      view.setUint32(8, 1, false) // seq\n      // MPU: payloadLength=24 (6 + 14 + 4), FT=2 T=1 FI=0 A=0\n      view.setUint16(12, 24, false)\n      packet[14] = 0x28\n      view.setUint32(16, 42, false) // mpuSeq\n      view.setUint32(20, 7, false) // movie_fragment_sequence_number\n      view.setUint32(24, 1, false) // sample_number\n\n      packet[34] = 0x00\n      packet[35] = 0x00\n      packet[36] = 0x00\n      packet[37] = 0x01\n\n      const result = processMMTPWithReassembly(packet, reassembler)\n      expect(result).not.toBeNull()\n      expect(result!.mpuSequenceNumber).toBe(42)\n      expect(result!.rapFlag).toBe(true)\n    })\n  })\n\n  describe('strict delivery provenance', () => {\n    test('folds to multicast only when every fragment is explicitly multicast', () => {\n      expect(deliveryProvenanceOf([{ source: 'multicast' }, { source: 'multicast' }])).toBe('multicast')\n    })\n\n    test('a single moq fragment makes the whole frame mixed', () => {\n      expect(deliveryProvenanceOf([{ source: 'multicast' }, { source: 'moq' }])).toBe('mixed')\n      // ...and it does not matter where in the run it lands.\n      expect(deliveryProvenanceOf([{ source: 'moq' }, { source: 'multicast' }])).toBe('mixed')\n    })\n\n    test('an unattributed fragment degrades multicast to unknown, never to proven', () => {\n      expect(deliveryProvenanceOf([{ source: 'multicast' }, {}])).toBe('unknown')\n      expect(deliveryProvenanceOf([{}])).toBe('unknown')\n    })\n\n    test('mixed absorbs unknown \u2014 a moq byte is worse news than a missing label', () => {\n      expect(deliveryProvenanceOf([{ source: 'moq' }, {}])).toBe('mixed')\n      expect(deliveryProvenanceOf([{}, { source: 'moq' }])).toBe('mixed')\n    })\n\n    test('an empty fragment set proves nothing', () => {\n      expect(deliveryProvenanceOf([])).toBe('unknown')\n    })\n\n    test('the fold never upgrades a verdict', () => {\n      expect(foldDeliveryProvenance('mixed', 'multicast')).toBe('mixed')\n      expect(foldDeliveryProvenance('unknown', 'multicast')).toBe('unknown')\n      expect(foldDeliveryProvenance('unknown', 'moq')).toBe('mixed')\n    })\n\n    test('a multicast head with a non-multicast tail is NOT multicast-exclusive', () => {\n      // This is the leak this field exists to close. `source` legitimately\n      // reports 'multicast' \u2014 head-fragment-wins is the routing contract \u2014\n      // but the frame contains bytes that never crossed a multicast socket,\n      // so it must never be counted as physical-delivery evidence.\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 1,\n        itemId: 1,\n        data: new Uint8Array([0xaa]),\n        timestamp: 1000n,\n        rapFlag: true,\n        source: 'multicast',\n        packetSequenceNumber: testPacketSequence(1, 1),\n      })\n      const result = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 1,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xcc]),\n        timestamp: 1000n,\n        rapFlag: false,\n        source: 'moq',\n        packetSequenceNumber: testPacketSequence(1, 0),\n      })\n      expect(result).not.toBeNull()\n      expect(result!.fragmentCount).toBe(2)\n      expect(result!.source).toBe('multicast')\n      expect(result!.deliveryProvenance).toBe('mixed')\n    })\n\n    test('an all-multicast fragmented frame is multicast-exclusive', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      reassembler.addFragment({\n        fragmentationIndicator: 1,\n        mpuSequenceNumber: 2,\n        fragmentCounter: 1,\n        itemId: 1,\n        data: new Uint8Array([0xaa]),\n        timestamp: 2000n,\n        rapFlag: true,\n        source: 'multicast',\n        packetSequenceNumber: testPacketSequence(2, 1),\n      })\n      const result = reassembler.addFragment({\n        fragmentationIndicator: 3,\n        mpuSequenceNumber: 2,\n        fragmentCounter: 0,\n        data: new Uint8Array([0xcc]),\n        timestamp: 2000n,\n        rapFlag: false,\n        source: 'multicast',\n        packetSequenceNumber: testPacketSequence(2, 0),\n      })\n      expect(result).not.toBeNull()\n      expect(result!.deliveryProvenance).toBe('multicast')\n    })\n\n    test('an unlabelled complete frame proves nothing', () => {\n      const reassembler = new MFUReassembler({ timeoutMs: 1000 })\n      const result = reassembler.addFragment({\n        fragmentationIndicator: 0,\n        mpuSequenceNumber: 3,\n        fragmentCounter: 0,\n        itemId: 1,\n        data: new Uint8Array([1]),\n        timestamp: 3000n,\n        rapFlag: true,\n      })\n      expect(result).not.toBeNull()\n      expect(result!.deliveryProvenance).toBe('unknown')\n    })\n  })\n}\n", "/**\n * @mmt/container - Sample-level combining of subsample data units (moqcast #37)\n *\n * {@link MFUReassembler} reassembles exactly one data unit -- a whole-sample\n * DU, or one subsample DU of a partitioned sample. When a timed sample\n * exceeds one data unit's 256-payload capacity, the origin packetizer\n * partitions it into multiple subsample data units (each its own FI chain,\n * its own authored base offset). This module combines those\n * already-reassembled data units back into one contiguous sample.\n *\n * Container-blind, matching {@link MFUReassembler}'s own doctrine: it never\n * parses ISOBMFF itself. The authored sample size a subsample-partitioned\n * sample must total to comes from the host's own FT=1 (movie-fragment-\n * metadata) parse, supplied via {@link SampleCombiner.registerAuthoredSize}.\n * Completion is a protocol event -- every constituent data unit reassembled,\n * byte-adjacent from zero, totaling the registered size -- never a\n * timer-based guess; on lossy paths the existing per-data-unit deadline in\n * {@link MFUReassembler} already bounds each constituent, so this module adds\n * no second timer tier, matching moqcast #37 section 5.2.1.\n *\n * A whole-sample data unit whose length already equals the registered\n * authored size passes through immediately, with no buffering. When\n * `requireAuthoredSize` is false, an offset-zero data unit with no registered\n * size at all also passes through immediately -- the pre-amendment shape, for\n * a host that does not drive FT=1. When true, that same data unit instead\n * buffers and waits for a size to be registered: FT=1 always publishes before\n * any FT=2 sample referencing it (moqcast #37), but on a lossy path FT=1 can\n * still *arrive* after an offset-zero data unit (reordering, or FT=1's own DU\n * FEC-recovered late) -- treating \"no size yet\" as \"whole sample\" in that\n * window would silently truncate a subsample-partitioned sample.\n *\n * Both `#pending` (incomplete samples) and `#authoredSizes` (registered but\n * not yet consumed) are bounded. `#pending` is bounded by `maxBuffered`\n * samples and `maxSegmentsPerSample` data units per sample; a full table\n * evicts its oldest sample by insertion order rather than throwing, so one\n * FEC-lost subsample DU cannot wedge every future sample. `#authoredSizes` is\n * bounded by retiring each key the moment its sample completes, keeping only a\n * bounded recent-retirement set so a late duplicate or FEC-recovered\n * retransmission for that same sample is dropped rather than silently\n * re-emitted or misread as a fresh whole sample.\n *\n * @packageDocumentation\n */\n\nimport type {\n  MmtpSourcePath,\n  ReassembledMFU,\n  MmtpDeliveryProvenance,\n} from './mfu-reassembler.js'\n\n/** Identifies one authored sample: `(catalogTrackName, mpu, movieFragmentSequenceNumber, sampleNumber)`. */\ntype SampleKey = string\n\nfunction sampleKey(\n  catalogTrackName: string | undefined,\n  mpuSequenceNumber: number,\n  movieFragmentSequenceNumber: number,\n  sampleNumber: number,\n): SampleKey {\n  return JSON.stringify([catalogTrackName ?? null, mpuSequenceNumber, movieFragmentSequenceNumber, sampleNumber])\n}\n\n/** The `catalogTrackName` a key was built from, or undefined when it had none. */\nfunction trackNameOfKey(key: SampleKey): string | undefined {\n  const name = (JSON.parse(key) as [string | null, number, number, number])[0]\n  return name ?? undefined\n}\n\n/** The full authored-sample identity a key was built from. */\nfunction identityOfKey(key: SampleKey): AbandonedSample {\n  const [name, mpuSequenceNumber, movieFragmentSequenceNumber, sampleNumber] =\n    JSON.parse(key) as [string | null, number, number, number]\n  return {\n    catalogTrackName: name ?? undefined,\n    mpuSequenceNumber,\n    movieFragmentSequenceNumber,\n    sampleNumber,\n  }\n}\n\n/**\n * An authored sample that provably will not be delivered, reported to the\n * owner of any per-sample state keyed on this identity so that state can be\n * released. See {@link SampleCombinerOptions.onAbandon}.\n */\nexport interface AbandonedSample {\n  catalogTrackName: string | undefined\n  mpuSequenceNumber: number\n  movieFragmentSequenceNumber: number\n  sampleNumber: number\n}\n\n/** One authored sample combined from its constituent data unit(s). */\nexport interface CombinedSample {\n  mpuSequenceNumber: number\n  movieFragmentSequenceNumber: number\n  sampleNumber: number\n  /** The full sample's media bytes, in ascending-offset order. */\n  data: Uint8Array\n  /** Raw MMTP short-NTP header timestamp for the offset-zero data unit. */\n  mmtpTimestamp?: bigint\n  timestamp: bigint\n  /**\n   * The sample's RAP flag is the RAP flag of the FI=0 or FI=1 object of its\n   * offset-0 data unit (moqcast #37).\n   */\n  rapFlag: boolean\n  priority?: number\n  /** Every authoritative source-packet sequence across all constituent data units, in offset order. */\n  packetSequenceNumbers?: number[]\n  /** Subset of packetSequenceNumbers reconstructed by FEC. */\n  repairedPacketSequenceNumbers?: number[]\n  catalogTrackName?: string\n  /** Number of subsample data units combined (1 for a whole-sample DU or a non-timed passthrough). */\n  subsampleCount: number\n  /** MMTP fragments that formed the sample, summed across constituent data units. */\n  fragmentCount: number\n  /**\n   * Transport that supplied the offset-zero data unit's head fragment. Taken\n   * from that data unit alone -- like {@link CombinedSample.rapFlag} -- rather\n   * than from whichever sibling happened to complete last.\n   */\n  source?: MmtpSourcePath\n  /**\n   * Strict provenance folded across EVERY constituent data unit, and within\n   * each of them across every MMTP fragment. Unlike {@link CombinedSample.source},\n   * which is the offset-zero DU's routing tag, this is whole-sample evidence:\n   * only 'multicast' proves that no byte of this sample arrived another way.\n   */\n  deliveryProvenance: MmtpDeliveryProvenance\n}\n\nexport const SAMPLE_COMBINE_ERROR_CODES = [\n  'duplicate-subsample-offset',\n  'overlapping-subsample',\n  'exceeds-authored-size',\n  'too-many-subsample-segments',\n] as const\n\nexport type SampleCombineErrorCode = typeof SAMPLE_COMBINE_ERROR_CODES[number]\n\n/**\n * Fail-closed rejection reasons for subsample combining. Distinct from\n * {@link MfuReassemblyError}, which governs one data unit's own fragment\n * chain; these govern combining already-reassembled data units into a\n * sample.\n */\nexport class SampleCombineError extends Error {\n  readonly name = 'SampleCombineError'\n\n  constructor(readonly code: SampleCombineErrorCode, message: string) {\n    super(message)\n  }\n}\n\nexport interface SampleCombinerStats {\n  combinedSamples: number\n  passthroughSamples: number\n  timedOutSamples: number\n  /** Incomplete samples discarded to enforce `maxBuffered`. */\n  evictedSamples: number\n}\n\nexport interface SampleCombinerOptions {\n  /**\n   * Max concurrent incomplete samples. Enforced by evicting the oldest by\n   * insertion order, never by throwing, so a host that never calls\n   * {@link SampleCombiner.cleanupTimeouts} still recovers from a permanently\n   * lost subsample data unit instead of wedging.\n   */\n  maxBuffered: number\n  /**\n   * When true, an offset-zero data unit with no registered authored size\n   * buffers and waits for one rather than passing through immediately. See\n   * the module doc.\n   */\n  requireAuthoredSize: boolean\n  /**\n   * Max subsample data units held for one sample at once. Bounds both memory\n   * and the per-insert overlap scan; a legitimate subsample-partitioned\n   * sample needs at most `ceil(sampleSize / (256 * maxPayload))` data units.\n   */\n  maxSegmentsPerSample: number\n  /**\n   * Called once per sample discarded by eviction or timeout -- the two paths\n   * where a sample is abandoned while its stream keeps running.\n   *\n   * Completion and passthrough are deliberately excluded: those samples were\n   * delivered, and their consumer releases whatever per-sample state it held.\n   * Wholesale resets (`flush`, `resetStream`) are excluded too, because they\n   * already discard that state in bulk.\n   *\n   * Exists because per-sample state elsewhere -- notably the ISO-BMFF\n   * timing-sample budget -- is otherwise only released on delivery, making it\n   * a one-way ratchet that wedges the stream once it saturates. The combiner\n   * is where abandonment is actually detected, so it is where the signal has\n   * to come from; inferring it downstream would require a timer or an age\n   * bound, neither of which is derivable from the catalog.\n   */\n  onAbandon?: (sample: AbandonedSample) => void\n}\n\ninterface PendingSample {\n  /** Held data units keyed by their authored base offset. */\n  segments: Map<number, ReassembledMFU>\n  startedAt: number\n}\n\n/** Combines subsample data units of one sample into a contiguous whole. */\nexport class SampleCombiner {\n  #maxBuffered: number\n  #requireAuthoredSize: boolean\n  #maxSegmentsPerSample: number\n  #onAbandon: ((sample: AbandonedSample) => void) | undefined\n  #authoredSizes: Map<SampleKey, number> = new Map()\n  /** Map iteration is insertion-ordered, so the first key is the oldest. */\n  #pending: Map<SampleKey, PendingSample> = new Map()\n  /**\n   * Bounded, insertion-ordered set of recently-completed sample keys, so a\n   * late duplicate or FEC-recovered retransmission is dropped rather than\n   * re-emitted or misread as a fresh whole sample.\n   */\n  #retired: Set<SampleKey> = new Set()\n  #stats: SampleCombinerStats = {\n    combinedSamples: 0,\n    passthroughSamples: 0,\n    timedOutSamples: 0,\n    evictedSamples: 0,\n  }\n\n  constructor(options: SampleCombinerOptions) {\n    const { maxBuffered, requireAuthoredSize, maxSegmentsPerSample, onAbandon } = options\n    if (!Number.isInteger(maxBuffered) || maxBuffered <= 0) {\n      throw new Error('[SampleCombiner] maxBuffered must be a positive integer')\n    }\n    if (!Number.isInteger(maxSegmentsPerSample) || maxSegmentsPerSample <= 0) {\n      throw new Error('[SampleCombiner] maxSegmentsPerSample must be a positive integer')\n    }\n    this.#maxBuffered = maxBuffered\n    this.#requireAuthoredSize = requireAuthoredSize\n    this.#maxSegmentsPerSample = maxSegmentsPerSample\n    this.#onAbandon = onAbandon\n  }\n\n  /** Report one abandoned sample to the owner of any state keyed on it. */\n  #abandon(key: SampleKey): void {\n    this.#onAbandon?.(identityOfKey(key))\n  }\n\n  /**\n   * Register the authored sample size from the host's own FT=1 parse. Per\n   * moqcast #37, FT=1 for a movie fragment publishes before any FT=2 sample\n   * referencing it, so a host driving FT=1 as it arrives registers each\n   * sample's size before that sample's own data unit(s) arrive.\n   *\n   * On a lossy path FT=1 can still *arrive* late, after data units this\n   * combiner has already buffered. Registering a size therefore re-drives the\n   * completion check and returns the combined sample when the buffered data\n   * units already satisfy the newly-known size. Callers MUST consume the\n   * return value: for a sample carried by a single data unit there is no\n   * later {@link SampleCombiner.addMfu} to re-enter, so discarding it\n   * silently drops the sample.\n   *\n   * Registering also clears the key from the retired set. Retirement exists\n   * to drop data units that arrive *passively* after a sample completed \u2014 a\n   * late duplicate, an FEC-recovered retransmission. A host calling this\n   * method is instead asserting that a sample with this identity is authored\n   * now, which is what happens when a publisher restarts and its MPU\n   * sequence numbers begin again, or when MPU sequence wraps. Without this,\n   * such a stream would silently drop every sample whose identity collided\n   * with a retired one until the bounded set aged the key out.\n   */\n  registerAuthoredSize(\n    catalogTrackName: string | undefined,\n    mpuSequenceNumber: number,\n    movieFragmentSequenceNumber: number,\n    sampleNumber: number,\n    size: number,\n  ): CombinedSample | null {\n    const key = sampleKey(catalogTrackName, mpuSequenceNumber, movieFragmentSequenceNumber, sampleNumber)\n    this.#retired.delete(key)\n    this.#authoredSizes.set(key, size)\n    return this.#tryComplete(key, size)\n  }\n\n  /**\n   * Add one reassembled data unit. Returns the combined sample once every\n   * constituent data unit has arrived and totals the authored size.\n   */\n  addMfu(mfu: ReassembledMFU): CombinedSample | null {\n    if (mfu.movieFragmentSequenceNumber === undefined || mfu.sampleNumber === undefined) {\n      // Non-timed (Item) MFU: sample combining does not apply.\n      this.#stats.passthroughSamples++\n      return fromPassthrough(mfu)\n    }\n    const offset = mfu.sampleOffset ?? 0\n    const key = sampleKey(\n      mfu.catalogTrackName,\n      mfu.mpuSequenceNumber,\n      mfu.movieFragmentSequenceNumber,\n      mfu.sampleNumber,\n    )\n\n    if (this.#retired.has(key)) {\n      // Duplicate or late data unit for an already-retired sample (a\n      // FEC-recovered retransmission, reordering after completion, or a\n      // sample discarded by eviction/timeout). Drop it rather than\n      // re-emitting a duplicate downstream or misreading a stray fragment as\n      // a fresh whole sample.\n      return null\n    }\n\n    const dataLen = mfu.data.byteLength\n    const authoredSize = this.#authoredSizes.get(key)\n\n    if (offset === 0 && !this.#pending.has(key)) {\n      const passesThrough = authoredSize === undefined\n        ? !this.#requireAuthoredSize\n        : dataLen === authoredSize\n      if (passesThrough) {\n        this.#stats.passthroughSamples++\n        this.#retire(key)\n        return fromPassthrough(mfu)\n      }\n      // Either shorter than the authored total (a subsample), or awaiting a\n      // size under requireAuthoredSize -- buffer below.\n    }\n\n    // Reject BEFORE mutating any state. An earlier revision allocated the\n    // pending entry (evicting the oldest sample to make room) and only then\n    // validated, so a data unit the combiner went on to reject could destroy\n    // an unrelated in-flight sample and leave an empty entry in its slot.\n    const thisEnd = offset + dataLen\n    if (authoredSize !== undefined && thisEnd > authoredSize) {\n      throw new SampleCombineError(\n        'exceeds-authored-size',\n        'combined subsample data would exceed the registered authored sample size',\n      )\n    }\n    const existing = this.#pending.get(key)\n    if (existing !== undefined) {\n      if (existing.segments.has(offset)) {\n        throw new SampleCombineError(\n          'duplicate-subsample-offset',\n          'subsample data unit duplicates an offset already held for this sample',\n        )\n      }\n      if (existing.segments.size >= this.#maxSegmentsPerSample) {\n        throw new SampleCombineError(\n          'too-many-subsample-segments',\n          'a sample already holds the maximum number of subsample data units',\n        )\n      }\n      for (const [segOffset, seg] of existing.segments) {\n        const segEnd = segOffset + seg.data.byteLength\n        if (offset < segEnd && segOffset < thisEnd) {\n          throw new SampleCombineError(\n            'overlapping-subsample',\n            \"subsample data unit overlaps a preceding data unit's byte range\",\n          )\n        }\n      }\n    }\n\n    let pending = existing\n    if (pending === undefined) {\n      if (this.#pending.size >= this.#maxBuffered) this.#evictOldestPending()\n      pending = { segments: new Map(), startedAt: Date.now() }\n      this.#pending.set(key, pending)\n    }\n    pending.segments.set(offset, mfu)\n\n    if (authoredSize === undefined) return null\n    return this.#tryComplete(key, authoredSize)\n  }\n\n  /**\n   * Emit the sample when its held data units are byte-adjacent from zero and\n   * total `size`. Completion is a protocol event, never a timer.\n   */\n  #tryComplete(key: SampleKey, size: number): CombinedSample | null {\n    const pending = this.#pending.get(key)\n    if (pending === undefined) return null\n    let expected = 0\n    const sortedOffsets = [...pending.segments.keys()].sort((a, b) => a - b)\n    for (const segOffset of sortedOffsets) {\n      if (segOffset !== expected) return null // gap: not yet contiguous from zero.\n      expected += pending.segments.get(segOffset)!.data.byteLength\n    }\n    if (expected !== size) return null // contiguous so far, short of the authored total.\n\n    this.#pending.delete(key)\n    this.#stats.combinedSamples++\n    this.#retire(key)\n    return fromSegments(pending.segments, sortedOffsets)\n  }\n\n  /**\n   * Retire a sample's key: free its registered authored size and remember the\n   * key in a bounded recency set. Called on every path that removes a sample\n   * -- completion, passthrough, eviction, and timeout -- so `#authoredSizes`\n   * cannot accumulate entries for samples that never complete, and so a later\n   * data unit for a discarded sample is dropped rather than starting a fresh\n   * buffer or being misread as a whole sample.\n   *\n   * The recency set holds `maxBuffered` keys. A duplicate delayed by more\n   * than that many retirements escapes it; on a reliable path there is no\n   * such duplicate, and on a lossy path the per-data-unit deadline in\n   * {@link MFUReassembler} bounds the delay well inside this window.\n   */\n  #retire(key: SampleKey): void {\n    this.#authoredSizes.delete(key)\n    this.#retired.add(key)\n    while (this.#retired.size > this.#maxBuffered) {\n      const oldest = this.#retired.values().next().value\n      if (oldest === undefined) break\n      this.#retired.delete(oldest)\n    }\n  }\n\n  /**\n   * Discard the oldest pending sample by insertion order. This is the only\n   * backstop against one FEC-lost subsample data unit wedging\n   * {@link SampleCombiner.addMfu} for every future sample once `maxBuffered`\n   * is reached, for a host that never drives\n   * {@link SampleCombiner.cleanupTimeouts}.\n   */\n  #evictOldestPending(): void {\n    const oldest = this.#pending.keys().next().value\n    if (oldest === undefined) return\n    this.#pending.delete(oldest)\n    this.#stats.evictedSamples++\n    this.#retire(oldest)\n    this.#abandon(oldest)\n  }\n\n  /**\n   * Discard samples whose oldest held segment has waited past `timeoutMs`.\n   * Mirrors {@link MFUReassembler}'s clock-driven shape; the per-data-unit\n   * deadline inside {@link MFUReassembler} already bounds each constituent,\n   * so this is a backstop against a host that registers an authored size but\n   * never supplies every subsample DU.\n   */\n  cleanupTimeouts(timeoutMs: number): void {\n    const now = Date.now()\n    for (const [key, pending] of [...this.#pending]) {\n      if (now - pending.startedAt > timeoutMs) {\n        this.#pending.delete(key)\n        this.#stats.timedOutSamples++\n        this.#retire(key)\n        this.#abandon(key)\n      }\n    }\n  }\n\n  flush(): void {\n    this.#pending.clear()\n    this.#authoredSizes.clear()\n    this.#retired.clear()\n  }\n\n  /**\n   * Drop one stream's in-flight, registered-size, and retired state while\n   * preserving every other stream (mirrors\n   * {@link MFUReassembler.resetStream}).\n   */\n  resetStream(catalogTrackName: string): void {\n    for (const key of this.#pending.keys()) {\n      if (trackNameOfKey(key) === catalogTrackName) this.#pending.delete(key)\n    }\n    for (const key of this.#authoredSizes.keys()) {\n      if (trackNameOfKey(key) === catalogTrackName) this.#authoredSizes.delete(key)\n    }\n    for (const key of this.#retired) {\n      if (trackNameOfKey(key) === catalogTrackName) this.#retired.delete(key)\n    }\n  }\n\n  get stats(): SampleCombinerStats {\n    return { ...this.#stats }\n  }\n\n  get pendingCount(): number {\n    return this.#pending.size\n  }\n\n  /**\n   * Registered authored sizes still held. Diagnostic only: it exists so tests\n   * and health reporting can assert this table stays bounded, since an\n   * unbounded one is invisible from `pendingCount` alone.\n   */\n  get debugAuthoredSizeCount(): number {\n    return this.#authoredSizes.size\n  }\n\n  /** Retired keys still remembered. Diagnostic only, bounded by `maxBuffered`. */\n  get debugRetiredCount(): number {\n    return this.#retired.size\n  }\n}\n\nfunction fromPassthrough(mfu: ReassembledMFU): CombinedSample {\n  return {\n    mpuSequenceNumber: mfu.mpuSequenceNumber,\n    movieFragmentSequenceNumber: mfu.movieFragmentSequenceNumber ?? 0,\n    sampleNumber: mfu.sampleNumber ?? 0,\n    data: mfu.data,\n    mmtpTimestamp: mfu.timestamp,\n    timestamp: mfu.timestamp,\n    rapFlag: mfu.rapFlag,\n    priority: mfu.priority,\n    packetSequenceNumbers: mfu.packetSequenceNumbers,\n    repairedPacketSequenceNumbers: mfu.repairedPacketSequenceNumbers,\n    catalogTrackName: mfu.catalogTrackName,\n    subsampleCount: 1,\n    fragmentCount: mfu.fragmentCount,\n    source: mfu.source,\n    // One data unit in, one sample out: its provenance IS the sample's.\n    deliveryProvenance: mfu.deliveryProvenance\n  }\n}\n\nfunction fromSegments(\n  segments: Map<number, ReassembledMFU>,\n  sortedOffsets: number[],\n): CombinedSample {\n  const totalSize = sortedOffsets.reduce((sum, offset) => sum + segments.get(offset)!.data.byteLength, 0)\n  const data = new Uint8Array(totalSize)\n  let packetSequenceNumbers: number[] | undefined\n  let repairedPacketSequenceNumbers: number[] | undefined\n  let writeOffset = 0\n  let first: ReassembledMFU | undefined\n  let fragmentCount = 0\n  // Fold across data units the same way the reassembler folds across the\n  // fragments inside one: a sample is multicast-exclusive only if every\n  // subsample that formed it was.\n  let combinedProvenance: MmtpDeliveryProvenance =\n    sortedOffsets.length === 0 ? 'unknown' : 'multicast'\n  for (const offset of sortedOffsets) {\n    const seg = segments.get(offset)!\n    combinedProvenance =\n      combinedProvenance === 'mixed' || seg.deliveryProvenance === 'mixed'\n        ? 'mixed'\n        : combinedProvenance === 'unknown' || seg.deliveryProvenance === 'unknown'\n          ? 'unknown'\n          : 'multicast'\n    data.set(seg.data, writeOffset)\n    writeOffset += seg.data.byteLength\n    fragmentCount += seg.fragmentCount\n    if (seg.packetSequenceNumbers !== undefined) {\n      (packetSequenceNumbers ??= []).push(...seg.packetSequenceNumbers)\n    }\n    if (seg.repairedPacketSequenceNumbers !== undefined) {\n      (repairedPacketSequenceNumbers ??= []).push(...seg.repairedPacketSequenceNumbers)\n    }\n    if (first === undefined) first = seg\n  }\n  return {\n    mpuSequenceNumber: first!.mpuSequenceNumber,\n    movieFragmentSequenceNumber: first!.movieFragmentSequenceNumber!,\n    sampleNumber: first!.sampleNumber!,\n    data,\n    mmtpTimestamp: first!.timestamp,\n    timestamp: first!.timestamp,\n    rapFlag: first!.rapFlag,\n    priority: first!.priority,\n    packetSequenceNumbers,\n    repairedPacketSequenceNumbers,\n    catalogTrackName: first!.catalogTrackName,\n    subsampleCount: segments.size,\n    fragmentCount,\n    source: first!.source,\n    deliveryProvenance: combinedProvenance,\n  }\n}\n\n// =============================================================================\n// Inline Tests (vitest)\n// =============================================================================\n\nif (import.meta.vitest) {\n  const { describe, test, expect } = import.meta.vitest\n\n  const combiner = (overrides: Partial<SampleCombinerOptions> = {}) =>\n    new SampleCombiner({\n      maxBuffered: 10,\n      requireAuthoredSize: false,\n      maxSegmentsPerSample: 8,\n      ...overrides,\n    })\n\n  const mfu = (\n    mpu: number,\n    movie: number,\n    sample: number,\n    offset: number,\n    data: number[],\n    timestamp: bigint,\n    rapFlag: boolean,\n    deliveryProvenance: MmtpDeliveryProvenance = 'multicast',\n  ): ReassembledMFU => ({\n    mpuSequenceNumber: mpu,\n    data: new Uint8Array(data),\n    timestamp,\n    fragmentCount: 1,\n    rapFlag,\n    sampleNumber: sample,\n    movieFragmentSequenceNumber: movie,\n    sampleOffset: offset,\n    packetSequenceNumbers: [offset],\n    deliveryProvenance,\n  })\n\n  describe('SampleCombiner', () => {\n    test('whole-sample DU passes through immediately with no registered size', () => {\n      const c = combiner()\n      const out = c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3, 4, 5], 1000n, true))\n      expect(out).not.toBeNull()\n      expect(out!.data).toEqual(new Uint8Array([1, 2, 3, 4, 5]))\n      expect(out!.subsampleCount).toBe(1)\n      expect(c.pendingCount).toBe(0)\n    })\n\n    test('whole-sample DU passes through when it matches the registered size', () => {\n      const c = combiner()\n      c.registerAuthoredSize(undefined, 1, 9, 17, 5)\n      const out = c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3, 4, 5], 1000n, true))\n      expect(out?.data).toEqual(new Uint8Array([1, 2, 3, 4, 5]))\n    })\n\n    test('subsample data units combine once the authored size is met', () => {\n      const c = combiner()\n      c.registerAuthoredSize(undefined, 1, 9, 17, 10)\n\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3, 4, 5], 1000n, true))).toBeNull()\n      expect(c.pendingCount).toBe(1)\n\n      const out = c.addMfu(mfu(1, 9, 17, 5, [6, 7, 8, 9, 10], 1001n, false))\n      expect(out?.data).toEqual(new Uint8Array([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]))\n      expect(out?.subsampleCount).toBe(2)\n      expect(out?.rapFlag).toBe(true) // offset-0 DU's RAP flag, per moqcast #37.\n      expect(out?.timestamp).toBe(1000n)\n      expect(c.pendingCount).toBe(0)\n      expect(c.stats.combinedSamples).toBe(1)\n    })\n\n    test('subsample data units combine out of order', () => {\n      const c = combiner()\n      c.registerAuthoredSize(undefined, 1, 9, 17, 10)\n\n      expect(c.addMfu(mfu(1, 9, 17, 5, [6, 7, 8, 9, 10], 1001n, false))).toBeNull()\n      const out = c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3, 4, 5], 1000n, true))\n      expect(out?.data).toEqual(new Uint8Array([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]))\n    })\n\n    test('subsample without a registered size never completes', () => {\n      // A non-zero-offset DU always buffers (it can never be a whole\n      // sample). Without a registered authored size there is nothing to\n      // combine against, so it -- and a sibling that arrives after it --\n      // stay pending rather than being guessed complete.\n      const c = combiner()\n      expect(c.addMfu(mfu(1, 9, 17, 3, [1, 2, 3], 1001n, false))).toBeNull()\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3], 1000n, true))).toBeNull()\n      expect(c.pendingCount).toBe(1)\n    })\n\n    test('requireAuthoredSize buffers an offset-zero DU instead of guessing complete', () => {\n      // A moqcast-#37-aware host opts into fail-closed buffering: on a lossy\n      // path FT=1 can arrive after an offset-zero data unit (reordering, or\n      // FT=1's own DU recovered late by FEC). Treating \"no size yet\" as\n      // \"whole sample\" would silently truncate a partitioned sample.\n      const c = combiner({ requireAuthoredSize: true })\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3, 4, 5], 1000n, true))).toBeNull()\n      expect(c.pendingCount).toBe(1)\n\n      c.registerAuthoredSize(undefined, 1, 9, 17, 10)\n      const out = c.addMfu(mfu(1, 9, 17, 5, [6, 7, 8, 9, 10], 1001n, false))\n      expect(out?.data).toEqual(new Uint8Array([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]))\n    })\n\n    test('duplicate offset is rejected', () => {\n      const c = combiner()\n      c.registerAuthoredSize(undefined, 1, 9, 17, 10)\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3, 4, 5], 1000n, true))).toBeNull()\n      expect(() => c.addMfu(mfu(1, 9, 17, 0, [9, 9, 9, 9, 9], 2000n, true)))\n        .toThrow(SampleCombineError)\n    })\n\n    test('overlapping subsample is rejected', () => {\n      const c = combiner()\n      c.registerAuthoredSize(undefined, 1, 9, 17, 10)\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3, 4, 5], 1000n, true))).toBeNull()\n      expect(() => c.addMfu(mfu(1, 9, 17, 3, [9, 9, 9, 9, 9], 2000n, true)))\n        .toThrow(SampleCombineError)\n    })\n\n    test('exceeding the authored size is rejected', () => {\n      const c = combiner()\n      c.registerAuthoredSize(undefined, 1, 9, 17, 8)\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3, 4, 5], 1000n, true))).toBeNull()\n      expect(() => c.addMfu(mfu(1, 9, 17, 5, [6, 7, 8, 9, 10], 2000n, false)))\n        .toThrow(SampleCombineError)\n    })\n\n    test('exceeding maxSegmentsPerSample is rejected', () => {\n      const c = combiner({ maxSegmentsPerSample: 2 })\n      c.registerAuthoredSize(undefined, 1, 9, 17, 100)\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 2], 1000n, true))).toBeNull()\n      expect(c.addMfu(mfu(1, 9, 17, 2, [3, 4], 1001n, false))).toBeNull()\n      expect(() => c.addMfu(mfu(1, 9, 17, 4, [5, 6], 1002n, false)))\n        .toThrow(SampleCombineError)\n    })\n\n    test('reports every abandoned sample so its per-sample state can be freed', () => {\n      // Regression (BLO-31103): eviction and timeout are the two paths where\n      // a sample is abandoned while its stream keeps running. State keyed on\n      // that sample elsewhere -- notably the ISO-BMFF timing-sample budget --\n      // is otherwise released only on delivery, so an abandoned sample holds\n      // its slot forever and the budget becomes a one-way ratchet that wedges\n      // the stream at saturation.\n      const abandoned: AbandonedSample[] = []\n      const c = combiner({ maxBuffered: 2, onAbandon: s => abandoned.push(s) })\n      c.registerAuthoredSize(undefined, 1, 9, 17, 10)\n      c.registerAuthoredSize(undefined, 1, 9, 18, 10)\n      c.registerAuthoredSize(undefined, 1, 9, 19, 10)\n\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 1, 1, 1, 1], 1000n, true))).toBeNull()\n      expect(c.addMfu(mfu(1, 9, 18, 0, [2, 2, 2, 2, 2], 1001n, true))).toBeNull()\n      expect(abandoned).toEqual([])\n\n      // Eviction reports the evicted identity, not the incoming one.\n      expect(c.addMfu(mfu(1, 9, 19, 0, [3, 3, 3, 3, 3], 1002n, true))).toBeNull()\n      expect(abandoned).toEqual([{\n        catalogTrackName: undefined,\n        mpuSequenceNumber: 1,\n        movieFragmentSequenceNumber: 9,\n        sampleNumber: 17,\n      }])\n\n      // Timeout reports too; both survivors are still incomplete here.\n      c.cleanupTimeouts(-1)\n      expect(abandoned.map(s => s.sampleNumber)).toEqual([17, 18, 19])\n\n      // A delivered sample is NOT reported: its consumer releases that state.\n      const d = combiner({ maxBuffered: 2, onAbandon: s => abandoned.push(s) })\n      d.registerAuthoredSize(undefined, 1, 9, 20, 10)\n      expect(d.addMfu(mfu(1, 9, 20, 0, [4, 4, 4, 4, 4], 1003n, true))).toBeNull()\n      expect(d.addMfu(mfu(1, 9, 20, 5, [5, 5, 5, 5, 5], 1004n, false))).not.toBeNull()\n      expect(abandoned.map(s => s.sampleNumber)).toEqual([17, 18, 19])\n    })\n\n    test('a full combiner evicts the oldest pending sample instead of throwing', () => {\n      // Eviction is by insertion order, which is also the only backstop\n      // against one permanently-lost subsample DU wedging every future\n      // sample once maxBuffered incomplete samples accumulate.\n      const c = combiner({ maxBuffered: 2 })\n      c.registerAuthoredSize(undefined, 1, 9, 17, 10)\n      c.registerAuthoredSize(undefined, 1, 9, 18, 10)\n      c.registerAuthoredSize(undefined, 1, 9, 19, 10)\n\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 1, 1, 1, 1], 1000n, true))).toBeNull()\n      expect(c.addMfu(mfu(1, 9, 18, 0, [2, 2, 2, 2, 2], 1001n, true))).toBeNull()\n      expect(c.pendingCount).toBe(2)\n\n      // A third distinct incomplete sample evicts sample 17, the oldest.\n      expect(c.addMfu(mfu(1, 9, 19, 0, [3, 3, 3, 3, 3], 1002n, true))).toBeNull()\n      expect(c.pendingCount).toBe(2)\n      expect(c.stats.evictedSamples).toBe(1)\n\n      // The surviving samples are undisturbed and still complete normally.\n      expect(c.addMfu(mfu(1, 9, 18, 5, [8, 8, 8, 8, 8], 2001n, false))?.data)\n        .toEqual(new Uint8Array([2, 2, 2, 2, 2, 8, 8, 8, 8, 8]))\n      expect(c.addMfu(mfu(1, 9, 19, 5, [9, 9, 9, 9, 9], 2002n, false))?.data)\n        .toEqual(new Uint8Array([3, 3, 3, 3, 3, 9, 9, 9, 9, 9]))\n\n      // The combiner still accepts new work rather than being wedged.\n      c.registerAuthoredSize(undefined, 1, 9, 20, 10)\n      expect(c.addMfu(mfu(1, 9, 20, 0, [4, 4, 4, 4, 4], 3000n, true))).toBeNull()\n      expect(c.addMfu(mfu(1, 9, 20, 5, [7, 7, 7, 7, 7], 3001n, false))?.data)\n        .toEqual(new Uint8Array([4, 4, 4, 4, 4, 7, 7, 7, 7, 7]))\n    })\n\n    test('a completed sample frees its authored size and drops a late duplicate', () => {\n      const c = combiner()\n      c.registerAuthoredSize(undefined, 1, 9, 17, 10)\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3, 4, 5], 1000n, true))).toBeNull()\n      expect(c.addMfu(mfu(1, 9, 17, 5, [6, 7, 8, 9, 10], 1001n, false))).not.toBeNull()\n\n      // A FEC-recovered retransmission of the completed sample's offset-0\n      // data unit must not be re-emitted as a second complete sample.\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3, 4, 5], 2000n, true))).toBeNull()\n    })\n\n    test('resetStream drops one track and preserves the others', () => {\n      const c = combiner()\n      c.registerAuthoredSize('video/720p', 1, 9, 17, 10)\n      c.registerAuthoredSize('audio', 1, 9, 17, 10)\n      const video = { ...mfu(1, 9, 17, 0, [1, 1, 1, 1, 1], 1000n, true), catalogTrackName: 'video/720p' }\n      const audio = { ...mfu(1, 9, 17, 0, [2, 2, 2, 2, 2], 1000n, true), catalogTrackName: 'audio' }\n      expect(c.addMfu(video)).toBeNull()\n      expect(c.addMfu(audio)).toBeNull()\n\n      c.resetStream('video/720p')\n      expect(c.pendingCount).toBe(1)\n\n      const audioTail = { ...mfu(1, 9, 17, 5, [3, 3, 3, 3, 3], 1001n, false), catalogTrackName: 'audio' }\n      expect(c.addMfu(audioTail)?.data).toEqual(new Uint8Array([2, 2, 2, 2, 2, 3, 3, 3, 3, 3]))\n    })\n\n    test('flush clears registered authored sizes', () => {\n      const c = combiner()\n      c.registerAuthoredSize(undefined, 1, 9, 17, 5)\n      c.flush()\n      // A now-unregistered size means an offset-zero DU passes through\n      // immediately again (requireAuthoredSize is false here) rather than\n      // waiting on a size flush() already discarded.\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3, 4, 5], 1000n, true))?.data)\n        .toEqual(new Uint8Array([1, 2, 3, 4, 5]))\n    })\n\n    test('a healthy stream accumulates no bookkeeping', () => {\n      // Regression: retirement ran only on completion paths, so an\n      // abandoned sample's registered size stayed resident forever.\n      const c = combiner({ maxBuffered: 4, requireAuthoredSize: true })\n      for (let i = 0; i < 1000; i++) {\n        expect(c.registerAuthoredSize(undefined, 1, 9, i, 10)).toBeNull()\n        expect(c.addMfu(mfu(1, 9, i, 0, [1, 1, 1, 1, 1], 1000n, true))).toBeNull()\n        expect(c.addMfu(mfu(1, 9, i, 5, [2, 2, 2, 2, 2], 1001n, false))).not.toBeNull()\n      }\n      expect(c.stats.combinedSamples).toBe(1000)\n      expect(c.pendingCount).toBe(0)\n      expect(c.debugAuthoredSizeCount).toBe(0)\n      expect(c.debugRetiredCount).toBeLessThanOrEqual(4)\n    })\n\n    test('samples that never complete release their authored size', () => {\n      const c = combiner({ maxBuffered: 4, requireAuthoredSize: true })\n      for (let i = 0; i < 1000; i++) {\n        expect(c.registerAuthoredSize(undefined, 1, 9, i, 10)).toBeNull()\n        expect(c.addMfu(mfu(1, 9, i, 0, [1, 1, 1, 1, 1], 1000n, true))).toBeNull()\n        // Deliberately never supply the tail.\n      }\n      c.cleanupTimeouts(-1) // expire everything still held\n      expect(c.pendingCount).toBe(0)\n      expect(c.debugAuthoredSizeCount).toBe(0)\n    })\n\n    test('a late authored size completes an already-buffered sample', () => {\n      // Regression: with requireAuthoredSize the completion check ran only\n      // inside addMfu, so a sample carried by a SINGLE data unit whose FT=1\n      // arrived afterwards had no later data unit to re-enter on and was\n      // silently lost.\n      const c = combiner({ requireAuthoredSize: true })\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 2, 3, 4, 5], 1000n, true))).toBeNull()\n      expect(c.pendingCount).toBe(1)\n\n      const out = c.registerAuthoredSize(undefined, 1, 9, 17, 5)\n      expect(out?.data).toEqual(new Uint8Array([1, 2, 3, 4, 5]))\n      expect(out?.subsampleCount).toBe(1)\n      expect(c.pendingCount).toBe(0)\n    })\n\n    test('a rejected data unit does not evict a live sample', () => {\n      // Regression: the pending slot was allocated (evicting the oldest\n      // sample to make room) BEFORE validation, so a data unit the combiner\n      // went on to reject destroyed an unrelated in-flight sample.\n      const c = combiner({ maxBuffered: 2 })\n      for (const s of [17, 18, 19]) c.registerAuthoredSize(undefined, 1, 9, s, 10)\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 1, 1, 1, 1], 1000n, true))).toBeNull()\n      expect(c.addMfu(mfu(1, 9, 18, 0, [2, 2, 2, 2, 2], 1001n, true))).toBeNull()\n      expect(c.pendingCount).toBe(2)\n\n      // 8 + 5 = 13 exceeds sample 19's authored size of 10.\n      expect(() => c.addMfu(mfu(1, 9, 19, 8, [9, 9, 9, 9, 9], 2000n, false)))\n        .toThrow(SampleCombineError)\n      expect(c.stats.evictedSamples).toBe(0)\n      expect(c.pendingCount).toBe(2)\n\n      // Sample 17 is untouched and still completes.\n      expect(c.addMfu(mfu(1, 9, 17, 5, [3, 3, 3, 3, 3], 2001n, false))?.data)\n        .toEqual(new Uint8Array([1, 1, 1, 1, 1, 3, 3, 3, 3, 3]))\n    })\n\n    test('an evicted sample is retired rather than reopened', () => {\n      const c = combiner({ maxBuffered: 1 })\n      for (const s of [17, 18]) c.registerAuthoredSize(undefined, 1, 9, s, 10)\n      expect(c.addMfu(mfu(1, 9, 17, 0, [1, 1, 1, 1, 1], 1000n, true))).toBeNull()\n      expect(c.addMfu(mfu(1, 9, 18, 0, [2, 2, 2, 2, 2], 1001n, true))).toBeNull()\n      expect(c.stats.evictedSamples).toBe(1)\n\n      // Sample 17's tail arrives after its eviction; it must not reopen.\n      expect(c.addMfu(mfu(1, 9, 17, 5, [3, 3, 3, 3, 3], 2000n, false))).toBeNull()\n      expect(c.pendingCount).toBe(1)\n    })\n  })\n\n  describe('sample-level delivery provenance', () => {\n    test('one non-multicast subsample makes the whole sample non-exclusive', () => {\n      // A 4K/8K sample is split across subsample DUs. If any one of them\n      // arrived over QUIC, the assembled sample contains bytes that never\n      // crossed a multicast socket, so the sample is not physical evidence\n      // even though every other DU was multicast.\n      const c = combiner()\n      c.registerAuthoredSize(undefined, 1, 1, 1, 4)\n      expect(c.addMfu(mfu(1, 1, 1, 0, [1, 2], 100n, true, 'multicast'))).toBeNull()\n      const done = c.addMfu(mfu(1, 1, 1, 2, [3, 4], 100n, false, 'mixed'))\n      expect(done).not.toBeNull()\n      expect(done!.subsampleCount).toBe(2)\n      expect(done!.deliveryProvenance).toBe('mixed')\n    })\n\n    test('an unattributed subsample degrades the sample to unknown', () => {\n      const c = combiner()\n      c.registerAuthoredSize(undefined, 2, 1, 1, 4)\n      expect(c.addMfu(mfu(2, 1, 1, 0, [1, 2], 100n, true, 'multicast'))).toBeNull()\n      const done = c.addMfu(mfu(2, 1, 1, 2, [3, 4], 100n, false, 'unknown'))\n      expect(done).not.toBeNull()\n      expect(done!.deliveryProvenance).toBe('unknown')\n    })\n\n    test('an all-multicast sample stays multicast-exclusive', () => {\n      const c = combiner()\n      c.registerAuthoredSize(undefined, 3, 1, 1, 4)\n      expect(c.addMfu(mfu(3, 1, 1, 0, [1, 2], 100n, true, 'multicast'))).toBeNull()\n      const done = c.addMfu(mfu(3, 1, 1, 2, [3, 4], 100n, false, 'multicast'))\n      expect(done).not.toBeNull()\n      expect(done!.deliveryProvenance).toBe('multicast')\n    })\n\n    test('a passthrough sample inherits its data unit provenance verbatim', () => {\n      const c = combiner()\n      const done = c.addMfu(mfu(4, 1, 1, 0, [1, 2], 100n, true, 'mixed'))\n      expect(done).not.toBeNull()\n      expect(done!.subsampleCount).toBe(1)\n      expect(done!.deliveryProvenance).toBe('mixed')\n    })\n  })\n}\n", "/**\n * H.264/AVC codec utilities for MMTP container format conversion.\n *\n * Shared between moq-lib (hang-mmt-fec) and moqtail players.\n * Handles AVCC\u2194Annex-B conversion, SPS/PPS extraction, fallback avcC generation,\n * and MMTP timestamp conversion.\n *\n * @packageDocumentation\n */\n\n// \u2500\u2500\u2500 Public Types \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n/** Result of extracting a video codec configuration record from an fMP4 init segment. */\nexport interface AvcCInfo {\n  codec: string\n  description: Uint8Array\n}\n\n/** Result of extracting AAC AudioSpecificConfig from an fMP4 init segment. */\nexport interface AacAscInfo {\n  /** Codec string like \"mp4a.40.2\" (AAC-LC). Derived from AOT in ASC[0] >> 3. */\n  codec: string\n  /** AudioSpecificConfig bytes \u2014 what AudioDecoder.configure({description}) needs for raw AAC. */\n  description: Uint8Array\n}\n\n/** SPS and PPS NAL units extracted from an avcC record. */\nexport interface SpsPps {\n  sps: Uint8Array\n  pps: Uint8Array\n}\n\n/** Options for fallback avcC generation. */\nexport interface FallbackAvcCOptions {\n  /** Codec string like \"avc1.640033\". Profile/constraint/level parsed from hex triplet. */\n  codec?: string\n  /** Coded width in pixels. Used in SPS pic_width_in_mbs. */\n  width?: number\n  /** Coded height in pixels. Used in SPS pic_height_in_map_units. */\n  height?: number\n}\n\n// \u2500\u2500\u2500 Public Functions \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n/**\n * Extract the codec configuration record (avcC/hvcC/av1C/vpcC) from\n * an fMP4 init segment (moov box).\n * MMTP FT=0 packets contain a complete fMP4: moov > trak > mdia > minf > stbl > stsd > sample entry > codec config.\n *\n * Walks every trak and returns the first supported video sample entry. This\n * handles both per-track CMSF init segments and multiplexed ftyp+moov blobs\n * where the audio trak may appear before video.\n */\nexport function extractAvcCFromInitSegment(data: Uint8Array): AvcCInfo | undefined {\n  if (!hasIsoBmffMagic(data)) return undefined\n\n  for (const stsd of findTrackStsdBoxes(data)) {\n    const info = extractVideoConfigFromStsd(data, stsd)\n    if (info) return info\n  }\n\n  return undefined\n}\n\nfunction extractVideoConfigFromStsd(data: Uint8Array, stsd: { o: number; sz: number }): AvcCInfo | undefined {\n  let s = stsd.o + 16\n  const e = stsd.o + stsd.sz\n\n  // H.264: avc1 VisualSampleEntry \u2192 avcC.\n  const avc1 = findBox(data, s, e, 'avc1')\n  if (avc1 && avc1.sz >= 86) {\n    const avcC = findBox(data, avc1.o + 86, avc1.o + avc1.sz, 'avcC')\n    if (avcC && avcC.sz >= 12) {\n      const d = data.subarray(avcC.o + 8, avcC.o + avcC.sz)\n      const codec = `avc1.${hex2(d[1])}${hex2(d[2])}${hex2(d[3])}`\n      return { codec, description: d }\n    }\n  }\n  // HEVC: hvc1/hev1 VisualSampleEntry \u2192 hvcC. Same +86 child-box offset as\n  // avc1 (identical VisualSampleEntry layout). Without this branch, HEVC\n  // ftyp+moov inits yield no descriptor, so the WebCodecs path configures the\n  // VideoDecoder with no `description` and the first length-prefixed hvc1\n  // keyframe decode() throws DataError (\"must fill out the description field\"),\n  // which the player's MoQ pump catch swallows \u2192 video track silently 0-fps\n  // (BLO-8054).\n  const hvc1 = findBox(data, s, e, 'hvc1') ?? findBox(data, s, e, 'hev1')\n  if (hvc1 && hvc1.sz >= 86) {\n    const hvcC = findBox(data, hvc1.o + 86, hvc1.o + hvc1.sz, 'hvcC')\n    // HEVCDecoderConfigurationRecord is \u226523 bytes (+8 box header).\n    if (hvcC && hvcC.sz >= 8 + 23) {\n      const d = data.subarray(hvcC.o + 8, hvcC.o + hvcC.sz)\n      return { codec: hevcCodecStringFromHvcC(d), description: d }\n    }\n  }\n  // AV1: av01 VisualSampleEntry -> av1C. Real FFmpeg MMTP inits can carry an\n  // empty av1C box (size=8) while still providing the authoritative sample\n  // entry/codec signal. Return an empty description for that shape so callers\n  // can open their FT=0 gate without passing a zero-byte WebCodecs description.\n  const av01 = findBox(data, s, e, 'av01')\n  if (av01 && av01.sz >= 86) {\n    const av1C = findBox(data, av01.o + 86, av01.o + av01.sz, 'av1C')\n    if (av1C && av1C.sz >= 8) {\n      const d = data.subarray(av1C.o + 8, av1C.o + av1C.sz)\n      return { codec: codecStringFromAv1C(d), description: d }\n    }\n  }\n  // VP9: vp09 VisualSampleEntry -> vpcC. Some encoders omit the VP codec record\n  // payload; use the sample entry as readiness evidence and fall back to a\n  // conservative vp09 codec string in that case.\n  const vp09 = findBox(data, s, e, 'vp09')\n  if (vp09 && vp09.sz >= 86) {\n    const vpcC = findBox(data, vp09.o + 86, vp09.o + vp09.sz, 'vpcC')\n    if (vpcC && vpcC.sz >= 8) {\n      const d = data.subarray(vpcC.o + 8, vpcC.o + vpcC.sz)\n      return { codec: codecStringFromVpcC(d), description: d }\n    }\n  }\n  return undefined\n}\n\n/**\n * Generate a minimal avcC (AVCDecoderConfigurationRecord) from codec parameters.\n * Parses \"avc1.XXYYZZ\" \u2192 profile_idc=0xXX, constraint_flags=0xYY, level_idc=0xZZ.\n * Width/height are encoded in the SPS; if not provided, they're inferred from the\n * H.264 level's max frame size (e.g. level 4.2 \u2192 2048x1088).\n * Used when late MoQ subscribers miss the FT=0 init segment (moov/avcC).\n */\nexport function generateFallbackAvcC(options?: FallbackAvcCOptions | string): Uint8Array {\n  const opts: FallbackAvcCOptions = typeof options === 'string' ? { codec: options } : (options ?? {})\n\n  let profile = 0x64\n  let constraint = 0x00\n  let level = 0x2a\n\n  if (opts.codec) {\n    const match = opts.codec.match(/^avc[13]\\.([0-9a-fA-F]{6})$/)\n    if (match) {\n      profile = Number.parseInt(match[1].substring(0, 2), 16)\n      constraint = Number.parseInt(match[1].substring(2, 4), 16)\n      level = Number.parseInt(match[1].substring(4, 6), 16)\n    }\n  }\n\n  const { width, height } = resolveResolution(opts.width, opts.height, level)\n  const sps = buildMinimalSps(profile, constraint, level, width, height)\n  const pps = buildMinimalPps(profile)\n\n  const avcC = new Uint8Array(5 + 1 + 2 + sps.length + 1 + 2 + pps.length)\n  let w = 0\n  avcC[w++] = 0x01\n  avcC[w++] = profile\n  avcC[w++] = constraint\n  avcC[w++] = level\n  avcC[w++] = 0xff\n  avcC[w++] = 0xe1\n  avcC[w++] = (sps.length >> 8) & 0xff\n  avcC[w++] = sps.length & 0xff\n  avcC.set(sps, w)\n  w += sps.length\n  avcC[w++] = 0x01\n  avcC[w++] = (pps.length >> 8) & 0xff\n  avcC[w++] = pps.length & 0xff\n  avcC.set(pps, w)\n  return avcC\n}\n\n/**\n * Extract raw SPS and PPS NAL unit bytes from an avcC (AVCDecoderConfigurationRecord).\n * Returns the first SPS and first PPS found.\n */\nexport function extractSpsPpsFromAvcC(avcC: Uint8Array): SpsPps | undefined {\n  if (avcC.length < 8) return undefined\n  const numSPS = avcC[5] & 0x1f\n  let offset = 6\n  let sps: Uint8Array | undefined\n  for (let i = 0; i < numSPS && offset + 2 <= avcC.length; i++) {\n    const spsLen = (avcC[offset] << 8) | avcC[offset + 1]\n    offset += 2\n    if (offset + spsLen <= avcC.length) {\n      if (!sps) sps = avcC.subarray(offset, offset + spsLen)\n      offset += spsLen\n    }\n  }\n  let pps: Uint8Array | undefined\n  if (offset < avcC.length) {\n    const numPPS = avcC[offset] & 0x1f\n    offset++\n    for (let i = 0; i < numPPS && offset + 2 <= avcC.length; i++) {\n      const ppsLen = (avcC[offset] << 8) | avcC[offset + 1]\n      offset += 2\n      if (offset + ppsLen <= avcC.length) {\n        if (!pps) pps = avcC.subarray(offset, offset + ppsLen)\n        offset += ppsLen\n      }\n    }\n  }\n  return sps && pps ? { sps, pps } : undefined\n}\n\n/**\n * Convert AVCC (4-byte NAL length prefixed) to Annex-B (start code prefixed).\n * Prepends SPS/PPS NALs before keyframes.\n */\nexport function avccToAnnexB(avccData: Uint8Array, isKeyframe: boolean, spsPps: SpsPps): Uint8Array {\n  let offset = 0\n  let totalNalSize = 0\n  let nalCount = 0\n  while (offset + 4 <= avccData.length) {\n    const nalLen =\n      (avccData[offset] << 24) |\n      (avccData[offset + 1] << 16) |\n      (avccData[offset + 2] << 8) |\n      avccData[offset + 3]\n    offset += 4\n    if (nalLen <= 0 || offset + nalLen > avccData.length) break\n    totalNalSize += nalLen\n    nalCount++\n    offset += nalLen\n  }\n  if (nalCount === 0) return avccData\n\n  let outSize = nalCount * 4 + totalNalSize\n  if (isKeyframe) {\n    outSize += 4 + spsPps.sps.length + 4 + spsPps.pps.length\n  }\n  const out = new Uint8Array(outSize)\n  let w = 0\n\n  if (isKeyframe) {\n    out[w++] = 0; out[w++] = 0; out[w++] = 0; out[w++] = 1\n    out.set(spsPps.sps, w); w += spsPps.sps.length\n    out[w++] = 0; out[w++] = 0; out[w++] = 0; out[w++] = 1\n    out.set(spsPps.pps, w); w += spsPps.pps.length\n  }\n\n  offset = 0\n  while (offset + 4 <= avccData.length) {\n    const nalLen =\n      (avccData[offset] << 24) |\n      (avccData[offset + 1] << 16) |\n      (avccData[offset + 2] << 8) |\n      avccData[offset + 3]\n    offset += 4\n    if (nalLen <= 0 || offset + nalLen > avccData.length) break\n    out[w++] = 0; out[w++] = 0; out[w++] = 0; out[w++] = 1\n    out.set(avccData.subarray(offset, offset + nalLen), w)\n    w += nalLen\n    offset += nalLen\n  }\n  return out\n}\n\n/**\n * Build an avcC record by parsing Annex-B data to extract SPS (NAL type 7) and PPS (NAL type 8).\n * Returns the avcC record, or null if SPS/PPS not found.\n */\nexport function extractCodecDescriptionFromAnnexB(data: Uint8Array): Uint8Array | null {\n  const nalUnits: Array<{ type: number; data: Uint8Array }> = []\n  let i = 0\n  while (i < data.length - 4) {\n    if (data[i] === 0 && data[i + 1] === 0) {\n      let nalStart = 0\n      if (data[i + 2] === 1) {\n        nalStart = i + 3\n      } else if (data[i + 2] === 0 && data[i + 3] === 1) {\n        nalStart = i + 4\n      }\n      if (nalStart > 0 && nalStart < data.length) {\n        let nalEnd = data.length\n        for (let j = nalStart; j < data.length - 3; j++) {\n          if (data[j] === 0 && data[j + 1] === 0 &&\n              (data[j + 2] === 1 || (data[j + 2] === 0 && data[j + 3] === 1))) {\n            nalEnd = j\n            break\n          }\n        }\n        const nalType = data[nalStart] & 0x1f\n        nalUnits.push({ type: nalType, data: data.slice(nalStart, nalEnd) })\n        i = nalEnd\n        continue\n      }\n    }\n    i++\n  }\n\n  const sps = nalUnits.find(n => n.type === 7)\n  const pps = nalUnits.find(n => n.type === 8)\n  if (!sps || !pps) return null\n\n  const avcCLength = 6 + 2 + sps.data.length + 1 + 2 + pps.data.length\n  const avcC = new Uint8Array(avcCLength)\n  let offset = 0\n  avcC[offset++] = 1\n  avcC[offset++] = sps.data[1]\n  avcC[offset++] = sps.data[2]\n  avcC[offset++] = sps.data[3]\n  avcC[offset++] = 0xff\n  avcC[offset++] = 0xe1\n  avcC[offset++] = (sps.data.length >> 8) & 0xff\n  avcC[offset++] = sps.data.length & 0xff\n  avcC.set(sps.data, offset); offset += sps.data.length\n  avcC[offset++] = 1\n  avcC[offset++] = (pps.data.length >> 8) & 0xff\n  avcC[offset++] = pps.data.length & 0xff\n  avcC.set(pps.data, offset)\n  return avcC\n}\n\n/**\n * Derive codec string from avcC record (e.g. \"avc1.640033\").\n */\nexport function codecStringFromAvcC(avcC: Uint8Array): string {\n  if (avcC.length < 4) return 'avc1.640033'\n  return `avc1.${hex2(avcC[1])}${hex2(avcC[2])}${hex2(avcC[3])}`\n}\n\n/** VPS/SPS/PPS NAL units extracted from an HEVC keyframe (raw NAL bytes, no start code/length prefix). */\nexport interface HevcParameterSets {\n  vps?: Uint8Array\n  sps?: Uint8Array\n  pps?: Uint8Array\n}\n\n/** True for HEVC/H.265 codec strings (hev1.* / hvc1.*). */\nexport function isHevcCodec(codec: string): boolean {\n  return codec.startsWith('hev1') || codec.startsWith('hvc1')\n}\n\n/** HEVC NAL unit type from the first NAL header byte: (byte >> 1) & 0x3f. */\nfunction hevcNalType(nal: Uint8Array): number {\n  return (nal[0] >> 1) & 0x3f\n}\n\n/**\n * Remove H.26x emulation-prevention bytes (0x03 after 0x00 0x00) from an RBSP so\n * fixed-position fields (e.g. HEVC profile_tier_level) can be read by byte offset.\n */\nexport function removeEmulationPrevention(rbsp: Uint8Array): Uint8Array {\n  const out: number[] = []\n  let zeros = 0\n  for (let i = 0; i < rbsp.length; i++) {\n    const b = rbsp[i]\n    if (zeros >= 2 && b === 0x03 && i + 1 < rbsp.length && rbsp[i + 1] <= 0x03) {\n      zeros = 0\n      continue\n    }\n    out.push(b)\n    zeros = b === 0 ? zeros + 1 : 0\n  }\n  return Uint8Array.from(out)\n}\n\n/**\n * Split an AVCC/hvcC bitstream (length-prefixed NAL units) into raw NAL byte slices.\n * `lengthSize` is the NAL length prefix width (4 for FFmpeg LOC / fMP4 sample data).\n */\nexport function splitAvccNalUnits(data: Uint8Array, lengthSize = 4): Uint8Array[] {\n  const nals: Uint8Array[] = []\n  let i = 0\n  while (i + lengthSize <= data.length) {\n    let len = 0\n    for (let k = 0; k < lengthSize; k++) len = (len << 8) | data[i + k]\n    i += lengthSize\n    if (len <= 0 || i + len > data.length) break\n    nals.push(data.subarray(i, i + len))\n    i += len\n  }\n  return nals\n}\n\n/**\n * True when `data` is exactly one or more length-prefixed NAL units.\n *\n * This is intentionally stricter than \"starts with a plausible length\": a\n * H.264 AVCC access unit may begin with bytes `00 00 00 01` when the first\n * NAL is a one-byte AUD. That byte pattern is also an Annex-B start code, so\n * callers must prove the whole buffer is complete AVCC before falling back to\n * Annex-B detection/conversion.\n */\nexport function isCompleteAvccSample(data: Uint8Array, lengthSize = 4): boolean {\n  let i = 0\n  let count = 0\n  while (i + lengthSize <= data.length) {\n    let len = 0\n    for (let k = 0; k < lengthSize; k++) len = (len << 8) | data[i + k]\n    i += lengthSize\n    if (len <= 0 || i + len > data.length) return false\n    i += len\n    count++\n  }\n  return count > 0 && i === data.length\n}\n\nexport type H264SampleFormat = 'avcc' | 'annexb' | 'raw-nal' | 'unknown'\nexport type H264NalUnitFormat = H264SampleFormat | 'partial-avcc'\n\nexport interface H264AvccSample {\n  data: Uint8Array\n  format: H264SampleFormat\n}\n\nexport interface H264NalUnitSample {\n  nals: Uint8Array[]\n  format: H264NalUnitFormat\n}\n\n/**\n * Normalize a H.264 access unit/sample to length-prefixed AVCC for fMP4 mdat\n * payloads. Already-AVCC samples are returned as-is. Annex-B and single raw\n * NAL samples are converted one-way to AVCC at the MSE/fMP4 boundary.\n */\nexport function normalizeH264SampleToAvcc(data: Uint8Array): H264AvccSample {\n  if (isCompleteAvccSample(data)) return { data, format: 'avcc' }\n  if (isAnnexB(data)) return { data: annexBToAvcc(data), format: 'annexb' }\n  if (isLikelyRawH264NalUnit(data)) return { data: rawH264NalToAvcc(data), format: 'raw-nal' }\n  return { data, format: 'unknown' }\n}\n\n/**\n * Split a H.264 access unit/sample into NAL units without changing its framing.\n * Use this for routing, keyframe gates, and diagnostics. Conversion to AVCC is\n * reserved for `normalizeH264SampleToAvcc` at the fMP4/MSE boundary.\n */\nexport function splitH264SampleNalUnits(\n  data: Uint8Array,\n  options: H264KeyframeDetectionOptions = {},\n): H264NalUnitSample {\n  if (isCompleteAvccSample(data)) return { nals: splitAvccNalUnits(data), format: 'avcc' }\n  if (isAnnexB(data)) return { nals: splitAnnexBNalUnits(data), format: 'annexb' }\n  if (options.allowPartialAvcc === true) {\n    const partial = splitPartialAvccNalUnits(data)\n    if (partial.length > 0) return { nals: partial, format: 'partial-avcc' }\n  }\n  if (isLikelyRawH264NalUnit(data)) return { nals: [data], format: 'raw-nal' }\n  const nals = splitAvccNalUnits(data)\n  return { nals, format: nals.length > 0 ? 'avcc' : 'unknown' }\n}\n\n/**\n * Extract HEVC VPS (type 32) / SPS (33) / PPS (34) NAL units from a keyframe access\n * unit. Accepts either Annex-B (start-code delimited) or AVCC/hvcC (length-prefixed)\n * framing \u2014 FFmpeg LOC delivers the latter.\n */\nexport function extractHevcParameterSets(keyframe: Uint8Array): HevcParameterSets {\n  const nals = isAnnexB(keyframe) ? splitAnnexBNalUnits(keyframe) : splitAvccNalUnits(keyframe)\n  const out: HevcParameterSets = {}\n  for (const nal of nals) {\n    if (nal.length === 0) continue\n    const t = hevcNalType(nal)\n    if (t === 32 && !out.vps) out.vps = nal\n    else if (t === 33 && !out.sps) out.sps = nal\n    else if (t === 34 && !out.pps) out.pps = nal\n  }\n  return out\n}\n\n/**\n * Build a minimal hvcC (HEVCDecoderConfigurationRecord, ISO 14496-15 \u00A78.3.3.1) from\n * VPS/SPS/PPS NAL units. The general profile_tier_level (12 bytes) is copied from the\n * SPS (de-emulated); remaining fields use the common 4:2:0 / 8-bit / 4-byte-NAL-length\n * defaults. Suitable as the `description` for a WebCodecs hvc1 VideoDecoderConfig.\n *\n * WebCodecs REQUIRES a description for length-prefixed HEVC \u2014 unlike H.264, Chrome will\n * not self-configure HEVC from the bitstream (BLO-7764).\n */\nexport function generateHvcCFromParameterSets(sets: HevcParameterSets): Uint8Array | null {\n  const { vps, sps, pps } = sets\n  if (!sps || !pps) return null\n  const spsRbsp = removeEmulationPrevention(sps)\n  // general profile_tier_level is 12 bytes at RBSP offset 3:\n  // 2-byte NAL header + 1 byte (sps_video_parameter_set_id u(4), sps_max_sub_layers_minus1\n  // u(3), sps_temporal_id_nesting_flag u(1)), then general_profile_space..general_level_idc.\n  const ptl = spsRbsp.subarray(3, 15)\n  const arrays = [\n    { type: 32, nal: vps },\n    { type: 33, nal: sps },\n    { type: 34, nal: pps },\n  ].filter((a): a is { type: number; nal: Uint8Array } => a.nal !== undefined)\n\n  let size = 23\n  for (const a of arrays) size += 5 + a.nal.length\n  const h = new Uint8Array(size)\n  let o = 0\n  h[o++] = 1                                    // configurationVersion\n  for (let i = 0; i < 12; i++) h[o++] = ptl[i] ?? 0   // general profile_tier_level\n  h[o++] = 0xf0; h[o++] = 0x00                  // reserved(1111) + min_spatial_segmentation_idc(0)\n  h[o++] = 0xfc                                 // reserved(111111) + parallelismType(0)\n  h[o++] = 0xfd                                 // reserved(111111) + chromaFormat(1 = 4:2:0)\n  h[o++] = 0xf8                                 // reserved(11111) + bitDepthLumaMinus8(0)\n  h[o++] = 0xf8                                 // reserved(11111) + bitDepthChromaMinus8(0)\n  h[o++] = 0x00; h[o++] = 0x00                  // avgFrameRate(0 = unspecified)\n  h[o++] = 0x0b                                 // CFR(0) numTempLayers(1) nested(0) lengthSizeMinusOne(3)\n  h[o++] = arrays.length                        // numOfArrays\n  for (const a of arrays) {\n    h[o++] = a.type & 0x3f                       // array_completeness(0) + NAL_unit_type\n    h[o++] = 0; h[o++] = 1                        // numNalus = 1\n    h[o++] = (a.nal.length >> 8) & 0xff\n    h[o++] = a.nal.length & 0xff\n    h.set(a.nal, o); o += a.nal.length\n  }\n  return h.subarray(0, o)\n}\n\n/**\n * Build an hvcC `description` for a WebCodecs HEVC VideoDecoderConfig directly from a\n * keyframe access unit (Annex-B or length-prefixed). Returns null if VPS/SPS/PPS aren't\n * present in-band. HEVC analogue of {@link extractCodecDescriptionFromAnnexB}.\n */\nexport function extractHevcCodecDescription(keyframe: Uint8Array): Uint8Array | null {\n  return generateHvcCFromParameterSets(extractHevcParameterSets(keyframe))\n}\n\n/**\n * Strip non-VCL NAL units (VPS/SPS/PPS/SEI/AUD, type >= 32) from an HEVC access unit,\n * returning only the VCL NAL units (type <= 31) as a 4-byte length-prefixed buffer.\n *\n * Required when decoding `hvc1` with an explicit hvcC `description`: WebCodecs rejects a\n * sample whose data still carries in-band parameter sets (\"Unable to determine size of\n * bitstream buffer\"). Accepts Annex-B or length-prefixed input. Returns the input\n * unchanged if it already contains only VCL NALs (cheap no-op for delta frames).\n */\nexport function hevcVclOnly(data: Uint8Array): Uint8Array {\n  const nals = isAnnexB(data) ? splitAnnexBNalUnits(data) : splitAvccNalUnits(data)\n  const vcl = nals.filter((n) => n.length > 0 && hevcNalType(n) <= 31)\n  if (vcl.length === nals.length && !isAnnexB(data)) return data\n  let size = 0\n  for (const n of vcl) size += 4 + n.length\n  const out = new Uint8Array(size)\n  let o = 0\n  for (const n of vcl) {\n    out[o++] = (n.length >> 24) & 0xff\n    out[o++] = (n.length >> 16) & 0xff\n    out[o++] = (n.length >> 8) & 0xff\n    out[o++] = n.length & 0xff\n    out.set(n, o); o += n.length\n  }\n  return out\n}\n\n/**\n * Check if data starts with an Annex-B start code (00 00 01 or 00 00 00 01).\n */\nexport function isAnnexB(data: Uint8Array): boolean {\n  if (data.length >= 4 && data[0] === 0 && data[1] === 0 &&\n      (data[2] === 1 || (data[2] === 0 && data[3] === 1))) {\n    return true\n  }\n  return false\n}\n\n/**\n * Find the byte offset of the first Annex-B start code in data.\n * Returns -1 if no start code found.\n */\nexport function findAnnexBStartCode(data: Uint8Array): number {\n  for (let i = 0; i < data.length - 3; i++) {\n    if (data[i] === 0 && data[i + 1] === 0) {\n      if (data[i + 2] === 1) return i\n      if (data[i + 2] === 0 && data[i + 3] === 1) return i\n    }\n  }\n  return -1\n}\n\n/**\n * Split Annex-B bitstream into NAL units.\n * Returns array of NAL unit byte slices (without start codes).\n */\nexport function splitAnnexBNalUnits(data: Uint8Array): Uint8Array[] {\n  const nalUnits: Uint8Array[] = []\n  let i = 0\n  while (i < data.length - 3) {\n    if (data[i] === 0 && data[i + 1] === 0) {\n      let scLen = 0\n      if (data[i + 2] === 1) scLen = 3\n      else if (data[i + 2] === 0 && i + 3 < data.length && data[i + 3] === 1) scLen = 4\n      if (scLen > 0) {\n        const nalStart = i + scLen\n        let nalEnd = data.length\n        for (let j = nalStart + 1; j < data.length - 2; j++) {\n          if (data[j] === 0 && data[j + 1] === 0 &&\n              (data[j + 2] === 1 || (data[j + 2] === 0 && j + 3 < data.length && data[j + 3] === 1))) {\n            nalEnd = j\n            break\n          }\n        }\n        if (nalEnd > nalStart) nalUnits.push(data.subarray(nalStart, nalEnd))\n        i = nalEnd\n        continue\n      }\n    }\n    i++\n  }\n  return nalUnits\n}\n\n/**\n * Convert Annex-B (start-code delimited) to AVCC (4-byte length prefixed).\n * Optionally prepends SPS/PPS NALs for keyframes.\n */\nexport function annexBToAvcc(data: Uint8Array, spsPps?: SpsPps): Uint8Array {\n  const nalUnits = splitAnnexBNalUnits(data)\n  if (nalUnits.length === 0) return data\n\n  let extraSize = 0\n  if (spsPps) {\n    extraSize = 4 + spsPps.sps.length + 4 + spsPps.pps.length\n  }\n  const frameSize = nalUnits.reduce((sum, nal) => sum + 4 + nal.length, 0)\n  const output = new Uint8Array(extraSize + frameSize)\n  let w = 0\n\n  if (spsPps) {\n    w = writeNalLength(output, w, spsPps.sps.length)\n    output.set(spsPps.sps, w); w += spsPps.sps.length\n    w = writeNalLength(output, w, spsPps.pps.length)\n    output.set(spsPps.pps, w); w += spsPps.pps.length\n  }\n\n  for (const nal of nalUnits) {\n    w = writeNalLength(output, w, nal.length)\n    output.set(nal, w); w += nal.length\n  }\n  return output\n}\n\nexport interface H264KeyframeDetectionOptions {\n  /**\n   * Allow classifying a length-prefixed NAL when the declared NAL length runs\n   * beyond this buffer. MMTP routing can see only the first packet fragment of\n   * a sample, where the NAL header is present but the full NAL is not.\n   */\n  allowPartialAvcc?: boolean\n}\n\n/**\n * Classify H.264 keyframe status by scanning NAL units. Returns undefined when\n * the payload is not H.264-classifiable. Handles Annex-B and AVCC formats.\n */\nexport function classifyH264Keyframe(\n  data: Uint8Array,\n  options: H264KeyframeDetectionOptions = {},\n): boolean | undefined {\n  const nals = h264NalUnitsForKeyframeDetection(data, options)\n  if (nals.length === 0) return undefined\n  let sawIntraSlice = false\n  let sawNonIntraVcl = false\n  let sawNal = false\n  for (const nal of nals) {\n    sawNal = true\n    const nalType = nal[0] !== undefined ? nal[0] & 0x1f : -1\n    if (nalType === 5 || nalType === 7) return true\n    if (nalType === 1) {\n      if (isH264IntraSlice(nal)) sawIntraSlice = true\n      else sawNonIntraVcl = true\n    }\n  }\n  if (sawIntraSlice && !sawNonIntraVcl) return true\n  return sawNal ? false : undefined\n}\n\n/**\n * Detect H.264 keyframe by scanning for IDR/SPS or intra non-IDR slices.\n * Handles both Annex-B and AVCC formats.\n */\nexport function detectH264Keyframe(\n  data: Uint8Array,\n  options: H264KeyframeDetectionOptions = {},\n): boolean {\n  return classifyH264Keyframe(data, options) === true\n}\n\n/**\n * Convert MMTP timestamp (NTP short format) to monotonic microseconds.\n * Per ISO 23008-1 \u00A79.2.2 / RFC 5905: upper 16 bits = seconds (lower 16\n * of NTP seconds), lower 16 bits = fractional seconds.\n * Returns a monotonically increasing \u00B5s value within an ~18-hour window.\n */\nexport function mmtpTimestampToMicros(rawTs: bigint | number): number {\n  // MMTP carries an NTP short timestamp as an unsigned 32-bit integer. Do not\n  // use `Number(rawTs) >>> 0` here: bitwise coercion silently turns malformed\n  // values such as -1, 2**32, fractions, and strings into plausible timestamps\n  // and can poison downstream latency observations.\n  const ts = typeof rawTs === 'bigint'\n    ? rawTs >= 0n && rawTs <= 0xffff_ffffn\n      ? Number(rawTs)\n      : undefined\n    : Number.isSafeInteger(rawTs) && rawTs >= 0 && rawTs <= 0xffff_ffff\n      ? rawTs\n      : undefined\n  if (ts === undefined) {\n    throw new RangeError(`MMTP timestamp must be an unsigned 32-bit integer, got ${String(rawTs)}`)\n  }\n  if (ts === 0) return 0\n  const seconds = ts >>> 16\n  const frac = ts & 0xFFFF\n  return seconds * 1_000_000 + Math.floor(frac * 1_000_000 / 65536)\n}\n\n/** Validate the CMSF/MMTP catalog initData contract: complete top-level ftyp+moov. */\nexport function isFmp4InitSegment(data: Uint8Array): boolean {\n  let offset = 0\n  let sawFtyp = false\n  let sawMoov = false\n\n  while (offset + 8 <= data.byteLength) {\n    const view = new DataView(data.buffer, data.byteOffset + offset, data.byteLength - offset)\n    let size = view.getUint32(0, false)\n    const type = String.fromCharCode(data[offset + 4]!, data[offset + 5]!, data[offset + 6]!, data[offset + 7]!)\n    let headerSize = 8\n\n    if (size === 1) {\n      if (offset + 16 > data.byteLength) return false\n      const largeSize = view.getBigUint64(8, false)\n      if (largeSize > BigInt(Number.MAX_SAFE_INTEGER)) return false\n      size = Number(largeSize)\n      headerSize = 16\n    } else if (size === 0) {\n      size = data.byteLength - offset\n    }\n\n    if (size < headerSize || offset + size > data.byteLength) return false\n    // `mmpu` is the ISO MMT MPU metadata box. It is valid inside an MMTP\n    // FT=0 payload but is not an ISO-BMFF initialization box that an MSE\n    // SourceBuffer can append as a top-level box.\n    if (type === 'mmpu') return false\n    if (type === 'ftyp') sawFtyp = true\n    if (type === 'moov') {\n      if (!sawFtyp) return false\n      sawMoov = true\n    }\n    offset += size\n  }\n\n  return offset === data.byteLength && sawFtyp && sawMoov\n}\n\n/**\n * Return the fMP4 initialization segment carried by MMTP MPU metadata.\n *\n * ISO MMTP FT=0 metadata may contain an `mmpu` box between the top-level\n * `ftyp` and `moov` boxes (`ftyp + mmpu + moov`).  `mmpu` is an MMT metadata\n * box, not an ISO-BMFF initialization box accepted by an MSE SourceBuffer;\n * appending it produces Chromium's `Invalid top-level ISO BMFF box type mmpu`\n * error, most visibly when a rendition switch delivers a fresh FT=0 packet.\n * The returned bytes retain every other top-level box, in wire order, and are\n * only returned when the resulting bytes are a complete `ftyp` + `moov` init.\n * Inputs that are already a valid fMP4 init are returned unchanged.\n */\nexport function normalizeMmtpInitSegment(data: Uint8Array): Uint8Array | undefined {\n  if (isFmp4InitSegment(data)) return data\n\n  const parts: Uint8Array[] = []\n  let offset = 0\n  let removedMpu = false\n\n  while (offset + 8 <= data.byteLength) {\n    const view = new DataView(data.buffer, data.byteOffset + offset, data.byteLength - offset)\n    let size = view.getUint32(0, false)\n    let headerSize = 8\n    if (size === 1) {\n      if (offset + 16 > data.byteLength) return undefined\n      const largeSize = view.getBigUint64(8, false)\n      if (largeSize > BigInt(Number.MAX_SAFE_INTEGER)) return undefined\n      size = Number(largeSize)\n      headerSize = 16\n    } else if (size === 0) {\n      size = data.byteLength - offset\n    }\n    if (size < headerSize || offset + size > data.byteLength) return undefined\n\n    const type = String.fromCharCode(\n      data[offset + 4]!,\n      data[offset + 5]!,\n      data[offset + 6]!,\n      data[offset + 7]!,\n    )\n    if (type === 'mmpu') removedMpu = true\n    else parts.push(data.subarray(offset, offset + size))\n    offset += size\n  }\n\n  if (!removedMpu || offset !== data.byteLength) return undefined\n  const normalized = new Uint8Array(parts.reduce((total, part) => total + part.byteLength, 0))\n  let writeOffset = 0\n  for (const part of parts) {\n    normalized.set(part, writeOffset)\n    writeOffset += part.byteLength\n  }\n  return isFmp4InitSegment(normalized) ? normalized : undefined\n}\n\n// \u2500\u2500\u2500 Internal Helpers \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nfunction hasIsoBmffMagic(data: Uint8Array): boolean {\n  for (let i = 0; i + 8 <= data.length && i < 32; i += 4) {\n    const tag = String.fromCharCode(data[i + 4], data[i + 5], data[i + 6], data[i + 7])\n    if (tag === 'ftyp' || tag === 'moov') return true\n  }\n  return false\n}\n\nfunction findTrackStsdBoxes(data: Uint8Array): Array<{ o: number; sz: number }> {\n  const moov = findBox(data, 0, data.length, 'moov')\n  if (!moov) return []\n\n  const out: Array<{ o: number; sz: number }> = []\n  for (const trak of findBoxes(data, moov.o + 8, moov.o + moov.sz, 'trak')) {\n    const stsd = findNestedBox(data, trak.o + 8, trak.o + trak.sz, ['mdia', 'minf', 'stbl', 'stsd'])\n    if (stsd) out.push(stsd)\n  }\n  return out\n}\n\nfunction findNestedBox(\n  buf: Uint8Array,\n  start: number,\n  end: number,\n  path: string[],\n): { o: number; sz: number } | undefined {\n  let s = start\n  let e = end\n  let current: { o: number; sz: number } | undefined\n  for (const type of path) {\n    current = findBox(buf, s, e, type)\n    if (!current) return undefined\n    s = current.o + 8\n    e = current.o + current.sz\n  }\n  return current\n}\n\nfunction findBox(buf: Uint8Array, start: number, end: number, type: string): { o: number; sz: number } | undefined {\n  return findBoxes(buf, start, end, type)[0]\n}\n\nfunction findBoxes(buf: Uint8Array, start: number, end: number, type: string): Array<{ o: number; sz: number }> {\n  const boxes: Array<{ o: number; sz: number }> = []\n  let o = start\n  while (o + 8 <= end) {\n    let sz = (buf[o] << 24) | (buf[o + 1] << 16) | (buf[o + 2] << 8) | buf[o + 3]\n    const t = String.fromCharCode(buf[o + 4], buf[o + 5], buf[o + 6], buf[o + 7])\n    if (sz === 0) sz = end - o\n    if (sz < 8 || o + sz > end) break\n    if (t === type) boxes.push({ o, sz })\n    o += sz\n  }\n  return boxes\n}\n\nfunction writeNalLength(buf: Uint8Array, offset: number, len: number): number {\n  buf[offset] = (len >> 24) & 0xff\n  buf[offset + 1] = (len >> 16) & 0xff\n  buf[offset + 2] = (len >> 8) & 0xff\n  buf[offset + 3] = len & 0xff\n  return offset + 4\n}\n\nfunction h264NalUnitsForKeyframeDetection(\n  data: Uint8Array,\n  options: H264KeyframeDetectionOptions,\n): Uint8Array[] {\n  return splitH264SampleNalUnits(data, options).nals\n}\n\nfunction splitPartialAvccNalUnits(data: Uint8Array, lengthSize = 4): Uint8Array[] {\n  const nals: Uint8Array[] = []\n  let i = 0\n  while (i + lengthSize < data.length) {\n    let len = 0\n    for (let k = 0; k < lengthSize; k++) len = (len << 8) | data[i + k]\n    i += lengthSize\n    if (len <= 0 || i >= data.length) break\n    const end = Math.min(i + len, data.length)\n    nals.push(data.subarray(i, end))\n    if (end < i + len) break\n    i = end\n  }\n  return nals\n}\n\nfunction isLikelyRawH264NalUnit(data: Uint8Array): boolean {\n  if (data.length === 0) return false\n  const header = data[0]!\n  if ((header & 0x80) !== 0) return false\n  const nalType = header & 0x1f\n  return nalType > 0 && nalType < 24\n}\n\nfunction rawH264NalToAvcc(data: Uint8Array): Uint8Array {\n  const out = new Uint8Array(4 + data.length)\n  new DataView(out.buffer, out.byteOffset, out.byteLength).setUint32(0, data.length)\n  out.set(data, 4)\n  return out\n}\n\nfunction isH264IntraSlice(nal: Uint8Array): boolean {\n  const sliceType = readH264SliceType(nal)\n  return sliceType === 2 || sliceType === 4 || sliceType === 7 || sliceType === 9\n}\n\nfunction readH264SliceType(nal: Uint8Array): number | null {\n  if (nal.length < 2 || (nal[0]! & 0x1f) !== 1) return null\n  const rbsp = removeEmulationPrevention(nal.subarray(1))\n  const state = { bitOffset: 0 }\n  if (readUnsignedExpGolomb(rbsp, state) === null) return null\n  return readUnsignedExpGolomb(rbsp, state)\n}\n\nfunction readUnsignedExpGolomb(data: Uint8Array, state: { bitOffset: number }): number | null {\n  let leadingZeroBits = 0\n  while (true) {\n    const bit = readBit(data, state)\n    if (bit === null) return null\n    if (bit === 1) break\n    leadingZeroBits++\n    if (leadingZeroBits > 30) return null\n  }\n\n  let suffix = 0\n  for (let i = 0; i < leadingZeroBits; i++) {\n    const bit = readBit(data, state)\n    if (bit === null) return null\n    suffix = (suffix << 1) | bit\n  }\n  return (1 << leadingZeroBits) - 1 + suffix\n}\n\nfunction readBit(data: Uint8Array, state: { bitOffset: number }): 0 | 1 | null {\n  if (state.bitOffset >= data.length * 8) return null\n  const byte = data[state.bitOffset >> 3]!\n  const bit = (byte >> (7 - (state.bitOffset & 7))) & 1\n  state.bitOffset++\n  return bit as 0 | 1\n}\n\nfunction hex2(n: number): string {\n  return n.toString(16).padStart(2, '0')\n}\n\nfunction pad2(n: number): string {\n  return String(n).padStart(2, '0')\n}\n\nfunction codecStringFromAv1C(av1C: Uint8Array): string {\n  if (av1C.length < 4) return 'av01.0.01M.08'\n  const profile = (av1C[1]! >>> 5) & 0x07\n  const level = av1C[1]! & 0x1f\n  const tier = (av1C[2]! & 0x80) !== 0 ? 'H' : 'M'\n  let bitDepth = 8\n  if ((av1C[2]! & 0x40) !== 0) {\n    bitDepth = (av1C[2]! & 0x20) !== 0 ? 12 : 10\n  }\n  return `av01.${profile}.${pad2(level)}${tier}.${pad2(bitDepth)}`\n}\n\nfunction codecStringFromVpcC(vpcC: Uint8Array): string {\n  if (vpcC.length < 3) return 'vp09.00.10.08'\n  // ISO/IEC 14496-15 defines vpcC as a FullBox. Some tooling hands callers\n  // the VPCodecConfigurationRecord after the 4-byte FullBox header; tolerate\n  // both shapes because WebCodecs callers only need a stable RFC 6381 fallback.\n  const offset = vpcC.length >= 7 && vpcC[0] <= 1 ? 4 : 0\n  if (offset + 2 >= vpcC.length) return 'vp09.00.10.08'\n  const profile = vpcC[offset]!\n  const level = vpcC[offset + 1]!\n  const bitDepth = (vpcC[offset + 2]! >>> 4) || 8\n  return `vp09.${pad2(profile)}.${pad2(level)}.${pad2(bitDepth)}`\n}\n\n/**\n * Derive an RFC 6381 HEVC codec string (e.g. \"hvc1.1.6.L93.90\") from the\n * payload of an hvcC box (the HEVCDecoderConfigurationRecord, ISO 14496-15 \u00A78.3.3.1).\n * Only the general_* fields in the fixed 23-byte header are needed:\n *   byte 1: general_profile_space(2) | general_tier_flag(1) | general_profile_idc(5)\n *   bytes 2-5:  general_profile_compatibility_flags (32 bits)\n *   bytes 6-11: general_constraint_indicator_flags (48 bits)\n *   byte 12:    general_level_idc\n */\nfunction hevcCodecStringFromHvcC(c: Uint8Array): string {\n  const profileSpace = (c[1] >> 6) & 0x3\n  const tierFlag = (c[1] >> 5) & 0x1\n  const profileIdc = c[1] & 0x1f\n  // Compatibility flags are emitted reversed bit-order as hex, leading zeros trimmed.\n  const compat = ((c[2] << 24) | (c[3] << 16) | (c[4] << 8) | c[5]) >>> 0\n  let rev = 0\n  let v = compat\n  for (let i = 0; i < 32; i++) {\n    rev = ((rev << 1) | (v & 1)) >>> 0\n    v >>>= 1\n  }\n  const compatStr = rev.toString(16)\n  // Constraint flags: dot-separated hex bytes, trailing zero bytes trimmed.\n  const constraint = c.subarray(6, 12)\n  let lastNonZero = -1\n  for (let i = 0; i < constraint.length; i++) if (constraint[i] !== 0) lastNonZero = i\n  const constraintParts: string[] = []\n  for (let i = 0; i <= lastNonZero; i++) constraintParts.push(constraint[i].toString(16))\n  const space = profileSpace === 0 ? '' : String.fromCharCode(64 + profileSpace) // 1\u2192'A', 2\u2192'B', 3\u2192'C'\n  const tier = tierFlag === 0 ? 'L' : 'H'\n  let s = `hvc1.${space}${profileIdc}.${compatStr}.${tier}${c[12]}`\n  if (constraintParts.length > 0) s += '.' + constraintParts.join('.')\n  return s\n}\n\n/** Exp-Golomb bitstream writer for SPS/PPS generation. */\nclass BitWriter {\n  buf: number[] = []\n  byte = 0\n  bit = 7\n\n  u(val: number, bits: number) {\n    for (let i = bits - 1; i >= 0; i--) {\n      this.byte |= ((val >> i) & 1) << this.bit\n      if (--this.bit < 0) {\n        this.buf.push(this.byte)\n        this.byte = 0\n        this.bit = 7\n      }\n    }\n  }\n\n  ue(val: number) {\n    const v = val + 1\n    const bits = Math.floor(Math.log2(v)) + 1\n    this.u(0, bits - 1)\n    this.u(v, bits)\n  }\n\n  se(val: number) {\n    this.ue(val <= 0 ? -val * 2 : val * 2 - 1)\n  }\n\n  finish(): Uint8Array {\n    if (this.bit < 7) {\n      this.byte |= 1 << this.bit\n      this.buf.push(this.byte)\n    }\n    return new Uint8Array(this.buf)\n  }\n}\n\nfunction resolveResolution(\n  explicitW: number | undefined,\n  explicitH: number | undefined,\n  level: number,\n): { width: number; height: number } {\n  if (explicitW && explicitH) return { width: explicitW, height: explicitH }\n\n  const levelResolutions: Record<number, [number, number]> = {\n    10: [176, 144], 11: [352, 288], 12: [352, 288], 13: [352, 288],\n    20: [352, 288], 21: [720, 576], 22: [720, 576],\n    30: [1280, 720], 31: [1280, 720], 32: [1280, 1024],\n    40: [1920, 1088], 41: [1920, 1088], 42: [2048, 1088],\n    50: [4096, 2160], 51: [4096, 2160], 52: [4096, 2160],\n  }\n\n  const [w, h] = levelResolutions[level] ?? [1920, 1088]\n  return { width: explicitW ?? w, height: explicitH ?? h }\n}\n\nfunction buildMinimalSps(\n  profile: number, constraint: number, level: number,\n  width: number, height: number,\n): Uint8Array {\n  const widthInMbs = Math.ceil(width / 16)\n  const heightInMapUnits = Math.ceil(height / 16)\n\n  const w = new BitWriter()\n  w.u(0, 1); w.u(3, 2); w.u(7, 5) // NAL header: SPS\n  w.u(profile, 8); w.u(constraint, 8); w.u(level, 8)\n  w.ue(0) // seq_parameter_set_id\n\n  if (profile === 100 || profile === 110 || profile === 122 || profile === 244 || profile === 44) {\n    w.ue(1); w.ue(0); w.ue(0) // chroma + bit depth\n    w.u(0, 1); w.u(0, 1) // transform bypass + scaling matrix\n  }\n\n  w.ue(0) // log2_max_frame_num_minus4\n  w.ue(2) // pic_order_cnt_type=2\n  w.ue(1) // max_num_ref_frames\n  w.u(0, 1) // gaps_in_frame_num\n  w.ue(widthInMbs - 1)\n  w.ue(heightInMapUnits - 1)\n  w.u(1, 1) // frame_mbs_only\n  w.u(1, 1) // direct_8x8_inference\n\n  const cropRight = widthInMbs * 16 - width\n  const cropBottom = heightInMapUnits * 16 - height\n  if (cropRight > 0 || cropBottom > 0) {\n    w.u(1, 1)\n    w.ue(0); w.ue(cropRight / 2); w.ue(0); w.ue(cropBottom / 2)\n  } else {\n    w.u(0, 1)\n  }\n\n  w.u(0, 1) // vui_parameters_present\n  return w.finish()\n}\n\nfunction buildMinimalPps(profile: number): Uint8Array {\n  const isHighProfile = profile === 100 || profile === 110 || profile === 122 || profile === 244 || profile === 44\n  const w = new BitWriter()\n  w.u(0, 1); w.u(3, 2); w.u(8, 5) // NAL header: PPS\n\n  w.ue(0); w.ue(0) // pps_id, sps_id\n  w.u(isHighProfile ? 1 : 0, 1) // entropy_coding_mode\n  w.u(0, 1) // bottom_field_pic_order\n  w.ue(0); w.ue(0); w.ue(0) // slice groups, ref_idx defaults\n  w.u(0, 1); w.u(0, 2) // weighted_pred\n  w.se(0); w.se(0); w.se(0) // qp offsets\n  w.u(1, 1); w.u(0, 1); w.u(0, 1) // deblock, constrained_intra, redundant_pic_cnt\n\n  if (isHighProfile) {\n    w.u(1, 1); w.u(0, 1); w.se(0) // transform_8x8, scaling_matrix, chroma_qp_offset\n  }\n\n  return w.finish()\n}\n\n// \u2500\u2500\u2500 AAC / ADTS Utilities \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n/** ISO 14496-3 sampling frequency index lookup. */\nconst ADTS_SAMPLE_RATES = [96000, 88200, 64000, 48000, 44100, 32000, 24000, 22050, 16000, 12000, 11025, 8000, 7350] as const\n\n/**\n * Prepend a 7-byte ADTS header to a raw AAC access unit.\n *\n * WebCodecs AudioDecoder configured WITHOUT an AudioSpecificConfig `description`\n * expects ADTS-framed AAC.  MMTP carries raw AAC (no ADTS sync), so this wrapper\n * must be applied before calling `AudioDecoder.decode()`.\n */\nexport function wrapAdtsFrame(raw: Uint8Array, sampleRate: number, channels: number): Uint8Array {\n  const sri = ADTS_SAMPLE_RATES.indexOf(sampleRate as typeof ADTS_SAMPLE_RATES[number])\n  const idx = sri >= 0 ? sri : 3  // default 48 kHz\n  const len = 7 + raw.length\n  const out = new Uint8Array(len)\n  out[0] = 0xFF\n  out[1] = 0xF1                                         // MPEG-4, Layer 0, no CRC\n  out[2] = (1 << 6) | (idx << 2) | (channels >> 2)     // profile=AAC-LC(1), freq, ch high\n  out[3] = ((channels & 3) << 6) | ((len >> 11) & 3)\n  out[4] = (len >> 3) & 0xFF\n  out[5] = ((len & 7) << 5) | 0x1F\n  out[6] = 0xFC\n  out.set(raw, 7)\n  return out\n}\n\n/**\n * Extract AAC AudioSpecificConfig (ASC) from an fMP4 init segment.\n *\n * Walks moov > trak > mdia > minf > stbl > stsd > mp4a > esds, then descends\n * the MPEG-4 descriptor chain (ES_Descriptor 0x03 > DecoderConfigDescriptor\n * 0x04 > DecoderSpecificInfo 0x05) to return the ASC payload.\n *\n * Sibling of extractAvcCFromInitSegment, used by the same BLO-4830 / CMSF \u00A73.1\n * path: when the catalog initData is the full ftyp+moov, WebCodecs' AudioDecoder\n * needs the raw ASC (~2 bytes for AAC-LC) as `description`, NOT the whole\n * segment. Without this extraction the configure() succeeds but every decode()\n * silently produces zero output (no error fires), exactly the symptom that\n * shows up as \"Audio continuity FAILED: energy unstable CV=1.00\" in the\n * 7-point E2E test (CV=1.00 is the meanEnergy=0 sentinel from audio-fft.mjs).\n *\n * Returns undefined when:\n *  - data has no ftyp/moov magic in the first 32 bytes\n *  - no mp4a sample entry exists in any trak's stbl\n *  - the esds descriptor chain doesn't yield a DecoderSpecificInfo\n *  - the ASC payload is shorter than 2 bytes (AOT + sampling-freq nibble)\n *\n * Walks every trak and returns the first AAC sample entry. This mirrors\n * extractAvcCFromInitSegment so multiplexed ftyp+moov init blobs work\n * regardless of track order.\n */\nexport function extractAacAscFromInitSegment(data: Uint8Array): AacAscInfo | undefined {\n  if (!hasIsoBmffMagic(data)) return undefined\n\n  for (const stsd of findTrackStsdBoxes(data)) {\n    const info = extractAacAscFromStsd(data, stsd)\n    if (info) return info\n  }\n\n  return undefined\n}\n\nfunction extractAacAscFromStsd(data: Uint8Array, stsd: { o: number; sz: number }): AacAscInfo | undefined {\n  // stsd: 8 box header + 4 version+flags + 4 entry_count = 16 bytes before entries.\n  const s = stsd.o + 16\n  const e = stsd.o + stsd.sz\n  // mp4a AudioSampleEntry minimum length: 8 box header + 28 fixed fields = 36 bytes\n  // before any child boxes (esds lives here).\n  const mp4a = findBox(data, s, e, 'mp4a')\n  if (!mp4a || mp4a.sz < 36) return undefined\n  const esds = findBox(data, mp4a.o + 36, mp4a.o + mp4a.sz, 'esds')\n  // esds = 8 box header + 4 full-box version+flags = 12 bytes minimum before descriptors.\n  if (!esds || esds.sz < 12) return undefined\n  const esdsPayload = data.subarray(esds.o + 8, esds.o + esds.sz)\n  const asc = extractAudioSpecificConfig(esdsPayload)\n  if (!asc || asc.length < 2) return undefined\n  // AudioObjectType = top 5 bits of ASC[0]. AAC-LC = 2, HE-AAC = 5, etc.\n  const aot = asc[0] >> 3\n  return { codec: `mp4a.40.${aot}`, description: asc }\n}\n\n/**\n * Walk an esds descriptor chain to find DecoderSpecificInfo (tag 0x05).\n * Step over fixed-size headers of container descriptors (0x03, 0x04) so the\n * scan continues into their children rather than skipping their full payload.\n *\n * Assumes the ES_Descriptor flags byte is zero (no streamDependence, URL, OCR\n * ES_ID fields). FFmpeg's mov/mp4 muxer emits exactly that for all standard\n * AAC tracks; the assumption is the same one extractAvcCFromInitSegment makes\n * about the avc1 sample entry's reserved fields.\n *\n * Input is the esds box payload AFTER the 8-byte box header; the first 4 bytes\n * (full-box version+flags) are skipped here.\n */\nfunction extractAudioSpecificConfig(esds: Uint8Array): Uint8Array | undefined {\n  let offset = 4  // skip esds version+flags\n  while (offset < esds.length) {\n    const tag = esds[offset++]\n    let size = 0\n    for (let i = 0; i < 4 && offset < esds.length; i++) {\n      const b = esds[offset++]\n      size = (size << 7) | (b & 0x7f)\n      if ((b & 0x80) === 0) break\n    }\n    if (tag === 0x05) {\n      if (offset + size > esds.length) return undefined\n      return esds.subarray(offset, offset + size)\n    }\n    if (tag === 0x03) {\n      offset += 3   // ES_ID (2) + flags (1)\n    } else if (tag === 0x04) {\n      offset += 13  // OTI (1) + streamType (1) + bufferSizeDB (3) + maxBitrate (4) + avgBitrate (4)\n    } else {\n      offset += size\n    }\n  }\n  return undefined\n}\n\n// =============================================================================\n// Inline Tests (vitest)\n// =============================================================================\n\nif (import.meta.vitest) {\n  const { describe, test, expect } = import.meta.vitest\n\n  describe('codec-utils', () => {\n    describe('isAnnexB', () => {\n      test('4-byte start code', () => {\n        expect(isAnnexB(new Uint8Array([0, 0, 0, 1, 0x65]))).toBe(true)\n      })\n      test('3-byte start code', () => {\n        expect(isAnnexB(new Uint8Array([0, 0, 1, 0x65]))).toBe(true)\n      })\n      test('rejects AVCC', () => {\n        expect(isAnnexB(new Uint8Array([0, 0, 0, 10, 0x65]))).toBe(false)\n      })\n    })\n\n    describe('findAnnexBStartCode', () => {\n      test('at offset 0', () => {\n        expect(findAnnexBStartCode(new Uint8Array([0, 0, 0, 1, 0x65]))).toBe(0)\n      })\n      test('at offset 5', () => {\n        expect(findAnnexBStartCode(new Uint8Array([0xAA, 0xBB, 0xCC, 0xDD, 0xEE, 0, 0, 1, 0x65]))).toBe(5)\n      })\n      test('returns -1 when none', () => {\n        expect(findAnnexBStartCode(new Uint8Array([0xAA, 0xBB, 0xCC]))).toBe(-1)\n      })\n    })\n\n    describe('splitAnnexBNalUnits', () => {\n      test('splits two NALs', () => {\n        const data = new Uint8Array([0, 0, 0, 1, 0x65, 0xAA, 0xBB, 0, 0, 0, 1, 0x41, 0xCC])\n        const nals = splitAnnexBNalUnits(data)\n        expect(nals.length).toBe(2)\n        expect(nals[0]).toEqual(new Uint8Array([0x65, 0xAA, 0xBB]))\n        expect(nals[1]).toEqual(new Uint8Array([0x41, 0xCC]))\n      })\n      test('handles 3-byte start codes', () => {\n        const nals = splitAnnexBNalUnits(new Uint8Array([0, 0, 1, 0x67, 0x42, 0, 0, 1, 0x68, 0x01]))\n        expect(nals.length).toBe(2)\n      })\n    })\n\n    describe('annexBToAvcc', () => {\n      test('converts single NAL', () => {\n        const annexB = new Uint8Array([0, 0, 0, 1, 0x41, 0xAA, 0xBB])\n        const avcc = annexBToAvcc(annexB)\n        expect(avcc[3]).toBe(3) // NAL length\n        expect(avcc[4]).toBe(0x41)\n      })\n      test('prepends SPS/PPS', () => {\n        const annexB = new Uint8Array([0, 0, 0, 1, 0x65, 0x01])\n        const avcc = annexBToAvcc(annexB, { sps: new Uint8Array([0x67, 0x42]), pps: new Uint8Array([0x68, 0x01]) })\n        expect(avcc[3]).toBe(2) // SPS length\n        expect(avcc[4]).toBe(0x67)\n      })\n    })\n\n    describe('detectH264Keyframe', () => {\n      test('IDR in Annex-B', () => {\n        expect(detectH264Keyframe(new Uint8Array([0, 0, 0, 1, 0x65]))).toBe(true)\n      })\n      test('SPS in Annex-B', () => {\n        expect(detectH264Keyframe(new Uint8Array([0, 0, 0, 1, 0x67]))).toBe(true)\n      })\n      test('IDR in AVCC', () => {\n        expect(detectH264Keyframe(new Uint8Array([0, 0, 0, 5, 0x65, 1, 2, 3, 4]))).toBe(true)\n      })\n      test('IDR after AVCC AUD', () => {\n        expect(detectH264Keyframe(new Uint8Array([\n          0, 0, 0, 1, 0x09,\n          0, 0, 0, 2, 0x65, 0xaa,\n        ]))).toBe(true)\n      })\n      test('non-IDR AVC I-slice in AVCC', () => {\n        expect(detectH264Keyframe(new Uint8Array([\n          0, 0, 0, 2, 0x41, 0x88,\n        ]))).toBe(true)\n      })\n      test('raw H.264 IDR NAL', () => {\n        expect(detectH264Keyframe(new Uint8Array([0x65, 0x88, 0x84]))).toBe(true)\n      })\n      test('raw H.264 non-IDR I-slice NAL', () => {\n        expect(detectH264Keyframe(new Uint8Array([0x41, 0x88]))).toBe(true)\n      })\n      test('classifies partial length-prefixed IDR only when requested', () => {\n        const partial = new Uint8Array([0, 0, 0x20, 0, 0x65])\n        expect(classifyH264Keyframe(partial)).toBeUndefined()\n        expect(classifyH264Keyframe(partial, { allowPartialAvcc: true })).toBe(true)\n      })\n      test('rejects P-frame', () => {\n        expect(detectH264Keyframe(new Uint8Array([0, 0, 0, 1, 0x41]))).toBe(false)\n      })\n      test('rejects AVCC sample with only non-IDR slices', () => {\n        expect(detectH264Keyframe(new Uint8Array([\n          0, 0, 0, 2, 0x41, 0xc0,\n          0, 0, 0, 2, 0x41, 0xc0,\n        ]))).toBe(false)\n      })\n    })\n\n    describe('avccToAnnexB', () => {\n      test('converts with SPS/PPS on keyframe', () => {\n        const avcc = new Uint8Array([0, 0, 0, 3, 0x65, 0xAA, 0xBB])\n        const spsPps: SpsPps = { sps: new Uint8Array([0x67, 0x42]), pps: new Uint8Array([0x68, 0x01]) }\n        const annexB = avccToAnnexB(avcc, true, spsPps)\n        expect(annexB[3]).toBe(1) // start code\n        expect(annexB[4]).toBe(0x67) // SPS\n      })\n    })\n\n    describe('codecStringFromAvcC', () => {\n      test('derives avc1.64002a', () => {\n        expect(codecStringFromAvcC(new Uint8Array([1, 100, 0, 42]))).toBe('avc1.64002a')\n      })\n    })\n\n    describe('extractAacAscFromInitSegment', () => {\n      // Build a minimal valid ftyp+moov containing one mp4a sample entry whose\n      // esds carries the supplied AudioSpecificConfig. The walker only needs\n      // the box hierarchy moov > trak > mdia > minf > stbl > stsd > mp4a > esds;\n      // mvhd/tkhd/mdhd/hdlr/smhd/dinf/stts/stsc/stsz/stco are spec-required for\n      // a truly valid init but the extractor never reads them, so we omit them\n      // to keep the fixture tight (~150 bytes vs ~500). FFmpeg's real output\n      // includes them; the production path passes through `findBox` exactly\n      // the same way.\n      function buildMinimalAacInit(asc: Uint8Array): Uint8Array {\n        const box = (type: string, payload: Uint8Array): Uint8Array => {\n          const sz = 8 + payload.length\n          const out = new Uint8Array(sz)\n          out[0] = (sz >>> 24) & 0xff\n          out[1] = (sz >>> 16) & 0xff\n          out[2] = (sz >>> 8) & 0xff\n          out[3] = sz & 0xff\n          out[4] = type.charCodeAt(0); out[5] = type.charCodeAt(1)\n          out[6] = type.charCodeAt(2); out[7] = type.charCodeAt(3)\n          out.set(payload, 8)\n          return out\n        }\n        const concat = (...arrs: Uint8Array[]): Uint8Array => {\n          const total = arrs.reduce((n, a) => n + a.length, 0)\n          const out = new Uint8Array(total)\n          let off = 0\n          for (const a of arrs) { out.set(a, off); off += a.length }\n          return out\n        }\n        // ftyp: major_brand=iso5, minor=0x200, compat=iso5,iso6\n        const ftyp = box('ftyp', new Uint8Array([\n          0x69, 0x73, 0x6f, 0x35,        // 'iso5'\n          0x00, 0x00, 0x02, 0x00,        // minor 0x200\n          0x69, 0x73, 0x6f, 0x35,        // 'iso5'\n          0x69, 0x73, 0x6f, 0x36,        // 'iso6'\n        ]))\n\n        // ESDescriptor (0x03) > DecoderConfigDescriptor (0x04) > DecoderSpecificInfo (0x05) > ASC.\n        // Use 1-byte BER sizes (all payloads < 128).\n        const dsi = new Uint8Array(2 + asc.length)\n        dsi[0] = 0x05; dsi[1] = asc.length\n        dsi.set(asc, 2)\n        // DCD = 13 fixed bytes + DSI: OTI=0x40 (AAC), streamType=0x05<<2|0x01 (audio, upStream=0)\n        const dcd = new Uint8Array(2 + 13 + dsi.length)\n        dcd[0] = 0x04; dcd[1] = 13 + dsi.length\n        dcd[2] = 0x40             // objectTypeIndication: Audio ISO/IEC 14496-3\n        dcd[3] = (0x05 << 2) | 1  // streamType=AudioStream(5), upStream=0, reserved=1\n        // bufferSizeDB(3) + maxBitrate(4) + avgBitrate(4) all zero is fine for the walker.\n        dcd.set(dsi, 15)\n        // ESDescriptor: ES_ID=0, flags=0, then DCD\n        const esd = new Uint8Array(2 + 3 + dcd.length)\n        esd[0] = 0x03; esd[1] = 3 + dcd.length\n        // ES_ID(2) + flags(1) all zero\n        esd.set(dcd, 5)\n        // esds box = full-box (4-byte version+flags) + ES_Descriptor chain\n        const esdsPayload = new Uint8Array(4 + esd.length)\n        esdsPayload.set(esd, 4)\n        const esds = box('esds', esdsPayload)\n\n        // mp4a sample entry: 6 reserved + 2 dref_idx + 8 reserved + 2 channels + 2 samplesize +\n        //                    2 pre_defined + 2 reserved + 4 samplerate(48000<<16) = 28 bytes,\n        //                    then esds child.\n        const mp4aFixed = new Uint8Array(28)\n        mp4aFixed[7] = 0x01                 // data_reference_index = 1\n        mp4aFixed[16] = 0x00; mp4aFixed[17] = 0x01  // channelcount = 1\n        mp4aFixed[18] = 0x00; mp4aFixed[19] = 0x10  // samplesize = 16\n        // samplerate at offset 24-27 (top 16 bits = sampleRate). 48000 = 0xBB80.\n        mp4aFixed[24] = 0xBB; mp4aFixed[25] = 0x80\n        const mp4a = box('mp4a', concat(mp4aFixed, esds))\n\n        // stsd: 4 ver+flags + 4 entry_count(=1) + entries\n        const stsdPayload = new Uint8Array(8 + mp4a.length)\n        stsdPayload[7] = 0x01  // entry_count = 1\n        stsdPayload.set(mp4a, 8)\n        const stsd = box('stsd', stsdPayload)\n\n        const stbl = box('stbl', stsd)\n        const minf = box('minf', stbl)\n        const mdia = box('mdia', minf)\n        const trak = box('trak', mdia)\n        const moov = box('moov', trak)\n\n        return concat(ftyp, moov)\n      }\n\n      test('extracts AAC-LC mono 48k ASC and derives codec', () => {\n        // AOT=2 (00010), samplingFrequencyIndex=3 (0011, 48000Hz), channelConfig=1 (0001),\n        // GA: frameLengthFlag=0, dependsOnCoreCoder=0, extensionFlag=0 \u2192 0x11 0x88.\n        const asc = new Uint8Array([0x11, 0x88])\n        const init = buildMinimalAacInit(asc)\n        const result = extractAacAscFromInitSegment(init)\n        expect(result).toBeDefined()\n        expect(result!.codec).toBe('mp4a.40.2')\n        expect(Array.from(result!.description)).toEqual([0x11, 0x88])\n      })\n\n      test('derives AOT 5 (HE-AAC) from ASC[0] >> 3', () => {\n        // AOT=5 (00101), rest don't matter for codec derivation.\n        const asc = new Uint8Array([0x29, 0x88])  // 00101 001 1000 1000\n        const init = buildMinimalAacInit(asc)\n        expect(extractAacAscFromInitSegment(init)?.codec).toBe('mp4a.40.5')\n      })\n\n      test('rejects data without ftyp/moov magic', () => {\n        expect(extractAacAscFromInitSegment(new Uint8Array(64))).toBeUndefined()\n      })\n\n      test('rejects ftyp+moov with no audio (no mp4a sample entry)', () => {\n        // ftyp + moov with empty trak chain \u2014 no stsd, let alone mp4a.\n        const ftyp = new Uint8Array([\n          0, 0, 0, 24, 0x66, 0x74, 0x79, 0x70,\n          0x69, 0x73, 0x6f, 0x35, 0, 0, 2, 0,\n          0x69, 0x73, 0x6f, 0x35, 0x69, 0x73, 0x6f, 0x36,\n        ])\n        const moov = new Uint8Array([0, 0, 0, 8, 0x6d, 0x6f, 0x6f, 0x76])  // empty moov\n        const cat = new Uint8Array(ftyp.length + moov.length)\n        cat.set(ftyp); cat.set(moov, ftyp.length)\n        expect(extractAacAscFromInitSegment(cat)).toBeUndefined()\n      })\n    })\n\n    describe('hevc', () => {\n      // Minimal HEVC NAL units: header byte0 = (type << 1). VPS=32(0x40), SPS=33(0x42), PPS=34(0x44).\n      const vps = new Uint8Array([0x40, 0x01, 0x0c, 0x01, 0xff, 0xff])\n      const sps = new Uint8Array([0x42, 0x01, 0x01, 0x01, 0x60, 0x00, 0x00, 0x00, 0x90, 0x00, 0x00, 0x00, 0x00, 0x00, 0x3c, 0xa0, 0x05, 0x02])\n      const pps = new Uint8Array([0x44, 0x01, 0xc1, 0x72, 0xb4, 0x62])\n      const idr = new Uint8Array([0x26, 0x01, 0xaf, 0x06])  // type 19 (IDR_W_RADL)\n      const lp = (...nals: Uint8Array[]) => {\n        const parts: number[] = []\n        for (const n of nals) { parts.push((n.length >> 24) & 0xff, (n.length >> 16) & 0xff, (n.length >> 8) & 0xff, n.length & 0xff, ...n) }\n        return Uint8Array.from(parts)\n      }\n\n      test('isHevcCodec', () => {\n        expect(isHevcCodec('hev1.1.6.L93.B0')).toBe(true)\n        expect(isHevcCodec('hvc1.1.6.L93.B0')).toBe(true)\n        expect(isHevcCodec('avc1.640033')).toBe(false)\n      })\n\n      test('removeEmulationPrevention strips 0x03', () => {\n        expect(Array.from(removeEmulationPrevention(new Uint8Array([0, 0, 0x03, 1])))).toEqual([0, 0, 1])\n        expect(Array.from(removeEmulationPrevention(new Uint8Array([0xaa, 0xbb])))).toEqual([0xaa, 0xbb])\n      })\n\n      test('splitAvccNalUnits splits length-prefixed NALs', () => {\n        const nals = splitAvccNalUnits(lp(vps, sps))\n        expect(nals.length).toBe(2)\n        expect(nals[0]).toEqual(vps)\n        expect(nals[1]).toEqual(sps)\n      })\n\n      test('isCompleteAvccSample accepts complete length-prefixed NAL samples', () => {\n        expect(isCompleteAvccSample(lp(new Uint8Array([0x09]), idr))).toBe(true)\n      })\n\n      test('isCompleteAvccSample rejects Annex-B start-code samples', () => {\n        expect(isCompleteAvccSample(new Uint8Array([0, 0, 0, 1, 0x65, 0xaa]))).toBe(false)\n      })\n\n      test('isCompleteAvccSample rejects truncated length-prefixed samples', () => {\n        expect(isCompleteAvccSample(new Uint8Array([0, 0, 0, 4, 0x65, 0xaa]))).toBe(false)\n      })\n\n      test('normalizeH264SampleToAvcc leaves complete AVCC samples unchanged', () => {\n        const avcc = lp(new Uint8Array([0x09]), idr)\n        const normalized = normalizeH264SampleToAvcc(avcc)\n        expect(normalized.format).toBe('avcc')\n        expect(normalized.data).toBe(avcc)\n      })\n\n      test('normalizeH264SampleToAvcc converts a single raw H.264 NAL to AVCC', () => {\n        const raw = new Uint8Array([0x65, 0x88, 0x84])\n        const normalized = normalizeH264SampleToAvcc(raw)\n        expect(normalized.format).toBe('raw-nal')\n        expect(normalized.data).toEqual(new Uint8Array([0, 0, 0, 3, 0x65, 0x88, 0x84]))\n      })\n\n      test('splitH264SampleNalUnits exposes Annex-B NALs without AVCC conversion', () => {\n        const annexB = new Uint8Array([0, 0, 0, 1, 0x65, 0x88, 0x84])\n        const sample = splitH264SampleNalUnits(annexB)\n        expect(sample.format).toBe('annexb')\n        expect(sample.nals).toHaveLength(1)\n        expect(sample.nals[0]).toEqual(new Uint8Array([0x65, 0x88, 0x84]))\n      })\n\n      test('splitH264SampleNalUnits exposes single raw H.264 NALs without wrapping', () => {\n        const raw = new Uint8Array([0x65, 0x88, 0x84])\n        const sample = splitH264SampleNalUnits(raw)\n        expect(sample.format).toBe('raw-nal')\n        expect(sample.nals).toEqual([raw])\n      })\n\n      test('splitH264SampleNalUnits can expose partial AVCC NAL headers', () => {\n        const partial = new Uint8Array([0, 0, 0, 5, 0x65, 0x88])\n        const sample = splitH264SampleNalUnits(partial, { allowPartialAvcc: true })\n        expect(sample.format).toBe('partial-avcc')\n        expect(sample.nals).toHaveLength(1)\n        expect(sample.nals[0]).toEqual(new Uint8Array([0x65, 0x88]))\n      })\n\n      test('extractHevcParameterSets finds VPS/SPS/PPS (length-prefixed)', () => {\n        const sets = extractHevcParameterSets(lp(vps, sps, pps, idr))\n        expect(sets.vps).toEqual(vps)\n        expect(sets.sps).toEqual(sps)\n        expect(sets.pps).toEqual(pps)\n      })\n\n      test('extractHevcParameterSets finds VPS/SPS/PPS (Annex-B)', () => {\n        const sc = new Uint8Array([0, 0, 0, 1])\n        const annexb = Uint8Array.from([...sc, ...vps, ...sc, ...sps, ...sc, ...pps, ...sc, ...idr])\n        const sets = extractHevcParameterSets(annexb)\n        expect(sets.vps).toEqual(vps)\n        expect(sets.sps).toEqual(sps)\n        expect(sets.pps).toEqual(pps)\n      })\n\n      test('generateHvcCFromParameterSets builds a valid hvcC', () => {\n        const hvcc = generateHvcCFromParameterSets({ vps, sps, pps })!\n        expect(hvcc).not.toBeNull()\n        expect(hvcc[0]).toBe(1)                       // configurationVersion\n        expect(hvcc[1]).toBe(sps[3])                  // general profile_tier_level byte 0 copied from SPS[3]\n        expect(hvcc[22]).toBe(3)                      // numOfArrays (VPS+SPS+PPS)\n        // first array entry: NAL_unit_type 32 (VPS), numNalus 1\n        expect(hvcc[23] & 0x3f).toBe(32)\n        expect((hvcc[24] << 8) | hvcc[25]).toBe(1)\n      })\n\n      test('generateHvcCFromParameterSets returns null without SPS/PPS', () => {\n        expect(generateHvcCFromParameterSets({ vps })).toBeNull()\n      })\n\n      test('extractHevcCodecDescription end-to-end from keyframe', () => {\n        const desc = extractHevcCodecDescription(lp(vps, sps, pps, idr))\n        expect(desc).not.toBeNull()\n        expect(desc![0]).toBe(1)\n      })\n\n      test('hevcVclOnly strips parameter-set NALs, keeps VCL', () => {\n        const stripped = hevcVclOnly(lp(vps, sps, pps, idr))\n        const nals = splitAvccNalUnits(stripped)\n        expect(nals.length).toBe(1)        // only the IDR VCL NAL remains\n        expect(nals[0]).toEqual(idr)\n      })\n\n      test('hevcVclOnly is a no-op for VCL-only length-prefixed input', () => {\n        const vclOnly = lp(idr)\n        expect(hevcVclOnly(vclOnly)).toBe(vclOnly)\n      })\n    })\n  })\n}\n", "export type MfuReassemblyPolicy =\n  | ReliableMoqReassemblyPolicy\n  | { transport: 'datagram'; deadlineMs: number }\n\nexport interface ReliableMoqReassemblyPolicy {\n  transport: 'reliable-moq'\n  startsAtRandomAccessGroup?: true\n}\n\nexport type MmtpTrackType = 'video' | 'audio' | null\n\nexport interface ReliableMoqReassemblyOptions {\n  /**\n   * The transport starts at a complete independently decodable media group.\n   * The parser still requires an observed RAP before decoder startup.\n   */\n  startsAtRandomAccessGroup?: boolean\n}\n\nfunction validateReliableMoqOptionShape(value: Record<string, unknown>): void {\n  const unsupported = Object.keys(value).filter(\n    key => key !== 'transport' && key !== 'startsAtRandomAccessGroup',\n  )\n  if (unsupported.length > 0) {\n    if (unsupported.includes('maxRacingGroups')) {\n      throw new Error(\n        '[MFU reassembly] maxRacingGroups was removed; reliable MoQ completion is transport-owned',\n      )\n    }\n    throw new Error(\n      `[MFU reassembly] unsupported reliable MoQ option(s): ${unsupported.join(', ')}`,\n    )\n  }\n  const startsAtRandomAccessGroup = value['startsAtRandomAccessGroup']\n  if (\n    typeof startsAtRandomAccessGroup !== 'boolean' &&\n    startsAtRandomAccessGroup !== undefined\n  ) {\n    throw new Error('[MFU reassembly] startsAtRandomAccessGroup must be boolean')\n  }\n}\n\nexport function reliableMoqMfuReassembly(\n  options: ReliableMoqReassemblyOptions = {},\n): ReliableMoqReassemblyPolicy {\n  if (\n    arguments.length > 1 ||\n    typeof options !== 'object' ||\n    options === null ||\n    Array.isArray(options)\n  ) {\n    throw new Error(\n      '[MFU reassembly] the positional maxRacingGroups API was removed; pass a reliable MoQ options object',\n    )\n  }\n  validateReliableMoqOptionShape(options as Record<string, unknown>)\n  return options.startsAtRandomAccessGroup\n    ? {\n        transport: 'reliable-moq',\n        startsAtRandomAccessGroup: true,\n      }\n    : { transport: 'reliable-moq' }\n}\n\nfunction assertValidDatagramDeadline(deadlineMs: unknown): asserts deadlineMs is number {\n  if (typeof deadlineMs !== 'number' || !Number.isFinite(deadlineMs) || deadlineMs <= 0) {\n    throw new Error('[MFU reassembly] datagram deadlineMs must be a finite number > 0')\n  }\n}\n\nexport function datagramMfuReassembly(deadlineMs: number): MfuReassemblyPolicy {\n  assertValidDatagramDeadline(deadlineMs)\n  return { transport: 'datagram', deadlineMs }\n}\n\n/** Validate the complete runtime shape even when a caller bypasses the policy factories. */\nexport function assertValidMfuReassemblyPolicy(policy: MfuReassemblyPolicy): void {\n  if (typeof policy !== 'object' || policy === null || Array.isArray(policy)) {\n    throw new Error('[MFU reassembly] policy must be an object')\n  }\n\n  const value = policy as unknown as Record<string, unknown>\n  if (value['transport'] === 'reliable-moq') {\n    validateReliableMoqOptionShape(value)\n    if (value['startsAtRandomAccessGroup'] === false) {\n      throw new Error(\n        '[MFU reassembly] startsAtRandomAccessGroup must be true when present in a policy',\n      )\n    }\n    return\n  }\n  if (value['transport'] === 'datagram') {\n    const unsupported = Object.keys(value).filter(\n      key => key !== 'transport' && key !== 'deadlineMs',\n    )\n    if (unsupported.length > 0) {\n      throw new Error(\n        `[MFU reassembly] unsupported datagram option(s): ${unsupported.join(', ')}`,\n      )\n    }\n    assertValidDatagramDeadline(value['deadlineMs'])\n    return\n  }\n  throw new Error(\n    `[MFU reassembly] unsupported transport: ${String(value['transport'])}`,\n  )\n}\n\nexport function mfuReassemblyTimeoutMs(policy: MfuReassemblyPolicy): number | null {\n  assertValidMfuReassemblyPolicy(policy)\n  return policy.transport === 'reliable-moq' ? null : policy.deadlineMs\n}\n\n/** Resolve the parser reorder window without inferring reliable-stream completion. */\nexport function mmtpFrameReorderWindowFrames(\n  policy: MfuReassemblyPolicy,\n  configuredWindow = 0,\n): number {\n  assertValidMfuReassemblyPolicy(policy)\n  if (!Number.isFinite(configuredWindow) || configuredWindow < 0) {\n    throw new Error('[MFU reassembly] configuredWindow must be a finite number >= 0')\n  }\n\n  const requested = Math.ceil(configuredWindow)\n  if (policy.transport === 'reliable-moq') {\n    if (requested > 0) {\n      throw new Error(\n        '[MFU reassembly] reliable MoQ paths do not accept a frame reorder window in the parser',\n      )\n    }\n    return 0\n  }\n  return requested\n}\n", "/**\n * Strict ISO-BMFF timing extraction for the timed-MFU browser path.\n *\n * This intentionally implements only the current single-track MMT profile:\n * one media track in FT=0, and one matching traf/trun in each FT=1.  It does\n * not infer timing from packet arrival, MMTP send timestamps, or cadence.\n */\n\nconst U64_MAX = 0xffff_ffff_ffff_ffffn\nconst I64_MIN = -0x8000_0000_0000_0000n\nconst I64_MAX = 0x7fff_ffff_ffff_ffffn\nconst MICROSECONDS_PER_SECOND = 1_000_000n\n\nconst TFHD_BASE_DATA_OFFSET_PRESENT = 0x000001\nconst TFHD_SAMPLE_DESCRIPTION_INDEX_PRESENT = 0x000002\nconst TFHD_DEFAULT_SAMPLE_DURATION_PRESENT = 0x000008\nconst TFHD_DEFAULT_SAMPLE_SIZE_PRESENT = 0x000010\nconst TFHD_DEFAULT_SAMPLE_FLAGS_PRESENT = 0x000020\nconst TFHD_DURATION_IS_EMPTY = 0x010000\nconst TFHD_DEFAULT_BASE_IS_MOOF = 0x020000\nconst TFHD_KNOWN_FLAGS =\n  TFHD_BASE_DATA_OFFSET_PRESENT |\n  TFHD_SAMPLE_DESCRIPTION_INDEX_PRESENT |\n  TFHD_DEFAULT_SAMPLE_DURATION_PRESENT |\n  TFHD_DEFAULT_SAMPLE_SIZE_PRESENT |\n  TFHD_DEFAULT_SAMPLE_FLAGS_PRESENT |\n  TFHD_DURATION_IS_EMPTY |\n  TFHD_DEFAULT_BASE_IS_MOOF\n\nconst TRUN_DATA_OFFSET_PRESENT = 0x000001\nconst TRUN_FIRST_SAMPLE_FLAGS_PRESENT = 0x000004\nconst TRUN_SAMPLE_DURATION_PRESENT = 0x000100\nconst TRUN_SAMPLE_SIZE_PRESENT = 0x000200\nconst TRUN_SAMPLE_FLAGS_PRESENT = 0x000400\nconst TRUN_SAMPLE_CTS_OFFSET_PRESENT = 0x000800\nconst TRUN_KNOWN_FLAGS =\n  TRUN_DATA_OFFSET_PRESENT |\n  TRUN_FIRST_SAMPLE_FLAGS_PRESENT |\n  TRUN_SAMPLE_DURATION_PRESENT |\n  TRUN_SAMPLE_SIZE_PRESENT |\n  TRUN_SAMPLE_FLAGS_PRESENT |\n  TRUN_SAMPLE_CTS_OFFSET_PRESENT\n\nexport interface IsoBmffTrackTiming {\n  trackId: number\n  timescale: number\n  defaultSampleDuration?: number\n  defaultSampleSize?: number\n}\n\nexport interface IsoBmffSampleTiming {\n  /** Exact decode time in mdhd timescale units. */\n  decodeTime: bigint\n  /** Exact presentation time in mdhd timescale units, including signed CTS. */\n  presentationTime: bigint\n  /** Exact authored duration in mdhd timescale units. */\n  duration: number\n  timescale: number\n  /** Exact elementary-stream sample size declared by trun/tfhd/trex. */\n  size: number\n  /** Byte position of the sample relative to the beginning of the moof. */\n  bytePosition: bigint\n}\n\nexport interface IsoBmffMovieFragmentTiming {\n  movieFragmentSequenceNumber: number\n  samples: readonly IsoBmffSampleTiming[]\n}\n\nexport type IsoBmffMovieFragmentRejection = 'invalid' | 'budget'\n\ninterface IsoBox {\n  type: string\n  start: number\n  bodyStart: number\n  end: number\n}\n\ninterface FullBox {\n  version: number\n  flags: number\n  bodyStart: number\n}\n\ninterface ParsedTrack {\n  trackId: number\n  handlerType: string\n  timescale: number\n  hasEdits: boolean\n}\n\ninterface ParsedTfhd {\n  trackId: number\n  defaultSampleDuration?: number\n  defaultSampleSize?: number\n}\n\ninterface MdatLayout {\n  dataStart: bigint\n  declaredEnd: bigint\n}\n\nfunction view(data: Uint8Array): DataView {\n  return new DataView(data.buffer, data.byteOffset, data.byteLength)\n}\n\nfunction boxType(data: Uint8Array, offset: number): string {\n  return String.fromCharCode(\n    data[offset]!,\n    data[offset + 1]!,\n    data[offset + 2]!,\n    data[offset + 3]!,\n  )\n}\n\nfunction readU64(data: Uint8Array, offset: number): bigint | null {\n  if (offset < 0 || offset + 8 > data.length) return null\n  const dataView = view(data)\n  return (BigInt(dataView.getUint32(offset, false)) << 32n) |\n    BigInt(dataView.getUint32(offset + 4, false))\n}\n\nfunction parseBox(data: Uint8Array, start: number, limit: number): IsoBox | null {\n  if (start < 0 || limit > data.length || start + 8 > limit) return null\n  const dataView = view(data)\n  const shortSize = dataView.getUint32(start, false)\n  let headerSize = 8\n  let size: number\n  if (shortSize === 0) {\n    size = limit - start\n  } else if (shortSize === 1) {\n    if (start + 16 > limit) return null\n    const extendedSize = readU64(data, start + 8)\n    if (extendedSize === null || extendedSize > BigInt(Number.MAX_SAFE_INTEGER)) return null\n    headerSize = 16\n    size = Number(extendedSize)\n  } else {\n    size = shortSize\n  }\n  if (size < headerSize || start + size > limit) return null\n  return {\n    type: boxType(data, start + 4),\n    start,\n    bodyStart: start + headerSize,\n    end: start + size,\n  }\n}\n\nfunction parseBoxes(data: Uint8Array, start: number, end: number): IsoBox[] | null {\n  if (start < 0 || end < start || end > data.length) return null\n  const boxes: IsoBox[] = []\n  let offset = start\n  while (offset < end) {\n    const box = parseBox(data, offset, end)\n    if (!box || box.end <= offset) return null\n    boxes.push(box)\n    offset = box.end\n  }\n  return offset === end ? boxes : null\n}\n\nfunction children(data: Uint8Array, parent: IsoBox): IsoBox[] | null {\n  return parseBoxes(data, parent.bodyStart, parent.end)\n}\n\nfunction exactlyOne(boxes: readonly IsoBox[], type: string): IsoBox | null {\n  const matches = boxes.filter(box => box.type === type)\n  return matches.length === 1 ? matches[0]! : null\n}\n\nfunction parseFullBox(data: Uint8Array, box: IsoBox): FullBox | null {\n  if (box.bodyStart + 4 > box.end) return null\n  const versionAndFlags = view(data).getUint32(box.bodyStart, false)\n  return {\n    version: versionAndFlags >>> 24,\n    flags: versionAndFlags & 0x00ff_ffff,\n    bodyStart: box.bodyStart + 4,\n  }\n}\n\nfunction parseTkhdTrackId(data: Uint8Array, box: IsoBox): number | null {\n  const full = parseFullBox(data, box)\n  if (!full || full.flags & ~0x00000f) return null\n  const bodyLength = box.end - full.bodyStart\n  const trackIdOffset = full.version === 0\n    ? full.bodyStart + 8\n    : full.version === 1\n      ? full.bodyStart + 16\n      : -1\n  const expectedBodyLength = full.version === 0 ? 80 : full.version === 1 ? 92 : -1\n  if (trackIdOffset < 0 || bodyLength !== expectedBodyLength) return null\n  return view(data).getUint32(trackIdOffset, false)\n}\n\nfunction parseMdhdTimescale(data: Uint8Array, box: IsoBox): number | null {\n  const full = parseFullBox(data, box)\n  if (!full || full.flags !== 0) return null\n  const bodyLength = box.end - full.bodyStart\n  const timescaleOffset = full.version === 0\n    ? full.bodyStart + 8\n    : full.version === 1\n      ? full.bodyStart + 16\n      : -1\n  const expectedBodyLength = full.version === 0 ? 20 : full.version === 1 ? 32 : -1\n  if (timescaleOffset < 0 || bodyLength !== expectedBodyLength) return null\n  return view(data).getUint32(timescaleOffset, false)\n}\n\nfunction parseHandlerType(data: Uint8Array, box: IsoBox): string | null {\n  const full = parseFullBox(data, box)\n  if (!full || full.version !== 0 || full.flags !== 0 || full.bodyStart + 20 > box.end) {\n    return null\n  }\n  return boxType(data, full.bodyStart + 4)\n}\n\nfunction editListHasEntries(data: Uint8Array, box: IsoBox): boolean | null {\n  const full = parseFullBox(data, box)\n  if (!full || full.flags !== 0 || (full.version !== 0 && full.version !== 1)) return null\n  if (full.bodyStart + 4 > box.end) return null\n  const entryCount = view(data).getUint32(full.bodyStart, false)\n  const entrySize = full.version === 0 ? 12 : 20\n  const expectedEnd = full.bodyStart + 4 + entryCount * entrySize\n  if (!Number.isSafeInteger(expectedEnd) || expectedEnd !== box.end) return null\n  return entryCount !== 0\n}\n\nfunction parseTrack(data: Uint8Array, trak: IsoBox): ParsedTrack | null {\n  const trakChildren = children(data, trak)\n  if (!trakChildren) return null\n  const tkhd = exactlyOne(trakChildren, 'tkhd')\n  const mdia = exactlyOne(trakChildren, 'mdia')\n  if (!tkhd || !mdia) return null\n  const trackId = parseTkhdTrackId(data, tkhd)\n  if (trackId === null || trackId === 0) return null\n\n  const mdiaChildren = children(data, mdia)\n  if (!mdiaChildren) return null\n  const mdhd = exactlyOne(mdiaChildren, 'mdhd')\n  const hdlr = exactlyOne(mdiaChildren, 'hdlr')\n  if (!mdhd || !hdlr) return null\n  const timescale = parseMdhdTimescale(data, mdhd)\n  const handlerType = parseHandlerType(data, hdlr)\n  if (timescale === null || timescale === 0 || handlerType === null) return null\n\n  const edtsBoxes = trakChildren.filter(box => box.type === 'edts')\n  if (edtsBoxes.length > 1) return null\n  let hasEdits = false\n  if (edtsBoxes.length === 1) {\n    const edtsChildren = children(data, edtsBoxes[0]!)\n    if (!edtsChildren) return null\n    const editLists = edtsChildren.filter(box => box.type === 'elst')\n    if (editLists.length > 1) return null\n    if (editLists.length === 1) {\n      const result = editListHasEntries(data, editLists[0]!)\n      if (result === null) return null\n      hasEdits = result\n    }\n  }\n\n  return { trackId, handlerType, timescale, hasEdits }\n}\n\nfunction parseTrex(data: Uint8Array, box: IsoBox): IsoBmffTrackTiming | null {\n  const full = parseFullBox(data, box)\n  if (!full || full.version !== 0 || full.flags !== 0 || box.end - full.bodyStart !== 20) {\n    return null\n  }\n  const dataView = view(data)\n  const trackId = dataView.getUint32(full.bodyStart, false)\n  const defaultSampleDuration = dataView.getUint32(full.bodyStart + 8, false)\n  const defaultSampleSize = dataView.getUint32(full.bodyStart + 12, false)\n  return {\n    trackId,\n    timescale: 0,\n    ...(defaultSampleDuration === 0 ? {} : { defaultSampleDuration }),\n    ...(defaultSampleSize === 0 ? {} : { defaultSampleSize }),\n  }\n}\n\nexport function parseIsoBmffInitializationTiming(\n  data: Uint8Array,\n): IsoBmffTrackTiming | null {\n  const topLevel = parseBoxes(data, 0, data.length)\n  if (!topLevel) return null\n  const ftyp = exactlyOne(topLevel, 'ftyp')\n  const moov = exactlyOne(topLevel, 'moov')\n  if (!ftyp || !moov || ftyp.start > moov.start) return null\n  if (topLevel.some(box => box.type === 'moof' || box.type === 'mdat')) return null\n\n  const moovChildren = children(data, moov)\n  if (!moovChildren) return null\n  const parsedTracks: ParsedTrack[] = []\n  for (const trak of moovChildren.filter(box => box.type === 'trak')) {\n    const parsed = parseTrack(data, trak)\n    if (!parsed) return null\n    parsedTracks.push(parsed)\n  }\n  const mediaTracks = parsedTracks.filter(\n    track => track.handlerType === 'vide' || track.handlerType === 'soun',\n  )\n  if (mediaTracks.length !== 1) return null\n  const mediaTrack = mediaTracks[0]!\n  if (mediaTrack.hasEdits) return null\n\n  const mvex = exactlyOne(moovChildren, 'mvex')\n  if (!mvex) return null\n  const mvexChildren = children(data, mvex)\n  if (!mvexChildren) return null\n  const trexEntries: IsoBmffTrackTiming[] = []\n  for (const trexBox of mvexChildren.filter(box => box.type === 'trex')) {\n    const trex = parseTrex(data, trexBox)\n    if (!trex) return null\n    trexEntries.push(trex)\n  }\n  const matchingTrex = trexEntries.filter(trex => trex.trackId === mediaTrack.trackId)\n  if (matchingTrex.length !== 1) return null\n  const trex = matchingTrex[0]!\n  return {\n    trackId: mediaTrack.trackId,\n    timescale: mediaTrack.timescale,\n    ...(trex.defaultSampleDuration === undefined\n      ? {}\n      : { defaultSampleDuration: trex.defaultSampleDuration }),\n    ...(trex.defaultSampleSize === undefined\n      ? {}\n      : { defaultSampleSize: trex.defaultSampleSize }),\n  }\n}\n\nfunction parseMfhdSequence(data: Uint8Array, box: IsoBox): number | null {\n  const full = parseFullBox(data, box)\n  if (!full || full.version !== 0 || full.flags !== 0 || box.end - full.bodyStart !== 4) {\n    return null\n  }\n  return view(data).getUint32(full.bodyStart, false)\n}\n\nfunction parseTfhd(data: Uint8Array, box: IsoBox): ParsedTfhd | null {\n  const full = parseFullBox(data, box)\n  if (!full || full.version !== 0 || (full.flags & ~TFHD_KNOWN_FLAGS) !== 0) return null\n  if ((full.flags & TFHD_BASE_DATA_OFFSET_PRESENT) !== 0 ||\n      (full.flags & TFHD_DEFAULT_BASE_IS_MOOF) === 0 ||\n      (full.flags & TFHD_DURATION_IS_EMPTY) !== 0) {\n    return null\n  }\n  const dataView = view(data)\n  let offset = full.bodyStart\n  if (offset + 4 > box.end) return null\n  const trackId = dataView.getUint32(offset, false)\n  offset += 4\n  if ((full.flags & TFHD_SAMPLE_DESCRIPTION_INDEX_PRESENT) !== 0) {\n    if (offset + 4 > box.end) return null\n    offset += 4\n  }\n  let defaultSampleDuration: number | undefined\n  if ((full.flags & TFHD_DEFAULT_SAMPLE_DURATION_PRESENT) !== 0) {\n    if (offset + 4 > box.end) return null\n    defaultSampleDuration = dataView.getUint32(offset, false)\n    offset += 4\n  }\n  let defaultSampleSize: number | undefined\n  if ((full.flags & TFHD_DEFAULT_SAMPLE_SIZE_PRESENT) !== 0) {\n    if (offset + 4 > box.end) return null\n    defaultSampleSize = dataView.getUint32(offset, false)\n    offset += 4\n  }\n  if ((full.flags & TFHD_DEFAULT_SAMPLE_FLAGS_PRESENT) !== 0) {\n    if (offset + 4 > box.end) return null\n    offset += 4\n  }\n  if (offset !== box.end) return null\n  return {\n    trackId,\n    ...(defaultSampleDuration === undefined ? {} : { defaultSampleDuration }),\n    ...(defaultSampleSize === undefined ? {} : { defaultSampleSize }),\n  }\n}\n\nfunction parseTfdt(data: Uint8Array, box: IsoBox): bigint | null {\n  const full = parseFullBox(data, box)\n  if (!full || full.flags !== 0) return null\n  if (full.version === 0 && box.end - full.bodyStart === 4) {\n    return BigInt(view(data).getUint32(full.bodyStart, false))\n  }\n  if (full.version === 1 && box.end - full.bodyStart === 8) {\n    return readU64(data, full.bodyStart)\n  }\n  return null\n}\n\nfunction parseMdatLayout(data: Uint8Array, offset: number): MdatLayout | null {\n  if (offset < 0 || offset + 8 > data.length || boxType(data, offset + 4) !== 'mdat') return null\n  const dataView = view(data)\n  const shortSize = dataView.getUint32(offset, false)\n  let headerSize = 8\n  let declaredSize: bigint\n  if (shortSize === 0) {\n    return null\n  } else if (shortSize === 1) {\n    const extended = readU64(data, offset + 8)\n    if (extended === null) return null\n    headerSize = 16\n    declaredSize = extended\n  } else {\n    declaredSize = BigInt(shortSize)\n  }\n  if (declaredSize < BigInt(headerSize) || declaredSize < BigInt(data.length - offset)) {\n    return null\n  }\n  const declaredEnd = BigInt(offset) + declaredSize\n  if (declaredEnd > U64_MAX) return null\n  return { dataStart: BigInt(offset + headerSize), declaredEnd }\n}\n\nfunction resolvedDefault(\n  entryValue: number | undefined,\n  tfhdValue: number | undefined,\n  trexValue: number | undefined,\n): number | null {\n  const value = entryValue ?? tfhdValue ?? trexValue\n  return value === undefined || value === 0 ? null : value\n}\n\nfunction parseTrunSamples(\n  data: Uint8Array,\n  box: IsoBox,\n  moofStart: number,\n  baseDecodeTime: bigint,\n  tfhd: ParsedTfhd,\n  track: IsoBmffTrackTiming,\n  mdat: MdatLayout,\n  maxSamples: number,\n): IsoBmffSampleTiming[] | null {\n  const full = parseFullBox(data, box)\n  if (!full || (full.version !== 0 && full.version !== 1) ||\n      (full.flags & ~TRUN_KNOWN_FLAGS) !== 0 ||\n      (full.flags & TRUN_DATA_OFFSET_PRESENT) === 0 ||\n      ((full.flags & TRUN_FIRST_SAMPLE_FLAGS_PRESENT) !== 0 &&\n        (full.flags & TRUN_SAMPLE_FLAGS_PRESENT) !== 0)) {\n    return null\n  }\n  const dataView = view(data)\n  let offset = full.bodyStart\n  if (offset + 8 > box.end) return null\n  const sampleCount = dataView.getUint32(offset, false)\n  offset += 4\n  if (sampleCount === 0 || sampleCount > maxSamples) return null\n  const relativeDataOffset = dataView.getInt32(offset, false)\n  offset += 4\n  if (relativeDataOffset < 0) return null\n  const dataOffset = BigInt(relativeDataOffset)\n  const absoluteDataOffset = BigInt(moofStart) + dataOffset\n  if (absoluteDataOffset > BigInt(data.length) || absoluteDataOffset < mdat.dataStart) return null\n  if ((full.flags & TRUN_FIRST_SAMPLE_FLAGS_PRESENT) !== 0) {\n    if (offset + 4 > box.end) return null\n    offset += 4\n  }\n\n  let decodeTime = baseDecodeTime\n  let bytePosition = dataOffset\n  const samples: IsoBmffSampleTiming[] = []\n  for (let index = 0; index < sampleCount; index++) {\n    let entryDuration: number | undefined\n    if ((full.flags & TRUN_SAMPLE_DURATION_PRESENT) !== 0) {\n      if (offset + 4 > box.end) return null\n      entryDuration = dataView.getUint32(offset, false)\n      offset += 4\n    }\n    let entrySize: number | undefined\n    if ((full.flags & TRUN_SAMPLE_SIZE_PRESENT) !== 0) {\n      if (offset + 4 > box.end) return null\n      entrySize = dataView.getUint32(offset, false)\n      offset += 4\n    }\n    if ((full.flags & TRUN_SAMPLE_FLAGS_PRESENT) !== 0) {\n      if (offset + 4 > box.end) return null\n      offset += 4\n    }\n    let compositionOffset = 0\n    if ((full.flags & TRUN_SAMPLE_CTS_OFFSET_PRESENT) !== 0) {\n      if (offset + 4 > box.end) return null\n      compositionOffset = full.version === 1\n        ? dataView.getInt32(offset, false)\n        : dataView.getUint32(offset, false)\n      offset += 4\n    }\n    if (offset > box.end) return null\n\n    const duration = resolvedDefault(\n      entryDuration,\n      tfhd.defaultSampleDuration,\n      track.defaultSampleDuration,\n    )\n    const size = resolvedDefault(entrySize, tfhd.defaultSampleSize, track.defaultSampleSize)\n    if (duration === null || size === null) return null\n    const sampleEnd = bytePosition + BigInt(size)\n    const absoluteSampleEnd = BigInt(moofStart) + sampleEnd\n    if (absoluteSampleEnd > mdat.declaredEnd || absoluteSampleEnd > U64_MAX) return null\n    const presentationTime = decodeTime + BigInt(compositionOffset)\n    if (presentationTime < I64_MIN || presentationTime > I64_MAX) return null\n    samples.push({\n      decodeTime,\n      presentationTime,\n      duration,\n      timescale: track.timescale,\n      size,\n      bytePosition,\n    })\n    decodeTime += BigInt(duration)\n    if (decodeTime > U64_MAX) return null\n    bytePosition = sampleEnd\n  }\n  return offset === box.end ? samples : null\n}\n\nexport function parseIsoBmffMovieFragmentTiming(\n  data: Uint8Array,\n  track: IsoBmffTrackTiming,\n  maxSamples: number,\n): IsoBmffMovieFragmentTiming | null {\n  if (!Number.isInteger(maxSamples) || maxSamples <= 0) return null\n  const first = parseBox(data, 0, data.length)\n  if (!first) return null\n  const moof = first.type === 'styp'\n    ? parseBox(data, first.end, data.length)\n    : first\n  if (!moof || moof.type !== 'moof' || moof.end >= data.length) return null\n  const moofChildren = children(data, moof)\n  if (!moofChildren) return null\n  const mfhd = exactlyOne(moofChildren, 'mfhd')\n  const traf = exactlyOne(moofChildren, 'traf')\n  if (!mfhd || !traf) return null\n  const movieFragmentSequenceNumber = parseMfhdSequence(data, mfhd)\n  if (movieFragmentSequenceNumber === null || movieFragmentSequenceNumber === 0) return null\n\n  const trafChildren = children(data, traf)\n  if (!trafChildren) return null\n  const tfhdBox = exactlyOne(trafChildren, 'tfhd')\n  const tfdtBox = exactlyOne(trafChildren, 'tfdt')\n  const trunBox = exactlyOne(trafChildren, 'trun')\n  if (!tfhdBox || !tfdtBox || !trunBox) return null\n  const tfhd = parseTfhd(data, tfhdBox)\n  const baseDecodeTime = parseTfdt(data, tfdtBox)\n  if (!tfhd || tfhd.trackId !== track.trackId || baseDecodeTime === null) return null\n  const mdat = parseMdatLayout(data, moof.end)\n  if (!mdat) return null\n  const samples = parseTrunSamples(\n    data,\n    trunBox,\n    moof.start,\n    baseDecodeTime,\n    tfhd,\n    track,\n    mdat,\n    maxSamples,\n  )\n  if (!samples) return null\n  return { movieFragmentSequenceNumber, samples }\n}\n\nfunction sameTrack(a: IsoBmffTrackTiming, b: IsoBmffTrackTiming): boolean {\n  return a.trackId === b.trackId &&\n    a.timescale === b.timescale &&\n    a.defaultSampleDuration === b.defaultSampleDuration &&\n    a.defaultSampleSize === b.defaultSampleSize\n}\n\nfunction sameSample(a: IsoBmffSampleTiming, b: IsoBmffSampleTiming): boolean {\n  return a.decodeTime === b.decodeTime &&\n    a.presentationTime === b.presentationTime &&\n    a.duration === b.duration &&\n    a.timescale === b.timescale &&\n    a.size === b.size &&\n    a.bytePosition === b.bytePosition\n}\n\ntype PendingMovieFragment = Array<IsoBmffSampleTiming | null>\n\n/** Bounded per-track FT=0/FT=1 timing state. */\nexport class IsoBmffTimingResolver {\n  #track: IsoBmffTrackTiming | null = null\n  #fragments = new Map<string, PendingMovieFragment>()\n  #pendingSamples = 0\n  #evictedSamples = 0\n  #lastMovieFragmentRejection: IsoBmffMovieFragmentRejection | null = null\n\n  constructor(readonly maxPendingSamples: number) {\n    if (!Number.isInteger(maxPendingSamples) || maxPendingSamples <= 0) {\n      throw new Error('[IsoBmffTimingResolver] maxPendingSamples must be a positive integer')\n    }\n  }\n\n  get pendingSampleCount(): number {\n    return this.#pendingSamples\n  }\n\n  /**\n   * Slots reclaimed by window displacement rather than by delivery or\n   * abandonment. Deliberately separate from the combiner's own release count:\n   * \"nobody ever saw this sample\" and \"the combiner gave up on it\" are\n   * different failures with different owners, and one number cannot say which.\n   */\n  get evictedSampleCount(): number {\n    return this.#evictedSamples\n  }\n\n  /** Typed reason for the most recent rejected movie fragment. */\n  get lastMovieFragmentRejection(): IsoBmffMovieFragmentRejection | null {\n    return this.#lastMovieFragmentRejection\n  }\n\n  addInitialization(data: Uint8Array): boolean {\n    const timing = parseIsoBmffInitializationTiming(data)\n    if (!timing) return false\n    if (this.#track) return sameTrack(this.#track, timing)\n    this.#track = timing\n    return true\n  }\n\n  addMovieFragment(\n    mpuSequenceNumber: number,\n    data: Uint8Array,\n    additionalSampleLimit = this.maxPendingSamples,\n  ): boolean {\n    this.#lastMovieFragmentRejection = null\n    if (!Number.isInteger(additionalSampleLimit) || additionalSampleLimit < 0) {\n      this.#lastMovieFragmentRejection = 'invalid'\n      return false\n    }\n    if (!this.#track || !isU32(mpuSequenceNumber)) {\n      this.#lastMovieFragmentRejection = 'invalid'\n      return false\n    }\n    const parsed = parseIsoBmffMovieFragmentTiming(\n      data,\n      this.#track,\n      this.maxPendingSamples,\n    )\n    if (!parsed) {\n      this.#lastMovieFragmentRejection = 'invalid'\n      return false\n    }\n    const key = fragmentKey(mpuSequenceNumber, parsed.movieFragmentSequenceNumber)\n    const existing = this.#fragments.get(key)\n    if (existing) {\n      return existing.length === parsed.samples.length && existing.every(\n        (sample, index) => sample !== null && sameSample(sample, parsed.samples[index]!),\n      )\n    }\n    // Sliding window, not a one-way ratchet. `consumeSample` and\n    // `releaseSample` between them cover every sample some component observed\n    // -- but a sample whose data units never arrive at all is observed by\n    // nobody, so neither path ever runs and its slot is held until `reset()`.\n    // Under sustained loss those orphans accumulate until the budget is full\n    // of samples that can never arrive, at which point every later moof is\n    // refused and media stops permanently with no error.\n    //\n    // Displacement is the signal no component can raise: once the budget is\n    // full and a newer fragment is in hand, the oldest pending fragment's\n    // samples are older than the whole window and cannot still be in flight.\n    // Reclaiming them keeps the timing that is arriving now and discards the\n    // timing that is not; refusing the new fragment does exactly the reverse,\n    // which is what wedged the stream. Evicted timing is not silent loss --\n    // a late data unit then finds no entry and is dropped against a named\n    // reason, which is attributable, bounded, and recoverable.\n    let freed = 0\n    while (\n      this.#fragments.size > 0 &&\n      (this.#pendingSamples + parsed.samples.length > this.maxPendingSamples ||\n        parsed.samples.length - freed > additionalSampleLimit)\n    ) {\n      freed += this.#evictOldestFragment()\n    }\n    // Net new charge against the caller's pool is what it must afford: `freed`\n    // slots were already counted there and are handed back by this call.\n    if (parsed.samples.length - freed > additionalSampleLimit) {\n      this.#lastMovieFragmentRejection = 'budget'\n      return false\n    }\n    if (this.#pendingSamples + parsed.samples.length > this.maxPendingSamples) {\n      this.#lastMovieFragmentRejection = 'budget'\n      return false\n    }\n    this.#fragments.set(key, [...parsed.samples])\n    this.#pendingSamples += parsed.samples.length\n    return true\n  }\n\n  sampleTiming(\n    mpuSequenceNumber: number,\n    movieFragmentSequenceNumber: number,\n    sampleNumber: number,\n  ): IsoBmffSampleTiming | null {\n    if (!isU32(mpuSequenceNumber) || !isU32(movieFragmentSequenceNumber) ||\n        movieFragmentSequenceNumber === 0 || !isU32(sampleNumber) || sampleNumber === 0) {\n      return null\n    }\n    const samples = this.#fragments.get(\n      fragmentKey(mpuSequenceNumber, movieFragmentSequenceNumber),\n    )\n    return samples?.[sampleNumber - 1] ?? null\n  }\n\n  consumeSample(\n    mpuSequenceNumber: number,\n    movieFragmentSequenceNumber: number,\n    sampleNumber: number,\n    expected: IsoBmffSampleTiming,\n  ): boolean {\n    const samples = this.#fragments.get(\n      fragmentKey(mpuSequenceNumber, movieFragmentSequenceNumber),\n    )\n    const sample = samples?.[sampleNumber - 1]\n    if (!sample || !sameSample(sample, expected)) return false\n    return this.#clearSlot(mpuSequenceNumber, movieFragmentSequenceNumber, sampleNumber)\n  }\n\n  /**\n   * Free the budget slot of a sample that will never be delivered.\n   *\n   * `consumeSample` is the delivery path and is the only decrement on a\n   * healthy stream. A sample whose data units never complete is never\n   * delivered; window displacement in `addMovieFragment` eventually reclaims\n   * it, but only after it has aged out of the whole window. This path frees\n   * the slot as soon as the combiner knows the sample is gone, so the budget\n   * tracks what is actually in flight rather than what has merely aged.\n   *\n   * The caller is whoever abandoned the sample, so the release is driven by\n   * the abandonment itself rather than by a timer, an LRU, or an age bound --\n   * the slot is freed exactly when its sample provably cannot arrive, which\n   * is a protocol event the combiner already detects and counts.\n   *\n   * Deliberately takes no `expected` timing: the caller is discarding, not\n   * matching, and requiring it would make the release fail exactly when the\n   * timing entry is the thing being reclaimed. Returns false when the slot\n   * was already freed, so a double release cannot drive the count negative.\n   */\n  releaseSample(\n    mpuSequenceNumber: number,\n    movieFragmentSequenceNumber: number,\n    sampleNumber: number,\n  ): boolean {\n    return this.#clearSlot(mpuSequenceNumber, movieFragmentSequenceNumber, sampleNumber)\n  }\n\n  /**\n   * Drop the oldest pending fragment whole and return the slots it held.\n   *\n   * Oldest is insertion order, which for a moof stream is arrival order, so\n   * this is the least-recently-declared timing -- the entries least likely to\n   * still have data units in flight.\n   */\n  #evictOldestFragment(): number {\n    const oldest = this.#fragments.keys().next().value\n    if (oldest === undefined) return 0\n    const samples = this.#fragments.get(oldest)!\n    let live = 0\n    for (const sample of samples) if (sample !== null) live++\n    this.#fragments.delete(oldest)\n    this.#pendingSamples -= live\n    this.#evictedSamples += live\n    return live\n  }\n\n  /** Null one slot, decrement the budget, and drop the fragment when empty. */\n  #clearSlot(\n    mpuSequenceNumber: number,\n    movieFragmentSequenceNumber: number,\n    sampleNumber: number,\n  ): boolean {\n    if (!isU32(mpuSequenceNumber) || !isU32(movieFragmentSequenceNumber) ||\n        movieFragmentSequenceNumber === 0 || !isU32(sampleNumber) || sampleNumber === 0) {\n      return false\n    }\n    const key = fragmentKey(mpuSequenceNumber, movieFragmentSequenceNumber)\n    const samples = this.#fragments.get(key)\n    const index = sampleNumber - 1\n    if (!samples || !samples[index]) return false\n    samples[index] = null\n    this.#pendingSamples--\n    if (samples.every(value => value === null)) this.#fragments.delete(key)\n    return true\n  }\n\n  reset(): void {\n    this.#track = null\n    this.#fragments.clear()\n    this.#pendingSamples = 0\n  }\n}\n\nfunction fragmentKey(mpuSequenceNumber: number, movieFragmentSequenceNumber: number): string {\n  return `${mpuSequenceNumber}:${movieFragmentSequenceNumber}`\n}\n\nfunction isU32(value: number): boolean {\n  return Number.isInteger(value) && value >= 0 && value <= 0xffff_ffff\n}\n\n/** Convert exact media ticks to microseconds without first narrowing the ticks. */\nexport function mediaTicksToMicroseconds(ticks: bigint, timescale: number): number | null {\n  if (!Number.isInteger(timescale) || timescale <= 0) return null\n  const numerator = ticks * MICROSECONDS_PER_SECOND\n  const scale = BigInt(timescale)\n  const whole = numerator / scale\n  const remainder = numerator % scale\n  if (whole < BigInt(Number.MIN_SAFE_INTEGER) || whole > BigInt(Number.MAX_SAFE_INTEGER)) {\n    return null\n  }\n  const result = Number(whole) + Number(remainder) / timescale\n  return Number.isFinite(result) ? result : null\n}\n", "import {\n  parseMMTPHeader,\n  extractMFUPayload,\n  extractFecPayloadId,\n  hasSourceFecPayloadId,\n  extractAltaTrailer,\n  PACKET_TYPE_MPU,\n  PACKET_TYPE_REPAIR,\n} from '@blockcast/mmt-base'\nimport {\n  MFUReassembler,\n  MfuReassemblyError,\n  isMfuReassemblyError,\n  type MfuReassemblerBackend,\n  type MmtpSourcePath,\n  type MmtpDeliveryProvenance,\n  type ReassembledMFU,\n} from './mfu-reassembler.js'\nimport {\n  SampleCombiner,\n  SampleCombineError,\n  type AbandonedSample,\n  type CombinedSample,\n  type SampleCombinerOptions,\n  type SampleCombinerStats,\n} from './sample-combiner.js'\nimport {\n  classifyH264Keyframe,\n  mmtpTimestampToMicros,\n  normalizeMmtpInitSegment,\n} from './codec-utils.js'\nimport {\n  mmtpFrameReorderWindowFrames,\n  mfuReassemblyTimeoutMs,\n  type MfuReassemblyPolicy,\n} from './mfu-reassembly-policy.js'\nimport {\n  IsoBmffTimingResolver,\n  mediaTicksToMicroseconds,\n  type IsoBmffSampleTiming,\n} from './iso-bmff-timing.js'\nimport type { AuthoredTiming } from './authored-timing.js'\n\n// \u2500\u2500 Types \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nexport interface TrackInfo {\n  type: 'video' | 'audio'\n  codec: string\n  /** Catalog/in-band frame cadence available to downstream media stages. */\n  framerate?: number\n  /** Catalog MMTP group duration available to downstream media stages. */\n  groupDurationMs?: number\n}\n\nexport interface MmtpParserConfig {\n  tracks?: Map<number, TrackInfo>\n  reorderWindow?: number\n  /** MFU reassembly timeout (ms). Derive from FEC interleaveDepthMs or frame duration.\n   *  Pass null for live clock-free operation; memory remains bounded by maxBuffered.\n   *  Defaults to 1000ms if not provided. */\n  mfuTimeoutMs?: number | null\n  /** Explicit transport policy. Reliable MoQ is clock-free; datagrams require\n   * a catalog/in-band-derived deadline. Mutually exclusive with mfuTimeoutMs. */\n  reassemblyPolicy?: MfuReassemblyPolicy\n  /** Max concurrent active MFUs. A new first fragment is rejected at the bound. */\n  maxBufferedMfus?: number\n  /**\n   * Max subsample data units held for one partitioned sample (moqcast #37).\n   * A sample needs `ceil(sampleSize / (256 * maxPayload))` data units; at the\n   * ~1300-byte payloads this producer emits, one data unit spans ~327 KB, so\n   * the default admits a ~5 MB sample \u2014 beyond any 8K intra frame \u2014 while\n   * still bounding the per-insert overlap scan. Raise it only alongside a\n   * larger authored frame size, never to paper over a lost data unit.\n   */\n  maxSubsampleSegments?: number\n  /** Alternate backend. The TypeScript and Rust/WASM implementations enforce\n   * the same authored active-DU contract. */\n  reassembler?: MfuReassemblerBackend\n  /** Default track info for auto-discovered packetIds.\n   *  When the parser receives an MMTP packet with an unregistered packetId,\n   *  it creates a new track entry using this info. Required for correct\n   *  keyframe detection with HEVC/AV1/VP9 (without it, defaults to H.264). */\n  defaultTrack?: TrackInfo\n}\n\n/** Structured result from parseHeader(). Used by MmtpRouter for two-phase parsing:\n *  1. parseHeader() \u2192 get packetId + fecPayloadId for FEC feeding\n *  2. feed() \u2192 MFU extraction, reassembly, keyframe detection, emit */\nexport interface PacketInfo {\n  packetId: number\n  packetType: number\n  timestamp: bigint\n  /** MMTP timestamp converted to monotonic microseconds for pacing/sync users. */\n  timestampUs: number\n  sequenceNumber: number\n  rapFlag: boolean\n  fecType: number\n  /** FEC source symbol ID (from 4-byte FEC Payload ID at packet end). Null if no FEC. */\n  fecPayloadId: { ssId: number } | null\n  /** True if this is a repair packet (packetType=0x03). */\n  isRepair: boolean\n}\n\nexport interface FrameMeta {\n  /** Authored ISO-BMFF presentation time converted to microseconds. */\n  timestamp: number\n  /** Authored ISO-BMFF decode time converted to microseconds. */\n  decodeTimestamp?: number\n  /** Authored ISO-BMFF sample duration converted to microseconds. */\n  duration?: number\n  /** Exact authored decode time in mediaTimescale units. */\n  decodeTime?: bigint\n  /** Exact authored presentation time in mediaTimescale units. */\n  presentationTime?: bigint\n  /** Exact authored duration in mediaTimescale units. */\n  durationTicks?: number\n  /** mdhd media timescale for the exact timing fields. */\n  mediaTimescale?: number\n  /** Exact authored ISO-BMFF timing carried without narrowing to microseconds. */\n  authoredTiming?: AuthoredTiming\n  keyframe: boolean\n  packetId: number\n  trackType: 'video' | 'audio' | null\n  packetSequenceNumber?: number\n  /** Every authoritative MMTP source-packet sequence that formed this frame. */\n  packetSequenceNumbers?: number[]\n  /** Subset of packetSequenceNumbers reconstructed by FEC. */\n  repairedPacketSequenceNumbers?: number[]\n  /** Immutable catalog identity supplied by the owning ingress subscription. */\n  catalogTrackName?: string\n  /** Raw MMTP short-NTP timestamp retained for adapters that own the timeline. */\n  mmtpTimestamp?: bigint\n  mpuSequenceNumber?: number\n  movieFragmentSequenceNumber?: number\n  sampleNumber?: number\n  fragmentCount?: number\n  rapFlag?: boolean\n  priority?: number\n  recovered?: boolean\n  /** Starts a new publisher/source epoch for ordering and timestamp state. */\n  sourceDiscontinuity?: boolean\n  /** Source of the accepted FI=1/FI=0 frame path. Absent for recovery. */\n  source?: MmtpSourcePath\n  /**\n   * Strict whole-frame delivery provenance. Unlike `source`, which names the\n   * head fragment's transport for routing, this is folded over every\n   * contributing fragment (and, for FEC-recovered frames, over the transports\n   * that supplied the block's symbols). Only 'multicast' is evidence of\n   * multicast-exclusive delivery. Absent means no producer on this path\n   * recorded provenance \u2014 consumers MUST treat that as unproven, never as\n   * multicast.\n   */\n  deliveryProvenance?: MmtpDeliveryProvenance\n}\n\n/** Typed ISO-BMFF timing-sample budget counters. See `timingBudgetStats`. */\nexport interface MmtpTimingBudgetStats {\n  /** Slots currently charged to declared-but-undelivered samples. */\n  pending: number\n  /** Total slots available; `pending === capacity` rejects every new moof. */\n  capacity: number\n  /** Slots returned by samples the combiner abandoned (evicted or timed out). */\n  reclaimed: number\n  /**\n   * Slots reclaimed by window displacement \u2014 samples no component ever saw,\n   * so no abandonment event could be raised for them. Separate from\n   * `reclaimed` because the owners differ: `reclaimed` is the combiner giving\n   * up, `evicted` is loss that was never observable at all.\n   */\n  evicted: number\n  /** Movie fragments refused because the budget had no room for their samples. */\n  rejectedMovieFragments: number\n}\n\nexport interface MmtpReorderStats {\n  droppedBeforeStartupKeyframe: number\n  droppedIncompleteStartupInterval: number\n  droppedStale: number\n  forcedWindowFlushes: number\n  droppedOnLiveDispose: number\n  publisherResets: number\n  droppedOnPublisherReset: number\n  bufferedFrames: number\n}\n\nexport interface MmtpReorderFrameDiagnostics {\n  timestampUs: number\n  keyframe: boolean\n  sequenceNumber: number\n  packetSequenceNumber?: number\n  movieFragmentSequenceNumber?: number\n  sampleNumber?: number\n  fragmentCount?: number\n}\n\nexport interface MmtpReorderStreamDiagnostics {\n  packetId: number\n  bufferedFrames: number\n  lastEmitted: MmtpReorderFrameDiagnostics | null\n  startupKeyframe: MmtpReorderFrameDiagnostics | null\n  head: MmtpReorderFrameDiagnostics[]\n  tail: MmtpReorderFrameDiagnostics[]\n  keyframes: MmtpReorderFrameDiagnostics[]\n}\n\nexport type MmtpParserRecord =\n  | {\n      kind: 'repair' | 'non-media'\n      packet: PacketInfo\n      byteLength: number\n    }\n  | {\n      kind: 'init' | 'fragment'\n      packet: PacketInfo\n      data: Uint8Array\n      mpuSequenceNumber: number\n      fragmentationIndicator: number\n      fragmentCounter: number\n    }\n  | {\n      kind: 'pending'\n      packet: PacketInfo\n      mpuSequenceNumber: number\n      fragmentationIndicator: number\n      fragmentCounter: number\n    }\n  | {\n      kind: 'rejected'\n      packet: PacketInfo\n      mpuSequenceNumber: number\n      fragmentationIndicator: number\n      fragmentCounter: number\n      error: {\n        /**\n         * Either a single data unit's own fragment chain was rejected, or\n         * combining reassembled data units into a sample was (moqcast #37).\n         * Both are fail-closed drops of the same packet, so they share this\n         * record; the code says which class it came from.\n         */\n        code: MfuReassemblyError['code'] | SampleCombineError['code']\n        message: string\n      }\n    }\n  | {\n      kind: 'frame'\n      packet: PacketInfo\n      data: Uint8Array\n      meta: FrameMeta\n      mpuSequenceNumber: number\n      fragmentCount: number\n      rapFlag: boolean\n      priority?: number\n    }\n\n/**\n * Why feed() returned no record. Every `return null` inside feed() names one\n * of these, so a packet that produced nothing is attributable to the stage\n * that rejected it rather than to one collapsed failure bucket.\n *\n * The distinction is what makes a wedged receive path readable: a media track\n * that stops producing records looks identical from outside whether the header\n * failed to parse, MFU extraction failed, or the timing resolver refused the\n * sample \u2014 and those name three different components.\n */\nexport type MmtpFeedDropReason =\n  /** feed() after dispose(); the host is still pushing at a torn-down parser. */\n  | 'disposed'\n  | 'header-parse-failed'\n  | 'mfu-extract-failed'\n  /** MPU present but not a timed MFU, so no media payload to reassemble. */\n  | 'untimed-mpu'\n  | 'init-unexpected-fragmentation'\n  | 'init-normalize-failed'\n  /** No timing resolver, or it refused the initialization segment. */\n  | 'init-timing-refused'\n  | 'fragment-unexpected-fragmentation'\n  | 'fragment-no-resolver'\n  /** addMovieFragment refused \u2014 includes the pending-timing-sample budget. */\n  | 'fragment-timing-refused'\n  | 'unknown-fragment-type'\n  | 'mfu-no-resolver'\n  | 'mfu-empty-payload'\n  | 'mfu-du-header-missing'\n  | 'mfu-sample-timing-missing'\n  | 'mfu-offset-out-of-range'\n  | 'mfu-size-mismatch'\n  | 'assembled-identity-missing'\n  | 'assembled-timing-missing'\n  | 'assembled-mpu-mismatch'\n  /**\n   * Refusals inside the combined-sample delivery step, which runs after the\n   * combiner has already produced a whole sample. These are distinct from\n   * their `assembled-*` counterparts: those reject a data unit on the way in,\n   * these reject a sample that was fully reassembled and then found\n   * undeliverable, so collapsing the two would hide a combiner that completes\n   * samples nothing can present.\n   */\n  | 'combined-timing-missing'\n  | 'combined-size-mismatch'\n  /** Frame metadata could not be built \u2014 an fMP4 box arrived as a timed MFU\n   *  payload, or the authored timing converts to a non-positive duration. */\n  | 'combined-meta-build-failed'\n  | 'combined-timing-consume-refused'\n  /** feed() threw. Counted so the tally still sums to fedObjects; the error\n   *  is rethrown, never swallowed. */\n  | 'threw'\n\n/**\n * Every key `outcomes` can carry: one per record kind, one per drop reason.\n *\n * Derived from the two unions rather than written out, so a new record kind or\n * drop reason cannot be counted under a key the type does not admit, and a\n * consumer can enumerate the vocabulary from the type instead of from prose.\n */\nexport type MmtpFeedOutcomeKey =\n  | MmtpParserRecord['kind']\n  | `drop:${MmtpFeedDropReason}`\n\n/**\n * Feed tallies owned by the parser.\n *\n * These live here rather than on MmtpDecodePipeline because the two players\n * sit at different layers of this library: hang-mmt-fec drives the pipeline,\n * while moqtail constructs MmtpContainerParser directly and never builds the\n * wrapper. feed() is the one chokepoint both cross, so a tally maintained here\n * instruments both by construction.\n *\n * Logs are diagnostic output, not an acceptance API \u2014 this is the typed\n * counter a harness should read instead of scraping console histograms.\n */\nexport interface MmtpParserFeedStats {\n  /** Every packet handed to feed(), including post-dispose calls. */\n  fedObjects: number\n  /**\n   * Mutually exclusive outcome tally: record kinds under their own `kind`,\n   * drops under `drop:<reason>`. The values sum to exactly `fedObjects`, which\n   * is the property that makes a frozen media bucket beside a still-climbing\n   * non-media bucket a readable signal rather than two unrelated numbers.\n   *\n   * Partial because a key appears only once it has been counted; absent and\n   * zero mean the same thing to a reader.\n   */\n  outcomes: Partial<Record<MmtpFeedOutcomeKey, number>>\n  /**\n   * Refusals from a completed older sample delivered while registering a\n   * later packet's authored size. Kept separate because that side effect is\n   * not the packet's own feed outcome.\n   */\n  deferredOutcomes: Partial<Record<MmtpFeedDropReason, number>>\n}\n\ntype FrameCallback = (data: Uint8Array, meta: FrameMeta) => void\ntype InitCallback = (data: Uint8Array, packetId: number, catalogTrackName?: string) => void\n\n/**\n * Result of one combined-sample delivery attempt: either the record to return\n * or the reason the sample could not be delivered.\n *\n * Internal to the parser. A bare `null` would be indistinguishable from the\n * other refusals `feed()` can take, and the whole point of the drop-reason\n * vocabulary is that a stage which stops producing frames says which stage it\n * was.\n */\ntype CombinedSampleOutcome =\n  | { readonly record: MmtpParserRecord; readonly reason?: undefined }\n  | { readonly record?: undefined; readonly reason: MmtpFeedDropReason }\n\nexport function isMfuKeyframeMetadata(rapFlag: boolean, priority?: number): boolean {\n  return rapFlag || (priority ?? 0) > 0x80\n}\n\n/** Per-packet detached ALTA authenticator trailer (08-07 Path 2).\n *  - `auth`: the authenticator bytes (length-prefixed at packet end).\n *  - `payloadEnd`: byte offset within the source packet where signed\n *     payload ends \u2014 consumers reconstruct `payload = packet[0..payloadEnd]`\n *     for verify_detached. */\nexport interface ParsedAltaTrailer {\n  auth: Uint8Array\n  payloadEnd: number\n}\n\n/** Source-symbol exposure for FEC consumers.\n *\n *  Fires from {@link MmtpContainerParser.feed} once per FEC-protected source\n *  packet \u2014 after parseHeader confirms fec_payload_id is present, before MFU\n *  extraction.\n *\n *  Arguments:\n *  - `packetId`  \u2013 MMTP header `packet_id` (track identifier)\n *  - `ssId`      \u2013 flat Source Symbol ID from the 4-byte fec_payload_id trailer\n *  - `rawSymbol` \u2013 packet bytes minus the 4-byte fec_payload_id trailer.\n *                  NOT zero-padded to FEC symbol size \u2014 consumer pads if needed\n *                  (FEC symbol size is FEC-config, not parser-config).\n *  - `alta`      \u2013 detached ALTA authenticator if present, else undefined\n *\n *  Designed so consumers (player, Shaka shim, upstream moqtail) can wire\n *  source-symbol delivery to whatever FEC pipeline they own, without depending\n *  on libmmt's MulticastManager/MmtpRouter/FECManager stack. */\ntype SourceSymbolCallback = (\n  packetId: number,\n  ssId: number,\n  rawSymbol: Uint8Array,\n  alta: ParsedAltaTrailer | undefined,\n) => void\n\nexport interface ParseHeaderOptions {\n  /** Recovered source symbols already had the trailing Source FEC Payload ID stripped. */\n  skipFecPayloadId?: boolean\n  /** Mark frames emitted from this packet as FEC-recovered. */\n  recovered?: boolean\n  /** Exact catalog track bound to this packet by its ingress subscription. */\n  catalogTrackName?: string\n  /** Source transport for parser-owned frame attribution. */\n  source?: MmtpSourcePath\n  /**\n   * Explicit strict provenance for the fragments this packet produces.\n   * The router sets it for FEC-recovered packets, which carry no `source`\n   * but whose FEC block's symbol provenance is known.\n   */\n  deliveryProvenance?: MmtpDeliveryProvenance\n}\n\n// \u2500\u2500 FrameSequencer \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\ninterface PendingFrame {\n  data: Uint8Array\n  meta: FrameMeta\n  seq: number\n}\n\ninterface SequencerStream {\n  buf: PendingFrame[]\n  lastEmitted: PendingFrame | null\n}\n\nfunction reorderFrameDiagnostics(frame: PendingFrame): MmtpReorderFrameDiagnostics {\n  return {\n    timestampUs: frame.meta.timestamp,\n    keyframe: frame.meta.keyframe,\n    sequenceNumber: frame.seq,\n    ...(frame.meta.packetSequenceNumber === undefined\n      ? {}\n      : { packetSequenceNumber: frame.meta.packetSequenceNumber }),\n    ...(frame.meta.movieFragmentSequenceNumber === undefined\n      ? {}\n      : { movieFragmentSequenceNumber: frame.meta.movieFragmentSequenceNumber }),\n    ...(frame.meta.sampleNumber === undefined ? {} : { sampleNumber: frame.meta.sampleNumber }),\n    ...(frame.meta.fragmentCount === undefined\n      ? {}\n      : { fragmentCount: frame.meta.fragmentCount }),\n  }\n}\n\ntype SequencerStat = Exclude<keyof MmtpReorderStats, 'bufferedFrames'>\n\nfunction serialSequenceDelta(a: number, b: number): number {\n  return (a - b) | 0\n}\n\nfunction compareFrameOrder(\n  a: PendingFrame,\n  b: PendingFrame,\n): number {\n  if (a.meta.decodeTime !== undefined && b.meta.decodeTime !== undefined &&\n      a.meta.mediaTimescale === b.meta.mediaTimescale) {\n    if (a.meta.decodeTime < b.meta.decodeTime) return -1\n    if (a.meta.decodeTime > b.meta.decodeTime) return 1\n  } else {\n    const decodeDelta = (a.meta.decodeTimestamp ?? a.meta.timestamp) -\n      (b.meta.decodeTimestamp ?? b.meta.timestamp)\n    if (decodeDelta !== 0) return decodeDelta\n  }\n  const movieDelta = serialSequenceDelta(\n    a.meta.movieFragmentSequenceNumber ?? 0,\n    b.meta.movieFragmentSequenceNumber ?? 0,\n  )\n  if (movieDelta !== 0) return movieDelta\n  const sampleDelta = (a.meta.sampleNumber ?? 0) - (b.meta.sampleNumber ?? 0)\n  return sampleDelta !== 0 ? sampleDelta : serialSequenceDelta(a.seq, b.seq)\n}\n\nclass FrameSequencer {\n  #streams = new Map<number, SequencerStream>()\n  #windowSize: number\n  #emit: (data: Uint8Array, meta: FrameMeta) => void\n  #recordStat: (stat: SequencerStat, count?: number) => void\n\n  constructor(\n    windowSize: number,\n    emit: (data: Uint8Array, meta: FrameMeta) => void,\n    recordStat: (stat: SequencerStat, count?: number) => void = () => {},\n  ) {\n    this.#windowSize = windowSize\n    this.#emit = emit\n    this.#recordStat = recordStat\n  }\n\n  push(data: Uint8Array, meta: FrameMeta, seq: number): void {\n    if (this.#windowSize <= 0) {\n      this.#emit(data, meta)\n      return\n    }\n    const frame: PendingFrame = { data, meta: { ...meta }, seq }\n    const stream = this.#streamFor(meta.packetId)\n    if (meta.sourceDiscontinuity) {\n      this.#recordStat('publisherResets')\n      this.#recordStat('droppedOnPublisherReset', stream.buf.length)\n      stream.buf = []\n      stream.lastEmitted = null\n      frame.meta.sourceDiscontinuity = true\n    }\n    if (this.#isStale(stream, frame)) {\n      this.#recordStat('droppedStale')\n      return\n    }\n    if (meta.keyframe && stream.lastEmitted === null) {\n      // The first RAP establishes decoder sync. Discard any pre-RAP media and\n      // emit it immediately so startup does not pay the reorder-window delay.\n      this.#recordStat('droppedBeforeStartupKeyframe', stream.buf.length)\n      stream.buf = []\n      this.#emitFrame(stream, frame)\n      return\n    }\n    let lo = 0, hi = stream.buf.length\n    while (lo < hi) {\n      const mid = (lo + hi) >>> 1\n      if (compareFrameOrder(stream.buf[mid]!, frame) < 0) lo = mid + 1\n      else hi = mid\n    }\n    stream.buf.splice(lo, 0, frame)\n    while (stream.buf.length > this.#windowSize) this.#flushHead(stream)\n  }\n\n  flush(): void {\n    for (const packetId of [...this.#streams.keys()].sort((a, b) => a - b)) {\n      const stream = this.#streams.get(packetId)\n      while (stream && stream.buf.length > 0) this.#flushHead(stream)\n    }\n  }\n\n  get buffered(): number {\n    let total = 0\n    for (const stream of this.#streams.values()) total += stream.buf.length\n    return total\n  }\n\n  get diagnostics(): Omit<MmtpReorderStreamDiagnostics, 'packetId'>[] {\n    return [...this.#streams.values()].map(stream => ({\n      bufferedFrames: stream.buf.length,\n      lastEmitted: stream.lastEmitted ? reorderFrameDiagnostics(stream.lastEmitted) : null,\n      startupKeyframe: null,\n      head: stream.buf.slice(0, 4).map(reorderFrameDiagnostics),\n      tail: stream.buf.slice(-4).map(reorderFrameDiagnostics),\n      keyframes: stream.buf.filter(frame => frame.meta.keyframe).slice(0, 8)\n        .map(reorderFrameDiagnostics),\n    }))\n  }\n\n  discard(): void {\n    for (const stream of this.#streams.values()) {\n      this.#recordStat('droppedOnLiveDispose', stream.buf.length)\n      stream.buf = []\n    }\n    this.#streams.clear()\n  }\n\n  #streamFor(packetId: number): SequencerStream {\n    let stream = this.#streams.get(packetId)\n    if (!stream) {\n      stream = { buf: [], lastEmitted: null }\n      this.#streams.set(packetId, stream)\n    }\n    return stream\n  }\n\n  #flushHead(stream: SequencerStream): boolean {\n    const f = stream.buf.shift()\n    if (!f) return false\n    return this.#emitFrame(stream, f)\n  }\n\n  #isStale(stream: SequencerStream, frame: PendingFrame): boolean {\n    return stream.lastEmitted !== null &&\n      compareFrameOrder(frame, stream.lastEmitted) <= 0\n  }\n\n  #emitFrame(stream: SequencerStream, frame: PendingFrame): boolean {\n    if (this.#isStale(stream, frame)) {\n      this.#recordStat('droppedStale')\n      return false\n    }\n    stream.lastEmitted = frame\n    this.#emit(frame.data, frame.meta)\n    return true\n  }\n}\n\n// \u2500\u2500 fMP4 box detection \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nconst FMPU_BOX_TYPES = new Set(['ftyp', 'moov', 'moof'])\n\nfunction isFmp4Box(data: Uint8Array): boolean {\n  if (data.length < 8) return false\n  const type = String.fromCharCode(data[4]!, data[5]!, data[6]!, data[7]!)\n  return FMPU_BOX_TYPES.has(type)\n}\n\ninterface TimingStreamState {\n  packetId: number\n  resolver: IsoBmffTimingResolver\n}\n\n// \u2500\u2500 MmtpContainerParser \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nexport class MmtpContainerParser {\n  #tracks = new Map<number, TrackInfo>()\n  #defaultTrack: TrackInfo | null = null\n  #reassembler: MfuReassemblerBackend\n  /**\n   * Combines subsample data units back into whole samples (moqcast #37), one\n   * combiner per parser stream. Per-stream is required, not an optimization:\n   * {@link SampleCombiner} identifies a sample by\n   * `(catalogTrackName, mpu, movieFragment, sampleNumber)`, so two streams\n   * that carry no catalog identity would collide on every sample number and\n   * each would see the other's data units as duplicates of its own. The\n   * parser already isolates timing and reordering by this same stream key.\n   *\n   * Inert until a producer partitions \u2014 which it does the moment a frame\n   * exceeds one data unit's 256-payload capacity (~327 KB here, routinely\n   * exceeded by 4K/8K intra frames).\n   */\n  #sampleCombiners = new Map<string, SampleCombiner>()\n  #sampleCombinerOptions: SampleCombinerOptions\n  /** Counters folded in from combiners dropped by a track reset, so the\n   *  totals below stay monotonic across a publisher change. */\n  #retiredSampleCombinerStats: SampleCombinerStats = {\n    combinedSamples: 0,\n    passthroughSamples: 0,\n    timedOutSamples: 0,\n    evictedSamples: 0,\n  }\n  #timingStreams = new Map<string, TimingStreamState>()\n  #maxPendingTimingSamples: number\n  #pendingTimingSamples = 0\n  #reclaimedTimingSamples = 0\n  #evictedTimingSamples = 0\n  #rejectedMovieFragments = 0\n  #sequencers = new Map<string, { packetId: number; sequencer: FrameSequencer }>()\n  #reorderWindow = 0\n  #reassemblyPolicy: MfuReassemblyPolicy | null = null\n  #frameCb: FrameCallback | null = null\n  #initCb: InitCallback | null = null\n  #sourceSymbolCb: SourceSymbolCallback | null = null\n  #trackFrameCbs = new Map<number, FrameCallback>()\n  #reorderStats: Omit<MmtpReorderStats, 'bufferedFrames'> = {\n    droppedBeforeStartupKeyframe: 0,\n    droppedIncompleteStartupInterval: 0,\n    droppedStale: 0,\n    forcedWindowFlushes: 0,\n    droppedOnLiveDispose: 0,\n    publisherResets: 0,\n    droppedOnPublisherReset: 0,\n  }\n  /** Streams (keyed by physical parser stream, value is packetId) that have\n   *  observed their first RAP under a reliable-moq policy. Reliable MoQ\n   *  resolves to a zero parser reorder window (transport ordering is\n   *  protocol-owned), so #sequencerFor returns null and its own startup gate\n   *  never runs; this map preserves an order-independent \"discard delta\n   *  frames before the first RAP\" gate for that path without reintroducing\n   *  reordering into the parser. */\n  #reliableMoqStartupGate = new Map<string, number>()\n  #disposed = false\n  #fedObjects = 0\n  #feedOutcomes = new Map<MmtpFeedOutcomeKey, number>()\n  #deferredFeedOutcomes = new Map<MmtpFeedDropReason, number>()\n  #lastOutcome: MmtpFeedOutcomeKey | null = null\n  #lastOutcomeCount = 0\n\n  #streamKey(packetId: number, catalogTrackName?: string): string {\n    return JSON.stringify([packetId, catalogTrackName ?? null])\n  }\n\n  #sampleCombinerFor(streamKey: string): SampleCombiner {\n    let combiner = this.#sampleCombiners.get(streamKey)\n    if (combiner === undefined) {\n      combiner = new SampleCombiner({\n        ...this.#sampleCombinerOptions,\n        onAbandon: sample => this.#releaseTimingSlot(streamKey, sample),\n      })\n      this.#sampleCombiners.set(streamKey, combiner)\n    }\n    return combiner\n  }\n\n  /**\n   * Return the timing budget slot of a sample the combiner abandoned.\n   *\n   * Without this, `#pendingTimingSamples` is charged for every sample a moof\n   * declares but credited only when that sample is delivered, so each sample\n   * lost to eviction or timeout burns a slot until the window displaces it.\n   * Window displacement bounds that leak but only reclaims the OLDEST entries;\n   * this path returns a slot the moment the combiner knows the sample is gone,\n   * which keeps the live window as wide as the stream actually needs.\n   *\n   * The parser total is decremented only when the resolver reports it\n   * actually freed a slot, so a resolver already dropped by a track reset, or\n   * a sample released twice, cannot drive the accounting negative.\n   */\n  #releaseTimingSlot(streamKey: string, sample: AbandonedSample): void {\n    const resolver = this.#timingStreams.get(streamKey)?.resolver\n    if (!resolver) return\n    if (!resolver.releaseSample(\n      sample.mpuSequenceNumber,\n      sample.movieFragmentSequenceNumber,\n      sample.sampleNumber,\n    )) return\n    this.#pendingTimingSamples--\n    this.#reclaimedTimingSamples++\n    if (this.#pendingTimingSamples < 0) {\n      throw new Error('[MmtpContainerParser] pending timing sample accounting underflow')\n    }\n  }\n\n  /** Drop one stream's combiner, folding its counters into the retained\n   *  totals so a reset cannot make the exposed stats run backwards. */\n  #dropSampleCombiner(streamKey: string): void {\n    const combiner = this.#sampleCombiners.get(streamKey)\n    if (combiner === undefined) return\n    const stats = combiner.stats\n    this.#retiredSampleCombinerStats.combinedSamples += stats.combinedSamples\n    this.#retiredSampleCombinerStats.passthroughSamples += stats.passthroughSamples\n    this.#retiredSampleCombinerStats.timedOutSamples += stats.timedOutSamples\n    this.#retiredSampleCombinerStats.evictedSamples += stats.evictedSamples\n    this.#sampleCombiners.delete(streamKey)\n  }\n\n  constructor(config?: MmtpParserConfig) {\n    if (config?.reassemblyPolicy && config.mfuTimeoutMs !== undefined) {\n      throw new Error('[MmtpContainerParser] use reassemblyPolicy or mfuTimeoutMs, not both')\n    }\n    const reassemblyPolicy = config?.reassemblyPolicy ?? null\n    const requestedReorderWindow = config?.reorderWindow ?? 0\n    if (!Number.isFinite(requestedReorderWindow) || requestedReorderWindow < 0) {\n      throw new Error('[MmtpContainerParser] reorderWindow must be a finite number >= 0')\n    }\n    const normalizedReorderWindow = Math.ceil(requestedReorderWindow)\n    const requestedMfuTimeout = reassemblyPolicy\n      ? mfuReassemblyTimeoutMs(reassemblyPolicy)\n      : config?.mfuTimeoutMs\n    if (reassemblyPolicy) {\n      mmtpFrameReorderWindowFrames(reassemblyPolicy, normalizedReorderWindow)\n    }\n    if (\n      requestedMfuTimeout !== undefined &&\n      requestedMfuTimeout !== null &&\n      requestedMfuTimeout <= 0\n    ) {\n      throw new Error('[MmtpContainerParser] mfuTimeoutMs must be > 0')\n    }\n    const maxPendingTimingSamples = config?.maxBufferedMfus ?? 100\n    if (!Number.isInteger(maxPendingTimingSamples) || maxPendingTimingSamples <= 0) {\n      throw new Error('[MmtpContainerParser] maxBufferedMfus must be a positive integer')\n    }\n    this.#maxPendingTimingSamples = maxPendingTimingSamples\n\n    const maxSubsampleSegments = config?.maxSubsampleSegments ?? 16\n    if (!Number.isInteger(maxSubsampleSegments) || maxSubsampleSegments <= 0) {\n      throw new Error('[MmtpContainerParser] maxSubsampleSegments must be a positive integer')\n    }\n\n    // Everything above only reads `config` \u2014 the full policy/window\n    // combination is validated before this point, so it is now safe to\n    // mutate this instance or an injected, caller-owned reassembler.\n    this.#reassemblyPolicy = reassemblyPolicy\n    if (config?.reassembler) {\n      this.#reassembler = config.reassembler\n      // An injected backend owns its existing transport policy unless this\n      // parser was given an explicit policy/legacy timeout override.\n      if (requestedMfuTimeout !== undefined) {\n        this.#reassembler.timeoutMs = requestedMfuTimeout\n      }\n    } else {\n      this.#reassembler = new MFUReassembler({\n        timeoutMs: requestedMfuTimeout === undefined ? 1000 : requestedMfuTimeout,\n        ...(config?.maxBufferedMfus === undefined ? {} : { maxBuffered: config.maxBufferedMfus }),\n      })\n    }\n    this.#reorderWindow = normalizedReorderWindow\n    this.#sampleCombinerOptions = {\n      maxBuffered: maxPendingTimingSamples,\n      // The parser resolves every timed sample's authored size from FT=1\n      // before its data units reach the combiner, so \"no size yet\" always\n      // means the size has not arrived -- never that the host declines to\n      // supply one. Waiting is therefore correct: treating an offset-zero\n      // data unit as a whole sample in that window would truncate a\n      // partitioned sample instead of completing it.\n      requireAuthoredSize: true,\n      maxSegmentsPerSample: maxSubsampleSegments,\n    }\n    this.#defaultTrack = config?.defaultTrack ?? null\n    if (this.#defaultTrack) this.#validateReassemblyPolicy()\n    if (config?.tracks) {\n      for (const [id, info] of config.tracks) {\n        this.#validateReassemblyPolicy()\n        this.#tracks.set(id, info)\n      }\n    }\n  }\n\n  /** The MFU reassembler that buffers fragmented MFUs fed via feed().\n   *  Exposed so a co-operating FEC-recovery layer (MmtpRouter) feeds recovered\n   *  fragments into the SAME reassembler: a frame split between source-received\n   *  and FEC-recovered fragments must share one buffer to complete (BLO-8151).\n   *  Before this was shared, recovered video symbols reported \"0 emitted,\n   *  pending-reassembly=N\" because they landed in a separate instance. */\n  get reassembler(): MfuReassemblerBackend {\n    return this.#reassembler\n  }\n\n  /**\n   * Subsample-combining counters (moqcast #37). `combinedSamples` counts\n   * samples reassembled from two or more data units and `passthroughSamples`\n   * those that arrived whole; the two are deliberately separate, so a\n   * producer that silently stopped partitioning cannot hide behind a single\n   * \"samples delivered\" total. This is the typed acceptance signal for\n   * large-frame playback \u2014 never parse the console for it.\n   */\n  get sampleCombinerStats(): Readonly<SampleCombinerStats> {\n    const total = { ...this.#retiredSampleCombinerStats }\n    for (const combiner of this.#sampleCombiners.values()) {\n      const stats = combiner.stats\n      total.combinedSamples += stats.combinedSamples\n      total.passthroughSamples += stats.passthroughSamples\n      total.timedOutSamples += stats.timedOutSamples\n      total.evictedSamples += stats.evictedSamples\n    }\n    return total\n  }\n\n  /**\n   * Typed view of the ISO-BMFF timing-sample budget.\n   *\n   * This is the acceptance signal for the budget ratchet: `pending` walking\n   * to `capacity` while `rejectedMovieFragments` climbs is the stream wedging,\n   * and it is observable here rather than only as media silently stopping.\n   * Per repo policy this is a producer-owned counter -- never infer budget\n   * state by parsing logs.\n   */\n  get timingBudgetStats(): Readonly<MmtpTimingBudgetStats> {\n    return {\n      pending: this.#pendingTimingSamples,\n      capacity: this.#maxPendingTimingSamples,\n      reclaimed: this.#reclaimedTimingSamples,\n      evicted: this.#evictedTimingSamples,\n      rejectedMovieFragments: this.#rejectedMovieFragments,\n    }\n  }\n\n  get reorderStats(): Readonly<MmtpReorderStats> {\n    let bufferedFrames = 0\n    for (const { sequencer } of this.#sequencers.values()) bufferedFrames += sequencer.buffered\n    return { ...this.#reorderStats, bufferedFrames }\n  }\n\n  /**\n   * Feed tallies for this parser. A fresh snapshot per call, not a live view,\n   * so a caller can hold one and compare it against a later read.\n   *\n   * Survives dispose() \u2014 the counters are the parser's own state and are not\n   * cleared by teardown, because a wedged receive path is usually read after\n   * the fact.\n   */\n  get feedStats(): Readonly<MmtpParserFeedStats> {\n    return {\n      fedObjects: this.#fedObjects,\n      outcomes: Object.fromEntries(this.#feedOutcomes),\n      deferredOutcomes: Object.fromEntries(this.#deferredFeedOutcomes),\n    }\n  }\n\n  /**\n   * Outcome token of the most recent feed(), or null before the first call.\n   *\n   * Exposed alongside `lastFeedOutcomeCount` as two scalars rather than one\n   * object because a wrapper reads them on every packet, and feedStats()\n   * allocates a fresh snapshot per call.\n   */\n  get lastFeedOutcome(): MmtpFeedOutcomeKey | null {\n    return this.#lastOutcome\n  }\n\n  /** How many times `lastFeedOutcome` has now been seen. 1 on its first\n   *  occurrence, which is what a caller logging once per novel outcome needs. */\n  get lastFeedOutcomeCount(): number {\n    return this.#lastOutcomeCount\n  }\n\n  #countOutcome(token: MmtpFeedOutcomeKey): void {\n    const count = (this.#feedOutcomes.get(token) ?? 0) + 1\n    this.#feedOutcomes.set(token, count)\n    this.#lastOutcome = token\n    this.#lastOutcomeCount = count\n  }\n\n  #countDeferredOutcome(reason: MmtpFeedDropReason): void {\n    this.#deferredFeedOutcomes.set(\n      reason,\n      (this.#deferredFeedOutcomes.get(reason) ?? 0) + 1,\n    )\n  }\n\n  /**\n   * Count a feed() drop and return null in one expression, so every early\n   * return inside feed() states the reason it took instead of collapsing into\n   * a single failure bucket. Returns null so call sites stay `return this.#drop(...)`.\n   */\n  #drop(reason: MmtpFeedDropReason): null {\n    this.#countOutcome(`drop:${reason}`)\n    return null\n  }\n\n  get reorderDiagnostics(): ReadonlyArray<MmtpReorderStreamDiagnostics> {\n    const streams: MmtpReorderStreamDiagnostics[] = []\n    for (const { packetId, sequencer } of this.#sequencers.values()) {\n      for (const diagnostics of sequencer.diagnostics) streams.push({ packetId, ...diagnostics })\n    }\n    return streams\n  }\n\n  /**\n   * Reclaim samples abandoned by the sample combiner's protocol deadline.\n   *\n   * This is deliberately driven by the parser's existing packet/lifecycle\n   * cleanup path rather than by another timer. The reassembler timeout is the\n   * same catalog/FEC-derived deadline that bounds each constituent MFU.\n   */\n  cleanupTimeouts(): void {\n    const timeoutMs = this.#reassembler.timeoutMs\n    if (timeoutMs === null) return\n    for (const combiner of this.#sampleCombiners.values()) {\n      combiner.cleanupTimeouts(timeoutMs)\n    }\n  }\n\n  /**\n   * Phase 1 of two-phase parsing. Returns structured header info for FEC feeding.\n   * Call this before feed() when you need to extract FEC payload ID and feed\n   * symbols to FECManager before MFU extraction.\n   * Returns null for malformed packets.\n   */\n  parseHeader(packet: Uint8Array, options?: ParseHeaderOptions): PacketInfo | null {\n    try {\n      const header = parseMMTPHeader(packet)\n      const isRepair = header.packetType === PACKET_TYPE_REPAIR\n      const fecPayloadId =\n        !options?.skipFecPayloadId &&\n        !isRepair && hasSourceFecPayloadId(packet)\n          ? extractFecPayloadId(packet)\n          : null\n      return {\n        packetId: header.packetId,\n        packetType: header.packetType,\n        timestamp: header.timestamp,\n        timestampUs: mmtpTimestampToMicros(header.timestamp),\n        sequenceNumber: header.sequenceNumber,\n        rapFlag: header.rapFlag,\n        fecType: header.fecType,\n        fecPayloadId,\n        isRepair,\n      }\n    } catch {\n      return null\n    }\n  }\n\n  /** Feed a complete MMTP packet. For two-phase use, call parseHeader() first. */\n  feed(packet: Uint8Array, options?: ParseHeaderOptions): MmtpParserRecord | null {\n    this.#fedObjects += 1\n    let record: MmtpParserRecord | null\n    try {\n      record = this.#feed(packet, options)\n    } catch (error) {\n      // Count before rethrowing: a throw is an outcome, and leaving it\n      // uncounted would silently break the sum-to-fedObjects invariant that\n      // makes this tally readable.\n      this.#countOutcome('drop:threw')\n      throw error\n    }\n    // Drops are counted at their own return sites via #drop(), which is what\n    // preserves the reason. Only successful records are counted here.\n    if (record) this.#countOutcome(record.kind)\n    return record\n  }\n\n  #feed(packet: Uint8Array, options?: ParseHeaderOptions): MmtpParserRecord | null {\n    if (this.#disposed) return this.#drop('disposed')\n\n    this.cleanupTimeouts()\n\n    const info = this.parseHeader(packet, options)\n    if (!info) return this.#drop('header-parse-failed')\n\n    if (info.packetType !== PACKET_TYPE_MPU) {\n      return {\n        kind: info.isRepair ? 'repair' : 'non-media',\n        packet: info,\n        byteLength: packet.byteLength,\n      }\n    }\n\n    // \u2500\u2500 FEC source-symbol exposure \u2500\u2500\n    // Fire onSourceSymbol BEFORE MFU extraction so the consumer-side FEC\n    // pipeline (e.g. FecWorkerClient.feedSource) starts as early as possible.\n    // Source-only: parseHeader already gates fecPayloadId on !isRepair.\n    if (info.fecPayloadId !== null && this.#sourceSymbolCb) {\n      // Strip the 4-byte fec_payload_id trailer per ISO 23008-1 \u00A7C.5.2.\n      // Symbol-size zero-padding is the consumer's responsibility \u2014 FEC\n      // symbol size is a FEC-config concern, not a parser concern.\n      const rawSymbol = packet.subarray(0, packet.length - 4)\n      const altaTrailer = extractAltaTrailer(packet)\n      const alta = altaTrailer\n        ? { auth: altaTrailer.auth, payloadEnd: altaTrailer.signedEnd }\n        : undefined\n      try {\n        this.#sourceSymbolCb(info.packetId, info.fecPayloadId.ssId, rawSymbol, alta)\n      } catch {\n        // Source-symbol consumer threw \u2014 never block MFU extraction on\n        // FEC-pipeline errors. The frame path stays viable; the consumer\n        // is responsible for its own error surfacing.\n      }\n    }\n\n    const extraction = extractMFUPayload(packet, {\n      skipFecId: options?.skipFecPayloadId,\n    })\n    if (!extraction) return this.#drop('mfu-extract-failed')\n\n    const { mpu, fragmentType, data, mfuDuHeader } = extraction\n    if (mpu.timedFlag !== 1) return this.#drop('untimed-mpu')\n    const streamKey = this.#streamKey(info.packetId, options?.catalogTrackName)\n\n    if (fragmentType === 0) {\n      if (mpu.fragmentationIndicator !== 0 || mpu.fragmentCounter !== 0)\n        return this.#drop('init-unexpected-fragmentation')\n      // ISO MMTP MPU metadata may carry an `mmpu` box between the ftyp and\n      // moov boxes.  That box is valid MMTP metadata but is not a legal\n      // top-level MSE initialization box. Normalize at the parser boundary so\n      // every container consumer (including MSE and rendition handoff paths)\n      // receives append-safe ftyp+moov bytes rather than having to remember\n      // this wire-format detail independently.\n      const normalizedInit = normalizeMmtpInitSegment(data)\n      if (!normalizedInit) return this.#drop('init-normalize-failed')\n      const resolver = this.#timingResolver(streamKey, info.packetId, true)\n      if (!resolver?.addInitialization(normalizedInit)) return this.#drop('init-timing-refused')\n      this.#initCb?.(normalizedInit, info.packetId, options?.catalogTrackName)\n      return {\n        kind: 'init',\n        packet: info,\n        data: normalizedInit,\n        mpuSequenceNumber: mpu.mpuSequenceNumber,\n        fragmentationIndicator: mpu.fragmentationIndicator,\n        fragmentCounter: mpu.fragmentCounter,\n      }\n    }\n\n    if (fragmentType === 1) {\n      if (mpu.fragmentationIndicator !== 0 || mpu.fragmentCounter !== 0)\n        return this.#drop('fragment-unexpected-fragmentation')\n      const resolver = this.#timingResolver(streamKey, info.packetId, false)\n      if (!resolver) return this.#drop('fragment-no-resolver')\n      const pendingBefore = resolver.pendingSampleCount\n      const evictedBefore = resolver.evictedSampleCount\n      const remaining = this.#maxPendingTimingSamples - this.#pendingTimingSamples\n      const admitted = resolver.addMovieFragment(mpu.mpuSequenceNumber, data, remaining)\n      // Sync on BOTH paths: the resolver can displace stale timing and still\n      // refuse the fragment in hand, and a global count that missed those\n      // freed slots would keep refusing on a budget that is no longer full.\n      this.#pendingTimingSamples += resolver.pendingSampleCount - pendingBefore\n      this.#evictedTimingSamples += resolver.evictedSampleCount - evictedBefore\n      if (!admitted) {\n        if (resolver.lastMovieFragmentRejection === 'budget') {\n          this.#rejectedMovieFragments++\n        }\n        return this.#drop('fragment-timing-refused')\n      }\n      return {\n        kind: 'fragment',\n        packet: info,\n        data,\n        mpuSequenceNumber: mpu.mpuSequenceNumber,\n        fragmentationIndicator: mpu.fragmentationIndicator,\n        fragmentCounter: mpu.fragmentCounter,\n      }\n    }\n    if (fragmentType !== 2) return this.#drop('unknown-fragment-type')\n\n    const resolver = this.#timingResolver(streamKey, info.packetId, false)\n    if (!resolver) return this.#drop('mfu-no-resolver')\n    if (!Number.isSafeInteger(data.byteLength) || data.byteLength <= 0)\n      return this.#drop('mfu-empty-payload')\n    if (mpu.fragmentationIndicator === 0 || mpu.fragmentationIndicator === 1) {\n      if (!mfuDuHeader || mfuDuHeader.movieFragmentSequenceNumber === 0 ||\n          mfuDuHeader.sampleNumber === 0) {\n        return this.#drop('mfu-du-header-missing')\n      }\n      const headTiming = resolver.sampleTiming(\n        mpu.mpuSequenceNumber,\n        mfuDuHeader.movieFragmentSequenceNumber,\n        mfuDuHeader.sampleNumber,\n      )\n      if (!headTiming) return this.#drop('mfu-sample-timing-missing')\n      // A data unit's authored base offset is its position within the sample\n      // (moqcast #37): 0 for a whole-sample DU, nonzero for one subsample DU\n      // among siblings. Sizes below are therefore relative to that base, not\n      // to the sample's start -- comparing a subsample DU against the whole\n      // sample's size is what dropped every partitioned 4K/8K frame.\n      const offset = mfuDuHeader.offset\n      if (!Number.isSafeInteger(offset) || offset < 0 || offset >= headTiming.size)\n        return this.#drop('mfu-offset-out-of-range')\n      const remaining = headTiming.size - offset\n      // FI=0 carries its data unit whole, in a single payload. Only a\n      // partitioned sample's FINAL data unit can be shorter than a full data\n      // unit -- every earlier one spans exactly 256 payloads and so is always\n      // fragmented -- which makes a whole-carried DU exactly the bytes left\n      // from its base. At offset 0 this is the pre-amendment check unchanged.\n      if (mpu.fragmentationIndicator === 0 && data.byteLength !== remaining)\n        return this.#drop('mfu-size-mismatch')\n      if (mpu.fragmentationIndicator === 1 && data.byteLength >= remaining)\n        return this.#drop('mfu-size-mismatch')\n\n      // Publish the authored size before this data unit can complete, so the\n      // combiner never has to guess whether an offset-zero DU is a whole\n      // sample. Registration can complete a previously buffered sample; its\n      // refusal is a side effect of this feed, not this packet's own outcome,\n      // so expose it in deferredOutcomes without double-counting outcomes.\n      const readyOnRegister = this.#sampleCombinerFor(streamKey).registerAuthoredSize(\n        options?.catalogTrackName,\n        mpu.mpuSequenceNumber,\n        mfuDuHeader.movieFragmentSequenceNumber,\n        mfuDuHeader.sampleNumber,\n        headTiming.size,\n      )\n      if (readyOnRegister) {\n        const deferred = this.#emitCombinedSample(\n          readyOnRegister,\n          info,\n          resolver,\n          options?.recovered === true,\n        )\n        if (deferred.record === undefined) this.#countDeferredOutcome(deferred.reason)\n      }\n    }\n\n    let assembled: ReassembledMFU | null\n    try {\n      assembled = this.#reassembler.addFragment({\n        fragmentationIndicator: mpu.fragmentationIndicator,\n        mpuSequenceNumber: mpu.mpuSequenceNumber,\n        fragmentCounter: mpu.fragmentCounter,\n        data,\n        timestamp: info.timestamp,\n        rapFlag: info.rapFlag,\n        priority: mfuDuHeader?.priority,\n        sampleNumber: mfuDuHeader?.sampleNumber,\n        movieFragmentSequenceNumber: mfuDuHeader?.movieFragmentSequenceNumber,\n        sampleOffset: mfuDuHeader?.offset,\n        packetSequenceNumber: info.sequenceNumber,\n        recovered: options?.recovered === true,\n        source: options?.source,\n        deliveryProvenance: options?.deliveryProvenance,\n        catalogTrackName: options?.catalogTrackName,\n        packetId: info.packetId,\n      })\n    } catch (error) {\n      if (!isMfuReassemblyError(error)) throw error\n      console.warn(\n        `[MmtpContainerParser] rejected MFU fragment: code=${error.code} ` +\n        `mpu=${mpu.mpuSequenceNumber} fi=${mpu.fragmentationIndicator} ` +\n        `counter=${mpu.fragmentCounter}`,\n      )\n      return {\n        kind: 'rejected',\n        packet: info,\n        mpuSequenceNumber: mpu.mpuSequenceNumber,\n        fragmentationIndicator: mpu.fragmentationIndicator,\n        fragmentCounter: mpu.fragmentCounter,\n        error: { code: error.code, message: error.message },\n      }\n    }\n\n    if (!assembled) {\n      return {\n        kind: 'pending',\n        packet: info,\n        mpuSequenceNumber: mpu.mpuSequenceNumber,\n        fragmentationIndicator: mpu.fragmentationIndicator,\n        fragmentCounter: mpu.fragmentCounter,\n      }\n    }\n\n    const movieFragmentSequenceNumber = assembled.movieFragmentSequenceNumber\n    const sampleNumber = assembled.sampleNumber\n    if (movieFragmentSequenceNumber === undefined || sampleNumber === undefined)\n      return this.#drop('assembled-identity-missing')\n    // Resolve authored timing BEFORE the combiner sees this data unit. An\n    // assembled data unit whose sample identity has no authored timing is not\n    // a sample this stream declared, so it must be dropped outright -- letting\n    // it buffer would occupy a combiner slot and could evict a legitimate\n    // partitioned sample waiting on a sibling.\n    if (!resolver.sampleTiming(\n      assembled.mpuSequenceNumber,\n      movieFragmentSequenceNumber,\n      sampleNumber,\n    )) return this.#drop('assembled-timing-missing')\n    if (assembled.mpuSequenceNumber !== mpu.mpuSequenceNumber)\n      return this.#drop('assembled-mpu-mismatch')\n\n    // One reassembled data unit is not necessarily one whole sample. A\n    // partitioned sample completes only once every sibling data unit has\n    // arrived and they are byte-adjacent from zero to the authored size; an\n    // unpartitioned sample passes straight through with no buffering.\n    let combined: CombinedSample | null\n    try {\n      combined = this.#sampleCombinerFor(streamKey).addMfu(assembled)\n    } catch (error) {\n      if (!(error instanceof SampleCombineError)) throw error\n      console.warn(\n        `[MmtpContainerParser] rejected subsample data unit: code=${error.code} ` +\n        `mpu=${assembled.mpuSequenceNumber} sample=${sampleNumber} ` +\n        `offset=${assembled.sampleOffset ?? 0}`,\n      )\n      return {\n        kind: 'rejected',\n        packet: info,\n        mpuSequenceNumber: mpu.mpuSequenceNumber,\n        fragmentationIndicator: mpu.fragmentationIndicator,\n        fragmentCounter: mpu.fragmentCounter,\n        error: { code: error.code, message: error.message },\n      }\n    }\n    if (!combined) {\n      return {\n        kind: 'pending',\n        packet: info,\n        mpuSequenceNumber: mpu.mpuSequenceNumber,\n        fragmentationIndicator: mpu.fragmentationIndicator,\n        fragmentCounter: mpu.fragmentCounter,\n      }\n    }\n\n    const outcome = this.#emitCombinedSample(\n      combined,\n      info,\n      resolver,\n      options?.recovered === true,\n    )\n    if (outcome.record !== undefined) return outcome.record\n    return this.#drop(outcome.reason)\n  }\n\n  /**\n   * Deliver one combined sample: resolve its authored timing, build frame\n   * metadata, retire the timing entry, and route it. Shared by the ordinary\n   * completion path and by the rarer completion that falls out of registering\n   * an authored size for data units that arrived before it.\n   *\n   * Reports a refusal as a reason rather than counting it, because the two\n   * call sites owe different accounting. On `#feed()`'s tail return the\n   * refusal *is* that feed()'s outcome and must be attributed; on the\n   * register-completion path it belongs to an earlier sample while this\n   * packet's own fragment continues to its own outcome, so counting it there\n   * would push `outcomes` past `fedObjects` \u2014 the very invariant the\n   * attribution exists to keep readable. Leaving the choice at the call site\n   * is what keeps both true.\n   */\n  #emitCombinedSample(\n    combined: CombinedSample,\n    info: PacketInfo,\n    resolver: IsoBmffTimingResolver,\n    recovered: boolean,\n  ): CombinedSampleOutcome {\n    const timing = resolver.sampleTiming(\n      combined.mpuSequenceNumber,\n      combined.movieFragmentSequenceNumber,\n      combined.sampleNumber,\n    )\n    if (!timing) return { reason: 'combined-timing-missing' }\n    // The combiner already completes against the registered authored size;\n    // re-checking here keeps the unpartitioned passthrough path fail-closed\n    // on the same invariant rather than trusting it by construction.\n    if (combined.data.byteLength !== timing.size) return { reason: 'combined-size-mismatch' }\n\n    const meta = this.#buildFrameMeta(\n      combined,\n      info.packetId,\n      info.sequenceNumber,\n      timing,\n      recovered,\n    )\n    if (!meta) return { reason: 'combined-meta-build-failed' }\n    if (!resolver.consumeSample(\n      combined.mpuSequenceNumber,\n      combined.movieFragmentSequenceNumber,\n      combined.sampleNumber,\n      timing,\n    )) return { reason: 'combined-timing-consume-refused' }\n    this.#pendingTimingSamples--\n    this.routeFrame(combined.data, meta)\n    return {\n      record: {\n        kind: 'frame',\n        packet: info,\n        data: combined.data,\n        meta,\n        mpuSequenceNumber: combined.mpuSequenceNumber,\n        fragmentCount: combined.fragmentCount,\n        rapFlag: combined.rapFlag,\n        ...(combined.priority === undefined ? {} : { priority: combined.priority }),\n      },\n    }\n  }\n\n  onInit(cb: InitCallback): void {\n    this.#initCb = cb\n  }\n\n  onFrame(cb: FrameCallback): void {\n    this.#frameCb = cb\n  }\n\n  /** Register a per-packet FEC source-symbol callback. Fires for each MMTP\n   *  source MPU packet that carries a Source FEC Payload ID (ISO 23008-1 \u00A7C.5.2).\n   *\n   *  Consumer responsibilities:\n   *  - Zero-pad `rawSymbol` to the FEC `symbolSize` if shorter (FEC config is\n   *    out-of-band \u2014 typically from the CMSF catalog's `fec.symbolSize`).\n   *  - Decide oversized handling (rawSymbol.length > symbolSize is not FEC-\n   *    decodable; consumer typically skips that block's source-feed).\n   *  - Look up the right FEC consumer (e.g. FecWorkerClient) by packetId.\n   *\n   *  Designed for spec-clean reuse: Shaka, upstream moqtail, or any consumer\n   *  that uses MmtpContainerParser can wire FEC source delivery without\n   *  pulling in MulticastManager/MmtpRouter/FECManager. */\n  onSourceSymbol(cb: SourceSymbolCallback): void {\n    this.#sourceSymbolCb = cb\n  }\n\n  onTrackFrame(packetId: number, cb: FrameCallback): void {\n    this.#trackFrameCbs.set(packetId, cb)\n  }\n\n  setTrack(packetId: number, info: TrackInfo): void {\n    this.#validateReassemblyPolicy()\n    for (const [key, entry] of this.#sequencers) {\n      if (entry.packetId !== packetId) continue\n      entry.sequencer.flush()\n      this.#sequencers.delete(key)\n    }\n    for (const [key, state] of this.#timingStreams) {\n      if (state.packetId === packetId) this.#dropTimingStream(key)\n    }\n    for (const key of [...this.#sampleCombiners.keys()]) {\n      if ((JSON.parse(key) as [number, string | null])[0] === packetId) {\n        this.#dropSampleCombiner(key)\n      }\n    }\n    for (const [key, gatedPacketId] of this.#reliableMoqStartupGate) {\n      if (gatedPacketId === packetId) this.#reliableMoqStartupGate.delete(key)\n    }\n    this.#tracks.set(packetId, info)\n  }\n\n  /** Drop one physical stream's ordering and MFU state for retained replay. */\n  resetTrack(packetId: number, catalogTrackName: string): void {\n    if (!catalogTrackName) {\n      throw new Error('[MmtpContainerParser] catalogTrackName is required for track reset')\n    }\n    for (const [key, entry] of this.#sequencers) {\n      if (key !== this.#streamKey(packetId, catalogTrackName)) continue\n      entry.sequencer.discard()\n      this.#sequencers.delete(key)\n    }\n    const streamKey = this.#streamKey(packetId, catalogTrackName)\n    this.#dropTimingStream(streamKey)\n    this.#reliableMoqStartupGate.delete(streamKey)\n    this.#reassembler.resetStream(catalogTrackName)\n    // Drop half-combined samples too: a partitioned sample whose siblings\n    // straddle the reset would otherwise complete against a stale authored\n    // size and hand the decoder bytes from two different publisher epochs.\n    this.#dropSampleCombiner(streamKey)\n  }\n\n  setMfuTimeoutMs(ms: number | null): void {\n    if (ms !== null && ms <= 0) throw new Error('[MmtpContainerParser] mfuTimeoutMs must be > 0')\n    this.#reassembler.timeoutMs = ms\n  }\n\n  setReassemblyPolicy(policy: MfuReassemblyPolicy): void {\n    const timeoutMs = mfuReassemblyTimeoutMs(policy)\n    this.#validateReassemblyPolicy(policy)\n    this.#flushSequencers()\n    this.#reassemblyPolicy = policy\n    this.#reliableMoqStartupGate.clear()\n    this.setMfuTimeoutMs(timeoutMs)\n  }\n\n  setReorderWindow(windowSize: number): void {\n    if (!Number.isFinite(windowSize) || windowSize < 0) {\n      throw new Error('[MmtpContainerParser] reorderWindow must be a finite number >= 0')\n    }\n    const nextWindow = Math.ceil(windowSize)\n    this.#validateReassemblyPolicy(this.#reassemblyPolicy, nextWindow)\n    this.#flushSequencers()\n    this.#reorderWindow = nextWindow\n    if (this.#reorderWindow <= 0) this.#sequencers.clear()\n  }\n\n  /** Route an already-assembled frame through the same reorder/callback path\n   * used by source packets. FEC recovery uses this to merge recovered frames\n   * with direct source frames before the decoder sees them. */\n  routeFrame(data: Uint8Array, meta: FrameMeta): void {\n    const seq = meta.packetSequenceNumber\n    const sequencer = this.#sequencerFor(meta.packetId, meta.trackType, meta.catalogTrackName)\n    if (sequencer && seq !== undefined && Number.isFinite(seq)) {\n      sequencer.push(data, meta, seq)\n      return\n    }\n    if (this.#reassemblyPolicy?.transport === 'reliable-moq' &&\n      meta.trackType === 'video' &&\n      !this.#passReliableMoqStartupGate(meta)) {\n      return\n    }\n    this.#emitFrame(data, meta)\n  }\n\n  /**\n   * Claim and return the authored timing for a recovered sample. Recovery does\n   * not pass through the ordinary `feed()` completion path, so it must retire\n   * the same bounded resolver entry once the router accepts the recovered\n   * sample. A missing entry is a fail-closed signal: callers must not replace\n   * it with an MMTP send timestamp or cadence guess.\n   */\n  consumeAuthoredTimingFor(\n    packetId: number,\n    mpuSequenceNumber: number,\n    movieFragmentSequenceNumber: number | undefined,\n    sampleNumber: number | undefined,\n    catalogTrackName?: string,\n  ): AuthoredTiming | null {\n    if (movieFragmentSequenceNumber === undefined || sampleNumber === undefined) return null\n    const resolver = this.#timingResolver(\n      this.#streamKey(packetId, catalogTrackName),\n      packetId,\n      false,\n    )\n    const timing = resolver?.sampleTiming(\n      mpuSequenceNumber,\n      movieFragmentSequenceNumber,\n      sampleNumber,\n    )\n    if (!timing || !resolver || !resolver.consumeSample(\n      mpuSequenceNumber,\n      movieFragmentSequenceNumber,\n      sampleNumber,\n      timing,\n    )) return null\n    this.#pendingTimingSamples--\n    if (this.#pendingTimingSamples < 0) {\n      throw new Error('[MmtpContainerParser] pending timing sample accounting underflow')\n    }\n    return {\n      decodeTime: timing.decodeTime,\n      presentationTime: timing.presentationTime,\n      durationTicks: timing.duration,\n      mediaTimescale: timing.timescale,\n    }\n  }\n\n  /** Order-independent reliable-moq startup gate: discard delta frames for a\n   *  stream until its first RAP is observed, without buffering/reordering. */\n  #passReliableMoqStartupGate(meta: FrameMeta): boolean {\n    const streamKey = this.#streamKey(meta.packetId, meta.catalogTrackName)\n    if (meta.sourceDiscontinuity) this.#reliableMoqStartupGate.delete(streamKey)\n    if (this.#reliableMoqStartupGate.has(streamKey)) return true\n    if (!meta.keyframe) {\n      this.#reorderStats.droppedBeforeStartupKeyframe++\n      return false\n    }\n    this.#reliableMoqStartupGate.set(streamKey, meta.packetId)\n    return true\n  }\n\n  /** Emit all ordered frames currently buffered by the parser. Finite-stream\n   * consumers may call this before dispose(); live cancellation should not. */\n  flush(): void {\n    if (this.#disposed) return\n    this.#flushSequencers()\n  }\n\n  dispose(): void {\n    this.#disposed = true\n    for (const { sequencer } of this.#sequencers.values()) sequencer.discard()\n    this.#sequencers.clear()\n    this.#timingStreams.clear()\n    this.#pendingTimingSamples = 0\n    this.#reliableMoqStartupGate.clear()\n    this.#reassembler.reset()\n    this.#frameCb = null\n    this.#initCb = null\n    this.#trackFrameCbs.clear()\n  }\n\n  // \u2500\u2500 Private \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n  #timingResolver(\n    streamKey: string,\n    packetId: number,\n    create: boolean,\n  ): IsoBmffTimingResolver | null {\n    const existing = this.#timingStreams.get(streamKey)\n    if (existing) return existing.resolver\n    if (!create) return null\n    const resolver = new IsoBmffTimingResolver(this.#maxPendingTimingSamples)\n    this.#timingStreams.set(streamKey, { packetId, resolver })\n    return resolver\n  }\n\n  #dropTimingStream(streamKey: string): void {\n    const state = this.#timingStreams.get(streamKey)\n    if (!state) return\n    this.#timingStreams.delete(streamKey)\n    this.#pendingTimingSamples -= state.resolver.pendingSampleCount\n    if (this.#pendingTimingSamples < 0) {\n      throw new Error('[MmtpContainerParser] pending timing sample accounting underflow')\n    }\n  }\n\n  #validateReassemblyPolicy(\n    policy: MfuReassemblyPolicy | null = this.#reassemblyPolicy,\n    reorderWindow = this.#reorderWindow,\n  ): void {\n    if (!policy) return\n    mmtpFrameReorderWindowFrames(policy, reorderWindow)\n  }\n\n  #buildFrameMeta(\n    assembled: CombinedSample,\n    packetId: number,\n    seq: number,\n    timing: IsoBmffSampleTiming,\n    recovered = false,\n  ): FrameMeta | null {\n    const { data, rapFlag, priority } = assembled\n\n    if (isFmp4Box(data)) return null\n    const presentationTimestamp = mediaTicksToMicroseconds(\n      timing.presentationTime,\n      timing.timescale,\n    )\n    const decodeTimestamp = mediaTicksToMicroseconds(timing.decodeTime, timing.timescale)\n    const duration = mediaTicksToMicroseconds(BigInt(timing.duration), timing.timescale)\n    if (presentationTimestamp === null || decodeTimestamp === null || duration === null ||\n        duration <= 0) {\n      return null\n    }\n\n    let track = this.#tracks.get(packetId)\n    if (!track && this.#defaultTrack) {\n      track = this.#defaultTrack\n      this.#tracks.set(packetId, track)\n    }\n    const codec = track?.codec ?? ''\n\n    const keyframe = MmtpContainerParser.isKeyframe(data, isMfuKeyframeMetadata(rapFlag, priority), codec)\n\n    const meta: FrameMeta = {\n      timestamp: presentationTimestamp,\n      decodeTimestamp,\n      duration,\n      decodeTime: timing.decodeTime,\n      presentationTime: timing.presentationTime,\n      durationTicks: timing.duration,\n      mediaTimescale: timing.timescale,\n      authoredTiming: {\n        decodeTime: timing.decodeTime,\n        presentationTime: timing.presentationTime,\n        durationTicks: timing.duration,\n        mediaTimescale: timing.timescale,\n      },\n      keyframe,\n      packetId,\n      trackType: track?.type ?? null,\n      packetSequenceNumber: seq,\n      ...(assembled.packetSequenceNumbers === undefined\n        ? {}\n        : { packetSequenceNumbers: assembled.packetSequenceNumbers }),\n      ...(assembled.repairedPacketSequenceNumbers === undefined\n        ? {}\n        : { repairedPacketSequenceNumbers: assembled.repairedPacketSequenceNumbers }),\n      ...(assembled.catalogTrackName === undefined\n        ? {}\n        : { catalogTrackName: assembled.catalogTrackName }),\n      ...(assembled.mmtpTimestamp === undefined\n        ? {}\n        : { mmtpTimestamp: assembled.mmtpTimestamp }),\n      mpuSequenceNumber: assembled.mpuSequenceNumber,\n      ...(assembled.movieFragmentSequenceNumber === undefined\n        ? {}\n        : { movieFragmentSequenceNumber: assembled.movieFragmentSequenceNumber }),\n      ...(assembled.sampleNumber === undefined ? {} : { sampleNumber: assembled.sampleNumber }),\n      fragmentCount: assembled.fragmentCount,\n      rapFlag,\n      ...(priority === undefined ? {} : { priority }),\n      ...(assembled.source === undefined ? {} : { source: assembled.source }),\n      deliveryProvenance: assembled.deliveryProvenance,\n    }\n    if (recovered || (assembled.repairedPacketSequenceNumbers?.length ?? 0) > 0) {\n      meta.recovered = true\n    }\n\n    return meta\n  }\n\n  #sequencerFor(\n    packetId: number,\n    _trackType: FrameMeta['trackType'],\n    catalogTrackName?: string,\n  ): FrameSequencer | null {\n    const windowSize = this.#reassemblyPolicy\n      ? mmtpFrameReorderWindowFrames(this.#reassemblyPolicy, this.#reorderWindow)\n      : this.#reorderWindow\n    if (windowSize <= 0) return null\n    const streamKey = this.#streamKey(packetId, catalogTrackName)\n    let sequencer = this.#sequencers.get(streamKey)?.sequencer\n    if (!sequencer) {\n      sequencer = new FrameSequencer(windowSize, (data, meta) => {\n        this.#emitFrame(data, meta)\n      }, (stat, count = 1) => {\n        this.#reorderStats[stat] += count\n      })\n      this.#sequencers.set(streamKey, { packetId, sequencer })\n    }\n    return sequencer\n  }\n\n  #flushSequencers(): void {\n    for (const { sequencer } of this.#sequencers.values()) sequencer.flush()\n    this.#sequencers.clear()\n  }\n\n  /** Authored presentation timestamp of the last emitted frame, in microseconds. */\n  lastFrameTimestamp: number | undefined = undefined\n\n  #emitFrame(data: Uint8Array, meta: FrameMeta): void {\n    this.lastFrameTimestamp = meta.timestamp\n    const trackCb = this.#trackFrameCbs.get(meta.packetId)\n    trackCb?.(data, meta)\n    this.#frameCb?.(data, meta)\n  }\n\n  // \u2500\u2500 Static utilities \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n  static isKeyframe(data: Uint8Array, rapFlag: boolean, codec = ''): boolean {\n    const payloadKeyframe = MmtpContainerParser.#scanForKeyframe(data, codec)\n    if (payloadKeyframe !== undefined) return payloadKeyframe\n    return rapFlag\n  }\n\n  static #scanForKeyframe(data: Uint8Array, codec: string): boolean | undefined {\n    const c = codec.toLowerCase()\n    if (data.length === 0) return undefined\n\n    if (c.startsWith('av01')) {\n      return scanAv1ObusForKeyframe(data)\n    }\n\n    if (c.startsWith('vp09') || c.startsWith('vp8')) {\n      return (data[0]! & 0x04) === 0\n    }\n\n    const isHevc = c.startsWith('hev1') || c.startsWith('hvc1')\n    if (isHevc) {\n      if (data.length < 5) return undefined\n      if (startsWithAnnexB(data)) {\n        return MmtpContainerParser.#scanAnnexBForKeyframe(data, true)\n      }\n      return MmtpContainerParser.#scanLengthPrefixedHevcForKeyframe(data)\n    }\n\n    if (c === '' || c.startsWith('avc')) {\n      return classifyH264Keyframe(data, { allowPartialAvcc: true })\n    }\n\n    return undefined\n  }\n\n  static #scanLengthPrefixedHevcForKeyframe(data: Uint8Array): boolean | undefined {\n    let sawNal = false\n    let offset = 0\n    while (offset + 4 < data.length) {\n      const nalLen =\n        (data[offset]! << 24) |\n        (data[offset + 1]! << 16) |\n        (data[offset + 2]! << 8) |\n        data[offset + 3]!\n      offset += 4\n      if (nalLen <= 0) return sawNal ? false : undefined\n      // The router's sync probe may see only the first fragment of a large\n      // length-prefixed NAL. The length can exceed this packet, but the NAL\n      // header is still enough to classify IRAP/IDR and open the sync gate.\n      if (offset >= data.length) return sawNal ? false : undefined\n      sawNal = true\n      const hevcType = (data[offset]! >> 1) & 0x3f\n      if (hevcType >= 16 && hevcType <= 21) return true\n      if (offset + nalLen > data.length) break\n      offset += nalLen\n    }\n    return sawNal ? false : undefined\n  }\n\n  static #scanAnnexBForKeyframe(data: Uint8Array, isHevc: boolean): boolean | undefined {\n    let offset = 0\n    let sawNal = false\n    while (offset < data.length) {\n      const start = findAnnexBStart(data, offset)\n      if (!start) return sawNal ? false : undefined\n      const headerOffset = start.offset + start.length\n      if (headerOffset >= data.length) return sawNal ? false : undefined\n      sawNal = true\n      if (isHevc) {\n        if (headerOffset + 1 >= data.length) return sawNal ? false : undefined\n        const hevcType = (data[headerOffset]! >> 1) & 0x3f\n        if (hevcType >= 16 && hevcType <= 21) return true\n      } else {\n        const nalType = data[headerOffset]! & 0x1f\n        if (nalType === 5) return true\n      }\n      offset = headerOffset + 1\n    }\n    return sawNal ? false : undefined\n  }\n}\n\nfunction scanAv1ObusForKeyframe(data: Uint8Array): boolean | undefined {\n  let offset = 0\n  let sawSequenceHeader = false\n  let sawFrame = false\n\n  while (offset < data.length) {\n    const obu = readAv1Obu(data, offset)\n    if (!obu) return sawFrame ? false : undefined\n    offset = obu.nextOffset\n\n    if (obu.type === 1) {\n      sawSequenceHeader = true\n      continue\n    }\n    if (obu.type !== 3 && obu.type !== 6) continue\n\n    sawFrame = true\n    if (!sawSequenceHeader) {\n      continue\n    }\n\n    const keyframe = readAv1FrameHeaderKeyframe(data.subarray(obu.payloadOffset, obu.payloadEnd))\n    if (keyframe !== undefined) return keyframe\n  }\n\n  return sawFrame ? false : undefined\n}\n\nfunction readAv1Obu(\n  data: Uint8Array,\n  offset: number,\n): { type: number; payloadOffset: number; payloadEnd: number; nextOffset: number } | null {\n  if (offset >= data.length) return null\n  const header = data[offset]!\n  if ((header & 0x80) !== 0 || (header & 0x01) !== 0) return null\n\n  const type = (header >> 3) & 0x0f\n  const extensionFlag = (header & 0x04) !== 0\n  const hasSizeField = (header & 0x02) !== 0\n  let cursor = offset + 1\n  if (extensionFlag) cursor += 1\n  if (cursor > data.length) return null\n\n  let payloadSize = data.length - cursor\n  if (hasSizeField) {\n    const leb = readLeb128(data, cursor)\n    if (!leb) return null\n    payloadSize = leb.value\n    cursor = leb.nextOffset\n  }\n\n  const payloadEnd = cursor + payloadSize\n  if (payloadEnd > data.length) return null\n  return { type, payloadOffset: cursor, payloadEnd, nextOffset: payloadEnd }\n}\n\nfunction readLeb128(data: Uint8Array, offset: number): { value: number; nextOffset: number } | null {\n  let value = 0\n  for (let i = 0; i < 8; i++) {\n    if (offset + i >= data.length) return null\n    const byte = data[offset + i]!\n    value += (byte & 0x7f) * (2 ** (i * 7))\n    if ((byte & 0x80) === 0) return { value, nextOffset: offset + i + 1 }\n  }\n  return null\n}\n\nfunction readAv1FrameHeaderKeyframe(payload: Uint8Array): boolean | undefined {\n  if (payload.length === 0) return undefined\n  const first = payload[0]!\n  const showExistingFrame = (first & 0x80) !== 0\n  if (showExistingFrame) return false\n  const frameType = (first >> 5) & 0x03\n  return frameType === 0\n}\n\nfunction startsWithAnnexB(data: Uint8Array): boolean {\n  return (\n    (data.length >= 4 && data[0] === 0 && data[1] === 0 && data[2] === 1) ||\n    (data.length >= 5 && data[0] === 0 && data[1] === 0 && data[2] === 0 && data[3] === 1)\n  )\n}\n\nfunction findAnnexBStart(data: Uint8Array, offset: number): { offset: number; length: 3 | 4 } | null {\n  for (let i = offset; i + 3 <= data.length; i++) {\n    if (data[i] !== 0 || data[i + 1] !== 0) continue\n    if (data[i + 2] === 1) return { offset: i, length: 3 }\n    if (i + 3 < data.length && data[i + 2] === 0 && data[i + 3] === 1) {\n      return { offset: i, length: 4 }\n    }\n  }\n  return null\n}\n", "import type {\n  MFUFragment,\n  MfuReassemblerBackend,\n  PendingMfuDebug,\n  ReassembledMFU,\n  ReassemblerStats,\n} from './mfu-reassembler.js'\nimport {\n  isMfuReassemblyErrorCode,\n  MfuReassemblyError,\n} from './mfu-reassembler.js'\n\nexport interface MmtWasmFragment {\n  with_sample_identity(movieFragmentSequence: number, sampleNumber: number, offset: number): void\n  set_item_id(itemId: number): void\n  set_packet_delivery?(packetSequenceNumber: number, recovered: boolean): void\n  set_priority(priority: number): void\n  set_attribution(attribution: number): void\n  set_stream_identity(streamIdentity: number): void\n}\n\nexport interface MmtWasmReassembledMfu {\n  readonly mpu_sequence_number: number\n  readonly timestamp: number\n  readonly fragment_count: number\n  readonly rap_flag: boolean\n  readonly priority?: number\n  readonly sample_number?: number\n  readonly movie_fragment_sequence_number?: number\n  readonly packet_sequence_numbers?: Uint32Array | number[]\n  readonly repaired_packet_sequence_numbers?: Uint32Array | number[]\n  readonly attribution?: number\n  readonly stream_identity?: number\n  readonly data: Uint8Array\n  free(): void\n}\n\nexport interface MmtWasmStats {\n  readonly total_fragments: bigint | number\n  readonly reassembled_mfus: bigint | number\n  readonly timed_out_mfus: bigint | number\n  readonly evicted_memory_limit: bigint | number\n  /**\n   * Incomplete data units released by the MMT policy's clock-free replacement\n   * at `maxBuffered` (BLO-31513). Distinct from `evicted_memory_limit`, which\n   * counts the generic engine's own memory-limit eviction.\n   *\n   * Optional: `bindings` are host-injected and `mmt-wasm` publishes\n   * independently of this package, so a host can load an artifact predating\n   * this field. Read it through `?? 0` \u2014 summing `undefined` would silently\n   * poison `evictedMemoryLimit` with `NaN` rather than degrading.\n   */\n  readonly evicted_data_units?: bigint | number\n  readonly out_of_order_fragments: bigint | number\n  readonly duplicate_fragments: bigint | number\n  free?: () => void\n}\n\nexport interface MmtWasmReassembler {\n  add_fragment(now: number, fragment: MmtWasmFragment): MmtWasmReassembledMfu | undefined\n  cleanup_timeouts(now: number): void\n  set_timeout(timeoutMs: number): void\n  set_clock_free(): void\n  next_timeout_at(): number | undefined\n  flush(): void\n  reset_stream(streamIdentity: number): void\n  reset(): void\n  stats(): MmtWasmStats\n  readonly buffered_count: number\n  readonly pending_fragment_count: number\n}\n\nexport interface MmtWasmBindings {\n  MfuFragmentJs: new (\n    mpuSequenceNumber: number,\n    fragmentationIndicator: number,\n    fragmentCounter: number,\n    data: Uint8Array,\n    timestamp: number,\n    rapFlag: boolean,\n  ) => MmtWasmFragment\n  MmtReassembler: {\n    new (timeoutMs: number, maxBuffered: number): MmtWasmReassembler\n    clock_free(maxBuffered: number): MmtWasmReassembler\n  }\n}\n\nexport interface WasmMfuReassemblerOptions {\n  bindings: MmtWasmBindings\n  timeoutMs: number | null\n  maxBuffered?: number\n  now?: () => number\n}\n\nfunction asNumber(value: bigint | number): number {\n  return typeof value === 'bigint' ? Number(value) : value\n}\n\nfunction timestampU32(timestamp: bigint): number {\n  return Number(BigInt.asUintN(32, timestamp))\n}\n\n/** Thin host adapter over mmt-core's Rust/WASM IFC reassembler. */\nexport class WasmMfuReassembler implements MfuReassemblerBackend {\n  readonly #bindings: MmtWasmBindings\n  readonly #core: MmtWasmReassembler\n  readonly #now: () => number\n  #timeoutMs: number | null\n  #cleanupTimer: ReturnType<typeof setTimeout> | null = null\n  #nextStreamIdentity = 1\n  #streamIdentityByKey = new Map<string, number>()\n  #streamNameByIdentity = new Map<number, string>()\n  #coreTotalFragments = 0\n  #rejectedBeforeCore = 0\n  #rejectedFragments = 0\n\n  readonly stats: ReassemblerStats = {\n    totalFragments: 0,\n    reassembledMFUs: 0,\n    rejectedFragments: 0,\n    timedOutMFUs: 0,\n    evictedMemoryLimit: 0,\n    outOfOrderFragments: 0,\n  }\n\n  onDeferredAssembly?: (result: ReassembledMFU) => void\n\n  constructor(options: WasmMfuReassemblerOptions) {\n    const maxBuffered = options.maxBuffered ?? 100\n    if (!Number.isInteger(maxBuffered) || maxBuffered <= 0) {\n      throw new Error('[WasmMfuReassembler] maxBuffered must be a positive integer')\n    }\n    this.#bindings = options.bindings\n    this.#timeoutMs = options.timeoutMs\n    this.#now = options.now ?? (() => globalThis.performance?.now() ?? Date.now())\n    this.#core =\n      options.timeoutMs === null\n        ? options.bindings.MmtReassembler.clock_free(maxBuffered)\n        : new options.bindings.MmtReassembler(options.timeoutMs, maxBuffered)\n  }\n\n  get timeoutMs(): number | null {\n    return this.#timeoutMs\n  }\n\n  set timeoutMs(timeoutMs: number | null) {\n    if (timeoutMs !== null && (!Number.isFinite(timeoutMs) || timeoutMs <= 0)) {\n      throw new Error('[WasmMfuReassembler] timeoutMs must be a finite number > 0')\n    }\n    this.#timeoutMs = timeoutMs\n    if (timeoutMs === null) this.#core.set_clock_free()\n    else this.#core.set_timeout(Math.ceil(timeoutMs))\n    this.#scheduleCleanup()\n  }\n\n  addFragment(fragment: MFUFragment): ReassembledMFU | null {\n    const wasmFragment = new this.#bindings.MfuFragmentJs(\n      fragment.mpuSequenceNumber,\n      fragment.fragmentationIndicator,\n      fragment.fragmentCounter,\n      fragment.data,\n      timestampU32(fragment.timestamp),\n      fragment.rapFlag,\n    )\n    if (\n      fragment.movieFragmentSequenceNumber !== undefined &&\n      fragment.sampleNumber !== undefined &&\n      fragment.sampleNumber > 0 &&\n      fragment.sampleOffset !== undefined\n    ) {\n      wasmFragment.with_sample_identity(\n        fragment.movieFragmentSequenceNumber,\n        fragment.sampleNumber,\n        fragment.sampleOffset,\n      )\n    }\n    if (fragment.itemId !== undefined) wasmFragment.set_item_id(fragment.itemId)\n    if (fragment.packetSequenceNumber !== undefined) {\n      wasmFragment.set_packet_delivery?.(\n        fragment.packetSequenceNumber,\n        fragment.recovered === true,\n      )\n    }\n    if (fragment.priority !== undefined) wasmFragment.set_priority(fragment.priority)\n    if (fragment.source !== undefined) {\n      wasmFragment.set_attribution(fragment.source === 'multicast' ? 1 : 2)\n    }\n    const streamIdentity = this.#streamIdentityFor(fragment)\n    if (streamIdentity !== undefined) {\n      wasmFragment.set_stream_identity(streamIdentity)\n    }\n\n    let output: MmtWasmReassembledMfu | undefined\n    const coreTotalBefore = this.#coreTotalFragments\n    try {\n      output = this.#core.add_fragment(this.#now(), wasmFragment)\n    } catch (error) {\n      const rejection = this.#asReassemblyError(error)\n      if (rejection === null) throw error\n      this.#refreshStats()\n      if (this.#coreTotalFragments === coreTotalBefore) this.#rejectedBeforeCore++\n      this.#rejectedFragments++\n      this.stats.totalFragments = this.#coreTotalFragments + this.#rejectedBeforeCore\n      this.stats.rejectedFragments = this.#rejectedFragments\n      this.#scheduleCleanup()\n      throw rejection\n    }\n    this.#refreshStats()\n    this.#scheduleCleanup()\n    if (!output) return null\n\n    try {\n      const catalogTrackName = output.stream_identity === undefined\n        ? undefined\n        : this.#streamNameByIdentity.get(output.stream_identity)\n      const packetSequenceNumbers = output.packet_sequence_numbers === undefined\n        ? undefined\n        : Array.from(output.packet_sequence_numbers)\n      const repairedPacketSequenceNumbers =\n        output.repaired_packet_sequence_numbers === undefined\n          ? undefined\n          : Array.from(output.repaired_packet_sequence_numbers)\n      return {\n        mpuSequenceNumber: output.mpu_sequence_number,\n        ...(packetSequenceNumbers?.[0] === undefined\n          ? {}\n          : { packetSequenceNumber: packetSequenceNumbers[0] }),\n        ...(packetSequenceNumbers === undefined ? {} : { packetSequenceNumbers }),\n        ...(repairedPacketSequenceNumbers === undefined\n          ? {}\n          : { repairedPacketSequenceNumbers }),\n        data: output.data,\n        timestamp: BigInt(output.timestamp),\n        fragmentCount: output.fragment_count,\n        rapFlag: output.rap_flag,\n        ...(output.priority === undefined ? {} : { priority: output.priority }),\n        ...(output.sample_number === undefined ? {} : { sampleNumber: output.sample_number }),\n        ...(output.movie_fragment_sequence_number === undefined\n          ? {}\n          : {\n              movieFragmentSequenceNumber: output.movie_fragment_sequence_number,\n            }),\n        ...(output.attribution === 1\n          ? { source: 'multicast' as const }\n          : output.attribution === 2\n            ? { source: 'moq' as const }\n            : {}),\n        // The Rust core folds `attribution` over every contributing fragment\n        // and reports None unless they were unanimous, so a tag here is\n        // already whole-frame evidence. A missing tag means \"not unanimous or\n        // never recorded\" \u2014 both unproven, never multicast.\n        deliveryProvenance:\n          output.attribution === 1\n            ? 'multicast'\n            : output.attribution === 2\n              ? 'mixed'\n              : 'unknown',\n        ...(catalogTrackName === undefined ? {} : { catalogTrackName }),\n      }\n    } finally {\n      output.free()\n    }\n  }\n\n  flush(): void {\n    this.#clearCleanupTimer()\n    this.#core.flush()\n  }\n\n  resetStream(catalogTrackName: string): void {\n    const streamIdentity = this.#streamIdentityByKey.get(`catalog:${catalogTrackName}`)\n    if (streamIdentity === undefined) return\n    this.#clearCleanupTimer()\n    this.#core.reset_stream(streamIdentity)\n    this.#refreshStats()\n    this.#scheduleCleanup()\n  }\n\n  reset(): void {\n    this.#clearCleanupTimer()\n    this.#core.reset()\n    this.#nextStreamIdentity = 1\n    this.#streamIdentityByKey.clear()\n    this.#streamNameByIdentity.clear()\n    this.#coreTotalFragments = 0\n    this.#rejectedBeforeCore = 0\n    this.#rejectedFragments = 0\n    this.#refreshStats()\n  }\n\n  get pendingCount(): number {\n    return this.#core.buffered_count\n  }\n\n  getStatus(): {\n    bufferedMFUs: number\n    pendingFragments: number\n    pendingSamples: PendingMfuDebug[]\n    stats: ReassemblerStats\n  } {\n    this.#refreshStats()\n    return {\n      bufferedMFUs: this.#core.buffered_count,\n      pendingFragments: this.#core.pending_fragment_count,\n      // Detailed fragment coordinates remain internal to the Rust core. Counts\n      // and health statistics stay available to MmtpRouter diagnostics.\n      pendingSamples: [],\n      stats: { ...this.stats },\n    }\n  }\n\n  #refreshStats(): void {\n    const stats = this.#core.stats()\n    this.#coreTotalFragments = asNumber(stats.total_fragments)\n    this.stats.totalFragments = this.#coreTotalFragments + this.#rejectedBeforeCore\n    this.stats.reassembledMFUs = asNumber(stats.reassembled_mfus)\n    this.stats.rejectedFragments = this.#rejectedFragments\n    this.stats.timedOutMFUs = asNumber(stats.timed_out_mfus)\n    // `evictedMemoryLimit` is documented as every incomplete MFU discarded to\n    // enforce the memory bound, and the pure-TypeScript engine counts its\n    // clock-free evictions there. The Rust core splits the same concept across\n    // two counters, so both are summed here \u2014 otherwise the identical stat\n    // would mean different things depending on which engine a host loaded.\n    this.stats.evictedMemoryLimit =\n      asNumber(stats.evicted_memory_limit) + asNumber(stats.evicted_data_units ?? 0)\n    this.stats.outOfOrderFragments = asNumber(stats.out_of_order_fragments)\n    stats.free?.()\n  }\n\n  #streamIdentityFor(fragment: MFUFragment): number | undefined {\n    const key = fragment.catalogTrackName !== undefined\n      ? `catalog:${fragment.catalogTrackName}`\n      : fragment.packetId !== undefined\n        ? `packet:${fragment.packetId}`\n        : undefined\n    if (key === undefined) return undefined\n    const existing = this.#streamIdentityByKey.get(key)\n    if (existing !== undefined) return existing\n    const identity = this.#nextStreamIdentity++\n    this.#streamIdentityByKey.set(key, identity)\n    if (fragment.catalogTrackName !== undefined) {\n      this.#streamNameByIdentity.set(identity, fragment.catalogTrackName)\n    }\n    return identity\n  }\n\n  #asReassemblyError(error: unknown): MfuReassemblyError | null {\n    if ((typeof error !== 'object' && typeof error !== 'function') || error === null) return null\n    const code = Reflect.get(error, 'code')\n    if (!isMfuReassemblyErrorCode(code)) return null\n    const message = Reflect.get(error, 'message')\n    return new MfuReassemblyError(\n      code,\n      typeof message === 'string' ? message : `MFU reassembly rejected: ${code}`,\n    )\n  }\n\n  #scheduleCleanup(): void {\n    this.#clearCleanupTimer()\n    if (this.#timeoutMs === null) return\n    const next = this.#core.next_timeout_at()\n    if (next === undefined) return\n    const delay = Math.max(0, Math.ceil(next - this.#now()))\n    this.#cleanupTimer = setTimeout(() => {\n      this.#cleanupTimer = null\n      this.#core.cleanup_timeouts(this.#now())\n      this.#refreshStats()\n      this.#scheduleCleanup()\n    }, delay)\n  }\n\n  #clearCleanupTimer(): void {\n    if (this.#cleanupTimer === null) return\n    clearTimeout(this.#cleanupTimer)\n    this.#cleanupTimer = null\n  }\n}\n\nexport function resolveGlobalMmtWasmBindings(): MmtWasmBindings {\n  const globals = globalThis as typeof globalThis & {\n    __blockcastMmtReassemblerWasmBindgen?: MmtWasmBindings\n    __MmtWasmBindings?: MmtWasmBindings\n  }\n  const bindings = globals.__MmtWasmBindings ?? globals.__blockcastMmtReassemblerWasmBindgen\n  if (!bindings?.MmtReassembler || !bindings.MfuFragmentJs) {\n    throw new Error('[WasmMfuReassembler] initialized mmt-wasm bindings are unavailable')\n  }\n  return bindings\n}\n", "import { MmtpContainerParser, type MmtpParserConfig } from './mmtp-container-parser.js'\nimport { WasmMfuReassembler, resolveGlobalMmtWasmBindings, type MmtWasmBindings } from './wasm-mfu-reassembler.js'\nimport { mfuReassemblyTimeoutMs, type MfuReassemblyPolicy } from './mfu-reassembly-policy.js'\n\nexport type WasmMmtpParserConfig = Omit<MmtpParserConfig, 'mfuTimeoutMs' | 'reassembler' | 'reassemblyPolicy'> & {\n  reassemblyPolicy: MfuReassemblyPolicy\n  wasmBindings?: MmtWasmBindings\n}\n\n/** Construct the common MMTP parser over the shared Rust/WASM IFC core. */\nexport function createWasmMmtpContainerParser(config: WasmMmtpParserConfig): MmtpContainerParser {\n  const timeoutMs = mfuReassemblyTimeoutMs(config.reassemblyPolicy)\n  const reassembler = new WasmMfuReassembler({\n    bindings: config.wasmBindings ?? resolveGlobalMmtWasmBindings(),\n    timeoutMs,\n    ...(config.maxBufferedMfus === undefined ? {} : { maxBuffered: config.maxBufferedMfus }),\n  })\n  return new MmtpContainerParser({\n    ...config,\n    reassemblyPolicy: config.reassemblyPolicy,\n    reassembler,\n  })\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAgBA,IAAM,mBAAmB;AACzB,IAAM,kBAAkB;AACxB,IAAM,wBAAwB;AAC9B,IAAM,4BAA4B,kBAAkB;AACpD,IAAM,2BAA2B;AACjC,IAAM,8BAA8B;AACpC,IAAM,kBAAkB;AAYjB,IAAM,0BAA0B;AAGhC,IAAM,+BAA+B;AAmCtC,SAAU,mBACd,YACA,SAAiC;AAEjC,MAAI,WAAW,SAAS,mBAAmB;AAAiB,WAAO;AAEnE,QAAM,aAAa,WAAW,CAAC,IAAK;AACpC,MAAI,eAAe;AAAiB,WAAO;AAE3C,QAAM,UAAW,WAAW,CAAC,KAAM,IAAK;AACxC,MAAI,eAAe;AACnB,MAAI,UAAU,MAAM,WAAW,CAAC,IAAK,QAAU;AAAG,oBAAgB;AAClE,MAAI,UAAU,MAAM,WAAW,CAAC,IAAK,OAAU,GAAG;AAChD,QAAI,eAAe,IAAI,WAAW;AAAQ,aAAO;AACjD,UAAM,kBAAkB,IAAI,SAC1B,WAAW,QACX,WAAW,aAAa,eAAe,GACvC,CAAC,EACD,UAAU,GAAG,KAAK;AACpB,oBAAgB,IAAI;EACtB;AACA,MAAI,eAAe,kBAAkB,WAAW;AAAQ,WAAO;AAE/D,QAAM,UAAU,WAAW,SAAS,YAAY;AAKhD,QAAM,gBAAiB,QAAQ,CAAC,KAAM,IAAK,QAAQ,CAAC;AACpD,QAAM,YAAY,QAAQ,CAAC;AAC3B,QAAM,eAAgB,aAAa,IAAK;AACxC,QAAM,SAAU,aAAa,IAAK,OAAU;AAC5C,QAAM,yBAA0B,aAAa,IAAK;AAGlD,MAAI,iBAAiB;AAAG,WAAO;AAK/B,QAAM,qBAAqB,0BAA0B,IAChD,QAAQ,2BAA2B,8BACpC;AACJ,MAAI,iBAAiB,4BAA4B;AAAoB,WAAO;AAE5E,MAAI,UAAU;AAAG,WAAO;AACxB,QAAM,WAAW,CAAC,SAAS,aAAa,YAAY;AACpD,QAAM,aAAa,WAAW,QAAQ,SAAS,IAAI,QAAQ;AAC3D,QAAM,cAAc,wBAAwB;AAC5C,MAAI,cAAc;AAAY,WAAO;AAErC,MAAI,cAAc,+BAA+B;AAAY,WAAO;AACpE,QAAM,UAAW,QAAQ,WAAW,KAAM,IAAK,QAAQ,cAAc,CAAC;AACtE,MAAI,YAAY;AAAyB,WAAO;AAChD,QAAM,SAAU,QAAQ,cAAc,CAAC,KAAM,IAAK,QAAQ,cAAc,CAAC;AAEzE,QAAM,YAAY,cAAc;AAChC,MAAI,YAAY,WAAW;AAAY,WAAO;AAE9C,SAAO;IACL,MAAM,QAAQ,SAAS,WAAW,UAAU;IAC5C,WAAW,eAAe;;AAE9B;;;AC3DO,IAAMA,oBAAmB;AACzB,IAAMC,mBAAkB;AACxB,IAAM,2BAA2B;AACjC,IAAM,8BAA8B;AAE3C,IAAMC,yBAAwB;AAC9B,IAAMC,6BAA4BF,mBAAkBC;AACpD,IAAM,6BAA6B;AAG5B,IAAME,mBAAkB;AAExB,IAAM,qBAAqB;AAY5B,SAAU,gBAAgB,QAAkB;AAChD,MAAI,OAAO,SAASC,mBAAkB;AACpC,UAAM,IAAI,MAAM,0BAA0B,OAAO,MAAM,QAAQ;EACjE;AAEA,QAAMC,QAAO,IAAI,SAAS,OAAO,QAAQ,OAAO,YAAY,OAAO,UAAU;AAE7E,QAAM,UAAW,OAAO,CAAC,KAAM,IAAK;AACpC,MAAI,YAAY,GAAG;AACjB,UAAM,IAAI,MAAM,6BAA6B,OAAO,EAAE;EACxD;AAGA,QAAM,UAAW,OAAO,CAAC,KAAM,IAAK;AACpC,QAAM,qBAAqB,OAAO,CAAC,IAAK,QAAU;AAClD,QAAM,iBAAiB,OAAO,CAAC,IAAK,OAAU;AAG9C,QAAM,WAAW,OAAO,CAAC,IAAK,OAAU;AAIxC,QAAM,aAAa,OAAO,CAAC,IAAK;AAEhC,MAAI,SAAS;AAGb,QAAM,WAAWA,MAAK,UAAU,QAAQ,KAAK;AAC7C,YAAU;AAGV,QAAM,YAAY,OAAOA,MAAK,UAAU,QAAQ,KAAK,CAAC;AACtD,YAAU;AAGV,QAAM,iBAAiBA,MAAK,UAAU,QAAQ,KAAK;AACnD,YAAU;AAEV,MAAI;AACJ,MAAI,mBAAmB;AACrB,QAAI,SAAS,IAAI,OAAO;AAAQ,YAAM,IAAI,MAAM,yCAAyC;AACzF,oBAAgBA,MAAK,UAAU,QAAQ,KAAK;AAC5C,cAAU;EACZ;AAEA,MAAI;AACJ,MAAI,eAAe;AACjB,QAAI,SAAS,IAAI,OAAO;AAAQ,YAAM,IAAI,MAAM,2CAA2C;AAC3F,UAAM,OAAOA,MAAK,UAAU,QAAQ,KAAK;AACzC,UAAM,SAASA,MAAK,UAAU,SAAS,GAAG,KAAK;AAC/C,cAAU;AACV,QAAI,SAAS,SAAS,OAAO;AAAQ,YAAM,IAAI,MAAM,iDAAiD;AACtG,gBAAY,EAAE,MAAM,MAAM,OAAO,SAAS,QAAQ,SAAS,MAAM,EAAC;AAClE,cAAU;EACZ;AAEA,SAAO;IACL;IACA;IACA;IACA;IACA;IACA,eAAe,OAAO,SAAS;IAC/B;IACA;IACA;IACA;IACA;IACA,cAAc;IACd;;AAEJ;AAsBM,SAAU,eAAe,SAAmB;AAChD,MAAI,QAAQ,SAASC,kBAAiB;AACpC,UAAM,IAAI,MAAM,qCAAqC,QAAQ,MAAM,QAAQ;EAC7E;AAEA,QAAMC,QAAO,IAAI,SAAS,QAAQ,QAAQ,QAAQ,YAAY,QAAQ,UAAU;AAGhF,QAAM,gBAAgBA,MAAK,UAAU,GAAG,KAAK;AAG7C,QAAM,YAAY,QAAQ,CAAC;AAC3B,QAAM,YAAa,aAAa,IAAK;AACrC,QAAM,yBAA0B,aAAa,IAAK;AAClD,QAAM,mBAAmB,YAAY,OAAU;AAI/C,QAAM,kBAAkB,QAAQ,CAAC;AAGjC,QAAM,oBAAoBA,MAAK,UAAU,GAAG,KAAK;AAEjD,SAAO;IACL;IACA;IACA;IACA;IACA;IACA;;AAEJ;AAEM,SAAU,sBAAsB,SAAqB,QAAc;AACvE,MAAI,SAAS,KAAK,SAAS,2BAA2B,QAAQ;AAAQ,WAAO;AAC7E,QAAMA,QAAO,IAAI,SAAS,QAAQ,QAAQ,QAAQ,aAAa,QAAQ,wBAAwB;AAC/F,SAAO;IACL,6BAA6BA,MAAK,UAAU,GAAG,KAAK;IACpD,cAAcA,MAAK,UAAU,GAAG,KAAK;IACrC,QAAQA,MAAK,UAAU,GAAG,KAAK;IAC/B,UAAU,QAAQ,SAAS,EAAE;IAC7B,mBAAmB,QAAQ,SAAS,EAAE;;AAE1C;AAgCA,SAAS,wBACP,KACA,cACA,SAAmB;AAEnB,MAAI,IAAI,gBAAgBC,4BAA2B;AACjD,WAAO;MACL,WAAW;QACT,MAAM;QACN,QAAQ,kBAAkB,IAAI,aAAa,MAAMA,0BAAyB;;;EAGhF;AAIA,QAAM,cAAcC,yBAAwB,IAAI;AAChD,MAAI,cAAc,QAAQ,QAAQ;AAChC,WAAO;MACL,WAAW;QACT,MAAM;QACN,QACE,kBAAkB,IAAI,aAAa,gBAAgB,WAAW,gBAChD,QAAQ,MAAM;;;EAGpC;AAEA,QAAM,YAAY,iBAAiB,KAAK,IAAI,0BAA0B;AACtE,QAAM,gBAAgB,IAAI,YAAY,2BAA2B;AACjE,QAAM,YAAYH,oBAAmB,YAAY,gBAAgB;AACjE,MAAI,aAAa,aAAa;AAC5B,WAAO;MACL,WAAW;QACT,MAAM;QACN,QAAQ,aAAa,SAAS,mBAAmB,WAAW;;;EAGlE;AAEA,SAAO;IACL,QAAQ;MACN,gBAAgB;MAChB;MACA,SAAS;;;AAGf;AAEA,SAAS,0BAA0B,SAAqB,OAAe,KAAW;AAChF,MAAI,UAAU;AAAK,WAAO;AAC1B,MAAI,QAAQ,KAAK,MAAM,QAAQ,UAAU,QAAQ,+BAAqC,KAAK;AACzF,WAAO;EACT;AAEA,QAAMC,QAAO,IAAI,SACf,QAAQ,QACR,QAAQ,aAAa,OACrB,MAAM,KAAK;AAEb,MAAIA,MAAK,UAAU,GAAG,KAAK,MAAM;AAA+B,WAAO;AAEvE,QAAM,aAAaA,MAAK,UAAU,GAAG,KAAK;AAC1C,SAAO,QAAQ,+BAAqC,eAAe;AACrE;AAMA,SAAS,wBACP,SACA,aACA,SACA,SAAiC;AAEjC,MAAI,cAAc,QAAQ;AAAQ,WAAO;AAEzC,MAAI,SAAS,WAAW;AACtB,WAAO,0BAA0B,SAAS,aAAa,QAAQ,MAAM,IACjE,EAAE,UAAU,MAAK,IACjB;EACN;AAEA,MAAI,YAAY,GAAG;AACjB,UAAM,WAAW,QAAQ,SAAS;AAClC,QAAI,WAAW,eAAe,CAAC,0BAA0B,SAAS,aAAa,QAAQ,GAAG;AACxF,aAAO;IACT;AACA,WAAO,EAAE,UAAU,KAAI;EACzB;AACA,MAAI,YAAY;AAAG,WAAO;AAE1B,MAAI,0BAA0B,SAAS,aAAa,QAAQ,MAAM,GAAG;AACnE,WAAO,EAAE,UAAU,MAAK;EAC1B;AAEA,SAAO;AACT;AAkEA,SAAS,kBACP,YACA,SAAiC;AAEjC,MAAI,WAAW,SAASG,oBAAmBC,kBAAiB;AAC1D,WAAO;MACL,WAAW;QACT,MAAM;QACN,QAAQ,GAAG,WAAW,MAAM,YAAYD,oBAAmBC,gBAAe;;;EAGhF;AAEA,MAAI;AACJ,MAAI;AACF,aAAS,gBAAgB,UAAU;EACrC,SAAS,OAAO;AACd,WAAO;MACL,WAAW;QACT,MAAM;QACN,QAAQ,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;;;EAGnE;AACA,MAAI,OAAO,eAAeC,kBAAiB;AACzC,WAAO;MACL,WAAW;QACT,MAAM;QACN,QAAQ,gBAAgB,OAAO,WAAW,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;;;EAG7E;AAEA,QAAM,UAAU,WAAW,SAAS,OAAO,YAAY;AACvD,MAAI,QAAQ,SAASD,kBAAiB;AACpC,WAAO;MACL,WAAW;QACT,MAAM;QACN,QAAQ,GAAG,QAAQ,MAAM,YAAYA,gBAAe;;;EAG1D;AAEA,QAAM,MAAM,eAAe,OAAO;AAClC,MAAI,IAAI,iBAAiB;AACvB,WAAO;MACL,WAAW,EAAE,MAAM,wBAAwB,QAAQ,8BAA6B;;EAEpF;AAGA,QAAM,eAAgB,QAAQ,CAAC,KAAM,IAAK;AAE1C,QAAM,eAAe,wBAAwB,KAAK,cAAc,OAAO;AACvE,MAAI,eAAe;AAAc,WAAO;AACxC,QAAM,EAAE,OAAM,IAAK;AAEnB,QAAM,gBAAgB,wBACpB,SACA,OAAO,SACP,OAAO,SACP,OAAO;AAET,MAAI,CAAC,eAAe;AAIlB,QAAI,CAAC,SAAS,aAAa,OAAO,YAAY,GAAG;AAC/C,YAAM,WAAW,QAAQ,SAAS,OAAO;AACzC,UAAI,aAAa,4BAA4B;AAC3C,eAAO;UACL,WAAW;YACT,MAAM;YACN,QACE,oBAAoB,QAAQ,mEACO,0BAA0B,aACjD,QAAQ,MAAM,iBAAiB,OAAO,OAAO;;;MAGjE;IACF;AACA,WAAO;MACL,WAAW;QACT,MAAM;QACN,QACE,kBAAkB,OAAO,OAAO,KAAK,QAAQ,MAAM,0DACb,OAAO,OAAO;;;EAG5D;AAEA,SAAO,EAAE,MAAM,EAAE,QAAQ,SAAS,KAAK,cAAc,QAAQ,cAAa,EAAE;AAC9E;AAoBM,SAAU,kBACd,YACA,SAAiC;AAEjC,QAAM,SAAS,kBAAkB,YAAY,OAAO;AACpD,MAAI,eAAe;AAAQ,WAAO;AAClC,QAAM,EAAE,QAAQ,SAAS,KAAK,cAAc,QAAQ,cAAa,IAAK,OAAO;AAE7E,QAAM,qBAAqB,OAAO;AAClC,QAAM,YAAY,OAAO;AACzB,QAAM,UAAU,OAAO;AAEvB,QAAM,cACJ,sBAAsB,IAAI,cAAc,IACpC,sBAAsB,SAASE,gBAAe,IAC9C;AACN,QAAM,SACJ,sBAAsB,IAAI,cAAc,IACpC,IAAI,SAAS,QAAQ,QAAQ,QAAQ,aAAaA,kBAAiB,CAAC,EAAE,UAAU,GAAG,KAAK,IACxF;AAEN,QAAM,OAAO,QAAQ,SAAS,WAAW,OAAO;AAEhD,QAAM,eAAe,cAAc,WAC/B;IACE,MAAM,IAAI,SACR,WAAW,QACX,WAAW,aAAa,WAAW,SAAS,4BAC5C,0BAA0B,EAC1B,UAAU,GAAG,KAAK;MAEtB;AAEJ,SAAO,EAAE,QAAQ,KAAK,cAAc,MAAM,aAAa,QAAQ,aAAY;AAC7E;AAkCM,SAAU,oBAAoB,YAAsB;AACxD,MAAI,CAAC,sBAAsB,UAAU;AAAG,WAAO;AAE/C,QAAM,MAAM,WAAW,SAAS;AAChC,QAAMC,QAAO,IAAI,SACf,WAAW,QACX,WAAW,aAAa,KACxB,0BAA0B;AAE5B,SAAO,EAAE,MAAMA,MAAK,UAAU,GAAG,KAAK,EAAC;AACzC;AAMM,SAAU,sBAAsB,YAAsB;AAC1D,MAAI,WAAW,SAASC,oBAAmBC;AAAiB,WAAO;AAEnE,MAAI;AACJ,MAAI;AACF,aAAS,gBAAgB,UAAU;EACrC,QAAQ;AACN,WAAO;EACT;AACA,MAAI,OAAO,eAAeC;AAAiB,WAAO;AAElD,QAAM,UAAU,WAAW,SAAS,OAAO,YAAY;AACvD,MAAI,QAAQ,SAASD;AAAiB,WAAO;AAC7C,QAAM,MAAM,eAAe,OAAO;AAClC,MAAI,IAAI,gBAAgBE;AAA2B,WAAO;AAC1D,QAAM,cAAcC,yBAAwB,IAAI;AAChD,SAAO,wBAAwB,SAAS,aAAa,OAAO,OAAO,GAAG,YAAY;AACpF;AAgBO,IAAMC,sBAAqB;;;AC7kBlC,SAAS,mBAAmB,UAGD;AACzB,MAAI,SAAS,uBAAuB,OAAW,QAAO,SAAS;AAC/D,MAAI,SAAS,WAAW,MAAO,QAAO;AACtC,MAAI,SAAS,WAAW,YAAa,QAAO;AAC5C,SAAO;AACT;AAGO,SAAS,qBACd,WAIwB;AACxB,MAAI,UAAU,WAAW,EAAG,QAAO;AACnC,MAAI,UAAkC;AACtC,aAAW,YAAY,WAAW;AAChC,UAAM,MAAM,mBAAmB,QAAQ;AACvC,cACE,YAAY,WAAW,QAAQ,UAC3B,UACA,YAAY,aAAa,QAAQ,YAC/B,YACA;AAAA,EACV;AACA,SAAO;AACT;AAiGO,IAAM,6BAA6B;AAAA,EACxC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAIA,IAAM,0BAA0B,IAAI,IAAY,0BAA0B;AAEnE,SAAS,yBAAyB,OAAiD;AACxF,SAAO,OAAO,UAAU,YAAY,wBAAwB,IAAI,KAAK;AACvE;AAEO,IAAM,qBAAN,cAAiC,MAAM;AAAA,EAG5C,YACW,MACT,SACA;AACA,UAAM,OAAO;AAHJ;AAHX,SAAS,OAAO;AAAA,EAOhB;AACF;AAaO,SAAS,qBAAqB,OAA6C;AAChF,MAAI,iBAAiB,mBAAoB,QAAO;AAChD,MAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AACxD,SACE,QAAQ,IAAI,OAAO,MAAM,MAAM,wBAC/B,yBAAyB,QAAQ,IAAI,OAAO,MAAM,CAAC;AAEvD;AAEA,SAAS,yBAAyB,WAGhC;AACA,QAAM,wBAAkC,CAAC;AACzC,QAAM,gCAA0C,CAAC;AACjD,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,YAAY,WAAW;AAChC,UAAM,WAAW,SAAS;AAC1B,QAAI,OAAO,aAAa,YAAY,CAAC,OAAO,cAAc,QAAQ,KAAK,WAAW,KAAK,WAAW,YAAY;AAC5G,aAAO,CAAC;AAAA,IACV;AACA,QAAI,CAAC,KAAK,IAAI,QAAQ,GAAG;AACvB,WAAK,IAAI,QAAQ;AACjB,4BAAsB,KAAK,QAAQ;AAAA,IACrC;AACA,QAAI,SAAS,cAAc,QAAQ,CAAC,SAAS,IAAI,QAAQ,GAAG;AAC1D,eAAS,IAAI,QAAQ;AACrB,oCAA8B,KAAK,QAAQ;AAAA,IAC7C;AAAA,EACF;AACA,SAAO,EAAE,uBAAuB,8BAA8B;AAChE;AAkEA,SAAS,YAAY,UAAkF;AACrG,MAAI,SAAS,qBAAqB,OAAW,QAAO,CAAC,WAAW,SAAS,gBAAgB;AACzF,MAAI,SAAS,aAAa,OAAW,QAAO,CAAC,UAAU,SAAS,QAAQ;AACxE,SAAO,CAAC,eAAe,IAAI;AAC7B;AAEA,SAAS,MAAM,OAAiC;AAC9C,SAAO,OAAO,UAAU,YAAY,OAAO,UAAU,KAAK,KAAK,SAAS,KAAK,SAAS;AACxF;AAYA,SAAS,gBAAgB,UAAuB,sBAAsC;AACpF,SAAO,KAAK,UAAU;AAAA,IACpB,GAAG,YAAY,QAAQ;AAAA,IACvB,SAAS;AAAA,IACR,uBAAuB,SAAS,oBAAqB;AAAA,EACxD,CAAC;AACH;AAEA,SAAS,0BAA0B,UAAgC;AACjE,SACE,SAAS,gCAAgC,UACzC,SAAS,iBAAiB,UAC1B,SAAS,iBAAiB;AAE9B;AAKA,SAAS,kBAAkB,UAA6D;AACtF,SACE,MAAM,SAAS,2BAA2B,KAC1C,SAAS,8BAA8B,KACvC,MAAM,SAAS,YAAY,KAC3B,SAAS,eAAe,KACxB,MAAM,SAAS,YAAY;AAE/B;AAEA,SAAS,uBAAuB,UAAgC;AAC9D,QAAM,EAAE,wBAAwB,IAAI,iBAAiB,QAAQ,IAAI;AACjE,MAAI,CAAC,OAAO,UAAU,EAAE,KAAK,KAAK,KAAK,KAAK,EAAG,QAAO;AACtD,MAAI,CAAC,OAAO,UAAU,OAAO,KAAK,UAAU,KAAK,UAAU,IAAM,QAAO;AACxE,SAAO,OAAO,KAAK,OAAO,IAAI,YAAY,IAAI,UAAU;AAC1D;AAEA,SAAS,qBAAqB,UAA+B;AAC3D,SAAO,MAAO,SAAS;AACzB;AAEA,SAAS,UAAU,UAA+B;AAChD,QAAM,QAAQ,YAAY,QAAQ;AAClC,MAAI,SAAS,WAAW,QAAW;AACjC,WAAO,KAAK,UAAU,CAAC,GAAG,OAAO,SAAS,mBAAmB,QAAQ,SAAS,MAAM,CAAC;AAAA,EACvF;AACA,MAAI,kBAAkB,QAAQ,GAAG;AAC/B,WAAO,KAAK,UAAU;AAAA,MACpB,GAAG;AAAA,MACH,SAAS;AAAA,MACT;AAAA,MACA,SAAS;AAAA,MACT,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMT,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACA,SAAO,KAAK,UAAU,CAAC,GAAG,OAAO,SAAS,mBAAmB,cAAc,CAAC;AAC9E;AAEA,SAAS,eAAe,WAAmC;AACzD,SAAO,UAAU,MAAM,cAAY,kBAAkB,QAAQ,CAAC;AAChE;AA0CA,SAAS,iBAAiB,QAAgB,YAAmC;AAC3E,QAAM,MAAM,SAAS;AACrB,SAAO,OAAO,cAAc,GAAG,KAAK,OAAO,aAAa,MAAM;AAChE;AAcO,IAAM,oCAAoC;AAiG1C,SAAS,oBAAoB,YAAqB,eAAgC;AACvF,SAAO,CAAC,cAAc,gBAAgB;AACxC;AAvkBA;AAykBO,IAAM,iBAAN,MAAqB;AAAA,EAwC1B,YAAY,SAAgC;AAxCvC;AAKL;AAAA;AAAA;AAAA;AAAA,iCAAuC,oBAAI,IAAI;AAC/C,kCAA6C,oBAAI,IAAI;AACrD,yCAAgD,oBAAI,IAAI;AACxD,8CAA6D,oBAAI,IAAI;AACrE,iCAAwB,oBAAI,IAAI;AAChC;AAAA,sCAA0B,CAAC;AAU3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mCAA0B,oBAAI,IAAI;AAClC,wCAA4B,CAAC;AAC7B;AACA;AAKA;AAAA;AAAA;AAAA;AAAA,0CAAoB;AAGpB;AAAA,SAAS,QAA0B;AAAA,MACjC,gBAAgB;AAAA,MAChB,iBAAiB;AAAA,MACjB,mBAAmB;AAAA,MACnB,cAAc;AAAA,MACd,oBAAoB;AAAA,MACpB,qBAAqB;AAAA,IACvB;AAGE,QAAI,QAAQ,cAAc,SAAS,CAAC,OAAO,SAAS,QAAQ,SAAS,KAAK,QAAQ,aAAa,IAAI;AACjG,YAAM,IAAI,MAAM,mFAAmF;AAAA,IACrG;AACA,UAAM,cAAc,QAAQ,eAAe;AAC3C,QAAI,CAAC,OAAO,UAAU,WAAW,KAAK,eAAe,GAAG;AACtD,YAAM,IAAI,MAAM,yDAAyD;AAAA,IAC3E;AACA,uBAAK,YAAa,QAAQ;AAC1B,uBAAK,cAAe;AAAA,EACtB;AAAA;AAAA,EAGA,IAAI,UAAU,IAAmB;AAC/B,QAAI,OAAO,SAAS,CAAC,OAAO,SAAS,EAAE,KAAK,MAAM,IAAI;AACpD,YAAM,IAAI,MAAM,mFAAmF;AAAA,IACrG;AACA,uBAAK,YAAa;AAClB,UAAM,MAAM,KAAK,IAAI;AACrB,eAAW,CAAC,WAAW,KAAK,KAAK,mBAAK,YAAW;AAC/C,UAAI,MAAM,cAAc,OAAW,cAAa,MAAM,SAAS;AAC/D,aAAO,MAAM;AACb,UAAI,OAAO,MAAM;AACf,cAAM,YAAY,WAAW,MAAM,sBAAK,yCAAL,WAAgB,YAAY,KAAK,IAAI,GAAG,MAAM,YAAY,KAAK,GAAG,CAAC;AAAA,MACxG;AAAA,IACF;AAKA,eAAW,WAAW,mBAAK,uBAAsB,KAAK,GAAG;AACvD,4BAAK,mDAAL,WAA0B;AAC1B,4BAAK,yDAAL,WAAgC;AAAA,IAClC;AAAA,EACF;AAAA,EACA,IAAI,YAA2B;AAC7B,WAAO,mBAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,UAA8C;AACxD,SAAK,MAAM;AAEX,QAAI,CAAC,uBAAuB,QAAQ,GAAG;AACrC,4BAAK,sCAAL,WAAa,0BAA0B;AAAA,IACzC;AACA,QAAI,SAAS,WAAW,UAAa,0BAA0B,QAAQ,GAAG;AACxE,4BAAK,sCAAL,WAAa,kCAAkC;AAAA,IACjD;AAEA,UAAM,EAAE,mBAAmB,uBAAuB,IAAI;AAQtD,QAAI,2BAA2B,GAAG;AAChC,YAAM,iBAAiB,kBAAkB,QAAQ;AACjD,YAAM,kBAAkB,0BAA0B,QAAQ;AAC1D,YAAM,kBAAkB,SAAS,WAAW;AAC5C,UAAI,CAAC,kBAAkB,CAAC,iBAAiB;AACvC,8BAAK,sCAAL,WAAa,8BAA8B;AAAA,MAC7C;AACA,UAAI,mBAAmB,CAAC,gBAAgB;AACtC,8BAAK,sCAAL,WAAa,8BAA8B;AAAA,MAC7C;AACA,UAAI,mBAAmB,CAAC,MAAM,SAAS,MAAM,GAAG;AAC9C,8BAAK,sCAAL,WAAa,8BAA8B;AAAA,MAC7C;AACA,WAAK,MAAM;AACX,aAAO;AAAA,QACL;AAAA,QACA,sBAAsB,SAAS;AAAA,QAC/B,GAAG,yBAAyB,CAAC,QAAQ,CAAC;AAAA,QACtC,MAAM,SAAS;AAAA,QACf,WAAW,SAAS;AAAA,QACpB,eAAe;AAAA,QACf,SAAS,SAAS;AAAA,QAClB,UAAU,SAAS;AAAA,QACnB,cAAc,SAAS;AAAA,QACvB,6BAA6B,SAAS;AAAA,QACtC,cAAc,SAAS;AAAA,QACvB,QAAQ,SAAS;AAAA,QACjB,oBAAoB,qBAAqB,CAAC,QAAQ,CAAC;AAAA,QACnD,kBAAkB,SAAS;AAAA,MAC7B;AAAA,IACF;AAEA,UAAM,WAAW,SAAS;AAC1B,QAAI,CAAC,MAAM,QAAQ,GAAG;AACpB,4BAAK,sCAAL,WAAa,2BAA2B;AAAA,IAC1C;AACA,UAAM,UAAU,gBAAgB,UAAU,QAAQ;AAElD,QAAI,2BAA2B,GAAG;AAQhC,YAAM,OAAO,sBAAK,yCAAL,WAAgB;AAC7B,UAAI,SAAS,QAAW;AACtB,YAAI,mBAAK,YAAW,IAAI,OAAO,GAAG;AAChC,gCAAK,sCAAL,WAAa,6BAA6B;AAAA,QAC5C;AACA,8BAAK,gDAAL,WAAuB,SAAS;AAChC,eAAO;AAAA,MACT;AACA,YAAM,CAACC,SAAQ,MAAM,IAAI;AACzB,UAAI,OAAO,sBAAsB,SAAS,iBAAiB;AACzD,8BAAK,gDAAL,WAAuB,SAAS;AAChC,eAAO;AAAA,MACT;AACA,UAAI,OAAO,sBAAsB,SAAS,iBAAiB;AACzD,8BAAK,sCAAL,WAAa,6BAA6B;AAAA,MAC5C;AACA,YAAMC,UAAS,sBAAK,qDAAL,WAA4B,UAAUD,SAAQ;AAC7D,UAAIC,YAAW,KAAM,QAAOA;AAC5B,aAAO,sBAAK,yDAAL,WAAgC,SAASD;AAAA,IAClD;AAEA,UAAM,SAAS,UAAU,QAAQ;AACjC,SAAK,kBAAkB,QAAQ,KAAK,MAAM,SAAS,MAAM,MAAM,mBAAK,UAAS,IAAI,MAAM,GAAG;AAIxF,aAAO;AAAA,IACT;AACA,QAAI,mBAAK,kBAAiB,IAAI,MAAM,GAAG;AACrC,4BAAK,sCAAL,WAAa,yBAAyB;AAAA,IACxC;AAGA,QAAI,sBAAK,yCAAL,WAAgB,aAAa,QAAW;AAC1C,4BAAK,sCAAL,WAAa,yBAAyB;AAAA,IACxC;AACA,UAAM,UAAU,mBAAK,uBAAsB,IAAI,OAAO;AAGtD,QAAI,YAAY,UAAa,CAAC,GAAG,QAAQ,UAAU,KAAK,CAAC,EAAE,KAAK,aAAW,WAAW,SAAS,eAAe,GAAG;AAC/G,4BAAK,sCAAL,WACE,6BACA;AAAA,IAEJ;AAGA,UAAM,SAAS,sBAAK,qDAAL,WAA4B,UAAU,QAAQ,SAAS,SAAS;AAC/E,0BAAK,mDAAL,WAA0B;AAC1B,QAAI,WAAW,KAAM,QAAO;AAC5B,WAAO,sBAAK,yDAAL,WAAgC,SAAS;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA,EA8mBA,QAAc;AACZ,eAAW,OAAO,mBAAK,UAAS,KAAK,GAAG;AACtC,4BAAK,4CAAL,WAAmB;AAAA,IACrB;AACA,uBAAK,UAAS,MAAM;AACpB,uBAAK,WAAU,MAAM;AACrB,uBAAK,kBAAiB,MAAM;AAC5B,eAAW,WAAW,mBAAK,uBAAsB,KAAK,GAAG;AACvD,4BAAK,mDAAL,WAA0B;AAAA,IAC5B;AACA,uBAAK,uBAAsB,MAAM;AACjC,uBAAK,UAAS,MAAM;AACpB,uBAAK,eAAc,SAAS;AAC5B,uBAAK,YAAW,MAAM;AACtB,uBAAK,iBAAgB,SAAS;AAAA,EAChC;AAAA;AAAA,EAGA,YAAY,kBAAgC;AAC1C,UAAM,kBAAkB,CAAC,QAAyB;AAChD,UAAI;AACF,cAAM,UAAU,KAAK,MAAM,GAAG;AAC9B,eAAO,MAAM,QAAQ,OAAO,KAAK,QAAQ,CAAC,MAAM,aAAa,QAAQ,CAAC,MAAM;AAAA,MAC9E,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF;AACA,UAAM,YAAY,oBAAI,IAAY;AAClC,eAAW,CAAC,KAAK,SAAS,KAAK,mBAAK,WAAU;AAC5C,UAAI,UAAU,KAAK,cAAY,SAAS,qBAAqB,gBAAgB,GAAG;AAC9E,kBAAU,IAAI,GAAG;AAAA,MACnB;AAAA,IACF;AACA,eAAW,CAACE,YAAW,MAAM,KAAK,mBAAK,mBAAkB;AACvD,UAAI,OAAO,qBAAqB,kBAAkB;AAChD,kBAAU,IAAI,OAAO,SAAS;AAC9B,2BAAK,kBAAiB,OAAOA,UAAS;AAAA,MACxC;AAAA,IACF;AACA,eAAW,CAAC,SAAS,OAAO,KAAK,mBAAK,wBAAuB;AAC3D,UACE,CAAC,GAAG,QAAQ,UAAU,OAAO,CAAC,EAAE,KAAK,cAAY,SAAS,qBAAqB,gBAAgB,KAC/F,gBAAgB,OAAO;AAEvB,8BAAK,gDAAL,WAAuB;AAAA,IAC3B;AACA,eAAW,OAAO,mBAAK,WAAU;AAC/B,UAAI,gBAAgB,GAAG,EAAG,WAAU,IAAI,GAAG;AAAA,IAC7C;AACA,eAAW,OAAO,WAAW;AAC3B,4BAAK,4CAAL,WAAmB;AACnB,yBAAK,UAAS,OAAO,GAAG;AACxB,yBAAK,UAAS,OAAO,GAAG;AAAA,IAC1B;AACA,uBAAK,eAAgB,mBAAK,eAAc,OAAO,SAAO,CAAC,UAAU,IAAI,GAAG,CAAC;AACzE,eAAW,WAAW,mBAAK,aAAY;AACrC,UAAI,gBAAgB,OAAO,EAAG,oBAAK,YAAW,OAAO,OAAO;AAAA,IAC9D;AACA,uBAAK,iBAAkB,mBAAK,iBAAgB,OAAO,aAAW,mBAAK,YAAW,IAAI,OAAO,CAAC;AAAA,EAC5F;AAAA;AAAA,EAGA,QAAc;AACZ,SAAK,MAAM;AACX,SAAK,MAAM,iBAAiB;AAC5B,SAAK,MAAM,kBAAkB;AAC7B,SAAK,MAAM,oBAAoB;AAC/B,SAAK,MAAM,eAAe;AAC1B,SAAK,MAAM,qBAAqB;AAChC,SAAK,MAAM,sBAAsB;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBA,IAAI,eAAuB;AACzB,WAAO,mBAAK,UAAS,OAAO,sBAAK,sDAAL;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA,EAKA,YAKE;AACA,QAAI,mBAAmB;AACvB,eAAW,aAAa,mBAAK,UAAS,OAAO,GAAG;AAC9C,0BAAoB,UAAU;AAAA,IAChC;AACA,eAAW,WAAW,mBAAK,uBAAsB,OAAO,GAAG;AACzD,0BAAoB,QAAQ,UAAU;AAAA,IACxC;AAEA,WAAO;AAAA,MACL,cAAc,KAAK;AAAA,MACnB;AAAA,MACA,gBAAgB,sBAAK,mDAAL;AAAA,MAChB,OAAO,EAAE,GAAG,KAAK,MAAM;AAAA,IACzB;AAAA,EACF;AAuDF;AA39BE;AACA;AACA;AACA;AACA;AACA;AAUA;AACA;AACA;AACA;AAKA;AA5BK;AAuML,2BAAsB,SACpB,UACA,QACA,SACA,WACuB;AACvB,QAAM,cAAc,sBAAK,iDAAL,WAAwB,UAAU,QAAQ;AAC9D,QAAM,EAAE,WAAW,OAAO,SAAS,IAAI;AAEvC,MAAI,YAAY,mBAAK,UAAS,IAAI,SAAS;AAC3C,MAAI,OAAO;AACT,QAAI,cAAc,QAAW;AAC3B,4BAAK,sCAAL,WAAa,yBAAyB;AAAA,IACxC;AACA,gBAAY,CAAC;AACb,uBAAK,UAAS,IAAI,WAAW,SAAS;AAAA,EACxC,WAAW,cAAc,QAAW;AAClC,UAAM,IAAI,MAAM,0DAA0D;AAAA,EAC5E;AAKA,MAAI,MAAO,uBAAK,0CAAL,WAAiB,WAAW;AACvC,YAAU,KAAK,QAAQ;AAEvB,MAAI,CAAC,SAAU,QAAO;AACtB,QAAM,SAAS,sBAAK,6CAAL,WAAoB;AACnC,qBAAK,kBAAiB,OAAO,MAAM;AACnC,MAAI,WAAW,MAAM;AACnB,0BAAK,4CAAL,WAAmB;AACnB,uBAAK,UAAS,OAAO,SAAS;AAC9B,0BAAK,sCAAL,WAAa,gCAAgC;AAAA,EAC/C;AACA,wBAAK,6CAAL,WAAoB;AACpB,SAAO;AACT;AAEA,sBAAiB,SAAC,SAAiB,UAA6B;AAC9D,MAAI,UAAU,mBAAK,uBAAsB,IAAI,OAAO;AACpD,QAAM,OAAO,sBAAK,yCAAL,WAAgB;AAW7B,QAAM,iBACJ,SAAS,UAAa,oBAAoB,SAAS,QAAW,SAAS,UAAU,QAAQ,CAAC;AAC5F,MAAI,CAAC,kBAAkB,sBAAK,kDAAL,cAA8B,mBAAK,eAAc;AAOtE,QAAI,CAAC,sBAAK,0DAAL,YAAoC;AACvC,4BAAK,sCAAL,WAAa,0BAA0B;AAAA,IACzC;AAAA,EACF;AAIA,MAAI,iBAAiB;AACrB,MAAI,YAAY,QAAW;AAKzB,cAAU;AAAA,MACR,WAAW,oBAAI,IAAI;AAAA,MACnB,WAAW,KAAK,IAAI;AAAA,MACpB,cAAc,SAAS,SAAY,KAAK,CAAC,EAAE,eAAe,uBAAK,mBAAL;AAAA,IAC5D;AACA,uBAAK,uBAAsB,IAAI,SAAS,OAAO;AAC/C,qBAAiB;AAAA,EACnB,WAAW,CAAC,gBAAgB;AA8B1B,YAAQ,eAAe,uBAAK,mBAAL;AACvB,YAAQ,YAAY,KAAK,IAAI;AAC7B,0BAAK,mDAAL,WAA0B;AAC1B,qBAAiB;AAAA,EACnB;AAGA,MAAI,QAAQ,UAAU,IAAI,SAAS,eAAe,GAAG;AACnD,0BAAK,sCAAL,WAAa,6BAA6B;AAAA,EAC5C;AACA,UAAQ,UAAU,IAAI,SAAS,iBAAiB,QAAQ;AAOxD,MAAI,eAAgB,uBAAK,yDAAL,WAAgC;AACtD;AAEA,+BAA0B,SAAC,SAAiB,QAAuC;AACjF,SAAO,MAAM;AACX,UAAM,SAAS,mBAAK,kBAAiB,IAAI,MAAM;AAC/C,UAAM,UAAU,mBAAK,uBAAsB,IAAI,OAAO;AACtD,QAAI,WAAW,QAAW;AAGxB,UAAI,SAAS,UAAU,SAAS,EAAG,uBAAK,gDAAL,WAAuB;AAC1D,aAAO;AAAA,IACT;AACA,UAAM,WAAW,SAAS,UAAU,IAAI,OAAO,mBAAmB;AAClE,QAAI,aAAa,QAAW;AAC1B,UAAI,SAAS,UAAU,SAAS,EAAG,uBAAK,gDAAL,WAAuB;AAC1D,aAAO;AAAA,IACT;AACA,YAAS,UAAU,OAAO,OAAO,mBAAmB;AACpD,QAAI,QAAS,UAAU,SAAS,EAAG,uBAAK,gDAAL,WAAuB;AAC1D,UAAM,SAAS,sBAAK,qDAAL,WAA4B,UAAU,QAAQ;AAC7D,QAAI,WAAW,MAAM;AACnB,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAcA,4BAAuB,WAAW;AAChC,MAAI,QAAQ;AACZ,aAAW,CAAC,SAAS,OAAO,KAAK,mBAAK,wBAAuB;AAC3D,QAAI,oBAAoB,sBAAK,yCAAL,WAAgB,aAAa,QAAW,QAAQ,UAAU,IAAI,GAAG;AACvF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAOA,wBAAmB,WAAW;AAC5B,SAAO,mBAAK,kBAAiB,OAAO,sBAAK,sDAAL;AACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAoBA,gCAA2B,WAAY;AACrC,MAAI;AACJ,MAAI,YAAY,OAAO;AACvB,aAAW,CAAC,EAAE,MAAM,KAAK,mBAAK,mBAAkB;AAC9C,QAAI,OAAO,eAAe,WAAW;AACnC,kBAAY,OAAO;AACnB,sBAAgB,OAAO;AAAA,IACzB;AAAA,EACF;AACA,aAAW,CAAC,SAAS,OAAO,KAAK,mBAAK,wBAAuB;AAI3D,QAAI,CAAC,oBAAoB,sBAAK,yCAAL,WAAgB,aAAa,QAAW,QAAQ,UAAU,IAAI,GAAG;AACxF;AAAA,IACF;AACA,QAAI,QAAQ,eAAe,WAAW;AACpC,kBAAY,QAAQ;AACpB,sBAAgB;AAAA,IAClB;AAAA,EACF;AACA,MAAI,kBAAkB,OAAW,QAAO;AACxC,wBAAK,2CAAL,WAAkB;AAClB,OAAK,MAAM;AACX,SAAO;AACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQA,iBAAY,SAAC,SAAuB;AAClC,QAAM,OAAO,sBAAK,yCAAL,WAAgB;AAC7B,MAAI,SAAS,QAAW;AACtB,UAAM,CAAC,QAAQ,MAAM,IAAI;AACzB,uBAAK,kBAAiB,OAAO,MAAM;AACnC,0BAAK,4CAAL,WAAmB,OAAO;AAC1B,uBAAK,UAAS,OAAO,OAAO,SAAS;AAAA,EACvC;AACA,wBAAK,gDAAL,WAAuB;AACzB;AAEA,YAAO,SAAC,MAA8B,SAAwB;AAC5D,OAAK,MAAM;AACX,QAAM,IAAI,mBAAmB,MAAM,OAAO;AAC5C;AAEA,uBAAkB,SAAC,UAAuB,QAAgB,SAAsC;AAC9F,QAAM,KAAK,SAAS;AACpB,MAAI,OAAO,GAAG;AASZ,UAAM,SAAS,mBAAK,uBAAsB,IAAI,OAAO;AACrD,UAAM,qBAAqB;AAAA,MACzB,sBAAK,yCAAL,WAAgB,aAAa;AAAA,MAC7B,QAAQ,UAAU,QAAQ;AAAA,IAC5B;AASA,UAAM,iBAAiB,kBAAkB,QAAQ;AACjD,UAAM,kBAAkB,0BAA0B,QAAQ;AAC1D,UAAM,kBAAkB,SAAS,WAAW;AAC5C,QAAI,kBAAkB,iBAAiB;AACrC,4BAAK,sCAAL,WAAa,kCAAkC;AAAA,IACjD;AACA,QAAI,CAAC,kBAAkB,CAAC,iBAAiB;AACvC,4BAAK,sCAAL,WAAa,8BAA8B;AAAA,IAC7C;AACA,QAAI,mBAAmB,CAAC,gBAAgB;AACtC,4BAAK,sCAAL,WAAa,8BAA8B;AAAA,IAC7C;AACA,QAAI,mBAAmB,CAAC,MAAM,SAAS,MAAM,GAAG;AAC9C,4BAAK,sCAAL,WAAa,8BAA8B;AAAA,IAC7C;AAEA,UAAM,YAAY,UAAU,QAAQ;AACpC,QAAI,mBAAK,UAAS,IAAI,SAAS,GAAG;AAChC,4BAAK,sCAAL,WAAa,yBAAyB;AAAA,IACxC;AAEA,QAAI,YAA2B;AAC/B,QAAI,gBAAgB;AAClB,kBAAY,iBAAiB,SAAS,cAAc,SAAS,KAAK,UAAU;AAC5E,UAAI,cAAc,KAAM,uBAAK,sCAAL,WAAa,mBAAmB;AAAA,IAC1D;AAMA,QAAI,CAAC,sBAAsB,sBAAK,kDAAL,cAA8B,mBAAK,eAAc;AAC1E,UAAI,CAAC,sBAAK,0DAAL,YAAoC;AACvC,8BAAK,sCAAL,WAAa,0BAA0B;AAAA,MACzC;AAAA,IACF;AAIA,UAAM,eAAe,qBAAqB,OAAQ,eAAe,uBAAK,mBAAL;AAEjE,QAAIC;AACJ,QAAI,gBAAgB;AAClB,MAAAA,UAAS;AAAA,QACP;AAAA,QACA,MAAM;AAAA,QACN;AAAA,QACA,qBAAqB,SAAS,kBAAkB;AAAA,QAChD;AAAA,QACA,6BAA6B,SAAS;AAAA,QACtC,cAAc,SAAS;AAAA,QACvB,YAAY;AAAA,QACZ,GAAI,SAAS,qBAAqB,SAAY,CAAC,IAAI,EAAE,kBAAkB,SAAS,iBAAiB;AAAA,MACnG;AAAA,IACF,OAAO;AACL,MAAAA,UAAS;AAAA,QACP;AAAA,QACA,MAAM;AAAA,QACN;AAAA,QACA,qBAAqB,SAAS,kBAAkB;AAAA,QAChD;AAAA,QACA,QAAQ,SAAS;AAAA,QACjB,GAAI,SAAS,qBAAqB,SAAY,CAAC,IAAI,EAAE,kBAAkB,SAAS,iBAAiB;AAAA,MACnG;AAAA,IACF;AACA,uBAAK,kBAAiB,IAAI,UAAU,QAAQ,GAAGA,OAAM;AACrD,WAAO,EAAE,WAAW,OAAO,MAAM,UAAU,MAAM;AAAA,EACnD;AAEA,QAAM,SAAS,mBAAK,kBAAiB,IAAI,MAAM;AAC/C,MAAI,WAAW,QAAW;AACxB,UAAM,IAAI,MAAM,iEAAiE;AAAA,EACnF;AACA,MAAI,SAAS,oBAAoB,OAAO,qBAAqB;AAC3D,0BAAK,sCAAL,WACE,6BACA;AAAA,EAEJ;AAEA,MAAI,OAAO,SAAS,UAAU;AAC5B,QAAI,SAAS,WAAW,QAAW;AACjC,4BAAK,sCAAL,WAAa,+BAA+B;AAAA,IAC9C;AACA,QACE,0BAA0B,QAAQ,MACjC,CAAC,kBAAkB,QAAQ,KAC1B,SAAS,gCAAgC,OAAO,+BAChD,SAAS,iBAAiB,OAAO,gBACjC,SAAS,iBAAiB,OAAO,aACnC;AACA,4BAAK,sCAAL,WAAa,+BAA+B;AAAA,IAC9C;AACA,UAAM,aAAa,iBAAiB,OAAO,YAAY,SAAS,KAAK,UAAU;AAC/E,QAAI,eAAe,KAAM,uBAAK,sCAAL,WAAa,mBAAmB;AACzD,aAAS,8BAA8B,OAAO;AAC9C,aAAS,eAAe,OAAO;AAC/B,aAAS,eAAe,OAAO;AAC/B,QAAI,OAAO,GAAG;AACZ,aAAO,aAAa;AACpB,aAAO,sBAAsB,SAAS,kBAAkB;AAAA,IAC1D;AAAA,EACF,OAAO;AACL,QAAI,0BAA0B,QAAQ,KAAM,SAAS,WAAW,UAAa,SAAS,WAAW,OAAO,QAAS;AAC/G,4BAAK,sCAAL,WAAa,+BAA+B;AAAA,IAC9C;AACA,aAAS,SAAS,OAAO;AACzB,QAAI,OAAO,EAAG,QAAO,sBAAsB,SAAS,kBAAkB;AAAA,EACxE;AAEA,SAAO;AAAA,IACL,WAAW,OAAO;AAAA,IAClB,OAAO;AAAA,IACP,UAAU,OAAO;AAAA,EACnB;AACF;AAEA,mBAAc,SAAC,WAA0C;AACvD,QAAM,YAAY,mBAAK,UAAS,IAAI,SAAS;AAC7C,MAAI,CAAC,aAAa,UAAU,WAAW,GAAG;AACxC,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,CAAC,GAAG,SAAS,EAAE,KAAK,CAAC,GAAG,MAAM,sBAAK,0CAAL,WAAiB,KAAK,sBAAK,0CAAL,WAAiB,EAAE;AAEtF,MAAI,OAAO,CAAC,EAAG,2BAA2B,KAAK,OAAO,OAAO,SAAS,CAAC,EAAG,2BAA2B,GAAG;AACtG,WAAO;AAAA,EACT;AACA,MAAI,OAAO,MAAM,GAAG,EAAE,EAAE,KAAK,cAAY,SAAS,2BAA2B,CAAC,GAAG;AAC/E,WAAO;AAAA,EACT;AAKA,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAI,sBAAK,0CAAL,WAAiB,OAAO,CAAC,OAAQ,sBAAK,0CAAL,WAAiB,OAAO,IAAI,CAAC,KAAM,GAAG;AACzE,aAAO;AAAA,IACT;AAAA,EACF;AAQA,MAAI,eAAe,MAAM,GAAG;AAC1B,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,YAAM,WAAW,OAAO,IAAI,CAAC;AAC7B,UAAI,OAAO,CAAC,EAAG,iBAAiB,SAAS,eAAgB,SAAS,KAAK,YAAY;AACjF,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,YAAU,OAAO,GAAG,UAAU,QAAQ,GAAG,MAAM;AAC/C,SAAO,sBAAK,wCAAL,WAAe,WAAW;AACnC;AAEA,cAAS,SAAC,WAAmB,WAA0C;AAErE,QAAM,YAAY,UAAU,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,KAAK,QAAQ,CAAC;AACrE,QAAM,OAAO,IAAI,WAAW,SAAS;AAErC,MAAI,SAAS;AACb,aAAW,YAAY,WAAW;AAChC,SAAK,IAAI,SAAS,MAAM,MAAM;AAC9B,cAAU,SAAS,KAAK;AAAA,EAC1B;AAIA,wBAAK,4CAAL,WAAmB;AACnB,qBAAK,UAAS,OAAO,SAAS;AAC9B,wBAAK,2CAAL,WAAkB;AAClB,OAAK,MAAM;AAEX,SAAO;AAAA,IACL,mBAAmB,UAAU,CAAC,EAAG;AAAA,IACjC,sBAAsB,UAAU,CAAC,EAAG;AAAA,IACpC,GAAG,yBAAyB,SAAS;AAAA,IACrC;AAAA,IACA,WAAW,UAAU,CAAC,EAAG;AAAA,IACzB,eAAe,UAAU;AAAA,IACzB,SAAS,UAAU,CAAC,EAAG;AAAA,IACvB,UAAU,UAAU,KAAK,OAAK,EAAE,aAAa,MAAS,GAAG;AAAA,IACzD,cAAc,UAAU,CAAC,EAAG;AAAA,IAC5B,6BAA6B,UAAU,CAAC,EAAG;AAAA,IAC3C,cAAc,UAAU,CAAC,EAAG;AAAA,IAC5B,QAAQ,UAAU,CAAC,EAAG;AAAA,IACtB,oBAAoB,qBAAqB,SAAS;AAAA,IAClD,kBAAkB,UAAU,CAAC,EAAG;AAAA,EAClC;AACF;AAEA,gBAAW,SAAC,WAAmB,YAAY,KAAK,IAAI,GAAS;AAC3D,QAAM,QAA4B,EAAE,UAAU;AAC9C,MAAI,mBAAK,gBAAe,MAAM;AAC5B,UAAM,YAAY;AAAA,MAChB,MAAM,sBAAK,yCAAL,WAAgB;AAAA,MACtB,KAAK,IAAI,GAAG,YAAY,mBAAK,cAAa,KAAK,IAAI,CAAC;AAAA,IACtD;AAAA,EACF;AACA,qBAAK,WAAU,IAAI,WAAW,KAAK;AACrC;AAEA,yBAAoB,SAAC,SAAuB;AAC1C,QAAM,UAAU,mBAAK,uBAAsB,IAAI,OAAO;AACtD,MAAI,SAAS,cAAc,OAAW,cAAa,QAAQ,SAAS;AACpE,MAAI,YAAY,QAAW;AACzB,WAAO,QAAQ;AAAA,EACjB;AACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAcA,+BAA0B,SAAC,SAAuB;AAChD,QAAM,UAAU,mBAAK,uBAAsB,IAAI,OAAO;AACtD,MAAI,YAAY,UAAa,QAAQ,cAAc,UAAa,mBAAK,gBAAe,KAAM;AAC1F,MAAI,CAAC,oBAAoB,sBAAK,yCAAL,WAAgB,aAAa,QAAW,QAAQ,UAAU,IAAI,EAAG;AAC1F,UAAQ,YAAY;AAAA,IAClB,MAAM,sBAAK,gDAAL,WAAuB;AAAA,IAC7B,KAAK,IAAI,GAAG,QAAQ,YAAY,mBAAK,cAAa,KAAK,IAAI,CAAC;AAAA,EAC9D;AACF;AAEA,sBAAiB,SAAC,SAAuB;AACvC,wBAAK,mDAAL,WAA0B;AAC1B,qBAAK,uBAAsB,OAAO,OAAO;AAC3C;AAEA,sBAAiB,SAAC,SAAuB;AACvC,QAAM,UAAU,mBAAK,uBAAsB,IAAI,OAAO;AACtD,MAAI,YAAY,OAAW;AAO3B,MAAI,CAAC,oBAAoB,sBAAK,yCAAL,WAAgB,aAAa,QAAW,QAAQ,UAAU,IAAI,GAAG;AACxF,0BAAK,mDAAL,WAA0B;AAC1B;AAAA,EACF;AACA,OAAK,MAAM;AACX,UAAQ;AAAA,IACN,iCAAiC,OAAO,cAAc,QAAQ,UAAU,IAAI;AAAA,EAE9E;AACA,qBAAK,uBAAsB,OAAO,OAAO;AAC3C;AAEA,kBAAa,SAAC,WAAyB;AACrC,QAAM,QAAQ,mBAAK,WAAU,IAAI,SAAS;AAC1C,MAAI,UAAU,QAAW;AACvB,QAAI,MAAM,cAAc,OAAW,cAAa,MAAM,SAAS;AAC/D,uBAAK,WAAU,OAAO,SAAS;AAAA,EACjC;AACF;AAKA,iBAAY,SAAC,WAAyB;AACpC,MAAI,mBAAK,UAAS,IAAI,SAAS,EAAG;AAClC,qBAAK,UAAS,IAAI,SAAS;AAC3B,qBAAK,eAAc,KAAK,SAAS;AACjC,SAAO,mBAAK,eAAc,SAAS,mBAAK,eAAc;AACpD,UAAM,SAAS,mBAAK,eAAc,MAAM;AACxC,QAAI,WAAW,OAAW,oBAAK,UAAS,OAAO,MAAM;AAAA,EACvD;AACF;AAEA,mBAAc,SAAC,SAAuB;AACpC,MAAI,mBAAK,YAAW,IAAI,OAAO,EAAG;AAClC,qBAAK,YAAW,IAAI,OAAO;AAC3B,qBAAK,iBAAgB,KAAK,OAAO;AACjC,QAAM,MAAM,mBAAK,gBAAe;AAChC,SAAO,mBAAK,iBAAgB,SAAS,KAAK;AACxC,UAAM,SAAS,mBAAK,iBAAgB,MAAM;AAC1C,QAAI,WAAW,OAAW,oBAAK,YAAW,OAAO,MAAM;AAAA,EACzD;AACF;AAEA,gBAAW,SAAC,UAA+B;AACzC,SAAO,qBAAqB,QAAQ;AACtC;AAAA;AAAA;AAIA,mCAA8B,SAAC,WAAyB;AACtD,aAAW,CAACD,YAAW,MAAM,KAAK,mBAAK,mBAAkB;AACvD,QAAI,OAAO,cAAc,WAAW;AAClC,yBAAK,kBAAiB,OAAOA,UAAS;AACtC,4BAAK,yDAAL,WAAgC,OAAO;AAAA,IACzC;AAAA,EACF;AACF;AAAA;AAAA;AAIA,eAAU,SAAC,SAAgE;AACzE,aAAW,SAAS,mBAAK,mBAAkB;AACzC,QAAI,MAAM,CAAC,EAAE,YAAY,QAAS,QAAO;AAAA,EAC3C;AACA,SAAO;AACT;AAEA,eAAU,SAAC,WAAyB;AAClC,QAAM,YAAY,mBAAK,UAAS,IAAI,SAAS;AAC7C,MAAI,CAAC,aAAa,UAAU,WAAW,GAAG;AACxC,uBAAK,UAAS,OAAO,SAAS;AAC9B,uBAAK,WAAU,OAAO,SAAS;AAC/B,0BAAK,6DAAL,WAAoC;AACpC,SAAK,MAAM;AACX,YAAQ,KAAK,iCAAiC,SAAS,iCAAiC;AACxF;AAAA,EACF;AAKA,OAAK,MAAM;AACX,UAAQ,KAAK,iCAAiC,SAAS,cAAc,UAAU,MAAM,uBAAuB;AAE5G,qBAAK,UAAS,OAAO,SAAS;AAC9B,qBAAK,WAAU,OAAO,SAAS;AAC/B,wBAAK,6DAAL,WAAoC;AACtC;AA6HA,yBAAoB,WAAsB;AACxC,QAAM,MAAyB,CAAC;AAChC,aAAW,CAAC,KAAK,SAAS,KAAK,mBAAK,WAAU;AAC5C,QAAI,UAAU,WAAW,EAAG;AAC5B,UAAM,SAAS,CAAC,GAAG,SAAS,EAAE,KAAK,CAAC,GAAG,MAAM,sBAAK,0CAAL,WAAiB,KAAK,sBAAK,0CAAL,WAAiB,EAAE;AACtF,UAAM,WAAW,CAAC,GAAG,GAAG,GAAG,CAAC;AAC5B,QAAI,aAAa;AACjB,QAAI,aAAa;AACjB,QAAI,YAAY;AAChB,QAAI,YAAY;AAChB,eAAW,YAAY,QAAQ;AAC7B,eAAS,SAAS,sBAAsB,KAAK,SAAS,SAAS,sBAAsB,KAAK,KAAK;AAC/F,mBAAa,KAAK,IAAI,YAAY,SAAS,eAAe;AAC1D,mBAAa,KAAK,IAAI,YAAY,SAAS,eAAe;AAC1D,UAAI,OAAO,SAAS,iBAAiB,UAAU;AAC7C,oBAAY,KAAK,IAAI,WAAW,SAAS,YAAY;AACrD,oBAAY,KAAK,IAAI,WAAW,SAAS,YAAY;AAAA,MACvD;AAAA,IACF;AACA,UAAM,QAAQ,CAAC,cAA2B;AAAA,MACxC,IAAI,SAAS;AAAA,MACb,SAAS,SAAS;AAAA,MAClB,OAAO,sBAAK,0CAAL,WAAiB;AAAA,MACxB,GAAI,OAAO,SAAS,yBAAyB,WAAW,EAAE,KAAK,SAAS,qBAAqB,IAAI,CAAC;AAAA,MAClG,GAAI,OAAO,SAAS,iBAAiB,WAAW,EAAE,QAAQ,SAAS,aAAa,IAAI,CAAC;AAAA,IACvF;AACA,UAAM,UAA2B;AAAA,MAC/B;AAAA,MACA,WAAW,OAAO;AAAA,MAClB,KAAK,SAAS,CAAC,KAAK;AAAA,MACpB,KAAK,SAAS,CAAC,KAAK;AAAA,MACpB,KAAK,SAAS,CAAC,KAAK;AAAA,MACpB,KAAK,SAAS,CAAC,KAAK;AAAA,MACpB,SAAS,OAAO,CAAC,EAAG;AAAA,MACpB,QAAQ,OAAO,OAAO,SAAS,CAAC,EAAG;AAAA,MACnC,YAAY,sBAAK,0CAAL,WAAiB,OAAO,CAAC;AAAA,MACrC,WAAW,sBAAK,0CAAL,WAAiB,OAAO,OAAO,SAAS,CAAC;AAAA,MACpD;AAAA,MACA;AAAA,MACA,6BAA6B,OAAO,KAAK,OAAK,EAAE,gCAAgC,MAAS,GACrF;AAAA,MACJ,cAAc,OAAO,KAAK,OAAK,EAAE,iBAAiB,MAAS,GAAG;AAAA,MAC9D,mBAAmB,OAAO,CAAC,EAAG;AAAA,MAC9B,YAAY,OAAO,MAAM,GAAG,CAAC,EAAE,IAAI,KAAK;AAAA,MACxC,YAAY,OAAO,MAAM,EAAE,EAAE,IAAI,KAAK;AAAA,IACxC;AACA,QAAI,cAAc,SAAU,SAAQ,YAAY;AAChD,QAAI,cAAc,UAAW,SAAQ,YAAY;AACjD,QAAI,KAAK,OAAO;AAChB,QAAI,IAAI,UAAU,GAAI;AAAA,EACxB;AACA,SAAO;AACT;AA6CF,IAAI,QAAoB;AACtB,QAAM,EAAE,UAAU,MAAM,QAAQ,GAAG,IAAI;AAEvC,QAAM,kBAAkB,CAAC,MAAqB,SAAuC;AACnF,QAAI;AACJ,QAAI;AACF,WAAK;AAAA,IACP,SAAS,OAAO;AACd,kBAAY;AAAA,IACd;AACA,WAAO,SAAS,EAAE,eAAe,kBAAkB;AACnD,WAAQ,UAAiC,IAAI,EAAE,KAAK,IAAI;AAAA,EAC1D;AAEA,QAAM,qBAAqB,CAAC,KAAa,SAAiB,MAAM,OAC7D,MAAM,MAAO,MAAM,UAAU,cAAiB;AAEjD,WAAS,kBAAkB,MAAM;AAC/B,SAAK,uCAAuC,MAAM;AAChD,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,SAAS,YAAY,YAAY;AAAA,QACrC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;AAAA,QACjC,WAAW;AAAA,QAEX,SAAS;AAAA,MACX,CAAC;AACD,aAAO,MAAM,EAAE,IAAI,SAAS;AAC5B,aAAO,QAAQ,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AACzD,aAAO,QAAQ,aAAa,EAAE,KAAK,CAAC;AACpC,aAAO,QAAQ,OAAO,EAAE,KAAK,IAAI;AAAA,IACnC,CAAC;AAED,SAAK,0DAA0D,MAAM;AACnE,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,WAAW,CAAC,cAAiD;AAAA,QACjE,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,SAAS;AAAA,QACT,GAAG;AAAA,MACL;AACA,sBAAgB,MAAM,YAAY,YAAY,SAAS,CAAC,CAAC,CAAC,GAAG,4BAA4B;AACzF;AAAA,QACE,MACE,YAAY;AAAA,UACV,SAAS;AAAA,YACP,6BAA6B;AAAA,YAC7B,cAAc;AAAA,UAChB,CAAC;AAAA,QACH;AAAA,QACF;AAAA,MACF;AAAA,IACF,CAAC;AAED,SAAK,mEAAmE,MAAM;AAI5E,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,SAAS,YAAY,YAAY;AAAA,QACrC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,6BAA6B;AAAA,QAC7B,cAAc;AAAA,QACd,cAAc;AAAA,QACd,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,SAAS;AAAA,MACX,CAAC;AACD,aAAO,MAAM,EAAE,IAAI,SAAS;AAC5B,aAAO,QAAQ,YAAY,EAAE,KAAK,CAAC;AAAA,IACrC,CAAC;AAED,SAAK,wFAAwF,MAAM;AACjG,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAE1D;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,6BAA6B;AAAA,UAC7B,cAAc;AAAA,UACd,cAAc;AAAA,UACd,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,UAC7C,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,SAAS;AACX,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AACvC,aAAO,YAAY,UAAU,EAAE,gBAAgB,EAAE,KAAK,CAAC;AAEvD,YAAM,MAAM,YAAY,YAAY;AAAA,QAClC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,aAAO,KAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AACtD,aAAO,KAAK,YAAY,EAAE,KAAK,CAAC;AAAA,IAClC,CAAC;AAgBD,SAAK,6DAA6D,MAAM;AACtE,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,MAAM,aAAa,GAAG,CAAC;AAE3E;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,6BAA6B;AAAA,UAC7B,cAAc;AAAA,UACd,cAAc;AAAA,UACd,sBAAsB;AAAA,UACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,SAAS;AAIX,YAAM,cAAc,YAAY,YAAY;AAAA,QAC1C,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,6BAA6B;AAAA,QAC7B,cAAc;AAAA,QACd,cAAc;AAAA,QACd,sBAAsB;AAAA,QACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,MACX,CAAC;AACD,aAAO,aAAa,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAI,CAAC,CAAC;AAExD;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,sBAAsB;AAAA,UACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,SAAS;AAEX,YAAM,SAAS,YAAY,YAAY;AAAA,QACrC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,sBAAsB;AAAA,QACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,MACX,CAAC;AAKD,aAAO,MAAM,EAAE,SAAS;AAIxB,aAAO,YAAY,MAAM,eAAe,EAAE,KAAK,CAAC;AAChD,aAAO,YAAY,MAAM,iBAAiB,EAAE,KAAK,CAAC;AAMlD,aAAO,YAAY,MAAM,kBAAkB,EAAE,KAAK,CAAC;AAOnD,aAAO,YAAY,UAAU,EAAE,YAAY,EAAE,KAAK,CAAC;AACnD,aAAO,YAAY,UAAU,EAAE,gBAAgB,EAAE,KAAK,CAAC;AAAA,IACzD,CAAC;AAED,SAAK,0EAA0E,MAAM;AAInF,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAE1D;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,mBAAmB;AAAA,UACnB,6BAA6B;AAAA,UAC7B,cAAc;AAAA,UACd,wBAAwB;AAAA,UACxB,iBAAiB;AAAA,UACjB,cAAc;AAAA,UACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,GAAG,GAAG,CAAC;AAAA,QAClD,CAAC;AAAA,MACH,EAAE,SAAS;AAOX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,mBAAmB;AAAA,UACnB,6BAA6B;AAAA,UAC7B,cAAc;AAAA,UACd,wBAAwB;AAAA,UACxB,iBAAiB;AAAA,UACjB,cAAc;AAAA,UACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,GAAG,GAAG,CAAC;AAAA,QAClD,CAAC;AAAA,MACH,EAAE,SAAS;AACX,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAEvC,YAAM,QAAQ,YAAY,YAAY;AAAA,QACpC,mBAAmB;AAAA,QACnB,wBAAwB;AAAA,QACxB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,GAAG,CAAC;AAAA,MAClD,CAAC;AACD,aAAO,OAAO,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AACxD,aAAO,OAAO,YAAY,EAAE,KAAK,CAAC;AAElC;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,mBAAmB;AAAA,UACnB,wBAAwB;AAAA,UACxB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,GAAG,GAAG,CAAC;AAAA,QAClD,CAAC;AAAA,MACH,EAAE,SAAS;AACX,YAAM,SAAS,YAAY,YAAY;AAAA,QACrC,mBAAmB;AAAA,QACnB,wBAAwB;AAAA,QACxB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,GAAG,CAAC;AAAA,MAClD,CAAC;AACD,aAAO,QAAQ,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,GAAI,CAAC,CAAC;AAC/D,aAAO,QAAQ,YAAY,EAAE,KAAK,CAAC;AACnC,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,qEAAqE,MAAM;AAC9E,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,WAAW,CACf,kBACA,wBACA,iBACA,UACiB;AAAA,QACjB,QAAQ;AAAA,QACR;AAAA,QACA;AAAA,QACA,mBAAmB;AAAA,QACnB,MAAM,IAAI,WAAW,CAAC,IAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS,2BAA2B;AAAA,QACpC;AAAA,QACA,sBAAsB,mBAAmB,GAAG,eAAe;AAAA,MAC7D;AAEA,aAAO,YAAY,YAAY,SAAS,cAAc,GAAG,GAAG,GAAI,CAAC,CAAC,EAAE,SAAS;AAC7E,aAAO,YAAY,YAAY,SAAS,cAAc,GAAG,GAAG,EAAI,CAAC,CAAC,EAAE,SAAS;AAC7E,YAAM,OAAO,YAAY,YAAY,SAAS,cAAc,GAAG,GAAG,GAAI,CAAC;AACvE,YAAM,MAAM,YAAY,YAAY,SAAS,cAAc,GAAG,GAAG,EAAI,CAAC;AAEtE,aAAO,MAAM,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AACvD,aAAO,MAAM,gBAAgB,EAAE,KAAK,YAAY;AAChD,aAAO,KAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,IAAM,EAAI,CAAC,CAAC;AACtD,aAAO,KAAK,gBAAgB,EAAE,KAAK,YAAY;AAAA,IACjD,CAAC;AAED,SAAK,0EAA0E,MAAM;AACnF,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,WAAW,CACf,QACA,wBACA,iBACA,UACiB;AAAA,QACjB;AAAA,QACA;AAAA,QACA;AAAA,QACA,mBAAmB;AAAA,QACnB,MAAM,IAAI,WAAW,CAAC,IAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,eAAe;AAAA,MAC7D;AAEA,aAAO,YAAY,YAAY,SAAS,IAAI,GAAG,GAAG,EAAI,CAAC,CAAC,EAAE,SAAS;AACnE,sBAAgB,MAAM,YAAY,YAAY,SAAS,IAAI,GAAG,GAAG,EAAI,CAAC,GAAG,uBAAuB;AAChG,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AACvC,aAAO,YAAY,YAAY,SAAS,IAAI,GAAG,GAAG,EAAI,CAAC,GAAG,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,IAAM,EAAI,CAAC,CAAC;AACpG,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,4EAA4E,MAAM;AACrF,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,WAAW,CACf,QACA,wBACA,iBACA,MACA,eACiB;AAAA,QACjB,GAAI,WAAW,SAAY,CAAC,IAAI,EAAE,OAAO;AAAA,QACzC;AAAA,QACA;AAAA,QACA,mBAAmB;AAAA,QACnB,MAAM,IAAI,WAAW,CAAC,IAAI,CAAC;AAAA,QAC3B;AAAA,QACA,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,eAAe;AAAA,MAC7D;AAEA,aAAO,YAAY,YAAY,SAAS,IAAI,GAAG,GAAG,IAAM,KAAK,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,YAAY,YAAY,SAAS,QAAW,GAAG,GAAG,IAAM,KAAK,CAAC,CAAC,EAAE,SAAS;AACjF,YAAM,MAAM,YAAY,YAAY,SAAS,QAAW,GAAG,GAAG,IAAM,KAAK,CAAC;AAC1E,aAAO,KAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,IAAM,IAAM,EAAI,CAAC,CAAC;AAC5D,aAAO,KAAK,SAAS,EAAE,KAAK,KAAK;AAAA,IACnC,CAAC;AAED,SAAK,4CAA4C,MAAM;AACrD,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAG1D,YAAM,UAAU,YAAY,YAAY;AAAA,QACtC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,aAAO,OAAO,EAAE,SAAS;AAGzB,YAAM,UAAU,YAAY,YAAY;AAAA,QACtC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,aAAO,OAAO,EAAE,IAAI,SAAS;AAC7B,aAAO,SAAS,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AAC1D,aAAO,SAAS,aAAa,EAAE,KAAK,CAAC;AACrC,aAAO,SAAS,OAAO,EAAE,KAAK,IAAI;AAAA,IACpC,CAAC;AAED,SAAK,6EAA6E,MAAM;AACtF,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAG1D;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,QAC/C,CAAC;AAAA,MACH,EAAE,SAAS;AACX,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAGvC,YAAM,YAAY,YAAY,YAAY;AAAA,QACxC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AAED,aAAO,WAAW,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AAC5D,aAAO,WAAW,OAAO,EAAE,KAAK,IAAI;AACpC,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,0DAA0D,YAAY;AACzE,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,KAAK,CAAC;AAE1D,kBAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AAED,YAAM,IAAI,QAAQ,aAAW,WAAW,SAAS,CAAC,CAAC;AAEnD,YAAM,SAAS,YAAY,YAAY;AAAA,QACrC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AAED,aAAO,MAAM,EAAE,IAAI,SAAS;AAC5B,aAAO,QAAQ,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AACzD,aAAO,YAAY,MAAM,YAAY,EAAE,KAAK,CAAC;AAAA,IAC/C,CAAC;AAED,SAAK,8BAA8B,MAAM;AACvC,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAEvC,kBAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAEvC,kBAAY,MAAM;AAClB,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,oDAAoD,MAAM;AAC7D,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAG1D;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,QAAQ;AAAA,UACR,MAAM,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC;AAAA,UACjC,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,MACH,EAAE,SAAS;AAGX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC;AAAA,UACjC,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,MACH,EAAE,SAAS;AAGX,YAAM,SAAS,YAAY,YAAY;AAAA,QACrC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC;AAAA,QACjC,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,MAChD,CAAC;AAED,aAAO,MAAM,EAAE,IAAI,SAAS;AAC5B,aAAO,OAAQ,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,KAAM,KAAM,KAAM,GAAI,CAAC,CAAC;AACjF,aAAO,OAAQ,aAAa,EAAE,KAAK,CAAC;AACpC,aAAO,OAAQ,OAAO,EAAE,KAAK,IAAI;AACjC,aAAO,OAAQ,iBAAiB,EAAE,KAAK,EAAE;AAAA,IAC3C,CAAC;AAED,SAAK,2CAA2C,MAAM;AACpD,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAG1D,kBAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,CAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AAED,YAAM,KAAK,YAAY,YAAY;AAAA,QACjC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,CAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,MACX,CAAC;AACD,aAAO,EAAE,EAAE,IAAI,SAAS;AACxB,aAAO,GAAI,iBAAiB,EAAE,KAAK,CAAC;AAGpC,YAAM,KAAK,YAAY,YAAY;AAAA,QACjC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,CAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,aAAO,EAAE,EAAE,IAAI,SAAS;AACxB,aAAO,GAAI,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAM,CAAI,CAAC,CAAC;AAAA,IACvD,CAAC;AAED,SAAK,kEAAkE,MAAM;AAC3E,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,SAAS;AAEf;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,QAAQ;AAAA,UACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,QAAQ,CAAC;AAAA,QACpD,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,MACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,QAAQ;AAAA,UACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,QAAQ,CAAC;AAAA,QACpD,CAAC;AAAA,QACH;AAAA,MACF;AACA,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAEvC,YAAM,IAAI,YAAY,YAAY;AAAA,QAChC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,QAAQ,CAAC;AAAA,MACpD,CAAC;AACD,aAAO,CAAC,EAAE,IAAI,SAAS;AACvB,aAAO,EAAG,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AACpD,aAAO,EAAG,OAAO,EAAE,KAAK,IAAI;AAE5B;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,QAAQ;AAAA,UACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,QAAQ,GAAG,EAAE;AAAA,QACxD,CAAC;AAAA,MACH,EAAE,SAAS;AACX,YAAM,IAAI,YAAY,YAAY;AAAA,QAChC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,QAAQ,GAAG,EAAE;AAAA,MACxD,CAAC;AACD,aAAO,CAAC,EAAE,IAAI,SAAS;AACvB,aAAO,EAAG,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AAAA,IACtD,CAAC;AAED,SAAK,2EAA2E,MAAM;AACpF,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,SAAS;AAAA,QACb,mBAAmB;AAAA,QACnB,6BAA6B;AAAA,QAC7B,cAAc;AAAA,MAChB;AAEA;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,GAAG;AAAA,UACH,wBAAwB;AAAA,UACxB,iBAAiB;AAAA,UACjB,cAAc;AAAA,UACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,QAC/C,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,GAAG;AAAA,UACH,wBAAwB;AAAA,UACxB,iBAAiB;AAAA,UACjB,cAAc;AAAA,UACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,QAC/C,CAAC;AAAA,MACH,EAAE,SAAS;AACX,YAAM,MAAM,YAAY,YAAY;AAAA,QAClC,GAAG;AAAA,QACH,wBAAwB;AAAA,QACxB,iBAAiB;AAAA,QACjB,cAAc;AAAA,QACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AAED,aAAO,GAAG,EAAE,IAAI,SAAS;AACzB,aAAO,IAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,GAAI,CAAC,CAAC;AAC5D,aAAO,IAAK,SAAS,EAAE,KAAK,KAAK;AACjC,aAAO,IAAK,YAAY,EAAE,KAAK,EAAE;AACjC,aAAO,IAAK,2BAA2B,EAAE,KAAK,CAAC;AAAA,IACjD,CAAC;AAED,SAAK,gEAAgE,MAAM;AACzE,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,SAAS;AAAA,QACb,mBAAmB;AAAA,QACnB,6BAA6B;AAAA,QAC7B,cAAc;AAAA,QACd,WAAW;AAAA,QACX,SAAS;AAAA,MACX;AAEA;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,GAAG;AAAA,UACH,wBAAwB;AAAA,UACxB,iBAAiB;AAAA,UACjB,cAAc;AAAA,UACd,MAAM,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC;AAAA,UACjC,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,QAC/C,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,GAAG;AAAA,UACH,wBAAwB;AAAA,UACxB,iBAAiB;AAAA,UACjB,cAAc;AAAA,UACd,MAAM,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC;AAAA,UACjC,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,QAC/C,CAAC;AAAA,MACH,EAAE,SAAS;AACX,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAEvC,YAAM,MAAM,YAAY,YAAY;AAAA,QAClC,GAAG;AAAA,QACH,wBAAwB;AAAA,QACxB,iBAAiB;AAAA,QACjB,cAAc;AAAA,QACd,MAAM,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC;AAAA,QACjC,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,aAAO,KAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,KAAM,KAAM,KAAM,GAAI,CAAC,CAAC;AAAA,IAChF,CAAC;AAED,SAAK,gFAAgF,MAAM;AACzF,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAE1D;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,6BAA6B;AAAA,UAC7B,cAAc;AAAA,UACd,cAAc;AAAA,UACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,MACH,EAAE,SAAS;AACX,YAAM,MAAM,YAAY,YAAY;AAAA,QAClC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,MAChD,CAAC;AAED,aAAO,GAAG,EAAE,IAAI,SAAS;AACzB,aAAO,IAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,GAAI,CAAC,CAAC;AAC5D,aAAO,IAAK,SAAS,EAAE,KAAK,MAAM;AAClC,aAAO,IAAK,YAAY,EAAE,KAAK,EAAE;AACjC,aAAO,IAAK,2BAA2B,EAAE,KAAK,CAAC;AAAA,IACjD,CAAC;AAED,SAAK,oEAAoE,MAAM;AAC7E,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,YAAY;AAElB;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,6BAA6B;AAAA,UAC7B,cAAc;AAAA,UACd,cAAc;AAAA,UACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,MACH,EAAE,SAAS;AACX,YAAM,MAAM,YAAY,YAAY;AAAA,QAClC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B;AAAA,QACA,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,MAChD,CAAC;AAED,aAAO,GAAG,EAAE,IAAI,SAAS;AACzB,aAAO,IAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,KAAM,GAAI,CAAC,CAAC;AAClE,aAAO,IAAK,YAAY,EAAE,KAAK,EAAE;AACjC,aAAO,IAAK,2BAA2B,EAAE,KAAK,CAAC;AAAA,IACjD,CAAC;AAED,SAAK,2DAA2D,MAAM;AACpE,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,YAAY;AAElB;AAAA,QACE,MACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,QACH;AAAA,MACF;AACA,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,+DAA+D,MAAM;AACxE,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D;AAAA,QACE,MACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,QAAQ;AAAA,UACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,QACX,CAAC;AAAA,QACH;AAAA,MACF;AACA,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,qEAAqE,MAAM;AAC9E,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,iBAAW,wBAAwB,CAAC,IAAI,YAAe,KAAK,OAAO,GAAG,GAAG;AACvE;AAAA,UACE,MACE,YAAY,YAAY;AAAA,YACtB,wBAAwB;AAAA,YACxB,mBAAmB;AAAA,YACnB,iBAAiB;AAAA,YACjB,QAAQ;AAAA,YACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,YAC3B,WAAW;AAAA,YACX,SAAS;AAAA,YACT;AAAA,UACF,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AACA,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,8EAA8E,MAAM;AACvF,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,YAAY;AAMlB;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,6BAA6B;AAAA,UAC7B,cAAc;AAAA,UACd,cAAc;AAAA,UACd,sBAAsB;AAAA,UACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,SAAS;AACX,iBAAW,CAAC,SAAS,GAAG,KAAK;AAAA,QAC3B,CAAC,GAAG,IAAI;AAAA,QACR,CAAC,GAAG,IAAI;AAAA,MACV,GAAY;AACV;AAAA,UACE,YAAY,YAAY;AAAA,YACtB,wBAAwB;AAAA,YACxB,mBAAmB;AAAA,YACnB,iBAAiB;AAAA,YACjB,sBAAsB;AAAA,YACtB,MAAM,IAAI,WAAW,CAAC,MAAO,OAAO,CAAC;AAAA,YACrC;AAAA,YACA,SAAS;AAAA,UACX,CAAC;AAAA,QACH,EAAE,SAAS;AAAA,MACb;AACA;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,sBAAsB;AAAA,UACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,SAAS;AAGX,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AACvC,aAAO,YAAY,UAAU,EAAE,gBAAgB,EAAE,KAAK,CAAC;AACvD,aAAO,YAAY,MAAM,eAAe,EAAE,KAAK,CAAC;AAChD,aAAO,YAAY,MAAM,iBAAiB,EAAE,KAAK,CAAC;AAAA,IACpD,CAAC;AAED,SAAK,iEAAiE,MAAM;AAC1E,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,SAAS,EAAE,mBAAmB,IAAI,UAAU,GAAG,WAAW,OAAO;AAMvE;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,GAAG;AAAA,UACH,wBAAwB;AAAA,UACxB,iBAAiB;AAAA,UACjB,sBAAsB;AAAA,UACtB,6BAA6B;AAAA,UAC7B,cAAc;AAAA,UACd,cAAc;AAAA,UACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,GAAG;AAAA,UACH,wBAAwB;AAAA,UACxB,iBAAiB;AAAA,UACjB,sBAAsB;AAAA,UACtB,6BAA6B;AAAA,UAC7B,cAAc;AAAA,UACd,cAAc;AAAA,UACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,SAAS;AACX,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAEvC,YAAM,UAAU,YAAY,YAAY;AAAA,QACtC,GAAG;AAAA,QACH,wBAAwB;AAAA,QACxB,iBAAiB;AAAA,QACjB,sBAAsB;AAAA,QACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,SAAS;AAAA,MACX,CAAC;AACD,aAAO,SAAS,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AAC1D,aAAO,SAAS,qBAAqB,EAAE,QAAQ,CAAC,KAAK,GAAG,CAAC;AAEzD,YAAM,QAAQ,YAAY,YAAY;AAAA,QACpC,GAAG;AAAA,QACH,wBAAwB;AAAA,QACxB,iBAAiB;AAAA,QACjB,sBAAsB;AAAA,QACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,SAAS;AAAA,MACX,CAAC;AACD,aAAO,OAAO,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AACxD,aAAO,OAAO,qBAAqB,EAAE,QAAQ,CAAC,KAAK,GAAG,CAAC;AACvD,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,8DAA8D,MAAM;AACvE,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,sBAAsB;AAAA,UACtB,QAAQ;AAAA,UACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,sBAAsB;AAAA,UACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,QACX,CAAC,GAAG;AAAA,MACN,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AAAA,IACxC,CAAC;AAED,SAAK,6DAA6D,MAAM;AACtE,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,YAAY;AAElB;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,6BAA6B;AAAA,UAC7B,cAAc;AAAA,UACd,cAAc;AAAA,UACd,sBAAsB;AAAA,UACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,sBAAsB;AAAA,UACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,sBAAsB;AAAA,UACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,IAAI,SAAS;AAEf,kBAAY,MAAM;AAElB;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,6BAA6B;AAAA,UAC7B,cAAc;AAAA,UACd,cAAc;AAAA,UACd,sBAAsB;AAAA,UACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,sBAAsB;AAAA,UACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,QACX,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,MACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,sBAAsB;AAAA,UACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,QACX,CAAC;AAAA,QACH;AAAA,MACF;AACA,YAAM,MAAM,YAAY,YAAY;AAAA,QAClC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,sBAAsB;AAAA,QACtB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B;AAAA,QACA,SAAS;AAAA,MACX,CAAC;AAED,aAAO,GAAG,EAAE,IAAI,SAAS;AACzB,aAAO,IAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,GAAI,CAAC,CAAC;AAAA,IAC9D,CAAC;AAED,SAAK,0EAA0E,MAAM;AACnF,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,YAAY;AAElB;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW,YAAY;AAAA,UACvB,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,MACH,EAAE,SAAS;AACX,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AACvC,YAAM,MAAM,YAAY,YAAY;AAAA,QAClC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,6BAA6B;AAAA,QAC7B,cAAc;AAAA,QACd,cAAc;AAAA,QACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B;AAAA,QACA,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,MAChD,CAAC;AAED,aAAO,GAAG,EAAE,IAAI,SAAS;AACzB,aAAO,IAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,GAAI,CAAC,CAAC;AAC5D,aAAO,IAAK,YAAY,EAAE,KAAK,EAAE;AACjC,aAAO,IAAK,2BAA2B,EAAE,KAAK,EAAE;AAChD,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,kFAAkF,MAAM;AAC3F,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,YAAY;AAElB;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B;AAAA,UACA,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,MACH,EAAE,SAAS;AACX;AAAA,QACE,MACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW,YAAY;AAAA,UACvB,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,QACH;AAAA,MACF;AACA;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW,YAAY;AAAA,UACvB,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,MACH,EAAE,SAAS;AAEX,YAAM,MAAM,YAAY,YAAY;AAAA,QAClC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,6BAA6B;AAAA,QAC7B,cAAc;AAAA,QACd,cAAc;AAAA,QACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW,YAAY;AAAA,QACvB,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,MAChD,CAAC;AAED,aAAO,GAAG,EAAE,IAAI,SAAS;AACzB,aAAO,IAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,GAAI,CAAC,CAAC;AAC5D,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,wEAAwE,MAAM;AACjF,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,iBAAiB;AAAA,QACrB,EAAE,wBAAwB,GAAG,iBAAiB,EAAE;AAAA,QAChD,EAAE,wBAAwB,GAAG,iBAAiB,EAAE;AAAA,QAChD,EAAE,wBAAwB,GAAG,iBAAiB,EAAE;AAAA,QAChD,EAAE,wBAAwB,GAAG,iBAAiB,EAAE;AAAA,QAChD,EAAE,wBAAwB,IAAI,iBAAiB,EAAE;AAAA,QACjD,EAAE,wBAAwB,GAAG,iBAAiB,EAAE;AAAA,QAChD,EAAE,wBAAwB,KAAK,iBAAiB,EAAE;AAAA,QAClD,EAAE,wBAAwB,GAAG,iBAAiB,GAAG;AAAA,QACjD,EAAE,wBAAwB,GAAG,iBAAiB,IAAI;AAAA,QAClD,EAAE,wBAAwB,GAAG,iBAAiB,IAAI;AAAA,QAClD,EAAE,wBAAwB,GAAG,iBAAiB,OAAO,IAAI;AAAA,MAC3D;AAEA,iBAAW,UAAU,gBAAgB;AACnC;AAAA,UACE,MACE,YAAY,YAAY;AAAA,YACtB,GAAG;AAAA,YACH,mBAAmB;AAAA,YACnB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,YAC3B,WAAW;AAAA,YACX,SAAS;AAAA,UACX,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AAEA,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AACvC,aAAO,YAAY,MAAM,eAAe,EAAE,KAAK,CAAC;AAAA,IAClD,CAAC;AAED,SAAK,qDAAqD,MAAM;AAC9D,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,KAAK,CAAC;AAC1D,YAAM,SAAS;AAAA,QACb,mBAAmB;AAAA,QACnB,WAAW;AAAA,QACX,SAAS;AAAA,MACX;AAEA;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,GAAG;AAAA,UACH,wBAAwB;AAAA,UACxB,iBAAiB;AAAA,UACjB,QAAQ;AAAA,UACR,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,UACxB,SAAS;AAAA,UACT,sBAAsB,mBAAmB,IAAI,GAAG;AAAA,QAClD,CAAC;AAAA,MACH,EAAE,SAAS;AACX,eAAS,UAAU,KAAK,UAAU,GAAG,WAAW;AAC9C;AAAA,UACE,YAAY,YAAY;AAAA,YACtB,GAAG;AAAA,YACH,wBAAwB;AAAA,YACxB,iBAAiB;AAAA,YACjB,MAAM,IAAI,WAAW,CAAC,MAAM,OAAO,CAAC;AAAA,YACpC,sBAAsB,mBAAmB,IAAI,OAAO;AAAA,UACtD,CAAC;AAAA,QACH,EAAE,SAAS;AAAA,MACb;AACA,YAAM,MAAM,YAAY,YAAY;AAAA,QAClC,GAAG;AAAA,QACH,wBAAwB;AAAA,QACxB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAG,CAAC;AAAA,QAC1B,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,MAChD,CAAC;AAED,aAAO,KAAK,aAAa,EAAE,KAAK,GAAG;AACnC,aAAO,KAAK,IAAI,EAAE,QAAQ,WAAW,KAAK,EAAE,QAAQ,IAAI,GAAG,CAAC,GAAG,UAAU,KAAK,CAAC;AAAA,IACjF,CAAC;AAED,SAAK,sDAAsD,MAAM;AAC/D,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,kBAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,YAAM,SAAS,YAAY,YAAY;AAAA,QACrC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,aAAO,MAAM,EAAE,SAAS;AACxB,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,iEAAiE,MAAM;AAC1E,YAAM,cAAc,IAAI,eAAe;AAAA,QACrC,WAAW;AAAA,QACX,aAAa;AAAA,MACf,CAAC;AAED;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,UACxB,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,QAC/C,CAAC;AAAA,MACH,EAAE,SAAS;AACX,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAIvC;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,UACxB,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,QAC/C,CAAC;AAAA,MACH,EAAE,SAAS;AACX,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AACvC,aAAO,YAAY,UAAU,EAAE,gBAAgB,EAAE,KAAK,CAAC;AACvD,aAAO,YAAY,MAAM,kBAAkB,EAAE,KAAK,CAAC;AAInD,YAAM,YAAY,YAAY,YAAY;AAAA,QACxC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,aAAO,WAAW,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;AACtD,aAAO,YAAY,MAAM,kBAAkB,EAAE,KAAK,CAAC;AACnD,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAIvC,YAAM,SAAS,YAAY,YAAY;AAAA,QACrC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,aAAO,MAAM,EAAE,SAAS;AACxB,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,iEAAiE,MAAM;AAC1E,SAAG,cAAc;AACjB,UAAI;AACF,cAAM,cAAc,IAAI,eAAe;AAAA,UACrC,WAAW;AAAA,UACX,aAAa;AAAA,QACf,CAAC;AACD;AAAA,UACE,YAAY,YAAY;AAAA,YACtB,wBAAwB;AAAA,YACxB,mBAAmB;AAAA,YACnB,iBAAiB;AAAA,YACjB,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,YACxB,WAAW;AAAA,YACX,SAAS;AAAA,YACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,UAC/C,CAAC;AAAA,QACH,EAAE,SAAS;AACX,WAAG,oBAAoB,EAAE;AACzB,eAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AACvC,eAAO,YAAY,MAAM,YAAY,EAAE,KAAK,CAAC;AAAA,MAC/C,UAAE;AACA,WAAG,cAAc;AAAA,MACnB;AAAA,IACF,CAAC;AAED,SAAK,kEAAkE,MAAM;AAC3E,SAAG,cAAc;AACjB,UAAI;AACF,cAAM,UAAU,IAAI,eAAe,EAAE,WAAW,MAAM,aAAa,EAAE,CAAC;AACtE;AAAA,UACE,QAAQ,YAAY;AAAA,YAClB,wBAAwB;AAAA,YACxB,mBAAmB;AAAA,YACnB,iBAAiB;AAAA,YACjB,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,YACxB,WAAW;AAAA,YACX,SAAS;AAAA,YACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,UAC/C,CAAC;AAAA,QACH,EAAE,SAAS;AACX,gBAAQ,YAAY;AACpB,WAAG,oBAAoB,EAAE;AACzB,eAAO,QAAQ,YAAY,EAAE,KAAK,CAAC;AAEnC,cAAM,WAAW,IAAI,eAAe,EAAE,WAAW,IAAI,aAAa,EAAE,CAAC;AACrE;AAAA,UACE,SAAS,YAAY;AAAA,YACnB,wBAAwB;AAAA,YACxB,mBAAmB;AAAA,YACnB,iBAAiB;AAAA,YACjB,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,YACxB,WAAW;AAAA,YACX,SAAS;AAAA,YACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,UAC/C,CAAC;AAAA,QACH,EAAE,SAAS;AACX,iBAAS,YAAY;AACrB,WAAG,oBAAoB,EAAE;AACzB,eAAO,SAAS,YAAY,EAAE,KAAK,CAAC;AACpC,iBAAS,MAAM;AAAA,MACjB,UAAE;AACA,WAAG,cAAc;AAAA,MACnB;AAAA,IACF,CAAC;AAED,SAAK,kEAAkE,MAAM;AAC3E,YAAM,cAAc,IAAI,eAAe;AAAA,QACrC,WAAW;AAAA,QACX,aAAa;AAAA,MACf,CAAC;AAID,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,oBAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,QAAQ;AAAA,UACR,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,UACxB,WAAW,OAAO,IAAI,GAAG;AAAA,UACzB,SAAS;AAAA,UACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,QAC/C,CAAC;AAAA,MACH;AACA;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,QAAQ;AAAA,UACR,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,UACxB,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,QAC/C,CAAC;AAAA,MACH,EAAE,SAAS;AACX,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAGvC,aAAO,YAAY,MAAM,YAAY,EAAE,KAAK,CAAC;AAC7C,aAAO,YAAY,MAAM,kBAAkB,EAAE,KAAK,CAAC;AAInD;AAAA,QACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,UACxB,WAAW;AAAA,UACX,SAAS;AAAA,UACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,QAC/C,CAAC;AAAA,MACH,EAAE,SAAS;AACX,aAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AACvC,aAAO,YAAY,MAAM,kBAAkB,EAAE,KAAK,CAAC;AACnD,aAAO,YAAY,MAAM,YAAY,EAAE,KAAK,CAAC;AAAA,IAC/C,CAAC;AAED,SAAK,iCAAiC,MAAM;AAC1C,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAG1D,kBAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,SAAS;AAAA,MACX,CAAC;AAED,YAAM,SAAS,YAAY,UAAU;AACrC,aAAO,OAAO,YAAY,EAAE,KAAK,CAAC;AAClC,aAAO,OAAO,MAAM,cAAc,EAAE,KAAK,CAAC;AAC1C,aAAO,OAAO,MAAM,eAAe,EAAE,KAAK,CAAC;AAAA,IAC7C,CAAC;AAED,SAAK,wEAAwE,MAAM;AACjF,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAE1D,kBAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AAED;AAAA,QACE,MACE,YAAY,YAAY;AAAA,UACtB,wBAAwB;AAAA,UACxB,mBAAmB;AAAA,UACnB,iBAAiB;AAAA,UACjB,QAAQ;AAAA,UACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,UAC3B,WAAW;AAAA,UACX,SAAS;AAAA,UACT,QAAQ;AAAA,UACR,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,QAC/C,CAAC;AAAA,QACH;AAAA,MACF;AAEA,YAAM,SAAS,YAAY,YAAY;AAAA,QACrC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,aAAO,MAAM,EAAE,IAAI,SAAS;AAC5B,aAAO,OAAQ,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AACzD,aAAO,OAAQ,aAAa,EAAE,KAAK,CAAC;AACpC,aAAO,OAAQ,MAAM,EAAE,KAAK,WAAW;AAAA,IACzC,CAAC;AAAA,EACH,CAAC;AAED,OAAK,6DAA6D,MAAM;AACtE,UAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAG1D,gBAAY,YAAY;AAAA,MACtB,wBAAwB;AAAA,MACxB,mBAAmB;AAAA,MACnB,iBAAiB;AAAA,MACjB,QAAQ;AAAA,MACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,MAC3B,WAAW;AAAA,MACX,SAAS;AAAA,MACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,IAC/C,CAAC;AAED;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AAAA,IACH,EAAE,SAAS;AAEX;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AAAA,IACH,EAAE,SAAS;AACX,WAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AACvC,WAAO,YAAY,UAAU,EAAE,gBAAgB,EAAE,KAAK,CAAC;AAAA,EACzD,CAAC;AAED,OAAK,+DAA+D,MAAM;AACxE,UAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAG1D,gBAAY,YAAY;AAAA,MACtB,wBAAwB;AAAA,MACxB,mBAAmB;AAAA,MACnB,iBAAiB;AAAA,MACjB,QAAQ;AAAA,MACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,MAC3B,WAAW;AAAA,MACX,SAAS;AAAA,MACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,IAC/C,CAAC;AACD;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AAAA,IACH,EAAE,SAAS;AACX;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AAAA,IACH,EAAE,SAAS;AACX;AAAA,MACE,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AAAA,MACH;AAAA,IACF;AACA,UAAM,SAAS,YAAY,YAAY;AAAA,MACrC,wBAAwB;AAAA,MACxB,mBAAmB;AAAA,MACnB,iBAAiB;AAAA,MACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,MAC3B,WAAW;AAAA,MACX,SAAS;AAAA,MACT,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,IAC/C,CAAC;AACD,WAAO,MAAM,EAAE,IAAI,SAAS;AAC5B,WAAO,OAAQ,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,KAAM,GAAI,CAAC,CAAC;AACrE,WAAO,OAAQ,aAAa,EAAE,KAAK,CAAC;AAAA,EACtC,CAAC;AAED,OAAK,wEAAwE,MAAM;AACjF,UAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,UAAM,WAAW,CAAC,wBAAgC,iBAAyB,UAA+B;AAAA,MACxG;AAAA,MACA,mBAAmB;AAAA,MACnB;AAAA,MACA,MAAM,IAAI,WAAW,CAAC,IAAI,CAAC;AAAA,MAC3B,WAAW;AAAA,MACX,SAAS,2BAA2B;AAAA,MACpC,sBAAsB,mBAAmB,GAAG,eAAe;AAAA,MAC3D,GAAI,2BAA2B,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC;AAAA,IACtD;AAEA,WAAO,YAAY,YAAY,SAAS,GAAG,GAAG,GAAI,CAAC,CAAC,EAAE,SAAS;AAC/D,WAAO,YAAY,YAAY,SAAS,GAAG,GAAG,GAAI,CAAC,CAAC,EAAE,SAAS;AAC/D,oBAAgB,MAAM,YAAY,YAAY,SAAS,GAAG,GAAG,GAAI,CAAC,GAAG,uBAAuB;AAC5F,WAAO,YAAY,YAAY,SAAS,GAAG,GAAG,GAAI,CAAC,CAAC,EAAE,SAAS;AAC/D,WAAO,YAAY,YAAY,SAAS,GAAG,GAAG,GAAI,CAAC,GAAG,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,KAAM,GAAI,CAAC,CAAC;AAAA,EAC9G,CAAC;AAED,OAAK,kDAAkD,MAAM;AAC3D,UAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAE1D;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,MAChD,CAAC;AAAA,IACH,EAAE,SAAS;AACX;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,MAChD,CAAC;AAAA,IACH,EAAE,IAAI,SAAS;AACf;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,GAAG,EAAE;AAAA,MACpD,CAAC;AAAA,IACH,EAAE,SAAS;AACX,WAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AACvC;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,GAAG,EAAE;AAAA,MACpD,CAAC;AAAA,IACH,EAAE,SAAS;AAMX,WAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAEvC,UAAM,SAAS,YAAY,YAAY;AAAA,MACrC,wBAAwB;AAAA,MACxB,mBAAmB;AAAA,MACnB,iBAAiB;AAAA,MACjB,QAAQ;AAAA,MACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,MAC3B,WAAW;AAAA,MACX,SAAS;AAAA,MACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,IAChD,CAAC;AACD,WAAO,MAAM,EAAE,SAAS;AACxB;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,MAChD,CAAC,GAAG;AAAA,IACN,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AAAA,EACxC,CAAC;AAED,OAAK,kEAAkE,MAAM;AAC3E,UAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAE1D;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,6BAA6B;AAAA,QAC7B,cAAc;AAAA,QACd,cAAc;AAAA,QACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,MAChD,CAAC;AAAA,IACH,EAAE,SAAS;AACX;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,MAChD,CAAC,GAAG;AAAA,IACN,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AACtC,WAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAEvC;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,6BAA6B;AAAA,QAC7B,cAAc;AAAA,QACd,cAAc;AAAA,QACd,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,GAAG,EAAE;AAAA,MACpD,CAAC;AAAA,IACH,EAAE,SAAS;AACX,WAAO,YAAY,YAAY,EAAE,KAAK,CAAC;AAAA,EACzC,CAAC;AAED,OAAK,wDAAwD,MAAM;AACjE,UAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAI1D,UAAM,QAAQ,YAAY,YAAY;AAAA,MACpC,wBAAwB;AAAA,MACxB,mBAAmB;AAAA,MACnB,iBAAiB;AAAA,MACjB,QAAQ;AAAA,MACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,MAC3B,WAAW;AAAA,MACX,SAAS;AAAA,MACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,IAChD,CAAC;AACD,WAAO,KAAK,EAAE,SAAS;AACvB,UAAM,YAAY,YAAY,YAAY;AAAA,MACxC,wBAAwB;AAAA,MACxB,mBAAmB;AAAA,MACnB,iBAAiB;AAAA,MACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,MAC3B,WAAW;AAAA,MACX,SAAS;AAAA,MACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,IAChD,CAAC;AACD,WAAO,SAAS,EAAE,IAAI,SAAS;AAG/B;AAAA,MACE,YAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,sBAAsB,mBAAmB,IAAI,GAAG,EAAE;AAAA,MACpD,CAAC;AAAA,IACH,EAAE,SAAS;AAGX,gBAAY,MAAM;AAClB,UAAM,KAAK,YAAY,YAAY;AAAA,MACjC,wBAAwB;AAAA,MACxB,mBAAmB;AAAA,MACnB,iBAAiB;AAAA,MACjB,QAAQ;AAAA,MACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,MAC3B,WAAW;AAAA,MACX,SAAS;AAAA,MACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,IAChD,CAAC;AACD,WAAO,EAAE,EAAE,SAAS;AACpB,UAAM,KAAK,YAAY,YAAY;AAAA,MACjC,wBAAwB;AAAA,MACxB,mBAAmB;AAAA,MACnB,iBAAiB;AAAA,MACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,MAC3B,WAAW;AAAA,MACX,SAAS;AAAA,MACT,sBAAsB,mBAAmB,IAAI,CAAC;AAAA,IAChD,CAAC;AACD,WAAO,EAAE,EAAE,IAAI,SAAS;AACxB,WAAO,GAAI,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AAAA,EACvD,CAAC;AAED,WAAS,kBAAkB,MAAM;AAC/B,SAAK,0DAA0D,MAAM;AAEnE,YAAM,SAAS,IAAI,WAAW,KAAK,IAAI,KAAK,CAAC;AAE7C,aAAO,CAAC,IAAI;AACZ,aAAO,CAAC,IAAI;AAEZ,YAAME,QAAO,IAAI,SAAS,OAAO,MAAM;AACvC,MAAAA,MAAK,UAAU,GAAG,GAAG,KAAK;AAC1B,MAAAA,MAAK,UAAU,GAAG,IAAI,KAAK;AAC3B,MAAAA,MAAK,UAAU,GAAG,KAAK,KAAK;AAG5B,MAAAA,MAAK,UAAU,IAAI,IAAI,KAAK;AAC5B,aAAO,EAAE,IAAI;AACb,aAAO,EAAE,IAAI;AACb,MAAAA,MAAK,UAAU,IAAI,KAAK,KAAK;AAG7B,MAAAA,MAAK,UAAU,IAAI,GAAG,KAAK;AAC3B,MAAAA,MAAK,UAAU,IAAI,GAAG,KAAK;AAE3B,aAAO,EAAE,IAAI;AACb,aAAO,EAAE,IAAI;AACb,aAAO,EAAE,IAAI;AACb,aAAO,EAAE,IAAI;AACb,aAAO,EAAE,IAAI;AAEb,YAAM,OAAO,eAAe,MAAM;AAClC,aAAO,KAAK,iBAAiB,EAAE,KAAK,GAAG;AACvC,aAAO,KAAK,sBAAsB,EAAE,KAAK,CAAC;AAC1C,aAAO,KAAK,OAAO,EAAE,KAAK,IAAI;AAC9B,aAAO,KAAK,2BAA2B,EAAE,KAAK,CAAC;AAC/C,aAAO,KAAK,YAAY,EAAE,KAAK,CAAC;AAChC,aAAO,KAAK,YAAY,EAAE,KAAK,CAAC;AAChC,aAAO,KAAK,KAAK,MAAM,EAAE,KAAK,CAAC;AAAA,IACjC,CAAC;AAED,SAAK,gDAAgD,MAAM;AACzD,YAAM,SAAS,IAAI,WAAW,KAAK,IAAI,IAAI,CAAC;AAC5C,YAAMA,QAAO,IAAI,SAAS,OAAO,MAAM;AACvC,MAAAA,MAAK,UAAU,GAAG,GAAG,KAAK;AAC1B,MAAAA,MAAK,UAAU,GAAG,IAAI,KAAK;AAC3B,MAAAA,MAAK,UAAU,GAAG,KAAK,KAAK;AAC5B,MAAAA,MAAK,UAAU,IAAI,IAAI,KAAK;AAC5B,aAAO,EAAE,IAAI;AACb,MAAAA,MAAK,UAAU,IAAI,KAAK,KAAK;AAC7B,MAAAA,MAAK,UAAU,IAAI,UAAY,KAAK;AACpC,aAAO,IAAI,CAAC,KAAM,GAAI,GAAG,EAAE;AAE3B,YAAM,WAAW,eAAe,MAAM;AACtC,aAAO,SAAS,MAAM,EAAE,KAAK,QAAU;AACvC,aAAO,SAAS,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AAAA,IAC5D,CAAC;AAAA,EACH,CAAC;AAED,WAAS,6BAA6B,MAAM;AAC1C,SAAK,kCAAkC,MAAM;AAC3C,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,SAAS,IAAI,WAAW,KAAK,IAAI,KAAK,CAAC;AAC7C,aAAO,CAAC,IAAI;AACZ,YAAM,SAAS,0BAA0B,QAAQ,WAAW;AAC5D,aAAO,MAAM,EAAE,SAAS;AAAA,IAC1B,CAAC;AAED,SAAK,qDAAqD,MAAM;AAC9D,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,SAAS,IAAI,WAAW,KAAK,IAAI,KAAK,CAAC;AAC7C,aAAO,CAAC,IAAI;AACZ,aAAO,CAAC,IAAI;AACZ,YAAMA,QAAO,IAAI,SAAS,OAAO,MAAM;AACvC,MAAAA,MAAK,UAAU,GAAG,GAAG,KAAK;AAC1B,MAAAA,MAAK,UAAU,GAAG,KAAK,KAAK;AAC5B,MAAAA,MAAK,UAAU,GAAG,GAAG,KAAK;AAE1B,MAAAA,MAAK,UAAU,IAAI,IAAI,KAAK;AAC5B,aAAO,EAAE,IAAI;AACb,MAAAA,MAAK,UAAU,IAAI,IAAI,KAAK;AAC5B,MAAAA,MAAK,UAAU,IAAI,GAAG,KAAK;AAC3B,MAAAA,MAAK,UAAU,IAAI,GAAG,KAAK;AAE3B,aAAO,EAAE,IAAI;AACb,aAAO,EAAE,IAAI;AACb,aAAO,EAAE,IAAI;AACb,aAAO,EAAE,IAAI;AAEb,YAAM,SAAS,0BAA0B,QAAQ,WAAW;AAC5D,aAAO,MAAM,EAAE,IAAI,SAAS;AAC5B,aAAO,OAAQ,iBAAiB,EAAE,KAAK,EAAE;AACzC,aAAO,OAAQ,OAAO,EAAE,KAAK,IAAI;AAAA,IACnC,CAAC;AAAA,EACH,CAAC;AAED,WAAS,8BAA8B,MAAM;AAC3C,SAAK,uEAAuE,MAAM;AAChF,aAAO,qBAAqB,CAAC,EAAE,QAAQ,YAAY,GAAG,EAAE,QAAQ,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,WAAW;AAAA,IACnG,CAAC;AAED,SAAK,qDAAqD,MAAM;AAC9D,aAAO,qBAAqB,CAAC,EAAE,QAAQ,YAAY,GAAG,EAAE,QAAQ,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO;AAEvF,aAAO,qBAAqB,CAAC,EAAE,QAAQ,MAAM,GAAG,EAAE,QAAQ,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO;AAAA,IACzF,CAAC;AAED,SAAK,2EAA2E,MAAM;AACpF,aAAO,qBAAqB,CAAC,EAAE,QAAQ,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS;AAC1E,aAAO,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS;AAAA,IACnD,CAAC;AAED,SAAK,8EAAyE,MAAM;AAClF,aAAO,qBAAqB,CAAC,EAAE,QAAQ,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO;AAClE,aAAO,qBAAqB,CAAC,CAAC,GAAG,EAAE,QAAQ,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO;AAAA,IACpE,CAAC;AAED,SAAK,wCAAwC,MAAM;AACjD,aAAO,qBAAqB,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS;AAAA,IACjD,CAAC;AAED,SAAK,qCAAqC,MAAM;AAC9C,aAAO,uBAAuB,SAAS,WAAW,CAAC,EAAE,KAAK,OAAO;AACjE,aAAO,uBAAuB,WAAW,WAAW,CAAC,EAAE,KAAK,SAAS;AACrE,aAAO,uBAAuB,WAAW,KAAK,CAAC,EAAE,KAAK,OAAO;AAAA,IAC/D,CAAC;AAED,SAAK,yEAAyE,MAAM;AAKlF,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,kBAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,YAAM,SAAS,YAAY,YAAY;AAAA,QACrC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,aAAO,MAAM,EAAE,IAAI,SAAS;AAC5B,aAAO,OAAQ,aAAa,EAAE,KAAK,CAAC;AACpC,aAAO,OAAQ,MAAM,EAAE,KAAK,WAAW;AACvC,aAAO,OAAQ,kBAAkB,EAAE,KAAK,OAAO;AAAA,IACjD,CAAC;AAED,SAAK,4DAA4D,MAAM;AACrE,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,kBAAY,YAAY;AAAA,QACtB,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,YAAM,SAAS,YAAY,YAAY;AAAA,QACrC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,MAAM,IAAI,WAAW,CAAC,GAAI,CAAC;AAAA,QAC3B,WAAW;AAAA,QACX,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,sBAAsB,mBAAmB,GAAG,CAAC;AAAA,MAC/C,CAAC;AACD,aAAO,MAAM,EAAE,IAAI,SAAS;AAC5B,aAAO,OAAQ,kBAAkB,EAAE,KAAK,WAAW;AAAA,IACrD,CAAC;AAED,SAAK,+CAA+C,MAAM;AACxD,YAAM,cAAc,IAAI,eAAe,EAAE,WAAW,IAAK,CAAC;AAC1D,YAAM,SAAS,YAAY,YAAY;AAAA,QACrC,wBAAwB;AAAA,QACxB,mBAAmB;AAAA,QACnB,iBAAiB;AAAA,QACjB,QAAQ;AAAA,QACR,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,SAAS;AAAA,MACX,CAAC;AACD,aAAO,MAAM,EAAE,IAAI,SAAS;AAC5B,aAAO,OAAQ,kBAAkB,EAAE,KAAK,SAAS;AAAA,IACnD,CAAC;AAAA,EACH,CAAC;AACH;;;ACvmHA,SAAS,UACP,kBACA,mBACA,6BACA,cACW;AACX,SAAO,KAAK,UAAU,CAAC,oBAAoB,MAAM,mBAAmB,6BAA6B,YAAY,CAAC;AAChH;AAGA,SAAS,eAAe,KAAoC;AAC1D,QAAM,OAAQ,KAAK,MAAM,GAAG,EAA8C,CAAC;AAC3E,SAAO,QAAQ;AACjB;AAGA,SAAS,cAAc,KAAiC;AACtD,QAAM,CAAC,MAAM,mBAAmB,6BAA6B,YAAY,IACvE,KAAK,MAAM,GAAG;AAChB,SAAO;AAAA,IACL,kBAAkB,QAAQ;AAAA,IAC1B;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAqEO,IAAM,qBAAN,cAAiC,MAAM;AAAA,EAG5C,YAAqB,MAA8B,SAAiB;AAClE,UAAM,OAAO;AADM;AAFrB,SAAS,OAAO;AAAA,EAIhB;AACF;AAzJA,IAAAC,eAAA;AAiNO,IAAM,iBAAN,MAAqB;AAAA,EAqB1B,YAAY,SAAgC;AArBvC;AACL,uBAAAA;AACA;AACA;AACA;AACA,uCAAyC,oBAAI,IAAI;AAEjD;AAAA,iCAA0C,oBAAI,IAAI;AAMlD;AAAA;AAAA;AAAA;AAAA;AAAA,iCAA2B,oBAAI,IAAI;AACnC,+BAA8B;AAAA,MAC5B,iBAAiB;AAAA,MACjB,oBAAoB;AAAA,MACpB,iBAAiB;AAAA,MACjB,gBAAgB;AAAA,IAClB;AAGE,UAAM,EAAE,aAAa,qBAAqB,sBAAsB,UAAU,IAAI;AAC9E,QAAI,CAAC,OAAO,UAAU,WAAW,KAAK,eAAe,GAAG;AACtD,YAAM,IAAI,MAAM,yDAAyD;AAAA,IAC3E;AACA,QAAI,CAAC,OAAO,UAAU,oBAAoB,KAAK,wBAAwB,GAAG;AACxE,YAAM,IAAI,MAAM,kEAAkE;AAAA,IACpF;AACA,uBAAKA,eAAe;AACpB,uBAAK,sBAAuB;AAC5B,uBAAK,uBAAwB;AAC7B,uBAAK,YAAa;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8BA,qBACE,kBACA,mBACA,6BACA,cACA,MACuB;AACvB,UAAM,MAAM,UAAU,kBAAkB,mBAAmB,6BAA6B,YAAY;AACpG,uBAAK,UAAS,OAAO,GAAG;AACxB,uBAAK,gBAAe,IAAI,KAAK,IAAI;AACjC,WAAO,sBAAK,2CAAL,WAAkB,KAAK;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,KAA4C;AACjD,QAAI,IAAI,gCAAgC,UAAa,IAAI,iBAAiB,QAAW;AAEnF,yBAAK,QAAO;AACZ,aAAO,gBAAgB,GAAG;AAAA,IAC5B;AACA,UAAM,SAAS,IAAI,gBAAgB;AACnC,UAAM,MAAM;AAAA,MACV,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN;AAEA,QAAI,mBAAK,UAAS,IAAI,GAAG,GAAG;AAM1B,aAAO;AAAA,IACT;AAEA,UAAM,UAAU,IAAI,KAAK;AACzB,UAAM,eAAe,mBAAK,gBAAe,IAAI,GAAG;AAEhD,QAAI,WAAW,KAAK,CAAC,mBAAK,UAAS,IAAI,GAAG,GAAG;AAC3C,YAAM,gBAAgB,iBAAiB,SACnC,CAAC,mBAAK,wBACN,YAAY;AAChB,UAAI,eAAe;AACjB,2BAAK,QAAO;AACZ,8BAAK,sCAAL,WAAa;AACb,eAAO,gBAAgB,GAAG;AAAA,MAC5B;AAAA,IAGF;AAMA,UAAM,UAAU,SAAS;AACzB,QAAI,iBAAiB,UAAa,UAAU,cAAc;AACxD,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,UAAM,WAAW,mBAAK,UAAS,IAAI,GAAG;AACtC,QAAI,aAAa,QAAW;AAC1B,UAAI,SAAS,SAAS,IAAI,MAAM,GAAG;AACjC,cAAM,IAAI;AAAA,UACR;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,UAAI,SAAS,SAAS,QAAQ,mBAAK,wBAAuB;AACxD,cAAM,IAAI;AAAA,UACR;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,iBAAW,CAAC,WAAW,GAAG,KAAK,SAAS,UAAU;AAChD,cAAM,SAAS,YAAY,IAAI,KAAK;AACpC,YAAI,SAAS,UAAU,YAAY,SAAS;AAC1C,gBAAM,IAAI;AAAA,YACR;AAAA,YACA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,UAAU;AACd,QAAI,YAAY,QAAW;AACzB,UAAI,mBAAK,UAAS,QAAQ,mBAAKA,eAAc,uBAAK,kDAAL;AAC7C,gBAAU,EAAE,UAAU,oBAAI,IAAI,GAAG,WAAW,KAAK,IAAI,EAAE;AACvD,yBAAK,UAAS,IAAI,KAAK,OAAO;AAAA,IAChC;AACA,YAAQ,SAAS,IAAI,QAAQ,GAAG;AAEhC,QAAI,iBAAiB,OAAW,QAAO;AACvC,WAAO,sBAAK,2CAAL,WAAkB,KAAK;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqEA,gBAAgB,WAAyB;AACvC,UAAM,MAAM,KAAK,IAAI;AACrB,eAAW,CAAC,KAAK,OAAO,KAAK,CAAC,GAAG,mBAAK,SAAQ,GAAG;AAC/C,UAAI,MAAM,QAAQ,YAAY,WAAW;AACvC,2BAAK,UAAS,OAAO,GAAG;AACxB,2BAAK,QAAO;AACZ,8BAAK,sCAAL,WAAa;AACb,8BAAK,uCAAL,WAAc;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAAA,EAEA,QAAc;AACZ,uBAAK,UAAS,MAAM;AACpB,uBAAK,gBAAe,MAAM;AAC1B,uBAAK,UAAS,MAAM;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAAY,kBAAgC;AAC1C,eAAW,OAAO,mBAAK,UAAS,KAAK,GAAG;AACtC,UAAI,eAAe,GAAG,MAAM,iBAAkB,oBAAK,UAAS,OAAO,GAAG;AAAA,IACxE;AACA,eAAW,OAAO,mBAAK,gBAAe,KAAK,GAAG;AAC5C,UAAI,eAAe,GAAG,MAAM,iBAAkB,oBAAK,gBAAe,OAAO,GAAG;AAAA,IAC9E;AACA,eAAW,OAAO,mBAAK,WAAU;AAC/B,UAAI,eAAe,GAAG,MAAM,iBAAkB,oBAAK,UAAS,OAAO,GAAG;AAAA,IACxE;AAAA,EACF;AAAA,EAEA,IAAI,QAA6B;AAC/B,WAAO,EAAE,GAAG,mBAAK,QAAO;AAAA,EAC1B;AAAA,EAEA,IAAI,eAAuB;AACzB,WAAO,mBAAK,UAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,yBAAiC;AACnC,WAAO,mBAAK,gBAAe;AAAA,EAC7B;AAAA;AAAA,EAGA,IAAI,oBAA4B;AAC9B,WAAO,mBAAK,UAAS;AAAA,EACvB;AACF;AAjSEA,gBAAA;AACA;AACA;AACA;AACA;AAEA;AAMA;AACA;AAdK;AAAA;AAoCL,aAAQ,SAAC,KAAsB;AArPjC;AAsPI,2BAAK,gBAAL,8BAAkB,cAAc,GAAG;AACrC;AAAA;AAAA;AAAA;AAAA;AAqIA,iBAAY,SAAC,KAAgB,MAAqC;AAChE,QAAM,UAAU,mBAAK,UAAS,IAAI,GAAG;AACrC,MAAI,YAAY,OAAW,QAAO;AAClC,MAAI,WAAW;AACf,QAAM,gBAAgB,CAAC,GAAG,QAAQ,SAAS,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACvE,aAAW,aAAa,eAAe;AACrC,QAAI,cAAc,SAAU,QAAO;AACnC,gBAAY,QAAQ,SAAS,IAAI,SAAS,EAAG,KAAK;AAAA,EACpD;AACA,MAAI,aAAa,KAAM,QAAO;AAE9B,qBAAK,UAAS,OAAO,GAAG;AACxB,qBAAK,QAAO;AACZ,wBAAK,sCAAL,WAAa;AACb,SAAO,aAAa,QAAQ,UAAU,aAAa;AACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAeA,YAAO,SAAC,KAAsB;AAC5B,qBAAK,gBAAe,OAAO,GAAG;AAC9B,qBAAK,UAAS,IAAI,GAAG;AACrB,SAAO,mBAAK,UAAS,OAAO,mBAAKA,gBAAc;AAC7C,UAAM,SAAS,mBAAK,UAAS,OAAO,EAAE,KAAK,EAAE;AAC7C,QAAI,WAAW,OAAW;AAC1B,uBAAK,UAAS,OAAO,MAAM;AAAA,EAC7B;AACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASA,wBAAmB,WAAS;AAC1B,QAAM,SAAS,mBAAK,UAAS,KAAK,EAAE,KAAK,EAAE;AAC3C,MAAI,WAAW,OAAW;AAC1B,qBAAK,UAAS,OAAO,MAAM;AAC3B,qBAAK,QAAO;AACZ,wBAAK,sCAAL,WAAa;AACb,wBAAK,uCAAL,WAAc;AAChB;AAmEF,SAAS,gBAAgB,KAAqC;AAC5D,SAAO;AAAA,IACL,mBAAmB,IAAI;AAAA,IACvB,6BAA6B,IAAI,+BAA+B;AAAA,IAChE,cAAc,IAAI,gBAAgB;AAAA,IAClC,MAAM,IAAI;AAAA,IACV,eAAe,IAAI;AAAA,IACnB,WAAW,IAAI;AAAA,IACf,SAAS,IAAI;AAAA,IACb,UAAU,IAAI;AAAA,IACd,uBAAuB,IAAI;AAAA,IAC3B,+BAA+B,IAAI;AAAA,IACnC,kBAAkB,IAAI;AAAA,IACtB,gBAAgB;AAAA,IAChB,eAAe,IAAI;AAAA,IACnB,QAAQ,IAAI;AAAA;AAAA,IAEZ,oBAAoB,IAAI;AAAA,EAC1B;AACF;AAEA,SAAS,aACP,UACA,eACgB;AAChB,QAAM,YAAY,cAAc,OAAO,CAAC,KAAK,WAAW,MAAM,SAAS,IAAI,MAAM,EAAG,KAAK,YAAY,CAAC;AACtG,QAAM,OAAO,IAAI,WAAW,SAAS;AACrC,MAAI;AACJ,MAAI;AACJ,MAAI,cAAc;AAClB,MAAI;AACJ,MAAI,gBAAgB;AAIpB,MAAI,qBACF,cAAc,WAAW,IAAI,YAAY;AAC3C,aAAW,UAAU,eAAe;AAClC,UAAM,MAAM,SAAS,IAAI,MAAM;AAC/B,yBACE,uBAAuB,WAAW,IAAI,uBAAuB,UACzD,UACA,uBAAuB,aAAa,IAAI,uBAAuB,YAC7D,YACA;AACR,SAAK,IAAI,IAAI,MAAM,WAAW;AAC9B,mBAAe,IAAI,KAAK;AACxB,qBAAiB,IAAI;AACrB,QAAI,IAAI,0BAA0B,QAAW;AAC3C,OAAC,kDAA0B,CAAC,IAAG,KAAK,GAAG,IAAI,qBAAqB;AAAA,IAClE;AACA,QAAI,IAAI,kCAAkC,QAAW;AACnD,OAAC,kEAAkC,CAAC,IAAG,KAAK,GAAG,IAAI,6BAA6B;AAAA,IAClF;AACA,QAAI,UAAU,OAAW,SAAQ;AAAA,EACnC;AACA,SAAO;AAAA,IACL,mBAAmB,MAAO;AAAA,IAC1B,6BAA6B,MAAO;AAAA,IACpC,cAAc,MAAO;AAAA,IACrB;AAAA,IACA,eAAe,MAAO;AAAA,IACtB,WAAW,MAAO;AAAA,IAClB,SAAS,MAAO;AAAA,IAChB,UAAU,MAAO;AAAA,IACjB;AAAA,IACA;AAAA,IACA,kBAAkB,MAAO;AAAA,IACzB,gBAAgB,SAAS;AAAA,IACzB;AAAA,IACA,QAAQ,MAAO;AAAA,IACf,oBAAoB;AAAA,EACtB;AACF;AAMA,IAAI,QAAoB;AACtB,QAAM,EAAE,UAAU,MAAM,OAAO,IAAI;AAEnC,QAAM,WAAW,CAAC,YAA4C,CAAC,MAC7D,IAAI,eAAe;AAAA,IACjB,aAAa;AAAA,IACb,qBAAqB;AAAA,IACrB,sBAAsB;AAAA,IACtB,GAAG;AAAA,EACL,CAAC;AAEH,QAAM,MAAM,CACV,KACA,OACA,QACA,QACA,MACA,WACA,SACA,qBAA6C,iBACzB;AAAA,IACpB,mBAAmB;AAAA,IACnB,MAAM,IAAI,WAAW,IAAI;AAAA,IACzB;AAAA,IACA,eAAe;AAAA,IACf;AAAA,IACA,cAAc;AAAA,IACd,6BAA6B;AAAA,IAC7B,cAAc;AAAA,IACd,uBAAuB,CAAC,MAAM;AAAA,IAC9B;AAAA,EACF;AAEA,WAAS,kBAAkB,MAAM;AAC/B,SAAK,sEAAsE,MAAM;AAC/E,YAAM,IAAI,SAAS;AACnB,YAAM,MAAM,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC;AACnE,aAAO,GAAG,EAAE,IAAI,SAAS;AACzB,aAAO,IAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AACzD,aAAO,IAAK,cAAc,EAAE,KAAK,CAAC;AAClC,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAAA,IAC/B,CAAC;AAED,SAAK,sEAAsE,MAAM;AAC/E,YAAM,IAAI,SAAS;AACnB,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,CAAC;AAC7C,YAAM,MAAM,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC;AACnE,aAAO,KAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,IAC3D,CAAC;AAED,SAAK,8DAA8D,MAAM;AACvE,YAAM,IAAI,SAAS;AACnB,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAE9C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAE7B,YAAM,MAAM,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,OAAO,KAAK,CAAC;AACrE,aAAO,KAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC;AACzE,aAAO,KAAK,cAAc,EAAE,KAAK,CAAC;AAClC,aAAO,KAAK,OAAO,EAAE,KAAK,IAAI;AAC9B,aAAO,KAAK,SAAS,EAAE,KAAK,KAAK;AACjC,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAC7B,aAAO,EAAE,MAAM,eAAe,EAAE,KAAK,CAAC;AAAA,IACxC,CAAC;AAED,SAAK,6CAA6C,MAAM;AACtD,YAAM,IAAI,SAAS;AACnB,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAE9C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,OAAO,KAAK,CAAC,CAAC,EAAE,SAAS;AAC5E,YAAM,MAAM,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC;AACnE,aAAO,KAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC;AAAA,IAC3E,CAAC;AAED,SAAK,uDAAuD,MAAM;AAKhE,YAAM,IAAI,SAAS;AACnB,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,EAAE,SAAS;AACrE,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AACpE,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAAA,IAC/B,CAAC;AAED,SAAK,8EAA8E,MAAM;AAKvF,YAAM,IAAI,SAAS,EAAE,qBAAqB,KAAK,CAAC;AAChD,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAE7B,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAC9C,YAAM,MAAM,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,OAAO,KAAK,CAAC;AACrE,aAAO,KAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC;AAAA,IAC3E,CAAC;AAED,SAAK,gCAAgC,MAAM;AACzC,YAAM,IAAI,SAAS;AACnB,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAC9C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,MAAM,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAClE,QAAQ,kBAAkB;AAAA,IAC/B,CAAC;AAED,SAAK,qCAAqC,MAAM;AAC9C,YAAM,IAAI,SAAS;AACnB,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAC9C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,MAAM,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAClE,QAAQ,kBAAkB;AAAA,IAC/B,CAAC;AAED,SAAK,2CAA2C,MAAM;AACpD,YAAM,IAAI,SAAS;AACnB,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,CAAC;AAC7C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,MAAM,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,OAAO,KAAK,CAAC,CAAC,EACpE,QAAQ,kBAAkB;AAAA,IAC/B,CAAC;AAED,SAAK,8CAA8C,MAAM;AACvD,YAAM,IAAI,SAAS,EAAE,sBAAsB,EAAE,CAAC;AAC9C,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,GAAG;AAC/C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AACjE,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,EAAE,SAAS;AAClE,aAAO,MAAM,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,EAC1D,QAAQ,kBAAkB;AAAA,IAC/B,CAAC;AAED,SAAK,uEAAuE,MAAM;AAOhF,YAAM,YAA+B,CAAC;AACtC,YAAM,IAAI,SAAS,EAAE,aAAa,GAAG,WAAW,OAAK,UAAU,KAAK,CAAC,EAAE,CAAC;AACxE,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAC9C,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAC9C,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAE9C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,SAAS,EAAE,QAAQ,CAAC,CAAC;AAG5B,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,SAAS,EAAE,QAAQ,CAAC;AAAA,QACzB,kBAAkB;AAAA,QAClB,mBAAmB;AAAA,QACnB,6BAA6B;AAAA,QAC7B,cAAc;AAAA,MAChB,CAAC,CAAC;AAGF,QAAE,gBAAgB,EAAE;AACpB,aAAO,UAAU,IAAI,OAAK,EAAE,YAAY,CAAC,EAAE,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC;AAG/D,YAAM,IAAI,SAAS,EAAE,aAAa,GAAG,WAAW,OAAK,UAAU,KAAK,CAAC,EAAE,CAAC;AACxE,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAC9C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,EAAE,IAAI,SAAS;AAC/E,aAAO,UAAU,IAAI,OAAK,EAAE,YAAY,CAAC,EAAE,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC;AAAA,IACjE,CAAC;AAED,SAAK,wEAAwE,MAAM;AAIjF,YAAM,IAAI,SAAS,EAAE,aAAa,EAAE,CAAC;AACrC,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAC9C,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAC9C,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAE9C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAG7B,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAC7B,aAAO,EAAE,MAAM,cAAc,EAAE,KAAK,CAAC;AAGrC,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,KAAK,CAAC,GAAG,IAAI,EACnE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AACzD,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,KAAK,CAAC,GAAG,IAAI,EACnE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AAGzD,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAC9C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,KAAK,CAAC,GAAG,IAAI,EACnE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,IAC3D,CAAC;AAED,SAAK,yEAAyE,MAAM;AAClF,YAAM,IAAI,SAAS;AACnB,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,EAAE;AAC9C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,OAAO,KAAK,CAAC,CAAC,EAAE,IAAI,SAAS;AAIhF,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAAA,IAC5E,CAAC;AAED,SAAK,wDAAwD,MAAM;AACjE,YAAM,IAAI,SAAS;AACnB,QAAE,qBAAqB,cAAc,GAAG,GAAG,IAAI,EAAE;AACjD,QAAE,qBAAqB,SAAS,GAAG,GAAG,IAAI,EAAE;AAC5C,YAAM,QAAQ,EAAE,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,GAAG,kBAAkB,aAAa;AAClG,YAAM,QAAQ,EAAE,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,GAAG,kBAAkB,QAAQ;AAC7F,aAAO,EAAE,OAAO,KAAK,CAAC,EAAE,SAAS;AACjC,aAAO,EAAE,OAAO,KAAK,CAAC,EAAE,SAAS;AAEjC,QAAE,YAAY,YAAY;AAC1B,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAE7B,YAAM,YAAY,EAAE,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,KAAK,GAAG,kBAAkB,QAAQ;AAClG,aAAO,EAAE,OAAO,SAAS,GAAG,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,IAC1F,CAAC;AAED,SAAK,0CAA0C,MAAM;AACnD,YAAM,IAAI,SAAS;AACnB,QAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,CAAC;AAC7C,QAAE,MAAM;AAIR,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,GAAG,IAAI,EAClE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,IAC5C,CAAC;AAED,SAAK,+CAA+C,MAAM;AAGxD,YAAM,IAAI,SAAS,EAAE,aAAa,GAAG,qBAAqB,KAAK,CAAC;AAChE,eAAS,IAAI,GAAG,IAAI,KAAM,KAAK;AAC7B,eAAO,EAAE,qBAAqB,QAAW,GAAG,GAAG,GAAG,EAAE,CAAC,EAAE,SAAS;AAChE,eAAO,EAAE,OAAO,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AACzE,eAAO,EAAE,OAAO,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,EAAE,IAAI,SAAS;AAAA,MAChF;AACA,aAAO,EAAE,MAAM,eAAe,EAAE,KAAK,GAAI;AACzC,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAC7B,aAAO,EAAE,sBAAsB,EAAE,KAAK,CAAC;AACvC,aAAO,EAAE,iBAAiB,EAAE,oBAAoB,CAAC;AAAA,IACnD,CAAC;AAED,SAAK,2DAA2D,MAAM;AACpE,YAAM,IAAI,SAAS,EAAE,aAAa,GAAG,qBAAqB,KAAK,CAAC;AAChE,eAAS,IAAI,GAAG,IAAI,KAAM,KAAK;AAC7B,eAAO,EAAE,qBAAqB,QAAW,GAAG,GAAG,GAAG,EAAE,CAAC,EAAE,SAAS;AAChE,eAAO,EAAE,OAAO,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAAA,MAE3E;AACA,QAAE,gBAAgB,EAAE;AACpB,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAC7B,aAAO,EAAE,sBAAsB,EAAE,KAAK,CAAC;AAAA,IACzC,CAAC;AAED,SAAK,6DAA6D,MAAM;AAKtE,YAAM,IAAI,SAAS,EAAE,qBAAqB,KAAK,CAAC;AAChD,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAE7B,YAAM,MAAM,EAAE,qBAAqB,QAAW,GAAG,GAAG,IAAI,CAAC;AACzD,aAAO,KAAK,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AACzD,aAAO,KAAK,cAAc,EAAE,KAAK,CAAC;AAClC,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAAA,IAC/B,CAAC;AAED,SAAK,qDAAqD,MAAM;AAI9D,YAAM,IAAI,SAAS,EAAE,aAAa,EAAE,CAAC;AACrC,iBAAW,KAAK,CAAC,IAAI,IAAI,EAAE,EAAG,GAAE,qBAAqB,QAAW,GAAG,GAAG,GAAG,EAAE;AAC3E,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAG7B,aAAO,MAAM,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,EACnE,QAAQ,kBAAkB;AAC7B,aAAO,EAAE,MAAM,cAAc,EAAE,KAAK,CAAC;AACrC,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAG7B,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,KAAK,CAAC,GAAG,IAAI,EACnE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,IAC3D,CAAC;AAED,SAAK,qDAAqD,MAAM;AAC9D,YAAM,IAAI,SAAS,EAAE,aAAa,EAAE,CAAC;AACrC,iBAAW,KAAK,CAAC,IAAI,EAAE,EAAG,GAAE,qBAAqB,QAAW,GAAG,GAAG,GAAG,EAAE;AACvE,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,SAAS;AAC1E,aAAO,EAAE,MAAM,cAAc,EAAE,KAAK,CAAC;AAGrC,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,EAAE,SAAS;AAC3E,aAAO,EAAE,YAAY,EAAE,KAAK,CAAC;AAAA,IAC/B,CAAC;AAAA,EACH,CAAC;AAED,WAAS,oCAAoC,MAAM;AACjD,SAAK,oEAAoE,MAAM;AAK7E,YAAM,IAAI,SAAS;AACnB,QAAE,qBAAqB,QAAW,GAAG,GAAG,GAAG,CAAC;AAC5C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,MAAM,WAAW,CAAC,CAAC,EAAE,SAAS;AAC5E,YAAM,OAAO,EAAE,OAAO,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,OAAO,OAAO,CAAC;AACnE,aAAO,IAAI,EAAE,IAAI,SAAS;AAC1B,aAAO,KAAM,cAAc,EAAE,KAAK,CAAC;AACnC,aAAO,KAAM,kBAAkB,EAAE,KAAK,OAAO;AAAA,IAC/C,CAAC;AAED,SAAK,4DAA4D,MAAM;AACrE,YAAM,IAAI,SAAS;AACnB,QAAE,qBAAqB,QAAW,GAAG,GAAG,GAAG,CAAC;AAC5C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,MAAM,WAAW,CAAC,CAAC,EAAE,SAAS;AAC5E,YAAM,OAAO,EAAE,OAAO,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,OAAO,SAAS,CAAC;AACrE,aAAO,IAAI,EAAE,IAAI,SAAS;AAC1B,aAAO,KAAM,kBAAkB,EAAE,KAAK,SAAS;AAAA,IACjD,CAAC;AAED,SAAK,qDAAqD,MAAM;AAC9D,YAAM,IAAI,SAAS;AACnB,QAAE,qBAAqB,QAAW,GAAG,GAAG,GAAG,CAAC;AAC5C,aAAO,EAAE,OAAO,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,MAAM,WAAW,CAAC,CAAC,EAAE,SAAS;AAC5E,YAAM,OAAO,EAAE,OAAO,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,OAAO,WAAW,CAAC;AACvE,aAAO,IAAI,EAAE,IAAI,SAAS;AAC1B,aAAO,KAAM,kBAAkB,EAAE,KAAK,WAAW;AAAA,IACnD,CAAC;AAED,SAAK,mEAAmE,MAAM;AAC5E,YAAM,IAAI,SAAS;AACnB,YAAM,OAAO,EAAE,OAAO,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC;AAClE,aAAO,IAAI,EAAE,IAAI,SAAS;AAC1B,aAAO,KAAM,cAAc,EAAE,KAAK,CAAC;AACnC,aAAO,KAAM,kBAAkB,EAAE,KAAK,OAAO;AAAA,IAC/C,CAAC;AAAA,EACH,CAAC;AACH;;;ACxlBO,SAAS,0BAA0B,MAA8B;AACtE,QAAM,MAAgB,CAAC;AACvB,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,IAAI,KAAK,CAAC;AAChB,QAAI,SAAS,KAAK,MAAM,KAAQ,IAAI,IAAI,KAAK,UAAU,KAAK,IAAI,CAAC,KAAK,GAAM;AAC1E,cAAQ;AACR;AAAA,IACF;AACA,QAAI,KAAK,CAAC;AACV,YAAQ,MAAM,IAAI,QAAQ,IAAI;AAAA,EAChC;AACA,SAAO,WAAW,KAAK,GAAG;AAC5B;AAMO,SAAS,kBAAkB,MAAkB,aAAa,GAAiB;AAChF,QAAM,OAAqB,CAAC;AAC5B,MAAI,IAAI;AACR,SAAO,IAAI,cAAc,KAAK,QAAQ;AACpC,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,YAAY,IAAK,OAAO,OAAO,IAAK,KAAK,IAAI,CAAC;AAClE,SAAK;AACL,QAAI,OAAO,KAAK,IAAI,MAAM,KAAK,OAAQ;AACvC,SAAK,KAAK,KAAK,SAAS,GAAG,IAAI,GAAG,CAAC;AACnC,SAAK;AAAA,EACP;AACA,SAAO;AACT;AAWO,SAAS,qBAAqB,MAAkB,aAAa,GAAY;AAC9E,MAAI,IAAI;AACR,MAAI,QAAQ;AACZ,SAAO,IAAI,cAAc,KAAK,QAAQ;AACpC,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,YAAY,IAAK,OAAO,OAAO,IAAK,KAAK,IAAI,CAAC;AAClE,SAAK;AACL,QAAI,OAAO,KAAK,IAAI,MAAM,KAAK,OAAQ,QAAO;AAC9C,SAAK;AACL;AAAA,EACF;AACA,SAAO,QAAQ,KAAK,MAAM,KAAK;AACjC;AAgCO,SAAS,wBACd,MACA,UAAwC,CAAC,GACtB;AACnB,MAAI,qBAAqB,IAAI,EAAG,QAAO,EAAE,MAAM,kBAAkB,IAAI,GAAG,QAAQ,OAAO;AACvF,MAAI,SAAS,IAAI,EAAG,QAAO,EAAE,MAAM,oBAAoB,IAAI,GAAG,QAAQ,SAAS;AAC/E,MAAI,QAAQ,qBAAqB,MAAM;AACrC,UAAM,UAAU,yBAAyB,IAAI;AAC7C,QAAI,QAAQ,SAAS,EAAG,QAAO,EAAE,MAAM,SAAS,QAAQ,eAAe;AAAA,EACzE;AACA,MAAI,uBAAuB,IAAI,EAAG,QAAO,EAAE,MAAM,CAAC,IAAI,GAAG,QAAQ,UAAU;AAC3E,QAAM,OAAO,kBAAkB,IAAI;AACnC,SAAO,EAAE,MAAM,QAAQ,KAAK,SAAS,IAAI,SAAS,UAAU;AAC9D;AA0GO,SAAS,SAAS,MAA2B;AAClD,MAAI,KAAK,UAAU,KAAK,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,MAChD,KAAK,CAAC,MAAM,KAAM,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,IAAK;AACvD,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAoBO,SAAS,oBAAoB,MAAgC;AAClE,QAAM,WAAyB,CAAC;AAChC,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,SAAS,GAAG;AAC1B,QAAI,KAAK,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG;AACtC,UAAI,QAAQ;AACZ,UAAI,KAAK,IAAI,CAAC,MAAM,EAAG,SAAQ;AAAA,eACtB,KAAK,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,KAAK,UAAU,KAAK,IAAI,CAAC,MAAM,EAAG,SAAQ;AAChF,UAAI,QAAQ,GAAG;AACb,cAAM,WAAW,IAAI;AACrB,YAAI,SAAS,KAAK;AAClB,iBAAS,IAAI,WAAW,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;AACnD,cAAI,KAAK,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,MAAM,MAChC,KAAK,IAAI,CAAC,MAAM,KAAM,KAAK,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,KAAK,UAAU,KAAK,IAAI,CAAC,MAAM,IAAK;AAC1F,qBAAS;AACT;AAAA,UACF;AAAA,QACF;AACA,YAAI,SAAS,SAAU,UAAS,KAAK,KAAK,SAAS,UAAU,MAAM,CAAC;AACpE,YAAI;AACJ;AAAA,MACF;AAAA,IACF;AACA;AAAA,EACF;AACA,SAAO;AACT;AA6CO,SAAS,qBACd,MACA,UAAwC,CAAC,GACpB;AACrB,QAAM,OAAO,iCAAiC,MAAM,OAAO;AAC3D,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,MAAI,gBAAgB;AACpB,MAAI,iBAAiB;AACrB,MAAI,SAAS;AACb,aAAW,OAAO,MAAM;AACtB,aAAS;AACT,UAAM,UAAU,IAAI,CAAC,MAAM,SAAY,IAAI,CAAC,IAAI,KAAO;AACvD,QAAI,YAAY,KAAK,YAAY,EAAG,QAAO;AAC3C,QAAI,YAAY,GAAG;AACjB,UAAI,iBAAiB,GAAG,EAAG,iBAAgB;AAAA,UACtC,kBAAiB;AAAA,IACxB;AAAA,EACF;AACA,MAAI,iBAAiB,CAAC,eAAgB,QAAO;AAC7C,SAAO,SAAS,QAAQ;AAC1B;AAmBO,SAAS,sBAAsB,OAAgC;AAKpE,QAAM,KAAK,OAAO,UAAU,WACxB,SAAS,MAAM,SAAS,cACtB,OAAO,KAAK,IACZ,SACF,OAAO,cAAc,KAAK,KAAK,SAAS,KAAK,SAAS,aACpD,QACA;AACN,MAAI,OAAO,QAAW;AACpB,UAAM,IAAI,WAAW,0DAA0D,OAAO,KAAK,CAAC,EAAE;AAAA,EAChG;AACA,MAAI,OAAO,EAAG,QAAO;AACrB,QAAM,UAAU,OAAO;AACvB,QAAM,OAAO,KAAK;AAClB,SAAO,UAAU,MAAY,KAAK,MAAM,OAAO,MAAY,KAAK;AAClE;AAGO,SAAS,kBAAkB,MAA2B;AAC3D,MAAI,SAAS;AACb,MAAI,UAAU;AACd,MAAI,UAAU;AAEd,SAAO,SAAS,KAAK,KAAK,YAAY;AACpC,UAAMC,QAAO,IAAI,SAAS,KAAK,QAAQ,KAAK,aAAa,QAAQ,KAAK,aAAa,MAAM;AACzF,QAAI,OAAOA,MAAK,UAAU,GAAG,KAAK;AAClC,UAAM,OAAO,OAAO,aAAa,KAAK,SAAS,CAAC,GAAI,KAAK,SAAS,CAAC,GAAI,KAAK,SAAS,CAAC,GAAI,KAAK,SAAS,CAAC,CAAE;AAC3G,QAAI,aAAa;AAEjB,QAAI,SAAS,GAAG;AACd,UAAI,SAAS,KAAK,KAAK,WAAY,QAAO;AAC1C,YAAM,YAAYA,MAAK,aAAa,GAAG,KAAK;AAC5C,UAAI,YAAY,OAAO,OAAO,gBAAgB,EAAG,QAAO;AACxD,aAAO,OAAO,SAAS;AACvB,mBAAa;AAAA,IACf,WAAW,SAAS,GAAG;AACrB,aAAO,KAAK,aAAa;AAAA,IAC3B;AAEA,QAAI,OAAO,cAAc,SAAS,OAAO,KAAK,WAAY,QAAO;AAIjE,QAAI,SAAS,OAAQ,QAAO;AAC5B,QAAI,SAAS,OAAQ,WAAU;AAC/B,QAAI,SAAS,QAAQ;AACnB,UAAI,CAAC,QAAS,QAAO;AACrB,gBAAU;AAAA,IACZ;AACA,cAAU;AAAA,EACZ;AAEA,SAAO,WAAW,KAAK,cAAc,WAAW;AAClD;AAcO,SAAS,yBAAyB,MAA0C;AACjF,MAAI,kBAAkB,IAAI,EAAG,QAAO;AAEpC,QAAM,QAAsB,CAAC;AAC7B,MAAI,SAAS;AACb,MAAI,aAAa;AAEjB,SAAO,SAAS,KAAK,KAAK,YAAY;AACpC,UAAMA,QAAO,IAAI,SAAS,KAAK,QAAQ,KAAK,aAAa,QAAQ,KAAK,aAAa,MAAM;AACzF,QAAI,OAAOA,MAAK,UAAU,GAAG,KAAK;AAClC,QAAI,aAAa;AACjB,QAAI,SAAS,GAAG;AACd,UAAI,SAAS,KAAK,KAAK,WAAY,QAAO;AAC1C,YAAM,YAAYA,MAAK,aAAa,GAAG,KAAK;AAC5C,UAAI,YAAY,OAAO,OAAO,gBAAgB,EAAG,QAAO;AACxD,aAAO,OAAO,SAAS;AACvB,mBAAa;AAAA,IACf,WAAW,SAAS,GAAG;AACrB,aAAO,KAAK,aAAa;AAAA,IAC3B;AACA,QAAI,OAAO,cAAc,SAAS,OAAO,KAAK,WAAY,QAAO;AAEjE,UAAM,OAAO,OAAO;AAAA,MAClB,KAAK,SAAS,CAAC;AAAA,MACf,KAAK,SAAS,CAAC;AAAA,MACf,KAAK,SAAS,CAAC;AAAA,MACf,KAAK,SAAS,CAAC;AAAA,IACjB;AACA,QAAI,SAAS,OAAQ,cAAa;AAAA,QAC7B,OAAM,KAAK,KAAK,SAAS,QAAQ,SAAS,IAAI,CAAC;AACpD,cAAU;AAAA,EACZ;AAEA,MAAI,CAAC,cAAc,WAAW,KAAK,WAAY,QAAO;AACtD,QAAM,aAAa,IAAI,WAAW,MAAM,OAAO,CAAC,OAAO,SAAS,QAAQ,KAAK,YAAY,CAAC,CAAC;AAC3F,MAAI,cAAc;AAClB,aAAW,QAAQ,OAAO;AACxB,eAAW,IAAI,MAAM,WAAW;AAChC,mBAAe,KAAK;AAAA,EACtB;AACA,SAAO,kBAAkB,UAAU,IAAI,aAAa;AACtD;AAoEA,SAAS,iCACP,MACA,SACc;AACd,SAAO,wBAAwB,MAAM,OAAO,EAAE;AAChD;AAEA,SAAS,yBAAyB,MAAkB,aAAa,GAAiB;AAChF,QAAM,OAAqB,CAAC;AAC5B,MAAI,IAAI;AACR,SAAO,IAAI,aAAa,KAAK,QAAQ;AACnC,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,YAAY,IAAK,OAAO,OAAO,IAAK,KAAK,IAAI,CAAC;AAClE,SAAK;AACL,QAAI,OAAO,KAAK,KAAK,KAAK,OAAQ;AAClC,UAAM,MAAM,KAAK,IAAI,IAAI,KAAK,KAAK,MAAM;AACzC,SAAK,KAAK,KAAK,SAAS,GAAG,GAAG,CAAC;AAC/B,QAAI,MAAM,IAAI,IAAK;AACnB,QAAI;AAAA,EACN;AACA,SAAO;AACT;AAEA,SAAS,uBAAuB,MAA2B;AACzD,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,SAAS,KAAK,CAAC;AACrB,OAAK,SAAS,SAAU,EAAG,QAAO;AAClC,QAAM,UAAU,SAAS;AACzB,SAAO,UAAU,KAAK,UAAU;AAClC;AASA,SAAS,iBAAiB,KAA0B;AAClD,QAAM,YAAY,kBAAkB,GAAG;AACvC,SAAO,cAAc,KAAK,cAAc,KAAK,cAAc,KAAK,cAAc;AAChF;AAEA,SAAS,kBAAkB,KAAgC;AACzD,MAAI,IAAI,SAAS,MAAM,IAAI,CAAC,IAAK,QAAU,EAAG,QAAO;AACrD,QAAM,OAAO,0BAA0B,IAAI,SAAS,CAAC,CAAC;AACtD,QAAM,QAAQ,EAAE,WAAW,EAAE;AAC7B,MAAI,sBAAsB,MAAM,KAAK,MAAM,KAAM,QAAO;AACxD,SAAO,sBAAsB,MAAM,KAAK;AAC1C;AAEA,SAAS,sBAAsB,MAAkB,OAA6C;AAC5F,MAAI,kBAAkB;AACtB,SAAO,MAAM;AACX,UAAM,MAAM,QAAQ,MAAM,KAAK;AAC/B,QAAI,QAAQ,KAAM,QAAO;AACzB,QAAI,QAAQ,EAAG;AACf;AACA,QAAI,kBAAkB,GAAI,QAAO;AAAA,EACnC;AAEA,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,iBAAiB,KAAK;AACxC,UAAM,MAAM,QAAQ,MAAM,KAAK;AAC/B,QAAI,QAAQ,KAAM,QAAO;AACzB,aAAU,UAAU,IAAK;AAAA,EAC3B;AACA,UAAQ,KAAK,mBAAmB,IAAI;AACtC;AAEA,SAAS,QAAQ,MAAkB,OAA4C;AAC7E,MAAI,MAAM,aAAa,KAAK,SAAS,EAAG,QAAO;AAC/C,QAAM,OAAO,KAAK,MAAM,aAAa,CAAC;AACtC,QAAM,MAAO,QAAS,KAAK,MAAM,YAAY,KAAO;AACpD,QAAM;AACN,SAAO;AACT;AAsTA,IAAI,QAAoB;AACtB,QAAM,EAAE,UAAU,MAAM,OAAO,IAAI;AAEnC,WAAS,eAAe,MAAM;AAC5B,aAAS,YAAY,MAAM;AACzB,WAAK,qBAAqB,MAAM;AAC9B,eAAO,SAAS,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAI,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,MAChE,CAAC;AACD,WAAK,qBAAqB,MAAM;AAC9B,eAAO,SAAS,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAI,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,MAC7D,CAAC;AACD,WAAK,gBAAgB,MAAM;AACzB,eAAO,SAAS,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,IAAI,GAAI,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK;AAAA,MAClE,CAAC;AAAA,IACH,CAAC;AAED,aAAS,uBAAuB,MAAM;AACpC,WAAK,eAAe,MAAM;AACxB,eAAO,oBAAoB,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;AAAA,MACxE,CAAC;AACD,WAAK,eAAe,MAAM;AACxB,eAAO,oBAAoB,IAAI,WAAW,CAAC,KAAM,KAAM,KAAM,KAAM,KAAM,GAAG,GAAG,GAAG,GAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;AAAA,MACnG,CAAC;AACD,WAAK,wBAAwB,MAAM;AACjC,eAAO,oBAAoB,IAAI,WAAW,CAAC,KAAM,KAAM,GAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE;AAAA,MACzE,CAAC;AAAA,IACH,CAAC;AAED,aAAS,uBAAuB,MAAM;AACpC,WAAK,mBAAmB,MAAM;AAC5B,cAAM,OAAO,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,KAAM,KAAM,KAAM,GAAG,GAAG,GAAG,GAAG,IAAM,GAAI,CAAC;AAClF,cAAM,OAAO,oBAAoB,IAAI;AACrC,eAAO,KAAK,MAAM,EAAE,KAAK,CAAC;AAC1B,eAAO,KAAK,CAAC,CAAC,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,GAAI,CAAC,CAAC;AAC1D,eAAO,KAAK,CAAC,CAAC,EAAE,QAAQ,IAAI,WAAW,CAAC,IAAM,GAAI,CAAC,CAAC;AAAA,MACtD,CAAC;AACD,WAAK,8BAA8B,MAAM;AACvC,cAAM,OAAO,oBAAoB,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,KAAM,IAAM,GAAG,GAAG,GAAG,KAAM,CAAI,CAAC,CAAC;AAC3F,eAAO,KAAK,MAAM,EAAE,KAAK,CAAC;AAAA,MAC5B,CAAC;AAAA,IACH,CAAC;AAED,aAAS,gBAAgB,MAAM;AAC7B,WAAK,uBAAuB,MAAM;AAChC,cAAM,SAAS,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,IAAM,KAAM,GAAI,CAAC;AAC5D,cAAM,OAAO,aAAa,MAAM;AAChC,eAAO,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;AACtB,eAAO,KAAK,CAAC,CAAC,EAAE,KAAK,EAAI;AAAA,MAC3B,CAAC;AACD,WAAK,oBAAoB,MAAM;AAC7B,cAAM,SAAS,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,KAAM,CAAI,CAAC;AACtD,cAAM,OAAO,aAAa,QAAQ,EAAE,KAAK,IAAI,WAAW,CAAC,KAAM,EAAI,CAAC,GAAG,KAAK,IAAI,WAAW,CAAC,KAAM,CAAI,CAAC,EAAE,CAAC;AAC1G,eAAO,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;AACtB,eAAO,KAAK,CAAC,CAAC,EAAE,KAAK,GAAI;AAAA,MAC3B,CAAC;AAAA,IACH,CAAC;AAED,aAAS,sBAAsB,MAAM;AACnC,WAAK,kBAAkB,MAAM;AAC3B,eAAO,mBAAmB,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAI,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,MAC1E,CAAC;AACD,WAAK,kBAAkB,MAAM;AAC3B,eAAO,mBAAmB,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAI,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,MAC1E,CAAC;AACD,WAAK,eAAe,MAAM;AACxB,eAAO,mBAAmB,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,KAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,MACtF,CAAC;AACD,WAAK,sBAAsB,MAAM;AAC/B,eAAO,mBAAmB,IAAI,WAAW;AAAA,UACvC;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UACZ;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAM;AAAA,QACpB,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,MAChB,CAAC;AACD,WAAK,+BAA+B,MAAM;AACxC,eAAO,mBAAmB,IAAI,WAAW;AAAA,UACvC;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAM;AAAA,QACpB,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,MAChB,CAAC;AACD,WAAK,qBAAqB,MAAM;AAC9B,eAAO,mBAAmB,IAAI,WAAW,CAAC,KAAM,KAAM,GAAI,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,MAC1E,CAAC;AACD,WAAK,iCAAiC,MAAM;AAC1C,eAAO,mBAAmB,IAAI,WAAW,CAAC,IAAM,GAAI,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,MACpE,CAAC;AACD,WAAK,8DAA8D,MAAM;AACvE,cAAM,UAAU,IAAI,WAAW,CAAC,GAAG,GAAG,IAAM,GAAG,GAAI,CAAC;AACpD,eAAO,qBAAqB,OAAO,CAAC,EAAE,cAAc;AACpD,eAAO,qBAAqB,SAAS,EAAE,kBAAkB,KAAK,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,MAC7E,CAAC;AACD,WAAK,mBAAmB,MAAM;AAC5B,eAAO,mBAAmB,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,EAAI,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK;AAAA,MAC3E,CAAC;AACD,WAAK,gDAAgD,MAAM;AACzD,eAAO,mBAAmB,IAAI,WAAW;AAAA,UACvC;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAM;AAAA,UAClB;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAM;AAAA,QACpB,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK;AAAA,MACjB,CAAC;AAAA,IACH,CAAC;AAED,aAAS,gBAAgB,MAAM;AAC7B,WAAK,qCAAqC,MAAM;AAC9C,cAAM,OAAO,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,KAAM,KAAM,GAAI,CAAC;AAC1D,cAAM,SAAiB,EAAE,KAAK,IAAI,WAAW,CAAC,KAAM,EAAI,CAAC,GAAG,KAAK,IAAI,WAAW,CAAC,KAAM,CAAI,CAAC,EAAE;AAC9F,cAAM,SAAS,aAAa,MAAM,MAAM,MAAM;AAC9C,eAAO,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC;AACxB,eAAO,OAAO,CAAC,CAAC,EAAE,KAAK,GAAI;AAAA,MAC7B,CAAC;AAAA,IACH,CAAC;AAED,aAAS,uBAAuB,MAAM;AACpC,WAAK,uBAAuB,MAAM;AAChC,eAAO,oBAAoB,IAAI,WAAW,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,aAAa;AAAA,MACjF,CAAC;AAAA,IACH,CAAC;AAED,aAAS,gCAAgC,MAAM;AAS7C,eAAS,oBAAoB,KAA6B;AACxD,cAAM,MAAM,CAAC,MAAc,YAAoC;AAC7D,gBAAM,KAAK,IAAI,QAAQ;AACvB,gBAAM,MAAM,IAAI,WAAW,EAAE;AAC7B,cAAI,CAAC,IAAK,OAAO,KAAM;AACvB,cAAI,CAAC,IAAK,OAAO,KAAM;AACvB,cAAI,CAAC,IAAK,OAAO,IAAK;AACtB,cAAI,CAAC,IAAI,KAAK;AACd,cAAI,CAAC,IAAI,KAAK,WAAW,CAAC;AAAG,cAAI,CAAC,IAAI,KAAK,WAAW,CAAC;AACvD,cAAI,CAAC,IAAI,KAAK,WAAW,CAAC;AAAG,cAAI,CAAC,IAAI,KAAK,WAAW,CAAC;AACvD,cAAI,IAAI,SAAS,CAAC;AAClB,iBAAO;AAAA,QACT;AACA,cAAM,SAAS,IAAI,SAAmC;AACpD,gBAAM,QAAQ,KAAK,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AACnD,gBAAM,MAAM,IAAI,WAAW,KAAK;AAChC,cAAI,MAAM;AACV,qBAAW,KAAK,MAAM;AAAE,gBAAI,IAAI,GAAG,GAAG;AAAG,mBAAO,EAAE;AAAA,UAAO;AACzD,iBAAO;AAAA,QACT;AAEA,cAAM,OAAO,IAAI,QAAQ,IAAI,WAAW;AAAA,UACtC;AAAA,UAAM;AAAA,UAAM;AAAA,UAAM;AAAA;AAAA,UAClB;AAAA,UAAM;AAAA,UAAM;AAAA,UAAM;AAAA;AAAA,UAClB;AAAA,UAAM;AAAA,UAAM;AAAA,UAAM;AAAA;AAAA,UAClB;AAAA,UAAM;AAAA,UAAM;AAAA,UAAM;AAAA;AAAA,QACpB,CAAC,CAAC;AAIF,cAAM,MAAM,IAAI,WAAW,IAAI,IAAI,MAAM;AACzC,YAAI,CAAC,IAAI;AAAM,YAAI,CAAC,IAAI,IAAI;AAC5B,YAAI,IAAI,KAAK,CAAC;AAEd,cAAM,MAAM,IAAI,WAAW,IAAI,KAAK,IAAI,MAAM;AAC9C,YAAI,CAAC,IAAI;AAAM,YAAI,CAAC,IAAI,KAAK,IAAI;AACjC,YAAI,CAAC,IAAI;AACT,YAAI,CAAC,IAAK,KAAQ,IAAK;AAEvB,YAAI,IAAI,KAAK,EAAE;AAEf,cAAM,MAAM,IAAI,WAAW,IAAI,IAAI,IAAI,MAAM;AAC7C,YAAI,CAAC,IAAI;AAAM,YAAI,CAAC,IAAI,IAAI,IAAI;AAEhC,YAAI,IAAI,KAAK,CAAC;AAEd,cAAM,cAAc,IAAI,WAAW,IAAI,IAAI,MAAM;AACjD,oBAAY,IAAI,KAAK,CAAC;AACtB,cAAM,OAAO,IAAI,QAAQ,WAAW;AAKpC,cAAM,YAAY,IAAI,WAAW,EAAE;AACnC,kBAAU,CAAC,IAAI;AACf,kBAAU,EAAE,IAAI;AAAM,kBAAU,EAAE,IAAI;AACtC,kBAAU,EAAE,IAAI;AAAM,kBAAU,EAAE,IAAI;AAEtC,kBAAU,EAAE,IAAI;AAAM,kBAAU,EAAE,IAAI;AACtC,cAAM,OAAO,IAAI,QAAQ,OAAO,WAAW,IAAI,CAAC;AAGhD,cAAM,cAAc,IAAI,WAAW,IAAI,KAAK,MAAM;AAClD,oBAAY,CAAC,IAAI;AACjB,oBAAY,IAAI,MAAM,CAAC;AACvB,cAAM,OAAO,IAAI,QAAQ,WAAW;AAEpC,cAAM,OAAO,IAAI,QAAQ,IAAI;AAC7B,cAAM,OAAO,IAAI,QAAQ,IAAI;AAC7B,cAAM,OAAO,IAAI,QAAQ,IAAI;AAC7B,cAAM,OAAO,IAAI,QAAQ,IAAI;AAC7B,cAAM,OAAO,IAAI,QAAQ,IAAI;AAE7B,eAAO,OAAO,MAAM,IAAI;AAAA,MAC1B;AAEA,WAAK,kDAAkD,MAAM;AAG3D,cAAM,MAAM,IAAI,WAAW,CAAC,IAAM,GAAI,CAAC;AACvC,cAAM,OAAO,oBAAoB,GAAG;AACpC,cAAM,SAAS,6BAA6B,IAAI;AAChD,eAAO,MAAM,EAAE,YAAY;AAC3B,eAAO,OAAQ,KAAK,EAAE,KAAK,WAAW;AACtC,eAAO,MAAM,KAAK,OAAQ,WAAW,CAAC,EAAE,QAAQ,CAAC,IAAM,GAAI,CAAC;AAAA,MAC9D,CAAC;AAED,WAAK,2CAA2C,MAAM;AAEpD,cAAM,MAAM,IAAI,WAAW,CAAC,IAAM,GAAI,CAAC;AACvC,cAAM,OAAO,oBAAoB,GAAG;AACpC,eAAO,6BAA6B,IAAI,GAAG,KAAK,EAAE,KAAK,WAAW;AAAA,MACpE,CAAC;AAED,WAAK,wCAAwC,MAAM;AACjD,eAAO,6BAA6B,IAAI,WAAW,EAAE,CAAC,CAAC,EAAE,cAAc;AAAA,MACzE,CAAC;AAED,WAAK,0DAA0D,MAAM;AAEnE,cAAM,OAAO,IAAI,WAAW;AAAA,UAC1B;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAM;AAAA,UAAM;AAAA,UAAM;AAAA,UAC/B;AAAA,UAAM;AAAA,UAAM;AAAA,UAAM;AAAA,UAAM;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UACjC;AAAA,UAAM;AAAA,UAAM;AAAA,UAAM;AAAA,UAAM;AAAA,UAAM;AAAA,UAAM;AAAA,UAAM;AAAA,QAC5C,CAAC;AACD,cAAM,OAAO,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,KAAM,KAAM,KAAM,GAAI,CAAC;AAChE,cAAM,MAAM,IAAI,WAAW,KAAK,SAAS,KAAK,MAAM;AACpD,YAAI,IAAI,IAAI;AAAG,YAAI,IAAI,MAAM,KAAK,MAAM;AACxC,eAAO,6BAA6B,GAAG,CAAC,EAAE,cAAc;AAAA,MAC1D,CAAC;AAAA,IACH,CAAC;AAED,aAAS,QAAQ,MAAM;AAErB,YAAM,MAAM,IAAI,WAAW,CAAC,IAAM,GAAM,IAAM,GAAM,KAAM,GAAI,CAAC;AAC/D,YAAM,MAAM,IAAI,WAAW,CAAC,IAAM,GAAM,GAAM,GAAM,IAAM,GAAM,GAAM,GAAM,KAAM,GAAM,GAAM,GAAM,GAAM,GAAM,IAAM,KAAM,GAAM,CAAI,CAAC;AACvI,YAAM,MAAM,IAAI,WAAW,CAAC,IAAM,GAAM,KAAM,KAAM,KAAM,EAAI,CAAC;AAC/D,YAAM,MAAM,IAAI,WAAW,CAAC,IAAM,GAAM,KAAM,CAAI,CAAC;AACnD,YAAM,KAAK,IAAI,SAAuB;AACpC,cAAM,QAAkB,CAAC;AACzB,mBAAW,KAAK,MAAM;AAAE,gBAAM,KAAM,EAAE,UAAU,KAAM,KAAO,EAAE,UAAU,KAAM,KAAO,EAAE,UAAU,IAAK,KAAM,EAAE,SAAS,KAAM,GAAG,CAAC;AAAA,QAAE;AACpI,eAAO,WAAW,KAAK,KAAK;AAAA,MAC9B;AAEA,WAAK,eAAe,MAAM;AACxB,eAAO,YAAY,iBAAiB,CAAC,EAAE,KAAK,IAAI;AAChD,eAAO,YAAY,iBAAiB,CAAC,EAAE,KAAK,IAAI;AAChD,eAAO,YAAY,aAAa,CAAC,EAAE,KAAK,KAAK;AAAA,MAC/C,CAAC;AAED,WAAK,yCAAyC,MAAM;AAClD,eAAO,MAAM,KAAK,0BAA0B,IAAI,WAAW,CAAC,GAAG,GAAG,GAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC;AAChG,eAAO,MAAM,KAAK,0BAA0B,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAM,GAAI,CAAC;AAAA,MAClG,CAAC;AAED,WAAK,iDAAiD,MAAM;AAC1D,cAAM,OAAO,kBAAkB,GAAG,KAAK,GAAG,CAAC;AAC3C,eAAO,KAAK,MAAM,EAAE,KAAK,CAAC;AAC1B,eAAO,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG;AAC3B,eAAO,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG;AAAA,MAC7B,CAAC;AAED,WAAK,qEAAqE,MAAM;AAC9E,eAAO,qBAAqB,GAAG,IAAI,WAAW,CAAC,CAAI,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,MACzE,CAAC;AAED,WAAK,2DAA2D,MAAM;AACpE,eAAO,qBAAqB,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,KAAM,GAAI,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK;AAAA,MACnF,CAAC;AAED,WAAK,kEAAkE,MAAM;AAC3E,eAAO,qBAAqB,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,KAAM,GAAI,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK;AAAA,MACnF,CAAC;AAED,WAAK,oEAAoE,MAAM;AAC7E,cAAM,OAAO,GAAG,IAAI,WAAW,CAAC,CAAI,CAAC,GAAG,GAAG;AAC3C,cAAM,aAAa,0BAA0B,IAAI;AACjD,eAAO,WAAW,MAAM,EAAE,KAAK,MAAM;AACrC,eAAO,WAAW,IAAI,EAAE,KAAK,IAAI;AAAA,MACnC,CAAC;AAED,WAAK,qEAAqE,MAAM;AAC9E,cAAM,MAAM,IAAI,WAAW,CAAC,KAAM,KAAM,GAAI,CAAC;AAC7C,cAAM,aAAa,0BAA0B,GAAG;AAChD,eAAO,WAAW,MAAM,EAAE,KAAK,SAAS;AACxC,eAAO,WAAW,IAAI,EAAE,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,KAAM,KAAM,GAAI,CAAC,CAAC;AAAA,MAChF,CAAC;AAED,WAAK,wEAAwE,MAAM;AACjF,cAAM,SAAS,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,KAAM,KAAM,GAAI,CAAC;AAC5D,cAAM,SAAS,wBAAwB,MAAM;AAC7C,eAAO,OAAO,MAAM,EAAE,KAAK,QAAQ;AACnC,eAAO,OAAO,IAAI,EAAE,aAAa,CAAC;AAClC,eAAO,OAAO,KAAK,CAAC,CAAC,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,KAAM,GAAI,CAAC,CAAC;AAAA,MACnE,CAAC;AAED,WAAK,0EAA0E,MAAM;AACnF,cAAM,MAAM,IAAI,WAAW,CAAC,KAAM,KAAM,GAAI,CAAC;AAC7C,cAAM,SAAS,wBAAwB,GAAG;AAC1C,eAAO,OAAO,MAAM,EAAE,KAAK,SAAS;AACpC,eAAO,OAAO,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC;AAAA,MACnC,CAAC;AAED,WAAK,+DAA+D,MAAM;AACxE,cAAM,UAAU,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,KAAM,GAAI,CAAC;AACvD,cAAM,SAAS,wBAAwB,SAAS,EAAE,kBAAkB,KAAK,CAAC;AAC1E,eAAO,OAAO,MAAM,EAAE,KAAK,cAAc;AACzC,eAAO,OAAO,IAAI,EAAE,aAAa,CAAC;AAClC,eAAO,OAAO,KAAK,CAAC,CAAC,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAM,GAAI,CAAC,CAAC;AAAA,MAC7D,CAAC;AAED,WAAK,gEAAgE,MAAM;AACzE,cAAM,OAAO,yBAAyB,GAAG,KAAK,KAAK,KAAK,GAAG,CAAC;AAC5D,eAAO,KAAK,GAAG,EAAE,QAAQ,GAAG;AAC5B,eAAO,KAAK,GAAG,EAAE,QAAQ,GAAG;AAC5B,eAAO,KAAK,GAAG,EAAE,QAAQ,GAAG;AAAA,MAC9B,CAAC;AAED,WAAK,wDAAwD,MAAM;AACjE,cAAM,KAAK,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;AACtC,cAAM,SAAS,WAAW,KAAK,CAAC,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,GAAG,CAAC;AAC3F,cAAM,OAAO,yBAAyB,MAAM;AAC5C,eAAO,KAAK,GAAG,EAAE,QAAQ,GAAG;AAC5B,eAAO,KAAK,GAAG,EAAE,QAAQ,GAAG;AAC5B,eAAO,KAAK,GAAG,EAAE,QAAQ,GAAG;AAAA,MAC9B,CAAC;AAED,WAAK,qDAAqD,MAAM;AAC9D,cAAM,OAAO,8BAA8B,EAAE,KAAK,KAAK,IAAI,CAAC;AAC5D,eAAO,IAAI,EAAE,IAAI,SAAS;AAC1B,eAAO,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;AACtB,eAAO,KAAK,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;AAC3B,eAAO,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC;AAEvB,eAAO,KAAK,EAAE,IAAI,EAAI,EAAE,KAAK,EAAE;AAC/B,eAAQ,KAAK,EAAE,KAAK,IAAK,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC;AAAA,MAC3C,CAAC;AAED,WAAK,8DAA8D,MAAM;AACvE,eAAO,8BAA8B,EAAE,IAAI,CAAC,CAAC,EAAE,SAAS;AAAA,MAC1D,CAAC;AAED,WAAK,wDAAwD,MAAM;AACjE,cAAM,OAAO,4BAA4B,GAAG,KAAK,KAAK,KAAK,GAAG,CAAC;AAC/D,eAAO,IAAI,EAAE,IAAI,SAAS;AAC1B,eAAO,KAAM,CAAC,CAAC,EAAE,KAAK,CAAC;AAAA,MACzB,CAAC;AAED,WAAK,oDAAoD,MAAM;AAC7D,cAAM,WAAW,YAAY,GAAG,KAAK,KAAK,KAAK,GAAG,CAAC;AACnD,cAAM,OAAO,kBAAkB,QAAQ;AACvC,eAAO,KAAK,MAAM,EAAE,KAAK,CAAC;AAC1B,eAAO,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG;AAAA,MAC7B,CAAC;AAED,WAAK,6DAA6D,MAAM;AACtE,cAAM,UAAU,GAAG,GAAG;AACtB,eAAO,YAAY,OAAO,CAAC,EAAE,KAAK,OAAO;AAAA,MAC3C,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;AACH;;;ACvjDA,SAAS,+BAA+B,OAAsC;AAC5E,QAAM,cAAc,OAAO,KAAK,KAAK,EAAE;AAAA,IACrC,SAAO,QAAQ,eAAe,QAAQ;AAAA,EACxC;AACA,MAAI,YAAY,SAAS,GAAG;AAC1B,QAAI,YAAY,SAAS,iBAAiB,GAAG;AAC3C,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,UAAM,IAAI;AAAA,MACR,wDAAwD,YAAY,KAAK,IAAI,CAAC;AAAA,IAChF;AAAA,EACF;AACA,QAAM,4BAA4B,MAAM,2BAA2B;AACnE,MACE,OAAO,8BAA8B,aACrC,8BAA8B,QAC9B;AACA,UAAM,IAAI,MAAM,4DAA4D;AAAA,EAC9E;AACF;AAwBA,SAAS,4BAA4B,YAAmD;AACtF,MAAI,OAAO,eAAe,YAAY,CAAC,OAAO,SAAS,UAAU,KAAK,cAAc,GAAG;AACrF,UAAM,IAAI,MAAM,kEAAkE;AAAA,EACpF;AACF;AAQO,SAAS,+BAA+B,QAAmC;AAChF,MAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,MAAM,QAAQ,MAAM,GAAG;AAC1E,UAAM,IAAI,MAAM,2CAA2C;AAAA,EAC7D;AAEA,QAAM,QAAQ;AACd,MAAI,MAAM,WAAW,MAAM,gBAAgB;AACzC,mCAA+B,KAAK;AACpC,QAAI,MAAM,2BAA2B,MAAM,OAAO;AAChD,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA;AAAA,EACF;AACA,MAAI,MAAM,WAAW,MAAM,YAAY;AACrC,UAAM,cAAc,OAAO,KAAK,KAAK,EAAE;AAAA,MACrC,SAAO,QAAQ,eAAe,QAAQ;AAAA,IACxC;AACA,QAAI,YAAY,SAAS,GAAG;AAC1B,YAAM,IAAI;AAAA,QACR,oDAAoD,YAAY,KAAK,IAAI,CAAC;AAAA,MAC5E;AAAA,IACF;AACA,gCAA4B,MAAM,YAAY,CAAC;AAC/C;AAAA,EACF;AACA,QAAM,IAAI;AAAA,IACR,2CAA2C,OAAO,MAAM,WAAW,CAAC,CAAC;AAAA,EACvE;AACF;AAEO,SAAS,uBAAuB,QAA4C;AACjF,iCAA+B,MAAM;AACrC,SAAO,OAAO,cAAc,iBAAiB,OAAO,OAAO;AAC7D;AAGO,SAAS,6BACd,QACA,mBAAmB,GACX;AACR,iCAA+B,MAAM;AACrC,MAAI,CAAC,OAAO,SAAS,gBAAgB,KAAK,mBAAmB,GAAG;AAC9D,UAAM,IAAI,MAAM,gEAAgE;AAAA,EAClF;AAEA,QAAM,YAAY,KAAK,KAAK,gBAAgB;AAC5C,MAAI,OAAO,cAAc,gBAAgB;AACvC,QAAI,YAAY,GAAG;AACjB,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;;;AC7HA,IAAM,UAAU;AAChB,IAAM,UAAU,CAAC;AACjB,IAAM,UAAU;AAChB,IAAM,0BAA0B;AAEhC,IAAM,gCAAgC;AACtC,IAAM,wCAAwC;AAC9C,IAAM,uCAAuC;AAC7C,IAAM,mCAAmC;AACzC,IAAM,oCAAoC;AAC1C,IAAM,yBAAyB;AAC/B,IAAM,4BAA4B;AAClC,IAAM,mBACJ,gCACA,wCACA,uCACA,mCACA,oCACA,yBACA;AAEF,IAAM,2BAA2B;AACjC,IAAM,kCAAkC;AACxC,IAAM,+BAA+B;AACrC,IAAM,2BAA2B;AACjC,IAAM,4BAA4B;AAClC,IAAM,iCAAiC;AACvC,IAAM,mBACJ,2BACA,kCACA,+BACA,2BACA,4BACA;AA6DF,SAAS,KAAK,MAA4B;AACxC,SAAO,IAAI,SAAS,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AACnE;AAEA,SAAS,QAAQ,MAAkB,QAAwB;AACzD,SAAO,OAAO;AAAA,IACZ,KAAK,MAAM;AAAA,IACX,KAAK,SAAS,CAAC;AAAA,IACf,KAAK,SAAS,CAAC;AAAA,IACf,KAAK,SAAS,CAAC;AAAA,EACjB;AACF;AAEA,SAAS,QAAQ,MAAkB,QAA+B;AAChE,MAAI,SAAS,KAAK,SAAS,IAAI,KAAK,OAAQ,QAAO;AACnD,QAAM,WAAW,KAAK,IAAI;AAC1B,SAAQ,OAAO,SAAS,UAAU,QAAQ,KAAK,CAAC,KAAK,MACnD,OAAO,SAAS,UAAU,SAAS,GAAG,KAAK,CAAC;AAChD;AAEA,SAAS,SAAS,MAAkB,OAAe,OAA8B;AAC/E,MAAI,QAAQ,KAAK,QAAQ,KAAK,UAAU,QAAQ,IAAI,MAAO,QAAO;AAClE,QAAM,WAAW,KAAK,IAAI;AAC1B,QAAM,YAAY,SAAS,UAAU,OAAO,KAAK;AACjD,MAAI,aAAa;AACjB,MAAI;AACJ,MAAI,cAAc,GAAG;AACnB,WAAO,QAAQ;AAAA,EACjB,WAAW,cAAc,GAAG;AAC1B,QAAI,QAAQ,KAAK,MAAO,QAAO;AAC/B,UAAM,eAAe,QAAQ,MAAM,QAAQ,CAAC;AAC5C,QAAI,iBAAiB,QAAQ,eAAe,OAAO,OAAO,gBAAgB,EAAG,QAAO;AACpF,iBAAa;AACb,WAAO,OAAO,YAAY;AAAA,EAC5B,OAAO;AACL,WAAO;AAAA,EACT;AACA,MAAI,OAAO,cAAc,QAAQ,OAAO,MAAO,QAAO;AACtD,SAAO;AAAA,IACL,MAAM,QAAQ,MAAM,QAAQ,CAAC;AAAA,IAC7B;AAAA,IACA,WAAW,QAAQ;AAAA,IACnB,KAAK,QAAQ;AAAA,EACf;AACF;AAEA,SAAS,WAAW,MAAkB,OAAe,KAA8B;AACjF,MAAI,QAAQ,KAAK,MAAM,SAAS,MAAM,KAAK,OAAQ,QAAO;AAC1D,QAAM,QAAkB,CAAC;AACzB,MAAI,SAAS;AACb,SAAO,SAAS,KAAK;AACnB,UAAM,MAAM,SAAS,MAAM,QAAQ,GAAG;AACtC,QAAI,CAAC,OAAO,IAAI,OAAO,OAAQ,QAAO;AACtC,UAAM,KAAK,GAAG;AACd,aAAS,IAAI;AAAA,EACf;AACA,SAAO,WAAW,MAAM,QAAQ;AAClC;AAEA,SAAS,SAAS,MAAkB,QAAiC;AACnE,SAAO,WAAW,MAAM,OAAO,WAAW,OAAO,GAAG;AACtD;AAEA,SAAS,WAAW,OAA0B,MAA6B;AACzE,QAAM,UAAU,MAAM,OAAO,SAAO,IAAI,SAAS,IAAI;AACrD,SAAO,QAAQ,WAAW,IAAI,QAAQ,CAAC,IAAK;AAC9C;AAEA,SAAS,aAAa,MAAkB,KAA6B;AACnE,MAAI,IAAI,YAAY,IAAI,IAAI,IAAK,QAAO;AACxC,QAAM,kBAAkB,KAAK,IAAI,EAAE,UAAU,IAAI,WAAW,KAAK;AACjE,SAAO;AAAA,IACL,SAAS,oBAAoB;AAAA,IAC7B,OAAO,kBAAkB;AAAA,IACzB,WAAW,IAAI,YAAY;AAAA,EAC7B;AACF;AAEA,SAAS,iBAAiB,MAAkB,KAA4B;AACtE,QAAM,OAAO,aAAa,MAAM,GAAG;AACnC,MAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,GAAU,QAAO;AAC5C,QAAM,aAAa,IAAI,MAAM,KAAK;AAClC,QAAM,gBAAgB,KAAK,YAAY,IACnC,KAAK,YAAY,IACjB,KAAK,YAAY,IACf,KAAK,YAAY,KACjB;AACN,QAAM,qBAAqB,KAAK,YAAY,IAAI,KAAK,KAAK,YAAY,IAAI,KAAK;AAC/E,MAAI,gBAAgB,KAAK,eAAe,mBAAoB,QAAO;AACnE,SAAO,KAAK,IAAI,EAAE,UAAU,eAAe,KAAK;AAClD;AAEA,SAAS,mBAAmB,MAAkB,KAA4B;AACxE,QAAM,OAAO,aAAa,MAAM,GAAG;AACnC,MAAI,CAAC,QAAQ,KAAK,UAAU,EAAG,QAAO;AACtC,QAAM,aAAa,IAAI,MAAM,KAAK;AAClC,QAAM,kBAAkB,KAAK,YAAY,IACrC,KAAK,YAAY,IACjB,KAAK,YAAY,IACf,KAAK,YAAY,KACjB;AACN,QAAM,qBAAqB,KAAK,YAAY,IAAI,KAAK,KAAK,YAAY,IAAI,KAAK;AAC/E,MAAI,kBAAkB,KAAK,eAAe,mBAAoB,QAAO;AACrE,SAAO,KAAK,IAAI,EAAE,UAAU,iBAAiB,KAAK;AACpD;AAEA,SAAS,iBAAiB,MAAkB,KAA4B;AACtE,QAAM,OAAO,aAAa,MAAM,GAAG;AACnC,MAAI,CAAC,QAAQ,KAAK,YAAY,KAAK,KAAK,UAAU,KAAK,KAAK,YAAY,KAAK,IAAI,KAAK;AACpF,WAAO;AAAA,EACT;AACA,SAAO,QAAQ,MAAM,KAAK,YAAY,CAAC;AACzC;AAEA,SAAS,mBAAmB,MAAkB,KAA6B;AACzE,QAAM,OAAO,aAAa,MAAM,GAAG;AACnC,MAAI,CAAC,QAAQ,KAAK,UAAU,KAAM,KAAK,YAAY,KAAK,KAAK,YAAY,EAAI,QAAO;AACpF,MAAI,KAAK,YAAY,IAAI,IAAI,IAAK,QAAO;AACzC,QAAM,aAAa,KAAK,IAAI,EAAE,UAAU,KAAK,WAAW,KAAK;AAC7D,QAAM,YAAY,KAAK,YAAY,IAAI,KAAK;AAC5C,QAAM,cAAc,KAAK,YAAY,IAAI,aAAa;AACtD,MAAI,CAAC,OAAO,cAAc,WAAW,KAAK,gBAAgB,IAAI,IAAK,QAAO;AAC1E,SAAO,eAAe;AACxB;AAEA,SAAS,WAAW,MAAkB,MAAkC;AACtE,QAAM,eAAe,SAAS,MAAM,IAAI;AACxC,MAAI,CAAC,aAAc,QAAO;AAC1B,QAAM,OAAO,WAAW,cAAc,MAAM;AAC5C,QAAM,OAAO,WAAW,cAAc,MAAM;AAC5C,MAAI,CAAC,QAAQ,CAAC,KAAM,QAAO;AAC3B,QAAM,UAAU,iBAAiB,MAAM,IAAI;AAC3C,MAAI,YAAY,QAAQ,YAAY,EAAG,QAAO;AAE9C,QAAM,eAAe,SAAS,MAAM,IAAI;AACxC,MAAI,CAAC,aAAc,QAAO;AAC1B,QAAM,OAAO,WAAW,cAAc,MAAM;AAC5C,QAAM,OAAO,WAAW,cAAc,MAAM;AAC5C,MAAI,CAAC,QAAQ,CAAC,KAAM,QAAO;AAC3B,QAAM,YAAY,mBAAmB,MAAM,IAAI;AAC/C,QAAM,cAAc,iBAAiB,MAAM,IAAI;AAC/C,MAAI,cAAc,QAAQ,cAAc,KAAK,gBAAgB,KAAM,QAAO;AAE1E,QAAM,YAAY,aAAa,OAAO,SAAO,IAAI,SAAS,MAAM;AAChE,MAAI,UAAU,SAAS,EAAG,QAAO;AACjC,MAAI,WAAW;AACf,MAAI,UAAU,WAAW,GAAG;AAC1B,UAAM,eAAe,SAAS,MAAM,UAAU,CAAC,CAAE;AACjD,QAAI,CAAC,aAAc,QAAO;AAC1B,UAAM,YAAY,aAAa,OAAO,SAAO,IAAI,SAAS,MAAM;AAChE,QAAI,UAAU,SAAS,EAAG,QAAO;AACjC,QAAI,UAAU,WAAW,GAAG;AAC1B,YAAM,SAAS,mBAAmB,MAAM,UAAU,CAAC,CAAE;AACrD,UAAI,WAAW,KAAM,QAAO;AAC5B,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,aAAa,WAAW,SAAS;AACrD;AAEA,SAAS,UAAU,MAAkB,KAAwC;AAC3E,QAAM,OAAO,aAAa,MAAM,GAAG;AACnC,MAAI,CAAC,QAAQ,KAAK,YAAY,KAAK,KAAK,UAAU,KAAK,IAAI,MAAM,KAAK,cAAc,IAAI;AACtF,WAAO;AAAA,EACT;AACA,QAAM,WAAW,KAAK,IAAI;AAC1B,QAAM,UAAU,SAAS,UAAU,KAAK,WAAW,KAAK;AACxD,QAAM,wBAAwB,SAAS,UAAU,KAAK,YAAY,GAAG,KAAK;AAC1E,QAAM,oBAAoB,SAAS,UAAU,KAAK,YAAY,IAAI,KAAK;AACvE,SAAO;AAAA,IACL;AAAA,IACA,WAAW;AAAA,IACX,GAAI,0BAA0B,IAAI,CAAC,IAAI,EAAE,sBAAsB;AAAA,IAC/D,GAAI,sBAAsB,IAAI,CAAC,IAAI,EAAE,kBAAkB;AAAA,EACzD;AACF;AAEO,SAAS,iCACd,MAC2B;AAC3B,QAAM,WAAW,WAAW,MAAM,GAAG,KAAK,MAAM;AAChD,MAAI,CAAC,SAAU,QAAO;AACtB,QAAM,OAAO,WAAW,UAAU,MAAM;AACxC,QAAM,OAAO,WAAW,UAAU,MAAM;AACxC,MAAI,CAAC,QAAQ,CAAC,QAAQ,KAAK,QAAQ,KAAK,MAAO,QAAO;AACtD,MAAI,SAAS,KAAK,SAAO,IAAI,SAAS,UAAU,IAAI,SAAS,MAAM,EAAG,QAAO;AAE7E,QAAM,eAAe,SAAS,MAAM,IAAI;AACxC,MAAI,CAAC,aAAc,QAAO;AAC1B,QAAM,eAA8B,CAAC;AACrC,aAAW,QAAQ,aAAa,OAAO,SAAO,IAAI,SAAS,MAAM,GAAG;AAClE,UAAM,SAAS,WAAW,MAAM,IAAI;AACpC,QAAI,CAAC,OAAQ,QAAO;AACpB,iBAAa,KAAK,MAAM;AAAA,EAC1B;AACA,QAAM,cAAc,aAAa;AAAA,IAC/B,WAAS,MAAM,gBAAgB,UAAU,MAAM,gBAAgB;AAAA,EACjE;AACA,MAAI,YAAY,WAAW,EAAG,QAAO;AACrC,QAAM,aAAa,YAAY,CAAC;AAChC,MAAI,WAAW,SAAU,QAAO;AAEhC,QAAM,OAAO,WAAW,cAAc,MAAM;AAC5C,MAAI,CAAC,KAAM,QAAO;AAClB,QAAM,eAAe,SAAS,MAAM,IAAI;AACxC,MAAI,CAAC,aAAc,QAAO;AAC1B,QAAM,cAAoC,CAAC;AAC3C,aAAW,WAAW,aAAa,OAAO,SAAO,IAAI,SAAS,MAAM,GAAG;AACrE,UAAMC,QAAO,UAAU,MAAM,OAAO;AACpC,QAAI,CAACA,MAAM,QAAO;AAClB,gBAAY,KAAKA,KAAI;AAAA,EACvB;AACA,QAAM,eAAe,YAAY,OAAO,CAAAA,UAAQA,MAAK,YAAY,WAAW,OAAO;AACnF,MAAI,aAAa,WAAW,EAAG,QAAO;AACtC,QAAM,OAAO,aAAa,CAAC;AAC3B,SAAO;AAAA,IACL,SAAS,WAAW;AAAA,IACpB,WAAW,WAAW;AAAA,IACtB,GAAI,KAAK,0BAA0B,SAC/B,CAAC,IACD,EAAE,uBAAuB,KAAK,sBAAsB;AAAA,IACxD,GAAI,KAAK,sBAAsB,SAC3B,CAAC,IACD,EAAE,mBAAmB,KAAK,kBAAkB;AAAA,EAClD;AACF;AAEA,SAAS,kBAAkB,MAAkB,KAA4B;AACvE,QAAM,OAAO,aAAa,MAAM,GAAG;AACnC,MAAI,CAAC,QAAQ,KAAK,YAAY,KAAK,KAAK,UAAU,KAAK,IAAI,MAAM,KAAK,cAAc,GAAG;AACrF,WAAO;AAAA,EACT;AACA,SAAO,KAAK,IAAI,EAAE,UAAU,KAAK,WAAW,KAAK;AACnD;AAEA,SAAS,UAAU,MAAkB,KAAgC;AACnE,QAAM,OAAO,aAAa,MAAM,GAAG;AACnC,MAAI,CAAC,QAAQ,KAAK,YAAY,MAAM,KAAK,QAAQ,CAAC,sBAAsB,EAAG,QAAO;AAClF,OAAK,KAAK,QAAQ,mCAAmC,MAChD,KAAK,QAAQ,+BAA+B,MAC5C,KAAK,QAAQ,4BAA4B,GAAG;AAC/C,WAAO;AAAA,EACT;AACA,QAAM,WAAW,KAAK,IAAI;AAC1B,MAAI,SAAS,KAAK;AAClB,MAAI,SAAS,IAAI,IAAI,IAAK,QAAO;AACjC,QAAM,UAAU,SAAS,UAAU,QAAQ,KAAK;AAChD,YAAU;AACV,OAAK,KAAK,QAAQ,2CAA2C,GAAG;AAC9D,QAAI,SAAS,IAAI,IAAI,IAAK,QAAO;AACjC,cAAU;AAAA,EACZ;AACA,MAAI;AACJ,OAAK,KAAK,QAAQ,0CAA0C,GAAG;AAC7D,QAAI,SAAS,IAAI,IAAI,IAAK,QAAO;AACjC,4BAAwB,SAAS,UAAU,QAAQ,KAAK;AACxD,cAAU;AAAA,EACZ;AACA,MAAI;AACJ,OAAK,KAAK,QAAQ,sCAAsC,GAAG;AACzD,QAAI,SAAS,IAAI,IAAI,IAAK,QAAO;AACjC,wBAAoB,SAAS,UAAU,QAAQ,KAAK;AACpD,cAAU;AAAA,EACZ;AACA,OAAK,KAAK,QAAQ,uCAAuC,GAAG;AAC1D,QAAI,SAAS,IAAI,IAAI,IAAK,QAAO;AACjC,cAAU;AAAA,EACZ;AACA,MAAI,WAAW,IAAI,IAAK,QAAO;AAC/B,SAAO;AAAA,IACL;AAAA,IACA,GAAI,0BAA0B,SAAY,CAAC,IAAI,EAAE,sBAAsB;AAAA,IACvE,GAAI,sBAAsB,SAAY,CAAC,IAAI,EAAE,kBAAkB;AAAA,EACjE;AACF;AAEA,SAAS,UAAU,MAAkB,KAA4B;AAC/D,QAAM,OAAO,aAAa,MAAM,GAAG;AACnC,MAAI,CAAC,QAAQ,KAAK,UAAU,EAAG,QAAO;AACtC,MAAI,KAAK,YAAY,KAAK,IAAI,MAAM,KAAK,cAAc,GAAG;AACxD,WAAO,OAAO,KAAK,IAAI,EAAE,UAAU,KAAK,WAAW,KAAK,CAAC;AAAA,EAC3D;AACA,MAAI,KAAK,YAAY,KAAK,IAAI,MAAM,KAAK,cAAc,GAAG;AACxD,WAAO,QAAQ,MAAM,KAAK,SAAS;AAAA,EACrC;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,MAAkB,QAAmC;AAC5E,MAAI,SAAS,KAAK,SAAS,IAAI,KAAK,UAAU,QAAQ,MAAM,SAAS,CAAC,MAAM,OAAQ,QAAO;AAC3F,QAAM,WAAW,KAAK,IAAI;AAC1B,QAAM,YAAY,SAAS,UAAU,QAAQ,KAAK;AAClD,MAAI,aAAa;AACjB,MAAI;AACJ,MAAI,cAAc,GAAG;AACnB,WAAO;AAAA,EACT,WAAW,cAAc,GAAG;AAC1B,UAAM,WAAW,QAAQ,MAAM,SAAS,CAAC;AACzC,QAAI,aAAa,KAAM,QAAO;AAC9B,iBAAa;AACb,mBAAe;AAAA,EACjB,OAAO;AACL,mBAAe,OAAO,SAAS;AAAA,EACjC;AACA,MAAI,eAAe,OAAO,UAAU,KAAK,eAAe,OAAO,KAAK,SAAS,MAAM,GAAG;AACpF,WAAO;AAAA,EACT;AACA,QAAM,cAAc,OAAO,MAAM,IAAI;AACrC,MAAI,cAAc,QAAS,QAAO;AAClC,SAAO,EAAE,WAAW,OAAO,SAAS,UAAU,GAAG,YAAY;AAC/D;AAEA,SAAS,gBACP,YACA,WACA,WACe;AACf,QAAM,QAAQ,cAAc,aAAa;AACzC,SAAO,UAAU,UAAa,UAAU,IAAI,OAAO;AACrD;AAEA,SAAS,iBACP,MACA,KACA,WACA,gBACA,MACA,OACA,MACA,YAC8B;AAC9B,QAAM,OAAO,aAAa,MAAM,GAAG;AACnC,MAAI,CAAC,QAAS,KAAK,YAAY,KAAK,KAAK,YAAY,MAChD,KAAK,QAAQ,CAAC,sBAAsB,MACpC,KAAK,QAAQ,8BAA8B,MAC1C,KAAK,QAAQ,qCAAqC,MACjD,KAAK,QAAQ,+BAA+B,GAAI;AACrD,WAAO;AAAA,EACT;AACA,QAAM,WAAW,KAAK,IAAI;AAC1B,MAAI,SAAS,KAAK;AAClB,MAAI,SAAS,IAAI,IAAI,IAAK,QAAO;AACjC,QAAM,cAAc,SAAS,UAAU,QAAQ,KAAK;AACpD,YAAU;AACV,MAAI,gBAAgB,KAAK,cAAc,WAAY,QAAO;AAC1D,QAAM,qBAAqB,SAAS,SAAS,QAAQ,KAAK;AAC1D,YAAU;AACV,MAAI,qBAAqB,EAAG,QAAO;AACnC,QAAM,aAAa,OAAO,kBAAkB;AAC5C,QAAM,qBAAqB,OAAO,SAAS,IAAI;AAC/C,MAAI,qBAAqB,OAAO,KAAK,MAAM,KAAK,qBAAqB,KAAK,UAAW,QAAO;AAC5F,OAAK,KAAK,QAAQ,qCAAqC,GAAG;AACxD,QAAI,SAAS,IAAI,IAAI,IAAK,QAAO;AACjC,cAAU;AAAA,EACZ;AAEA,MAAI,aAAa;AACjB,MAAI,eAAe;AACnB,QAAM,UAAiC,CAAC;AACxC,WAAS,QAAQ,GAAG,QAAQ,aAAa,SAAS;AAChD,QAAI;AACJ,SAAK,KAAK,QAAQ,kCAAkC,GAAG;AACrD,UAAI,SAAS,IAAI,IAAI,IAAK,QAAO;AACjC,sBAAgB,SAAS,UAAU,QAAQ,KAAK;AAChD,gBAAU;AAAA,IACZ;AACA,QAAI;AACJ,SAAK,KAAK,QAAQ,8BAA8B,GAAG;AACjD,UAAI,SAAS,IAAI,IAAI,IAAK,QAAO;AACjC,kBAAY,SAAS,UAAU,QAAQ,KAAK;AAC5C,gBAAU;AAAA,IACZ;AACA,SAAK,KAAK,QAAQ,+BAA+B,GAAG;AAClD,UAAI,SAAS,IAAI,IAAI,IAAK,QAAO;AACjC,gBAAU;AAAA,IACZ;AACA,QAAI,oBAAoB;AACxB,SAAK,KAAK,QAAQ,oCAAoC,GAAG;AACvD,UAAI,SAAS,IAAI,IAAI,IAAK,QAAO;AACjC,0BAAoB,KAAK,YAAY,IACjC,SAAS,SAAS,QAAQ,KAAK,IAC/B,SAAS,UAAU,QAAQ,KAAK;AACpC,gBAAU;AAAA,IACZ;AACA,QAAI,SAAS,IAAI,IAAK,QAAO;AAE7B,UAAM,WAAW;AAAA,MACf;AAAA,MACA,KAAK;AAAA,MACL,MAAM;AAAA,IACR;AACA,UAAM,OAAO,gBAAgB,WAAW,KAAK,mBAAmB,MAAM,iBAAiB;AACvF,QAAI,aAAa,QAAQ,SAAS,KAAM,QAAO;AAC/C,UAAM,YAAY,eAAe,OAAO,IAAI;AAC5C,UAAM,oBAAoB,OAAO,SAAS,IAAI;AAC9C,QAAI,oBAAoB,KAAK,eAAe,oBAAoB,QAAS,QAAO;AAChF,UAAM,mBAAmB,aAAa,OAAO,iBAAiB;AAC9D,QAAI,mBAAmB,WAAW,mBAAmB,QAAS,QAAO;AACrE,YAAQ,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAW,MAAM;AAAA,MACjB;AAAA,MACA;AAAA,IACF,CAAC;AACD,kBAAc,OAAO,QAAQ;AAC7B,QAAI,aAAa,QAAS,QAAO;AACjC,mBAAe;AAAA,EACjB;AACA,SAAO,WAAW,IAAI,MAAM,UAAU;AACxC;AAEO,SAAS,gCACd,MACA,OACA,YACmC;AACnC,MAAI,CAAC,OAAO,UAAU,UAAU,KAAK,cAAc,EAAG,QAAO;AAC7D,QAAM,QAAQ,SAAS,MAAM,GAAG,KAAK,MAAM;AAC3C,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,OAAO,MAAM,SAAS,SACxB,SAAS,MAAM,MAAM,KAAK,KAAK,MAAM,IACrC;AACJ,MAAI,CAAC,QAAQ,KAAK,SAAS,UAAU,KAAK,OAAO,KAAK,OAAQ,QAAO;AACrE,QAAM,eAAe,SAAS,MAAM,IAAI;AACxC,MAAI,CAAC,aAAc,QAAO;AAC1B,QAAM,OAAO,WAAW,cAAc,MAAM;AAC5C,QAAM,OAAO,WAAW,cAAc,MAAM;AAC5C,MAAI,CAAC,QAAQ,CAAC,KAAM,QAAO;AAC3B,QAAM,8BAA8B,kBAAkB,MAAM,IAAI;AAChE,MAAI,gCAAgC,QAAQ,gCAAgC,EAAG,QAAO;AAEtF,QAAM,eAAe,SAAS,MAAM,IAAI;AACxC,MAAI,CAAC,aAAc,QAAO;AAC1B,QAAM,UAAU,WAAW,cAAc,MAAM;AAC/C,QAAM,UAAU,WAAW,cAAc,MAAM;AAC/C,QAAM,UAAU,WAAW,cAAc,MAAM;AAC/C,MAAI,CAAC,WAAW,CAAC,WAAW,CAAC,QAAS,QAAO;AAC7C,QAAM,OAAO,UAAU,MAAM,OAAO;AACpC,QAAM,iBAAiB,UAAU,MAAM,OAAO;AAC9C,MAAI,CAAC,QAAQ,KAAK,YAAY,MAAM,WAAW,mBAAmB,KAAM,QAAO;AAC/E,QAAM,OAAO,gBAAgB,MAAM,KAAK,GAAG;AAC3C,MAAI,CAAC,KAAM,QAAO;AAClB,QAAM,UAAU;AAAA,IACd;AAAA,IACA;AAAA,IACA,KAAK;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,MAAI,CAAC,QAAS,QAAO;AACrB,SAAO,EAAE,6BAA6B,QAAQ;AAChD;AAEA,SAAS,UAAU,GAAuB,GAAgC;AACxE,SAAO,EAAE,YAAY,EAAE,WACrB,EAAE,cAAc,EAAE,aAClB,EAAE,0BAA0B,EAAE,yBAC9B,EAAE,sBAAsB,EAAE;AAC9B;AAEA,SAAS,WAAW,GAAwB,GAAiC;AAC3E,SAAO,EAAE,eAAe,EAAE,cACxB,EAAE,qBAAqB,EAAE,oBACzB,EAAE,aAAa,EAAE,YACjB,EAAE,cAAc,EAAE,aAClB,EAAE,SAAS,EAAE,QACb,EAAE,iBAAiB,EAAE;AACzB;AA/jBA;AAokBO,IAAM,wBAAN,MAA4B;AAAA,EAOjC,YAAqB,mBAA2B;AAA3B;AAPhB;AACL,+BAAoC;AACpC,mCAAa,oBAAI,IAAkC;AACnD,wCAAkB;AAClB,wCAAkB;AAClB,oDAAoE;AAGlE,QAAI,CAAC,OAAO,UAAU,iBAAiB,KAAK,qBAAqB,GAAG;AAClE,YAAM,IAAI,MAAM,sEAAsE;AAAA,IACxF;AAAA,EACF;AAAA,EAEA,IAAI,qBAA6B;AAC/B,WAAO,mBAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,qBAA6B;AAC/B,WAAO,mBAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,6BAAmE;AACrE,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,kBAAkB,MAA2B;AAC3C,UAAM,SAAS,iCAAiC,IAAI;AACpD,QAAI,CAAC,OAAQ,QAAO;AACpB,QAAI,mBAAK,QAAQ,QAAO,UAAU,mBAAK,SAAQ,MAAM;AACrD,uBAAK,QAAS;AACd,WAAO;AAAA,EACT;AAAA,EAEA,iBACE,mBACA,MACA,wBAAwB,KAAK,mBACpB;AACT,uBAAK,6BAA8B;AACnC,QAAI,CAAC,OAAO,UAAU,qBAAqB,KAAK,wBAAwB,GAAG;AACzE,yBAAK,6BAA8B;AACnC,aAAO;AAAA,IACT;AACA,QAAI,CAAC,mBAAK,WAAU,CAACC,OAAM,iBAAiB,GAAG;AAC7C,yBAAK,6BAA8B;AACnC,aAAO;AAAA,IACT;AACA,UAAM,SAAS;AAAA,MACb;AAAA,MACA,mBAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,QAAI,CAAC,QAAQ;AACX,yBAAK,6BAA8B;AACnC,aAAO;AAAA,IACT;AACA,UAAM,MAAM,YAAY,mBAAmB,OAAO,2BAA2B;AAC7E,UAAM,WAAW,mBAAK,YAAW,IAAI,GAAG;AACxC,QAAI,UAAU;AACZ,aAAO,SAAS,WAAW,OAAO,QAAQ,UAAU,SAAS;AAAA,QAC3D,CAAC,QAAQ,UAAU,WAAW,QAAQ,WAAW,QAAQ,OAAO,QAAQ,KAAK,CAAE;AAAA,MACjF;AAAA,IACF;AAiBA,QAAI,QAAQ;AACZ,WACE,mBAAK,YAAW,OAAO,MACtB,mBAAK,mBAAkB,OAAO,QAAQ,SAAS,KAAK,qBACnD,OAAO,QAAQ,SAAS,QAAQ,wBAClC;AACA,eAAS,sBAAK,0DAAL;AAAA,IACX;AAGA,QAAI,OAAO,QAAQ,SAAS,QAAQ,uBAAuB;AACzD,yBAAK,6BAA8B;AACnC,aAAO;AAAA,IACT;AACA,QAAI,mBAAK,mBAAkB,OAAO,QAAQ,SAAS,KAAK,mBAAmB;AACzE,yBAAK,6BAA8B;AACnC,aAAO;AAAA,IACT;AACA,uBAAK,YAAW,IAAI,KAAK,CAAC,GAAG,OAAO,OAAO,CAAC;AAC5C,uBAAK,iBAAL,mBAAK,mBAAmB,OAAO,QAAQ;AACvC,WAAO;AAAA,EACT;AAAA,EAEA,aACE,mBACA,6BACA,cAC4B;AAC5B,QAAI,CAACA,OAAM,iBAAiB,KAAK,CAACA,OAAM,2BAA2B,KAC/D,gCAAgC,KAAK,CAACA,OAAM,YAAY,KAAK,iBAAiB,GAAG;AACnF,aAAO;AAAA,IACT;AACA,UAAM,UAAU,mBAAK,YAAW;AAAA,MAC9B,YAAY,mBAAmB,2BAA2B;AAAA,IAC5D;AACA,WAAO,UAAU,eAAe,CAAC,KAAK;AAAA,EACxC;AAAA,EAEA,cACE,mBACA,6BACA,cACA,UACS;AACT,UAAM,UAAU,mBAAK,YAAW;AAAA,MAC9B,YAAY,mBAAmB,2BAA2B;AAAA,IAC5D;AACA,UAAM,SAAS,UAAU,eAAe,CAAC;AACzC,QAAI,CAAC,UAAU,CAAC,WAAW,QAAQ,QAAQ,EAAG,QAAO;AACrD,WAAO,sBAAK,gDAAL,WAAgB,mBAAmB,6BAA6B;AAAA,EACzE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBA,cACE,mBACA,6BACA,cACS;AACT,WAAO,sBAAK,gDAAL,WAAgB,mBAAmB,6BAA6B;AAAA,EACzE;AAAA,EAyCA,QAAc;AACZ,uBAAK,QAAS;AACd,uBAAK,YAAW,MAAM;AACtB,uBAAK,iBAAkB;AAAA,EACzB;AACF;AAjNE;AACA;AACA;AACA;AACA;AALK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA6KL,yBAAoB,WAAW;AAC7B,QAAM,SAAS,mBAAK,YAAW,KAAK,EAAE,KAAK,EAAE;AAC7C,MAAI,WAAW,OAAW,QAAO;AACjC,QAAM,UAAU,mBAAK,YAAW,IAAI,MAAM;AAC1C,MAAI,OAAO;AACX,aAAW,UAAU,QAAS,KAAI,WAAW,KAAM;AACnD,qBAAK,YAAW,OAAO,MAAM;AAC7B,qBAAK,iBAAL,mBAAK,mBAAmB;AACxB,qBAAK,iBAAL,mBAAK,mBAAmB;AACxB,SAAO;AACT;AAAA;AAGA,eAAU,SACR,mBACA,6BACA,cACS;AACT,MAAI,CAACA,OAAM,iBAAiB,KAAK,CAACA,OAAM,2BAA2B,KAC/D,gCAAgC,KAAK,CAACA,OAAM,YAAY,KAAK,iBAAiB,GAAG;AACnF,WAAO;AAAA,EACT;AACA,QAAM,MAAM,YAAY,mBAAmB,2BAA2B;AACtE,QAAM,UAAU,mBAAK,YAAW,IAAI,GAAG;AACvC,QAAM,QAAQ,eAAe;AAC7B,MAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,EAAG,QAAO;AACxC,UAAQ,KAAK,IAAI;AACjB,yBAAK,iBAAL;AACA,MAAI,QAAQ,MAAM,WAAS,UAAU,IAAI,EAAG,oBAAK,YAAW,OAAO,GAAG;AACtE,SAAO;AACT;AASF,SAAS,YAAY,mBAA2B,6BAA6C;AAC3F,SAAO,GAAG,iBAAiB,IAAI,2BAA2B;AAC5D;AAEA,SAASA,OAAM,OAAwB;AACrC,SAAO,OAAO,UAAU,KAAK,KAAK,SAAS,KAAK,SAAS;AAC3D;AAGO,SAAS,yBAAyB,OAAe,WAAkC;AACxF,MAAI,CAAC,OAAO,UAAU,SAAS,KAAK,aAAa,EAAG,QAAO;AAC3D,QAAM,YAAY,QAAQ;AAC1B,QAAM,QAAQ,OAAO,SAAS;AAC9B,QAAM,QAAQ,YAAY;AAC1B,QAAM,YAAY,YAAY;AAC9B,MAAI,QAAQ,OAAO,OAAO,gBAAgB,KAAK,QAAQ,OAAO,OAAO,gBAAgB,GAAG;AACtF,WAAO;AAAA,EACT;AACA,QAAM,SAAS,OAAO,KAAK,IAAI,OAAO,SAAS,IAAI;AACnD,SAAO,OAAO,SAAS,MAAM,IAAI,SAAS;AAC5C;;;AC7bO,SAAS,sBAAsB,SAAkB,UAA4B;AAClF,SAAO,YAAY,YAAY,KAAK;AACtC;AAkEA,SAAS,wBAAwB,OAAkD;AACjF,SAAO;AAAA,IACL,aAAa,MAAM,KAAK;AAAA,IACxB,UAAU,MAAM,KAAK;AAAA,IACrB,gBAAgB,MAAM;AAAA,IACtB,GAAI,MAAM,KAAK,yBAAyB,SACpC,CAAC,IACD,EAAE,sBAAsB,MAAM,KAAK,qBAAqB;AAAA,IAC5D,GAAI,MAAM,KAAK,gCAAgC,SAC3C,CAAC,IACD,EAAE,6BAA6B,MAAM,KAAK,4BAA4B;AAAA,IAC1E,GAAI,MAAM,KAAK,iBAAiB,SAAY,CAAC,IAAI,EAAE,cAAc,MAAM,KAAK,aAAa;AAAA,IACzF,GAAI,MAAM,KAAK,kBAAkB,SAC7B,CAAC,IACD,EAAE,eAAe,MAAM,KAAK,cAAc;AAAA,EAChD;AACF;AAIA,SAAS,oBAAoB,GAAW,GAAmB;AACzD,SAAQ,IAAI,IAAK;AACnB;AAEA,SAAS,kBACP,GACA,GACQ;AACR,MAAI,EAAE,KAAK,eAAe,UAAa,EAAE,KAAK,eAAe,UACzD,EAAE,KAAK,mBAAmB,EAAE,KAAK,gBAAgB;AACnD,QAAI,EAAE,KAAK,aAAa,EAAE,KAAK,WAAY,QAAO;AAClD,QAAI,EAAE,KAAK,aAAa,EAAE,KAAK,WAAY,QAAO;AAAA,EACpD,OAAO;AACL,UAAM,eAAe,EAAE,KAAK,mBAAmB,EAAE,KAAK,cACnD,EAAE,KAAK,mBAAmB,EAAE,KAAK;AACpC,QAAI,gBAAgB,EAAG,QAAO;AAAA,EAChC;AACA,QAAM,aAAa;AAAA,IACjB,EAAE,KAAK,+BAA+B;AAAA,IACtC,EAAE,KAAK,+BAA+B;AAAA,EACxC;AACA,MAAI,eAAe,EAAG,QAAO;AAC7B,QAAM,eAAe,EAAE,KAAK,gBAAgB,MAAM,EAAE,KAAK,gBAAgB;AACzE,SAAO,gBAAgB,IAAI,cAAc,oBAAoB,EAAE,KAAK,EAAE,GAAG;AAC3E;AA/dA;AAieA,IAAM,iBAAN,MAAqB;AAAA,EAMnB,YACE,YACA,MACA,aAA4D,MAAM;AAAA,EAAC,GACnE;AAVJ;AACE,iCAAW,oBAAI,IAA6B;AAC5C;AACA;AACA;AAOE,uBAAK,aAAc;AACnB,uBAAK,OAAQ;AACb,uBAAK,aAAc;AAAA,EACrB;AAAA,EAEA,KAAK,MAAkB,MAAiB,KAAmB;AACzD,QAAI,mBAAK,gBAAe,GAAG;AACzB,yBAAK,OAAL,WAAW,MAAM;AACjB;AAAA,IACF;AACA,UAAM,QAAsB,EAAE,MAAM,MAAM,EAAE,GAAG,KAAK,GAAG,IAAI;AAC3D,UAAM,SAAS,sBAAK,yCAAL,WAAgB,KAAK;AACpC,QAAI,KAAK,qBAAqB;AAC5B,yBAAK,aAAL,WAAiB;AACjB,yBAAK,aAAL,WAAiB,2BAA2B,OAAO,IAAI;AACvD,aAAO,MAAM,CAAC;AACd,aAAO,cAAc;AACrB,YAAM,KAAK,sBAAsB;AAAA,IACnC;AACA,QAAI,sBAAK,uCAAL,WAAc,QAAQ,QAAQ;AAChC,yBAAK,aAAL,WAAiB;AACjB;AAAA,IACF;AACA,QAAI,KAAK,YAAY,OAAO,gBAAgB,MAAM;AAGhD,yBAAK,aAAL,WAAiB,gCAAgC,OAAO,IAAI;AAC5D,aAAO,MAAM,CAAC;AACd,4BAAK,yCAAL,WAAgB,QAAQ;AACxB;AAAA,IACF;AACA,QAAI,KAAK,GAAG,KAAK,OAAO,IAAI;AAC5B,WAAO,KAAK,IAAI;AACd,YAAM,MAAO,KAAK,OAAQ;AAC1B,UAAI,kBAAkB,OAAO,IAAI,GAAG,GAAI,KAAK,IAAI,EAAG,MAAK,MAAM;AAAA,UAC1D,MAAK;AAAA,IACZ;AACA,WAAO,IAAI,OAAO,IAAI,GAAG,KAAK;AAC9B,WAAO,OAAO,IAAI,SAAS,mBAAK,aAAa,uBAAK,yCAAL,WAAgB;AAAA,EAC/D;AAAA,EAEA,QAAc;AACZ,eAAW,YAAY,CAAC,GAAG,mBAAK,UAAS,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG;AACtE,YAAM,SAAS,mBAAK,UAAS,IAAI,QAAQ;AACzC,aAAO,UAAU,OAAO,IAAI,SAAS,EAAG,uBAAK,yCAAL,WAAgB;AAAA,IAC1D;AAAA,EACF;AAAA,EAEA,IAAI,WAAmB;AACrB,QAAI,QAAQ;AACZ,eAAW,UAAU,mBAAK,UAAS,OAAO,EAAG,UAAS,OAAO,IAAI;AACjE,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,cAAgE;AAClE,WAAO,CAAC,GAAG,mBAAK,UAAS,OAAO,CAAC,EAAE,IAAI,aAAW;AAAA,MAChD,gBAAgB,OAAO,IAAI;AAAA,MAC3B,aAAa,OAAO,cAAc,wBAAwB,OAAO,WAAW,IAAI;AAAA,MAChF,iBAAiB;AAAA,MACjB,MAAM,OAAO,IAAI,MAAM,GAAG,CAAC,EAAE,IAAI,uBAAuB;AAAA,MACxD,MAAM,OAAO,IAAI,MAAM,EAAE,EAAE,IAAI,uBAAuB;AAAA,MACtD,WAAW,OAAO,IAAI,OAAO,WAAS,MAAM,KAAK,QAAQ,EAAE,MAAM,GAAG,CAAC,EAClE,IAAI,uBAAuB;AAAA,IAChC,EAAE;AAAA,EACJ;AAAA,EAEA,UAAgB;AACd,eAAW,UAAU,mBAAK,UAAS,OAAO,GAAG;AAC3C,yBAAK,aAAL,WAAiB,wBAAwB,OAAO,IAAI;AACpD,aAAO,MAAM,CAAC;AAAA,IAChB;AACA,uBAAK,UAAS,MAAM;AAAA,EACtB;AA+BF;AAjHE;AACA;AACA;AACA;AAJF;AAqFE,eAAU,SAAC,UAAmC;AAC5C,MAAI,SAAS,mBAAK,UAAS,IAAI,QAAQ;AACvC,MAAI,CAAC,QAAQ;AACX,aAAS,EAAE,KAAK,CAAC,GAAG,aAAa,KAAK;AACtC,uBAAK,UAAS,IAAI,UAAU,MAAM;AAAA,EACpC;AACA,SAAO;AACT;AAEA,eAAU,SAAC,QAAkC;AAC3C,QAAM,IAAI,OAAO,IAAI,MAAM;AAC3B,MAAI,CAAC,EAAG,QAAO;AACf,SAAO,sBAAK,yCAAL,WAAgB,QAAQ;AACjC;AAEA,aAAQ,SAAC,QAAyB,OAA8B;AAC9D,SAAO,OAAO,gBAAgB,QAC5B,kBAAkB,OAAO,OAAO,WAAW,KAAK;AACpD;AAEA,eAAU,SAAC,QAAyB,OAA8B;AAChE,MAAI,sBAAK,uCAAL,WAAc,QAAQ,QAAQ;AAChC,uBAAK,aAAL,WAAiB;AACjB,WAAO;AAAA,EACT;AACA,SAAO,cAAc;AACrB,qBAAK,OAAL,WAAW,MAAM,MAAM,MAAM;AAC7B,SAAO;AACT;AAKF,IAAM,iBAAiB,oBAAI,IAAI,CAAC,QAAQ,QAAQ,MAAM,CAAC;AAEvD,SAAS,UAAU,MAA2B;AAC5C,MAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,QAAM,OAAO,OAAO,aAAa,KAAK,CAAC,GAAI,KAAK,CAAC,GAAI,KAAK,CAAC,GAAI,KAAK,CAAC,CAAE;AACvE,SAAO,eAAe,IAAI,IAAI;AAChC;AA7lBA,s0BAAAC,eAAA;AAsmBO,IAAM,uBAAN,MAAM,qBAAoB;AAAA,EA0H/B,YAAY,QAA2B;AA1HlC;AACL,gCAAU,oBAAI,IAAuB;AACrC,sCAAkC;AAClC;AAcA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,yCAAmB,oBAAI,IAA4B;AACnD;AAGA;AAAA;AAAA,oDAAmD;AAAA,MACjD,iBAAiB;AAAA,MACjB,oBAAoB;AAAA,MACpB,iBAAiB;AAAA,MACjB,gBAAgB;AAAA,IAClB;AACA,uCAAiB,oBAAI,IAA+B;AACpD;AACA,8CAAwB;AACxB,gDAA0B;AAC1B,8CAAwB;AACxB,gDAA0B;AAC1B,oCAAc,oBAAI,IAA6D;AAC/E,uCAAiB;AACjB,0CAAgD;AAChD,iCAAiC;AACjC,gCAA+B;AAC/B,wCAA+C;AAC/C,uCAAiB,oBAAI,IAA2B;AAChD,sCAA0D;AAAA,MACxD,8BAA8B;AAAA,MAC9B,kCAAkC;AAAA,MAClC,cAAc;AAAA,MACd,qBAAqB;AAAA,MACrB,sBAAsB;AAAA,MACtB,iBAAiB;AAAA,MACjB,yBAAyB;AAAA,IAC3B;AAQA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gDAA0B,oBAAI,IAAoB;AAClD,kCAAY;AACZ,oCAAc;AACd,sCAAgB,oBAAI,IAAgC;AACpD,8CAAwB,oBAAI,IAAgC;AAC5D,qCAA0C;AAC1C,0CAAoB;AA+8BpB;AAAA,8BAAyC;AAl5BvC,QAAI,QAAQ,oBAAoB,OAAO,iBAAiB,QAAW;AACjE,YAAM,IAAI,MAAM,sEAAsE;AAAA,IACxF;AACA,UAAM,mBAAmB,QAAQ,oBAAoB;AACrD,UAAM,yBAAyB,QAAQ,iBAAiB;AACxD,QAAI,CAAC,OAAO,SAAS,sBAAsB,KAAK,yBAAyB,GAAG;AAC1E,YAAM,IAAI,MAAM,kEAAkE;AAAA,IACpF;AACA,UAAM,0BAA0B,KAAK,KAAK,sBAAsB;AAChE,UAAM,sBAAsB,mBACxB,uBAAuB,gBAAgB,IACvC,QAAQ;AACZ,QAAI,kBAAkB;AACpB,mCAA6B,kBAAkB,uBAAuB;AAAA,IACxE;AACA,QACE,wBAAwB,UACxB,wBAAwB,QACxB,uBAAuB,GACvB;AACA,YAAM,IAAI,MAAM,gDAAgD;AAAA,IAClE;AACA,UAAM,0BAA0B,QAAQ,mBAAmB;AAC3D,QAAI,CAAC,OAAO,UAAU,uBAAuB,KAAK,2BAA2B,GAAG;AAC9E,YAAM,IAAI,MAAM,kEAAkE;AAAA,IACpF;AACA,uBAAK,0BAA2B;AAEhC,UAAM,uBAAuB,QAAQ,wBAAwB;AAC7D,QAAI,CAAC,OAAO,UAAU,oBAAoB,KAAK,wBAAwB,GAAG;AACxE,YAAM,IAAI,MAAM,uEAAuE;AAAA,IACzF;AAKA,uBAAK,mBAAoB;AACzB,QAAI,QAAQ,aAAa;AACvB,yBAAK,cAAe,OAAO;AAG3B,UAAI,wBAAwB,QAAW;AACrC,2BAAK,cAAa,YAAY;AAAA,MAChC;AAAA,IACF,OAAO;AACL,yBAAK,cAAe,IAAI,eAAe;AAAA,QACrC,WAAW,wBAAwB,SAAY,MAAO;AAAA,QACtD,GAAI,QAAQ,oBAAoB,SAAY,CAAC,IAAI,EAAE,aAAa,OAAO,gBAAgB;AAAA,MACzF,CAAC;AAAA,IACH;AACA,uBAAK,gBAAiB;AACtB,uBAAK,wBAAyB;AAAA,MAC5B,aAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOb,qBAAqB;AAAA,MACrB,sBAAsB;AAAA,IACxB;AACA,uBAAK,eAAgB,QAAQ,gBAAgB;AAC7C,QAAI,mBAAK,eAAe,uBAAK,6DAAL;AACxB,QAAI,QAAQ,QAAQ;AAClB,iBAAW,CAAC,IAAI,IAAI,KAAK,OAAO,QAAQ;AACtC,8BAAK,6DAAL;AACA,2BAAK,SAAQ,IAAI,IAAI,IAAI;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,cAAqC;AACvC,WAAO,mBAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAI,sBAAqD;AACvD,UAAM,QAAQ,EAAE,GAAG,mBAAK,6BAA4B;AACpD,eAAW,YAAY,mBAAK,kBAAiB,OAAO,GAAG;AACrD,YAAM,QAAQ,SAAS;AACvB,YAAM,mBAAmB,MAAM;AAC/B,YAAM,sBAAsB,MAAM;AAClC,YAAM,mBAAmB,MAAM;AAC/B,YAAM,kBAAkB,MAAM;AAAA,IAChC;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,IAAI,oBAAqD;AACvD,WAAO;AAAA,MACL,SAAS,mBAAK;AAAA,MACd,UAAU,mBAAK;AAAA,MACf,WAAW,mBAAK;AAAA,MAChB,SAAS,mBAAK;AAAA,MACd,wBAAwB,mBAAK;AAAA,IAC/B;AAAA,EACF;AAAA,EAEA,IAAI,eAA2C;AAC7C,QAAI,iBAAiB;AACrB,eAAW,EAAE,UAAU,KAAK,mBAAK,aAAY,OAAO,EAAG,mBAAkB,UAAU;AACnF,WAAO,EAAE,GAAG,mBAAK,gBAAe,eAAe;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAI,YAA2C;AAC7C,WAAO;AAAA,MACL,YAAY,mBAAK;AAAA,MACjB,UAAU,OAAO,YAAY,mBAAK,cAAa;AAAA,MAC/C,kBAAkB,OAAO,YAAY,mBAAK,sBAAqB;AAAA,IACjE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,IAAI,kBAA6C;AAC/C,WAAO,mBAAK;AAAA,EACd;AAAA;AAAA;AAAA,EAIA,IAAI,uBAA+B;AACjC,WAAO,mBAAK;AAAA,EACd;AAAA,EA0BA,IAAI,qBAAkE;AACpE,UAAM,UAA0C,CAAC;AACjD,eAAW,EAAE,UAAU,UAAU,KAAK,mBAAK,aAAY,OAAO,GAAG;AAC/D,iBAAW,eAAe,UAAU,YAAa,SAAQ,KAAK,EAAE,UAAU,GAAG,YAAY,CAAC;AAAA,IAC5F;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,kBAAwB;AACtB,UAAM,YAAY,mBAAK,cAAa;AACpC,QAAI,cAAc,KAAM;AACxB,eAAW,YAAY,mBAAK,kBAAiB,OAAO,GAAG;AACrD,eAAS,gBAAgB,SAAS;AAAA,IACpC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,YAAY,QAAoB,SAAiD;AAC/E,QAAI;AACF,YAAM,SAAS,gBAAgB,MAAM;AACrC,YAAM,WAAW,OAAO,eAAe;AACvC,YAAM,eACJ,CAAC,SAAS,oBACV,CAAC,YAAY,sBAAsB,MAAM,IACrC,oBAAoB,MAAM,IAC1B;AACN,aAAO;AAAA,QACL,UAAU,OAAO;AAAA,QACjB,YAAY,OAAO;AAAA,QACnB,WAAW,OAAO;AAAA,QAClB,aAAa,sBAAsB,OAAO,SAAS;AAAA,QACnD,gBAAgB,OAAO;AAAA,QACvB,SAAS,OAAO;AAAA,QAChB,SAAS,OAAO;AAAA,QAChB;AAAA,QACA;AAAA,MACF;AAAA,IACF,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGA,KAAK,QAAoB,SAAuD;AAC9E,uBAAK,aAAL,mBAAK,eAAe;AACpB,QAAI;AACJ,QAAI;AACF,eAAS,sBAAK,yCAAL,WAAW,QAAQ;AAAA,IAC9B,SAAS,OAAO;AAId,4BAAK,iDAAL,WAAmB;AACnB,YAAM;AAAA,IACR;AAGA,QAAI,OAAQ,uBAAK,iDAAL,WAAmB,OAAO;AACtC,WAAO;AAAA,EACT;AAAA,EA0UA,OAAO,IAAwB;AAC7B,uBAAK,SAAU;AAAA,EACjB;AAAA,EAEA,QAAQ,IAAyB;AAC/B,uBAAK,UAAW;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,eAAe,IAAgC;AAC7C,uBAAK,iBAAkB;AAAA,EACzB;AAAA,EAEA,aAAa,UAAkB,IAAyB;AACtD,uBAAK,gBAAe,IAAI,UAAU,EAAE;AAAA,EACtC;AAAA,EAEA,SAAS,UAAkB,MAAuB;AAChD,0BAAK,6DAAL;AACA,eAAW,CAAC,KAAK,KAAK,KAAK,mBAAK,cAAa;AAC3C,UAAI,MAAM,aAAa,SAAU;AACjC,YAAM,UAAU,MAAM;AACtB,yBAAK,aAAY,OAAO,GAAG;AAAA,IAC7B;AACA,eAAW,CAAC,KAAK,KAAK,KAAK,mBAAK,iBAAgB;AAC9C,UAAI,MAAM,aAAa,SAAU,uBAAK,qDAAL,WAAuB;AAAA,IAC1D;AACA,eAAW,OAAO,CAAC,GAAG,mBAAK,kBAAiB,KAAK,CAAC,GAAG;AACnD,UAAK,KAAK,MAAM,GAAG,EAA8B,CAAC,MAAM,UAAU;AAChE,8BAAK,uDAAL,WAAyB;AAAA,MAC3B;AAAA,IACF;AACA,eAAW,CAAC,KAAK,aAAa,KAAK,mBAAK,0BAAyB;AAC/D,UAAI,kBAAkB,SAAU,oBAAK,yBAAwB,OAAO,GAAG;AAAA,IACzE;AACA,uBAAK,SAAQ,IAAI,UAAU,IAAI;AAAA,EACjC;AAAA;AAAA,EAGA,WAAW,UAAkB,kBAAgC;AAC3D,QAAI,CAAC,kBAAkB;AACrB,YAAM,IAAI,MAAM,oEAAoE;AAAA,IACtF;AACA,eAAW,CAAC,KAAK,KAAK,KAAK,mBAAK,cAAa;AAC3C,UAAI,QAAQ,sBAAK,8CAAL,WAAgB,UAAU,kBAAmB;AACzD,YAAM,UAAU,QAAQ;AACxB,yBAAK,aAAY,OAAO,GAAG;AAAA,IAC7B;AACA,UAAM,YAAY,sBAAK,8CAAL,WAAgB,UAAU;AAC5C,0BAAK,qDAAL,WAAuB;AACvB,uBAAK,yBAAwB,OAAO,SAAS;AAC7C,uBAAK,cAAa,YAAY,gBAAgB;AAI9C,0BAAK,uDAAL,WAAyB;AAAA,EAC3B;AAAA,EAEA,gBAAgB,IAAyB;AACvC,QAAI,OAAO,QAAQ,MAAM,EAAG,OAAM,IAAI,MAAM,gDAAgD;AAC5F,uBAAK,cAAa,YAAY;AAAA,EAChC;AAAA,EAEA,oBAAoB,QAAmC;AACrD,UAAM,YAAY,uBAAuB,MAAM;AAC/C,0BAAK,6DAAL,WAA+B;AAC/B,0BAAK,oDAAL;AACA,uBAAK,mBAAoB;AACzB,uBAAK,yBAAwB,MAAM;AACnC,SAAK,gBAAgB,SAAS;AAAA,EAChC;AAAA,EAEA,iBAAiB,YAA0B;AACzC,QAAI,CAAC,OAAO,SAAS,UAAU,KAAK,aAAa,GAAG;AAClD,YAAM,IAAI,MAAM,kEAAkE;AAAA,IACpF;AACA,UAAM,aAAa,KAAK,KAAK,UAAU;AACvC,0BAAK,6DAAL,WAA+B,mBAAK,oBAAmB;AACvD,0BAAK,oDAAL;AACA,uBAAK,gBAAiB;AACtB,QAAI,mBAAK,mBAAkB,EAAG,oBAAK,aAAY,MAAM;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,MAAkB,MAAuB;AAClD,UAAM,MAAM,KAAK;AACjB,UAAM,YAAY,sBAAK,iDAAL,WAAmB,KAAK,UAAU,KAAK,WAAW,KAAK;AACzE,QAAI,aAAa,QAAQ,UAAa,OAAO,SAAS,GAAG,GAAG;AAC1D,gBAAU,KAAK,MAAM,MAAM,GAAG;AAC9B;AAAA,IACF;AACA,QAAI,mBAAK,oBAAmB,cAAc,kBACxC,KAAK,cAAc,WACnB,CAAC,sBAAK,+DAAL,WAAiC,OAAO;AACzC;AAAA,IACF;AACA,0BAAK,gCAAAA,eAAL,WAAgB,MAAM;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,yBACE,UACA,mBACA,6BACA,cACA,kBACuB;AACvB,QAAI,gCAAgC,UAAa,iBAAiB,OAAW,QAAO;AACpF,UAAM,WAAW,sBAAK,mDAAL,WACf,sBAAK,8CAAL,WAAgB,UAAU,mBAC1B,UACA;AAEF,UAAM,SAAS,UAAU;AAAA,MACvB;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,QAAI,CAAC,UAAU,CAAC,YAAY,CAAC,SAAS;AAAA,MACpC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,EAAG,QAAO;AACV,2BAAK,uBAAL;AACA,QAAI,mBAAK,yBAAwB,GAAG;AAClC,YAAM,IAAI,MAAM,kEAAkE;AAAA,IACpF;AACA,WAAO;AAAA,MACL,YAAY,OAAO;AAAA,MACnB,kBAAkB,OAAO;AAAA,MACzB,eAAe,OAAO;AAAA,MACtB,gBAAgB,OAAO;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA,EAkBA,QAAc;AACZ,QAAI,mBAAK,WAAW;AACpB,0BAAK,oDAAL;AAAA,EACF;AAAA,EAEA,UAAgB;AACd,uBAAK,WAAY;AACjB,eAAW,EAAE,UAAU,KAAK,mBAAK,aAAY,OAAO,EAAG,WAAU,QAAQ;AACzE,uBAAK,aAAY,MAAM;AACvB,uBAAK,gBAAe,MAAM;AAC1B,uBAAK,uBAAwB;AAC7B,uBAAK,yBAAwB,MAAM;AACnC,uBAAK,cAAa,MAAM;AACxB,uBAAK,UAAW;AAChB,uBAAK,SAAU;AACf,uBAAK,gBAAe,MAAM;AAAA,EAC5B;AAAA;AAAA,EAwJA,OAAO,WAAW,MAAkB,SAAkB,QAAQ,IAAa;AA9nD7E;AA+nDI,UAAM,kBAAkB,2CAAoB,iDAApB,SAAqC,MAAM;AACnE,QAAI,oBAAoB,OAAW,QAAO;AAC1C,WAAO;AAAA,EACT;AA2EF;AAtmCE;AACA;AACA;AAcA;AACA;AAGA;AAMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAgBA;AACA;AACA;AACA;AACA;AACA;AACA;AA9DK;AAgEL,eAAU,SAAC,UAAkB,kBAAmC;AAC9D,SAAO,KAAK,UAAU,CAAC,UAAU,oBAAoB,IAAI,CAAC;AAC5D;AAEA,uBAAkB,SAAC,WAAmC;AACpD,MAAI,WAAW,mBAAK,kBAAiB,IAAI,SAAS;AAClD,MAAI,aAAa,QAAW;AAC1B,eAAW,IAAI,eAAe;AAAA,MAC5B,GAAG,mBAAK;AAAA,MACR,WAAW,YAAU,sBAAK,sDAAL,WAAwB,WAAW;AAAA,IAC1D,CAAC;AACD,uBAAK,kBAAiB,IAAI,WAAW,QAAQ;AAAA,EAC/C;AACA,SAAO;AACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAgBA,uBAAkB,SAAC,WAAmB,QAA+B;AACnE,QAAM,WAAW,mBAAK,gBAAe,IAAI,SAAS,GAAG;AACrD,MAAI,CAAC,SAAU;AACf,MAAI,CAAC,SAAS;AAAA,IACZ,OAAO;AAAA,IACP,OAAO;AAAA,IACP,OAAO;AAAA,EACT,EAAG;AACH,yBAAK,uBAAL;AACA,yBAAK,yBAAL;AACA,MAAI,mBAAK,yBAAwB,GAAG;AAClC,UAAM,IAAI,MAAM,kEAAkE;AAAA,EACpF;AACF;AAAA;AAAA;AAIA,wBAAmB,SAAC,WAAyB;AAC3C,QAAM,WAAW,mBAAK,kBAAiB,IAAI,SAAS;AACpD,MAAI,aAAa,OAAW;AAC5B,QAAM,QAAQ,SAAS;AACvB,qBAAK,6BAA4B,mBAAmB,MAAM;AAC1D,qBAAK,6BAA4B,sBAAsB,MAAM;AAC7D,qBAAK,6BAA4B,mBAAmB,MAAM;AAC1D,qBAAK,6BAA4B,kBAAkB,MAAM;AACzD,qBAAK,kBAAiB,OAAO,SAAS;AACxC;AAmKA,kBAAa,SAAC,OAAiC;AAC7C,QAAM,SAAS,mBAAK,eAAc,IAAI,KAAK,KAAK,KAAK;AACrD,qBAAK,eAAc,IAAI,OAAO,KAAK;AACnC,qBAAK,cAAe;AACpB,qBAAK,mBAAoB;AAC3B;AAEA,0BAAqB,SAAC,QAAkC;AACtD,qBAAK,uBAAsB;AAAA,IACzB;AAAA,KACC,mBAAK,uBAAsB,IAAI,MAAM,KAAK,KAAK;AAAA,EAClD;AACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAOA,UAAK,SAAC,QAAkC;AACtC,wBAAK,iDAAL,WAAmB,QAAQ,MAAM;AACjC,SAAO;AACT;AA2EA,UAAK,SAAC,QAAoB,SAAuD;AAl+BnF;AAm+BI,MAAI,mBAAK,WAAW,QAAO,sBAAK,yCAAL,WAAW;AAEtC,OAAK,gBAAgB;AAErB,QAAM,OAAO,KAAK,YAAY,QAAQ,OAAO;AAC7C,MAAI,CAAC,KAAM,QAAO,sBAAK,yCAAL,WAAW;AAE7B,MAAI,KAAK,eAAeC,kBAAiB;AACvC,WAAO;AAAA,MACL,MAAM,KAAK,WAAW,WAAW;AAAA,MACjC,QAAQ;AAAA,MACR,YAAY,OAAO;AAAA,IACrB;AAAA,EACF;AAMA,MAAI,KAAK,iBAAiB,QAAQ,mBAAK,kBAAiB;AAItD,UAAM,YAAY,OAAO,SAAS,GAAG,OAAO,SAAS,CAAC;AACtD,UAAM,cAAcC,oBAAmB,MAAM;AAC7C,UAAM,OAAO,cACT,EAAE,MAAM,YAAY,MAAM,YAAY,YAAY,UAAU,IAC5D;AACJ,QAAI;AACF,yBAAK,iBAAL,WAAqB,KAAK,UAAU,KAAK,aAAa,MAAM,WAAW;AAAA,IACzE,QAAQ;AAAA,IAIR;AAAA,EACF;AAEA,QAAM,aAAa,kBAAkB,QAAQ;AAAA,IAC3C,WAAW,SAAS;AAAA,EACtB,CAAC;AACD,MAAI,CAAC,WAAY,QAAO,sBAAK,yCAAL,WAAW;AAEnC,QAAM,EAAE,KAAK,cAAc,MAAM,YAAY,IAAI;AACjD,MAAI,IAAI,cAAc,EAAG,QAAO,sBAAK,yCAAL,WAAW;AAC3C,QAAM,YAAY,sBAAK,8CAAL,WAAgB,KAAK,UAAU,SAAS;AAE1D,MAAI,iBAAiB,GAAG;AACtB,QAAI,IAAI,2BAA2B,KAAK,IAAI,oBAAoB;AAC9D,aAAO,sBAAK,yCAAL,WAAW;AAOpB,UAAM,iBAAiB,yBAAyB,IAAI;AACpD,QAAI,CAAC,eAAgB,QAAO,sBAAK,yCAAL,WAAW;AACvC,UAAMC,YAAW,sBAAK,mDAAL,WAAqB,WAAW,KAAK,UAAU;AAChE,QAAI,CAACA,WAAU,kBAAkB,cAAc,EAAG,QAAO,sBAAK,yCAAL,WAAW;AACpE,6BAAK,aAAL,8BAAe,gBAAgB,KAAK,UAAU,SAAS;AACvD,WAAO;AAAA,MACL,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,mBAAmB,IAAI;AAAA,MACvB,wBAAwB,IAAI;AAAA,MAC5B,iBAAiB,IAAI;AAAA,IACvB;AAAA,EACF;AAEA,MAAI,iBAAiB,GAAG;AACtB,QAAI,IAAI,2BAA2B,KAAK,IAAI,oBAAoB;AAC9D,aAAO,sBAAK,yCAAL,WAAW;AACpB,UAAMA,YAAW,sBAAK,mDAAL,WAAqB,WAAW,KAAK,UAAU;AAChE,QAAI,CAACA,UAAU,QAAO,sBAAK,yCAAL,WAAW;AACjC,UAAM,gBAAgBA,UAAS;AAC/B,UAAM,gBAAgBA,UAAS;AAC/B,UAAM,YAAY,mBAAK,4BAA2B,mBAAK;AACvD,UAAM,WAAWA,UAAS,iBAAiB,IAAI,mBAAmB,MAAM,SAAS;AAIjF,uBAAK,uBAAL,mBAAK,0BAAyBA,UAAS,qBAAqB;AAC5D,uBAAK,uBAAL,mBAAK,0BAAyBA,UAAS,qBAAqB;AAC5D,QAAI,CAAC,UAAU;AACb,UAAIA,UAAS,+BAA+B,UAAU;AACpD,+BAAK,yBAAL;AAAA,MACF;AACA,aAAO,sBAAK,yCAAL,WAAW;AAAA,IACpB;AACA,WAAO;AAAA,MACL,MAAM;AAAA,MACN,QAAQ;AAAA,MACR;AAAA,MACA,mBAAmB,IAAI;AAAA,MACvB,wBAAwB,IAAI;AAAA,MAC5B,iBAAiB,IAAI;AAAA,IACvB;AAAA,EACF;AACA,MAAI,iBAAiB,EAAG,QAAO,sBAAK,yCAAL,WAAW;AAE1C,QAAM,WAAW,sBAAK,mDAAL,WAAqB,WAAW,KAAK,UAAU;AAChE,MAAI,CAAC,SAAU,QAAO,sBAAK,yCAAL,WAAW;AACjC,MAAI,CAAC,OAAO,cAAc,KAAK,UAAU,KAAK,KAAK,cAAc;AAC/D,WAAO,sBAAK,yCAAL,WAAW;AACpB,MAAI,IAAI,2BAA2B,KAAK,IAAI,2BAA2B,GAAG;AACxE,QAAI,CAAC,eAAe,YAAY,gCAAgC,KAC5D,YAAY,iBAAiB,GAAG;AAClC,aAAO,sBAAK,yCAAL,WAAW;AAAA,IACpB;AACA,UAAM,aAAa,SAAS;AAAA,MAC1B,IAAI;AAAA,MACJ,YAAY;AAAA,MACZ,YAAY;AAAA,IACd;AACA,QAAI,CAAC,WAAY,QAAO,sBAAK,yCAAL,WAAW;AAMnC,UAAM,SAAS,YAAY;AAC3B,QAAI,CAAC,OAAO,cAAc,MAAM,KAAK,SAAS,KAAK,UAAU,WAAW;AACtE,aAAO,sBAAK,yCAAL,WAAW;AACpB,UAAM,YAAY,WAAW,OAAO;AAMpC,QAAI,IAAI,2BAA2B,KAAK,KAAK,eAAe;AAC1D,aAAO,sBAAK,yCAAL,WAAW;AACpB,QAAI,IAAI,2BAA2B,KAAK,KAAK,cAAc;AACzD,aAAO,sBAAK,yCAAL,WAAW;AAOpB,UAAM,kBAAkB,sBAAK,sDAAL,WAAwB,WAAW;AAAA,MACzD,SAAS;AAAA,MACT,IAAI;AAAA,MACJ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,WAAW;AAAA,IACb;AACA,QAAI,iBAAiB;AACnB,YAAM,WAAW,sBAAK,uDAAL,WACf,iBACA,MACA,UACA,SAAS,cAAc;AAEzB,UAAI,SAAS,WAAW,OAAW,uBAAK,yDAAL,WAA2B,SAAS;AAAA,IACzE;AAAA,EACF;AAEA,MAAI;AACJ,MAAI;AACF,gBAAY,mBAAK,cAAa,YAAY;AAAA,MACxC,wBAAwB,IAAI;AAAA,MAC5B,mBAAmB,IAAI;AAAA,MACvB,iBAAiB,IAAI;AAAA,MACrB;AAAA,MACA,WAAW,KAAK;AAAA,MAChB,SAAS,KAAK;AAAA,MACd,UAAU,aAAa;AAAA,MACvB,cAAc,aAAa;AAAA,MAC3B,6BAA6B,aAAa;AAAA,MAC1C,cAAc,aAAa;AAAA,MAC3B,sBAAsB,KAAK;AAAA,MAC3B,WAAW,SAAS,cAAc;AAAA,MAClC,QAAQ,SAAS;AAAA,MACjB,oBAAoB,SAAS;AAAA,MAC7B,kBAAkB,SAAS;AAAA,MAC3B,UAAU,KAAK;AAAA,IACjB,CAAC;AAAA,EACH,SAAS,OAAO;AACd,QAAI,CAAC,qBAAqB,KAAK,EAAG,OAAM;AACxC,YAAQ;AAAA,MACN,qDAAqD,MAAM,IAAI,QACxD,IAAI,iBAAiB,OAAO,IAAI,sBAAsB,YAClD,IAAI,eAAe;AAAA,IAChC;AACA,WAAO;AAAA,MACL,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,mBAAmB,IAAI;AAAA,MACvB,wBAAwB,IAAI;AAAA,MAC5B,iBAAiB,IAAI;AAAA,MACrB,OAAO,EAAE,MAAM,MAAM,MAAM,SAAS,MAAM,QAAQ;AAAA,IACpD;AAAA,EACF;AAEA,MAAI,CAAC,WAAW;AACd,WAAO;AAAA,MACL,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,mBAAmB,IAAI;AAAA,MACvB,wBAAwB,IAAI;AAAA,MAC5B,iBAAiB,IAAI;AAAA,IACvB;AAAA,EACF;AAEA,QAAM,8BAA8B,UAAU;AAC9C,QAAM,eAAe,UAAU;AAC/B,MAAI,gCAAgC,UAAa,iBAAiB;AAChE,WAAO,sBAAK,yCAAL,WAAW;AAMpB,MAAI,CAAC,SAAS;AAAA,IACZ,UAAU;AAAA,IACV;AAAA,IACA;AAAA,EACF,EAAG,QAAO,sBAAK,yCAAL,WAAW;AACrB,MAAI,UAAU,sBAAsB,IAAI;AACtC,WAAO,sBAAK,yCAAL,WAAW;AAMpB,MAAI;AACJ,MAAI;AACF,eAAW,sBAAK,sDAAL,WAAwB,WAAW,OAAO,SAAS;AAAA,EAChE,SAAS,OAAO;AACd,QAAI,EAAE,iBAAiB,oBAAqB,OAAM;AAClD,YAAQ;AAAA,MACN,4DAA4D,MAAM,IAAI,QAC/D,UAAU,iBAAiB,WAAW,YAAY,WAC/C,UAAU,gBAAgB,CAAC;AAAA,IACvC;AACA,WAAO;AAAA,MACL,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,mBAAmB,IAAI;AAAA,MACvB,wBAAwB,IAAI;AAAA,MAC5B,iBAAiB,IAAI;AAAA,MACrB,OAAO,EAAE,MAAM,MAAM,MAAM,SAAS,MAAM,QAAQ;AAAA,IACpD;AAAA,EACF;AACA,MAAI,CAAC,UAAU;AACb,WAAO;AAAA,MACL,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,mBAAmB,IAAI;AAAA,MACvB,wBAAwB,IAAI;AAAA,MAC5B,iBAAiB,IAAI;AAAA,IACvB;AAAA,EACF;AAEA,QAAM,UAAU,sBAAK,uDAAL,WACd,UACA,MACA,UACA,SAAS,cAAc;AAEzB,MAAI,QAAQ,WAAW,OAAW,QAAO,QAAQ;AACjD,SAAO,sBAAK,yCAAL,WAAW,QAAQ;AAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAiBA,wBAAmB,SACjB,UACA,MACA,UACA,WACuB;AACvB,QAAM,SAAS,SAAS;AAAA,IACtB,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AACA,MAAI,CAAC,OAAQ,QAAO,EAAE,QAAQ,0BAA0B;AAIxD,MAAI,SAAS,KAAK,eAAe,OAAO,KAAM,QAAO,EAAE,QAAQ,yBAAyB;AAExF,QAAM,OAAO,sBAAK,mDAAL,WACX,UACA,KAAK,UACL,KAAK,gBACL,QACA;AAEF,MAAI,CAAC,KAAM,QAAO,EAAE,QAAQ,6BAA6B;AACzD,MAAI,CAAC,SAAS;AAAA,IACZ,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,IACT;AAAA,EACF,EAAG,QAAO,EAAE,QAAQ,kCAAkC;AACtD,yBAAK,uBAAL;AACA,OAAK,WAAW,SAAS,MAAM,IAAI;AACnC,SAAO;AAAA,IACL,QAAQ;AAAA,MACN,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,MAAM,SAAS;AAAA,MACf;AAAA,MACA,mBAAmB,SAAS;AAAA,MAC5B,eAAe,SAAS;AAAA,MACxB,SAAS,SAAS;AAAA,MAClB,GAAI,SAAS,aAAa,SAAY,CAAC,IAAI,EAAE,UAAU,SAAS,SAAS;AAAA,IAC3E;AAAA,EACF;AACF;AAAA;AAAA;AAgKA,gCAA2B,SAAC,MAA0B;AACpD,QAAM,YAAY,sBAAK,8CAAL,WAAgB,KAAK,UAAU,KAAK;AACtD,MAAI,KAAK,oBAAqB,oBAAK,yBAAwB,OAAO,SAAS;AAC3E,MAAI,mBAAK,yBAAwB,IAAI,SAAS,EAAG,QAAO;AACxD,MAAI,CAAC,KAAK,UAAU;AAClB,uBAAK,eAAc;AACnB,WAAO;AAAA,EACT;AACA,qBAAK,yBAAwB,IAAI,WAAW,KAAK,QAAQ;AACzD,SAAO;AACT;AAAA;AAwBA,oBAAe,SACb,WACA,UACA,QAC8B;AAC9B,QAAM,WAAW,mBAAK,gBAAe,IAAI,SAAS;AAClD,MAAI,SAAU,QAAO,SAAS;AAC9B,MAAI,CAAC,OAAQ,QAAO;AACpB,QAAM,WAAW,IAAI,sBAAsB,mBAAK,yBAAwB;AACxE,qBAAK,gBAAe,IAAI,WAAW,EAAE,UAAU,SAAS,CAAC;AACzD,SAAO;AACT;AAEA,sBAAiB,SAAC,WAAyB;AACzC,QAAM,QAAQ,mBAAK,gBAAe,IAAI,SAAS;AAC/C,MAAI,CAAC,MAAO;AACZ,qBAAK,gBAAe,OAAO,SAAS;AACpC,qBAAK,uBAAL,mBAAK,yBAAyB,MAAM,SAAS;AAC7C,MAAI,mBAAK,yBAAwB,GAAG;AAClC,UAAM,IAAI,MAAM,kEAAkE;AAAA,EACpF;AACF;AAEA,8BAAyB,SACvB,SAAqC,mBAAK,oBAC1C,gBAAgB,mBAAK,iBACf;AACN,MAAI,CAAC,OAAQ;AACb,+BAA6B,QAAQ,aAAa;AACpD;AAEA,oBAAe,SACb,WACA,UACA,KACA,QACA,YAAY,OACM;AAClB,QAAM,EAAE,MAAM,SAAS,SAAS,IAAI;AAEpC,MAAI,UAAU,IAAI,EAAG,QAAO;AAC5B,QAAM,wBAAwB;AAAA,IAC5B,OAAO;AAAA,IACP,OAAO;AAAA,EACT;AACA,QAAM,kBAAkB,yBAAyB,OAAO,YAAY,OAAO,SAAS;AACpF,QAAM,WAAW,yBAAyB,OAAO,OAAO,QAAQ,GAAG,OAAO,SAAS;AACnF,MAAI,0BAA0B,QAAQ,oBAAoB,QAAQ,aAAa,QAC3E,YAAY,GAAG;AACjB,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,mBAAK,SAAQ,IAAI,QAAQ;AACrC,MAAI,CAAC,SAAS,mBAAK,gBAAe;AAChC,YAAQ,mBAAK;AACb,uBAAK,SAAQ,IAAI,UAAU,KAAK;AAAA,EAClC;AACA,QAAM,QAAQ,OAAO,SAAS;AAE9B,QAAM,WAAW,qBAAoB,WAAW,MAAM,sBAAsB,SAAS,QAAQ,GAAG,KAAK;AAErG,QAAM,OAAkB;AAAA,IACtB,WAAW;AAAA,IACX;AAAA,IACA;AAAA,IACA,YAAY,OAAO;AAAA,IACnB,kBAAkB,OAAO;AAAA,IACzB,eAAe,OAAO;AAAA,IACtB,gBAAgB,OAAO;AAAA,IACvB,gBAAgB;AAAA,MACd,YAAY,OAAO;AAAA,MACnB,kBAAkB,OAAO;AAAA,MACzB,eAAe,OAAO;AAAA,MACtB,gBAAgB,OAAO;AAAA,IACzB;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW,OAAO,QAAQ;AAAA,IAC1B,sBAAsB;AAAA,IACtB,GAAI,UAAU,0BAA0B,SACpC,CAAC,IACD,EAAE,uBAAuB,UAAU,sBAAsB;AAAA,IAC7D,GAAI,UAAU,kCAAkC,SAC5C,CAAC,IACD,EAAE,+BAA+B,UAAU,8BAA8B;AAAA,IAC7E,GAAI,UAAU,qBAAqB,SAC/B,CAAC,IACD,EAAE,kBAAkB,UAAU,iBAAiB;AAAA,IACnD,GAAI,UAAU,kBAAkB,SAC5B,CAAC,IACD,EAAE,eAAe,UAAU,cAAc;AAAA,IAC7C,mBAAmB,UAAU;AAAA,IAC7B,GAAI,UAAU,gCAAgC,SAC1C,CAAC,IACD,EAAE,6BAA6B,UAAU,4BAA4B;AAAA,IACzE,GAAI,UAAU,iBAAiB,SAAY,CAAC,IAAI,EAAE,cAAc,UAAU,aAAa;AAAA,IACvF,eAAe,UAAU;AAAA,IACzB;AAAA,IACA,GAAI,aAAa,SAAY,CAAC,IAAI,EAAE,SAAS;AAAA,IAC7C,GAAI,UAAU,WAAW,SAAY,CAAC,IAAI,EAAE,QAAQ,UAAU,OAAO;AAAA,IACrE,oBAAoB,UAAU;AAAA,EAChC;AACA,MAAI,cAAc,UAAU,+BAA+B,UAAU,KAAK,GAAG;AAC3E,SAAK,YAAY;AAAA,EACnB;AAEA,SAAO;AACT;AAEA,kBAAa,SACX,UACA,YACA,kBACuB;AACvB,QAAM,aAAa,mBAAK,qBACpB,6BAA6B,mBAAK,oBAAmB,mBAAK,eAAc,IACxE,mBAAK;AACT,MAAI,cAAc,EAAG,QAAO;AAC5B,QAAM,YAAY,sBAAK,8CAAL,WAAgB,UAAU;AAC5C,MAAI,YAAY,mBAAK,aAAY,IAAI,SAAS,GAAG;AACjD,MAAI,CAAC,WAAW;AACd,gBAAY,IAAI,eAAe,YAAY,CAAC,MAAM,SAAS;AACzD,4BAAK,gCAAAH,eAAL,WAAgB,MAAM;AAAA,IACxB,GAAG,CAAC,MAAM,QAAQ,MAAM;AACtB,yBAAK,eAAc,IAAI,KAAK;AAAA,IAC9B,CAAC;AACD,uBAAK,aAAY,IAAI,WAAW,EAAE,UAAU,UAAU,CAAC;AAAA,EACzD;AACA,SAAO;AACT;AAEA,qBAAgB,WAAS;AACvB,aAAW,EAAE,UAAU,KAAK,mBAAK,aAAY,OAAO,EAAG,WAAU,MAAM;AACvE,qBAAK,aAAY,MAAM;AACzB;AAKAA,gBAAU,SAAC,MAAkB,MAAuB;AArnDtD;AAsnDI,OAAK,qBAAqB,KAAK;AAC/B,QAAM,UAAU,mBAAK,gBAAe,IAAI,KAAK,QAAQ;AACrD,YAAU,MAAM,IAAI;AACpB,2BAAK,cAAL,8BAAgB,MAAM;AACxB;AAphCK;AA8hCE,qBAAgB,SAAC,MAAkB,OAAoC;AApoDhF;AAqoDI,QAAM,IAAI,MAAM,YAAY;AAC5B,MAAI,KAAK,WAAW,EAAG,QAAO;AAE9B,MAAI,EAAE,WAAW,MAAM,GAAG;AACxB,WAAO,uBAAuB,IAAI;AAAA,EACpC;AAEA,MAAI,EAAE,WAAW,MAAM,KAAK,EAAE,WAAW,KAAK,GAAG;AAC/C,YAAQ,KAAK,CAAC,IAAK,OAAU;AAAA,EAC/B;AAEA,QAAM,SAAS,EAAE,WAAW,MAAM,KAAK,EAAE,WAAW,MAAM;AAC1D,MAAI,QAAQ;AACV,QAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,QAAI,iBAAiB,IAAI,GAAG;AAC1B,aAAO,2CAAoB,uDAApB,SAA2C,MAAM;AAAA,IAC1D;AACA,WAAO,2CAAoB,mEAApB,SAAuD;AAAA,EAChE;AAEA,MAAI,MAAM,MAAM,EAAE,WAAW,KAAK,GAAG;AACnC,WAAO,qBAAqB,MAAM,EAAE,kBAAkB,KAAK,CAAC;AAAA,EAC9D;AAEA,SAAO;AACT;AAEO,uCAAkC,SAAC,MAAuC;AAC/E,MAAI,SAAS;AACb,MAAI,SAAS;AACb,SAAO,SAAS,IAAI,KAAK,QAAQ;AAC/B,UAAM,SACH,KAAK,MAAM,KAAM,KACjB,KAAK,SAAS,CAAC,KAAM,KACrB,KAAK,SAAS,CAAC,KAAM,IACtB,KAAK,SAAS,CAAC;AACjB,cAAU;AACV,QAAI,UAAU,EAAG,QAAO,SAAS,QAAQ;AAIzC,QAAI,UAAU,KAAK,OAAQ,QAAO,SAAS,QAAQ;AACnD,aAAS;AACT,UAAM,WAAY,KAAK,MAAM,KAAM,IAAK;AACxC,QAAI,YAAY,MAAM,YAAY,GAAI,QAAO;AAC7C,QAAI,SAAS,SAAS,KAAK,OAAQ;AACnC,cAAU;AAAA,EACZ;AACA,SAAO,SAAS,QAAQ;AAC1B;AAEO,2BAAsB,SAAC,MAAkB,QAAsC;AACpF,MAAI,SAAS;AACb,MAAI,SAAS;AACb,SAAO,SAAS,KAAK,QAAQ;AAC3B,UAAM,QAAQ,gBAAgB,MAAM,MAAM;AAC1C,QAAI,CAAC,MAAO,QAAO,SAAS,QAAQ;AACpC,UAAM,eAAe,MAAM,SAAS,MAAM;AAC1C,QAAI,gBAAgB,KAAK,OAAQ,QAAO,SAAS,QAAQ;AACzD,aAAS;AACT,QAAI,QAAQ;AACV,UAAI,eAAe,KAAK,KAAK,OAAQ,QAAO,SAAS,QAAQ;AAC7D,YAAM,WAAY,KAAK,YAAY,KAAM,IAAK;AAC9C,UAAI,YAAY,MAAM,YAAY,GAAI,QAAO;AAAA,IAC/C,OAAO;AACL,YAAM,UAAU,KAAK,YAAY,IAAK;AACtC,UAAI,YAAY,EAAG,QAAO;AAAA,IAC5B;AACA,aAAS,eAAe;AAAA,EAC1B;AACA,SAAO,SAAS,QAAQ;AAC1B;AAtmCK,aAAM,sBAAN;AAAA,IAAM,sBAAN;AAymCP,SAAS,uBAAuB,MAAuC;AACrE,MAAI,SAAS;AACb,MAAI,oBAAoB;AACxB,MAAI,WAAW;AAEf,SAAO,SAAS,KAAK,QAAQ;AAC3B,UAAM,MAAM,WAAW,MAAM,MAAM;AACnC,QAAI,CAAC,IAAK,QAAO,WAAW,QAAQ;AACpC,aAAS,IAAI;AAEb,QAAI,IAAI,SAAS,GAAG;AAClB,0BAAoB;AACpB;AAAA,IACF;AACA,QAAI,IAAI,SAAS,KAAK,IAAI,SAAS,EAAG;AAEtC,eAAW;AACX,QAAI,CAAC,mBAAmB;AACtB;AAAA,IACF;AAEA,UAAM,WAAW,2BAA2B,KAAK,SAAS,IAAI,eAAe,IAAI,UAAU,CAAC;AAC5F,QAAI,aAAa,OAAW,QAAO;AAAA,EACrC;AAEA,SAAO,WAAW,QAAQ;AAC5B;AAEA,SAAS,WACP,MACA,QACwF;AACxF,MAAI,UAAU,KAAK,OAAQ,QAAO;AAClC,QAAM,SAAS,KAAK,MAAM;AAC1B,OAAK,SAAS,SAAU,MAAM,SAAS,OAAU,EAAG,QAAO;AAE3D,QAAM,OAAQ,UAAU,IAAK;AAC7B,QAAM,iBAAiB,SAAS,OAAU;AAC1C,QAAM,gBAAgB,SAAS,OAAU;AACzC,MAAI,SAAS,SAAS;AACtB,MAAI,cAAe,WAAU;AAC7B,MAAI,SAAS,KAAK,OAAQ,QAAO;AAEjC,MAAI,cAAc,KAAK,SAAS;AAChC,MAAI,cAAc;AAChB,UAAM,MAAM,WAAW,MAAM,MAAM;AACnC,QAAI,CAAC,IAAK,QAAO;AACjB,kBAAc,IAAI;AAClB,aAAS,IAAI;AAAA,EACf;AAEA,QAAM,aAAa,SAAS;AAC5B,MAAI,aAAa,KAAK,OAAQ,QAAO;AACrC,SAAO,EAAE,MAAM,eAAe,QAAQ,YAAY,YAAY,WAAW;AAC3E;AAEA,SAAS,WAAW,MAAkB,QAA8D;AAClG,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,SAAS,KAAK,KAAK,OAAQ,QAAO;AACtC,UAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,cAAU,OAAO,OAAS,MAAM,IAAI;AACpC,SAAK,OAAO,SAAU,EAAG,QAAO,EAAE,OAAO,YAAY,SAAS,IAAI,EAAE;AAAA,EACtE;AACA,SAAO;AACT;AAEA,SAAS,2BAA2B,SAA0C;AAC5E,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,QAAM,QAAQ,QAAQ,CAAC;AACvB,QAAM,qBAAqB,QAAQ,SAAU;AAC7C,MAAI,kBAAmB,QAAO;AAC9B,QAAM,YAAa,SAAS,IAAK;AACjC,SAAO,cAAc;AACvB;AAEA,SAAS,iBAAiB,MAA2B;AACnD,SACG,KAAK,UAAU,KAAK,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,KAClE,KAAK,UAAU,KAAK,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;AAExF;AAEA,SAAS,gBAAgB,MAAkB,QAA0D;AACnG,WAAS,IAAI,QAAQ,IAAI,KAAK,KAAK,QAAQ,KAAK;AAC9C,QAAI,KAAK,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,MAAM,EAAG;AACxC,QAAI,KAAK,IAAI,CAAC,MAAM,EAAG,QAAO,EAAE,QAAQ,GAAG,QAAQ,EAAE;AACrD,QAAI,IAAI,IAAI,KAAK,UAAU,KAAK,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG;AACjE,aAAO,EAAE,QAAQ,GAAG,QAAQ,EAAE;AAAA,IAChC;AAAA,EACF;AACA,SAAO;AACT;;;AC7sDA,SAAS,SAAS,OAAgC;AAChD,SAAO,OAAO,UAAU,WAAW,OAAO,KAAK,IAAI;AACrD;AAEA,SAAS,aAAa,WAA2B;AAC/C,SAAO,OAAO,OAAO,QAAQ,IAAI,SAAS,CAAC;AAC7C;AApGA,4BAAAI,aAAA;AAuGO,IAAM,qBAAN,MAA0D;AAAA,EAwB/D,YAAY,SAAoC;AAxB3C;AACL,uBAAS;AACT,uBAAS;AACT,uBAAS;AACT,uBAAAA;AACA,sCAAsD;AACtD,4CAAsB;AACtB,6CAAuB,oBAAI,IAAoB;AAC/C,8CAAwB,oBAAI,IAAoB;AAChD,4CAAsB;AACtB,4CAAsB;AACtB,2CAAqB;AAErB,SAAS,QAA0B;AAAA,MACjC,gBAAgB;AAAA,MAChB,iBAAiB;AAAA,MACjB,mBAAmB;AAAA,MACnB,cAAc;AAAA,MACd,oBAAoB;AAAA,MACpB,qBAAqB;AAAA,IACvB;AAKE,UAAM,cAAc,QAAQ,eAAe;AAC3C,QAAI,CAAC,OAAO,UAAU,WAAW,KAAK,eAAe,GAAG;AACtD,YAAM,IAAI,MAAM,6DAA6D;AAAA,IAC/E;AACA,uBAAK,WAAY,QAAQ;AACzB,uBAAKA,aAAa,QAAQ;AAC1B,uBAAK,MAAO,QAAQ,QAAQ,MAAM,WAAW,aAAa,IAAI,KAAK,KAAK,IAAI;AAC5E,uBAAK,OACH,QAAQ,cAAc,OAClB,QAAQ,SAAS,eAAe,WAAW,WAAW,IACtD,IAAI,QAAQ,SAAS,eAAe,QAAQ,WAAW,WAAW;AAAA,EAC1E;AAAA,EAEA,IAAI,YAA2B;AAC7B,WAAO,mBAAKA;AAAA,EACd;AAAA,EAEA,IAAI,UAAU,WAA0B;AACtC,QAAI,cAAc,SAAS,CAAC,OAAO,SAAS,SAAS,KAAK,aAAa,IAAI;AACzE,YAAM,IAAI,MAAM,4DAA4D;AAAA,IAC9E;AACA,uBAAKA,aAAa;AAClB,QAAI,cAAc,KAAM,oBAAK,OAAM,eAAe;AAAA,QAC7C,oBAAK,OAAM,YAAY,KAAK,KAAK,SAAS,CAAC;AAChD,0BAAK,mDAAL;AAAA,EACF;AAAA,EAEA,YAAY,UAA8C;AACxD,UAAM,eAAe,KAAI,mBAAK,YAAU;AAAA,MACtC,SAAS;AAAA,MACT,SAAS;AAAA,MACT,SAAS;AAAA,MACT,SAAS;AAAA,MACT,aAAa,SAAS,SAAS;AAAA,MAC/B,SAAS;AAAA,IACX;AACA,QACE,SAAS,gCAAgC,UACzC,SAAS,iBAAiB,UAC1B,SAAS,eAAe,KACxB,SAAS,iBAAiB,QAC1B;AACA,mBAAa;AAAA,QACX,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,MACX;AAAA,IACF;AACA,QAAI,SAAS,WAAW,OAAW,cAAa,YAAY,SAAS,MAAM;AAC3E,QAAI,SAAS,yBAAyB,QAAW;AAC/C,mBAAa;AAAA,QACX,SAAS;AAAA,QACT,SAAS,cAAc;AAAA,MACzB;AAAA,IACF;AACA,QAAI,SAAS,aAAa,OAAW,cAAa,aAAa,SAAS,QAAQ;AAChF,QAAI,SAAS,WAAW,QAAW;AACjC,mBAAa,gBAAgB,SAAS,WAAW,cAAc,IAAI,CAAC;AAAA,IACtE;AACA,UAAM,iBAAiB,sBAAK,qDAAL,WAAwB;AAC/C,QAAI,mBAAmB,QAAW;AAChC,mBAAa,oBAAoB,cAAc;AAAA,IACjD;AAEA,QAAI;AACJ,UAAM,kBAAkB,mBAAK;AAC7B,QAAI;AACF,eAAS,mBAAK,OAAM,aAAa,mBAAK,MAAL,YAAa,YAAY;AAAA,IAC5D,SAAS,OAAO;AACd,YAAM,YAAY,sBAAK,qDAAL,WAAwB;AAC1C,UAAI,cAAc,KAAM,OAAM;AAC9B,4BAAK,gDAAL;AACA,UAAI,mBAAK,yBAAwB,gBAAiB,wBAAK,qBAAL;AAClD,6BAAK,oBAAL;AACA,WAAK,MAAM,iBAAiB,mBAAK,uBAAsB,mBAAK;AAC5D,WAAK,MAAM,oBAAoB,mBAAK;AACpC,4BAAK,mDAAL;AACA,YAAM;AAAA,IACR;AACA,0BAAK,gDAAL;AACA,0BAAK,mDAAL;AACA,QAAI,CAAC,OAAQ,QAAO;AAEpB,QAAI;AACF,YAAM,mBAAmB,OAAO,oBAAoB,SAChD,SACA,mBAAK,uBAAsB,IAAI,OAAO,eAAe;AACzD,YAAM,wBAAwB,OAAO,4BAA4B,SAC7D,SACA,MAAM,KAAK,OAAO,uBAAuB;AAC7C,YAAM,gCACJ,OAAO,qCAAqC,SACxC,SACA,MAAM,KAAK,OAAO,gCAAgC;AACxD,aAAO;AAAA,QACL,mBAAmB,OAAO;AAAA,QAC1B,GAAI,wBAAwB,CAAC,MAAM,SAC/B,CAAC,IACD,EAAE,sBAAsB,sBAAsB,CAAC,EAAE;AAAA,QACrD,GAAI,0BAA0B,SAAY,CAAC,IAAI,EAAE,sBAAsB;AAAA,QACvE,GAAI,kCAAkC,SAClC,CAAC,IACD,EAAE,8BAA8B;AAAA,QACpC,MAAM,OAAO;AAAA,QACb,WAAW,OAAO,OAAO,SAAS;AAAA,QAClC,eAAe,OAAO;AAAA,QACtB,SAAS,OAAO;AAAA,QAChB,GAAI,OAAO,aAAa,SAAY,CAAC,IAAI,EAAE,UAAU,OAAO,SAAS;AAAA,QACrE,GAAI,OAAO,kBAAkB,SAAY,CAAC,IAAI,EAAE,cAAc,OAAO,cAAc;AAAA,QACnF,GAAI,OAAO,mCAAmC,SAC1C,CAAC,IACD;AAAA,UACE,6BAA6B,OAAO;AAAA,QACtC;AAAA,QACJ,GAAI,OAAO,gBAAgB,IACvB,EAAE,QAAQ,YAAqB,IAC/B,OAAO,gBAAgB,IACrB,EAAE,QAAQ,MAAe,IACzB,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,QAKP,oBACE,OAAO,gBAAgB,IACnB,cACA,OAAO,gBAAgB,IACrB,UACA;AAAA,QACR,GAAI,qBAAqB,SAAY,CAAC,IAAI,EAAE,iBAAiB;AAAA,MAC/D;AAAA,IACF,UAAE;AACA,aAAO,KAAK;AAAA,IACd;AAAA,EACF;AAAA,EAEA,QAAc;AACZ,0BAAK,qDAAL;AACA,uBAAK,OAAM,MAAM;AAAA,EACnB;AAAA,EAEA,YAAY,kBAAgC;AAC1C,UAAM,iBAAiB,mBAAK,sBAAqB,IAAI,WAAW,gBAAgB,EAAE;AAClF,QAAI,mBAAmB,OAAW;AAClC,0BAAK,qDAAL;AACA,uBAAK,OAAM,aAAa,cAAc;AACtC,0BAAK,gDAAL;AACA,0BAAK,mDAAL;AAAA,EACF;AAAA,EAEA,QAAc;AACZ,0BAAK,qDAAL;AACA,uBAAK,OAAM,MAAM;AACjB,uBAAK,qBAAsB;AAC3B,uBAAK,sBAAqB,MAAM;AAChC,uBAAK,uBAAsB,MAAM;AACjC,uBAAK,qBAAsB;AAC3B,uBAAK,qBAAsB;AAC3B,uBAAK,oBAAqB;AAC1B,0BAAK,gDAAL;AAAA,EACF;AAAA,EAEA,IAAI,eAAuB;AACzB,WAAO,mBAAK,OAAM;AAAA,EACpB;AAAA,EAEA,YAKE;AACA,0BAAK,gDAAL;AACA,WAAO;AAAA,MACL,cAAc,mBAAK,OAAM;AAAA,MACzB,kBAAkB,mBAAK,OAAM;AAAA;AAAA;AAAA,MAG7B,gBAAgB,CAAC;AAAA,MACjB,OAAO,EAAE,GAAG,KAAK,MAAM;AAAA,IACzB;AAAA,EACF;AAmEF;AAhRW;AACA;AACA;AACTA,cAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAXK;AAgNL,kBAAa,WAAS;AACpB,QAAM,QAAQ,mBAAK,OAAM,MAAM;AAC/B,qBAAK,qBAAsB,SAAS,MAAM,eAAe;AACzD,OAAK,MAAM,iBAAiB,mBAAK,uBAAsB,mBAAK;AAC5D,OAAK,MAAM,kBAAkB,SAAS,MAAM,gBAAgB;AAC5D,OAAK,MAAM,oBAAoB,mBAAK;AACpC,OAAK,MAAM,eAAe,SAAS,MAAM,cAAc;AAMvD,OAAK,MAAM,qBACT,SAAS,MAAM,oBAAoB,IAAI,SAAS,MAAM,sBAAsB,CAAC;AAC/E,OAAK,MAAM,sBAAsB,SAAS,MAAM,sBAAsB;AACtE,QAAM,OAAO;AACf;AAEA,uBAAkB,SAAC,UAA2C;AAC5D,QAAM,MAAM,SAAS,qBAAqB,SACtC,WAAW,SAAS,gBAAgB,KACpC,SAAS,aAAa,SACpB,UAAU,SAAS,QAAQ,KAC3B;AACN,MAAI,QAAQ,OAAW,QAAO;AAC9B,QAAM,WAAW,mBAAK,sBAAqB,IAAI,GAAG;AAClD,MAAI,aAAa,OAAW,QAAO;AACnC,QAAM,WAAW,uBAAK,qBAAL;AACjB,qBAAK,sBAAqB,IAAI,KAAK,QAAQ;AAC3C,MAAI,SAAS,qBAAqB,QAAW;AAC3C,uBAAK,uBAAsB,IAAI,UAAU,SAAS,gBAAgB;AAAA,EACpE;AACA,SAAO;AACT;AAEA,uBAAkB,SAAC,OAA2C;AAC5D,MAAK,OAAO,UAAU,YAAY,OAAO,UAAU,cAAe,UAAU,KAAM,QAAO;AACzF,QAAM,OAAO,QAAQ,IAAI,OAAO,MAAM;AACtC,MAAI,CAAC,yBAAyB,IAAI,EAAG,QAAO;AAC5C,QAAM,UAAU,QAAQ,IAAI,OAAO,SAAS;AAC5C,SAAO,IAAI;AAAA,IACT;AAAA,IACA,OAAO,YAAY,WAAW,UAAU,4BAA4B,IAAI;AAAA,EAC1E;AACF;AAEA,qBAAgB,WAAS;AACvB,wBAAK,qDAAL;AACA,MAAI,mBAAKA,iBAAe,KAAM;AAC9B,QAAM,OAAO,mBAAK,OAAM,gBAAgB;AACxC,MAAI,SAAS,OAAW;AACxB,QAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,KAAK,OAAO,mBAAK,MAAL,UAAW,CAAC;AACvD,qBAAK,eAAgB,WAAW,MAAM;AACpC,uBAAK,eAAgB;AACrB,uBAAK,OAAM,iBAAiB,mBAAK,MAAL,UAAW;AACvC,0BAAK,gDAAL;AACA,0BAAK,mDAAL;AAAA,EACF,GAAG,KAAK;AACV;AAEA,uBAAkB,WAAS;AACzB,MAAI,mBAAK,mBAAkB,KAAM;AACjC,eAAa,mBAAK,cAAa;AAC/B,qBAAK,eAAgB;AACvB;AAGK,SAAS,+BAAgD;AAC9D,QAAM,UAAU;AAIhB,QAAM,WAAW,QAAQ,qBAAqB,QAAQ;AACtD,MAAI,CAAC,UAAU,kBAAkB,CAAC,SAAS,eAAe;AACxD,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,SAAO;AACT;;;AC1XO,SAAS,8BAA8B,QAAmD;AAC/F,QAAM,YAAY,uBAAuB,OAAO,gBAAgB;AAChE,QAAM,cAAc,IAAI,mBAAmB;AAAA,IACzC,UAAU,OAAO,gBAAgB,6BAA6B;AAAA,IAC9D;AAAA,IACA,GAAI,OAAO,oBAAoB,SAAY,CAAC,IAAI,EAAE,aAAa,OAAO,gBAAgB;AAAA,EACxF,CAAC;AACD,SAAO,IAAI,oBAAoB;AAAA,IAC7B,GAAG;AAAA,IACH,kBAAkB,OAAO;AAAA,IACzB;AAAA,EACF,CAAC;AACH;",
+  "names": ["MMTP_HEADER_SIZE", "MPU_HEADER_SIZE", "MPU_LENGTH_FIELD_SIZE", "MPU_HEADER_REMAINDER_SIZE", "PACKET_TYPE_MPU", "MMTP_HEADER_SIZE", "view", "MPU_HEADER_SIZE", "view", "MPU_HEADER_REMAINDER_SIZE", "MPU_LENGTH_FIELD_SIZE", "MMTP_HEADER_SIZE", "MPU_HEADER_SIZE", "PACKET_TYPE_MPU", "MPU_HEADER_SIZE", "view", "MMTP_HEADER_SIZE", "MPU_HEADER_SIZE", "PACKET_TYPE_MPU", "MPU_HEADER_REMAINDER_SIZE", "MPU_LENGTH_FIELD_SIZE", "extractAltaTrailer", "runKey", "result", "objectKey", "active", "view", "_maxBuffered", "view", "trex", "isU32", "emitFrame_fn", "PACKET_TYPE_MPU", "extractAltaTrailer", "resolver", "_timeoutMs"]
+}