tradeblocks-mcp 2.2.5 → 2.3.0

package/dist/chunk-37JFR6NF.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../node_modules/@babel/runtime/helpers/extends.js","../src/sync/index.ts","../src/db/connection.ts","../src/db/schemas.ts","../src/db/market-schemas.ts","../src/db/profile-schemas.ts","../src/sync/block-sync.ts","../src/sync/hasher.ts","../src/sync/metadata.ts","../src/utils/ticker.ts","../src/utils/block-loader.ts","../../../node_modules/mathjs/lib/esm/entry/configReadonly.js","../../../node_modules/mathjs/lib/esm/core/config.js","../../../node_modules/mathjs/lib/esm/utils/customs.js","../../../node_modules/mathjs/lib/esm/utils/map.js","../../../node_modules/mathjs/lib/esm/utils/is.js","../../../node_modules/mathjs/lib/esm/utils/object.js","../../../node_modules/mathjs/lib/esm/core/function/config.js","../../../node_modules/typed-function/src/typed-function.mjs","../../../node_modules/mathjs/lib/esm/utils/factory.js","../../../node_modules/mathjs/lib/esm/utils/number.js","../../../node_modules/mathjs/lib/esm/core/function/typed.js","../../../node_modules/decimal.js/decimal.mjs","../../../node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js","../../../node_modules/complex.js/dist/complex.mjs","../../../node_modules/mathjs/lib/esm/type/complex/Complex.js","../../../node_modules/fraction.js/dist/fraction.mjs","../../../node_modules/mathjs/lib/esm/type/fraction/Fraction.js","../../../node_modules/mathjs/lib/esm/type/matrix/Matrix.js","../../../node_modules/mathjs/lib/esm/utils/array.js","../../../node_modules/mathjs/lib/esm/utils/bignumber/formatter.js","../../../node_modules/mathjs/lib/esm/utils/string.js","../../../node_modules/mathjs/lib/esm/error/DimensionError.js","../../../node_modules/mathjs/lib/esm/error/IndexError.js","../../../node_modules/mathjs/lib/esm/utils/optimizeCallback.js","../../../node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js","../../../node_modules/mathjs/lib/esm/utils/switch.js","../../../node_modules/mathjs/lib/esm/utils/collection.js","../../../node_modules/mathjs/lib/esm/function/utils/isInteger.js","../../../node_modules/mathjs/lib/esm/plain/number/arithmetic.js","../../../node_modules/mathjs/lib/esm/plain/number/utils.js","../../../node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js","../../../node_modules/mathjs/lib/esm/function/utils/isPositive.js","../../../node_modules/mathjs/lib/esm/function/utils/isZero.js","../../../node_modules/mathjs/lib/esm/function/utils/isNaN.js","../../../node_modules/mathjs/lib/esm/utils/complex.js","../../../node_modules/mathjs/lib/esm/function/relational/compareUnits.js","../../../node_modules/mathjs/lib/esm/function/relational/equalScalar.js","../../../node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js","../../../node_modules/mathjs/lib/esm/type/number.js","../../../node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js","../../../node_modules/mathjs/lib/esm/type/complex/function/complex.js","../../../node_modules/mathjs/lib/esm/type/fraction/function/fraction.js","../../../node_modules/mathjs/lib/esm/type/matrix/function/matrix.js","../../../node_modules/mathjs/lib/esm/function/matrix/matrixFromColumns.js","../../../node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js","../../../node_modules/mathjs/lib/esm/function/arithmetic/abs.js","../../../node_modules/mathjs/lib/esm/function/matrix/mapSlices.js","../../../node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js","../../../node_modules/mathjs/lib/esm/function/arithmetic/subtractScalar.js","../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo11xS0s.js","../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo12xSfs.js","../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo14xDs.js","../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo03xDSf.js","../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo05xSfSf.js","../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo13xDD.js","../../../node_modules/mathjs/lib/esm/type/matrix/utils/broadcast.js","../../../node_modules/mathjs/lib/esm/type/matrix/utils/matrixAlgorithmSuite.js","../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo01xDSid.js","../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo04xSidSid.js","../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo10xSids.js","../../../node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js","../../../node_modules/mathjs/lib/esm/function/arithmetic/multiply.js","../../../node_modules/mathjs/lib/esm/function/arithmetic/sign.js","../../../node_modules/mathjs/lib/esm/function/arithmetic/sqrt.js","../../../node_modules/mathjs/lib/esm/function/arithmetic/subtract.js","../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo07xSSf.js","../../../node_modules/mathjs/lib/esm/function/complex/conj.js","../../../node_modules/mathjs/lib/esm/function/complex/im.js","../../../node_modules/mathjs/lib/esm/function/complex/re.js","../../../node_modules/mathjs/lib/esm/function/matrix/concat.js","../../../node_modules/mathjs/lib/esm/function/matrix/column.js","../../../node_modules/mathjs/lib/esm/function/matrix/diag.js","../../../node_modules/mathjs/lib/esm/function/matrix/flatten.js","../../../node_modules/mathjs/lib/esm/function/matrix/getMatrixDataType.js","../../../node_modules/mathjs/lib/esm/function/matrix/identity.js","../../../node_modules/mathjs/lib/esm/function/matrix/map.js","../../../node_modules/mathjs/lib/esm/utils/noop.js","../../../node_modules/mathjs/lib/esm/function/matrix/range.js","../../../node_modules/mathjs/lib/esm/function/matrix/reshape.js","../../../node_modules/mathjs/lib/esm/function/matrix/size.js","../../../node_modules/mathjs/lib/esm/function/matrix/zeros.js","../../../node_modules/mathjs/lib/esm/function/statistics/utils/improveErrorMessage.js","../../../node_modules/mathjs/lib/esm/function/utils/numeric.js","../../../node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js","../../../node_modules/mathjs/lib/esm/function/algebra/solver/utils/solveValidation.js","../../../node_modules/mathjs/lib/esm/function/algebra/solver/usolve.js","../../../node_modules/mathjs/lib/esm/function/algebra/solver/usolveAll.js","../../../node_modules/mathjs/lib/esm/function/relational/equal.js","../../../node_modules/mathjs/lib/esm/function/relational/smaller.js","../../../node_modules/mathjs/lib/esm/function/relational/smallerEq.js","../../../node_modules/mathjs/lib/esm/function/relational/larger.js","../../../node_modules/mathjs/lib/esm/function/relational/largerEq.js","../../../node_modules/mathjs/lib/esm/function/statistics/max.js","../../../node_modules/mathjs/lib/esm/function/statistics/min.js","../../../node_modules/mathjs/lib/esm/type/matrix/ImmutableDenseMatrix.js","../../../node_modules/mathjs/lib/esm/type/matrix/MatrixIndex.js","../../../node_modules/mathjs/lib/esm/function/trigonometry/atan.js","../../../node_modules/mathjs/lib/esm/function/trigonometry/trigUnit.js","../../../node_modules/mathjs/lib/esm/function/trigonometry/cos.js","../../../node_modules/mathjs/lib/esm/function/trigonometry/sin.js","../../../node_modules/mathjs/lib/esm/function/arithmetic/add.js","../../../node_modules/mathjs/lib/esm/function/matrix/dot.js","../../../node_modules/mathjs/lib/esm/function/algebra/decomposition/qr.js","../../../node_modules/mathjs/lib/esm/function/matrix/det.js","../../../node_modules/mathjs/lib/esm/function/matrix/inv.js","../../../node_modules/mathjs/lib/esm/function/matrix/eigs.js","../../../node_modules/mathjs/lib/esm/function/matrix/eigs/complexEigs.js","../../../node_modules/mathjs/lib/esm/function/matrix/eigs/realSymmetric.js","../../../node_modules/mathjs/lib/esm/function/arithmetic/divide.js","../../../node_modules/mathjs/lib/esm/function/statistics/mean.js","../../../node_modules/mathjs/lib/esm/function/statistics/variance.js","../../../node_modules/mathjs/lib/esm/function/statistics/std.js","../../../node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js","../../lib/data/treasury-rates.ts","../../lib/utils/risk-free-rate.ts","../../lib/calculations/portfolio-stats.ts","../../lib/calculations/performance.ts","../../lib/calculations/statistical-utils.ts","../../lib/calculations/correlation.ts","../../lib/calculations/tail-risk-analysis.ts","../../lib/calculations/walk-forward-analyzer.ts","../../lib/calculations/walk-forward-degradation.ts","../../lib/calculations/index.ts","../../lib/models/reporting-trade.ts","../../lib/processing/tat-adapter.ts","../../lib/utils/trade-frequency.ts","../src/utils/csv-discovery.ts"],"sourcesContent":["function _extends() {\n  return module.exports = _extends = Object.assign ? Object.assign.bind() : function (n) {\n    for (var e = 1; e < arguments.length; e++) {\n      var t = arguments[e];\n      for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);\n    }\n    return n;\n  }, module.exports.__esModule = true, module.exports[\"default\"] = module.exports, _extends.apply(null, arguments);\n}\nmodule.exports = _extends, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","/**\n * Sync Layer Public API\n *\n * Provides synchronization between CSV files and DuckDB analytics database.\n * Exports hashing utilities, metadata operations, and sync functions.\n */\n\nimport * as fs from \"fs/promises\";\nimport * as path from \"path\";\nimport { getConnection } from \"../db/connection.js\";\nimport {\n  syncBlockInternal,\n  detectBlockChanges,\n  cleanupDeletedBlocks,\n  type BlockSyncResult,\n} from \"./block-sync.js\";\nimport { getSyncMetadata } from \"./metadata.js\";\n\n// Re-export hasher utilities\nexport { hashFileContent } from \"./hasher.js\";\n\n// Re-export metadata operations and types\nexport {\n  getSyncMetadata,\n  upsertSyncMetadata,\n  deleteSyncMetadata,\n  getAllSyncedBlockIds,\n  type BlockSyncMetadata,\n} from \"./metadata.js\";\n\n// Re-export block sync types and internal functions (for testing)\nexport { type BlockSyncResult } from \"./block-sync.js\";\n\n// --- Result Types ---\n\n/**\n * Result of syncing all blocks\n */\nexport interface SyncResult {\n  blocksProcessed: number;\n  blocksSynced: number;\n  blocksUnchanged: number;\n  blocksDeleted: number;\n  errors: Array<{ blockId: string; error: string }>;\n  results: BlockSyncResult[];\n}\n\n// --- Blocks Directory Override ---\n\n/**\n * Optional override for where CSV block folders live.\n * When set, sync functions scan this directory for blocks instead of baseDir.\n * DuckDB connections still use baseDir.\n *\n * Set via --blocks-dir CLI flag or BLOCKS_DIRECTORY env var.\n */\nlet _blocksDir: string | null = null;\n\nexport function setBlocksDir(dir: string): void {\n  _blocksDir = dir;\n}\n\nexport function getBlocksDir(baseDir: string): string {\n  return _blocksDir ?? baseDir;\n}\n\n// --- Sync Functions ---\n\n/**\n * Sync all blocks from the data directory to DuckDB.\n *\n * Scans all block folders, computes content hashes, and syncs\n * blocks that have changed since last sync. Also removes data\n * for blocks that no longer exist.\n *\n * @param baseDir - Base data directory containing block folders\n * @returns Sync result with counts and any errors\n */\nexport async function syncAllBlocks(baseDir: string): Promise<SyncResult> {\n  const conn = await getConnection(baseDir);\n  const blocksDir = getBlocksDir(baseDir);\n  const results: BlockSyncResult[] = [];\n  const errors: Array<{ blockId: string; error: string }> = [];\n\n  // 1. Detect changes (scan blocksDir for CSV folders)\n  const { toSync, toDelete } = await detectBlockChanges(conn, blocksDir);\n\n  // 2. Delete orphaned blocks\n  for (const blockId of toDelete) {\n    try {\n      await cleanupDeletedBlocks(conn, [blockId]);\n      results.push({ blockId, status: \"deleted\" });\n    } catch (err) {\n      const errorMsg = err instanceof Error ? err.message : String(err);\n      errors.push({ blockId, error: `Failed to delete: ${errorMsg}` });\n    }\n  }\n\n  // 3. Sync changed/new blocks\n  for (const blockId of toSync) {\n    const blockPath = path.join(blocksDir, blockId);\n    const result = await syncBlockInternal(conn, blockId, blockPath);\n    results.push(result);\n    if (result.status === \"error\" && result.error) {\n      errors.push({ blockId, error: result.error });\n    }\n  }\n\n  return {\n    blocksProcessed: results.length,\n    blocksSynced: results.filter((r) => r.status === \"synced\").length,\n    blocksUnchanged: results.filter((r) => r.status === \"unchanged\").length,\n    blocksDeleted: results.filter((r) => r.status === \"deleted\").length,\n    errors,\n    results,\n  };\n}\n\n/**\n * Sync a single block to DuckDB.\n *\n * Computes content hash for the block's CSV files and syncs\n * if changes are detected. Used for lazy per-block syncing.\n *\n * @param blockId - Block identifier (folder name)\n * @param baseDir - Base data directory containing block folders\n * @returns Sync result for the block\n */\nexport async function syncBlock(\n  blockId: string,\n  baseDir: string\n): Promise<BlockSyncResult> {\n  const conn = await getConnection(baseDir);\n  const blocksDir = getBlocksDir(baseDir);\n  const blockPath = path.join(blocksDir, blockId);\n\n  // Check if folder exists\n  try {\n    await fs.access(blockPath);\n  } catch {\n    // Block folder doesn't exist - if it was synced before, clean it up\n    const existing = await getSyncMetadata(conn, blockId);\n    if (existing) {\n      await cleanupDeletedBlocks(conn, [blockId]);\n      return { blockId, status: \"deleted\" };\n    }\n    return { blockId, status: \"error\", error: `Block folder not found: ${blockId}` };\n  }\n\n  return syncBlockInternal(conn, blockId, blockPath);\n}\n\n","/**\n * DuckDB Connection Manager\n *\n * Provides lazy singleton connection to DuckDB analytics database (analytics.duckdb)\n * with a second database (market.duckdb) ATTACHed as the `market` catalog.\n *\n * Startup sequence on first RW open:\n *   1. Open analytics.duckdb\n *   2. DROP SCHEMA IF EXISTS market CASCADE (removes legacy inline market tables,\n *      prevents DuckDB #14421 naming conflict with the upcoming ATTACH)\n *   3. ATTACH market.duckdb AS market\n *   4. ensureMarketTables() — creates market.daily/context/intraday/_sync_metadata\n *   5. ensureSyncTables() / ensureTradeDataTable() / ensureReportingDataTable()\n *\n * On close: CHECKPOINT → DETACH market → closeSync() to flush WAL reliably.\n * On RO open: ATTACH market.duckdb READ_ONLY (no table creation).\n *\n * DuckDB is single-process: only one process can open a database file at a time\n * (even read-only fails when another process holds a write lock with an active WAL).\n * Lock recovery handles stale processes from crashed Claude Code sessions by detecting\n * orphaned MCP processes (PPID=1) and terminating them before retrying.\n *\n * Configuration via environment variables:\n *   DUCKDB_MEMORY_LIMIT    - Memory limit (default: 512MB)\n *   DUCKDB_THREADS         - Number of threads (default: 2)\n *   DUCKDB_LOCK_RECOVERY   - Force-kill ANY lock-holding tradeblocks-mcp (default: false)\n *   DUCKDB_LOCK_RECOVERY_TIMEOUT_MS - Wait time for SIGTERM (default: 1500)\n *   MARKET_DB_PATH         - Path to market.duckdb (overrides default, overridden by --market-db)\n *\n * Security:\n *   - enable_external_access: \"true\" at DuckDBInstance creation allows local ATTACH\n *   - We do NOT call SET enable_external_access = false because testing confirmed it also\n *     blocks local file ATTACH operations (not just HTTP), which breaks importFromDatabase\n *   - No HTTP URLs are used in this application — local ATTACH is the only external access needed\n *\n * Schemas created on first RW connection:\n *   - trades: For block/trade data (in analytics.duckdb)\n *   - market: ATTACHed from market.duckdb (daily, context, intraday, _sync_metadata)\n */\n\nimport { DuckDBInstance, DuckDBConnection } from \"@duckdb/node-api\";\nimport { execFile } from \"child_process\";\nimport * as fs from \"fs/promises\";\nimport * as path from \"path\";\nimport { promisify } from \"util\";\nimport { ensureSyncTables, ensureTradeDataTable, ensureReportingDataTable } from \"./schemas.js\";\nimport { ensureMarketTables } from \"./market-schemas.js\";\nimport { ensureProfilesSchema } from \"./profile-schemas.js\";\n\n// Module-level singleton state\nlet instance: DuckDBInstance | null = null;\nlet connection: DuckDBConnection | null = null;\nlet connectionMode: \"read_write\" | \"read_only\" | null = null;\nlet storedDbPath: string | null = null;\nlet storedThreads: string | null = null;\nlet storedMemoryLimit: string | null = null;\nlet storedMarketDbPath: string | null = null;\nconst execFileAsync = promisify(execFile);\nconst isWindows = process.platform === \"win32\";\n\nfunction isLockError(message: string): boolean {\n  const lower = message.toLowerCase();\n  return (\n    lower.includes(\"could not set lock on file\") ||\n    lower.includes(\"conflicting lock is held\") ||\n    lower.includes(\"io error: could not set lock\") ||\n    lower.includes(\"being used by another process\") // Windows OS error\n  );\n}\n\nfunction parseLockHolderPid(message: string): number | null {\n  const match = message.match(/PID\\s+(\\d+)/i);\n  if (!match) return null;\n  const pid = Number.parseInt(match[1], 10);\n  return Number.isFinite(pid) ? pid : null;\n}\n\nfunction isProcessAlive(pid: number): boolean {\n  try {\n    process.kill(pid, 0);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\nasync function getProcessParentPid(pid: number): Promise<number | null> {\n  try {\n    if (isWindows) {\n      const { stdout } = await execFileAsync(\"wmic\", [\n        \"process\", \"where\", `ProcessId=${pid}`, \"get\", \"ParentProcessId\", \"/value\",\n      ]);\n      const match = stdout.match(/ParentProcessId=(\\d+)/);\n      if (!match) return null;\n      const ppid = parseInt(match[1], 10);\n      return Number.isFinite(ppid) ? ppid : null;\n    }\n    const { stdout } = await execFileAsync(\"ps\", [\"-p\", String(pid), \"-o\", \"ppid=\"]);\n    const ppid = parseInt(stdout.trim(), 10);\n    return Number.isFinite(ppid) ? ppid : null;\n  } catch {\n    return null;\n  }\n}\n\nasync function getProcessCommand(pid: number): Promise<string | null> {\n  try {\n    if (isWindows) {\n      const { stdout } = await execFileAsync(\"wmic\", [\n        \"process\", \"where\", `ProcessId=${pid}`, \"get\", \"CommandLine\", \"/value\",\n      ]);\n      const match = stdout.match(/CommandLine=(.+)/);\n      if (!match) return null;\n      const command = match[1].trim();\n      return command.length > 0 ? command : null;\n    }\n    const { stdout } = await execFileAsync(\"ps\", [\"-p\", String(pid), \"-o\", \"command=\"]);\n    const command = stdout.trim();\n    return command.length > 0 ? command : null;\n  } catch {\n    return null;\n  }\n}\n\nasync function waitForProcessExit(pid: number, timeoutMs: number): Promise<boolean> {\n  const deadline = Date.now() + timeoutMs;\n  while (Date.now() < deadline) {\n    if (!isProcessAlive(pid)) {\n      return true;\n    }\n    await new Promise((resolve) => setTimeout(resolve, 100));\n  }\n  return !isProcessAlive(pid);\n}\n\nasync function tryRecoverLockByTerminatingStaleProcess(\n  errorMessage: string,\n  dbPath: string,\n  forceRecovery: boolean\n): Promise<boolean> {\n  const lockHolderPid = parseLockHolderPid(errorMessage);\n  if (!lockHolderPid || lockHolderPid === process.pid) {\n    return false;\n  }\n\n  const command = await getProcessCommand(lockHolderPid);\n  if (!command) {\n    return false;\n  }\n\n  // Only terminate lock holders that look like another tradeblocks-mcp session for this data dir.\n  const normalizedDbPath = dbPath.replace(/\\\\/g, \"/\");\n  const normalizedDbDir = path.dirname(normalizedDbPath);\n  const isTradeblocksProcess =\n    command.includes(\"tradeblocks-mcp\") ||\n    command.includes(\"/mcp-server/server/index.js\") ||\n    command.includes(\"packages/mcp-server/server/index.js\") ||\n    command.includes(\"\\\\mcp-server\\\\server\\\\index.js\") ||\n    command.includes(\"packages\\\\mcp-server\\\\server\\\\index.js\");\n  // Normalize command paths for consistent comparison (Windows backslashes → forward slashes)\n  const normalizedCommand = command.replace(/\\\\/g, \"/\");\n  const targetsSameDb = normalizedCommand.includes(normalizedDbPath) || normalizedCommand.includes(normalizedDbDir);\n\n  if (!isTradeblocksProcess || !targetsSameDb) {\n    return false;\n  }\n\n  // Check if the lock holder is orphaned (parent session is gone).\n  // Unix: orphaned processes get reparented to PID 1 (init/launchd).\n  // Windows: child keeps original PPID even after parent dies — check if parent is still alive.\n  // Only kill non-orphaned processes if forceRecovery is explicitly enabled.\n  const ppid = await getProcessParentPid(lockHolderPid);\n  const orphaned = isWindows\n    ? (ppid !== null && !isProcessAlive(ppid))\n    : ppid === 1;\n  if (!orphaned && !forceRecovery) {\n    return false;\n  }\n\n  const reason = orphaned ? \"orphaned\" : \"force-recovery\";\n  const timeoutMs = Number.parseInt(process.env.DUCKDB_LOCK_RECOVERY_TIMEOUT_MS || \"1500\", 10);\n\n  try {\n    process.kill(lockHolderPid, \"SIGTERM\");\n  } catch {\n    return false;\n  }\n\n  const exited = await waitForProcessExit(\n    lockHolderPid,\n    Number.isFinite(timeoutMs) && timeoutMs > 0 ? timeoutMs : 1500\n  );\n\n  if (exited) {\n    console.error(\n      `Recovered DuckDB lock at ${dbPath} by stopping ${reason} tradeblocks-mcp process PID ${lockHolderPid}.`\n    );\n  }\n\n  return exited;\n}\n\n/**\n * Resolve the path to market.duckdb.\n *\n * Precedence: CLI --market-db > MARKET_DB_PATH env > default (<dataDir>/market.duckdb)\n *\n * @param dataDir - Directory where analytics.duckdb lives (used as default parent)\n */\nfunction resolveMarketDbPath(dataDir: string): string {\n  // 1. CLI argument: --market-db /path/to/market.duckdb\n  const args = process.argv;\n  for (let i = 0; i < args.length; i++) {\n    if (args[i] === \"--market-db\" && args[i + 1]) {\n      return path.resolve(args[i + 1]);\n    }\n  }\n  // 2. Environment variable\n  if (process.env.MARKET_DB_PATH) {\n    return path.resolve(process.env.MARKET_DB_PATH);\n  }\n  // 3. Default: alongside analytics.duckdb\n  return path.join(dataDir, \"market.duckdb\");\n}\n\n/**\n * ATTACH market.duckdb to an existing connection.\n *\n * Creates the parent directory if needed. Auto-recreates market.duckdb on\n * corruption (market data is re-importable from source CSVs).\n *\n * Hard fails on any non-corruption ATTACH error — market access is required.\n */\nasync function attachMarketDb(\n  conn: DuckDBConnection,\n  marketDbPath: string,\n  mode: \"read_write\" | \"read_only\"\n): Promise<void> {\n  await fs.mkdir(path.dirname(marketDbPath), { recursive: true });\n  const readOnlyClause = mode === \"read_only\" ? \" (READ_ONLY)\" : \"\";\n  try {\n    await conn.run(`ATTACH '${marketDbPath}' AS market${readOnlyClause}`);\n  } catch (error) {\n    const msg = error instanceof Error ? error.message : String(error);\n    if (msg.includes(\"corrupt\") || msg.includes(\"Invalid\") || msg.includes(\"cannot open\")) {\n      console.error(`market.duckdb appears corrupted at ${marketDbPath}. Recreating.`);\n      try { await fs.unlink(marketDbPath); } catch { /* file may not exist */ }\n      // Also try removing WAL file\n      try { await fs.unlink(marketDbPath + \".wal\"); } catch { /* ignore */ }\n      await conn.run(`ATTACH '${marketDbPath}' AS market${readOnlyClause}`);\n    } else {\n      throw new Error(`Failed to attach market.duckdb at ${marketDbPath}: ${msg}`);\n    }\n  }\n}\n\n/**\n * DETACH market.duckdb from a connection.\n * Non-fatal: may already be detached or market was never attached.\n */\nasync function detachMarketDb(conn: DuckDBConnection): Promise<void> {\n  try {\n    await conn.run(\"DETACH market\");\n  } catch {\n    // Non-fatal: may already be detached or market never attached\n  }\n}\n\nasync function openReadWriteConnection(\n  dbPath: string,\n  threads: string,\n  memoryLimit: string\n): Promise<DuckDBConnection> {\n  // enable_external_access must be \"true\" at instance creation to allow ATTACH of local files.\n  // DuckDB 1.4+ blocks all filesystem operations (including local ATTACH) when set to \"false\"\n  // at the instance level. After ATTACH, we lock it down via SET to prevent remote HTTP access.\n  instance = await DuckDBInstance.create(dbPath, {\n    threads,\n    memory_limit: memoryLimit,\n    enable_external_access: \"true\",\n  });\n  connection = await instance.connect();\n\n  // Drop legacy market schema from analytics.duckdb before ATTACH.\n  // Prevents DuckDB #14421 naming conflict: having tables in both the main DB\n  // and an ATTACHed DB under the same catalog name causes corruption.\n  try {\n    await connection.run(\"DROP SCHEMA IF EXISTS market CASCADE\");\n  } catch {\n    // Non-fatal: schema may not exist (fresh DB or already dropped)\n  }\n\n  // Attach separate market.duckdb\n  await attachMarketDb(connection, storedMarketDbPath!, \"read_write\");\n\n  // NOTE: We intentionally do NOT call SET enable_external_access = false here.\n  // Testing confirmed that SET blocks ALL new ATTACH operations (including local file ATTACH),\n  // not just remote HTTP/HTTPS access. This would prevent importFromDatabase from ATTACHing\n  // external DuckDB files, making the import_from_database MCP tool non-functional.\n  // The enable_external_access: \"true\" at DuckDBInstance creation is the intended security\n  // boundary — no HTTP URLs are used in this application.\n\n  // Create schemas/tables every RW open. This keeps the process resilient if\n  // analytics.duckdb is deleted/recreated while the process remains alive.\n  await connection.run(\"CREATE SCHEMA IF NOT EXISTS trades\");\n  await ensureSyncTables(connection);\n  await ensureTradeDataTable(connection);\n  await ensureReportingDataTable(connection);\n  await ensureMarketTables(connection);\n  await ensureProfilesSchema(connection);\n\n  // Optional extensions (e.g., additional DB attachments, write-target overrides)\n  try {\n    // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n    // @ts-ignore — connection.ext.ts is intentionally absent in this repo; dynamic import fails silently\n    const ext = await import('./connection.ext.js');\n    const ctx = await ext.default(connection, {\n      baseDir: path.dirname(dbPath),\n      marketDbPath: storedMarketDbPath!,\n    });\n    if (ctx?.intradayWriteTable) _intradayWriteTable = ctx.intradayWriteTable;\n  } catch {\n    // No extensions present — defaults apply\n  }\n\n  connectionMode = \"read_write\";\n\n  return connection;\n}\n\nasync function openReadOnlyConnection(\n  dbPath: string,\n  threads: string,\n  memoryLimit: string\n): Promise<DuckDBConnection> {\n  // enable_external_access must be \"true\" at instance creation to allow ATTACH.\n  // We do NOT call SET enable_external_access = false because it also blocks local\n  // file ATTACH operations, not just HTTP. See openReadWriteConnection for details.\n  instance = await DuckDBInstance.create(dbPath, {\n    threads,\n    memory_limit: memoryLimit,\n    enable_external_access: \"true\",\n    access_mode: \"READ_ONLY\",\n  });\n  connection = await instance.connect();\n  if (storedMarketDbPath) {\n    await attachMarketDb(connection, storedMarketDbPath, \"read_only\");\n  }\n  connectionMode = \"read_only\";\n  return connection;\n}\n\nfunction resetConnectionState(): void {\n  if (connection) {\n    try { connection.closeSync(); } catch { /* non-fatal */ }\n  }\n  connection = null;\n  if (instance) {\n    try { instance.closeSync(); } catch { /* non-fatal */ }\n  }\n  instance = null;\n  connectionMode = null;\n}\n\n/**\n * Get or create a DuckDB connection.\n *\n * On first call:\n *   - Creates DuckDBInstance at `<dataDir>/analytics.duckdb`\n *   - Applies memory, thread, and security configuration\n *   - Drops legacy inline market schema from analytics.duckdb\n *   - ATTACHes market.duckdb as `market` catalog\n *   - Creates 'trades' schema and market tables\n *   - Stores connection for reuse\n *\n * Subsequent calls return the existing connection.\n *\n * @param dataDir - Directory where analytics.duckdb will be stored\n * @returns Promise<DuckDBConnection> - The DuckDB connection\n * @throws Error if database is corrupted or cannot be opened\n */\nexport async function getConnection(dataDir: string): Promise<DuckDBConnection> {\n  // Return existing connection if available (singleton pattern)\n  if (connection) {\n    return connection;\n  }\n\n  const dbPath = path.join(dataDir, \"analytics.duckdb\");\n\n  // Configuration from environment with sensible defaults\n  const threads = process.env.DUCKDB_THREADS || \"2\";\n  const memoryLimit = process.env.DUCKDB_MEMORY_LIMIT || \"512MB\";\n\n  // Store config for reuse by upgrade/downgrade\n  storedDbPath = dbPath;\n  storedThreads = threads;\n  storedMemoryLimit = memoryLimit;\n  storedMarketDbPath = resolveMarketDbPath(dataDir);\n  // Lock recovery: kill other tradeblocks-mcp processes that hold the write lock.\n  // Enabled by default — safe because market data is re-importable and lock holders\n  // are just other Claude sessions that can lazily restart their MCP server.\n  // Set DUCKDB_LOCK_RECOVERY=false to disable (only kill orphaned processes).\n  const forceRecovery = (process.env.DUCKDB_LOCK_RECOVERY ?? \"true\") !== \"false\";\n\n  try {\n    return await openReadWriteConnection(dbPath, threads, memoryLimit);\n  } catch (error) {\n    // Provide clear error message for common issues\n    const errorMessage = error instanceof Error ? error.message : String(error);\n\n    // Lock recovery: auto-kill orphaned tradeblocks-mcp processes (PPID=1) that hold the lock.\n    // With DUCKDB_LOCK_RECOVERY=true, also kills non-orphaned holders (force mode).\n    if (isLockError(errorMessage)) {\n      const recovered = await tryRecoverLockByTerminatingStaleProcess(errorMessage, dbPath, forceRecovery);\n      if (recovered) {\n        // DuckDB file locks may linger briefly after process death — retry with backoff\n        for (let attempt = 0; attempt < 3; attempt++) {\n          await new Promise((r) => setTimeout(r, 500 * (attempt + 1)));\n          try {\n            return await openReadWriteConnection(dbPath, threads, memoryLimit);\n          } catch (retryError) {\n            const retryMsg = retryError instanceof Error ? retryError.message : String(retryError);\n            if (attempt < 2 && isLockError(retryMsg)) continue;\n            resetConnectionState();\n            throw new Error(\n              `Failed to initialize DuckDB at ${dbPath} after lock recovery: ${retryMsg}`\n            );\n          }\n        }\n      }\n    }\n\n    // Reset state on failure\n    resetConnectionState();\n\n    // Check for corruption indicators\n    if (\n      errorMessage.includes(\"corrupt\") ||\n      errorMessage.includes(\"Invalid\") ||\n      errorMessage.includes(\"cannot open\")\n    ) {\n      throw new Error(\n        `DuckDB database appears corrupted at ${dbPath}. ` +\n          `Please delete the file manually and restart. ` +\n          `Original error: ${errorMessage}`\n      );\n    }\n\n    throw new Error(`Failed to initialize DuckDB at ${dbPath}: ${errorMessage}`);\n  }\n}\n\n/**\n * Close the DuckDB connection and release resources.\n *\n * DETACHes market.duckdb before closing to ensure WAL is checkpointed cleanly.\n * Should be called during graceful shutdown (SIGINT, SIGTERM).\n * Safe to call multiple times or when no connection exists.\n */\nexport async function closeConnection(): Promise<void> {\n  if (connection) {\n    try { await connection.run(\"CHECKPOINT\"); } catch { /* non-fatal */ }\n    try { await detachMarketDb(connection); } catch { /* non-fatal, log debug */ }\n    try {\n      // closeSync is the synchronous close method for DuckDB connections\n      connection.closeSync();\n    } catch (error) {\n      // Log but don't throw during shutdown\n      const msg = error instanceof Error ? error.message : String(error);\n      console.error(`Warning: Error closing DuckDB connection: ${msg}`);\n    }\n    connection = null;\n  }\n\n  // Close the DuckDB instance to release the file lock.\n  // Without this, the native handle leaks until GC and blocks subsequent RW opens.\n  if (instance) {\n    try { instance.closeSync(); } catch { /* non-fatal */ }\n  }\n  instance = null;\n  connectionMode = null;\n}\n\n/**\n * Upgrade the connection to read-write mode for write operations.\n * No-op if already in read-write mode.\n * Retries with backoff if another session briefly holds the write lock.\n *\n * @param dataDir - Directory where analytics.duckdb lives\n * @param options.fallbackToReadOnly - If true, fall back to read-only on lock failure\n *   instead of throwing. Used by sync middleware where RO is acceptable (just skip sync).\n *   Default: false — callers that need writes get a clear error instead of a silent RO surprise.\n */\nexport async function upgradeToReadWrite(\n  dataDir: string,\n  options?: { fallbackToReadOnly?: boolean }\n): Promise<DuckDBConnection> {\n  if (connectionMode === \"read_write\" && connection) return connection;\n  await closeConnection();\n\n  // Try RW with retries — another session may briefly hold the lock during its own sync.\n  // After /mcp reconnect, the old process may not have released the DuckDB file lock yet,\n  // so we retry with increasing delays to allow the lock to fully release.\n  const maxRetries = 4;\n  const retryDelayMs = 1000;\n  let lastError: Error | null = null;\n\n  for (let attempt = 0; attempt <= maxRetries; attempt++) {\n    try {\n      return await getConnection(dataDir);\n    } catch (error) {\n      const msg = error instanceof Error ? error.message : String(error);\n      if (!isLockError(msg)) throw error;\n      lastError = error instanceof Error ? error : new Error(msg);\n      if (attempt < maxRetries) {\n        await new Promise((r) => setTimeout(r, retryDelayMs));\n      }\n    }\n  }\n\n  // RW retries exhausted\n  if (options?.fallbackToReadOnly && storedDbPath && storedThreads && storedMemoryLimit) {\n    try {\n      await openReadOnlyConnection(storedDbPath, storedThreads, storedMemoryLimit);\n      if (connection) return connection;\n    } catch {\n      // RO also failed (WAL may still exist from active writer)\n    }\n  }\n\n  throw lastError || new Error(\n    \"Cannot acquire DuckDB write lock. Another process holds it. \" +\n    \"Kill other tradeblocks-mcp processes or restart Claude Code.\"\n  );\n}\n\n/**\n * Downgrade the connection to read-only mode after sync/write operations.\n * No-op if already in read-only mode.\n * Closes the RW connection (checkpoints WAL, releases write lock) and reopens as RO.\n * Multiple processes can hold RO connections simultaneously.\n */\n// eslint-disable-next-line @typescript-eslint/no-unused-vars\nexport async function downgradeToReadOnly(dataDir: string): Promise<void> {\n  if (connectionMode === \"read_only\") return;\n  if (!connection) return;\n  await closeConnection();\n  if (storedDbPath && storedThreads && storedMemoryLimit) {\n    await openReadOnlyConnection(storedDbPath, storedThreads, storedMemoryLimit);\n  }\n}\n\n/**\n * Get the current connection mode.\n * Used by middleware to determine if sync should be skipped (RO fallback).\n */\nexport function getConnectionMode(): \"read_write\" | \"read_only\" | null {\n  return connectionMode;\n}\n\n/**\n * Check if a connection is currently active.\n * Useful for diagnostics and testing.\n */\nexport function isConnected(): boolean {\n  return connection !== null;\n}\n\n// ---------------------------------------------------------------------------\n// Intraday write target\n// ---------------------------------------------------------------------------\n\nlet _intradayWriteTable = 'market.intraday';\n\n/**\n * Returns the table name to INSERT intraday bars into.\n * Default: 'market.intraday'. Can be overridden by connection extensions.\n */\nexport function getIntradayWriteTable(): string {\n  return _intradayWriteTable;\n}\n","/**\n * DuckDB Schema Definitions\n *\n * Creates and manages table schemas for sync metadata and trade data\n * in analytics.duckdb (the trades database).\n *\n * Market table schemas live in market-schemas.ts and are applied to the\n * separate market.duckdb after ATTACH.\n */\n\nimport type { DuckDBConnection } from \"@duckdb/node-api\";\n\nexport async function tableExists(\n  conn: DuckDBConnection,\n  schemaName: string,\n  tableName: string\n): Promise<boolean> {\n  const result = await conn.runAndReadAll(`\n    SELECT 1\n    FROM duckdb_tables()\n    WHERE schema_name = '${schemaName}' AND table_name = '${tableName}'\n  `);\n  return result.getRows().length > 0;\n}\n\nasync function hasColumn(\n  conn: DuckDBConnection,\n  schemaName: string,\n  tableName: string,\n  columnName: string\n): Promise<boolean> {\n  const result = await conn.runAndReadAll(`\n    SELECT 1\n    FROM duckdb_columns()\n    WHERE schema_name = '${schemaName}'\n      AND table_name = '${tableName}'\n      AND column_name = '${columnName}'\n  `);\n  return result.getRows().length > 0;\n}\n\n/**\n * Create sync metadata table for the trades schema.\n *\n * trades._sync_metadata: Tracks sync state for each block\n *\n * Note: market._sync_metadata is created by ensureMarketTables() in\n * market-schemas.ts and lives in the separate market.duckdb.\n *\n * @param conn - Active DuckDB connection\n */\nexport async function ensureSyncTables(conn: DuckDBConnection): Promise<void> {\n  // Block sync metadata - tracks which blocks are synced and their file hashes\n  await conn.run(`\n    CREATE TABLE IF NOT EXISTS trades._sync_metadata (\n      block_id VARCHAR PRIMARY KEY,\n      tradelog_hash VARCHAR NOT NULL,\n      dailylog_hash VARCHAR,\n      reportinglog_hash VARCHAR,\n      synced_at TIMESTAMP NOT NULL,\n      sync_version INTEGER DEFAULT 1\n    )\n  `);\n\n  // Migration: sync-import.mjs creates this table from Parquet (no constraints).\n  // Detect missing PK and recreate so INSERT OR REPLACE works.\n  const result = await conn.run(`\n    SELECT COUNT(*) AS cnt FROM duckdb_constraints()\n    WHERE schema_name = 'trades' AND table_name = '_sync_metadata'\n      AND constraint_type = 'PRIMARY KEY'\n  `);\n  const rows = await result.getRows();\n  if (Number(rows[0][0]) === 0) {\n    await conn.run(`DROP TABLE trades._sync_metadata`);\n    await conn.run(`\n      CREATE TABLE trades._sync_metadata (\n        block_id VARCHAR PRIMARY KEY,\n        tradelog_hash VARCHAR NOT NULL,\n        dailylog_hash VARCHAR,\n        reportinglog_hash VARCHAR,\n        synced_at TIMESTAMP NOT NULL,\n        sync_version INTEGER DEFAULT 1\n      )\n    `);\n  }\n}\n\n/**\n * Create the trade data table for storing synced trade records.\n *\n * Note: No PRIMARY KEY constraint - trades can have duplicates per day\n * (e.g., multiple trades opened at same time with same strategy).\n *\n * @param conn - Active DuckDB connection\n */\nexport async function ensureTradeDataTable(conn: DuckDBConnection): Promise<void> {\n  await conn.run(`\n    CREATE TABLE IF NOT EXISTS trades.trade_data (\n      block_id VARCHAR NOT NULL,\n      date_opened DATE NOT NULL,\n      time_opened VARCHAR,\n      strategy VARCHAR,\n      legs VARCHAR,\n      premium DOUBLE,\n      num_contracts INTEGER,\n      pl DOUBLE NOT NULL,\n      date_closed DATE,\n      time_closed VARCHAR,\n      reason_for_close VARCHAR,\n      margin_req DOUBLE,\n      opening_commissions DOUBLE,\n      closing_commissions DOUBLE,\n      ticker VARCHAR\n    )\n  `);\n\n  // Backfill schema upgrades on existing databases.\n  if (!(await hasColumn(conn, \"trades\", \"trade_data\", \"ticker\"))) {\n    await conn.run(`ALTER TABLE trades.trade_data ADD COLUMN ticker VARCHAR`);\n  }\n}\n\n/**\n * Create the reporting data table for storing synced reporting log records.\n *\n * Note: No PRIMARY KEY constraint - trades can have duplicates per day\n * (same pattern as trade_data).\n *\n * @param conn - Active DuckDB connection\n */\nexport async function ensureReportingDataTable(conn: DuckDBConnection): Promise<void> {\n  await conn.run(`\n    CREATE TABLE IF NOT EXISTS trades.reporting_data (\n      block_id VARCHAR NOT NULL,\n      date_opened DATE NOT NULL,\n      time_opened VARCHAR,\n      strategy VARCHAR,\n      legs VARCHAR,\n      initial_premium DOUBLE,\n      num_contracts INTEGER,\n      pl DOUBLE NOT NULL,\n      date_closed DATE,\n      time_closed VARCHAR,\n      closing_price DOUBLE,\n      avg_closing_cost DOUBLE,\n      reason_for_close VARCHAR,\n      opening_price DOUBLE,\n      ticker VARCHAR\n    )\n  `);\n\n  // Backfill schema upgrades on existing databases.\n  if (!(await hasColumn(conn, \"trades\", \"reporting_data\", \"ticker\"))) {\n    await conn.run(`ALTER TABLE trades.reporting_data ADD COLUMN ticker VARCHAR`);\n  }\n}\n","/**\n * Market DuckDB Schema Definitions\n *\n * Creates and manages table schemas for the separate market.duckdb database.\n * Called after ATTACH in openReadWriteConnection() to ensure market tables exist.\n *\n * Tables use CREATE TABLE IF NOT EXISTS for idempotency — safe to call on\n * every RW open regardless of whether market.duckdb already exists.\n *\n * Table naming: market.daily resolves to catalog=market, schema=main, table=daily\n * after ATTACH '...' AS market. Do NOT create a schema within market.duckdb.\n */\n\nimport type { DuckDBConnection } from \"@duckdb/node-api\";\n\n// =============================================================================\n// Migration: Legacy context → normalized schema (Phase 75 — VTS-01)\n// =============================================================================\n\n/**\n * Migrate VIX data from legacy market.context to normalized schema.\n * Copies OHLCV + IVR/IVP for VIX/VIX9D/VIX3M into market.daily rows,\n * and derived fields into market._context_derived.\n * Uses INSERT OR IGNORE — safe to re-run.\n */\nexport async function migrateContextToNormalized(conn: DuckDBConnection): Promise<{ rowsMigrated: number }> {\n  // Check if migration already ran (tracked in _sync_metadata)\n  try {\n    const migrationCheck = await conn.runAndReadAll(\n      `SELECT 1 FROM market._sync_metadata WHERE source = 'migration:context_to_normalized'`\n    );\n    if (migrationCheck.getRows().length > 0) return { rowsMigrated: 0 }; // Already migrated\n  } catch {\n    // _sync_metadata may not exist yet — continue with migration\n  }\n\n  // Check if market.context has data to migrate\n  let contextCount = 0;\n  try {\n    const r = await conn.runAndReadAll(`SELECT COUNT(*) FROM market.context`);\n    contextCount = Number(r.getRows()[0]?.[0] ?? 0);\n  } catch {\n    return { rowsMigrated: 0 }; // No context table\n  }\n  if (contextCount === 0) return { rowsMigrated: 0 };\n\n  let totalMigrated = 0;\n\n  // Migrate VIX OHLCV + IVR/IVP\n  const vixResult = await conn.run(`\n    INSERT OR IGNORE INTO market.daily (ticker, date, open, high, low, close, ivr, ivp)\n    SELECT 'VIX', date, VIX_Open, VIX_High, VIX_Low, VIX_Close, VIX_IVR, VIX_IVP\n    FROM market.context\n    WHERE VIX_Close IS NOT NULL\n  `);\n  totalMigrated += Number(vixResult.rowsChanged);\n\n  // Migrate VIX9D OHLCV + IVR/IVP (VIX9D has Open/Close only, no High/Low in context)\n  const vix9dResult = await conn.run(`\n    INSERT OR IGNORE INTO market.daily (ticker, date, open, close, ivr, ivp)\n    SELECT 'VIX9D', date, VIX9D_Open, VIX9D_Close, VIX9D_IVR, VIX9D_IVP\n    FROM market.context\n    WHERE VIX9D_Close IS NOT NULL\n  `);\n  totalMigrated += Number(vix9dResult.rowsChanged);\n\n  // Migrate VIX3M OHLCV + IVR/IVP (VIX3M has Open/Close only)\n  const vix3mResult = await conn.run(`\n    INSERT OR IGNORE INTO market.daily (ticker, date, open, close, ivr, ivp)\n    SELECT 'VIX3M', date, VIX3M_Open, VIX3M_Close, VIX3M_IVR, VIX3M_IVP\n    FROM market.context\n    WHERE VIX3M_Close IS NOT NULL\n  `);\n  totalMigrated += Number(vix3mResult.rowsChanged);\n\n  // Migrate derived fields to market._context_derived\n  await conn.run(`\n    INSERT OR IGNORE INTO market._context_derived (date, Vol_Regime, Term_Structure_State, Trend_Direction, VIX_Spike_Pct, VIX_Gap_Pct)\n    SELECT date, Vol_Regime, Term_Structure_State, Trend_Direction, VIX_Spike_Pct, VIX_Gap_Pct\n    FROM market.context\n    WHERE Vol_Regime IS NOT NULL OR Term_Structure_State IS NOT NULL\n  `);\n\n  // Mark migration as complete so it doesn't re-run\n  try {\n    await conn.run(`\n      INSERT OR REPLACE INTO market._sync_metadata (source, ticker, target_table, max_date, enriched_through, synced_at)\n      VALUES ('migration:context_to_normalized', '_system', '_system', NULL, NULL, CURRENT_TIMESTAMP)\n    `);\n  } catch {\n    // _sync_metadata may not exist yet on first run — non-fatal\n  }\n\n  return { rowsMigrated: totalMigrated };\n}\n\n/**\n * Ensure all four market tables exist in the attached market.duckdb.\n *\n * Must be called AFTER `ATTACH '...' AS market` in openReadWriteConnection.\n * Creates all columns upfront so later phases can write data without ALTER TABLE.\n *\n * @param conn - Active DuckDB connection with market catalog attached\n */\nexport async function ensureMarketTables(conn: DuckDBConnection): Promise<void> {\n  // Daily OHLCV + enrichment data for each ticker\n  // PK: (ticker, date) — one row per ticker per trading day\n  await conn.run(`\n    CREATE TABLE IF NOT EXISTS market.daily (\n      ticker VARCHAR NOT NULL,\n      date VARCHAR NOT NULL,\n\n      -- Raw OHLCV\n      open DOUBLE,\n      high DOUBLE,\n      low DOUBLE,\n      close DOUBLE,\n      Prior_Close DOUBLE,\n\n      -- Tier 1 enrichment (all DOUBLE unless noted)\n      Gap_Pct DOUBLE,\n      ATR_Pct DOUBLE,\n      RSI_14 DOUBLE,\n      Price_vs_EMA21_Pct DOUBLE,\n      Price_vs_SMA50_Pct DOUBLE,\n      Realized_Vol_5D DOUBLE,\n      Realized_Vol_20D DOUBLE,\n      Return_5D DOUBLE,\n      Return_20D DOUBLE,\n      Intraday_Range_Pct DOUBLE,\n      Intraday_Return_Pct DOUBLE,\n      Close_Position_In_Range DOUBLE,\n      Gap_Filled INTEGER,\n      Consecutive_Days INTEGER,\n      Prev_Return_Pct DOUBLE,\n      Prior_Range_vs_ATR DOUBLE,\n\n      -- Tier 3 intraday timing\n      High_Time DOUBLE,\n      Low_Time DOUBLE,\n      High_Before_Low INTEGER,\n      Reversal_Type INTEGER,\n      Opening_Drive_Strength DOUBLE,\n      Intraday_Realized_Vol DOUBLE,\n\n      -- Calendar fields\n      Day_of_Week INTEGER,\n      Month INTEGER,\n      Is_Opex INTEGER,\n\n      PRIMARY KEY (ticker, date)\n    )\n  `);\n\n  // Migration: drop Trend_Score column (removed — was an invented composite, not a real market metric)\n  try {\n    await conn.run(`ALTER TABLE market.daily DROP COLUMN Trend_Score`);\n  } catch {\n    // Column already gone — ignore\n  }\n\n  // Migration: drop Bollinger Band columns (Phase 67 — ENR-04)\n  for (const col of [\"BB_Position\", \"BB_Width\"]) {\n    try {\n      await conn.run(`ALTER TABLE market.daily DROP COLUMN ${col}`);\n    } catch {\n      // Column already gone — ignore\n    }\n  }\n\n  // Migration: add Tier 3 columns that were added after initial schema\n  for (const col of [\n    { name: \"Opening_Drive_Strength\", type: \"DOUBLE\" },\n    { name: \"Intraday_Realized_Vol\", type: \"DOUBLE\" },\n  ]) {\n    try {\n      await conn.run(`ALTER TABLE market.daily ADD COLUMN ${col.name} ${col.type}`);\n    } catch {\n      // Column already exists — ignore\n    }\n  }\n\n  // Migration: add IVR/IVP columns for VIX-family tickers (Phase 75 — VTS-01)\n  for (const col of [\n    { name: \"ivr\", type: \"DOUBLE\" },\n    { name: \"ivp\", type: \"DOUBLE\" },\n  ]) {\n    try {\n      await conn.run(`ALTER TABLE market.daily ADD COLUMN ${col.name} ${col.type}`);\n    } catch {\n      // Column already exists — ignore\n    }\n  }\n\n  // VIX and volatility term structure context per trading day\n  // PK: (date) — one row per trading day, shared across tickers\n  await conn.run(`\n    CREATE TABLE IF NOT EXISTS market.context (\n      date VARCHAR NOT NULL,\n\n      VIX_Open DOUBLE,\n      VIX_Close DOUBLE,\n      VIX_High DOUBLE,\n      VIX_Low DOUBLE,\n      VIX_RTH_Open DOUBLE,\n      VIX_Change_Pct DOUBLE,\n      VIX_Gap_Pct DOUBLE,\n      VIX9D_Open DOUBLE,\n      VIX9D_Close DOUBLE,\n      VIX9D_Change_Pct DOUBLE,\n      VIX3M_Open DOUBLE,\n      VIX3M_Close DOUBLE,\n      VIX3M_Change_Pct DOUBLE,\n      VIX9D_VIX_Ratio DOUBLE,\n      VIX_VIX3M_Ratio DOUBLE,\n      Vol_Regime INTEGER,\n      Term_Structure_State INTEGER,\n      VIX_IVR DOUBLE,\n      VIX_IVP DOUBLE,\n      VIX9D_IVR DOUBLE,\n      VIX9D_IVP DOUBLE,\n      VIX3M_IVR DOUBLE,\n      VIX3M_IVP DOUBLE,\n      VIX_Spike_Pct DOUBLE,\n      Trend_Direction VARCHAR,\n\n      PRIMARY KEY (date)\n    )\n  `);\n\n  // Cross-ticker derived fields (Vol_Regime, Term_Structure_State, etc.)\n  // PK: (date) — one row per trading day\n  await conn.run(`\n    CREATE TABLE IF NOT EXISTS market._context_derived (\n      date VARCHAR NOT NULL PRIMARY KEY,\n      Vol_Regime INTEGER,\n      Term_Structure_State INTEGER,\n      Trend_Direction VARCHAR,\n      VIX_Spike_Pct DOUBLE,\n      VIX_Gap_Pct DOUBLE\n    )\n  `);\n\n  // Migration: add VIX_RTH_Open column to existing databases\n  try {\n    await conn.run(`ALTER TABLE market.context ADD COLUMN VIX_RTH_Open DOUBLE`);\n  } catch {\n    // Column already exists\n  }\n\n  // Migration: add Trend_Direction column to existing databases\n  try {\n    await conn.run(`ALTER TABLE market.context ADD COLUMN Trend_Direction VARCHAR`);\n  } catch {\n    // Column already exists\n  }\n\n  // Migration: rename VIX_Percentile → VIX_IVP (Phase 67 — D-08)\n  try {\n    await conn.run(`ALTER TABLE market.context RENAME COLUMN VIX_Percentile TO VIX_IVP`);\n  } catch {\n    // Column already renamed or doesn't exist — ignore\n  }\n\n  // Migration: add IVR/IVP columns (Phase 67 — D-09)\n  for (const col of [\"VIX_IVR\", \"VIX9D_IVR\", \"VIX9D_IVP\", \"VIX3M_IVR\", \"VIX3M_IVP\"]) {\n    try {\n      await conn.run(`ALTER TABLE market.context ADD COLUMN ${col} DOUBLE`);\n    } catch {\n      // Column already exists — ignore\n    }\n  }\n\n  // Raw intraday bars per ticker, per day, per time slot (Eastern Time \"HH:MM\")\n  // PK: (ticker, date, time)\n  await conn.run(`\n    CREATE TABLE IF NOT EXISTS market.intraday (\n      ticker VARCHAR NOT NULL,\n      date VARCHAR NOT NULL,\n      time VARCHAR NOT NULL,\n\n      open DOUBLE,\n      high DOUBLE,\n      low DOUBLE,\n      close DOUBLE,\n      bid DOUBLE,\n      ask DOUBLE,\n\n      PRIMARY KEY (ticker, date, time)\n    )\n  `);\n\n  // Migration: add bid/ask columns to existing market.intraday (Phase 75 / 260329-nqf)\n  for (const col of [\"bid\", \"ask\"]) {\n    try {\n      await conn.run(`ALTER TABLE market.intraday ADD COLUMN ${col} DOUBLE`);\n    } catch {\n      // Column already exists — ignore\n    }\n  }\n\n  // Option chain cache: contract-level metadata per underlying, date, and ticker\n  // PK: (underlying, date, ticker) — one row per option contract\n  await conn.run(`\n    CREATE TABLE IF NOT EXISTS market.option_chain (\n      underlying     VARCHAR NOT NULL,\n      date           VARCHAR NOT NULL,\n      ticker         VARCHAR NOT NULL,\n      contract_type  VARCHAR NOT NULL,\n      strike         DOUBLE  NOT NULL,\n      expiration     VARCHAR NOT NULL,\n      dte            INTEGER,\n      exercise_style VARCHAR,\n      PRIMARY KEY (underlying, date, ticker)\n    )\n  `);\n\n  // Data coverage tracking — fast lookup of what's cached per ticker/date/source\n  // PK: (ticker, date, source) — avoids scanning market.intraday for coverage checks\n  await conn.run(`\n    CREATE TABLE IF NOT EXISTS market.data_coverage (\n      ticker VARCHAR NOT NULL,\n      date VARCHAR NOT NULL,\n      source VARCHAR NOT NULL,       -- 'flatfile', 'api_trade', 'api_quote', 'csv_import'\n      bar_count INTEGER NOT NULL,\n      has_quotes BOOLEAN DEFAULT FALSE,\n      imported_at TIMESTAMP DEFAULT CURRENT_TIMESTAMP,\n      PRIMARY KEY (ticker, date, source)\n    )\n  `);\n\n  // Sync state tracking for market data imports\n  // PK: (source, ticker, target_table) — tracks per-source, per-ticker, per-table sync state\n  await conn.run(`\n    CREATE TABLE IF NOT EXISTS market._sync_metadata (\n      source VARCHAR NOT NULL,\n      ticker VARCHAR NOT NULL,\n      target_table VARCHAR NOT NULL,\n\n      content_hash VARCHAR,\n      max_date VARCHAR,\n      enriched_through VARCHAR,\n      wilder_state JSON,\n      synced_at TIMESTAMP NOT NULL,\n\n      PRIMARY KEY (source, ticker, target_table)\n    )\n  `);\n\n  // Phase 75: migrate legacy context data to normalized schema\n  await migrateContextToNormalized(conn);\n}\n","/**\n * Strategy Profile Schema Definitions\n *\n * Creates and manages the `profiles` schema and `profiles.strategy_profiles` table\n * in the analytics DuckDB database. Provides CRUD utilities for strategy profile storage.\n *\n * Schema: profiles\n * Table: profiles.strategy_profiles\n * Primary Key: (block_id, strategy_name) — composite key allows multiple strategies per block\n */\n\nimport type { DuckDBConnection } from \"@duckdb/node-api\";\nimport type { StrategyProfile } from \"../models/strategy-profile.js\";\n\n/**\n * Ensure the profiles schema and strategy_profiles table exist.\n * Safe to call multiple times (CREATE IF NOT EXISTS semantics).\n *\n * @param conn - Active DuckDB connection\n */\nexport async function ensureProfilesSchema(conn: DuckDBConnection): Promise<void> {\n  await conn.run(\"CREATE SCHEMA IF NOT EXISTS profiles\");\n  await conn.run(`\n    CREATE TABLE IF NOT EXISTS profiles.strategy_profiles (\n      block_id VARCHAR NOT NULL,\n      strategy_name VARCHAR NOT NULL,\n      structure_type VARCHAR NOT NULL,\n      greeks_bias VARCHAR NOT NULL,\n      thesis TEXT NOT NULL DEFAULT '',\n      legs JSON,\n      entry_filters JSON,\n      exit_rules JSON,\n      expected_regimes JSON,\n      key_metrics JSON,\n      position_sizing JSON,\n      created_at TIMESTAMP NOT NULL DEFAULT current_timestamp,\n      updated_at TIMESTAMP NOT NULL DEFAULT current_timestamp,\n      PRIMARY KEY (block_id, strategy_name)\n    )\n  `);\n  // Migration: add position_sizing column if table existed before it was added\n  await conn.run(`\n    ALTER TABLE profiles.strategy_profiles ADD COLUMN IF NOT EXISTS position_sizing JSON\n  `);\n  // Migration: add schema v2 top-level columns (nullable for backward compat)\n  await conn.run(`ALTER TABLE profiles.strategy_profiles ADD COLUMN IF NOT EXISTS underlying VARCHAR`);\n  await conn.run(`ALTER TABLE profiles.strategy_profiles ADD COLUMN IF NOT EXISTS re_entry BOOLEAN`);\n  await conn.run(`ALTER TABLE profiles.strategy_profiles ADD COLUMN IF NOT EXISTS cap_profits BOOLEAN`);\n  await conn.run(`ALTER TABLE profiles.strategy_profiles ADD COLUMN IF NOT EXISTS cap_losses BOOLEAN`);\n  await conn.run(`ALTER TABLE profiles.strategy_profiles ADD COLUMN IF NOT EXISTS require_two_prices_pt BOOLEAN`);\n  await conn.run(`ALTER TABLE profiles.strategy_profiles ADD COLUMN IF NOT EXISTS close_on_completion BOOLEAN`);\n  await conn.run(`ALTER TABLE profiles.strategy_profiles ADD COLUMN IF NOT EXISTS ignore_margin_req BOOLEAN`);\n\n  // Migration: normalize expected_regimes to canonical Vol_Regime labels\n  // Old values: \"low_vol\", \"moderate_vol\", \"high_vol\", \"normal\", \"low\" (free-text)\n  // Canonical:  \"very_low\", \"low\", \"below_avg\", \"above_avg\", \"high\", \"extreme\"\n  await migrateExpectedRegimes(conn);\n}\n\n/**\n * One-shot migration: rewrite expected_regimes JSON arrays from free-text\n * vocabulary to canonical Vol_Regime labels.\n *\n * Mapping:\n *   low_vol      → [\"very_low\", \"low\"]\n *   moderate_vol → [\"below_avg\", \"above_avg\"]\n *   normal       → [\"below_avg\", \"above_avg\"]\n *   high_vol     → [\"high\", \"extreme\"]\n *\n * Values already in canonical form are kept as-is. Duplicates are removed.\n * Runs every connection open but only UPDATEs rows containing non-canonical values.\n */\nasync function migrateExpectedRegimes(conn: DuckDBConnection): Promise<void> {\n  const CANONICAL = new Set([\"very_low\", \"low\", \"below_avg\", \"above_avg\", \"high\", \"extreme\"]);\n  const MAPPING: Record<string, string[]> = {\n    low_vol: [\"very_low\", \"low\"],\n    moderate_vol: [\"below_avg\", \"above_avg\"],\n    normal: [\"below_avg\", \"above_avg\"],\n    high_vol: [\"high\", \"extreme\"],\n  };\n\n  // Read all profiles with non-empty expected_regimes\n  const result = await conn.runAndReadAll(\n    `SELECT block_id, strategy_name, expected_regimes\n     FROM profiles.strategy_profiles\n     WHERE expected_regimes IS NOT NULL AND expected_regimes != '[]'`\n  );\n\n  for (const row of result.getRows()) {\n    const blockId = String(row[0]);\n    const strategyName = String(row[1]);\n    const rawJson = String(row[2]);\n\n    let regimes: string[];\n    try {\n      regimes = JSON.parse(rawJson);\n    } catch {\n      continue;\n    }\n\n    // Check if any value needs mapping\n    const needsMigration = regimes.some((r) => !CANONICAL.has(r));\n    if (!needsMigration) continue;\n\n    // Expand free-text values to canonical labels\n    const expanded = new Set<string>();\n    for (const r of regimes) {\n      if (CANONICAL.has(r)) {\n        expanded.add(r);\n      } else if (MAPPING[r]) {\n        for (const mapped of MAPPING[r]) expanded.add(mapped);\n      }\n      // Unknown values are dropped silently\n    }\n\n    const newJson = JSON.stringify([...expanded].sort());\n    await conn.run(\n      `UPDATE profiles.strategy_profiles\n       SET expected_regimes = '${escSql(newJson)}', updated_at = current_timestamp\n       WHERE block_id = '${escSql(blockId)}' AND strategy_name = '${escSql(strategyName)}'`\n    );\n  }\n}\n\n/**\n * Escape a single-quoted string for safe inclusion in DuckDB SQL.\n * Doubles any embedded single quotes.\n */\nfunction escSql(value: string): string {\n  return value.replace(/'/g, \"''\");\n}\n\n/**\n * Convert a DuckDB row value to a JS Date.\n * DuckDB timestamps may come back as numbers (microseconds since epoch) or Date objects.\n */\nfunction toDate(value: unknown): Date {\n  if (value instanceof Date) return value;\n  if (typeof value === \"bigint\") {\n    // DuckDB timestamps are microseconds since Unix epoch\n    return new Date(Number(value) / 1000);\n  }\n  if (typeof value === \"number\") {\n    // May be microseconds or milliseconds depending on DuckDB version\n    // Values larger than ~9e12 are likely microseconds\n    return value > 9e12 ? new Date(value / 1000) : new Date(value);\n  }\n  if (typeof value === \"string\") {\n    return new Date(value);\n  }\n  return new Date();\n}\n\n/**\n * Map a DuckDB row array to a StrategyProfile object.\n * Column order must match the SELECT in query functions.\n *\n * Column order: block_id, strategy_name, structure_type, greeks_bias, thesis,\n *               legs, entry_filters, exit_rules, expected_regimes, key_metrics,\n *               position_sizing, underlying, re_entry, cap_profits, cap_losses,\n *               require_two_prices_pt, close_on_completion, ignore_margin_req,\n *               created_at, updated_at\n */\nfunction rowToProfile(row: unknown[]): StrategyProfile {\n  const parseJson = (v: unknown) => {\n    if (v === null || v === undefined) return [];\n    if (typeof v === \"string\") return JSON.parse(v);\n    return v; // DuckDB may auto-parse JSON columns\n  };\n\n  const parseJsonObj = (v: unknown) => {\n    if (v === null || v === undefined) return {};\n    if (typeof v === \"string\") return JSON.parse(v);\n    return v;\n  };\n\n  const toBoolOrUndef = (v: unknown): boolean | undefined =>\n    v === null || v === undefined ? undefined : Boolean(v);\n\n  return {\n    blockId: row[0] as string,\n    strategyName: row[1] as string,\n    structureType: row[2] as string,\n    greeksBias: row[3] as string,\n    thesis: row[4] as string,\n    legs: parseJson(row[5]),\n    entryFilters: parseJson(row[6]),\n    exitRules: parseJson(row[7]),\n    expectedRegimes: parseJson(row[8]),\n    keyMetrics: parseJsonObj(row[9]),\n    positionSizing: (() => {\n      const ps = parseJsonObj(row[10]);\n      return ps && Object.keys(ps).length > 0 ? ps : undefined;\n    })(),\n    underlying: row[11] as string | undefined ?? undefined,\n    reEntry: toBoolOrUndef(row[12]),\n    capProfits: toBoolOrUndef(row[13]),\n    capLosses: toBoolOrUndef(row[14]),\n    requireTwoPricesPT: toBoolOrUndef(row[15]),\n    closeOnCompletion: toBoolOrUndef(row[16]),\n    ignoreMarginReq: toBoolOrUndef(row[17]),\n    createdAt: toDate(row[18]),\n    updatedAt: toDate(row[19]),\n  };\n}\n\nconst SELECT_COLUMNS = `\n  block_id, strategy_name, structure_type, greeks_bias, thesis,\n  legs, entry_filters, exit_rules, expected_regimes, key_metrics,\n  position_sizing, underlying, re_entry, cap_profits, cap_losses,\n  require_two_prices_pt, close_on_completion, ignore_margin_req,\n  created_at, updated_at\n`.trim();\n\n/**\n * Upsert a strategy profile.\n * If a profile with the same (block_id, strategy_name) exists, it is overwritten.\n * created_at is preserved on update; updated_at is set to the current timestamp.\n *\n * @param conn - Active DuckDB connection\n * @param profile - Profile to insert or update (createdAt/updatedAt are managed by DB)\n * @returns The stored profile with DB-assigned timestamps\n */\nexport async function upsertProfile(\n  conn: DuckDBConnection,\n  profile: Omit<StrategyProfile, \"createdAt\" | \"updatedAt\">\n): Promise<StrategyProfile> {\n  const legsJson = escSql(JSON.stringify(profile.legs));\n  const entryFiltersJson = escSql(JSON.stringify(profile.entryFilters));\n  const exitRulesJson = escSql(JSON.stringify(profile.exitRules));\n  const expectedRegimesJson = escSql(JSON.stringify(profile.expectedRegimes));\n  const keyMetricsJson = escSql(JSON.stringify(profile.keyMetrics));\n  const positionSizingJson = profile.positionSizing\n    ? escSql(JSON.stringify(profile.positionSizing))\n    : null;\n\n  const nowTs = new Date().toISOString().replace(\"T\", \" \").replace(\"Z\", \"\");\n\n  const underlyingSql = profile.underlying ? `'${escSql(profile.underlying)}'` : \"NULL\";\n  const reEntrySql = profile.reEntry === undefined ? \"NULL\" : String(profile.reEntry);\n  const capProfitsSql = profile.capProfits === undefined ? \"NULL\" : String(profile.capProfits);\n  const capLossesSql = profile.capLosses === undefined ? \"NULL\" : String(profile.capLosses);\n  const requireTwoPricesPTSql = profile.requireTwoPricesPT === undefined ? \"NULL\" : String(profile.requireTwoPricesPT);\n  const closeOnCompletionSql = profile.closeOnCompletion === undefined ? \"NULL\" : String(profile.closeOnCompletion);\n  const ignoreMarginReqSql = profile.ignoreMarginReq === undefined ? \"NULL\" : String(profile.ignoreMarginReq);\n\n  await conn.run(`\n    INSERT INTO profiles.strategy_profiles\n      (block_id, strategy_name, structure_type, greeks_bias, thesis,\n       legs, entry_filters, exit_rules, expected_regimes, key_metrics,\n       position_sizing, underlying, re_entry, cap_profits, cap_losses,\n       require_two_prices_pt, close_on_completion, ignore_margin_req,\n       created_at, updated_at)\n    VALUES (\n      '${escSql(profile.blockId)}',\n      '${escSql(profile.strategyName)}',\n      '${escSql(profile.structureType)}',\n      '${escSql(profile.greeksBias)}',\n      '${escSql(profile.thesis)}',\n      '${legsJson}'::JSON,\n      '${entryFiltersJson}'::JSON,\n      '${exitRulesJson}'::JSON,\n      '${expectedRegimesJson}'::JSON,\n      '${keyMetricsJson}'::JSON,\n      ${positionSizingJson ? `'${positionSizingJson}'::JSON` : \"NULL\"},\n      ${underlyingSql},\n      ${reEntrySql},\n      ${capProfitsSql},\n      ${capLossesSql},\n      ${requireTwoPricesPTSql},\n      ${closeOnCompletionSql},\n      ${ignoreMarginReqSql},\n      TIMESTAMPTZ '${nowTs}',\n      TIMESTAMPTZ '${nowTs}'\n    )\n    ON CONFLICT (block_id, strategy_name) DO UPDATE SET\n      structure_type = excluded.structure_type,\n      greeks_bias = excluded.greeks_bias,\n      thesis = excluded.thesis,\n      legs = excluded.legs,\n      entry_filters = excluded.entry_filters,\n      exit_rules = excluded.exit_rules,\n      expected_regimes = excluded.expected_regimes,\n      key_metrics = excluded.key_metrics,\n      position_sizing = excluded.position_sizing,\n      underlying = excluded.underlying,\n      re_entry = excluded.re_entry,\n      cap_profits = excluded.cap_profits,\n      cap_losses = excluded.cap_losses,\n      require_two_prices_pt = excluded.require_two_prices_pt,\n      close_on_completion = excluded.close_on_completion,\n      ignore_margin_req = excluded.ignore_margin_req,\n      updated_at = TIMESTAMPTZ '${nowTs}'\n  `);\n\n  const stored = await getProfile(conn, profile.blockId, profile.strategyName);\n  if (!stored) {\n    throw new Error(\n      `Failed to retrieve profile after upsert: ${profile.blockId}/${profile.strategyName}`\n    );\n  }\n  return stored;\n}\n\n/**\n * Retrieve a single strategy profile by block_id and strategy_name.\n *\n * @param conn - Active DuckDB connection\n * @param blockId - Block identifier\n * @param strategyName - Strategy name\n * @returns The profile, or null if not found\n */\nexport async function getProfile(\n  conn: DuckDBConnection,\n  blockId: string,\n  strategyName: string\n): Promise<StrategyProfile | null> {\n  const result = await conn.runAndReadAll(`\n    SELECT ${SELECT_COLUMNS}\n    FROM profiles.strategy_profiles\n    WHERE block_id = '${escSql(blockId)}'\n      AND strategy_name = '${escSql(strategyName)}'\n  `);\n  const rows = result.getRows();\n  if (rows.length === 0) return null;\n  return rowToProfile(rows[0]);\n}\n\n/**\n * List strategy profiles.\n *\n * @param conn - Active DuckDB connection\n * @param blockId - Optional filter; if provided, only profiles for that block are returned\n * @returns Array of matching profiles\n */\nexport async function listProfiles(\n  conn: DuckDBConnection,\n  blockId?: string\n): Promise<StrategyProfile[]> {\n  const whereClause = blockId\n    ? `WHERE block_id = '${escSql(blockId)}'`\n    : \"\";\n\n  const result = await conn.runAndReadAll(`\n    SELECT ${SELECT_COLUMNS}\n    FROM profiles.strategy_profiles\n    ${whereClause}\n    ORDER BY block_id, strategy_name\n  `);\n\n  return result.getRows().map(rowToProfile);\n}\n\n/**\n * Delete a strategy profile by block_id and strategy_name.\n *\n * @param conn - Active DuckDB connection\n * @param blockId - Block identifier\n * @param strategyName - Strategy name\n * @returns true if a row was deleted, false if no matching row existed\n */\nexport async function deleteProfile(\n  conn: DuckDBConnection,\n  blockId: string,\n  strategyName: string\n): Promise<boolean> {\n  // Check existence before delete so we can return accurate boolean\n  const existing = await getProfile(conn, blockId, strategyName);\n  if (!existing) return false;\n\n  await conn.run(`\n    DELETE FROM profiles.strategy_profiles\n    WHERE block_id = '${escSql(blockId)}'\n      AND strategy_name = '${escSql(strategyName)}'\n  `);\n\n  return true;\n}\n","/**\n * Block Sync Logic\n *\n * Core synchronization logic for syncing block CSV data to DuckDB.\n * Handles hash-based change detection, atomic transactions, and error recovery.\n */\n\nimport type { DuckDBConnection } from \"@duckdb/node-api\";\nimport * as fs from \"fs/promises\";\nimport * as path from \"path\";\nimport { hashFileContent } from \"./hasher.js\";\nimport {\n  getSyncMetadata,\n  upsertSyncMetadata,\n  deleteSyncMetadata,\n  getAllSyncedBlockIds,\n  type BlockSyncMetadata,\n} from \"./metadata.js\";\nimport { resolveTickerFromCsvRow } from \"../utils/ticker.js\";\nimport { convertToReportingTrade } from \"../utils/block-loader.js\";\nimport { discoverCsvFiles } from \"../utils/csv-discovery.js\";\nimport type { ReportingTrade } from \"@tradeblocks/lib\";\n\n/**\n * Result of syncing a single block\n */\nexport interface BlockSyncResult {\n  blockId: string;\n  status: \"synced\" | \"unchanged\" | \"deleted\" | \"error\";\n  tradeCount?: number;\n  error?: string;\n}\n\n// --- CSV Parsing Helpers (copied from block-loader.ts to avoid circular imports) ---\n\n/**\n * Parse CSV content into array of record objects\n */\nfunction parseCSV(content: string): Record<string, string>[] {\n  // Strip UTF-8 BOM if present (common in Windows/Excel CSV exports)\n  const lines = content.replace(/^\\uFEFF/, \"\").trim().split(\"\\n\");\n  if (lines.length < 2) return [];\n\n  const headers = parseCSVLine(lines[0]);\n  const records: Record<string, string>[] = [];\n\n  for (let i = 1; i < lines.length; i++) {\n    const values = parseCSVLine(lines[i]);\n    if (values.length === 0) continue;\n\n    const record: Record<string, string> = {};\n    headers.forEach((header, idx) => {\n      record[header] = values[idx] || \"\";\n    });\n    records.push(record);\n  }\n\n  return records;\n}\n\n/**\n * Parse a single CSV line handling quoted fields\n */\nfunction parseCSVLine(line: string): string[] {\n  const result: string[] = [];\n  let current = \"\";\n  let inQuotes = false;\n\n  for (let i = 0; i < line.length; i++) {\n    const char = line[i];\n\n    if (char === '\"') {\n      if (inQuotes && line[i + 1] === '\"') {\n        current += '\"';\n        i++;\n      } else {\n        inQuotes = !inQuotes;\n      }\n    } else if (char === \",\" && !inQuotes) {\n      result.push(current.trim());\n      current = \"\";\n    } else {\n      current += char;\n    }\n  }\n\n  result.push(current.trim());\n  return result;\n}\n\n/**\n * Normalize CSV date strings into DuckDB-friendly YYYY-MM-DD format.\n *\n * Supports:\n * - YYYY-MM-DD (already normalized)\n * - M/D/YY, MM/DD/YY\n * - M/D/YYYY, MM/DD/YYYY\n */\nfunction normalizeCsvDate(value: string | undefined): string | null {\n  if (!value) return null;\n  const raw = value.trim();\n  if (!raw) return null;\n\n  if (/^\\d{4}-\\d{2}-\\d{2}$/.test(raw)) return raw;\n\n  const mdyMatch = raw.match(/^(\\d{1,2})[/-](\\d{1,2})[/-](\\d{2}|\\d{4})$/);\n  if (!mdyMatch) return raw;\n\n  const month = Number(mdyMatch[1]);\n  const day = Number(mdyMatch[2]);\n  let year = Number(mdyMatch[3]);\n\n  if (Number.isNaN(month) || Number.isNaN(day) || Number.isNaN(year)) {\n    return raw;\n  }\n  if (year < 100) {\n    year += year >= 70 ? 1900 : 2000;\n  }\n\n  const dt = new Date(Date.UTC(year, month - 1, day));\n  if (\n    dt.getUTCFullYear() !== year ||\n    dt.getUTCMonth() + 1 !== month ||\n    dt.getUTCDate() !== day\n  ) {\n    return raw;\n  }\n\n  const mm = String(month).padStart(2, \"0\");\n  const dd = String(day).padStart(2, \"0\");\n  return `${year}-${mm}-${dd}`;\n}\n\n// --- Tradelog Discovery ---\n\n/**\n * Find the tradelog CSV file for a block using header-sniffing discovery.\n * No longer reads block.json — uses discoverCsvFiles from csv-discovery.ts.\n */\nasync function findTradelogFile(\n  blockPath: string\n): Promise<string | null> {\n  const { mappings } = await discoverCsvFiles(blockPath);\n  return mappings.tradelog || null;\n}\n\n/**\n * Find optional log files (dailylog, reportinglog) for a block using header-sniffing discovery.\n * No longer reads block.json — uses discoverCsvFiles from csv-discovery.ts.\n */\nasync function findOptionalLogFiles(\n  blockPath: string\n): Promise<{ dailylog: string | null; reportinglog: string | null }> {\n  const { mappings } = await discoverCsvFiles(blockPath);\n  return {\n    dailylog: mappings.dailylog || null,\n    reportinglog: mappings.reportinglog || null,\n  };\n}\n\n// --- Database Operations ---\n\n/**\n * Insert trades in batches to avoid parameter limits.\n *\n * @param conn - DuckDB connection\n * @param blockId - Block identifier\n * @param records - Parsed CSV records\n * @param startIdx - Starting index in records array\n * @param batchSize - Number of records per batch\n */\nasync function insertTradeBatch(\n  conn: DuckDBConnection,\n  blockId: string,\n  records: Record<string, string>[],\n  startIdx: number,\n  batchSize: number\n): Promise<void> {\n  const batch = records.slice(startIdx, startIdx + batchSize);\n  if (batch.length === 0) return;\n\n  // Build VALUES placeholders: ($1, $2, $3, ...), ($15, $16, $17, ...), ...\n  // Each row has 15 columns: block_id + 13 trade fields + ticker\n  const columnsPerRow = 15;\n  const placeholders: string[] = [];\n  const params: (string | number | null)[] = [];\n\n  for (let rowIdx = 0; rowIdx < batch.length; rowIdx++) {\n    const record = batch[rowIdx];\n    const baseParam = rowIdx * columnsPerRow + 1;\n    const rowPlaceholders = Array.from(\n      { length: columnsPerRow },\n      (_, i) => `$${baseParam + i}`\n    );\n    placeholders.push(`(${rowPlaceholders.join(\", \")})`);\n\n    // Parse numeric values safely\n    const premium = parseFloat(record[\"Premium\"]);\n    const numContracts = parseInt(record[\"No. of Contracts\"], 10);\n    const pl = parseFloat(record[\"P/L\"]);\n    const marginReq = parseFloat(record[\"Margin Req.\"]);\n    const openingCommissions = parseFloat(record[\"Opening Commissions + Fees\"]);\n    const closingCommissions = parseFloat(record[\"Closing Commissions + Fees\"]);\n    const ticker = resolveTickerFromCsvRow(record);\n\n    // Map CSV record to column values\n    params.push(\n      blockId, // block_id\n      normalizeCsvDate(record[\"Date Opened\"]), // date_opened\n      record[\"Time Opened\"] || null, // time_opened\n      (record[\"Strategy\"] || \"\").trim() || blockId, // strategy (fallback to blockId)\n      record[\"Legs\"] || null, // legs\n      isNaN(premium) ? null : premium, // premium\n      isNaN(numContracts) ? 1 : numContracts, // num_contracts\n      isNaN(pl) ? 0 : pl, // pl\n      normalizeCsvDate(record[\"Date Closed\"]), // date_closed\n      record[\"Time Closed\"] || null, // time_closed\n      record[\"Reason For Close\"] || null, // reason_for_close\n      isNaN(marginReq) ? null : marginReq, // margin_req\n      isNaN(openingCommissions) ? 0 : openingCommissions, // opening_commissions\n      isNaN(closingCommissions) ? 0 : closingCommissions, // closing_commissions\n      ticker // ticker\n    );\n  }\n\n  const sql = `\n    INSERT INTO trades.trade_data (\n      block_id, date_opened, time_opened, strategy, legs, premium,\n      num_contracts, pl, date_closed, time_closed, reason_for_close,\n      margin_req, opening_commissions, closing_commissions, ticker\n    ) VALUES ${placeholders.join(\", \")}\n  `;\n\n  await conn.run(sql, params);\n}\n\n/**\n * Format a Date to YYYY-MM-DD using local timezone components.\n * Preserves the calendar day stored in the Date object (see CLAUDE.md date rules).\n */\nfunction formatDateForDb(date: Date | undefined): string | null {\n  if (!date || isNaN(date.getTime())) return null;\n  const year = date.getFullYear();\n  const month = String(date.getMonth() + 1).padStart(2, \"0\");\n  const day = String(date.getDate()).padStart(2, \"0\");\n  return `${year}-${month}-${day}`;\n}\n\n/**\n * Insert reporting trades in batches to avoid parameter limits.\n * Accepts format-agnostic ReportingTrade objects — all CSV format detection\n * is handled upstream by convertToReportingTrade().\n *\n * @param conn - DuckDB connection\n * @param blockId - Block identifier\n * @param trades - Converted ReportingTrade objects\n * @param tickers - Parallel array of resolved ticker strings\n * @param startIdx - Starting index in arrays\n * @param batchSize - Number of records per batch\n */\nasync function insertReportingBatch(\n  conn: DuckDBConnection,\n  blockId: string,\n  trades: ReportingTrade[],\n  tickers: string[],\n  startIdx: number,\n  batchSize: number\n): Promise<void> {\n  const batch = trades.slice(startIdx, startIdx + batchSize);\n  const batchTickers = tickers.slice(startIdx, startIdx + batchSize);\n  if (batch.length === 0) return;\n\n  // Each row has 15 columns: block_id + 13 reporting fields + ticker\n  const columnsPerRow = 15;\n  const placeholders: string[] = [];\n  const params: (string | number | null)[] = [];\n\n  for (let rowIdx = 0; rowIdx < batch.length; rowIdx++) {\n    const trade = batch[rowIdx];\n    const baseParam = rowIdx * columnsPerRow + 1;\n    const rowPlaceholders = Array.from(\n      { length: columnsPerRow },\n      (_, i) => `$${baseParam + i}`\n    );\n    placeholders.push(`(${rowPlaceholders.join(\", \")})`);\n\n    params.push(\n      blockId,\n      formatDateForDb(trade.dateOpened),\n      trade.timeOpened || null,\n      trade.strategy || null,\n      trade.legs || null,\n      trade.initialPremium ?? null,\n      trade.numContracts ?? 1,\n      trade.pl ?? 0,\n      formatDateForDb(trade.dateClosed),\n      trade.timeClosed || null,\n      trade.closingPrice ?? null,\n      trade.avgClosingCost ?? null,\n      trade.reasonForClose || null,\n      trade.openingPrice ?? null,\n      batchTickers[rowIdx]\n    );\n  }\n\n  const sql = `\n    INSERT INTO trades.reporting_data (\n      block_id, date_opened, time_opened, strategy, legs, initial_premium,\n      num_contracts, pl, date_closed, time_closed, closing_price,\n      avg_closing_cost, reason_for_close, opening_price, ticker\n    ) VALUES ${placeholders.join(\", \")}\n  `;\n\n  await conn.run(sql, params);\n}\n\n// --- Parse Versioning ---\n\n/**\n * Bump this when parsing logic changes to force re-sync of all blocks.\n * Appended to content hashes so stored hashes will mismatch.\n *\n * v2: Use blockId as strategy fallback for empty Strategy columns\n */\nconst PARSE_VERSION = \"v2\";\n\nfunction versionedHash(hash: string): string {\n  return `${hash}:${PARSE_VERSION}`;\n}\n\n// --- Core Sync Functions ---\n\n/**\n * Sync a single block's trade data to DuckDB.\n *\n * Performs hash-based change detection and atomic insert:\n * 1. Find and hash the tradelog CSV\n * 2. Compare with stored hash\n * 3. If changed: DELETE old + INSERT new in transaction\n * 4. Update sync metadata\n *\n * @param conn - DuckDB connection\n * @param blockId - Block identifier (folder name)\n * @param blockPath - Absolute path to block folder\n * @returns Sync result with status\n */\nexport async function syncBlockInternal(\n  conn: DuckDBConnection,\n  blockId: string,\n  blockPath: string\n): Promise<BlockSyncResult> {\n  try {\n    // Get existing metadata early (needed for missing-file cleanup logic)\n    const existingMetadata = await getSyncMetadata(conn, blockId);\n\n    // Find the tradelog file via header-sniffing discovery\n    const tradelogFilename = await findTradelogFile(blockPath);\n    if (!tradelogFilename) {\n      // Previously-synced block lost its tradelog: remove stale data/metadata\n      if (existingMetadata) {\n        await conn.run(\"BEGIN TRANSACTION\");\n        try {\n          await conn.run(\n            \"DELETE FROM trades.trade_data WHERE block_id = $1\",\n            [blockId]\n          );\n          await conn.run(\n            \"DELETE FROM trades.reporting_data WHERE block_id = $1\",\n            [blockId]\n          );\n          await deleteSyncMetadata(conn, blockId);\n          await conn.run(\"COMMIT\");\n          return { blockId, status: \"deleted\" };\n        } catch (err) {\n          await conn.run(\"ROLLBACK\");\n          throw err;\n        }\n      }\n\n      return {\n        blockId,\n        status: \"error\",\n        error: \"No tradelog CSV found in block\",\n      };\n    }\n\n    const tradelogPath = path.join(blockPath, tradelogFilename);\n\n    // Hash the tradelog file (versioned to force re-sync on parse logic changes)\n    const tradelogHash = versionedHash(await hashFileContent(tradelogPath));\n\n    // Check if hash matches (unchanged)\n    // Also check if reportinglog exists but hasn't been synced yet\n    if (existingMetadata && existingMetadata.tradelog_hash === tradelogHash) {\n      // Check if reporting log needs to be synced (new file or changed)\n      const optionalLogs = await findOptionalLogFiles(blockPath);\n      if (optionalLogs.reportinglog) {\n        const reportinglogPath = path.join(blockPath, optionalLogs.reportinglog);\n        const reportinglogHash = versionedHash(await hashFileContent(reportinglogPath));\n        if (existingMetadata.reportinglog_hash !== reportinglogHash) {\n          // Reportinglog changed or was never synced - fall through to sync\n        } else {\n          return { blockId, status: \"unchanged\" };\n        }\n      } else {\n        // Reporting log was removed after previously being synced - clear stale data\n        if (existingMetadata.reportinglog_hash !== null) {\n          // Fall through to sync path, which will delete reporting_data and write null hash\n        } else {\n          return { blockId, status: \"unchanged\" };\n        }\n      }\n    }\n\n    // Hash differs or no metadata - need to sync\n    // Start transaction for atomic update\n    await conn.run(\"BEGIN TRANSACTION\");\n\n    try {\n      // Delete old trade data for this block\n      await conn.run(\n        \"DELETE FROM trades.trade_data WHERE block_id = $1\",\n        [blockId]\n      );\n\n      // Read and parse CSV\n      const csvContent = await fs.readFile(tradelogPath, \"utf-8\");\n      const records = parseCSV(csvContent);\n\n      // Insert trades in batches of 500\n      const batchSize = 500;\n      for (let i = 0; i < records.length; i += batchSize) {\n        await insertTradeBatch(conn, blockId, records, i, batchSize);\n      }\n\n      // Hash optional log files if they exist\n      const optionalLogs = await findOptionalLogFiles(blockPath);\n      let dailylogHash: string | null = null;\n      let reportinglogHash: string | null = null;\n\n      if (optionalLogs.dailylog) {\n        try {\n          dailylogHash = versionedHash(await hashFileContent(\n            path.join(blockPath, optionalLogs.dailylog)\n          ));\n        } catch {\n          // Dailylog file can't be read, leave hash null\n        }\n      }\n\n      if (optionalLogs.reportinglog) {\n        try {\n          reportinglogHash = versionedHash(await hashFileContent(\n            path.join(blockPath, optionalLogs.reportinglog)\n          ));\n        } catch {\n          // Reportinglog file can't be read, leave hash null\n        }\n      }\n\n      // Sync reporting log if it exists and has changed\n      // Always delete old reporting data for this block (same pattern as trade_data)\n      await conn.run(\n        \"DELETE FROM trades.reporting_data WHERE block_id = $1\",\n        [blockId]\n      );\n\n      if (optionalLogs.reportinglog && reportinglogHash) {\n        // Read and parse reporting CSV, then convert to ReportingTrade objects.\n        // convertToReportingTrade handles all format detection (OO, TAT, etc.)\n        const reportingPath = path.join(blockPath, optionalLogs.reportinglog);\n        const reportingContent = await fs.readFile(reportingPath, \"utf-8\");\n        const reportingRecords = parseCSV(reportingContent);\n\n        const reportingTrades: ReportingTrade[] = [];\n        const reportingTickers: string[] = [];\n        for (const record of reportingRecords) {\n          const trade = convertToReportingTrade(record);\n          if (trade) {\n            reportingTrades.push(trade);\n            reportingTickers.push(resolveTickerFromCsvRow(record));\n          }\n        }\n\n        // Insert reporting trades in batches of 500\n        for (let i = 0; i < reportingTrades.length; i += batchSize) {\n          await insertReportingBatch(conn, blockId, reportingTrades, reportingTickers, i, batchSize);\n        }\n      }\n\n      // Update sync metadata\n      const newMetadata: BlockSyncMetadata = {\n        block_id: blockId,\n        tradelog_hash: tradelogHash,\n        dailylog_hash: dailylogHash,\n        reportinglog_hash: reportinglogHash,\n        synced_at: new Date(),\n        sync_version: (existingMetadata?.sync_version ?? 0) + 1,\n      };\n      await upsertSyncMetadata(conn, newMetadata);\n\n      // Commit transaction\n      await conn.run(\"COMMIT\");\n\n      return {\n        blockId,\n        status: \"synced\",\n        tradeCount: records.length,\n      };\n    } catch (err) {\n      // Rollback on any error\n      await conn.run(\"ROLLBACK\");\n\n      // If this block was previously synced, remove its data to avoid stale state\n      // (Per CONTEXT.md: \"If sync fails for a previously-synced block, REMOVE its data\")\n      if (existingMetadata) {\n        try {\n          await conn.run(\"BEGIN TRANSACTION\");\n          await conn.run(\n            \"DELETE FROM trades.trade_data WHERE block_id = $1\",\n            [blockId]\n          );\n          await conn.run(\n            \"DELETE FROM trades.reporting_data WHERE block_id = $1\",\n            [blockId]\n          );\n          await deleteSyncMetadata(conn, blockId);\n          await conn.run(\"COMMIT\");\n        } catch {\n          // Best effort cleanup failed, but we'll report the original error\n          try {\n            await conn.run(\"ROLLBACK\");\n          } catch {\n            // Ignore rollback errors\n          }\n        }\n      }\n\n      throw err;\n    }\n  } catch (err) {\n    const errorMsg = err instanceof Error ? err.message : String(err);\n    return {\n      blockId,\n      status: \"error\",\n      error: errorMsg,\n    };\n  }\n}\n\n/**\n * Detect which blocks need syncing and which should be deleted.\n *\n * Compares filesystem folders with sync metadata:\n * - toSync: Folders that exist but aren't synced or have changed\n * - toDelete: Block IDs in metadata but folder no longer exists\n *\n * @param conn - DuckDB connection\n * @param baseDir - Base data directory\n * @returns Object with toSync and toDelete arrays\n */\nexport async function detectBlockChanges(\n  conn: DuckDBConnection,\n  baseDir: string\n): Promise<{ toSync: string[]; toDelete: string[] }> {\n  const toSync: string[] = [];\n  const toDelete: string[] = [];\n\n  // Get all synced block IDs from metadata\n  const syncedBlockIds = new Set(await getAllSyncedBlockIds(conn));\n\n  // List all directories in baseDir\n  const entries = await fs.readdir(baseDir, { withFileTypes: true });\n  const folderNames = new Set<string>();\n\n  for (const entry of entries) {\n    if (!entry.isDirectory()) continue;\n    if (entry.name.startsWith(\".\") || entry.name.startsWith(\"_\")) continue; // Skip hidden/internal folders\n    if (entry.name.endsWith(\".tmp\") || entry.name.endsWith(\".duckdb\") || entry.name.endsWith(\".duckdb.tmp\")) continue; // Skip DuckDB/temp files\n\n    const blockId = entry.name;\n    folderNames.add(blockId);\n\n    const blockPath = path.join(baseDir, blockId);\n\n    // Check if this is a new block (not in metadata)\n    if (!syncedBlockIds.has(blockId)) {\n      // Only sync if folder contains a tradelog CSV\n      const tradelog = await findTradelogFile(blockPath);\n      if (tradelog) {\n        toSync.push(blockId);\n      }\n      continue;\n    }\n\n    // Block exists in metadata - check if hash changed\n    const tradelogFilename = await findTradelogFile(blockPath);\n    if (!tradelogFilename) {\n      // Previously-synced block lost tradelog: mark for cleanup\n      toDelete.push(blockId);\n      continue;\n    }\n\n    try {\n      const tradelogPath = path.join(blockPath, tradelogFilename);\n      const currentHash = versionedHash(await hashFileContent(tradelogPath));\n      const metadata = await getSyncMetadata(conn, blockId);\n\n      if (!metadata || metadata.tradelog_hash !== currentHash) {\n        toSync.push(blockId);\n      } else {\n        // Tradelog unchanged - check if reportinglog needs syncing\n        const optionalLogs = await findOptionalLogFiles(blockPath);\n        if (optionalLogs.reportinglog) {\n          const reportinglogPath = path.join(blockPath, optionalLogs.reportinglog);\n          const reportingHash = versionedHash(await hashFileContent(reportinglogPath));\n          if (metadata.reportinglog_hash !== reportingHash) {\n            // Reportinglog changed or was never synced\n            toSync.push(blockId);\n          }\n        } else if (metadata?.reportinglog_hash !== null) {\n          // Reportinglog was removed after being previously synced\n          toSync.push(blockId);\n        }\n      }\n    } catch {\n      // Can't hash file - mark for sync (will fail during sync with proper error)\n      toSync.push(blockId);\n    }\n  }\n\n  // Find deleted blocks (in metadata but folder doesn't exist)\n  for (const syncedBlockId of syncedBlockIds) {\n    if (!folderNames.has(syncedBlockId)) {\n      toDelete.push(syncedBlockId);\n    }\n  }\n\n  return { toSync, toDelete };\n}\n\n/**\n * Remove data for deleted blocks from DuckDB.\n *\n * Performs atomic cleanup: deletes trade data and sync metadata.\n *\n * @param conn - DuckDB connection\n * @param deletedBlockIds - Array of block IDs to clean up\n */\nexport async function cleanupDeletedBlocks(\n  conn: DuckDBConnection,\n  deletedBlockIds: string[]\n): Promise<void> {\n  for (const blockId of deletedBlockIds) {\n    await conn.run(\"BEGIN TRANSACTION\");\n    try {\n      await conn.run(\n        \"DELETE FROM trades.trade_data WHERE block_id = $1\",\n        [blockId]\n      );\n      await conn.run(\n        \"DELETE FROM trades.reporting_data WHERE block_id = $1\",\n        [blockId]\n      );\n      await deleteSyncMetadata(conn, blockId);\n      await conn.run(\"COMMIT\");\n    } catch (err) {\n      await conn.run(\"ROLLBACK\");\n      throw err;\n    }\n  }\n}\n","/**\n * File Content Hashing\n *\n * Provides SHA-256 hashing for file content to detect changes.\n * Used by the sync layer to determine if CSV files need re-syncing.\n */\n\nimport * as crypto from \"crypto\";\nimport * as fs from \"fs/promises\";\n\n/**\n * Compute SHA-256 hash of file content.\n *\n * @param filePath - Absolute path to the file\n * @returns Promise<string> - Hex-encoded SHA-256 hash\n * @throws Error if file cannot be read\n */\nexport async function hashFileContent(filePath: string): Promise<string> {\n  const buffer = await fs.readFile(filePath);\n  return crypto.createHash(\"sha256\").update(buffer).digest(\"hex\");\n}\n","/**\n * Sync Metadata Operations\n *\n * CRUD operations for sync metadata stored in DuckDB.\n * Used to track which blocks/files are synced and their content hashes.\n */\n\nimport type { DuckDBConnection } from \"@duckdb/node-api\";\n\n/**\n * Sync metadata for a block (trades._sync_metadata)\n */\nexport interface BlockSyncMetadata {\n  block_id: string;\n  tradelog_hash: string;\n  dailylog_hash: string | null;\n  reportinglog_hash: string | null;\n  synced_at: Date;\n  sync_version: number;\n}\n\n\n/**\n * Get sync metadata for a block.\n *\n * @param conn - DuckDB connection\n * @param blockId - Block identifier\n * @returns Metadata if block is synced, null otherwise\n */\nexport async function getSyncMetadata(\n  conn: DuckDBConnection,\n  blockId: string\n): Promise<BlockSyncMetadata | null> {\n  const reader = await conn.runAndReadAll(\n    `SELECT block_id, tradelog_hash, dailylog_hash, reportinglog_hash, synced_at, sync_version\n     FROM trades._sync_metadata\n     WHERE block_id = $1`,\n    [blockId]\n  );\n\n  const rows = reader.getRows();\n  if (rows.length === 0) {\n    return null;\n  }\n\n  const row = rows[0];\n  return {\n    block_id: row[0] as string,\n    tradelog_hash: row[1] as string,\n    dailylog_hash: row[2] as string | null,\n    reportinglog_hash: row[3] as string | null,\n    synced_at: new Date(row[4] as string),\n    sync_version: row[5] as number,\n  };\n}\n\n/**\n * Insert or update sync metadata for a block.\n *\n * @param conn - DuckDB connection\n * @param metadata - Block sync metadata to upsert\n */\nexport async function upsertSyncMetadata(\n  conn: DuckDBConnection,\n  metadata: BlockSyncMetadata\n): Promise<void> {\n  await conn.run(\n    `INSERT OR REPLACE INTO trades._sync_metadata\n     (block_id, tradelog_hash, dailylog_hash, reportinglog_hash, synced_at, sync_version)\n     VALUES ($1, $2, $3, $4, $5, $6)`,\n    [\n      metadata.block_id,\n      metadata.tradelog_hash,\n      metadata.dailylog_hash,\n      metadata.reportinglog_hash,\n      metadata.synced_at.toISOString(),\n      metadata.sync_version,\n    ]\n  );\n}\n\n/**\n * Delete sync metadata for a block.\n *\n * @param conn - DuckDB connection\n * @param blockId - Block identifier to delete\n */\nexport async function deleteSyncMetadata(\n  conn: DuckDBConnection,\n  blockId: string\n): Promise<void> {\n  await conn.run(\n    `DELETE FROM trades._sync_metadata WHERE block_id = $1`,\n    [blockId]\n  );\n}\n\n/**\n * Get all synced block IDs.\n *\n * @param conn - DuckDB connection\n * @returns Array of block IDs that have sync metadata\n */\nexport async function getAllSyncedBlockIds(\n  conn: DuckDBConnection\n): Promise<string[]> {\n  const reader = await conn.runAndReadAll(\n    `SELECT block_id FROM trades._sync_metadata`\n  );\n\n  const rows = reader.getRows();\n  return rows.map((row) => row[0] as string);\n}\n\n// =============================================================================\n// Phase 60 Market Import Metadata Helpers\n// =============================================================================\n\n/**\n * Market import metadata aligned to Phase 60 market._sync_metadata schema.\n * PK: (source, ticker, target_table)\n *\n * Distinct from MarketSyncMetadata which uses the old file_name-based schema.\n * Use these helpers for all Phase 61+ import tool calls.\n */\nexport interface MarketImportMetadata {\n  source: string;       // e.g., \"import_market_csv:/abs/path/to/file.csv\"\n  ticker: string;       // Normalized ticker e.g. \"SPX\"\n  target_table: string; // \"daily\" | \"context\" | \"intraday\"\n  max_date: string | null;\n  enriched_through: string | null;\n  synced_at: Date;\n}\n\n/**\n * Get market import metadata for a specific source/ticker/table combination.\n */\nexport async function getMarketImportMetadata(\n  conn: DuckDBConnection,\n  source: string,\n  ticker: string,\n  targetTable: string\n): Promise<MarketImportMetadata | null> {\n  const reader = await conn.runAndReadAll(\n    `SELECT source, ticker, target_table, max_date, enriched_through, synced_at\n     FROM market._sync_metadata\n     WHERE source = $1 AND ticker = $2 AND target_table = $3`,\n    [source, ticker, targetTable]\n  );\n  const rows = reader.getRows();\n  if (rows.length === 0) return null;\n  const row = rows[0];\n  return {\n    source: row[0] as string,\n    ticker: row[1] as string,\n    target_table: row[2] as string,\n    max_date: row[3] as string | null,\n    enriched_through: row[4] as string | null,\n    synced_at: new Date(row[5] as string),\n  };\n}\n\n/**\n * Upsert market import metadata using the Phase 60 schema PK (source, ticker, target_table).\n * Updates max_date, enriched_through, and synced_at on conflict.\n */\nexport async function upsertMarketImportMetadata(\n  conn: DuckDBConnection,\n  metadata: MarketImportMetadata\n): Promise<void> {\n  await conn.run(\n    `INSERT INTO market._sync_metadata\n       (source, ticker, target_table, max_date, enriched_through, synced_at)\n     VALUES ($1, $2, $3, $4, $5, $6)\n     ON CONFLICT (source, ticker, target_table) DO UPDATE SET\n       max_date = EXCLUDED.max_date,\n       enriched_through = EXCLUDED.enriched_through,\n       synced_at = EXCLUDED.synced_at`,\n    [\n      metadata.source,\n      metadata.ticker,\n      metadata.target_table,\n      metadata.max_date,\n      metadata.enriched_through,\n      metadata.synced_at.toISOString(),\n    ]\n  );\n}\n","import type { Trade } from \"@tradeblocks/lib\";\n\nexport const DEFAULT_MARKET_TICKER = \"SPX\";\nexport const GLOBAL_MARKET_TICKER = \"ALL\";\n\nconst TICKER_FIELD_CANDIDATES = [\n  \"ticker\",\n  \"Ticker\",\n  \"symbol\",\n  \"Symbol\",\n  \"underlying\",\n  \"Underlying\",\n  \"underlyingSymbol\",\n  \"UnderlyingSymbol\",\n  \"Underlying Symbol\",\n];\n\n/**\n * Normalize ticker strings into a stable uppercase symbol.\n */\nexport function normalizeTicker(value: string | null | undefined): string | null {\n  if (!value) return null;\n  const trimmed = value.trim();\n  if (!trimmed) return null;\n\n  const firstToken = trimmed.split(/\\s+/)[0];\n  const stripped = firstToken.replace(/^[\\^$]+/, \"\");\n  const normalized = stripped.toUpperCase().replace(/[^A-Z0-9._-]/g, \"\");\n  if (!normalized) return null;\n  // Guard against contract-count tokens like \"1\" from Symbol/legs strings.\n  // Valid tickers should include at least one alphabetic character.\n  if (!/[A-Z]/.test(normalized)) return null;\n  return normalized;\n}\n\n/**\n * Resolve ticker from arbitrary object fields (case/alias tolerant).\n */\nexport function resolveTickerFromFields(\n  fields: Record<string, unknown> | null | undefined\n): string | null {\n  if (!fields) return null;\n  for (const field of TICKER_FIELD_CANDIDATES) {\n    const raw = fields[field];\n    if (typeof raw === \"string\") {\n      const normalized = normalizeTicker(raw);\n      if (normalized) return normalized;\n    }\n  }\n  return null;\n}\n\n/**\n * Resolve ticker for a loaded trade.\n */\nexport function resolveTradeTicker(\n  trade: Pick<Trade, \"customFields\">,\n  fallback: string = DEFAULT_MARKET_TICKER\n): string {\n  return (\n    resolveTickerFromFields(trade.customFields as Record<string, unknown> | undefined) ??\n    fallback\n  );\n}\n\n/**\n * Resolve ticker from a CSV row plus optional fallback.\n */\nexport function resolveTickerFromCsvRow(\n  row: Record<string, string>,\n  fallback: string = DEFAULT_MARKET_TICKER\n): string {\n  return (\n    resolveTickerFromFields(row as Record<string, unknown>) ??\n    fallback\n  );\n}\n\n/**\n * Stable composite key for ticker+date maps.\n */\nexport function marketTickerDateKey(ticker: string, date: string): string {\n  return `${ticker}|${date}`;\n}\n","/**\n * Block Data Loader\n *\n * Utilities for loading and managing block data from folder-based structure.\n * Blocks are directories containing tradelog.csv (required) and optional dailylog.csv.\n *\n * Stats for listBlocks are computed from DuckDB (synced by middleware before tool calls).\n * File resolution for loadBlock/loadReportingLog uses csv-discovery header sniffing.\n * No block.json files are read or written.\n */\n\nimport * as fs from \"fs/promises\";\nimport * as path from \"path\";\nimport type { Trade, DailyLogEntry, ReportingTrade } from \"@tradeblocks/lib\";\nimport {\n  REPORTING_TRADE_COLUMN_ALIASES,\n  isTatFormat,\n  convertTatRowToReportingTrade,\n} from \"@tradeblocks/lib\";\nimport { getConnection } from \"../db/connection.js\";\n\n// Re-export CSV discovery types and functions from shared module\nexport { type CsvMappings, type CsvType, detectCsvType, discoverCsvFiles, logCsvDiscoveryWarning } from \"./csv-discovery.js\";\nimport { type CsvType, discoverCsvFiles } from \"./csv-discovery.js\";\n\n/**\n * Block info summary for listing\n */\nexport interface BlockInfo {\n  blockId: string;\n  name: string;\n  tradeCount: number;\n  hasDailyLog: boolean;\n  hasReportingLog: boolean;\n  dateRange: {\n    start: Date | null;\n    end: Date | null;\n  };\n  strategies: string[];\n  totalPl: number;\n  netPl: number;\n  /** Summary of reporting log data if available */\n  reportingLog?: {\n    tradeCount: number;\n    strategyCount: number;\n    totalPL: number;\n    dateRange: { start: string | null; end: string | null };\n    stale: boolean;\n  };\n}\n\n/**\n * Loaded block data\n */\nexport interface LoadedBlock {\n  blockId: string;\n  trades: Trade[];\n  dailyLogs?: DailyLogEntry[];\n}\n\n/**\n * Parse a YYYY-MM-DD date string preserving the calendar date.\n * Same approach as lib/processing for consistency.\n */\nfunction parseDatePreservingCalendarDay(dateStr: string): Date {\n  const match = dateStr.match(/^(\\d{4})-(\\d{2})-(\\d{2})$/);\n  if (match) {\n    const [, year, month, day] = match;\n    return new Date(parseInt(year), parseInt(month) - 1, parseInt(day));\n  }\n  return new Date(dateStr);\n}\n\n/**\n * Parse numeric value from CSV string\n */\nfunction parseNumber(\n  value: string | undefined,\n  defaultValue?: number\n): number {\n  if (!value || value.trim() === \"\" || value.toLowerCase() === \"nan\") {\n    if (defaultValue !== undefined) return defaultValue;\n    return 0;\n  }\n  const cleaned = value.replace(/[$,%]/g, \"\").trim();\n  const parsed = parseFloat(cleaned);\n  return isNaN(parsed) ? defaultValue ?? 0 : parsed;\n}\n\nconst KNOWN_TRADE_COLUMNS = new Set([\n  \"Date Opened\",\n  \"Time Opened\",\n  \"Opening Price\",\n  \"Legs\",\n  \"Premium\",\n  \"Closing Price\",\n  \"Date Closed\",\n  \"Time Closed\",\n  \"Avg. Closing Cost\",\n  \"Reason For Close\",\n  \"P/L\",\n  \"No. of Contracts\",\n  \"Funds at Close\",\n  \"Margin Req.\",\n  \"Strategy\",\n  \"Opening Commissions + Fees\",\n  \"Opening comms & fees\",\n  \"Closing Commissions + Fees\",\n  \"Closing comms & fees\",\n  \"Opening Short/Long Ratio\",\n  \"Closing Short/Long Ratio\",\n  \"Opening VIX\",\n  \"Closing VIX\",\n  \"Gap\",\n  \"Movement\",\n  \"Max Profit\",\n  \"Max Loss\",\n]);\n\n/**\n * Parse CSV content into array of record objects\n */\nfunction parseCSV(content: string): Record<string, string>[] {\n  // Strip UTF-8 BOM if present (common in Windows/Excel CSV exports)\n  const lines = content.replace(/^\\uFEFF/, \"\").trim().split(\"\\n\");\n  if (lines.length < 2) return [];\n\n  const headers = parseCSVLine(lines[0]);\n  const records: Record<string, string>[] = [];\n\n  for (let i = 1; i < lines.length; i++) {\n    const values = parseCSVLine(lines[i]);\n    if (values.length === 0) continue;\n\n    const record: Record<string, string> = {};\n    headers.forEach((header, idx) => {\n      record[header] = values[idx] || \"\";\n    });\n    records.push(record);\n  }\n\n  return records;\n}\n\n/**\n * Parse a single CSV line handling quoted fields\n */\nfunction parseCSVLine(line: string): string[] {\n  const result: string[] = [];\n  let current = \"\";\n  let inQuotes = false;\n\n  for (let i = 0; i < line.length; i++) {\n    const char = line[i];\n\n    if (char === '\"') {\n      if (inQuotes && line[i + 1] === '\"') {\n        current += '\"';\n        i++;\n      } else {\n        inQuotes = !inQuotes;\n      }\n    } else if (char === \",\" && !inQuotes) {\n      result.push(current.trim());\n      current = \"\";\n    } else {\n      current += char;\n    }\n  }\n\n  result.push(current.trim());\n  return result;\n}\n\n/**\n * Convert raw CSV record to Trade object\n */\nfunction convertToTrade(raw: Record<string, string>, blockId?: string): Trade | null {\n  try {\n    const dateOpened = parseDatePreservingCalendarDay(raw[\"Date Opened\"]);\n    if (isNaN(dateOpened.getTime())) return null;\n\n    const dateClosed = raw[\"Date Closed\"]\n      ? parseDatePreservingCalendarDay(raw[\"Date Closed\"])\n      : undefined;\n\n    const strategy = (raw[\"Strategy\"] || \"\").trim() || blockId || \"Unknown\";\n\n    const rawPremium = (raw[\"Premium\"] || \"\").replace(/[$,]/g, \"\").trim();\n    const premiumPrecision: Trade[\"premiumPrecision\"] =\n      rawPremium && !rawPremium.includes(\".\") ? \"cents\" : \"dollars\";\n    const legs = raw[\"Legs\"] || raw[\"Symbol\"] || \"\";\n\n    const trade: Trade = {\n      dateOpened,\n      timeOpened: raw[\"Time Opened\"] || \"00:00:00\",\n      openingPrice: parseNumber(raw[\"Opening Price\"]),\n      legs,\n      premium: parseNumber(raw[\"Premium\"]),\n      premiumPrecision,\n      closingPrice: raw[\"Closing Price\"]\n        ? parseNumber(raw[\"Closing Price\"])\n        : undefined,\n      dateClosed,\n      timeClosed: raw[\"Time Closed\"] || undefined,\n      avgClosingCost: raw[\"Avg. Closing Cost\"]\n        ? parseNumber(raw[\"Avg. Closing Cost\"])\n        : undefined,\n      reasonForClose: raw[\"Reason For Close\"] || undefined,\n      pl: parseNumber(raw[\"P/L\"]),\n      numContracts: Math.round(parseNumber(raw[\"No. of Contracts\"], 1)),\n      fundsAtClose: parseNumber(raw[\"Funds at Close\"]),\n      marginReq: parseNumber(raw[\"Margin Req.\"]),\n      strategy,\n      openingCommissionsFees: parseNumber(\n        raw[\"Opening Commissions + Fees\"] || raw[\"Opening comms & fees\"],\n        0\n      ),\n      closingCommissionsFees: parseNumber(\n        raw[\"Closing Commissions + Fees\"] || raw[\"Closing comms & fees\"],\n        0\n      ),\n      openingShortLongRatio: parseNumber(raw[\"Opening Short/Long Ratio\"], 0),\n      closingShortLongRatio: raw[\"Closing Short/Long Ratio\"]\n        ? parseNumber(raw[\"Closing Short/Long Ratio\"])\n        : undefined,\n      openingVix: raw[\"Opening VIX\"]\n        ? parseNumber(raw[\"Opening VIX\"])\n        : undefined,\n      closingVix: raw[\"Closing VIX\"]\n        ? parseNumber(raw[\"Closing VIX\"])\n        : undefined,\n      gap: raw[\"Gap\"] ? parseNumber(raw[\"Gap\"]) : undefined,\n      movement: raw[\"Movement\"] ? parseNumber(raw[\"Movement\"]) : undefined,\n      maxProfit: raw[\"Max Profit\"]\n        ? parseNumber(raw[\"Max Profit\"])\n        : undefined,\n      maxLoss: raw[\"Max Loss\"] ? parseNumber(raw[\"Max Loss\"]) : undefined,\n    };\n\n    const customFields: Record<string, number | string> = {};\n    for (const [key, value] of Object.entries(raw)) {\n      if (!KNOWN_TRADE_COLUMNS.has(key) && value !== undefined && value.trim() !== \"\") {\n        const cleaned = value.replace(/[$,%]/g, \"\").trim();\n        const parsed = parseFloat(cleaned);\n        customFields[key] = !isNaN(parsed) && isFinite(parsed) ? parsed : value.trim();\n      }\n    }\n    if (Object.keys(customFields).length > 0) {\n      trade.customFields = customFields;\n    }\n\n    return trade;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Convert raw CSV record to DailyLogEntry object\n */\nfunction convertToDailyLogEntry(\n  raw: Record<string, string>,\n  blockId?: string\n): DailyLogEntry | null {\n  try {\n    const date = parseDatePreservingCalendarDay(raw[\"Date\"]);\n    if (isNaN(date.getTime())) return null;\n\n    return {\n      date,\n      netLiquidity: parseNumber(raw[\"Net Liquidity\"]),\n      currentFunds: parseNumber(raw[\"Current Funds\"]),\n      withdrawn: parseNumber(raw[\"Withdrawn\"], 0),\n      tradingFunds: parseNumber(raw[\"Trading Funds\"]),\n      dailyPl: parseNumber(raw[\"P/L\"]),\n      dailyPlPct: parseNumber(raw[\"P/L %\"]),\n      drawdownPct: parseNumber(raw[\"Drawdown %\"]),\n      blockId,\n    };\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Load trades from tradelog CSV file\n * @param blockPath - Path to the block directory\n * @param filename - CSV filename (default: \"tradelog.csv\")\n */\nasync function loadTrades(\n  blockPath: string,\n  filename: string = \"tradelog.csv\",\n  blockId?: string\n): Promise<Trade[]> {\n  const tradelogPath = path.join(blockPath, filename);\n  const content = await fs.readFile(tradelogPath, \"utf-8\");\n  const records = parseCSV(content);\n\n  const trades: Trade[] = [];\n  for (const record of records) {\n    const trade = convertToTrade(record, blockId);\n    if (trade) {\n      trades.push(trade);\n    }\n  }\n\n  // Sort by date and time\n  trades.sort((a, b) => {\n    const dateCompare =\n      new Date(a.dateOpened).getTime() - new Date(b.dateOpened).getTime();\n    if (dateCompare !== 0) return dateCompare;\n    return a.timeOpened.localeCompare(b.timeOpened);\n  });\n\n  return trades;\n}\n\n/**\n * Load daily logs from dailylog CSV file (optional)\n * @param blockPath - Path to the block directory\n * @param blockId - Block identifier\n * @param filename - CSV filename (default: \"dailylog.csv\")\n */\nasync function loadDailyLogs(\n  blockPath: string,\n  blockId: string,\n  filename: string = \"dailylog.csv\"\n): Promise<DailyLogEntry[] | undefined> {\n  const dailylogPath = path.join(blockPath, filename);\n\n  try {\n    await fs.access(dailylogPath);\n    const content = await fs.readFile(dailylogPath, \"utf-8\");\n    const records = parseCSV(content);\n\n    const entries: DailyLogEntry[] = [];\n    for (const record of records) {\n      const entry = convertToDailyLogEntry(record, blockId);\n      if (entry) {\n        entries.push(entry);\n      }\n    }\n\n    // Sort by date\n    entries.sort(\n      (a, b) => new Date(a.date).getTime() - new Date(b.date).getTime()\n    );\n\n    return entries.length > 0 ? entries : undefined;\n  } catch {\n    // Daily log doesn't exist - that's fine\n    return undefined;\n  }\n}\n\n/**\n * Load a complete block (trades + optional daily logs).\n * Uses csv-discovery header sniffing for file resolution.\n */\nexport async function loadBlock(\n  baseDir: string,\n  blockId: string\n): Promise<LoadedBlock> {\n  const blockPath = path.join(baseDir, blockId);\n\n  // Discover CSV files via header sniffing\n  const { mappings } = await discoverCsvFiles(blockPath);\n\n  // Determine tradelog filename (from discovery or default)\n  const tradelogFilename = mappings.tradelog || \"tradelog.csv\";\n  const tradelogPath = path.join(blockPath, tradelogFilename);\n\n  // Verify tradelog exists\n  try {\n    await fs.access(tradelogPath);\n  } catch {\n    throw new Error(`Block not found or missing tradelog: ${blockId}`);\n  }\n\n  // Determine dailylog filename\n  const dailylogFilename = mappings.dailylog || \"dailylog.csv\";\n\n  const trades = await loadTrades(blockPath, tradelogFilename, blockId);\n  const dailyLogs = await loadDailyLogs(blockPath, blockId, dailylogFilename);\n\n  return {\n    blockId,\n    trades,\n    dailyLogs,\n  };\n}\n\n/**\n * Helper to convert a DuckDB date value to a JS Date.\n * DuckDB may return Date objects, strings, or numeric day offsets.\n */\nfunction toDuckDbDate(val: unknown): Date | null {\n  if (val == null) return null;\n  if (val instanceof Date) return val;\n  // DuckDB node-api returns DATE as {days: N} object (days since epoch)\n  if (typeof val === \"object\" && val !== null && \"days\" in val) {\n    return new Date((val as { days: number }).days * 86400000);\n  }\n  if (typeof val === \"number\") {\n    // DuckDB DATE type returns days since epoch as a number\n    return new Date(val * 86400000);\n  }\n  if (typeof val === \"string\") {\n    // Try calendar-date parse first (YYYY-MM-DD)\n    const match = val.match(/^(\\d{4})-(\\d{2})-(\\d{2})/);\n    if (match) {\n      return new Date(parseInt(match[1]), parseInt(match[2]) - 1, parseInt(match[3]));\n    }\n    return new Date(val);\n  }\n  return null;\n}\n\n/**\n * List all valid blocks in the base directory.\n * Stats are computed from DuckDB (data synced by middleware before tool calls).\n * Also scans filesystem to include unsynced block folders.\n */\nexport async function listBlocks(baseDir: string): Promise<BlockInfo[]> {\n  const blocks: BlockInfo[] = [];\n\n  try {\n    const conn = await getConnection(baseDir);\n\n    // Query 1: Trade stats per block from DuckDB\n    const tradeStatsReader = await conn.runAndReadAll(`\n      SELECT\n        t.block_id,\n        COUNT(*) as trade_count,\n        MIN(t.date_opened) as min_date,\n        MAX(t.date_opened) as max_date,\n        SUM(t.pl) as total_pl,\n        SUM(t.pl) - SUM(COALESCE(t.opening_commissions, 0) + COALESCE(t.closing_commissions, 0)) as net_pl\n      FROM trades.trade_data t\n      GROUP BY t.block_id\n    `);\n\n    // Separate query for strategies (avoids ARRAY_AGG DuckDB node-api serialization issues)\n    const strategiesReader = await conn.runAndReadAll(`\n      SELECT block_id, strategy\n      FROM (SELECT DISTINCT block_id, strategy FROM trades.trade_data WHERE strategy IS NOT NULL)\n      ORDER BY block_id, strategy\n    `);\n    const strategiesByBlock = new Map<string, string[]>();\n    for (const row of strategiesReader.getRows()) {\n      const bid = row[0] as string;\n      if (!strategiesByBlock.has(bid)) strategiesByBlock.set(bid, []);\n      strategiesByBlock.get(bid)!.push(row[1] as string);\n    }\n\n    // Build a map of block_id -> trade stats\n    const tradeStats = new Map<string, {\n      tradeCount: number;\n      strategies: string[];\n      minDate: Date | null;\n      maxDate: Date | null;\n      totalPl: number;\n      netPl: number;\n    }>();\n\n    for (const row of tradeStatsReader.getRows()) {\n      const blockId = row[0] as string;\n      const tradeCount = Number(row[1]);\n      const minDate = toDuckDbDate(row[2]);\n      const maxDate = toDuckDbDate(row[3]);\n      const totalPl = Number(row[4]) || 0;\n      const netPl = Number(row[5]) || 0;\n      const strategies = strategiesByBlock.get(blockId) ?? [];\n\n      tradeStats.set(blockId, {\n        tradeCount,\n        strategies,\n        minDate,\n        maxDate,\n        totalPl,\n        netPl,\n      });\n    }\n\n    // Query 2: Reporting log summaries from DuckDB\n    const reportingReader = await conn.runAndReadAll(`\n      SELECT\n        r.block_id,\n        COUNT(*) as trade_count,\n        COUNT(DISTINCT r.strategy) as strategy_count,\n        SUM(r.pl) as total_pl,\n        MIN(r.date_opened)::VARCHAR as min_date,\n        MAX(r.date_opened)::VARCHAR as max_date\n      FROM trades.reporting_data r\n      GROUP BY r.block_id\n    `);\n\n    const reportingStats = new Map<string, {\n      tradeCount: number;\n      strategyCount: number;\n      totalPL: number;\n      minDate: string | null;\n      maxDate: string | null;\n    }>();\n\n    for (const row of reportingReader.getRows()) {\n      const blockId = row[0] as string;\n      reportingStats.set(blockId, {\n        tradeCount: Number(row[1]),\n        strategyCount: Number(row[2]),\n        totalPL: Number(row[3]) || 0,\n        minDate: row[4] as string | null,\n        maxDate: row[5] as string | null,\n      });\n    }\n\n    // Query 3: Sync metadata to determine hasDailyLog/hasReportingLog\n    const syncReader = await conn.runAndReadAll(`\n      SELECT block_id, dailylog_hash, reportinglog_hash FROM trades._sync_metadata\n    `);\n\n    const syncMeta = new Map<string, {\n      hasDailyLog: boolean;\n      hasReportingLog: boolean;\n    }>();\n\n    for (const row of syncReader.getRows()) {\n      const blockId = row[0] as string;\n      syncMeta.set(blockId, {\n        hasDailyLog: row[1] != null,\n        hasReportingLog: row[2] != null,\n      });\n    }\n\n    // Scan filesystem for block folders (some may not be synced yet)\n    const entries = await fs.readdir(baseDir, { withFileTypes: true });\n    const blockFolders = new Set<string>();\n\n    for (const entry of entries) {\n      if (!entry.isDirectory()) continue;\n      if (entry.name.startsWith(\".\")) continue;\n      blockFolders.add(entry.name);\n    }\n\n    // Also include blocks that are in DuckDB but might not be on filesystem anymore\n    // (middleware handles deletion, but list should be consistent with DuckDB state)\n    for (const blockId of tradeStats.keys()) {\n      blockFolders.add(blockId);\n    }\n\n    // Build BlockInfo for each block\n    for (const blockId of blockFolders) {\n      const stats = tradeStats.get(blockId);\n      const sync = syncMeta.get(blockId);\n      const reporting = reportingStats.get(blockId);\n\n      if (stats && stats.tradeCount > 0) {\n        // Block has synced trade data in DuckDB\n        const info: BlockInfo = {\n          blockId,\n          name: blockId,\n          tradeCount: stats.tradeCount,\n          hasDailyLog: sync?.hasDailyLog ?? false,\n          hasReportingLog: sync?.hasReportingLog ?? false,\n          dateRange: {\n            start: stats.minDate,\n            end: stats.maxDate,\n          },\n          strategies: stats.strategies,\n          totalPl: stats.totalPl,\n          netPl: stats.netPl,\n        };\n\n        // Add reporting log summary if available\n        if (reporting) {\n          info.reportingLog = {\n            tradeCount: reporting.tradeCount,\n            strategyCount: reporting.strategyCount,\n            totalPL: reporting.totalPL,\n            dateRange: {\n              start: reporting.minDate,\n              end: reporting.maxDate,\n            },\n            stale: false, // Data is synced fresh via middleware\n          };\n        }\n\n        blocks.push(info);\n      } else if (!stats) {\n        // Block folder exists but has no synced data yet.\n        // Check if it has CSVs (it will sync on next tool call via middleware).\n        const blockPath = path.join(baseDir, blockId);\n        try {\n          const { mappings } = await discoverCsvFiles(blockPath);\n          if (mappings.tradelog) {\n            // Has a tradelog CSV but not yet synced - include with zero stats\n            blocks.push({\n              blockId,\n              name: blockId,\n              tradeCount: 0,\n              hasDailyLog: !!mappings.dailylog,\n              hasReportingLog: !!mappings.reportinglog,\n              dateRange: { start: null, end: null },\n              strategies: [],\n              totalPl: 0,\n              netPl: 0,\n            });\n          }\n        } catch {\n          // Can't read folder - skip\n        }\n      }\n    }\n\n    // Sort by name\n    blocks.sort((a, b) => a.name.localeCompare(b.name));\n\n    return blocks;\n  } catch (error) {\n    throw new Error(`Failed to list blocks: ${(error as Error).message}`);\n  }\n}\n\n/**\n * Normalize header names using column aliases\n */\nfunction normalizeRecordHeaders(\n  raw: Record<string, string>\n): Record<string, string> {\n  const normalized: Record<string, string> = { ...raw };\n  Object.entries(REPORTING_TRADE_COLUMN_ALIASES).forEach(\n    ([alias, canonical]) => {\n      if (normalized[alias] !== undefined) {\n        normalized[canonical] = normalized[alias];\n        delete normalized[alias];\n      }\n    }\n  );\n  return normalized;\n}\n\n/**\n * Convert raw CSV record to ReportingTrade object\n */\nexport function convertToReportingTrade(\n  raw: Record<string, string>\n): ReportingTrade | null {\n  // Check if this is a TAT format row\n  const keys = Object.keys(raw);\n  if (isTatFormat(keys)) {\n    return convertTatRowToReportingTrade(raw);\n  }\n\n  // Existing OO conversion logic below\n  try {\n    const normalized = normalizeRecordHeaders(raw);\n\n    const dateOpened = parseDatePreservingCalendarDay(normalized[\"Date Opened\"]);\n    if (isNaN(dateOpened.getTime())) return null;\n\n    const dateClosed = normalized[\"Date Closed\"]\n      ? parseDatePreservingCalendarDay(normalized[\"Date Closed\"])\n      : undefined;\n\n    const strategy = (normalized[\"Strategy\"] || \"\").trim() || \"Unknown\";\n\n    return {\n      strategy,\n      dateOpened,\n      timeOpened: normalized[\"Time Opened\"] || undefined,\n      openingPrice: parseNumber(normalized[\"Opening Price\"]),\n      legs: normalized[\"Legs\"] || \"\",\n      initialPremium: parseNumber(normalized[\"Initial Premium\"]),\n      numContracts: parseNumber(normalized[\"No. of Contracts\"], 1),\n      pl: parseNumber(normalized[\"P/L\"]),\n      closingPrice: normalized[\"Closing Price\"]\n        ? parseNumber(normalized[\"Closing Price\"])\n        : undefined,\n      dateClosed,\n      timeClosed: normalized[\"Time Closed\"] || undefined,\n      avgClosingCost: normalized[\"Avg. Closing Cost\"]\n        ? parseNumber(normalized[\"Avg. Closing Cost\"])\n        : undefined,\n      reasonForClose: normalized[\"Reason For Close\"] || undefined,\n    };\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Load reporting log (actual trades) from reportinglog CSV.\n * Uses csv-discovery header sniffing for file resolution.\n * @throws Error if reportinglog CSV does not exist\n */\nexport async function loadReportingLog(\n  baseDir: string,\n  blockId: string\n): Promise<ReportingTrade[]> {\n  const blockPath = path.join(baseDir, blockId);\n\n  // Discover CSV files via header sniffing\n  const { mappings } = await discoverCsvFiles(blockPath);\n  const filename = mappings.reportinglog || \"reportinglog.csv\";\n  const reportingLogPath = path.join(blockPath, filename);\n\n  // Check if file exists - throw if not\n  try {\n    await fs.access(reportingLogPath);\n  } catch {\n    throw new Error(`reportinglog.csv not found in block: ${blockId}`);\n  }\n\n  const content = await fs.readFile(reportingLogPath, \"utf-8\");\n  const records = parseCSV(content);\n\n  const trades: ReportingTrade[] = [];\n  for (const record of records) {\n    const trade = convertToReportingTrade(record);\n    if (trade) {\n      trades.push(trade);\n    }\n  }\n\n  // Sort by date\n  trades.sort(\n    (a, b) =>\n      new Date(a.dateOpened).getTime() - new Date(b.dateOpened).getTime()\n  );\n\n  return trades;\n}\n\n/**\n * Import CSV result\n */\nexport interface ImportCsvResult {\n  blockId: string;\n  name: string;\n  csvType: CsvType;\n  recordCount: number;\n  dateRange: {\n    start: string | null;\n    end: string | null;\n  };\n  strategies: string[];\n  blockPath: string;\n}\n\n/**\n * Import CSV options\n */\nexport interface ImportCsvOptions {\n  /** Absolute path to the CSV file */\n  csvPath: string;\n  /** Name for the block */\n  blockName: string;\n  /** Type of CSV data */\n  csvType?: \"tradelog\" | \"dailylog\" | \"reportinglog\";\n}\n\n/**\n * Convert a string to kebab-case for blockId\n */\nfunction toKebabCase(str: string): string {\n  return str\n    .replace(/([a-z])([A-Z])/g, \"$1-$2\") // camelCase to kebab-case\n    .replace(/[\\s_]+/g, \"-\") // spaces and underscores to hyphens\n    .replace(/[^a-zA-Z0-9-]/g, \"\") // remove special characters\n    .toLowerCase()\n    .replace(/-+/g, \"-\") // collapse multiple hyphens\n    .replace(/^-|-$/g, \"\"); // trim leading/trailing hyphens\n}\n\n/**\n * Validate CSV has required columns for the specified type\n */\nfunction validateCsvColumns(\n  records: Record<string, string>[],\n  csvType: \"tradelog\" | \"dailylog\" | \"reportinglog\"\n): { valid: boolean; error?: string } {\n  if (records.length === 0) {\n    return { valid: false, error: \"CSV file is empty or has no data rows\" };\n  }\n\n  const headers = Object.keys(records[0]);\n\n  switch (csvType) {\n    case \"tradelog\": {\n      // Required columns for trade log\n      const required = [\"Date Opened\", \"P/L\"];\n      const missing = required.filter((col) => !headers.includes(col));\n      if (missing.length > 0) {\n        return {\n          valid: false,\n          error: `Missing required columns for tradelog: ${missing.join(\", \")}. Expected columns include: Date Opened, P/L, Strategy, Legs, etc.`,\n        };\n      }\n      break;\n    }\n    case \"dailylog\": {\n      // Required columns for daily log\n      const required = [\"Date\", \"Net Liquidity\"];\n      const missing = required.filter((col) => !headers.includes(col));\n      if (missing.length > 0) {\n        return {\n          valid: false,\n          error: `Missing required columns for dailylog: ${missing.join(\", \")}. Expected columns include: Date, Net Liquidity, P/L, etc.`,\n        };\n      }\n      break;\n    }\n    case \"reportinglog\": {\n      // Check for TAT format first (has TradeID, ProfitLoss, BuyingPower)\n      if (isTatFormat(headers)) {\n        break; // TAT format is valid, skip OO column checks\n      }\n      // Required columns for OO reporting log (with aliases)\n      const dateOpenedAliases = [\"Date Opened\", \"date_opened\"];\n      const plAliases = [\"P/L\", \"pl\"];\n      const hasDateOpened = dateOpenedAliases.some((col) =>\n        headers.includes(col)\n      );\n      const hasPl = plAliases.some((col) => headers.includes(col));\n      const missing: string[] = [];\n      if (!hasDateOpened) missing.push(\"Date Opened\");\n      if (!hasPl) missing.push(\"P/L\");\n      if (missing.length > 0) {\n        return {\n          valid: false,\n          error: `Missing required columns for reportinglog: ${missing.join(\", \")}. Expected columns include: Date Opened (or date_opened), P/L (or pl), Strategy, etc.`,\n        };\n      }\n      break;\n    }\n  }\n\n  return { valid: true };\n}\n\n/**\n * Import a CSV file into the blocks directory\n *\n * Requires local filesystem access. The MCP server must be running locally\n * (via npx tradeblocks-mcp or mcpb desktop extension) to access files.\n *\n * @param baseDir - Base directory for blocks\n * @param options - Import options: csvPath, blockName, csvType\n * @returns Import result with block info\n */\nexport async function importCsv(\n  baseDir: string,\n  options: ImportCsvOptions\n): Promise<ImportCsvResult> {\n  const { csvPath, blockName } = options;\n  let { csvType = \"tradelog\" } = options;\n\n  // Validate source file exists\n  try {\n    await fs.access(csvPath);\n  } catch {\n    throw new Error(`CSV file not found: ${csvPath}`);\n  }\n\n  // Read and parse the CSV\n  const content = await fs.readFile(csvPath, \"utf-8\");\n  const records = parseCSV(content);\n\n  // Auto-detect TAT format: if csvType is default \"tradelog\" but headers\n  // match TAT signature, reclassify as \"reportinglog\"\n  if (csvType === \"tradelog\" && records.length > 0) {\n    const headers = Object.keys(records[0]);\n    if (isTatFormat(headers)) {\n      csvType = \"reportinglog\";\n    }\n  }\n\n  // Validate CSV has required columns\n  const validation = validateCsvColumns(records, csvType);\n  if (!validation.valid) {\n    throw new Error(validation.error);\n  }\n\n  // Convert blockName to kebab-case for blockId\n  const name = blockName;\n  const blockId = toKebabCase(name);\n\n  if (!blockId) {\n    throw new Error(\n      \"Could not derive a valid block ID from the filename or provided name\"\n    );\n  }\n\n  // Check if block already exists\n  const blockPath = path.join(baseDir, blockId);\n  try {\n    await fs.access(blockPath);\n    throw new Error(\n      `Block \"${blockId}\" already exists. Use a different blockName or delete the existing block first.`\n    );\n  } catch (error) {\n    // Directory doesn't exist - good, we can create it\n    if ((error as NodeJS.ErrnoException).code !== \"ENOENT\") {\n      throw error; // Re-throw if it's not a \"not found\" error\n    }\n  }\n\n  // Create block directory\n  await fs.mkdir(blockPath, { recursive: true });\n\n  // Determine target filename\n  const targetFilename =\n    csvType === \"tradelog\"\n      ? \"tradelog.csv\"\n      : csvType === \"dailylog\"\n        ? \"dailylog.csv\"\n        : \"reportinglog.csv\";\n\n  // Copy CSV to block directory\n  const targetPath = path.join(blockPath, targetFilename);\n  await fs.copyFile(csvPath, targetPath);\n\n  // Extract metadata for return value based on CSV type\n  let dateRange: { start: string | null; end: string | null } = {\n    start: null,\n    end: null,\n  };\n  let strategies: string[] = [];\n\n  if (csvType === \"tradelog\") {\n    // Parse trades to extract metadata\n    const trades: Trade[] = [];\n    for (const record of records) {\n      const trade = convertToTrade(record, blockName);\n      if (trade) trades.push(trade);\n    }\n\n    if (trades.length > 0) {\n      const dates = trades.map((t) => new Date(t.dateOpened).getTime());\n      dateRange = {\n        start: new Date(Math.min(...dates)).toISOString(),\n        end: new Date(Math.max(...dates)).toISOString(),\n      };\n      strategies = Array.from(new Set(trades.map((t) => t.strategy))).sort();\n    }\n  } else if (csvType === \"dailylog\") {\n    // Parse daily logs to extract date range\n    const entries: DailyLogEntry[] = [];\n    for (const record of records) {\n      const entry = convertToDailyLogEntry(record, blockId);\n      if (entry) entries.push(entry);\n    }\n\n    if (entries.length > 0) {\n      const dates = entries.map((e) => new Date(e.date).getTime());\n      dateRange = {\n        start: new Date(Math.min(...dates)).toISOString(),\n        end: new Date(Math.max(...dates)).toISOString(),\n      };\n    }\n  } else if (csvType === \"reportinglog\") {\n    // Parse reporting trades to extract metadata\n    const trades: ReportingTrade[] = [];\n    for (const record of records) {\n      const trade = convertToReportingTrade(record);\n      if (trade) trades.push(trade);\n    }\n\n    if (trades.length > 0) {\n      const dates = trades.map((t) => new Date(t.dateOpened).getTime());\n      dateRange = {\n        start: new Date(Math.min(...dates)).toISOString(),\n        end: new Date(Math.max(...dates)).toISOString(),\n      };\n      strategies = Array.from(new Set(trades.map((t) => t.strategy))).sort();\n    }\n  }\n\n  return {\n    blockId,\n    name,\n    csvType,\n    recordCount: records.length,\n    dateRange,\n    strategies,\n    blockPath,\n  };\n}\n","import _extends from \"@babel/runtime/helpers/extends\";\nimport { DEFAULT_CONFIG } from '../core/config.js';\nimport { MATRIX_OPTIONS, NUMBER_OPTIONS } from '../core/function/config.js';\n\n// create a read-only version of config\nexport var config = function config(options) {\n  if (options) {\n    throw new Error('The global config is readonly. \\n' + 'Please create a mathjs instance if you want to change the default configuration. \\n' + 'Example:\\n' + '\\n' + '  import { create, all } from \\'mathjs\\';\\n' + '  const mathjs = create(all);\\n' + '  mathjs.config({ number: \\'BigNumber\\' });\\n');\n  }\n  return Object.freeze(DEFAULT_CONFIG);\n};\n_extends(config, DEFAULT_CONFIG, {\n  MATRIX_OPTIONS,\n  NUMBER_OPTIONS\n});","export var DEFAULT_CONFIG = {\n  // minimum relative difference between two compared values,\n  // used by all comparison functions\n  relTol: 1e-12,\n  // minimum absolute difference between two compared values,\n  // used by all comparison functions\n  absTol: 1e-15,\n  // type of default matrix output. Choose 'matrix' (default) or 'array'\n  matrix: 'Matrix',\n  // type of default number output. Choose 'number' (default) 'BigNumber', 'bigint', or 'Fraction'\n  number: 'number',\n  // type of fallback used for config { number: 'bigint' } when a value cannot be represented\n  // in the configured numeric type. Choose 'number' (default) or 'BigNumber'.\n  numberFallback: 'number',\n  // number of significant digits in BigNumbers\n  precision: 64,\n  // predictable output type of functions. When true, output type depends only\n  // on the input types. When false (default), output type can vary depending\n  // on input values. For example `math.sqrt(-4)` returns `complex('2i')` when\n  // predictable is false, and returns `NaN` when true.\n  predictable: false,\n  // random seed for seeded pseudo random number generation\n  // null = randomly seed\n  randomSeed: null,\n  // legacy behavior for matrix subset. When true, the subset function\n  // returns a matrix or array with the same size as the index (except for scalars).\n  // When false, it returns a matrix or array with a size depending on the type of index.\n  legacySubset: false\n};","import { hasOwnProperty } from './object.js';\n\n/**\n * Get a property of a plain object\n * Throws an error in case the object is not a plain object or the\n * property is not defined on the object itself\n * @param {Object} object\n * @param {string} prop\n * @return {*} Returns the property value when safe\n */\nfunction getSafeProperty(object, prop) {\n  // only allow getting safe properties of a plain object\n  if (isSafeProperty(object, prop)) {\n    return object[prop];\n  }\n  if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {\n    throw new Error('Cannot access method \"' + prop + '\" as a property');\n  }\n  throw new Error('No access to property \"' + prop + '\"');\n}\n\n/**\n * Set a property on a plain object.\n * Throws an error in case the object is not a plain object or the\n * property would override an inherited property like .constructor or .toString\n * @param {Object} object\n * @param {string} prop\n * @param {*} value\n * @return {*} Returns the value\n */\n// TODO: merge this function into access.js?\nfunction setSafeProperty(object, prop, value) {\n  // only allow setting safe properties of a plain object\n  if (isSafeProperty(object, prop)) {\n    object[prop] = value;\n    return value;\n  }\n  throw new Error('No access to property \"' + prop + '\"');\n}\n\n/**\n * Test whether a property is safe to use on an object or Array.\n * For example .toString and .constructor are not safe\n * @param {Object | Array} object\n * @param {string} prop\n * @return {boolean} Returns true when safe\n */\nfunction isSafeProperty(object, prop) {\n  if (!isPlainObject(object) && !Array.isArray(object)) {\n    return false;\n  }\n  // SAFE: whitelisted\n  // e.g length\n  if (hasOwnProperty(safeNativeProperties, prop)) {\n    return true;\n  }\n  // UNSAFE: inherited from Object prototype\n  // e.g constructor\n  if (prop in Object.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Object.prototype is a root object\n    return false;\n  }\n  // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n  if (prop in Function.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Function.prototype is a root object\n    return false;\n  }\n  return true;\n}\n\n/**\n * Validate whether a method is safe.\n * Throws an error when that's not the case.\n * @param {Object} object\n * @param {string} method\n * @return {function} Returns the method when valid\n */\nfunction getSafeMethod(object, method) {\n  if (!isSafeMethod(object, method)) {\n    throw new Error('No access to method \"' + method + '\"');\n  }\n  return object[method];\n}\n\n/**\n * Check whether a method is safe.\n * Throws an error when that's not the case (for example for `constructor`).\n * @param {Object} object\n * @param {string} method\n * @return {boolean} Returns true when safe, false otherwise\n */\nfunction isSafeMethod(object, method) {\n  if (object === null || object === undefined || typeof object[method] !== 'function') {\n    return false;\n  }\n  // UNSAFE: ghosted\n  // e.g overridden toString\n  // Note that IE10 doesn't support __proto__ and we can't do this check there.\n  if (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {\n    return false;\n  }\n  // SAFE: whitelisted\n  // e.g toString\n  if (hasOwnProperty(safeNativeMethods, method)) {\n    return true;\n  }\n  // UNSAFE: inherited from Object prototype\n  // e.g constructor\n  if (method in Object.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Object.prototype is a root object\n    return false;\n  }\n  // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n  if (method in Function.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Function.prototype is a root object\n    return false;\n  }\n  return true;\n}\nfunction isPlainObject(object) {\n  return typeof object === 'object' && object && object.constructor === Object;\n}\nvar safeNativeProperties = {\n  length: true,\n  name: true\n};\nvar safeNativeMethods = {\n  toString: true,\n  valueOf: true,\n  toLocaleString: true\n};\nexport { getSafeProperty };\nexport { setSafeProperty };\nexport { isSafeProperty };\nexport { getSafeMethod };\nexport { isSafeMethod };\nexport { isPlainObject };","import { getSafeProperty, isSafeProperty, setSafeProperty } from './customs.js';\nimport { isMap, isObject } from './is.js';\n\n/**\n * A map facade on a bare object.\n *\n * The small number of methods needed to implement a scope,\n * forwarding on to the SafeProperty functions. Over time, the codebase\n * will stop using this method, as all objects will be Maps, rather than\n * more security prone objects.\n */\nexport class ObjectWrappingMap {\n  constructor(object) {\n    this.wrappedObject = object;\n    this[Symbol.iterator] = this.entries;\n  }\n  keys() {\n    return Object.keys(this.wrappedObject).filter(key => this.has(key)).values();\n  }\n  get(key) {\n    return getSafeProperty(this.wrappedObject, key);\n  }\n  set(key, value) {\n    setSafeProperty(this.wrappedObject, key, value);\n    return this;\n  }\n  has(key) {\n    return isSafeProperty(this.wrappedObject, key) && key in this.wrappedObject;\n  }\n  entries() {\n    return mapIterator(this.keys(), key => [key, this.get(key)]);\n  }\n  forEach(callback) {\n    for (var key of this.keys()) {\n      callback(this.get(key), key, this);\n    }\n  }\n  delete(key) {\n    if (isSafeProperty(this.wrappedObject, key)) {\n      delete this.wrappedObject[key];\n    }\n  }\n  clear() {\n    for (var key of this.keys()) {\n      this.delete(key);\n    }\n  }\n  get size() {\n    return Object.keys(this.wrappedObject).length;\n  }\n}\n\n/**\n * Create a map with two partitions: a and b.\n * The set with bKeys determines which keys/values are read/written to map b,\n * all other values are read/written to map a\n *\n * For example:\n *\n *   const a = new Map()\n *   const b = new Map()\n *   const p = new PartitionedMap(a, b, new Set(['x', 'y']))\n *\n * In this case, values `x` and `y` are read/written to map `b`,\n * all other values are read/written to map `a`.\n */\nexport class PartitionedMap {\n  /**\n   * @param {Map} a\n   * @param {Map} b\n   * @param {Set} bKeys\n   */\n  constructor(a, b, bKeys) {\n    this.a = a;\n    this.b = b;\n    this.bKeys = bKeys;\n    this[Symbol.iterator] = this.entries;\n  }\n  get(key) {\n    return this.bKeys.has(key) ? this.b.get(key) : this.a.get(key);\n  }\n  set(key, value) {\n    if (this.bKeys.has(key)) {\n      this.b.set(key, value);\n    } else {\n      this.a.set(key, value);\n    }\n    return this;\n  }\n  has(key) {\n    return this.b.has(key) || this.a.has(key);\n  }\n  keys() {\n    return new Set([...this.a.keys(), ...this.b.keys()])[Symbol.iterator]();\n  }\n  entries() {\n    return mapIterator(this.keys(), key => [key, this.get(key)]);\n  }\n  forEach(callback) {\n    for (var key of this.keys()) {\n      callback(this.get(key), key, this);\n    }\n  }\n  delete(key) {\n    return this.bKeys.has(key) ? this.b.delete(key) : this.a.delete(key);\n  }\n  clear() {\n    this.a.clear();\n    this.b.clear();\n  }\n  get size() {\n    return [...this.keys()].length;\n  }\n}\n\n/**\n * Create a new iterator that maps over the provided iterator, applying a mapping function to each item\n */\nfunction mapIterator(it, callback) {\n  return {\n    next: () => {\n      var n = it.next();\n      return n.done ? n : {\n        value: callback(n.value),\n        done: false\n      };\n    }\n  };\n}\n\n/**\n * Creates an empty map, or whatever your platform's polyfill is.\n *\n * @returns an empty Map or Map like object.\n */\nexport function createEmptyMap() {\n  return new Map();\n}\n\n/**\n * Creates a Map from the given object.\n *\n * @param { Map | { [key: string]: unknown } | undefined } mapOrObject\n * @returns\n */\nexport function createMap(mapOrObject) {\n  if (!mapOrObject) {\n    return createEmptyMap();\n  }\n  if (isMap(mapOrObject)) {\n    return mapOrObject;\n  }\n  if (isObject(mapOrObject)) {\n    return new ObjectWrappingMap(mapOrObject);\n  }\n  throw new Error('createMap can create maps from objects or Maps');\n}\n\n/**\n * Unwraps a map into an object.\n *\n * @param {Map} map\n * @returns { [key: string]: unknown }\n */\nexport function toObject(map) {\n  if (map instanceof ObjectWrappingMap) {\n    return map.wrappedObject;\n  }\n  var object = {};\n  for (var key of map.keys()) {\n    var value = map.get(key);\n    setSafeProperty(object, key, value);\n  }\n  return object;\n}\n\n/**\n * Copies the contents of key-value pairs from each `objects` in to `map`.\n *\n * Object is `objects` can be a `Map` or object.\n *\n * This is the `Map` analog to `Object.assign`.\n */\nexport function assign(map) {\n  for (var _len = arguments.length, objects = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    objects[_key - 1] = arguments[_key];\n  }\n  for (var args of objects) {\n    if (!args) {\n      continue;\n    }\n    if (isMap(args)) {\n      for (var key of args.keys()) {\n        map.set(key, args.get(key));\n      }\n    } else if (isObject(args)) {\n      for (var _key2 of Object.keys(args)) {\n        map.set(_key2, args[_key2]);\n      }\n    }\n  }\n  return map;\n}","// type checks for all known types\n//\n// note that:\n//\n// - check by duck-typing on a property like `isUnit`, instead of checking instanceof.\n//   instanceof cannot be used because that would not allow to pass data from\n//   one instance of math.js to another since each has it's own instance of Unit.\n// - check the `isUnit` property via the constructor, so there will be no\n//   matches for \"fake\" instances like plain objects with a property `isUnit`.\n//   That is important for security reasons.\n// - It must not be possible to override the type checks used internally,\n//   for security reasons, so these functions are not exposed in the expression\n//   parser.\n\nimport { ObjectWrappingMap } from './map.js';\nexport function isNumber(x) {\n  return typeof x === 'number';\n}\nexport function isBigNumber(x) {\n  if (!x || typeof x !== 'object' || typeof x.constructor !== 'function') {\n    return false;\n  }\n  if (x.isBigNumber === true && typeof x.constructor.prototype === 'object' && x.constructor.prototype.isBigNumber === true) {\n    return true;\n  }\n  if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {\n    return true;\n  }\n  return false;\n}\nexport function isBigInt(x) {\n  return typeof x === 'bigint';\n}\nexport function isComplex(x) {\n  return x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true || false;\n}\nexport function isFraction(x) {\n  return x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true || false;\n}\nexport function isUnit(x) {\n  return x && x.constructor.prototype.isUnit === true || false;\n}\nexport function isString(x) {\n  return typeof x === 'string';\n}\nexport var isArray = Array.isArray;\nexport function isMatrix(x) {\n  return x && x.constructor.prototype.isMatrix === true || false;\n}\n\n/**\n * Test whether a value is a collection: an Array or Matrix\n * @param {*} x\n * @returns {boolean} isCollection\n */\nexport function isCollection(x) {\n  return Array.isArray(x) || isMatrix(x);\n}\nexport function isDenseMatrix(x) {\n  return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isSparseMatrix(x) {\n  return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isRange(x) {\n  return x && x.constructor.prototype.isRange === true || false;\n}\nexport function isIndex(x) {\n  return x && x.constructor.prototype.isIndex === true || false;\n}\nexport function isBoolean(x) {\n  return typeof x === 'boolean';\n}\nexport function isResultSet(x) {\n  return x && x.constructor.prototype.isResultSet === true || false;\n}\nexport function isHelp(x) {\n  return x && x.constructor.prototype.isHelp === true || false;\n}\nexport function isFunction(x) {\n  return typeof x === 'function';\n}\nexport function isDate(x) {\n  return x instanceof Date;\n}\nexport function isRegExp(x) {\n  return x instanceof RegExp;\n}\nexport function isObject(x) {\n  return !!(x && typeof x === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));\n}\n\n/**\n * Returns `true` if the passed object appears to be a Map (i.e. duck typing).\n *\n * Methods looked for are `get`, `set`, `keys` and `has`.\n *\n * @param {Map | object} object\n * @returns\n */\nexport function isMap(object) {\n  // We can use the fast instanceof, or a slower duck typing check.\n  // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.\n  if (!object) {\n    return false;\n  }\n  return object instanceof Map || object instanceof ObjectWrappingMap || typeof object.set === 'function' && typeof object.get === 'function' && typeof object.keys === 'function' && typeof object.has === 'function';\n}\nexport function isPartitionedMap(object) {\n  return isMap(object) && isMap(object.a) && isMap(object.b);\n}\nexport function isObjectWrappingMap(object) {\n  return isMap(object) && isObject(object.wrappedObject);\n}\nexport function isNull(x) {\n  return x === null;\n}\nexport function isUndefined(x) {\n  return x === undefined;\n}\nexport function isAccessorNode(x) {\n  return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isArrayNode(x) {\n  return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isAssignmentNode(x) {\n  return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isBlockNode(x) {\n  return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConditionalNode(x) {\n  return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConstantNode(x) {\n  return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;\n}\n\n/* Very specialized: returns true for those nodes which in the numerator of\n   a fraction means that the division in that fraction has precedence over implicit\n   multiplication, e.g. -2/3 x parses as (-2/3) x and 3/4 x parses as (3/4) x but\n   6!/8 x parses as 6! / (8x). It is located here because it is shared between\n   parse.js and OperatorNode.js (for parsing and printing, respectively).\n\n   This should *not* be exported from mathjs, unlike most of the tests here.\n   Its name does not start with 'is' to prevent utils/snapshot.js from thinking\n   it should be exported.\n*/\nexport function rule2Node(node) {\n  return isConstantNode(node) || isOperatorNode(node) && node.args.length === 1 && isConstantNode(node.args[0]) && '-+~'.includes(node.op);\n}\nexport function isFunctionAssignmentNode(x) {\n  return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isFunctionNode(x) {\n  return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isIndexNode(x) {\n  return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isNode(x) {\n  return x && x.isNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isObjectNode(x) {\n  return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isOperatorNode(x) {\n  return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isParenthesisNode(x) {\n  return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRangeNode(x) {\n  return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRelationalNode(x) {\n  return x && x.isRelationalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isSymbolNode(x) {\n  return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isChain(x) {\n  return x && x.constructor.prototype.isChain === true || false;\n}\nexport function typeOf(x) {\n  var t = typeof x;\n  if (t === 'object') {\n    if (x === null) return 'null';\n    if (isBigNumber(x)) return 'BigNumber'; // Special: weird mashup with Decimal\n    if (x.constructor && x.constructor.name) return x.constructor.name;\n    return 'Object'; // just in case\n  }\n  return t; // can be 'string', 'number', 'boolean', 'function', 'bigint', ...\n}","import { isBigNumber, isObject } from './is.js';\n\n/**\n * Clone an object\n *\n *     clone(x)\n *\n * Can clone any primitive type, array, and object.\n * If x has a function clone, this function will be invoked to clone the object.\n *\n * @param {*} x\n * @return {*} clone\n */\nexport function clone(x) {\n  var type = typeof x;\n\n  // immutable primitive types\n  if (type === 'number' || type === 'bigint' || type === 'string' || type === 'boolean' || x === null || x === undefined) {\n    return x;\n  }\n\n  // use clone function of the object when available\n  if (typeof x.clone === 'function') {\n    return x.clone();\n  }\n\n  // array\n  if (Array.isArray(x)) {\n    return x.map(function (value) {\n      return clone(value);\n    });\n  }\n  if (x instanceof Date) return new Date(x.valueOf());\n  if (isBigNumber(x)) return x; // bignumbers are immutable\n\n  // object\n  if (isObject(x)) {\n    return mapObject(x, clone);\n  }\n  if (type === 'function') {\n    // we assume that the function is immutable\n    return x;\n  }\n  throw new TypeError(\"Cannot clone: unknown type of value (value: \".concat(x, \")\"));\n}\n\n/**\n * Apply map to all properties of an object\n * @param {Object} object\n * @param {function} callback\n * @return {Object} Returns a copy of the object with mapped properties\n */\nexport function mapObject(object, callback) {\n  var clone = {};\n  for (var key in object) {\n    if (hasOwnProperty(object, key)) {\n      clone[key] = callback(object[key]);\n    }\n  }\n  return clone;\n}\n\n/**\n * Extend object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @return {Object} a\n */\nexport function extend(a, b) {\n  for (var prop in b) {\n    if (hasOwnProperty(b, prop)) {\n      a[prop] = b[prop];\n    }\n  }\n  return a;\n}\n\n/**\n * Deep extend an object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @returns {Object}\n */\nexport function deepExtend(a, b) {\n  // TODO: add support for Arrays to deepExtend\n  if (Array.isArray(b)) {\n    throw new TypeError('Arrays are not supported by deepExtend');\n  }\n  for (var prop in b) {\n    // We check against prop not being in Object.prototype or Function.prototype\n    // to prevent polluting for example Object.__proto__.\n    if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {\n      if (b[prop] && b[prop].constructor === Object) {\n        if (a[prop] === undefined) {\n          a[prop] = {};\n        }\n        if (a[prop] && a[prop].constructor === Object) {\n          deepExtend(a[prop], b[prop]);\n        } else {\n          a[prop] = b[prop];\n        }\n      } else if (Array.isArray(b[prop])) {\n        throw new TypeError('Arrays are not supported by deepExtend');\n      } else {\n        a[prop] = b[prop];\n      }\n    }\n  }\n  return a;\n}\n\n/**\n * Deep test equality of all fields in two pairs of arrays or objects.\n * Compares values and functions strictly (ie. 2 is not the same as '2').\n * @param {Array | Object} a\n * @param {Array | Object} b\n * @returns {boolean}\n */\nexport function deepStrictEqual(a, b) {\n  var prop, i, len;\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b)) {\n      return false;\n    }\n    if (a.length !== b.length) {\n      return false;\n    }\n    for (i = 0, len = a.length; i < len; i++) {\n      if (!deepStrictEqual(a[i], b[i])) {\n        return false;\n      }\n    }\n    return true;\n  } else if (typeof a === 'function') {\n    return a === b;\n  } else if (a instanceof Object) {\n    if (Array.isArray(b) || !(b instanceof Object)) {\n      return false;\n    }\n    for (prop in a) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {\n        return false;\n      }\n    }\n    for (prop in b) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in a)) {\n        return false;\n      }\n    }\n    return true;\n  } else {\n    return a === b;\n  }\n}\n\n/**\n * Recursively flatten a nested object.\n * @param {Object} nestedObject\n * @return {Object} Returns the flattened object\n */\nexport function deepFlatten(nestedObject) {\n  var flattenedObject = {};\n  _deepFlatten(nestedObject, flattenedObject);\n  return flattenedObject;\n}\n\n// helper function used by deepFlatten\nfunction _deepFlatten(nestedObject, flattenedObject) {\n  for (var prop in nestedObject) {\n    if (hasOwnProperty(nestedObject, prop)) {\n      var value = nestedObject[prop];\n      if (typeof value === 'object' && value !== null) {\n        _deepFlatten(value, flattenedObject);\n      } else {\n        flattenedObject[prop] = value;\n      }\n    }\n  }\n}\n\n/**\n * Test whether the current JavaScript engine supports Object.defineProperty\n * @returns {boolean} returns true if supported\n */\nexport function canDefineProperty() {\n  // test needed for broken IE8 implementation\n  try {\n    if (Object.defineProperty) {\n      Object.defineProperty({}, 'x', {\n        get: function get() {\n          return null;\n        }\n      });\n      return true;\n    }\n  } catch (e) {}\n  return false;\n}\n\n/**\n * Attach a lazy loading property to a constant.\n * The given function `fn` is called once when the property is first requested.\n *\n * @param {Object} object         Object where to add the property\n * @param {string} prop           Property name\n * @param {Function} valueResolver Function returning the property value. Called\n *                                without arguments.\n */\nexport function lazy(object, prop, valueResolver) {\n  var _uninitialized = true;\n  var _value;\n  Object.defineProperty(object, prop, {\n    get: function get() {\n      if (_uninitialized) {\n        _value = valueResolver();\n        _uninitialized = false;\n      }\n      return _value;\n    },\n    set: function set(value) {\n      _value = value;\n      _uninitialized = false;\n    },\n    configurable: true,\n    enumerable: true\n  });\n}\n\n/**\n * Traverse a path into an object.\n * When a namespace is missing, it will be created\n * @param {Object} object\n * @param {string | string[]} path   A dot separated string like 'name.space'\n * @return {Object} Returns the object at the end of the path\n */\nexport function traverse(object, path) {\n  if (path && typeof path === 'string') {\n    return traverse(object, path.split('.'));\n  }\n  var obj = object;\n  if (path) {\n    for (var i = 0; i < path.length; i++) {\n      var key = path[i];\n      if (!(key in obj)) {\n        obj[key] = {};\n      }\n      obj = obj[key];\n    }\n  }\n  return obj;\n}\n\n/**\n * A safe hasOwnProperty\n * @param {Object} object\n * @param {string} property\n */\nexport function hasOwnProperty(object, property) {\n  return object && Object.hasOwnProperty.call(object, property);\n}\n\n/**\n * Test whether an object is a factory. a factory has fields:\n *\n * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object])   (required)\n * - name: string (optional)\n * - path: string    A dot separated path (optional)\n * - math: boolean   If true (false by default), the math namespace is passed\n *                   as fifth argument of the factory function\n *\n * @param {*} object\n * @returns {boolean}\n */\nexport function isLegacyFactory(object) {\n  return object && typeof object.factory === 'function';\n}\n\n/**\n * Get a nested property from an object\n * @param {Object} object\n * @param {string | string[]} path\n * @returns {Object}\n */\nexport function get(object, path) {\n  if (typeof path === 'string') {\n    if (isPath(path)) {\n      return get(object, path.split('.'));\n    } else {\n      return object[path];\n    }\n  }\n  var child = object;\n  for (var i = 0; i < path.length; i++) {\n    var key = path[i];\n    child = child ? child[key] : undefined;\n  }\n  return child;\n}\n\n/**\n * Set a nested property in an object\n * Mutates the object itself\n * If the path doesn't exist, it will be created\n * @param {Object} object\n * @param {string | string[]} path\n * @param {*} value\n * @returns {Object}\n */\nexport function set(object, path, value) {\n  if (typeof path === 'string') {\n    if (isPath(path)) {\n      return set(object, path.split('.'), value);\n    } else {\n      object[path] = value;\n      return object;\n    }\n  }\n  var child = object;\n  for (var i = 0; i < path.length - 1; i++) {\n    var key = path[i];\n    if (child[key] === undefined) {\n      child[key] = {};\n    }\n    child = child[key];\n  }\n  if (path.length > 0) {\n    var lastKey = path[path.length - 1];\n    child[lastKey] = value;\n  }\n  return object;\n}\n\n/**\n * Create an object composed of the picked object properties\n * @param {Object} object\n * @param {string[]} properties\n * @param {function} [transform] Optional value to transform a value when picking it\n * @return {Object}\n */\nexport function pick(object, properties, transform) {\n  var copy = {};\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = get(object, key);\n    if (value !== undefined) {\n      set(copy, key, transform ? transform(value, key) : value);\n    }\n  }\n  return copy;\n}\n\n/**\n * Shallow version of pick, creating an object composed of the picked object properties\n * but not for nested properties\n * @param {Object} object\n * @param {string[]} properties\n * @return {Object}\n */\nexport function pickShallow(object, properties) {\n  var copy = {};\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = object[key];\n    if (value !== undefined) {\n      copy[key] = value;\n    }\n  }\n  return copy;\n}\n\n// helper function to test whether a string contains a path like 'user.name'\nfunction isPath(str) {\n  return str.includes('.');\n}","import { clone, deepExtend } from '../../utils/object.js';\nimport { DEFAULT_CONFIG } from '../config.js';\nexport var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix\nexport var NUMBER_OPTIONS = ['number', 'BigNumber', 'bigint', 'Fraction']; // valid values for option number\n\nexport function configFactory(config, emit) {\n  /**\n   * Set configuration options for math.js, and get current options.\n   * Will emit a 'config' event, with arguments (curr, prev, changes).\n   *\n   * This function is only available on a mathjs instance created using `create`.\n   *\n   * Syntax:\n   *\n   *     math.config(config: Object): Object\n   *\n   * Examples:\n   *\n   *     import { create, all } from 'mathjs'\n   *\n   *     // create a mathjs instance\n   *     const math = create(all)\n   *\n   *     math.config().number                // outputs 'number'\n   *     math.evaluate('0.4')                // outputs number 0.4\n   *     math.config({number: 'Fraction'})\n   *     math.evaluate('0.4')                // outputs Fraction 2/5\n   *\n   * @param {Object} [options] Available options:\n   *                            {number} relTol\n   *                              Minimum relative difference between two\n   *                              compared values, used by all comparison functions.\n   *                            {number} absTol\n   *                              Minimum absolute difference between two\n   *                              compared values, used by all comparison functions.\n   *                            {string} matrix\n   *                              A string 'Matrix' (default) or 'Array'.\n   *                            {string} number\n   *                              A string 'number' (default), 'BigNumber', 'bigint', or 'Fraction'\n   *                            {number} precision\n   *                              The number of significant digits for BigNumbers.\n   *                              Not applicable for Numbers.\n   *                            {string} parenthesis\n   *                              How to display parentheses in LaTeX and string\n   *                              output.\n   *                            {string} randomSeed\n   *                              Random seed for seeded pseudo random number generator.\n   *                              Set to null to randomly seed.\n   * @return {Object} Returns the current configuration\n   */\n  function _config(options) {\n    if (options) {\n      if (options.epsilon !== undefined) {\n        // this if is only for backwards compatibility, it can be removed in the future.\n        console.warn('Warning: The configuration option \"epsilon\" is deprecated. Use \"relTol\" and \"absTol\" instead.');\n        var optionsFix = clone(options);\n        optionsFix.relTol = options.epsilon;\n        optionsFix.absTol = options.epsilon * 1e-3;\n        delete optionsFix.epsilon;\n        return _config(optionsFix);\n      }\n      if (options.legacySubset === true) {\n        // this if is only for backwards compatibility, it can be removed in the future.\n        console.warn('Warning: The configuration option \"legacySubset\" is for compatibility only and might be deprecated in the future.');\n      }\n      var prev = clone(config);\n\n      // validate some of the options\n      validateOption(options, 'matrix', MATRIX_OPTIONS);\n      validateOption(options, 'number', NUMBER_OPTIONS);\n\n      // merge options\n      deepExtend(config, options);\n      var curr = clone(config);\n      var changes = clone(options);\n\n      // emit 'config' event\n      emit('config', curr, prev, changes);\n      return curr;\n    } else {\n      return clone(config);\n    }\n  }\n\n  // attach the valid options to the function so they can be extended\n  _config.MATRIX_OPTIONS = MATRIX_OPTIONS;\n  _config.NUMBER_OPTIONS = NUMBER_OPTIONS;\n\n  // attach the config properties as readonly properties to the config function\n  Object.keys(DEFAULT_CONFIG).forEach(key => {\n    Object.defineProperty(_config, key, {\n      get: () => config[key],\n      enumerable: true,\n      configurable: true\n    });\n  });\n  return _config;\n}\n\n/**\n * Validate an option\n * @param {Object} options         Object with options\n * @param {string} name            Name of the option to validate\n * @param {Array.<string>} values  Array with valid values for this option\n */\nfunction validateOption(options, name, values) {\n  if (options[name] !== undefined && !values.includes(options[name])) {\n    // unknown value\n    console.warn('Warning: Unknown value \"' + options[name] + '\" for configuration option \"' + name + '\". ' + 'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.');\n  }\n}","function ok () {\n  return true\n}\n\nfunction notOk () {\n  return false\n}\n\nfunction undef () {\n  return undefined\n}\n\nconst NOT_TYPED_FUNCTION = 'Argument is not a typed-function.'\n\n/**\n * @typedef {{\n *   params: Param[],\n *   fn: function,\n *   test: function,\n *   implementation: function\n * }} Signature\n *\n * @typedef {{\n *   types: Type[],\n *   hasAny: boolean,\n *   hasConversion: boolean,\n *   restParam: boolean\n * }} Param\n *\n * @typedef {{\n *   name: string,\n *   typeIndex: number,\n *   test: function,\n *   isAny: boolean,\n *   conversion?: ConversionDef,\n *   conversionIndex: number,\n * }} Type\n *\n * @typedef {{\n *   from: string,\n *   to: string,\n *   convert: function (*) : *\n * }} ConversionDef\n *\n * @typedef {{\n *   name: string,\n *   test: function(*) : boolean,\n *   isAny?: boolean\n * }} TypeDef\n */\n\n/**\n * @returns {() => function}\n */\nfunction create () {\n  // data type tests\n\n  /**\n   * Returns true if the argument is a non-null \"plain\" object\n   */\n  function isPlainObject (x) {\n    return typeof x === 'object' && x !== null && x.constructor === Object\n  }\n\n  const _types = [\n    { name: 'number', test: function (x) { return typeof x === 'number' } },\n    { name: 'string', test: function (x) { return typeof x === 'string' } },\n    { name: 'boolean', test: function (x) { return typeof x === 'boolean' } },\n    { name: 'Function', test: function (x) { return typeof x === 'function' } },\n    { name: 'Array', test: Array.isArray },\n    { name: 'Date', test: function (x) { return x instanceof Date } },\n    { name: 'RegExp', test: function (x) { return x instanceof RegExp } },\n    { name: 'Object', test: isPlainObject },\n    { name: 'null', test: function (x) { return x === null } },\n    { name: 'undefined', test: function (x) { return x === undefined } }\n  ]\n\n  const anyType = {\n    name: 'any',\n    test: ok,\n    isAny: true\n  }\n\n  // Data structures to track the types. As these are local variables in\n  // create(), each typed universe will get its own copy, but the variables\n  // will only be accessible through the (closures of the) functions supplied\n  // as properties of the typed object, not directly.\n  // These will be initialized in clear() below\n  let typeMap // primary store of all types\n  let typeList // Array of just type names, for the sake of ordering\n\n  // And similar data structures for the type conversions:\n  let nConversions = 0\n  // the actual conversions are stored on a property of the destination types\n\n  // This is a temporary object, will be replaced with a function at the end\n  let typed = { createCount: 0 }\n\n  /**\n   * Takes a type name and returns the corresponding official type object\n   * for that type.\n   *\n   * @param {string} typeName\n   * @returns {TypeDef} type\n   */\n  function findType (typeName) {\n    const type = typeMap.get(typeName)\n    if (type) {\n      return type\n    }\n    // Remainder is error handling\n    let message = 'Unknown type \"' + typeName + '\"'\n    const name = typeName.toLowerCase()\n    let otherName\n    for (otherName of typeList) {\n      if (otherName.toLowerCase() === name) {\n        message += '. Did you mean \"' + otherName + '\" ?'\n        break\n      }\n    }\n    throw new TypeError(message)\n  }\n\n  /**\n   * Adds an array `types` of type definitions to this typed instance.\n   * Each type definition should be an object with properties:\n   * 'name' - a string giving the name of the type; 'test' - function\n   * returning a boolean that tests membership in the type; and optionally\n   * 'isAny' - true only for the 'any' type.\n   *\n   * The second optional argument, `before`, gives the name of a type that\n   * these types should be added before. The new types are added in the\n   * order specified.\n   * @param {TypeDef[]} types\n   * @param {string | boolean} [beforeSpec='any'] before\n   */\n  function addTypes (types, beforeSpec = 'any') {\n    const beforeIndex = beforeSpec\n      ? findType(beforeSpec).index\n      : typeList.length\n    const newTypes = []\n    for (let i = 0; i < types.length; ++i) {\n      if (!types[i] || typeof types[i].name !== 'string' ||\n        typeof types[i].test !== 'function') {\n        throw new TypeError('Object with properties {name: string, test: function} expected')\n      }\n      const typeName = types[i].name\n      if (typeMap.has(typeName)) {\n        throw new TypeError('Duplicate type name \"' + typeName + '\"')\n      }\n      newTypes.push(typeName)\n      typeMap.set(typeName, {\n        name: typeName,\n        test: types[i].test,\n        isAny: types[i].isAny,\n        index: beforeIndex + i,\n        conversionsTo: [] // Newly added type can't have any conversions to it\n      })\n    }\n    // update the typeList\n    const affectedTypes = typeList.slice(beforeIndex)\n    typeList =\n      typeList.slice(0, beforeIndex).concat(newTypes).concat(affectedTypes)\n    // Fix the indices\n    for (let i = beforeIndex + newTypes.length; i < typeList.length; ++i) {\n      typeMap.get(typeList[i]).index = i\n    }\n  }\n\n  /**\n   * Removes all types and conversions from this typed instance.\n   * May cause previously constructed typed-functions to throw\n   * strange errors when they are called with types that do not\n   * match any of their signatures.\n   */\n  function clear () {\n    typeMap = new Map()\n    typeList = []\n    nConversions = 0\n    addTypes([anyType], false)\n  }\n\n  // initialize the types to the default list\n  clear()\n  addTypes(_types)\n\n  /**\n   * Removes all conversions, leaving the types alone.\n   */\n  function clearConversions () {\n    let typeName\n    for (typeName of typeList) {\n      typeMap.get(typeName).conversionsTo = []\n    }\n    nConversions = 0\n  }\n\n  /**\n   * Find the type names that match a value.\n   * @param {*} value\n   * @return {string[]} Array of names of types for which\n   *                  the type test matches the value.\n   */\n  function findTypeNames (value) {\n    const matches = typeList.filter(name => {\n      const type = typeMap.get(name)\n      return !type.isAny && type.test(value)\n    })\n    if (matches.length) {\n      return matches\n    }\n    return ['any']\n  }\n\n  /**\n   * Check if an entity is a typed function created by any instance\n   * @param {any} entity\n   * @returns {boolean}\n   */\n  function isTypedFunction (entity) {\n    return entity && typeof entity === 'function' &&\n      '_typedFunctionData' in entity\n  }\n\n  /**\n   * Find a specific signature from a (composed) typed function, for example:\n   *\n   *   typed.findSignature(fn, ['number', 'string'])\n   *   typed.findSignature(fn, 'number, string')\n   *   typed.findSignature(fn, 'number,string', {exact: true})\n   *\n   * This function findSignature will by default return the best match to\n   * the given signature, possibly employing type conversions.\n   *\n   * The (optional) third argument is a plain object giving options\n   * controlling the signature search. Currently the only implemented\n   * option is `exact`: if specified as true (default is false), only\n   * exact matches will be returned (i.e. signatures for which `fn` was\n   * directly defined). Note that a (possibly different) type matching\n   * `any`, or one or more instances of TYPE matching `...TYPE` are\n   * considered exact matches in this regard, as no conversions are used.\n   *\n   * This function returns a \"signature\" object, as does `typed.resolve()`,\n   * which is a plain object with four keys: `params` (the array of parameters\n   * for this signature), `fn` (the originally supplied function for this\n   * signature), `test` (a generated function that determines if an argument\n   * list matches this signature, and `implementation` (the function to call\n   * on a matching argument list, that performs conversions if necessary and\n   * then calls the originally supplied function).\n   *\n   * @param {Function} fn                   A typed-function\n   * @param {string | string[]} signature\n   *     Signature to be found, can be an array or a comma separated string.\n   * @param {object} options  Controls the signature search as documented\n   * @return {{ params: Param[], fn: function, test: function, implementation: function }}\n   *     Returns the matching signature, or throws an error when no signature\n   *     is found.\n   */\n  function findSignature (fn, signature, options) {\n    if (!isTypedFunction(fn)) {\n      throw new TypeError(NOT_TYPED_FUNCTION)\n    }\n\n    // Canonicalize input\n    const exact = options && options.exact\n    const stringSignature = Array.isArray(signature)\n      ? signature.join(',')\n      : signature\n    const params = parseSignature(stringSignature)\n    const canonicalSignature = stringifyParams(params)\n\n    // First hope we get lucky and exactly match a signature\n    if (!exact || canonicalSignature in fn.signatures) {\n      // OK, we can check the internal signatures\n      const match =\n        fn._typedFunctionData.signatureMap.get(canonicalSignature)\n      if (match) {\n        return match\n      }\n    }\n\n    // Oh well, we did not; so we have to go back and check the parameters\n    // one by one, in order to catch things like `any` and rest params.\n    // Note here we can assume there is at least one parameter, because\n    // the empty signature would have matched successfully above.\n    const nParams = params.length\n    let remainingSignatures\n    if (exact) {\n      remainingSignatures = []\n      let name\n      for (name in fn.signatures) {\n        remainingSignatures.push(fn._typedFunctionData.signatureMap.get(name))\n      }\n    } else {\n      remainingSignatures = fn._typedFunctionData.signatures\n    }\n    for (let i = 0; i < nParams; ++i) {\n      const want = params[i]\n      const filteredSignatures = []\n      let possibility\n      for (possibility of remainingSignatures) {\n        const have = getParamAtIndex(possibility.params, i)\n        if (!have || (want.restParam && !have.restParam)) {\n          continue\n        }\n        if (!have.hasAny) {\n          // have to check all of the wanted types are available\n          const haveTypes = paramTypeSet(have)\n          if (want.types.some(wtype => !haveTypes.has(wtype.name))) {\n            continue\n          }\n        }\n        // OK, this looks good\n        filteredSignatures.push(possibility)\n      }\n      remainingSignatures = filteredSignatures\n      if (remainingSignatures.length === 0) break\n    }\n    // Return the first remaining signature that was totally matched:\n    let candidate\n    for (candidate of remainingSignatures) {\n      if (candidate.params.length <= nParams) {\n        return candidate\n      }\n    }\n\n    throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + stringifyParams(params, ', ') + '))')\n  }\n\n  /**\n   * Find the proper function to call for a specific signature from\n   * a (composed) typed function, for example:\n   *\n   *   typed.find(fn, ['number', 'string'])\n   *   typed.find(fn, 'number, string')\n   *   typed.find(fn, 'number,string', {exact: true})\n   *\n   * This function find will by default return the best match to\n   * the given signature, possibly employing type conversions (and returning\n   * a function that will perform those conversions as needed). The\n   * (optional) third argument is a plain object giving options contolling\n   * the signature search. Currently only the option `exact` is implemented,\n   * which defaults to \"false\". If `exact` is specified as true, then only\n   * exact matches will be returned (i.e. signatures for which `fn` was\n   * directly defined). Uses of `any` and `...TYPE` are considered exact if\n   * no conversions are necessary to apply the corresponding function.\n   *\n   * @param {Function} fn                   A typed-function\n   * @param {string | string[]} signature\n   *     Signature to be found, can be an array or a comma separated string.\n   * @param {object} options  Controls the signature match as documented\n   * @return {function}\n   *     Returns the function to call for the given signature, or throws an\n   *     error if no match is found.\n   */\n  function find (fn, signature, options) {\n    return findSignature(fn, signature, options).implementation\n  }\n\n  /**\n   * Convert a given value to another data type, specified by type name.\n   *\n   * @param {*} value\n   * @param {string} typeName\n   */\n  function convert (value, typeName) {\n    // check conversion is needed\n    const type = findType(typeName)\n    if (type.test(value)) {\n      return value\n    }\n    const conversions = type.conversionsTo\n    if (conversions.length === 0) {\n      throw new Error(\n        'There are no conversions to ' + typeName + ' defined.')\n    }\n    for (let i = 0; i < conversions.length; i++) {\n      const fromType = findType(conversions[i].from)\n      if (fromType.test(value)) {\n        return conversions[i].convert(value)\n      }\n    }\n\n    throw new Error('Cannot convert ' + value + ' to ' + typeName)\n  }\n\n  /**\n   * Stringify parameters in a normalized way\n   * @param {Param[]} params\n   * @param {string} [','] separator\n   * @return {string}\n   */\n  function stringifyParams (params, separator = ',') {\n    return params.map(p => p.name).join(separator)\n  }\n\n  /**\n   * Parse a parameter, like \"...number | boolean\"\n   * @param {string} param\n   * @return {Param} param\n   */\n  function parseParam (param) {\n    const restParam = param.indexOf('...') === 0\n    const types = (!restParam)\n      ? param\n      : (param.length > 3)\n          ? param.slice(3)\n          : 'any'\n\n    const typeDefs = types.split('|').map(s => findType(s.trim()))\n\n    let hasAny = false\n    let paramName = restParam ? '...' : ''\n\n    const exactTypes = typeDefs.map(function (type) {\n      hasAny = type.isAny || hasAny\n      paramName += type.name + '|'\n\n      return {\n        name: type.name,\n        typeIndex: type.index,\n        test: type.test,\n        isAny: type.isAny,\n        conversion: null,\n        conversionIndex: -1\n      }\n    })\n\n    return {\n      types: exactTypes,\n      name: paramName.slice(0, -1), // remove trailing '|' from above\n      hasAny,\n      hasConversion: false,\n      restParam\n    }\n  }\n\n  /**\n   * Expands a parsed parameter with the types available from currently\n   * defined conversions.\n   * @param {Param} param\n   * @return {Param} param\n   */\n  function expandParam (param) {\n    const typeNames = param.types.map(t => t.name)\n    const matchingConversions = availableConversions(typeNames)\n    let hasAny = param.hasAny\n    let newName = param.name\n\n    const convertibleTypes = matchingConversions.map(function (conversion) {\n      const type = findType(conversion.from)\n      hasAny = type.isAny || hasAny\n      newName += '|' + conversion.from\n\n      return {\n        name: conversion.from,\n        typeIndex: type.index,\n        test: type.test,\n        isAny: type.isAny,\n        conversion,\n        conversionIndex: conversion.index\n      }\n    })\n\n    return {\n      types: param.types.concat(convertibleTypes),\n      name: newName,\n      hasAny,\n      hasConversion: convertibleTypes.length > 0,\n      restParam: param.restParam\n    }\n  }\n\n  /**\n   * Return the set of type names in a parameter.\n   * Caches the result for efficiency\n   *\n   * @param {Param} param\n   * @return {Set<string>} typenames\n   */\n  function paramTypeSet (param) {\n    if (!param.typeSet) {\n      param.typeSet = new Set()\n      param.types.forEach(type => param.typeSet.add(type.name))\n    }\n    return param.typeSet\n  }\n\n  /**\n   * Parse a signature with comma separated parameters,\n   * like \"number | boolean, ...string\"\n   *\n   * @param {string} signature\n   * @return {Param[]} params\n   */\n  function parseSignature (rawSignature) {\n    const params = []\n    if (typeof rawSignature !== 'string') {\n      throw new TypeError('Signatures must be strings')\n    }\n    const signature = rawSignature.trim()\n    if (signature === '') {\n      return params\n    }\n\n    const rawParams = signature.split(',')\n    for (let i = 0; i < rawParams.length; ++i) {\n      const parsedParam = parseParam(rawParams[i].trim())\n      if (parsedParam.restParam && (i !== rawParams.length - 1)) {\n        throw new SyntaxError(\n          'Unexpected rest parameter \"' + rawParams[i] + '\": ' +\n          'only allowed for the last parameter')\n      }\n      // if invalid, short-circuit (all the types may have been filtered)\n      if (parsedParam.types.length === 0) {\n        return null\n      }\n      params.push(parsedParam)\n    }\n\n    return params\n  }\n\n  /**\n   * Test whether a set of params contains a restParam\n   * @param {Param[]} params\n   * @return {boolean} Returns true when the last parameter is a restParam\n   */\n  function hasRestParam (params) {\n    const param = last(params)\n    return param ? param.restParam : false\n  }\n\n  /**\n   * Create a type test for a single parameter, which can have one or multiple\n   * types.\n   * @param {Param} param\n   * @return {function(x: *) : boolean} Returns a test function\n   */\n  function compileTest (param) {\n    if (!param || param.types.length === 0) {\n      // nothing to do\n      return ok\n    } else if (param.types.length === 1) {\n      return findType(param.types[0].name).test\n    } else if (param.types.length === 2) {\n      const test0 = findType(param.types[0].name).test\n      const test1 = findType(param.types[1].name).test\n      return function or (x) {\n        return test0(x) || test1(x)\n      }\n    } else { // param.types.length > 2\n      const tests = param.types.map(function (type) {\n        return findType(type.name).test\n      })\n      return function or (x) {\n        for (let i = 0; i < tests.length; i++) {\n          if (tests[i](x)) {\n            return true\n          }\n        }\n        return false\n      }\n    }\n  }\n\n  /**\n   * Create a test for all parameters of a signature\n   * @param {Param[]} params\n   * @return {function(args: Array<*>) : boolean}\n   */\n  function compileTests (params) {\n    let tests, test0, test1\n\n    if (hasRestParam(params)) {\n      // variable arguments like '...number'\n      tests = initial(params).map(compileTest)\n      const varIndex = tests.length\n      const lastTest = compileTest(last(params))\n      const testRestParam = function (args) {\n        for (let i = varIndex; i < args.length; i++) {\n          if (!lastTest(args[i])) {\n            return false\n          }\n        }\n        return true\n      }\n\n      return function testArgs (args) {\n        for (let i = 0; i < tests.length; i++) {\n          if (!tests[i](args[i])) {\n            return false\n          }\n        }\n        return testRestParam(args) && (args.length >= varIndex + 1)\n      }\n    } else {\n      // no variable arguments\n      if (params.length === 0) {\n        return function testArgs (args) {\n          return args.length === 0\n        }\n      } else if (params.length === 1) {\n        test0 = compileTest(params[0])\n        return function testArgs (args) {\n          return test0(args[0]) && args.length === 1\n        }\n      } else if (params.length === 2) {\n        test0 = compileTest(params[0])\n        test1 = compileTest(params[1])\n        return function testArgs (args) {\n          return test0(args[0]) && test1(args[1]) && args.length === 2\n        }\n      } else { // arguments.length > 2\n        tests = params.map(compileTest)\n        return function testArgs (args) {\n          for (let i = 0; i < tests.length; i++) {\n            if (!tests[i](args[i])) {\n              return false\n            }\n          }\n          return args.length === tests.length\n        }\n      }\n    }\n  }\n\n  /**\n   * Find the parameter at a specific index of a Params list.\n   * Handles rest parameters.\n   * @param {Param[]} params\n   * @param {number} index\n   * @return {Param | null} Returns the matching parameter when found,\n   *                        null otherwise.\n   */\n  function getParamAtIndex (params, index) {\n    return index < params.length\n      ? params[index]\n      : hasRestParam(params) ? last(params) : null\n  }\n\n  /**\n   * Get all type names of a parameter\n   * @param {Params[]} params\n   * @param {number} index\n   * @return {string[]} Returns an array with type names\n   */\n  function getTypeSetAtIndex (params, index) {\n    const param = getParamAtIndex(params, index)\n    if (!param) {\n      return new Set()\n    }\n    return paramTypeSet(param)\n  }\n\n  /**\n   * Test whether a type is an exact type or conversion\n   * @param {Type} type\n   * @return {boolean} Returns true when\n   */\n  function isExactType (type) {\n    return type.conversion === null || type.conversion === undefined\n  }\n\n  /**\n   * Helper function for creating error messages: create an array with\n   * all available types on a specific argument index.\n   * @param {Signature[]} signatures\n   * @param {number} index\n   * @return {string[]} Returns an array with available types\n   */\n  function mergeExpectedParams (signatures, index) {\n    const typeSet = new Set()\n    signatures.forEach(signature => {\n      const paramSet = getTypeSetAtIndex(signature.params, index)\n      let name\n      for (name of paramSet) {\n        typeSet.add(name)\n      }\n    })\n\n    return typeSet.has('any') ? ['any'] : Array.from(typeSet)\n  }\n\n  /**\n   * Create\n   * @param {string} name             The name of the function\n   * @param {array.<*>} args          The actual arguments passed to the function\n   * @param {Signature[]} signatures  A list with available signatures\n   * @return {TypeError} Returns a type error with additional data\n   *                     attached to it in the property `data`\n   */\n  function createError (name, args, signatures) {\n    let err, expected\n    const _name = name || 'unnamed'\n\n    // test for wrong type at some index\n    let matchingSignatures = signatures\n    let index\n    for (index = 0; index < args.length; index++) {\n      const nextMatchingDefs = []\n      matchingSignatures.forEach(signature => {\n        const param = getParamAtIndex(signature.params, index)\n        const test = compileTest(param)\n        if ((index < signature.params.length ||\n          hasRestParam(signature.params)) &&\n          test(args[index])) {\n          nextMatchingDefs.push(signature)\n        }\n      })\n\n      if (nextMatchingDefs.length === 0) {\n        // no matching signatures anymore, throw error \"wrong type\"\n        expected = mergeExpectedParams(matchingSignatures, index)\n        if (expected.length > 0) {\n          const actualTypes = findTypeNames(args[index])\n\n          err = new TypeError('Unexpected type of argument in function ' + _name +\n            ' (expected: ' + expected.join(' or ') +\n            ', actual: ' + actualTypes.join(' | ') + ', index: ' + index + ')')\n          err.data = {\n            category: 'wrongType',\n            fn: _name,\n            index,\n            actual: actualTypes,\n            expected\n          }\n          return err\n        }\n      } else {\n        matchingSignatures = nextMatchingDefs\n      }\n    }\n\n    // test for too few arguments\n    const lengths = matchingSignatures.map(function (signature) {\n      return hasRestParam(signature.params)\n        ? Infinity\n        : signature.params.length\n    })\n    if (args.length < Math.min.apply(null, lengths)) {\n      expected = mergeExpectedParams(matchingSignatures, index)\n      err = new TypeError('Too few arguments in function ' + _name +\n        ' (expected: ' + expected.join(' or ') +\n        ', index: ' + args.length + ')')\n      err.data = {\n        category: 'tooFewArgs',\n        fn: _name,\n        index: args.length,\n        expected\n      }\n      return err\n    }\n\n    // test for too many arguments\n    const maxLength = Math.max.apply(null, lengths)\n    if (args.length > maxLength) {\n      err = new TypeError('Too many arguments in function ' + _name +\n        ' (expected: ' + maxLength + ', actual: ' + args.length + ')')\n      err.data = {\n        category: 'tooManyArgs',\n        fn: _name,\n        index: args.length,\n        expectedLength: maxLength\n      }\n      return err\n    }\n\n    // Generic error\n    const argTypes = []\n    for (let i = 0; i < args.length; ++i) {\n      argTypes.push(findTypeNames(args[i]).join('|'))\n    }\n    err = new TypeError('Arguments of type \"' + argTypes.join(', ') +\n      '\" do not match any of the defined signatures of function ' + _name + '.')\n    err.data = {\n      category: 'mismatch',\n      actual: argTypes\n    }\n    return err\n  }\n\n  /**\n   * Find the lowest index of all types of a parameter\n   * @param {Param} param\n   * @return {number} Returns the index of the lowest type in typed.types\n   */\n  function getLowestTypeIndex (param) {\n    let min = typeList.length + 1\n\n    for (let i = 0; i < param.types.length; i++) {\n      min = Math.min(min, param.types[i].typeIndex)\n    }\n\n    return min\n  }\n\n  /**\n   * Find the lowest index of the conversion of all types of the parameter\n   * having a conversion\n   * @param {Param} param\n   * @return {number} Returns the lowest index of the conversions of this type\n   */\n  function getLowestConversionIndex (param) {\n    let min = nConversions + 1\n\n    for (let i = 0; i < param.types.length; i++) {\n      if (!isExactType(param.types[i])) {\n        min = Math.min(min, param.types[i].conversionIndex)\n      }\n    }\n\n    return min\n  }\n\n  /**\n   * Compare two params. The return value is a number that is\n   * negative when param1 should be considered first, positive\n   * when param2 should be considered first, and zero when the\n   * params are indistinguishable. Primarily as a debugging aid,\n   * the value is always less than one in absolute value, and\n   * a smaller absolute value indicates a less important distinction\n   * between the parameters.\n   * @param {Param} param1\n   * @param {Param} param2\n   * @return {number} negative, positive, or zero depending on whether\n   *                  param1 should be ordered before, after, or equivalently\n   *                  to param2\n   */\n  function compareParams (param1, param2) {\n    // We compare a number of metrics on a param in turn:\n    // 1) 'any' parameters are the least preferred\n    if (param1.hasAny) {\n      if (!param2.hasAny) {\n        return 0.1\n      }\n    } else if (param2.hasAny) {\n      return -0.1\n    }\n\n    // 2) Prefer non-rest to rest parameters\n    if (param1.restParam) {\n      if (!param2.restParam) {\n        return 0.01\n      }\n    } else if (param2.restParam) {\n      return -0.01\n    }\n\n    // 3) Prefer lower type index:\n    const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2)\n    if (typeDiff < 0) {\n      return -0.001\n    }\n    if (typeDiff > 0) {\n      return 0.001\n    }\n\n    // 4) Prefer exact type match to conversions, with a strength that\n    //    grows with the conversion index\n    const conv1 = getLowestConversionIndex(param1)\n    const conv2 = getLowestConversionIndex(param2)\n    if (param1.hasConversion) {\n      if (!param2.hasConversion) {\n        return (1 + conv1) * 0.000001\n      }\n    } else if (param2.hasConversion) {\n      return -(1 + conv2) * 0.000001\n    }\n\n    // 5) Prefer lower conversion index\n    const convDiff = conv1 - conv2\n    if (convDiff < 0) {\n      return -0.0000001\n    }\n    if (convDiff > 0) {\n      return 0.0000001\n    }\n\n    // Don't have a basis for preference\n    return 0\n  }\n\n  /**\n   * Compare two signatures. The result is a number that is negative\n   * when the first signature should be preferred to the second, positive\n   * when the second signature should be preferred, and zero in case the\n   * two signatures are essentially equivalent. Primarily as a debugging\n   * aid, a larger absolute value indicates a more \"important\" difference.\n   *\n   * @param {Signature} signature1\n   * @param {Signature} signature2\n   * @return {number} returns a negative number when signature1 must get a\n   *                  lower index than signature2, a positive number when the\n   *                  opposite holds, or zero when both are equivalent.\n   */\n  function compareSignatures (signature1, signature2) {\n    const pars1 = signature1.params\n    const pars2 = signature2.params\n    const last1 = last(pars1)\n    const last2 = last(pars2)\n    const hasRest1 = hasRestParam(pars1)\n    const hasRest2 = hasRestParam(pars2)\n    // We compare a number of metrics on signatures in turn:\n    // 1) An \"any rest param\" is least preferred\n    if (hasRest1 && last1.hasAny) {\n      if (!hasRest2 || !last2.hasAny) {\n        return 10000000\n      }\n    } else if (hasRest2 && last2.hasAny) {\n      return -10000000\n    }\n\n    // 2) Minimize the number of 'any' parameters\n    let any1 = 0\n    let conv1 = 0\n    let par\n    for (par of pars1) {\n      if (par.hasAny) ++any1\n      if (par.hasConversion) ++conv1\n    }\n    let any2 = 0\n    let conv2 = 0\n    for (par of pars2) {\n      if (par.hasAny) ++any2\n      if (par.hasConversion) ++conv2\n    }\n    if (any1 !== any2) {\n      return (any1 - any2) * 1000000\n    }\n\n    // 3) A conversion rest param is less preferred\n    if (hasRest1 && last1.hasConversion) {\n      if (!hasRest2 || !last2.hasConversion) {\n        return 100000\n      }\n    } else if (hasRest2 && last2.hasConversion) {\n      return -100000\n    }\n\n    // 4) Minimize the number of conversions\n    if (conv1 !== conv2) {\n      return (conv1 - conv2) * 10000\n    }\n\n    // 5) Prefer no rest param\n    if (hasRest1) {\n      if (!hasRest2) {\n        return 1000\n      }\n    } else if (hasRest2) {\n      return -1000\n    }\n\n    // 6) Prefer shorter with rest param, longer without\n    const lengthCriterion =\n      (pars1.length - pars2.length) * (hasRest1 ? -100 : 100)\n    if (lengthCriterion !== 0) {\n      return lengthCriterion\n    }\n\n    // Signatures are identical in each of the above metrics.\n    // In particular, they are the same length.\n    // We can therefore compare the parameters one by one.\n    // First we count which signature has more preferred parameters.\n    const comparisons = []\n    let tc = 0\n    for (let i = 0; i < pars1.length; ++i) {\n      const thisComparison = compareParams(pars1[i], pars2[i])\n      comparisons.push(thisComparison)\n      tc += thisComparison\n    }\n    if (tc !== 0) {\n      return ((tc < 0) ? -10 : 10) + tc\n    }\n\n    // They have the same number of preferred parameters, so go by the\n    // earliest parameter in which we have a preference.\n    // In other words, dispatch is driven somewhat more by earlier\n    // parameters than later ones.\n    let c\n    let bonus = 9\n    const decrement = bonus / (comparisons.length + 1)\n    for (c of comparisons) {\n      if (c !== 0) {\n        return ((c < 0) ? -bonus : bonus) + c\n      }\n      bonus -= decrement\n    }\n\n    // It's a tossup:\n    return 0\n  }\n\n  /**\n   * Produce a list of all conversions from distinct types to one of\n   * the given types.\n   *\n   * @param {string[]} typeNames\n   * @return {ConversionDef[]} Returns the conversions that are available\n   *                        resulting in any given type (if any)\n   */\n  function availableConversions (typeNames) {\n    if (typeNames.length === 0) {\n      return []\n    }\n    const types = typeNames.map(findType)\n    if (typeNames.length === 1) return types[0].conversionsTo\n\n    // Here, for each type that occurs as the from-type of any conversion\n    // to any of the types found, we must select the conversion of\n    // lowest index from that type. So first collect the types.\n    const knownTypes = new Set(typeNames)\n    const convertibleTypes = new Set()\n    for (let i = 0; i < types.length; ++i) {\n      for (const match of types[i].conversionsTo) {\n        if (!knownTypes.has(match.from)) convertibleTypes.add(match.from)\n      }\n    }\n\n    // Now get the lowest-index conversion for each type\n    const matches = []\n    for (const typeName of convertibleTypes) {\n      let bestIndex = nConversions + 1\n      let bestConversion = null\n      for (let i = 0; i < types.length; ++i) {\n        for (const match of types[i].conversionsTo) {\n          if (match.from === typeName && match.index < bestIndex) {\n            bestIndex = match.index\n            bestConversion = match\n          }\n        }\n      }\n      matches.push(bestConversion)\n    }\n\n    return matches\n  }\n\n  /**\n   * Preprocess arguments before calling the original function:\n   * - if needed convert the parameters\n   * - in case of rest parameters, move the rest parameters into an Array\n   * @param {Param[]} params\n   * @param {function} fn\n   * @return {function} Returns fn or a wrapped function if needed. If it\n   *                    has conversions, the function will be named to indicate\n   *                    what conversions are occurring.\n   */\n  function compileArgsPreprocessing (params, fn) {\n    let fnConvert = fn\n\n    // TODO: can we make this wrapper function smarter/simpler?\n\n    let name = ''\n    if (params.some(p => p.hasConversion)) {\n      const restParam = hasRestParam(params)\n      const compiledConversions = params.map(compileArgConversion)\n      name = compiledConversions.map(conv => conv.name).join(';')\n      fnConvert = function convertArgs () {\n        const args = []\n        const last = restParam ? arguments.length - 1 : arguments.length\n        for (let i = 0; i < last; i++) {\n          args[i] = compiledConversions[i](arguments[i])\n        }\n        if (restParam) {\n          args[last] = arguments[last].map(compiledConversions[last])\n        }\n\n        return fn.apply(this, args)\n      }\n    }\n\n    let fnPreprocess = fnConvert\n    if (hasRestParam(params)) {\n      const offset = params.length - 1\n\n      fnPreprocess = function preprocessRestParams () {\n        return fnConvert.apply(this,\n          slice(arguments, 0, offset).concat([slice(arguments, offset)]))\n      }\n    }\n    if (name) Object.defineProperty(fnPreprocess, 'name', { value: name })\n    return fnPreprocess\n  }\n\n  /**\n   * Compile conversion for a parameter to the right type\n   * @param {Param} param\n   * @return {function} Returns the wrapped function that will convert arguments\n   *\n   */\n  function compileArgConversion (param) {\n    let test0, test1, conversion0, conversion1\n    const tests = []\n    const conversions = []\n    let name = ''\n    param.types.forEach(function (type) {\n      if (type.conversion) {\n        name += type.conversion.from + '~>' + type.conversion.to + ','\n        tests.push(findType(type.conversion.from).test)\n        conversions.push(type.conversion.convert)\n      }\n    })\n    if (name) name = name.slice(0, -1)\n    else name = 'pass'\n\n    // create optimized conversion functions depending on the number of conversions\n    let convertor = arg => arg\n    switch (conversions.length) {\n      case 0: break\n      case 1:\n        test0 = tests[0]\n        conversion0 = conversions[0]\n        convertor = function convertArg (arg) {\n          if (test0(arg)) {\n            return conversion0(arg)\n          }\n          return arg\n        }\n        break\n      case 2:\n        test0 = tests[0]\n        test1 = tests[1]\n        conversion0 = conversions[0]\n        conversion1 = conversions[1]\n        convertor = function convertArg (arg) {\n          if (test0(arg)) {\n            return conversion0(arg)\n          }\n          if (test1(arg)) {\n            return conversion1(arg)\n          }\n          return arg\n        }\n        break\n      default:\n        convertor = function convertArg (arg) {\n          for (let i = 0; i < conversions.length; i++) {\n            if (tests[i](arg)) {\n              return conversions[i](arg)\n            }\n          }\n          return arg\n        }\n    }\n    Object.defineProperty(convertor, 'name', { value: name })\n    return convertor\n  }\n\n  /**\n   * Split params with union types in to separate params.\n   *\n   * For example:\n   *\n   *     splitParams([['Array', 'Object'], ['string', 'RegExp'])\n   *     // returns:\n   *     // [\n   *     //   ['Array', 'string'],\n   *     //   ['Array', 'RegExp'],\n   *     //   ['Object', 'string'],\n   *     //   ['Object', 'RegExp']\n   *     // ]\n   *\n   * @param {Param[]} params\n   * @return {Param[]}\n   */\n  function splitParams (params) {\n    function _splitParams (params, index, paramsSoFar) {\n      if (index < params.length) {\n        const param = params[index]\n        let resultingParams = []\n\n        if (param.restParam) {\n          // split the types of a rest parameter in two:\n          // one with only exact types, and one with exact types and conversions\n          const exactTypes = param.types.filter(isExactType)\n          if (exactTypes.length < param.types.length) {\n            resultingParams.push({\n              types: exactTypes,\n              name: '...' + exactTypes.map(t => t.name).join('|'),\n              hasAny: exactTypes.some(t => t.isAny),\n              hasConversion: false,\n              restParam: true\n            })\n          }\n          resultingParams.push(param)\n        } else {\n          // split all the types of a regular parameter into one type per param\n          resultingParams = param.types.map(function (type) {\n            return {\n              types: [type],\n              name: type.name,\n              hasAny: type.isAny,\n              hasConversion: type.conversion,\n              restParam: false\n            }\n          })\n        }\n\n        // recurse over the groups with types\n        return flatMap(resultingParams, function (nextParam) {\n          return _splitParams(params, index + 1, paramsSoFar.concat([nextParam]))\n        })\n      } else {\n        // we've reached the end of the parameters.\n        return [paramsSoFar]\n      }\n    }\n\n    return _splitParams(params, 0, [])\n  }\n\n  /**\n   * Test whether two param lists represent conflicting signatures\n   * @param {Param[]} params1\n   * @param {Param[]} params2\n   * @return {boolean} Returns true when the signatures conflict, false otherwise.\n   */\n  function conflicting (params1, params2) {\n    const ii = Math.max(params1.length, params2.length)\n\n    for (let i = 0; i < ii; i++) {\n      const typeSet1 = getTypeSetAtIndex(params1, i)\n      const typeSet2 = getTypeSetAtIndex(params2, i)\n      let overlap = false\n      let name\n      for (name of typeSet2) {\n        if (typeSet1.has(name)) {\n          overlap = true\n          break\n        }\n      }\n      if (!overlap) {\n        return false\n      }\n    }\n\n    const len1 = params1.length\n    const len2 = params2.length\n    const restParam1 = hasRestParam(params1)\n    const restParam2 = hasRestParam(params2)\n\n    return restParam1\n      ? restParam2 ? (len1 === len2) : (len2 >= len1)\n      : restParam2 ? (len1 >= len2) : (len1 === len2)\n  }\n\n  /**\n   * Helper function for `resolveReferences` that returns a copy of\n   * functionList wihe any prior resolutions cleared out, in case we are\n   * recycling signatures from a prior typed function construction.\n   *\n   * @param {Array.<function|typed-reference>} functionList\n   * @return {Array.<function|typed-reference>}\n   */\n  function clearResolutions (functionList) {\n    return functionList.map(fn => {\n      if (isReferToSelf(fn)) {\n        return referToSelf(fn.referToSelf.callback)\n      }\n      if (isReferTo(fn)) {\n        return makeReferTo(fn.referTo.references, fn.referTo.callback)\n      }\n      return fn\n    })\n  }\n\n  /**\n   * Take a list of references, a list of functions functionList, and a\n   * signatureMap indexing signatures into functionList, and return\n   * the list of resolutions, or a false-y value if they don't all\n   * resolve in a valid way (yet).\n   *\n   * @param {string[]} references\n   * @param {Array<function|typed-reference} functionList\n   * @param {Object.<string, integer>} signatureMap\n   * @return {function[] | false} resolutions\n   */\n  function collectResolutions (references, functionList, signatureMap) {\n    const resolvedReferences = []\n    let reference\n    for (reference of references) {\n      let resolution = signatureMap[reference]\n      if (typeof resolution !== 'number') {\n        throw new TypeError(\n          'No definition for referenced signature \"' + reference + '\"')\n      }\n      resolution = functionList[resolution]\n      if (typeof resolution !== 'function') {\n        return false\n      }\n      resolvedReferences.push(resolution)\n    }\n    return resolvedReferences\n  }\n\n  /**\n   * Resolve any references in the functionList for the typed function\n   * itself. The signatureMap tells which index in the functionList a\n   * given signature should be mapped to (for use in resolving typed.referTo)\n   * and self provides the destions of a typed.referToSelf.\n   *\n   * @param {Array<function | typed-reference-object>} functionList\n   * @param {Object.<string, function>} signatureMap\n   * @param {function} self  The typed-function itself\n   * @return {Array<function>} The list of resolved functions\n   */\n  function resolveReferences (functionList, signatureMap, self) {\n    const resolvedFunctions = clearResolutions(functionList)\n    const isResolved = new Array(resolvedFunctions.length).fill(false)\n    let leftUnresolved = true\n    while (leftUnresolved) {\n      leftUnresolved = false\n      let nothingResolved = true\n      for (let i = 0; i < resolvedFunctions.length; ++i) {\n        if (isResolved[i]) continue\n        const fn = resolvedFunctions[i]\n\n        if (isReferToSelf(fn)) {\n          resolvedFunctions[i] = fn.referToSelf.callback(self)\n          // Preserve reference in case signature is reused someday:\n          resolvedFunctions[i].referToSelf = fn.referToSelf\n          isResolved[i] = true\n          nothingResolved = false\n        } else if (isReferTo(fn)) {\n          const resolvedReferences = collectResolutions(\n            fn.referTo.references, resolvedFunctions, signatureMap)\n          if (resolvedReferences) {\n            resolvedFunctions[i] =\n              fn.referTo.callback.apply(this, resolvedReferences)\n            // Preserve reference in case signature is reused someday:\n            resolvedFunctions[i].referTo = fn.referTo\n            isResolved[i] = true\n            nothingResolved = false\n          } else {\n            leftUnresolved = true\n          }\n        }\n      }\n\n      if (nothingResolved && leftUnresolved) {\n        throw new SyntaxError(\n          'Circular reference detected in resolving typed.referTo')\n      }\n    }\n\n    return resolvedFunctions\n  }\n\n  /**\n   * Validate whether any of the function bodies contains a self-reference\n   * usage like `this(...)` or `this.signatures`. This self-referencing is\n   * deprecated since typed-function v3. It has been replaced with\n   * the functions typed.referTo and typed.referToSelf.\n   * @param {Object.<string, function>} signaturesMap\n   */\n  function validateDeprecatedThis (signaturesMap) {\n    // TODO: remove this deprecation warning logic some day (it's introduced in v3)\n\n    // match occurrences like 'this(' and 'this.signatures'\n    const deprecatedThisRegex = /\\bthis(\\(|\\.signatures\\b)/\n\n    Object.keys(signaturesMap).forEach(signature => {\n      const fn = signaturesMap[signature]\n\n      if (deprecatedThisRegex.test(fn.toString())) {\n        throw new SyntaxError('Using `this` to self-reference a function ' +\n          'is deprecated since typed-function@3. ' +\n          'Use typed.referTo and typed.referToSelf instead.')\n      }\n    })\n  }\n\n  /**\n   * Create a typed function\n   * @param {String} name               The name for the typed function\n   * @param {Object.<string, function>} rawSignaturesMap\n   *                                    An object with one or\n   *                                    multiple signatures as key, and the\n   *                                    function corresponding to the\n   *                                    signature as value.\n   * @return {function}  Returns the created typed function.\n   */\n  function createTypedFunction (name, rawSignaturesMap) {\n    typed.createCount++\n\n    if (Object.keys(rawSignaturesMap).length === 0) {\n      throw new SyntaxError('No signatures provided')\n    }\n\n    if (typed.warnAgainstDeprecatedThis) {\n      validateDeprecatedThis(rawSignaturesMap)\n    }\n\n    // Main processing loop for signatures\n    const parsedParams = []\n    const originalFunctions = []\n    const signaturesMap = {}\n    const preliminarySignatures = [] // may have duplicates from conversions\n    let signature\n    for (signature in rawSignaturesMap) {\n      // A) Protect against polluted Object prototype:\n      if (!Object.prototype.hasOwnProperty.call(rawSignaturesMap, signature)) {\n        continue\n      }\n      // B) Parse the signature\n      const params = parseSignature(signature)\n      if (!params) continue\n      // C) Check for conflicts\n      parsedParams.forEach(function (pp) {\n        if (conflicting(pp, params)) {\n          throw new TypeError('Conflicting signatures \"' +\n            stringifyParams(pp) + '\" and \"' +\n            stringifyParams(params) + '\".')\n        }\n      })\n      parsedParams.push(params)\n      // D) Store the provided function and add conversions\n      const functionIndex = originalFunctions.length\n      originalFunctions.push(rawSignaturesMap[signature])\n      const conversionParams = params.map(expandParam)\n      // E) Split the signatures and collect them up\n      let sp\n      for (sp of splitParams(conversionParams)) {\n        const spName = stringifyParams(sp)\n        preliminarySignatures.push(\n          { params: sp, name: spName, fn: functionIndex })\n        if (sp.every(p => !p.hasConversion)) {\n          signaturesMap[spName] = functionIndex\n        }\n      }\n    }\n\n    preliminarySignatures.sort(compareSignatures)\n\n    // Note the forward reference to theTypedFn\n    const resolvedFunctions =\n      resolveReferences(originalFunctions, signaturesMap, theTypedFn)\n\n    // Fill in the proper function for each signature\n    let s\n    for (s in signaturesMap) {\n      if (Object.prototype.hasOwnProperty.call(signaturesMap, s)) {\n        signaturesMap[s] = resolvedFunctions[signaturesMap[s]]\n      }\n    }\n    const signatures = []\n    const internalSignatureMap = new Map() // benchmarks faster than object\n    for (s of preliminarySignatures) {\n      // Note it's only safe to eliminate duplicates like this\n      // _after_ the signature sorting step above; otherwise we might\n      // remove the wrong one.\n      if (!internalSignatureMap.has(s.name)) {\n        s.fn = resolvedFunctions[s.fn]\n        signatures.push(s)\n        internalSignatureMap.set(s.name, s)\n      }\n    }\n\n    // we create a highly optimized checks for the first couple of signatures with max 2 arguments\n    const ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params)\n    const ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params)\n    const ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params)\n    const ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params)\n    const ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params)\n    const ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params)\n    const allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5\n\n    // compile the tests\n    for (let i = 0; i < signatures.length; ++i) {\n      signatures[i].test = compileTests(signatures[i].params)\n    }\n\n    const test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk\n    const test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk\n    const test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk\n    const test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk\n    const test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk\n    const test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk\n\n    const test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk\n    const test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk\n    const test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk\n    const test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk\n    const test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk\n    const test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk\n\n    // compile the functions\n    for (let i = 0; i < signatures.length; ++i) {\n      signatures[i].implementation =\n        compileArgsPreprocessing(signatures[i].params, signatures[i].fn)\n    }\n\n    const fn0 = ok0 ? signatures[0].implementation : undef\n    const fn1 = ok1 ? signatures[1].implementation : undef\n    const fn2 = ok2 ? signatures[2].implementation : undef\n    const fn3 = ok3 ? signatures[3].implementation : undef\n    const fn4 = ok4 ? signatures[4].implementation : undef\n    const fn5 = ok5 ? signatures[5].implementation : undef\n\n    const len0 = ok0 ? signatures[0].params.length : -1\n    const len1 = ok1 ? signatures[1].params.length : -1\n    const len2 = ok2 ? signatures[2].params.length : -1\n    const len3 = ok3 ? signatures[3].params.length : -1\n    const len4 = ok4 ? signatures[4].params.length : -1\n    const len5 = ok5 ? signatures[5].params.length : -1\n\n    // simple and generic, but also slow\n    const iStart = allOk ? 6 : 0\n    const iEnd = signatures.length\n    // de-reference ahead for execution speed:\n    const tests = signatures.map(s => s.test)\n    const fns = signatures.map(s => s.implementation)\n    const generic = function generic () {\n      'use strict'\n\n      for (let i = iStart; i < iEnd; i++) {\n        if (tests[i](arguments)) {\n          return fns[i].apply(this, arguments)\n        }\n      }\n\n      return typed.onMismatch(name, arguments, signatures)\n    }\n\n    // create the typed function\n    // fast, specialized version. Falls back to the slower, generic one if needed\n    function theTypedFn (arg0, arg1) {\n      'use strict'\n\n      if (arguments.length === len0 && test00(arg0) && test01(arg1)) { return fn0.apply(this, arguments) }\n      if (arguments.length === len1 && test10(arg0) && test11(arg1)) { return fn1.apply(this, arguments) }\n      if (arguments.length === len2 && test20(arg0) && test21(arg1)) { return fn2.apply(this, arguments) }\n      if (arguments.length === len3 && test30(arg0) && test31(arg1)) { return fn3.apply(this, arguments) }\n      if (arguments.length === len4 && test40(arg0) && test41(arg1)) { return fn4.apply(this, arguments) }\n      if (arguments.length === len5 && test50(arg0) && test51(arg1)) { return fn5.apply(this, arguments) }\n\n      return generic.apply(this, arguments)\n    }\n\n    // attach name the typed function\n    try {\n      Object.defineProperty(theTypedFn, 'name', { value: name })\n    } catch (err) {\n      // old browsers do not support Object.defineProperty and some don't support setting the name property\n      // the function name is not essential for the functioning, it's mostly useful for debugging,\n      // so it's fine to have unnamed functions.\n    }\n\n    // attach signatures to the function.\n    // This property is close to the original collection of signatures\n    // used to create the typed-function, just with unions split:\n    theTypedFn.signatures = signaturesMap\n\n    // Store internal data for functions like resolve, find, etc.\n    // Also serves as the flag that this is a typed-function\n    theTypedFn._typedFunctionData = {\n      signatures,\n      signatureMap: internalSignatureMap\n    }\n\n    return theTypedFn\n  }\n\n  /**\n   * Action to take on mismatch\n   * @param {string} name      Name of function that was attempted to be called\n   * @param {Array} args       Actual arguments to the call\n   * @param {Array} signatures Known signatures of the named typed-function\n   */\n  function _onMismatch (name, args, signatures) {\n    throw createError(name, args, signatures)\n  }\n\n  /**\n   * Return all but the last items of an array or function Arguments\n   * @param {Array | Arguments} arr\n   * @return {Array}\n   */\n  function initial (arr) {\n    return slice(arr, 0, arr.length - 1)\n  }\n\n  /**\n   * return the last item of an array or function Arguments\n   * @param {Array | Arguments} arr\n   * @return {*}\n   */\n  function last (arr) {\n    return arr[arr.length - 1]\n  }\n\n  /**\n   * Slice an array or function Arguments\n   * @param {Array | Arguments | IArguments} arr\n   * @param {number} start\n   * @param {number} [end]\n   * @return {Array}\n   */\n  function slice (arr, start, end) {\n    return Array.prototype.slice.call(arr, start, end)\n  }\n\n  /**\n   * Return the first item from an array for which test(arr[i]) returns true\n   * @param {Array} arr\n   * @param {function} test\n   * @return {* | undefined} Returns the first matching item\n   *                         or undefined when there is no match\n   */\n  function findInArray (arr, test) {\n    for (let i = 0; i < arr.length; i++) {\n      if (test(arr[i])) {\n        return arr[i]\n      }\n    }\n    return undefined\n  }\n\n  /**\n   * Flat map the result invoking a callback for every item in an array.\n   * https://gist.github.com/samgiles/762ee337dff48623e729\n   * @param {Array} arr\n   * @param {function} callback\n   * @return {Array}\n   */\n  function flatMap (arr, callback) {\n    return Array.prototype.concat.apply([], arr.map(callback))\n  }\n\n  /**\n   * Create a reference callback to one or multiple signatures\n   *\n   * Syntax:\n   *\n   *     typed.referTo(signature1, signature2, ..., function callback(fn1, fn2, ...) {\n   *       // ...\n   *     })\n   *\n   * @returns {{referTo: {references: string[], callback}}}\n   */\n  function referTo () {\n    const references =\n      initial(arguments).map(s => stringifyParams(parseSignature(s)))\n    const callback = last(arguments)\n\n    if (typeof callback !== 'function') {\n      throw new TypeError('Callback function expected as last argument')\n    }\n\n    return makeReferTo(references, callback)\n  }\n\n  function makeReferTo (references, callback) {\n    return { referTo: { references, callback } }\n  }\n\n  /**\n   * Create a reference callback to the typed-function itself\n   *\n   * @param {(self: function) => function} callback\n   * @returns {{referToSelf: { callback: function }}}\n   */\n  function referToSelf (callback) {\n    if (typeof callback !== 'function') {\n      throw new TypeError('Callback function expected as first argument')\n    }\n\n    return { referToSelf: { callback } }\n  }\n\n  /**\n   * Test whether something is a referTo object, holding a list with reference\n   * signatures and a callback.\n   *\n   * @param {Object | function} objectOrFn\n   * @returns {boolean}\n   */\n  function isReferTo (objectOrFn) {\n    return objectOrFn &&\n      typeof objectOrFn.referTo === 'object' &&\n      Array.isArray(objectOrFn.referTo.references) &&\n      typeof objectOrFn.referTo.callback === 'function'\n  }\n\n  /**\n   * Test whether something is a referToSelf object, holding a callback where\n   * to pass `self`.\n   *\n   * @param {Object | function} objectOrFn\n   * @returns {boolean}\n   */\n  function isReferToSelf (objectOrFn) {\n    return objectOrFn &&\n      typeof objectOrFn.referToSelf === 'object' &&\n      typeof objectOrFn.referToSelf.callback === 'function'\n  }\n\n  /**\n   * Check if name is (A) new, (B) a match, or (C) a mismatch; and throw\n   * an error in case (C).\n   *\n   * @param { string | undefined } nameSoFar\n   * @param { string | undefined } newName\n   * @returns { string } updated name\n   */\n  function checkName (nameSoFar, newName) {\n    if (!nameSoFar) {\n      return newName\n    }\n    if (newName && newName !== nameSoFar) {\n      const err = new Error('Function names do not match (expected: ' +\n        nameSoFar + ', actual: ' + newName + ')')\n      err.data = { actual: newName, expected: nameSoFar }\n      throw err\n    }\n    return nameSoFar\n  }\n\n  /**\n   * Retrieve the implied name from an object with signature keys\n   * and function values, checking whether all value names match\n   *\n   * @param { {string: function} } obj\n   */\n  function getObjectName (obj) {\n    let name\n    for (const key in obj) {\n      // Only pay attention to own properties, and only if their values\n      // are typed functions or functions with a signature property\n      if (Object.prototype.hasOwnProperty.call(obj, key) &&\n        (isTypedFunction(obj[key]) ||\n          typeof obj[key].signature === 'string')) {\n        name = checkName(name, obj[key].name)\n      }\n    }\n    return name\n  }\n\n  /**\n   * Copy all of the signatures from the second argument into the first,\n   * which is modified by side effect, checking for conflicts\n   *\n   * @param {Object.<string, function|typed-reference>} dest\n   * @param {Object.<string, function|typed-reference>} source\n   */\n  function mergeSignatures (dest, source) {\n    let key\n    for (key in source) {\n      if (Object.prototype.hasOwnProperty.call(source, key)) {\n        if (key in dest) {\n          if (source[key] !== dest[key]) {\n            const err = new Error('Signature \"' + key + '\" is defined twice')\n            err.data = {\n              signature: key,\n              sourceFunction: source[key],\n              destFunction: dest[key]\n            }\n            throw err\n          }\n          // else: both signatures point to the same function, that's fine\n        }\n        dest[key] = source[key]\n      }\n    }\n  }\n\n  const saveTyped = typed\n\n  /**\n   * Originally the main function was a typed function itself, but then\n   * it might not be able to generate error messages if the client\n   * replaced the type system with different names.\n   *\n   * Main entry: typed([name], functions/objects with signatures...)\n   *\n   * Assembles and returns a new typed-function from the given items\n   * that provide signatures and implementations, each of which may be\n   * * a plain object mapping (string) signatures to implementing functions,\n   * * a previously constructed typed function, or\n   * * any other single function with a string-valued property `signature`.\n\n   * The name of the resulting typed-function will be given by the\n   * string-valued name argument if present, or if not, by the name\n   * of any of the arguments that have one, as long as any that do are\n   * consistent with each other. If no name is specified, the name will be\n   * an empty string.\n   *\n   * @param {string} maybeName [optional]\n   * @param {(function|object)[]} signature providers\n   * @returns {typed-function}\n   */\n  typed = function (maybeName) {\n    const named = typeof maybeName === 'string'\n    const start = named ? 1 : 0\n    let name = named ? maybeName : ''\n    const allSignatures = {}\n    for (let i = start; i < arguments.length; ++i) {\n      const item = arguments[i]\n      let theseSignatures = {}\n      let thisName\n      if (typeof item === 'function') {\n        thisName = item.name\n        if (typeof item.signature === 'string') {\n          // Case 1: Ordinary function with a string 'signature' property\n          theseSignatures[item.signature] = item\n        } else if (isTypedFunction(item)) {\n          // Case 2: Existing typed function\n          theseSignatures = item.signatures\n        }\n      } else if (isPlainObject(item)) {\n        // Case 3: Plain object, assume keys = signatures, values = functions\n        theseSignatures = item\n        if (!named) {\n          thisName = getObjectName(item)\n        }\n      }\n\n      if (Object.keys(theseSignatures).length === 0) {\n        const err = new TypeError(\n          'Argument to \\'typed\\' at index ' + i + ' is not a (typed) function, ' +\n          'nor an object with signatures as keys and functions as values.')\n        err.data = { index: i, argument: item }\n        throw err\n      }\n\n      if (!named) {\n        name = checkName(name, thisName)\n      }\n      mergeSignatures(allSignatures, theseSignatures)\n    }\n\n    return createTypedFunction(name || '', allSignatures)\n  }\n\n  typed.create = create\n  typed.createCount = saveTyped.createCount\n  typed.onMismatch = _onMismatch\n  typed.throwMismatchError = _onMismatch\n  typed.createError = createError\n  typed.clear = clear\n  typed.clearConversions = clearConversions\n  typed.addTypes = addTypes\n  typed._findType = findType // For unit testing only\n  typed.referTo = referTo\n  typed.referToSelf = referToSelf\n  typed.convert = convert\n  typed.findSignature = findSignature\n  typed.find = find\n  typed.isTypedFunction = isTypedFunction\n  typed.warnAgainstDeprecatedThis = true\n\n  /**\n   * add a type (convenience wrapper for typed.addTypes)\n   * @param {{name: string, test: function}} type\n   * @param {boolean} [beforeObjectTest=true]\n   *                          If true, the new test will be inserted before\n   *                          the test with name 'Object' (if any), since\n   *                          tests for Object match Array and classes too.\n   */\n  typed.addType = function (type, beforeObjectTest) {\n    let before = 'any'\n    if (beforeObjectTest !== false && typeMap.has('Object')) {\n      before = 'Object'\n    }\n    typed.addTypes([type], before)\n  }\n\n  /**\n   * Verify that the ConversionDef conversion has a valid format.\n   *\n   * @param {conversionDef} conversion\n   * @return {void}\n   * @throws {TypeError|SyntaxError}\n   */\n  function _validateConversion (conversion) {\n    if (!conversion ||\n      typeof conversion.from !== 'string' ||\n      typeof conversion.to !== 'string' ||\n      typeof conversion.convert !== 'function') {\n      throw new TypeError('Object with properties {from: string, to: string, convert: function} expected')\n    }\n    if (conversion.to === conversion.from) {\n      throw new SyntaxError(\n        'Illegal to define conversion from \"' + conversion.from +\n        '\" to itself.')\n    }\n  }\n\n  /**\n   * Add a conversion\n   *\n   * @param {ConversionDef} conversion\n   * @param {{override: boolean}} [options]\n   * @returns {void}\n   * @throws {TypeError}\n   */\n  typed.addConversion = function (conversion, options = { override: false }) {\n    _validateConversion(conversion)\n\n    const to = findType(conversion.to)\n    const existing = to.conversionsTo.find((other) => other.from === conversion.from)\n\n    if (existing) {\n      if (options && options.override) {\n        typed.removeConversion({ from: existing.from, to: conversion.to, convert: existing.convert })\n      } else {\n        throw new Error(\n          'There is already a conversion from \"' + conversion.from + '\" to \"' +\n          to.name + '\"')\n      }\n    }\n\n    to.conversionsTo.push({\n      from: conversion.from,\n      to: to.name,\n      convert: conversion.convert,\n      index: nConversions++\n    })\n  }\n\n  /**\n   * Convenience wrapper to call addConversion on each conversion in a list.\n   *\n   * @param {ConversionDef[]} conversions\n   * @param {{override: boolean}} [options]\n   * @returns {void}\n   * @throws {TypeError}\n   */\n  typed.addConversions = function (conversions, options) {\n    conversions.forEach(conversion => typed.addConversion(conversion, options))\n  }\n\n  /**\n   * Remove the specified conversion. The format is the same as for\n   * addConversion, and the convert function must match or an error\n   * is thrown.\n   *\n   * @param {{from: string, to: string, convert: function}} conversion\n   * @returns {void}\n   * @throws {TypeError|SyntaxError|Error}\n   */\n  typed.removeConversion = function (conversion) {\n    _validateConversion(conversion)\n    const to = findType(conversion.to)\n    const existingConversion =\n      findInArray(to.conversionsTo, c => (c.from === conversion.from))\n    if (!existingConversion) {\n      throw new Error(\n        'Attempt to remove nonexistent conversion from ' + conversion.from +\n        ' to ' + conversion.to)\n    }\n    if (existingConversion.convert !== conversion.convert) {\n      throw new Error(\n        'Conversion to remove does not match existing conversion')\n    }\n    const index = to.conversionsTo.indexOf(existingConversion)\n    to.conversionsTo.splice(index, 1)\n  }\n\n  /**\n   * Produce the specific signature that a typed function\n   * will execute on the given arguments. Here, a \"signature\" is an\n   * object with properties 'params', 'test', 'fn', and 'implementation'.\n   * This last property is a function that converts params as necessary\n   * and then calls 'fn'. Returns null if there is no matching signature.\n   * @param {typed-function} tf\n   * @param {any[]} argList\n   * @returns {{params: string, test: function, fn: function, implementation: function}}\n   */\n  typed.resolve = function (tf, argList) {\n    if (!isTypedFunction(tf)) {\n      throw new TypeError(NOT_TYPED_FUNCTION)\n    }\n    const sigs = tf._typedFunctionData.signatures\n    for (let i = 0; i < sigs.length; ++i) {\n      if (sigs[i].test(argList)) {\n        return sigs[i]\n      }\n    }\n    return null\n  }\n\n  return typed\n}\n\nexport default create()\n","import { pickShallow } from './object.js';\n\n/**\n * Create a factory function, which can be used to inject dependencies.\n *\n * The created functions are memoized, a consecutive call of the factory\n * with the exact same inputs will return the same function instance.\n * The memoized cache is exposed on `factory.cache` and can be cleared\n * if needed.\n *\n * Example:\n *\n *     const name = 'log'\n *     const dependencies = ['config', 'typed', 'divideScalar', 'Complex']\n *\n *     export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {\n *       // ... create the function log here and return it\n *     }\n *\n * @param {string} name           Name of the function to be created\n * @param {string[]} dependencies The names of all required dependencies\n * @param {function} create       Callback function called with an object with all dependencies\n * @param {Object} [meta]\n *     Optional object with meta information that will be attached\n *     to the created factory function as property `meta`. For explanation\n *     of what meta properties can be specified and what they mean, see\n *     docs/core/extension.md.\n * @returns {function}\n */\nexport function factory(name, dependencies, create, meta) {\n  function assertAndCreate(scope) {\n    // we only pass the requested dependencies to the factory function\n    // to prevent functions to rely on dependencies that are not explicitly\n    // requested.\n    var deps = pickShallow(scope, dependencies.map(stripOptionalNotation));\n    assertDependencies(name, dependencies, scope);\n    return create(deps);\n  }\n  assertAndCreate.isFactory = true;\n  assertAndCreate.fn = name;\n  assertAndCreate.dependencies = dependencies.slice().sort();\n  if (meta) {\n    assertAndCreate.meta = meta;\n  }\n  return assertAndCreate;\n}\n\n/**\n * Sort all factories such that when loading in order, the dependencies are resolved.\n *\n * @param {Array} factories\n * @returns {Array} Returns a new array with the sorted factories.\n */\nexport function sortFactories(factories) {\n  var factoriesByName = {};\n  factories.forEach(factory => {\n    factoriesByName[factory.fn] = factory;\n  });\n  function containsDependency(factory, dependency) {\n    // TODO: detect circular references\n    if (isFactory(factory)) {\n      if (factory.dependencies.includes(dependency.fn || dependency.name)) {\n        return true;\n      }\n      if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {\n        return true;\n      }\n    }\n    return false;\n  }\n  var sorted = [];\n  function addFactory(factory) {\n    var index = 0;\n    while (index < sorted.length && !containsDependency(sorted[index], factory)) {\n      index++;\n    }\n    sorted.splice(index, 0, factory);\n  }\n\n  // sort regular factory functions\n  factories.filter(isFactory).forEach(addFactory);\n\n  // sort legacy factory functions AFTER the regular factory functions\n  factories.filter(factory => !isFactory(factory)).forEach(addFactory);\n  return sorted;\n}\n\n// TODO: comment or cleanup if unused in the end\nexport function create(factories) {\n  var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  sortFactories(factories).forEach(factory => factory(scope));\n  return scope;\n}\n\n/**\n * Test whether an object is a factory. This is the case when it has\n * properties name, dependencies, and a function create.\n * @param {*} obj\n * @returns {boolean}\n */\nexport function isFactory(obj) {\n  return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);\n}\n\n/**\n * Assert that all dependencies of a list with dependencies are available in the provided scope.\n *\n * Will throw an exception when there are dependencies missing.\n *\n * @param {string} name   Name for the function to be created. Used to generate a useful error message\n * @param {string[]} dependencies\n * @param {Object} scope\n */\nexport function assertDependencies(name, dependencies, scope) {\n  var allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals\n  .every(dependency => scope[dependency] !== undefined);\n  if (!allDefined) {\n    var missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined);\n\n    // TODO: create a custom error class for this, a MathjsError or something like that\n    throw new Error(\"Cannot create function \\\"\".concat(name, \"\\\", \") + \"some dependencies are missing: \".concat(missingDependencies.map(d => \"\\\"\".concat(d, \"\\\"\")).join(', '), \".\"));\n  }\n}\nexport function isOptionalDependency(dependency) {\n  return dependency && dependency[0] === '?';\n}\nexport function stripOptionalNotation(dependency) {\n  return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;\n}","import { isBigNumber, isNumber, isObject } from './is.js';\n\n/**\n * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue\n */\n\n/**\n * Check if a number is integer\n * @param {number | boolean} value\n * @return {boolean} isInteger\n */\nexport function isInteger(value) {\n  if (typeof value === 'boolean') {\n    return true;\n  }\n  return Number.isFinite(value) ? value === Math.round(value) : false;\n}\n\n/**\n * Ensure the number type is compatible with the provided value.\n * If not, return 'number' instead.\n *\n * For example:\n *\n *     safeNumberType('2.3', { number: 'bigint', numberFallback: 'number' })\n *\n * will return 'number' and not 'bigint' because trying to create a bigint with\n * value 2.3 would throw an exception.\n *\n * @param {string} numberStr\n * @param {{\n *   number: 'number' | 'BigNumber' | 'bigint' | 'Fraction'\n *   numberFallback: 'number' | 'BigNumber'\n * }} config\n * @returns {'number' | 'BigNumber' | 'bigint' | 'Fraction'}\n */\nexport function safeNumberType(numberStr, config) {\n  if (config.number === 'bigint') {\n    try {\n      BigInt(numberStr);\n    } catch (_unused) {\n      return config.numberFallback;\n    }\n  }\n  return config.number;\n}\n\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sign = Math.sign || function (x) {\n  if (x > 0) {\n    return 1;\n  } else if (x < 0) {\n    return -1;\n  } else {\n    return 0;\n  }\n};\n\n/**\n * Calculate the base-2 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log2 = Math.log2 || function log2(x) {\n  return Math.log(x) / Math.LN2;\n};\n\n/**\n * Calculate the base-10 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log10 = Math.log10 || function log10(x) {\n  return Math.log(x) / Math.LN10;\n};\n\n/**\n * Calculate the natural logarithm of a number + 1\n * @param {number} x\n * @returns {number}\n */\nexport var log1p = Math.log1p || function (x) {\n  return Math.log(x + 1);\n};\n\n/**\n * Calculate cubic root for a number\n *\n * Code from es6-shim.js:\n *   https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577\n *\n * @param {number} x\n * @returns {number} Returns the cubic root of x\n */\nexport var cbrt = Math.cbrt || function cbrt(x) {\n  if (x === 0) {\n    return x;\n  }\n  var negate = x < 0;\n  var result;\n  if (negate) {\n    x = -x;\n  }\n  if (Number.isFinite(x)) {\n    result = Math.exp(Math.log(x) / 3);\n    // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods\n    result = (x / (result * result) + 2 * result) / 3;\n  } else {\n    result = x;\n  }\n  return negate ? -result : result;\n};\n\n/**\n * Calculates exponentiation minus 1\n * @param {number} x\n * @return {number} res\n */\nexport var expm1 = Math.expm1 || function expm1(x) {\n  return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;\n};\n\n/**\n * Formats a number in a given base\n * @param {number} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatNumberToBase(n, base, size) {\n  var prefixes = {\n    2: '0b',\n    8: '0o',\n    16: '0x'\n  };\n  var prefix = prefixes[base];\n  var suffix = '';\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\n    }\n    if (n > 2 ** (size - 1) - 1 || n < -(2 ** (size - 1))) {\n      throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n    }\n    if (!isInteger(n)) {\n      throw new Error('Value must be an integer');\n    }\n    if (n < 0) {\n      n = n + 2 ** size;\n    }\n    suffix = \"i\".concat(size);\n  }\n  var sign = '';\n  if (n < 0) {\n    n = -n;\n    sign = '-';\n  }\n  return \"\".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);\n}\n\n/**\n * Convert a number to a formatted string representation.\n *\n * Syntax:\n *\n *    format(value)\n *    format(value, options)\n *    format(value, precision)\n *    format(value, fn)\n *\n * Where:\n *\n *    {number} value   The value to be formatted\n *    {Object} options An object with formatting options. Available options:\n *                     {string} notation\n *                         Number notation. Choose from:\n *                         'fixed'          Always use regular number notation.\n *                                          For example '123.40' and '14000000'\n *                         'exponential'    Always use exponential notation.\n *                                          For example '1.234e+2' and '1.4e+7'\n *                         'engineering'    Always use engineering notation.\n *                                          For example '123.4e+0' and '14.0e+6'\n *                         'auto' (default) Regular number notation for numbers\n *                                          having an absolute value between\n *                                          `lowerExp` and `upperExp` bounds, and\n *                                          uses exponential notation elsewhere.\n *                                          Lower bound is included, upper bound\n *                                          is excluded.\n *                                          For example '123.4' and '1.4e7'.\n *                         'bin', 'oct, or\n *                         'hex'            Format the number using binary, octal,\n *                                          or hexadecimal notation.\n *                                          For example '0b1101' and '0x10fe'.\n *                     {number} wordSize    The word size in bits to use for formatting\n *                                          in binary, octal, or hexadecimal notation.\n *                                          To be used only with 'bin', 'oct', or 'hex'\n *                                          values for 'notation' option. When this option\n *                                          is defined the value is formatted as a signed\n *                                          twos complement integer of the given word size\n *                                          and the size suffix is appended to the output.\n *                                          For example\n *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n *                                          Default value is undefined.\n *                     {number} precision   A number between 0 and 16 to round\n *                                          the digits of the number.\n *                                          In case of notations 'exponential',\n *                                          'engineering', and 'auto',\n *                                          `precision` defines the total\n *                                          number of significant digits returned.\n *                                          In case of notation 'fixed',\n *                                          `precision` defines the number of\n *                                          significant digits after the decimal\n *                                          point.\n *                                          `precision` is undefined by default,\n *                                          not rounding any digits.\n *                     {number} lowerExp    Exponent determining the lower boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `-3`.\n *                     {number} upperExp    Exponent determining the upper boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `5`.\n *    {Function} fn    A custom formatting function. Can be used to override the\n *                     built-in notations. Function `fn` is called with `value` as\n *                     parameter and must return a string. Is useful for example to\n *                     format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n *    format(6.4)                                        // '6.4'\n *    format(1240000)                                    // '1.24e6'\n *    format(1/3)                                        // '0.3333333333333333'\n *    format(1/3, 3)                                     // '0.333'\n *    format(21385, 2)                                   // '21000'\n *    format(12.071, {notation: 'fixed'})                // '12'\n *    format(2.3,    {notation: 'fixed', precision: 2})  // '2.30'\n *    format(52.8,   {notation: 'exponential'})          // '5.28e+1'\n *    format(12345678, {notation: 'engineering'})        // '12.345678e+6'\n *\n * @param {number} value\n * @param {Object | Function | number} [options]\n * @return {string} str The formatted value\n */\nexport function format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  }\n\n  // handle special cases\n  if (value === Infinity) {\n    return 'Infinity';\n  } else if (value === -Infinity) {\n    return '-Infinity';\n  } else if (isNaN(value)) {\n    return 'NaN';\n  }\n  var {\n    notation,\n    precision,\n    wordSize\n  } = normalizeFormatOptions(options);\n\n  // handle the various notations\n  switch (notation) {\n    case 'fixed':\n      return toFixed(value, precision);\n    case 'exponential':\n      return toExponential(value, precision);\n    case 'engineering':\n      return toEngineering(value, precision);\n    case 'bin':\n      return formatNumberToBase(value, 2, wordSize);\n    case 'oct':\n      return formatNumberToBase(value, 8, wordSize);\n    case 'hex':\n      return formatNumberToBase(value, 16, wordSize);\n    case 'auto':\n      // remove trailing zeros after the decimal point\n      return toPrecision(value, precision, options).replace(/((\\.\\d*?)(0+))($|e)/, function () {\n        var digits = arguments[2];\n        var e = arguments[4];\n        return digits !== '.' ? digits + e : e;\n      });\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n  }\n}\n\n/**\n * Normalize format options into an object:\n *   {\n *     notation: string,\n *     precision: number | undefined,\n *     wordSize: number | undefined\n *   }\n */\nexport function normalizeFormatOptions(options) {\n  // default values for options\n  var notation = 'auto';\n  var precision;\n  var wordSize;\n  if (options !== undefined) {\n    if (isNumber(options)) {\n      precision = options;\n    } else if (isBigNumber(options)) {\n      precision = options.toNumber();\n    } else if (isObject(options)) {\n      if (options.precision !== undefined) {\n        precision = _toNumberOrThrow(options.precision, () => {\n          throw new Error('Option \"precision\" must be a number or BigNumber');\n        });\n      }\n      if (options.wordSize !== undefined) {\n        wordSize = _toNumberOrThrow(options.wordSize, () => {\n          throw new Error('Option \"wordSize\" must be a number or BigNumber');\n        });\n      }\n      if (options.notation) {\n        notation = options.notation;\n      }\n    } else {\n      throw new Error('Unsupported type of options, number, BigNumber, or object expected');\n    }\n  }\n  return {\n    notation,\n    precision,\n    wordSize\n  };\n}\n\n/**\n * Split a number into sign, coefficients, and exponent\n * @param {number | string} value\n * @return {SplitValue}\n *              Returns an object containing sign, coefficients, and exponent\n */\nexport function splitNumber(value) {\n  // parse the input value\n  var match = String(value).toLowerCase().match(/^(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/);\n  if (!match) {\n    throw new SyntaxError('Invalid number ' + value);\n  }\n  var sign = match[1];\n  var digits = match[2];\n  var exponent = parseFloat(match[4] || '0');\n  var dot = digits.indexOf('.');\n  exponent += dot !== -1 ? dot - 1 : digits.length - 1;\n  var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)\n  .replace(/^0*/, function (zeros) {\n    // remove leading zeros, add their count to the exponent\n    exponent -= zeros.length;\n    return '';\n  }).replace(/0*$/, '') // remove trailing zeros\n  .split('').map(function (d) {\n    return parseInt(d);\n  });\n  if (coefficients.length === 0) {\n    coefficients.push(0);\n    exponent++;\n  }\n  return {\n    sign,\n    coefficients,\n    exponent\n  };\n}\n\n/**\n * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision]        Optional number of significant figures to return.\n */\nexport function toEngineering(value, precision) {\n  if (isNaN(value) || !Number.isFinite(value)) {\n    return String(value);\n  }\n  var split = splitNumber(value);\n  var rounded = roundDigits(split, precision);\n  var e = rounded.exponent;\n  var c = rounded.coefficients;\n\n  // find nearest lower multiple of 3 for exponent\n  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n  if (isNumber(precision)) {\n    // add zeroes to give correct sig figs\n    while (precision > c.length || e - newExp + 1 > c.length) {\n      c.push(0);\n    }\n  } else {\n    // concatenate coefficients with necessary zeros\n    // add zeros if necessary (for example: 1e+8 -> 100e+6)\n    var missingZeros = Math.abs(e - newExp) - (c.length - 1);\n    for (var i = 0; i < missingZeros; i++) {\n      c.push(0);\n    }\n  }\n\n  // find difference in exponents\n  var expDiff = Math.abs(e - newExp);\n  var decimalIdx = 1;\n\n  // push decimal index over by expDiff times\n  while (expDiff > 0) {\n    decimalIdx++;\n    expDiff--;\n  }\n\n  // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.\n  // otherwise concat with the rest of the coefficients\n  var decimals = c.slice(decimalIdx).join('');\n  var decimalVal = isNumber(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';\n  var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n  return rounded.sign + str;\n}\n\n/**\n * Format a number with fixed notation.\n * @param {number | string} value\n * @param {number} [precision=undefined]  Optional number of decimals after the\n *                                        decimal point. null by default.\n */\nexport function toFixed(value, precision) {\n  if (isNaN(value) || !Number.isFinite(value)) {\n    return String(value);\n  }\n  var splitValue = splitNumber(value);\n  var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;\n  var c = rounded.coefficients;\n  var p = rounded.exponent + 1; // exponent may have changed\n\n  // append zeros if needed\n  var pp = p + (precision || 0);\n  if (c.length < pp) {\n    c = c.concat(zeros(pp - c.length));\n  }\n\n  // prepend zeros if needed\n  if (p < 0) {\n    c = zeros(-p + 1).concat(c);\n    p = 1;\n  }\n\n  // insert a dot if needed\n  if (p < c.length) {\n    c.splice(p, 0, p === 0 ? '0.' : '.');\n  }\n  return rounded.sign + c.join('');\n}\n\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision]  Number of digits in formatted output.\n *                              If not provided, the maximum available digits\n *                              is used.\n */\nexport function toExponential(value, precision) {\n  if (isNaN(value) || !Number.isFinite(Number(value))) {\n    return String(value);\n  }\n\n  // round if needed, else create a clone\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n  var c = rounded.coefficients;\n  var e = rounded.exponent;\n\n  // append zeros if needed\n  if (c.length < precision) {\n    c = c.concat(zeros(precision - c.length));\n  }\n\n  // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n  var first = c.shift();\n  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;\n}\n\n/**\n * Format a number with a certain precision\n * @param {number | string} value\n * @param {number} [precision=undefined] Optional number of digits.\n * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]\n *                                       By default:\n *                                         lowerExp = -3 (incl)\n *                                         upper = +5 (excl)\n * @return {string}\n */\nexport function toPrecision(value, precision, options) {\n  if (isNaN(value) || !Number.isFinite(value)) {\n    return String(value);\n  }\n\n  // determine lower and upper bound for exponential notation.\n  var lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);\n  var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n  if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {\n    // exponential notation\n    return toExponential(value, precision);\n  } else {\n    var c = rounded.coefficients;\n    var e = rounded.exponent;\n\n    // append trailing zeros\n    if (c.length < precision) {\n      c = c.concat(zeros(precision - c.length));\n    }\n\n    // append trailing zeros\n    // TODO: simplify the next statement\n    c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0)));\n\n    // prepend zeros\n    c = zeros(-e).concat(c);\n    var dot = e > 0 ? e : 0;\n    if (dot < c.length - 1) {\n      c.splice(dot + 1, 0, '.');\n    }\n    return rounded.sign + c.join('');\n  }\n}\n\n/**\n * Round the number of digits of a number *\n * @param {SplitValue} split       A value split with .splitNumber(value)\n * @param {number} precision  A positive integer\n * @return {SplitValue}\n *              Returns an object containing sign, coefficients, and exponent\n *              with rounded digits\n */\nexport function roundDigits(split, precision) {\n  // create a clone\n  var rounded = {\n    sign: split.sign,\n    coefficients: split.coefficients,\n    exponent: split.exponent\n  };\n  var c = rounded.coefficients;\n\n  // prepend zeros if needed\n  while (precision <= 0) {\n    c.unshift(0);\n    rounded.exponent++;\n    precision++;\n  }\n  if (c.length > precision) {\n    var removed = c.splice(precision, c.length - precision);\n    if (removed[0] >= 5) {\n      var i = precision - 1;\n      c[i]++;\n      while (c[i] === 10) {\n        c.pop();\n        if (i === 0) {\n          c.unshift(0);\n          rounded.exponent++;\n          i++;\n        }\n        i--;\n        c[i]++;\n      }\n    }\n  }\n  return rounded;\n}\n\n/**\n * Create an array filled with zeros.\n * @param {number} length\n * @return {Array}\n */\nfunction zeros(length) {\n  var arr = [];\n  for (var i = 0; i < length; i++) {\n    arr.push(0);\n  }\n  return arr;\n}\n\n/**\n * Count the number of significant digits of a number.\n *\n * For example:\n *   2.34 returns 3\n *   0.0034 returns 2\n *   120.5e+30 returns 4\n *\n * @param {number} value\n * @return {number} digits   Number of significant digits\n */\nexport function digits(value) {\n  return value.toExponential().replace(/e.*$/, '') // remove exponential notation\n  .replace(/^0\\.?0*|\\./, '') // remove decimal point and leading zeros\n  .length;\n}\n\n/**\n * Compares two floating point numbers.\n * @param {number} a - First value to compare\n * @param {number} b - Second value to compare\n * @param {number} [relTol=1e-09] - The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.\n * @param {number} [absTol=1e-12] - The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.\n * @return {boolean} whether the two numbers are nearly equal\n *\n * @throws {Error} If `relTol` is less than or equal to 0.\n * @throws {Error} If `absTol` is less than 0.\n *\n * @example\n * nearlyEqual(1.000000001, 1.0, 1e-8);            // true\n * nearlyEqual(1.000000002, 1.0, 0);            // false\n * nearlyEqual(1.0, 1.009, undefined, 0.01);       // true\n * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true\n */\nexport function nearlyEqual(a, b) {\n  var relTol = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1e-8;\n  var absTol = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;\n  if (relTol <= 0) {\n    throw new Error('Relative tolerance must be greater than 0');\n  }\n  if (absTol < 0) {\n    throw new Error('Absolute tolerance must be at least 0');\n  }\n\n  // NaN\n  if (isNaN(a) || isNaN(b)) {\n    return false;\n  }\n  if (!Number.isFinite(a) || !Number.isFinite(b)) {\n    return a === b;\n  }\n  if (a === b) {\n    return true;\n  }\n\n  // abs(a-b) <= max(rel_tol * max(abs(a), abs(b)), abs_tol)\n  return Math.abs(a - b) <= Math.max(relTol * Math.max(Math.abs(a), Math.abs(b)), absTol);\n}\n\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\n */\nexport var acosh = Math.acosh || function (x) {\n  return Math.log(Math.sqrt(x * x - 1) + x);\n};\nexport var asinh = Math.asinh || function (x) {\n  return Math.log(Math.sqrt(x * x + 1) + x);\n};\n\n/**\n * Calculate the hyperbolic arctangent of a number\n * @param {number} x\n * @return {number}\n */\nexport var atanh = Math.atanh || function (x) {\n  return Math.log((1 + x) / (1 - x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n */\nexport var cosh = Math.cosh || function (x) {\n  return (Math.exp(x) + Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic sine of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sinh = Math.sinh || function (x) {\n  return (Math.exp(x) - Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic tangent of a number\n * @param {number} x\n * @returns {number}\n */\nexport var tanh = Math.tanh || function (x) {\n  var e = Math.exp(2 * x);\n  return (e - 1) / (e + 1);\n};\n\n/**\n * Returns a value with the magnitude of x and the sign of y.\n * @param {number} x\n * @param {number} y\n * @returns {number}\n */\nexport function copysign(x, y) {\n  var signx = x > 0 ? true : x < 0 ? false : 1 / x === Infinity;\n  var signy = y > 0 ? true : y < 0 ? false : 1 / y === Infinity;\n  return signx ^ signy ? -x : x;\n}\nfunction _toNumberOrThrow(value, onError) {\n  if (isNumber(value)) {\n    return value;\n  } else if (isBigNumber(value)) {\n    return value.toNumber();\n  } else {\n    onError();\n  }\n}\nfunction _toNumberOrDefault(value, defaultValue) {\n  if (isNumber(value)) {\n    return value;\n  } else if (isBigNumber(value)) {\n    return value.toNumber();\n  } else {\n    return defaultValue;\n  }\n}","/**\n * Create a typed-function which checks the types of the arguments and\n * can match them against multiple provided signatures. The typed-function\n * automatically converts inputs in order to find a matching signature.\n * Typed functions throw informative errors in case of wrong input arguments.\n *\n * See the library [typed-function](https://github.com/josdejong/typed-function)\n * for detailed documentation.\n *\n * Syntax:\n *\n *     math.typed(name, signatures) : function\n *     math.typed(signatures) : function\n *\n * Examples:\n *\n *     // create a typed function with multiple types per argument (type union)\n *     const fn2 = typed({\n *       'number | boolean': function (b) {\n *         return 'b is a number or boolean'\n *       },\n *       'string, number | boolean': function (a, b) {\n *         return 'a is a string, b is a number or boolean'\n *       }\n *     })\n *\n *     // create a typed function with an any type argument\n *     const log = typed({\n *       'string, any': function (event, data) {\n *         console.log('event: ' + event + ', data: ' + JSON.stringify(data))\n *       }\n *     })\n *\n * @param {string} [name]                          Optional name for the typed-function\n * @param {Object<string, function>} signatures   Object with one or multiple function signatures\n * @returns {function} The created typed-function.\n */\n\nimport typedFunction from 'typed-function';\nimport { factory } from '../../utils/factory.js';\nimport { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigInt, isBigNumber, isBlockNode, isBoolean, isChain, isCollection, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMap, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isOperatorNode, isParenthesisNode, isRange, isRangeNode, isRegExp, isRelationalNode, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../../utils/is.js';\nimport { digits } from '../../utils/number.js';\n\n// returns a new instance of typed-function\nvar _createTyped2 = function _createTyped() {\n  // initially, return the original instance of typed-function\n  // consecutively, return a new instance from typed.create.\n  _createTyped2 = typedFunction.create;\n  return typedFunction;\n};\nvar dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];\n\n/**\n * Factory function for creating a new typed instance\n * @param {Object} dependencies   Object with data types like Complex and BigNumber\n * @returns {Function}\n */\nexport var createTyped = /* #__PURE__ */factory('typed', dependencies, function createTyped(_ref) {\n  var {\n    BigNumber,\n    Complex,\n    DenseMatrix,\n    Fraction\n  } = _ref;\n  // TODO: typed-function must be able to silently ignore signatures with unknown data types\n\n  // get a new instance of typed-function\n  var typed = _createTyped2();\n\n  // define all types. The order of the types determines in which order function\n  // arguments are type-checked (so for performance it's important to put the\n  // most used types first).\n  typed.clear();\n  typed.addTypes([{\n    name: 'number',\n    test: isNumber\n  }, {\n    name: 'Complex',\n    test: isComplex\n  }, {\n    name: 'BigNumber',\n    test: isBigNumber\n  }, {\n    name: 'bigint',\n    test: isBigInt\n  }, {\n    name: 'Fraction',\n    test: isFraction\n  }, {\n    name: 'Unit',\n    test: isUnit\n  },\n  // The following type matches a valid variable name, i.e., an alphanumeric\n  // string starting with an alphabetic character. It is used (at least)\n  // in the definition of the derivative() function, as the argument telling\n  // what to differentiate over must (currently) be a variable.\n  // TODO: deprecate the identifier type (it's not used anymore, see https://github.com/josdejong/mathjs/issues/3253)\n  {\n    name: 'identifier',\n    test: s => isString && /^(?:[A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088F\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5C\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDC-\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C8A\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7DC\\uA7F1-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDDC0-\\uDDF3\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD40-\\uDD59\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDD4A-\\uDD65\\uDD6F-\\uDD85\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDEC2-\\uDEC7\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE3F\\uDE40\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61\\uDF80-\\uDF89\\uDF8B\\uDF8E\\uDF90-\\uDFB5\\uDFB7\\uDFD1\\uDFD3]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8\\uDFC0-\\uDFE0]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDDB0-\\uDDDB\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD80E\\uD80F\\uD81C-\\uD822\\uD840-\\uD868\\uD86A-\\uD86D\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD88C][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2F\\uDC41-\\uDC46\\uDC60-\\uDFFF]|\\uD810[\\uDC00-\\uDFFA]|\\uD811[\\uDC00-\\uDE46]|\\uD818[\\uDD00-\\uDD1D]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDD40-\\uDD6C\\uDE40-\\uDE7F\\uDEA0-\\uDEB8\\uDEBB-\\uDED3\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3\\uDFF2\\uDFF3]|\\uD823[\\uDC00-\\uDCD5\\uDCFF-\\uDD1E\\uDD80-\\uDDF2]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD32\\uDD50-\\uDD52\\uDD55\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E\\uDF25-\\uDF2A]|\\uD838[\\uDC30-\\uDC6D\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDCD0-\\uDCEB\\uDDD0-\\uDDED\\uDDF0\\uDEC0-\\uDEDE\\uDEE0-\\uDEE2\\uDEE4\\uDEE5\\uDEE7-\\uDEED\\uDEF0-\\uDEF4\\uDEFE\\uDEFF\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEAD\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0\\uDFF0-\\uDFFF]|\\uD87B[\\uDC00-\\uDE5D]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD88D[\\uDC00-\\uDC79])(?:[0-9A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088F\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5C\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDC-\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C8A\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7DC\\uA7F1-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDDC0-\\uDDF3\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD40-\\uDD59\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDD4A-\\uDD65\\uDD6F-\\uDD85\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDEC2-\\uDEC7\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE3F\\uDE40\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61\\uDF80-\\uDF89\\uDF8B\\uDF8E\\uDF90-\\uDFB5\\uDFB7\\uDFD1\\uDFD3]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8\\uDFC0-\\uDFE0]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDDB0-\\uDDDB\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD80E\\uD80F\\uD81C-\\uD822\\uD840-\\uD868\\uD86A-\\uD86D\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD88C][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2F\\uDC41-\\uDC46\\uDC60-\\uDFFF]|\\uD810[\\uDC00-\\uDFFA]|\\uD811[\\uDC00-\\uDE46]|\\uD818[\\uDD00-\\uDD1D]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDD40-\\uDD6C\\uDE40-\\uDE7F\\uDEA0-\\uDEB8\\uDEBB-\\uDED3\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3\\uDFF2\\uDFF3]|\\uD823[\\uDC00-\\uDCD5\\uDCFF-\\uDD1E\\uDD80-\\uDDF2]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD32\\uDD50-\\uDD52\\uDD55\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E\\uDF25-\\uDF2A]|\\uD838[\\uDC30-\\uDC6D\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDCD0-\\uDCEB\\uDDD0-\\uDDED\\uDDF0\\uDEC0-\\uDEDE\\uDEE0-\\uDEE2\\uDEE4\\uDEE5\\uDEE7-\\uDEED\\uDEF0-\\uDEF4\\uDEFE\\uDEFF\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEAD\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0\\uDFF0-\\uDFFF]|\\uD87B[\\uDC00-\\uDE5D]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD88D[\\uDC00-\\uDC79])*$/.test(s)\n  }, {\n    name: 'string',\n    test: isString\n  }, {\n    name: 'Chain',\n    test: isChain\n  }, {\n    name: 'Array',\n    test: isArray\n  }, {\n    name: 'Matrix',\n    test: isMatrix\n  }, {\n    name: 'DenseMatrix',\n    test: isDenseMatrix\n  }, {\n    name: 'SparseMatrix',\n    test: isSparseMatrix\n  }, {\n    name: 'Range',\n    test: isRange\n  }, {\n    name: 'Index',\n    test: isIndex\n  }, {\n    name: 'boolean',\n    test: isBoolean\n  }, {\n    name: 'ResultSet',\n    test: isResultSet\n  }, {\n    name: 'Help',\n    test: isHelp\n  }, {\n    name: 'function',\n    test: isFunction\n  }, {\n    name: 'Date',\n    test: isDate\n  }, {\n    name: 'RegExp',\n    test: isRegExp\n  }, {\n    name: 'null',\n    test: isNull\n  }, {\n    name: 'undefined',\n    test: isUndefined\n  }, {\n    name: 'AccessorNode',\n    test: isAccessorNode\n  }, {\n    name: 'ArrayNode',\n    test: isArrayNode\n  }, {\n    name: 'AssignmentNode',\n    test: isAssignmentNode\n  }, {\n    name: 'BlockNode',\n    test: isBlockNode\n  }, {\n    name: 'ConditionalNode',\n    test: isConditionalNode\n  }, {\n    name: 'ConstantNode',\n    test: isConstantNode\n  }, {\n    name: 'FunctionNode',\n    test: isFunctionNode\n  }, {\n    name: 'FunctionAssignmentNode',\n    test: isFunctionAssignmentNode\n  }, {\n    name: 'IndexNode',\n    test: isIndexNode\n  }, {\n    name: 'Node',\n    test: isNode\n  }, {\n    name: 'ObjectNode',\n    test: isObjectNode\n  }, {\n    name: 'OperatorNode',\n    test: isOperatorNode\n  }, {\n    name: 'ParenthesisNode',\n    test: isParenthesisNode\n  }, {\n    name: 'RangeNode',\n    test: isRangeNode\n  }, {\n    name: 'RelationalNode',\n    test: isRelationalNode\n  }, {\n    name: 'SymbolNode',\n    test: isSymbolNode\n  }, {\n    name: 'Map',\n    test: isMap\n  }, {\n    name: 'Object',\n    test: isObject\n  } // order 'Object' last, it matches on other classes too\n  ]);\n  typed.addConversions([{\n    from: 'number',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n\n      // note: conversion from number to BigNumber can fail if x has >15 digits\n      if (digits(x) > 15) {\n        throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');\n      }\n      return new BigNumber(x);\n    }\n  }, {\n    from: 'number',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      return new Complex(x, 0);\n    }\n  }, {\n    from: 'BigNumber',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      return new Complex(x.toNumber(), 0);\n    }\n  }, {\n    from: 'bigint',\n    to: 'number',\n    convert: function convert(x) {\n      if (x > Number.MAX_SAFE_INTEGER) {\n        throw new TypeError('Cannot implicitly convert bigint to number: ' + 'value exceeds the max safe integer value (value: ' + x + ')');\n      }\n      return Number(x);\n    }\n  }, {\n    from: 'bigint',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n      return new BigNumber(x.toString());\n    }\n  }, {\n    from: 'bigint',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      return new Fraction(x);\n    }\n  }, {\n    from: 'Fraction',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' + 'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.');\n    }\n  }, {\n    from: 'Fraction',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      return new Complex(x.valueOf(), 0);\n    }\n  }, {\n    from: 'number',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      var f = new Fraction(x);\n      if (f.valueOf() !== x) {\n        throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' + '(value: ' + x + '). ' + 'Use function fraction(x) to convert to Fraction.');\n      }\n      return f;\n    }\n  }, {\n    // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`\n    //  from: 'Fraction',\n    //  to: 'number',\n    //  convert: function (x) {\n    //    return x.valueOf()\n    //  }\n    // }, {\n    from: 'string',\n    to: 'number',\n    convert: function convert(x) {\n      var n = Number(x);\n      if (isNaN(n)) {\n        throw new Error('Cannot convert \"' + x + '\" to a number');\n      }\n      return n;\n    }\n  }, {\n    from: 'string',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n      try {\n        return new BigNumber(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to BigNumber');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'bigint',\n    convert: function convert(x) {\n      try {\n        return BigInt(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to BigInt');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      try {\n        return new Fraction(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to Fraction');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      try {\n        return new Complex(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to Complex');\n      }\n    }\n  }, {\n    from: 'boolean',\n    to: 'number',\n    convert: function convert(x) {\n      return +x;\n    }\n  }, {\n    from: 'boolean',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n      return new BigNumber(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'bigint',\n    convert: function convert(x) {\n      return BigInt(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      return new Fraction(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'string',\n    convert: function convert(x) {\n      return String(x);\n    }\n  }, {\n    from: 'Array',\n    to: 'Matrix',\n    convert: function convert(array) {\n      if (!DenseMatrix) {\n        throwNoMatrix();\n      }\n      return new DenseMatrix(array);\n    }\n  }, {\n    from: 'Matrix',\n    to: 'Array',\n    convert: function convert(matrix) {\n      return matrix.valueOf();\n    }\n  }]);\n\n  // Provide a suggestion on how to call a function elementwise\n  // This was added primarily as guidance for the v10 -> v11 transition,\n  // and could potentially be removed in the future if it no longer seems\n  // to be helpful.\n  typed.onMismatch = (name, args, signatures) => {\n    var usualError = typed.createError(name, args, signatures);\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n    // check if the function can be unary:\n    signatures.some(sig => !sig.params.includes(','))) {\n      var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n      err.data = usualError.data;\n      throw err;\n    }\n    throw usualError;\n  };\n\n  // Provide a suggestion on how to call a function elementwise\n  // This was added primarily as guidance for the v10 -> v11 transition,\n  // and could potentially be removed in the future if it no longer seems\n  // to be helpful.\n  typed.onMismatch = (name, args, signatures) => {\n    var usualError = typed.createError(name, args, signatures);\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n    // check if the function can be unary:\n    signatures.some(sig => !sig.params.includes(','))) {\n      var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n      err.data = usualError.data;\n      throw err;\n    }\n    throw usualError;\n  };\n  return typed;\n});\nfunction throwNoBignumber(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a BigNumber: no class 'BigNumber' provided\"));\n}\nfunction throwNoComplex(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a Complex number: no class 'Complex' provided\"));\n}\nfunction throwNoMatrix() {\n  throw new Error('Cannot convert array into a Matrix: no class \\'DenseMatrix\\' provided');\n}\nfunction throwNoFraction(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a Fraction, no class 'Fraction' provided.\"));\n}","/*!\r\n *  decimal.js v10.6.0\r\n *  An arbitrary-precision Decimal type for JavaScript.\r\n *  https://github.com/MikeMcl/decimal.js\r\n *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>\r\n *  MIT Licence\r\n */\r\n\r\n\r\n// -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //\r\n\r\n\r\n  // The maximum exponent magnitude.\r\n  // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.\r\nvar EXP_LIMIT = 9e15,                      // 0 to 9e15\r\n\r\n  // The limit on the value of `precision`, and on the value of the first argument to\r\n  // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n  MAX_DIGITS = 1e9,                        // 0 to 1e9\r\n\r\n  // Base conversion alphabet.\r\n  NUMERALS = '0123456789abcdef',\r\n\r\n  // The natural logarithm of 10 (1025 digits).\r\n  LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',\r\n\r\n  // Pi (1025 digits).\r\n  PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',\r\n\r\n\r\n  // The initial configuration properties of the Decimal constructor.\r\n  DEFAULTS = {\r\n\r\n    // These values must be integers within the stated ranges (inclusive).\r\n    // Most of these values can be changed at run-time using the `Decimal.config` method.\r\n\r\n    // The maximum number of significant digits of the result of a calculation or base conversion.\r\n    // E.g. `Decimal.config({ precision: 20 });`\r\n    precision: 20,                         // 1 to MAX_DIGITS\r\n\r\n    // The rounding mode used when rounding to `precision`.\r\n    //\r\n    // ROUND_UP         0 Away from zero.\r\n    // ROUND_DOWN       1 Towards zero.\r\n    // ROUND_CEIL       2 Towards +Infinity.\r\n    // ROUND_FLOOR      3 Towards -Infinity.\r\n    // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n    // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n    // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n    // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n    // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n    //\r\n    // E.g.\r\n    // `Decimal.rounding = 4;`\r\n    // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n    rounding: 4,                           // 0 to 8\r\n\r\n    // The modulo mode used when calculating the modulus: a mod n.\r\n    // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n    // The remainder (r) is calculated as: r = a - n * q.\r\n    //\r\n    // UP         0 The remainder is positive if the dividend is negative, else is negative.\r\n    // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).\r\n    // FLOOR      3 The remainder has the same sign as the divisor (Python %).\r\n    // HALF_EVEN  6 The IEEE 754 remainder function.\r\n    // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.\r\n    //\r\n    // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian\r\n    // division (9) are commonly used for the modulus operation. The other rounding modes can also\r\n    // be used, but they may not give useful results.\r\n    modulo: 1,                             // 0 to 9\r\n\r\n    // The exponent value at and beneath which `toString` returns exponential notation.\r\n    // JavaScript numbers: -7\r\n    toExpNeg: -7,                          // 0 to -EXP_LIMIT\r\n\r\n    // The exponent value at and above which `toString` returns exponential notation.\r\n    // JavaScript numbers: 21\r\n    toExpPos:  21,                         // 0 to EXP_LIMIT\r\n\r\n    // The minimum exponent value, beneath which underflow to zero occurs.\r\n    // JavaScript numbers: -324  (5e-324)\r\n    minE: -EXP_LIMIT,                      // -1 to -EXP_LIMIT\r\n\r\n    // The maximum exponent value, above which overflow to Infinity occurs.\r\n    // JavaScript numbers: 308  (1.7976931348623157e+308)\r\n    maxE: EXP_LIMIT,                       // 1 to EXP_LIMIT\r\n\r\n    // Whether to use cryptographically-secure random number generation, if available.\r\n    crypto: false                          // true/false\r\n  },\r\n\r\n\r\n// ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n  inexact, quadrant,\r\n  external = true,\r\n\r\n  decimalError = '[DecimalError] ',\r\n  invalidArgument = decimalError + 'Invalid argument: ',\r\n  precisionLimitExceeded = decimalError + 'Precision limit exceeded',\r\n  cryptoUnavailable = decimalError + 'crypto unavailable',\r\n  tag = '[object Decimal]',\r\n\r\n  mathfloor = Math.floor,\r\n  mathpow = Math.pow,\r\n\r\n  isBinary = /^0b([01]+(\\.[01]*)?|\\.[01]+)(p[+-]?\\d+)?$/i,\r\n  isHex = /^0x([0-9a-f]+(\\.[0-9a-f]*)?|\\.[0-9a-f]+)(p[+-]?\\d+)?$/i,\r\n  isOctal = /^0o([0-7]+(\\.[0-7]*)?|\\.[0-7]+)(p[+-]?\\d+)?$/i,\r\n  isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n  BASE = 1e7,\r\n  LOG_BASE = 7,\r\n  MAX_SAFE_INTEGER = 9007199254740991,\r\n\r\n  LN10_PRECISION = LN10.length - 1,\r\n  PI_PRECISION = PI.length - 1,\r\n\r\n  // Decimal.prototype object\r\n  P = { toStringTag: tag };\r\n\r\n\r\n// Decimal prototype methods\r\n\r\n\r\n/*\r\n *  absoluteValue             abs\r\n *  ceil\r\n *  clampedTo                 clamp\r\n *  comparedTo                cmp\r\n *  cosine                    cos\r\n *  cubeRoot                  cbrt\r\n *  decimalPlaces             dp\r\n *  dividedBy                 div\r\n *  dividedToIntegerBy        divToInt\r\n *  equals                    eq\r\n *  floor\r\n *  greaterThan               gt\r\n *  greaterThanOrEqualTo      gte\r\n *  hyperbolicCosine          cosh\r\n *  hyperbolicSine            sinh\r\n *  hyperbolicTangent         tanh\r\n *  inverseCosine             acos\r\n *  inverseHyperbolicCosine   acosh\r\n *  inverseHyperbolicSine     asinh\r\n *  inverseHyperbolicTangent  atanh\r\n *  inverseSine               asin\r\n *  inverseTangent            atan\r\n *  isFinite\r\n *  isInteger                 isInt\r\n *  isNaN\r\n *  isNegative                isNeg\r\n *  isPositive                isPos\r\n *  isZero\r\n *  lessThan                  lt\r\n *  lessThanOrEqualTo         lte\r\n *  logarithm                 log\r\n *  [maximum]                 [max]\r\n *  [minimum]                 [min]\r\n *  minus                     sub\r\n *  modulo                    mod\r\n *  naturalExponential        exp\r\n *  naturalLogarithm          ln\r\n *  negated                   neg\r\n *  plus                      add\r\n *  precision                 sd\r\n *  round\r\n *  sine                      sin\r\n *  squareRoot                sqrt\r\n *  tangent                   tan\r\n *  times                     mul\r\n *  toBinary\r\n *  toDecimalPlaces           toDP\r\n *  toExponential\r\n *  toFixed\r\n *  toFraction\r\n *  toHexadecimal             toHex\r\n *  toNearest\r\n *  toNumber\r\n *  toOctal\r\n *  toPower                   pow\r\n *  toPrecision\r\n *  toSignificantDigits       toSD\r\n *  toString\r\n *  truncated                 trunc\r\n *  valueOf                   toJSON\r\n */\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the absolute value of this Decimal.\r\n *\r\n */\r\nP.absoluteValue = P.abs = function () {\r\n  var x = new this.constructor(this);\r\n  if (x.s < 0) x.s = 1;\r\n  return finalise(x);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n * direction of positive Infinity.\r\n *\r\n */\r\nP.ceil = function () {\r\n  return finalise(new this.constructor(this), this.e + 1, 2);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal clamped to the range\r\n * delineated by `min` and `max`.\r\n *\r\n * min {number|string|bigint|Decimal}\r\n * max {number|string|bigint|Decimal}\r\n *\r\n */\r\nP.clampedTo = P.clamp = function (min, max) {\r\n  var k,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n  min = new Ctor(min);\r\n  max = new Ctor(max);\r\n  if (!min.s || !max.s) return new Ctor(NaN);\r\n  if (min.gt(max)) throw Error(invalidArgument + max);\r\n  k = x.cmp(min);\r\n  return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);\r\n};\r\n\r\n\r\n/*\r\n * Return\r\n *   1    if the value of this Decimal is greater than the value of `y`,\r\n *  -1    if the value of this Decimal is less than the value of `y`,\r\n *   0    if they have the same value,\r\n *   NaN  if the value of either Decimal is NaN.\r\n *\r\n */\r\nP.comparedTo = P.cmp = function (y) {\r\n  var i, j, xdL, ydL,\r\n    x = this,\r\n    xd = x.d,\r\n    yd = (y = new x.constructor(y)).d,\r\n    xs = x.s,\r\n    ys = y.s;\r\n\r\n  // Either NaN or ±Infinity?\r\n  if (!xd || !yd) {\r\n    return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;\r\n  }\r\n\r\n  // Either zero?\r\n  if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;\r\n\r\n  // Signs differ?\r\n  if (xs !== ys) return xs;\r\n\r\n  // Compare exponents.\r\n  if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;\r\n\r\n  xdL = xd.length;\r\n  ydL = yd.length;\r\n\r\n  // Compare digit by digit.\r\n  for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n    if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;\r\n  }\r\n\r\n  // Compare lengths.\r\n  return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * cos(0)         = 1\r\n * cos(-0)        = 1\r\n * cos(Infinity)  = NaN\r\n * cos(-Infinity) = NaN\r\n * cos(NaN)       = NaN\r\n *\r\n */\r\nP.cosine = P.cos = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.d) return new Ctor(NaN);\r\n\r\n  // cos(0) = cos(-0) = 1\r\n  if (!x.d[0]) return new Ctor(1);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n  Ctor.rounding = 1;\r\n\r\n  x = cosine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/*\r\n *\r\n * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n *  cbrt(0)  =  0\r\n *  cbrt(-0) = -0\r\n *  cbrt(1)  =  1\r\n *  cbrt(-1) = -1\r\n *  cbrt(N)  =  N\r\n *  cbrt(-I) = -I\r\n *  cbrt(I)  =  I\r\n *\r\n * Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))\r\n *\r\n */\r\nP.cubeRoot = P.cbrt = function () {\r\n  var e, m, n, r, rep, s, sd, t, t3, t3plusx,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n  external = false;\r\n\r\n  // Initial estimate.\r\n  s = x.s * mathpow(x.s * x, 1 / 3);\r\n\r\n   // Math.cbrt underflow/overflow?\r\n   // Pass x to Math.pow as integer, then adjust the exponent of the result.\r\n  if (!s || Math.abs(s) == 1 / 0) {\r\n    n = digitsToString(x.d);\r\n    e = x.e;\r\n\r\n    // Adjust n exponent so it is a multiple of 3 away from x exponent.\r\n    if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');\r\n    s = mathpow(n, 1 / 3);\r\n\r\n    // Rarely, e may be one less than the result exponent value.\r\n    e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));\r\n\r\n    if (s == 1 / 0) {\r\n      n = '5e' + e;\r\n    } else {\r\n      n = s.toExponential();\r\n      n = n.slice(0, n.indexOf('e') + 1) + e;\r\n    }\r\n\r\n    r = new Ctor(n);\r\n    r.s = x.s;\r\n  } else {\r\n    r = new Ctor(s.toString());\r\n  }\r\n\r\n  sd = (e = Ctor.precision) + 3;\r\n\r\n  // Halley's method.\r\n  // TODO? Compare Newton's method.\r\n  for (;;) {\r\n    t = r;\r\n    t3 = t.times(t).times(t);\r\n    t3plusx = t3.plus(x);\r\n    r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);\r\n\r\n    // TODO? Replace with for-loop and checkRoundingDigits.\r\n    if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n      n = n.slice(sd - 3, sd + 1);\r\n\r\n      // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999\r\n      // , i.e. approaching a rounding boundary, continue the iteration.\r\n      if (n == '9999' || !rep && n == '4999') {\r\n\r\n        // On the first iteration only, check to see if rounding up gives the exact result as the\r\n        // nines may infinitely repeat.\r\n        if (!rep) {\r\n          finalise(t, e + 1, 0);\r\n\r\n          if (t.times(t).times(t).eq(x)) {\r\n            r = t;\r\n            break;\r\n          }\r\n        }\r\n\r\n        sd += 4;\r\n        rep = 1;\r\n      } else {\r\n\r\n        // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n        // If not, then there are further digits and m will be truthy.\r\n        if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n          // Truncate to the first rounding digit.\r\n          finalise(r, e + 1, 1);\r\n          m = !r.times(r).times(r).eq(x);\r\n        }\r\n\r\n        break;\r\n      }\r\n    }\r\n  }\r\n\r\n  external = true;\r\n\r\n  return finalise(r, e, Ctor.rounding, m);\r\n};\r\n\r\n\r\n/*\r\n * Return the number of decimal places of the value of this Decimal.\r\n *\r\n */\r\nP.decimalPlaces = P.dp = function () {\r\n  var w,\r\n    d = this.d,\r\n    n = NaN;\r\n\r\n  if (d) {\r\n    w = d.length - 1;\r\n    n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n    // Subtract the number of trailing zeros of the last word.\r\n    w = d[w];\r\n    if (w) for (; w % 10 == 0; w /= 10) n--;\r\n    if (n < 0) n = 0;\r\n  }\r\n\r\n  return n;\r\n};\r\n\r\n\r\n/*\r\n *  n / 0 = I\r\n *  n / N = N\r\n *  n / I = 0\r\n *  0 / n = 0\r\n *  0 / 0 = N\r\n *  0 / N = N\r\n *  0 / I = 0\r\n *  N / n = N\r\n *  N / 0 = N\r\n *  N / N = N\r\n *  N / I = N\r\n *  I / n = I\r\n *  I / 0 = I\r\n *  I / N = N\r\n *  I / I = N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.dividedBy = P.div = function (y) {\r\n  return divide(this, new this.constructor(y));\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.dividedToIntegerBy = P.divToInt = function (y) {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n  return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n *\r\n */\r\nP.equals = P.eq = function (y) {\r\n  return this.cmp(y) === 0;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n * direction of negative Infinity.\r\n *\r\n */\r\nP.floor = function () {\r\n  return finalise(new this.constructor(this), this.e + 1, 3);\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n * false.\r\n *\r\n */\r\nP.greaterThan = P.gt = function (y) {\r\n  return this.cmp(y) > 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n * otherwise return false.\r\n *\r\n */\r\nP.greaterThanOrEqualTo = P.gte = function (y) {\r\n  var k = this.cmp(y);\r\n  return k == 1 || k === 0;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [1, Infinity]\r\n *\r\n * cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...\r\n *\r\n * cosh(0)         = 1\r\n * cosh(-0)        = 1\r\n * cosh(Infinity)  = Infinity\r\n * cosh(-Infinity) = Infinity\r\n * cosh(NaN)       = NaN\r\n *\r\n *  x        time taken (ms)   result\r\n * 1000      9                 9.8503555700852349694e+433\r\n * 10000     25                4.4034091128314607936e+4342\r\n * 100000    171               1.4033316802130615897e+43429\r\n * 1000000   3817              1.5166076984010437725e+434294\r\n * 10000000  abandoned after 2 minute wait\r\n *\r\n * TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))\r\n *\r\n */\r\nP.hyperbolicCosine = P.cosh = function () {\r\n  var k, n, pr, rm, len,\r\n    x = this,\r\n    Ctor = x.constructor,\r\n    one = new Ctor(1);\r\n\r\n  if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);\r\n  if (x.isZero()) return one;\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n  Ctor.rounding = 1;\r\n  len = x.d.length;\r\n\r\n  // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1\r\n  // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))\r\n\r\n  // Estimate the optimum number of times to use the argument reduction.\r\n  // TODO? Estimation reused from cosine() and may not be optimal here.\r\n  if (len < 32) {\r\n    k = Math.ceil(len / 3);\r\n    n = (1 / tinyPow(4, k)).toString();\r\n  } else {\r\n    k = 16;\r\n    n = '2.3283064365386962890625e-10';\r\n  }\r\n\r\n  x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);\r\n\r\n  // Reverse argument reduction\r\n  var cosh2_x,\r\n    i = k,\r\n    d8 = new Ctor(8);\r\n  for (; i--;) {\r\n    cosh2_x = x.times(x);\r\n    x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));\r\n  }\r\n\r\n  return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic sine of the value in radians of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...\r\n *\r\n * sinh(0)         = 0\r\n * sinh(-0)        = -0\r\n * sinh(Infinity)  = Infinity\r\n * sinh(-Infinity) = -Infinity\r\n * sinh(NaN)       = NaN\r\n *\r\n * x        time taken (ms)\r\n * 10       2 ms\r\n * 100      5 ms\r\n * 1000     14 ms\r\n * 10000    82 ms\r\n * 100000   886 ms            1.4033316802130615897e+43429\r\n * 200000   2613 ms\r\n * 300000   5407 ms\r\n * 400000   8824 ms\r\n * 500000   13026 ms          8.7080643612718084129e+217146\r\n * 1000000  48543 ms\r\n *\r\n * TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))\r\n *\r\n */\r\nP.hyperbolicSine = P.sinh = function () {\r\n  var k, pr, rm, len,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n  Ctor.rounding = 1;\r\n  len = x.d.length;\r\n\r\n  if (len < 3) {\r\n    x = taylorSeries(Ctor, 2, x, x, true);\r\n  } else {\r\n\r\n    // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))\r\n    // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))\r\n    // 3 multiplications and 1 addition\r\n\r\n    // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))\r\n    // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))\r\n    // 4 multiplications and 2 additions\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    k = 1.4 * Math.sqrt(len);\r\n    k = k > 16 ? 16 : k | 0;\r\n\r\n    x = x.times(1 / tinyPow(5, k));\r\n    x = taylorSeries(Ctor, 2, x, x, true);\r\n\r\n    // Reverse argument reduction\r\n    var sinh2_x,\r\n      d5 = new Ctor(5),\r\n      d16 = new Ctor(16),\r\n      d20 = new Ctor(20);\r\n    for (; k--;) {\r\n      sinh2_x = x.times(x);\r\n      x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));\r\n    }\r\n  }\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(x, pr, rm, true);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * tanh(x) = sinh(x) / cosh(x)\r\n *\r\n * tanh(0)         = 0\r\n * tanh(-0)        = -0\r\n * tanh(Infinity)  = 1\r\n * tanh(-Infinity) = -1\r\n * tanh(NaN)       = NaN\r\n *\r\n */\r\nP.hyperbolicTangent = P.tanh = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite()) return new Ctor(x.s);\r\n  if (x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + 7;\r\n  Ctor.rounding = 1;\r\n\r\n  return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of\r\n * this Decimal.\r\n *\r\n * Domain: [-1, 1]\r\n * Range: [0, pi]\r\n *\r\n * acos(x) = pi/2 - asin(x)\r\n *\r\n * acos(0)       = pi/2\r\n * acos(-0)      = pi/2\r\n * acos(1)       = 0\r\n * acos(-1)      = pi\r\n * acos(1/2)     = pi/3\r\n * acos(-1/2)    = 2*pi/3\r\n * acos(|x| > 1) = NaN\r\n * acos(NaN)     = NaN\r\n *\r\n */\r\nP.inverseCosine = P.acos = function () {\r\n  var x = this,\r\n    Ctor = x.constructor,\r\n    k = x.abs().cmp(1),\r\n    pr = Ctor.precision,\r\n    rm = Ctor.rounding;\r\n\r\n  if (k !== -1) {\r\n    return k === 0\r\n      // |x| is 1\r\n      ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)\r\n      // |x| > 1 or x is NaN\r\n      : new Ctor(NaN);\r\n  }\r\n\r\n  if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n  // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3\r\n\r\n  Ctor.precision = pr + 6;\r\n  Ctor.rounding = 1;\r\n\r\n  // See https://github.com/MikeMcl/decimal.js/pull/217\r\n  x = new Ctor(1).minus(x).div(x.plus(1)).sqrt().atan();\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.times(2);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the\r\n * value of this Decimal.\r\n *\r\n * Domain: [1, Infinity]\r\n * Range: [0, Infinity]\r\n *\r\n * acosh(x) = ln(x + sqrt(x^2 - 1))\r\n *\r\n * acosh(x < 1)     = NaN\r\n * acosh(NaN)       = NaN\r\n * acosh(Infinity)  = Infinity\r\n * acosh(-Infinity) = NaN\r\n * acosh(0)         = NaN\r\n * acosh(-0)        = NaN\r\n * acosh(1)         = 0\r\n * acosh(-1)        = NaN\r\n *\r\n */\r\nP.inverseHyperbolicCosine = P.acosh = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);\r\n  if (!x.isFinite()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;\r\n  Ctor.rounding = 1;\r\n  external = false;\r\n\r\n  x = x.times(x).minus(1).sqrt().plus(x);\r\n\r\n  external = true;\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.ln();\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value\r\n * of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * asinh(x) = ln(x + sqrt(x^2 + 1))\r\n *\r\n * asinh(NaN)       = NaN\r\n * asinh(Infinity)  = Infinity\r\n * asinh(-Infinity) = -Infinity\r\n * asinh(0)         = 0\r\n * asinh(-0)        = -0\r\n *\r\n */\r\nP.inverseHyperbolicSine = P.asinh = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;\r\n  Ctor.rounding = 1;\r\n  external = false;\r\n\r\n  x = x.times(x).plus(1).sqrt().plus(x);\r\n\r\n  external = true;\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.ln();\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the\r\n * value of this Decimal.\r\n *\r\n * Domain: [-1, 1]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * atanh(x) = 0.5 * ln((1 + x) / (1 - x))\r\n *\r\n * atanh(|x| > 1)   = NaN\r\n * atanh(NaN)       = NaN\r\n * atanh(Infinity)  = NaN\r\n * atanh(-Infinity) = NaN\r\n * atanh(0)         = 0\r\n * atanh(-0)        = -0\r\n * atanh(1)         = Infinity\r\n * atanh(-1)        = -Infinity\r\n *\r\n */\r\nP.inverseHyperbolicTangent = P.atanh = function () {\r\n  var pr, rm, wpr, xsd,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite()) return new Ctor(NaN);\r\n  if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  xsd = x.sd();\r\n\r\n  if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);\r\n\r\n  Ctor.precision = wpr = xsd - x.e;\r\n\r\n  x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);\r\n\r\n  Ctor.precision = pr + 4;\r\n  Ctor.rounding = 1;\r\n\r\n  x = x.ln();\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.times(0.5);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-pi/2, pi/2]\r\n *\r\n * asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))\r\n *\r\n * asin(0)       = 0\r\n * asin(-0)      = -0\r\n * asin(1/2)     = pi/6\r\n * asin(-1/2)    = -pi/6\r\n * asin(1)       = pi/2\r\n * asin(-1)      = -pi/2\r\n * asin(|x| > 1) = NaN\r\n * asin(NaN)     = NaN\r\n *\r\n * TODO? Compare performance of Taylor series.\r\n *\r\n */\r\nP.inverseSine = P.asin = function () {\r\n  var halfPi, k,\r\n    pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (x.isZero()) return new Ctor(x);\r\n\r\n  k = x.abs().cmp(1);\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  if (k !== -1) {\r\n\r\n    // |x| is 1\r\n    if (k === 0) {\r\n      halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n      halfPi.s = x.s;\r\n      return halfPi;\r\n    }\r\n\r\n    // |x| > 1 or x is NaN\r\n    return new Ctor(NaN);\r\n  }\r\n\r\n  // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6\r\n\r\n  Ctor.precision = pr + 6;\r\n  Ctor.rounding = 1;\r\n\r\n  x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.times(2);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value\r\n * of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-pi/2, pi/2]\r\n *\r\n * atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n *\r\n * atan(0)         = 0\r\n * atan(-0)        = -0\r\n * atan(1)         = pi/4\r\n * atan(-1)        = -pi/4\r\n * atan(Infinity)  = pi/2\r\n * atan(-Infinity) = -pi/2\r\n * atan(NaN)       = NaN\r\n *\r\n */\r\nP.inverseTangent = P.atan = function () {\r\n  var i, j, k, n, px, t, r, wpr, x2,\r\n    x = this,\r\n    Ctor = x.constructor,\r\n    pr = Ctor.precision,\r\n    rm = Ctor.rounding;\r\n\r\n  if (!x.isFinite()) {\r\n    if (!x.s) return new Ctor(NaN);\r\n    if (pr + 4 <= PI_PRECISION) {\r\n      r = getPi(Ctor, pr + 4, rm).times(0.5);\r\n      r.s = x.s;\r\n      return r;\r\n    }\r\n  } else if (x.isZero()) {\r\n    return new Ctor(x);\r\n  } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {\r\n    r = getPi(Ctor, pr + 4, rm).times(0.25);\r\n    r.s = x.s;\r\n    return r;\r\n  }\r\n\r\n  Ctor.precision = wpr = pr + 10;\r\n  Ctor.rounding = 1;\r\n\r\n  // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);\r\n\r\n  // Argument reduction\r\n  // Ensure |x| < 0.42\r\n  // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))\r\n\r\n  k = Math.min(28, wpr / LOG_BASE + 2 | 0);\r\n\r\n  for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));\r\n\r\n  external = false;\r\n\r\n  j = Math.ceil(wpr / LOG_BASE);\r\n  n = 1;\r\n  x2 = x.times(x);\r\n  r = new Ctor(x);\r\n  px = x;\r\n\r\n  // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n  for (; i !== -1;) {\r\n    px = px.times(x2);\r\n    t = r.minus(px.div(n += 2));\r\n\r\n    px = px.times(x2);\r\n    r = t.plus(px.div(n += 2));\r\n\r\n    if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);\r\n  }\r\n\r\n  if (k) r = r.times(2 << (k - 1));\r\n\r\n  external = true;\r\n\r\n  return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is a finite number, otherwise return false.\r\n *\r\n */\r\nP.isFinite = function () {\r\n  return !!this.d;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is an integer, otherwise return false.\r\n *\r\n */\r\nP.isInteger = P.isInt = function () {\r\n  return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is NaN, otherwise return false.\r\n *\r\n */\r\nP.isNaN = function () {\r\n  return !this.s;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is negative, otherwise return false.\r\n *\r\n */\r\nP.isNegative = P.isNeg = function () {\r\n  return this.s < 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is positive, otherwise return false.\r\n *\r\n */\r\nP.isPositive = P.isPos = function () {\r\n  return this.s > 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is 0 or -0, otherwise return false.\r\n *\r\n */\r\nP.isZero = function () {\r\n  return !!this.d && this.d[0] === 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n *\r\n */\r\nP.lessThan = P.lt = function (y) {\r\n  return this.cmp(y) < 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n *\r\n */\r\nP.lessThanOrEqualTo = P.lte = function (y) {\r\n  return this.cmp(y) < 1;\r\n};\r\n\r\n\r\n/*\r\n * Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * If no base is specified, return log[10](arg).\r\n *\r\n * log[base](arg) = ln(arg) / ln(base)\r\n *\r\n * The result will always be correctly rounded if the base of the log is 10, and 'almost always'\r\n * otherwise:\r\n *\r\n * Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen\r\n * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error\r\n * between the result and the correctly rounded result will be one ulp (unit in the last place).\r\n *\r\n * log[-b](a)       = NaN\r\n * log[0](a)        = NaN\r\n * log[1](a)        = NaN\r\n * log[NaN](a)      = NaN\r\n * log[Infinity](a) = NaN\r\n * log[b](0)        = -Infinity\r\n * log[b](-0)       = -Infinity\r\n * log[b](-a)       = NaN\r\n * log[b](1)        = 0\r\n * log[b](Infinity) = Infinity\r\n * log[b](NaN)      = NaN\r\n *\r\n * [base] {number|string|bigint|Decimal} The base of the logarithm.\r\n *\r\n */\r\nP.logarithm = P.log = function (base) {\r\n  var isBase10, d, denominator, k, inf, num, sd, r,\r\n    arg = this,\r\n    Ctor = arg.constructor,\r\n    pr = Ctor.precision,\r\n    rm = Ctor.rounding,\r\n    guard = 5;\r\n\r\n  // Default base is 10.\r\n  if (base == null) {\r\n    base = new Ctor(10);\r\n    isBase10 = true;\r\n  } else {\r\n    base = new Ctor(base);\r\n    d = base.d;\r\n\r\n    // Return NaN if base is negative, or non-finite, or is 0 or 1.\r\n    if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);\r\n\r\n    isBase10 = base.eq(10);\r\n  }\r\n\r\n  d = arg.d;\r\n\r\n  // Is arg negative, non-finite, 0 or 1?\r\n  if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {\r\n    return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);\r\n  }\r\n\r\n  // The result will have a non-terminating decimal expansion if base is 10 and arg is not an\r\n  // integer power of 10.\r\n  if (isBase10) {\r\n    if (d.length > 1) {\r\n      inf = true;\r\n    } else {\r\n      for (k = d[0]; k % 10 === 0;) k /= 10;\r\n      inf = k !== 1;\r\n    }\r\n  }\r\n\r\n  external = false;\r\n  sd = pr + guard;\r\n  num = naturalLogarithm(arg, sd);\r\n  denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n\r\n  // The result will have 5 rounding digits.\r\n  r = divide(num, denominator, sd, 1);\r\n\r\n  // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,\r\n  // calculate 10 further digits.\r\n  //\r\n  // If the result is known to have an infinite decimal expansion, repeat this until it is clear\r\n  // that the result is above or below the boundary. Otherwise, if after calculating the 10\r\n  // further digits, the last 14 are nines, round up and assume the result is exact.\r\n  // Also assume the result is exact if the last 14 are zero.\r\n  //\r\n  // Example of a result that will be incorrectly rounded:\r\n  // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...\r\n  // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it\r\n  // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so\r\n  // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal\r\n  // place is still 2.6.\r\n  if (checkRoundingDigits(r.d, k = pr, rm)) {\r\n\r\n    do {\r\n      sd += 10;\r\n      num = naturalLogarithm(arg, sd);\r\n      denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n      r = divide(num, denominator, sd, 1);\r\n\r\n      if (!inf) {\r\n\r\n        // Check for 14 nines from the 2nd rounding digit, as the first may be 4.\r\n        if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {\r\n          r = finalise(r, pr + 1, 0);\r\n        }\r\n\r\n        break;\r\n      }\r\n    } while (checkRoundingDigits(r.d, k += 10, rm));\r\n  }\r\n\r\n  external = true;\r\n\r\n  return finalise(r, pr, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\nP.max = function () {\r\n  Array.prototype.push.call(arguments, this);\r\n  return maxOrMin(this.constructor, arguments, -1);\r\n};\r\n */\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\nP.min = function () {\r\n  Array.prototype.push.call(arguments, this);\r\n  return maxOrMin(this.constructor, arguments, 1);\r\n};\r\n */\r\n\r\n\r\n/*\r\n *  n - 0 = n\r\n *  n - N = N\r\n *  n - I = -I\r\n *  0 - n = -n\r\n *  0 - 0 = 0\r\n *  0 - N = N\r\n *  0 - I = -I\r\n *  N - n = N\r\n *  N - 0 = N\r\n *  N - N = N\r\n *  N - I = N\r\n *  I - n = I\r\n *  I - 0 = I\r\n *  I - N = N\r\n *  I - I = N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.minus = P.sub = function (y) {\r\n  var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  y = new Ctor(y);\r\n\r\n  // If either is not finite...\r\n  if (!x.d || !y.d) {\r\n\r\n    // Return NaN if either is NaN.\r\n    if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n    // Return y negated if x is finite and y is ±Infinity.\r\n    else if (x.d) y.s = -y.s;\r\n\r\n    // Return x if y is finite and x is ±Infinity.\r\n    // Return x if both are ±Infinity with different signs.\r\n    // Return NaN if both are ±Infinity with the same sign.\r\n    else y = new Ctor(y.d || x.s !== y.s ? x : NaN);\r\n\r\n    return y;\r\n  }\r\n\r\n  // If signs differ...\r\n  if (x.s != y.s) {\r\n    y.s = -y.s;\r\n    return x.plus(y);\r\n  }\r\n\r\n  xd = x.d;\r\n  yd = y.d;\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  // If either is zero...\r\n  if (!xd[0] || !yd[0]) {\r\n\r\n    // Return y negated if x is zero and y is non-zero.\r\n    if (yd[0]) y.s = -y.s;\r\n\r\n    // Return x if y is zero and x is non-zero.\r\n    else if (xd[0]) y = new Ctor(x);\r\n\r\n    // Return zero if both are zero.\r\n    // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.\r\n    else return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  }\r\n\r\n  // x and y are finite, non-zero numbers with the same sign.\r\n\r\n  // Calculate base 1e7 exponents.\r\n  e = mathfloor(y.e / LOG_BASE);\r\n  xe = mathfloor(x.e / LOG_BASE);\r\n\r\n  xd = xd.slice();\r\n  k = xe - e;\r\n\r\n  // If base 1e7 exponents differ...\r\n  if (k) {\r\n    xLTy = k < 0;\r\n\r\n    if (xLTy) {\r\n      d = xd;\r\n      k = -k;\r\n      len = yd.length;\r\n    } else {\r\n      d = yd;\r\n      e = xe;\r\n      len = xd.length;\r\n    }\r\n\r\n    // Numbers with massively different exponents would result in a very high number of\r\n    // zeros needing to be prepended, but this can be avoided while still ensuring correct\r\n    // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n    i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n    if (k > i) {\r\n      k = i;\r\n      d.length = 1;\r\n    }\r\n\r\n    // Prepend zeros to equalise exponents.\r\n    d.reverse();\r\n    for (i = k; i--;) d.push(0);\r\n    d.reverse();\r\n\r\n  // Base 1e7 exponents equal.\r\n  } else {\r\n\r\n    // Check digits to determine which is the bigger number.\r\n\r\n    i = xd.length;\r\n    len = yd.length;\r\n    xLTy = i < len;\r\n    if (xLTy) len = i;\r\n\r\n    for (i = 0; i < len; i++) {\r\n      if (xd[i] != yd[i]) {\r\n        xLTy = xd[i] < yd[i];\r\n        break;\r\n      }\r\n    }\r\n\r\n    k = 0;\r\n  }\r\n\r\n  if (xLTy) {\r\n    d = xd;\r\n    xd = yd;\r\n    yd = d;\r\n    y.s = -y.s;\r\n  }\r\n\r\n  len = xd.length;\r\n\r\n  // Append zeros to `xd` if shorter.\r\n  // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.\r\n  for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n  // Subtract yd from xd.\r\n  for (i = yd.length; i > k;) {\r\n\r\n    if (xd[--i] < yd[i]) {\r\n      for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n      --xd[j];\r\n      xd[i] += BASE;\r\n    }\r\n\r\n    xd[i] -= yd[i];\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  for (; xd[--len] === 0;) xd.pop();\r\n\r\n  // Remove leading zeros and adjust exponent accordingly.\r\n  for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n  // Zero?\r\n  if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n  y.d = xd;\r\n  y.e = getBase10Exponent(xd, e);\r\n\r\n  return external ? finalise(y, pr, rm) : y;\r\n};\r\n\r\n\r\n/*\r\n *   n % 0 =  N\r\n *   n % N =  N\r\n *   n % I =  n\r\n *   0 % n =  0\r\n *  -0 % n = -0\r\n *   0 % 0 =  N\r\n *   0 % N =  N\r\n *   0 % I =  0\r\n *   N % n =  N\r\n *   N % 0 =  N\r\n *   N % N =  N\r\n *   N % I =  N\r\n *   I % n =  N\r\n *   I % 0 =  N\r\n *   I % N =  N\r\n *   I % I =  N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * The result depends on the modulo mode.\r\n *\r\n */\r\nP.modulo = P.mod = function (y) {\r\n  var q,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  y = new Ctor(y);\r\n\r\n  // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.\r\n  if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);\r\n\r\n  // Return x if y is ±Infinity or x is ±0.\r\n  if (!y.d || x.d && !x.d[0]) {\r\n    return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);\r\n  }\r\n\r\n  // Prevent rounding of intermediate calculations.\r\n  external = false;\r\n\r\n  if (Ctor.modulo == 9) {\r\n\r\n    // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n    // result = x - q * y    where  0 <= result < abs(y)\r\n    q = divide(x, y.abs(), 0, 3, 1);\r\n    q.s *= y.s;\r\n  } else {\r\n    q = divide(x, y, 0, Ctor.modulo, 1);\r\n  }\r\n\r\n  q = q.times(y);\r\n\r\n  external = true;\r\n\r\n  return x.minus(q);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.naturalExponential = P.exp = function () {\r\n  return naturalExponential(this);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n * rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.naturalLogarithm = P.ln = function () {\r\n  return naturalLogarithm(this);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n * -1.\r\n *\r\n */\r\nP.negated = P.neg = function () {\r\n  var x = new this.constructor(this);\r\n  x.s = -x.s;\r\n  return finalise(x);\r\n};\r\n\r\n\r\n/*\r\n *  n + 0 = n\r\n *  n + N = N\r\n *  n + I = I\r\n *  0 + n = n\r\n *  0 + 0 = 0\r\n *  0 + N = N\r\n *  0 + I = I\r\n *  N + n = N\r\n *  N + 0 = N\r\n *  N + N = N\r\n *  N + I = N\r\n *  I + n = I\r\n *  I + 0 = I\r\n *  I + N = N\r\n *  I + I = I\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.plus = P.add = function (y) {\r\n  var carry, d, e, i, k, len, pr, rm, xd, yd,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  y = new Ctor(y);\r\n\r\n  // If either is not finite...\r\n  if (!x.d || !y.d) {\r\n\r\n    // Return NaN if either is NaN.\r\n    if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n    // Return x if y is finite and x is ±Infinity.\r\n    // Return x if both are ±Infinity with the same sign.\r\n    // Return NaN if both are ±Infinity with different signs.\r\n    // Return y if x is finite and y is ±Infinity.\r\n    else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);\r\n\r\n    return y;\r\n  }\r\n\r\n   // If signs differ...\r\n  if (x.s != y.s) {\r\n    y.s = -y.s;\r\n    return x.minus(y);\r\n  }\r\n\r\n  xd = x.d;\r\n  yd = y.d;\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  // If either is zero...\r\n  if (!xd[0] || !yd[0]) {\r\n\r\n    // Return x if y is zero.\r\n    // Return y if y is non-zero.\r\n    if (!yd[0]) y = new Ctor(x);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  }\r\n\r\n  // x and y are finite, non-zero numbers with the same sign.\r\n\r\n  // Calculate base 1e7 exponents.\r\n  k = mathfloor(x.e / LOG_BASE);\r\n  e = mathfloor(y.e / LOG_BASE);\r\n\r\n  xd = xd.slice();\r\n  i = k - e;\r\n\r\n  // If base 1e7 exponents differ...\r\n  if (i) {\r\n\r\n    if (i < 0) {\r\n      d = xd;\r\n      i = -i;\r\n      len = yd.length;\r\n    } else {\r\n      d = yd;\r\n      e = k;\r\n      len = xd.length;\r\n    }\r\n\r\n    // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n    k = Math.ceil(pr / LOG_BASE);\r\n    len = k > len ? k + 1 : len + 1;\r\n\r\n    if (i > len) {\r\n      i = len;\r\n      d.length = 1;\r\n    }\r\n\r\n    // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n    d.reverse();\r\n    for (; i--;) d.push(0);\r\n    d.reverse();\r\n  }\r\n\r\n  len = xd.length;\r\n  i = yd.length;\r\n\r\n  // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n  if (len - i < 0) {\r\n    i = len;\r\n    d = yd;\r\n    yd = xd;\r\n    xd = d;\r\n  }\r\n\r\n  // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n  for (carry = 0; i;) {\r\n    carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;\r\n    xd[i] %= BASE;\r\n  }\r\n\r\n  if (carry) {\r\n    xd.unshift(carry);\r\n    ++e;\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n  for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n  y.d = xd;\r\n  y.e = getBase10Exponent(xd, e);\r\n\r\n  return external ? finalise(y, pr, rm) : y;\r\n};\r\n\r\n\r\n/*\r\n * Return the number of significant digits of the value of this Decimal.\r\n *\r\n * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n *\r\n */\r\nP.precision = P.sd = function (z) {\r\n  var k,\r\n    x = this;\r\n\r\n  if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n  if (x.d) {\r\n    k = getPrecision(x.d);\r\n    if (z && x.e + 1 > k) k = x.e + 1;\r\n  } else {\r\n    k = NaN;\r\n  }\r\n\r\n  return k;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n * rounding mode `rounding`.\r\n *\r\n */\r\nP.round = function () {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n\r\n  return finalise(new Ctor(x), x.e + 1, Ctor.rounding);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the sine of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * sin(x) = x - x^3/3! + x^5/5! - ...\r\n *\r\n * sin(0)         = 0\r\n * sin(-0)        = -0\r\n * sin(Infinity)  = NaN\r\n * sin(-Infinity) = NaN\r\n * sin(NaN)       = NaN\r\n *\r\n */\r\nP.sine = P.sin = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite()) return new Ctor(NaN);\r\n  if (x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n  Ctor.rounding = 1;\r\n\r\n  x = sine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n *  sqrt(-n) =  N\r\n *  sqrt(N)  =  N\r\n *  sqrt(-I) =  N\r\n *  sqrt(I)  =  I\r\n *  sqrt(0)  =  0\r\n *  sqrt(-0) = -0\r\n *\r\n */\r\nP.squareRoot = P.sqrt = function () {\r\n  var m, n, sd, r, rep, t,\r\n    x = this,\r\n    d = x.d,\r\n    e = x.e,\r\n    s = x.s,\r\n    Ctor = x.constructor;\r\n\r\n  // Negative/NaN/Infinity/zero?\r\n  if (s !== 1 || !d || !d[0]) {\r\n    return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);\r\n  }\r\n\r\n  external = false;\r\n\r\n  // Initial estimate.\r\n  s = Math.sqrt(+x);\r\n\r\n  // Math.sqrt underflow/overflow?\r\n  // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n  if (s == 0 || s == 1 / 0) {\r\n    n = digitsToString(d);\r\n\r\n    if ((n.length + e) % 2 == 0) n += '0';\r\n    s = Math.sqrt(n);\r\n    e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n    if (s == 1 / 0) {\r\n      n = '5e' + e;\r\n    } else {\r\n      n = s.toExponential();\r\n      n = n.slice(0, n.indexOf('e') + 1) + e;\r\n    }\r\n\r\n    r = new Ctor(n);\r\n  } else {\r\n    r = new Ctor(s.toString());\r\n  }\r\n\r\n  sd = (e = Ctor.precision) + 3;\r\n\r\n  // Newton-Raphson iteration.\r\n  for (;;) {\r\n    t = r;\r\n    r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);\r\n\r\n    // TODO? Replace with for-loop and checkRoundingDigits.\r\n    if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n      n = n.slice(sd - 3, sd + 1);\r\n\r\n      // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n      // 4999, i.e. approaching a rounding boundary, continue the iteration.\r\n      if (n == '9999' || !rep && n == '4999') {\r\n\r\n        // On the first iteration only, check to see if rounding up gives the exact result as the\r\n        // nines may infinitely repeat.\r\n        if (!rep) {\r\n          finalise(t, e + 1, 0);\r\n\r\n          if (t.times(t).eq(x)) {\r\n            r = t;\r\n            break;\r\n          }\r\n        }\r\n\r\n        sd += 4;\r\n        rep = 1;\r\n      } else {\r\n\r\n        // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n        // If not, then there are further digits and m will be truthy.\r\n        if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n          // Truncate to the first rounding digit.\r\n          finalise(r, e + 1, 1);\r\n          m = !r.times(r).eq(x);\r\n        }\r\n\r\n        break;\r\n      }\r\n    }\r\n  }\r\n\r\n  external = true;\r\n\r\n  return finalise(r, e, Ctor.rounding, m);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the tangent of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * tan(0)         = 0\r\n * tan(-0)        = -0\r\n * tan(Infinity)  = NaN\r\n * tan(-Infinity) = NaN\r\n * tan(NaN)       = NaN\r\n *\r\n */\r\nP.tangent = P.tan = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite()) return new Ctor(NaN);\r\n  if (x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + 10;\r\n  Ctor.rounding = 1;\r\n\r\n  x = x.sin();\r\n  x.s = 1;\r\n  x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/*\r\n *  n * 0 = 0\r\n *  n * N = N\r\n *  n * I = I\r\n *  0 * n = 0\r\n *  0 * 0 = 0\r\n *  0 * N = N\r\n *  0 * I = N\r\n *  N * n = N\r\n *  N * 0 = N\r\n *  N * N = N\r\n *  N * I = N\r\n *  I * n = I\r\n *  I * 0 = N\r\n *  I * N = N\r\n *  I * I = I\r\n *\r\n * Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.times = P.mul = function (y) {\r\n  var carry, e, i, k, r, rL, t, xdL, ydL,\r\n    x = this,\r\n    Ctor = x.constructor,\r\n    xd = x.d,\r\n    yd = (y = new Ctor(y)).d;\r\n\r\n  y.s *= x.s;\r\n\r\n   // If either is NaN, ±Infinity or ±0...\r\n  if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n    return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd\r\n\r\n      // Return NaN if either is NaN.\r\n      // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.\r\n      ? NaN\r\n\r\n      // Return ±Infinity if either is ±Infinity.\r\n      // Return ±0 if either is ±0.\r\n      : !xd || !yd ? y.s / 0 : y.s * 0);\r\n  }\r\n\r\n  e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);\r\n  xdL = xd.length;\r\n  ydL = yd.length;\r\n\r\n  // Ensure xd points to the longer array.\r\n  if (xdL < ydL) {\r\n    r = xd;\r\n    xd = yd;\r\n    yd = r;\r\n    rL = xdL;\r\n    xdL = ydL;\r\n    ydL = rL;\r\n  }\r\n\r\n  // Initialise the result array with zeros.\r\n  r = [];\r\n  rL = xdL + ydL;\r\n  for (i = rL; i--;) r.push(0);\r\n\r\n  // Multiply!\r\n  for (i = ydL; --i >= 0;) {\r\n    carry = 0;\r\n    for (k = xdL + i; k > i;) {\r\n      t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n      r[k--] = t % BASE | 0;\r\n      carry = t / BASE | 0;\r\n    }\r\n\r\n    r[k] = (r[k] + carry) % BASE | 0;\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  for (; !r[--rL];) r.pop();\r\n\r\n  if (carry) ++e;\r\n  else r.shift();\r\n\r\n  y.d = r;\r\n  y.e = getBase10Exponent(r, e);\r\n\r\n  return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in base 2, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toBinary = function (sd, rm) {\r\n  return toStringBinary(this, 2, sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n *\r\n * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toDecimalPlaces = P.toDP = function (dp, rm) {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n\r\n  x = new Ctor(x);\r\n  if (dp === void 0) return x;\r\n\r\n  checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n  if (rm === void 0) rm = Ctor.rounding;\r\n  else checkInt32(rm, 0, 8);\r\n\r\n  return finalise(x, dp + x.e + 1, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in exponential notation rounded to\r\n * `dp` fixed decimal places using rounding mode `rounding`.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toExponential = function (dp, rm) {\r\n  var str,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (dp === void 0) {\r\n    str = finiteToString(x, true);\r\n  } else {\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    x = finalise(new Ctor(x), dp + 1, rm);\r\n    str = finiteToString(x, true, dp + 1);\r\n  }\r\n\r\n  return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n * omitted.\r\n *\r\n * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n * (-0).toFixed(3) is '0.000'.\r\n * (-0.5).toFixed(0) is '-0'.\r\n *\r\n */\r\nP.toFixed = function (dp, rm) {\r\n  var str, y,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (dp === void 0) {\r\n    str = finiteToString(x);\r\n  } else {\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    y = finalise(new Ctor(x), dp + x.e + 1, rm);\r\n    str = finiteToString(y, false, dp + y.e + 1);\r\n  }\r\n\r\n  // To determine whether to add the minus sign look at the value before it was rounded,\r\n  // i.e. look at `x` rather than `y`.\r\n  return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/*\r\n * Return an array representing the value of this Decimal as a simple fraction with an integer\r\n * numerator and an integer denominator.\r\n *\r\n * The denominator will be a positive non-zero value less than or equal to the specified maximum\r\n * denominator. If a maximum denominator is not specified, the denominator will be the lowest\r\n * value necessary to represent the number exactly.\r\n *\r\n * [maxD] {number|string|bigint|Decimal} Maximum denominator. Integer >= 1 and < Infinity.\r\n *\r\n */\r\nP.toFraction = function (maxD) {\r\n  var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,\r\n    x = this,\r\n    xd = x.d,\r\n    Ctor = x.constructor;\r\n\r\n  if (!xd) return new Ctor(x);\r\n\r\n  n1 = d0 = new Ctor(1);\r\n  d1 = n0 = new Ctor(0);\r\n\r\n  d = new Ctor(d1);\r\n  e = d.e = getPrecision(xd) - x.e - 1;\r\n  k = e % LOG_BASE;\r\n  d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);\r\n\r\n  if (maxD == null) {\r\n\r\n    // d is 10**e, the minimum max-denominator needed.\r\n    maxD = e > 0 ? d : n1;\r\n  } else {\r\n    n = new Ctor(maxD);\r\n    if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);\r\n    maxD = n.gt(d) ? (e > 0 ? d : n1) : n;\r\n  }\r\n\r\n  external = false;\r\n  n = new Ctor(digitsToString(xd));\r\n  pr = Ctor.precision;\r\n  Ctor.precision = e = xd.length * LOG_BASE * 2;\r\n\r\n  for (;;)  {\r\n    q = divide(n, d, 0, 1, 1);\r\n    d2 = d0.plus(q.times(d1));\r\n    if (d2.cmp(maxD) == 1) break;\r\n    d0 = d1;\r\n    d1 = d2;\r\n    d2 = n1;\r\n    n1 = n0.plus(q.times(d2));\r\n    n0 = d2;\r\n    d2 = d;\r\n    d = n.minus(q.times(d2));\r\n    n = d2;\r\n  }\r\n\r\n  d2 = divide(maxD.minus(d0), d1, 0, 1, 1);\r\n  n0 = n0.plus(d2.times(n1));\r\n  d0 = d0.plus(d2.times(d1));\r\n  n0.s = n1.s = x.s;\r\n\r\n  // Determine which fraction is closer to x, n0/d0 or n1/d1?\r\n  r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1\r\n      ? [n1, d1] : [n0, d0];\r\n\r\n  Ctor.precision = pr;\r\n  external = true;\r\n\r\n  return r;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in base 16, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toHexadecimal = P.toHex = function (sd, rm) {\r\n  return toStringBinary(this, 16, sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding\r\n * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.\r\n *\r\n * The return value will always have the same sign as this Decimal, unless either this Decimal\r\n * or `y` is NaN, in which case the return value will be also be NaN.\r\n *\r\n * The return value is not affected by the value of `precision`.\r\n *\r\n * y {number|string|bigint|Decimal} The magnitude to round to a multiple of.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * 'toNearest() rounding mode not an integer: {rm}'\r\n * 'toNearest() rounding mode out of range: {rm}'\r\n *\r\n */\r\nP.toNearest = function (y, rm) {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n\r\n  x = new Ctor(x);\r\n\r\n  if (y == null) {\r\n\r\n    // If x is not finite, return x.\r\n    if (!x.d) return x;\r\n\r\n    y = new Ctor(1);\r\n    rm = Ctor.rounding;\r\n  } else {\r\n    y = new Ctor(y);\r\n    if (rm === void 0) {\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      checkInt32(rm, 0, 8);\r\n    }\r\n\r\n    // If x is not finite, return x if y is not NaN, else NaN.\r\n    if (!x.d) return y.s ? x : y;\r\n\r\n    // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.\r\n    if (!y.d) {\r\n      if (y.s) y.s = x.s;\r\n      return y;\r\n    }\r\n  }\r\n\r\n  // If y is not zero, calculate the nearest multiple of y to x.\r\n  if (y.d[0]) {\r\n    external = false;\r\n    x = divide(x, y, 0, rm, 1).times(y);\r\n    external = true;\r\n    finalise(x);\r\n\r\n  // If y is zero, return zero with the sign of x.\r\n  } else {\r\n    y.s = x.s;\r\n    x = y;\r\n  }\r\n\r\n  return x;\r\n};\r\n\r\n\r\n/*\r\n * Return the value of this Decimal converted to a number primitive.\r\n * Zero keeps its sign.\r\n *\r\n */\r\nP.toNumber = function () {\r\n  return +this;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in base 8, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toOctal = function (sd, rm) {\r\n  return toStringBinary(this, 8, sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded\r\n * to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * ECMAScript compliant.\r\n *\r\n *   pow(x, NaN)                           = NaN\r\n *   pow(x, ±0)                            = 1\r\n\r\n *   pow(NaN, non-zero)                    = NaN\r\n *   pow(abs(x) > 1, +Infinity)            = +Infinity\r\n *   pow(abs(x) > 1, -Infinity)            = +0\r\n *   pow(abs(x) == 1, ±Infinity)           = NaN\r\n *   pow(abs(x) < 1, +Infinity)            = +0\r\n *   pow(abs(x) < 1, -Infinity)            = +Infinity\r\n *   pow(+Infinity, y > 0)                 = +Infinity\r\n *   pow(+Infinity, y < 0)                 = +0\r\n *   pow(-Infinity, odd integer > 0)       = -Infinity\r\n *   pow(-Infinity, even integer > 0)      = +Infinity\r\n *   pow(-Infinity, odd integer < 0)       = -0\r\n *   pow(-Infinity, even integer < 0)      = +0\r\n *   pow(+0, y > 0)                        = +0\r\n *   pow(+0, y < 0)                        = +Infinity\r\n *   pow(-0, odd integer > 0)              = -0\r\n *   pow(-0, even integer > 0)             = +0\r\n *   pow(-0, odd integer < 0)              = -Infinity\r\n *   pow(-0, even integer < 0)             = +Infinity\r\n *   pow(finite x < 0, finite non-integer) = NaN\r\n *\r\n * For non-integer or very large exponents pow(x, y) is calculated using\r\n *\r\n *   x^y = exp(y*ln(x))\r\n *\r\n * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the\r\n * probability of an incorrectly rounded result\r\n * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14\r\n * i.e. 1 in 250,000,000,000,000\r\n *\r\n * If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).\r\n *\r\n * y {number|string|bigint|Decimal} The power to which to raise this Decimal.\r\n *\r\n */\r\nP.toPower = P.pow = function (y) {\r\n  var e, k, pr, r, rm, s,\r\n    x = this,\r\n    Ctor = x.constructor,\r\n    yn = +(y = new Ctor(y));\r\n\r\n  // Either ±Infinity, NaN or ±0?\r\n  if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));\r\n\r\n  x = new Ctor(x);\r\n\r\n  if (x.eq(1)) return x;\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  if (y.eq(1)) return finalise(x, pr, rm);\r\n\r\n  // y exponent\r\n  e = mathfloor(y.e / LOG_BASE);\r\n\r\n  // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n  if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n    r = intPow(Ctor, x, k, pr);\r\n    return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);\r\n  }\r\n\r\n  s = x.s;\r\n\r\n  // if x is negative\r\n  if (s < 0) {\r\n\r\n    // if y is not an integer\r\n    if (e < y.d.length - 1) return new Ctor(NaN);\r\n\r\n    // Result is positive if x is negative and the last digit of integer y is even.\r\n    if ((y.d[e] & 1) == 0) s = 1;\r\n\r\n    // if x.eq(-1)\r\n    if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {\r\n      x.s = s;\r\n      return x;\r\n    }\r\n  }\r\n\r\n  // Estimate result exponent.\r\n  // x^y = 10^e,  where e = y * log10(x)\r\n  // log10(x) = log10(x_significand) + x_exponent\r\n  // log10(x_significand) = ln(x_significand) / ln(10)\r\n  k = mathpow(+x, yn);\r\n  e = k == 0 || !isFinite(k)\r\n    ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))\r\n    : new Ctor(k + '').e;\r\n\r\n  // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.\r\n\r\n  // Overflow/underflow?\r\n  if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);\r\n\r\n  external = false;\r\n  Ctor.rounding = x.s = 1;\r\n\r\n  // Estimate the extra guard digits needed to ensure five correct rounding digits from\r\n  // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):\r\n  // new Decimal(2.32456).pow('2087987436534566.46411')\r\n  // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815\r\n  k = Math.min(12, (e + '').length);\r\n\r\n  // r = x^y = exp(y*ln(x))\r\n  r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);\r\n\r\n  // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)\r\n  if (r.d) {\r\n\r\n    // Truncate to the required precision plus five rounding digits.\r\n    r = finalise(r, pr + 5, 1);\r\n\r\n    // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate\r\n    // the result.\r\n    if (checkRoundingDigits(r.d, pr, rm)) {\r\n      e = pr + 10;\r\n\r\n      // Truncate to the increased precision plus five rounding digits.\r\n      r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);\r\n\r\n      // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).\r\n      if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {\r\n        r = finalise(r, pr + 1, 0);\r\n      }\r\n    }\r\n  }\r\n\r\n  r.s = s;\r\n  external = true;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(r, pr, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n * the integer part of the value in normal notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toPrecision = function (sd, rm) {\r\n  var str,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (sd === void 0) {\r\n    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n  } else {\r\n    checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    x = finalise(new Ctor(x), sd, rm);\r\n    str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);\r\n  }\r\n\r\n  return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n * omitted.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * 'toSD() digits out of range: {sd}'\r\n * 'toSD() digits not an integer: {sd}'\r\n * 'toSD() rounding mode not an integer: {rm}'\r\n * 'toSD() rounding mode out of range: {rm}'\r\n *\r\n */\r\nP.toSignificantDigits = P.toSD = function (sd, rm) {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (sd === void 0) {\r\n    sd = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n  } else {\r\n    checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n  }\r\n\r\n  return finalise(new Ctor(x), sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal.\r\n *\r\n * Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n *\r\n */\r\nP.toString = function () {\r\n  var x = this,\r\n    Ctor = x.constructor,\r\n    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n  return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal truncated to a whole number.\r\n *\r\n */\r\nP.truncated = P.trunc = function () {\r\n  return finalise(new this.constructor(this), this.e + 1, 1);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal.\r\n * Unlike `toString`, negative zero will include the minus sign.\r\n *\r\n */\r\nP.valueOf = P.toJSON = function () {\r\n  var x = this,\r\n    Ctor = x.constructor,\r\n    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n  return x.isNeg() ? '-' + str : str;\r\n};\r\n\r\n\r\n// Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n/*\r\n *  digitsToString           P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,\r\n *                           finiteToString, naturalExponential, naturalLogarithm\r\n *  checkInt32               P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,\r\n *                           P.toPrecision, P.toSignificantDigits, toStringBinary, random\r\n *  checkRoundingDigits      P.logarithm, P.toPower, naturalExponential, naturalLogarithm\r\n *  convertBase              toStringBinary, parseOther\r\n *  cos                      P.cos\r\n *  divide                   P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,\r\n *                           P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,\r\n *                           P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,\r\n *                           taylorSeries, atan2, parseOther\r\n *  finalise                 P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,\r\n *                           P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,\r\n *                           P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,\r\n *                           P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,\r\n *                           P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,\r\n *                           P.truncated, divide, getLn10, getPi, naturalExponential,\r\n *                           naturalLogarithm, ceil, floor, round, trunc\r\n *  finiteToString           P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,\r\n *                           toStringBinary\r\n *  getBase10Exponent        P.minus, P.plus, P.times, parseOther\r\n *  getLn10                  P.logarithm, naturalLogarithm\r\n *  getPi                    P.acos, P.asin, P.atan, toLessThanHalfPi, atan2\r\n *  getPrecision             P.precision, P.toFraction\r\n *  getZeroString            digitsToString, finiteToString\r\n *  intPow                   P.toPower, parseOther\r\n *  isOdd                    toLessThanHalfPi\r\n *  maxOrMin                 max, min\r\n *  naturalExponential       P.naturalExponential, P.toPower\r\n *  naturalLogarithm         P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,\r\n *                           P.toPower, naturalExponential\r\n *  nonFiniteToString        finiteToString, toStringBinary\r\n *  parseDecimal             Decimal\r\n *  parseOther               Decimal\r\n *  sin                      P.sin\r\n *  taylorSeries             P.cosh, P.sinh, cos, sin\r\n *  toLessThanHalfPi         P.cos, P.sin\r\n *  toStringBinary           P.toBinary, P.toHexadecimal, P.toOctal\r\n *  truncate                 intPow\r\n *\r\n *  Throws:                  P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,\r\n *                           naturalLogarithm, config, parseOther, random, Decimal\r\n */\r\n\r\n\r\nfunction digitsToString(d) {\r\n  var i, k, ws,\r\n    indexOfLastWord = d.length - 1,\r\n    str = '',\r\n    w = d[0];\r\n\r\n  if (indexOfLastWord > 0) {\r\n    str += w;\r\n    for (i = 1; i < indexOfLastWord; i++) {\r\n      ws = d[i] + '';\r\n      k = LOG_BASE - ws.length;\r\n      if (k) str += getZeroString(k);\r\n      str += ws;\r\n    }\r\n\r\n    w = d[i];\r\n    ws = w + '';\r\n    k = LOG_BASE - ws.length;\r\n    if (k) str += getZeroString(k);\r\n  } else if (w === 0) {\r\n    return '0';\r\n  }\r\n\r\n  // Remove trailing zeros of last w.\r\n  for (; w % 10 === 0;) w /= 10;\r\n\r\n  return str + w;\r\n}\r\n\r\n\r\nfunction checkInt32(i, min, max) {\r\n  if (i !== ~~i || i < min || i > max) {\r\n    throw Error(invalidArgument + i);\r\n  }\r\n}\r\n\r\n\r\n/*\r\n * Check 5 rounding digits if `repeating` is null, 4 otherwise.\r\n * `repeating == null` if caller is `log` or `pow`,\r\n * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.\r\n */\r\nfunction checkRoundingDigits(d, i, rm, repeating) {\r\n  var di, k, r, rd;\r\n\r\n  // Get the length of the first word of the array d.\r\n  for (k = d[0]; k >= 10; k /= 10) --i;\r\n\r\n  // Is the rounding digit in the first word of d?\r\n  if (--i < 0) {\r\n    i += LOG_BASE;\r\n    di = 0;\r\n  } else {\r\n    di = Math.ceil((i + 1) / LOG_BASE);\r\n    i %= LOG_BASE;\r\n  }\r\n\r\n  // i is the index (0 - 6) of the rounding digit.\r\n  // E.g. if within the word 3487563 the first rounding digit is 5,\r\n  // then i = 4, k = 1000, rd = 3487563 % 1000 = 563\r\n  k = mathpow(10, LOG_BASE - i);\r\n  rd = d[di] % k | 0;\r\n\r\n  if (repeating == null) {\r\n    if (i < 3) {\r\n      if (i == 0) rd = rd / 100 | 0;\r\n      else if (i == 1) rd = rd / 10 | 0;\r\n      r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;\r\n    } else {\r\n      r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&\r\n        (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||\r\n          (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;\r\n    }\r\n  } else {\r\n    if (i < 4) {\r\n      if (i == 0) rd = rd / 1000 | 0;\r\n      else if (i == 1) rd = rd / 100 | 0;\r\n      else if (i == 2) rd = rd / 10 | 0;\r\n      r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;\r\n    } else {\r\n      r = ((repeating || rm < 4) && rd + 1 == k ||\r\n      (!repeating && rm > 3) && rd + 1 == k / 2) &&\r\n        (d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;\r\n    }\r\n  }\r\n\r\n  return r;\r\n}\r\n\r\n\r\n// Convert string of `baseIn` to an array of numbers of `baseOut`.\r\n// Eg. convertBase('255', 10, 16) returns [15, 15].\r\n// Eg. convertBase('ff', 16, 10) returns [2, 5, 5].\r\nfunction convertBase(str, baseIn, baseOut) {\r\n  var j,\r\n    arr = [0],\r\n    arrL,\r\n    i = 0,\r\n    strL = str.length;\r\n\r\n  for (; i < strL;) {\r\n    for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;\r\n    arr[0] += NUMERALS.indexOf(str.charAt(i++));\r\n    for (j = 0; j < arr.length; j++) {\r\n      if (arr[j] > baseOut - 1) {\r\n        if (arr[j + 1] === void 0) arr[j + 1] = 0;\r\n        arr[j + 1] += arr[j] / baseOut | 0;\r\n        arr[j] %= baseOut;\r\n      }\r\n    }\r\n  }\r\n\r\n  return arr.reverse();\r\n}\r\n\r\n\r\n/*\r\n * cos(x) = 1 - x^2/2! + x^4/4! - ...\r\n * |x| < pi/2\r\n *\r\n */\r\nfunction cosine(Ctor, x) {\r\n  var k, len, y;\r\n\r\n  if (x.isZero()) return x;\r\n\r\n  // Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1\r\n  // i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1\r\n\r\n  // Estimate the optimum number of times to use the argument reduction.\r\n  len = x.d.length;\r\n  if (len < 32) {\r\n    k = Math.ceil(len / 3);\r\n    y = (1 / tinyPow(4, k)).toString();\r\n  } else {\r\n    k = 16;\r\n    y = '2.3283064365386962890625e-10';\r\n  }\r\n\r\n  Ctor.precision += k;\r\n\r\n  x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));\r\n\r\n  // Reverse argument reduction\r\n  for (var i = k; i--;) {\r\n    var cos2x = x.times(x);\r\n    x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);\r\n  }\r\n\r\n  Ctor.precision -= k;\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * Perform division in the specified base.\r\n */\r\nvar divide = (function () {\r\n\r\n  // Assumes non-zero x and k, and hence non-zero result.\r\n  function multiplyInteger(x, k, base) {\r\n    var temp,\r\n      carry = 0,\r\n      i = x.length;\r\n\r\n    for (x = x.slice(); i--;) {\r\n      temp = x[i] * k + carry;\r\n      x[i] = temp % base | 0;\r\n      carry = temp / base | 0;\r\n    }\r\n\r\n    if (carry) x.unshift(carry);\r\n\r\n    return x;\r\n  }\r\n\r\n  function compare(a, b, aL, bL) {\r\n    var i, r;\r\n\r\n    if (aL != bL) {\r\n      r = aL > bL ? 1 : -1;\r\n    } else {\r\n      for (i = r = 0; i < aL; i++) {\r\n        if (a[i] != b[i]) {\r\n          r = a[i] > b[i] ? 1 : -1;\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    return r;\r\n  }\r\n\r\n  function subtract(a, b, aL, base) {\r\n    var i = 0;\r\n\r\n    // Subtract b from a.\r\n    for (; aL--;) {\r\n      a[aL] -= i;\r\n      i = a[aL] < b[aL] ? 1 : 0;\r\n      a[aL] = i * base + a[aL] - b[aL];\r\n    }\r\n\r\n    // Remove leading zeros.\r\n    for (; !a[0] && a.length > 1;) a.shift();\r\n  }\r\n\r\n  return function (x, y, pr, rm, dp, base) {\r\n    var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,\r\n      yL, yz,\r\n      Ctor = x.constructor,\r\n      sign = x.s == y.s ? 1 : -1,\r\n      xd = x.d,\r\n      yd = y.d;\r\n\r\n    // Either NaN, Infinity or 0?\r\n    if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n      return new Ctor(// Return NaN if either NaN, or both Infinity or 0.\r\n        !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :\r\n\r\n        // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.\r\n        xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);\r\n    }\r\n\r\n    if (base) {\r\n      logBase = 1;\r\n      e = x.e - y.e;\r\n    } else {\r\n      base = BASE;\r\n      logBase = LOG_BASE;\r\n      e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);\r\n    }\r\n\r\n    yL = yd.length;\r\n    xL = xd.length;\r\n    q = new Ctor(sign);\r\n    qd = q.d = [];\r\n\r\n    // Result exponent may be one less than e.\r\n    // The digit array of a Decimal from toStringBinary may have trailing zeros.\r\n    for (i = 0; yd[i] == (xd[i] || 0); i++);\r\n\r\n    if (yd[i] > (xd[i] || 0)) e--;\r\n\r\n    if (pr == null) {\r\n      sd = pr = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    } else if (dp) {\r\n      sd = pr + (x.e - y.e) + 1;\r\n    } else {\r\n      sd = pr;\r\n    }\r\n\r\n    if (sd < 0) {\r\n      qd.push(1);\r\n      more = true;\r\n    } else {\r\n\r\n      // Convert precision in number of base 10 digits to base 1e7 digits.\r\n      sd = sd / logBase + 2 | 0;\r\n      i = 0;\r\n\r\n      // divisor < 1e7\r\n      if (yL == 1) {\r\n        k = 0;\r\n        yd = yd[0];\r\n        sd++;\r\n\r\n        // k is the carry.\r\n        for (; (i < xL || k) && sd--; i++) {\r\n          t = k * base + (xd[i] || 0);\r\n          qd[i] = t / yd | 0;\r\n          k = t % yd | 0;\r\n        }\r\n\r\n        more = k || i < xL;\r\n\r\n      // divisor >= 1e7\r\n      } else {\r\n\r\n        // Normalise xd and yd so highest order digit of yd is >= base/2\r\n        k = base / (yd[0] + 1) | 0;\r\n\r\n        if (k > 1) {\r\n          yd = multiplyInteger(yd, k, base);\r\n          xd = multiplyInteger(xd, k, base);\r\n          yL = yd.length;\r\n          xL = xd.length;\r\n        }\r\n\r\n        xi = yL;\r\n        rem = xd.slice(0, yL);\r\n        remL = rem.length;\r\n\r\n        // Add zeros to make remainder as long as divisor.\r\n        for (; remL < yL;) rem[remL++] = 0;\r\n\r\n        yz = yd.slice();\r\n        yz.unshift(0);\r\n        yd0 = yd[0];\r\n\r\n        if (yd[1] >= base / 2) ++yd0;\r\n\r\n        do {\r\n          k = 0;\r\n\r\n          // Compare divisor and remainder.\r\n          cmp = compare(yd, rem, yL, remL);\r\n\r\n          // If divisor < remainder.\r\n          if (cmp < 0) {\r\n\r\n            // Calculate trial digit, k.\r\n            rem0 = rem[0];\r\n            if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n            // k will be how many times the divisor goes into the current remainder.\r\n            k = rem0 / yd0 | 0;\r\n\r\n            //  Algorithm:\r\n            //  1. product = divisor * trial digit (k)\r\n            //  2. if product > remainder: product -= divisor, k--\r\n            //  3. remainder -= product\r\n            //  4. if product was < remainder at 2:\r\n            //    5. compare new remainder and divisor\r\n            //    6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n            if (k > 1) {\r\n              if (k >= base) k = base - 1;\r\n\r\n              // product = divisor * trial digit.\r\n              prod = multiplyInteger(yd, k, base);\r\n              prodL = prod.length;\r\n              remL = rem.length;\r\n\r\n              // Compare product and remainder.\r\n              cmp = compare(prod, rem, prodL, remL);\r\n\r\n              // product > remainder.\r\n              if (cmp == 1) {\r\n                k--;\r\n\r\n                // Subtract divisor from product.\r\n                subtract(prod, yL < prodL ? yz : yd, prodL, base);\r\n              }\r\n            } else {\r\n\r\n              // cmp is -1.\r\n              // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n              // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n              if (k == 0) cmp = k = 1;\r\n              prod = yd.slice();\r\n            }\r\n\r\n            prodL = prod.length;\r\n            if (prodL < remL) prod.unshift(0);\r\n\r\n            // Subtract product from remainder.\r\n            subtract(rem, prod, remL, base);\r\n\r\n            // If product was < previous remainder.\r\n            if (cmp == -1) {\r\n              remL = rem.length;\r\n\r\n              // Compare divisor and new remainder.\r\n              cmp = compare(yd, rem, yL, remL);\r\n\r\n              // If divisor < new remainder, subtract divisor from remainder.\r\n              if (cmp < 1) {\r\n                k++;\r\n\r\n                // Subtract divisor from remainder.\r\n                subtract(rem, yL < remL ? yz : yd, remL, base);\r\n              }\r\n            }\r\n\r\n            remL = rem.length;\r\n          } else if (cmp === 0) {\r\n            k++;\r\n            rem = [0];\r\n          }    // if cmp === 1, k will be 0\r\n\r\n          // Add the next digit, k, to the result array.\r\n          qd[i++] = k;\r\n\r\n          // Update the remainder.\r\n          if (cmp && rem[0]) {\r\n            rem[remL++] = xd[xi] || 0;\r\n          } else {\r\n            rem = [xd[xi]];\r\n            remL = 1;\r\n          }\r\n\r\n        } while ((xi++ < xL || rem[0] !== void 0) && sd--);\r\n\r\n        more = rem[0] !== void 0;\r\n      }\r\n\r\n      // Leading zero?\r\n      if (!qd[0]) qd.shift();\r\n    }\r\n\r\n    // logBase is 1 when divide is being used for base conversion.\r\n    if (logBase == 1) {\r\n      q.e = e;\r\n      inexact = more;\r\n    } else {\r\n\r\n      // To calculate q.e, first get the number of digits of qd[0].\r\n      for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;\r\n      q.e = i + e * logBase - 1;\r\n\r\n      finalise(q, dp ? pr + q.e + 1 : pr, rm, more);\r\n    }\r\n\r\n    return q;\r\n  };\r\n})();\r\n\r\n\r\n/*\r\n * Round `x` to `sd` significant digits using rounding mode `rm`.\r\n * Check for over/under-flow.\r\n */\r\n function finalise(x, sd, rm, isTruncated) {\r\n  var digits, i, j, k, rd, roundUp, w, xd, xdi,\r\n    Ctor = x.constructor;\r\n\r\n  // Don't round if sd is null or undefined.\r\n  out: if (sd != null) {\r\n    xd = x.d;\r\n\r\n    // Infinity/NaN.\r\n    if (!xd) return x;\r\n\r\n    // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n    // w: the word of xd containing rd, a base 1e7 number.\r\n    // xdi: the index of w within xd.\r\n    // digits: the number of digits of w.\r\n    // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n    // they had leading zeros)\r\n    // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n    // Get the length of the first word of the digits array xd.\r\n    for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;\r\n    i = sd - digits;\r\n\r\n    // Is the rounding digit in the first word of xd?\r\n    if (i < 0) {\r\n      i += LOG_BASE;\r\n      j = sd;\r\n      w = xd[xdi = 0];\r\n\r\n      // Get the rounding digit at index j of w.\r\n      rd = w / mathpow(10, digits - j - 1) % 10 | 0;\r\n    } else {\r\n      xdi = Math.ceil((i + 1) / LOG_BASE);\r\n      k = xd.length;\r\n      if (xdi >= k) {\r\n        if (isTruncated) {\r\n\r\n          // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.\r\n          for (; k++ <= xdi;) xd.push(0);\r\n          w = rd = 0;\r\n          digits = 1;\r\n          i %= LOG_BASE;\r\n          j = i - LOG_BASE + 1;\r\n        } else {\r\n          break out;\r\n        }\r\n      } else {\r\n        w = k = xd[xdi];\r\n\r\n        // Get the number of digits of w.\r\n        for (digits = 1; k >= 10; k /= 10) digits++;\r\n\r\n        // Get the index of rd within w.\r\n        i %= LOG_BASE;\r\n\r\n        // Get the index of rd within w, adjusted for leading zeros.\r\n        // The number of leading zeros of w is given by LOG_BASE - digits.\r\n        j = i - LOG_BASE + digits;\r\n\r\n        // Get the rounding digit at index j of w.\r\n        rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;\r\n      }\r\n    }\r\n\r\n    // Are there any non-zero digits after the rounding digit?\r\n    isTruncated = isTruncated || sd < 0 ||\r\n      xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));\r\n\r\n    // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right\r\n    // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression\r\n    // will give 714.\r\n\r\n    roundUp = rm < 4\r\n      ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n      : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&\r\n\r\n        // Check whether the digit to the left of the rounding digit is odd.\r\n        ((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n          rm == (x.s < 0 ? 8 : 7));\r\n\r\n    if (sd < 1 || !xd[0]) {\r\n      xd.length = 0;\r\n      if (roundUp) {\r\n\r\n        // Convert sd to decimal places.\r\n        sd -= x.e + 1;\r\n\r\n        // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n        xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n        x.e = -sd || 0;\r\n      } else {\r\n\r\n        // Zero.\r\n        xd[0] = x.e = 0;\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n    // Remove excess digits.\r\n    if (i == 0) {\r\n      xd.length = xdi;\r\n      k = 1;\r\n      xdi--;\r\n    } else {\r\n      xd.length = xdi + 1;\r\n      k = mathpow(10, LOG_BASE - i);\r\n\r\n      // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n      // j > 0 means i > number of leading zeros of w.\r\n      xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;\r\n    }\r\n\r\n    if (roundUp) {\r\n      for (;;) {\r\n\r\n        // Is the digit to be rounded up in the first word of xd?\r\n        if (xdi == 0) {\r\n\r\n          // i will be the length of xd[0] before k is added.\r\n          for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;\r\n          j = xd[0] += k;\r\n          for (k = 1; j >= 10; j /= 10) k++;\r\n\r\n          // if i != k the length has increased.\r\n          if (i != k) {\r\n            x.e++;\r\n            if (xd[0] == BASE) xd[0] = 1;\r\n          }\r\n\r\n          break;\r\n        } else {\r\n          xd[xdi] += k;\r\n          if (xd[xdi] != BASE) break;\r\n          xd[xdi--] = 0;\r\n          k = 1;\r\n        }\r\n      }\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n  }\r\n\r\n  if (external) {\r\n\r\n    // Overflow?\r\n    if (x.e > Ctor.maxE) {\r\n\r\n      // Infinity.\r\n      x.d = null;\r\n      x.e = NaN;\r\n\r\n    // Underflow?\r\n    } else if (x.e < Ctor.minE) {\r\n\r\n      // Zero.\r\n      x.e = 0;\r\n      x.d = [0];\r\n      // Ctor.underflow = true;\r\n    } // else Ctor.underflow = false;\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\nfunction finiteToString(x, isExp, sd) {\r\n  if (!x.isFinite()) return nonFiniteToString(x);\r\n  var k,\r\n    e = x.e,\r\n    str = digitsToString(x.d),\r\n    len = str.length;\r\n\r\n  if (isExp) {\r\n    if (sd && (k = sd - len) > 0) {\r\n      str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n    } else if (len > 1) {\r\n      str = str.charAt(0) + '.' + str.slice(1);\r\n    }\r\n\r\n    str = str + (x.e < 0 ? 'e' : 'e+') + x.e;\r\n  } else if (e < 0) {\r\n    str = '0.' + getZeroString(-e - 1) + str;\r\n    if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n  } else if (e >= len) {\r\n    str += getZeroString(e + 1 - len);\r\n    if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n  } else {\r\n    if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n    if (sd && (k = sd - len) > 0) {\r\n      if (e + 1 === len) str += '.';\r\n      str += getZeroString(k);\r\n    }\r\n  }\r\n\r\n  return str;\r\n}\r\n\r\n\r\n// Calculate the base 10 exponent from the base 1e7 exponent.\r\nfunction getBase10Exponent(digits, e) {\r\n  var w = digits[0];\r\n\r\n  // Add the number of digits of the first word of the digits array.\r\n  for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n  return e;\r\n}\r\n\r\n\r\nfunction getLn10(Ctor, sd, pr) {\r\n  if (sd > LN10_PRECISION) {\r\n\r\n    // Reset global state in case the exception is caught.\r\n    external = true;\r\n    if (pr) Ctor.precision = pr;\r\n    throw Error(precisionLimitExceeded);\r\n  }\r\n  return finalise(new Ctor(LN10), sd, 1, true);\r\n}\r\n\r\n\r\nfunction getPi(Ctor, sd, rm) {\r\n  if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);\r\n  return finalise(new Ctor(PI), sd, rm, true);\r\n}\r\n\r\n\r\nfunction getPrecision(digits) {\r\n  var w = digits.length - 1,\r\n    len = w * LOG_BASE + 1;\r\n\r\n  w = digits[w];\r\n\r\n  // If non-zero...\r\n  if (w) {\r\n\r\n    // Subtract the number of trailing zeros of the last word.\r\n    for (; w % 10 == 0; w /= 10) len--;\r\n\r\n    // Add the number of digits of the first word.\r\n    for (w = digits[0]; w >= 10; w /= 10) len++;\r\n  }\r\n\r\n  return len;\r\n}\r\n\r\n\r\nfunction getZeroString(k) {\r\n  var zs = '';\r\n  for (; k--;) zs += '0';\r\n  return zs;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an\r\n * integer of type number.\r\n *\r\n * Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.\r\n *\r\n */\r\nfunction intPow(Ctor, x, n, pr) {\r\n  var isTruncated,\r\n    r = new Ctor(1),\r\n\r\n    // Max n of 9007199254740991 takes 53 loop iterations.\r\n    // Maximum digits array length; leaves [28, 34] guard digits.\r\n    k = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n  external = false;\r\n\r\n  for (;;) {\r\n    if (n % 2) {\r\n      r = r.times(x);\r\n      if (truncate(r.d, k)) isTruncated = true;\r\n    }\r\n\r\n    n = mathfloor(n / 2);\r\n    if (n === 0) {\r\n\r\n      // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.\r\n      n = r.d.length - 1;\r\n      if (isTruncated && r.d[n] === 0) ++r.d[n];\r\n      break;\r\n    }\r\n\r\n    x = x.times(x);\r\n    truncate(x.d, k);\r\n  }\r\n\r\n  external = true;\r\n\r\n  return r;\r\n}\r\n\r\n\r\nfunction isOdd(n) {\r\n  return n.d[n.d.length - 1] & 1;\r\n}\r\n\r\n\r\n/*\r\n * Handle `max` (`n` is -1) and `min` (`n` is 1).\r\n */\r\nfunction maxOrMin(Ctor, args, n) {\r\n  var k, y,\r\n    x = new Ctor(args[0]),\r\n    i = 0;\r\n\r\n  for (; ++i < args.length;) {\r\n    y = new Ctor(args[i]);\r\n\r\n    // NaN?\r\n    if (!y.s) {\r\n      x = y;\r\n      break;\r\n    }\r\n\r\n    k = x.cmp(y);\r\n\r\n    if (k === n || k === 0 && x.s === n) {\r\n      x = y;\r\n    }\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant\r\n * digits.\r\n *\r\n * Taylor/Maclaurin series.\r\n *\r\n * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n *\r\n * Argument reduction:\r\n *   Repeat x = x / 32, k += 5, until |x| < 0.1\r\n *   exp(x) = exp(x / 2^k)^(2^k)\r\n *\r\n * Previously, the argument was initially reduced by\r\n * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)\r\n * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was\r\n * found to be slower than just dividing repeatedly by 32 as above.\r\n *\r\n * Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000\r\n * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000\r\n * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n *\r\n *  exp(Infinity)  = Infinity\r\n *  exp(-Infinity) = 0\r\n *  exp(NaN)       = NaN\r\n *  exp(±0)        = 1\r\n *\r\n *  exp(x) is non-terminating for any finite, non-zero x.\r\n *\r\n *  The result will always be correctly rounded.\r\n *\r\n */\r\nfunction naturalExponential(x, sd) {\r\n  var denominator, guard, j, pow, sum, t, wpr,\r\n    rep = 0,\r\n    i = 0,\r\n    k = 0,\r\n    Ctor = x.constructor,\r\n    rm = Ctor.rounding,\r\n    pr = Ctor.precision;\r\n\r\n  // 0/NaN/Infinity?\r\n  if (!x.d || !x.d[0] || x.e > 17) {\r\n\r\n    return new Ctor(x.d\r\n      ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0\r\n      : x.s ? x.s < 0 ? 0 : x : 0 / 0);\r\n  }\r\n\r\n  if (sd == null) {\r\n    external = false;\r\n    wpr = pr;\r\n  } else {\r\n    wpr = sd;\r\n  }\r\n\r\n  t = new Ctor(0.03125);\r\n\r\n  // while abs(x) >= 0.1\r\n  while (x.e > -2) {\r\n\r\n    // x = x / 2^5\r\n    x = x.times(t);\r\n    k += 5;\r\n  }\r\n\r\n  // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision\r\n  // necessary to ensure the first 4 rounding digits are correct.\r\n  guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;\r\n  wpr += guard;\r\n  denominator = pow = sum = new Ctor(1);\r\n  Ctor.precision = wpr;\r\n\r\n  for (;;) {\r\n    pow = finalise(pow.times(x), wpr, 1);\r\n    denominator = denominator.times(++i);\r\n    t = sum.plus(divide(pow, denominator, wpr, 1));\r\n\r\n    if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n      j = k;\r\n      while (j--) sum = finalise(sum.times(sum), wpr, 1);\r\n\r\n      // Check to see if the first 4 rounding digits are [49]999.\r\n      // If so, repeat the summation with a higher precision, otherwise\r\n      // e.g. with precision: 18, rounding: 1\r\n      // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)\r\n      // `wpr - guard` is the index of first rounding digit.\r\n      if (sd == null) {\r\n\r\n        if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n          Ctor.precision = wpr += 10;\r\n          denominator = pow = t = new Ctor(1);\r\n          i = 0;\r\n          rep++;\r\n        } else {\r\n          return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n        }\r\n      } else {\r\n        Ctor.precision = pr;\r\n        return sum;\r\n      }\r\n    }\r\n\r\n    sum = t;\r\n  }\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant\r\n * digits.\r\n *\r\n *  ln(-n)        = NaN\r\n *  ln(0)         = -Infinity\r\n *  ln(-0)        = -Infinity\r\n *  ln(1)         = 0\r\n *  ln(Infinity)  = Infinity\r\n *  ln(-Infinity) = NaN\r\n *  ln(NaN)       = NaN\r\n *\r\n *  ln(n) (n != 1) is non-terminating.\r\n *\r\n */\r\nfunction naturalLogarithm(y, sd) {\r\n  var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,\r\n    n = 1,\r\n    guard = 10,\r\n    x = y,\r\n    xd = x.d,\r\n    Ctor = x.constructor,\r\n    rm = Ctor.rounding,\r\n    pr = Ctor.precision;\r\n\r\n  // Is x negative or Infinity, NaN, 0 or 1?\r\n  if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {\r\n    return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);\r\n  }\r\n\r\n  if (sd == null) {\r\n    external = false;\r\n    wpr = pr;\r\n  } else {\r\n    wpr = sd;\r\n  }\r\n\r\n  Ctor.precision = wpr += guard;\r\n  c = digitsToString(xd);\r\n  c0 = c.charAt(0);\r\n\r\n  if (Math.abs(e = x.e) < 1.5e15) {\r\n\r\n    // Argument reduction.\r\n    // The series converges faster the closer the argument is to 1, so using\r\n    // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b\r\n    // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n    // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n    // later be divided by this number, then separate out the power of 10 using\r\n    // ln(a*10^b) = ln(a) + b*ln(10).\r\n\r\n    // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n    //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {\r\n    // max n is 6 (gives 0.7 - 1.3)\r\n    while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {\r\n      x = x.times(y);\r\n      c = digitsToString(x.d);\r\n      c0 = c.charAt(0);\r\n      n++;\r\n    }\r\n\r\n    e = x.e;\r\n\r\n    if (c0 > 1) {\r\n      x = new Ctor('0.' + c);\r\n      e++;\r\n    } else {\r\n      x = new Ctor(c0 + '.' + c.slice(1));\r\n    }\r\n  } else {\r\n\r\n    // The argument reduction method above may result in overflow if the argument y is a massive\r\n    // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n    // function using ln(x*10^e) = ln(x) + e*ln(10).\r\n    t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n    x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n    Ctor.precision = pr;\r\n\r\n    return sd == null ? finalise(x, pr, rm, external = true) : x;\r\n  }\r\n\r\n  // x1 is x reduced to a value near 1.\r\n  x1 = x;\r\n\r\n  // Taylor series.\r\n  // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n  // where x = (y - 1)/(y + 1)    (|x| < 1)\r\n  sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);\r\n  x2 = finalise(x.times(x), wpr, 1);\r\n  denominator = 3;\r\n\r\n  for (;;) {\r\n    numerator = finalise(numerator.times(x2), wpr, 1);\r\n    t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));\r\n\r\n    if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n      sum = sum.times(2);\r\n\r\n      // Reverse the argument reduction. Check that e is not 0 because, besides preventing an\r\n      // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.\r\n      if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n      sum = divide(sum, new Ctor(n), wpr, 1);\r\n\r\n      // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has\r\n      // been repeated previously) and the first 4 rounding digits 9999?\r\n      // If so, restart the summation with a higher precision, otherwise\r\n      // e.g. with precision: 12, rounding: 1\r\n      // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.\r\n      // `wpr - guard` is the index of first rounding digit.\r\n      if (sd == null) {\r\n        if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n          Ctor.precision = wpr += guard;\r\n          t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);\r\n          x2 = finalise(x.times(x), wpr, 1);\r\n          denominator = rep = 1;\r\n        } else {\r\n          return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n        }\r\n      } else {\r\n        Ctor.precision = pr;\r\n        return sum;\r\n      }\r\n    }\r\n\r\n    sum = t;\r\n    denominator += 2;\r\n  }\r\n}\r\n\r\n\r\n// ±Infinity, NaN.\r\nfunction nonFiniteToString(x) {\r\n  // Unsigned.\r\n  return String(x.s * x.s / 0);\r\n}\r\n\r\n\r\n/*\r\n * Parse the value of a new Decimal `x` from string `str`.\r\n */\r\nfunction parseDecimal(x, str) {\r\n  var e, i, len;\r\n\r\n  // TODO BigInt str: no need to check for decimal point, exponential form or leading zeros.\r\n  // Decimal point?\r\n  if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n  // Exponential form?\r\n  if ((i = str.search(/e/i)) > 0) {\r\n\r\n    // Determine exponent.\r\n    if (e < 0) e = i;\r\n    e += +str.slice(i + 1);\r\n    str = str.substring(0, i);\r\n  } else if (e < 0) {\r\n\r\n    // Integer.\r\n    e = str.length;\r\n  }\r\n\r\n  // Determine leading zeros.\r\n  for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n  // Determine trailing zeros.\r\n  for (len = str.length; str.charCodeAt(len - 1) === 48; --len);\r\n  str = str.slice(i, len);\r\n\r\n  if (str) {\r\n    len -= i;\r\n    x.e = e = e - i - 1;\r\n    x.d = [];\r\n\r\n    // Transform base\r\n\r\n    // e is the base 10 exponent.\r\n    // i is where to slice str to get the first word of the digits array.\r\n    i = (e + 1) % LOG_BASE;\r\n    if (e < 0) i += LOG_BASE;\r\n\r\n    if (i < len) {\r\n      if (i) x.d.push(+str.slice(0, i));\r\n      for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n      str = str.slice(i);\r\n      i = LOG_BASE - str.length;\r\n    } else {\r\n      i -= len;\r\n    }\r\n\r\n    for (; i--;) str += '0';\r\n    x.d.push(+str);\r\n\r\n    if (external) {\r\n\r\n      // Overflow?\r\n      if (x.e > x.constructor.maxE) {\r\n\r\n        // Infinity.\r\n        x.d = null;\r\n        x.e = NaN;\r\n\r\n      // Underflow?\r\n      } else if (x.e < x.constructor.minE) {\r\n\r\n        // Zero.\r\n        x.e = 0;\r\n        x.d = [0];\r\n        // x.constructor.underflow = true;\r\n      } // else x.constructor.underflow = false;\r\n    }\r\n  } else {\r\n\r\n    // Zero.\r\n    x.e = 0;\r\n    x.d = [0];\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.\r\n */\r\nfunction parseOther(x, str) {\r\n  var base, Ctor, divisor, i, isFloat, len, p, xd, xe;\r\n\r\n  if (str.indexOf('_') > -1) {\r\n    str = str.replace(/(\\d)_(?=\\d)/g, '$1');\r\n    if (isDecimal.test(str)) return parseDecimal(x, str);\r\n  } else if (str === 'Infinity' || str === 'NaN') {\r\n    if (!+str) x.s = NaN;\r\n    x.e = NaN;\r\n    x.d = null;\r\n    return x;\r\n  }\r\n\r\n  if (isHex.test(str))  {\r\n    base = 16;\r\n    str = str.toLowerCase();\r\n  } else if (isBinary.test(str))  {\r\n    base = 2;\r\n  } else if (isOctal.test(str))  {\r\n    base = 8;\r\n  } else {\r\n    throw Error(invalidArgument + str);\r\n  }\r\n\r\n  // Is there a binary exponent part?\r\n  i = str.search(/p/i);\r\n\r\n  if (i > 0) {\r\n    p = +str.slice(i + 1);\r\n    str = str.substring(2, i);\r\n  } else {\r\n    str = str.slice(2);\r\n  }\r\n\r\n  // Convert `str` as an integer then divide the result by `base` raised to a power such that the\r\n  // fraction part will be restored.\r\n  i = str.indexOf('.');\r\n  isFloat = i >= 0;\r\n  Ctor = x.constructor;\r\n\r\n  if (isFloat) {\r\n    str = str.replace('.', '');\r\n    len = str.length;\r\n    i = len - i;\r\n\r\n    // log[10](16) = 1.2041... , log[10](88) = 1.9444....\r\n    divisor = intPow(Ctor, new Ctor(base), i, i * 2);\r\n  }\r\n\r\n  xd = convertBase(str, base, BASE);\r\n  xe = xd.length - 1;\r\n\r\n  // Remove trailing zeros.\r\n  for (i = xe; xd[i] === 0; --i) xd.pop();\r\n  if (i < 0) return new Ctor(x.s * 0);\r\n  x.e = getBase10Exponent(xd, xe);\r\n  x.d = xd;\r\n  external = false;\r\n\r\n  // At what precision to perform the division to ensure exact conversion?\r\n  // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)\r\n  // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412\r\n  // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.\r\n  // maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount\r\n  // Therefore using 4 * the number of digits of str will always be enough.\r\n  if (isFloat) x = divide(x, divisor, len * 4);\r\n\r\n  // Multiply by the binary exponent part if present.\r\n  if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));\r\n  external = true;\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * sin(x) = x - x^3/3! + x^5/5! - ...\r\n * |x| < pi/2\r\n *\r\n */\r\nfunction sine(Ctor, x) {\r\n  var k,\r\n    len = x.d.length;\r\n\r\n  if (len < 3) {\r\n    return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);\r\n  }\r\n\r\n  // Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)\r\n  // i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)\r\n  // and  sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))\r\n\r\n  // Estimate the optimum number of times to use the argument reduction.\r\n  k = 1.4 * Math.sqrt(len);\r\n  k = k > 16 ? 16 : k | 0;\r\n\r\n  x = x.times(1 / tinyPow(5, k));\r\n  x = taylorSeries(Ctor, 2, x, x);\r\n\r\n  // Reverse argument reduction\r\n  var sin2_x,\r\n    d5 = new Ctor(5),\r\n    d16 = new Ctor(16),\r\n    d20 = new Ctor(20);\r\n  for (; k--;) {\r\n    sin2_x = x.times(x);\r\n    x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\n// Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.\r\nfunction taylorSeries(Ctor, n, x, y, isHyperbolic) {\r\n  var j, t, u, x2,\r\n    i = 1,\r\n    pr = Ctor.precision,\r\n    k = Math.ceil(pr / LOG_BASE);\r\n\r\n  external = false;\r\n  x2 = x.times(x);\r\n  u = new Ctor(y);\r\n\r\n  for (;;) {\r\n    t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);\r\n    u = isHyperbolic ? y.plus(t) : y.minus(t);\r\n    y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);\r\n    t = u.plus(y);\r\n\r\n    if (t.d[k] !== void 0) {\r\n      for (j = k; t.d[j] === u.d[j] && j--;);\r\n      if (j == -1) break;\r\n    }\r\n\r\n    j = u;\r\n    u = y;\r\n    y = t;\r\n    t = j;\r\n    i++;\r\n  }\r\n\r\n  external = true;\r\n  t.d.length = k + 1;\r\n\r\n  return t;\r\n}\r\n\r\n\r\n// Exponent e must be positive and non-zero.\r\nfunction tinyPow(b, e) {\r\n  var n = b;\r\n  while (--e) n *= b;\r\n  return n;\r\n}\r\n\r\n\r\n// Return the absolute value of `x` reduced to less than or equal to half pi.\r\nfunction toLessThanHalfPi(Ctor, x) {\r\n  var t,\r\n    isNeg = x.s < 0,\r\n    pi = getPi(Ctor, Ctor.precision, 1),\r\n    halfPi = pi.times(0.5);\r\n\r\n  x = x.abs();\r\n\r\n  if (x.lte(halfPi)) {\r\n    quadrant = isNeg ? 4 : 1;\r\n    return x;\r\n  }\r\n\r\n  t = x.divToInt(pi);\r\n\r\n  if (t.isZero()) {\r\n    quadrant = isNeg ? 3 : 2;\r\n  } else {\r\n    x = x.minus(t.times(pi));\r\n\r\n    // 0 <= x < pi\r\n    if (x.lte(halfPi)) {\r\n      quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);\r\n      return x;\r\n    }\r\n\r\n    quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);\r\n  }\r\n\r\n  return x.minus(pi).abs();\r\n}\r\n\r\n\r\n/*\r\n * Return the value of Decimal `x` as a string in base `baseOut`.\r\n *\r\n * If the optional `sd` argument is present include a binary exponent suffix.\r\n */\r\nfunction toStringBinary(x, baseOut, sd, rm) {\r\n  var base, e, i, k, len, roundUp, str, xd, y,\r\n    Ctor = x.constructor,\r\n    isExp = sd !== void 0;\r\n\r\n  if (isExp) {\r\n    checkInt32(sd, 1, MAX_DIGITS);\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n  } else {\r\n    sd = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n  }\r\n\r\n  if (!x.isFinite()) {\r\n    str = nonFiniteToString(x);\r\n  } else {\r\n    str = finiteToString(x);\r\n    i = str.indexOf('.');\r\n\r\n    // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:\r\n    // maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))\r\n    // minBinaryExponent = floor(decimalExponent * log[2](10))\r\n    // log[2](10) = 3.321928094887362347870319429489390175864\r\n\r\n    if (isExp) {\r\n      base = 2;\r\n      if (baseOut == 16) {\r\n        sd = sd * 4 - 3;\r\n      } else if (baseOut == 8) {\r\n        sd = sd * 3 - 2;\r\n      }\r\n    } else {\r\n      base = baseOut;\r\n    }\r\n\r\n    // Convert the number as an integer then divide the result by its base raised to a power such\r\n    // that the fraction part will be restored.\r\n\r\n    // Non-integer.\r\n    if (i >= 0) {\r\n      str = str.replace('.', '');\r\n      y = new Ctor(1);\r\n      y.e = str.length - i;\r\n      y.d = convertBase(finiteToString(y), 10, base);\r\n      y.e = y.d.length;\r\n    }\r\n\r\n    xd = convertBase(str, 10, base);\r\n    e = len = xd.length;\r\n\r\n    // Remove trailing zeros.\r\n    for (; xd[--len] == 0;) xd.pop();\r\n\r\n    if (!xd[0]) {\r\n      str = isExp ? '0p+0' : '0';\r\n    } else {\r\n      if (i < 0) {\r\n        e--;\r\n      } else {\r\n        x = new Ctor(x);\r\n        x.d = xd;\r\n        x.e = e;\r\n        x = divide(x, y, sd, rm, 0, base);\r\n        xd = x.d;\r\n        e = x.e;\r\n        roundUp = inexact;\r\n      }\r\n\r\n      // The rounding digit, i.e. the digit after the digit that may be rounded up.\r\n      i = xd[sd];\r\n      k = base / 2;\r\n      roundUp = roundUp || xd[sd + 1] !== void 0;\r\n\r\n      roundUp = rm < 4\r\n        ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))\r\n        : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||\r\n          rm === (x.s < 0 ? 8 : 7));\r\n\r\n      xd.length = sd;\r\n\r\n      if (roundUp) {\r\n\r\n        // Rounding up may mean the previous digit has to be rounded up and so on.\r\n        for (; ++xd[--sd] > base - 1;) {\r\n          xd[sd] = 0;\r\n          if (!sd) {\r\n            ++e;\r\n            xd.unshift(1);\r\n          }\r\n        }\r\n      }\r\n\r\n      // Determine trailing zeros.\r\n      for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n      // E.g. [4, 11, 15] becomes 4bf.\r\n      for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n\r\n      // Add binary exponent suffix?\r\n      if (isExp) {\r\n        if (len > 1) {\r\n          if (baseOut == 16 || baseOut == 8) {\r\n            i = baseOut == 16 ? 4 : 3;\r\n            for (--len; len % i; len++) str += '0';\r\n            xd = convertBase(str, base, baseOut);\r\n            for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n            // xd[0] will always be be 1\r\n            for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n          } else {\r\n            str = str.charAt(0) + '.' + str.slice(1);\r\n          }\r\n        }\r\n\r\n        str =  str + (e < 0 ? 'p' : 'p+') + e;\r\n      } else if (e < 0) {\r\n        for (; ++e;) str = '0' + str;\r\n        str = '0.' + str;\r\n      } else {\r\n        if (++e > len) for (e -= len; e-- ;) str += '0';\r\n        else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);\r\n      }\r\n    }\r\n\r\n    str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;\r\n  }\r\n\r\n  return x.s < 0 ? '-' + str : str;\r\n}\r\n\r\n\r\n// Does not strip trailing zeros.\r\nfunction truncate(arr, len) {\r\n  if (arr.length > len) {\r\n    arr.length = len;\r\n    return true;\r\n  }\r\n}\r\n\r\n\r\n// Decimal methods\r\n\r\n\r\n/*\r\n *  abs\r\n *  acos\r\n *  acosh\r\n *  add\r\n *  asin\r\n *  asinh\r\n *  atan\r\n *  atanh\r\n *  atan2\r\n *  cbrt\r\n *  ceil\r\n *  clamp\r\n *  clone\r\n *  config\r\n *  cos\r\n *  cosh\r\n *  div\r\n *  exp\r\n *  floor\r\n *  hypot\r\n *  ln\r\n *  log\r\n *  log2\r\n *  log10\r\n *  max\r\n *  min\r\n *  mod\r\n *  mul\r\n *  pow\r\n *  random\r\n *  round\r\n *  set\r\n *  sign\r\n *  sin\r\n *  sinh\r\n *  sqrt\r\n *  sub\r\n *  sum\r\n *  tan\r\n *  tanh\r\n *  trunc\r\n */\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the absolute value of `x`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction abs(x) {\r\n  return new this(x).abs();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arccosine in radians of `x`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction acos(x) {\r\n  return new this(x).acos();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction acosh(x) {\r\n  return new this(x).acosh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction add(x, y) {\r\n  return new this(x).plus(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction asin(x) {\r\n  return new this(x).asin();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction asinh(x) {\r\n  return new this(x).asinh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction atan(x) {\r\n  return new this(x).atan();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction atanh(x) {\r\n  return new this(x).atanh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi\r\n * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-pi, pi]\r\n *\r\n * y {number|string|bigint|Decimal} The y-coordinate.\r\n * x {number|string|bigint|Decimal} The x-coordinate.\r\n *\r\n * atan2(±0, -0)               = ±pi\r\n * atan2(±0, +0)               = ±0\r\n * atan2(±0, -x)               = ±pi for x > 0\r\n * atan2(±0, x)                = ±0 for x > 0\r\n * atan2(-y, ±0)               = -pi/2 for y > 0\r\n * atan2(y, ±0)                = pi/2 for y > 0\r\n * atan2(±y, -Infinity)        = ±pi for finite y > 0\r\n * atan2(±y, +Infinity)        = ±0 for finite y > 0\r\n * atan2(±Infinity, x)         = ±pi/2 for finite x\r\n * atan2(±Infinity, -Infinity) = ±3*pi/4\r\n * atan2(±Infinity, +Infinity) = ±pi/4\r\n * atan2(NaN, x) = NaN\r\n * atan2(y, NaN) = NaN\r\n *\r\n */\r\nfunction atan2(y, x) {\r\n  y = new this(y);\r\n  x = new this(x);\r\n  var r,\r\n    pr = this.precision,\r\n    rm = this.rounding,\r\n    wpr = pr + 4;\r\n\r\n  // Either NaN\r\n  if (!y.s || !x.s) {\r\n    r = new this(NaN);\r\n\r\n  // Both ±Infinity\r\n  } else if (!y.d && !x.d) {\r\n    r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);\r\n    r.s = y.s;\r\n\r\n  // x is ±Infinity or y is ±0\r\n  } else if (!x.d || y.isZero()) {\r\n    r = x.s < 0 ? getPi(this, pr, rm) : new this(0);\r\n    r.s = y.s;\r\n\r\n  // y is ±Infinity or x is ±0\r\n  } else if (!y.d || x.isZero()) {\r\n    r = getPi(this, wpr, 1).times(0.5);\r\n    r.s = y.s;\r\n\r\n  // Both non-zero and finite\r\n  } else if (x.s < 0) {\r\n    this.precision = wpr;\r\n    this.rounding = 1;\r\n    r = this.atan(divide(y, x, wpr, 1));\r\n    x = getPi(this, wpr, 1);\r\n    this.precision = pr;\r\n    this.rounding = rm;\r\n    r = y.s < 0 ? r.minus(x) : r.plus(x);\r\n  } else {\r\n    r = this.atan(divide(y, x, wpr, 1));\r\n  }\r\n\r\n  return r;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction cbrt(x) {\r\n  return new this(x).cbrt();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction ceil(x) {\r\n  return finalise(x = new this(x), x.e + 1, 2);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * min {number|string|bigint|Decimal}\r\n * max {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction clamp(x, min, max) {\r\n  return new this(x).clamp(min, max);\r\n}\r\n\r\n\r\n/*\r\n * Configure global settings for a Decimal constructor.\r\n *\r\n * `obj` is an object with one or more of the following properties,\r\n *\r\n *   precision  {number}\r\n *   rounding   {number}\r\n *   toExpNeg   {number}\r\n *   toExpPos   {number}\r\n *   maxE       {number}\r\n *   minE       {number}\r\n *   modulo     {number}\r\n *   crypto     {boolean|number}\r\n *   defaults   {true}\r\n *\r\n * E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n *\r\n */\r\nfunction config(obj) {\r\n  if (!obj || typeof obj !== 'object') throw Error(decimalError + 'Object expected');\r\n  var i, p, v,\r\n    useDefaults = obj.defaults === true,\r\n    ps = [\r\n      'precision', 1, MAX_DIGITS,\r\n      'rounding', 0, 8,\r\n      'toExpNeg', -EXP_LIMIT, 0,\r\n      'toExpPos', 0, EXP_LIMIT,\r\n      'maxE', 0, EXP_LIMIT,\r\n      'minE', -EXP_LIMIT, 0,\r\n      'modulo', 0, 9\r\n    ];\r\n\r\n  for (i = 0; i < ps.length; i += 3) {\r\n    if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];\r\n    if ((v = obj[p]) !== void 0) {\r\n      if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n      else throw Error(invalidArgument + p + ': ' + v);\r\n    }\r\n  }\r\n\r\n  if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];\r\n  if ((v = obj[p]) !== void 0) {\r\n    if (v === true || v === false || v === 0 || v === 1) {\r\n      if (v) {\r\n        if (typeof crypto != 'undefined' && crypto &&\r\n          (crypto.getRandomValues || crypto.randomBytes)) {\r\n          this[p] = true;\r\n        } else {\r\n          throw Error(cryptoUnavailable);\r\n        }\r\n      } else {\r\n        this[p] = false;\r\n      }\r\n    } else {\r\n      throw Error(invalidArgument + p + ': ' + v);\r\n    }\r\n  }\r\n\r\n  return this;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction cos(x) {\r\n  return new this(x).cos();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction cosh(x) {\r\n  return new this(x).cosh();\r\n}\r\n\r\n\r\n/*\r\n * Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n * constructor.\r\n *\r\n */\r\nfunction clone(obj) {\r\n  var i, p, ps;\r\n\r\n  /*\r\n   * The Decimal constructor and exported function.\r\n   * Return a new Decimal instance.\r\n   *\r\n   * v {number|string|bigint|Decimal} A numeric value.\r\n   *\r\n   */\r\n  function Decimal(v) {\r\n    var e, i, t,\r\n      x = this;\r\n\r\n    // Decimal called without new.\r\n    if (!(x instanceof Decimal)) return new Decimal(v);\r\n\r\n    // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n    // which points to Object.\r\n    x.constructor = Decimal;\r\n\r\n    if (isDecimalInstance(v)) {\r\n      x.s = v.s;\r\n\r\n      if (external) {\r\n        if (!v.d || v.e > Decimal.maxE) {\r\n\r\n          // Infinity.\r\n          x.e = NaN;\r\n          x.d = null;\r\n        } else if (v.e < Decimal.minE) {\r\n\r\n          // Zero.\r\n          x.e = 0;\r\n          x.d = [0];\r\n        } else {\r\n          x.e = v.e;\r\n          x.d = v.d.slice();\r\n        }\r\n      } else {\r\n        x.e = v.e;\r\n        x.d = v.d ? v.d.slice() : v.d;\r\n      }\r\n\r\n      return;\r\n    }\r\n\r\n    t = typeof v;\r\n\r\n    if (t === 'number') {\r\n      if (v === 0) {\r\n        x.s = 1 / v < 0 ? -1 : 1;\r\n        x.e = 0;\r\n        x.d = [0];\r\n        return;\r\n      }\r\n\r\n      if (v < 0) {\r\n        v = -v;\r\n        x.s = -1;\r\n      } else {\r\n        x.s = 1;\r\n      }\r\n\r\n      // Fast path for small integers.\r\n      if (v === ~~v && v < 1e7) {\r\n        for (e = 0, i = v; i >= 10; i /= 10) e++;\r\n\r\n        if (external) {\r\n          if (e > Decimal.maxE) {\r\n            x.e = NaN;\r\n            x.d = null;\r\n          } else if (e < Decimal.minE) {\r\n            x.e = 0;\r\n            x.d = [0];\r\n          } else {\r\n            x.e = e;\r\n            x.d = [v];\r\n          }\r\n        } else {\r\n          x.e = e;\r\n          x.d = [v];\r\n        }\r\n\r\n        return;\r\n      }\r\n\r\n      // Infinity or NaN?\r\n      if (v * 0 !== 0) {\r\n        if (!v) x.s = NaN;\r\n        x.e = NaN;\r\n        x.d = null;\r\n        return;\r\n      }\r\n\r\n      return parseDecimal(x, v.toString());\r\n    }\r\n\r\n    if (t === 'string') {\r\n      if ((i = v.charCodeAt(0)) === 45) {  // minus sign\r\n        v = v.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        if (i === 43) v = v.slice(1);  // plus sign\r\n        x.s = 1;\r\n      }\r\n\r\n      return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);\r\n    }\r\n\r\n    if (t === 'bigint') {\r\n      if (v < 0) {\r\n        v = -v;\r\n        x.s = -1;\r\n      } else {\r\n        x.s = 1;\r\n      }\r\n\r\n      return parseDecimal(x, v.toString());\r\n    }\r\n\r\n    throw Error(invalidArgument + v);\r\n  }\r\n\r\n  Decimal.prototype = P;\r\n\r\n  Decimal.ROUND_UP = 0;\r\n  Decimal.ROUND_DOWN = 1;\r\n  Decimal.ROUND_CEIL = 2;\r\n  Decimal.ROUND_FLOOR = 3;\r\n  Decimal.ROUND_HALF_UP = 4;\r\n  Decimal.ROUND_HALF_DOWN = 5;\r\n  Decimal.ROUND_HALF_EVEN = 6;\r\n  Decimal.ROUND_HALF_CEIL = 7;\r\n  Decimal.ROUND_HALF_FLOOR = 8;\r\n  Decimal.EUCLID = 9;\r\n\r\n  Decimal.config = Decimal.set = config;\r\n  Decimal.clone = clone;\r\n  Decimal.isDecimal = isDecimalInstance;\r\n\r\n  Decimal.abs = abs;\r\n  Decimal.acos = acos;\r\n  Decimal.acosh = acosh;        // ES6\r\n  Decimal.add = add;\r\n  Decimal.asin = asin;\r\n  Decimal.asinh = asinh;        // ES6\r\n  Decimal.atan = atan;\r\n  Decimal.atanh = atanh;        // ES6\r\n  Decimal.atan2 = atan2;\r\n  Decimal.cbrt = cbrt;          // ES6\r\n  Decimal.ceil = ceil;\r\n  Decimal.clamp = clamp;\r\n  Decimal.cos = cos;\r\n  Decimal.cosh = cosh;          // ES6\r\n  Decimal.div = div;\r\n  Decimal.exp = exp;\r\n  Decimal.floor = floor;\r\n  Decimal.hypot = hypot;        // ES6\r\n  Decimal.ln = ln;\r\n  Decimal.log = log;\r\n  Decimal.log10 = log10;        // ES6\r\n  Decimal.log2 = log2;          // ES6\r\n  Decimal.max = max;\r\n  Decimal.min = min;\r\n  Decimal.mod = mod;\r\n  Decimal.mul = mul;\r\n  Decimal.pow = pow;\r\n  Decimal.random = random;\r\n  Decimal.round = round;\r\n  Decimal.sign = sign;          // ES6\r\n  Decimal.sin = sin;\r\n  Decimal.sinh = sinh;          // ES6\r\n  Decimal.sqrt = sqrt;\r\n  Decimal.sub = sub;\r\n  Decimal.sum = sum;\r\n  Decimal.tan = tan;\r\n  Decimal.tanh = tanh;          // ES6\r\n  Decimal.trunc = trunc;        // ES6\r\n\r\n  if (obj === void 0) obj = {};\r\n  if (obj) {\r\n    if (obj.defaults !== true) {\r\n      ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];\r\n      for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n    }\r\n  }\r\n\r\n  Decimal.config(obj);\r\n\r\n  return Decimal;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction div(x, y) {\r\n  return new this(x).div(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} The power to which to raise the base of the natural log.\r\n *\r\n */\r\nfunction exp(x) {\r\n  return new this(x).exp();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction floor(x) {\r\n  return finalise(x = new this(x), x.e + 1, 3);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the square root of the sum of the squares of the arguments,\r\n * rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction hypot() {\r\n  var i, n,\r\n    t = new this(0);\r\n\r\n  external = false;\r\n\r\n  for (i = 0; i < arguments.length;) {\r\n    n = new this(arguments[i++]);\r\n    if (!n.d) {\r\n      if (n.s) {\r\n        external = true;\r\n        return new this(1 / 0);\r\n      }\r\n      t = n;\r\n    } else if (t.d) {\r\n      t = t.plus(n.times(n));\r\n    }\r\n  }\r\n\r\n  external = true;\r\n\r\n  return t.sqrt();\r\n}\r\n\r\n\r\n/*\r\n * Return true if object is a Decimal instance (where Decimal is any Decimal constructor),\r\n * otherwise return false.\r\n *\r\n */\r\nfunction isDecimalInstance(obj) {\r\n  return obj instanceof Decimal || obj && obj.toStringTag === tag || false;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction ln(x) {\r\n  return new this(x).ln();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base\r\n * is specified, rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * log[y](x)\r\n *\r\n * x {number|string|bigint|Decimal} The argument of the logarithm.\r\n * y {number|string|bigint|Decimal} The base of the logarithm.\r\n *\r\n */\r\nfunction log(x, y) {\r\n  return new this(x).log(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction log2(x) {\r\n  return new this(x).log(2);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction log10(x) {\r\n  return new this(x).log(10);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the maximum of the arguments.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction max() {\r\n  return maxOrMin(this, arguments, -1);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the minimum of the arguments.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction min() {\r\n  return maxOrMin(this, arguments, 1);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction mod(x, y) {\r\n  return new this(x).mod(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction mul(x, y) {\r\n  return new this(x).mul(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} The base.\r\n * y {number|string|bigint|Decimal} The exponent.\r\n *\r\n */\r\nfunction pow(x, y) {\r\n  return new this(x).pow(y);\r\n}\r\n\r\n\r\n/*\r\n * Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with\r\n * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros\r\n * are produced).\r\n *\r\n * [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.\r\n *\r\n */\r\nfunction random(sd) {\r\n  var d, e, k, n,\r\n    i = 0,\r\n    r = new this(1),\r\n    rd = [];\r\n\r\n  if (sd === void 0) sd = this.precision;\r\n  else checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n  k = Math.ceil(sd / LOG_BASE);\r\n\r\n  if (!this.crypto) {\r\n    for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;\r\n\r\n  // Browsers supporting crypto.getRandomValues.\r\n  } else if (crypto.getRandomValues) {\r\n    d = crypto.getRandomValues(new Uint32Array(k));\r\n\r\n    for (; i < k;) {\r\n      n = d[i];\r\n\r\n      // 0 <= n < 4294967296\r\n      // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).\r\n      if (n >= 4.29e9) {\r\n        d[i] = crypto.getRandomValues(new Uint32Array(1))[0];\r\n      } else {\r\n\r\n        // 0 <= n <= 4289999999\r\n        // 0 <= (n % 1e7) <= 9999999\r\n        rd[i++] = n % 1e7;\r\n      }\r\n    }\r\n\r\n  // Node.js supporting crypto.randomBytes.\r\n  } else if (crypto.randomBytes) {\r\n\r\n    // buffer\r\n    d = crypto.randomBytes(k *= 4);\r\n\r\n    for (; i < k;) {\r\n\r\n      // 0 <= n < 2147483648\r\n      n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);\r\n\r\n      // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).\r\n      if (n >= 2.14e9) {\r\n        crypto.randomBytes(4).copy(d, i);\r\n      } else {\r\n\r\n        // 0 <= n <= 2139999999\r\n        // 0 <= (n % 1e7) <= 9999999\r\n        rd.push(n % 1e7);\r\n        i += 4;\r\n      }\r\n    }\r\n\r\n    i = k / 4;\r\n  } else {\r\n    throw Error(cryptoUnavailable);\r\n  }\r\n\r\n  k = rd[--i];\r\n  sd %= LOG_BASE;\r\n\r\n  // Convert trailing digits to zeros according to sd.\r\n  if (k && sd) {\r\n    n = mathpow(10, LOG_BASE - sd);\r\n    rd[i] = (k / n | 0) * n;\r\n  }\r\n\r\n  // Remove trailing words which are zero.\r\n  for (; rd[i] === 0; i--) rd.pop();\r\n\r\n  // Zero?\r\n  if (i < 0) {\r\n    e = 0;\r\n    rd = [0];\r\n  } else {\r\n    e = -1;\r\n\r\n    // Remove leading words which are zero and adjust exponent accordingly.\r\n    for (; rd[0] === 0; e -= LOG_BASE) rd.shift();\r\n\r\n    // Count the digits of the first word of rd to determine leading zeros.\r\n    for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;\r\n\r\n    // Adjust the exponent for leading zeros of the first word of rd.\r\n    if (k < LOG_BASE) e -= LOG_BASE - k;\r\n  }\r\n\r\n  r.e = e;\r\n  r.d = rd;\r\n\r\n  return r;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.\r\n *\r\n * To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction round(x) {\r\n  return finalise(x = new this(x), x.e + 1, this.rounding);\r\n}\r\n\r\n\r\n/*\r\n * Return\r\n *   1    if x > 0,\r\n *  -1    if x < 0,\r\n *   0    if x is 0,\r\n *  -0    if x is -0,\r\n *   NaN  otherwise\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction sign(x) {\r\n  x = new this(x);\r\n  return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction sin(x) {\r\n  return new this(x).sin();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction sinh(x) {\r\n  return new this(x).sinh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction sqrt(x) {\r\n  return new this(x).sqrt();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction sub(x, y) {\r\n  return new this(x).sub(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the sum of the arguments, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * Only the result is rounded, not the intermediate calculations.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction sum() {\r\n  var i = 0,\r\n    args = arguments,\r\n    x = new this(args[i]);\r\n\r\n  external = false;\r\n  for (; x.s && ++i < args.length;) x = x.plus(args[i]);\r\n  external = true;\r\n\r\n  return finalise(x, this.precision, this.rounding);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction tan(x) {\r\n  return new this(x).tan();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction tanh(x) {\r\n  return new this(x).tanh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` truncated to an integer.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction trunc(x) {\r\n  return finalise(x = new this(x), x.e + 1, 1);\r\n}\r\n\r\n\r\nP[Symbol.for('nodejs.util.inspect.custom')] = P.toString;\r\nP[Symbol.toStringTag] = 'Decimal';\r\n\r\n// Create and configure initial Decimal constructor.\r\nexport var Decimal = P.constructor = clone(DEFAULTS);\r\n\r\n// Create the internal constants from their string values.\r\nLN10 = new Decimal(LN10);\r\nPI = new Decimal(PI);\r\n\r\nexport default Decimal;\r\n","import Decimal from 'decimal.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'BigNumber';\nvar dependencies = ['?on', 'config'];\nexport var createBigNumberClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    on,\n    config\n  } = _ref;\n  var BigNumber = Decimal.clone({\n    precision: config.precision,\n    modulo: Decimal.EUCLID\n  });\n  BigNumber.prototype = Object.create(BigNumber.prototype);\n\n  /**\n   * Attach type information\n   */\n  BigNumber.prototype.type = 'BigNumber';\n  BigNumber.prototype.isBigNumber = true;\n\n  /**\n   * Get a JSON representation of a BigNumber containing\n   * type information\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"BigNumber\", \"value\": \"0.2\"}`\n   */\n  BigNumber.prototype.toJSON = function () {\n    return {\n      mathjs: 'BigNumber',\n      value: this.toString()\n    };\n  };\n\n  /**\n   * Instantiate a BigNumber from a JSON object\n   * @param {Object} json  a JSON object structured as:\n   *                       `{\"mathjs\": \"BigNumber\", \"value\": \"0.2\"}`\n   * @return {BigNumber}\n   */\n  BigNumber.fromJSON = function (json) {\n    return new BigNumber(json.value);\n  };\n  if (on) {\n    // listen for changed in the configuration, automatically apply changed precision\n    on('config', function (curr, prev) {\n      if (curr.precision !== prev.precision) {\n        BigNumber.config({\n          precision: curr.precision\n        });\n      }\n    });\n  }\n  return BigNumber;\n}, {\n  isClass: true\n});","'use strict';\n\n/**\n *\n * This class allows the manipulation of complex numbers.\n * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.\n *\n * Object form\n * { re: <real>, im: <imaginary> }\n * { arg: <angle>, abs: <radius> }\n * { phi: <angle>, r: <radius> }\n *\n * Array / Vector form\n * [ real, imaginary ]\n *\n * Double form\n * 99.3 - Single double value\n *\n * String form\n * '23.1337' - Simple real number\n * '15+3i' - a simple complex number\n * '3-i' - a simple complex number\n *\n * Example:\n *\n * const c = new Complex('99.3+8i');\n * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);\n *\n */\n\n\nconst cosh = Math.cosh || function (x) {\n  return Math.abs(x) < 1e-9 ? 1 - x : (Math.exp(x) + Math.exp(-x)) * 0.5;\n};\n\nconst sinh = Math.sinh || function (x) {\n  return Math.abs(x) < 1e-9 ? x : (Math.exp(x) - Math.exp(-x)) * 0.5;\n};\n\n/**\n * Calculates cos(x) - 1 using Taylor series if x is small (-¼π ≤ x ≤ ¼π).\n *\n * @param {number} x\n * @returns {number} cos(x) - 1\n */\nconst cosm1 = x => {\n  // cos(x) - 1 = − 2sin^2(x / 2)\n  const s = Math.sin(0.5 * x);\n  return -2 * s * s;\n};\n\nconst hypot = function (x, y) {\n\n  x = Math.abs(x);\n  y = Math.abs(y);\n\n  // Ensure `x` is the larger value\n  if (x < y) [x, y] = [y, x];\n\n  // If both are below the threshold, use straightforward Pythagoras\n  if (x < 1e8) return Math.sqrt(x * x + y * y);\n\n  // For larger values, scale to avoid overflow\n  y /= x;\n  return x * Math.sqrt(1 + y * y);\n};\n\nconst parser_exit = function () {\n  throw SyntaxError('Invalid Param');\n};\n\n/**\n * Calculates log(sqrt(a^2+b^2)) in a way to avoid overflows\n *\n * @param {number} a\n * @param {number} b\n * @returns {number}\n */\nfunction logHypot(a, b) {\n\n  const _a = Math.abs(a);\n  const _b = Math.abs(b);\n\n  if (a === 0) {\n    return Math.log(_b);\n  }\n\n  if (b === 0) {\n    return Math.log(_a);\n  }\n\n  if (_a < 3000 && _b < 3000) {\n    return Math.log(a * a + b * b) * 0.5;\n  }\n\n  /* I got 4 ideas to compute this property without overflow:\n   *\n   * Testing 1000000 times with random samples for a,b ∈ [1, 1000000000] against a big decimal library to get an error estimate\n   *\n   * 1. Only eliminate the square root: (OVERALL ERROR: 3.9122483030951116e-11)\n\n   Math.log(a * a + b * b) / 2\n\n   *\n   *\n   * 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)\n\n   const fn = function(a, b) {\n   a = Math.abs(a);\n   b = Math.abs(b);\n   let t = Math.min(a, b);\n   a = Math.max(a, b);\n   t = t / a;\n\n   return Math.log(a) + Math.log(1 + t * t) / 2;\n   };\n\n   * 3. Abuse the identity cos(atan(y/x) = x / sqrt(x^2+y^2): (OVERALL ERROR: 3.4780178737037204e-10)\n\n   Math.log(a / Math.cos(Math.atan2(b, a)))\n\n   * 4. Use 3. and apply log rules: (OVERALL ERROR: 1.2014087502620896e-9)\n\n   Math.log(a) - Math.log(Math.cos(Math.atan2(b, a)))\n\n   */\n\n  a = a * 0.5;\n  b = b * 0.5;\n\n  return 0.5 * Math.log(a * a + b * b) + Math.LN2;\n}\n\nconst P = { 're': 0, 'im': 0 };\nconst parse = function (a, b) {\n\n  const z = P;\n\n  if (a === undefined || a === null) {\n    z['re'] =\n      z['im'] = 0;\n  } else if (b !== undefined) {\n    z['re'] = a;\n    z['im'] = b;\n  } else\n    switch (typeof a) {\n\n      case 'object':\n\n        if ('im' in a && 're' in a) {\n          z['re'] = a['re'];\n          z['im'] = a['im'];\n        } else if ('abs' in a && 'arg' in a) {\n          if (!isFinite(a['abs']) && isFinite(a['arg'])) {\n            return Complex['INFINITY'];\n          }\n          z['re'] = a['abs'] * Math.cos(a['arg']);\n          z['im'] = a['abs'] * Math.sin(a['arg']);\n        } else if ('r' in a && 'phi' in a) {\n          if (!isFinite(a['r']) && isFinite(a['phi'])) {\n            return Complex['INFINITY'];\n          }\n          z['re'] = a['r'] * Math.cos(a['phi']);\n          z['im'] = a['r'] * Math.sin(a['phi']);\n        } else if (a.length === 2) { // Quick array check\n          z['re'] = a[0];\n          z['im'] = a[1];\n        } else {\n          parser_exit();\n        }\n        break;\n\n      case 'string':\n\n        z['im'] = /* void */\n          z['re'] = 0;\n\n        const tokens = a.replace(/_/g, '')\n          .match(/\\d+\\.?\\d*e[+-]?\\d+|\\d+\\.?\\d*|\\.\\d+|./g);\n        let plus = 1;\n        let minus = 0;\n\n        if (tokens === null) {\n          parser_exit();\n        }\n\n        for (let i = 0; i < tokens.length; i++) {\n\n          const c = tokens[i];\n\n          if (c === ' ' || c === '\\t' || c === '\\n') {\n            /* void */\n          } else if (c === '+') {\n            plus++;\n          } else if (c === '-') {\n            minus++;\n          } else if (c === 'i' || c === 'I') {\n\n            if (plus + minus === 0) {\n              parser_exit();\n            }\n\n            if (tokens[i + 1] !== ' ' && !isNaN(tokens[i + 1])) {\n              z['im'] += parseFloat((minus % 2 ? '-' : '') + tokens[i + 1]);\n              i++;\n            } else {\n              z['im'] += parseFloat((minus % 2 ? '-' : '') + '1');\n            }\n            plus = minus = 0;\n\n          } else {\n\n            if (plus + minus === 0 || isNaN(c)) {\n              parser_exit();\n            }\n\n            if (tokens[i + 1] === 'i' || tokens[i + 1] === 'I') {\n              z['im'] += parseFloat((minus % 2 ? '-' : '') + c);\n              i++;\n            } else {\n              z['re'] += parseFloat((minus % 2 ? '-' : '') + c);\n            }\n            plus = minus = 0;\n          }\n        }\n\n        // Still something on the stack\n        if (plus + minus > 0) {\n          parser_exit();\n        }\n        break;\n\n      case 'number':\n        z['im'] = 0;\n        z['re'] = a;\n        break;\n\n      default:\n        parser_exit();\n    }\n\n  if (isNaN(z['re']) || isNaN(z['im'])) {\n    // If a calculation is NaN, we treat it as NaN and don't throw\n    //parser_exit();\n  }\n\n  return z;\n};\n\n/**\n * @constructor\n * @returns {Complex}\n */\nfunction Complex(a, b) {\n\n  if (!(this instanceof Complex)) {\n    return new Complex(a, b);\n  }\n\n  const z = parse(a, b);\n\n  this['re'] = z['re'];\n  this['im'] = z['im'];\n}\n\nComplex.prototype = {\n\n  're': 0,\n  'im': 0,\n\n  /**\n   * Calculates the sign of a complex number, which is a normalized complex\n   *\n   * @returns {Complex}\n   */\n  'sign': function () {\n\n    const abs = hypot(this['re'], this['im']);\n\n    return new Complex(\n      this['re'] / abs,\n      this['im'] / abs);\n  },\n\n  /**\n   * Adds two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'add': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n\n    if (tInfin || zInfin) {\n\n      if (tInfin && zInfin) {\n        // Infinity + Infinity = NaN\n        return Complex['NAN'];\n      }\n      // Infinity + z = Infinity { where z != Infinity }\n      return Complex['INFINITY'];\n    }\n\n    return new Complex(\n      this['re'] + z['re'],\n      this['im'] + z['im']);\n  },\n\n  /**\n   * Subtracts two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'sub': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n\n    if (tInfin || zInfin) {\n\n      if (tInfin && zInfin) {\n        // Infinity - Infinity = NaN\n        return Complex['NAN'];\n      }\n      // Infinity - z = Infinity { where z != Infinity }\n      return Complex['INFINITY'];\n    }\n\n    return new Complex(\n      this['re'] - z['re'],\n      this['im'] - z['im']);\n  },\n\n  /**\n   * Multiplies two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'mul': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n    const tIsZero = this['re'] === 0 && this['im'] === 0;\n    const zIsZero = z['re'] === 0 && z['im'] === 0;\n\n    // Infinity * 0 = NaN\n    if (tInfin && zIsZero || zInfin && tIsZero) {\n      return Complex['NAN'];\n    }\n\n    // Infinity * z = Infinity { where z != 0 }\n    if (tInfin || zInfin) {\n      return Complex['INFINITY'];\n    }\n\n    // Shortcut for real values\n    if (z['im'] === 0 && this['im'] === 0) {\n      return new Complex(this['re'] * z['re'], 0);\n    }\n\n    return new Complex(\n      this['re'] * z['re'] - this['im'] * z['im'],\n      this['re'] * z['im'] + this['im'] * z['re']);\n  },\n\n  /**\n   * Divides two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'div': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n    const tIsZero = this['re'] === 0 && this['im'] === 0;\n    const zIsZero = z['re'] === 0 && z['im'] === 0;\n\n    // 0 / 0 = NaN and Infinity / Infinity = NaN\n    if (tIsZero && zIsZero || tInfin && zInfin) {\n      return Complex['NAN'];\n    }\n\n    // Infinity / 0 = Infinity\n    if (zIsZero || tInfin) {\n      return Complex['INFINITY'];\n    }\n\n    // 0 / Infinity = 0\n    if (tIsZero || zInfin) {\n      return Complex['ZERO'];\n    }\n\n    if (0 === z['im']) {\n      // Divisor is real\n      return new Complex(this['re'] / z['re'], this['im'] / z['re']);\n    }\n\n    if (Math.abs(z['re']) < Math.abs(z['im'])) {\n\n      const x = z['re'] / z['im'];\n      const t = z['re'] * x + z['im'];\n\n      return new Complex(\n        (this['re'] * x + this['im']) / t,\n        (this['im'] * x - this['re']) / t);\n\n    } else {\n\n      const x = z['im'] / z['re'];\n      const t = z['im'] * x + z['re'];\n\n      return new Complex(\n        (this['re'] + this['im'] * x) / t,\n        (this['im'] - this['re'] * x) / t);\n    }\n  },\n\n  /**\n   * Calculate the power of two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'pow': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tIsZero = this['re'] === 0 && this['im'] === 0;\n    const zIsZero = z['re'] === 0 && z['im'] === 0;\n\n    if (zIsZero) {\n      return Complex['ONE'];\n    }\n\n    // If the exponent is real\n    if (z['im'] === 0) {\n\n      if (this['im'] === 0 && this['re'] > 0) {\n\n        return new Complex(Math.pow(this['re'], z['re']), 0);\n\n      } else if (this['re'] === 0) { // If base is fully imaginary\n\n        switch ((z['re'] % 4 + 4) % 4) {\n          case 0:\n            return new Complex(Math.pow(this['im'], z['re']), 0);\n          case 1:\n            return new Complex(0, Math.pow(this['im'], z['re']));\n          case 2:\n            return new Complex(-Math.pow(this['im'], z['re']), 0);\n          case 3:\n            return new Complex(0, -Math.pow(this['im'], z['re']));\n        }\n      }\n    }\n\n    /* I couldn't find a good formula, so here is a derivation and optimization\n     *\n     * z_1^z_2 = (a + bi)^(c + di)\n     *         = exp((c + di) * log(a + bi)\n     *         = pow(a^2 + b^2, (c + di) / 2) * exp(i(c + di)atan2(b, a))\n     * =>...\n     * Re = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * cos(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n     * Im = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * sin(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n     *\n     * =>...\n     * Re = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * cos(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n     * Im = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * sin(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n     *\n     * =>\n     * Re = exp(c * logsq2 - d * arg(z_1)) * cos(d * logsq2 + c * arg(z_1))\n     * Im = exp(c * logsq2 - d * arg(z_1)) * sin(d * logsq2 + c * arg(z_1))\n     *\n     */\n\n    if (tIsZero && z['re'] > 0) { // Same behavior as Wolframalpha, Zero if real part is zero\n      return Complex['ZERO'];\n    }\n\n    const arg = Math.atan2(this['im'], this['re']);\n    const loh = logHypot(this['re'], this['im']);\n\n    let re = Math.exp(z['re'] * loh - z['im'] * arg);\n    let im = z['im'] * loh + z['re'] * arg;\n    return new Complex(\n      re * Math.cos(im),\n      re * Math.sin(im));\n  },\n\n  /**\n   * Calculate the complex square root\n   *\n   * @returns {Complex}\n   */\n  'sqrt': function () {\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n      // Real number case\n      if (a >= 0) {\n        return new Complex(Math.sqrt(a), 0);\n      } else {\n        return new Complex(0, Math.sqrt(-a));\n      }\n    }\n\n    const r = hypot(a, b);\n\n    let re = Math.sqrt(0.5 * (r + Math.abs(a))); // sqrt(2x) / 2 = sqrt(x / 2)\n    let im = Math.abs(b) / (2 * re);\n\n    if (a >= 0) {\n      return new Complex(re, b < 0 ? -im : im);\n    } else {\n      return new Complex(im, b < 0 ? -re : re);\n    }\n  },\n\n  /**\n   * Calculate the complex exponent\n   *\n   * @returns {Complex}\n   */\n  'exp': function () {\n\n    const er = Math.exp(this['re']);\n\n    if (this['im'] === 0) {\n      return new Complex(er, 0);\n    }\n    return new Complex(\n      er * Math.cos(this['im']),\n      er * Math.sin(this['im']));\n  },\n\n  /**\n   * Calculate the complex exponent and subtracts one.\n   *\n   * This may be more accurate than `Complex(x).exp().sub(1)` if\n   * `x` is small.\n   *\n   * @returns {Complex}\n   */\n  'expm1': function () {\n\n    /**\n     * exp(a + i*b) - 1\n     = exp(a) * (cos(b) + j*sin(b)) - 1\n     = expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)\n     */\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      Math.expm1(a) * Math.cos(b) + cosm1(b),\n      Math.exp(a) * Math.sin(b));\n  },\n\n  /**\n   * Calculate the natural log\n   *\n   * @returns {Complex}\n   */\n  'log': function () {\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0 && a > 0) {\n      return new Complex(Math.log(a), 0);\n    }\n\n    return new Complex(\n      logHypot(a, b),\n      Math.atan2(b, a));\n  },\n\n  /**\n   * Calculate the magnitude of the complex number\n   *\n   * @returns {number}\n   */\n  'abs': function () {\n\n    return hypot(this['re'], this['im']);\n  },\n\n  /**\n   * Calculate the angle of the complex number\n   *\n   * @returns {number}\n   */\n  'arg': function () {\n\n    return Math.atan2(this['im'], this['re']);\n  },\n\n  /**\n   * Calculate the sine of the complex number\n   *\n   * @returns {Complex}\n   */\n  'sin': function () {\n\n    // sin(z) = ( e^iz - e^-iz ) / 2i \n    //        = sin(a)cosh(b) + i cos(a)sinh(b)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      Math.sin(a) * cosh(b),\n      Math.cos(a) * sinh(b));\n  },\n\n  /**\n   * Calculate the cosine\n   *\n   * @returns {Complex}\n   */\n  'cos': function () {\n\n    // cos(z) = ( e^iz + e^-iz ) / 2 \n    //        = cos(a)cosh(b) - i sin(a)sinh(b)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      Math.cos(a) * cosh(b),\n      -Math.sin(a) * sinh(b));\n  },\n\n  /**\n   * Calculate the tangent\n   *\n   * @returns {Complex}\n   */\n  'tan': function () {\n\n    // tan(z) = sin(z) / cos(z) \n    //        = ( e^iz - e^-iz ) / ( i( e^iz + e^-iz ) )\n    //        = ( e^2iz - 1 ) / i( e^2iz + 1 )\n    //        = ( sin(2a) + i sinh(2b) ) / ( cos(2a) + cosh(2b) )\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = Math.cos(a) + cosh(b);\n\n    return new Complex(\n      Math.sin(a) / d,\n      sinh(b) / d);\n  },\n\n  /**\n   * Calculate the cotangent\n   *\n   * @returns {Complex}\n   */\n  'cot': function () {\n\n    // cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = Math.cos(a) - cosh(b);\n\n    return new Complex(\n      -Math.sin(a) / d,\n      sinh(b) / d);\n  },\n\n  /**\n   * Calculate the secant\n   *\n   * @returns {Complex}\n   */\n  'sec': function () {\n\n    // sec(c) = 2 / (e^(ci) + e^(-ci))\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = 0.5 * cosh(2 * b) + 0.5 * Math.cos(2 * a);\n\n    return new Complex(\n      Math.cos(a) * cosh(b) / d,\n      Math.sin(a) * sinh(b) / d);\n  },\n\n  /**\n   * Calculate the cosecans\n   *\n   * @returns {Complex}\n   */\n  'csc': function () {\n\n    // csc(c) = 2i / (e^(ci) - e^(-ci))\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = 0.5 * cosh(2 * b) - 0.5 * Math.cos(2 * a);\n\n    return new Complex(\n      Math.sin(a) * cosh(b) / d,\n      -Math.cos(a) * sinh(b) / d);\n  },\n\n  /**\n   * Calculate the complex arcus sinus\n   *\n   * @returns {Complex}\n   */\n  'asin': function () {\n\n    // asin(c) = -i * log(ci + sqrt(1 - c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const t1 = new Complex(\n      b * b - a * a + 1,\n      -2 * a * b)['sqrt']();\n\n    const t2 = new Complex(\n      t1['re'] - b,\n      t1['im'] + a)['log']();\n\n    return new Complex(t2['im'], -t2['re']);\n  },\n\n  /**\n   * Calculate the complex arcus cosinus\n   *\n   * @returns {Complex}\n   */\n  'acos': function () {\n\n    // acos(c) = i * log(c - i * sqrt(1 - c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const t1 = new Complex(\n      b * b - a * a + 1,\n      -2 * a * b)['sqrt']();\n\n    const t2 = new Complex(\n      t1['re'] - b,\n      t1['im'] + a)['log']();\n\n    return new Complex(Math.PI / 2 - t2['im'], t2['re']);\n  },\n\n  /**\n   * Calculate the complex arcus tangent\n   *\n   * @returns {Complex}\n   */\n  'atan': function () {\n\n    // atan(c) = i / 2 log((i + x) / (i - x))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0) {\n\n      if (b === 1) {\n        return new Complex(0, Infinity);\n      }\n\n      if (b === -1) {\n        return new Complex(0, -Infinity);\n      }\n    }\n\n    const d = a * a + (1.0 - b) * (1.0 - b);\n\n    const t1 = new Complex(\n      (1 - b * b - a * a) / d,\n      -2 * a / d).log();\n\n    return new Complex(-0.5 * t1['im'], 0.5 * t1['re']);\n  },\n\n  /**\n   * Calculate the complex arcus cotangent\n   *\n   * @returns {Complex}\n   */\n  'acot': function () {\n\n    // acot(c) = i / 2 log((c - i) / (c + i))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n      return new Complex(Math.atan2(1, a), 0);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).atan()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).atan();\n  },\n\n  /**\n   * Calculate the complex arcus secant\n   *\n   * @returns {Complex}\n   */\n  'asec': function () {\n\n    // asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0 && b === 0) {\n      return new Complex(0, Infinity);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).acos()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).acos();\n  },\n\n  /**\n   * Calculate the complex arcus cosecans\n   *\n   * @returns {Complex}\n   */\n  'acsc': function () {\n\n    // acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0 && b === 0) {\n      return new Complex(Math.PI / 2, Infinity);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).asin()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).asin();\n  },\n\n  /**\n   * Calculate the complex sinh\n   *\n   * @returns {Complex}\n   */\n  'sinh': function () {\n\n    // sinh(c) = (e^c - e^-c) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      sinh(a) * Math.cos(b),\n      cosh(a) * Math.sin(b));\n  },\n\n  /**\n   * Calculate the complex cosh\n   *\n   * @returns {Complex}\n   */\n  'cosh': function () {\n\n    // cosh(c) = (e^c + e^-c) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      cosh(a) * Math.cos(b),\n      sinh(a) * Math.sin(b));\n  },\n\n  /**\n   * Calculate the complex tanh\n   *\n   * @returns {Complex}\n   */\n  'tanh': function () {\n\n    // tanh(c) = (e^c - e^-c) / (e^c + e^-c)\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = cosh(a) + Math.cos(b);\n\n    return new Complex(\n      sinh(a) / d,\n      Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex coth\n   *\n   * @returns {Complex}\n   */\n  'coth': function () {\n\n    // coth(c) = (e^c + e^-c) / (e^c - e^-c)\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = cosh(a) - Math.cos(b);\n\n    return new Complex(\n      sinh(a) / d,\n      -Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex csch\n   *\n   * @returns {Complex}\n   */\n  'csch': function () {\n\n    // csch(c) = 2 / (e^c - e^-c)\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = Math.cos(2 * b) - cosh(2 * a);\n\n    return new Complex(\n      -2 * sinh(a) * Math.cos(b) / d,\n      2 * cosh(a) * Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex sech\n   *\n   * @returns {Complex}\n   */\n  'sech': function () {\n\n    // sech(c) = 2 / (e^c + e^-c)\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = Math.cos(2 * b) + cosh(2 * a);\n\n    return new Complex(\n      2 * cosh(a) * Math.cos(b) / d,\n      -2 * sinh(a) * Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex asinh\n   *\n   * @returns {Complex}\n   */\n  'asinh': function () {\n\n    // asinh(z) = log(z + sqrt(z^2 + 1))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      if (a === 0) {\n        return new Complex(0, 0);\n      }\n\n      // Use |a| to keep asinh(-a) = -asinh(a) and avoid cancellation for large -a\n      const x = Math.abs(a);\n      const r = Math.log(x + Math.sqrt(x * x + 1));\n\n      return new Complex(a < 0 ? -r : r, 0);\n    }\n\n    // z^2 + 1 = (a^2 - b^2 + 1) + i (2ab)\n    const re2 = a * a - b * b + 1;\n    const im2 = 2 * a * b;\n\n    const t = new Complex(re2, im2)['sqrt'](); // sqrt(z^2 + 1)\n\n    return new Complex(a + t['re'], b + t['im'])['log']();\n  },\n\n  /**\n   * Calculate the complex acosh\n   *\n   * @returns {Complex}\n   */\n  'acosh': function () {\n\n    // acosh(z)= log(z + sqrt(z^2 - 1)) = log(z + sqrt(z - 1) * sqrt(z + 1))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      // z = a is real\n      if (a > 1) {\n        // acosh(a) = log(a + sqrt(a - 1) * sqrt(a + 1)),  a > 1\n        return new Complex(\n          Math.log(a + Math.sqrt(a - 1) * Math.sqrt(a + 1)), 0);\n      }\n\n      if (a < -1) {\n        // acosh(a) = log(-a + sqrt(a^2 - 1)) + i*pi,  a < -1\n        const t = Math.sqrt(a * a - 1);\n        return new Complex(Math.log(-a + t), Math.PI);\n      }\n\n      // -1 <= a <= 1 : purely imaginary\n      // acosh(a) = i * acos(a)\n      return new Complex(0, Math.acos(a));\n    }\n\n    const t1 = new Complex(a - 1, b)['sqrt'](); // sqrt(z - 1)\n    const t2 = new Complex(a + 1, b)['sqrt'](); // sqrt(z + 1)\n\n    return new Complex(\n      a + t1['re'] * t2['re'] - t1['im'] * t2['im'],\n      b + t1['re'] * t2['im'] + t1['im'] * t2['re']\n    )['log']();\n  },\n\n  /**\n   * Calculate the complex atanh\n   *\n   * @returns {Complex}\n   */\n  'atanh': function () {\n\n    // atanh(z) = log((1 + z) / (1 - z)) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      if (a === 0) {\n        return new Complex(0, 0);\n      }\n\n      if (a === 1) {\n        // limit x -> 1^- atanh(x) = +Infinity\n        return new Complex(Infinity, 0);\n      }\n\n      if (a === -1) {\n        // limit x -> -1^+ atanh(x) = -Infinity\n        return new Complex(-Infinity, 0);\n      }\n\n      if (-1 < a && a < 1) {\n        // Purely real\n        return new Complex(\n          0.5 * Math.log((1 + a) / (1 - a)),\n          0\n        );\n      }\n\n      if (a > 1) {\n        // Our branch: Im(atanh(a)) = -π/2 for a > 1\n        const t = (a + 1) / (a - 1); // > 0\n        return new Complex(\n          0.5 * Math.log(t),\n          -Math.PI / 2\n        );\n      }\n\n      // a < -1: Im(atanh(a)) = +π/2\n      const t = (1 + a) / (1 - a); // < 0\n      return new Complex(\n        0.5 * Math.log(-t), // log((1 - a)/(1 + a))\n        Math.PI / 2\n      );\n    }\n\n    // Use atanh(z) = 0.5 * Log((1+z)/(1-z)) with principal Log.\n    const oneMinus = 1 - a;\n    const onePlus = 1 + a;\n    const d = oneMinus * oneMinus + b * b; // |1 - z|^2\n\n    if (d === 0) {\n      // (1 - z) == 0 for finite z only at z = 1+0i, already handled above.\n      // If we ever get here, just propagate infinities consistently:\n      return new Complex(\n        (a !== -1) ? (a / 0) : 0,\n        (b !== 0) ? (b / 0) : 0\n      );\n    }\n\n    // (1 + z) / (1 - z) with a single complex division\n    const xr = (onePlus * oneMinus - b * b) / d;\n    const xi = (b * oneMinus + onePlus * b) / d;\n\n    // 0.5 * log(xr + i xi)\n    return new Complex(\n      logHypot(xr, xi) / 2,\n      Math.atan2(xi, xr) / 2\n    );\n  },\n\n  /**\n   * Calculate the complex acoth\n   *\n   * @returns {Complex}\n   */\n  'acoth': function () {\n\n    // acoth(z) = log((z + 1) / (z - 1)) / 2 = atanh(1 / z)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    // z = 0 -> acoth(0) = i * π / 2  (log((1+0)/(1-0))/2 = log(-1)/2)\n    if (a === 0 && b === 0) {\n      return new Complex(0, Math.PI / 2);\n    }\n\n    const d = a * a + b * b;\n\n    if (d !== 0) {\n      // 1 / z = (a - i b) / (a^2 + b^2)\n      return new Complex(a / d, -b / d)['atanh']();\n    }\n\n    // Fallback for weird infinities/NaNs: mirror other functions' style\n    return new Complex(\n      (a !== 0) ? a / 0 : 0,\n      (b !== 0) ? -b / 0 : 0\n    )['atanh']();\n  },\n\n  /**\n   * Calculate the complex acsch\n   *\n   * @returns {Complex}\n   */\n  'acsch': function () {\n\n    // acsch(c) = log((1+sqrt(1+c^2))/c) = = asinh(1 / z)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      // z = a real\n      if (a === 0) {\n        // acsch(0) -> +/- Infinity, we keep your previous behavior\n        return new Complex(Infinity, 0);\n      }\n\n      // acsch(a) = asinh(1/a) = log(1/a + sqrt(1/a^2 + 1))\n      const inv = 1 / a;\n      return new Complex(\n        Math.log(inv + Math.sqrt(inv * inv + 1)),\n        0\n      );\n    }\n\n    const d = a * a + b * b;\n\n    if (d !== 0) {\n      // 1/z = (a - i b) / (a^2 + b^2)\n      return new Complex(a / d, -b / d)['asinh']();\n    }\n\n    // Handle 0 + 0i or infinities in the same spirit as your existing code\n    return new Complex(\n      (a !== 0) ? a / 0 : 0,\n      (b !== 0) ? -b / 0 : 0)['asinh']();\n  },\n\n  /**\n   * Calculate the complex asech\n   *\n   * @returns {Complex}\n   */\n  'asech': function () {\n\n    // asech(z) = acosh(1 / z)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (this['isZero']()) {\n      // asech(0) = acosh(∞) -> ∞\n      return Complex['INFINITY'];\n    }\n\n    const d = a * a + b * b;\n\n    if (d !== 0) {\n      // 1 / z = (a - i b) / (a^2 + b^2)\n      return new Complex(a / d, -b / d)['acosh']();\n    }\n\n    // Fallback for weird infinities/NaNs\n    return new Complex(\n      (a !== 0) ? a / 0 : 0,\n      (b !== 0) ? -b / 0 : 0)['acosh']();\n  },\n\n  /**\n   * Calculate the complex inverse 1/z\n   *\n   * @returns {Complex}\n   */\n  'inverse': function () {\n\n    // 1 / 0 = Infinity and 1 / Infinity = 0\n    if (this['isZero']()) {\n      return Complex['INFINITY'];\n    }\n\n    if (this['isInfinite']()) {\n      return Complex['ZERO'];\n    }\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const d = a * a + b * b;\n\n    return new Complex(a / d, -b / d);\n  },\n\n  /**\n   * Returns the complex conjugate\n   *\n   * @returns {Complex}\n   */\n  'conjugate': function () {\n\n    return new Complex(this['re'], -this['im']);\n  },\n\n  /**\n   * Gets the negated complex number\n   *\n   * @returns {Complex}\n   */\n  'neg': function () {\n\n    return new Complex(-this['re'], -this['im']);\n  },\n\n  /**\n   * Ceils the actual complex number\n   *\n   * @returns {Complex}\n   */\n  'ceil': function (places) {\n\n    places = Math.pow(10, places || 0);\n\n    return new Complex(\n      Math.ceil(this['re'] * places) / places,\n      Math.ceil(this['im'] * places) / places);\n  },\n\n  /**\n   * Floors the actual complex number\n   *\n   * @returns {Complex}\n   */\n  'floor': function (places) {\n\n    places = Math.pow(10, places || 0);\n\n    return new Complex(\n      Math.floor(this['re'] * places) / places,\n      Math.floor(this['im'] * places) / places);\n  },\n\n  /**\n   * Ceils the actual complex number\n   *\n   * @returns {Complex}\n   */\n  'round': function (places) {\n\n    places = Math.pow(10, places || 0);\n\n    return new Complex(\n      Math.round(this['re'] * places) / places,\n      Math.round(this['im'] * places) / places);\n  },\n\n  /**\n   * Compares two complex numbers\n   *\n   * **Note:** new Complex(Infinity).equals(Infinity) === false\n   *\n   * @returns {boolean}\n   */\n  'equals': function (a, b) {\n\n    const z = parse(a, b);\n\n    return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&\n      Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];\n  },\n\n  /**\n   * Clones the actual object\n   *\n   * @returns {Complex}\n   */\n  'clone': function () {\n\n    return new Complex(this['re'], this['im']);\n  },\n\n  /**\n   * Gets a string of the actual complex number\n   *\n   * @returns {string}\n   */\n  'toString': function () {\n\n    let a = this['re'];\n    let b = this['im'];\n    let ret = \"\";\n\n    if (this['isNaN']()) {\n      return 'NaN';\n    }\n\n    if (this['isInfinite']()) {\n      return 'Infinity';\n    }\n\n    if (Math.abs(a) < Complex['EPSILON']) {\n      a = 0;\n    }\n\n    if (Math.abs(b) < Complex['EPSILON']) {\n      b = 0;\n    }\n\n    // If is real number\n    if (b === 0) {\n      return ret + a;\n    }\n\n    if (a !== 0) {\n      ret += a;\n      ret += \" \";\n      if (b < 0) {\n        b = -b;\n        ret += \"-\";\n      } else {\n        ret += \"+\";\n      }\n      ret += \" \";\n    } else if (b < 0) {\n      b = -b;\n      ret += \"-\";\n    }\n\n    if (1 !== b) { // b is the absolute imaginary part\n      ret += b;\n    }\n    return ret + \"i\";\n  },\n\n  /**\n   * Returns the actual number as a vector\n   *\n   * @returns {Array}\n   */\n  'toVector': function () {\n\n    return [this['re'], this['im']];\n  },\n\n  /**\n   * Returns the actual real value of the current object\n   *\n   * @returns {number|null}\n   */\n  'valueOf': function () {\n\n    if (this['im'] === 0) {\n      return this['re'];\n    }\n    return null;\n  },\n\n  /**\n   * Determines whether a complex number is not on the Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isNaN': function () {\n    return isNaN(this['re']) || isNaN(this['im']);\n  },\n\n  /**\n   * Determines whether or not a complex number is at the zero pole of the\n   * Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isZero': function () {\n    return this['im'] === 0 && this['re'] === 0;\n  },\n\n  /**\n   * Determines whether a complex number is not at the infinity pole of the\n   * Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isFinite': function () {\n    return isFinite(this['re']) && isFinite(this['im']);\n  },\n\n  /**\n   * Determines whether or not a complex number is at the infinity pole of the\n   * Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isInfinite': function () {\n    return !this['isFinite']();\n  }\n};\n\nComplex['ZERO'] = new Complex(0, 0);\nComplex['ONE'] = new Complex(1, 0);\nComplex['I'] = new Complex(0, 1);\nComplex['PI'] = new Complex(Math.PI, 0);\nComplex['E'] = new Complex(Math.E, 0);\nComplex['INFINITY'] = new Complex(Infinity, Infinity);\nComplex['NAN'] = new Complex(NaN, NaN);\nComplex['EPSILON'] = 1e-15;\nexport {\n  Complex as default, Complex\n};\n","import Complex from 'complex.js';\nimport { format } from '../../utils/number.js';\nimport { isNumber, isUnit } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Complex';\nvar dependencies = [];\nexport var createComplexClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(Complex, 'name', {\n    value: 'Complex'\n  });\n  Complex.prototype.constructor = Complex;\n  Complex.prototype.type = 'Complex';\n  Complex.prototype.isComplex = true;\n\n  /**\n   * Get a JSON representation of the complex number\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Complex\", \"re\": 2, \"im\": 3}`\n   */\n  Complex.prototype.toJSON = function () {\n    return {\n      mathjs: 'Complex',\n      re: this.re,\n      im: this.im\n    };\n  };\n\n  /*\n   * Return the value of the complex number in polar notation\n   * The angle phi will be set in the interval of [-pi, pi].\n   * @return {{r: number, phi: number}} Returns and object with properties r and phi.\n   */\n  Complex.prototype.toPolar = function () {\n    return {\n      r: this.abs(),\n      phi: this.arg()\n    };\n  };\n\n  /**\n   * Get a string representation of the complex number,\n   * with optional formatting options.\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @return {string} str\n   */\n  Complex.prototype.format = function (options) {\n    var str = '';\n    var im = this.im;\n    var re = this.re;\n    var strRe = format(this.re, options);\n    var strIm = format(this.im, options);\n\n    // round either re or im when smaller than the configured precision\n    var precision = isNumber(options) ? options : options ? options.precision : null;\n    if (precision !== null) {\n      var epsilon = Math.pow(10, -precision);\n      if (Math.abs(re / im) < epsilon) {\n        re = 0;\n      }\n      if (Math.abs(im / re) < epsilon) {\n        im = 0;\n      }\n    }\n    if (im === 0) {\n      // real value\n      str = strRe;\n    } else if (re === 0) {\n      // purely complex value\n      if (im === 1) {\n        str = 'i';\n      } else if (im === -1) {\n        str = '-i';\n      } else {\n        str = strIm + 'i';\n      }\n    } else {\n      // complex value\n      if (im < 0) {\n        if (im === -1) {\n          str = strRe + ' - i';\n        } else {\n          str = strRe + ' - ' + strIm.substring(1) + 'i';\n        }\n      } else {\n        if (im === 1) {\n          str = strRe + ' + i';\n        } else {\n          str = strRe + ' + ' + strIm + 'i';\n        }\n      }\n    }\n    return str;\n  };\n\n  /**\n   * Create a complex number from polar coordinates\n   *\n   * Usage:\n   *\n   *     Complex.fromPolar(r: number, phi: number) : Complex\n   *     Complex.fromPolar({r: number, phi: number}) : Complex\n   *\n   * @param {*} args...\n   * @return {Complex}\n   */\n  Complex.fromPolar = function (args) {\n    switch (arguments.length) {\n      case 1:\n        {\n          var arg = arguments[0];\n          if (typeof arg === 'object') {\n            return Complex(arg);\n          } else {\n            throw new TypeError('Input has to be an object with r and phi keys.');\n          }\n        }\n      case 2:\n        {\n          var r = arguments[0];\n          var phi = arguments[1];\n          if (isNumber(r)) {\n            if (isUnit(phi) && phi.hasBase('ANGLE')) {\n              // convert unit to a number in radians\n              phi = phi.toNumber('rad');\n            }\n            if (isNumber(phi)) {\n              return new Complex({\n                r,\n                phi\n              });\n            }\n            throw new TypeError('Phi is not a number nor an angle unit.');\n          } else {\n            throw new TypeError('Radius r is not a number.');\n          }\n        }\n      default:\n        throw new SyntaxError('Wrong number of arguments in function fromPolar');\n    }\n  };\n  Complex.prototype.valueOf = Complex.prototype.toString;\n\n  /**\n   * Create a Complex number from a JSON object\n   * @param {Object} json  A JSON Object structured as\n   *                       {\"mathjs\": \"Complex\", \"re\": 2, \"im\": 3}\n   *                       All properties are optional, default values\n   *                       for `re` and `im` are 0.\n   * @return {Complex} Returns a new Complex number\n   */\n  Complex.fromJSON = function (json) {\n    return new Complex(json);\n  };\n\n  /**\n   * Compare two complex numbers, `a` and `b`:\n   *\n   * - Returns 1 when the real part of `a` is larger than the real part of `b`\n   * - Returns -1 when the real part of `a` is smaller than the real part of `b`\n   * - Returns 1 when the real parts are equal\n   *   and the imaginary part of `a` is larger than the imaginary part of `b`\n   * - Returns -1 when the real parts are equal\n   *   and the imaginary part of `a` is smaller than the imaginary part of `b`\n   * - Returns 0 when both real and imaginary parts are equal.\n   *\n   * @params {Complex} a\n   * @params {Complex} b\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n  Complex.compare = function (a, b) {\n    if (a.re > b.re) {\n      return 1;\n    }\n    if (a.re < b.re) {\n      return -1;\n    }\n    if (a.im > b.im) {\n      return 1;\n    }\n    if (a.im < b.im) {\n      return -1;\n    }\n    return 0;\n  };\n  return Complex;\n}, {\n  isClass: true\n});","'use strict';\n\n/**\n *\n * This class offers the possibility to calculate fractions.\n * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.\n *\n * Array/Object form\n * [ 0 => <numerator>, 1 => <denominator> ]\n * { n => <numerator>, d => <denominator> }\n *\n * Integer form\n * - Single integer value as BigInt or Number\n *\n * Double form\n * - Single double value as Number\n *\n * String form\n * 123.456 - a simple double\n * 123/456 - a string fraction\n * 123.'456' - a double with repeating decimal places\n * 123.(456) - synonym\n * 123.45'6' - a double with repeating last place\n * 123.45(6) - synonym\n *\n * Example:\n * let f = new Fraction(\"9.4'31'\");\n * f.mul([-4, 3]).div(4.9);\n *\n */\n\n// Set Identity function to downgrade BigInt to Number if needed\nif (typeof BigInt === 'undefined') BigInt = function (n) { if (isNaN(n)) throw new Error(\"\"); return n; };\n\nconst C_ZERO = BigInt(0);\nconst C_ONE = BigInt(1);\nconst C_TWO = BigInt(2);\nconst C_THREE = BigInt(3);\nconst C_FIVE = BigInt(5);\nconst C_TEN = BigInt(10);\nconst MAX_INTEGER = BigInt(Number.MAX_SAFE_INTEGER);\n\n// Maximum search depth for cyclic rational numbers. 2000 should be more than enough.\n// Example: 1/7 = 0.(142857) has 6 repeating decimal places.\n// If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits\nconst MAX_CYCLE_LEN = 2000;\n\n// Parsed data to avoid calling \"new\" all the time\nconst P = {\n  \"s\": C_ONE,\n  \"n\": C_ZERO,\n  \"d\": C_ONE\n};\n\nfunction assign(n, s) {\n\n  try {\n    n = BigInt(n);\n  } catch (e) {\n    throw InvalidParameter();\n  }\n  return n * s;\n}\n\nfunction ifloor(x) {\n  return typeof x === 'bigint' ? x : Math.floor(x);\n}\n\n// Creates a new Fraction internally without the need of the bulky constructor\nfunction newFraction(n, d) {\n\n  if (d === C_ZERO) {\n    throw DivisionByZero();\n  }\n\n  const f = Object.create(Fraction.prototype);\n  f[\"s\"] = n < C_ZERO ? -C_ONE : C_ONE;\n\n  n = n < C_ZERO ? -n : n;\n\n  const a = gcd(n, d);\n\n  f[\"n\"] = n / a;\n  f[\"d\"] = d / a;\n  return f;\n}\n\nconst FACTORSTEPS = [C_TWO * C_TWO, C_TWO, C_TWO * C_TWO, C_TWO, C_TWO * C_TWO, C_TWO * C_THREE, C_TWO, C_TWO * C_THREE]; // repeats\nfunction factorize(n) {\n\n  const factors = Object.create(null);\n  if (n <= C_ONE) {\n    factors[n] = C_ONE;\n    return factors;\n  }\n\n  const add = (p) => { factors[p] = (factors[p] || C_ZERO) + C_ONE; };\n\n  while (n % C_TWO === C_ZERO) { add(C_TWO); n /= C_TWO; }\n  while (n % C_THREE === C_ZERO) { add(C_THREE); n /= C_THREE; }\n  while (n % C_FIVE === C_ZERO) { add(C_FIVE); n /= C_FIVE; }\n\n  // 30-wheel trial division: test only residues coprime to 2*3*5\n  // Residue step pattern after 5: 7,11,13,17,19,23,29,31, ...\n  for (let si = 0, p = C_TWO + C_FIVE; p * p <= n;) {\n    while (n % p === C_ZERO) { add(p); n /= p; }\n    p += FACTORSTEPS[si];\n    si = (si + 1) & 7; // fast modulo 8\n  }\n  if (n > C_ONE) add(n);\n  return factors;\n}\n\nconst parse = function (p1, p2) {\n\n  let n = C_ZERO, d = C_ONE, s = C_ONE;\n\n  if (p1 === undefined || p1 === null) { // No argument\n    /* void */\n  } else if (p2 !== undefined) { // Two arguments\n\n    if (typeof p1 === \"bigint\") {\n      n = p1;\n    } else if (isNaN(p1)) {\n      throw InvalidParameter();\n    } else if (p1 % 1 !== 0) {\n      throw NonIntegerParameter();\n    } else {\n      n = BigInt(p1);\n    }\n\n    if (typeof p2 === \"bigint\") {\n      d = p2;\n    } else if (isNaN(p2)) {\n      throw InvalidParameter();\n    } else if (p2 % 1 !== 0) {\n      throw NonIntegerParameter();\n    } else {\n      d = BigInt(p2);\n    }\n\n    s = n * d;\n\n  } else if (typeof p1 === \"object\") {\n    if (\"d\" in p1 && \"n\" in p1) {\n      n = BigInt(p1[\"n\"]);\n      d = BigInt(p1[\"d\"]);\n      if (\"s\" in p1)\n        n *= BigInt(p1[\"s\"]);\n    } else if (0 in p1) {\n      n = BigInt(p1[0]);\n      if (1 in p1)\n        d = BigInt(p1[1]);\n    } else if (typeof p1 === \"bigint\") {\n      n = p1;\n    } else {\n      throw InvalidParameter();\n    }\n    s = n * d;\n  } else if (typeof p1 === \"number\") {\n\n    if (isNaN(p1)) {\n      throw InvalidParameter();\n    }\n\n    if (p1 < 0) {\n      s = -C_ONE;\n      p1 = -p1;\n    }\n\n    if (p1 % 1 === 0) {\n      n = BigInt(p1);\n    } else {\n\n      let z = 1;\n\n      let A = 0, B = 1;\n      let C = 1, D = 1;\n\n      let N = 10000000;\n\n      if (p1 >= 1) {\n        z = 10 ** Math.floor(1 + Math.log10(p1));\n        p1 /= z;\n      }\n\n      // Using Farey Sequences\n\n      while (B <= N && D <= N) {\n        let M = (A + C) / (B + D);\n\n        if (p1 === M) {\n          if (B + D <= N) {\n            n = A + C;\n            d = B + D;\n          } else if (D > B) {\n            n = C;\n            d = D;\n          } else {\n            n = A;\n            d = B;\n          }\n          break;\n\n        } else {\n\n          if (p1 > M) {\n            A += C;\n            B += D;\n          } else {\n            C += A;\n            D += B;\n          }\n\n          if (B > N) {\n            n = C;\n            d = D;\n          } else {\n            n = A;\n            d = B;\n          }\n        }\n      }\n      n = BigInt(n) * BigInt(z);\n      d = BigInt(d);\n    }\n\n  } else if (typeof p1 === \"string\") {\n\n    let ndx = 0;\n\n    let v = C_ZERO, w = C_ZERO, x = C_ZERO, y = C_ONE, z = C_ONE;\n\n    let match = p1.replace(/_/g, '').match(/\\d+|./g);\n\n    if (match === null)\n      throw InvalidParameter();\n\n    if (match[ndx] === '-') {// Check for minus sign at the beginning\n      s = -C_ONE;\n      ndx++;\n    } else if (match[ndx] === '+') {// Check for plus sign at the beginning\n      ndx++;\n    }\n\n    if (match.length === ndx + 1) { // Check if it's just a simple number \"1234\"\n      w = assign(match[ndx++], s);\n    } else if (match[ndx + 1] === '.' || match[ndx] === '.') { // Check if it's a decimal number\n\n      if (match[ndx] !== '.') { // Handle 0.5 and .5\n        v = assign(match[ndx++], s);\n      }\n      ndx++;\n\n      // Check for decimal places\n      if (ndx + 1 === match.length || match[ndx + 1] === '(' && match[ndx + 3] === ')' || match[ndx + 1] === \"'\" && match[ndx + 3] === \"'\") {\n        w = assign(match[ndx], s);\n        y = C_TEN ** BigInt(match[ndx].length);\n        ndx++;\n      }\n\n      // Check for repeating places\n      if (match[ndx] === '(' && match[ndx + 2] === ')' || match[ndx] === \"'\" && match[ndx + 2] === \"'\") {\n        x = assign(match[ndx + 1], s);\n        z = C_TEN ** BigInt(match[ndx + 1].length) - C_ONE;\n        ndx += 3;\n      }\n\n    } else if (match[ndx + 1] === '/' || match[ndx + 1] === ':') { // Check for a simple fraction \"123/456\" or \"123:456\"\n      w = assign(match[ndx], s);\n      y = assign(match[ndx + 2], C_ONE);\n      ndx += 3;\n    } else if (match[ndx + 3] === '/' && match[ndx + 1] === ' ') { // Check for a complex fraction \"123 1/2\"\n      v = assign(match[ndx], s);\n      w = assign(match[ndx + 2], s);\n      y = assign(match[ndx + 4], C_ONE);\n      ndx += 5;\n    }\n\n    if (match.length <= ndx) { // Check for more tokens on the stack\n      d = y * z;\n      s = /* void */\n        n = x + d * v + z * w;\n    } else {\n      throw InvalidParameter();\n    }\n\n  } else if (typeof p1 === \"bigint\") {\n    n = p1;\n    s = p1;\n    d = C_ONE;\n  } else {\n    throw InvalidParameter();\n  }\n\n  if (d === C_ZERO) {\n    throw DivisionByZero();\n  }\n\n  P[\"s\"] = s < C_ZERO ? -C_ONE : C_ONE;\n  P[\"n\"] = n < C_ZERO ? -n : n;\n  P[\"d\"] = d < C_ZERO ? -d : d;\n};\n\nfunction modpow(b, e, m) {\n\n  let r = C_ONE;\n  for (; e > C_ZERO; b = (b * b) % m, e >>= C_ONE) {\n\n    if (e & C_ONE) {\n      r = (r * b) % m;\n    }\n  }\n  return r;\n}\n\nfunction cycleLen(n, d) {\n\n  for (; d % C_TWO === C_ZERO;\n    d /= C_TWO) {\n  }\n\n  for (; d % C_FIVE === C_ZERO;\n    d /= C_FIVE) {\n  }\n\n  if (d === C_ONE) // Catch non-cyclic numbers\n    return C_ZERO;\n\n  // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:\n  // 10^(d-1) % d == 1\n  // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,\n  // as we want to translate the numbers to strings.\n\n  let rem = C_TEN % d;\n  let t = 1;\n\n  for (; rem !== C_ONE; t++) {\n    rem = rem * C_TEN % d;\n\n    if (t > MAX_CYCLE_LEN)\n      return C_ZERO; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`\n  }\n  return BigInt(t);\n}\n\nfunction cycleStart(n, d, len) {\n\n  let rem1 = C_ONE;\n  let rem2 = modpow(C_TEN, len, d);\n\n  for (let t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)\n    // Solve 10^s == 10^(s+t) (mod d)\n\n    if (rem1 === rem2)\n      return BigInt(t);\n\n    rem1 = rem1 * C_TEN % d;\n    rem2 = rem2 * C_TEN % d;\n  }\n  return 0;\n}\n\nfunction gcd(a, b) {\n\n  if (!a)\n    return b;\n  if (!b)\n    return a;\n\n  while (1) {\n    a %= b;\n    if (!a)\n      return b;\n    b %= a;\n    if (!b)\n      return a;\n  }\n}\n\n/**\n * Module constructor\n *\n * @constructor\n * @param {number|Fraction=} a\n * @param {number=} b\n */\nfunction Fraction(a, b) {\n\n  parse(a, b);\n\n  if (this instanceof Fraction) {\n    a = gcd(P[\"d\"], P[\"n\"]); // Abuse a\n    this[\"s\"] = P[\"s\"];\n    this[\"n\"] = P[\"n\"] / a;\n    this[\"d\"] = P[\"d\"] / a;\n  } else {\n    return newFraction(P['s'] * P['n'], P['d']);\n  }\n}\n\nconst DivisionByZero = function () { return new Error(\"Division by Zero\"); };\nconst InvalidParameter = function () { return new Error(\"Invalid argument\"); };\nconst NonIntegerParameter = function () { return new Error(\"Parameters must be integer\"); };\n\nFraction.prototype = {\n\n  \"s\": C_ONE,\n  \"n\": C_ZERO,\n  \"d\": C_ONE,\n\n  /**\n   * Calculates the absolute value\n   *\n   * Ex: new Fraction(-4).abs() => 4\n   **/\n  \"abs\": function () {\n\n    return newFraction(this[\"n\"], this[\"d\"]);\n  },\n\n  /**\n   * Inverts the sign of the current fraction\n   *\n   * Ex: new Fraction(-4).neg() => 4\n   **/\n  \"neg\": function () {\n\n    return newFraction(-this[\"s\"] * this[\"n\"], this[\"d\"]);\n  },\n\n  /**\n   * Adds two rational numbers\n   *\n   * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => 467 / 30\n   **/\n  \"add\": function (a, b) {\n\n    parse(a, b);\n    return newFraction(\n      this[\"s\"] * this[\"n\"] * P[\"d\"] + P[\"s\"] * this[\"d\"] * P[\"n\"],\n      this[\"d\"] * P[\"d\"]\n    );\n  },\n\n  /**\n   * Subtracts two rational numbers\n   *\n   * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => -427 / 30\n   **/\n  \"sub\": function (a, b) {\n\n    parse(a, b);\n    return newFraction(\n      this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * this[\"d\"] * P[\"n\"],\n      this[\"d\"] * P[\"d\"]\n    );\n  },\n\n  /**\n   * Multiplies two rational numbers\n   *\n   * Ex: new Fraction(\"-17.(345)\").mul(3) => 5776 / 111\n   **/\n  \"mul\": function (a, b) {\n\n    parse(a, b);\n    return newFraction(\n      this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"n\"],\n      this[\"d\"] * P[\"d\"]\n    );\n  },\n\n  /**\n   * Divides two rational numbers\n   *\n   * Ex: new Fraction(\"-17.(345)\").inverse().div(3)\n   **/\n  \"div\": function (a, b) {\n\n    parse(a, b);\n    return newFraction(\n      this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"d\"],\n      this[\"d\"] * P[\"n\"]\n    );\n  },\n\n  /**\n   * Clones the actual object\n   *\n   * Ex: new Fraction(\"-17.(345)\").clone()\n   **/\n  \"clone\": function () {\n    return newFraction(this['s'] * this['n'], this['d']);\n  },\n\n  /**\n   * Calculates the modulo of two rational numbers - a more precise fmod\n   *\n   * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)\n   * Ex: new Fraction(20, 10).mod().equals(0) ? \"is Integer\"\n   **/\n  \"mod\": function (a, b) {\n\n    if (a === undefined) {\n      return newFraction(this[\"s\"] * this[\"n\"] % this[\"d\"], C_ONE);\n    }\n\n    parse(a, b);\n    if (C_ZERO === P[\"n\"] * this[\"d\"]) {\n      throw DivisionByZero();\n    }\n\n    /**\n     * I derived the rational modulo similar to the modulo for integers\n     *\n     * https://raw.org/book/analysis/rational-numbers/\n     *\n     *    n1/d1 = (n2/d2) * q + r, where 0 ≤ r < n2/d2\n     * => d2 * n1 = n2 * d1 * q + d1 * d2 * r\n     * => r = (d2 * n1 - n2 * d1 * q) / (d1 * d2)\n     *      = (d2 * n1 - n2 * d1 * floor((d2 * n1) / (n2 * d1))) / (d1 * d2)\n     *      = ((d2 * n1) % (n2 * d1)) / (d1 * d2)\n     */\n    return newFraction(\n      this[\"s\"] * (P[\"d\"] * this[\"n\"]) % (P[\"n\"] * this[\"d\"]),\n      P[\"d\"] * this[\"d\"]);\n  },\n\n  /**\n   * Calculates the fractional gcd of two rational numbers\n   *\n   * Ex: new Fraction(5,8).gcd(3,7) => 1/56\n   */\n  \"gcd\": function (a, b) {\n\n    parse(a, b);\n\n    // https://raw.org/book/analysis/rational-numbers/\n    // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)\n\n    return newFraction(gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]), P[\"d\"] * this[\"d\"]);\n  },\n\n  /**\n   * Calculates the fractional lcm of two rational numbers\n   *\n   * Ex: new Fraction(5,8).lcm(3,7) => 15\n   */\n  \"lcm\": function (a, b) {\n\n    parse(a, b);\n\n    // https://raw.org/book/analysis/rational-numbers/\n    // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)\n\n    if (P[\"n\"] === C_ZERO && this[\"n\"] === C_ZERO) {\n      return newFraction(C_ZERO, C_ONE);\n    }\n    return newFraction(P[\"n\"] * this[\"n\"], gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]));\n  },\n\n  /**\n   * Gets the inverse of the fraction, means numerator and denominator are exchanged\n   *\n   * Ex: new Fraction([-3, 4]).inverse() => -4 / 3\n   **/\n  \"inverse\": function () {\n    return newFraction(this[\"s\"] * this[\"d\"], this[\"n\"]);\n  },\n\n  /**\n   * Calculates the fraction to some integer exponent\n   *\n   * Ex: new Fraction(-1,2).pow(-3) => -8\n   */\n  \"pow\": function (a, b) {\n\n    parse(a, b);\n\n    // Trivial case when exp is an integer\n\n    if (P['d'] === C_ONE) {\n\n      if (P['s'] < C_ZERO) {\n        return newFraction((this['s'] * this[\"d\"]) ** P['n'], this[\"n\"] ** P['n']);\n      } else {\n        return newFraction((this['s'] * this[\"n\"]) ** P['n'], this[\"d\"] ** P['n']);\n      }\n    }\n\n    // Negative roots become complex\n    //     (-a/b)^(c/d) = x\n    // ⇔ (-1)^(c/d) * (a/b)^(c/d) = x\n    // ⇔ (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x\n    // ⇔ (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula\n    // From which follows that only for c=0 the root is non-complex\n    if (this['s'] < C_ZERO) return null;\n\n    // Now prime factor n and d\n    let N = factorize(this['n']);\n    let D = factorize(this['d']);\n\n    // Exponentiate and take root for n and d individually\n    let n = C_ONE;\n    let d = C_ONE;\n    for (let k in N) {\n      if (k === '1') continue;\n      if (k === '0') {\n        n = C_ZERO;\n        break;\n      }\n      N[k] *= P['n'];\n\n      if (N[k] % P['d'] === C_ZERO) {\n        N[k] /= P['d'];\n      } else return null;\n      n *= BigInt(k) ** N[k];\n    }\n\n    for (let k in D) {\n      if (k === '1') continue;\n      D[k] *= P['n'];\n\n      if (D[k] % P['d'] === C_ZERO) {\n        D[k] /= P['d'];\n      } else return null;\n      d *= BigInt(k) ** D[k];\n    }\n\n    if (P['s'] < C_ZERO) {\n      return newFraction(d, n);\n    }\n    return newFraction(n, d);\n  },\n\n  /**\n   * Calculates the logarithm of a fraction to a given rational base\n   *\n   * Ex: new Fraction(27, 8).log(9, 4) => 3/2\n   */\n  \"log\": function (a, b) {\n\n    parse(a, b);\n\n    if (this['s'] <= C_ZERO || P['s'] <= C_ZERO) return null;\n\n    const allPrimes = Object.create(null);\n\n    const baseFactors = factorize(P['n']);\n    const T1 = factorize(P['d']);\n\n    const numberFactors = factorize(this['n']);\n    const T2 = factorize(this['d']);\n\n    for (const prime in T1) {\n      baseFactors[prime] = (baseFactors[prime] || C_ZERO) - T1[prime];\n    }\n    for (const prime in T2) {\n      numberFactors[prime] = (numberFactors[prime] || C_ZERO) - T2[prime];\n    }\n\n    for (const prime in baseFactors) {\n      if (prime === '1') continue;\n      allPrimes[prime] = true;\n    }\n    for (const prime in numberFactors) {\n      if (prime === '1') continue;\n      allPrimes[prime] = true;\n    }\n\n    let retN = null;\n    let retD = null;\n\n    // Iterate over all unique primes to determine if a consistent ratio exists\n    for (const prime in allPrimes) {\n\n      const baseExponent = baseFactors[prime] || C_ZERO;\n      const numberExponent = numberFactors[prime] || C_ZERO;\n\n      if (baseExponent === C_ZERO) {\n        if (numberExponent !== C_ZERO) {\n          return null; // Logarithm cannot be expressed as a rational number\n        }\n        continue; // Skip this prime since both exponents are zero\n      }\n\n      // Calculate the ratio of exponents for this prime\n      let curN = numberExponent;\n      let curD = baseExponent;\n\n      // Simplify the current ratio\n      const gcdValue = gcd(curN, curD);\n      curN /= gcdValue;\n      curD /= gcdValue;\n\n      // Check if this is the first ratio; otherwise, ensure ratios are consistent\n      if (retN === null && retD === null) {\n        retN = curN;\n        retD = curD;\n      } else if (curN * retD !== retN * curD) {\n        return null; // Ratios do not match, logarithm cannot be rational\n      }\n    }\n\n    return retN !== null && retD !== null\n      ? newFraction(retN, retD)\n      : null;\n  },\n\n  /**\n   * Check if two rational numbers are the same\n   *\n   * Ex: new Fraction(19.6).equals([98, 5]);\n   **/\n  \"equals\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] === P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is less than another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"lt\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] < P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is less than or equal another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"lte\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] <= P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is greater than another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"gt\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] > P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is greater than or equal another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"gte\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] >= P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Compare two rational numbers\n   * < 0 iff this < that\n   * > 0 iff this > that\n   * = 0 iff this = that\n   *\n   * Ex: new Fraction(19.6).compare([98, 5]);\n   **/\n  \"compare\": function (a, b) {\n\n    parse(a, b);\n    let t = this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * P[\"n\"] * this[\"d\"];\n\n    return (C_ZERO < t) - (t < C_ZERO);\n  },\n\n  /**\n   * Calculates the ceil of a rational number\n   *\n   * Ex: new Fraction('4.(3)').ceil() => (5 / 1)\n   **/\n  \"ceil\": function (places) {\n\n    places = C_TEN ** BigInt(places || 0);\n\n    return newFraction(ifloor(this[\"s\"] * places * this[\"n\"] / this[\"d\"]) +\n      (places * this[\"n\"] % this[\"d\"] > C_ZERO && this[\"s\"] >= C_ZERO ? C_ONE : C_ZERO),\n      places);\n  },\n\n  /**\n   * Calculates the floor of a rational number\n   *\n   * Ex: new Fraction('4.(3)').floor() => (4 / 1)\n   **/\n  \"floor\": function (places) {\n\n    places = C_TEN ** BigInt(places || 0);\n\n    return newFraction(ifloor(this[\"s\"] * places * this[\"n\"] / this[\"d\"]) -\n      (places * this[\"n\"] % this[\"d\"] > C_ZERO && this[\"s\"] < C_ZERO ? C_ONE : C_ZERO),\n      places);\n  },\n\n  /**\n   * Rounds a rational numbers\n   *\n   * Ex: new Fraction('4.(3)').round() => (4 / 1)\n   **/\n  \"round\": function (places) {\n\n    places = C_TEN ** BigInt(places || 0);\n\n    /* Derivation:\n\n    s >= 0:\n      round(n / d) = ifloor(n / d) + (n % d) / d >= 0.5 ? 1 : 0\n                   = ifloor(n / d) + 2(n % d) >= d ? 1 : 0\n    s < 0:\n      round(n / d) =-ifloor(n / d) - (n % d) / d > 0.5 ? 1 : 0\n                   =-ifloor(n / d) - 2(n % d) > d ? 1 : 0\n\n    =>:\n\n    round(s * n / d) = s * ifloor(n / d) + s * (C + 2(n % d) > d ? 1 : 0)\n        where C = s >= 0 ? 1 : 0, to fix the >= for the positve case.\n    */\n\n    return newFraction(ifloor(this[\"s\"] * places * this[\"n\"] / this[\"d\"]) +\n      this[\"s\"] * ((this[\"s\"] >= C_ZERO ? C_ONE : C_ZERO) + C_TWO * (places * this[\"n\"] % this[\"d\"]) > this[\"d\"] ? C_ONE : C_ZERO),\n      places);\n  },\n\n  /**\n    * Rounds a rational number to a multiple of another rational number\n    *\n    * Ex: new Fraction('0.9').roundTo(\"1/8\") => 7 / 8\n    **/\n  \"roundTo\": function (a, b) {\n\n    /*\n    k * x/y ≤ a/b < (k+1) * x/y\n    ⇔ k ≤ a/b / (x/y) < (k+1)\n    ⇔ k = floor(a/b * y/x)\n    ⇔ k = floor((a * y) / (b * x))\n    */\n\n    parse(a, b);\n\n    const n = this['n'] * P['d'];\n    const d = this['d'] * P['n'];\n    const r = n % d;\n\n    // round(n / d) = ifloor(n / d) + 2(n % d) >= d ? 1 : 0\n    let k = ifloor(n / d);\n    if (r + r >= d) {\n      k++;\n    }\n    return newFraction(this['s'] * k * P['n'], P['d']);\n  },\n\n  /**\n   * Check if two rational numbers are divisible\n   *\n   * Ex: new Fraction(19.6).divisible(1.5);\n   */\n  \"divisible\": function (a, b) {\n\n    parse(a, b);\n    if (P['n'] === C_ZERO) return false;\n    return (this['n'] * P['d']) % (P['n'] * this['d']) === C_ZERO;\n  },\n\n  /**\n   * Returns a decimal representation of the fraction\n   *\n   * Ex: new Fraction(\"100.'91823'\").valueOf() => 100.91823918239183\n   **/\n  'valueOf': function () {\n    //if (this['n'] <= MAX_INTEGER && this['d'] <= MAX_INTEGER) {\n    return Number(this['s'] * this['n']) / Number(this['d']);\n    //}\n  },\n\n  /**\n   * Creates a string representation of a fraction with all digits\n   *\n   * Ex: new Fraction(\"100.'91823'\").toString() => \"100.(91823)\"\n   **/\n  'toString': function (dec = 15) {\n\n    let N = this[\"n\"];\n    let D = this[\"d\"];\n\n    let cycLen = cycleLen(N, D); // Cycle length\n    let cycOff = cycleStart(N, D, cycLen); // Cycle start\n\n    let str = this['s'] < C_ZERO ? \"-\" : \"\";\n\n    // Append integer part\n    str += ifloor(N / D);\n\n    N %= D;\n    N *= C_TEN;\n\n    if (N)\n      str += \".\";\n\n    if (cycLen) {\n\n      for (let i = cycOff; i--;) {\n        str += ifloor(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n      str += \"(\";\n      for (let i = cycLen; i--;) {\n        str += ifloor(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n      str += \")\";\n    } else {\n      for (let i = dec; N && i--;) {\n        str += ifloor(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n    }\n    return str;\n  },\n\n  /**\n   * Returns a string-fraction representation of a Fraction object\n   *\n   * Ex: new Fraction(\"1.'3'\").toFraction() => \"4 1/3\"\n   **/\n  'toFraction': function (showMixed = false) {\n\n    let n = this[\"n\"];\n    let d = this[\"d\"];\n    let str = this['s'] < C_ZERO ? \"-\" : \"\";\n\n    if (d === C_ONE) {\n      str += n;\n    } else {\n      const whole = ifloor(n / d);\n      if (showMixed && whole > C_ZERO) {\n        str += whole;\n        str += \" \";\n        n %= d;\n      }\n\n      str += n;\n      str += '/';\n      str += d;\n    }\n    return str;\n  },\n\n  /**\n   * Returns a latex representation of a Fraction object\n   *\n   * Ex: new Fraction(\"1.'3'\").toLatex() => \"\\frac{4}{3}\"\n   **/\n  'toLatex': function (showMixed = false) {\n\n    let n = this[\"n\"];\n    let d = this[\"d\"];\n    let str = this['s'] < C_ZERO ? \"-\" : \"\";\n\n    if (d === C_ONE) {\n      str += n;\n    } else {\n      const whole = ifloor(n / d);\n      if (showMixed && whole > C_ZERO) {\n        str += whole;\n        n %= d;\n      }\n\n      str += \"\\\\frac{\";\n      str += n;\n      str += '}{';\n      str += d;\n      str += '}';\n    }\n    return str;\n  },\n\n  /**\n   * Returns an array of continued fraction elements\n   *\n   * Ex: new Fraction(\"7/8\").toContinued() => [0,1,7]\n   */\n  'toContinued': function () {\n\n    let a = this['n'];\n    let b = this['d'];\n    const res = [];\n\n    while (b) {\n      res.push(ifloor(a / b));\n      const t = a % b;\n      a = b;\n      b = t;\n    }\n    return res;\n  },\n\n  \"simplify\": function (eps = 1e-3) {\n\n    // Continued fractions give best approximations for a max denominator,\n    // generally outperforming mediants in denominator–accuracy trade-offs.\n    // Semiconvergents can further reduce the denominator within tolerance.\n\n    const ieps = BigInt(Math.ceil(1 / eps));\n\n    const thisABS = this['abs']();\n    const cont = thisABS['toContinued']();\n\n    for (let i = 1; i < cont.length; i++) {\n\n      let s = newFraction(cont[i - 1], C_ONE);\n      for (let k = i - 2; k >= 0; k--) {\n        s = s['inverse']()['add'](cont[k]);\n      }\n\n      let t = s['sub'](thisABS);\n      if (t['n'] * ieps < t['d']) { // More robust than Math.abs(t.valueOf()) < eps\n        return s['mul'](this['s']);\n      }\n    }\n    return this;\n  }\n};\nexport {\n  Fraction as default, Fraction\n};\n","import Fraction from 'fraction.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Fraction';\nvar dependencies = [];\nexport var createFractionClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(Fraction, 'name', {\n    value: 'Fraction'\n  });\n  Fraction.prototype.constructor = Fraction;\n  Fraction.prototype.type = 'Fraction';\n  Fraction.prototype.isFraction = true;\n\n  /**\n   * Get a JSON representation of a Fraction containing type information\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Fraction\", \"n\": \"3\", \"d\": \"8\"}`\n   */\n  Fraction.prototype.toJSON = function () {\n    return {\n      mathjs: 'Fraction',\n      n: String(this.s * this.n),\n      d: String(this.d)\n    };\n  };\n\n  /**\n   * Instantiate a Fraction from a JSON object\n   * @param {Object} json  a JSON object structured as:\n   *                       `{\"mathjs\": \"Fraction\", \"n\": \"3\", \"d\": \"8\"}`\n   * @return {BigNumber}\n   */\n  Fraction.fromJSON = function (json) {\n    return new Fraction(json);\n  };\n  return Fraction;\n}, {\n  isClass: true\n});","import { factory } from '../../utils/factory.js';\nvar name = 'Matrix';\nvar dependencies = [];\nexport var createMatrixClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * @constructor Matrix\n   *\n   * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional\n   * array. A matrix can be constructed as:\n   *\n   *     let matrix = math.matrix(data)\n   *\n   * Matrix contains the functions to resize, get and set values, get the size,\n   * clone the matrix and to convert the matrix to a vector, array, or scalar.\n   * Furthermore, one can iterate over the matrix using map and forEach.\n   * The internal Array of the Matrix can be accessed using the function valueOf.\n   *\n   * Example usage:\n   *\n   *     let matrix = math.matrix([[1, 2], [3, 4]])\n   *     matix.size()              // [2, 2]\n   *     matrix.resize([3, 2], 5)\n   *     matrix.valueOf()          // [[1, 2], [3, 4], [5, 5]]\n   *     matrix.subset([1,2])       // 3 (indexes are zero-based)\n   *\n   */\n  function Matrix() {\n    if (!(this instanceof Matrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Matrix.prototype.type = 'Matrix';\n  Matrix.prototype.isMatrix = true;\n\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()   // retrieve storage format\n   *\n   * @return {string}           The storage format.\n   */\n  Matrix.prototype.storage = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke storage on a Matrix interface');\n  };\n\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()    // retrieve matrix datatype\n   *\n   * @return {string}           The datatype.\n   */\n  Matrix.prototype.datatype = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke datatype on a Matrix interface');\n  };\n\n  /**\n   * Create a new Matrix With the type of the current matrix instance\n   * @param {Array | Object} data\n   * @param {string} [datatype]\n   */\n  Matrix.prototype.create = function (data, datatype) {\n    throw new Error('Cannot invoke create on a Matrix interface');\n  };\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  Matrix.prototype.subset = function (index, replacement, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke subset on a Matrix interface');\n  };\n\n  /**\n   * Get a single element from the matrix.\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  Matrix.prototype.get = function (index) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke get on a Matrix interface');\n  };\n\n  /**\n   * Replace a single element in the matrix.\n   * @param {number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {Matrix} self\n   */\n  Matrix.prototype.set = function (index, value, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke set on a Matrix interface');\n  };\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  Matrix.prototype.resize = function (size, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke resize on a Matrix interface');\n  };\n\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  Matrix.prototype.reshape = function (size, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke reshape on a Matrix interface');\n  };\n\n  /**\n   * Create a clone of the matrix\n   * @return {Matrix} clone\n   */\n  Matrix.prototype.clone = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke clone on a Matrix interface');\n  };\n\n  /**\n   * Retrieve the size of the matrix.\n   * @returns {number[]} size\n   */\n  Matrix.prototype.size = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke size on a Matrix interface');\n  };\n\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *\n   * @return {Matrix} matrix\n   */\n  Matrix.prototype.map = function (callback, skipZeros) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke map on a Matrix interface');\n  };\n\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   */\n  Matrix.prototype.forEach = function (callback) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke forEach on a Matrix interface');\n  };\n\n  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  Matrix.prototype[Symbol.iterator] = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot iterate a Matrix interface');\n  };\n\n  /**\n   * Create an Array with a copy of the data of the Matrix\n   * @returns {Array} array\n   */\n  Matrix.prototype.toArray = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke toArray on a Matrix interface');\n  };\n\n  /**\n   * Get the primitive value of the Matrix: a multidimensional array\n   * @returns {Array} array\n   */\n  Matrix.prototype.valueOf = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke valueOf on a Matrix interface');\n  };\n\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  Matrix.prototype.format = function (options) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke format on a Matrix interface');\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @returns {string} str\n   */\n  Matrix.prototype.toString = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke toString on a Matrix interface');\n  };\n  return Matrix;\n}, {\n  isClass: true\n});","import _extends from \"@babel/runtime/helpers/extends\";\nimport { isInteger } from './number.js';\nimport { isNumber, isBigNumber, isArray, isString } from './is.js';\nimport { format } from './string.js';\nimport { DimensionError } from '../error/DimensionError.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { deepStrictEqual } from './object.js';\n\n/**\n * Calculate the size of a multi dimensional array.\n * This function checks the size of the first entry, it does not validate\n * whether all dimensions match. (use function `validate` for that)\n * @param {Array} x\n * @return {number[]} size\n */\nexport function arraySize(x) {\n  var s = [];\n  while (Array.isArray(x)) {\n    s.push(x.length);\n    x = x[0];\n  }\n  return s;\n}\n\n/**\n * Recursively validate whether each element in a multi dimensional array\n * has a size corresponding to the provided size array.\n * @param {Array} array    Array to be validated\n * @param {number[]} size  Array with the size of each dimension\n * @param {number} dim     Current dimension\n * @throws DimensionError\n * @private\n */\nfunction _validate(array, size, dim) {\n  var i;\n  var len = array.length;\n  if (len !== size[dim]) {\n    throw new DimensionError(len, size[dim]);\n  }\n  if (dim < size.length - 1) {\n    // recursively validate each child array\n    var dimNext = dim + 1;\n    for (i = 0; i < len; i++) {\n      var child = array[i];\n      if (!Array.isArray(child)) {\n        throw new DimensionError(size.length - 1, size.length, '<');\n      }\n      _validate(array[i], size, dimNext);\n    }\n  } else {\n    // last dimension. none of the children may be an array\n    for (i = 0; i < len; i++) {\n      if (Array.isArray(array[i])) {\n        throw new DimensionError(size.length + 1, size.length, '>');\n      }\n    }\n  }\n}\n\n/**\n * Validate whether each element in a multi dimensional array has\n * a size corresponding to the provided size array.\n * @param {Array} array    Array to be validated\n * @param {number[]} size  Array with the size of each dimension\n * @throws DimensionError\n */\nexport function validate(array, size) {\n  var isScalar = size.length === 0;\n  if (isScalar) {\n    // scalar\n    if (Array.isArray(array)) {\n      throw new DimensionError(array.length, 0);\n    }\n  } else {\n    // array\n    _validate(array, size, 0);\n  }\n}\n\n/**\n * Validate whether the source of the index matches the size of the Array\n * @param {Array | Matrix} value    Array to be validated\n * @param {Index} index  Index with the source information to validate\n * @throws DimensionError\n */\nexport function validateIndexSourceSize(value, index) {\n  var valueSize = value.isMatrix ? value._size : arraySize(value);\n  var sourceSize = index._sourceSize;\n  // checks if the source size is not null and matches the valueSize\n  sourceSize.forEach((sourceDim, i) => {\n    if (sourceDim !== null && sourceDim !== valueSize[i]) {\n      throw new DimensionError(sourceDim, valueSize[i]);\n    }\n  });\n}\n\n/**\n * Test whether index is an integer number with index >= 0 and index < length\n * when length is provided\n * @param {number} index    Zero-based index\n * @param {number} [length] Length of the array\n */\nexport function validateIndex(index, length) {\n  if (index !== undefined) {\n    if (!isNumber(index) || !isInteger(index)) {\n      throw new TypeError('Index must be an integer (value: ' + index + ')');\n    }\n    if (index < 0 || typeof length === 'number' && index >= length) {\n      throw new IndexError(index, length);\n    }\n  }\n}\n\n/**\n * Test if an index has empty values\n * @param {Index} index    Zero-based index\n */\nexport function isEmptyIndex(index) {\n  for (var i = 0; i < index._dimensions.length; ++i) {\n    var dimension = index._dimensions[i];\n    if (dimension._data && isArray(dimension._data)) {\n      if (dimension._size[0] === 0) {\n        return true;\n      }\n    } else if (dimension.isRange) {\n      if (dimension.start === dimension.end) {\n        return true;\n      }\n    } else if (isString(dimension)) {\n      if (dimension.length === 0) {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\n/**\n * Resize a multi dimensional array. The resized array is returned.\n * @param {Array | number} array         Array to be resized\n * @param {number[]} size Array with the size of each dimension\n * @param {*} [defaultValue=0]  Value to be filled in new entries,\n *                              zero by default. Specify for example `null`,\n *                              to clearly see entries that are not explicitly\n *                              set.\n * @return {Array} array         The resized array\n */\nexport function resize(array, size, defaultValue) {\n  // check the type of the arguments\n  if (!Array.isArray(size)) {\n    throw new TypeError('Array expected');\n  }\n  if (size.length === 0) {\n    throw new Error('Resizing to scalar is not supported');\n  }\n\n  // check whether size contains positive integers\n  size.forEach(function (value) {\n    if (!isNumber(value) || !isInteger(value) || value < 0) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');\n    }\n  });\n\n  // convert number to an array\n  if (isNumber(array) || isBigNumber(array)) {\n    array = [array];\n  }\n\n  // recursively resize the array\n  var _defaultValue = defaultValue !== undefined ? defaultValue : 0;\n  _resize(array, size, 0, _defaultValue);\n  return array;\n}\n\n/**\n * Recursively resize a multi dimensional array\n * @param {Array} array         Array to be resized\n * @param {number[]} size       Array with the size of each dimension\n * @param {number} dim          Current dimension\n * @param {*} [defaultValue]    Value to be filled in new entries,\n *                              undefined by default.\n * @private\n */\nfunction _resize(array, size, dim, defaultValue) {\n  var i;\n  var elem;\n  var oldLen = array.length;\n  var newLen = size[dim];\n  var minLen = Math.min(oldLen, newLen);\n\n  // apply new length\n  array.length = newLen;\n  if (dim < size.length - 1) {\n    // non-last dimension\n    var dimNext = dim + 1;\n\n    // resize existing child arrays\n    for (i = 0; i < minLen; i++) {\n      // resize child array\n      elem = array[i];\n      if (!Array.isArray(elem)) {\n        elem = [elem]; // add a dimension\n        array[i] = elem;\n      }\n      _resize(elem, size, dimNext, defaultValue);\n    }\n\n    // create new child arrays\n    for (i = minLen; i < newLen; i++) {\n      // get child array\n      elem = [];\n      array[i] = elem;\n\n      // resize new child array\n      _resize(elem, size, dimNext, defaultValue);\n    }\n  } else {\n    // last dimension\n\n    // remove dimensions of existing values\n    for (i = 0; i < minLen; i++) {\n      while (Array.isArray(array[i])) {\n        array[i] = array[i][0];\n      }\n    }\n\n    // fill new elements with the default value\n    for (i = minLen; i < newLen; i++) {\n      array[i] = defaultValue;\n    }\n  }\n}\n\n/**\n * Re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array           Array to be reshaped\n * @param {number[]} sizes        List of sizes for each dimension\n * @returns {Array}               Array whose data has been formatted to fit the\n *                                specified dimensions\n *\n * @throws {DimensionError}       If the product of the new dimension sizes does\n *                                not equal that of the old ones\n */\nexport function reshape(array, sizes) {\n  var flatArray = flatten(array, true); // since it has rectangular\n  var currentLength = flatArray.length;\n  if (!Array.isArray(array) || !Array.isArray(sizes)) {\n    throw new TypeError('Array expected');\n  }\n  if (sizes.length === 0) {\n    throw new DimensionError(0, currentLength, '!=');\n  }\n  sizes = processSizesWildcard(sizes, currentLength);\n  var newLength = product(sizes);\n  if (currentLength !== newLength) {\n    throw new DimensionError(newLength, currentLength, '!=');\n  }\n  try {\n    return _reshape(flatArray, sizes);\n  } catch (e) {\n    if (e instanceof DimensionError) {\n      throw new DimensionError(newLength, currentLength, '!=');\n    }\n    throw e;\n  }\n}\n\n/**\n * Replaces the wildcard -1 in the sizes array.\n * @param {number[]} sizes  List of sizes for each dimension. At most one wildcard.\n * @param {number} currentLength  Number of elements in the array.\n * @throws {Error}                If more than one wildcard or unable to replace it.\n * @returns {number[]}      The sizes array with wildcard replaced.\n */\nexport function processSizesWildcard(sizes, currentLength) {\n  var newLength = product(sizes);\n  var processedSizes = sizes.slice();\n  var WILDCARD = -1;\n  var wildCardIndex = sizes.indexOf(WILDCARD);\n  var isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;\n  if (isMoreThanOneWildcard) {\n    throw new Error('More than one wildcard in sizes');\n  }\n  var hasWildcard = wildCardIndex >= 0;\n  var canReplaceWildcard = currentLength % newLength === 0;\n  if (hasWildcard) {\n    if (canReplaceWildcard) {\n      processedSizes[wildCardIndex] = -currentLength / newLength;\n    } else {\n      throw new Error('Could not replace wildcard, since ' + currentLength + ' is no multiple of ' + -newLength);\n    }\n  }\n  return processedSizes;\n}\n\n/**\n * Computes the product of all array elements.\n * @param {number[]} array Array of factors\n * @returns {number}            Product of all elements\n */\nfunction product(array) {\n  return array.reduce((prev, curr) => prev * curr, 1);\n}\n\n/**\n * Iteratively re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array           Array to be reshaped\n * @param {number[]} sizes  List of sizes for each dimension\n * @returns {Array}               Array whose data has been formatted to fit the\n *                                specified dimensions\n */\n\nfunction _reshape(array, sizes) {\n  // testing if there are enough elements for the requested shape\n  var tmpArray = array;\n  var tmpArray2;\n  // for each dimension starting by the last one and ignoring the first one\n  for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n    var size = sizes[sizeIndex];\n    tmpArray2 = [];\n\n    // aggregate the elements of the current tmpArray in elements of the requested size\n    var length = tmpArray.length / size;\n    for (var i = 0; i < length; i++) {\n      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));\n    }\n    // set it as the new tmpArray for the next loop turn or for return\n    tmpArray = tmpArray2;\n  }\n  return tmpArray;\n}\n\n/**\n * Squeeze a multi dimensional array\n * @param {Array} array\n * @param {Array} [size]\n * @returns {Array} returns the array itself\n */\nexport function squeeze(array, size) {\n  var s = size || arraySize(array);\n\n  // squeeze outer dimensions\n  while (Array.isArray(array) && array.length === 1) {\n    array = array[0];\n    s.shift();\n  }\n\n  // find the first dimension to be squeezed\n  var dims = s.length;\n  while (s[dims - 1] === 1) {\n    dims--;\n  }\n\n  // squeeze inner dimensions\n  if (dims < s.length) {\n    array = _squeeze(array, dims, 0);\n    s.length = dims;\n  }\n  return array;\n}\n\n/**\n * Recursively squeeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim  Current dimension\n * @returns {Array | *} Returns the squeezed array\n * @private\n */\nfunction _squeeze(array, dims, dim) {\n  var i, ii;\n  if (dim < dims) {\n    var next = dim + 1;\n    for (i = 0, ii = array.length; i < ii; i++) {\n      array[i] = _squeeze(array[i], dims, next);\n    }\n  } else {\n    while (Array.isArray(array)) {\n      array = array[0];\n    }\n  }\n  return array;\n}\n\n/**\n * Unsqueeze a multi dimensional array: add dimensions when missing\n *\n * Parameter `size` will be mutated to match the new, unsqueezed matrix size.\n *\n * @param {Array} array\n * @param {number} dims       Desired number of dimensions of the array\n * @param {number} [outer]    Number of outer dimensions to be added\n * @param {Array} [size] Current size of array.\n * @returns {Array} returns the array itself\n * @private\n */\nexport function unsqueeze(array, dims, outer, size) {\n  var s = size || arraySize(array);\n\n  // unsqueeze outer dimensions\n  if (outer) {\n    for (var i = 0; i < outer; i++) {\n      array = [array];\n      s.unshift(1);\n    }\n  }\n\n  // unsqueeze inner dimensions\n  array = _unsqueeze(array, dims, 0);\n  while (s.length < dims) {\n    s.push(1);\n  }\n  return array;\n}\n\n/**\n * Recursively unsqueeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim  Current dimension\n * @returns {Array | *} Returns the unsqueezed array\n * @private\n */\nfunction _unsqueeze(array, dims, dim) {\n  var i, ii;\n  if (Array.isArray(array)) {\n    var next = dim + 1;\n    for (i = 0, ii = array.length; i < ii; i++) {\n      array[i] = _unsqueeze(array[i], dims, next);\n    }\n  } else {\n    for (var d = dim; d < dims; d++) {\n      array = [array];\n    }\n  }\n  return array;\n}\n/**\n * Flatten a multi dimensional array, put all elements in a one dimensional\n * array\n * @param {Array} array   A multi dimensional array\n * @param {boolean} isRectangular Optional. If the array is rectangular (not jagged)\n * @return {Array}        The flattened array (1 dimensional)\n */\nexport function flatten(array) {\n  var isRectangular = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n  if (!Array.isArray(array)) {\n    // if not an array, return as is\n    return array;\n  }\n  if (typeof isRectangular !== 'boolean') {\n    throw new TypeError('Boolean expected for second argument of flatten');\n  }\n  var flat = [];\n  if (isRectangular) {\n    _flattenRectangular(array);\n  } else {\n    _flatten(array);\n  }\n  return flat;\n  function _flatten(array) {\n    for (var i = 0; i < array.length; i++) {\n      var item = array[i];\n      if (Array.isArray(item)) {\n        _flatten(item);\n      } else {\n        flat.push(item);\n      }\n    }\n  }\n  function _flattenRectangular(array) {\n    if (Array.isArray(array[0])) {\n      for (var i = 0; i < array.length; i++) {\n        _flattenRectangular(array[i]);\n      }\n    } else {\n      for (var _i = 0; _i < array.length; _i++) {\n        flat.push(array[_i]);\n      }\n    }\n  }\n}\n\n/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\nexport function map(array, callback) {\n  return Array.prototype.map.call(array, callback);\n}\n\n/**\n * A safe forEach\n * @param {Array} array\n * @param {function} callback\n */\nexport function forEach(array, callback) {\n  Array.prototype.forEach.call(array, callback);\n}\n\n/**\n * A safe filter\n * @param {Array} array\n * @param {function} callback\n */\nexport function filter(array, callback) {\n  if (arraySize(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported');\n  }\n  return Array.prototype.filter.call(array, callback);\n}\n\n/**\n * Filter values in an array given a regular expression\n * @param {Array} array\n * @param {RegExp} regexp\n * @return {Array} Returns the filtered array\n * @private\n */\nexport function filterRegExp(array, regexp) {\n  if (arraySize(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported');\n  }\n  return Array.prototype.filter.call(array, entry => regexp.test(entry));\n}\n\n/**\n * A safe join\n * @param {Array} array\n * @param {string} separator\n */\nexport function join(array, separator) {\n  return Array.prototype.join.call(array, separator);\n}\n\n/**\n * Assign a numeric identifier to every element of a sorted array\n * @param {Array} a  An array\n * @return {Array} An array of objects containing the original value and its identifier\n */\nexport function identify(a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected');\n  }\n  if (a.length === 0) {\n    return a;\n  }\n  var b = [];\n  var count = 0;\n  b[0] = {\n    value: a[0],\n    identifier: 0\n  };\n  for (var i = 1; i < a.length; i++) {\n    if (a[i] === a[i - 1]) {\n      count++;\n    } else {\n      count = 0;\n    }\n    b.push({\n      value: a[i],\n      identifier: count\n    });\n  }\n  return b;\n}\n\n/**\n * Remove the numeric identifier from the elements\n * @param {array} a  An array\n * @return {array} An array of values without identifiers\n */\nexport function generalize(a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected');\n  }\n  if (a.length === 0) {\n    return a;\n  }\n  var b = [];\n  for (var i = 0; i < a.length; i++) {\n    b.push(a[i].value);\n  }\n  return b;\n}\n\n/**\n * Check the datatype of a given object\n * This is a low level implementation that should only be used by\n * parent Matrix classes such as SparseMatrix or DenseMatrix\n * This method does not validate Array Matrix shape\n * @param {Array} array\n * @param {function} typeOf   Callback function to use to determine the type of a value\n * @return {string}\n */\nexport function getArrayDataType(array, typeOf) {\n  var type; // to hold type info\n  var length = 0; // to hold length value to ensure it has consistent sizes\n\n  for (var i = 0; i < array.length; i++) {\n    var item = array[i];\n    var _isArray = Array.isArray(item);\n\n    // Saving the target matrix row size\n    if (i === 0 && _isArray) {\n      length = item.length;\n    }\n\n    // If the current item is an array but the length does not equal the targetVectorSize\n    if (_isArray && item.length !== length) {\n      return undefined;\n    }\n    var itemType = _isArray ? getArrayDataType(item, typeOf) // recurse into a nested array\n    : typeOf(item);\n    if (type === undefined) {\n      type = itemType; // first item\n    } else if (type !== itemType) {\n      return 'mixed';\n    } else {\n      // we're good, everything has the same type so far\n    }\n  }\n  return type;\n}\n\n/**\n * Return the last item from an array\n * @param {Array} array\n * @returns {*}\n */\nexport function last(array) {\n  return array[array.length - 1];\n}\n\n/**\n * Get all but the last element of array.\n * @param {Array} array\n * @returns {Array}\n */\nexport function initial(array) {\n  return array.slice(0, array.length - 1);\n}\n\n/**\n * Recursively concatenate two matrices.\n * The contents of the matrices are not cloned.\n * @param {Array} a             Multi dimensional array\n * @param {Array} b             Multi dimensional array\n * @param {number} concatDim    The dimension on which to concatenate (zero-based)\n * @param {number} dim          The current dim (zero-based)\n * @return {Array} c            The concatenated matrix\n * @private\n */\nfunction concatRecursive(a, b, concatDim, dim) {\n  if (dim < concatDim) {\n    // recurse into next dimension\n    if (a.length !== b.length) {\n      throw new DimensionError(a.length, b.length);\n    }\n    var c = [];\n    for (var i = 0; i < a.length; i++) {\n      c[i] = concatRecursive(a[i], b[i], concatDim, dim + 1);\n    }\n    return c;\n  } else {\n    // concatenate this dimension\n    return a.concat(b);\n  }\n}\n\n/**\n * Concatenates many arrays in the specified direction\n * @param {...Array} arrays All the arrays to concatenate\n * @param {number} concatDim The dimension on which to concatenate (zero-based)\n * @returns {Array}\n */\nexport function concat() {\n  var arrays = Array.prototype.slice.call(arguments, 0, -1);\n  var concatDim = Array.prototype.slice.call(arguments, -1);\n  if (arrays.length === 1) {\n    return arrays[0];\n  }\n  if (arrays.length > 1) {\n    return arrays.slice(1).reduce(function (A, B) {\n      return concatRecursive(A, B, concatDim, 0);\n    }, arrays[0]);\n  } else {\n    throw new Error('Wrong number of arguments in function concat');\n  }\n}\n\n/**\n * Receives two or more sizes and gets the broadcasted size for both.\n * @param  {...number[]} sizes Sizes to broadcast together\n * @returns {number[]} The broadcasted size\n */\nexport function broadcastSizes() {\n  for (var _len = arguments.length, sizes = new Array(_len), _key = 0; _key < _len; _key++) {\n    sizes[_key] = arguments[_key];\n  }\n  var dimensions = sizes.map(s => s.length);\n  var N = Math.max(...dimensions);\n  var sizeMax = new Array(N).fill(null);\n  // check for every size\n  for (var i = 0; i < sizes.length; i++) {\n    var size = sizes[i];\n    var dim = dimensions[i];\n    for (var j = 0; j < dim; j++) {\n      var n = N - dim + j;\n      if (size[j] > sizeMax[n]) {\n        sizeMax[n] = size[j];\n      }\n    }\n  }\n  for (var _i2 = 0; _i2 < sizes.length; _i2++) {\n    checkBroadcastingRules(sizes[_i2], sizeMax);\n  }\n  return sizeMax;\n}\n\n/**\n * Checks if it's possible to broadcast a size to another size\n * @param {number[]} size The size of the array to check\n * @param {number[]} toSize The size of the array to validate if it can be broadcasted to\n */\nexport function checkBroadcastingRules(size, toSize) {\n  var N = toSize.length;\n  var dim = size.length;\n  for (var j = 0; j < dim; j++) {\n    var n = N - dim + j;\n    if (size[j] < toSize[n] && size[j] > 1 || size[j] > toSize[n]) {\n      throw new Error(\"shape mismatch: mismatch is found in arg with shape (\".concat(size, \") not possible to broadcast dimension \").concat(dim, \" with size \").concat(size[j], \" to size \").concat(toSize[n]));\n    }\n  }\n}\n\n/**\n * Broadcasts a single array to a certain size\n * @param {Array} array Array to be broadcasted\n * @param {number[]} toSize Size to broadcast the array\n * @returns {Array} The broadcasted array\n */\nexport function broadcastTo(array, toSize) {\n  var Asize = arraySize(array);\n  if (deepStrictEqual(Asize, toSize)) {\n    return array;\n  }\n  checkBroadcastingRules(Asize, toSize);\n  var broadcastedSize = broadcastSizes(Asize, toSize);\n  var N = broadcastedSize.length;\n  var paddedSize = [...Array(N - Asize.length).fill(1), ...Asize];\n  var A = clone(array);\n  // reshape A if needed to make it ready for concat\n  if (Asize.length < N) {\n    A = reshape(A, paddedSize);\n    Asize = arraySize(A);\n  }\n\n  // stretches the array on each dimension to make it the same size as index\n  for (var dim = 0; dim < N; dim++) {\n    if (Asize[dim] < broadcastedSize[dim]) {\n      A = stretch(A, broadcastedSize[dim], dim);\n      Asize = arraySize(A);\n    }\n  }\n  return A;\n}\n\n/**\n * Broadcasts arrays and returns the broadcasted arrays in an array\n * @param  {...Array | any} arrays\n * @returns {Array[]} The broadcasted arrays\n */\nexport function broadcastArrays() {\n  for (var _len2 = arguments.length, arrays = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n    arrays[_key2] = arguments[_key2];\n  }\n  if (arrays.length === 0) {\n    throw new Error('Insufficient number of arguments in function broadcastArrays');\n  }\n  if (arrays.length === 1) {\n    return arrays[0];\n  }\n  var sizes = arrays.map(function (array) {\n    return arraySize(array);\n  });\n  var broadcastedSize = broadcastSizes(...sizes);\n  var broadcastedArrays = [];\n  arrays.forEach(function (array) {\n    broadcastedArrays.push(broadcastTo(array, broadcastedSize));\n  });\n  return broadcastedArrays;\n}\n\n/**\n * Stretches a matrix up to a certain size in a certain dimension\n * @param {Array} arrayToStretch\n * @param {number[]} sizeToStretch\n * @param {number} dimToStretch\n * @returns {Array} The stretched array\n */\nexport function stretch(arrayToStretch, sizeToStretch, dimToStretch) {\n  return concat(...Array(sizeToStretch).fill(arrayToStretch), dimToStretch);\n}\n\n/**\n* Retrieves a single element from an array given an index.\n*\n* @param {Array} array - The array from which to retrieve the value.\n* @param {Array<number>} index - An array of indices specifying the position of the desired element in each dimension.\n* @returns {*} - The value at the specified position in the array.\n*\n* @example\n* const arr = [[[1, 2], [3, 4]], [[5, 6], [7, 8]]];\n* const index = [1, 0, 1];\n* console.log(get(arr, index)); // 6\n*/\nexport function get(array, index) {\n  if (!Array.isArray(array)) {\n    throw new Error('Array expected');\n  }\n  var size = arraySize(array);\n  if (index.length !== size.length) {\n    throw new DimensionError(index.length, size.length);\n  }\n  for (var x = 0; x < index.length; x++) {\n    validateIndex(index[x], size[x]);\n  }\n  return index.reduce((acc, curr) => acc[curr], array);\n}\n\n/**\n * Recursively maps over each element of nested array using a provided callback function.\n *\n * @param {Array} array - The array to be mapped.\n * @param {Function} callback - The function to execute on each element, taking three arguments:\n *   - `value` (any): The current element being processed in the array.\n *   - `index` (Array<number>): The index of the current element being processed in the array.\n *   - `array` (Array): The array `deepMap` was called upon.\n * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.\n * @returns {Array} A new array with each element being the result of the callback function.\n */\nexport function deepMap(array, callback) {\n  var skipIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n  if (array.length === 0) {\n    return [];\n  }\n  if (skipIndex) {\n    return recursiveMap(array);\n  }\n  var index = [];\n  return recursiveMapWithIndex(array, 0);\n  function recursiveMapWithIndex(value, depth) {\n    if (Array.isArray(value)) {\n      var N = value.length;\n      var result = Array(N);\n      for (var i = 0; i < N; i++) {\n        index[depth] = i;\n        result[i] = recursiveMapWithIndex(value[i], depth + 1);\n      }\n      return result;\n    } else {\n      return callback(value, index.slice(0, depth), array);\n    }\n  }\n  function recursiveMap(value) {\n    if (Array.isArray(value)) {\n      var N = value.length;\n      var result = Array(N);\n      for (var i = 0; i < N; i++) {\n        result[i] = recursiveMap(value[i]);\n      }\n      return result;\n    } else {\n      return callback(value);\n    }\n  }\n}\n\n/**\n * Recursively iterates over each element in a multi-dimensional array and applies a callback function.\n *\n * @param {Array} array - The multi-dimensional array to iterate over.\n * @param {Function} callback - The function to execute for each element. It receives three arguments:\n *   - {any} value: The current element being processed in the array.\n *   - {Array<number>} index: The index of the current element in each dimension.\n *   - {Array} array: The original array being processed.\n * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.\n */\nexport function deepForEach(array, callback) {\n  var skipIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n  if (array.length === 0) {\n    return;\n  }\n  if (skipIndex) {\n    recursiveForEach(array);\n    return;\n  }\n  var index = [];\n  recursiveForEachWithIndex(array, 0);\n  function recursiveForEachWithIndex(value, depth) {\n    if (Array.isArray(value)) {\n      var N = value.length;\n      for (var i = 0; i < N; i++) {\n        index[depth] = i;\n        recursiveForEachWithIndex(value[i], depth + 1);\n      }\n    } else {\n      callback(value, index.slice(0, depth), array);\n    }\n  }\n  function recursiveForEach(value) {\n    if (Array.isArray(value)) {\n      var N = value.length;\n      for (var i = 0; i < N; i++) {\n        recursiveForEach(value[i]);\n      }\n    } else {\n      callback(value);\n    }\n  }\n}\n\n/**\n * Deep clones a multidimensional array\n * @param {Array} array\n * @returns {Array} cloned array\n */\nexport function clone(array) {\n  return _extends([], array);\n}","import { isBigNumber, isNumber } from '../is.js';\nimport { isInteger, normalizeFormatOptions } from '../number.js';\n\n/**\n * Formats a BigNumber in a given base\n * @param {BigNumber} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatBigNumberToBase(n, base, size) {\n  var BigNumberCtor = n.constructor;\n  var big2 = new BigNumberCtor(2);\n  var suffix = '';\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\n    }\n    if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {\n      throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n    }\n    if (!n.isInteger()) {\n      throw new Error('Value must be an integer');\n    }\n    if (n.lessThan(0)) {\n      n = n.add(big2.pow(size));\n    }\n    suffix = \"i\".concat(size);\n  }\n  switch (base) {\n    case 2:\n      return \"\".concat(n.toBinary()).concat(suffix);\n    case 8:\n      return \"\".concat(n.toOctal()).concat(suffix);\n    case 16:\n      return \"\".concat(n.toHexadecimal()).concat(suffix);\n    default:\n      throw new Error(\"Base \".concat(base, \" not supported \"));\n  }\n}\n\n/**\n * Convert a BigNumber to a formatted string representation.\n *\n * Syntax:\n *\n *    format(value)\n *    format(value, options)\n *    format(value, precision)\n *    format(value, fn)\n *\n * Where:\n *\n *    {number} value   The value to be formatted\n *    {Object} options An object with formatting options. Available options:\n *                     {string} notation\n *                         Number notation. Choose from:\n *                         'fixed'          Always use regular number notation.\n *                                          For example '123.40' and '14000000'\n *                         'exponential'    Always use exponential notation.\n *                                          For example '1.234e+2' and '1.4e+7'\n *                         'auto' (default) Regular number notation for numbers\n *                                          having an absolute value between\n *                                          `lower` and `upper` bounds, and uses\n *                                          exponential notation elsewhere.\n *                                          Lower bound is included, upper bound\n *                                          is excluded.\n *                                          For example '123.4' and '1.4e7'.\n *                         'bin', 'oct, or\n *                         'hex'            Format the number using binary, octal,\n *                                          or hexadecimal notation.\n *                                          For example '0b1101' and '0x10fe'.\n *                     {number} wordSize    The word size in bits to use for formatting\n *                                          in binary, octal, or hexadecimal notation.\n *                                          To be used only with 'bin', 'oct', or 'hex'\n *                                          values for 'notation' option. When this option\n *                                          is defined the value is formatted as a signed\n *                                          twos complement integer of the given word size\n *                                          and the size suffix is appended to the output.\n *                                          For example\n *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n *                                          Default value is undefined.\n *                     {number} precision   A number between 0 and 16 to round\n *                                          the digits of the number.\n *                                          In case of notations 'exponential',\n *                                          'engineering', and 'auto',\n *                                          `precision` defines the total\n *                                          number of significant digits returned.\n *                                          In case of notation 'fixed',\n *                                          `precision` defines the number of\n *                                          significant digits after the decimal\n *                                          point.\n *                                          `precision` is undefined by default.\n *                     {number} lowerExp    Exponent determining the lower boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `-3`.\n *                     {number} upperExp    Exponent determining the upper boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `5`.\n *    {Function} fn    A custom formatting function. Can be used to override the\n *                     built-in notations. Function `fn` is called with `value` as\n *                     parameter and must return a string. Is useful for example to\n *                     format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n *    format(6.4)                                        // '6.4'\n *    format(1240000)                                    // '1.24e6'\n *    format(1/3)                                        // '0.3333333333333333'\n *    format(1/3, 3)                                     // '0.333'\n *    format(21385, 2)                                   // '21000'\n *    format(12e8, {notation: 'fixed'})                  // returns '1200000000'\n *    format(2.3,    {notation: 'fixed', precision: 4})  // returns '2.3000'\n *    format(52.8,   {notation: 'exponential'})          // returns '5.28e+1'\n *    format(12400,  {notation: 'engineering'})          // returns '12.400e+3'\n *\n * @param {BigNumber} value\n * @param {Object | Function | number | BigNumber} [options]\n * @return {string} str The formatted value\n */\nexport function format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  }\n\n  // handle special cases\n  if (!value.isFinite()) {\n    return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';\n  }\n  var {\n    notation,\n    precision,\n    wordSize\n  } = normalizeFormatOptions(options);\n\n  // handle the various notations\n  switch (notation) {\n    case 'fixed':\n      return toFixed(value, precision);\n    case 'exponential':\n      return toExponential(value, precision);\n    case 'engineering':\n      return toEngineering(value, precision);\n    case 'bin':\n      return formatBigNumberToBase(value, 2, wordSize);\n    case 'oct':\n      return formatBigNumberToBase(value, 8, wordSize);\n    case 'hex':\n      return formatBigNumberToBase(value, 16, wordSize);\n    case 'auto':\n      {\n        // determine lower and upper bound for exponential notation.\n        // TODO: implement support for upper and lower to be BigNumbers themselves\n        var lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);\n        var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);\n\n        // handle special case zero\n        if (value.isZero()) return '0';\n\n        // determine whether or not to output exponential notation\n        var str;\n        var rounded = value.toSignificantDigits(precision);\n        var exp = rounded.e;\n        if (exp >= lowerExp && exp < upperExp) {\n          // normal number notation\n          str = rounded.toFixed();\n        } else {\n          // exponential notation\n          str = toExponential(value, precision);\n        }\n\n        // remove trailing zeros after the decimal point\n        return str.replace(/((\\.\\d*?)(0+))($|e)/, function () {\n          var digits = arguments[2];\n          var e = arguments[4];\n          return digits !== '.' ? digits + e : e;\n        });\n      }\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n  }\n}\n\n/**\n * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision]        Optional number of significant figures to return.\n */\nexport function toEngineering(value, precision) {\n  // find nearest lower multiple of 3 for exponent\n  var e = value.e;\n  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n\n  // find difference in exponents, and calculate the value without exponent\n  var valueWithoutExp = value.mul(Math.pow(10, -newExp));\n  var valueStr = valueWithoutExp.toPrecision(precision);\n  if (valueStr.includes('e')) {\n    var BigNumber = value.constructor;\n    valueStr = new BigNumber(valueStr).toFixed();\n  }\n  return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n}\n\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision]  Number of digits in formatted output.\n *                              If not provided, the maximum available digits\n *                              is used.\n * @returns {string} str\n */\nexport function toExponential(value, precision) {\n  if (precision !== undefined) {\n    return value.toExponential(precision - 1); // Note the offset of one\n  } else {\n    return value.toExponential();\n  }\n}\n\n/**\n * Format a number with fixed notation.\n * @param {BigNumber} value\n * @param {number} [precision=undefined] Optional number of decimals after the\n *                                       decimal point. Undefined by default.\n */\nexport function toFixed(value, precision) {\n  return value.toFixed(precision);\n}\nfunction _toNumberOrDefault(value, defaultValue) {\n  if (isNumber(value)) {\n    return value;\n  } else if (isBigNumber(value)) {\n    return value.toNumber();\n  } else {\n    return defaultValue;\n  }\n}","import { isBigNumber, isString, typeOf } from './is.js';\nimport { format as formatNumber } from './number.js';\nimport { format as formatBigNumber } from './bignumber/formatter.js';\n\n/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\n */\nexport function endsWith(text, search) {\n  var start = text.length - search.length;\n  var end = text.length;\n  return text.substring(start, end) === search;\n}\n\n/**\n * Format a value of any type into a string.\n *\n * Usage:\n *     math.format(value)\n *     math.format(value, precision)\n *     math.format(value, options)\n *\n * When value is a function:\n *\n * - When the function has a property `syntax`, it returns this\n *   syntax description.\n * - In other cases, a string `'function'` is returned.\n *\n * When `value` is an Object:\n *\n * - When the object contains a property `format` being a function, this\n *   function is invoked as `value.format(options)` and the result is returned.\n * - When the object has its own `toString` method, this method is invoked\n *   and the result is returned.\n * - In other cases the function will loop over all object properties and\n *   return JSON object notation like '{\"a\": 2, \"b\": 3}'.\n *\n * Example usage:\n *     math.format(2/7)                // '0.2857142857142857'\n *     math.format(math.pi, 3)         // '3.14'\n *     math.format(new Complex(2, 3))  // '2 + 3i'\n *     math.format('hello')            // '\"hello\"'\n *\n * @param {*} value             Value to be stringified\n * @param {Object | number | Function} [options]\n *     Formatting options. See src/utils/number.js:format for a\n *     description of the available options controlling number output.\n *     This generic \"format\" also supports the option property `truncate: NN`\n *     giving the maximum number NN of characters to return (if there would\n *     have been more, they are deleted and replaced by an ellipsis).\n * @return {string} str\n */\nexport function format(value, options) {\n  var result = _format(value, options);\n  if (options && typeof options === 'object' && 'truncate' in options && result.length > options.truncate) {\n    return result.substring(0, options.truncate - 3) + '...';\n  }\n  return result;\n}\nfunction _format(value, options) {\n  if (typeof value === 'number') {\n    return formatNumber(value, options);\n  }\n  if (isBigNumber(value)) {\n    return formatBigNumber(value, options);\n  }\n\n  // note: we use unsafe duck-typing here to check for Fractions, this is\n  // ok here since we're only invoking toString or concatenating its values\n  if (looksLikeFraction(value)) {\n    if (!options || options.fraction !== 'decimal') {\n      // output as ratio, like '1/3'\n      return \"\".concat(value.s * value.n, \"/\").concat(value.d);\n    } else {\n      // output as decimal, like '0.(3)'\n      return value.toString();\n    }\n  }\n  if (Array.isArray(value)) {\n    return formatArray(value, options);\n  }\n  if (isString(value)) {\n    return stringify(value);\n  }\n  if (typeof value === 'function') {\n    return value.syntax ? String(value.syntax) : 'function';\n  }\n  if (value && typeof value === 'object') {\n    if (typeof value.format === 'function') {\n      return value.format(options);\n    } else if (value && value.toString(options) !== {}.toString()) {\n      // this object has a non-native toString method, use that one\n      return value.toString(options);\n    } else {\n      var entries = Object.keys(value).map(key => {\n        return stringify(key) + ': ' + format(value[key], options);\n      });\n      return '{' + entries.join(', ') + '}';\n    }\n  }\n  return String(value);\n}\n\n/**\n * Stringify a value into a string enclosed in double quotes.\n * Unescaped double quotes and backslashes inside the value are escaped.\n * @param {*} value\n * @return {string}\n */\nexport function stringify(value) {\n  var text = String(value);\n  var escaped = '';\n  var i = 0;\n  while (i < text.length) {\n    var c = text.charAt(i);\n    escaped += c in controlCharacters ? controlCharacters[c] : c;\n    i++;\n  }\n  return '\"' + escaped + '\"';\n}\nvar controlCharacters = {\n  '\"': '\\\\\"',\n  '\\\\': '\\\\\\\\',\n  '\\b': '\\\\b',\n  '\\f': '\\\\f',\n  '\\n': '\\\\n',\n  '\\r': '\\\\r',\n  '\\t': '\\\\t'\n};\n\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\nexport function escape(value) {\n  var text = String(value);\n  text = text.replace(/&/g, '&amp;').replace(/\"/g, '&quot;').replace(/'/g, '&#39;').replace(/</g, '&lt;').replace(/>/g, '&gt;');\n  return text;\n}\n\n/**\n * Recursively format an n-dimensional matrix\n * Example output: \"[[1, 2], [3, 4]]\"\n * @param {Array} array\n * @param {Object | number | Function} [options]  Formatting options. See\n *                                                lib/utils/number:format for a\n *                                                description of the available\n *                                                options.\n * @returns {string} str\n */\nfunction formatArray(array, options) {\n  if (Array.isArray(array)) {\n    var str = '[';\n    var len = array.length;\n    for (var i = 0; i < len; i++) {\n      if (i !== 0) {\n        str += ', ';\n      }\n      str += formatArray(array[i], options);\n    }\n    str += ']';\n    return str;\n  } else {\n    return format(array, options);\n  }\n}\n\n/**\n * Check whether a value looks like a Fraction (unsafe duck-type check)\n * @param {*} value\n * @return {boolean}\n */\nfunction looksLikeFraction(value) {\n  return value && typeof value === 'object' && typeof value.s === 'bigint' && typeof value.n === 'bigint' && typeof value.d === 'bigint' || false;\n}\n\n/**\n * Compare two strings\n * @param {string} x\n * @param {string} y\n * @returns {number}\n */\nexport function compareText(x, y) {\n  // we don't want to convert numbers to string, only accept string input\n  if (!isString(x)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(x) + ', index: 0)');\n  }\n  if (!isString(y)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)');\n  }\n  return x === y ? 0 : x > y ? 1 : -1;\n}","/**\n * Create a range error with the message:\n *     'Dimension mismatch (<actual size> != <expected size>)'\n * @param {number | number[]} actual        The actual size\n * @param {number | number[]} expected      The expected size\n * @param {string} [relation='!=']          Optional relation between actual\n *                                          and expected size: '!=', '<', etc.\n * @extends RangeError\n */\nexport function DimensionError(actual, expected, relation) {\n  if (!(this instanceof DimensionError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\n  }\n  this.actual = actual;\n  this.expected = expected;\n  this.relation = relation;\n  this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';\n  this.stack = new Error().stack;\n}\nDimensionError.prototype = new RangeError();\nDimensionError.prototype.constructor = RangeError;\nDimensionError.prototype.name = 'DimensionError';\nDimensionError.prototype.isDimensionError = true;","/**\n * Create a range error with the message:\n *     'Index out of range (index < min)'\n *     'Index out of range (index < max)'\n *\n * @param {number} index     The actual index\n * @param {number} [min=0]   Minimum index (included)\n * @param {number} [max]     Maximum index (excluded)\n * @extends RangeError\n */\nexport function IndexError(index, min, max) {\n  if (!(this instanceof IndexError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\n  }\n  this.index = index;\n  if (arguments.length < 3) {\n    this.min = 0;\n    this.max = min;\n  } else {\n    this.min = min;\n    this.max = max;\n  }\n  if (this.min !== undefined && this.index < this.min) {\n    this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')';\n  } else if (this.max !== undefined && this.index >= this.max) {\n    this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')';\n  } else {\n    this.message = 'Index out of range (' + this.index + ')';\n  }\n  this.stack = new Error().stack;\n}\nIndexError.prototype = new RangeError();\nIndexError.prototype.constructor = RangeError;\nIndexError.prototype.name = 'IndexError';\nIndexError.prototype.isIndexError = true;","import typed from 'typed-function';\nimport { get, arraySize } from './array.js';\nimport { typeOf as _typeOf } from './is.js';\n\n/**\n * Simplifies a callback function by reducing its complexity and potentially improving its performance.\n *\n * @param {Function} callback The original callback function to simplify.\n * @param {Array|Matrix} array The array that will be used with the callback function.\n * @param {string} name The name of the function that is using the callback.\n * @param {boolean} isUnary If true, the callback function is unary and will be optimized as such.\n * @returns {Function} Returns a simplified version of the callback function.\n */\nexport function optimizeCallback(callback, array, name, isUnary) {\n  if (typed.isTypedFunction(callback)) {\n    var numberOfArguments;\n    if (isUnary) {\n      numberOfArguments = 1;\n    } else {\n      var size = array.isMatrix ? array.size() : arraySize(array);\n\n      // Check the size of the last dimension to see if the array/matrix is empty\n      var isEmpty = size.length ? size[size.length - 1] === 0 : true;\n      if (isEmpty) {\n        // don't optimize callbacks for empty arrays/matrix, as they will never be called\n        // and in fact will throw an exception when we try to access the first element below\n        return {\n          isUnary,\n          fn: callback\n        };\n      }\n      var firstIndex = size.map(() => 0);\n      var firstValue = array.isMatrix ? array.get(firstIndex) : get(array, firstIndex);\n      numberOfArguments = _findNumberOfArgumentsTyped(callback, firstValue, firstIndex, array);\n    }\n    var fastCallback;\n    if (array.isMatrix && array.dataType !== 'mixed' && array.dataType !== undefined) {\n      var singleSignature = _findSingleSignatureWithArity(callback, numberOfArguments);\n      fastCallback = singleSignature !== undefined ? singleSignature : callback;\n    } else {\n      fastCallback = callback;\n    }\n    if (numberOfArguments >= 1 && numberOfArguments <= 3) {\n      return {\n        isUnary: numberOfArguments === 1,\n        fn: function fn() {\n          for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n            args[_key] = arguments[_key];\n          }\n          return _tryFunctionWithArgs(fastCallback, args.slice(0, numberOfArguments), name, callback.name);\n        }\n      };\n    }\n    return {\n      isUnary: false,\n      fn: function fn() {\n        for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n          args[_key2] = arguments[_key2];\n        }\n        return _tryFunctionWithArgs(fastCallback, args, name, callback.name);\n      }\n    };\n  }\n  if (isUnary === undefined) {\n    return {\n      isUnary: _findIfCallbackIsUnary(callback),\n      fn: callback\n    };\n  } else {\n    return {\n      isUnary,\n      fn: callback\n    };\n  }\n}\nfunction _findSingleSignatureWithArity(callback, arity) {\n  var matchingFunctions = [];\n  Object.entries(callback.signatures).forEach(_ref => {\n    var [signature, func] = _ref;\n    if (signature.split(',').length === arity) {\n      matchingFunctions.push(func);\n    }\n  });\n  if (matchingFunctions.length === 1) {\n    return matchingFunctions[0];\n  }\n}\n\n/**\n * Determines if a given callback function is unary (i.e., takes exactly one argument).\n *\n * This function checks the following conditions to determine if the callback is unary:\n * 1. The callback function should have exactly one parameter.\n * 2. The callback function should not use the `arguments` object.\n * 3. The callback function should not use rest parameters (`...`).\n * If in doubt, this function shall return `false` to be safe\n *\n * @param {Function} callback - The callback function to be checked.\n * @returns {boolean} - Returns `true` if the callback is unary, otherwise `false`.\n */\nfunction _findIfCallbackIsUnary(callback) {\n  if (callback.length !== 1) return false;\n  var callbackStr = callback.toString();\n  // Check if the callback function uses `arguments`\n  if (/arguments/.test(callbackStr)) return false;\n\n  // Extract the parameters of the callback function\n  var paramsStr = callbackStr.match(/\\(.*?\\)/);\n  // Check if the callback function uses rest parameters\n  if (/\\.\\.\\./.test(paramsStr)) return false;\n  return true;\n}\nfunction _findNumberOfArgumentsTyped(callback, value, index, array) {\n  var testArgs = [value, index, array];\n  for (var i = 3; i > 0; i--) {\n    var args = testArgs.slice(0, i);\n    if (typed.resolve(callback, args) !== null) {\n      return i;\n    }\n  }\n}\n\n/**\n   * @param {function} func The selected function taken from one of the signatures of the callback function\n   * @param {Array} args List with arguments to apply to the selected signature\n   * @param {string} mappingFnName the name of the function that is using the callback\n   * @param {string} callbackName the name of the callback function\n   * @returns {*} Returns the return value of the invoked signature\n   * @throws {TypeError} Throws an error when no matching signature was found\n   */\nfunction _tryFunctionWithArgs(func, args, mappingFnName, callbackName) {\n  try {\n    return func(...args);\n  } catch (err) {\n    _createCallbackError(err, args, mappingFnName, callbackName);\n  }\n}\n\n/**\n * Creates and throws a detailed TypeError when a callback function fails.\n *\n * @param {Error} err The original error thrown by the callback function.\n * @param {Array} args The arguments that were passed to the callback function.\n * @param {string} mappingFnName The name of the function that is using the callback.\n * @param {string} callbackName The name of the callback function.\n * @throws {TypeError} Throws a detailed TypeError with enriched error message.\n */\nfunction _createCallbackError(err, args, mappingFnName, callbackName) {\n  var _err$data;\n  // Enrich the error message so the user understands that it took place inside the callback function\n  if (err instanceof TypeError && ((_err$data = err.data) === null || _err$data === void 0 ? void 0 : _err$data.category) === 'wrongType') {\n    var argsDesc = [];\n    argsDesc.push(\"value: \".concat(_typeOf(args[0])));\n    if (args.length >= 2) {\n      argsDesc.push(\"index: \".concat(_typeOf(args[1])));\n    }\n    if (args.length >= 3) {\n      argsDesc.push(\"array: \".concat(_typeOf(args[2])));\n    }\n    throw new TypeError(\"Function \".concat(mappingFnName, \" cannot apply callback arguments \") + \"\".concat(callbackName, \"(\").concat(argsDesc.join(', '), \") at index \").concat(JSON.stringify(args[1])));\n  } else {\n    throw new TypeError(\"Function \".concat(mappingFnName, \" cannot apply callback arguments \") + \"to function \".concat(callbackName, \": \").concat(err.message));\n  }\n}","// deno-lint-ignore-file no-this-alias\nimport { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, reshape, resize, unsqueeze, validate, validateIndex, broadcastTo, get } from '../../utils/array.js';\nimport { format } from '../../utils/string.js';\nimport { isInteger } from '../../utils/number.js';\nimport { clone, deepStrictEqual } from '../../utils/object.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { factory } from '../../utils/factory.js';\nimport { optimizeCallback } from '../../utils/optimizeCallback.js';\nvar name = 'DenseMatrix';\nvar dependencies = ['Matrix', 'config'];\nexport var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Matrix,\n    config\n  } = _ref;\n  /**\n   * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.\n   * @class DenseMatrix\n   * @enum {{ value, index: number[] }}\n   */\n  function DenseMatrix(data, datatype) {\n    if (!(this instanceof DenseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if (isMatrix(data)) {\n      // check data is a DenseMatrix\n      if (data.type === 'DenseMatrix') {\n        // clone data & size\n        this._data = clone(data._data);\n        this._size = clone(data._size);\n        this._datatype = datatype || data._datatype;\n      } else {\n        // build data from existing matrix\n        this._data = data.toArray();\n        this._size = data.size();\n        this._datatype = datatype || data._datatype;\n      }\n    } else if (data && isArray(data.data) && isArray(data.size)) {\n      // initialize fields from JSON representation\n      this._data = data.data;\n      this._size = data.size;\n      // verify the dimensions of the array\n      validate(this._data, this._size);\n      this._datatype = datatype || data.datatype;\n    } else if (isArray(data)) {\n      // replace nested Matrices with Arrays\n      this._data = preprocess(data);\n      // get the dimensions of the array\n      this._size = arraySize(this._data);\n      // verify the dimensions of the array, TODO: compute size while processing array\n      validate(this._data, this._size);\n      // data type unknown\n      this._datatype = datatype;\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');\n    } else {\n      // nothing provided\n      this._data = [];\n      this._size = [0];\n      this._datatype = datatype;\n    }\n  }\n  DenseMatrix.prototype = new Matrix();\n\n  /**\n   * Create a new DenseMatrix\n   */\n  DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(DenseMatrix, 'name', {\n    value: 'DenseMatrix'\n  });\n  DenseMatrix.prototype.constructor = DenseMatrix;\n  DenseMatrix.prototype.type = 'DenseMatrix';\n  DenseMatrix.prototype.isDenseMatrix = true;\n\n  /**\n   * Get the matrix type\n   *\n   * Usage:\n   *    const matrixType = matrix.getDataType()  // retrieves the matrix type\n   *\n   * @memberOf DenseMatrix\n   * @return {string}   type information; if multiple types are found from the Matrix, it will return \"mixed\"\n   */\n  DenseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._data, typeOf);\n  };\n\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()  // retrieve storage format\n   *\n   * @memberof DenseMatrix\n   * @return {string}           The storage format.\n   */\n  DenseMatrix.prototype.storage = function () {\n    return 'dense';\n  };\n\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()   // retrieve matrix datatype\n   *\n   * @memberof DenseMatrix\n   * @return {string}           The datatype.\n   */\n  DenseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n\n  /**\n   * Create a new DenseMatrix\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n  DenseMatrix.prototype.create = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @memberof DenseMatrix\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    switch (arguments.length) {\n      case 1:\n        return _get(this, index);\n\n      // intentional fall through\n      case 2:\n      case 3:\n        return _set(this, index, replacement, defaultValue);\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\n\n  /**\n   * Get a single element from the matrix.\n   * @memberof DenseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  DenseMatrix.prototype.get = function (index) {\n    return get(this._data, index);\n  };\n\n  /**\n   * Replace a single element in the matrix.\n   * @memberof DenseMatrix\n   * @param {number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {DenseMatrix} self\n   */\n  DenseMatrix.prototype.set = function (index, value, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length < this._size.length) {\n      throw new DimensionError(index.length, this._size.length, '<');\n    }\n    var i, ii, indexI;\n\n    // enlarge matrix when needed\n    var size = index.map(function (i) {\n      return i + 1;\n    });\n    _fit(this, size, defaultValue);\n\n    // traverse over the dimensions\n    var data = this._data;\n    for (i = 0, ii = index.length - 1; i < ii; i++) {\n      indexI = index[i];\n      validateIndex(indexI, data.length);\n      data = data[indexI];\n    }\n\n    // set new value\n    indexI = index[index.length - 1];\n    validateIndex(indexI, data.length);\n    data[indexI] = value;\n    return this;\n  };\n\n  /**\n   * Get a submatrix of this matrix\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix\n   * @param {Index} index   Zero-based index\n   * @private\n   */\n  function _get(matrix, index) {\n    if (!isIndex(index)) {\n      throw new TypeError('Invalid index');\n    }\n    var isScalar = config.legacySubset ? index.size().every(idx => idx === 1) : index.isScalar();\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(index.min());\n    } else {\n      // validate dimensions\n      var size = index.size();\n      if (size.length !== matrix._size.length) {\n        throw new DimensionError(size.length, matrix._size.length);\n      }\n\n      // validate if any of the ranges in the index is out of range\n      var min = index.min();\n      var max = index.max();\n      for (var i = 0, ii = matrix._size.length; i < ii; i++) {\n        validateIndex(min[i], matrix._size[i]);\n        validateIndex(max[i], matrix._size[i]);\n      }\n\n      // retrieve submatrix\n      var returnMatrix = new DenseMatrix();\n      var submatrix = _getSubmatrix(matrix._data, index);\n      returnMatrix._size = submatrix.size;\n      returnMatrix._datatype = matrix._datatype;\n      returnMatrix._data = submatrix.data;\n      return config.legacySubset ? returnMatrix.reshape(index.size()) : returnMatrix;\n    }\n  }\n\n  /**\n   * Get a submatrix of a multi dimensional matrix.\n   * Index is not checked for correct number or length of dimensions.\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {Index} index\n   * @return {Array} submatrix\n   * @private\n   */\n  function _getSubmatrix(data, index) {\n    var maxDepth = index.size().length - 1;\n    var size = Array(maxDepth);\n    return {\n      data: getSubmatrixRecursive(data),\n      size: size.filter(x => x !== null)\n    };\n    function getSubmatrixRecursive(data) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      var dims = index.dimension(depth);\n      function _mapIndex(dim, callback) {\n        // applies a callback for when the index is a Number or a Matrix\n        if (isNumber(dim)) return callback(dim);else return dim.map(callback).valueOf();\n      }\n      if (isNumber(dims)) {\n        size[depth] = null;\n      } else {\n        size[depth] = dims.size()[0];\n      }\n      if (depth < maxDepth) {\n        return _mapIndex(dims, dimIndex => {\n          validateIndex(dimIndex, data.length);\n          return getSubmatrixRecursive(data[dimIndex], depth + 1);\n        });\n      } else {\n        return _mapIndex(dims, dimIndex => {\n          validateIndex(dimIndex, data.length);\n          return data[dimIndex];\n        });\n      }\n    }\n  }\n\n  /**\n   * Replace a submatrix in this matrix\n   * Indexes are zero-based.\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix\n   * @param {Index} index\n   * @param {DenseMatrix | Array | *} submatrix\n   * @param {*} defaultValue          Default value, filled in on new entries when\n   *                                  the matrix is resized.\n   * @return {DenseMatrix} matrix\n   * @private\n   */\n  function _set(matrix, index, submatrix, defaultValue) {\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index');\n    }\n\n    // get index size and check whether the index contains a single value\n    var iSize = index.size();\n    var isScalar = index.isScalar();\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    var submatrixSize;\n    if (isMatrix(submatrix)) {\n      submatrixSize = submatrix.size();\n      submatrix = submatrix.valueOf();\n    } else {\n      submatrixSize = arraySize(submatrix);\n    }\n    if (isScalar) {\n      // set a scalar\n\n      // check whether submatrix is a scalar\n      if (submatrixSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n      matrix.set(index.min(), submatrix, defaultValue);\n    } else {\n      // set a submatrix\n\n      // broadcast submatrix\n      if (!deepStrictEqual(submatrixSize, iSize)) {\n        if (submatrixSize.length === 0) {\n          submatrix = broadcastTo([submatrix], iSize);\n        } else {\n          try {\n            submatrix = broadcastTo(submatrix, iSize);\n          } catch (error) {}\n        }\n        submatrixSize = arraySize(submatrix);\n      }\n\n      // validate dimensions\n      if (iSize.length < matrix._size.length) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<');\n      }\n      if (submatrixSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n        while (iSize[i] === 1 && submatrixSize[i] === 1) {\n          i++;\n        }\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        }\n\n        // unsqueeze both outer and inner dimensions\n        submatrix = unsqueeze(submatrix, iSize.length, outer, submatrixSize);\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!deepStrictEqual(iSize, submatrixSize)) {\n        throw new DimensionError(iSize, submatrixSize, '>');\n      }\n\n      // enlarge matrix when needed\n      var size = index.max().map(function (i) {\n        return i + 1;\n      });\n      _fit(matrix, size, defaultValue);\n\n      // insert the sub matrix\n      _setSubmatrix(matrix._data, index, submatrix);\n    }\n    return matrix;\n  }\n\n  /**\n   * Replace a submatrix of a multi dimensional matrix.\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {Index} index\n   * @param {Array} submatrix\n   * @private\n   */\n  function _setSubmatrix(data, index, submatrix) {\n    var maxDepth = index.size().length - 1;\n    setSubmatrixRecursive(data, submatrix);\n    function setSubmatrixRecursive(data, submatrix) {\n      var depth = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;\n      var range = index.dimension(depth);\n      var recursiveCallback = (rangeIndex, i) => {\n        validateIndex(rangeIndex, data.length);\n        setSubmatrixRecursive(data[rangeIndex], submatrix[i[0]], depth + 1);\n      };\n      var finalCallback = (rangeIndex, i) => {\n        validateIndex(rangeIndex, data.length);\n        data[rangeIndex] = submatrix[i[0]];\n      };\n      if (depth < maxDepth) {\n        if (isNumber(range)) recursiveCallback(range, [0]);else range.forEach(recursiveCallback);\n      } else {\n        if (isNumber(range)) finalCallback(range, [0]);else range.forEach(finalCallback);\n      }\n    }\n  }\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @memberof DenseMatrix\n   * @param {number[] || Matrix} size The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  DenseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!isCollection(size)) {\n      throw new TypeError('Array or Matrix expected');\n    }\n\n    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n    var sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    });\n\n    // matrix to resize\n    var m = copy ? this.clone() : this;\n    // resize matrix\n    return _resize(m, sizeArray, defaultValue);\n  };\n  function _resize(matrix, size, defaultValue) {\n    // check size\n    if (size.length === 0) {\n      // first value in matrix\n      var v = matrix._data;\n      // go deep\n      while (isArray(v)) {\n        v = v[0];\n      }\n      return v;\n    }\n    // resize matrix\n    matrix._size = size.slice(0); // copy the array\n    matrix._data = resize(matrix._data, matrix._size, defaultValue);\n    // return matrix\n    return matrix;\n  }\n\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * NOTE: This might be better suited to copy by default, instead of modifying\n   *       in place. For now, it operates in place to remain consistent with\n   *       resize().\n   *\n   * @memberof DenseMatrix\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  DenseMatrix.prototype.reshape = function (size, copy) {\n    var m = copy ? this.clone() : this;\n    m._data = reshape(m._data, size);\n    var currentLength = m._size.reduce((length, size) => length * size);\n    m._size = processSizesWildcard(size, currentLength);\n    return m;\n  };\n\n  /**\n   * Enlarge the matrix when it is smaller than given size.\n   * If the matrix is larger or equal sized, nothing is done.\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix           The matrix to be resized\n   * @param {number[]} size\n   * @param {*} defaultValue          Default value, filled in on new entries.\n   * @private\n   */\n  function _fit(matrix, size, defaultValue) {\n    var\n    // copy the array\n    newSize = matrix._size.slice(0);\n    var changed = false;\n\n    // add dimensions when needed\n    while (newSize.length < size.length) {\n      newSize.push(0);\n      changed = true;\n    }\n\n    // enlarge size when needed\n    for (var i = 0, ii = size.length; i < ii; i++) {\n      if (size[i] > newSize[i]) {\n        newSize[i] = size[i];\n        changed = true;\n      }\n    }\n    if (changed) {\n      // resize only when size is changed\n      _resize(matrix, newSize, defaultValue);\n    }\n  }\n\n  /**\n   * Create a clone of the matrix\n   * @memberof DenseMatrix\n   * @return {DenseMatrix} clone\n   */\n  DenseMatrix.prototype.clone = function () {\n    var m = new DenseMatrix({\n      data: clone(this._data),\n      size: clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof DenseMatrix\n   * @returns {number[]} size\n   */\n  DenseMatrix.prototype.size = function () {\n    return this._size.slice(0); // return a clone of _size\n  };\n\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @memberof DenseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} skipZeros   If true, the callback function is invoked only for non-zero entries\n   * @param {boolean} isUnary     If true, the callback function is invoked with one parameter\n   *\n   * @return {DenseMatrix} matrix\n   */\n  DenseMatrix.prototype.map = function (callback) {\n    var skipZeros = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n    var isUnary = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n    var me = this;\n    var maxDepth = me._size.length - 1;\n    if (maxDepth < 0) return me.clone();\n    var fastCallback = optimizeCallback(callback, me, 'map', isUnary);\n    var fastCallbackFn = fastCallback.fn;\n    var result = me.create(undefined, me._datatype);\n    result._size = me._size;\n    if (isUnary || fastCallback.isUnary) {\n      result._data = iterateUnary(me._data);\n      return result;\n    }\n    if (maxDepth === 0) {\n      var inputData = me.valueOf();\n      var data = Array(inputData.length);\n      for (var i = 0; i < inputData.length; i++) {\n        data[i] = fastCallbackFn(inputData[i], [i], me);\n      }\n      result._data = data;\n      return result;\n    }\n    var index = [];\n    result._data = iterate(me._data);\n    return result;\n    function iterate(data) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      var result = Array(data.length);\n      if (depth < maxDepth) {\n        for (var _i = 0; _i < data.length; _i++) {\n          index[depth] = _i;\n          result[_i] = iterate(data[_i], depth + 1);\n        }\n      } else {\n        for (var _i2 = 0; _i2 < data.length; _i2++) {\n          index[depth] = _i2;\n          result[_i2] = fastCallbackFn(data[_i2], index.slice(), me);\n        }\n      }\n      return result;\n    }\n    function iterateUnary(data) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      var result = Array(data.length);\n      if (depth < maxDepth) {\n        for (var _i3 = 0; _i3 < data.length; _i3++) {\n          result[_i3] = iterateUnary(data[_i3], depth + 1);\n        }\n      } else {\n        for (var _i4 = 0; _i4 < data.length; _i4++) {\n          result[_i4] = fastCallbackFn(data[_i4]);\n        }\n      }\n      return result;\n    }\n  };\n\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @memberof DenseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} skipZeros   If true, the callback function is invoked only for non-zero entries\n   * @param {boolean} isUnary     If true, the callback function is invoked with one parameter\n   */\n  DenseMatrix.prototype.forEach = function (callback) {\n    var skipZeros = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n    var isUnary = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n    var me = this;\n    var maxDepth = me._size.length - 1;\n    if (maxDepth < 0) return;\n    var fastCallback = optimizeCallback(callback, me, 'map', isUnary);\n    var fastCallbackFn = fastCallback.fn;\n    if (isUnary || fastCallback.isUnary) {\n      iterateUnary(me._data);\n      return;\n    }\n    if (maxDepth === 0) {\n      for (var i = 0; i < me._data.length; i++) {\n        fastCallbackFn(me._data[i], [i], me);\n      }\n      return;\n    }\n    var index = [];\n    iterate(me._data);\n    function iterate(data) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      if (depth < maxDepth) {\n        for (var _i5 = 0; _i5 < data.length; _i5++) {\n          index[depth] = _i5;\n          iterate(data[_i5], depth + 1);\n        }\n      } else {\n        for (var _i6 = 0; _i6 < data.length; _i6++) {\n          index[depth] = _i6;\n          fastCallbackFn(data[_i6], index.slice(), me);\n        }\n      }\n    }\n    function iterateUnary(data) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      if (depth < maxDepth) {\n        for (var _i7 = 0; _i7 < data.length; _i7++) {\n          iterateUnary(data[_i7], depth + 1);\n        }\n      } else {\n        for (var _i8 = 0; _i8 < data.length; _i8++) {\n          fastCallbackFn(data[_i8]);\n        }\n      }\n    }\n  };\n\n  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  DenseMatrix.prototype[Symbol.iterator] = function* () {\n    var maxDepth = this._size.length - 1;\n    if (maxDepth < 0) {\n      return;\n    }\n    if (maxDepth === 0) {\n      for (var i = 0; i < this._data.length; i++) {\n        yield {\n          value: this._data[i],\n          index: [i]\n        };\n      }\n      return;\n    }\n\n    // Multi-dimensional matrix: iterate over all elements\n    var index = Array(maxDepth + 1).fill(0);\n    var totalElements = this._size.reduce((a, b) => a * b, 1);\n    for (var count = 0; count < totalElements; count++) {\n      // Traverse to the current element using indices\n      var current = this._data;\n      for (var d = 0; d < maxDepth; d++) {\n        current = current[index[d]];\n      }\n      yield {\n        value: current[index[maxDepth]],\n        index: index.slice()\n      };\n\n      // Increment indices for next element\n      for (var _d = maxDepth; _d >= 0; _d--) {\n        index[_d]++;\n        if (index[_d] < this._size[_d]) break;\n        index[_d] = 0;\n      }\n    }\n  };\n\n  /**\n   * Returns an array containing the rows of a 2D matrix\n   * @returns {Array<Matrix>}\n   */\n  DenseMatrix.prototype.rows = function () {\n    var result = [];\n    var s = this.size();\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.');\n    }\n    var data = this._data;\n    for (var row of data) {\n      result.push(new DenseMatrix([row], this._datatype));\n    }\n    return result;\n  };\n\n  /**\n   * Returns an array containing the columns of a 2D matrix\n   * @returns {Array<Matrix>}\n   */\n  DenseMatrix.prototype.columns = function () {\n    var _this = this;\n    var result = [];\n    var s = this.size();\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.');\n    }\n    var data = this._data;\n    var _loop = function _loop(i) {\n      var col = data.map(row => [row[i]]);\n      result.push(new DenseMatrix(col, _this._datatype));\n    };\n    for (var i = 0; i < s[1]; i++) {\n      _loop(i);\n    }\n    return result;\n  };\n\n  /**\n   * Create an Array with a copy of the data of the DenseMatrix\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n  DenseMatrix.prototype.toArray = function () {\n    return clone(this._data);\n  };\n\n  /**\n   * Get the primitive value of the DenseMatrix: a multidimensional array\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n  DenseMatrix.prototype.valueOf = function () {\n    return this._data;\n  };\n\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @memberof DenseMatrix\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  DenseMatrix.prototype.format = function (options) {\n    return format(this._data, options);\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {string} str\n   */\n  DenseMatrix.prototype.toString = function () {\n    return format(this._data);\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {Object}\n   */\n  DenseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'DenseMatrix',\n      data: this._data,\n      size: this._size,\n      datatype: this._datatype\n    };\n  };\n\n  /**\n   * Get the kth Matrix diagonal.\n   *\n   * @memberof DenseMatrix\n   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.\n   *\n   * @returns {Matrix}                     The matrix with the diagonal values.\n   */\n  DenseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // number diagonal values\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // x is a matrix get diagonal from matrix\n    var data = [];\n\n    // loop rows\n    for (var i = 0; i < n; i++) {\n      data[i] = this._data[i + kSub][i + kSuper];\n    }\n\n    // create DenseMatrix\n    return new DenseMatrix({\n      data,\n      size: [n],\n      datatype: this._datatype\n    });\n  };\n\n  /**\n   * Create a diagonal matrix.\n   *\n   * @memberof DenseMatrix\n   * @param {Array} size                     The matrix size.\n   * @param {number | Matrix | Array } value The values for the diagonal.\n   * @param {number | BigNumber} [k=0]       The kth diagonal where the vector will be filled in.\n   * @param {number} [defaultValue]          The default value for non-diagonal\n   * @param {string} [datatype]              The datatype for the diagonal\n   *\n   * @returns {DenseMatrix}\n   */\n  DenseMatrix.diagonal = function (size, value, k, defaultValue) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // map size & validate\n    size = size.map(function (s) {\n      // check it is a big number\n      if (isBigNumber(s)) {\n        // convert it\n        s = s.toNumber();\n      }\n      // validate arguments\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n      return s;\n    });\n\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n\n    // number of non-zero items\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // value extraction function\n    var _value;\n\n    // check value\n    if (isArray(value)) {\n      // validate array\n      if (value.length !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid value array length');\n      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if (isMatrix(value)) {\n      // matrix size\n      var ms = value.size();\n      // validate matrix\n      if (ms.length !== 1 || ms[0] !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid matrix length');\n      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value.get([i]);\n      };\n    } else {\n      // define function\n      _value = function _value() {\n        // return value\n        return value;\n      };\n    }\n\n    // discover default value if needed\n    if (!defaultValue) {\n      // check first value in array\n      defaultValue = isBigNumber(_value(0)) ? _value(0).mul(0) // trick to create a BigNumber with value zero\n      : 0;\n    }\n\n    // empty array\n    var data = [];\n\n    // check we need to resize array\n    if (size.length > 0) {\n      // resize array\n      data = resize(data, size, defaultValue);\n      // fill diagonal\n      for (var d = 0; d < n; d++) {\n        data[d + kSub][d + kSuper] = _value(d);\n      }\n    }\n\n    // create DenseMatrix\n    return new DenseMatrix({\n      data,\n      size: [rows, columns]\n    });\n  };\n\n  /**\n   * Generate a matrix from a JSON object\n   * @memberof DenseMatrix\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"DenseMatrix\", data: [], size: []}`,\n   *                       where mathjs is optional\n   * @returns {DenseMatrix}\n   */\n  DenseMatrix.fromJSON = function (json) {\n    return new DenseMatrix(json);\n  };\n\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @memberof DenseMatrix\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n  DenseMatrix.prototype.swapRows = function (i, j) {\n    // check index\n    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {\n      throw new Error('Row index must be positive integers');\n    }\n    // check dimensions\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    // validate index\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]);\n\n    // swap rows\n    DenseMatrix._swapRows(i, j, this._data);\n    // return current instance\n    return this;\n  };\n\n  /**\n   * Swap rows i and j in Dense Matrix data structure.\n   *\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   * @param {Array} data     Matrix data\n   */\n  DenseMatrix._swapRows = function (i, j, data) {\n    // swap values i <-> j\n    var vi = data[i];\n    data[i] = data[j];\n    data[j] = vi;\n  };\n\n  /**\n   * Preprocess data, which can be an Array or DenseMatrix with nested Arrays and\n   * Matrices. Clones all (nested) Arrays, and replaces all nested Matrices with Arrays\n   * @memberof DenseMatrix\n   * @param {Array | Matrix} data\n   * @return {Array} data\n   */\n  function preprocess(data) {\n    if (isMatrix(data)) {\n      return preprocess(data.valueOf());\n    }\n    if (isArray(data)) {\n      return data.map(preprocess);\n    }\n    return data;\n  }\n  return DenseMatrix;\n}, {\n  isClass: true\n});","/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\nexport function _switch(mat) {\n  var I = mat.length;\n  var J = mat[0].length;\n  var i, j;\n  var ret = [];\n  for (j = 0; j < J; j++) {\n    var tmp = [];\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j]);\n    }\n    ret.push(tmp);\n  }\n  return ret;\n}","import { isCollection, isMatrix } from './is.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { arraySize, deepMap as arrayDeepMap, deepForEach as arrayDeepForEach } from './array.js';\nimport { _switch } from './switch.js';\n\n/**\n * Test whether an array contains collections\n * @param {Array} array\n * @returns {boolean} Returns true when the array contains one or multiple\n *                    collections (Arrays or Matrices). Returns false otherwise.\n */\nexport function containsCollections(array) {\n  for (var i = 0; i < array.length; i++) {\n    if (isCollection(array[i])) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Recursively loop over all elements in a given multi dimensional array\n * and invoke the callback on each of the elements.\n * @param {Array | Matrix} array\n * @param {Function} callback     The callback method is invoked with one\n *                                parameter: the current element in the array\n */\nexport function deepForEach(array, callback) {\n  if (isMatrix(array)) {\n    array.forEach(x => callback(x), false, true);\n  } else {\n    arrayDeepForEach(array, callback, true);\n  }\n}\n\n/**\n * Execute the callback function element wise for each element in array and any\n * nested array\n * Returns an array with the results\n * @param {Array | Matrix} array\n * @param {Function} callback   The callback is called with two parameters:\n *                              value1 and value2, which contain the current\n *                              element of both arrays.\n * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n *\n * @return {Array | Matrix} res\n */\nexport function deepMap(array, callback, skipZeros) {\n  if (!skipZeros) {\n    if (isMatrix(array)) {\n      return array.map(x => callback(x), false, true);\n    } else {\n      return arrayDeepMap(array, callback, true);\n    }\n  }\n  var skipZerosCallback = x => x === 0 ? x : callback(x);\n  if (isMatrix(array)) {\n    return array.map(x => skipZerosCallback(x), false, true);\n  } else {\n    return arrayDeepMap(array, skipZerosCallback, true);\n  }\n}\n\n/**\n * Reduce a given matrix or array to a new matrix or\n * array with one less dimension, applying the given\n * callback in the selected dimension.\n * @param {Array | Matrix} mat\n * @param {number} dim\n * @param {Function} callback\n * @return {Array | Matrix} res\n */\nexport function reduce(mat, dim, callback) {\n  var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n  if (dim < 0 || dim >= size.length) {\n    // TODO: would be more clear when throwing a DimensionError here\n    throw new IndexError(dim, size.length);\n  }\n  if (isMatrix(mat)) {\n    return mat.create(_reduce(mat.valueOf(), dim, callback), mat.datatype());\n  } else {\n    return _reduce(mat, dim, callback);\n  }\n}\n\n/**\n * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\nfunction _reduce(mat, dim, callback) {\n  var i, ret, val, tran;\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      val = mat[0];\n      for (i = 1; i < mat.length; i++) {\n        val = callback(val, mat[i]);\n      }\n      return val;\n    } else {\n      tran = _switch(mat);\n      ret = [];\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _reduce(tran[i], dim - 1, callback);\n      }\n      return ret;\n    }\n  } else {\n    ret = [];\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _reduce(mat[i], dim - 1, callback);\n    }\n    return ret;\n  }\n}\n\n// TODO: document function scatter\nexport function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {\n  // a arrays\n  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr;\n\n  // vars\n  var k, k0, k1, i;\n\n  // check we need to process values (pattern matrix)\n  if (x) {\n    // values in j\n    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n      // row\n      i = aindex[k];\n      // check value exists in current j\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark;\n        // add i to pattern of C\n        cindex.push(i);\n        // x(i) = A, check we need to call function this time\n        if (update) {\n          // copy value to workspace calling callback function\n          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]);\n          // function was called on current row\n          u[i] = mark;\n        } else {\n          // copy value to workspace\n          x[i] = avalues[k];\n        }\n      } else {\n        // i exists in C already\n        x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k]);\n        // function was called on current row\n        u[i] = mark;\n      }\n    }\n  } else {\n    // values in j\n    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n      // row\n      i = aindex[k];\n      // check value exists in current j\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark;\n        // add i to pattern of C\n        cindex.push(i);\n      } else {\n        // indicate function was called on current row\n        u[i] = mark;\n      }\n    }\n  }\n}","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isInteger';\nvar dependencies = ['typed', 'equal'];\nexport var createIsInteger = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equal\n  } = _ref;\n  /**\n   * Test whether a value is an integer number.\n   * The function supports `number`, `BigNumber`, and `Fraction`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isInteger(x)\n   *\n   * Examples:\n   *\n   *    math.isInteger(2)                     // returns true\n   *    math.isInteger(0)                     // returns true\n   *    math.isInteger(0.5)                   // returns false\n   *    math.isInteger(math.bignumber(500))   // returns true\n   *    math.isInteger(math.fraction(4))      // returns true\n   *    math.isInteger('3')                   // returns true\n   *    math.isInteger([3, 0.5, -2])          // returns [true, false, true]\n   *    math.isInteger(math.complex('2-4i'))  // throws TypeError\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isNegative, isZero\n   *\n   * @param {number | BigNumber | bigint | Fraction | Array | Matrix} x   Value to be tested\n   * @return {boolean}  Returns true when `x` contains a numeric, integer value.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: n => Number.isFinite(n) ? equal(n, Math.round(n)) : false,\n    BigNumber: b => b.isFinite() ? equal(b.round(), b) : false,\n    bigint: b => true,\n    Fraction: r => r.d === 1n,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { cbrt, expm1, isInteger, log10, log1p, log2, sign, toFixed } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function absNumber(a) {\n  return Math.abs(a);\n}\nabsNumber.signature = n1;\nexport function addNumber(a, b) {\n  return a + b;\n}\naddNumber.signature = n2;\nexport function subtractNumber(a, b) {\n  return a - b;\n}\nsubtractNumber.signature = n2;\nexport function multiplyNumber(a, b) {\n  return a * b;\n}\nmultiplyNumber.signature = n2;\nexport function divideNumber(a, b) {\n  return a / b;\n}\ndivideNumber.signature = n2;\nexport function unaryMinusNumber(x) {\n  return -x;\n}\nunaryMinusNumber.signature = n1;\nexport function unaryPlusNumber(x) {\n  return x;\n}\nunaryPlusNumber.signature = n1;\nexport function cbrtNumber(x) {\n  return cbrt(x);\n}\ncbrtNumber.signature = n1;\nexport function cubeNumber(x) {\n  return x * x * x;\n}\ncubeNumber.signature = n1;\nexport function expNumber(x) {\n  return Math.exp(x);\n}\nexpNumber.signature = n1;\nexport function expm1Number(x) {\n  return expm1(x);\n}\nexpm1Number.signature = n1;\n\n/**\n * Calculate gcd for numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the greatest common denominator of a and b\n */\nexport function gcdNumber(a, b) {\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function gcd must be integer numbers');\n  }\n\n  // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  var r;\n  while (b !== 0) {\n    r = a % b;\n    a = b;\n    b = r;\n  }\n  return a < 0 ? -a : a;\n}\ngcdNumber.signature = n2;\n\n/**\n * Calculate lcm for two numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the least common multiple of a and b\n */\nexport function lcmNumber(a, b) {\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function lcm must be integer numbers');\n  }\n  if (a === 0 || b === 0) {\n    return 0;\n  }\n\n  // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  // evaluate lcm here inline to reduce overhead\n  var t;\n  var prod = a * b;\n  while (b !== 0) {\n    t = b;\n    b = a % t;\n    a = t;\n  }\n  return Math.abs(prod / a);\n}\nlcmNumber.signature = n2;\n\n/**\n * Calculate the logarithm of a value, optionally to a given base.\n * @param {number} x\n * @param {number | null | undefined} base\n * @return {number}\n */\nexport function logNumber(x, y) {\n  if (y) {\n    return Math.log(x) / Math.log(y);\n  }\n  return Math.log(x);\n}\n\n/**\n * Calculate the 10-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log10Number(x) {\n  return log10(x);\n}\nlog10Number.signature = n1;\n\n/**\n * Calculate the 2-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log2Number(x) {\n  return log2(x);\n}\nlog2Number.signature = n1;\n\n/**\n * Calculate the natural logarithm of a `number+1`\n * @param {number} x\n * @returns {number}\n */\nexport function log1pNumber(x) {\n  return log1p(x);\n}\nlog1pNumber.signature = n1;\n\n/**\n * Calculate the modulus of two numbers\n * @param {number} x\n * @param {number} y\n * @returns {number} res\n * @private\n */\nexport function modNumber(x, y) {\n  // We don't use JavaScript's % operator here as this doesn't work\n  // correctly for x < 0 and x === 0\n  // see https://en.wikipedia.org/wiki/Modulo_operation\n  return y === 0 ? x : x - y * Math.floor(x / y);\n}\nmodNumber.signature = n2;\n\n/**\n * Calculate the nth root of a, solve x^root == a\n * http://rosettacode.org/wiki/Nth_root#JavaScript\n * @param {number} a\n * @param {number} [2] root\n * @private\n */\nexport function nthRootNumber(a) {\n  var root = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;\n  var inv = root < 0;\n  if (inv) {\n    root = -root;\n  }\n  if (root === 0) {\n    throw new Error('Root must be non-zero');\n  }\n  if (a < 0 && Math.abs(root) % 2 !== 1) {\n    throw new Error('Root must be odd when a is negative.');\n  }\n\n  // edge cases zero and infinity\n  if (a === 0) {\n    return inv ? Infinity : 0;\n  }\n  if (!isFinite(a)) {\n    return inv ? 0 : a;\n  }\n  var x = Math.pow(Math.abs(a), 1 / root);\n  // If a < 0, we require that root is an odd integer,\n  // so (-1) ^ (1/root) = -1\n  x = a < 0 ? -x : x;\n  return inv ? 1 / x : x;\n\n  // Very nice algorithm, but fails with nthRoot(-2, 3).\n  // Newton's method has some well-known problems at times:\n  // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis\n  /*\n  let x = 1 // Initial guess\n  let xPrev = 1\n  let i = 0\n  const iMax = 10000\n  do {\n    const delta = (a / Math.pow(x, root - 1) - x) / root\n    xPrev = x\n    x = x + delta\n    i++\n  }\n  while (xPrev !== x && i < iMax)\n   if (xPrev !== x) {\n    throw new Error('Function nthRoot failed to converge')\n  }\n   return inv ? 1 / x : x\n  */\n}\nexport function signNumber(x) {\n  return sign(x);\n}\nsignNumber.signature = n1;\nexport function sqrtNumber(x) {\n  return Math.sqrt(x);\n}\nsqrtNumber.signature = n1;\nexport function squareNumber(x) {\n  return x * x;\n}\nsquareNumber.signature = n1;\n\n/**\n * Calculate xgcd for two numbers\n * @param {number} a\n * @param {number} b\n * @return {number} result\n * @private\n */\nexport function xgcdNumber(a, b) {\n  // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n  var t; // used to swap two variables\n  var q; // quotient\n  var r; // remainder\n  var x = 0;\n  var lastx = 1;\n  var y = 1;\n  var lasty = 0;\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function xgcd must be integer numbers');\n  }\n  while (b) {\n    q = Math.floor(a / b);\n    r = a - q * b;\n    t = x;\n    x = lastx - q * x;\n    lastx = t;\n    t = y;\n    y = lasty - q * y;\n    lasty = t;\n    a = b;\n    b = r;\n  }\n  var res;\n  if (a < 0) {\n    res = [-a, -lastx, -lasty];\n  } else {\n    res = [a, a ? lastx : 0, lasty];\n  }\n  return res;\n}\nxgcdNumber.signature = n2;\n\n/**\n * Calculates the power of x to y, x^y, for two numbers.\n * @param {number} x\n * @param {number} y\n * @return {number} res\n */\nexport function powNumber(x, y) {\n  // x^Infinity === 0 if -1 < x < 1\n  // A real number 0 is returned instead of complex(0)\n  if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n    return 0;\n  }\n  return Math.pow(x, y);\n}\npowNumber.signature = n2;\n\n/**\n * round a number to the given number of decimals, or to zero if decimals is\n * not provided\n * @param {number} value\n * @param {number} decimals       number of decimals, between 0 and 15 (0 by default)\n * @return {number} roundedValue\n */\nexport function roundNumber(value) {\n  var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  if (!isInteger(decimals) || decimals < 0 || decimals > 15) {\n    throw new Error('Number of decimals in function round must be an integer from 0 to 15 inclusive');\n  }\n  return parseFloat(toFixed(value, decimals));\n}\n\n/**\n * Calculate the norm of a number, the absolute value.\n * @param {number} x\n * @return {number}\n */\nexport function normNumber(x) {\n  return Math.abs(x);\n}\nnormNumber.signature = n1;","import { isInteger } from '../../utils/number.js';\nvar n1 = 'number';\nexport function isIntegerNumber(x) {\n  return isInteger(x);\n}\nisIntegerNumber.signature = n1;\nexport function isNegativeNumber(x) {\n  return x < 0;\n}\nisNegativeNumber.signature = n1;\nexport function isPositiveNumber(x) {\n  return x > 0;\n}\nisPositiveNumber.signature = n1;\nexport function isZeroNumber(x) {\n  return x === 0;\n}\nisZeroNumber.signature = n1;\nexport function isNaNNumber(x) {\n  return Number.isNaN(x);\n}\nisNaNNumber.signature = n1;","/**\n * Compares two BigNumbers.\n * @param {BigNumber} a - First value to compare\n * @param {BigNumber} b - Second value to compare\n * @param {number} [relTol=1e-09] - The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.\n * @param {number} [absTol=0] - The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.\n * @returns {boolean} whether the two numbers are nearly equal\n * @throws {Error} If `relTol` is less than or equal to 0.\n * @throws {Error} If `absTol` is less than 0.\n *\n * @example\n * nearlyEqual(1.000000001, 1.0, 1e-9);            // true\n * nearlyEqual(1.000000002, 1.0, 0);            // false\n * nearlyEqual(1.0, 1.009, undefined, 0.02);       // true\n * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true\n */\nexport function nearlyEqual(a, b) {\n  var relTol = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1e-9;\n  var absTol = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;\n  if (relTol <= 0) {\n    throw new Error('Relative tolerance must be greater than 0');\n  }\n  if (absTol < 0) {\n    throw new Error('Absolute tolerance must be at least 0');\n  }\n  // NaN\n  if (a.isNaN() || b.isNaN()) {\n    return false;\n  }\n  if (!a.isFinite() || !b.isFinite()) {\n    return a.eq(b);\n  }\n  // use \"==\" operator, handles infinities\n  if (a.eq(b)) {\n    return true;\n  }\n  // abs(a-b) <= max(relTol * max(abs(a), abs(b)), absTol)\n  return a.minus(b).abs().lte(a.constructor.max(a.constructor.max(a.abs(), b.abs()).mul(relTol), absTol));\n}","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isPositiveNumber } from '../../plain/number/index.js';\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nvar name = 'isPositive';\nvar dependencies = ['typed', 'config'];\nexport var createIsPositive = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config\n  } = _ref;\n  /**\n   * Test whether a value is positive: larger than zero.\n   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isPositive(x)\n   *\n   * Examples:\n   *\n   *    math.isPositive(3)                     // returns true\n   *    math.isPositive(-2)                    // returns false\n   *    math.isPositive(0)                     // returns false\n   *    math.isPositive(-0)                    // returns false\n   *    math.isPositive(0.5)                   // returns true\n   *    math.isPositive(math.bignumber(2))     // returns true\n   *    math.isPositive(math.fraction(-2, 5))  // returns false\n   *    math.isPositive(math.fraction(1, 3))   // returns true\n   *    math.isPositive('2')                   // returns true\n   *    math.isPositive([2, 0, -3])            // returns [true, false, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isZero, isNegative, isInteger\n   *\n   * @param {number | BigNumber | bigint | Fraction | Unit | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is larger than zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: x => nearlyEqual(x, 0, config.relTol, config.absTol) ? false : isPositiveNumber(x),\n    BigNumber: x => bigNearlyEqual(x, new x.constructor(0), config.relTol, config.absTol) ? false : !x.isNeg() && !x.isZero() && !x.isNaN(),\n    bigint: x => x > 0n,\n    Fraction: x => x.s > 0n && x.n > 0n,\n    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isZero';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createIsZero = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n  /**\n   * Test whether a value is zero.\n   * The function can check for zero for types `number`, `BigNumber`, `Fraction`,\n   * `Complex`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isZero(x)\n   *\n   * Examples:\n   *\n   *    math.isZero(0)                      // returns true\n   *    math.isZero(2)                      // returns false\n   *    math.isZero(0.5)                    // returns false\n   *    math.isZero(math.bignumber(0))      // returns true\n   *    math.isZero(math.fraction(0))       // returns true\n   *    math.isZero(math.fraction(1,3))     // returns false\n   *    math.isZero(math.complex('2 - 4i')) // returns false\n   *    math.isZero(math.complex('0i'))     // returns true\n   *    math.isZero('0')                    // returns true\n   *    math.isZero('2')                    // returns false\n   *    math.isZero([2, 0, -3])             // returns [false, true, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isNegative, isInteger\n   *\n   * @param {number | BigNumber | bigint | Complex | Fraction | Unit | Array | Matrix} x       Value to be tested\n   * @return {boolean}  Returns true when `x` is zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    'number | BigNumber | Complex | Fraction': x => equalScalar(x, 0),\n    bigint: x => x === 0n,\n    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isNaNNumber } from '../../plain/number/index.js';\nvar name = 'isNaN';\nvar dependencies = ['typed'];\nexport var createIsNaN = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Test whether a value is NaN (not a number).\n   * The function supports types `number`, `BigNumber`, `Fraction`, `Unit` and `Complex`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isNaN(x)\n   *\n   * Examples:\n   *\n   *    math.isNaN(3)                     // returns false\n   *    math.isNaN(NaN)                   // returns true\n   *    math.isNaN(0)                     // returns false\n   *    math.isNaN(math.bignumber(NaN))   // returns true\n   *    math.isNaN(math.bignumber(0))     // returns false\n   *    math.isNaN(math.fraction(-2, 5))  // returns false\n   *    math.isNaN('-2')                  // returns false\n   *    math.isNaN([2, 0, -3, NaN])       // returns [false, false, false, true]\n   *\n   * See also:\n   *\n   *    isNumeric, isNegative, isPositive, isZero, isInteger, isFinite, isBounded\n   *\n   * @param {number | BigNumber | bigint | Fraction | Unit | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is NaN.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: isNaNNumber,\n    BigNumber: function BigNumber(x) {\n      return x.isNaN();\n    },\n    bigint: function bigint(x) {\n      return false;\n    },\n    Fraction: function Fraction(x) {\n      return false;\n    },\n    Complex: function Complex(x) {\n      return x.isNaN();\n    },\n    Unit: function Unit(x) {\n      return Number.isNaN(x.value);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { nearlyEqual } from './number.js';\n\n/**\n * Test whether two complex values are equal provided a given relTol and absTol.\n * Does not use or change the global Complex.EPSILON setting\n * @param {Complex} x - The first complex number for comparison.\n * @param {Complex} y - The second complex number for comparison.\n * @param {number} relTol - The relative tolerance for comparison.\n * @param {number} absTol - The absolute tolerance for comparison.\n * @returns {boolean} - Returns true if the two complex numbers are equal within the given tolerances, otherwise returns false.\n */\nexport function complexEquals(x, y, relTol, absTol) {\n  return nearlyEqual(x.re, y.re, relTol, absTol) && nearlyEqual(x.im, y.im, relTol, absTol);\n}","import { factory } from '../../utils/factory.js';\nexport var createCompareUnits = /* #__PURE__ */factory('compareUnits', ['typed'], _ref => {\n  var {\n    typed\n  } = _ref;\n  return {\n    'Unit, Unit': typed.referToSelf(self => (x, y) => {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n      return typed.find(self, [x.valueType(), y.valueType()])(x.value, y.value);\n    })\n  };\n});","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { complexEquals } from '../../utils/complex.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'equalScalar';\nvar dependencies = ['typed', 'config'];\nexport var createEqualScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config\n  } = _ref;\n  var compareUnits = createCompareUnits({\n    typed\n  });\n\n  /**\n   * Test whether two scalar values are nearly equal.\n   *\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Complex | Unit} x   First value to compare\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Complex} y          Second value to compare\n   * @return {boolean}                                                  Returns true when the compared values are equal, else returns false\n   * @private\n   */\n  return typed(name, {\n    'boolean, boolean': function boolean_boolean(x, y) {\n      return x === y;\n    },\n    'number, number': function number_number(x, y) {\n      return nearlyEqual(x, y, config.relTol, config.absTol);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.eq(y) || bigNearlyEqual(x, y, config.relTol, config.absTol);\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x === y;\n    },\n    'Fraction, Fraction': function Fraction_Fraction(x, y) {\n      return x.equals(y);\n    },\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return complexEquals(x, y, config.relTol, config.absTol);\n    }\n  }, compareUnits);\n});\nexport var createEqualScalarNumber = factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return nearlyEqual(x, y, config.relTol, config.absTol);\n    }\n  });\n});","import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { format } from '../../utils/string.js';\nimport { clone, deepStrictEqual } from '../../utils/object.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, unsqueeze, validateIndex } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { optimizeCallback } from '../../utils/optimizeCallback.js';\nvar name = 'SparseMatrix';\nvar dependencies = ['typed', 'equalScalar', 'Matrix'];\nexport var createSparseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar,\n    Matrix\n  } = _ref;\n  /**\n   * Sparse Matrix implementation. This type (currently) implements 2D\n   * matrices only via the format known as\n   * [Compressed Column Storage](https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_column_(CSC_or_CCS)).\n   *\n   * The structure/invariants of the internal data should be:\n   * 1. _values is an array of the nonzero values in order from top to bottom\n   *    (of each column), left to right.\n   * 2. _index is an array of row numbers, of the same length as and\n   *    corresponding positionally to _values.\n   * 3. _ptr is an array of length one more than the number of columns. For j\n   *    less than the number of columns, the \"half-open\" span of indices\n   *    _ptr[j] to _ptr[j+1] (i.e. including _ptr[j] if it is less than\n   *    _ptr[j+1], but never including _ptr[j+1]) are the indices in _values\n   *    of the nonzero elements in column j. Note there are no nonzero elements\n   *    in column j exactly when _ptr[j] === _ptr[j+1], and that the final\n   *    entry in _ptr is always exactly the number of nonzero entries in the\n   *    matrix.\n   * 4. _size is a length-2 array consisting of the number of rows followed by\n   *    the number of columns.\n   * 5. _datatype, if set, is the mathjs typeOf value of all entries of the\n   *    SparseMatrix.\n   * @class SparseMatrix\n   */\n  function SparseMatrix(data, datatype) {\n    if (!(this instanceof SparseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if (isMatrix(data)) {\n      // create from matrix\n      _createFromMatrix(this, data, datatype);\n    } else if (data && isArray(data.index) && isArray(data.ptr) && isArray(data.size)) {\n      // initialize fields\n      this._values = data.values;\n      this._index = data.index;\n      this._ptr = data.ptr;\n      this._size = data.size;\n      this._datatype = datatype || data.datatype;\n    } else if (isArray(data)) {\n      // create from array\n      _createFromArray(this, data, datatype);\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');\n    } else {\n      // nothing provided\n      this._values = [];\n      this._index = [];\n      this._ptr = [0];\n      this._size = [0, 0];\n      this._datatype = datatype;\n    }\n  }\n  function _createFromMatrix(matrix, source, datatype) {\n    // check matrix type\n    if (source.type === 'SparseMatrix') {\n      // clone arrays\n      matrix._values = source._values ? clone(source._values) : undefined;\n      matrix._index = clone(source._index);\n      matrix._ptr = clone(source._ptr);\n      matrix._size = clone(source._size);\n      matrix._datatype = datatype || source._datatype;\n    } else {\n      // build from matrix data\n      _createFromArray(matrix, source.valueOf(), datatype || source._datatype);\n    }\n  }\n  function _createFromArray(matrix, data, datatype) {\n    // initialize fields\n    matrix._values = [];\n    matrix._index = [];\n    matrix._ptr = [];\n    matrix._datatype = datatype;\n    // discover rows & columns, do not use math.size() to avoid looping array twice\n    var rows = data.length;\n    var columns = 0;\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, datatype);\n    }\n\n    // check we have rows (empty array)\n    if (rows > 0) {\n      // column index\n      var j = 0;\n      do {\n        // store pointer to values index\n        matrix._ptr.push(matrix._index.length);\n        // loop rows\n        for (var i = 0; i < rows; i++) {\n          // current row\n          var row = data[i];\n          // check row is an array\n          if (isArray(row)) {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < row.length) {\n              columns = row.length;\n            }\n            // check row has column\n            if (j < row.length) {\n              // value\n              var v = row[j];\n              // check value != 0\n              if (!eq(v, zero)) {\n                // store value\n                matrix._values.push(v);\n                // index\n                matrix._index.push(i);\n              }\n            }\n          } else {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < 1) {\n              columns = 1;\n            }\n            // check value != 0 (row is a scalar)\n            if (!eq(row, zero)) {\n              // store value\n              matrix._values.push(row);\n              // index\n              matrix._index.push(i);\n            }\n          }\n        }\n        // increment index\n        j++;\n      } while (j < columns);\n    }\n    // store number of values in ptr\n    while (matrix._ptr.length <= columns) {\n      matrix._ptr.push(matrix._index.length);\n    }\n    // size\n    matrix._size = [rows, columns];\n  }\n  SparseMatrix.prototype = new Matrix();\n\n  /**\n   * Create a new SparseMatrix\n   */\n  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(SparseMatrix, 'name', {\n    value: 'SparseMatrix'\n  });\n  SparseMatrix.prototype.constructor = SparseMatrix;\n  SparseMatrix.prototype.type = 'SparseMatrix';\n  SparseMatrix.prototype.isSparseMatrix = true;\n\n  /**\n   * Get the matrix type\n   *\n   * Usage:\n   *    const matrixType = matrix.getDataType()  // retrieves the matrix type\n   *\n   * @memberOf SparseMatrix\n   * @return {string}   type information; if multiple types are found from the Matrix, it will return \"mixed\"\n   */\n  SparseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._values, typeOf);\n  };\n\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()   // retrieve storage format\n   *\n   * @memberof SparseMatrix\n   * @return {string}           The storage format.\n   */\n  SparseMatrix.prototype.storage = function () {\n    return 'sparse';\n  };\n\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()    // retrieve matrix datatype\n   *\n   * @memberof SparseMatrix\n   * @return {string}           The datatype.\n   */\n  SparseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n\n  /**\n   * Create a new SparseMatrix\n   * @memberof SparseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n  SparseMatrix.prototype.create = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\n\n  /**\n   * Get the matrix density.\n   *\n   * Usage:\n   *     const density = matrix.density()                   // retrieve matrix density\n   *\n   * @memberof SparseMatrix\n   * @return {number}           The matrix density.\n   */\n  SparseMatrix.prototype.density = function () {\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // calculate density\n    return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;\n  };\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @memberof SparseMatrix\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  SparseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke subset on a Pattern only matrix');\n    }\n\n    // check arguments\n    switch (arguments.length) {\n      case 1:\n        return _getsubset(this, index);\n\n      // intentional fall through\n      case 2:\n      case 3:\n        return _setsubset(this, index, replacement, defaultValue);\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\n  function _getsubset(matrix, idx) {\n    // check idx\n    if (!isIndex(idx)) {\n      throw new TypeError('Invalid index');\n    }\n    var isScalar = idx.isScalar();\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(idx.min());\n    }\n    // validate dimensions\n    var size = idx.size();\n    if (size.length !== matrix._size.length) {\n      throw new DimensionError(size.length, matrix._size.length);\n    }\n\n    // vars\n    var i, ii, k, kk;\n\n    // validate if any of the ranges in the index is out of range\n    var min = idx.min();\n    var max = idx.max();\n    for (i = 0, ii = matrix._size.length; i < ii; i++) {\n      validateIndex(min[i], matrix._size[i]);\n      validateIndex(max[i], matrix._size[i]);\n    }\n\n    // matrix arrays\n    var mvalues = matrix._values;\n    var mindex = matrix._index;\n    var mptr = matrix._ptr;\n\n    // rows & columns dimensions for result matrix\n    var rows = idx.dimension(0);\n    var columns = idx.dimension(1);\n\n    // workspace & permutation vector\n    var w = [];\n    var pv = [];\n\n    // loop rows in resulting matrix\n    function rowsCallback(i, r) {\n      // update permutation vector\n      pv[i] = r[0];\n      // mark i in workspace\n      w[i] = true;\n    }\n    if (Number.isInteger(rows)) rowsCallback(rows, [0]);else rows.forEach(rowsCallback);\n\n    // result matrix arrays\n    var values = mvalues ? [] : undefined;\n    var index = [];\n    var ptr = [];\n\n    // loop columns in result matrix\n    function columnsCallback(j) {\n      // update ptr\n      ptr.push(index.length);\n      // loop values in column j\n      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {\n        // row\n        i = mindex[k];\n        // check row is in result matrix\n        if (w[i] === true) {\n          // push index\n          index.push(pv[i]);\n          // check we need to process values\n          if (values) {\n            values.push(mvalues[k]);\n          }\n        }\n      }\n    }\n    if (Number.isInteger(columns)) columnsCallback(columns);else columns.forEach(columnsCallback);\n    // update ptr\n    ptr.push(index.length);\n\n    // return matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size,\n      datatype: matrix._datatype\n    });\n  }\n  function _setsubset(matrix, index, submatrix, defaultValue) {\n    // check index\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index');\n    }\n\n    // get index size and check whether the index contains a single value\n    var iSize = index.size();\n    var isScalar = index.isScalar();\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    var sSize;\n    if (isMatrix(submatrix)) {\n      // submatrix size\n      sSize = submatrix.size();\n      // use array representation\n      submatrix = submatrix.toArray();\n    } else {\n      // get submatrix size (array, scalar)\n      sSize = arraySize(submatrix);\n    }\n\n    // check index is a scalar\n    if (isScalar) {\n      // verify submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n      // set value\n      matrix.set(index.min(), submatrix, defaultValue);\n    } else {\n      // validate dimensions, index size must be one or two dimensions\n      if (iSize.length !== 1 && iSize.length !== 2) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<');\n      }\n\n      // check submatrix and index have the same dimensions\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        }\n        // unsqueeze both outer and inner dimensions\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      }\n\n      // insert the sub matrix\n      if (iSize.length === 1) {\n        // if the replacement index only has 1 dimension, go trough each one and set its value\n        var range = index.dimension(0);\n        _forEachIndex(range, (dataIndex, subIndex) => {\n          validateIndex(dataIndex);\n          matrix.set([dataIndex, 0], submatrix[subIndex[0]], defaultValue);\n        });\n      } else {\n        // if the replacement index has 2 dimensions, go through each one and set the value in the correct index\n        var firstDimensionRange = index.dimension(0);\n        var secondDimensionRange = index.dimension(1);\n        _forEachIndex(firstDimensionRange, (firstDataIndex, firstSubIndex) => {\n          validateIndex(firstDataIndex);\n          _forEachIndex(secondDimensionRange, (secondDataIndex, secondSubIndex) => {\n            validateIndex(secondDataIndex);\n            matrix.set([firstDataIndex, secondDataIndex], submatrix[firstSubIndex[0]][secondSubIndex[0]], defaultValue);\n          });\n        });\n      }\n    }\n    return matrix;\n    function _forEachIndex(index, callback) {\n      // iterate cases where index is a Matrix or a Number\n      if (isNumber(index)) callback(index, [0]);else index.forEach(callback);\n    }\n  }\n\n  /**\n   * Get a single element from the matrix.\n   * @memberof SparseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  SparseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    }\n\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke get on a Pattern only matrix');\n    }\n\n    // row and column\n    var i = index[0];\n    var j = index[1];\n\n    // check i, j are valid\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[1]);\n\n    // find value index\n    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);\n    // check k is prior to next column k and it is in the correct row\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      return this._values[k];\n    }\n    return 0;\n  };\n\n  /**\n   * Replace a single element in the matrix.\n   * @memberof SparseMatrix\n   * @param {number[]} index   Zero-based index\n   * @param {*} v\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be set to zero.\n   * @return {SparseMatrix} self\n   */\n  SparseMatrix.prototype.set = function (index, v, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    }\n\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke set on a Pattern only matrix');\n    }\n\n    // row and column\n    var i = index[0];\n    var j = index[1];\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(this._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, this._datatype);\n    }\n\n    // check we need to resize matrix\n    if (i > rows - 1 || j > columns - 1) {\n      // resize matrix\n      _resize(this, Math.max(i + 1, rows), Math.max(j + 1, columns), defaultValue);\n      // update rows & columns\n      rows = this._size[0];\n      columns = this._size[1];\n    }\n\n    // check i, j are valid\n    validateIndex(i, rows);\n    validateIndex(j, columns);\n\n    // find value index\n    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);\n    // check k is prior to next column k and it is in the correct row\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      // check value != 0\n      if (!eq(v, zero)) {\n        // update value\n        this._values[k] = v;\n      } else {\n        // remove value from matrix\n        _remove(k, j, this._values, this._index, this._ptr);\n      }\n    } else {\n      if (!eq(v, zero)) {\n        // insert value @ (i, j)\n        _insert(k, i, j, v, this._values, this._index, this._ptr);\n      }\n    }\n    return this;\n  };\n  function _getValueIndex(i, top, bottom, index) {\n    // check row is on the bottom side\n    if (bottom - top === 0) {\n      return bottom;\n    }\n    // loop rows [top, bottom[\n    for (var r = top; r < bottom; r++) {\n      // check we found value index\n      if (index[r] === i) {\n        return r;\n      }\n    }\n    // we did not find row\n    return top;\n  }\n  function _remove(k, j, values, index, ptr) {\n    // remove value @ k\n    values.splice(k, 1);\n    index.splice(k, 1);\n    // update pointers\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]--;\n    }\n  }\n  function _insert(k, i, j, v, values, index, ptr) {\n    // insert value\n    values.splice(k, 0, v);\n    // update row for k\n    index.splice(k, 0, i);\n    // update column pointers\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]++;\n    }\n  }\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @memberof SparseMatrix\n   * @param {number[] | Matrix} size  The new size the matrix should have.\n   *                                  Since sparse matrices are always two-dimensional,\n   *                                  size must be two numbers in either an array or a matrix\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  SparseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!isCollection(size)) {\n      throw new TypeError('Array or Matrix expected');\n    }\n\n    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n    var sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    });\n    if (sizeArray.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // check sizes\n    sizeArray.forEach(function (value) {\n      if (!isNumber(value) || !isInteger(value) || value < 0) {\n        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(sizeArray) + ')');\n      }\n    });\n\n    // matrix to resize\n    var m = copy ? this.clone() : this;\n    // resize matrix\n    return _resize(m, sizeArray[0], sizeArray[1], defaultValue);\n  };\n  function _resize(matrix, rows, columns, defaultValue) {\n    // value to insert at the time of growing matrix\n    var value = defaultValue || 0;\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, matrix._datatype);\n      // convert value to the same datatype\n      value = typed.convert(value, matrix._datatype);\n    }\n\n    // should we insert the value?\n    var ins = !eq(value, zero);\n\n    // old columns and rows\n    var r = matrix._size[0];\n    var c = matrix._size[1];\n    var i, j, k;\n\n    // check we need to increase columns\n    if (columns > c) {\n      // loop new columns\n      for (j = c; j < columns; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._values.length;\n        // check we need to insert matrix._values\n        if (ins) {\n          // loop rows\n          for (i = 0; i < r; i++) {\n            // add new matrix._values\n            matrix._values.push(value);\n            // update matrix._index\n            matrix._index.push(i);\n          }\n        }\n      }\n      // store number of matrix._values in matrix._ptr\n      matrix._ptr[columns] = matrix._values.length;\n    } else if (columns < c) {\n      // truncate matrix._ptr\n      matrix._ptr.splice(columns + 1, c - columns);\n      // truncate matrix._values and matrix._index\n      matrix._values.splice(matrix._ptr[columns], matrix._values.length);\n      matrix._index.splice(matrix._ptr[columns], matrix._index.length);\n    }\n    // update columns\n    c = columns;\n\n    // check we need to increase rows\n    if (rows > r) {\n      // check we have to insert values\n      if (ins) {\n        // inserts\n        var n = 0;\n        // loop columns\n        for (j = 0; j < c; j++) {\n          // update matrix._ptr for current column\n          matrix._ptr[j] = matrix._ptr[j] + n;\n          // where to insert matrix._values\n          k = matrix._ptr[j + 1] + n;\n          // pointer\n          var p = 0;\n          // loop new rows, initialize pointer\n          for (i = r; i < rows; i++, p++) {\n            // add value\n            matrix._values.splice(k + p, 0, value);\n            // update matrix._index\n            matrix._index.splice(k + p, 0, i);\n            // increment inserts\n            n++;\n          }\n        }\n        // store number of matrix._values in matrix._ptr\n        matrix._ptr[c] = matrix._values.length;\n      }\n    } else if (rows < r) {\n      // deletes\n      var d = 0;\n      // loop columns\n      for (j = 0; j < c; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._ptr[j] - d;\n        // where matrix._values start for next column\n        var k0 = matrix._ptr[j];\n        var k1 = matrix._ptr[j + 1] - d;\n        // loop matrix._index\n        for (k = k0; k < k1; k++) {\n          // row\n          i = matrix._index[k];\n          // check we need to delete value and matrix._index\n          if (i > rows - 1) {\n            // remove value\n            matrix._values.splice(k, 1);\n            // remove item from matrix._index\n            matrix._index.splice(k, 1);\n            // increase deletes\n            d++;\n          }\n        }\n      }\n      // update matrix._ptr for current column\n      matrix._ptr[j] = matrix._values.length;\n    }\n    // update matrix._size\n    matrix._size[0] = rows;\n    matrix._size[1] = columns;\n    // return matrix\n    return matrix;\n  }\n\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * NOTE: This might be better suited to copy by default, instead of modifying\n   *       in place. For now, it operates in place to remain consistent with\n   *       resize().\n   *\n   * @memberof SparseMatrix\n   * @param {number[]} sizes          The new size the matrix should have.\n   *                                  Since sparse matrices are always two-dimensional,\n   *                                  size must be two numbers in either an array or a matrix\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  SparseMatrix.prototype.reshape = function (sizes, copy) {\n    // validate arguments\n    if (!isArray(sizes)) {\n      throw new TypeError('Array expected');\n    }\n    if (sizes.length !== 2) {\n      throw new Error('Sparse matrices can only be reshaped in two dimensions');\n    }\n\n    // check sizes\n    sizes.forEach(function (value) {\n      if (!isNumber(value) || !isInteger(value) || value <= -2 || value === 0) {\n        throw new TypeError('Invalid size, must contain positive integers or -1 ' + '(size: ' + format(sizes) + ')');\n      }\n    });\n    var currentLength = this._size[0] * this._size[1];\n    sizes = processSizesWildcard(sizes, currentLength);\n    var newLength = sizes[0] * sizes[1];\n\n    // m * n must not change\n    if (currentLength !== newLength) {\n      throw new Error('Reshaping sparse matrix will result in the wrong number of elements');\n    }\n\n    // matrix to reshape\n    var m = copy ? this.clone() : this;\n\n    // return unchanged if the same shape\n    if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {\n      return m;\n    }\n\n    // Convert to COO format (generate a column index)\n    var colIndex = [];\n    for (var i = 0; i < m._ptr.length; i++) {\n      for (var j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {\n        colIndex.push(i);\n      }\n    }\n\n    // Clone the values array\n    var values = m._values.slice();\n\n    // Clone the row index array\n    var rowIndex = m._index.slice();\n\n    // Transform the (row, column) indices\n    for (var _i = 0; _i < m._index.length; _i++) {\n      var r1 = rowIndex[_i];\n      var c1 = colIndex[_i];\n      var flat = r1 * m._size[1] + c1;\n      colIndex[_i] = flat % sizes[1];\n      rowIndex[_i] = Math.floor(flat / sizes[1]);\n    }\n\n    // Now reshaping is supposed to preserve the row-major order, BUT these sparse matrices are stored\n    // in column-major order, so we have to reorder the value array now. One option is to use a multisort,\n    // sorting several arrays based on some other array.\n\n    // OR, we could easily just:\n\n    // 1. Remove all values from the matrix\n    m._values.length = 0;\n    m._index.length = 0;\n    m._ptr.length = sizes[1] + 1;\n    m._size = sizes.slice();\n    for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {\n      m._ptr[_i2] = 0;\n    }\n\n    // 2. Re-insert all elements in the proper order (simplified code from SparseMatrix.prototype.set)\n    // This step is probably the most time-consuming\n    for (var h = 0; h < values.length; h++) {\n      var _i3 = rowIndex[h];\n      var _j = colIndex[h];\n      var v = values[h];\n      var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);\n      _insert(k, _i3, _j, v, m._values, m._index, m._ptr);\n    }\n\n    // The value indices are inserted out of order, but apparently that's... still OK?\n\n    return m;\n  };\n\n  /**\n   * Create a clone of the matrix\n   * @memberof SparseMatrix\n   * @return {SparseMatrix} clone\n   */\n  SparseMatrix.prototype.clone = function () {\n    var m = new SparseMatrix({\n      values: this._values ? clone(this._values) : undefined,\n      index: clone(this._index),\n      ptr: clone(this._ptr),\n      size: clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof SparseMatrix\n   * @returns {number[]} size\n   */\n  SparseMatrix.prototype.size = function () {\n    return this._size.slice(0); // copy the Array\n  };\n\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @memberof SparseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *\n   * @return {SparseMatrix} matrix\n   */\n  SparseMatrix.prototype.map = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke map on a Pattern only matrix');\n    }\n    // matrix instance\n    var me = this;\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    var fastCallback = optimizeCallback(callback, me, 'map');\n    // invoke callback\n    var invoke = function invoke(v, i, j) {\n      // invoke callback\n      return fastCallback.fn(v, [i, j], me);\n    };\n    // invoke _map\n    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);\n  };\n\n  /**\n   * Create a new matrix with the results of the callback function executed on the interval\n   * [minRow..maxRow, minColumn..maxColumn].\n   */\n  function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {\n    // result arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, matrix._datatype);\n    }\n\n    // invoke callback\n    var invoke = function invoke(v, x, y) {\n      // invoke callback\n      var value = callback(v, x, y);\n      // check value != 0\n      if (!eq(value, zero)) {\n        // store value\n        values.push(value);\n        // index\n        index.push(x);\n      }\n    };\n    // loop columns\n    for (var j = minColumn; j <= maxColumn; j++) {\n      // store pointer to values index\n      ptr.push(values.length);\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = matrix._ptr[j];\n      var k1 = matrix._ptr[j + 1];\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (var k = k0; k < k1; k++) {\n          // row index\n          var i = matrix._index[k];\n          // check i is in range\n          if (i >= minRow && i <= maxRow) {\n            // value @ k\n            invoke(matrix._values[k], i - minRow, j - minColumn);\n          }\n        }\n      } else {\n        // create a cache holding all defined values\n        var _values = {};\n        for (var _k = k0; _k < k1; _k++) {\n          var _i4 = matrix._index[_k];\n          _values[_i4] = matrix._values[_k];\n        }\n\n        // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n        for (var _i5 = minRow; _i5 <= maxRow; _i5++) {\n          var value = _i5 in _values ? _values[_i5] : 0;\n          invoke(value, _i5 - minRow, j - minColumn);\n        }\n      }\n    }\n\n    // store number of values in ptr\n    ptr.push(values.length);\n    // return sparse matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [maxRow - minRow + 1, maxColumn - minColumn + 1]\n    });\n  }\n\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @memberof SparseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *                              If false, the indices are guaranteed to be in order,\n   *                              if true, the indices can be unordered.\n   */\n  SparseMatrix.prototype.forEach = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke forEach on a Pattern only matrix');\n    }\n    // matrix instance\n    var me = this;\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    var fastCallback = optimizeCallback(callback, me, 'forEach');\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (var k = k0; k < k1; k++) {\n          // row index\n          var i = this._index[k];\n\n          // value @ k\n          // TODO apply a non indexed version of algorithm in case fastCallback is not optimized\n          fastCallback.fn(this._values[k], [i, j], me);\n        }\n      } else {\n        // create a cache holding all defined values\n        var values = {};\n        for (var _k2 = k0; _k2 < k1; _k2++) {\n          var _i6 = this._index[_k2];\n          values[_i6] = this._values[_k2];\n        }\n\n        // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n        for (var _i7 = 0; _i7 < rows; _i7++) {\n          var value = _i7 in values ? values[_i7] : 0;\n          fastCallback.fn(value, [_i7, j], me);\n        }\n      }\n    }\n  };\n\n  /**\n   * Iterate over the matrix elements, skipping zeros\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  SparseMatrix.prototype[Symbol.iterator] = function* () {\n    if (!this._values) {\n      throw new Error('Cannot iterate a Pattern only matrix');\n    }\n    var columns = this._size[1];\n    for (var j = 0; j < columns; j++) {\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      for (var k = k0; k < k1; k++) {\n        // row index\n        var i = this._index[k];\n        yield {\n          value: this._values[k],\n          index: [i, j]\n        };\n      }\n    }\n  };\n\n  /**\n   * Create an Array with a copy of the data of the SparseMatrix\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n  SparseMatrix.prototype.toArray = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, true);\n  };\n\n  /**\n   * Get the primitive value of the SparseMatrix: a two dimensions array\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n  SparseMatrix.prototype.valueOf = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, false);\n  };\n  function _toArray(values, index, ptr, size, copy) {\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n    // result\n    var a = [];\n    // vars\n    var i, j;\n    // initialize array\n    for (i = 0; i < rows; i++) {\n      a[i] = [];\n      for (j = 0; j < columns; j++) {\n        a[i][j] = 0;\n      }\n    }\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1];\n      // loop k within [k0, k1[\n      for (var k = k0; k < k1; k++) {\n        // row index\n        i = index[k];\n        // set value (use one for pattern matrix)\n        a[i][j] = values ? copy ? clone(values[k]) : values[k] : 1;\n      }\n    }\n    return a;\n  }\n\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @memberof SparseMatrix\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  SparseMatrix.prototype.format = function (options) {\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // density\n    var density = this.density();\n    // rows & columns\n    var str = 'Sparse Matrix [' + format(rows, options) + ' x ' + format(columns, options) + '] density: ' + format(density, options) + '\\n';\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      // loop k within [k0, k1[\n      for (var k = k0; k < k1; k++) {\n        // row index\n        var i = this._index[k];\n        // append value\n        str += '\\n    (' + format(i, options) + ', ' + format(j, options) + ') ==> ' + (this._values ? format(this._values[k], options) : 'X');\n      }\n    }\n    return str;\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {string} str\n   */\n  SparseMatrix.prototype.toString = function () {\n    return format(this.toArray());\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {Object}\n   */\n  SparseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'SparseMatrix',\n      values: this._values,\n      index: this._index,\n      ptr: this._ptr,\n      size: this._size,\n      datatype: this._datatype\n    };\n  };\n\n  /**\n   * Get the kth Matrix diagonal.\n   *\n   * @memberof SparseMatrix\n   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.\n   *\n   * @returns {Matrix}                     The matrix vector with the diagonal values.\n   */\n  SparseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // number diagonal values\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // diagonal arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n    // initial ptr value\n    ptr[0] = 0;\n    // loop columns\n    for (var j = kSuper; j < columns && values.length < n; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      // loop x within [k0, k1[\n      for (var x = k0; x < k1; x++) {\n        // row index\n        var i = this._index[x];\n        // check row\n        if (i === j - kSuper + kSub) {\n          // value on this column\n          values.push(this._values[x]);\n          // store row\n          index[values.length - 1] = i - kSub;\n          // exit loop\n          break;\n        }\n      }\n    }\n    // close ptr\n    ptr.push(values.length);\n    // return matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [n, 1]\n    });\n  };\n\n  /**\n   * Generate a matrix from a JSON object\n   * @memberof SparseMatrix\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"SparseMatrix\", \"values\": [], \"index\": [], \"ptr\": [], \"size\": []}`,\n   *                       where mathjs is optional\n   * @returns {SparseMatrix}\n   */\n  SparseMatrix.fromJSON = function (json) {\n    return new SparseMatrix(json);\n  };\n\n  /**\n   * Create a diagonal matrix.\n   *\n   * @memberof SparseMatrix\n   * @param {Array} size                       The matrix size.\n   * @param {number | Array | Matrix } value   The values for the diagonal.\n   * @param {number | BigNumber} [k=0]         The kth diagonal where the vector will be filled in.\n   * @param {number} [defaultValue]            The default value for non-diagonal\n   * @param {string} [datatype]                The Matrix datatype, values must be of this datatype.\n   *\n   * @returns {SparseMatrix}\n   */\n  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // map size & validate\n    size = size.map(function (s) {\n      // check it is a big number\n      if (isBigNumber(s)) {\n        // convert it\n        s = s.toNumber();\n      }\n      // validate arguments\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n      return s;\n    });\n\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, datatype);\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n\n    // number of non-zero items\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // value extraction function\n    var _value;\n\n    // check value\n    if (isArray(value)) {\n      // validate array\n      if (value.length !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid value array length');\n      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if (isMatrix(value)) {\n      // matrix size\n      var ms = value.size();\n      // validate matrix\n      if (ms.length !== 1 || ms[0] !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid matrix length');\n      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value.get([i]);\n      };\n    } else {\n      // define function\n      _value = function _value() {\n        // return value\n        return value;\n      };\n    }\n\n    // create arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n\n    // loop items\n    for (var j = 0; j < columns; j++) {\n      // number of rows with value\n      ptr.push(values.length);\n      // diagonal index\n      var i = j - kSuper;\n      // check we need to set diagonal value\n      if (i >= 0 && i < n) {\n        // get value @ i\n        var v = _value(i);\n        // check for zero\n        if (!eq(v, zero)) {\n          // column\n          index.push(i + kSub);\n          // add value\n          values.push(v);\n        }\n      }\n    }\n    // last value should be number of values\n    ptr.push(values.length);\n    // create SparseMatrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [rows, columns]\n    });\n  };\n\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @memberof SparseMatrix\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n  SparseMatrix.prototype.swapRows = function (i, j) {\n    // check index\n    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {\n      throw new Error('Row index must be positive integers');\n    }\n    // check dimensions\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    // validate index\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]);\n\n    // swap rows\n    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr);\n    // return current instance\n    return this;\n  };\n\n  /**\n   * Loop rows with data in column j.\n   *\n   * @param {number} j            Column\n   * @param {Array} values        Matrix values\n   * @param {Array} index         Matrix row indeces\n   * @param {Array} ptr           Matrix column pointers\n   * @param {Function} callback   Callback function invoked for every row in column j\n   */\n  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {\n    // indeces for column j\n    var k0 = ptr[j];\n    var k1 = ptr[j + 1];\n\n    // loop\n    for (var k = k0; k < k1; k++) {\n      // invoke callback\n      callback(index[k], values[k]);\n    }\n  };\n\n  /**\n   * Swap rows x and y in Sparse Matrix data structures.\n   *\n   * @param {number} x         Matrix row index 1\n   * @param {number} y         Matrix row index 2\n   * @param {number} columns   Number of columns in matrix\n   * @param {Array} values     Matrix values\n   * @param {Array} index      Matrix row indeces\n   * @param {Array} ptr        Matrix column pointers\n   */\n  SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1];\n      // find value index @ x\n      var kx = _getValueIndex(x, k0, k1, index);\n      // find value index @ x\n      var ky = _getValueIndex(y, k0, k1, index);\n      // check both rows exist in matrix\n      if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {\n        // swap values (check for pattern matrix)\n        if (values) {\n          var v = values[kx];\n          values[kx] = values[ky];\n          values[ky] = v;\n        }\n        // next column\n        continue;\n      }\n      // check x row exist & no y row\n      if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {\n        // value @ x (check for pattern matrix)\n        var vx = values ? values[kx] : undefined;\n        // insert value @ y\n        index.splice(ky, 0, y);\n        if (values) {\n          values.splice(ky, 0, vx);\n        }\n        // remove value @ x (adjust array index if needed)\n        index.splice(ky <= kx ? kx + 1 : kx, 1);\n        if (values) {\n          values.splice(ky <= kx ? kx + 1 : kx, 1);\n        }\n        // next column\n        continue;\n      }\n      // check y row exist & no x row\n      if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {\n        // value @ y (check for pattern matrix)\n        var vy = values ? values[ky] : undefined;\n        // insert value @ x\n        index.splice(kx, 0, x);\n        if (values) {\n          values.splice(kx, 0, vy);\n        }\n        // remove value @ y (adjust array index if needed)\n        index.splice(kx <= ky ? ky + 1 : ky, 1);\n        if (values) {\n          values.splice(kx <= ky ? ky + 1 : ky, 1);\n        }\n      }\n    }\n  };\n  return SparseMatrix;\n}, {\n  isClass: true\n});","import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nvar name = 'number';\nvar dependencies = ['typed'];\n\n/**\n * Separates the radix, integer part, and fractional part of a non decimal number string\n * @param {string} input string to parse\n * @returns {object} the parts of the string or null if not a valid input\n */\nfunction getNonDecimalNumberParts(input) {\n  var nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\\.([0-9a-fA-F]*)/);\n  if (nonDecimalWithRadixMatch) {\n    var radix = {\n      '0b': 2,\n      '0o': 8,\n      '0x': 16\n    }[nonDecimalWithRadixMatch[1]];\n    var integerPart = nonDecimalWithRadixMatch[2];\n    var fractionalPart = nonDecimalWithRadixMatch[3];\n    return {\n      input,\n      radix,\n      integerPart,\n      fractionalPart\n    };\n  } else {\n    return null;\n  }\n}\n\n/**\n * Makes a number from a radix, and integer part, and a fractional part\n * @param {parts} [x] parts of the number string (from getNonDecimalNumberParts)\n * @returns {number} the number\n */\nfunction makeNumberFromNonDecimalParts(parts) {\n  var n = parseInt(parts.integerPart, parts.radix);\n  var f = 0;\n  for (var i = 0; i < parts.fractionalPart.length; i++) {\n    var digitValue = parseInt(parts.fractionalPart[i], parts.radix);\n    f += digitValue / Math.pow(parts.radix, i + 1);\n  }\n  var result = n + f;\n  if (isNaN(result)) {\n    throw new SyntaxError('String \"' + parts.input + '\" is not a valid number');\n  }\n  return result;\n}\nexport var createNumber = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Create a number or convert a string, boolean, or unit to a number.\n   * When value is a matrix, all elements will be converted to number.\n   *\n   * Syntax:\n   *\n   *    math.number(value)\n   *    math.number(unit, valuelessUnit)\n   *\n   * Examples:\n   *\n   *    math.number(2)                         // returns number 2\n   *    math.number('7.2')                     // returns number 7.2\n   *    math.number(true)                      // returns number 1\n   *    math.number([true, false, true, true]) // returns [1, 0, 1, 1]\n   *    math.number(math.unit('52cm'), 'm')    // returns 0.52\n   *\n   * See also:\n   *\n   *    bignumber, bigint, boolean, numeric, complex, index, matrix, string, unit\n   *\n   * @param {string | number | BigNumber | Fraction | boolean | Array | Matrix | Unit | null} [value]  Value to be converted\n   * @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number\n   * @return {number | Array | Matrix} The created number\n   */\n  var number = typed('number', {\n    '': function _() {\n      return 0;\n    },\n    number: function number(x) {\n      return x;\n    },\n    string: function string(x) {\n      if (x === 'NaN') return NaN;\n      var nonDecimalNumberParts = getNonDecimalNumberParts(x);\n      if (nonDecimalNumberParts) {\n        return makeNumberFromNonDecimalParts(nonDecimalNumberParts);\n      }\n      var size = 0;\n      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n      if (wordSizeSuffixMatch) {\n        // x includes a size suffix like 0xffffi32, so we extract\n        // the suffix and remove it from x\n        size = Number(wordSizeSuffixMatch[2]);\n        x = wordSizeSuffixMatch[1];\n      }\n      var num = Number(x);\n      if (isNaN(num)) {\n        throw new SyntaxError('String \"' + x + '\" is not a valid number');\n      }\n      if (wordSizeSuffixMatch) {\n        // x is a signed bin, oct, or hex literal\n        // num is the value of string x if x is interpreted as unsigned\n        if (num > 2 ** size - 1) {\n          // literal is too large for size suffix\n          throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n        }\n        // check if the bit at index size - 1 is set and if so do the twos complement\n        if (num >= 2 ** (size - 1)) {\n          num = num - 2 ** size;\n        }\n      }\n      return num;\n    },\n    BigNumber: function BigNumber(x) {\n      return x.toNumber();\n    },\n    bigint: function bigint(x) {\n      return Number(x);\n    },\n    Fraction: function Fraction(x) {\n      return x.valueOf();\n    },\n    Unit: typed.referToSelf(self => x => {\n      var clone = x.clone();\n      clone.value = self(x.value);\n      return clone;\n    }),\n    null: function _null(x) {\n      return 0;\n    },\n    'Unit, string | Unit': function Unit_string__Unit(unit, valuelessUnit) {\n      return unit.toNumber(valuelessUnit);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n\n  // reviver function to parse a JSON object like:\n  //\n  //     {\"mathjs\":\"number\",\"value\":\"2.3\"}\n  //\n  // into a number 2.3\n  number.fromJSON = function (json) {\n    return parseFloat(json.value);\n  };\n  return number;\n});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'bignumber';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createBignumber = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber\n  } = _ref;\n  /**\n   * Create a BigNumber, which can store numbers with arbitrary precision.\n   * When a matrix is provided, all elements will be converted to BigNumber.\n   *\n   * Syntax:\n   *\n   *    math.bignumber(x)\n   *\n   * Examples:\n   *\n   *    0.1 + 0.2                                  // returns number 0.30000000000000004\n   *    math.bignumber(0.1) + math.bignumber(0.2)  // returns BigNumber 0.3\n   *\n   *\n   *    7.2e500                                    // returns number Infinity\n   *    math.bignumber('7.2e500')                  // returns BigNumber 7.2e500\n   *\n   * See also:\n   *\n   *    number, bigint, boolean, complex, index, matrix, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | bigint | Array | Matrix | boolean | null} [value]  Value for the big number,\n   *                                                    0 by default.\n   * @returns {BigNumber} The created bignumber\n   */\n  return typed('bignumber', {\n    '': function _() {\n      return new BigNumber(0);\n    },\n    number: function number(x) {\n      // convert to string to prevent errors in case of >15 digits\n      return new BigNumber(x + '');\n    },\n    string: function string(x) {\n      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n      if (wordSizeSuffixMatch) {\n        // x has a word size suffix\n        var size = wordSizeSuffixMatch[2];\n        var n = BigNumber(wordSizeSuffixMatch[1]);\n        var twoPowSize = new BigNumber(2).pow(Number(size));\n        if (n.gt(twoPowSize.sub(1))) {\n          throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n        }\n        var twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1);\n        if (n.gte(twoPowSizeSubOne)) {\n          return n.sub(twoPowSize);\n        } else {\n          return n;\n        }\n      }\n      return new BigNumber(x);\n    },\n    BigNumber: function BigNumber(x) {\n      // we assume a BigNumber is immutable\n      return x;\n    },\n    bigint: function bigint(x) {\n      return new BigNumber(x.toString());\n    },\n    Unit: typed.referToSelf(self => x => {\n      var clone = x.clone();\n      clone.value = self(x.value);\n      return clone;\n    }),\n    Fraction: function Fraction(x) {\n      return new BigNumber(String(x.n)).div(String(x.d)).times(String(x.s));\n    },\n    null: function _null(_x) {\n      return new BigNumber(0);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'complex';\nvar dependencies = ['typed', 'Complex'];\nexport var createComplex = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Complex\n  } = _ref;\n  /**\n   * Create a complex value or convert a value to a complex value.\n   *\n   * Syntax:\n   *\n   *     math.complex()                           // creates a complex value with zero\n   *                                              // as real and imaginary part.\n   *     math.complex(re : number, im : string)   // creates a complex value with provided\n   *                                              // values for real and imaginary part.\n   *     math.complex(re : number)                // creates a complex value with provided\n   *                                              // real value and zero imaginary part.\n   *     math.complex(complex : Complex)          // clones the provided complex value.\n   *     math.complex(arg : string)               // parses a string into a complex value.\n   *     math.complex(array : Array)              // converts the elements of the array\n   *                                              // or matrix element wise into a\n   *                                              // complex value.\n   *     math.complex({re: number, im: number})   // creates a complex value with provided\n   *                                              // values for real an imaginary part.\n   *     math.complex({r: number, phi: number})   // creates a complex value with provided\n   *                                              // polar coordinates\n   *\n   * Examples:\n   *\n   *    const a = math.complex(3, -4)     // a = Complex 3 - 4i\n   *    a.re = 5                          // a = Complex 5 - 4i\n   *    const i = a.im                    // Number -4\n   *    const b = math.complex('2 + 6i')  // Complex 2 + 6i\n   *    const c = math.complex()          // Complex 0 + 0i\n   *    const d = math.add(a, b)          // Complex 5 + 2i\n   *\n   * See also:\n   *\n   *    bignumber, boolean, index, matrix, number, string, unit\n   *\n   * History:\n   *\n   *    v0.5   Created\n   *    v0.16  Added conversion from BigNumber\n   *    v6     Added conversion from Fraction\n   *\n   * @param {* | Array | Matrix} [args]\n   *            Arguments specifying the real and imaginary part of the complex number\n   * @return {Complex | Array | Matrix} Returns a complex value\n   */\n  return typed('complex', {\n    '': function _() {\n      return Complex.ZERO;\n    },\n    number: function number(x) {\n      return new Complex(x, 0);\n    },\n    'number, number': function number_number(re, im) {\n      return new Complex(re, im);\n    },\n    // TODO: this signature should be redundant\n    'BigNumber, BigNumber': function BigNumber_BigNumber(re, im) {\n      return new Complex(re.toNumber(), im.toNumber());\n    },\n    Fraction: function Fraction(x) {\n      return new Complex(x.valueOf(), 0);\n    },\n    Complex: function Complex(x) {\n      return x.clone();\n    },\n    string: function string(x) {\n      return Complex(x); // for example '2 + 3i'\n    },\n    null: function _null(x) {\n      return Complex(0);\n    },\n    Object: function Object(x) {\n      if ('re' in x && 'im' in x) {\n        return new Complex(x.re, x.im);\n      }\n      if ('r' in x && 'phi' in x || 'abs' in x && 'arg' in x) {\n        return new Complex(x);\n      }\n      throw new Error('Expected object with properties (re and im) or (r and phi) or (abs and arg)');\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'fraction';\nvar dependencies = ['typed', 'Fraction'];\nexport var createFraction = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Fraction\n  } = _ref;\n  /**\n   * Create a fraction or convert a value to a fraction.\n   *\n   * With one numeric argument, produces the closest rational approximation to the\n   * input.\n   * With two arguments, the first is the numerator and the second is the denominator,\n   * and creates the corresponding fraction. Both numerator and denominator must be\n   * integers.\n   * With one object argument, looks for the integer numerator as the value of property\n   * 'n' and the integer denominator as the value of property 'd'.\n   * With a matrix argument, creates a matrix of the same shape with entries\n   * converted into fractions.\n   *\n   * Syntax:\n   *     math.fraction(value)\n   *     math.fraction(numerator, denominator)\n   *     math.fraction({n: numerator, d: denominator})\n   *     math.fraction(matrix: Array | Matrix)\n   *\n   * Examples:\n   *\n   *     math.fraction(6.283)             // returns Fraction 6283/1000\n   *     math.fraction(1, 3)              // returns Fraction 1/3\n   *     math.fraction('2/3')             // returns Fraction 2/3\n   *     math.fraction({n: 2, d: 3})      // returns Fraction 2/3\n   *     math.fraction([0.2, 0.25, 1.25]) // returns Array [1/5, 1/4, 5/4]\n   *     math.fraction(4, 5.1)            // throws Error: Parameters must be integer\n   *\n   * See also:\n   *\n   *    bignumber, number, string, unit\n   *\n   * History:\n   *\n   *    v2     Created\n   *    v3     Added conversion from BigNumber\n   *    v11.8  Added conversion from Unit\n   *    v13    Added conversion from bigint\n   *    v14    Move to bigint-based fraction.js@5; construct from two bigints\n   *\n   * @param {number | string | Fraction | BigNumber | bigint | Unit | Array | Matrix} [args]\n   *            Arguments specifying the value, or numerator and denominator of\n   *            the fraction\n   * @return {Fraction | Array | Matrix} Returns a fraction\n   */\n  return typed('fraction', {\n    number: function number(x) {\n      if (!Number.isFinite(x) || isNaN(x)) {\n        throw new Error(x + ' cannot be represented as a fraction');\n      }\n      return new Fraction(x);\n    },\n    string: function string(x) {\n      return new Fraction(x);\n    },\n    'number, number': function number_number(numerator, denominator) {\n      return new Fraction(numerator, denominator);\n    },\n    'bigint, bigint': function bigint_bigint(numerator, denominator) {\n      return new Fraction(numerator, denominator);\n    },\n    null: function _null(x) {\n      return new Fraction(0);\n    },\n    BigNumber: function BigNumber(x) {\n      return new Fraction(x.toString());\n    },\n    bigint: function bigint(x) {\n      return new Fraction(x.toString());\n    },\n    Fraction: function Fraction(x) {\n      return x; // fractions are immutable\n    },\n    Unit: typed.referToSelf(self => x => {\n      var clone = x.clone();\n      clone.value = self(x.value);\n      return clone;\n    }),\n    Object: function Object(x) {\n      return new Fraction(x);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'matrix';\nvar dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];\nexport var createMatrix = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Matrix,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n  /**\n   * Create a Matrix. The function creates a new `math.Matrix` object from\n   * an `Array`. A Matrix has utility functions to manipulate the data in the\n   * matrix, like getting the size and getting or setting values in the matrix.\n   * Supported storage formats are 'dense' and 'sparse'.\n   *\n   * Syntax:\n   *\n   *    math.matrix()                         // creates an empty matrix using default storage format (dense).\n   *    math.matrix(data)                     // creates a matrix with initial data using default storage format (dense).\n   *    math.matrix('dense')                  // creates an empty matrix using the given storage format.\n   *    math.matrix(data, 'dense')            // creates a matrix with initial data using the given storage format.\n   *    math.matrix(data, 'sparse')           // creates a sparse matrix with initial data.\n   *    math.matrix(data, 'sparse', 'number') // creates a sparse matrix with initial data, number data type.\n   *\n   * Examples:\n   *\n   *    let m = math.matrix([[1, 2], [3, 4]])\n   *    m.size()                        // Array [2, 2]\n   *    m.resize([3, 2], 5)\n   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]\n   *    m.get([1, 0])                    // number 3\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, number, string, unit, sparse\n   *\n   * History:\n   *\n   *    v0.5  Created\n   *    v1.5  Support dense or sparse Matrix types; allow construction\n   *          from string, Array, or another Matrix.\n   *\n   * @param {Array | Matrix} [data]    A multi dimensional array\n   * @param {string} [format]          The Matrix storage format, either `'dense'` or `'sparse'`\n   * @param {string} [datatype]        Type of the values\n   *\n   * @return {Matrix} The created matrix\n   */\n  return typed(name, {\n    '': function _() {\n      return _create([]);\n    },\n    string: function string(format) {\n      return _create([], format);\n    },\n    'string, string': function string_string(format, datatype) {\n      return _create([], format, datatype);\n    },\n    Array: function Array(data) {\n      return _create(data);\n    },\n    Matrix: function Matrix(data) {\n      return _create(data, data.storage());\n    },\n    'Array | Matrix, string': _create,\n    'Array | Matrix, string, string': _create\n  });\n\n  /**\n   * Create a new Matrix with given storage format\n   * @param {Array} data\n   * @param {string} [format]\n   * @param {string} [datatype]\n   * @returns {Matrix} Returns a new Matrix\n   * @private\n   */\n  function _create(data, format, datatype) {\n    // get storage format constructor\n    if (format === 'dense' || format === 'default' || format === undefined) {\n      return new DenseMatrix(data, datatype);\n    }\n    if (format === 'sparse') {\n      return new SparseMatrix(data, datatype);\n    }\n    throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.');\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'matrixFromColumns';\nvar dependencies = ['typed', 'matrix', 'flatten', 'size'];\nexport var createMatrixFromColumns = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    flatten,\n    size\n  } = _ref;\n  /**\n   * Create a dense matrix from vectors as individual columns.\n   * If you pass row vectors, they will be transposed (but not conjugated!)\n   *\n   * Syntax:\n   *\n   *    math.matrixFromColumns(...arr)\n   *    math.matrixFromColumns(col1, col2)\n   *    math.matrixFromColumns(col1, col2, col3)\n   *\n   * Examples:\n   *\n   *    math.matrixFromColumns([1, 2, 3], [[4],[5],[6]])\n   *    math.matrixFromColumns(...vectors)\n   *\n   * See also:\n   *\n   *    matrix, matrixFromRows, matrixFromFunction, zeros\n   *\n   * @param {... Array | Matrix} cols Multiple columns\n   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned\n   */\n  return typed(name, {\n    '...Array': function Array(arr) {\n      return _createArray(arr);\n    },\n    '...Matrix': function Matrix(arr) {\n      return matrix(_createArray(arr.map(m => m.toArray())));\n    }\n\n    // TODO implement this properly for SparseMatrix\n  });\n  function _createArray(arr) {\n    if (arr.length === 0) throw new TypeError('At least one column is needed to construct a matrix.');\n    var N = checkVectorTypeAndReturnLength(arr[0]);\n\n    // create an array with empty rows\n    var result = [];\n    for (var i = 0; i < N; i++) {\n      result[i] = [];\n    }\n\n    // loop columns\n    for (var col of arr) {\n      var colLength = checkVectorTypeAndReturnLength(col);\n      if (colLength !== N) {\n        throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (colLength | 0));\n      }\n      var f = flatten(col);\n\n      // push a value to each row\n      for (var _i = 0; _i < N; _i++) {\n        result[_i].push(f[_i]);\n      }\n    }\n    return result;\n  }\n  function checkVectorTypeAndReturnLength(vec) {\n    var s = size(vec);\n    if (s.length === 1) {\n      // 1D vector\n      return s[0];\n    } else if (s.length === 2) {\n      // 2D vector\n      if (s[0] === 1) {\n        // row vector\n        return s[1];\n      } else if (s[1] === 1) {\n        // col vector\n        return s[0];\n      } else {\n        throw new TypeError('At least one of the arguments is not a vector.');\n      }\n    } else {\n      throw new TypeError('Only one- or two-dimensional vectors are supported.');\n    }\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { unaryMinusNumber } from '../../plain/number/index.js';\nvar name = 'unaryMinus';\nvar dependencies = ['typed'];\nexport var createUnaryMinus = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Inverse the sign of a value, apply a unary minus operation.\n   *\n   * For matrices, the function is evaluated element wise. Boolean values and\n   * strings will be converted to a number. For complex numbers, both real and\n   * complex value are inverted.\n   *\n   * Syntax:\n   *\n   *    math.unaryMinus(x)\n   *\n   * Examples:\n   *\n   *    math.unaryMinus(3.5)      // returns -3.5\n   *    math.unaryMinus(-4.2)     // returns 4.2\n   *\n   * See also:\n   *\n   *    add, subtract, unaryPlus\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x Number to be inverted.\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Returns the value with inverted sign.\n   */\n  return typed(name, {\n    number: unaryMinusNumber,\n    'Complex | BigNumber | Fraction': x => x.neg(),\n    bigint: x => -x,\n    Unit: typed.referToSelf(self => x => {\n      var res = x.clone();\n      res.value = typed.find(self, res.valueType())(x.value);\n      return res;\n    }),\n    // deep map collection, skip zeros since unaryMinus(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true))\n\n    // TODO: add support for string\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { absNumber } from '../../plain/number/index.js';\nvar name = 'abs';\nvar dependencies = ['typed'];\nexport var createAbs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Calculate the absolute value of a number. For matrices, the function is\n   * evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.abs(x)\n   *\n   * Examples:\n   *\n   *    math.abs(3.5)                // returns number 3.5\n   *    math.abs(-4.2)               // returns number 4.2\n   *\n   *    math.abs([3, -5, -1, 0, 2])  // returns Array [3, 5, 1, 0, 2]\n   *\n   * See also:\n   *\n   *    sign\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit} x\n   *            A number or matrix for which to get the absolute value\n   * @return {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit}\n   *            Absolute value of `x`\n   */\n  return typed(name, {\n    number: absNumber,\n    'Complex | BigNumber | Fraction | Unit': x => x.abs(),\n    bigint: x => x < 0n ? -x : x,\n    // deep map collection, skip zeros since abs(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true))\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { arraySize } from '../../utils/array.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { IndexError } from '../../error/IndexError.js';\nvar name = 'mapSlices';\nvar dependencies = ['typed', 'isInteger'];\nexport var createMapSlices = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    isInteger\n  } = _ref;\n  /**\n   * Apply a function that maps an array to a scalar\n   * along a given axis of a matrix or array.\n   * Returns a new matrix or array with one less dimension than the input.\n   *\n   * Syntax:\n   *\n   *     math.mapSlices(A, dim, callback)\n   *\n   * Where:\n   *\n   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.\n   *\n   * Examples:\n   *\n   *    const A = [[1, 2], [3, 4]]\n   *    const sum = math.sum\n   *\n   *    math.mapSlices(A, 0, sum)             // returns [4, 6]\n   *    math.mapSlices(A, 1, sum)             // returns [3, 7]\n   *\n   * See also:\n   *\n   *    map, filter, forEach\n   *\n   * Note:\n   *\n   *    `mapSlices()` is also currently available via its deprecated\n   *    synonym `apply()`.\n   *\n   * @param {Array | Matrix} array   The input Matrix\n   * @param {number} dim             The dimension along which the callback is applied\n   * @param {Function} callback      The callback function that is applied. This Function\n   *                                 should take an array or 1-d matrix as an input and\n   *                                 return a number.\n   * @return {Array | Matrix} res    The residual matrix with the function mapped on the slices over some dimension.\n   */\n  return typed(name, {\n    'Array | Matrix, number | BigNumber, function': function Array__Matrix_number__BigNumber_function(mat, dim, callback) {\n      if (!isInteger(dim)) {\n        throw new TypeError('Integer number expected for dimension');\n      }\n      var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n      if (dim < 0 || dim >= size.length) {\n        throw new IndexError(dim, size.length);\n      }\n      if (isMatrix(mat)) {\n        return mat.create(_mapSlices(mat.valueOf(), dim, callback), mat.datatype());\n      } else {\n        return _mapSlices(mat, dim, callback);\n      }\n    }\n  });\n}, {\n  formerly: 'apply'\n});\n\n/**\n * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\nfunction _mapSlices(mat, dim, callback) {\n  var i, ret, tran;\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      return callback(mat);\n    } else {\n      tran = _switch(mat);\n      ret = [];\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _mapSlices(tran[i], dim - 1, callback);\n      }\n      return ret;\n    }\n  } else {\n    ret = [];\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _mapSlices(mat[i], dim - 1, callback);\n    }\n    return ret;\n  }\n}\n\n/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\nfunction _switch(mat) {\n  var I = mat.length;\n  var J = mat[0].length;\n  var i, j;\n  var ret = [];\n  for (j = 0; j < J; j++) {\n    var tmp = [];\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j]);\n    }\n    ret.push(tmp);\n  }\n  return ret;\n}","import { factory } from '../../utils/factory.js';\nimport { addNumber } from '../../plain/number/index.js';\nvar name = 'addScalar';\nvar dependencies = ['typed'];\nexport var createAddScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Add two scalar values, `x + y`.\n   * This function is meant for internal use: it is used by the public function\n   * `add`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value to add\n   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to add\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Sum of `x` and `y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': addNumber,\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return x.add(y);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.plus(y);\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x + y;\n    },\n    'Fraction, Fraction': function Fraction_Fraction(x, y) {\n      return x.add(y);\n    },\n    'Unit, Unit': typed.referToSelf(self => (x, y) => {\n      if (x.value === null || x.value === undefined) {\n        throw new Error('Parameter x contains a unit with undefined value');\n      }\n      if (y.value === null || y.value === undefined) {\n        throw new Error('Parameter y contains a unit with undefined value');\n      }\n      if (!x.equalBase(y)) throw new Error('Units do not match');\n      var res = x.clone();\n      res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);\n      res.fixPrefix = false;\n      return res;\n    })\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { subtractNumber } from '../../plain/number/index.js';\nvar name = 'subtractScalar';\nvar dependencies = ['typed'];\nexport var createSubtractScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Subtract two scalar values, `x - y`.\n   * This function is meant for internal use: it is used by the public function\n   * `subtract`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value\n   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to be subtracted from `x`\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Difference of `x` and `y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': subtractNumber,\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return x.sub(y);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.minus(y);\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x - y;\n    },\n    'Fraction, Fraction': function Fraction_Fraction(x, y) {\n      return x.sub(y);\n    },\n    'Unit, Unit': typed.referToSelf(self => (x, y) => {\n      if (x.value === null || x.value === undefined) {\n        throw new Error('Parameter x contains a unit with undefined value');\n      }\n      if (y.value === null || y.value === undefined) {\n        throw new Error('Parameter y contains a unit with undefined value');\n      }\n      if (!x.equalBase(y)) throw new Error('Units do not match');\n      var res = x.clone();\n      res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);\n      res.fixPrefix = false;\n      return res;\n    })\n  });\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'matAlgo11xS0s';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo11xS0s = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n  /**\n   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n   * Callback function invoked NZ times (number of nonzero items in S).\n   *\n   *\n   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0          ; otherwise\n   *\n   *\n   * @param {Matrix}   s                 The SparseMatrix instance (S)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n  return function matAlgo11xS0s(s, b, callback, inverse) {\n    // sparse matrix arrays\n    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype;\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // initialize ptr\n      cptr[j] = cindex.length;\n      // values in j\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = aindex[k];\n        // invoke callback\n        var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b);\n        // check value is zero\n        if (!eq(v, zero)) {\n          // push index & value\n          cindex.push(i);\n          cvalues.push(v);\n        }\n      }\n    }\n    // update ptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return s.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'matAlgo12xSfs';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createMatAlgo12xSfs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\n  /**\n   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n   * Callback function invoked MxN times.\n   *\n   *\n   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  f(0, b)    ; otherwise\n   *\n   *\n   * @param {Matrix}   s                 The SparseMatrix instance (S)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n  return function matAlgo12xSfs(s, b, callback, inverse) {\n    // sparse matrix arrays\n    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype;\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cdata = [];\n\n    // workspaces\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1;\n      // values in j\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k];\n        // update workspace\n        x[r] = avalues[k];\n        w[r] = mark;\n      }\n      // loop rows\n      for (var i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = [];\n        }\n        // check sparse matrix has a value @ i,j\n        if (w[i] === mark) {\n          // invoke callback, update C\n          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);\n        } else {\n          // dense matrix value @ i, j\n          cdata[i][j] = inverse ? cf(b, 0) : cf(0, b);\n        }\n      }\n    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { clone } from '../../../utils/object.js';\nvar name = 'matAlgo14xDs';\nvar dependencies = ['typed'];\nexport var createMatAlgo14xDs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, b).\n   * Callback function invoked MxN times.\n   *\n   * C(i,j,...z) = f(Aij..z, b)\n   *\n   * @param {Matrix}   a                 The DenseMatrix instance (A)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij..z,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Aij..z)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97659042\n   */\n  return function matAlgo14xDs(a, b, callback, inverse) {\n    // a arrays\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // populate cdata, iterate through dimensions\n    var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : [];\n\n    // c matrix\n    return a.createDenseMatrix({\n      data: cdata,\n      size: clone(asize),\n      datatype: dt\n    });\n  };\n\n  // recursive function\n  function _iterate(f, level, s, n, av, bv, inverse) {\n    // initialize array for this level\n    var cv = [];\n    // check we reach the last level\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (var i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv);\n      }\n    } else {\n      // iterate current level\n      for (var j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse);\n      }\n    }\n    return cv;\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo03xDSf';\nvar dependencies = ['typed'];\nexport var createMatAlgo03xDSf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Iterates over SparseMatrix items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked M*N times.\n   *\n   *\n   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  f(Dij, 0)    ; otherwise\n   *\n   *\n   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)\n   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (C)\n   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n   */\n  return function matAlgo03xDSf(denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype || denseMatrix.getDataType();\n    // sparse matrix arrays\n    var bvalues = sparseMatrix._values;\n    var bindex = sparseMatrix._index;\n    var bptr = sparseMatrix._ptr;\n    var bsize = sparseMatrix._size;\n    var bdt = sparseMatrix._datatype || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result (DenseMatrix)\n    var cdata = [];\n\n    // initialize dense matrix\n    for (var z = 0; z < rows; z++) {\n      // initialize row\n      cdata[z] = [];\n    }\n\n    // workspace\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns in b\n    for (var j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1;\n      // values in column j\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = bindex[k];\n        // update workspace\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);\n        w[i] = mark;\n      }\n      // process workspace\n      for (var y = 0; y < rows; y++) {\n        // check we have a calculated value for current row\n        if (w[y] === mark) {\n          // use calculated value\n          cdata[y][j] = x[y];\n        } else {\n          // calculate value\n          cdata[y][j] = inverse ? cf(zero, adata[y][j]) : cf(adata[y][j], zero);\n        }\n      }\n    }\n\n    // return dense matrix\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo05xSfSf';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo05xSfSf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MAX(NNZA, NNZB) times\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 || B(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function matAlgo05xSfSf(a, b, callback) {\n    // sparse matrix arrays\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();\n    // sparse matrix arrays\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n\n    // workspaces\n    var xa = cvalues ? [] : undefined;\n    var xb = cvalues ? [] : undefined;\n    // marks indicating we have a value in x for a given column\n    var wa = [];\n    var wb = [];\n\n    // vars\n    var i, j, k, k1;\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length;\n      // columns mark\n      var mark = j + 1;\n      // loop values A(:,j)\n      for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {\n        // row\n        i = aindex[k];\n        // push index\n        cindex.push(i);\n        // update workspace\n        wa[i] = mark;\n        // check we need to process values\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      }\n      // loop values B(:,j)\n      for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {\n        // row\n        i = bindex[k];\n        // check row existed in A\n        if (wa[i] !== mark) {\n          // push index\n          cindex.push(i);\n        }\n        // update workspace\n        wb[i] = mark;\n        // check we need to process values\n        if (xb) {\n          xb[i] = bvalues[k];\n        }\n      }\n      // check we need to process values (non pattern matrix)\n      if (cvalues) {\n        // initialize first index in j\n        k = cptr[j];\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          i = cindex[k];\n          // marks\n          var wai = wa[i];\n          var wbi = wb[i];\n          // check Aij or Bij are nonzero\n          if (wai === mark || wbi === mark) {\n            // matrix values @ i,j\n            var va = wai === mark ? xa[i] : zero;\n            var vb = wbi === mark ? xb[i] : zero;\n            // Cij\n            var vc = cf(va, vb);\n            // check for zero\n            if (!eq(vc, zero)) {\n              // push value\n              cvalues.push(vc);\n              // increment pointer\n              k++;\n            } else {\n              // remove value @ i, do not increment pointer\n              cindex.splice(k, 1);\n            }\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo13xDD';\nvar dependencies = ['typed'];\nexport var createMatAlgo13xDD = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, Bij..z).\n   * Callback function invoked MxN times.\n   *\n   * C(i,j,...z) = f(Aij..z, Bij..z)\n   *\n   * @param {Matrix}   a                 The DenseMatrix instance (A)\n   * @param {Matrix}   b                 The DenseMatrix instance (B)\n   * @param {Function} callback          The f(Aij..z,Bij..z) operation to invoke\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97658658\n   */\n  return function matAlgo13xDD(a, b, callback) {\n    // a arrays\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n    // b arrays\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype;\n    // c arrays\n    var csize = [];\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // validate each one of the dimension sizes\n    for (var s = 0; s < asize.length; s++) {\n      // must match\n      if (asize[s] !== bsize[s]) {\n        throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n      }\n      // update dimension in c\n      csize[s] = asize[s];\n    }\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt;\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // populate cdata, iterate through dimensions\n    var cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : [];\n\n    // c matrix\n    return a.createDenseMatrix({\n      data: cdata,\n      size: csize,\n      datatype: dt\n    });\n  };\n\n  // recursive function\n  function _iterate(f, level, s, n, av, bv) {\n    // initialize array for this level\n    var cv = [];\n    // check we reach the last level\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (var i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = f(av[i], bv[i]);\n      }\n    } else {\n      // iterate current level\n      for (var j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j]);\n      }\n    }\n    return cv;\n  }\n});","import { broadcastSizes, broadcastTo } from '../../../utils/array.js';\nimport { deepStrictEqual } from '../../../utils/object.js';\n\n/**\n* Broadcasts two matrices, and return both in an array\n* It checks if it's possible with broadcasting rules\n*\n* @param {Matrix}   A      First Matrix\n* @param {Matrix}   B      Second Matrix\n*\n* @return {Matrix[]}      [ broadcastedA, broadcastedB ]\n*/\n\nexport function broadcast(A, B) {\n  if (deepStrictEqual(A.size(), B.size())) {\n    // If matrices have the same size return them\n    return [A, B];\n  }\n\n  // calculate the broadcasted sizes\n  var newSize = broadcastSizes(A.size(), B.size());\n\n  // return the array with the two broadcasted matrices\n  return [A, B].map(M => _broadcastTo(M, newSize));\n}\n\n/**\n * Broadcasts a matrix to the given size.\n *\n * @param {Matrix} M - The matrix to be broadcasted.\n * @param {number[]} size - The desired size of the broadcasted matrix.\n * @returns {Matrix} The broadcasted matrix.\n * @throws {Error} If the size parameter is not an array of numbers.\n */\nfunction _broadcastTo(M, size) {\n  if (deepStrictEqual(M.size(), size)) {\n    return M;\n  }\n  return M.create(broadcastTo(M.valueOf(), size), M.datatype());\n}","import { factory } from '../../../utils/factory.js';\nimport { extend } from '../../../utils/object.js';\nimport { createMatAlgo13xDD } from './matAlgo13xDD.js';\nimport { createMatAlgo14xDs } from './matAlgo14xDs.js';\nimport { broadcast } from './broadcast.js';\nvar name = 'matrixAlgorithmSuite';\nvar dependencies = ['typed', 'matrix'];\nexport var createMatrixAlgorithmSuite = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n  var matAlgo13xDD = createMatAlgo13xDD({\n    typed\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n\n  /**\n   * Return a signatures object with the usual boilerplate of\n   * matrix algorithms, based on a plain options object with the\n   * following properties:\n   *   elop: function -- the elementwise operation to use, defaults to self\n   *   SS: function -- the algorithm to apply for two sparse matrices\n   *   DS: function -- the algorithm to apply for a dense and a sparse matrix\n   *   SD: function -- algo for a sparse and a dense; defaults to SD flipped\n   *   Ss: function -- the algorithm to apply for a sparse matrix and scalar\n   *   sS: function -- algo for scalar and sparse; defaults to Ss flipped\n   *   scalar: string -- typed-function type for scalars, defaults to 'any'\n   *\n   * If Ss is not specified, no matrix-scalar signatures are generated.\n   *\n   * @param {object} options\n   * @return {Object<string, function>} signatures\n   */\n  return function matrixAlgorithmSuite(options) {\n    var elop = options.elop;\n    var SD = options.SD || options.DS;\n    var matrixSignatures;\n    if (elop) {\n      // First the dense ones\n      matrixSignatures = {\n        'DenseMatrix, DenseMatrix': (x, y) => matAlgo13xDD(...broadcast(x, y), elop),\n        'Array, Array': (x, y) => matAlgo13xDD(...broadcast(matrix(x), matrix(y)), elop).valueOf(),\n        'Array, DenseMatrix': (x, y) => matAlgo13xDD(...broadcast(matrix(x), y), elop),\n        'DenseMatrix, Array': (x, y) => matAlgo13xDD(...broadcast(x, matrix(y)), elop)\n      };\n      // Now incorporate sparse matrices\n      if (options.SS) {\n        matrixSignatures['SparseMatrix, SparseMatrix'] = (x, y) => options.SS(...broadcast(x, y), elop, false);\n      }\n      if (options.DS) {\n        matrixSignatures['DenseMatrix, SparseMatrix'] = (x, y) => options.DS(...broadcast(x, y), elop, false);\n        matrixSignatures['Array, SparseMatrix'] = (x, y) => options.DS(...broadcast(matrix(x), y), elop, false);\n      }\n      if (SD) {\n        matrixSignatures['SparseMatrix, DenseMatrix'] = (x, y) => SD(...broadcast(y, x), elop, true);\n        matrixSignatures['SparseMatrix, Array'] = (x, y) => SD(...broadcast(matrix(y), x), elop, true);\n      }\n    } else {\n      // No elop, use this\n      // First the dense ones\n      matrixSignatures = {\n        'DenseMatrix, DenseMatrix': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(x, y), self);\n        }),\n        'Array, Array': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(matrix(x), matrix(y)), self).valueOf();\n        }),\n        'Array, DenseMatrix': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(matrix(x), y), self);\n        }),\n        'DenseMatrix, Array': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(x, matrix(y)), self);\n        })\n      };\n      // Now incorporate sparse matrices\n      if (options.SS) {\n        matrixSignatures['SparseMatrix, SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return options.SS(...broadcast(x, y), self, false);\n        });\n      }\n      if (options.DS) {\n        matrixSignatures['DenseMatrix, SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return options.DS(...broadcast(x, y), self, false);\n        });\n        matrixSignatures['Array, SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return options.DS(...broadcast(matrix(x), y), self, false);\n        });\n      }\n      if (SD) {\n        matrixSignatures['SparseMatrix, DenseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return SD(...broadcast(y, x), self, true);\n        });\n        matrixSignatures['SparseMatrix, Array'] = typed.referToSelf(self => (x, y) => {\n          return SD(...broadcast(matrix(y), x), self, true);\n        });\n      }\n    }\n\n    // Now add the scalars\n    var scalar = options.scalar || 'any';\n    var Ds = options.Ds || options.Ss;\n    if (Ds) {\n      if (elop) {\n        matrixSignatures['DenseMatrix,' + scalar] = (x, y) => matAlgo14xDs(x, y, elop, false);\n        matrixSignatures[scalar + ', DenseMatrix'] = (x, y) => matAlgo14xDs(y, x, elop, true);\n        matrixSignatures['Array,' + scalar] = (x, y) => matAlgo14xDs(matrix(x), y, elop, false).valueOf();\n        matrixSignatures[scalar + ', Array'] = (x, y) => matAlgo14xDs(matrix(y), x, elop, true).valueOf();\n      } else {\n        matrixSignatures['DenseMatrix,' + scalar] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(x, y, self, false);\n        });\n        matrixSignatures[scalar + ', DenseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(y, x, self, true);\n        });\n        matrixSignatures['Array,' + scalar] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(matrix(x), y, self, false).valueOf();\n        });\n        matrixSignatures[scalar + ', Array'] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(matrix(y), x, self, true).valueOf();\n        });\n      }\n    }\n    var sS = options.sS !== undefined ? options.sS : options.Ss;\n    if (elop) {\n      if (options.Ss) {\n        matrixSignatures['SparseMatrix,' + scalar] = (x, y) => options.Ss(x, y, elop, false);\n      }\n      if (sS) {\n        matrixSignatures[scalar + ', SparseMatrix'] = (x, y) => sS(y, x, elop, true);\n      }\n    } else {\n      if (options.Ss) {\n        matrixSignatures['SparseMatrix,' + scalar] = typed.referToSelf(self => (x, y) => {\n          return options.Ss(x, y, self, false);\n        });\n      }\n      if (sS) {\n        matrixSignatures[scalar + ', SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return sS(y, x, self, true);\n        });\n      }\n    }\n    // Also pull in the scalar signatures if the operator is a typed function\n    if (elop && elop.signatures) {\n      extend(matrixSignatures, elop.signatures);\n    }\n    return matrixSignatures;\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo01xDSid';\nvar dependencies = ['typed'];\nexport var createMatAlgo01xDSid = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).\n   *\n   *\n   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  Dij          ; otherwise\n   *\n   *\n   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)\n   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)\n   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n   */\n  return function algorithm1(denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype || denseMatrix.getDataType();\n    // sparse matrix arrays\n    var bvalues = sparseMatrix._values;\n    var bindex = sparseMatrix._index;\n    var bptr = sparseMatrix._ptr;\n    var bsize = sparseMatrix._size;\n    var bdt = sparseMatrix._datatype || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // process data types\n    var dt = typeof adt === 'string' && adt !== 'mixed' && adt === bdt ? adt : undefined;\n    // callback function\n    var cf = dt ? typed.find(callback, [dt, dt]) : callback;\n\n    // vars\n    var i, j;\n\n    // result (DenseMatrix)\n    var cdata = [];\n    // initialize c\n    for (i = 0; i < rows; i++) {\n      cdata[i] = [];\n    }\n\n    // workspace\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns in b\n    for (j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1;\n      // values in column j\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k];\n        // update workspace\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);\n        // mark i as updated\n        w[i] = mark;\n      }\n      // loop rows\n      for (i = 0; i < rows; i++) {\n        // check row is in workspace\n        if (w[i] === mark) {\n          // c[i][j] was already calculated\n          cdata[i][j] = x[i];\n        } else {\n          // item does not exist in S\n          cdata[i][j] = adata[i][j];\n        }\n      }\n    }\n\n    // return dense matrix\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo04xSidSid';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo04xSidSid = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MAX(NNZA, NNZB) times\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0 && B(i,j) === 0\n   *          └  B(i,j)       ; A(i,j) === 0\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function matAlgo04xSidSid(a, b, callback) {\n    // sparse matrix arrays\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();\n    // sparse matrix arrays\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n\n    // workspace\n    var xa = avalues && bvalues ? [] : undefined;\n    var xb = avalues && bvalues ? [] : undefined;\n    // marks indicating we have a value in x for a given column\n    var wa = [];\n    var wb = [];\n\n    // vars\n    var i, j, k, k0, k1;\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length;\n      // columns mark\n      var mark = j + 1;\n      // loop A(:,j)\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k];\n        // update c\n        cindex.push(i);\n        // update workspace\n        wa[i] = mark;\n        // check we need to process values\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      }\n      // loop B(:,j)\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k];\n        // check row exists in A\n        if (wa[i] === mark) {\n          // update record in xa @ i\n          if (xa) {\n            // invoke callback\n            var v = cf(xa[i], bvalues[k]);\n            // check for zero\n            if (!eq(v, zero)) {\n              // update workspace\n              xa[i] = v;\n            } else {\n              // remove mark (index will be removed later)\n              wa[i] = null;\n            }\n          }\n        } else {\n          // update c\n          cindex.push(i);\n          // update workspace\n          wb[i] = mark;\n          // check we need to process values\n          if (xb) {\n            xb[i] = bvalues[k];\n          }\n        }\n      }\n      // check we need to process values (non pattern matrix)\n      if (xa && xb) {\n        // initialize first index in j\n        k = cptr[j];\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          i = cindex[k];\n          // check workspace has value @ i\n          if (wa[i] === mark) {\n            // push value (Aij != 0 || (Aij != 0 && Bij != 0))\n            cvalues[k] = xa[i];\n            // increment pointer\n            k++;\n          } else if (wb[i] === mark) {\n            // push value (bij != 0)\n            cvalues[k] = xb[i];\n            // increment pointer\n            k++;\n          } else {\n            // remove index @ k\n            cindex.splice(k, 1);\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'matAlgo10xSids';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createMatAlgo10xSids = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\n  /**\n   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n   * Callback function invoked NZ times (number of nonzero items in S).\n   *\n   *\n   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  b          ; otherwise\n   *\n   *\n   * @param {Matrix}   s                 The SparseMatrix instance (S)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n  return function matAlgo10xSids(s, b, callback, inverse) {\n    // sparse matrix arrays\n    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype;\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cdata = [];\n\n    // workspaces\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1;\n      // values in j\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k];\n        // update workspace\n        x[r] = avalues[k];\n        w[r] = mark;\n      }\n      // loop rows\n      for (var i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = [];\n        }\n        // check sparse matrix has a value @ i,j\n        if (w[i] === mark) {\n          // invoke callback, update C\n          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);\n        } else {\n          // dense matrix value @ i, j\n          cdata[i][j] = b;\n        }\n      }\n    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../utils/factory.js';\nimport { multiplyNumber } from '../../plain/number/index.js';\nvar name = 'multiplyScalar';\nvar dependencies = ['typed'];\nexport var createMultiplyScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Multiply two scalar values, `x * y`.\n   * This function is meant for internal use: it is used by the public function\n   * `multiply`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value to multiply\n   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to multiply\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Multiplication of `x` and `y`\n   * @private\n   */\n  return typed('multiplyScalar', {\n    'number, number': multiplyNumber,\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return x.mul(y);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.times(y);\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x * y;\n    },\n    'Fraction, Fraction': function Fraction_Fraction(x, y) {\n      return x.mul(y);\n    },\n    'number | Fraction | BigNumber | Complex, Unit': (x, y) => y.multiply(x),\n    'Unit, number | Fraction | BigNumber | Complex | Unit': (x, y) => x.multiply(y)\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nvar name = 'multiply';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'equalScalar', 'dot'];\nexport var createMultiply = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    addScalar,\n    multiplyScalar,\n    equalScalar,\n    dot\n  } = _ref;\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  function _validateMatrixDimensions(size1, size2) {\n    // check left operand dimensions\n    switch (size1.length) {\n      case 1:\n        // check size2\n        switch (size2.length) {\n          case 1:\n            // Vector x Vector\n            if (size1[0] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Vectors must have the same length');\n            }\n            break;\n          case 2:\n            // Vector x Matrix\n            if (size1[0] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Vector length (' + size1[0] + ') must match Matrix rows (' + size2[0] + ')');\n            }\n            break;\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n        break;\n      case 2:\n        // check size2\n        switch (size2.length) {\n          case 1:\n            // Matrix x Vector\n            if (size1[1] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Matrix columns (' + size1[1] + ') must match Vector length (' + size2[0] + ')');\n            }\n            break;\n          case 2:\n            // Matrix x Matrix\n            if (size1[1] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Matrix A columns (' + size1[1] + ') must match Matrix B rows (' + size2[0] + ')');\n            }\n            break;\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n        break;\n      default:\n        throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix A has ' + size1.length + ' dimensions)');\n    }\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Dense Vector   (N)\n   * @param {Matrix} b            Dense Vector   (N)\n   *\n   * @return {number}             Scalar value\n   */\n  function _multiplyVectorVector(a, b, n) {\n    // check empty vector\n    if (n === 0) {\n      throw new Error('Cannot multiply two empty vectors');\n    }\n    return dot(a, b);\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Dense Vector   (M)\n   * @param {Matrix} b            Matrix         (MxN)\n   *\n   * @return {Matrix}             Dense Vector   (N)\n   */\n  function _multiplyVectorMatrix(a, b) {\n    // process storage\n    if (b.storage() !== 'dense') {\n      throw new Error('Support for SparseMatrix not implemented');\n    }\n    return _multiplyVectorDenseMatrix(a, b);\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Dense Vector   (M)\n   * @param {Matrix} b            Dense Matrix   (MxN)\n   *\n   * @return {Matrix}             Dense Vector   (N)\n   */\n  function _multiplyVectorDenseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype || a.getDataType();\n    // b dense\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype || b.getDataType();\n    // rows & columns\n    var alength = asize[0];\n    var bcolumns = bsize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var c = [];\n\n    // loop matrix columns\n    for (var j = 0; j < bcolumns; j++) {\n      // sum (do not initialize it with zero)\n      var sum = mf(adata[0], bdata[0][j]);\n      // loop vector\n      for (var i = 1; i < alength; i++) {\n        // multiply & accumulate\n        sum = af(sum, mf(adata[i], bdata[i][j]));\n      }\n      c[j] = sum;\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Matrix         (MxN)\n   * @param {Matrix} b            Dense Vector   (N)\n   *\n   * @return {Matrix}             Dense Vector   (M)\n   */\n  var _multiplyMatrixVector = typed('_multiplyMatrixVector', {\n    'DenseMatrix, any': _multiplyDenseMatrixVector,\n    'SparseMatrix, any': _multiplySparseMatrixVector\n  });\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Matrix         (MxN)\n   * @param {Matrix} b            Matrix         (NxC)\n   *\n   * @return {Matrix}             Matrix         (MxC)\n   */\n  var _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {\n    'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,\n    'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,\n    'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,\n    'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix\n  });\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            DenseMatrix  (MxN)\n   * @param {Matrix} b            Dense Vector (N)\n   *\n   * @return {Matrix}             Dense Vector (M)\n   */\n  function _multiplyDenseMatrixVector(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype || a.getDataType();\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype || b.getDataType();\n    // rows & columns\n    var arows = asize[0];\n    var acolumns = asize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var c = [];\n\n    // loop matrix a rows\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i];\n      // sum (do not initialize it with zero)\n      var sum = mf(row[0], bdata[0]);\n      // loop matrix a columns\n      for (var j = 1; j < acolumns; j++) {\n        // multiply & accumulate\n        sum = af(sum, mf(row[j], bdata[j]));\n      }\n      c[i] = sum;\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            DenseMatrix    (MxN)\n   * @param {Matrix} b            DenseMatrix    (NxC)\n   *\n   * @return {Matrix}             DenseMatrix    (MxC)\n   */\n  function _multiplyDenseMatrixDenseMatrix(a, b) {\n    // getDataType()\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype || a.getDataType();\n    // b dense\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype || b.getDataType();\n    // rows & columns\n    var arows = asize[0];\n    var acolumns = asize[1];\n    var bcolumns = bsize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var c = [];\n\n    // loop matrix a rows\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i];\n      // initialize row array\n      c[i] = [];\n      // loop matrix b columns\n      for (var j = 0; j < bcolumns; j++) {\n        // sum (avoid initializing sum to zero)\n        var sum = mf(row[0], bdata[0][j]);\n        // loop matrix a columns\n        for (var x = 1; x < acolumns; x++) {\n          // multiply & accumulate\n          sum = af(sum, mf(row[x], bdata[x][j]));\n        }\n        c[i][j] = sum;\n      }\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows, bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            DenseMatrix    (MxN)\n   * @param {Matrix} b            SparseMatrix   (NxC)\n   *\n   * @return {Matrix}             SparseMatrix   (MxC)\n   */\n  function _multiplyDenseMatrixSparseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype || a.getDataType();\n    // b sparse\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();\n    // validate b matrix\n    if (!bvalues) {\n      throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');\n    }\n    // rows & columns\n    var arows = asize[0];\n    var bcolumns = bsize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n    // equalScalar signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n    }\n\n    // result\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n    // c matrix\n    var c = b.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n\n    // loop b columns\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length;\n      // indeces in column jb\n      var kb0 = bptr[jb];\n      var kb1 = bptr[jb + 1];\n      // do not process column jb if no data exists\n      if (kb1 > kb0) {\n        // last row mark processed\n        var last = 0;\n        // loop a rows\n        for (var i = 0; i < arows; i++) {\n          // column mark\n          var mark = i + 1;\n          // C[i, jb]\n          var cij = void 0;\n          // values in b column j\n          for (var kb = kb0; kb < kb1; kb++) {\n            // row\n            var ib = bindex[kb];\n            // check value has been initialized\n            if (last !== mark) {\n              // first value in column jb\n              cij = mf(adata[i][ib], bvalues[kb]);\n              // update mark\n              last = mark;\n            } else {\n              // accumulate value\n              cij = af(cij, mf(adata[i][ib], bvalues[kb]));\n            }\n          }\n          // check column has been processed and value != 0\n          if (last === mark && !eq(cij, zero)) {\n            // push row & value\n            cindex.push(i);\n            cvalues.push(cij);\n          }\n        }\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length;\n\n    // return sparse matrix\n    return c;\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            SparseMatrix    (MxN)\n   * @param {Matrix} b            Dense Vector (N)\n   *\n   * @return {Matrix}             SparseMatrix    (M, 1)\n   */\n  function _multiplySparseMatrixVector(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();\n    // validate a matrix\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    }\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype || b.getDataType();\n    // rows & columns\n    var arows = a._size[0];\n    var brows = b._size[0];\n    // result\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n    // equalScalar signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n    }\n\n    // workspace\n    var x = [];\n    // vector with marks indicating a value x[i] exists in a given column\n    var w = [];\n\n    // update ptr\n    cptr[0] = 0;\n    // rows in b\n    for (var ib = 0; ib < brows; ib++) {\n      // b[ib]\n      var vbi = bdata[ib];\n      // check b[ib] != 0, avoid loops\n      if (!eq(vbi, zero)) {\n        // A values & index in ib column\n        for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n          // a row\n          var ia = aindex[ka];\n          // check value exists in current j\n          if (!w[ia]) {\n            // ia is new entry in j\n            w[ia] = true;\n            // add i to pattern of C\n            cindex.push(ia);\n            // x(ia) = A\n            x[ia] = mf(vbi, avalues[ka]);\n          } else {\n            // i exists in C already\n            x[ia] = af(x[ia], mf(vbi, avalues[ka]));\n          }\n        }\n      }\n    }\n    // copy values from x to column jb of c\n    for (var p1 = cindex.length, p = 0; p < p1; p++) {\n      // row\n      var ic = cindex[p];\n      // copy value\n      cvalues[p] = x[ic];\n    }\n    // update ptr\n    cptr[1] = cindex.length;\n\n    // matrix to return\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, 1],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            SparseMatrix      (MxN)\n   * @param {Matrix} b            DenseMatrix       (NxC)\n   *\n   * @return {Matrix}             SparseMatrix      (MxC)\n   */\n  function _multiplySparseMatrixDenseMatrix(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();\n    // validate a matrix\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    }\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype || b.getDataType();\n    // rows & columns\n    var arows = a._size[0];\n    var brows = b._size[0];\n    var bcolumns = b._size[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n    // equalScalar signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n    }\n\n    // result\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n    // c matrix\n    var c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n\n    // workspace\n    var x = [];\n    // vector with marks indicating a value x[i] exists in a given column\n    var w = [];\n\n    // loop b columns\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length;\n      // mark in workspace for current column\n      var mark = jb + 1;\n      // rows in jb\n      for (var ib = 0; ib < brows; ib++) {\n        // b[ib, jb]\n        var vbij = bdata[ib][jb];\n        // check b[ib, jb] != 0, avoid loops\n        if (!eq(vbij, zero)) {\n          // A values & index in ib column\n          for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // a row\n            var ia = aindex[ka];\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark;\n              // add i to pattern of C\n              cindex.push(ia);\n              // x(ia) = A\n              x[ia] = mf(vbij, avalues[ka]);\n            } else {\n              // i exists in C already\n              x[ia] = af(x[ia], mf(vbij, avalues[ka]));\n            }\n          }\n        }\n      }\n      // copy values from x to column jb of c\n      for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n        // row\n        var ic = cindex[p];\n        // copy value\n        cvalues[p] = x[ic];\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length;\n\n    // return sparse matrix\n    return c;\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            SparseMatrix      (MxN)\n   * @param {Matrix} b            SparseMatrix      (NxC)\n   *\n   * @return {Matrix}             SparseMatrix      (MxC)\n   */\n  function _multiplySparseMatrixSparseMatrix(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();\n    // b sparse\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();\n\n    // rows & columns\n    var arows = a._size[0];\n    var bcolumns = b._size[1];\n    // flag indicating both matrices (a & b) contain data\n    var values = avalues && bvalues;\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var cvalues = values ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n    // c matrix\n    var c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n\n    // workspace\n    var x = values ? [] : undefined;\n    // vector with marks indicating a value x[i] exists in a given column\n    var w = [];\n    // variables\n    var ka, ka0, ka1, kb, kb0, kb1, ia, ib;\n    // loop b columns\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length;\n      // mark in workspace for current column\n      var mark = jb + 1;\n      // B values & index in j\n      for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {\n        // b row\n        ib = bindex[kb];\n        // check we need to process values\n        if (values) {\n          // loop values in a[:,ib]\n          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // row\n            ia = aindex[ka];\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark;\n              // add i to pattern of C\n              cindex.push(ia);\n              // x(ia) = A\n              x[ia] = mf(bvalues[kb], avalues[ka]);\n            } else {\n              // i exists in C already\n              x[ia] = af(x[ia], mf(bvalues[kb], avalues[ka]));\n            }\n          }\n        } else {\n          // loop values in a[:,ib]\n          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // row\n            ia = aindex[ka];\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark;\n              // add i to pattern of C\n              cindex.push(ia);\n            }\n          }\n        }\n      }\n      // check we need to process matrix values (pattern matrix)\n      if (values) {\n        // copy values from x to column jb of c\n        for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n          // row\n          var ic = cindex[p];\n          // copy value\n          cvalues[p] = x[ic];\n        }\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length;\n\n    // return sparse matrix\n    return c;\n  }\n\n  /**\n   * Multiply two or more values, `x * y`.\n   * For matrices, the matrix product is calculated.\n   *\n   * Syntax:\n   *\n   *    math.multiply(x, y)\n   *    math.multiply(x, y, z, ...)\n   *\n   * Examples:\n   *\n   *    math.multiply(4, 5.2)        // returns number 20.8\n   *    math.multiply(2, 3, 4)       // returns number 24\n   *\n   *    const a = math.complex(2, 3)\n   *    const b = math.complex(4, 1)\n   *    math.multiply(a, b)          // returns Complex 5 + 14i\n   *\n   *    const c = [[1, 2], [4, 3]]\n   *    const d = [[1, 2, 3], [3, -4, 7]]\n   *    math.multiply(c, d)          // returns Array [[7, -6, 17], [13, -4, 33]]\n   *\n   *    const e = math.unit('2.1 km')\n   *    math.multiply(3, e)          // returns Unit 6.3 km\n   *\n   * See also:\n   *\n   *    divide, prod, cross, dot\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x First value to multiply\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Second value to multiply\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Multiplication of `x` and `y`\n   */\n  return typed(name, multiplyScalar, {\n    // we extend the signatures of multiplyScalar with signatures dealing with matrices\n\n    'Array, Array': typed.referTo('Matrix, Matrix', selfMM => (x, y) => {\n      // check dimensions\n      _validateMatrixDimensions(arraySize(x), arraySize(y));\n\n      // use dense matrix implementation\n      var m = selfMM(matrix(x), matrix(y));\n      // return array or scalar\n      return isMatrix(m) ? m.valueOf() : m;\n    }),\n    'Matrix, Matrix': function Matrix_Matrix(x, y) {\n      // dimensions\n      var xsize = x.size();\n      var ysize = y.size();\n\n      // check dimensions\n      _validateMatrixDimensions(xsize, ysize);\n\n      // process dimensions\n      if (xsize.length === 1) {\n        // process y dimensions\n        if (ysize.length === 1) {\n          // Vector * Vector\n          return _multiplyVectorVector(x, y, xsize[0]);\n        }\n        // Vector * Matrix\n        return _multiplyVectorMatrix(x, y);\n      }\n      // process y dimensions\n      if (ysize.length === 1) {\n        // Matrix * Vector\n        return _multiplyMatrixVector(x, y);\n      }\n      // Matrix * Matrix\n      return _multiplyMatrixMatrix(x, y);\n    },\n    'Matrix, Array': typed.referTo('Matrix,Matrix', selfMM => (x, y) => selfMM(x, matrix(y))),\n    'Array, Matrix': typed.referToSelf(self => (x, y) => {\n      // use Matrix * Matrix implementation\n      return self(matrix(x, y.storage()), y);\n    }),\n    'SparseMatrix, any': function SparseMatrix_any(x, y) {\n      return matAlgo11xS0s(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrix_any(x, y) {\n      return matAlgo14xDs(x, y, multiplyScalar, false);\n    },\n    'any, SparseMatrix': function any_SparseMatrix(x, y) {\n      return matAlgo11xS0s(y, x, multiplyScalar, true);\n    },\n    'any, DenseMatrix': function any_DenseMatrix(x, y) {\n      return matAlgo14xDs(y, x, multiplyScalar, true);\n    },\n    'Array, any': function Array_any(x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(x), y, multiplyScalar, false).valueOf();\n    },\n    'any, Array': function any_Array(x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(y), x, multiplyScalar, true).valueOf();\n    },\n    'any, any': multiplyScalar,\n    'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {\n      var result = self(x, y);\n      for (var i = 0; i < rest.length; i++) {\n        result = self(result, rest[i]);\n      }\n      return result;\n    })\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { signNumber } from '../../plain/number/index.js';\nvar name = 'sign';\nvar dependencies = ['typed', 'BigNumber', 'Fraction', 'complex'];\nexport var createSign = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber: _BigNumber,\n    complex,\n    Fraction: _Fraction\n  } = _ref;\n  /**\n   * Compute the sign of a value. The sign of a value x is:\n   *\n   * -  1 when x > 0\n   * - -1 when x < 0\n   * -  0 when x == 0\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sign(x)\n   *\n   * Examples:\n   *\n   *    math.sign(3.5)               // returns 1\n   *    math.sign(-4.2)              // returns -1\n   *    math.sign(0)                 // returns 0\n   *\n   *    math.sign([3, 5, -2, 0, 2])  // returns [1, 1, -1, 0, 1]\n   *\n   * See also:\n   *\n   *    abs\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit} x\n   *            The number for which to determine the sign\n   * @return {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit}\n   *            The sign of `x`\n   */\n  return typed(name, {\n    number: signNumber,\n    Complex: function Complex(x) {\n      return x.im === 0 ? complex(signNumber(x.re)) : x.sign();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(x.cmp(0));\n    },\n    bigint: function bigint(x) {\n      return x > 0n ? 1n : x < 0n ? -1n : 0n;\n    },\n    Fraction: function Fraction(x) {\n      return x.n === 0n ? new _Fraction(0) : new _Fraction(x.s);\n    },\n    // deep map collection, skip zeros since sign(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true)),\n    Unit: typed.referToSelf(self => x => {\n      if (!x._isDerived() && x.units[0].unit.offset !== 0) {\n        throw new TypeError('sign is ambiguous for units with offset');\n      }\n      return typed.find(self, x.valueType())(x.value);\n    })\n  });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'sqrt';\nvar dependencies = ['config', 'typed', 'Complex'];\nexport var createSqrt = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    config,\n    typed,\n    Complex\n  } = _ref;\n  /**\n   * Calculate the square root of a value.\n   *\n   * For matrices, if you want the matrix square root of a square matrix,\n   * use the `sqrtm` function. If you wish to apply `sqrt` elementwise to\n   * a matrix M, use `math.map(M, math.sqrt)`.\n   *\n   * Syntax:\n   *\n   *    math.sqrt(x)\n   *\n   * Examples:\n   *\n   *    math.sqrt(25)                // returns 5\n   *    math.square(5)               // returns 25\n   *    math.sqrt(-4)                // returns Complex 2i\n   *\n   * See also:\n   *\n   *    square, multiply, cube, cbrt, sqrtm\n   *\n   * @param {number | BigNumber | Complex | Unit} x\n   *            Value for which to calculate the square root.\n   * @return {number | BigNumber | Complex | Unit}\n   *            Returns the square root of `x`\n   */\n  return typed('sqrt', {\n    number: _sqrtNumber,\n    Complex: function Complex(x) {\n      return x.sqrt();\n    },\n    BigNumber: function BigNumber(x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.sqrt();\n      } else {\n        // negative value -> downgrade to number to do complex value computation\n        return _sqrtNumber(x.toNumber());\n      }\n    },\n    Unit: function Unit(x) {\n      // Someday will work for complex units when they are implemented\n      return x.pow(0.5);\n    }\n  });\n\n  /**\n   * Calculate sqrt for a number\n   * @param {number} x\n   * @returns {number | Complex} Returns the square root of x\n   * @private\n   */\n  function _sqrtNumber(x) {\n    if (isNaN(x)) {\n      return NaN;\n    } else if (x >= 0 || config.predictable) {\n      return Math.sqrt(x);\n    } else {\n      return new Complex(x, 0).sqrt();\n    }\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js';\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'subtract';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'subtractScalar', 'unaryMinus', 'DenseMatrix', 'concat'];\nexport var createSubtract = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    subtractScalar,\n    unaryMinus,\n    DenseMatrix,\n    concat\n  } = _ref;\n  // TODO: split function subtract in two: subtract and subtractScalar\n\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo05xSfSf = createMatAlgo05xSfSf({\n    typed,\n    equalScalar\n  });\n  var matAlgo10xSids = createMatAlgo10xSids({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n\n  /**\n   * Subtract two values, `x - y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.subtract(x, y)\n   *\n   * Examples:\n   *\n   *    math.subtract(5.3, 2)        // returns number 3.3\n   *\n   *    const a = math.complex(2, 3)\n   *    const b = math.complex(4, 1)\n   *    math.subtract(a, b)          // returns Complex -2 + 2i\n   *\n   *    math.subtract([5, 7, 4], 4)  // returns Array [1, 3, 0]\n   *\n   *    const c = math.unit('2.1 km')\n   *    const d = math.unit('500m')\n   *    math.subtract(c, d)          // returns Unit 1.6 km\n   *\n   * See also:\n   *\n   *    add\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x Initial value\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Value to subtract from `x`\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Subtraction of `x` and `y`\n   */\n  return typed(name, {\n    'any, any': subtractScalar\n  }, matrixAlgorithmSuite({\n    elop: subtractScalar,\n    SS: matAlgo05xSfSf,\n    DS: matAlgo01xDSid,\n    SD: matAlgo03xDSf,\n    Ss: matAlgo12xSfs,\n    sS: matAlgo10xSids\n  }));\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo07xSSf';\nvar dependencies = ['typed', 'SparseMatrix'];\nexport var createMatAlgo07xSSf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    SparseMatrix\n  } = _ref;\n  /**\n  * Iterates over SparseMatrix A and SparseMatrix B items (zero and nonzero) and invokes the callback function f(Aij, Bij).\n  * Callback function invoked MxN times.\n  *\n  * C(i,j) = f(Aij, Bij)\n  *\n  * @param {Matrix}   a                 The SparseMatrix instance (A)\n  * @param {Matrix}   b                 The SparseMatrix instance (B)\n  * @param {Function} callback          The f(Aij,Bij) operation to invoke\n  *\n  * @return {Matrix}                    SparseMatrix (C)\n  *\n  * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n  */\n  return function matAlgo07xSSf(a, b, callback) {\n    // sparse matrix arrays\n    var asize = a._size;\n    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();\n    var bsize = b._size;\n    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    var zero = 0;\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      dt = adt;\n      zero = typed.convert(0, dt);\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays for sparse format\n    var cvalues = [];\n    var cindex = [];\n    var cptr = new Array(columns + 1).fill(0); // Start with column pointer array\n\n    // workspaces\n    var xa = [];\n    var xb = [];\n    var wa = [];\n    var wb = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      var mark = j + 1;\n      var nonZeroCount = 0;\n      _scatter(a, j, wa, xa, mark);\n      _scatter(b, j, wb, xb, mark);\n\n      // loop rows\n      for (var i = 0; i < rows; i++) {\n        var va = wa[i] === mark ? xa[i] : zero;\n        var vb = wb[i] === mark ? xb[i] : zero;\n\n        // invoke callback\n        var cij = cf(va, vb);\n        // Store all non zero and true values\n        if (cij !== 0 && cij !== false) {\n          cindex.push(i); // row index\n          cvalues.push(cij); // computed value\n          nonZeroCount++;\n        }\n      }\n\n      // Update column pointer with cumulative count of non-zero values\n      cptr[j + 1] = cptr[j] + nonZeroCount;\n    }\n\n    // Return the result as a sparse matrix\n    return new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  };\n  function _scatter(m, j, w, x, mark) {\n    // a arrays\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n    // loop values in column j\n    for (var k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {\n      // row\n      var i = index[k];\n      // update workspace\n      w[i] = mark;\n      x[i] = values[k];\n    }\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'conj';\nvar dependencies = ['typed'];\nexport var createConj = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Compute the complex conjugate of a complex value.\n   * If `x = a+bi`, the complex conjugate of `x` is `a - bi`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.conj(x)\n   *\n   * Examples:\n   *\n   *    math.conj(math.complex('2 + 3i'))  // returns Complex 2 - 3i\n   *    math.conj(math.complex('2 - 3i'))  // returns Complex 2 + 3i\n   *    math.conj(math.complex('-5.2i'))  // returns Complex 5.2i\n   *\n   * See also:\n   *\n   *    re, im, arg, abs\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix | Unit} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Complex | Array | Matrix | Unit}\n   *            The complex conjugate of x\n   */\n  return typed(name, {\n    'number | BigNumber | Fraction': x => x,\n    Complex: x => x.conjugate(),\n    Unit: typed.referToSelf(self => x => new x.constructor(self(x.toNumeric()), x.formatUnits())),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'im';\nvar dependencies = ['typed'];\nexport var createIm = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Get the imaginary part of a complex number.\n   * For a complex number `a + bi`, the function returns `b`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.im(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 3)\n   *    math.re(a)                     // returns number 2\n   *    math.im(a)                     // returns number 3\n   *\n   *    math.re(math.complex('-5.2i')) // returns number -5.2\n   *    math.re(math.complex(2.4))     // returns number 0\n   *\n   * See also:\n   *\n   *    re, conj, abs, arg\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The imaginary part of x\n   */\n  return typed(name, {\n    number: () => 0,\n    'BigNumber | Fraction': x => x.mul(0),\n    Complex: x => x.im,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 're';\nvar dependencies = ['typed'];\nexport var createRe = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Get the real part of a complex number.\n   * For a complex number `a + bi`, the function returns `a`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.re(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 3)\n   *    math.re(a)                     // returns number 2\n   *    math.im(a)                     // returns number 3\n   *\n   *    math.re(math.complex('-5.2i')) // returns number 0\n   *    math.re(math.complex(2.4))     // returns number 2.4\n   *\n   * See also:\n   *\n   *    im, conj, abs, arg\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The real part of x\n   */\n  return typed(name, {\n    'number | BigNumber | Fraction': x => x,\n    Complex: x => x.re,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { isBigNumber, isMatrix, isNumber } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { arraySize, concat as _concat } from '../../utils/array.js';\nimport { IndexError } from '../../error/IndexError.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'concat';\nvar dependencies = ['typed', 'matrix', 'isInteger'];\nexport var createConcat = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    isInteger\n  } = _ref;\n  /**\n   * Concatenate two or more matrices.\n   *\n   * Syntax:\n   *\n   *     math.concat(A, B, C, ...)\n   *     math.concat(A, B, C, ..., dim)\n   *\n   * Where:\n   *\n   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.\n   *   By default the last dimension of the matrices.\n   *\n   * Examples:\n   *\n   *    const A = [[1, 2], [5, 6]]\n   *    const B = [[3, 4], [7, 8]]\n   *\n   *    math.concat(A, B)                  // returns [[1, 2, 3, 4], [5, 6, 7, 8]]\n   *    math.concat(A, B, 0)               // returns [[1, 2], [5, 6], [3, 4], [7, 8]]\n   *    math.concat('hello', ' ', 'world') // returns 'hello world'\n   *\n   * See also:\n   *\n   *    size, squeeze, subset, transpose\n   *\n   * @param {... Array | Matrix} args     Two or more matrices\n   * @return {Array | Matrix} Concatenated matrix\n   */\n  return typed(name, {\n    // TODO: change signature to '...Array | Matrix, dim?' when supported\n    '...Array | Matrix | number | BigNumber': function Array__Matrix__number__BigNumber(args) {\n      var i;\n      var len = args.length;\n      var dim = -1; // zero-based dimension\n      var prevDim;\n      var asMatrix = false;\n      var matrices = []; // contains multi dimensional arrays\n\n      for (i = 0; i < len; i++) {\n        var arg = args[i];\n\n        // test whether we need to return a Matrix (if not we return an Array)\n        if (isMatrix(arg)) {\n          asMatrix = true;\n        }\n        if (isNumber(arg) || isBigNumber(arg)) {\n          if (i !== len - 1) {\n            throw new Error('Dimension must be specified as last argument');\n          }\n\n          // last argument contains the dimension on which to concatenate\n          prevDim = dim;\n          dim = arg.valueOf(); // change BigNumber to number\n\n          if (!isInteger(dim)) {\n            throw new TypeError('Integer number expected for dimension');\n          }\n          if (dim < 0 || i > 0 && dim > prevDim) {\n            // TODO: would be more clear when throwing a DimensionError here\n            throw new IndexError(dim, prevDim + 1);\n          }\n        } else {\n          // this is a matrix or array\n          var m = clone(arg).valueOf();\n          var size = arraySize(m);\n          matrices[i] = m;\n          prevDim = dim;\n          dim = size.length - 1;\n\n          // verify whether each of the matrices has the same number of dimensions\n          if (i > 0 && dim !== prevDim) {\n            throw new DimensionError(prevDim + 1, dim + 1);\n          }\n        }\n      }\n      if (matrices.length === 0) {\n        throw new SyntaxError('At least one matrix expected');\n      }\n      var res = matrices.shift();\n      while (matrices.length) {\n        res = _concat(res, matrices.shift(), dim);\n      }\n      return asMatrix ? matrix(res) : res;\n    },\n    '...string': function string(args) {\n      return args.join('');\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { validateIndex } from '../../utils/array.js';\nvar name = 'column';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\nexport var createColumn = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\n  /**\n   * Return a column from a Matrix.\n   *\n   * Syntax:\n   *\n   *     math.column(value, index)\n   *\n   * Example:\n   *\n   *     // get a column\n   *     const d = [[1, 2], [3, 4]]\n   *     math.column(d, 1) // returns [[2], [4]]\n   *\n   * See also:\n   *\n   *     row\n   *\n   * @param {Array | Matrix } value   An array or matrix\n   * @param {number} column           The index of the column\n   * @return {Array | Matrix}         The retrieved column\n   */\n  return typed(name, {\n    'Matrix, number': _column,\n    'Array, number': function Array_number(value, column) {\n      return _column(matrix(clone(value)), column).valueOf();\n    }\n  });\n\n  /**\n   * Retrieve a column of a matrix\n   * @param {Matrix } value  A matrix\n   * @param {number} column  The index of the column\n   * @return {Matrix}        The retrieved column\n   */\n  function _column(value, column) {\n    // check dimensions\n    if (value.size().length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    validateIndex(column, value.size()[1]);\n    var rowRange = range(0, value.size()[0]);\n    var index = new Index(rowRange, [column]);\n    var result = value.subset(index);\n    // once config.legacySubset just return result\n    return isMatrix(result) ? result : matrix([[result]]);\n  }\n});","import { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'diag';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix'];\nexport var createDiag = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n  /**\n   * Create a diagonal matrix or retrieve the diagonal of a matrix\n   *\n   * When `x` is a vector, a matrix with vector `x` on the diagonal will be returned.\n   * When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector.\n   * When k is positive, the values are placed on the super diagonal.\n   * When k is negative, the values are placed on the sub diagonal.\n   *\n   * Syntax:\n   *\n   *     math.diag(X)\n   *     math.diag(X, format)\n   *     math.diag(X, k)\n   *     math.diag(X, k, format)\n   *\n   * Examples:\n   *\n   *     // create a diagonal matrix\n   *     math.diag([1, 2, 3])      // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]]\n   *     math.diag([1, 2, 3], 1)   // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]]\n   *     math.diag([1, 2, 3], -1)  // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]]\n   *\n   *    // retrieve the diagonal from a matrix\n   *    const a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]\n   *    math.diag(a)   // returns [1, 5, 9]\n   *\n   * See also:\n   *\n   *     ones, zeros, identity\n   *\n   * @param {Matrix | Array} x          A two dimensional matrix or a vector\n   * @param {number | BigNumber} [k=0]  The diagonal where the vector will be filled\n   *                                    in or retrieved.\n   * @param {string} [format='dense']   The matrix storage format.\n   *\n   * @returns {Matrix | Array} Diagonal matrix from input vector, or diagonal from input matrix.\n   */\n  return typed(name, {\n    // FIXME: simplify this huge amount of signatures as soon as typed-function supports optional arguments\n\n    Array: function Array(x) {\n      return _diag(x, 0, arraySize(x), null);\n    },\n    'Array, number': function Array_number(x, k) {\n      return _diag(x, k, arraySize(x), null);\n    },\n    'Array, BigNumber': function Array_BigNumber(x, k) {\n      return _diag(x, k.toNumber(), arraySize(x), null);\n    },\n    'Array, string': function Array_string(x, format) {\n      return _diag(x, 0, arraySize(x), format);\n    },\n    'Array, number, string': function Array_number_string(x, k, format) {\n      return _diag(x, k, arraySize(x), format);\n    },\n    'Array, BigNumber, string': function Array_BigNumber_string(x, k, format) {\n      return _diag(x, k.toNumber(), arraySize(x), format);\n    },\n    Matrix: function Matrix(x) {\n      return _diag(x, 0, x.size(), x.storage());\n    },\n    'Matrix, number': function Matrix_number(x, k) {\n      return _diag(x, k, x.size(), x.storage());\n    },\n    'Matrix, BigNumber': function Matrix_BigNumber(x, k) {\n      return _diag(x, k.toNumber(), x.size(), x.storage());\n    },\n    'Matrix, string': function Matrix_string(x, format) {\n      return _diag(x, 0, x.size(), format);\n    },\n    'Matrix, number, string': function Matrix_number_string(x, k, format) {\n      return _diag(x, k, x.size(), format);\n    },\n    'Matrix, BigNumber, string': function Matrix_BigNumber_string(x, k, format) {\n      return _diag(x, k.toNumber(), x.size(), format);\n    }\n  });\n\n  /**\n   * Creeate diagonal matrix from a vector or vice versa\n   * @param {Array | Matrix} x\n   * @param {number} k\n   * @param {string} format Storage format for matrix. If null,\n   *                          an Array is returned\n   * @returns {Array | Matrix}\n   * @private\n   */\n  function _diag(x, k, size, format) {\n    if (!isInteger(k)) {\n      throw new TypeError('Second parameter in function diag must be an integer');\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // check dimensions\n    switch (size.length) {\n      case 1:\n        return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper);\n      case 2:\n        return _getDiagonal(x, k, format, size, kSub, kSuper);\n    }\n    throw new RangeError('Matrix for function diag must be 2 dimensional');\n  }\n  function _createDiagonalMatrix(x, k, format, l, kSub, kSuper) {\n    // matrix size\n    var ms = [l + kSub, l + kSuper];\n    if (format && format !== 'sparse' && format !== 'dense') {\n      throw new TypeError(\"Unknown matrix type \".concat(format, \"\\\"\"));\n    }\n\n    // create diagonal matrix\n    var m = format === 'sparse' ? SparseMatrix.diagonal(ms, x, k) : DenseMatrix.diagonal(ms, x, k);\n    // check we need to return a matrix\n    return format !== null ? m : m.valueOf();\n  }\n  function _getDiagonal(x, k, format, s, kSub, kSuper) {\n    // check x is a Matrix\n    if (isMatrix(x)) {\n      // get diagonal matrix\n      var dm = x.diagonal(k);\n      // check we need to return a matrix\n      if (format !== null) {\n        // check we need to change matrix format\n        if (format !== dm.storage()) {\n          return matrix(dm, format);\n        }\n        return dm;\n      }\n      return dm.valueOf();\n    }\n    // vector size\n    var n = Math.min(s[0] - kSub, s[1] - kSuper);\n    // diagonal values\n    var vector = [];\n    // loop diagonal\n    for (var i = 0; i < n; i++) {\n      vector[i] = x[i + kSub][i + kSuper];\n    }\n    // check we need to return a matrix\n    return format !== null ? matrix(vector) : vector;\n  }\n});","import { flatten as flattenArray } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'flatten';\nvar dependencies = ['typed'];\nexport var createFlatten = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Flatten a multidimensional matrix into a single dimensional matrix.\n   * A new matrix is returned, the original matrix is left untouched.\n   *\n   * Syntax:\n   *\n   *    math.flatten(x)\n   *\n   * Examples:\n   *\n   *    math.flatten([[1,2], [3,4]])   // returns [1, 2, 3, 4]\n   *\n   * See also:\n   *\n   *    concat, resize, size, squeeze\n   *\n   * @param {DenseMatrix | Array} x   Matrix to be flattened\n   * @return {DenseMatrix | Array} Returns the flattened matrix\n   */\n  return typed(name, {\n    Array: function Array(x) {\n      return flattenArray(x);\n    },\n    DenseMatrix: function DenseMatrix(x) {\n      // Return the same matrix type as x (Dense or Sparse Matrix)\n      // Return the same data type as x\n      return x.create(flattenArray(x.valueOf(), true), x.datatype());\n    },\n    SparseMatrix: function SparseMatrix(_x) {\n      throw new TypeError('SparseMatrix is not supported by function flatten ' + 'because it does not support 1D vectors. ' + 'Convert to a DenseMatrix or Array first. Example: flatten(x.toArray())');\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { getArrayDataType } from '../../utils/array.js';\nimport { typeOf } from '../../utils/is.js';\nvar name = 'getMatrixDataType';\nvar dependencies = ['typed'];\nexport var createGetMatrixDataType = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Find the data type of all elements in a matrix or array,\n   * for example 'number' if all items are a number and 'Complex' if all values\n   * are complex numbers.\n   * If a matrix contains more than one data type, it will return 'mixed'.\n   *\n   * Syntax:\n   *\n   *    math.getMatrixDataType(x)\n   *\n   * Examples:\n   *\n   *    const x = [ [1, 2, 3], [4, 5, 6] ]\n   *    const mixedX = [ [1, true], [2, 3] ]\n   *    const fractionX = [ [math.fraction(1, 3)], [math.fraction(1, 3)] ]\n   *    const unitX = [ [math.unit('5cm')], [math.unit('5cm')] ]\n   *    const bigNumberX = [ [math.bignumber(1)], [math.bignumber(0)] ]\n   *    const sparse = math.sparse(x)\n   *    const dense = math.matrix(x)\n   *    math.getMatrixDataType(x)   // returns 'number'\n   *    math.getMatrixDataType(sparse)   // returns 'number'\n   *    math.getMatrixDataType(dense)   // returns 'number'\n   *    math.getMatrixDataType(mixedX) // returns 'mixed'\n   *    math.getMatrixDataType(fractionX) // returns 'Fraction'\n   *    math.getMatrixDataType(unitX) // returns 'Unit'\n   *    math.getMatrixDataType(bigNumberX) // return 'BigNumber'\n   *\n   * See also:\n   *  SparseMatrix, DenseMatrix\n   *\n   * @param {...Matrix | Array} x   The Matrix with values.\n   *\n   * @return {string} A string representation of the matrix type\n   */\n  return typed(name, {\n    Array: function Array(x) {\n      return getArrayDataType(x, typeOf);\n    },\n    Matrix: function Matrix(x) {\n      return x.getDataType();\n    }\n  });\n});","import { isBigNumber } from '../../utils/is.js';\nimport { resize } from '../../utils/array.js';\nimport { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'identity';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix'];\nexport var createIdentity = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n  /**\n   * Create a 2-dimensional identity matrix with size m x n or n x n.\n   * The matrix has ones on the diagonal and zeros elsewhere.\n   *\n   * Syntax:\n   *\n   *    math.identity(n)\n   *    math.identity(n, format)\n   *    math.identity(m, n)\n   *    math.identity(m, n, format)\n   *    math.identity([m, n])\n   *    math.identity([m, n], format)\n   *\n   * Examples:\n   *\n   *    math.identity(3)                    // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]]\n   *    math.identity(3, 2)                 // returns [[1, 0], [0, 1], [0, 0]]\n   *\n   *    const A = [[1, 2, 3], [4, 5, 6]]\n   *    math.identity(math.size(A))         // returns [[1, 0, 0], [0, 1, 0]]\n   *\n   * See also:\n   *\n   *    diag, ones, zeros, size, range\n   *\n   * @param {...number | Matrix | Array} size   The size for the matrix\n   * @param {string} [format]                   The Matrix storage format\n   *\n   * @return {Matrix | Array | number} A matrix with ones on the diagonal.\n   */\n  return typed(name, {\n    '': function _() {\n      return config.matrix === 'Matrix' ? matrix([]) : [];\n    },\n    string: function string(format) {\n      return matrix(format);\n    },\n    'number | BigNumber': function number__BigNumber(rows) {\n      return _identity(rows, rows, config.matrix === 'Matrix' ? 'dense' : undefined);\n    },\n    'number | BigNumber, string': function number__BigNumber_string(rows, format) {\n      return _identity(rows, rows, format);\n    },\n    'number | BigNumber, number | BigNumber': function number__BigNumber_number__BigNumber(rows, cols) {\n      return _identity(rows, cols, config.matrix === 'Matrix' ? 'dense' : undefined);\n    },\n    'number | BigNumber, number | BigNumber, string': function number__BigNumber_number__BigNumber_string(rows, cols, format) {\n      return _identity(rows, cols, format);\n    },\n    Array: function Array(size) {\n      return _identityVector(size);\n    },\n    'Array, string': function Array_string(size, format) {\n      return _identityVector(size, format);\n    },\n    Matrix: function Matrix(size) {\n      return _identityVector(size.valueOf(), size.storage());\n    },\n    'Matrix, string': function Matrix_string(size, format) {\n      return _identityVector(size.valueOf(), format);\n    }\n  });\n  function _identityVector(size, format) {\n    switch (size.length) {\n      case 0:\n        return format ? matrix(format) : [];\n      case 1:\n        return _identity(size[0], size[0], format);\n      case 2:\n        return _identity(size[0], size[1], format);\n      default:\n        throw new Error('Vector containing two values expected');\n    }\n  }\n\n  /**\n   * Create an identity matrix\n   * @param {number | BigNumber} rows\n   * @param {number | BigNumber} cols\n   * @param {string} [format]\n   * @returns {Matrix}\n   * @private\n   */\n  function _identity(rows, cols, format) {\n    // BigNumber constructor with the right precision\n    var Big = isBigNumber(rows) || isBigNumber(cols) ? BigNumber : null;\n    if (isBigNumber(rows)) rows = rows.toNumber();\n    if (isBigNumber(cols)) cols = cols.toNumber();\n    if (!isInteger(rows) || rows < 1) {\n      throw new Error('Parameters in function identity must be positive integers');\n    }\n    if (!isInteger(cols) || cols < 1) {\n      throw new Error('Parameters in function identity must be positive integers');\n    }\n    var one = Big ? new BigNumber(1) : 1;\n    var defaultValue = Big ? new Big(0) : 0;\n    var size = [rows, cols];\n\n    // check we need to return a matrix\n    if (format) {\n      // create diagonal matrix (use optimized implementation for storage format)\n      if (format === 'sparse') {\n        return SparseMatrix.diagonal(size, one, 0, defaultValue);\n      }\n      if (format === 'dense') {\n        return DenseMatrix.diagonal(size, one, 0, defaultValue);\n      }\n      throw new TypeError(\"Unknown matrix type \\\"\".concat(format, \"\\\"\"));\n    }\n\n    // create and resize array\n    var res = resize([], size, defaultValue);\n    // fill in ones on the diagonal\n    var minimum = rows < cols ? rows : cols;\n    // fill diagonal\n    for (var d = 0; d < minimum; d++) {\n      res[d][d] = one;\n    }\n    return res;\n  }\n});","import { optimizeCallback } from '../../utils/optimizeCallback.js';\nimport { arraySize, broadcastSizes, broadcastTo, get, deepMap } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'map';\nvar dependencies = ['typed'];\nexport var createMap = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Create a new matrix or array with the results of a callback function executed on\n   * each entry of a given matrix/array.\n   *\n   * For each entry of the input,\n   *\n   * the callback is invoked with 2N + 1 arguments:\n   * the N values of the entry, the index at which that entry occurs, and the N full\n   * broadcasted matrix/array being traversed where N is the number of matrices being traversed.\n   * Note that because the matrix/array might be\n   * multidimensional, the \"index\" argument is always an array of numbers giving\n   * the index in each dimension. This is true even for vectors: the \"index\"\n   * argument is an array of length 1, rather than simply a number.\n   *\n   * Syntax:\n   *\n   *    math.map(x, callback)\n   *    math.map(x, y, ..., callback)\n   *\n   * Examples:\n   *\n   *    math.map([1, 2, 3], function(value) {\n   *      return value * value\n   *    })  // returns [1, 4, 9]\n   *    math.map([1, 2], [3, 4], function(a, b) {\n   *     return a + b\n   *    })  // returns [4, 6]\n   *\n   *    // The callback is normally called with three arguments:\n   *    //    callback(value, index, Array)\n   *    // If you want to call with only one argument, use:\n   *    math.map([1, 2, 3], x => math.format(x)) // returns ['1', '2', '3']\n   *    // It can also be called with 2N + 1 arguments: for N arrays\n   *    //    callback(value1, value2, index, BroadcastedArray1, BroadcastedArray2)\n   *\n   * History:\n   *\n   *    v0.13  Created\n   *    v1.1   Clone the indices on each callback in case callback mutates\n   *    v13.1  Support multiple inputs to the callback\n   *\n   * See also:\n   *\n   *    filter, forEach, sort\n   *\n   * @param {Matrix | Array} x    The input to iterate on.\n   * @param {Function} callback\n   *     The function to call (as described above) on each entry of the input\n   * @return {Matrix | array}\n   *     Transformed map of x; always has the same type and shape as x\n   */\n  return typed(name, {\n    'Array, function': _mapArray,\n    'Matrix, function': function Matrix_function(x, callback) {\n      return x.map(callback);\n    },\n    'Array|Matrix, Array|Matrix, ...Array|Matrix|function': (A, B, rest) => _mapMultiple([A, B, ...rest.slice(0, rest.length - 1)], rest[rest.length - 1])\n  });\n\n  /**\n  * Maps over multiple arrays or matrices.\n  *\n  * @param {Array<Array|Matrix>} Arrays - An array of arrays or matrices to map over.\n  * @param {function} multiCallback - The callback function to apply to each element.\n  * @throws {Error} If the last argument is not a callback function.\n  * @returns {Array|Matrix} A new array or matrix with each element being the result of the callback function.\n  *\n  * @example\n  * _mapMultiple([[1, 2, 3], [4, 5, 6]], (a, b) => a + b); // Returns [5, 7, 9]\n  */\n  function _mapMultiple(Arrays, multiCallback) {\n    if (typeof multiCallback !== 'function') {\n      throw new Error('Last argument must be a callback function');\n    }\n    var firstArrayIsMatrix = Arrays[0].isMatrix;\n    var sizes = Arrays.map(M => M.isMatrix ? M.size() : arraySize(M));\n    var newSize = broadcastSizes(...sizes);\n    var numberOfArrays = Arrays.length;\n    var _get = firstArrayIsMatrix ? (matrix, idx) => matrix.get(idx) : get;\n    var firstValues = Arrays.map((collection, i) => {\n      var firstIndex = sizes[i].map(() => 0);\n      return collection.isMatrix ? collection.get(firstIndex) : get(collection, firstIndex);\n    });\n    var callbackArgCount = typed.isTypedFunction(multiCallback) ? _getTypedCallbackArgCount(multiCallback, firstValues, newSize.map(() => 0), Arrays) : _getCallbackArgCount(multiCallback, numberOfArrays);\n    if (callbackArgCount < 2) {\n      var _callback = _getLimitedCallback(callbackArgCount, multiCallback, null);\n      return mapMultiple(Arrays, _callback);\n    }\n    var broadcastedArrays = firstArrayIsMatrix ? Arrays.map(M => M.isMatrix ? M.create(broadcastTo(M.toArray(), newSize), M.datatype()) : Arrays[0].create(broadcastTo(M.valueOf(), newSize))) : Arrays.map(M => M.isMatrix ? broadcastTo(M.toArray(), newSize) : broadcastTo(M, newSize));\n    var callback = _getLimitedCallback(callbackArgCount, multiCallback, broadcastedArrays);\n    var broadcastedArraysCallback = (x, idx) => callback([x, ...broadcastedArrays.slice(1).map(array => _get(array, idx))], idx);\n    if (firstArrayIsMatrix) {\n      return broadcastedArrays[0].map(broadcastedArraysCallback);\n    } else {\n      return _mapArray(broadcastedArrays[0], broadcastedArraysCallback);\n    }\n  }\n  function mapMultiple(collections, callback) {\n    // collections can be matrices or arrays\n    // callback must be a function of the form (collections, [index])\n    var firstCollection = collections[0];\n    var arrays = collections.map(collection => collection.isMatrix ? collection.valueOf() : collection);\n    var sizes = collections.map(collection => collection.isMatrix ? collection.size() : arraySize(collection));\n    var finalSize = broadcastSizes(...sizes);\n    // the offset means for each initial array, how much smaller is it than the final size\n    var offsets = sizes.map(size => finalSize.length - size.length);\n    var maxDepth = finalSize.length - 1;\n    var callbackUsesIndex = callback.length > 1;\n    var index = callbackUsesIndex ? [] : null;\n    var resultsArray = iterate(arrays, 0);\n    if (firstCollection.isMatrix) {\n      var resultsMatrix = firstCollection.create();\n      resultsMatrix._data = resultsArray;\n      resultsMatrix._size = finalSize;\n      return resultsMatrix;\n    } else {\n      return resultsArray;\n    }\n    function iterate(arrays) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      // each array can have different sizes\n      var currentDimensionSize = finalSize[depth];\n      var result = Array(currentDimensionSize);\n      if (depth < maxDepth) {\n        var _loop = function _loop(i) {\n          if (index) index[depth] = i;\n          // if there is an offset greater than the current dimension\n          // pass the array, if the size of the array is 1 pass the first\n          // element of the array\n          result[i] = iterate(arrays.map((array, arrayIndex) => offsets[arrayIndex] > depth ? array : array.length === 1 ? array[0] : array[i]), depth + 1);\n        };\n        for (var i = 0; i < currentDimensionSize; i++) {\n          _loop(i);\n        }\n      } else {\n        var _loop2 = function _loop2(_i) {\n          if (index) index[depth] = _i;\n          result[_i] = callback(arrays.map(a => a.length === 1 ? a[0] : a[_i]), index ? index.slice() : undefined);\n        };\n        for (var _i = 0; _i < currentDimensionSize; _i++) {\n          _loop2(_i);\n        }\n      }\n      return result;\n    }\n  }\n\n  /**\n    * Creates a limited callback based on the argument pattern.\n    * @param {number} callbackArgCount - The argument pattern (0, 1, or 2)\n    * @param {Function} multiCallback - The original callback function\n    * @param {Array} broadcastedArrays - The broadcasted arrays (for case 2)\n    * @returns {Function} The limited callback function\n    */\n  function _getLimitedCallback(callbackArgCount, multiCallback, broadcastedArrays) {\n    switch (callbackArgCount) {\n      case 0:\n        return x => multiCallback(...x);\n      case 1:\n        return (x, idx) => multiCallback(...x, idx);\n      case 2:\n        return (x, idx) => multiCallback(...x, idx, ...broadcastedArrays);\n    }\n  }\n\n  /**\n     * Determines the argument pattern of a regular callback function.\n     * @param {Function} callback - The callback function to analyze\n     * @param {number} numberOfArrays - Number of arrays being processed\n     * @returns {number} 0 = values only, 1 = values + index, 2 = values + index + arrays\n     */\n  function _getCallbackArgCount(callback, numberOfArrays) {\n    var callbackStr = callback.toString();\n    // Check if the callback function uses `arguments`\n    if (/arguments/.test(callbackStr)) return 2;\n\n    // Extract the parameters of the callback function\n    var paramsStr = callbackStr.match(/\\(.*?\\)/);\n    // Check if the callback function uses rest parameters\n    if (/\\.\\.\\./.test(paramsStr)) return 2;\n    if (callback.length > numberOfArrays + 1) {\n      return 2;\n    }\n    if (callback.length === numberOfArrays + 1) {\n      return 1;\n    }\n    return 0;\n  }\n\n  /**\n  * Determines the argument pattern of a typed callback function.\n  * @param {Function} callback - The typed callback function to analyze\n  * @param {Array} values - Sample values for signature resolution\n  * @param {Array} idx - Sample index for signature resolution\n  * @param {Array} arrays - Sample arrays for signature resolution\n  * @returns {number} 0 = values only, 1 = values + index, 2 = values + index + arrays\n  */\n\n  function _getTypedCallbackArgCount(callback, values, idx, arrays) {\n    if (typed.resolve(callback, [...values, idx, ...arrays]) !== null) {\n      return 2;\n    }\n    if (typed.resolve(callback, [...values, idx]) !== null) {\n      return 1;\n    }\n    if (typed.resolve(callback, values) !== null) {\n      return 0;\n    }\n    // this should never happen\n    return 0;\n  }\n  /**\n  * Map for a multi dimensional array\n  * @param {Array} array\n  * @param {Function} callback\n  * @return {Array}\n  * @private\n  */\n  function _mapArray(array, callback) {\n    var fastCallback = optimizeCallback(callback, array, name);\n    return deepMap(array, fastCallback.fn, fastCallback.isUnary);\n  }\n});","export function noBignumber() {\n  throw new Error('No \"bignumber\" implementation available');\n}\nexport function noFraction() {\n  throw new Error('No \"fraction\" implementation available');\n}\nexport function noMatrix() {\n  throw new Error('No \"matrix\" implementation available');\n}\nexport function noIndex() {\n  throw new Error('No \"index\" implementation available');\n}\nexport function noSubset() {\n  throw new Error('No \"matrix\" implementation available');\n}","import { factory } from '../../utils/factory.js';\nimport { noBignumber, noMatrix } from '../../utils/noop.js';\nvar name = 'range';\nvar dependencies = ['typed', 'config', '?matrix', '?bignumber', 'equal', 'smaller', 'smallerEq', 'larger', 'largerEq', 'add', 'isZero', 'isPositive'];\nexport var createRange = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    bignumber,\n    smaller,\n    smallerEq,\n    larger,\n    largerEq,\n    add,\n    isZero,\n    isPositive\n  } = _ref;\n  /**\n   * Create a matrix or array containing a range of values.\n   * By default, the range end is excluded. This can be customized by providing\n   * an extra parameter `includeEnd`.\n   *\n   * Syntax:\n   *\n   *     math.range(str [, includeEnd])               // Create a range from a string,\n   *                                                  // where the string contains the\n   *                                                  // start, optional step, and end,\n   *                                                  // separated by a colon.\n   *     math.range(start, end [, includeEnd])        // Create a range with start and\n   *                                                  // end and a step size of 1.\n   *     math.range(start, end, step [, includeEnd])  // Create a range with start, step,\n   *                                                  // and end.\n   *\n   * Where:\n   *\n   * - `str: string`\n   *   A string 'start:end' or 'start:step:end'\n   * - `start: {number | bigint | BigNumber | Fraction | Unit}`\n   *   Start of the range\n   * - `end: number | bigint | BigNumber | Fraction | Unit`\n   *   End of the range, excluded by default, included when parameter includeEnd=true\n   * - `step: number | bigint | BigNumber | Fraction | Unit`\n   *   Step size. Default value is 1.\n   * - `includeEnd: boolean`\n   *   Option to specify whether to include the end or not. False by default.\n   *\n   * The function returns a `DenseMatrix` when the library is configured with\n   * `config = { matrix: 'Matrix' }, and returns an Array otherwise.\n   * Note that the type of the returned values is taken from the type of the\n   * provided start/end value. If only one of these is a built-in `number` type,\n   * it will be promoted to the type of the other endpoint. However, in the case\n   * of Unit values, both endpoints must have compatible units, and the return\n   * value will have compatible units as well.\n   *\n   * Examples:\n   *\n   *     math.range(2, 6)        // [2, 3, 4, 5]\n   *     math.range(2, -3, -1)   // [2, 1, 0, -1, -2]\n   *     math.range('2:1:6')     // [2, 3, 4, 5]\n   *     math.range(2, 6, true)  // [2, 3, 4, 5, 6]\n   *     math.range(2, math.fraction(8,3), math.fraction(1,3)) // [fraction(2), fraction(7,3)]\n   *     math.range(math.unit(2, 'm'), math.unit(-3, 'm'), math.unit(-1, 'm')) // [2 m, 1 m, 0 m , -1 m, -2 m]\n   *\n   * See also:\n   *\n   *     ones, zeros, size, subset\n   *\n   * @param {*} args   Parameters describing the range's `start`, `end`, and optional `step`.\n   * @return {Array | Matrix} range\n   */\n  return typed(name, {\n    // TODO: simplify signatures when typed-function supports default values and optional arguments\n\n    string: _strRange,\n    'string, boolean': _strRange,\n    number: function number(oops) {\n      throw new TypeError(\"Too few arguments to function range(): \".concat(oops));\n    },\n    boolean: function boolean(oops) {\n      throw new TypeError(\"Unexpected type of argument 1 to function range(): \".concat(oops, \", number|bigint|BigNumber|Fraction\"));\n    },\n    'number, number': function number_number(start, end) {\n      return _out(_range(start, end, 1, false));\n    },\n    'number, number, number': function number_number_number(start, end, step) {\n      return _out(_range(start, end, step, false));\n    },\n    'number, number, boolean': function number_number_boolean(start, end, includeEnd) {\n      return _out(_range(start, end, 1, includeEnd));\n    },\n    'number, number, number, boolean': function number_number_number_boolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd));\n    },\n    // Handle bigints; if either limit is bigint, range should be too\n    'bigint, bigint|number': function bigint_bigintNumber(start, end) {\n      return _out(_range(start, end, 1n, false));\n    },\n    'number, bigint': function number_bigint(start, end) {\n      return _out(_range(BigInt(start), end, 1n, false));\n    },\n    'bigint, bigint|number, bigint|number': function bigint_bigintNumber_bigintNumber(start, end, step) {\n      return _out(_range(start, end, BigInt(step), false));\n    },\n    'number, bigint, bigint|number': function number_bigint_bigintNumber(start, end, step) {\n      return _out(_range(BigInt(start), end, BigInt(step), false));\n    },\n    'bigint, bigint|number, boolean': function bigint_bigintNumber_boolean(start, end, includeEnd) {\n      return _out(_range(start, end, 1n, includeEnd));\n    },\n    'number, bigint, boolean': function number_bigint_boolean(start, end, includeEnd) {\n      return _out(_range(BigInt(start), end, 1n, includeEnd));\n    },\n    'bigint, bigint|number, bigint|number, boolean': function bigint_bigintNumber_bigintNumber_boolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, BigInt(step), includeEnd));\n    },\n    'number, bigint, bigint|number, boolean': function number_bigint_bigintNumber_boolean(start, end, step, includeEnd) {\n      return _out(_range(BigInt(start), end, BigInt(step), includeEnd));\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(start, end) {\n      var BigNumber = start.constructor;\n      return _out(_range(start, end, new BigNumber(1), false));\n    },\n    'BigNumber, BigNumber, BigNumber': function BigNumber_BigNumber_BigNumber(start, end, step) {\n      return _out(_range(start, end, step, false));\n    },\n    'BigNumber, BigNumber, boolean': function BigNumber_BigNumber_boolean(start, end, includeEnd) {\n      var BigNumber = start.constructor;\n      return _out(_range(start, end, new BigNumber(1), includeEnd));\n    },\n    'BigNumber, BigNumber, BigNumber, boolean': function BigNumber_BigNumber_BigNumber_boolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd));\n    },\n    'Fraction, Fraction': function Fraction_Fraction(start, end) {\n      return _out(_range(start, end, 1, false));\n    },\n    'Fraction, Fraction, Fraction': function Fraction_Fraction_Fraction(start, end, step) {\n      return _out(_range(start, end, step, false));\n    },\n    'Fraction, Fraction, boolean': function Fraction_Fraction_boolean(start, end, includeEnd) {\n      return _out(_range(start, end, 1, includeEnd));\n    },\n    'Fraction, Fraction, Fraction, boolean': function Fraction_Fraction_Fraction_boolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd));\n    },\n    'Unit, Unit, Unit': function Unit_Unit_Unit(start, end, step) {\n      return _out(_range(start, end, step, false));\n    },\n    'Unit, Unit, Unit, boolean': function Unit_Unit_Unit_boolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd));\n    }\n  });\n  function _out(arr) {\n    if (config.matrix === 'Matrix') {\n      return matrix ? matrix(arr) : noMatrix();\n    }\n    return arr;\n  }\n  function _strRange(str, includeEnd) {\n    var r = _parse(str);\n    if (!r) {\n      throw new SyntaxError('String \"' + str + '\" is no valid range');\n    }\n    if (config.number === 'BigNumber') {\n      if (bignumber === undefined) {\n        noBignumber();\n      }\n      return _out(_range(bignumber(r.start), bignumber(r.end), bignumber(r.step)), includeEnd);\n    } else {\n      return _out(_range(r.start, r.end, r.step, includeEnd));\n    }\n  }\n\n  /**\n   * Create a range with numbers or BigNumbers\n   * @param {number | BigNumber | Unit} start\n   * @param {number | BigNumber | Unit} end\n   * @param {number | BigNumber | Unit} step\n   * @param {boolean} includeEnd\n   * @returns {Array} range\n   * @private\n   */\n  function _range(start, end, step, includeEnd) {\n    var array = [];\n    if (isZero(step)) throw new Error('Step must be non-zero');\n    var ongoing = isPositive(step) ? includeEnd ? smallerEq : smaller : includeEnd ? largerEq : larger;\n    var x = start;\n    while (ongoing(x, end)) {\n      array.push(x);\n      x = add(x, step);\n    }\n    return array;\n  }\n\n  /**\n   * Parse a string into a range,\n   * The string contains the start, optional step, and end, separated by a colon.\n   * If the string does not contain a valid range, null is returned.\n   * For example str='0:2:11'.\n   * @param {string} str\n   * @return {{start: number, end: number, step: number} | null} range Object containing properties start, end, step\n   * @private\n   */\n  function _parse(str) {\n    var args = str.split(':');\n\n    // number\n    var nums = args.map(function (arg) {\n      // use Number and not parseFloat as Number returns NaN on invalid garbage in the string\n      return Number(arg);\n    });\n    var invalid = nums.some(function (num) {\n      return isNaN(num);\n    });\n    if (invalid) {\n      return null;\n    }\n    switch (nums.length) {\n      case 2:\n        return {\n          start: nums[0],\n          end: nums[1],\n          step: 1\n        };\n      case 3:\n        return {\n          start: nums[0],\n          end: nums[2],\n          step: nums[1]\n        };\n      default:\n        return null;\n    }\n  }\n});","import { reshape as arrayReshape } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'reshape';\nvar dependencies = ['typed', 'isInteger', 'matrix'];\nexport var createReshape = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    isInteger\n  } = _ref;\n  /**\n   * Reshape a multi dimensional array to fit the specified dimensions\n   *\n   * Syntax:\n   *\n   *     math.reshape(x, sizes)\n   *\n   * Examples:\n   *\n   *     math.reshape([1, 2, 3, 4, 5, 6], [2, 3])\n   *     // returns Array  [[1, 2, 3], [4, 5, 6]]\n   *\n   *     math.reshape([[1, 2], [3, 4]], [1, 4])\n   *     // returns Array  [[1, 2, 3, 4]]\n   *\n   *     math.reshape([[1, 2], [3, 4]], [4])\n   *     // returns Array [1, 2, 3, 4]\n   *\n   *     const x = math.matrix([1, 2, 3, 4, 5, 6, 7, 8])\n   *     math.reshape(x, [2, 2, 2])\n   *     // returns Matrix [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]\n   *\n   *    math.reshape([1, 2, 3, 4], [-1, 2])\n   *    // returns Matrix [[1, 2], [3, 4]]\n   *\n   * See also:\n   *\n   *     size, squeeze, resize\n   *\n   * @param {Array | Matrix | *} x  Matrix to be reshaped\n   * @param {number[]} sizes        One dimensional array with integral sizes for\n   *                                each dimension. One -1 is allowed as wildcard,\n   *                                which calculates this dimension automatically.\n   *\n   * @return {* | Array | Matrix}   A reshaped clone of matrix `x`\n   *\n   * @throws {TypeError}            If `sizes` does not contain solely integers\n   * @throws {DimensionError}       If the product of the new dimension sizes does\n   *                                not equal that of the old ones\n   */\n  return typed(name, {\n    'Matrix, Array': function Matrix_Array(x, sizes) {\n      return x.reshape(sizes, true);\n    },\n    'Array, Array': function Array_Array(x, sizes) {\n      sizes.forEach(function (size) {\n        if (!isInteger(size)) {\n          throw new TypeError('Invalid size for dimension: ' + size);\n        }\n      });\n      return arrayReshape(x, sizes);\n    }\n  });\n});","import { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'size';\nvar dependencies = ['typed'];\nexport var createSize = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Calculate the size of a matrix or scalar. Always returns an Array containing numbers.\n   *\n   * Note that in mathjs v14 and older, function size could return a Matrix depending on\n   * the input type and configuration.\n   *\n   * Syntax:\n   *\n   *     math.size(x)\n   *\n   * Examples:\n   *\n   *     math.size(2.3)                       // returns []\n   *     math.size('hello world')             // returns [11]\n   *\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.size(A)                         // returns [2, 3]\n   *     math.size(math.range(1,6).toArray()) // returns [5]\n   *\n   * See also:\n   *\n   *     count, resize, squeeze, subset\n   *\n   * @param {boolean | number | Complex | Unit | string | Array | Matrix} x  A matrix\n   * @return {Array} A vector with size of `x`.\n   */\n  return typed(name, {\n    Matrix: x => x.size(),\n    Array: arraySize,\n    string: x => [x.length],\n    // scalar\n    'number | Complex | BigNumber | Unit | boolean | null': _x => []\n  });\n});","import { isBigNumber } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { resize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'zeros';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nexport var createZeros = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber\n  } = _ref;\n  /**\n   * Create a matrix filled with zeros. The created matrix can have one or\n   * multiple dimensions.\n   *\n   * Syntax:\n   *\n   *    math.zeros(m)\n   *    math.zeros(m, format)\n   *    math.zeros(m, n)\n   *    math.zeros(m, n, format)\n   *    math.zeros([m, n])\n   *    math.zeros([m, n], format)\n   *\n   * Examples:\n   *\n   *    math.zeros()                   // returns []\n   *    math.zeros(3)                  // returns [0, 0, 0]\n   *    math.zeros(3, 2)               // returns [[0, 0], [0, 0], [0, 0]]\n   *    math.zeros(3, 'dense')         // returns [0, 0, 0]\n   *\n   *    const A = [[1, 2, 3], [4, 5, 6]]\n   *    math.zeros(math.size(A))       // returns [[0, 0, 0], [0, 0, 0]]\n   *\n   * See also:\n   *\n   *    ones, identity, size, range\n   *\n   * @param {...(number|BigNumber) | Array} size    The size of each dimension of the matrix\n   * @param {string} [format]           The Matrix storage format\n   *\n   * @return {Array | Matrix}           A matrix filled with zeros\n   */\n  return typed(name, {\n    '': function _() {\n      return config.matrix === 'Array' ? _zeros([]) : _zeros([], 'default');\n    },\n    // math.zeros(m, n, p, ..., format)\n    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this\n    '...number | BigNumber | string': function number__BigNumber__string(size) {\n      var last = size[size.length - 1];\n      if (typeof last === 'string') {\n        var format = size.pop();\n        return _zeros(size, format);\n      } else if (config.matrix === 'Array') {\n        return _zeros(size);\n      } else {\n        return _zeros(size, 'default');\n      }\n    },\n    Array: _zeros,\n    Matrix: function Matrix(size) {\n      var format = size.storage();\n      return _zeros(size.valueOf(), format);\n    },\n    'Array | Matrix, string': function Array__Matrix_string(size, format) {\n      return _zeros(size.valueOf(), format);\n    }\n  });\n\n  /**\n   * Create an Array or Matrix with zeros\n   * @param {Array} size\n   * @param {string} [format='default']\n   * @return {Array | Matrix}\n   * @private\n   */\n  function _zeros(size, format) {\n    var hasBigNumbers = _normalize(size);\n    var defaultValue = hasBigNumbers ? new BigNumber(0) : 0;\n    _validate(size);\n    if (format) {\n      // return a matrix\n      var m = matrix(format);\n      if (size.length > 0) {\n        return m.resize(size, defaultValue);\n      }\n      return m;\n    } else {\n      // return an Array\n      var arr = [];\n      if (size.length > 0) {\n        return resize(arr, size, defaultValue);\n      }\n      return arr;\n    }\n  }\n\n  // replace BigNumbers with numbers, returns true if size contained BigNumbers\n  function _normalize(size) {\n    var hasBigNumbers = false;\n    size.forEach(function (value, index, arr) {\n      if (isBigNumber(value)) {\n        hasBigNumbers = true;\n        arr[index] = value.toNumber();\n      }\n    });\n    return hasBigNumbers;\n  }\n\n  // validate arguments\n  function _validate(size) {\n    size.forEach(function (value) {\n      if (typeof value !== 'number' || !isInteger(value) || value < 0) {\n        throw new Error('Parameters in function zeros must be positive integers');\n      }\n    });\n  }\n});\n\n// TODO: zeros contains almost the same code as ones. Reuse this?","import { typeOf } from '../../../utils/is.js';\n\n/**\n * Improve error messages for statistics functions. Errors are typically\n * thrown in an internally used function like larger, causing the error\n * not to mention the function (like max) which is actually used by the user.\n *\n * @param {Error} err\n * @param {String} fnName\n * @param {*} [value]\n * @return {Error}\n */\nexport function improveErrorMessage(err, fnName, value) {\n  // TODO: add information with the index (also needs transform in expression parser)\n  var details;\n  if (String(err).includes('Unexpected type')) {\n    details = arguments.length > 2 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : ' (type: ' + err.data.actual + ')';\n    return new TypeError('Cannot calculate ' + fnName + ', unexpected type of argument' + details);\n  }\n  if (String(err).includes('complex numbers')) {\n    details = arguments.length > 2 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : '';\n    return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details);\n  }\n  return err;\n}","import { typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { noBignumber, noFraction } from '../../utils/noop.js';\nvar name = 'numeric';\nvar dependencies = ['number', '?bignumber', '?fraction'];\nexport var createNumeric = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    number: _number,\n    bignumber,\n    fraction\n  } = _ref;\n  var validInputTypes = {\n    string: true,\n    number: true,\n    BigNumber: true,\n    Fraction: true\n  };\n\n  // Load the conversion functions for each output type\n  var validOutputTypes = {\n    number: x => _number(x),\n    BigNumber: bignumber ? x => bignumber(x) : noBignumber,\n    bigint: x => BigInt(x),\n    Fraction: fraction ? x => fraction(x) : noFraction\n  };\n\n  /**\n   * Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.\n   *\n   * Syntax:\n   *\n   *    math.numeric(x)\n   *    math.numeric(value, outputType)\n   *\n   * Examples:\n   *\n   *    math.numeric('4')                           // returns 4\n   *    math.numeric('4', 'number')                 // returns 4\n   *    math.numeric('4', 'bigint')                 // returns 4n\n   *    math.numeric('4', 'BigNumber')              // returns BigNumber 4\n   *    math.numeric('4', 'Fraction')               // returns Fraction 4\n   *    math.numeric(4, 'Fraction')                 // returns Fraction 4\n   *    math.numeric(math.fraction(2, 5), 'number') // returns 0.4\n   *\n   * See also:\n   *\n   *    number, fraction, bignumber, bigint, string, format\n   *\n   * History:\n   *\n   *    v6       Created\n   *    v13      Added `bigint` support\n   *    v14.2.1  Prefer mathjs `bigint()` to built-in `BigInt()`\n   *\n   * @param {string | number | BigNumber | bigint | Fraction } value\n   *              A numeric value or a string containing a numeric value\n   * @param {string} outputType\n   *              Desired numeric output type.\n   *              Available values: 'number', 'BigNumber', or 'Fraction'\n   * @return {number | BigNumber | bigint | Fraction}\n   *              Returns an instance of the numeric in the requested type\n   */\n  return function numeric(value) {\n    var outputType = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'number';\n    var check = arguments.length > 2 ? arguments[2] : undefined;\n    if (check !== undefined) {\n      throw new SyntaxError('numeric() takes one or two arguments');\n    }\n    var inputType = typeOf(value);\n    if (!(inputType in validInputTypes)) {\n      throw new TypeError('Cannot convert ' + value + ' of type \"' + inputType + '\"; valid input types are ' + Object.keys(validInputTypes).join(', '));\n    }\n    if (!(outputType in validOutputTypes)) {\n      throw new TypeError('Cannot convert ' + value + ' to type \"' + outputType + '\"; valid output types are ' + Object.keys(validOutputTypes).join(', '));\n    }\n    if (outputType === inputType) {\n      return value;\n    } else {\n      return validOutputTypes[outputType](value);\n    }\n  };\n});","import { factory } from '../../utils/factory.js';\nvar name = 'divideScalar';\nvar dependencies = ['typed', 'numeric'];\nexport var createDivideScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    numeric\n  } = _ref;\n  /**\n   * Divide two scalar values, `x / y`.\n   * This function is meant for internal use: it is used by the public functions\n   * `divide` and `inv`.\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   Numerator\n   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Denominator\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Quotient, `x / y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return x / y;\n    },\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return x.div(y);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.div(y);\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x / y;\n    },\n    'Fraction, Fraction': function Fraction_Fraction(x, y) {\n      return x.div(y);\n    },\n    'Unit, number | Complex | Fraction | BigNumber | Unit': (x, y) => x.divide(y),\n    'number | Fraction | Complex | BigNumber, Unit': (x, y) => y.divideInto(x)\n  });\n});","import { isArray, isMatrix, isDenseMatrix, isSparseMatrix } from '../../../../utils/is.js';\nimport { arraySize } from '../../../../utils/array.js';\nimport { format } from '../../../../utils/string.js';\nexport function createSolveValidation(_ref) {\n  var {\n    DenseMatrix\n  } = _ref;\n  /**\n   * Validates matrix and column vector b for backward/forward substitution algorithms.\n   *\n   * @param {Matrix} m            An N x N matrix\n   * @param {Array | Matrix} b    A column vector\n   * @param {Boolean} copy        Return a copy of vector b\n   *\n   * @return {DenseMatrix}        Dense column vector b\n   */\n  return function solveValidation(m, b, copy) {\n    var mSize = m.size();\n    if (mSize.length !== 2) {\n      throw new RangeError('Matrix must be two dimensional (size: ' + format(mSize) + ')');\n    }\n    var rows = mSize[0];\n    var columns = mSize[1];\n    if (rows !== columns) {\n      throw new RangeError('Matrix must be square (size: ' + format(mSize) + ')');\n    }\n    var data = [];\n    if (isMatrix(b)) {\n      var bSize = b.size();\n      var bdata = b._data;\n\n      // 1-dim vector\n      if (bSize.length === 1) {\n        if (bSize[0] !== rows) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        }\n        for (var i = 0; i < rows; i++) {\n          data[i] = [bdata[i]];\n        }\n        return new DenseMatrix({\n          data,\n          size: [rows, 1],\n          datatype: b._datatype\n        });\n      }\n\n      // 2-dim column\n      if (bSize.length === 2) {\n        if (bSize[0] !== rows || bSize[1] !== 1) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        }\n        if (isDenseMatrix(b)) {\n          if (copy) {\n            data = [];\n            for (var _i = 0; _i < rows; _i++) {\n              data[_i] = [bdata[_i][0]];\n            }\n            return new DenseMatrix({\n              data,\n              size: [rows, 1],\n              datatype: b._datatype\n            });\n          }\n          return b;\n        }\n        if (isSparseMatrix(b)) {\n          for (var _i2 = 0; _i2 < rows; _i2++) {\n            data[_i2] = [0];\n          }\n          var values = b._values;\n          var index = b._index;\n          var ptr = b._ptr;\n          for (var k1 = ptr[1], k = ptr[0]; k < k1; k++) {\n            var _i3 = index[k];\n            data[_i3][0] = values[k];\n          }\n          return new DenseMatrix({\n            data,\n            size: [rows, 1],\n            datatype: b._datatype\n          });\n        }\n      }\n      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');\n    }\n    if (isArray(b)) {\n      var bsize = arraySize(b);\n      if (bsize.length === 1) {\n        if (bsize[0] !== rows) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        }\n        for (var _i4 = 0; _i4 < rows; _i4++) {\n          data[_i4] = [b[_i4]];\n        }\n        return new DenseMatrix({\n          data,\n          size: [rows, 1]\n        });\n      }\n      if (bsize.length === 2) {\n        if (bsize[0] !== rows || bsize[1] !== 1) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        }\n        for (var _i5 = 0; _i5 < rows; _i5++) {\n          data[_i5] = [b[_i5][0]];\n        }\n        return new DenseMatrix({\n          data,\n          size: [rows, 1]\n        });\n      }\n      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');\n    }\n  };\n}","import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'usolve';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];\nexport var createUsolve = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    DenseMatrix\n  });\n\n  /**\n   * Finds one solution of a linear equation system by backward substitution. Matrix must be an upper triangular matrix. Throws an error if there's no solution.\n   *\n   * `U * x = b`\n   *\n   * Syntax:\n   *\n   *    math.usolve(U, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = usolve(a, b)  // [[8], [9]]\n   *\n   * See also:\n   *\n   *    usolveAll, lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} U       A N x N matrix or array (U)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)\n   */\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrix_Array__Matrix(m, b) {\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrix_Array__Matrix(m, b) {\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function Array_Array__Matrix(a, b) {\n      var m = matrix(a);\n      var r = _denseBackwardSubstitution(m, b);\n      return r.valueOf();\n    }\n  });\n  function _denseBackwardSubstitution(m, b) {\n    // make b into a column vector\n    b = solveValidation(m, b, true);\n    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n\n    // result\n    var x = [];\n    var mdata = m._data;\n    // loop columns backwards\n    for (var j = columns - 1; j >= 0; j--) {\n      // b[j]\n      var bj = bdata[j][0] || 0;\n      // x[j]\n      var xj = void 0;\n      if (!equalScalar(bj, 0)) {\n        // value at [j, j]\n        var vjj = mdata[j][j];\n        if (equalScalar(vjj, 0)) {\n          // system cannot be solved\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        }\n        xj = divideScalar(bj, vjj);\n\n        // loop rows\n        for (var i = j - 1; i >= 0; i--) {\n          // update copy of b\n          bdata[i] = [subtractScalar(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))];\n        }\n      } else {\n        // zero value at j\n        xj = 0;\n      }\n      // update x\n      x[j] = [xj];\n    }\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    });\n  }\n  function _sparseBackwardSubstitution(m, b) {\n    // make b into a column vector\n    b = solveValidation(m, b, true);\n    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n\n    // result\n    var x = [];\n\n    // loop columns backwards\n    for (var j = columns - 1; j >= 0; j--) {\n      var bj = bdata[j][0] || 0;\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n\n        var vjj = 0;\n\n        // upper triangular matrix values & index (column j)\n        var jValues = [];\n        var jIndices = [];\n\n        // first & last indeces in column\n        var firstIndex = ptr[j];\n        var lastIndex = ptr[j + 1];\n\n        // values in column, find value at [j, j], loop backwards\n        for (var k = lastIndex - 1; k >= firstIndex; k--) {\n          var i = index[k];\n\n          // check row (rows are not sorted!)\n          if (i === j) {\n            vjj = values[k];\n          } else if (i < j) {\n            // store upper triangular\n            jValues.push(values[k]);\n            jIndices.push(i);\n          }\n        }\n\n        // at this point we must have a value in vjj\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        }\n        var xj = divideScalar(bj, vjj);\n        for (var _k = 0, _lastIndex = jIndices.length; _k < _lastIndex; _k++) {\n          var _i = jIndices[_k];\n          bdata[_i] = [subtractScalar(bdata[_i][0], multiplyScalar(xj, jValues[_k]))];\n        }\n        x[j] = [xj];\n      } else {\n        // degenerate row, we can choose any value\n        x[j] = [0];\n      }\n    }\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    });\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'usolveAll';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];\nexport var createUsolveAll = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    DenseMatrix\n  });\n\n  /**\n   * Finds all solutions of a linear equation system by backward substitution. Matrix must be an upper triangular matrix.\n   *\n   * `U * x = b`\n   *\n   * Syntax:\n   *\n   *    math.usolveAll(U, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = usolveAll(a, b)  // [ [[8], [9]] ]\n   *\n   * See also:\n   *\n   *    usolve, lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} U       A N x N matrix or array (U)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system\n   */\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrix_Array__Matrix(m, b) {\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrix_Array__Matrix(m, b) {\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function Array_Array__Matrix(a, b) {\n      var m = matrix(a);\n      var R = _denseBackwardSubstitution(m, b);\n      return R.map(r => r.valueOf());\n    }\n  });\n  function _denseBackwardSubstitution(m, b_) {\n    // the algorithm is derived from\n    // https://www.overleaf.com/read/csvgqdxggyjv\n\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\n    var M = m._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n\n    // loop columns backwards\n    for (var i = columns - 1; i >= 0; i--) {\n      var L = B.length;\n\n      // loop right-hand sides\n      for (var k = 0; k < L; k++) {\n        var b = B[k];\n        if (!equalScalar(M[i][i], 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], M[i][i]);\n          for (var j = i - 1; j >= 0; j--) {\n            // b[j] -= b[i] * M[j,i]\n            b[j] = subtractScalar(b[j], multiplyScalar(b[i], M[j][i]));\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return [];\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1);\n            k -= 1;\n            L -= 1;\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          var bNew = [...b];\n          bNew[i] = 1;\n          for (var _j = i - 1; _j >= 0; _j--) {\n            bNew[_j] = subtractScalar(bNew[_j], M[_j][i]);\n          }\n          B.push(bNew);\n        }\n      }\n    }\n    return B.map(x => new DenseMatrix({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n  function _sparseBackwardSubstitution(m, b_) {\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n\n    // loop columns backwards\n    for (var i = columns - 1; i >= 0; i--) {\n      var L = B.length;\n\n      // loop right-hand sides\n      for (var k = 0; k < L; k++) {\n        var b = B[k];\n\n        // values & indices (column i)\n        var iValues = [];\n        var iIndices = [];\n\n        // first & last indeces in column\n        var firstIndex = ptr[i];\n        var lastIndex = ptr[i + 1];\n\n        // find the value at [i, i]\n        var Mii = 0;\n        for (var j = lastIndex - 1; j >= firstIndex; j--) {\n          var J = index[j];\n          // check row\n          if (J === i) {\n            Mii = values[j];\n          } else if (J < i) {\n            // store upper triangular\n            iValues.push(values[j]);\n            iIndices.push(J);\n          }\n        }\n        if (!equalScalar(Mii, 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], Mii);\n\n          // loop upper triangular\n          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {\n            var _J = iIndices[_j2];\n            b[_J] = subtractScalar(b[_J], multiplyScalar(b[i], iValues[_j2]));\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return [];\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1);\n            k -= 1;\n            L -= 1;\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          var bNew = [...b];\n          bNew[i] = 1;\n\n          // loop upper triangular\n          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {\n            var _J2 = iIndices[_j3];\n            bNew[_J2] = subtractScalar(bNew[_J2], iValues[_j3]);\n          }\n          B.push(bNew);\n        }\n      }\n    }\n    return B.map(x => new DenseMatrix({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'equal';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'SparseMatrix'];\nexport var createEqual = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix\n  });\n\n  /**\n   * Test whether two values are equal.\n   *\n   * The function tests whether the relative difference between x and y is\n   * smaller than the configured relTol and absTol. The function cannot be used to\n   * compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * In case of complex numbers, x.re must equal y.re, and x.im must equal y.im.\n   *\n   * Values `null` and `undefined` are compared strictly, thus `null` is only\n   * equal to `null` and nothing else, and `undefined` is only equal to\n   * `undefined` and nothing else. Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.equal(x, y)\n   *\n   * Examples:\n   *\n   *    math.equal(2 + 2, 3)         // returns false\n   *    math.equal(2 + 2, 4)         // returns true\n   *\n   *    const a = math.unit('50 cm')\n   *    const b = math.unit('5 m')\n   *    math.equal(a, b)             // returns false\n   *\n   *    const a = math.unit('500 cm')\n   *    const b = math.unit('5 m')\n   *    math.equal(a, b)             // returns true\n   *\n   *    const c = [2, 5, 1]\n   *    const d = [2, 7, 1]\n   *    math.equal(c, d)             // returns [true, false, true]...\n   *    math.deepEqual(c, d)         // returns false\n   *\n   *    math.equal(\"1000\", \"1e3\")    // returns true\n   *    math.equal(0, null)          // returns false\n   *\n   * See also:\n   *\n   *    unequal, smaller, smallerEq, larger, largerEq, compare, deepEqual, equalText\n   *\n   * History:\n   *\n   *    v13    Handle bigints\n   *    v11.6  Support matrix broadcasting\n   *    v4     Compare strings by their numerical value\n   *    v0.24  Handle `null` and `undefined`\n   *    v0.23  Compare collections elementwise\n   *    v0.20  Compare floating-point numbers within epsilon, allowing roundoff\n   *    v0.2   Created\n   *\n   * @param  {number | BigNumber | bigint | boolean | Complex | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | boolean | Complex | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the compared values are equal, else returns false\n   */\n  return typed(name, createEqualNumber({\n    typed,\n    equalScalar\n  }), matrixAlgorithmSuite({\n    elop: equalScalar,\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexport var createEqualNumber = factory(name, ['typed', 'equalScalar'], _ref2 => {\n  var {\n    typed,\n    equalScalar\n  } = _ref2;\n  return typed(name, {\n    'any, any': function any_any(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y === null;\n      }\n      if (y === null) {\n        return x === null;\n      }\n      if (x === undefined) {\n        return y === undefined;\n      }\n      if (y === undefined) {\n        return x === undefined;\n      }\n      return equalScalar(x, y);\n    }\n  });\n});","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'smaller';\nvar dependencies = ['typed', 'config', 'bignumber', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createSmaller = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    bignumber,\n    matrix,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    typed\n  });\n\n  /**\n   * Test whether value x is smaller than y.\n   *\n   * The function returns true when x is smaller than y and the relative\n   * difference between x and y is smaller than the configured relTol and absTol. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.smaller(x, y)\n   *\n   * Examples:\n   *\n   *    math.smaller(2, 3)            // returns true\n   *    math.smaller(5, 2 * 2)        // returns false\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('2 inch')\n   *    math.smaller(a, b)            // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smallerEq, smaller, smallerEq, compare\n   *\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false\n   */\n  function bignumSmaller(x, y) {\n    return x.lt(y) && !bigNearlyEqual(x, y, config.relTol, config.absTol);\n  }\n  return typed(name, createSmallerNumber({\n    typed,\n    config\n  }), {\n    'boolean, boolean': (x, y) => x < y,\n    'BigNumber, BigNumber': bignumSmaller,\n    'bigint, bigint': (x, y) => x < y,\n    'Fraction, Fraction': (x, y) => x.compare(y) === -1,\n    'Fraction, BigNumber': function Fraction_BigNumber(x, y) {\n      return bignumSmaller(bignumber(x), y);\n    },\n    'BigNumber, Fraction': function BigNumber_Fraction(x, y) {\n      return bignumSmaller(x, bignumber(y));\n    },\n    'Complex, Complex': function Complex_Complex(x, y) {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    }\n  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexport var createSmallerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return x < y && !nearlyEqual(x, y, config.relTol, config.absTol);\n    }\n  });\n});","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'smallerEq';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createSmallerEq = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    typed\n  });\n\n  /**\n   * Test whether value x is smaller or equal to y.\n   *\n   * The function returns true when x is smaller than y or the relative\n   * difference between x and y is smaller than the configured relTol and absTol. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.smallerEq(x, y)\n   *\n   * Examples:\n   *\n   *    math.smaller(1 + 2, 3)        // returns false\n   *    math.smallerEq(1 + 2, 3)      // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, larger, largerEq, compare\n   *\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false\n   */\n  return typed(name, createSmallerEqNumber({\n    typed,\n    config\n  }), {\n    'boolean, boolean': (x, y) => x <= y,\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.lte(y) || bigNearlyEqual(x, y, config.relTol, config.absTol);\n    },\n    'bigint, bigint': (x, y) => x <= y,\n    'Fraction, Fraction': (x, y) => x.compare(y) !== 1,\n    'Complex, Complex': function Complex_Complex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    }\n  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexport var createSmallerEqNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return x <= y || nearlyEqual(x, y, config.relTol, config.absTol);\n    }\n  });\n});","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'larger';\nvar dependencies = ['typed', 'config', 'bignumber', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createLarger = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    bignumber,\n    matrix,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    typed\n  });\n\n  /**\n   * Test whether value x is larger than y.\n   *\n   * The function returns true when x is larger than y and the relative\n   * difference between x and y is larger than the configured relTol and absTol. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.larger(x, y)\n   *\n   * Examples:\n   *\n   *    math.larger(2, 3)             // returns false\n   *    math.larger(5, 2 + 2)         // returns true\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('2 inch')\n   *    math.larger(a, b)             // returns false\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, smallerEq, largerEq, compare\n   *\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is larger than y, else returns false\n   */\n  function bignumLarger(x, y) {\n    return x.gt(y) && !bigNearlyEqual(x, y, config.relTol, config.absTol);\n  }\n  return typed(name, createLargerNumber({\n    typed,\n    config\n  }), {\n    'boolean, boolean': (x, y) => x > y,\n    'BigNumber, BigNumber': bignumLarger,\n    'bigint, bigint': (x, y) => x > y,\n    'Fraction, Fraction': (x, y) => x.compare(y) === 1,\n    'Fraction, BigNumber': function Fraction_BigNumber(x, y) {\n      return bignumLarger(bignumber(x), y);\n    },\n    'BigNumber, Fraction': function BigNumber_Fraction(x, y) {\n      return bignumLarger(x, bignumber(y));\n    },\n    'Complex, Complex': function Complex_Complex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    }\n  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexport var createLargerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return x > y && !nearlyEqual(x, y, config.relTol, config.absTol);\n    }\n  });\n});","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'largerEq';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createLargerEq = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    typed\n  });\n\n  /**\n   * Test whether value x is larger or equal to y.\n   *\n   * The function returns true when x is larger than y or the relative\n   * difference between x and y is smaller than the configured relTol and absTol. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.largerEq(x, y)\n   *\n   * Examples:\n   *\n   *    math.larger(2, 1 + 1)         // returns false\n   *    math.largerEq(2, 1 + 1)       // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, smallerEq, larger, compare\n   *\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is larger or equal to y, else returns false\n   */\n  return typed(name, createLargerEqNumber({\n    typed,\n    config\n  }), {\n    'boolean, boolean': (x, y) => x >= y,\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.gte(y) || bigNearlyEqual(x, y, config.relTol, config.absTol);\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x >= y;\n    },\n    'Fraction, Fraction': (x, y) => x.compare(y) !== -1,\n    'Complex, Complex': function Complex_Complex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    }\n  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexport var createLargerEqNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return x >= y || nearlyEqual(x, y, config.relTol, config.absTol);\n    }\n  });\n});","import { deepForEach, reduce, containsCollections } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { safeNumberType } from '../../utils/number.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'max';\nvar dependencies = ['typed', 'config', 'numeric', 'larger', 'isNaN'];\nexport var createMax = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    numeric,\n    larger,\n    isNaN: mathIsNaN\n  } = _ref;\n  /**\n   * Compute the maximum value of a matrix or a  list with values.\n   * In case of a multidimensional array, the maximum of the flattened array\n   * will be calculated. When `dim` is provided, the maximum over the selected\n   * dimension will be calculated. Parameter `dim` is zero-based.\n   *\n   * Syntax:\n   *\n   *     math.max(a, b, c, ...)\n   *     math.max(A)\n   *     math.max(A, dimension)\n   *\n   * Examples:\n   *\n   *     math.max(2, 1, 4, 3)                  // returns 4\n   *     math.max([2, 1, 4, 3])                // returns 4\n   *\n   *     // maximum over a specified dimension (zero-based)\n   *     math.max([[2, 5], [4, 3], [1, 7]], 0) // returns [4, 7]\n   *     math.max([[2, 5], [4, 3], [1, 7]], 1) // returns [5, 4, 7]\n   *\n   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1\n   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5\n   *\n   * See also:\n   *\n   *    mean, median, min, prod, std, sum, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The maximum value\n   */\n  return typed(name, {\n    // max([a, b, c, d, ...])\n    'Array | Matrix': _max,\n    // max([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function Array__Matrix_number__BigNumber(array, dim) {\n      return reduce(array, dim.valueOf(), _largest);\n    },\n    // max(a, b, c, d, ...)\n    '...': function _(args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function max');\n      }\n      return _max(args);\n    }\n  });\n\n  /**\n   * Return the largest of two values\n   * @param {*} x\n   * @param {*} y\n   * @returns {*} Returns x when x is largest, or y when y is largest\n   * @private\n   */\n  function _largest(x, y) {\n    try {\n      return larger(x, y) ? x : y;\n    } catch (err) {\n      throw improveErrorMessage(err, 'max', y);\n    }\n  }\n\n  /**\n   * Recursively calculate the maximum value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} max\n   * @private\n   */\n  function _max(array) {\n    var res;\n    deepForEach(array, function (value) {\n      try {\n        if (mathIsNaN(value)) {\n          res = value;\n        } else if (res === undefined || larger(value, res)) {\n          res = value;\n        }\n      } catch (err) {\n        throw improveErrorMessage(err, 'max', value);\n      }\n    });\n    if (res === undefined) {\n      throw new Error('Cannot calculate max of an empty array');\n    }\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (typeof res === 'string') {\n      res = numeric(res, safeNumberType(res, config));\n    }\n    return res;\n  }\n});","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { safeNumberType } from '../../utils/number.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'min';\nvar dependencies = ['typed', 'config', 'numeric', 'smaller', 'isNaN'];\nexport var createMin = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    numeric,\n    smaller,\n    isNaN: mathIsNaN\n  } = _ref;\n  /**\n   * Compute the minimum value of a matrix or a  list of values.\n   * In case of a multidimensional array, the minimum of the flattened array\n   * will be calculated. When `dim` is provided, the minimum over the selected\n   * dimension will be calculated. Parameter `dim` is zero-based.\n   *\n   * Syntax:\n   *\n   *     math.min(a, b, c, ...)\n   *     math.min(A)\n   *     math.min(A, dimension)\n   *\n   * Examples:\n   *\n   *     math.min(2, 1, 4, 3)                  // returns 1\n   *     math.min([2, 1, 4, 3])                // returns 1\n   *\n   *     // minimum over a specified dimension (zero-based)\n   *     math.min([[2, 5], [4, 3], [1, 7]], 0) // returns [1, 3]\n   *     math.min([[2, 5], [4, 3], [1, 7]], 1) // returns [2, 3, 1]\n   *\n   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1\n   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5\n   *\n   * See also:\n   *\n   *    mean, median, max, prod, std, sum, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The minimum value\n   */\n  return typed(name, {\n    // min([a, b, c, d, ...])\n    'Array | Matrix': _min,\n    // min([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function Array__Matrix_number__BigNumber(array, dim) {\n      return reduce(array, dim.valueOf(), _smallest);\n    },\n    // min(a, b, c, d, ...)\n    '...': function _(args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function min');\n      }\n      return _min(args);\n    }\n  });\n\n  /**\n   * Return the smallest of two values\n   * @param {*} x\n   * @param {*} y\n   * @returns {*} Returns x when x is smallest, or y when y is smallest\n   * @private\n   */\n  function _smallest(x, y) {\n    try {\n      return smaller(x, y) ? x : y;\n    } catch (err) {\n      throw improveErrorMessage(err, 'min', y);\n    }\n  }\n\n  /**\n   * Recursively calculate the minimum value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} min\n   * @private\n   */\n  function _min(array) {\n    var min;\n    deepForEach(array, function (value) {\n      try {\n        if (mathIsNaN(value)) {\n          min = value;\n        } else if (min === undefined || smaller(value, min)) {\n          min = value;\n        }\n      } catch (err) {\n        throw improveErrorMessage(err, 'min', value);\n      }\n    });\n    if (min === undefined) {\n      throw new Error('Cannot calculate min of an empty array');\n    }\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (typeof min === 'string') {\n      min = numeric(min, safeNumberType(min, config));\n    }\n    return min;\n  }\n});","import { isArray, isMatrix, isString, typeOf } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ImmutableDenseMatrix';\nvar dependencies = ['smaller', 'DenseMatrix'];\nexport var createImmutableDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    smaller,\n    DenseMatrix\n  } = _ref;\n  function ImmutableDenseMatrix(data, datatype) {\n    if (!(this instanceof ImmutableDenseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if (isMatrix(data) || isArray(data)) {\n      // use DenseMatrix implementation\n      var matrix = new DenseMatrix(data, datatype);\n      // internal structures\n      this._data = matrix._data;\n      this._size = matrix._size;\n      this._datatype = matrix._datatype;\n      this._min = null;\n      this._max = null;\n    } else if (data && isArray(data.data) && isArray(data.size)) {\n      // initialize fields from JSON representation\n      this._data = data.data;\n      this._size = data.size;\n      this._datatype = data.datatype;\n      this._min = typeof data.min !== 'undefined' ? data.min : null;\n      this._max = typeof data.max !== 'undefined' ? data.max : null;\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');\n    } else {\n      // nothing provided\n      this._data = [];\n      this._size = [0];\n      this._datatype = datatype;\n      this._min = null;\n      this._max = null;\n    }\n  }\n  ImmutableDenseMatrix.prototype = new DenseMatrix();\n\n  /**\n   * Attach type information\n   */\n  ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix';\n  ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true;\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @param {Index} index\n   * @param {Array | ImmutableDenseMatrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  ImmutableDenseMatrix.prototype.subset = function (index) {\n    switch (arguments.length) {\n      case 1:\n        {\n          // use base implementation\n          var m = DenseMatrix.prototype.subset.call(this, index);\n          // check result is a matrix\n          if (isMatrix(m)) {\n            // return immutable matrix\n            return new ImmutableDenseMatrix({\n              data: m._data,\n              size: m._size,\n              datatype: m._datatype\n            });\n          }\n          return m;\n        }\n      // intentional fall through\n      case 2:\n      case 3:\n        throw new Error('Cannot invoke set subset on an Immutable Matrix instance');\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\n\n  /**\n   * Replace a single element in the matrix.\n   * @param {Number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {ImmutableDenseMatrix} self\n   */\n  ImmutableDenseMatrix.prototype.set = function () {\n    throw new Error('Cannot invoke set on an Immutable Matrix instance');\n  };\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @param {Number[]} size           The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  ImmutableDenseMatrix.prototype.resize = function () {\n    throw new Error('Cannot invoke resize on an Immutable Matrix instance');\n  };\n\n  /**\n   * Disallows reshaping in favor of immutability.\n   *\n   * @throws {Error} Operation not allowed\n   */\n  ImmutableDenseMatrix.prototype.reshape = function () {\n    throw new Error('Cannot invoke reshape on an Immutable Matrix instance');\n  };\n\n  /**\n   * Create a clone of the matrix\n   * @return {ImmutableDenseMatrix} clone\n   */\n  ImmutableDenseMatrix.prototype.clone = function () {\n    return new ImmutableDenseMatrix({\n      data: clone(this._data),\n      size: clone(this._size),\n      datatype: this._datatype\n    });\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @returns {Object}\n   */\n  ImmutableDenseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'ImmutableDenseMatrix',\n      data: this._data,\n      size: this._size,\n      datatype: this._datatype\n    };\n  };\n\n  /**\n   * Generate a matrix from a JSON object\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ImmutableDenseMatrix\", data: [], size: []}`,\n   *                       where mathjs is optional\n   * @returns {ImmutableDenseMatrix}\n   */\n  ImmutableDenseMatrix.fromJSON = function (json) {\n    return new ImmutableDenseMatrix(json);\n  };\n\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @param {Number} i       Matrix row index 1\n   * @param {Number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n  ImmutableDenseMatrix.prototype.swapRows = function () {\n    throw new Error('Cannot invoke swapRows on an Immutable Matrix instance');\n  };\n\n  /**\n   * Calculate the minimum value in the set\n   * @return {Number | undefined} min\n   */\n  ImmutableDenseMatrix.prototype.min = function () {\n    // check min has been calculated before\n    if (this._min === null) {\n      // minimum\n      var m = null;\n      // compute min\n      this.forEach(function (v) {\n        if (m === null || smaller(v, m)) {\n          m = v;\n        }\n      });\n      this._min = m !== null ? m : undefined;\n    }\n    return this._min;\n  };\n\n  /**\n   * Calculate the maximum value in the set\n   * @return {Number | undefined} max\n   */\n  ImmutableDenseMatrix.prototype.max = function () {\n    // check max has been calculated before\n    if (this._max === null) {\n      // maximum\n      var m = null;\n      // compute max\n      this.forEach(function (v) {\n        if (m === null || smaller(m, v)) {\n          m = v;\n        }\n      });\n      this._max = m !== null ? m : undefined;\n    }\n    return this._max;\n  };\n  return ImmutableDenseMatrix;\n}, {\n  isClass: true\n});","import { isArray, isMatrix, isRange, isNumber, isString } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Index';\nvar dependencies = ['ImmutableDenseMatrix', 'getMatrixDataType'];\nexport var createIndexClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    ImmutableDenseMatrix,\n    getMatrixDataType\n  } = _ref;\n  /**\n   * Create an index. An Index can store ranges and sets for multiple dimensions.\n   * Matrix.get, Matrix.set, and math.subset accept an Index as input.\n   *\n   * Usage:\n   *     const index = new Index(range1, range2, matrix1, array1, ...)\n   *\n   * Where each parameter can be any of:\n   *     A number\n   *     A string (containing a name of an object property)\n   *     An instance of Range\n   *     An Array with the Set values\n   *     An Array with Booleans\n   *     A Matrix with the Set values\n   *     A Matrix with Booleans\n   *\n   * The parameters start, end, and step must be integer numbers.\n   *\n   * @class Index\n   * @Constructor Index\n   * @param {...*} ranges\n   */\n  function Index() {\n    if (!(this instanceof Index)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    this._dimensions = [];\n    this._sourceSize = [];\n    this._isScalar = true;\n    for (var i = 0, ii = arguments.length; i < ii; i++) {\n      var arg = i < 0 || arguments.length <= i ? undefined : arguments[i];\n      var argIsArray = isArray(arg);\n      var argIsMatrix = isMatrix(arg);\n      var argType = typeof arg;\n      var sourceSize = null;\n      if (isRange(arg)) {\n        this._dimensions.push(arg);\n        this._isScalar = false;\n      } else if (argIsArray || argIsMatrix) {\n        // create matrix\n        var m = void 0;\n        this._isScalar = false;\n        if (getMatrixDataType(arg) === 'boolean') {\n          if (argIsArray) m = _createImmutableMatrix(_booleansArrayToNumbersForIndex(arg).valueOf());\n          if (argIsMatrix) m = _createImmutableMatrix(_booleansArrayToNumbersForIndex(arg._data).valueOf());\n          sourceSize = arg.valueOf().length;\n        } else {\n          m = _createImmutableMatrix(arg.valueOf());\n        }\n        this._dimensions.push(m);\n      } else if (argType === 'number') {\n        this._dimensions.push(arg);\n      } else if (argType === 'bigint') {\n        this._dimensions.push(Number(arg));\n      } else if (argType === 'string') {\n        // object property (arguments.count should be 1)\n        this._dimensions.push(arg);\n      } else {\n        throw new TypeError('Dimension must be an Array, Matrix, number, bigint, string, or Range');\n      }\n      this._sourceSize.push(sourceSize);\n      // TODO: implement support for wildcard '*'\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Index.prototype.type = 'Index';\n  Index.prototype.isIndex = true;\n  function _createImmutableMatrix(arg) {\n    // loop array elements\n    for (var i = 0, l = arg.length; i < l; i++) {\n      if (!isNumber(arg[i]) || !isInteger(arg[i])) {\n        throw new TypeError('Index parameters must be positive integer numbers');\n      }\n    }\n    // create matrix\n    var matrix = new ImmutableDenseMatrix();\n    matrix._data = arg;\n    matrix._size = [arg.length];\n    return matrix;\n  }\n\n  /**\n   * Create a clone of the index\n   * @memberof Index\n   * @return {Index} clone\n   */\n  Index.prototype.clone = function () {\n    var index = new Index();\n    index._dimensions = clone(this._dimensions);\n    index._isScalar = this._isScalar;\n    index._sourceSize = this._sourceSize;\n    return index;\n  };\n\n  /**\n   * Create an index from an array with ranges/numbers\n   * @memberof Index\n   * @param {Array.<Array | number>} ranges\n   * @return {Index} index\n   * @private\n   */\n  Index.create = function (ranges) {\n    var index = new Index();\n    Index.apply(index, ranges);\n    return index;\n  };\n\n  /**\n   * Retrieve the size of the index, the number of elements for each dimension.\n   * @memberof Index\n   * @returns {number[]} size\n   */\n  Index.prototype.size = function () {\n    var size = [];\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var d = this._dimensions[i];\n      size[i] = isString(d) || isNumber(d) ? 1 : d.size()[0];\n    }\n    return size;\n  };\n\n  /**\n   * Get the maximum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} max\n   */\n  Index.prototype.max = function () {\n    var values = [];\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var range = this._dimensions[i];\n      values[i] = isString(range) || isNumber(range) ? range : range.max();\n    }\n    return values;\n  };\n\n  /**\n   * Get the minimum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} min\n   */\n  Index.prototype.min = function () {\n    var values = [];\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var range = this._dimensions[i];\n      values[i] = isString(range) || isNumber(range) ? range : range.min();\n    }\n    return values;\n  };\n\n  /**\n   * Loop over each of the ranges of the index\n   * @memberof Index\n   * @param {Function} callback   Called for each range with a Range as first\n   *                              argument, the dimension as second, and the\n   *                              index object as third.\n   */\n  Index.prototype.forEach = function (callback) {\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      callback(this._dimensions[i], i, this);\n    }\n  };\n\n  /**\n   * Retrieve the dimension for the given index\n   * @memberof Index\n   * @param {Number} dim                  Number of the dimension\n   * @returns {Range | null} range\n   */\n  Index.prototype.dimension = function (dim) {\n    var _this$_dimensions$dim;\n    if (!isNumber(dim)) {\n      return null;\n    }\n    return (_this$_dimensions$dim = this._dimensions[dim]) !== null && _this$_dimensions$dim !== void 0 ? _this$_dimensions$dim : null;\n  };\n\n  /**\n   * Test whether this index contains an object property\n   * @returns {boolean} Returns true if the index is an object property\n   */\n  Index.prototype.isObjectProperty = function () {\n    return this._dimensions.length === 1 && isString(this._dimensions[0]);\n  };\n\n  /**\n   * Returns the object property name when the Index holds a single object property,\n   * else returns null\n   * @returns {string | null}\n   */\n  Index.prototype.getObjectProperty = function () {\n    return this.isObjectProperty() ? this._dimensions[0] : null;\n  };\n\n  /**\n   * Test whether this index contains only a single value.\n   *\n   * This is the case when the index is created with only scalar values as ranges,\n   * not for ranges resolving into a single value.\n   * @memberof Index\n   * @return {boolean} isScalar\n   */\n  Index.prototype.isScalar = function () {\n    return this._isScalar;\n  };\n\n  /**\n   * Expand the Index into an array.\n   * For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]]\n   * @memberof Index\n   * @returns {Array} array\n   */\n  Index.prototype.toArray = function () {\n    var array = [];\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var dimension = this._dimensions[i];\n      array.push(isString(dimension) || isNumber(dimension) ? dimension : dimension.toArray());\n    }\n    return array;\n  };\n\n  /**\n   * Get the primitive value of the Index, a two dimensional array.\n   * Equivalent to Index.toArray().\n   * @memberof Index\n   * @returns {Array} array\n   */\n  Index.prototype.valueOf = Index.prototype.toArray;\n\n  /**\n   * Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7, [1,2,3]]'\n   * @memberof Index\n   * @returns {String} str\n   */\n  Index.prototype.toString = function () {\n    var strings = [];\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var dimension = this._dimensions[i];\n      if (isString(dimension)) {\n        strings.push(JSON.stringify(dimension));\n      } else {\n        strings.push(dimension.toString());\n      }\n    }\n    return '[' + strings.join(', ') + ']';\n  };\n\n  /**\n   * Get a JSON representation of the Index\n   * @memberof Index\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Index\", \"ranges\": [{\"mathjs\": \"Range\", start: 0, end: 10, step:1}, ...]}`\n   */\n  Index.prototype.toJSON = function () {\n    return {\n      mathjs: 'Index',\n      dimensions: this._dimensions\n    };\n  };\n\n  /**\n   * Instantiate an Index from a JSON object\n   * @memberof Index\n   * @param {Object} json A JSON object structured as:\n   *                     `{\"mathjs\": \"Index\", \"dimensions\": [{\"mathjs\": \"Range\", start: 0, end: 10, step:1}, ...]}`\n   * @return {Index}\n   */\n  Index.fromJSON = function (json) {\n    return Index.create(json.dimensions);\n  };\n  return Index;\n}, {\n  isClass: true\n});\n\n/**\n * Receives an array of booleans and returns an array of Numbers for Index\n * @param {Array} booleanArrayIndex An array of booleans\n * @return {Array} A set of numbers ready for index\n */\nfunction _booleansArrayToNumbersForIndex(booleanArrayIndex) {\n  // gets an array of booleans and returns an array of numbers\n  var indexOfNumbers = [];\n  booleanArrayIndex.forEach((bool, idx) => {\n    if (bool) {\n      indexOfNumbers.push(idx);\n    }\n  });\n  return indexOfNumbers;\n}","import { factory } from '../../utils/factory.js';\nvar name = 'atan';\nvar dependencies = ['typed'];\nexport var createAtan = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Calculate the inverse tangent of a value.\n   *\n   * To avoid confusion with matrix arctangent, this function does not apply\n   * to matrices.\n   *\n   * Syntax:\n   *\n   *    math.atan(x)\n   *\n   * Examples:\n   *\n   *    math.atan(0.5)           // returns number 0.4636476090008061\n   *    math.atan(2)             // returns number 1.1071487177940904\n   *    math.atan(math.tan(1.5)) // returns number 1.5\n   *\n   * See also:\n   *\n   *    tan, asin, acos\n   *\n   * @param {number | BigNumber | Complex} x   Function input\n   * @return {number | BigNumber | Complex} The arc tangent of x\n   */\n  return typed('atan', {\n    number: function number(x) {\n      return Math.atan(x);\n    },\n    Complex: function Complex(x) {\n      return x.atan();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.atan();\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nexport var createTrigUnit = /* #__PURE__ */factory('trigUnit', ['typed'], _ref => {\n  var {\n    typed\n  } = _ref;\n  return {\n    Unit: typed.referToSelf(self => x => {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cot is no angle');\n      }\n      return typed.find(self, x.valueType())(x.value);\n    })\n  };\n});","import { factory } from '../../utils/factory.js';\nimport { createTrigUnit } from './trigUnit.js';\nvar name = 'cos';\nvar dependencies = ['typed'];\nexport var createCos = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  var trigUnit = createTrigUnit({\n    typed\n  });\n\n  /**\n   * Calculate the cosine of a value.\n   *\n   * To avoid confusion with the matrix cosine, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.cos(x)\n   *\n   * Examples:\n   *\n   *    math.cos(2)                      // returns number -0.4161468365471422\n   *    math.cos(math.pi / 4)            // returns number  0.7071067811865475\n   *    math.cos(math.unit(180, 'deg'))  // returns number -1\n   *    math.cos(math.unit(60, 'deg'))   // returns number  0.5\n   *\n   *    const angle = 0.2\n   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number 1\n   *\n   * See also:\n   *\n   *    cos, tan\n   *\n   * @param {number | BigNumber | Complex | Unit} x  Function input\n   * @return {number | BigNumber | Complex} Cosine of x\n   */\n  return typed(name, {\n    number: Math.cos,\n    'Complex | BigNumber': x => x.cos()\n  }, trigUnit);\n});","import { factory } from '../../utils/factory.js';\nimport { createTrigUnit } from './trigUnit.js';\nvar name = 'sin';\nvar dependencies = ['typed'];\nexport var createSin = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  var trigUnit = createTrigUnit({\n    typed\n  });\n\n  /**\n   * Calculate the sine of a value.\n   *\n   * To avoid confusion with the matrix sine, this function does not apply\n   * to matrices.\n   *\n   * Syntax:\n   *\n   *    math.sin(x)\n   *\n   * Examples:\n   *\n   *    math.sin(2)                      // returns number 0.9092974268256813\n   *    math.sin(math.pi / 4)            // returns number 0.7071067811865475\n   *    math.sin(math.unit(90, 'deg'))   // returns number 1\n   *    math.sin(math.unit(30, 'deg'))   // returns number 0.5\n   *\n   *    const angle = 0.2\n   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number 1\n   *\n   * See also:\n   *\n   *    cos, tan\n   *\n   * @param {number | BigNumber | Complex | Unit} x  Function input\n   * @return {number | BigNumber | Complex} Sine of x\n   */\n  return typed(name, {\n    number: Math.sin,\n    'Complex | BigNumber': x => x.sin()\n  }, trigUnit);\n});","import { factory } from '../../utils/factory.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatAlgo04xSidSid } from '../../type/matrix/utils/matAlgo04xSidSid.js';\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'add';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix', 'concat'];\nexport var createAdd = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    addScalar,\n    equalScalar,\n    DenseMatrix,\n    SparseMatrix,\n    concat\n  } = _ref;\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo04xSidSid = createMatAlgo04xSidSid({\n    typed,\n    equalScalar\n  });\n  var matAlgo10xSids = createMatAlgo10xSids({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  /**\n   * Add two or more values, `x + y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.add(x, y)\n   *    math.add(x, y, z, ...)\n   *\n   * Examples:\n   *\n   *    math.add(2, 3)               // returns number 5\n   *    math.add(2, 3, 4)            // returns number 9\n   *\n   *    const a = math.complex(2, 3)\n   *    const b = math.complex(-4, 1)\n   *    math.add(a, b)               // returns Complex -2 + 4i\n   *\n   *    math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]\n   *\n   *    const c = math.unit('5 cm')\n   *    const d = math.unit('2.1 mm')\n   *    math.add(c, d)               // returns Unit 5.21 cm\n   *\n   *    math.add(\"2.3\", \"4\")         // returns number 6.3\n   *\n   * See also:\n   *\n   *    subtract, sum\n   *\n   * History:\n   *\n   *     v13     Handle bigint arguments\n   *     v11.6   Support matrix broadcasting\n   *     v3.8    Allow more than two arguments\n   *     v0.0.2  Created\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x First value to add\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Second value to add\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`\n   */\n  return typed(name, {\n    'any, any': addScalar,\n    'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {\n      var result = self(x, y);\n      for (var i = 0; i < rest.length; i++) {\n        result = self(result, rest[i]);\n      }\n      return result;\n    })\n  }, matrixAlgorithmSuite({\n    elop: addScalar,\n    DS: matAlgo01xDSid,\n    SS: matAlgo04xSidSid,\n    Ss: matAlgo10xSids\n  }));\n});","import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nvar name = 'dot';\nvar dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size'];\nexport var createDot = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    addScalar,\n    multiplyScalar,\n    conj,\n    size\n  } = _ref;\n  /**\n   * Calculate the dot product of two vectors. The dot product of\n   * `A = [a1, a2, ..., an]` and `B = [b1, b2, ..., bn]` is defined as:\n   *\n   *    dot(A, B) = conj(a1) * b1 + conj(a2) * b2 + ... + conj(an) * bn\n   *\n   * Syntax:\n   *\n   *    math.dot(x, y)\n   *\n   * Examples:\n   *\n   *    math.dot([2, 4, 1], [2, 2, 3])       // returns number 15\n   *    math.multiply([2, 4, 1], [2, 2, 3])  // returns number 15\n   *\n   * See also:\n   *\n   *    multiply, cross\n   *\n   * @param  {Array | Matrix} x     First vector\n   * @param  {Array | Matrix} y     Second vector\n   * @return {number}               Returns the dot product of `x` and `y`\n   */\n  return typed(name, {\n    'Array | DenseMatrix, Array | DenseMatrix': _denseDot,\n    'SparseMatrix, SparseMatrix': _sparseDot\n  });\n  function _validateDim(x, y) {\n    var xSize = size(x);\n    var ySize = size(y);\n    var xLen, yLen;\n    if (xSize.length === 1) {\n      xLen = xSize[0];\n    } else if (xSize.length === 2 && xSize[1] === 1) {\n      xLen = xSize[0];\n    } else {\n      throw new RangeError('Expected a column vector, instead got a matrix of size (' + xSize.join(', ') + ')');\n    }\n    if (ySize.length === 1) {\n      yLen = ySize[0];\n    } else if (ySize.length === 2 && ySize[1] === 1) {\n      yLen = ySize[0];\n    } else {\n      throw new RangeError('Expected a column vector, instead got a matrix of size (' + ySize.join(', ') + ')');\n    }\n    if (xLen !== yLen) throw new RangeError('Vectors must have equal length (' + xLen + ' != ' + yLen + ')');\n    if (xLen === 0) throw new RangeError('Cannot calculate the dot product of empty vectors');\n    return xLen;\n  }\n  function _denseDot(a, b) {\n    var N = _validateDim(a, b);\n    var adata = isMatrix(a) ? a._data : a;\n    var adt = isMatrix(a) ? a._datatype || a.getDataType() : undefined;\n    var bdata = isMatrix(b) ? b._data : b;\n    var bdt = isMatrix(b) ? b._datatype || b.getDataType() : undefined;\n\n    // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)\n    var aIsColumn = size(a).length === 2;\n    var bIsColumn = size(b).length === 2;\n    var add = addScalar;\n    var mul = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      var dt = adt;\n      // find signatures that matches (dt, dt)\n      add = typed.find(addScalar, [dt, dt]);\n      mul = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // both vectors 1-dimensional\n    if (!aIsColumn && !bIsColumn) {\n      var c = mul(conj(adata[0]), bdata[0]);\n      for (var i = 1; i < N; i++) {\n        c = add(c, mul(conj(adata[i]), bdata[i]));\n      }\n      return c;\n    }\n\n    // a is 1-dim, b is column\n    if (!aIsColumn && bIsColumn) {\n      var _c = mul(conj(adata[0]), bdata[0][0]);\n      for (var _i = 1; _i < N; _i++) {\n        _c = add(_c, mul(conj(adata[_i]), bdata[_i][0]));\n      }\n      return _c;\n    }\n\n    // a is column, b is 1-dim\n    if (aIsColumn && !bIsColumn) {\n      var _c2 = mul(conj(adata[0][0]), bdata[0]);\n      for (var _i2 = 1; _i2 < N; _i2++) {\n        _c2 = add(_c2, mul(conj(adata[_i2][0]), bdata[_i2]));\n      }\n      return _c2;\n    }\n\n    // both vectors are column\n    if (aIsColumn && bIsColumn) {\n      var _c3 = mul(conj(adata[0][0]), bdata[0][0]);\n      for (var _i3 = 1; _i3 < N; _i3++) {\n        _c3 = add(_c3, mul(conj(adata[_i3][0]), bdata[_i3][0]));\n      }\n      return _c3;\n    }\n  }\n  function _sparseDot(x, y) {\n    _validateDim(x, y);\n    var xindex = x._index;\n    var xvalues = x._values;\n    var yindex = y._index;\n    var yvalues = y._values;\n\n    // TODO optimize add & mul using datatype\n    var c = 0;\n    var add = addScalar;\n    var mul = multiplyScalar;\n    var i = 0;\n    var j = 0;\n    while (i < xindex.length && j < yindex.length) {\n      var I = xindex[i];\n      var J = yindex[j];\n      if (I < J) {\n        i++;\n        continue;\n      }\n      if (I > J) {\n        j++;\n        continue;\n      }\n      if (I === J) {\n        c = add(c, mul(xvalues[i], yvalues[j]));\n        i++;\n        j++;\n      }\n    }\n    return c;\n  }\n});","import _extends from \"@babel/runtime/helpers/extends\";\nimport { factory } from '../../../utils/factory.js';\nvar name = 'qr';\nvar dependencies = ['typed', 'matrix', 'zeros', 'identity', 'isZero', 'equal', 'sign', 'sqrt', 'conj', 'unaryMinus', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'complex'];\nexport var createQr = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    zeros,\n    identity,\n    isZero,\n    equal,\n    sign,\n    sqrt,\n    conj,\n    unaryMinus,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    complex\n  } = _ref;\n  /**\n   * Calculate the Matrix QR decomposition. Matrix `A` is decomposed in\n   * two matrices (`Q`, `R`) where `Q` is an\n   * orthogonal matrix and `R` is an upper triangular matrix.\n   *\n   * Syntax:\n   *\n   *    math.qr(A)\n   *\n   * Example:\n   *\n   *    const m = [\n   *      [1, -1,  4],\n   *      [1,  4, -2],\n   *      [1,  4,  2],\n   *      [1,  -1, 0]\n   *    ]\n   *    const result = math.qr(m)\n   *    // r = {\n   *    //   Q: [\n   *    //     [0.5, -0.5,   0.5],\n   *    //     [0.5,  0.5,  -0.5],\n   *    //     [0.5,  0.5,   0.5],\n   *    //     [0.5, -0.5,  -0.5],\n   *    //   ],\n   *    //   R: [\n   *    //     [2, 3,  2],\n   *    //     [0, 5, -2],\n   *    //     [0, 0,  4],\n   *    //     [0, 0,  0]\n   *    //   ]\n   *    // }\n   *\n   * See also:\n   *\n   *    lup, lusolve\n   *\n   * @param {Matrix | Array} A    A two dimensional matrix or array\n   * for which to get the QR decomposition.\n   *\n   * @return {{Q: Array | Matrix, R: Array | Matrix}} Q: the orthogonal\n   * matrix and R: the upper triangular matrix\n   */\n  return _extends(typed(name, {\n    DenseMatrix: function DenseMatrix(m) {\n      return _denseQR(m);\n    },\n    SparseMatrix: function SparseMatrix(m) {\n      return _sparseQR(m);\n    },\n    Array: function Array(a) {\n      // create dense matrix from array\n      var m = matrix(a);\n      // lup, use matrix implementation\n      var r = _denseQR(m);\n      // result\n      return {\n        Q: r.Q.valueOf(),\n        R: r.R.valueOf()\n      };\n    }\n  }), {\n    _denseQRimpl\n  });\n  function _denseQRimpl(m) {\n    // rows & columns (m x n)\n    var rows = m._size[0]; // m\n    var cols = m._size[1]; // n\n\n    var Q = identity([rows], 'dense');\n    var Qdata = Q._data;\n    var R = m.clone();\n    var Rdata = R._data;\n\n    // vars\n    var i, j, k;\n    var w = zeros([rows], '');\n    for (k = 0; k < Math.min(cols, rows); ++k) {\n      /*\n       * **k-th Household matrix**\n       *\n       * The matrix I - 2*v*transpose(v)\n       * x     = first column of A\n       * x1    = first element of x\n       * alpha = x1 / |x1| * |x|\n       * e1    = tranpose([1, 0, 0, ...])\n       * u     = x - alpha * e1\n       * v     = u / |u|\n       *\n       * Household matrix = I - 2 * v * tranpose(v)\n       *\n       *  * Initially Q = I and R = A.\n       *  * Household matrix is a reflection in a plane normal to v which\n       *    will zero out all but the top right element in R.\n       *  * Appplying reflection to both Q and R will not change product.\n       *  * Repeat this process on the (1,1) minor to get R as an upper\n       *    triangular matrix.\n       *  * Reflections leave the magnitude of the columns of Q unchanged\n       *    so Q remains othoganal.\n       *\n       */\n\n      var pivot = Rdata[k][k];\n      var sgn = unaryMinus(equal(pivot, 0) ? 1 : sign(pivot));\n      var conjSgn = conj(sgn);\n      var alphaSquared = 0;\n      for (i = k; i < rows; i++) {\n        alphaSquared = addScalar(alphaSquared, multiplyScalar(Rdata[i][k], conj(Rdata[i][k])));\n      }\n      var alpha = multiplyScalar(sgn, sqrt(alphaSquared));\n      if (!isZero(alpha)) {\n        // first element in vector u\n        var u1 = subtractScalar(pivot, alpha);\n\n        // w = v * u1 / |u|    (only elements k to (rows-1) are used)\n        w[k] = 1;\n        for (i = k + 1; i < rows; i++) {\n          w[i] = divideScalar(Rdata[i][k], u1);\n        }\n\n        // tau = - conj(u1 / alpha)\n        var tau = unaryMinus(conj(divideScalar(u1, alpha)));\n        var s = void 0;\n\n        /*\n         * tau and w have been choosen so that\n         *\n         * 2 * v * tranpose(v) = tau * w * tranpose(w)\n         */\n\n        /*\n         * -- calculate R = R - tau * w * tranpose(w) * R --\n         * Only do calculation with rows k to (rows-1)\n         * Additionally columns 0 to (k-1) will not be changed by this\n         *   multiplication so do not bother recalculating them\n         */\n        for (j = k; j < cols; j++) {\n          s = 0.0;\n\n          // calculate jth element of [tranpose(w) * R]\n          for (i = k; i < rows; i++) {\n            s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]));\n          }\n\n          // calculate the jth element of [tau * transpose(w) * R]\n          s = multiplyScalar(s, tau);\n          for (i = k; i < rows; i++) {\n            Rdata[i][j] = multiplyScalar(subtractScalar(Rdata[i][j], multiplyScalar(w[i], s)), conjSgn);\n          }\n        }\n        /*\n         * -- calculate Q = Q - tau * Q * w * transpose(w) --\n         * Q is a square matrix (rows x rows)\n         * Only do calculation with columns k to (rows-1)\n         * Additionally rows 0 to (k-1) will not be changed by this\n         *   multiplication so do not bother recalculating them\n         */\n        for (i = 0; i < rows; i++) {\n          s = 0.0;\n\n          // calculate ith element of [Q * w]\n          for (j = k; j < rows; j++) {\n            s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]));\n          }\n\n          // calculate the ith element of [tau * Q * w]\n          s = multiplyScalar(s, tau);\n          for (j = k; j < rows; ++j) {\n            Qdata[i][j] = divideScalar(subtractScalar(Qdata[i][j], multiplyScalar(s, conj(w[j]))), conjSgn);\n          }\n        }\n      }\n    }\n\n    // return matrices\n    return {\n      Q,\n      R,\n      toString: function toString() {\n        return 'Q: ' + this.Q.toString() + '\\nR: ' + this.R.toString();\n      }\n    };\n  }\n  function _denseQR(m) {\n    var ret = _denseQRimpl(m);\n    var Rdata = ret.R._data;\n    if (m._data.length > 0) {\n      var zero = Rdata[0][0].type === 'Complex' ? complex(0) : 0;\n      for (var i = 0; i < Rdata.length; ++i) {\n        for (var j = 0; j < i && j < (Rdata[0] || []).length; ++j) {\n          Rdata[i][j] = zero;\n        }\n      }\n    }\n    return ret;\n  }\n  function _sparseQR(m) {\n    throw new Error('qr not implemented for sparse matrices yet');\n  }\n});","import { isMatrix } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'det';\nvar dependencies = ['typed', 'matrix', 'subtractScalar', 'multiply', 'divideScalar', 'isZero', 'unaryMinus'];\nexport var createDet = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    subtractScalar,\n    multiply,\n    divideScalar,\n    isZero,\n    unaryMinus\n  } = _ref;\n  /**\n   * Calculate the determinant of a matrix.\n   *\n   * Syntax:\n   *\n   *    math.det(x)\n   *\n   * Examples:\n   *\n   *    math.det([[1, 2], [3, 4]]) // returns -2\n   *\n   *    const A = [\n   *      [-2, 2, 3],\n   *      [-1, 1, 3],\n   *      [2, 0, -1]\n   *    ]\n   *    math.det(A) // returns 6\n   *\n   * See also:\n   *\n   *    inv\n   *\n   * @param {Array | Matrix} x  A matrix\n   * @return {number} The determinant of `x`\n   */\n  return typed(name, {\n    any: function any(x) {\n      return clone(x);\n    },\n    'Array | Matrix': function det(x) {\n      var size;\n      if (isMatrix(x)) {\n        size = x.size();\n      } else if (Array.isArray(x)) {\n        x = matrix(x);\n        size = x.size();\n      } else {\n        // a scalar\n        size = [];\n      }\n      switch (size.length) {\n        case 0:\n          // scalar\n          return clone(x);\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            return clone(x.valueOf()[0]);\n          }\n          if (size[0] === 0) {\n            return 1; // det of an empty matrix is per definition 1\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n          }\n        case 2:\n          {\n            // two-dimensional array\n            var rows = size[0];\n            var cols = size[1];\n            if (rows === cols) {\n              return _det(x.clone().valueOf(), rows, cols);\n            }\n            if (cols === 0) {\n              return 1; // det of an empty matrix is per definition 1\n            } else {\n              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n            }\n          }\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');\n      }\n    }\n  });\n\n  /**\n   * Calculate the determinant of a matrix\n   * @param {Array[]} matrix  A square, two dimensional matrix\n   * @param {number} rows     Number of rows of the matrix (zero-based)\n   * @param {number} cols     Number of columns of the matrix (zero-based)\n   * @returns {number} det\n   * @private\n   */\n  function _det(matrix, rows, cols) {\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      return clone(matrix[0][0]);\n    } else if (rows === 2) {\n      // this is a 2 x 2 matrix\n      // the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12\n      return subtractScalar(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));\n    } else {\n      // Bareiss algorithm\n      // this algorithm have same complexity as LUP decomposition (O(n^3))\n      // but it preserve precision of floating point more relative to the LUP decomposition\n      var negated = false;\n      var rowIndices = new Array(rows).fill(0).map((_, i) => i); // matrix index of row i\n      for (var k = 0; k < rows; k++) {\n        var k_ = rowIndices[k];\n        if (isZero(matrix[k_][k])) {\n          var _k = void 0;\n          for (_k = k + 1; _k < rows; _k++) {\n            if (!isZero(matrix[rowIndices[_k]][k])) {\n              k_ = rowIndices[_k];\n              rowIndices[_k] = rowIndices[k];\n              rowIndices[k] = k_;\n              negated = !negated;\n              break;\n            }\n          }\n          if (_k === rows) return matrix[k_][k]; // some zero of the type\n        }\n        var piv = matrix[k_][k];\n        var piv_ = k === 0 ? 1 : matrix[rowIndices[k - 1]][k - 1];\n        for (var i = k + 1; i < rows; i++) {\n          var i_ = rowIndices[i];\n          for (var j = k + 1; j < rows; j++) {\n            matrix[i_][j] = divideScalar(subtractScalar(multiply(matrix[i_][j], piv), multiply(matrix[i_][k], matrix[k_][j])), piv_);\n          }\n        }\n      }\n      var det = matrix[rowIndices[rows - 1]][rows - 1];\n      return negated ? unaryMinus(det) : det;\n    }\n  }\n});","import { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { format } from '../../utils/string.js';\nvar name = 'inv';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'addScalar', 'multiply', 'unaryMinus', 'det', 'identity', 'abs'];\nexport var createInv = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    addScalar,\n    multiply,\n    unaryMinus,\n    det,\n    identity,\n    abs\n  } = _ref;\n  /**\n   * Calculate the inverse of a square matrix.\n   *\n   * Syntax:\n   *\n   *     math.inv(x)\n   *\n   * Examples:\n   *\n   *     math.inv([[1, 2], [3, 4]])  // returns [[-2, 1], [1.5, -0.5]]\n   *     math.inv(4)                 // returns 0.25\n   *     1 / 4                       // returns 0.25\n   *\n   * See also:\n   *\n   *     det, transpose\n   *\n   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed\n   * @return {number | Complex | Array | Matrix} The inverse of `x`.\n   */\n  return typed(name, {\n    'Array | Matrix': function Array__Matrix(x) {\n      var size = isMatrix(x) ? x.size() : arraySize(x);\n      switch (size.length) {\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            if (isMatrix(x)) {\n              return matrix([divideScalar(1, x.valueOf()[0])]);\n            } else {\n              return [divideScalar(1, x[0])];\n            }\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n          }\n        case 2:\n          // two dimensional array\n          {\n            var rows = size[0];\n            var cols = size[1];\n            if (rows === cols) {\n              if (isMatrix(x)) {\n                return matrix(_inv(x.valueOf(), rows, cols), x.storage());\n              } else {\n                // return an Array\n                return _inv(x, rows, cols);\n              }\n            } else {\n              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n            }\n          }\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');\n      }\n    },\n    any: function any(x) {\n      // scalar\n      return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers\n    }\n  });\n\n  /**\n   * Calculate the inverse of a square matrix\n   * @param {Array[]} mat     A square matrix\n   * @param {number} rows     Number of rows\n   * @param {number} cols     Number of columns, must equal rows\n   * @return {Array[]} inv    Inverse matrix\n   * @private\n   */\n  function _inv(mat, rows, cols) {\n    var r, s, f, value, temp;\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      value = mat[0][0];\n      if (value === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero');\n      }\n      return [[divideScalar(1, value)]];\n    } else if (rows === 2) {\n      // this is a 2 x 2 matrix\n      var d = det(mat);\n      if (d === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero');\n      }\n      return [[divideScalar(mat[1][1], d), divideScalar(unaryMinus(mat[0][1]), d)], [divideScalar(unaryMinus(mat[1][0]), d), divideScalar(mat[0][0], d)]];\n    } else {\n      // this is a matrix of 3 x 3 or larger\n      // calculate inverse using gauss-jordan elimination\n      //      https://en.wikipedia.org/wiki/Gaussian_elimination\n      //      http://mathworld.wolfram.com/MatrixInverse.html\n      //      http://math.uww.edu/~mcfarlat/inverse.htm\n\n      // make a copy of the matrix (only the arrays, not of the elements)\n      var A = mat.concat();\n      for (r = 0; r < rows; r++) {\n        A[r] = A[r].concat();\n      }\n\n      // create an identity matrix which in the end will contain the\n      // matrix inverse\n      var B = identity(rows).valueOf();\n\n      // loop over all columns, and perform row reductions\n      for (var c = 0; c < cols; c++) {\n        // Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]\n        var ABig = abs(A[c][c]);\n        var rBig = c;\n        r = c + 1;\n        while (r < rows) {\n          if (abs(A[r][c]) > ABig) {\n            ABig = abs(A[r][c]);\n            rBig = r;\n          }\n          r++;\n        }\n        if (ABig === 0) {\n          throw Error('Cannot calculate inverse, determinant is zero');\n        }\n        r = rBig;\n        if (r !== c) {\n          temp = A[c];\n          A[c] = A[r];\n          A[r] = temp;\n          temp = B[c];\n          B[c] = B[r];\n          B[r] = temp;\n        }\n\n        // eliminate non-zero values on the other rows at column c\n        var Ac = A[c];\n        var Bc = B[c];\n        for (r = 0; r < rows; r++) {\n          var Ar = A[r];\n          var Br = B[r];\n          if (r !== c) {\n            // eliminate value at column c and row r\n            if (Ar[c] !== 0) {\n              f = divideScalar(unaryMinus(Ar[c]), Ac[c]);\n\n              // add (f * row c) to row r to eliminate the value\n              // at column c\n              for (s = c; s < cols; s++) {\n                Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));\n              }\n              for (s = 0; s < cols; s++) {\n                Br[s] = addScalar(Br[s], multiply(f, Bc[s]));\n              }\n            }\n          } else {\n            // normalize value at Acc to 1,\n            // divide each value on row r with the value at Acc\n            f = Ac[c];\n            for (s = c; s < cols; s++) {\n              Ar[s] = divideScalar(Ar[s], f);\n            }\n            for (s = 0; s < cols; s++) {\n              Br[s] = divideScalar(Br[s], f);\n            }\n          }\n        }\n      }\n      return B;\n    }\n  }\n});","import _extends from \"@babel/runtime/helpers/extends\";\nimport { factory } from '../../utils/factory.js';\nimport { format } from '../../utils/string.js';\nimport { createComplexEigs } from './eigs/complexEigs.js';\nimport { createRealSymmetric } from './eigs/realSymmetric.js';\nimport { typeOf, isNumber, isBigNumber, isComplex, isFraction } from '../../utils/is.js';\nvar name = 'eigs';\n\n// The absolute state of math.js's dependency system:\nvar dependencies = ['config', 'typed', 'matrix', 'addScalar', 'equal', 'subtract', 'abs', 'atan', 'cos', 'sin', 'multiplyScalar', 'divideScalar', 'inv', 'bignumber', 'multiply', 'add', 'larger', 'column', 'flatten', 'number', 'complex', 'sqrt', 'diag', 'size', 'reshape', 'qr', 'usolve', 'usolveAll', 'im', 're', 'smaller', 'matrixFromColumns', 'dot'];\nexport var createEigs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    config,\n    typed,\n    matrix,\n    addScalar,\n    subtract,\n    equal,\n    abs,\n    atan,\n    cos,\n    sin,\n    multiplyScalar,\n    divideScalar,\n    inv,\n    bignumber,\n    multiply,\n    add,\n    larger,\n    column,\n    flatten,\n    number,\n    complex,\n    sqrt,\n    diag,\n    size,\n    reshape,\n    qr,\n    usolve,\n    usolveAll,\n    im,\n    re,\n    smaller,\n    matrixFromColumns,\n    dot\n  } = _ref;\n  var doRealSymmetric = createRealSymmetric({\n    config,\n    addScalar,\n    subtract,\n    column,\n    flatten,\n    equal,\n    abs,\n    atan,\n    cos,\n    sin,\n    multiplyScalar,\n    inv,\n    bignumber,\n    complex,\n    multiply,\n    add\n  });\n  var doComplexEigs = createComplexEigs({\n    config,\n    addScalar,\n    subtract,\n    multiply,\n    multiplyScalar,\n    flatten,\n    divideScalar,\n    sqrt,\n    abs,\n    bignumber,\n    diag,\n    size,\n    reshape,\n    qr,\n    inv,\n    usolve,\n    usolveAll,\n    equal,\n    complex,\n    larger,\n    smaller,\n    matrixFromColumns,\n    dot\n  });\n\n  /**\n   * Compute eigenvalues and optionally eigenvectors of a square matrix.\n   * The eigenvalues are sorted by their absolute value, ascending, and\n   * returned as a vector in the `values` property of the returned project.\n   * An eigenvalue with algebraic multiplicity k will be listed k times, so\n   * that the returned `values` vector always has length equal to the size\n   * of the input matrix.\n   *\n   * The `eigenvectors` property of the return value provides the eigenvectors.\n   * It is an array of plain objects: the `value` property of each gives the\n   * associated eigenvalue, and the `vector` property gives the eigenvector\n   * itself. Note that the same `value` property will occur as many times in\n   * the list provided by `eigenvectors` as the geometric multiplicity of\n   * that value.\n   *\n   * If the algorithm fails to converge, it will throw an error –\n   * in that case, however, you may still find useful information\n   * in `err.values` and `err.vectors`.\n   *\n   * Note that the 'precision' option does not directly specify the _accuracy_\n   * of the returned eigenvalues. Rather, it determines how small an entry\n   * of the iterative approximations to an upper triangular matrix must be\n   * in order to be considered zero. The actual accuracy of the returned\n   * eigenvalues may be greater or less than the precision, depending on the\n   * conditioning of the matrix and how far apart or close the actual\n   * eigenvalues are. Note that currently, relatively simple, \"traditional\"\n   * methods of eigenvalue computation are being used; this is not a modern,\n   * high-precision eigenvalue computation. That said, it should typically\n   * produce fairly reasonable results.\n   *\n   * Syntax:\n   *\n   *     math.eigs(x, [prec])\n   *     math.eigs(x, {options})\n   *\n   * Examples:\n   *\n   *     const { eigs, multiply, column, transpose, matrixFromColumns } = math\n   *     const H = [[5, 2.3], [2.3, 1]]\n   *     const ans = eigs(H) // returns {values: [E1,E2...sorted], eigenvectors: [{value: E1, vector: v2}, {value: e, vector: v2}, ...]\n   *     const E = ans.values\n   *     const V = ans.eigenvectors\n   *     multiply(H, V[0].vector)) // returns multiply(E[0], V[0].vector))\n   *     const U = matrixFromColumns(...V.map(obj => obj.vector))\n   *     const UTxHxU = multiply(transpose(U), H, U) // diagonalizes H if possible\n   *     E[0] == UTxHxU[0][0]  // returns true always\n   *\n   *     // Compute only approximate eigenvalues:\n   *     const {values} = eigs(H, {eigenvectors: false, precision: 1e-6})\n   *\n   * See also:\n   *\n   *     inv\n   *\n   * @param {Array | Matrix} x  Matrix to be diagonalized\n   *\n   * @param {number | BigNumber | OptsObject} [opts] Object with keys `precision`, defaulting to config.relTol, and `eigenvectors`, defaulting to true and specifying whether to compute eigenvectors. If just a number, specifies precision.\n   * @return {{values: Array|Matrix, eigenvectors?: Array<EVobj>}} Object containing an array of eigenvalues and an array of {value: number|BigNumber, vector: Array|Matrix} objects. The eigenvectors property is undefined if eigenvectors were not requested.\n   *\n   */\n  return typed('eigs', {\n    // The conversion to matrix in the first two implementations,\n    // just to convert back to an array right away in\n    // computeValuesAndVectors, is unfortunate, and should perhaps be\n    // streamlined. It is done because the Matrix object carries some\n    // type information about its entries, and so constructing the matrix\n    // is a roundabout way of doing type detection.\n    Array: function Array(x) {\n      return doEigs(matrix(x));\n    },\n    'Array, number|BigNumber': function Array_numberBigNumber(x, prec) {\n      return doEigs(matrix(x), {\n        precision: prec\n      });\n    },\n    'Array, Object'(x, opts) {\n      return doEigs(matrix(x), opts);\n    },\n    Matrix: function Matrix(mat) {\n      return doEigs(mat, {\n        matricize: true\n      });\n    },\n    'Matrix, number|BigNumber': function Matrix_numberBigNumber(mat, prec) {\n      return doEigs(mat, {\n        precision: prec,\n        matricize: true\n      });\n    },\n    'Matrix, Object': function Matrix_Object(mat, opts) {\n      var useOpts = {\n        matricize: true\n      };\n      _extends(useOpts, opts);\n      return doEigs(mat, useOpts);\n    }\n  });\n  function doEigs(mat) {\n    var _opts$precision;\n    var opts = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var computeVectors = 'eigenvectors' in opts ? opts.eigenvectors : true;\n    var prec = (_opts$precision = opts.precision) !== null && _opts$precision !== void 0 ? _opts$precision : config.relTol;\n    var result = computeValuesAndVectors(mat, prec, computeVectors);\n    if (opts.matricize) {\n      result.values = matrix(result.values);\n      if (computeVectors) {\n        result.eigenvectors = result.eigenvectors.map(_ref2 => {\n          var {\n            value,\n            vector\n          } = _ref2;\n          return {\n            value,\n            vector: matrix(vector)\n          };\n        });\n      }\n    }\n    if (computeVectors) {\n      Object.defineProperty(result, 'vectors', {\n        enumerable: false,\n        // to make sure that the eigenvectors can still be\n        // converted to string.\n        get: () => {\n          throw new Error('eigs(M).vectors replaced with eigs(M).eigenvectors');\n        }\n      });\n    }\n    return result;\n  }\n  function computeValuesAndVectors(mat, prec, computeVectors) {\n    var arr = mat.toArray(); // NOTE: arr is guaranteed to be unaliased\n    // and so safe to modify in place\n    var asize = mat.size();\n    if (asize.length !== 2 || asize[0] !== asize[1]) {\n      throw new RangeError(\"Matrix must be square (size: \".concat(format(asize), \")\"));\n    }\n    var N = asize[0];\n    if (isReal(arr, N, prec)) {\n      coerceReal(arr, N); // modifies arr by side effect\n\n      if (isSymmetric(arr, N, prec)) {\n        var _type = coerceTypes(mat, arr, N); // modifies arr by side effect\n        return doRealSymmetric(arr, N, prec, _type, computeVectors);\n      }\n    }\n    var type = coerceTypes(mat, arr, N); // modifies arr by side effect\n    return doComplexEigs(arr, N, prec, type, computeVectors);\n  }\n\n  /** @return {boolean} */\n  function isSymmetric(arr, N, prec) {\n    for (var i = 0; i < N; i++) {\n      for (var j = i; j < N; j++) {\n        // TODO proper comparison of bignum and frac\n        if (larger(bignumber(abs(subtract(arr[i][j], arr[j][i]))), prec)) {\n          return false;\n        }\n      }\n    }\n    return true;\n  }\n\n  /** @return {boolean} */\n  function isReal(arr, N, prec) {\n    for (var i = 0; i < N; i++) {\n      for (var j = 0; j < N; j++) {\n        // TODO proper comparison of bignum and frac\n        if (larger(bignumber(abs(im(arr[i][j]))), prec)) {\n          return false;\n        }\n      }\n    }\n    return true;\n  }\n  function coerceReal(arr, N) {\n    for (var i = 0; i < N; i++) {\n      for (var j = 0; j < N; j++) {\n        arr[i][j] = re(arr[i][j]);\n      }\n    }\n  }\n\n  /** @return {'number' | 'BigNumber' | 'Complex'} */\n  function coerceTypes(mat, arr, N) {\n    /** @type {string} */\n    var type = mat.datatype();\n    if (type === 'number' || type === 'BigNumber' || type === 'Complex') {\n      return type;\n    }\n    var hasNumber = false;\n    var hasBig = false;\n    var hasComplex = false;\n    for (var i = 0; i < N; i++) {\n      for (var j = 0; j < N; j++) {\n        var el = arr[i][j];\n        if (isNumber(el) || isFraction(el)) {\n          hasNumber = true;\n        } else if (isBigNumber(el)) {\n          hasBig = true;\n        } else if (isComplex(el)) {\n          hasComplex = true;\n        } else {\n          throw TypeError('Unsupported type in Matrix: ' + typeOf(el));\n        }\n      }\n    }\n    if (hasBig && hasComplex) {\n      console.warn('Complex BigNumbers not supported, this operation will lose precission.');\n    }\n    if (hasComplex) {\n      for (var _i = 0; _i < N; _i++) {\n        for (var _j = 0; _j < N; _j++) {\n          arr[_i][_j] = complex(arr[_i][_j]);\n        }\n      }\n      return 'Complex';\n    }\n    if (hasBig) {\n      for (var _i2 = 0; _i2 < N; _i2++) {\n        for (var _j2 = 0; _j2 < N; _j2++) {\n          arr[_i2][_j2] = bignumber(arr[_i2][_j2]);\n        }\n      }\n      return 'BigNumber';\n    }\n    if (hasNumber) {\n      for (var _i3 = 0; _i3 < N; _i3++) {\n        for (var _j3 = 0; _j3 < N; _j3++) {\n          arr[_i3][_j3] = number(arr[_i3][_j3]);\n        }\n      }\n      return 'number';\n    } else {\n      throw TypeError('Matrix contains unsupported types only.');\n    }\n  }\n});","import { clone } from '../../../utils/object.js';\nexport function createComplexEigs(_ref) {\n  var {\n    addScalar,\n    subtract,\n    flatten,\n    multiply,\n    multiplyScalar,\n    divideScalar,\n    sqrt,\n    abs,\n    bignumber,\n    diag,\n    size,\n    reshape,\n    inv,\n    qr,\n    usolve,\n    usolveAll,\n    equal,\n    complex,\n    larger,\n    smaller,\n    matrixFromColumns,\n    dot\n  } = _ref;\n  /**\n   * @param {number[][]} arr the matrix to find eigenvalues of\n   * @param {number} N size of the matrix\n   * @param {number|BigNumber} prec precision, anything lower will be considered zero\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @param {boolean} findVectors should we find eigenvectors?\n   *\n   * @returns {{ values: number[], vectors: number[][] }}\n   */\n  function complexEigs(arr, N, prec, type) {\n    var findVectors = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;\n    // TODO check if any row/col are zero except the diagonal\n\n    // make sure corresponding rows and columns have similar magnitude\n    // important because of numerical stability\n    // MODIFIES arr by side effect!\n    var R = balance(arr, N, prec, type, findVectors);\n\n    // R is the row transformation matrix\n    // arr = A' = R A R^-1, A is the original matrix\n    // (if findVectors is false, R is undefined)\n    // (And so to return to original matrix: A = R^-1 arr R)\n\n    // TODO if magnitudes of elements vary over many orders,\n    // move greatest elements to the top left corner\n\n    // using similarity transformations, reduce the matrix\n    // to Hessenberg form (upper triangular plus one subdiagonal row)\n    // updates the transformation matrix R with new row operationsq\n    // MODIFIES arr by side effect!\n    reduceToHessenberg(arr, N, prec, type, findVectors, R);\n    // still true that original A = R^-1 arr R)\n\n    // find eigenvalues\n    var {\n      values,\n      C\n    } = iterateUntilTriangular(arr, N, prec, type, findVectors);\n\n    // values is the list of eigenvalues, C is the column\n    // transformation matrix that transforms arr, the hessenberg\n    // matrix, to upper triangular\n    // (So U = C^-1 arr C and the relationship between current arr\n    // and original A is unchanged.)\n\n    if (findVectors) {\n      var eigenvectors = findEigenvectors(arr, N, C, R, values, prec, type);\n      return {\n        values,\n        eigenvectors\n      };\n    }\n    return {\n      values\n    };\n  }\n\n  /**\n   * @param {number[][]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {number[][]}\n   */\n  function balance(arr, N, prec, type, findVectors) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var realzero = big ? bignumber(0) : 0;\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n    var realone = big ? bignumber(1) : 1;\n\n    // base of the floating-point arithmetic\n    var radix = big ? bignumber(10) : 2;\n    var radixSq = multiplyScalar(radix, radix);\n\n    // the diagonal transformation matrix R\n    var Rdiag;\n    if (findVectors) {\n      Rdiag = Array(N).fill(one);\n    }\n\n    // this isn't the only time we loop thru the matrix...\n    var last = false;\n    while (!last) {\n      // ...haha I'm joking! unless...\n      last = true;\n      for (var i = 0; i < N; i++) {\n        // compute the taxicab norm of i-th column and row\n        // TODO optimize for complex numbers\n        var colNorm = realzero;\n        var rowNorm = realzero;\n        for (var j = 0; j < N; j++) {\n          if (i === j) continue;\n          colNorm = addScalar(colNorm, abs(arr[j][i]));\n          rowNorm = addScalar(rowNorm, abs(arr[i][j]));\n        }\n        if (!equal(colNorm, 0) && !equal(rowNorm, 0)) {\n          // find integer power closest to balancing the matrix\n          // (we want to scale only by integer powers of radix,\n          // so that we don't lose any precision due to round-off)\n\n          var f = realone;\n          var c = colNorm;\n          var rowDivRadix = divideScalar(rowNorm, radix);\n          var rowMulRadix = multiplyScalar(rowNorm, radix);\n          while (smaller(c, rowDivRadix)) {\n            c = multiplyScalar(c, radixSq);\n            f = multiplyScalar(f, radix);\n          }\n          while (larger(c, rowMulRadix)) {\n            c = divideScalar(c, radixSq);\n            f = divideScalar(f, radix);\n          }\n\n          // check whether balancing is needed\n          // condition = (c + rowNorm) / f < 0.95 * (colNorm + rowNorm)\n          var condition = smaller(divideScalar(addScalar(c, rowNorm), f), multiplyScalar(addScalar(colNorm, rowNorm), 0.95));\n\n          // apply balancing similarity transformation\n          if (condition) {\n            // we should loop once again to check whether\n            // another rebalancing is needed\n            last = false;\n            var g = divideScalar(1, f);\n            for (var _j = 0; _j < N; _j++) {\n              if (i === _j) {\n                continue;\n              }\n              arr[i][_j] = multiplyScalar(arr[i][_j], g);\n              arr[_j][i] = multiplyScalar(arr[_j][i], f);\n            }\n\n            // keep track of transformations\n            if (findVectors) {\n              Rdiag[i] = multiplyScalar(Rdiag[i], g);\n            }\n          }\n        }\n      }\n    }\n\n    // return the diagonal row transformation matrix\n    return findVectors ? diag(Rdiag) : null;\n  }\n\n  /**\n   * @param {number[][]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @param {boolean} findVectors\n   * @param {number[][]} R the row transformation matrix that will be modified\n   */\n  function reduceToHessenberg(arr, N, prec, type, findVectors, R) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;\n    if (big) {\n      prec = bignumber(prec);\n    }\n    for (var i = 0; i < N - 2; i++) {\n      // Find the largest subdiag element in the i-th col\n\n      var maxIndex = 0;\n      var max = zero;\n      for (var j = i + 1; j < N; j++) {\n        var el = arr[j][i];\n        if (smaller(abs(max), abs(el))) {\n          max = el;\n          maxIndex = j;\n        }\n      }\n\n      // This col is pivoted, no need to do anything\n      if (smaller(abs(max), prec)) {\n        continue;\n      }\n      if (maxIndex !== i + 1) {\n        // Interchange maxIndex-th and (i+1)-th row\n        var tmp1 = arr[maxIndex];\n        arr[maxIndex] = arr[i + 1];\n        arr[i + 1] = tmp1;\n\n        // Interchange maxIndex-th and (i+1)-th column\n        for (var _j2 = 0; _j2 < N; _j2++) {\n          var tmp2 = arr[_j2][maxIndex];\n          arr[_j2][maxIndex] = arr[_j2][i + 1];\n          arr[_j2][i + 1] = tmp2;\n        }\n\n        // keep track of transformations\n        if (findVectors) {\n          var tmp3 = R[maxIndex];\n          R[maxIndex] = R[i + 1];\n          R[i + 1] = tmp3;\n        }\n      }\n\n      // Reduce following rows and columns\n      for (var _j3 = i + 2; _j3 < N; _j3++) {\n        var n = divideScalar(arr[_j3][i], max);\n        if (n === 0) {\n          continue;\n        }\n\n        // from j-th row subtract n-times (i+1)th row\n        for (var k = 0; k < N; k++) {\n          arr[_j3][k] = subtract(arr[_j3][k], multiplyScalar(n, arr[i + 1][k]));\n        }\n\n        // to (i+1)th column add n-times j-th column\n        for (var _k = 0; _k < N; _k++) {\n          arr[_k][i + 1] = addScalar(arr[_k][i + 1], multiplyScalar(n, arr[_k][_j3]));\n        }\n\n        // keep track of transformations\n        if (findVectors) {\n          for (var _k2 = 0; _k2 < N; _k2++) {\n            R[_j3][_k2] = subtract(R[_j3][_k2], multiplyScalar(n, R[i + 1][_k2]));\n          }\n        }\n      }\n    }\n    return R;\n  }\n\n  /**\n   * @returns {{values: values, C: Matrix}}\n   * @see Press, Wiliams: Numerical recipes in Fortran 77\n   * @see https://en.wikipedia.org/wiki/QR_algorithm\n   */\n  function iterateUntilTriangular(A, N, prec, type, findVectors) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n    if (big) {\n      prec = bignumber(prec);\n    }\n\n    // The Francis Algorithm\n    // The core idea of this algorithm is that doing successive\n    // A' = QtAQ transformations will eventually converge to block-\n    // upper-triangular with diagonal blocks either 1x1 or 2x2.\n    // The Q here is the one from the QR decomposition, A = QR.\n    // Since the eigenvalues of a block-upper-triangular matrix are\n    // the eigenvalues of its diagonal blocks and we know how to find\n    // eigenvalues of a 2x2 matrix, we know the eigenvalues of A.\n\n    var arr = clone(A);\n\n    // the list of converged eigenvalues\n    var lambdas = [];\n\n    // size of arr, which will get smaller as eigenvalues converge\n    var n = N;\n\n    // the diagonal of the block-diagonal matrix that turns\n    // converged 2x2 matrices into upper triangular matrices\n    var Sdiag = [];\n\n    // N×N matrix describing the overall transformation done during the QR algorithm\n    var Qtotal = findVectors ? diag(Array(N).fill(one)) : undefined;\n\n    // nxn matrix describing the QR transformations done since last convergence\n    var Qpartial = findVectors ? diag(Array(n).fill(one)) : undefined;\n\n    // last eigenvalue converged before this many steps\n    var lastConvergenceBefore = 0;\n    while (lastConvergenceBefore <= 100) {\n      lastConvergenceBefore += 1;\n\n      // TODO if the convergence is slow, do something clever\n\n      // Perform the factorization\n\n      var k = arr[n - 1][n - 1]; // TODO this is apparently a somewhat\n      // old-fashioned choice; ideally set close to an eigenvalue, or\n      // perhaps better yet switch to the implicit QR version that is sometimes\n      // specifically called the \"Francis algorithm\" that is alluded to\n      // in the following TODO. (Or perhaps we switch to an independently\n      // optimized third-party package for the linear algebra operations...)\n\n      for (var i = 0; i < n; i++) {\n        arr[i][i] = subtract(arr[i][i], k);\n      }\n\n      // TODO do an implicit QR transformation\n      var {\n        Q,\n        R\n      } = qr(arr);\n      arr = multiply(R, Q);\n      for (var _i = 0; _i < n; _i++) {\n        arr[_i][_i] = addScalar(arr[_i][_i], k);\n      }\n\n      // keep track of transformations\n      if (findVectors) {\n        Qpartial = multiply(Qpartial, Q);\n      }\n\n      // The rightmost diagonal element converged to an eigenvalue\n      if (n === 1 || smaller(abs(arr[n - 1][n - 2]), prec)) {\n        lastConvergenceBefore = 0;\n        lambdas.push(arr[n - 1][n - 1]);\n\n        // keep track of transformations\n        if (findVectors) {\n          Sdiag.unshift([[1]]);\n          inflateMatrix(Qpartial, N);\n          Qtotal = multiply(Qtotal, Qpartial);\n          if (n > 1) {\n            Qpartial = diag(Array(n - 1).fill(one));\n          }\n        }\n\n        // reduce the matrix size\n        n -= 1;\n        arr.pop();\n        for (var _i2 = 0; _i2 < n; _i2++) {\n          arr[_i2].pop();\n        }\n\n        // The rightmost diagonal 2x2 block converged\n      } else if (n === 2 || smaller(abs(arr[n - 2][n - 3]), prec)) {\n        lastConvergenceBefore = 0;\n        var ll = eigenvalues2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1]);\n        lambdas.push(...ll);\n\n        // keep track of transformations\n        if (findVectors) {\n          Sdiag.unshift(jordanBase2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1], ll[0], ll[1], prec, type));\n          inflateMatrix(Qpartial, N);\n          Qtotal = multiply(Qtotal, Qpartial);\n          if (n > 2) {\n            Qpartial = diag(Array(n - 2).fill(one));\n          }\n        }\n\n        // reduce the matrix size\n        n -= 2;\n        arr.pop();\n        arr.pop();\n        for (var _i3 = 0; _i3 < n; _i3++) {\n          arr[_i3].pop();\n          arr[_i3].pop();\n        }\n      }\n      if (n === 0) {\n        break;\n      }\n    }\n\n    // standard sorting\n    lambdas.sort((a, b) => +subtract(abs(a), abs(b)));\n\n    // the algorithm didn't converge\n    if (lastConvergenceBefore > 100) {\n      var err = Error('The eigenvalues failed to converge. Only found these eigenvalues: ' + lambdas.join(', '));\n      err.values = lambdas;\n      err.vectors = [];\n      throw err;\n    }\n\n    // combine the overall QR transformation Qtotal with the subsequent\n    // transformation S that turns the diagonal 2x2 blocks to upper triangular\n    var C = findVectors ? multiply(Qtotal, blockDiag(Sdiag, N)) : undefined;\n    return {\n      values: lambdas,\n      C\n    };\n  }\n\n  /**\n   * @param {Matrix} A hessenberg-form matrix\n   * @param {number} N size of A\n   * @param {Matrix} C column transformation matrix that turns A into upper triangular\n   * @param {Matrix} R similarity that turns original matrix into A\n   * @param {number[]} values array of eigenvalues of A\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {number[][]} eigenvalues\n   */\n  function findEigenvectors(A, N, C, R, values, prec, type) {\n    var Cinv = inv(C);\n    var U = multiply(Cinv, A, C);\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n\n    // turn values into a kind of \"multiset\"\n    // this way it is easier to find eigenvectors\n    var uniqueValues = [];\n    var multiplicities = [];\n    for (var lambda of values) {\n      var i = indexOf(uniqueValues, lambda, equal);\n      if (i === -1) {\n        uniqueValues.push(lambda);\n        multiplicities.push(1);\n      } else {\n        multiplicities[i] += 1;\n      }\n    }\n\n    // find eigenvectors by solving U − lambdaE = 0\n    // TODO replace with an iterative eigenvector algorithm\n    // (this one might fail for imprecise eigenvalues)\n\n    var vectors = [];\n    var len = uniqueValues.length;\n    var b = Array(N).fill(zero);\n    var E = diag(Array(N).fill(one));\n    var _loop = function _loop() {\n      var lambda = uniqueValues[_i4];\n      var S = subtract(U, multiply(lambda, E)); // the characteristic matrix\n\n      var solutions = usolveAll(S, b);\n      solutions.shift(); // ignore the null vector\n\n      // looks like we missed something, try inverse iteration\n      // But if that fails, just presume that the original matrix truly\n      // was defective.\n      while (solutions.length < multiplicities[_i4]) {\n        var approxVec = inverseIterate(S, N, solutions, prec, type);\n        if (approxVec === null) {\n          break;\n        } // no more vectors were found\n        solutions.push(approxVec);\n      }\n\n      // Transform back into original array coordinates\n      var correction = multiply(inv(R), C);\n      solutions = solutions.map(v => multiply(correction, v));\n      vectors.push(...solutions.map(v => ({\n        value: lambda,\n        vector: flatten(v)\n      })));\n    };\n    for (var _i4 = 0; _i4 < len; _i4++) {\n      _loop();\n    }\n    return vectors;\n  }\n\n  /**\n   * Compute the eigenvalues of an 2x2 matrix\n   * @return {[number,number]}\n   */\n  function eigenvalues2x2(a, b, c, d) {\n    // lambda_+- = 1/2 trA +- 1/2 sqrt( tr^2 A - 4 detA )\n    var trA = addScalar(a, d);\n    var detA = subtract(multiplyScalar(a, d), multiplyScalar(b, c));\n    var x = multiplyScalar(trA, 0.5);\n    var y = multiplyScalar(sqrt(subtract(multiplyScalar(trA, trA), multiplyScalar(4, detA))), 0.5);\n    return [addScalar(x, y), subtract(x, y)];\n  }\n\n  /**\n   * For an 2x2 matrix compute the transformation matrix S,\n   * so that SAS^-1 is an upper triangular matrix\n   * @return {[[number,number],[number,number]]}\n   * @see https://math.berkeley.edu/~ogus/old/Math_54-05/webfoils/jordan.pdf\n   * @see http://people.math.harvard.edu/~knill/teaching/math21b2004/exhibits/2dmatrices/index.html\n   */\n  function jordanBase2x2(a, b, c, d, l1, l2, prec, type) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n\n    // matrix is already upper triangular\n    // return an identity matrix\n    if (smaller(abs(c), prec)) {\n      return [[one, zero], [zero, one]];\n    }\n\n    // matrix is diagonalizable\n    // return its eigenvectors as columns\n    if (larger(abs(subtract(l1, l2)), prec)) {\n      return [[subtract(l1, d), subtract(l2, d)], [c, c]];\n    }\n\n    // matrix is not diagonalizable\n    // compute diagonal elements of N = A - lambdaI\n    var na = subtract(a, l1);\n    var nd = subtract(d, l1);\n\n    // col(N,2) = 0  implies  S = ( col(N,1), e_1 )\n    // col(N,2) != 0 implies  S = ( col(N,2), e_2 )\n\n    if (smaller(abs(b), prec) && smaller(abs(nd), prec)) {\n      return [[na, one], [c, zero]];\n    } else {\n      return [[b, zero], [nd, one]];\n    }\n  }\n\n  /**\n   * Enlarge the matrix from nxn to NxN, setting the new\n   * elements to 1 on diagonal and 0 elsewhere\n   */\n  function inflateMatrix(arr, N) {\n    // add columns\n    for (var i = 0; i < arr.length; i++) {\n      arr[i].push(...Array(N - arr[i].length).fill(0));\n    }\n\n    // add rows\n    for (var _i5 = arr.length; _i5 < N; _i5++) {\n      arr.push(Array(N).fill(0));\n      arr[_i5][_i5] = 1;\n    }\n    return arr;\n  }\n\n  /**\n   * Create a block-diagonal matrix with the given square matrices on the diagonal\n   * @param {Matrix[] | number[][][]} arr array of matrices to be placed on the diagonal\n   * @param {number} N the size of the resulting matrix\n   */\n  function blockDiag(arr, N) {\n    var M = [];\n    for (var i = 0; i < N; i++) {\n      M[i] = Array(N).fill(0);\n    }\n    var I = 0;\n    for (var sub of arr) {\n      var n = sub.length;\n      for (var _i6 = 0; _i6 < n; _i6++) {\n        for (var j = 0; j < n; j++) {\n          M[I + _i6][I + j] = sub[_i6][j];\n        }\n      }\n      I += n;\n    }\n    return M;\n  }\n\n  /**\n   * Finds the index of an element in an array using a custom equality function\n   * @template T\n   * @param {Array<T>} arr array in which to search\n   * @param {T} el the element to find\n   * @param {function(T, T): boolean} fn the equality function, first argument is an element of `arr`, the second is always `el`\n   * @returns {number} the index of `el`, or -1 when it's not in `arr`\n   */\n  function indexOf(arr, el, fn) {\n    for (var i = 0; i < arr.length; i++) {\n      if (fn(arr[i], el)) {\n        return i;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * Provided a near-singular upper-triangular matrix A and a list of vectors,\n   * finds an eigenvector of A with the smallest eigenvalue, which is orthogonal\n   * to each vector in the list\n   * @template T\n   * @param {T[][]} A near-singular square matrix\n   * @param {number} N dimension\n   * @param {T[][]} orthog list of vectors\n   * @param {number} prec epsilon\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @return {T[] | null} eigenvector\n   *\n   * @see Numerical Recipes for Fortran 77 – 11.7 Eigenvalues or Eigenvectors by Inverse Iteration\n   */\n  function inverseIterate(A, N, orthog, prec, type) {\n    var largeNum = type === 'BigNumber' ? bignumber(1000) : 1000;\n    var b; // the vector\n\n    // you better choose a random vector before I count to five\n    var i = 0;\n    for (; i < 5; ++i) {\n      b = randomOrthogonalVector(N, orthog, type);\n      try {\n        b = usolve(A, b);\n      } catch (_unused) {\n        // That direction didn't work, likely because the original matrix\n        // was defective. But still make the full number of tries...\n        continue;\n      }\n      if (larger(norm(b), largeNum)) {\n        break;\n      }\n    }\n    if (i >= 5) {\n      return null; // couldn't find any orthogonal vector in the image\n    }\n\n    // you better converge before I count to ten\n    i = 0;\n    while (true) {\n      var c = usolve(A, b);\n      if (smaller(norm(orthogonalComplement(b, [c])), prec)) {\n        break;\n      }\n      if (++i >= 10) {\n        return null;\n      }\n      b = normalize(c);\n    }\n    return b;\n  }\n\n  /**\n   * Generates a random unit vector of dimension N, orthogonal to each vector in the list\n   * @template T\n   * @param {number} N dimension\n   * @param {T[][]} orthog list of vectors\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {T[]} random vector\n   */\n  function randomOrthogonalVector(N, orthog, type) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n\n    // generate random vector with the correct type\n    var v = Array(N).fill(0).map(_ => 2 * Math.random() - 1);\n    if (big) {\n      v = v.map(n => bignumber(n));\n    }\n    if (cplx) {\n      v = v.map(n => complex(n));\n    }\n\n    // project to orthogonal complement\n    v = orthogonalComplement(v, orthog);\n\n    // normalize\n    return normalize(v, type);\n  }\n\n  /**\n   * Project vector v to the orthogonal complement of an array of vectors\n   */\n  function orthogonalComplement(v, orthog) {\n    var vectorShape = size(v);\n    for (var w of orthog) {\n      w = reshape(w, vectorShape); // make sure this is just a vector computation\n      // v := v − (w, v)/|w|^2 w\n      v = subtract(v, multiply(divideScalar(dot(w, v), dot(w, w)), w));\n    }\n    return v;\n  }\n\n  /**\n   * Calculate the norm of a vector.\n   * We can't use math.norm because factory can't handle circular dependency.\n   * Seriously, I'm really fed up with factory.\n   */\n  function norm(v) {\n    return abs(sqrt(dot(v, v)));\n  }\n\n  /**\n   * Normalize a vector\n   * @template T\n   * @param {T[]} v\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {T[]} normalized vec\n   */\n  function normalize(v, type) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n    return multiply(divideScalar(one, norm(v)), v);\n  }\n  return complexEigs;\n}","import { clone } from '../../../utils/object.js';\nexport function createRealSymmetric(_ref) {\n  var {\n    config,\n    addScalar,\n    subtract,\n    abs,\n    atan,\n    cos,\n    sin,\n    multiplyScalar,\n    inv,\n    bignumber,\n    multiply,\n    add\n  } = _ref;\n  /**\n   * @param {number[] | BigNumber[]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number' | 'BigNumber'} type\n   */\n  function main(arr, N) {\n    var prec = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : config.relTol;\n    var type = arguments.length > 3 ? arguments[3] : undefined;\n    var computeVectors = arguments.length > 4 ? arguments[4] : undefined;\n    if (type === 'number') {\n      return diag(arr, prec, computeVectors);\n    }\n    if (type === 'BigNumber') {\n      return diagBig(arr, prec, computeVectors);\n    }\n    throw TypeError('Unsupported data type: ' + type);\n  }\n\n  // diagonalization implementation for number (efficient)\n  function diag(x, precision, computeVectors) {\n    var N = x.length;\n    var e0 = Math.abs(precision / N);\n    var psi;\n    var Sij;\n    if (computeVectors) {\n      Sij = new Array(N);\n      // Sij is Identity Matrix\n      for (var i = 0; i < N; i++) {\n        Sij[i] = Array(N).fill(0);\n        Sij[i][i] = 1.0;\n      }\n    }\n    // initial error\n    var Vab = getAij(x);\n    while (Math.abs(Vab[1]) >= Math.abs(e0)) {\n      var _i = Vab[0][0];\n      var j = Vab[0][1];\n      psi = getTheta(x[_i][_i], x[j][j], x[_i][j]);\n      x = x1(x, psi, _i, j);\n      if (computeVectors) Sij = Sij1(Sij, psi, _i, j);\n      Vab = getAij(x);\n    }\n    var Ei = Array(N).fill(0); // eigenvalues\n    for (var _i2 = 0; _i2 < N; _i2++) {\n      Ei[_i2] = x[_i2][_i2];\n    }\n    return sorting(clone(Ei), Sij, computeVectors);\n  }\n\n  // diagonalization implementation for bigNumber\n  function diagBig(x, precision, computeVectors) {\n    var N = x.length;\n    var e0 = abs(precision / N);\n    var psi;\n    var Sij;\n    if (computeVectors) {\n      Sij = new Array(N);\n      // Sij is Identity Matrix\n      for (var i = 0; i < N; i++) {\n        Sij[i] = Array(N).fill(0);\n        Sij[i][i] = 1.0;\n      }\n    }\n    // initial error\n    var Vab = getAijBig(x);\n    while (abs(Vab[1]) >= abs(e0)) {\n      var _i3 = Vab[0][0];\n      var j = Vab[0][1];\n      psi = getThetaBig(x[_i3][_i3], x[j][j], x[_i3][j]);\n      x = x1Big(x, psi, _i3, j);\n      if (computeVectors) Sij = Sij1Big(Sij, psi, _i3, j);\n      Vab = getAijBig(x);\n    }\n    var Ei = Array(N).fill(0); // eigenvalues\n    for (var _i4 = 0; _i4 < N; _i4++) {\n      Ei[_i4] = x[_i4][_i4];\n    }\n    // return [clone(Ei), clone(Sij)]\n    return sorting(clone(Ei), Sij, computeVectors);\n  }\n\n  // get angle\n  function getTheta(aii, ajj, aij) {\n    var denom = ajj - aii;\n    if (Math.abs(denom) <= config.relTol) {\n      return Math.PI / 4.0;\n    } else {\n      return 0.5 * Math.atan(2.0 * aij / (ajj - aii));\n    }\n  }\n\n  // get angle\n  function getThetaBig(aii, ajj, aij) {\n    var denom = subtract(ajj, aii);\n    if (abs(denom) <= config.relTol) {\n      return bignumber(-1).acos().div(4);\n    } else {\n      return multiplyScalar(0.5, atan(multiply(2.0, aij, inv(denom))));\n    }\n  }\n\n  // update eigvec\n  function Sij1(Sij, theta, i, j) {\n    var N = Sij.length;\n    var c = Math.cos(theta);\n    var s = Math.sin(theta);\n    var Ski = Array(N).fill(0);\n    var Skj = Array(N).fill(0);\n    for (var k = 0; k < N; k++) {\n      Ski[k] = c * Sij[k][i] - s * Sij[k][j];\n      Skj[k] = s * Sij[k][i] + c * Sij[k][j];\n    }\n    for (var _k = 0; _k < N; _k++) {\n      Sij[_k][i] = Ski[_k];\n      Sij[_k][j] = Skj[_k];\n    }\n    return Sij;\n  }\n  // update eigvec for overlap\n  function Sij1Big(Sij, theta, i, j) {\n    var N = Sij.length;\n    var c = cos(theta);\n    var s = sin(theta);\n    var Ski = Array(N).fill(bignumber(0));\n    var Skj = Array(N).fill(bignumber(0));\n    for (var k = 0; k < N; k++) {\n      Ski[k] = subtract(multiplyScalar(c, Sij[k][i]), multiplyScalar(s, Sij[k][j]));\n      Skj[k] = addScalar(multiplyScalar(s, Sij[k][i]), multiplyScalar(c, Sij[k][j]));\n    }\n    for (var _k2 = 0; _k2 < N; _k2++) {\n      Sij[_k2][i] = Ski[_k2];\n      Sij[_k2][j] = Skj[_k2];\n    }\n    return Sij;\n  }\n\n  // update matrix\n  function x1Big(Hij, theta, i, j) {\n    var N = Hij.length;\n    var c = bignumber(cos(theta));\n    var s = bignumber(sin(theta));\n    var c2 = multiplyScalar(c, c);\n    var s2 = multiplyScalar(s, s);\n    var Aki = Array(N).fill(bignumber(0));\n    var Akj = Array(N).fill(bignumber(0));\n    // 2cs Hij\n    var csHij = multiply(bignumber(2), c, s, Hij[i][j]);\n    //  Aii\n    var Aii = addScalar(subtract(multiplyScalar(c2, Hij[i][i]), csHij), multiplyScalar(s2, Hij[j][j]));\n    var Ajj = add(multiplyScalar(s2, Hij[i][i]), csHij, multiplyScalar(c2, Hij[j][j]));\n    // 0  to i\n    for (var k = 0; k < N; k++) {\n      Aki[k] = subtract(multiplyScalar(c, Hij[i][k]), multiplyScalar(s, Hij[j][k]));\n      Akj[k] = addScalar(multiplyScalar(s, Hij[i][k]), multiplyScalar(c, Hij[j][k]));\n    }\n    // Modify Hij\n    Hij[i][i] = Aii;\n    Hij[j][j] = Ajj;\n    Hij[i][j] = bignumber(0);\n    Hij[j][i] = bignumber(0);\n    // 0  to i\n    for (var _k3 = 0; _k3 < N; _k3++) {\n      if (_k3 !== i && _k3 !== j) {\n        Hij[i][_k3] = Aki[_k3];\n        Hij[_k3][i] = Aki[_k3];\n        Hij[j][_k3] = Akj[_k3];\n        Hij[_k3][j] = Akj[_k3];\n      }\n    }\n    return Hij;\n  }\n\n  // update matrix\n  function x1(Hij, theta, i, j) {\n    var N = Hij.length;\n    var c = Math.cos(theta);\n    var s = Math.sin(theta);\n    var c2 = c * c;\n    var s2 = s * s;\n    var Aki = Array(N).fill(0);\n    var Akj = Array(N).fill(0);\n    //  Aii\n    var Aii = c2 * Hij[i][i] - 2 * c * s * Hij[i][j] + s2 * Hij[j][j];\n    var Ajj = s2 * Hij[i][i] + 2 * c * s * Hij[i][j] + c2 * Hij[j][j];\n    // 0  to i\n    for (var k = 0; k < N; k++) {\n      Aki[k] = c * Hij[i][k] - s * Hij[j][k];\n      Akj[k] = s * Hij[i][k] + c * Hij[j][k];\n    }\n    // Modify Hij\n    Hij[i][i] = Aii;\n    Hij[j][j] = Ajj;\n    Hij[i][j] = 0;\n    Hij[j][i] = 0;\n    // 0  to i\n    for (var _k4 = 0; _k4 < N; _k4++) {\n      if (_k4 !== i && _k4 !== j) {\n        Hij[i][_k4] = Aki[_k4];\n        Hij[_k4][i] = Aki[_k4];\n        Hij[j][_k4] = Akj[_k4];\n        Hij[_k4][j] = Akj[_k4];\n      }\n    }\n    return Hij;\n  }\n\n  // get max off-diagonal value from Upper Diagonal\n  function getAij(Mij) {\n    var N = Mij.length;\n    var maxMij = 0;\n    var maxIJ = [0, 1];\n    for (var i = 0; i < N; i++) {\n      for (var j = i + 1; j < N; j++) {\n        if (Math.abs(maxMij) < Math.abs(Mij[i][j])) {\n          maxMij = Math.abs(Mij[i][j]);\n          maxIJ = [i, j];\n        }\n      }\n    }\n    return [maxIJ, maxMij];\n  }\n\n  // get max off-diagonal value from Upper Diagonal\n  function getAijBig(Mij) {\n    var N = Mij.length;\n    var maxMij = 0;\n    var maxIJ = [0, 1];\n    for (var i = 0; i < N; i++) {\n      for (var j = i + 1; j < N; j++) {\n        if (abs(maxMij) < abs(Mij[i][j])) {\n          maxMij = abs(Mij[i][j]);\n          maxIJ = [i, j];\n        }\n      }\n    }\n    return [maxIJ, maxMij];\n  }\n\n  // sort results\n  function sorting(E, S, computeVectors) {\n    var N = E.length;\n    var values = Array(N);\n    var vecs;\n    if (computeVectors) {\n      vecs = Array(N);\n      for (var k = 0; k < N; k++) {\n        vecs[k] = Array(N);\n      }\n    }\n    for (var i = 0; i < N; i++) {\n      var minID = 0;\n      var minE = E[0];\n      for (var j = 0; j < E.length; j++) {\n        if (abs(E[j]) < abs(minE)) {\n          minID = j;\n          minE = E[minID];\n        }\n      }\n      values[i] = E.splice(minID, 1)[0];\n      if (computeVectors) {\n        for (var _k5 = 0; _k5 < N; _k5++) {\n          vecs[i][_k5] = S[_k5][minID];\n          S[_k5].splice(minID, 1);\n        }\n      }\n    }\n    if (!computeVectors) return {\n      values\n    };\n    var eigenvectors = vecs.map((vector, i) => ({\n      value: values[i],\n      vector\n    }));\n    return {\n      values,\n      eigenvectors\n    };\n  }\n  return main;\n}","import { factory } from '../../utils/factory.js';\nimport { extend } from '../../utils/object.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nvar name = 'divide';\nvar dependencies = ['typed', 'matrix', 'multiply', 'equalScalar', 'divideScalar', 'inv'];\nexport var createDivide = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    multiply,\n    equalScalar,\n    divideScalar,\n    inv\n  } = _ref;\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n\n  /**\n   * Divide two values, `x / y`.\n   * To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`.\n   *\n   * Syntax:\n   *\n   *    math.divide(x, y)\n   *\n   * Examples:\n   *\n   *    math.divide(2, 3)            // returns number 0.6666666666666666\n   *\n   *    const a = math.complex(5, 14)\n   *    const b = math.complex(4, 1)\n   *    math.divide(a, b)            // returns Complex 2 + 3i\n   *\n   *    const c = [[7, -6], [13, -4]]\n   *    const d = [[1, 2], [4, 3]]\n   *    math.divide(c, d)            // returns Array [[-9, 4], [-11, 6]]\n   *\n   *    const e = math.unit('18 km')\n   *    math.divide(e, 4.5)          // returns Unit 4 km\n   *\n   * See also:\n   *\n   *    multiply\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x   Numerator\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix} y          Denominator\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix}                      Quotient, `x / y`\n   */\n  return typed('divide', extend({\n    // we extend the signatures of divideScalar with signatures dealing with matrices\n\n    'Array | Matrix, Array | Matrix': function Array__Matrix_Array__Matrix(x, y) {\n      // TODO: implement matrix right division using pseudo inverse\n      // https://www.mathworks.nl/help/matlab/ref/mrdivide.html\n      // https://www.gnu.org/software/octave/doc/interpreter/Arithmetic-Ops.html\n      // https://stackoverflow.com/questions/12263932/how-does-gnu-octave-matrix-division-work-getting-unexpected-behaviour\n      return multiply(x, inv(y));\n    },\n    'DenseMatrix, any': function DenseMatrix_any(x, y) {\n      return matAlgo14xDs(x, y, divideScalar, false);\n    },\n    'SparseMatrix, any': function SparseMatrix_any(x, y) {\n      return matAlgo11xS0s(x, y, divideScalar, false);\n    },\n    'Array, any': function Array_any(x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(x), y, divideScalar, false).valueOf();\n    },\n    'any, Array | Matrix': function any_Array__Matrix(x, y) {\n      return multiply(x, inv(y));\n    }\n  }, divideScalar.signatures));\n});","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';\nimport { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'mean';\nvar dependencies = ['typed', 'add', 'divide'];\nexport var createMean = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    divide\n  } = _ref;\n  /**\n   * Compute the mean value of matrix or a list with values.\n   * In case of a multidimensional array, the mean of the flattened array\n   * will be calculated. When `dim` is provided, the maximum over the selected\n   * dimension will be calculated. Parameter `dim` is zero-based.\n   *\n   * Syntax:\n   *\n   *     math.mean(a, b, c, ...)\n   *     math.mean(A)\n   *     math.mean(A, dimension)\n   *\n   * Examples:\n   *\n   *     math.mean(2, 1, 4, 3)                     // returns 2.5\n   *     math.mean([1, 2.7, 3.2, 4])               // returns 2.725\n   *\n   *     math.mean([[2, 5], [6, 3], [1, 7]], 0)    // returns [3, 5]\n   *     math.mean([[2, 5], [6, 3], [1, 7]], 1)    // returns [3.5, 4.5, 4]\n   *\n   * See also:\n   *\n   *     median, min, max, sum, prod, std, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The mean of all values\n   */\n  return typed(name, {\n    // mean([a, b, c, d, ...])\n    'Array | Matrix': _mean,\n    // mean([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': _nmeanDim,\n    // mean(a, b, c, d, ...)\n    '...': function _(args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function mean');\n      }\n      return _mean(args);\n    }\n  });\n\n  /**\n   * Calculate the mean value in an n-dimensional array, returning a\n   * n-1 dimensional array\n   * @param {Array} array\n   * @param {number} dim\n   * @return {number} mean\n   * @private\n   */\n  function _nmeanDim(array, dim) {\n    try {\n      var sum = reduce(array, dim, add);\n      var s = Array.isArray(array) ? arraySize(array) : array.size();\n      return divide(sum, s[dim]);\n    } catch (err) {\n      throw improveErrorMessage(err, 'mean');\n    }\n  }\n\n  /**\n   * Recursively calculate the mean value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} mean\n   * @private\n   */\n  function _mean(array) {\n    var sum;\n    var num = 0;\n    deepForEach(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value);\n        num++;\n      } catch (err) {\n        throw improveErrorMessage(err, 'mean', value);\n      }\n    });\n    if (num === 0) {\n      throw new Error('Cannot calculate the mean of an empty array');\n    }\n    return divide(sum, num);\n  }\n});","import { deepForEach } from '../../utils/collection.js';\nimport { isBigNumber } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar DEFAULT_NORMALIZATION = 'unbiased';\nvar name = 'variance';\nvar dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'mapSlices', 'isNaN'];\nexport var createVariance = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    subtract,\n    multiply,\n    divide,\n    mapSlices,\n    isNaN: mathIsNaN\n  } = _ref;\n  /**\n   * Compute the variance of a matrix or a  list with values.\n   * In case of a multidimensional array or matrix, the variance over all\n   * elements will be calculated.\n   *\n   * Additionally, it is possible to compute the variance along the rows\n   * or columns of a matrix by specifying the dimension as the second argument.\n   *\n   * Optionally, the type of normalization can be specified as the final\n   * parameter. The parameter `normalization` can be one of the following values:\n   *\n   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)\n   * - 'uncorrected'        The sum of squared errors is divided by n\n   * - 'biased'             The sum of squared errors is divided by (n + 1)\n   *\n   *\n   * Note that older browser may not like the variable name `var`. In that\n   * case, the function can be called as `math['var'](...)` instead of\n   * `math.var(...)`.\n   *\n   * Syntax:\n   *\n   *     math.variance(a, b, c, ...)\n   *     math.variance(A)\n   *     math.variance(A, normalization)\n   *     math.variance(A, dimension)\n   *     math.variance(A, dimension, normalization)\n   *\n   * Examples:\n   *\n   *     math.variance(2, 4, 6)                     // returns 4\n   *     math.variance([2, 4, 6, 8])                // returns 6.666666666666667\n   *     math.variance([2, 4, 6, 8], 'uncorrected') // returns 5\n   *     math.variance([2, 4, 6, 8], 'biased')      // returns 4\n   *\n   *     math.variance([[1, 2, 3], [4, 5, 6]])      // returns 3.5\n   *     math.variance([[1, 2, 3], [4, 6, 8]], 0)   // returns [4.5, 8, 12.5]\n   *     math.variance([[1, 2, 3], [4, 6, 8]], 1)   // returns [1, 4]\n   *     math.variance([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.5, 2]\n   *\n   * See also:\n   *\n   *    mean, median, max, min, prod, std, sum\n   *\n   * @param {Array | Matrix} array\n   *                        A single matrix or or multiple scalar values\n   * @param {string} [normalization='unbiased']\n   *                        Determines how to normalize the variance.\n   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.\n   * @param dimension {number | BigNumber}\n   *                        Determines the axis to compute the variance for a matrix\n   * @return {*} The variance\n   */\n  return typed(name, {\n    // variance([a, b, c, d, ...])\n    'Array | Matrix': function Array__Matrix(array) {\n      return _var(array, DEFAULT_NORMALIZATION);\n    },\n    // variance([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _var,\n    // variance([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': function Array__Matrix_number__BigNumber(array, dim) {\n      return _varDim(array, dim, DEFAULT_NORMALIZATION);\n    },\n    // variance([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _varDim,\n    // variance(a, b, c, d, ...)\n    '...': function _(args) {\n      return _var(args, DEFAULT_NORMALIZATION);\n    }\n  });\n\n  /**\n   * Recursively calculate the variance of an n-dimensional array\n   * @param {Array} array\n   * @param {string} normalization\n   *                        Determines how to normalize the variance:\n   *                        - 'unbiased'    The sum of squared errors is divided by (n - 1)\n   *                        - 'uncorrected' The sum of squared errors is divided by n\n   *                        - 'biased'      The sum of squared errors is divided by (n + 1)\n   * @return {number | BigNumber} variance\n   * @private\n   */\n  function _var(array, normalization) {\n    var sum;\n    var num = 0;\n    if (array.length === 0) {\n      throw new SyntaxError('Function variance requires one or more parameters (0 provided)');\n    }\n\n    // calculate the mean and number of elements\n    deepForEach(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value);\n        num++;\n      } catch (err) {\n        throw improveErrorMessage(err, 'variance', value);\n      }\n    });\n    if (num === 0) throw new Error('Cannot calculate variance of an empty array');\n    var mean = divide(sum, num);\n\n    // calculate the variance\n    sum = undefined;\n    deepForEach(array, function (value) {\n      var diff = subtract(value, mean);\n      sum = sum === undefined ? multiply(diff, diff) : add(sum, multiply(diff, diff));\n    });\n    if (mathIsNaN(sum)) {\n      return sum;\n    }\n    switch (normalization) {\n      case 'uncorrected':\n        return divide(sum, num);\n      case 'biased':\n        return divide(sum, num + 1);\n      case 'unbiased':\n        {\n          var zero = isBigNumber(sum) ? sum.mul(0) : 0;\n          return num === 1 ? zero : divide(sum, num - 1);\n        }\n      default:\n        throw new Error('Unknown normalization \"' + normalization + '\". ' + 'Choose \"unbiased\" (default), \"uncorrected\", or \"biased\".');\n    }\n  }\n  function _varDim(array, dim, normalization) {\n    try {\n      if (array.length === 0) {\n        throw new SyntaxError('Function variance requires one or more parameters (0 provided)');\n      }\n      return mapSlices(array, dim, x => _var(x, normalization));\n    } catch (err) {\n      throw improveErrorMessage(err, 'variance');\n    }\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { isCollection } from '../../utils/is.js';\nvar name = 'std';\nvar dependencies = ['typed', 'map', 'sqrt', 'variance'];\nexport var createStd = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    map,\n    sqrt,\n    variance\n  } = _ref;\n  /**\n   * Compute the standard deviation of a matrix or a  list with values.\n   * The standard deviations is defined as the square root of the variance:\n   * `std(A) = sqrt(variance(A))`.\n   * In case of a (multi dimensional) array or matrix, the standard deviation\n   * over all elements will be calculated by default, unless an axis is specified\n   * in which case the standard deviation will be computed along that axis.\n   *\n   * Additionally, it is possible to compute the standard deviation along the rows\n   * or columns of a matrix by specifying the dimension as the second argument.\n   *\n   * Optionally, the type of normalization can be specified as the final\n   * parameter. The parameter `normalization` can be one of the following values:\n   *\n   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)\n   * - 'uncorrected'        The sum of squared errors is divided by n\n   * - 'biased'             The sum of squared errors is divided by (n + 1)\n   *\n   *\n   * Syntax:\n   *\n   *     math.std(a, b, c, ...)\n   *     math.std(A)\n   *     math.std(A, normalization)\n   *     math.std(A, dimension)\n   *     math.std(A, dimension, normalization)\n   *\n   * Examples:\n   *\n   *     math.std(2, 4, 6)                     // returns 2\n   *     math.std([2, 4, 6, 8])                // returns 2.581988897471611\n   *     math.std([2, 4, 6, 8], 'uncorrected') // returns 2.23606797749979\n   *     math.std([2, 4, 6, 8], 'biased')      // returns 2\n   *\n   *     math.std([[1, 2, 3], [4, 5, 6]])      // returns 1.8708286933869707\n   *     math.std([[1, 2, 3], [4, 6, 8]], 0)    // returns [2.1213203435596424, 2.8284271247461903, 3.5355339059327378]\n   *     math.std([[1, 2, 3], [4, 6, 8]], 1)    // returns [1, 2]\n   *     math.std([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.7071067811865476, 1.4142135623730951]\n   *\n   * See also:\n   *\n   *    mean, median, max, min, prod, sum, variance\n   *\n   * @param {Array | Matrix} array\n   *                        A single matrix or or multiple scalar values\n   * @param {string} [normalization='unbiased']\n   *                        Determines how to normalize the variance.\n   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.\n   * @param dimension {number | BigNumber}\n   *                        Determines the axis to compute the standard deviation for a matrix\n   * @return {*} The standard deviation\n   */\n  return typed(name, {\n    // std([a, b, c, d, ...])\n    'Array | Matrix': _std,\n    // std([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _std,\n    // std([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': _std,\n    // std([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _std,\n    // std(a, b, c, d, ...)\n    '...': function _(args) {\n      return _std(args);\n    }\n  });\n  function _std(array, normalization) {\n    if (array.length === 0) {\n      throw new SyntaxError('Function std requires one or more parameters (0 provided)');\n    }\n    try {\n      var v = variance.apply(null, arguments);\n      if (isCollection(v)) {\n        return map(v, sqrt);\n      } else {\n        return sqrt(v);\n      }\n    } catch (err) {\n      if (err instanceof TypeError && err.message.includes(' variance')) {\n        throw new TypeError(err.message.replace(' variance', ' std'));\n      } else {\n        throw err;\n      }\n    }\n  }\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { config } from './configReadonly.js';\nimport { createBigNumberClass, createComplexClass, createE, createFalse, createFineStructure, createFractionClass, createI, createInfinity, createLN10, createLOG10E, createMatrixClass, createNaN, createNull, createPhi, createRangeClass, createResultSet, createSQRT1_2,\n// eslint-disable-line camelcase\ncreateSackurTetrode, createTau, createTrue, createVersion, createDenseMatrixClass, createEfimovFactor, createLN2, createPi, createReplacer, createSQRT2, createTyped, createWeakMixingAngle, createAbs, createAcos, createAcot, createAcsc, createAddScalar, createArg, createAsech, createAsinh, createAtan, createAtanh, createBigint, createBitNot, createBoolean, createClone, createCombinations, createComplex, createConj, createCos, createCot, createCsc, createCube, createEqualScalar, createErf, createExp, createExpm1, createFilter, createFlatten, createForEach, createFormat, createGetMatrixDataType, createHex, createIm, createIsBounded, createIsNaN, createIsNumeric, createIsPrime, createLOG2E, createLgamma, createLog10, createLog2, createMap, createMode, createMultiplyScalar, createNot, createNumber, createOct, createPickRandom, createPrint, createRandom, createRe, createSec, createSign, createSin, createSize, createSparseMatrixClass, createSplitUnit, createSquare, createString, createSubtractScalar, createTan, createToBest, createTypeOf, createAcosh, createAcsch, createAsec, createBignumber, createCombinationsWithRep, createCosh, createCsch, createDot, createHasNumericValue, createIsFinite, createIsNegative, createIsZero, createMatrix, createMatrixFromFunction, createMultiply, createOnes, createRandomInt, createResize, createSech, createSinh, createSparse, createSqrt, createSqueeze, createTanh, createTranspose, createXgcd, createZeros, createAcoth, createAsin, createBin, createCoth, createCtranspose, createDiag, createEqual, createFraction, createIdentity, createIsInteger, createKron, createMapSlices, createMatrixFromColumns, createNumeric, createProd, createReshape, createRound, createUnaryMinus, createBernoulli, createCbrt, createConcat, createCount, createDeepEqual, createDivideScalar, createDotMultiply, createFloor, createGcd, createIsPositive, createLarger, createLcm, createLeftShift, createLsolve, createMax, createMod, createNthRoot, createNullish, createOr, createQr, createRightArithShift, createSmaller, createSubtract, createTo, createUnaryPlus, createUsolve, createXor, createAdd, createAtan2, createBitAnd, createBitOr, createBitXor, createCatalan, createCompare, createCompareText, createComposition, createCross, createDet, createDiff, createDistance, createDotDivide, createEqualText, createFibonacciHeapClass, createHypot, createImmutableDenseMatrixClass, createIndexClass, createIntersect, createInvmod, createLargerEq, createLog, createLsolveAll, createMatrixFromRows, createMin, createNthRoots, createPartitionSelect, createRightLogShift, createSlu, createSpaClass, createSubset, createSum, createTrace, createUsolveAll, createZpk2tf, createCeil, createCompareNatural, createCumSum, createFix, createIndex, createInv, createLog1p, createLup, createPinv, createPow, createSetCartesian, createSetDistinct, createSetIsSubset, createSetPowerset, createSmallerEq, createSort, createSqrtm, createUnequal, createAnd, createDivide, createExpm, createFft, createFreqz, createGamma, createIfft, createKldivergence, createLusolve, createMean, createMedian, createPolynomialRoot, createQuantileSeq, createRange, createRow, createSetDifference, createSetMultiplicity, createSetSymDifference, createSolveODE, createUnitClass, createVacuumImpedance, createAtomicMass, createBohrMagneton, createBoltzmann, createColumn, createConductanceQuantum, createCoulomb, createCreateUnit, createDeuteronMass, createEigs, createElectronMass, createFactorial, createFermiCoupling, createGasConstant, createGravity, createKlitzing, createLoschmidt, createMad, createMagneticFluxQuantum, createMolarMass, createMolarPlanckConstant, createMultinomial, createNorm, createPermutations, createPlanckConstant, createPlanckMass, createPlanckTime, createReducedPlanckConstant, createRotationMatrix, createRydberg, createSecondRadiation, createSetSize, createSpeedOfLight, createStefanBoltzmann, createThomsonCrossSection, createVariance, createZeta, createAvogadro, createBohrRadius, createCorr, createDotPow, createElementaryCharge, createFaraday, createHartreeEnergy, createInverseConductanceQuantum, createMagneticConstant, createMolarMassC12, createNeutronMass, createPlanckCharge, createPlanckTemperature, createQuantumOfCirculation, createSetIntersect, createStd, createStirlingS2, createUnitFunction, createBellNumbers, createElectricConstant, createFirstRadiation, createNuclearMagneton, createPlanckLength, createRotate, createSetUnion, createWienDisplacement, createClassicalElectronRadius, createMolarVolume, createSchur, createCoulombConstant, createGravitationConstant, createProtonMass, createSylvester, createLyap } from '../factoriesAny.js';\nexport var BigNumber = /* #__PURE__ */createBigNumberClass({\n  config\n});\nexport var Complex = /* #__PURE__ */createComplexClass({});\nexport var e = /* #__PURE__ */createE({\n  BigNumber,\n  config\n});\nexport var _false = /* #__PURE__ */createFalse({});\nexport var fineStructure = /* #__PURE__ */createFineStructure({\n  BigNumber,\n  config\n});\nexport var Fraction = /* #__PURE__ */createFractionClass({});\nexport var i = /* #__PURE__ */createI({\n  Complex\n});\nexport var _Infinity = /* #__PURE__ */createInfinity({\n  BigNumber,\n  config\n});\nexport var LN10 = /* #__PURE__ */createLN10({\n  BigNumber,\n  config\n});\nexport var LOG10E = /* #__PURE__ */createLOG10E({\n  BigNumber,\n  config\n});\nexport var Matrix = /* #__PURE__ */createMatrixClass({});\nexport var _NaN = /* #__PURE__ */createNaN({\n  BigNumber,\n  config\n});\nexport var _null = /* #__PURE__ */createNull({});\nexport var phi = /* #__PURE__ */createPhi({\n  BigNumber,\n  config\n});\nexport var Range = /* #__PURE__ */createRangeClass({});\nexport var ResultSet = /* #__PURE__ */createResultSet({});\nexport var SQRT1_2 = /* #__PURE__ */createSQRT1_2({\n  BigNumber,\n  config\n});\nexport var sackurTetrode = /* #__PURE__ */createSackurTetrode({\n  BigNumber,\n  config\n});\nexport var tau = /* #__PURE__ */createTau({\n  BigNumber,\n  config\n});\nexport var _true = /* #__PURE__ */createTrue({});\nexport var version = /* #__PURE__ */createVersion({});\nexport var DenseMatrix = /* #__PURE__ */createDenseMatrixClass({\n  Matrix,\n  config\n});\nexport var efimovFactor = /* #__PURE__ */createEfimovFactor({\n  BigNumber,\n  config\n});\nexport var LN2 = /* #__PURE__ */createLN2({\n  BigNumber,\n  config\n});\nexport var pi = /* #__PURE__ */createPi({\n  BigNumber,\n  config\n});\nexport var replacer = /* #__PURE__ */createReplacer({});\nexport var SQRT2 = /* #__PURE__ */createSQRT2({\n  BigNumber,\n  config\n});\nexport var typed = /* #__PURE__ */createTyped({\n  BigNumber,\n  Complex,\n  DenseMatrix,\n  Fraction\n});\nexport var weakMixingAngle = /* #__PURE__ */createWeakMixingAngle({\n  BigNumber,\n  config\n});\nexport var abs = /* #__PURE__ */createAbs({\n  typed\n});\nexport var acos = /* #__PURE__ */createAcos({\n  Complex,\n  config,\n  typed\n});\nexport var acot = /* #__PURE__ */createAcot({\n  BigNumber,\n  typed\n});\nexport var acsc = /* #__PURE__ */createAcsc({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var addScalar = /* #__PURE__ */createAddScalar({\n  typed\n});\nexport var arg = /* #__PURE__ */createArg({\n  typed\n});\nexport var asech = /* #__PURE__ */createAsech({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var asinh = /* #__PURE__ */createAsinh({\n  typed\n});\nexport var atan = /* #__PURE__ */createAtan({\n  typed\n});\nexport var atanh = /* #__PURE__ */createAtanh({\n  Complex,\n  config,\n  typed\n});\nexport var bigint = /* #__PURE__ */createBigint({\n  typed\n});\nexport var bitNot = /* #__PURE__ */createBitNot({\n  typed\n});\nexport var boolean = /* #__PURE__ */createBoolean({\n  typed\n});\nexport var clone = /* #__PURE__ */createClone({\n  typed\n});\nexport var combinations = /* #__PURE__ */createCombinations({\n  typed\n});\nexport var complex = /* #__PURE__ */createComplex({\n  Complex,\n  typed\n});\nexport var conj = /* #__PURE__ */createConj({\n  typed\n});\nexport var cos = /* #__PURE__ */createCos({\n  typed\n});\nexport var cot = /* #__PURE__ */createCot({\n  BigNumber,\n  typed\n});\nexport var csc = /* #__PURE__ */createCsc({\n  BigNumber,\n  typed\n});\nexport var cube = /* #__PURE__ */createCube({\n  typed\n});\nexport var equalScalar = /* #__PURE__ */createEqualScalar({\n  config,\n  typed\n});\nexport var erf = /* #__PURE__ */createErf({\n  typed\n});\nexport var exp = /* #__PURE__ */createExp({\n  typed\n});\nexport var expm1 = /* #__PURE__ */createExpm1({\n  Complex,\n  typed\n});\nexport var filter = /* #__PURE__ */createFilter({\n  typed\n});\nexport var flatten = /* #__PURE__ */createFlatten({\n  typed\n});\nexport var forEach = /* #__PURE__ */createForEach({\n  typed\n});\nexport var format = /* #__PURE__ */createFormat({\n  typed\n});\nexport var getMatrixDataType = /* #__PURE__ */createGetMatrixDataType({\n  typed\n});\nexport var hex = /* #__PURE__ */createHex({\n  format,\n  typed\n});\nexport var im = /* #__PURE__ */createIm({\n  typed\n});\nexport var isBounded = /* #__PURE__ */createIsBounded({\n  typed\n});\nexport var isNaN = /* #__PURE__ */createIsNaN({\n  typed\n});\nexport var isNumeric = /* #__PURE__ */createIsNumeric({\n  typed\n});\nexport var isPrime = /* #__PURE__ */createIsPrime({\n  typed\n});\nexport var LOG2E = /* #__PURE__ */createLOG2E({\n  BigNumber,\n  config\n});\nexport var lgamma = /* #__PURE__ */createLgamma({\n  Complex,\n  typed\n});\nexport var log10 = /* #__PURE__ */createLog10({\n  Complex,\n  config,\n  typed\n});\nexport var log2 = /* #__PURE__ */createLog2({\n  Complex,\n  config,\n  typed\n});\nexport var map = /* #__PURE__ */createMap({\n  typed\n});\nexport var mode = /* #__PURE__ */createMode({\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var multiplyScalar = /* #__PURE__ */createMultiplyScalar({\n  typed\n});\nexport var not = /* #__PURE__ */createNot({\n  typed\n});\nexport var number = /* #__PURE__ */createNumber({\n  typed\n});\nexport var oct = /* #__PURE__ */createOct({\n  format,\n  typed\n});\nexport var pickRandom = /* #__PURE__ */createPickRandom({\n  config,\n  typed\n});\nexport var print = /* #__PURE__ */createPrint({\n  typed\n});\nexport var random = /* #__PURE__ */createRandom({\n  config,\n  typed\n});\nexport var re = /* #__PURE__ */createRe({\n  typed\n});\nexport var sec = /* #__PURE__ */createSec({\n  BigNumber,\n  typed\n});\nexport var sign = /* #__PURE__ */createSign({\n  BigNumber,\n  Fraction,\n  complex,\n  typed\n});\nexport var sin = /* #__PURE__ */createSin({\n  typed\n});\nexport var size = /* #__PURE__ */createSize({\n  typed\n});\nexport var SparseMatrix = /* #__PURE__ */createSparseMatrixClass({\n  Matrix,\n  equalScalar,\n  typed\n});\nexport var splitUnit = /* #__PURE__ */createSplitUnit({\n  typed\n});\nexport var square = /* #__PURE__ */createSquare({\n  typed\n});\nexport var string = /* #__PURE__ */createString({\n  typed\n});\nexport var subtractScalar = /* #__PURE__ */createSubtractScalar({\n  typed\n});\nexport var tan = /* #__PURE__ */createTan({\n  typed\n});\nexport var toBest = /* #__PURE__ */createToBest({\n  typed\n});\nexport var typeOf = /* #__PURE__ */createTypeOf({\n  typed\n});\nexport var acosh = /* #__PURE__ */createAcosh({\n  Complex,\n  config,\n  typed\n});\nexport var acsch = /* #__PURE__ */createAcsch({\n  BigNumber,\n  typed\n});\nexport var asec = /* #__PURE__ */createAsec({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var bignumber = /* #__PURE__ */createBignumber({\n  BigNumber,\n  typed\n});\nexport var combinationsWithRep = /* #__PURE__ */createCombinationsWithRep({\n  typed\n});\nexport var cosh = /* #__PURE__ */createCosh({\n  typed\n});\nexport var csch = /* #__PURE__ */createCsch({\n  BigNumber,\n  typed\n});\nexport var dot = /* #__PURE__ */createDot({\n  addScalar,\n  conj,\n  multiplyScalar,\n  size,\n  typed\n});\nexport var hasNumericValue = /* #__PURE__ */createHasNumericValue({\n  isNumeric,\n  typed\n});\nexport var isFinite = /* #__PURE__ */createIsFinite({\n  isBounded,\n  map,\n  typed\n});\nexport var isNegative = /* #__PURE__ */createIsNegative({\n  config,\n  typed\n});\nexport var isZero = /* #__PURE__ */createIsZero({\n  equalScalar,\n  typed\n});\nexport var matrix = /* #__PURE__ */createMatrix({\n  DenseMatrix,\n  Matrix,\n  SparseMatrix,\n  typed\n});\nexport var matrixFromFunction = /* #__PURE__ */createMatrixFromFunction({\n  isZero,\n  matrix,\n  typed\n});\nexport var multiply = /* #__PURE__ */createMultiply({\n  addScalar,\n  dot,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var ones = /* #__PURE__ */createOnes({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var randomInt = /* #__PURE__ */createRandomInt({\n  config,\n  log2,\n  typed\n});\nexport var resize = /* #__PURE__ */createResize({\n  config,\n  matrix\n});\nexport var sech = /* #__PURE__ */createSech({\n  BigNumber,\n  typed\n});\nexport var sinh = /* #__PURE__ */createSinh({\n  typed\n});\nexport var sparse = /* #__PURE__ */createSparse({\n  SparseMatrix,\n  typed\n});\nexport var sqrt = /* #__PURE__ */createSqrt({\n  Complex,\n  config,\n  typed\n});\nexport var squeeze = /* #__PURE__ */createSqueeze({\n  typed\n});\nexport var tanh = /* #__PURE__ */createTanh({\n  typed\n});\nexport var transpose = /* #__PURE__ */createTranspose({\n  matrix,\n  typed\n});\nexport var xgcd = /* #__PURE__ */createXgcd({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var zeros = /* #__PURE__ */createZeros({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var acoth = /* #__PURE__ */createAcoth({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var asin = /* #__PURE__ */createAsin({\n  Complex,\n  config,\n  typed\n});\nexport var bin = /* #__PURE__ */createBin({\n  format,\n  typed\n});\nexport var coth = /* #__PURE__ */createCoth({\n  BigNumber,\n  typed\n});\nexport var ctranspose = /* #__PURE__ */createCtranspose({\n  conj,\n  transpose,\n  typed\n});\nexport var diag = /* #__PURE__ */createDiag({\n  DenseMatrix,\n  SparseMatrix,\n  matrix,\n  typed\n});\nexport var equal = /* #__PURE__ */createEqual({\n  DenseMatrix,\n  SparseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var fraction = /* #__PURE__ */createFraction({\n  Fraction,\n  typed\n});\nexport var identity = /* #__PURE__ */createIdentity({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var isInteger = /* #__PURE__ */createIsInteger({\n  equal,\n  typed\n});\nexport var kron = /* #__PURE__ */createKron({\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var mapSlices = /* #__PURE__ */createMapSlices({\n  isInteger,\n  typed\n});\nexport var apply = mapSlices;\nexport var matrixFromColumns = /* #__PURE__ */createMatrixFromColumns({\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var numeric = /* #__PURE__ */createNumeric({\n  bignumber,\n  fraction,\n  number\n});\nexport var prod = /* #__PURE__ */createProd({\n  config,\n  multiplyScalar,\n  numeric,\n  typed\n});\nexport var reshape = /* #__PURE__ */createReshape({\n  isInteger,\n  matrix,\n  typed\n});\nexport var round = /* #__PURE__ */createRound({\n  BigNumber,\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var unaryMinus = /* #__PURE__ */createUnaryMinus({\n  typed\n});\nexport var bernoulli = /* #__PURE__ */createBernoulli({\n  BigNumber,\n  Fraction,\n  config,\n  isInteger,\n  number,\n  typed\n});\nexport var cbrt = /* #__PURE__ */createCbrt({\n  BigNumber,\n  Complex,\n  Fraction,\n  config,\n  isNegative,\n  matrix,\n  typed,\n  unaryMinus\n});\nexport var concat = /* #__PURE__ */createConcat({\n  isInteger,\n  matrix,\n  typed\n});\nexport var count = /* #__PURE__ */createCount({\n  prod,\n  size,\n  typed\n});\nexport var deepEqual = /* #__PURE__ */createDeepEqual({\n  equal,\n  typed\n});\nexport var divideScalar = /* #__PURE__ */createDivideScalar({\n  numeric,\n  typed\n});\nexport var dotMultiply = /* #__PURE__ */createDotMultiply({\n  concat,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var floor = /* #__PURE__ */createFloor({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var gcd = /* #__PURE__ */createGcd({\n  BigNumber,\n  DenseMatrix,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var isPositive = /* #__PURE__ */createIsPositive({\n  config,\n  typed\n});\nexport var larger = /* #__PURE__ */createLarger({\n  DenseMatrix,\n  SparseMatrix,\n  bignumber,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var lcm = /* #__PURE__ */createLcm({\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var leftShift = /* #__PURE__ */createLeftShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var lsolve = /* #__PURE__ */createLsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var max = /* #__PURE__ */createMax({\n  config,\n  isNaN,\n  larger,\n  numeric,\n  typed\n});\nexport var mod = /* #__PURE__ */createMod({\n  DenseMatrix,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var nthRoot = /* #__PURE__ */createNthRoot({\n  BigNumber,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var nullish = /* #__PURE__ */createNullish({\n  deepEqual,\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var or = /* #__PURE__ */createOr({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var qr = /* #__PURE__ */createQr({\n  addScalar,\n  complex,\n  conj,\n  divideScalar,\n  equal,\n  identity,\n  isZero,\n  matrix,\n  multiplyScalar,\n  sign,\n  sqrt,\n  subtractScalar,\n  typed,\n  unaryMinus,\n  zeros\n});\nexport var rightArithShift = /* #__PURE__ */createRightArithShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var smaller = /* #__PURE__ */createSmaller({\n  DenseMatrix,\n  SparseMatrix,\n  bignumber,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var subtract = /* #__PURE__ */createSubtract({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var to = /* #__PURE__ */createTo({\n  concat,\n  matrix,\n  typed\n});\nexport var unaryPlus = /* #__PURE__ */createUnaryPlus({\n  config,\n  numeric,\n  typed\n});\nexport var usolve = /* #__PURE__ */createUsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var xor = /* #__PURE__ */createXor({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  matrix,\n  typed\n});\nexport var add = /* #__PURE__ */createAdd({\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var atan2 = /* #__PURE__ */createAtan2({\n  BigNumber,\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitAnd = /* #__PURE__ */createBitAnd({\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitOr = /* #__PURE__ */createBitOr({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitXor = /* #__PURE__ */createBitXor({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  matrix,\n  typed\n});\nexport var catalan = /* #__PURE__ */createCatalan({\n  addScalar,\n  combinations,\n  divideScalar,\n  isInteger,\n  isNegative,\n  multiplyScalar,\n  typed\n});\nexport var compare = /* #__PURE__ */createCompare({\n  BigNumber,\n  DenseMatrix,\n  Fraction,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var compareText = /* #__PURE__ */createCompareText({\n  concat,\n  matrix,\n  typed\n});\nexport var composition = /* #__PURE__ */createComposition({\n  addScalar,\n  combinations,\n  isInteger,\n  isNegative,\n  isPositive,\n  larger,\n  typed\n});\nexport var cross = /* #__PURE__ */createCross({\n  matrix,\n  multiply,\n  subtract,\n  typed\n});\nexport var det = /* #__PURE__ */createDet({\n  divideScalar,\n  isZero,\n  matrix,\n  multiply,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var diff = /* #__PURE__ */createDiff({\n  matrix,\n  number,\n  subtract,\n  typed\n});\nexport var distance = /* #__PURE__ */createDistance({\n  abs,\n  addScalar,\n  deepEqual,\n  divideScalar,\n  multiplyScalar,\n  sqrt,\n  subtractScalar,\n  typed\n});\nexport var dotDivide = /* #__PURE__ */createDotDivide({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  divideScalar,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var equalText = /* #__PURE__ */createEqualText({\n  compareText,\n  isZero,\n  typed\n});\nexport var FibonacciHeap = /* #__PURE__ */createFibonacciHeapClass({\n  larger,\n  smaller\n});\nexport var hypot = /* #__PURE__ */createHypot({\n  abs,\n  addScalar,\n  divideScalar,\n  isPositive,\n  multiplyScalar,\n  smaller,\n  sqrt,\n  typed\n});\nexport var ImmutableDenseMatrix = /* #__PURE__ */createImmutableDenseMatrixClass({\n  DenseMatrix,\n  smaller\n});\nexport var Index = /* #__PURE__ */createIndexClass({\n  ImmutableDenseMatrix,\n  getMatrixDataType\n});\nexport var intersect = /* #__PURE__ */createIntersect({\n  abs,\n  add,\n  addScalar,\n  config,\n  divideScalar,\n  equalScalar,\n  flatten,\n  isNumeric,\n  isZero,\n  matrix,\n  multiply,\n  multiplyScalar,\n  smaller,\n  subtract,\n  typed\n});\nexport var invmod = /* #__PURE__ */createInvmod({\n  BigNumber,\n  add,\n  config,\n  equal,\n  isInteger,\n  mod,\n  smaller,\n  typed,\n  xgcd\n});\nexport var largerEq = /* #__PURE__ */createLargerEq({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var log = /* #__PURE__ */createLog({\n  Complex,\n  config,\n  divideScalar,\n  typeOf,\n  typed\n});\nexport var lsolveAll = /* #__PURE__ */createLsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var matrixFromRows = /* #__PURE__ */createMatrixFromRows({\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var min = /* #__PURE__ */createMin({\n  config,\n  isNaN,\n  numeric,\n  smaller,\n  typed\n});\nexport var nthRoots = /* #__PURE__ */createNthRoots({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var partitionSelect = /* #__PURE__ */createPartitionSelect({\n  compare,\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var rightLogShift = /* #__PURE__ */createRightLogShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var slu = /* #__PURE__ */createSlu({\n  SparseMatrix,\n  abs,\n  add,\n  divideScalar,\n  larger,\n  largerEq,\n  multiply,\n  subtract,\n  transpose,\n  typed\n});\nexport var Spa = /* #__PURE__ */createSpaClass({\n  FibonacciHeap,\n  addScalar,\n  equalScalar\n});\nexport var subset = /* #__PURE__ */createSubset({\n  add,\n  matrix,\n  typed,\n  zeros\n});\nexport var sum = /* #__PURE__ */createSum({\n  add,\n  config,\n  numeric,\n  typed\n});\nexport var trace = /* #__PURE__ */createTrace({\n  add,\n  matrix,\n  typed\n});\nexport var usolveAll = /* #__PURE__ */createUsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var zpk2tf = /* #__PURE__ */createZpk2tf({\n  Complex,\n  add,\n  multiply,\n  number,\n  typed\n});\nexport var ceil = /* #__PURE__ */createCeil({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var compareNatural = /* #__PURE__ */createCompareNatural({\n  compare,\n  typed\n});\nexport var cumsum = /* #__PURE__ */createCumSum({\n  add,\n  typed,\n  unaryPlus\n});\nexport var fix = /* #__PURE__ */createFix({\n  Complex,\n  DenseMatrix,\n  ceil,\n  equalScalar,\n  floor,\n  matrix,\n  typed,\n  zeros\n});\nexport var index = /* #__PURE__ */createIndex({\n  Index,\n  typed\n});\nexport var inv = /* #__PURE__ */createInv({\n  abs,\n  addScalar,\n  det,\n  divideScalar,\n  identity,\n  matrix,\n  multiply,\n  typed,\n  unaryMinus\n});\nexport var log1p = /* #__PURE__ */createLog1p({\n  Complex,\n  config,\n  divideScalar,\n  log,\n  typed\n});\nexport var lup = /* #__PURE__ */createLup({\n  DenseMatrix,\n  Spa,\n  SparseMatrix,\n  abs,\n  addScalar,\n  divideScalar,\n  equalScalar,\n  larger,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var pinv = /* #__PURE__ */createPinv({\n  Complex,\n  add,\n  ctranspose,\n  deepEqual,\n  divideScalar,\n  dot,\n  dotDivide,\n  equal,\n  inv,\n  matrix,\n  multiply,\n  typed\n});\nexport var pow = /* #__PURE__ */createPow({\n  Complex,\n  config,\n  fraction,\n  identity,\n  inv,\n  matrix,\n  multiply,\n  number,\n  typed\n});\nexport var setCartesian = /* #__PURE__ */createSetCartesian({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setDistinct = /* #__PURE__ */createSetDistinct({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setIsSubset = /* #__PURE__ */createSetIsSubset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setPowerset = /* #__PURE__ */createSetPowerset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var smallerEq = /* #__PURE__ */createSmallerEq({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var sort = /* #__PURE__ */createSort({\n  compare,\n  compareNatural,\n  matrix,\n  typed\n});\nexport var sqrtm = /* #__PURE__ */createSqrtm({\n  abs,\n  add,\n  identity,\n  inv,\n  map,\n  max,\n  multiply,\n  size,\n  sqrt,\n  subtract,\n  typed\n});\nexport var unequal = /* #__PURE__ */createUnequal({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var and = /* #__PURE__ */createAnd({\n  concat,\n  equalScalar,\n  matrix,\n  not,\n  typed,\n  zeros\n});\nexport var divide = /* #__PURE__ */createDivide({\n  divideScalar,\n  equalScalar,\n  inv,\n  matrix,\n  multiply,\n  typed\n});\nexport var expm = /* #__PURE__ */createExpm({\n  abs,\n  add,\n  identity,\n  inv,\n  multiply,\n  typed\n});\nexport var fft = /* #__PURE__ */createFft({\n  addScalar,\n  ceil,\n  conj,\n  divideScalar,\n  dotDivide,\n  exp,\n  i,\n  log2,\n  matrix,\n  multiplyScalar,\n  pow,\n  tau,\n  typed\n});\nexport var freqz = /* #__PURE__ */createFreqz({\n  Complex,\n  add,\n  divide,\n  matrix,\n  multiply,\n  typed\n});\nexport var gamma = /* #__PURE__ */createGamma({\n  BigNumber,\n  Complex,\n  config,\n  multiplyScalar,\n  pow,\n  typed\n});\nexport var ifft = /* #__PURE__ */createIfft({\n  conj,\n  dotDivide,\n  fft,\n  typed\n});\nexport var kldivergence = /* #__PURE__ */createKldivergence({\n  divide,\n  dotDivide,\n  isNumeric,\n  log,\n  map,\n  matrix,\n  multiply,\n  sum,\n  typed\n});\nexport var lusolve = /* #__PURE__ */createLusolve({\n  DenseMatrix,\n  lsolve,\n  lup,\n  matrix,\n  slu,\n  typed,\n  usolve\n});\nexport var mean = /* #__PURE__ */createMean({\n  add,\n  divide,\n  typed\n});\nexport var median = /* #__PURE__ */createMedian({\n  add,\n  compare,\n  divide,\n  partitionSelect,\n  typed\n});\nexport var polynomialRoot = /* #__PURE__ */createPolynomialRoot({\n  add,\n  cbrt,\n  divide,\n  equalScalar,\n  im,\n  isZero,\n  multiply,\n  re,\n  sqrt,\n  subtract,\n  typeOf,\n  typed,\n  unaryMinus\n});\nexport var quantileSeq = /* #__PURE__ */createQuantileSeq({\n  bignumber,\n  add,\n  compare,\n  divide,\n  isInteger,\n  larger,\n  mapSlices,\n  multiply,\n  partitionSelect,\n  smaller,\n  smallerEq,\n  subtract,\n  typed\n});\nexport var range = /* #__PURE__ */createRange({\n  bignumber,\n  matrix,\n  add,\n  config,\n  equal,\n  isPositive,\n  isZero,\n  larger,\n  largerEq,\n  smaller,\n  smallerEq,\n  typed\n});\nexport var row = /* #__PURE__ */createRow({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var setDifference = /* #__PURE__ */createSetDifference({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setMultiplicity = /* #__PURE__ */createSetMultiplicity({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setSymDifference = /* #__PURE__ */createSetSymDifference({\n  Index,\n  concat,\n  setDifference,\n  size,\n  subset,\n  typed\n});\nexport var solveODE = /* #__PURE__ */createSolveODE({\n  abs,\n  add,\n  bignumber,\n  divide,\n  isNegative,\n  isPositive,\n  larger,\n  map,\n  matrix,\n  max,\n  multiply,\n  smaller,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var Unit = /* #__PURE__ */createUnitClass({\n  BigNumber,\n  Complex,\n  Fraction,\n  abs,\n  addScalar,\n  config,\n  divideScalar,\n  equal,\n  fix,\n  format,\n  isNumeric,\n  multiplyScalar,\n  number,\n  pow,\n  round,\n  subtractScalar\n});\nexport var vacuumImpedance = /* #__PURE__ */createVacuumImpedance({\n  BigNumber,\n  Unit,\n  config\n});\nexport var atomicMass = /* #__PURE__ */createAtomicMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrMagneton = /* #__PURE__ */createBohrMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var boltzmann = /* #__PURE__ */createBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var column = /* #__PURE__ */createColumn({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var conductanceQuantum = /* #__PURE__ */createConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var coulomb = /* #__PURE__ */createCoulomb({\n  BigNumber,\n  Unit,\n  config\n});\nexport var createUnit = /* #__PURE__ */createCreateUnit({\n  Unit,\n  typed\n});\nexport var deuteronMass = /* #__PURE__ */createDeuteronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var eigs = /* #__PURE__ */createEigs({\n  abs,\n  add,\n  addScalar,\n  atan,\n  bignumber,\n  column,\n  complex,\n  config,\n  cos,\n  diag,\n  divideScalar,\n  dot,\n  equal,\n  flatten,\n  im,\n  inv,\n  larger,\n  matrix,\n  matrixFromColumns,\n  multiply,\n  multiplyScalar,\n  number,\n  qr,\n  re,\n  reshape,\n  sin,\n  size,\n  smaller,\n  sqrt,\n  subtract,\n  typed,\n  usolve,\n  usolveAll\n});\nexport var electronMass = /* #__PURE__ */createElectronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var factorial = /* #__PURE__ */createFactorial({\n  gamma,\n  typed\n});\nexport var fermiCoupling = /* #__PURE__ */createFermiCoupling({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gasConstant = /* #__PURE__ */createGasConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gravity = /* #__PURE__ */createGravity({\n  BigNumber,\n  Unit,\n  config\n});\nexport var klitzing = /* #__PURE__ */createKlitzing({\n  BigNumber,\n  Unit,\n  config\n});\nexport var loschmidt = /* #__PURE__ */createLoschmidt({\n  BigNumber,\n  Unit,\n  config\n});\nexport var mad = /* #__PURE__ */createMad({\n  abs,\n  map,\n  median,\n  subtract,\n  typed\n});\nexport var magneticFluxQuantum = /* #__PURE__ */createMagneticFluxQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMass = /* #__PURE__ */createMolarMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarPlanckConstant = /* #__PURE__ */createMolarPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var multinomial = /* #__PURE__ */createMultinomial({\n  add,\n  divide,\n  factorial,\n  isInteger,\n  isPositive,\n  multiply,\n  typed\n});\nexport var norm = /* #__PURE__ */createNorm({\n  abs,\n  add,\n  conj,\n  ctranspose,\n  eigs,\n  equalScalar,\n  larger,\n  matrix,\n  multiply,\n  pow,\n  smaller,\n  sqrt,\n  typed\n});\nexport var permutations = /* #__PURE__ */createPermutations({\n  factorial,\n  typed\n});\nexport var planckConstant = /* #__PURE__ */createPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckMass = /* #__PURE__ */createPlanckMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckTime = /* #__PURE__ */createPlanckTime({\n  BigNumber,\n  Unit,\n  config\n});\nexport var reducedPlanckConstant = /* #__PURE__ */createReducedPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rotationMatrix = /* #__PURE__ */createRotationMatrix({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  config,\n  cos,\n  matrix,\n  multiplyScalar,\n  norm,\n  sin,\n  typed,\n  unaryMinus\n});\nexport var rydberg = /* #__PURE__ */createRydberg({\n  BigNumber,\n  Unit,\n  config\n});\nexport var secondRadiation = /* #__PURE__ */createSecondRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var setSize = /* #__PURE__ */createSetSize({\n  compareNatural,\n  typed\n});\nexport var speedOfLight = /* #__PURE__ */createSpeedOfLight({\n  BigNumber,\n  Unit,\n  config\n});\nexport var stefanBoltzmann = /* #__PURE__ */createStefanBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var thomsonCrossSection = /* #__PURE__ */createThomsonCrossSection({\n  BigNumber,\n  Unit,\n  config\n});\nexport var variance = /* #__PURE__ */createVariance({\n  add,\n  divide,\n  isNaN,\n  mapSlices,\n  multiply,\n  subtract,\n  typed\n});\nexport var zeta = /* #__PURE__ */createZeta({\n  BigNumber,\n  Complex,\n  add,\n  config,\n  divide,\n  equal,\n  factorial,\n  gamma,\n  isBounded,\n  isNegative,\n  multiply,\n  pi,\n  pow,\n  sin,\n  smallerEq,\n  subtract,\n  typed\n});\nexport var avogadro = /* #__PURE__ */createAvogadro({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrRadius = /* #__PURE__ */createBohrRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var corr = /* #__PURE__ */createCorr({\n  add,\n  divide,\n  matrix,\n  mean,\n  multiply,\n  pow,\n  sqrt,\n  subtract,\n  sum,\n  typed\n});\nexport var dotPow = /* #__PURE__ */createDotPow({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  pow,\n  typed\n});\nexport var elementaryCharge = /* #__PURE__ */createElementaryCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var faraday = /* #__PURE__ */createFaraday({\n  BigNumber,\n  Unit,\n  config\n});\nexport var hartreeEnergy = /* #__PURE__ */createHartreeEnergy({\n  BigNumber,\n  Unit,\n  config\n});\nexport var inverseConductanceQuantum = /* #__PURE__ */createInverseConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var magneticConstant = /* #__PURE__ */createMagneticConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMassC12 = /* #__PURE__ */createMolarMassC12({\n  BigNumber,\n  Unit,\n  config\n});\nexport var neutronMass = /* #__PURE__ */createNeutronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckCharge = /* #__PURE__ */createPlanckCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckTemperature = /* #__PURE__ */createPlanckTemperature({\n  BigNumber,\n  Unit,\n  config\n});\nexport var quantumOfCirculation = /* #__PURE__ */createQuantumOfCirculation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var setIntersect = /* #__PURE__ */createSetIntersect({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var std = /* #__PURE__ */createStd({\n  map,\n  sqrt,\n  typed,\n  variance\n});\nexport var stirlingS2 = /* #__PURE__ */createStirlingS2({\n  bignumber,\n  addScalar,\n  combinations,\n  divideScalar,\n  factorial,\n  isInteger,\n  isNegative,\n  larger,\n  multiplyScalar,\n  number,\n  pow,\n  subtractScalar,\n  typed\n});\nexport var unit = /* #__PURE__ */createUnitFunction({\n  Unit,\n  typed\n});\nexport var bellNumbers = /* #__PURE__ */createBellNumbers({\n  addScalar,\n  isInteger,\n  isNegative,\n  stirlingS2,\n  typed\n});\nexport var electricConstant = /* #__PURE__ */createElectricConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var firstRadiation = /* #__PURE__ */createFirstRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var nuclearMagneton = /* #__PURE__ */createNuclearMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckLength = /* #__PURE__ */createPlanckLength({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rotate = /* #__PURE__ */createRotate({\n  multiply,\n  rotationMatrix,\n  typed\n});\nexport var setUnion = /* #__PURE__ */createSetUnion({\n  Index,\n  concat,\n  setIntersect,\n  setSymDifference,\n  size,\n  subset,\n  typed\n});\nexport var wienDisplacement = /* #__PURE__ */createWienDisplacement({\n  BigNumber,\n  Unit,\n  config\n});\nexport var classicalElectronRadius = /* #__PURE__ */createClassicalElectronRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarVolume = /* #__PURE__ */createMolarVolume({\n  BigNumber,\n  Unit,\n  config\n});\nexport var schur = /* #__PURE__ */createSchur({\n  identity,\n  matrix,\n  multiply,\n  norm,\n  qr,\n  subtract,\n  typed\n});\nexport var coulombConstant = /* #__PURE__ */createCoulombConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gravitationConstant = /* #__PURE__ */createGravitationConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var protonMass = /* #__PURE__ */createProtonMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var sylvester = /* #__PURE__ */createSylvester({\n  abs,\n  add,\n  concat,\n  identity,\n  index,\n  lusolve,\n  matrix,\n  matrixFromColumns,\n  multiply,\n  range,\n  schur,\n  subset,\n  subtract,\n  transpose,\n  typed\n});\nexport var lyap = /* #__PURE__ */createLyap({\n  matrix,\n  multiply,\n  sylvester,\n  transpose,\n  typed\n});","/**\n * Historical 3-Month Treasury Bill Rates (DTB3)\n * Source: Federal Reserve Economic Data (FRED), St. Louis Federal Reserve\n * Data series: DTB3 (Market Yield on U.S. Treasury Securities at 3-Month Constant Maturity)\n *\n * Values are annual percentages (e.g., 4.32 = 4.32% annual rate)\n * Keys are dates in YYYY-MM-DD format (US Eastern time)\n *\n * Used for calculating risk-free rate in Sharpe/Sortino ratio calculations.\n *\n * @see https://fred.stlouisfed.org/series/DTB3\n *\n * ## How to Update (for Claude or developers)\n *\n * 1. Download CSV from FRED:\n *    https://fred.stlouisfed.org/graph/fredgraph.csv?id=DTB3&cosd=YYYY-MM-DD&coed=YYYY-MM-DD\n *    Replace YYYY-MM-DD with your date range (cosd = start, coed = end)\n *\n * 2. CSV format is:\n *    DATE,DTB3\n *    2026-01-02,3.54\n *    2026-01-03,3.54\n *    ...\n *\n * 3. Add entries to this file in the format:\n *    \"YYYY-MM-DD\": X.XX,\n *\n * 4. Run tests to verify: npm test -- tests/unit/risk-free-rate.test.ts\n *\n * Note: Rates are only available for trading days (weekdays, excluding market holidays).\n * The lookup utility handles weekends/holidays by finding the most recent prior trading day.\n */\nexport const TREASURY_RATES: Record<string, number> = {\n  \"2013-01-02\": 0.08,\n  \"2013-01-03\": 0.08,\n  \"2013-01-04\": 0.07,\n  \"2013-01-07\": 0.07,\n  \"2013-01-08\": 0.07,\n  \"2013-01-09\": 0.06,\n  \"2013-01-10\": 0.06,\n  \"2013-01-11\": 0.07,\n  \"2013-01-14\": 0.08,\n  \"2013-01-15\": 0.09,\n  \"2013-01-16\": 0.08,\n  \"2013-01-17\": 0.07,\n  \"2013-01-18\": 0.08,\n  \"2013-01-22\": 0.08,\n  \"2013-01-23\": 0.08,\n  \"2013-01-24\": 0.08,\n  \"2013-01-25\": 0.08,\n  \"2013-01-28\": 0.07,\n  \"2013-01-29\": 0.07,\n  \"2013-01-30\": 0.07,\n  \"2013-01-31\": 0.07,\n  \"2013-02-01\": 0.06,\n  \"2013-02-04\": 0.07,\n  \"2013-02-05\": 0.07,\n  \"2013-02-06\": 0.07,\n  \"2013-02-07\": 0.07,\n  \"2013-02-08\": 0.07,\n  \"2013-02-11\": 0.09,\n  \"2013-02-12\": 0.09,\n  \"2013-02-13\": 0.10,\n  \"2013-02-14\": 0.11,\n  \"2013-02-15\": 0.10,\n  \"2013-02-19\": 0.12,\n  \"2013-02-20\": 0.12,\n  \"2013-02-21\": 0.13,\n  \"2013-02-22\": 0.13,\n  \"2013-02-25\": 0.12,\n  \"2013-02-26\": 0.14,\n  \"2013-02-27\": 0.11,\n  \"2013-02-28\": 0.11,\n  \"2013-03-01\": 0.11,\n  \"2013-03-04\": 0.11,\n  \"2013-03-05\": 0.08,\n  \"2013-03-06\": 0.10,\n  \"2013-03-07\": 0.10,\n  \"2013-03-08\": 0.10,\n  \"2013-03-11\": 0.10,\n  \"2013-03-12\": 0.10,\n  \"2013-03-13\": 0.09,\n  \"2013-03-14\": 0.10,\n  \"2013-03-15\": 0.09,\n  \"2013-03-18\": 0.07,\n  \"2013-03-19\": 0.07,\n  \"2013-03-20\": 0.07,\n  \"2013-03-21\": 0.07,\n  \"2013-03-22\": 0.07,\n  \"2013-03-25\": 0.08,\n  \"2013-03-26\": 0.07,\n  \"2013-03-27\": 0.09,\n  \"2013-03-28\": 0.07,\n  \"2013-04-01\": 0.08,\n  \"2013-04-02\": 0.07,\n  \"2013-04-03\": 0.06,\n  \"2013-04-04\": 0.07,\n  \"2013-04-05\": 0.07,\n  \"2013-04-08\": 0.07,\n  \"2013-04-09\": 0.06,\n  \"2013-04-10\": 0.07,\n  \"2013-04-11\": 0.07,\n  \"2013-04-12\": 0.06,\n  \"2013-04-15\": 0.06,\n  \"2013-04-16\": 0.06,\n  \"2013-04-17\": 0.06,\n  \"2013-04-18\": 0.05,\n  \"2013-04-19\": 0.05,\n  \"2013-04-22\": 0.05,\n  \"2013-04-23\": 0.05,\n  \"2013-04-24\": 0.06,\n  \"2013-04-25\": 0.05,\n  \"2013-04-26\": 0.05,\n  \"2013-04-29\": 0.05,\n  \"2013-04-30\": 0.05,\n  \"2013-05-01\": 0.06,\n  \"2013-05-02\": 0.05,\n  \"2013-05-03\": 0.05,\n  \"2013-05-06\": 0.04,\n  \"2013-05-07\": 0.04,\n  \"2013-05-08\": 0.04,\n  \"2013-05-09\": 0.04,\n  \"2013-05-10\": 0.04,\n  \"2013-05-13\": 0.05,\n  \"2013-05-14\": 0.05,\n  \"2013-05-15\": 0.04,\n  \"2013-05-16\": 0.03,\n  \"2013-05-17\": 0.04,\n  \"2013-05-20\": 0.05,\n  \"2013-05-21\": 0.04,\n  \"2013-05-22\": 0.04,\n  \"2013-05-23\": 0.05,\n  \"2013-05-24\": 0.04,\n  \"2013-05-28\": 0.05,\n  \"2013-05-29\": 0.05,\n  \"2013-05-30\": 0.04,\n  \"2013-05-31\": 0.04,\n  \"2013-06-03\": 0.05,\n  \"2013-06-04\": 0.04,\n  \"2013-06-05\": 0.05,\n  \"2013-06-06\": 0.05,\n  \"2013-06-07\": 0.04,\n  \"2013-06-10\": 0.05,\n  \"2013-06-11\": 0.05,\n  \"2013-06-12\": 0.05,\n  \"2013-06-13\": 0.05,\n  \"2013-06-14\": 0.05,\n  \"2013-06-17\": 0.05,\n  \"2013-06-18\": 0.05,\n  \"2013-06-19\": 0.05,\n  \"2013-06-20\": 0.05,\n  \"2013-06-21\": 0.05,\n  \"2013-06-24\": 0.06,\n  \"2013-06-25\": 0.06,\n  \"2013-06-26\": 0.06,\n  \"2013-06-27\": 0.06,\n  \"2013-06-28\": 0.04,\n  \"2013-07-01\": 0.04,\n  \"2013-07-02\": 0.03,\n  \"2013-07-03\": 0.05,\n  \"2013-07-05\": 0.04,\n  \"2013-07-08\": 0.05,\n  \"2013-07-09\": 0.04,\n  \"2013-07-10\": 0.04,\n  \"2013-07-11\": 0.04,\n  \"2013-07-12\": 0.04,\n  \"2013-07-15\": 0.04,\n  \"2013-07-16\": 0.03,\n  \"2013-07-17\": 0.03,\n  \"2013-07-18\": 0.03,\n  \"2013-07-19\": 0.03,\n  \"2013-07-22\": 0.04,\n  \"2013-07-23\": 0.02,\n  \"2013-07-24\": 0.03,\n  \"2013-07-25\": 0.02,\n  \"2013-07-26\": 0.03,\n  \"2013-07-29\": 0.03,\n  \"2013-07-30\": 0.04,\n  \"2013-07-31\": 0.04,\n  \"2013-08-01\": 0.04,\n  \"2013-08-02\": 0.04,\n  \"2013-08-05\": 0.05,\n  \"2013-08-06\": 0.04,\n  \"2013-08-07\": 0.05,\n  \"2013-08-08\": 0.05,\n  \"2013-08-09\": 0.05,\n  \"2013-08-12\": 0.06,\n  \"2013-08-13\": 0.06,\n  \"2013-08-14\": 0.05,\n  \"2013-08-15\": 0.05,\n  \"2013-08-16\": 0.05,\n  \"2013-08-19\": 0.06,\n  \"2013-08-20\": 0.04,\n  \"2013-08-21\": 0.04,\n  \"2013-08-22\": 0.03,\n  \"2013-08-23\": 0.03,\n  \"2013-08-26\": 0.04,\n  \"2013-08-27\": 0.05,\n  \"2013-08-28\": 0.03,\n  \"2013-08-29\": 0.02,\n  \"2013-08-30\": 0.03,\n  \"2013-09-03\": 0.02,\n  \"2013-09-04\": 0.02,\n  \"2013-09-05\": 0.02,\n  \"2013-09-06\": 0.02,\n  \"2013-09-09\": 0.02,\n  \"2013-09-10\": 0.02,\n  \"2013-09-11\": 0.02,\n  \"2013-09-12\": 0.01,\n  \"2013-09-13\": 0.01,\n  \"2013-09-16\": 0.02,\n  \"2013-09-17\": 0.01,\n  \"2013-09-18\": 0.01,\n  \"2013-09-19\": 0.01,\n  \"2013-09-20\": 0.01,\n  \"2013-09-23\": 0.02,\n  \"2013-09-24\": 0.02,\n  \"2013-09-25\": 0.02,\n  \"2013-09-26\": 0.00,\n  \"2013-09-27\": 0.02,\n  \"2013-09-30\": 0.02,\n  \"2013-10-01\": 0.02,\n  \"2013-10-02\": 0.02,\n  \"2013-10-03\": 0.03,\n  \"2013-10-04\": 0.03,\n  \"2013-10-07\": 0.03,\n  \"2013-10-08\": 0.05,\n  \"2013-10-09\": 0.05,\n  \"2013-10-10\": 0.05,\n  \"2013-10-11\": 0.08,\n  \"2013-10-15\": 0.14,\n  \"2013-10-16\": 0.10,\n  \"2013-10-17\": 0.05,\n  \"2013-10-18\": 0.04,\n  \"2013-10-21\": 0.04,\n  \"2013-10-22\": 0.04,\n  \"2013-10-23\": 0.04,\n  \"2013-10-24\": 0.03,\n  \"2013-10-25\": 0.04,\n  \"2013-10-28\": 0.04,\n  \"2013-10-29\": 0.04,\n  \"2013-10-30\": 0.04,\n  \"2013-10-31\": 0.04,\n  \"2013-11-01\": 0.04,\n  \"2013-11-04\": 0.05,\n  \"2013-11-05\": 0.05,\n  \"2013-11-06\": 0.05,\n  \"2013-11-07\": 0.05,\n  \"2013-11-08\": 0.06,\n  \"2013-11-12\": 0.08,\n  \"2013-11-13\": 0.08,\n  \"2013-11-14\": 0.08,\n  \"2013-11-15\": 0.08,\n  \"2013-11-18\": 0.09,\n  \"2013-11-19\": 0.08,\n  \"2013-11-20\": 0.08,\n  \"2013-11-21\": 0.07,\n  \"2013-11-22\": 0.07,\n  \"2013-11-25\": 0.08,\n  \"2013-11-26\": 0.07,\n  \"2013-11-27\": 0.07,\n  \"2013-11-29\": 0.06,\n  \"2013-12-02\": 0.05,\n  \"2013-12-03\": 0.06,\n  \"2013-12-04\": 0.06,\n  \"2013-12-05\": 0.06,\n  \"2013-12-06\": 0.06,\n  \"2013-12-09\": 0.07,\n  \"2013-12-10\": 0.07,\n  \"2013-12-11\": 0.07,\n  \"2013-12-12\": 0.07,\n  \"2013-12-13\": 0.07,\n  \"2013-12-16\": 0.07,\n  \"2013-12-17\": 0.07,\n  \"2013-12-18\": 0.07,\n  \"2013-12-19\": 0.06,\n  \"2013-12-20\": 0.07,\n  \"2013-12-23\": 0.07,\n  \"2013-12-24\": 0.07,\n  \"2013-12-26\": 0.07,\n  \"2013-12-27\": 0.07,\n  \"2013-12-30\": 0.07,\n  \"2013-12-31\": 0.07,\n  \"2014-01-02\": 0.07,\n  \"2014-01-03\": 0.07,\n  \"2014-01-06\": 0.05,\n  \"2014-01-07\": 0.04,\n  \"2014-01-08\": 0.05,\n  \"2014-01-09\": 0.04,\n  \"2014-01-10\": 0.05,\n  \"2014-01-13\": 0.03,\n  \"2014-01-14\": 0.04,\n  \"2014-01-15\": 0.04,\n  \"2014-01-16\": 0.04,\n  \"2014-01-17\": 0.05,\n  \"2014-01-21\": 0.04,\n  \"2014-01-22\": 0.04,\n  \"2014-01-23\": 0.04,\n  \"2014-01-24\": 0.04,\n  \"2014-01-27\": 0.05,\n  \"2014-01-28\": 0.05,\n  \"2014-01-29\": 0.04,\n  \"2014-01-30\": 0.02,\n  \"2014-01-31\": 0.02,\n  \"2014-02-03\": 0.05,\n  \"2014-02-04\": 0.06,\n  \"2014-02-05\": 0.07,\n  \"2014-02-06\": 0.07,\n  \"2014-02-07\": 0.08,\n  \"2014-02-10\": 0.07,\n  \"2014-02-11\": 0.05,\n  \"2014-02-12\": 0.05,\n  \"2014-02-13\": 0.03,\n  \"2014-02-14\": 0.02,\n  \"2014-02-18\": 0.05,\n  \"2014-02-19\": 0.06,\n  \"2014-02-20\": 0.05,\n  \"2014-02-21\": 0.05,\n  \"2014-02-24\": 0.05,\n  \"2014-02-25\": 0.05,\n  \"2014-02-26\": 0.05,\n  \"2014-02-27\": 0.04,\n  \"2014-02-28\": 0.05,\n  \"2014-03-03\": 0.05,\n  \"2014-03-04\": 0.05,\n  \"2014-03-05\": 0.06,\n  \"2014-03-06\": 0.05,\n  \"2014-03-07\": 0.06,\n  \"2014-03-10\": 0.05,\n  \"2014-03-11\": 0.05,\n  \"2014-03-12\": 0.05,\n  \"2014-03-13\": 0.05,\n  \"2014-03-14\": 0.05,\n  \"2014-03-17\": 0.06,\n  \"2014-03-18\": 0.05,\n  \"2014-03-19\": 0.06,\n  \"2014-03-20\": 0.06,\n  \"2014-03-21\": 0.06,\n  \"2014-03-24\": 0.06,\n  \"2014-03-25\": 0.05,\n  \"2014-03-26\": 0.05,\n  \"2014-03-27\": 0.04,\n  \"2014-03-28\": 0.04,\n  \"2014-03-31\": 0.05,\n  \"2014-04-01\": 0.04,\n  \"2014-04-02\": 0.02,\n  \"2014-04-03\": 0.02,\n  \"2014-04-04\": 0.03,\n  \"2014-04-07\": 0.03,\n  \"2014-04-08\": 0.03,\n  \"2014-04-09\": 0.04,\n  \"2014-04-10\": 0.04,\n  \"2014-04-11\": 0.04,\n  \"2014-04-14\": 0.04,\n  \"2014-04-15\": 0.04,\n  \"2014-04-16\": 0.04,\n  \"2014-04-17\": 0.03,\n  \"2014-04-21\": 0.04,\n  \"2014-04-22\": 0.03,\n  \"2014-04-23\": 0.02,\n  \"2014-04-24\": 0.01,\n  \"2014-04-25\": 0.03,\n  \"2014-04-28\": 0.03,\n  \"2014-04-29\": 0.02,\n  \"2014-04-30\": 0.03,\n  \"2014-05-01\": 0.03,\n  \"2014-05-02\": 0.02,\n  \"2014-05-05\": 0.03,\n  \"2014-05-06\": 0.03,\n  \"2014-05-07\": 0.03,\n  \"2014-05-08\": 0.03,\n  \"2014-05-09\": 0.03,\n  \"2014-05-12\": 0.03,\n  \"2014-05-13\": 0.03,\n  \"2014-05-14\": 0.03,\n  \"2014-05-15\": 0.03,\n  \"2014-05-16\": 0.03,\n  \"2014-05-19\": 0.03,\n  \"2014-05-20\": 0.03,\n  \"2014-05-21\": 0.04,\n  \"2014-05-22\": 0.03,\n  \"2014-05-23\": 0.04,\n  \"2014-05-27\": 0.04,\n  \"2014-05-28\": 0.04,\n  \"2014-05-29\": 0.04,\n  \"2014-05-30\": 0.04,\n  \"2014-06-02\": 0.04,\n  \"2014-06-03\": 0.04,\n  \"2014-06-04\": 0.04,\n  \"2014-06-05\": 0.04,\n  \"2014-06-06\": 0.04,\n  \"2014-06-09\": 0.04,\n  \"2014-06-10\": 0.04,\n  \"2014-06-11\": 0.04,\n  \"2014-06-12\": 0.04,\n  \"2014-06-13\": 0.04,\n  \"2014-06-16\": 0.04,\n  \"2014-06-17\": 0.04,\n  \"2014-06-18\": 0.03,\n  \"2014-06-19\": 0.02,\n  \"2014-06-20\": 0.02,\n  \"2014-06-23\": 0.03,\n  \"2014-06-24\": 0.03,\n  \"2014-06-25\": 0.03,\n  \"2014-06-26\": 0.04,\n  \"2014-06-27\": 0.03,\n  \"2014-06-30\": 0.04,\n  \"2014-07-01\": 0.02,\n  \"2014-07-02\": 0.02,\n  \"2014-07-03\": 0.01,\n  \"2014-07-07\": 0.04,\n  \"2014-07-08\": 0.03,\n  \"2014-07-09\": 0.03,\n  \"2014-07-10\": 0.02,\n  \"2014-07-11\": 0.02,\n  \"2014-07-14\": 0.03,\n  \"2014-07-15\": 0.02,\n  \"2014-07-16\": 0.02,\n  \"2014-07-17\": 0.02,\n  \"2014-07-18\": 0.02,\n  \"2014-07-21\": 0.03,\n  \"2014-07-22\": 0.03,\n  \"2014-07-23\": 0.03,\n  \"2014-07-24\": 0.03,\n  \"2014-07-25\": 0.03,\n  \"2014-07-28\": 0.04,\n  \"2014-07-29\": 0.02,\n  \"2014-07-30\": 0.04,\n  \"2014-07-31\": 0.03,\n  \"2014-08-01\": 0.03,\n  \"2014-08-04\": 0.04,\n  \"2014-08-05\": 0.03,\n  \"2014-08-06\": 0.03,\n  \"2014-08-07\": 0.03,\n  \"2014-08-08\": 0.03,\n  \"2014-08-11\": 0.04,\n  \"2014-08-12\": 0.03,\n  \"2014-08-13\": 0.04,\n  \"2014-08-14\": 0.04,\n  \"2014-08-15\": 0.03,\n  \"2014-08-18\": 0.03,\n  \"2014-08-19\": 0.03,\n  \"2014-08-20\": 0.04,\n  \"2014-08-21\": 0.02,\n  \"2014-08-22\": 0.03,\n  \"2014-08-25\": 0.04,\n  \"2014-08-26\": 0.03,\n  \"2014-08-27\": 0.04,\n  \"2014-08-28\": 0.03,\n  \"2014-08-29\": 0.03,\n  \"2014-09-02\": 0.03,\n  \"2014-09-03\": 0.03,\n  \"2014-09-04\": 0.03,\n  \"2014-09-05\": 0.03,\n  \"2014-09-08\": 0.02,\n  \"2014-09-09\": 0.02,\n  \"2014-09-10\": 0.02,\n  \"2014-09-11\": 0.02,\n  \"2014-09-12\": 0.02,\n  \"2014-09-15\": 0.02,\n  \"2014-09-16\": 0.02,\n  \"2014-09-17\": 0.02,\n  \"2014-09-18\": 0.02,\n  \"2014-09-19\": 0.02,\n  \"2014-09-22\": 0.01,\n  \"2014-09-23\": 0.01,\n  \"2014-09-24\": 0.02,\n  \"2014-09-25\": 0.01,\n  \"2014-09-26\": 0.01,\n  \"2014-09-29\": 0.02,\n  \"2014-09-30\": 0.02,\n  \"2014-10-01\": 0.02,\n  \"2014-10-02\": 0.01,\n  \"2014-10-03\": 0.01,\n  \"2014-10-06\": 0.02,\n  \"2014-10-07\": 0.02,\n  \"2014-10-08\": 0.01,\n  \"2014-10-09\": 0.01,\n  \"2014-10-10\": 0.01,\n  \"2014-10-14\": 0.02,\n  \"2014-10-15\": 0.02,\n  \"2014-10-16\": 0.03,\n  \"2014-10-17\": 0.02,\n  \"2014-10-20\": 0.02,\n  \"2014-10-21\": 0.02,\n  \"2014-10-22\": 0.02,\n  \"2014-10-23\": 0.01,\n  \"2014-10-24\": 0.01,\n  \"2014-10-27\": 0.02,\n  \"2014-10-28\": 0.02,\n  \"2014-10-29\": 0.03,\n  \"2014-10-30\": 0.01,\n  \"2014-10-31\": 0.01,\n  \"2014-11-03\": 0.02,\n  \"2014-11-04\": 0.03,\n  \"2014-11-05\": 0.03,\n  \"2014-11-06\": 0.03,\n  \"2014-11-07\": 0.03,\n  \"2014-11-10\": 0.02,\n  \"2014-11-12\": 0.02,\n  \"2014-11-13\": 0.02,\n  \"2014-11-14\": 0.02,\n  \"2014-11-17\": 0.03,\n  \"2014-11-18\": 0.02,\n  \"2014-11-19\": 0.01,\n  \"2014-11-20\": 0.02,\n  \"2014-11-21\": 0.01,\n  \"2014-11-24\": 0.02,\n  \"2014-11-25\": 0.02,\n  \"2014-11-26\": 0.02,\n  \"2014-11-28\": 0.02,\n  \"2014-12-01\": 0.03,\n  \"2014-12-02\": 0.03,\n  \"2014-12-03\": 0.01,\n  \"2014-12-04\": 0.02,\n  \"2014-12-05\": 0.02,\n  \"2014-12-08\": 0.03,\n  \"2014-12-09\": 0.04,\n  \"2014-12-10\": 0.03,\n  \"2014-12-11\": 0.03,\n  \"2014-12-12\": 0.02,\n  \"2014-12-15\": 0.04,\n  \"2014-12-16\": 0.03,\n  \"2014-12-17\": 0.03,\n  \"2014-12-18\": 0.04,\n  \"2014-12-19\": 0.04,\n  \"2014-12-22\": 0.05,\n  \"2014-12-23\": 0.03,\n  \"2014-12-24\": 0.01,\n  \"2014-12-26\": 0.01,\n  \"2014-12-29\": 0.03,\n  \"2014-12-30\": 0.03,\n  \"2014-12-31\": 0.04,\n  \"2015-01-02\": 0.02,\n  \"2015-01-05\": 0.03,\n  \"2015-01-06\": 0.03,\n  \"2015-01-07\": 0.03,\n  \"2015-01-08\": 0.03,\n  \"2015-01-09\": 0.02,\n  \"2015-01-12\": 0.03,\n  \"2015-01-13\": 0.03,\n  \"2015-01-14\": 0.04,\n  \"2015-01-15\": 0.03,\n  \"2015-01-16\": 0.03,\n  \"2015-01-20\": 0.03,\n  \"2015-01-21\": 0.03,\n  \"2015-01-22\": 0.03,\n  \"2015-01-23\": 0.02,\n  \"2015-01-26\": 0.03,\n  \"2015-01-27\": 0.02,\n  \"2015-01-28\": 0.02,\n  \"2015-01-29\": 0.03,\n  \"2015-01-30\": 0.02,\n  \"2015-02-02\": 0.02,\n  \"2015-02-03\": 0.02,\n  \"2015-02-04\": 0.01,\n  \"2015-02-05\": 0.02,\n  \"2015-02-06\": 0.02,\n  \"2015-02-09\": 0.01,\n  \"2015-02-10\": 0.01,\n  \"2015-02-11\": 0.01,\n  \"2015-02-12\": 0.02,\n  \"2015-02-13\": 0.01,\n  \"2015-02-17\": 0.02,\n  \"2015-02-18\": 0.02,\n  \"2015-02-19\": 0.02,\n  \"2015-02-20\": 0.02,\n  \"2015-02-23\": 0.02,\n  \"2015-02-24\": 0.02,\n  \"2015-02-25\": 0.02,\n  \"2015-02-26\": 0.03,\n  \"2015-02-27\": 0.02,\n  \"2015-03-02\": 0.02,\n  \"2015-03-03\": 0.02,\n  \"2015-03-04\": 0.01,\n  \"2015-03-05\": 0.02,\n  \"2015-03-06\": 0.01,\n  \"2015-03-09\": 0.02,\n  \"2015-03-10\": 0.02,\n  \"2015-03-11\": 0.03,\n  \"2015-03-12\": 0.03,\n  \"2015-03-13\": 0.03,\n  \"2015-03-16\": 0.05,\n  \"2015-03-17\": 0.05,\n  \"2015-03-18\": 0.03,\n  \"2015-03-19\": 0.03,\n  \"2015-03-20\": 0.01,\n  \"2015-03-23\": 0.03,\n  \"2015-03-24\": 0.02,\n  \"2015-03-25\": 0.04,\n  \"2015-03-26\": 0.03,\n  \"2015-03-27\": 0.04,\n  \"2015-03-30\": 0.04,\n  \"2015-03-31\": 0.03,\n  \"2015-04-01\": 0.03,\n  \"2015-04-02\": 0.02,\n  \"2015-04-03\": 0.02,\n  \"2015-04-06\": 0.03,\n  \"2015-04-07\": 0.02,\n  \"2015-04-08\": 0.03,\n  \"2015-04-09\": 0.03,\n  \"2015-04-10\": 0.02,\n  \"2015-04-13\": 0.03,\n  \"2015-04-14\": 0.02,\n  \"2015-04-15\": 0.02,\n  \"2015-04-16\": 0.02,\n  \"2015-04-17\": 0.01,\n  \"2015-04-20\": 0.03,\n  \"2015-04-21\": 0.03,\n  \"2015-04-22\": 0.03,\n  \"2015-04-23\": 0.03,\n  \"2015-04-24\": 0.03,\n  \"2015-04-27\": 0.02,\n  \"2015-04-28\": 0.02,\n  \"2015-04-29\": 0.01,\n  \"2015-04-30\": 0.01,\n  \"2015-05-01\": 0.01,\n  \"2015-05-04\": 0.02,\n  \"2015-05-05\": 0.01,\n  \"2015-05-06\": 0.02,\n  \"2015-05-07\": 0.01,\n  \"2015-05-08\": 0.01,\n  \"2015-05-11\": 0.02,\n  \"2015-05-12\": 0.03,\n  \"2015-05-13\": 0.02,\n  \"2015-05-14\": 0.01,\n  \"2015-05-15\": 0.02,\n  \"2015-05-18\": 0.02,\n  \"2015-05-19\": 0.02,\n  \"2015-05-20\": 0.02,\n  \"2015-05-21\": 0.02,\n  \"2015-05-22\": 0.02,\n  \"2015-05-26\": 0.02,\n  \"2015-05-27\": 0.01,\n  \"2015-05-28\": 0.01,\n  \"2015-05-29\": 0.01,\n  \"2015-06-01\": 0.02,\n  \"2015-06-02\": 0.01,\n  \"2015-06-03\": 0.02,\n  \"2015-06-04\": 0.02,\n  \"2015-06-05\": 0.03,\n  \"2015-06-08\": 0.02,\n  \"2015-06-09\": 0.02,\n  \"2015-06-10\": 0.02,\n  \"2015-06-11\": 0.01,\n  \"2015-06-12\": 0.02,\n  \"2015-06-15\": 0.02,\n  \"2015-06-16\": 0.01,\n  \"2015-06-17\": 0.01,\n  \"2015-06-18\": 0.01,\n  \"2015-06-19\": 0.01,\n  \"2015-06-22\": 0.01,\n  \"2015-06-23\": 0.01,\n  \"2015-06-24\": 0.01,\n  \"2015-06-25\": 0.01,\n  \"2015-06-26\": 0.01,\n  \"2015-06-29\": 0.02,\n  \"2015-06-30\": 0.01,\n  \"2015-07-01\": 0.01,\n  \"2015-07-02\": 0.01,\n  \"2015-07-06\": 0.02,\n  \"2015-07-07\": 0.02,\n  \"2015-07-08\": 0.02,\n  \"2015-07-09\": 0.03,\n  \"2015-07-10\": 0.01,\n  \"2015-07-13\": 0.02,\n  \"2015-07-14\": 0.01,\n  \"2015-07-15\": 0.02,\n  \"2015-07-16\": 0.02,\n  \"2015-07-17\": 0.03,\n  \"2015-07-20\": 0.04,\n  \"2015-07-21\": 0.03,\n  \"2015-07-22\": 0.04,\n  \"2015-07-23\": 0.03,\n  \"2015-07-24\": 0.04,\n  \"2015-07-27\": 0.05,\n  \"2015-07-28\": 0.05,\n  \"2015-07-29\": 0.06,\n  \"2015-07-30\": 0.07,\n  \"2015-07-31\": 0.08,\n  \"2015-08-03\": 0.08,\n  \"2015-08-04\": 0.08,\n  \"2015-08-05\": 0.08,\n  \"2015-08-06\": 0.04,\n  \"2015-08-07\": 0.06,\n  \"2015-08-10\": 0.12,\n  \"2015-08-11\": 0.10,\n  \"2015-08-12\": 0.10,\n  \"2015-08-13\": 0.10,\n  \"2015-08-14\": 0.09,\n  \"2015-08-17\": 0.10,\n  \"2015-08-18\": 0.07,\n  \"2015-08-19\": 0.05,\n  \"2015-08-20\": 0.02,\n  \"2015-08-21\": 0.03,\n  \"2015-08-24\": 0.06,\n  \"2015-08-25\": 0.07,\n  \"2015-08-26\": 0.06,\n  \"2015-08-27\": 0.06,\n  \"2015-08-28\": 0.06,\n  \"2015-08-31\": 0.08,\n  \"2015-09-01\": 0.03,\n  \"2015-09-02\": 0.03,\n  \"2015-09-03\": 0.02,\n  \"2015-09-04\": 0.02,\n  \"2015-09-08\": 0.06,\n  \"2015-09-09\": 0.03,\n  \"2015-09-10\": 0.02,\n  \"2015-09-11\": 0.04,\n  \"2015-09-14\": 0.07,\n  \"2015-09-15\": 0.07,\n  \"2015-09-16\": 0.06,\n  \"2015-09-17\": 0.01,\n  \"2015-09-18\": -0.01,\n  \"2015-09-21\": 0.01,\n  \"2015-09-22\": -0.01,\n  \"2015-09-23\": 0.01,\n  \"2015-09-24\": 0.01,\n  \"2015-09-25\": -0.01,\n  \"2015-09-28\": 0.01,\n  \"2015-09-29\": 0.01,\n  \"2015-09-30\": -0.01,\n  \"2015-10-01\": -0.02,\n  \"2015-10-02\": 0.00,\n  \"2015-10-05\": 0.01,\n  \"2015-10-06\": 0.00,\n  \"2015-10-07\": 0.00,\n  \"2015-10-08\": -0.01,\n  \"2015-10-09\": 0.01,\n  \"2015-10-13\": 0.01,\n  \"2015-10-14\": 0.00,\n  \"2015-10-15\": 0.01,\n  \"2015-10-16\": 0.01,\n  \"2015-10-19\": 0.02,\n  \"2015-10-20\": 0.02,\n  \"2015-10-21\": 0.01,\n  \"2015-10-22\": 0.00,\n  \"2015-10-23\": 0.01,\n  \"2015-10-26\": 0.02,\n  \"2015-10-27\": 0.03,\n  \"2015-10-28\": 0.04,\n  \"2015-10-29\": 0.07,\n  \"2015-10-30\": 0.08,\n  \"2015-11-02\": 0.08,\n  \"2015-11-03\": 0.06,\n  \"2015-11-04\": 0.05,\n  \"2015-11-05\": 0.05,\n  \"2015-11-06\": 0.08,\n  \"2015-11-09\": 0.14,\n  \"2015-11-10\": 0.13,\n  \"2015-11-12\": 0.14,\n  \"2015-11-13\": 0.13,\n  \"2015-11-16\": 0.15,\n  \"2015-11-17\": 0.14,\n  \"2015-11-18\": 0.12,\n  \"2015-11-19\": 0.11,\n  \"2015-11-20\": 0.11,\n  \"2015-11-23\": 0.14,\n  \"2015-11-24\": 0.16,\n  \"2015-11-25\": 0.19,\n  \"2015-11-27\": 0.17,\n  \"2015-11-30\": 0.22,\n  \"2015-12-01\": 0.21,\n  \"2015-12-02\": 0.21,\n  \"2015-12-03\": 0.21,\n  \"2015-12-04\": 0.22,\n  \"2015-12-07\": 0.29,\n  \"2015-12-08\": 0.27,\n  \"2015-12-09\": 0.26,\n  \"2015-12-10\": 0.24,\n  \"2015-12-11\": 0.22,\n  \"2015-12-14\": 0.26,\n  \"2015-12-15\": 0.25,\n  \"2015-12-16\": 0.27,\n  \"2015-12-17\": 0.23,\n  \"2015-12-18\": 0.19,\n  \"2015-12-21\": 0.24,\n  \"2015-12-22\": 0.21,\n  \"2015-12-23\": 0.20,\n  \"2015-12-24\": 0.20,\n  \"2015-12-28\": 0.23,\n  \"2015-12-29\": 0.23,\n  \"2015-12-30\": 0.21,\n  \"2015-12-31\": 0.16,\n  \"2016-01-04\": 0.22,\n  \"2016-01-05\": 0.20,\n  \"2016-01-06\": 0.21,\n  \"2016-01-07\": 0.20,\n  \"2016-01-08\": 0.20,\n  \"2016-01-11\": 0.21,\n  \"2016-01-12\": 0.21,\n  \"2016-01-13\": 0.22,\n  \"2016-01-14\": 0.25,\n  \"2016-01-15\": 0.23,\n  \"2016-01-19\": 0.26,\n  \"2016-01-20\": 0.26,\n  \"2016-01-21\": 0.28,\n  \"2016-01-22\": 0.30,\n  \"2016-01-25\": 0.31,\n  \"2016-01-26\": 0.31,\n  \"2016-01-27\": 0.32,\n  \"2016-01-28\": 0.34,\n  \"2016-01-29\": 0.32,\n  \"2016-02-01\": 0.35,\n  \"2016-02-02\": 0.34,\n  \"2016-02-03\": 0.33,\n  \"2016-02-04\": 0.29,\n  \"2016-02-05\": 0.29,\n  \"2016-02-08\": 0.32,\n  \"2016-02-09\": 0.30,\n  \"2016-02-10\": 0.31,\n  \"2016-02-11\": 0.28,\n  \"2016-02-12\": 0.29,\n  \"2016-02-16\": 0.30,\n  \"2016-02-17\": 0.30,\n  \"2016-02-18\": 0.30,\n  \"2016-02-19\": 0.30,\n  \"2016-02-22\": 0.33,\n  \"2016-02-23\": 0.32,\n  \"2016-02-24\": 0.33,\n  \"2016-02-25\": 0.32,\n  \"2016-02-26\": 0.32,\n  \"2016-02-29\": 0.33,\n  \"2016-03-01\": 0.33,\n  \"2016-03-02\": 0.35,\n  \"2016-03-03\": 0.27,\n  \"2016-03-04\": 0.28,\n  \"2016-03-07\": 0.32,\n  \"2016-03-08\": 0.29,\n  \"2016-03-09\": 0.30,\n  \"2016-03-10\": 0.31,\n  \"2016-03-11\": 0.32,\n  \"2016-03-14\": 0.34,\n  \"2016-03-15\": 0.34,\n  \"2016-03-16\": 0.31,\n  \"2016-03-17\": 0.29,\n  \"2016-03-18\": 0.29,\n  \"2016-03-21\": 0.31,\n  \"2016-03-22\": 0.30,\n  \"2016-03-23\": 0.30,\n  \"2016-03-24\": 0.29,\n  \"2016-03-28\": 0.29,\n  \"2016-03-29\": 0.23,\n  \"2016-03-30\": 0.20,\n  \"2016-03-31\": 0.21,\n  \"2016-04-01\": 0.23,\n  \"2016-04-04\": 0.23,\n  \"2016-04-05\": 0.23,\n  \"2016-04-06\": 0.23,\n  \"2016-04-07\": 0.23,\n  \"2016-04-08\": 0.23,\n  \"2016-04-11\": 0.23,\n  \"2016-04-12\": 0.22,\n  \"2016-04-13\": 0.23,\n  \"2016-04-14\": 0.22,\n  \"2016-04-15\": 0.22,\n  \"2016-04-18\": 0.22,\n  \"2016-04-19\": 0.21,\n  \"2016-04-20\": 0.23,\n  \"2016-04-21\": 0.23,\n  \"2016-04-22\": 0.23,\n  \"2016-04-25\": 0.25,\n  \"2016-04-26\": 0.24,\n  \"2016-04-27\": 0.24,\n  \"2016-04-28\": 0.22,\n  \"2016-04-29\": 0.22,\n  \"2016-05-02\": 0.22,\n  \"2016-05-03\": 0.21,\n  \"2016-05-04\": 0.19,\n  \"2016-05-05\": 0.20,\n  \"2016-05-06\": 0.19,\n  \"2016-05-09\": 0.24,\n  \"2016-05-10\": 0.24,\n  \"2016-05-11\": 0.26,\n  \"2016-05-12\": 0.27,\n  \"2016-05-13\": 0.28,\n  \"2016-05-16\": 0.28,\n  \"2016-05-17\": 0.28,\n  \"2016-05-18\": 0.30,\n  \"2016-05-19\": 0.30,\n  \"2016-05-20\": 0.32,\n  \"2016-05-23\": 0.35,\n  \"2016-05-24\": 0.35,\n  \"2016-05-25\": 0.33,\n  \"2016-05-26\": 0.30,\n  \"2016-05-27\": 0.31,\n  \"2016-05-31\": 0.34,\n  \"2016-06-01\": 0.30,\n  \"2016-06-02\": 0.28,\n  \"2016-06-03\": 0.29,\n  \"2016-06-06\": 0.28,\n  \"2016-06-07\": 0.28,\n  \"2016-06-08\": 0.24,\n  \"2016-06-09\": 0.25,\n  \"2016-06-10\": 0.25,\n  \"2016-06-13\": 0.27,\n  \"2016-06-14\": 0.27,\n  \"2016-06-15\": 0.26,\n  \"2016-06-16\": 0.27,\n  \"2016-06-17\": 0.26,\n  \"2016-06-20\": 0.28,\n  \"2016-06-21\": 0.27,\n  \"2016-06-22\": 0.27,\n  \"2016-06-23\": 0.30,\n  \"2016-06-24\": 0.26,\n  \"2016-06-27\": 0.27,\n  \"2016-06-28\": 0.26,\n  \"2016-06-29\": 0.26,\n  \"2016-06-30\": 0.26,\n  \"2016-07-01\": 0.27,\n  \"2016-07-05\": 0.28,\n  \"2016-07-06\": 0.27,\n  \"2016-07-07\": 0.29,\n  \"2016-07-08\": 0.27,\n  \"2016-07-11\": 0.31,\n  \"2016-07-12\": 0.29,\n  \"2016-07-13\": 0.31,\n  \"2016-07-14\": 0.31,\n  \"2016-07-15\": 0.31,\n  \"2016-07-18\": 0.32,\n  \"2016-07-19\": 0.31,\n  \"2016-07-20\": 0.32,\n  \"2016-07-21\": 0.31,\n  \"2016-07-22\": 0.32,\n  \"2016-07-25\": 0.32,\n  \"2016-07-26\": 0.31,\n  \"2016-07-27\": 0.31,\n  \"2016-07-28\": 0.25,\n  \"2016-07-29\": 0.27,\n  \"2016-08-01\": 0.29,\n  \"2016-08-02\": 0.29,\n  \"2016-08-03\": 0.28,\n  \"2016-08-04\": 0.26,\n  \"2016-08-05\": 0.27,\n  \"2016-08-08\": 0.31,\n  \"2016-08-09\": 0.29,\n  \"2016-08-10\": 0.28,\n  \"2016-08-11\": 0.28,\n  \"2016-08-12\": 0.28,\n  \"2016-08-15\": 0.31,\n  \"2016-08-16\": 0.27,\n  \"2016-08-17\": 0.30,\n  \"2016-08-18\": 0.29,\n  \"2016-08-19\": 0.29,\n  \"2016-08-22\": 0.29,\n  \"2016-08-23\": 0.30,\n  \"2016-08-24\": 0.31,\n  \"2016-08-25\": 0.33,\n  \"2016-08-26\": 0.33,\n  \"2016-08-29\": 0.33,\n  \"2016-08-30\": 0.33,\n  \"2016-08-31\": 0.33,\n  \"2016-09-01\": 0.33,\n  \"2016-09-02\": 0.32,\n  \"2016-09-06\": 0.32,\n  \"2016-09-07\": 0.34,\n  \"2016-09-08\": 0.34,\n  \"2016-09-09\": 0.34,\n  \"2016-09-12\": 0.37,\n  \"2016-09-13\": 0.36,\n  \"2016-09-14\": 0.33,\n  \"2016-09-15\": 0.29,\n  \"2016-09-16\": 0.29,\n  \"2016-09-19\": 0.30,\n  \"2016-09-20\": 0.30,\n  \"2016-09-21\": 0.22,\n  \"2016-09-22\": 0.18,\n  \"2016-09-23\": 0.18,\n  \"2016-09-26\": 0.25,\n  \"2016-09-27\": 0.26,\n  \"2016-09-28\": 0.27,\n  \"2016-09-29\": 0.26,\n  \"2016-09-30\": 0.28,\n  \"2016-10-03\": 0.32,\n  \"2016-10-04\": 0.33,\n  \"2016-10-05\": 0.32,\n  \"2016-10-06\": 0.32,\n  \"2016-10-07\": 0.32,\n  \"2016-10-11\": 0.35,\n  \"2016-10-12\": 0.36,\n  \"2016-10-13\": 0.29,\n  \"2016-10-14\": 0.31,\n  \"2016-10-17\": 0.34,\n  \"2016-10-18\": 0.34,\n  \"2016-10-19\": 0.34,\n  \"2016-10-20\": 0.34,\n  \"2016-10-21\": 0.33,\n  \"2016-10-24\": 0.33,\n  \"2016-10-25\": 0.34,\n  \"2016-10-26\": 0.33,\n  \"2016-10-27\": 0.29,\n  \"2016-10-28\": 0.29,\n  \"2016-10-31\": 0.34,\n  \"2016-11-01\": 0.35,\n  \"2016-11-02\": 0.36,\n  \"2016-11-03\": 0.37,\n  \"2016-11-04\": 0.37,\n  \"2016-11-07\": 0.41,\n  \"2016-11-08\": 0.43,\n  \"2016-11-09\": 0.44,\n  \"2016-11-10\": 0.47,\n  \"2016-11-14\": 0.54,\n  \"2016-11-15\": 0.50,\n  \"2016-11-16\": 0.46,\n  \"2016-11-17\": 0.43,\n  \"2016-11-18\": 0.43,\n  \"2016-11-21\": 0.46,\n  \"2016-11-22\": 0.48,\n  \"2016-11-23\": 0.50,\n  \"2016-11-25\": 0.48,\n  \"2016-11-28\": 0.48,\n  \"2016-11-29\": 0.48,\n  \"2016-11-30\": 0.48,\n  \"2016-12-01\": 0.47,\n  \"2016-12-02\": 0.48,\n  \"2016-12-05\": 0.49,\n  \"2016-12-06\": 0.49,\n  \"2016-12-07\": 0.51,\n  \"2016-12-08\": 0.50,\n  \"2016-12-09\": 0.53,\n  \"2016-12-12\": 0.51,\n  \"2016-12-13\": 0.54,\n  \"2016-12-14\": 0.54,\n  \"2016-12-15\": 0.50,\n  \"2016-12-16\": 0.50,\n  \"2016-12-19\": 0.52,\n  \"2016-12-20\": 0.52,\n  \"2016-12-21\": 0.51,\n  \"2016-12-22\": 0.50,\n  \"2016-12-23\": 0.51,\n  \"2016-12-27\": 0.51,\n  \"2016-12-28\": 0.52,\n  \"2016-12-29\": 0.46,\n  \"2016-12-30\": 0.50,\n  \"2017-01-03\": 0.53,\n  \"2017-01-04\": 0.52,\n  \"2017-01-05\": 0.51,\n  \"2017-01-06\": 0.52,\n  \"2017-01-09\": 0.50,\n  \"2017-01-10\": 0.51,\n  \"2017-01-11\": 0.51,\n  \"2017-01-12\": 0.51,\n  \"2017-01-13\": 0.52,\n  \"2017-01-17\": 0.54,\n  \"2017-01-18\": 0.52,\n  \"2017-01-19\": 0.51,\n  \"2017-01-20\": 0.49,\n  \"2017-01-23\": 0.51,\n  \"2017-01-24\": 0.50,\n  \"2017-01-25\": 0.49,\n  \"2017-01-26\": 0.50,\n  \"2017-01-27\": 0.51,\n  \"2017-01-30\": 0.51,\n  \"2017-01-31\": 0.52,\n  \"2017-02-01\": 0.50,\n  \"2017-02-02\": 0.51,\n  \"2017-02-03\": 0.50,\n  \"2017-02-06\": 0.53,\n  \"2017-02-07\": 0.53,\n  \"2017-02-08\": 0.53,\n  \"2017-02-09\": 0.53,\n  \"2017-02-10\": 0.54,\n  \"2017-02-13\": 0.52,\n  \"2017-02-14\": 0.54,\n  \"2017-02-15\": 0.53,\n  \"2017-02-16\": 0.52,\n  \"2017-02-17\": 0.52,\n  \"2017-02-21\": 0.53,\n  \"2017-02-22\": 0.52,\n  \"2017-02-23\": 0.51,\n  \"2017-02-24\": 0.51,\n  \"2017-02-27\": 0.50,\n  \"2017-02-28\": 0.53,\n  \"2017-03-01\": 0.62,\n  \"2017-03-02\": 0.66,\n  \"2017-03-03\": 0.70,\n  \"2017-03-06\": 0.73,\n  \"2017-03-07\": 0.75,\n  \"2017-03-08\": 0.72,\n  \"2017-03-09\": 0.72,\n  \"2017-03-10\": 0.73,\n  \"2017-03-13\": 0.78,\n  \"2017-03-14\": 0.77,\n  \"2017-03-15\": 0.72,\n  \"2017-03-16\": 0.72,\n  \"2017-03-17\": 0.72,\n  \"2017-03-20\": 0.75,\n  \"2017-03-21\": 0.76,\n  \"2017-03-22\": 0.76,\n  \"2017-03-23\": 0.75,\n  \"2017-03-24\": 0.77,\n  \"2017-03-27\": 0.77,\n  \"2017-03-28\": 0.77,\n  \"2017-03-29\": 0.77,\n  \"2017-03-30\": 0.77,\n  \"2017-03-31\": 0.75,\n  \"2017-04-03\": 0.78,\n  \"2017-04-04\": 0.78,\n  \"2017-04-05\": 0.79,\n  \"2017-04-06\": 0.78,\n  \"2017-04-07\": 0.81,\n  \"2017-04-10\": 0.81,\n  \"2017-04-11\": 0.81,\n  \"2017-04-12\": 0.80,\n  \"2017-04-13\": 0.80,\n  \"2017-04-17\": 0.82,\n  \"2017-04-18\": 0.81,\n  \"2017-04-19\": 0.80,\n  \"2017-04-20\": 0.78,\n  \"2017-04-21\": 0.78,\n  \"2017-04-24\": 0.80,\n  \"2017-04-25\": 0.81,\n  \"2017-04-26\": 0.82,\n  \"2017-04-27\": 0.80,\n  \"2017-04-28\": 0.79,\n  \"2017-05-01\": 0.82,\n  \"2017-05-02\": 0.81,\n  \"2017-05-03\": 0.84,\n  \"2017-05-04\": 0.84,\n  \"2017-05-05\": 0.88,\n  \"2017-05-08\": 0.90,\n  \"2017-05-09\": 0.90,\n  \"2017-05-10\": 0.89,\n  \"2017-05-11\": 0.87,\n  \"2017-05-12\": 0.86,\n  \"2017-05-15\": 0.89,\n  \"2017-05-16\": 0.89,\n  \"2017-05-17\": 0.89,\n  \"2017-05-18\": 0.91,\n  \"2017-05-19\": 0.90,\n  \"2017-05-22\": 0.92,\n  \"2017-05-23\": 0.91,\n  \"2017-05-24\": 0.92,\n  \"2017-05-25\": 0.92,\n  \"2017-05-26\": 0.92,\n  \"2017-05-30\": 0.92,\n  \"2017-05-31\": 0.96,\n  \"2017-06-01\": 0.96,\n  \"2017-06-02\": 0.96,\n  \"2017-06-05\": 0.95,\n  \"2017-06-06\": 0.96,\n  \"2017-06-07\": 0.98,\n  \"2017-06-08\": 0.99,\n  \"2017-06-09\": 0.99,\n  \"2017-06-12\": 0.97,\n  \"2017-06-13\": 0.99,\n  \"2017-06-14\": 0.99,\n  \"2017-06-15\": 1.00,\n  \"2017-06-16\": 1.01,\n  \"2017-06-19\": 1.01,\n  \"2017-06-20\": 1.00,\n  \"2017-06-21\": 0.97,\n  \"2017-06-22\": 0.94,\n  \"2017-06-23\": 0.95,\n  \"2017-06-26\": 0.98,\n  \"2017-06-27\": 0.99,\n  \"2017-06-28\": 1.00,\n  \"2017-06-29\": 1.02,\n  \"2017-06-30\": 1.01,\n  \"2017-07-03\": 1.04,\n  \"2017-07-05\": 1.03,\n  \"2017-07-06\": 1.02,\n  \"2017-07-07\": 1.03,\n  \"2017-07-10\": 1.03,\n  \"2017-07-11\": 1.03,\n  \"2017-07-12\": 1.03,\n  \"2017-07-13\": 1.03,\n  \"2017-07-14\": 1.02,\n  \"2017-07-17\": 1.05,\n  \"2017-07-18\": 1.05,\n  \"2017-07-19\": 1.09,\n  \"2017-07-20\": 1.13,\n  \"2017-07-21\": 1.14,\n  \"2017-07-24\": 1.15,\n  \"2017-07-25\": 1.16,\n  \"2017-07-26\": 1.11,\n  \"2017-07-27\": 1.09,\n  \"2017-07-28\": 1.06,\n  \"2017-07-31\": 1.05,\n  \"2017-08-01\": 1.06,\n  \"2017-08-02\": 1.06,\n  \"2017-08-03\": 1.06,\n  \"2017-08-04\": 1.06,\n  \"2017-08-07\": 1.01,\n  \"2017-08-08\": 1.04,\n  \"2017-08-09\": 1.04,\n  \"2017-08-10\": 1.03,\n  \"2017-08-11\": 1.01,\n  \"2017-08-14\": 1.01,\n  \"2017-08-15\": 1.02,\n  \"2017-08-16\": 1.00,\n  \"2017-08-17\": 0.98,\n  \"2017-08-18\": 1.00,\n  \"2017-08-21\": 0.99,\n  \"2017-08-22\": 0.99,\n  \"2017-08-23\": 0.98,\n  \"2017-08-24\": 1.00,\n  \"2017-08-25\": 1.01,\n  \"2017-08-28\": 0.97,\n  \"2017-08-29\": 1.01,\n  \"2017-08-30\": 1.01,\n  \"2017-08-31\": 0.99,\n  \"2017-09-01\": 1.00,\n  \"2017-09-05\": 1.01,\n  \"2017-09-06\": 1.05,\n  \"2017-09-07\": 1.03,\n  \"2017-09-08\": 1.02,\n  \"2017-09-11\": 1.04,\n  \"2017-09-12\": 1.02,\n  \"2017-09-13\": 1.02,\n  \"2017-09-14\": 1.03,\n  \"2017-09-15\": 1.03,\n  \"2017-09-18\": 1.04,\n  \"2017-09-19\": 1.03,\n  \"2017-09-20\": 1.02,\n  \"2017-09-21\": 1.02,\n  \"2017-09-22\": 1.01,\n  \"2017-09-25\": 1.04,\n  \"2017-09-26\": 1.05,\n  \"2017-09-27\": 1.05,\n  \"2017-09-28\": 1.04,\n  \"2017-09-29\": 1.04,\n  \"2017-10-02\": 1.00,\n  \"2017-10-03\": 1.05,\n  \"2017-10-04\": 1.06,\n  \"2017-10-05\": 1.05,\n  \"2017-10-06\": 1.05,\n  \"2017-10-10\": 1.06,\n  \"2017-10-11\": 1.08,\n  \"2017-10-12\": 1.07,\n  \"2017-10-13\": 1.07,\n  \"2017-10-16\": 1.09,\n  \"2017-10-17\": 1.07,\n  \"2017-10-18\": 1.07,\n  \"2017-10-19\": 1.08,\n  \"2017-10-20\": 1.09,\n  \"2017-10-23\": 1.08,\n  \"2017-10-24\": 1.10,\n  \"2017-10-25\": 1.10,\n  \"2017-10-26\": 1.09,\n  \"2017-10-27\": 1.08,\n  \"2017-10-30\": 1.10,\n  \"2017-10-31\": 1.13,\n  \"2017-11-01\": 1.16,\n  \"2017-11-02\": 1.15,\n  \"2017-11-03\": 1.16,\n  \"2017-11-06\": 1.17,\n  \"2017-11-07\": 1.20,\n  \"2017-11-08\": 1.21,\n  \"2017-11-09\": 1.22,\n  \"2017-11-10\": 1.21,\n  \"2017-11-13\": 1.22,\n  \"2017-11-14\": 1.24,\n  \"2017-11-15\": 1.23,\n  \"2017-11-16\": 1.25,\n  \"2017-11-17\": 1.26,\n  \"2017-11-20\": 1.28,\n  \"2017-11-21\": 1.28,\n  \"2017-11-22\": 1.27,\n  \"2017-11-24\": 1.26,\n  \"2017-11-27\": 1.25,\n  \"2017-11-28\": 1.28,\n  \"2017-11-29\": 1.27,\n  \"2017-11-30\": 1.25,\n  \"2017-12-01\": 1.25,\n  \"2017-12-04\": 1.28,\n  \"2017-12-05\": 1.28,\n  \"2017-12-06\": 1.28,\n  \"2017-12-07\": 1.27,\n  \"2017-12-08\": 1.26,\n  \"2017-12-11\": 1.31,\n  \"2017-12-12\": 1.32,\n  \"2017-12-13\": 1.28,\n  \"2017-12-14\": 1.30,\n  \"2017-12-15\": 1.29,\n  \"2017-12-18\": 1.36,\n  \"2017-12-19\": 1.35,\n  \"2017-12-20\": 1.36,\n  \"2017-12-21\": 1.33,\n  \"2017-12-22\": 1.31,\n  \"2017-12-26\": 1.45,\n  \"2017-12-27\": 1.42,\n  \"2017-12-28\": 1.37,\n  \"2017-12-29\": 1.37,\n  \"2018-01-02\": 1.42,\n  \"2018-01-03\": 1.39,\n  \"2018-01-04\": 1.39,\n  \"2018-01-05\": 1.37,\n  \"2018-01-08\": 1.43,\n  \"2018-01-09\": 1.42,\n  \"2018-01-10\": 1.40,\n  \"2018-01-11\": 1.41,\n  \"2018-01-12\": 1.41,\n  \"2018-01-16\": 1.43,\n  \"2018-01-17\": 1.42,\n  \"2018-01-18\": 1.43,\n  \"2018-01-19\": 1.42,\n  \"2018-01-22\": 1.43,\n  \"2018-01-23\": 1.42,\n  \"2018-01-24\": 1.41,\n  \"2018-01-25\": 1.40,\n  \"2018-01-26\": 1.39,\n  \"2018-01-29\": 1.43,\n  \"2018-01-30\": 1.42,\n  \"2018-01-31\": 1.44,\n  \"2018-02-01\": 1.46,\n  \"2018-02-02\": 1.46,\n  \"2018-02-05\": 1.49,\n  \"2018-02-06\": 1.50,\n  \"2018-02-07\": 1.53,\n  \"2018-02-08\": 1.53,\n  \"2018-02-09\": 1.53,\n  \"2018-02-12\": 1.61,\n  \"2018-02-13\": 1.57,\n  \"2018-02-14\": 1.56,\n  \"2018-02-15\": 1.56,\n  \"2018-02-16\": 1.59,\n  \"2018-02-20\": 1.64,\n  \"2018-02-21\": 1.62,\n  \"2018-02-22\": 1.61,\n  \"2018-02-23\": 1.61,\n  \"2018-02-26\": 1.65,\n  \"2018-02-27\": 1.64,\n  \"2018-02-28\": 1.63,\n  \"2018-03-01\": 1.60,\n  \"2018-03-02\": 1.62,\n  \"2018-03-05\": 1.67,\n  \"2018-03-06\": 1.65,\n  \"2018-03-07\": 1.65,\n  \"2018-03-08\": 1.64,\n  \"2018-03-09\": 1.64,\n  \"2018-03-12\": 1.68,\n  \"2018-03-13\": 1.70,\n  \"2018-03-14\": 1.73,\n  \"2018-03-15\": 1.74,\n  \"2018-03-16\": 1.75,\n  \"2018-03-19\": 1.77,\n  \"2018-03-20\": 1.78,\n  \"2018-03-21\": 1.71,\n  \"2018-03-22\": 1.69,\n  \"2018-03-23\": 1.71,\n  \"2018-03-26\": 1.76,\n  \"2018-03-27\": 1.74,\n  \"2018-03-28\": 1.70,\n  \"2018-03-29\": 1.70,\n  \"2018-04-02\": 1.74,\n  \"2018-04-03\": 1.72,\n  \"2018-04-04\": 1.68,\n  \"2018-04-05\": 1.69,\n  \"2018-04-06\": 1.70,\n  \"2018-04-09\": 1.73,\n  \"2018-04-10\": 1.71,\n  \"2018-04-11\": 1.70,\n  \"2018-04-12\": 1.72,\n  \"2018-04-13\": 1.73,\n  \"2018-04-16\": 1.76,\n  \"2018-04-17\": 1.77,\n  \"2018-04-18\": 1.78,\n  \"2018-04-19\": 1.79,\n  \"2018-04-20\": 1.78,\n  \"2018-04-23\": 1.84,\n  \"2018-04-24\": 1.84,\n  \"2018-04-25\": 1.82,\n  \"2018-04-26\": 1.79,\n  \"2018-04-27\": 1.78,\n  \"2018-04-30\": 1.84,\n  \"2018-05-01\": 1.82,\n  \"2018-05-02\": 1.81,\n  \"2018-05-03\": 1.80,\n  \"2018-05-04\": 1.80,\n  \"2018-05-07\": 1.83,\n  \"2018-05-08\": 1.84,\n  \"2018-05-09\": 1.85,\n  \"2018-05-10\": 1.86,\n  \"2018-05-11\": 1.88,\n  \"2018-05-14\": 1.90,\n  \"2018-05-15\": 1.89,\n  \"2018-05-16\": 1.88,\n  \"2018-05-17\": 1.88,\n  \"2018-05-18\": 1.87,\n  \"2018-05-21\": 1.90,\n  \"2018-05-22\": 1.90,\n  \"2018-05-23\": 1.88,\n  \"2018-05-24\": 1.87,\n  \"2018-05-25\": 1.86,\n  \"2018-05-29\": 1.90,\n  \"2018-05-30\": 1.90,\n  \"2018-05-31\": 1.89,\n  \"2018-06-01\": 1.88,\n  \"2018-06-04\": 1.91,\n  \"2018-06-05\": 1.91,\n  \"2018-06-06\": 1.91,\n  \"2018-06-07\": 1.90,\n  \"2018-06-08\": 1.89,\n  \"2018-06-11\": 1.91,\n  \"2018-06-12\": 1.89,\n  \"2018-06-13\": 1.90,\n  \"2018-06-14\": 1.90,\n  \"2018-06-15\": 1.90,\n  \"2018-06-18\": 1.91,\n  \"2018-06-19\": 1.91,\n  \"2018-06-20\": 1.90,\n  \"2018-06-21\": 1.90,\n  \"2018-06-22\": 1.89,\n  \"2018-06-25\": 1.90,\n  \"2018-06-26\": 1.90,\n  \"2018-06-27\": 1.89,\n  \"2018-06-28\": 1.89,\n  \"2018-06-29\": 1.89,\n  \"2018-07-02\": 1.95,\n  \"2018-07-03\": 1.94,\n  \"2018-07-05\": 1.92,\n  \"2018-07-06\": 1.93,\n  \"2018-07-09\": 1.95,\n  \"2018-07-10\": 1.95,\n  \"2018-07-11\": 1.93,\n  \"2018-07-12\": 1.94,\n  \"2018-07-13\": 1.94,\n  \"2018-07-16\": 1.98,\n  \"2018-07-17\": 1.98,\n  \"2018-07-18\": 1.96,\n  \"2018-07-19\": 1.96,\n  \"2018-07-20\": 1.95,\n  \"2018-07-23\": 1.96,\n  \"2018-07-24\": 1.98,\n  \"2018-07-25\": 1.97,\n  \"2018-07-26\": 1.95,\n  \"2018-07-27\": 1.96,\n  \"2018-07-30\": 2.01,\n  \"2018-07-31\": 1.99,\n  \"2018-08-01\": 1.99,\n  \"2018-08-02\": 1.98,\n  \"2018-08-03\": 1.97,\n  \"2018-08-06\": 2.02,\n  \"2018-08-07\": 2.02,\n  \"2018-08-08\": 2.02,\n  \"2018-08-09\": 2.02,\n  \"2018-08-10\": 2.01,\n  \"2018-08-13\": 2.03,\n  \"2018-08-14\": 2.04,\n  \"2018-08-15\": 2.03,\n  \"2018-08-16\": 2.03,\n  \"2018-08-17\": 2.01,\n  \"2018-08-20\": 2.03,\n  \"2018-08-21\": 2.04,\n  \"2018-08-22\": 2.05,\n  \"2018-08-23\": 2.04,\n  \"2018-08-24\": 2.05,\n  \"2018-08-27\": 2.08,\n  \"2018-08-28\": 2.09,\n  \"2018-08-29\": 2.09,\n  \"2018-08-30\": 2.07,\n  \"2018-08-31\": 2.07,\n  \"2018-09-04\": 2.09,\n  \"2018-09-05\": 2.10,\n  \"2018-09-06\": 2.09,\n  \"2018-09-07\": 2.10,\n  \"2018-09-10\": 2.11,\n  \"2018-09-11\": 2.11,\n  \"2018-09-12\": 2.12,\n  \"2018-09-13\": 2.11,\n  \"2018-09-14\": 2.12,\n  \"2018-09-17\": 2.13,\n  \"2018-09-18\": 2.13,\n  \"2018-09-19\": 2.12,\n  \"2018-09-20\": 2.13,\n  \"2018-09-21\": 2.14,\n  \"2018-09-24\": 2.18,\n  \"2018-09-25\": 2.17,\n  \"2018-09-26\": 2.16,\n  \"2018-09-27\": 2.14,\n  \"2018-09-28\": 2.15,\n  \"2018-10-01\": 2.19,\n  \"2018-10-02\": 2.19,\n  \"2018-10-03\": 2.19,\n  \"2018-10-04\": 2.18,\n  \"2018-10-05\": 2.18,\n  \"2018-10-09\": 2.21,\n  \"2018-10-10\": 2.23,\n  \"2018-10-11\": 2.22,\n  \"2018-10-12\": 2.23,\n  \"2018-10-15\": 2.27,\n  \"2018-10-16\": 2.26,\n  \"2018-10-17\": 2.27,\n  \"2018-10-18\": 2.27,\n  \"2018-10-19\": 2.26,\n  \"2018-10-22\": 2.30,\n  \"2018-10-23\": 2.29,\n  \"2018-10-24\": 2.29,\n  \"2018-10-25\": 2.29,\n  \"2018-10-26\": 2.28,\n  \"2018-10-29\": 2.30,\n  \"2018-10-30\": 2.29,\n  \"2018-10-31\": 2.29,\n  \"2018-11-01\": 2.27,\n  \"2018-11-02\": 2.28,\n  \"2018-11-05\": 2.32,\n  \"2018-11-06\": 2.31,\n  \"2018-11-07\": 2.32,\n  \"2018-11-08\": 2.30,\n  \"2018-11-09\": 2.31,\n  \"2018-11-13\": 2.34,\n  \"2018-11-14\": 2.33,\n  \"2018-11-15\": 2.32,\n  \"2018-11-16\": 2.31,\n  \"2018-11-19\": 2.34,\n  \"2018-11-20\": 2.34,\n  \"2018-11-21\": 2.36,\n  \"2018-11-23\": 2.36,\n  \"2018-11-26\": 2.37,\n  \"2018-11-27\": 2.36,\n  \"2018-11-28\": 2.35,\n  \"2018-11-29\": 2.32,\n  \"2018-11-30\": 2.32,\n  \"2018-12-03\": 2.34,\n  \"2018-12-04\": 2.38,\n  \"2018-12-06\": 2.36,\n  \"2018-12-07\": 2.35,\n  \"2018-12-10\": 2.37,\n  \"2018-12-11\": 2.37,\n  \"2018-12-12\": 2.39,\n  \"2018-12-13\": 2.38,\n  \"2018-12-14\": 2.37,\n  \"2018-12-17\": 2.36,\n  \"2018-12-18\": 2.34,\n  \"2018-12-19\": 2.35,\n  \"2018-12-20\": 2.34,\n  \"2018-12-21\": 2.34,\n  \"2018-12-24\": 2.41,\n  \"2018-12-26\": 2.39,\n  \"2018-12-27\": 2.36,\n  \"2018-12-28\": 2.35,\n  \"2018-12-31\": 2.40,\n  \"2019-01-02\": 2.37,\n  \"2019-01-03\": 2.36,\n  \"2019-01-04\": 2.37,\n  \"2019-01-07\": 2.41,\n  \"2019-01-08\": 2.41,\n  \"2019-01-09\": 2.40,\n  \"2019-01-10\": 2.38,\n  \"2019-01-11\": 2.38,\n  \"2019-01-14\": 2.40,\n  \"2019-01-15\": 2.40,\n  \"2019-01-16\": 2.38,\n  \"2019-01-17\": 2.37,\n  \"2019-01-18\": 2.36,\n  \"2019-01-22\": 2.38,\n  \"2019-01-23\": 2.36,\n  \"2019-01-24\": 2.32,\n  \"2019-01-25\": 2.34,\n  \"2019-01-28\": 2.37,\n  \"2019-01-29\": 2.37,\n  \"2019-01-30\": 2.37,\n  \"2019-01-31\": 2.36,\n  \"2019-02-01\": 2.35,\n  \"2019-02-04\": 2.37,\n  \"2019-02-05\": 2.37,\n  \"2019-02-06\": 2.37,\n  \"2019-02-07\": 2.37,\n  \"2019-02-08\": 2.38,\n  \"2019-02-11\": 2.40,\n  \"2019-02-12\": 2.38,\n  \"2019-02-13\": 2.39,\n  \"2019-02-14\": 2.38,\n  \"2019-02-15\": 2.38,\n  \"2019-02-19\": 2.41,\n  \"2019-02-20\": 2.40,\n  \"2019-02-21\": 2.40,\n  \"2019-02-22\": 2.41,\n  \"2019-02-25\": 2.42,\n  \"2019-02-26\": 2.40,\n  \"2019-02-27\": 2.40,\n  \"2019-02-28\": 2.40,\n  \"2019-03-01\": 2.39,\n  \"2019-03-04\": 2.41,\n  \"2019-03-05\": 2.41,\n  \"2019-03-06\": 2.41,\n  \"2019-03-07\": 2.40,\n  \"2019-03-08\": 2.41,\n  \"2019-03-11\": 2.41,\n  \"2019-03-12\": 2.41,\n  \"2019-03-13\": 2.40,\n  \"2019-03-14\": 2.40,\n  \"2019-03-15\": 2.40,\n  \"2019-03-18\": 2.39,\n  \"2019-03-19\": 2.41,\n  \"2019-03-20\": 2.42,\n  \"2019-03-21\": 2.43,\n  \"2019-03-22\": 2.41,\n  \"2019-03-25\": 2.41,\n  \"2019-03-26\": 2.41,\n  \"2019-03-27\": 2.39,\n  \"2019-03-28\": 2.38,\n  \"2019-03-29\": 2.35,\n  \"2019-04-01\": 2.38,\n  \"2019-04-02\": 2.37,\n  \"2019-04-03\": 2.39,\n  \"2019-04-04\": 2.39,\n  \"2019-04-05\": 2.39,\n  \"2019-04-08\": 2.38,\n  \"2019-04-09\": 2.37,\n  \"2019-04-10\": 2.38,\n  \"2019-04-11\": 2.38,\n  \"2019-04-12\": 2.39,\n  \"2019-04-15\": 2.38,\n  \"2019-04-16\": 2.38,\n  \"2019-04-17\": 2.39,\n  \"2019-04-18\": 2.37,\n  \"2019-04-22\": 2.39,\n  \"2019-04-23\": 2.40,\n  \"2019-04-24\": 2.39,\n  \"2019-04-25\": 2.38,\n  \"2019-04-26\": 2.37,\n  \"2019-04-29\": 2.39,\n  \"2019-04-30\": 2.38,\n  \"2019-05-01\": 2.38,\n  \"2019-05-02\": 2.41,\n  \"2019-05-03\": 2.38,\n  \"2019-05-06\": 2.39,\n  \"2019-05-07\": 2.38,\n  \"2019-05-08\": 2.38,\n  \"2019-05-09\": 2.38,\n  \"2019-05-10\": 2.38,\n  \"2019-05-13\": 2.36,\n  \"2019-05-14\": 2.36,\n  \"2019-05-15\": 2.37,\n  \"2019-05-16\": 2.35,\n  \"2019-05-17\": 2.34,\n  \"2019-05-20\": 2.34,\n  \"2019-05-21\": 2.34,\n  \"2019-05-22\": 2.33,\n  \"2019-05-23\": 2.32,\n  \"2019-05-24\": 2.30,\n  \"2019-05-28\": 2.32,\n  \"2019-05-29\": 2.32,\n  \"2019-05-30\": 2.33,\n  \"2019-05-31\": 2.30,\n  \"2019-06-03\": 2.30,\n  \"2019-06-04\": 2.30,\n  \"2019-06-05\": 2.30,\n  \"2019-06-06\": 2.28,\n  \"2019-06-07\": 2.23,\n  \"2019-06-10\": 2.24,\n  \"2019-06-11\": 2.22,\n  \"2019-06-12\": 2.19,\n  \"2019-06-13\": 2.14,\n  \"2019-06-14\": 2.15,\n  \"2019-06-17\": 2.18,\n  \"2019-06-18\": 2.17,\n  \"2019-06-19\": 2.13,\n  \"2019-06-20\": 2.09,\n  \"2019-06-21\": 2.07,\n  \"2019-06-24\": 2.08,\n  \"2019-06-25\": 2.07,\n  \"2019-06-26\": 2.10,\n  \"2019-06-27\": 2.09,\n  \"2019-06-28\": 2.08,\n  \"2019-07-01\": 2.16,\n  \"2019-07-02\": 2.15,\n  \"2019-07-03\": 2.16,\n  \"2019-07-05\": 2.18,\n  \"2019-07-08\": 2.21,\n  \"2019-07-09\": 2.21,\n  \"2019-07-10\": 2.15,\n  \"2019-07-11\": 2.12,\n  \"2019-07-12\": 2.10,\n  \"2019-07-15\": 2.11,\n  \"2019-07-16\": 2.10,\n  \"2019-07-17\": 2.09,\n  \"2019-07-18\": 2.01,\n  \"2019-07-19\": 2.02,\n  \"2019-07-22\": 2.04,\n  \"2019-07-23\": 2.02,\n  \"2019-07-24\": 2.05,\n  \"2019-07-25\": 2.06,\n  \"2019-07-26\": 2.08,\n  \"2019-07-29\": 2.07,\n  \"2019-07-30\": 2.04,\n  \"2019-07-31\": 2.04,\n  \"2019-08-01\": 2.03,\n  \"2019-08-02\": 2.02,\n  \"2019-08-05\": 2.00,\n  \"2019-08-06\": 2.01,\n  \"2019-08-07\": 1.98,\n  \"2019-08-08\": 1.98,\n  \"2019-08-09\": 1.96,\n  \"2019-08-12\": 1.96,\n  \"2019-08-13\": 1.96,\n  \"2019-08-14\": 1.92,\n  \"2019-08-15\": 1.87,\n  \"2019-08-16\": 1.83,\n  \"2019-08-19\": 1.90,\n  \"2019-08-20\": 1.90,\n  \"2019-08-21\": 1.93,\n  \"2019-08-22\": 1.96,\n  \"2019-08-23\": 1.93,\n  \"2019-08-26\": 1.96,\n  \"2019-08-27\": 1.94,\n  \"2019-08-28\": 1.95,\n  \"2019-08-29\": 1.95,\n  \"2019-08-30\": 1.95,\n  \"2019-09-03\": 1.94,\n  \"2019-09-04\": 1.93,\n  \"2019-09-05\": 1.93,\n  \"2019-09-06\": 1.92,\n  \"2019-09-09\": 1.92,\n  \"2019-09-10\": 1.91,\n  \"2019-09-11\": 1.92,\n  \"2019-09-12\": 1.91,\n  \"2019-09-13\": 1.92,\n  \"2019-09-16\": 1.95,\n  \"2019-09-17\": 1.95,\n  \"2019-09-18\": 1.91,\n  \"2019-09-19\": 1.89,\n  \"2019-09-20\": 1.87,\n  \"2019-09-23\": 1.90,\n  \"2019-09-24\": 1.88,\n  \"2019-09-25\": 1.85,\n  \"2019-09-26\": 1.79,\n  \"2019-09-27\": 1.76,\n  \"2019-09-30\": 1.84,\n  \"2019-10-01\": 1.78,\n  \"2019-10-02\": 1.75,\n  \"2019-10-03\": 1.67,\n  \"2019-10-04\": 1.68,\n  \"2019-10-07\": 1.71,\n  \"2019-10-08\": 1.68,\n  \"2019-10-09\": 1.66,\n  \"2019-10-10\": 1.65,\n  \"2019-10-11\": 1.65,\n  \"2019-10-15\": 1.64,\n  \"2019-10-16\": 1.63,\n  \"2019-10-17\": 1.63,\n  \"2019-10-18\": 1.63,\n  \"2019-10-21\": 1.64,\n  \"2019-10-22\": 1.62,\n  \"2019-10-23\": 1.62,\n  \"2019-10-24\": 1.64,\n  \"2019-10-25\": 1.63,\n  \"2019-10-28\": 1.62,\n  \"2019-10-29\": 1.60,\n  \"2019-10-30\": 1.59,\n  \"2019-10-31\": 1.51,\n  \"2019-11-01\": 1.49,\n  \"2019-11-04\": 1.50,\n  \"2019-11-05\": 1.53,\n  \"2019-11-06\": 1.53,\n  \"2019-11-07\": 1.53,\n  \"2019-11-08\": 1.52,\n  \"2019-11-12\": 1.56,\n  \"2019-11-13\": 1.54,\n  \"2019-11-14\": 1.54,\n  \"2019-11-15\": 1.54,\n  \"2019-11-18\": 1.54,\n  \"2019-11-19\": 1.54,\n  \"2019-11-20\": 1.54,\n  \"2019-11-21\": 1.55,\n  \"2019-11-22\": 1.55,\n  \"2019-11-25\": 1.58,\n  \"2019-11-26\": 1.57,\n  \"2019-11-27\": 1.59,\n  \"2019-11-29\": 1.56,\n  \"2019-12-02\": 1.57,\n  \"2019-12-03\": 1.54,\n  \"2019-12-04\": 1.52,\n  \"2019-12-05\": 1.51,\n  \"2019-12-06\": 1.50,\n  \"2019-12-09\": 1.51,\n  \"2019-12-10\": 1.53,\n  \"2019-12-11\": 1.54,\n  \"2019-12-12\": 1.53,\n  \"2019-12-13\": 1.54,\n  \"2019-12-16\": 1.54,\n  \"2019-12-17\": 1.53,\n  \"2019-12-18\": 1.53,\n  \"2019-12-19\": 1.54,\n  \"2019-12-20\": 1.55,\n  \"2019-12-23\": 1.56,\n  \"2019-12-24\": 1.55,\n  \"2019-12-26\": 1.55,\n  \"2019-12-27\": 1.54,\n  \"2019-12-30\": 1.54,\n  \"2019-12-31\": 1.52,\n  \"2020-01-02\": 1.51,\n  \"2020-01-03\": 1.49,\n  \"2020-01-06\": 1.53,\n  \"2020-01-07\": 1.51,\n  \"2020-01-08\": 1.51,\n  \"2020-01-09\": 1.51,\n  \"2020-01-10\": 1.51,\n  \"2020-01-13\": 1.54,\n  \"2020-01-14\": 1.54,\n  \"2020-01-15\": 1.54,\n  \"2020-01-16\": 1.52,\n  \"2020-01-17\": 1.53,\n  \"2020-01-21\": 1.53,\n  \"2020-01-22\": 1.52,\n  \"2020-01-23\": 1.52,\n  \"2020-01-24\": 1.51,\n  \"2020-01-27\": 1.52,\n  \"2020-01-28\": 1.54,\n  \"2020-01-29\": 1.53,\n  \"2020-01-30\": 1.54,\n  \"2020-01-31\": 1.52,\n  \"2020-02-03\": 1.54,\n  \"2020-02-04\": 1.54,\n  \"2020-02-05\": 1.54,\n  \"2020-02-06\": 1.54,\n  \"2020-02-07\": 1.53,\n  \"2020-02-10\": 1.55,\n  \"2020-02-11\": 1.54,\n  \"2020-02-12\": 1.55,\n  \"2020-02-13\": 1.56,\n  \"2020-02-14\": 1.55,\n  \"2020-02-18\": 1.55,\n  \"2020-02-19\": 1.55,\n  \"2020-02-20\": 1.55,\n  \"2020-02-21\": 1.53,\n  \"2020-02-24\": 1.50,\n  \"2020-02-25\": 1.50,\n  \"2020-02-26\": 1.50,\n  \"2020-02-27\": 1.42,\n  \"2020-02-28\": 1.25,\n  \"2020-03-02\": 1.10,\n  \"2020-03-03\": 0.93,\n  \"2020-03-04\": 0.71,\n  \"2020-03-05\": 0.61,\n  \"2020-03-06\": 0.45,\n  \"2020-03-09\": 0.32,\n  \"2020-03-10\": 0.43,\n  \"2020-03-11\": 0.41,\n  \"2020-03-12\": 0.33,\n  \"2020-03-13\": 0.27,\n  \"2020-03-16\": 0.24,\n  \"2020-03-17\": 0.19,\n  \"2020-03-18\": 0.02,\n  \"2020-03-19\": 0.04,\n  \"2020-03-20\": 0.05,\n  \"2020-03-23\": 0.02,\n  \"2020-03-24\": 0.01,\n  \"2020-03-25\": -0.04,\n  \"2020-03-26\": -0.05,\n  \"2020-03-27\": 0.03,\n  \"2020-03-30\": 0.12,\n  \"2020-03-31\": 0.11,\n  \"2020-04-01\": 0.09,\n  \"2020-04-02\": 0.09,\n  \"2020-04-03\": 0.10,\n  \"2020-04-06\": 0.15,\n  \"2020-04-07\": 0.14,\n  \"2020-04-08\": 0.22,\n  \"2020-04-09\": 0.25,\n  \"2020-04-13\": 0.26,\n  \"2020-04-14\": 0.20,\n  \"2020-04-15\": 0.14,\n  \"2020-04-16\": 0.14,\n  \"2020-04-17\": 0.12,\n  \"2020-04-20\": 0.12,\n  \"2020-04-21\": 0.11,\n  \"2020-04-22\": 0.12,\n  \"2020-04-23\": 0.11,\n  \"2020-04-24\": 0.12,\n  \"2020-04-27\": 0.12,\n  \"2020-04-28\": 0.11,\n  \"2020-04-29\": 0.10,\n  \"2020-04-30\": 0.09,\n  \"2020-05-01\": 0.12,\n  \"2020-05-04\": 0.13,\n  \"2020-05-05\": 0.13,\n  \"2020-05-06\": 0.12,\n  \"2020-05-07\": 0.11,\n  \"2020-05-08\": 0.12,\n  \"2020-05-11\": 0.12,\n  \"2020-05-12\": 0.13,\n  \"2020-05-13\": 0.13,\n  \"2020-05-14\": 0.12,\n  \"2020-05-15\": 0.12,\n  \"2020-05-18\": 0.13,\n  \"2020-05-19\": 0.13,\n  \"2020-05-20\": 0.12,\n  \"2020-05-21\": 0.12,\n  \"2020-05-22\": 0.12,\n  \"2020-05-26\": 0.14,\n  \"2020-05-27\": 0.15,\n  \"2020-05-28\": 0.15,\n  \"2020-05-29\": 0.14,\n  \"2020-06-01\": 0.14,\n  \"2020-06-02\": 0.15,\n  \"2020-06-03\": 0.16,\n  \"2020-06-04\": 0.15,\n  \"2020-06-05\": 0.15,\n  \"2020-06-08\": 0.17,\n  \"2020-06-09\": 0.19,\n  \"2020-06-10\": 0.17,\n  \"2020-06-11\": 0.17,\n  \"2020-06-12\": 0.16,\n  \"2020-06-15\": 0.18,\n  \"2020-06-16\": 0.17,\n  \"2020-06-17\": 0.17,\n  \"2020-06-18\": 0.16,\n  \"2020-06-19\": 0.15,\n  \"2020-06-22\": 0.16,\n  \"2020-06-23\": 0.16,\n  \"2020-06-24\": 0.15,\n  \"2020-06-25\": 0.16,\n  \"2020-06-26\": 0.14,\n  \"2020-06-29\": 0.14,\n  \"2020-06-30\": 0.16,\n  \"2020-07-01\": 0.14,\n  \"2020-07-02\": 0.14,\n  \"2020-07-06\": 0.15,\n  \"2020-07-07\": 0.15,\n  \"2020-07-08\": 0.15,\n  \"2020-07-09\": 0.13,\n  \"2020-07-10\": 0.13,\n  \"2020-07-13\": 0.14,\n  \"2020-07-14\": 0.15,\n  \"2020-07-15\": 0.16,\n  \"2020-07-16\": 0.11,\n  \"2020-07-17\": 0.11,\n  \"2020-07-20\": 0.13,\n  \"2020-07-21\": 0.13,\n  \"2020-07-22\": 0.13,\n  \"2020-07-23\": 0.12,\n  \"2020-07-24\": 0.11,\n  \"2020-07-27\": 0.11,\n  \"2020-07-28\": 0.11,\n  \"2020-07-29\": 0.11,\n  \"2020-07-30\": 0.09,\n  \"2020-07-31\": 0.09,\n  \"2020-08-03\": 0.10,\n  \"2020-08-04\": 0.09,\n  \"2020-08-05\": 0.10,\n  \"2020-08-06\": 0.10,\n  \"2020-08-07\": 0.10,\n  \"2020-08-10\": 0.11,\n  \"2020-08-11\": 0.11,\n  \"2020-08-12\": 0.11,\n  \"2020-08-13\": 0.10,\n  \"2020-08-14\": 0.10,\n  \"2020-08-17\": 0.10,\n  \"2020-08-18\": 0.09,\n  \"2020-08-19\": 0.11,\n  \"2020-08-20\": 0.11,\n  \"2020-08-21\": 0.10,\n  \"2020-08-24\": 0.12,\n  \"2020-08-25\": 0.11,\n  \"2020-08-26\": 0.11,\n  \"2020-08-27\": 0.11,\n  \"2020-08-28\": 0.10,\n  \"2020-08-31\": 0.11,\n  \"2020-09-01\": 0.12,\n  \"2020-09-02\": 0.12,\n  \"2020-09-03\": 0.11,\n  \"2020-09-04\": 0.11,\n  \"2020-09-08\": 0.13,\n  \"2020-09-09\": 0.12,\n  \"2020-09-10\": 0.12,\n  \"2020-09-11\": 0.11,\n  \"2020-09-14\": 0.11,\n  \"2020-09-15\": 0.11,\n  \"2020-09-16\": 0.12,\n  \"2020-09-17\": 0.09,\n  \"2020-09-18\": 0.10,\n  \"2020-09-21\": 0.10,\n  \"2020-09-22\": 0.10,\n  \"2020-09-23\": 0.11,\n  \"2020-09-24\": 0.10,\n  \"2020-09-25\": 0.10,\n  \"2020-09-28\": 0.11,\n  \"2020-09-29\": 0.09,\n  \"2020-09-30\": 0.10,\n  \"2020-10-01\": 0.09,\n  \"2020-10-02\": 0.09,\n  \"2020-10-05\": 0.10,\n  \"2020-10-06\": 0.10,\n  \"2020-10-07\": 0.10,\n  \"2020-10-08\": 0.09,\n  \"2020-10-09\": 0.10,\n  \"2020-10-13\": 0.11,\n  \"2020-10-14\": 0.12,\n  \"2020-10-15\": 0.11,\n  \"2020-10-16\": 0.11,\n  \"2020-10-19\": 0.11,\n  \"2020-10-20\": 0.10,\n  \"2020-10-21\": 0.10,\n  \"2020-10-22\": 0.09,\n  \"2020-10-23\": 0.10,\n  \"2020-10-26\": 0.11,\n  \"2020-10-27\": 0.10,\n  \"2020-10-28\": 0.10,\n  \"2020-10-29\": 0.09,\n  \"2020-10-30\": 0.09,\n  \"2020-11-02\": 0.09,\n  \"2020-11-03\": 0.10,\n  \"2020-11-04\": 0.10,\n  \"2020-11-05\": 0.10,\n  \"2020-11-06\": 0.10,\n  \"2020-11-09\": 0.11,\n  \"2020-11-10\": 0.10,\n  \"2020-11-12\": 0.10,\n  \"2020-11-13\": 0.09,\n  \"2020-11-16\": 0.09,\n  \"2020-11-17\": 0.09,\n  \"2020-11-18\": 0.09,\n  \"2020-11-19\": 0.07,\n  \"2020-11-20\": 0.07,\n  \"2020-11-23\": 0.08,\n  \"2020-11-24\": 0.09,\n  \"2020-11-25\": 0.09,\n  \"2020-11-27\": 0.09,\n  \"2020-11-30\": 0.08,\n  \"2020-12-01\": 0.09,\n  \"2020-12-02\": 0.09,\n  \"2020-12-03\": 0.08,\n  \"2020-12-04\": 0.09,\n  \"2020-12-07\": 0.08,\n  \"2020-12-08\": 0.09,\n  \"2020-12-09\": 0.08,\n  \"2020-12-10\": 0.08,\n  \"2020-12-11\": 0.08,\n  \"2020-12-14\": 0.09,\n  \"2020-12-15\": 0.08,\n  \"2020-12-16\": 0.09,\n  \"2020-12-17\": 0.08,\n  \"2020-12-18\": 0.08,\n  \"2020-12-21\": 0.09,\n  \"2020-12-22\": 0.09,\n  \"2020-12-23\": 0.09,\n  \"2020-12-24\": 0.09,\n  \"2020-12-28\": 0.11,\n  \"2020-12-29\": 0.10,\n  \"2020-12-30\": 0.08,\n  \"2020-12-31\": 0.09,\n  \"2021-01-04\": 0.09,\n  \"2021-01-05\": 0.09,\n  \"2021-01-06\": 0.09,\n  \"2021-01-07\": 0.09,\n  \"2021-01-08\": 0.08,\n  \"2021-01-11\": 0.08,\n  \"2021-01-12\": 0.09,\n  \"2021-01-13\": 0.09,\n  \"2021-01-14\": 0.09,\n  \"2021-01-15\": 0.09,\n  \"2021-01-19\": 0.09,\n  \"2021-01-20\": 0.08,\n  \"2021-01-21\": 0.09,\n  \"2021-01-22\": 0.08,\n  \"2021-01-25\": 0.09,\n  \"2021-01-26\": 0.07,\n  \"2021-01-27\": 0.08,\n  \"2021-01-28\": 0.07,\n  \"2021-01-29\": 0.06,\n  \"2021-02-01\": 0.07,\n  \"2021-02-02\": 0.07,\n  \"2021-02-03\": 0.04,\n  \"2021-02-04\": 0.04,\n  \"2021-02-05\": 0.03,\n  \"2021-02-08\": 0.05,\n  \"2021-02-09\": 0.04,\n  \"2021-02-10\": 0.05,\n  \"2021-02-11\": 0.05,\n  \"2021-02-12\": 0.04,\n  \"2021-02-16\": 0.04,\n  \"2021-02-17\": 0.04,\n  \"2021-02-18\": 0.03,\n  \"2021-02-19\": 0.04,\n  \"2021-02-22\": 0.03,\n  \"2021-02-23\": 0.04,\n  \"2021-02-24\": 0.03,\n  \"2021-02-25\": 0.04,\n  \"2021-02-26\": 0.04,\n  \"2021-03-01\": 0.05,\n  \"2021-03-02\": 0.04,\n  \"2021-03-03\": 0.05,\n  \"2021-03-04\": 0.04,\n  \"2021-03-05\": 0.04,\n  \"2021-03-08\": 0.05,\n  \"2021-03-09\": 0.05,\n  \"2021-03-10\": 0.04,\n  \"2021-03-11\": 0.04,\n  \"2021-03-12\": 0.04,\n  \"2021-03-15\": 0.04,\n  \"2021-03-16\": 0.02,\n  \"2021-03-17\": 0.02,\n  \"2021-03-18\": 0.01,\n  \"2021-03-19\": 0.01,\n  \"2021-03-22\": 0.03,\n  \"2021-03-23\": 0.01,\n  \"2021-03-24\": 0.02,\n  \"2021-03-25\": 0.02,\n  \"2021-03-26\": 0.02,\n  \"2021-03-29\": 0.03,\n  \"2021-03-30\": 0.02,\n  \"2021-03-31\": 0.03,\n  \"2021-04-01\": 0.02,\n  \"2021-04-02\": 0.02,\n  \"2021-04-05\": 0.03,\n  \"2021-04-06\": 0.02,\n  \"2021-04-07\": 0.02,\n  \"2021-04-08\": 0.01,\n  \"2021-04-09\": 0.02,\n  \"2021-04-12\": 0.02,\n  \"2021-04-13\": 0.03,\n  \"2021-04-14\": 0.02,\n  \"2021-04-15\": 0.02,\n  \"2021-04-16\": 0.02,\n  \"2021-04-19\": 0.02,\n  \"2021-04-20\": 0.03,\n  \"2021-04-21\": 0.03,\n  \"2021-04-22\": 0.03,\n  \"2021-04-23\": 0.03,\n  \"2021-04-26\": 0.03,\n  \"2021-04-27\": 0.01,\n  \"2021-04-28\": 0.01,\n  \"2021-04-29\": 0.01,\n  \"2021-04-30\": 0.01,\n  \"2021-05-03\": 0.04,\n  \"2021-05-04\": 0.02,\n  \"2021-05-05\": 0.02,\n  \"2021-05-06\": 0.02,\n  \"2021-05-07\": 0.02,\n  \"2021-05-10\": 0.02,\n  \"2021-05-11\": 0.01,\n  \"2021-05-12\": 0.02,\n  \"2021-05-13\": 0.02,\n  \"2021-05-14\": 0.01,\n  \"2021-05-17\": 0.02,\n  \"2021-05-18\": 0.02,\n  \"2021-05-19\": 0.01,\n  \"2021-05-20\": 0.01,\n  \"2021-05-21\": 0.01,\n  \"2021-05-24\": 0.02,\n  \"2021-05-25\": 0.02,\n  \"2021-05-26\": 0.02,\n  \"2021-05-27\": 0.02,\n  \"2021-05-28\": 0.01,\n  \"2021-06-01\": 0.02,\n  \"2021-06-02\": 0.02,\n  \"2021-06-03\": 0.02,\n  \"2021-06-04\": 0.02,\n  \"2021-06-07\": 0.02,\n  \"2021-06-08\": 0.02,\n  \"2021-06-09\": 0.03,\n  \"2021-06-10\": 0.03,\n  \"2021-06-11\": 0.03,\n  \"2021-06-14\": 0.03,\n  \"2021-06-15\": 0.03,\n  \"2021-06-16\": 0.04,\n  \"2021-06-17\": 0.04,\n  \"2021-06-18\": 0.05,\n  \"2021-06-21\": 0.05,\n  \"2021-06-22\": 0.04,\n  \"2021-06-23\": 0.05,\n  \"2021-06-24\": 0.05,\n  \"2021-06-25\": 0.06,\n  \"2021-06-28\": 0.05,\n  \"2021-06-29\": 0.04,\n  \"2021-06-30\": 0.05,\n  \"2021-07-01\": 0.05,\n  \"2021-07-02\": 0.05,\n  \"2021-07-06\": 0.05,\n  \"2021-07-07\": 0.05,\n  \"2021-07-08\": 0.06,\n  \"2021-07-09\": 0.06,\n  \"2021-07-12\": 0.05,\n  \"2021-07-13\": 0.05,\n  \"2021-07-14\": 0.06,\n  \"2021-07-15\": 0.05,\n  \"2021-07-16\": 0.05,\n  \"2021-07-19\": 0.05,\n  \"2021-07-20\": 0.05,\n  \"2021-07-21\": 0.05,\n  \"2021-07-22\": 0.05,\n  \"2021-07-23\": 0.05,\n  \"2021-07-26\": 0.05,\n  \"2021-07-27\": 0.05,\n  \"2021-07-28\": 0.05,\n  \"2021-07-29\": 0.06,\n  \"2021-07-30\": 0.06,\n  \"2021-08-02\": 0.05,\n  \"2021-08-03\": 0.05,\n  \"2021-08-04\": 0.05,\n  \"2021-08-05\": 0.05,\n  \"2021-08-06\": 0.06,\n  \"2021-08-09\": 0.06,\n  \"2021-08-10\": 0.05,\n  \"2021-08-11\": 0.05,\n  \"2021-08-12\": 0.06,\n  \"2021-08-13\": 0.06,\n  \"2021-08-16\": 0.06,\n  \"2021-08-17\": 0.07,\n  \"2021-08-18\": 0.07,\n  \"2021-08-19\": 0.06,\n  \"2021-08-20\": 0.05,\n  \"2021-08-23\": 0.05,\n  \"2021-08-24\": 0.05,\n  \"2021-08-25\": 0.06,\n  \"2021-08-26\": 0.05,\n  \"2021-08-27\": 0.05,\n  \"2021-08-30\": 0.05,\n  \"2021-08-31\": 0.04,\n  \"2021-09-01\": 0.05,\n  \"2021-09-02\": 0.05,\n  \"2021-09-03\": 0.05,\n  \"2021-09-07\": 0.05,\n  \"2021-09-08\": 0.05,\n  \"2021-09-09\": 0.04,\n  \"2021-09-10\": 0.05,\n  \"2021-09-13\": 0.06,\n  \"2021-09-14\": 0.04,\n  \"2021-09-15\": 0.04,\n  \"2021-09-16\": 0.04,\n  \"2021-09-17\": 0.04,\n  \"2021-09-20\": 0.04,\n  \"2021-09-21\": 0.03,\n  \"2021-09-22\": 0.03,\n  \"2021-09-23\": 0.03,\n  \"2021-09-24\": 0.03,\n  \"2021-09-27\": 0.04,\n  \"2021-09-28\": 0.04,\n  \"2021-09-29\": 0.04,\n  \"2021-09-30\": 0.04,\n  \"2021-10-01\": 0.04,\n  \"2021-10-04\": 0.04,\n  \"2021-10-05\": 0.04,\n  \"2021-10-06\": 0.04,\n  \"2021-10-07\": 0.05,\n  \"2021-10-08\": 0.05,\n  \"2021-10-12\": 0.06,\n  \"2021-10-13\": 0.05,\n  \"2021-10-14\": 0.05,\n  \"2021-10-15\": 0.05,\n  \"2021-10-18\": 0.06,\n  \"2021-10-19\": 0.05,\n  \"2021-10-20\": 0.05,\n  \"2021-10-21\": 0.06,\n  \"2021-10-22\": 0.06,\n  \"2021-10-25\": 0.06,\n  \"2021-10-26\": 0.06,\n  \"2021-10-27\": 0.06,\n  \"2021-10-28\": 0.06,\n  \"2021-10-29\": 0.05,\n  \"2021-11-01\": 0.05,\n  \"2021-11-02\": 0.05,\n  \"2021-11-03\": 0.05,\n  \"2021-11-04\": 0.04,\n  \"2021-11-05\": 0.05,\n  \"2021-11-08\": 0.06,\n  \"2021-11-09\": 0.04,\n  \"2021-11-10\": 0.05,\n  \"2021-11-12\": 0.05,\n  \"2021-11-15\": 0.05,\n  \"2021-11-16\": 0.05,\n  \"2021-11-17\": 0.05,\n  \"2021-11-18\": 0.05,\n  \"2021-11-19\": 0.05,\n  \"2021-11-22\": 0.05,\n  \"2021-11-23\": 0.06,\n  \"2021-11-24\": 0.06,\n  \"2021-11-26\": 0.06,\n  \"2021-11-29\": 0.06,\n  \"2021-11-30\": 0.05,\n  \"2021-12-01\": 0.06,\n  \"2021-12-02\": 0.05,\n  \"2021-12-03\": 0.06,\n  \"2021-12-06\": 0.06,\n  \"2021-12-07\": 0.06,\n  \"2021-12-08\": 0.07,\n  \"2021-12-09\": 0.06,\n  \"2021-12-10\": 0.06,\n  \"2021-12-13\": 0.05,\n  \"2021-12-14\": 0.05,\n  \"2021-12-15\": 0.06,\n  \"2021-12-16\": 0.05,\n  \"2021-12-17\": 0.05,\n  \"2021-12-20\": 0.07,\n  \"2021-12-21\": 0.07,\n  \"2021-12-22\": 0.08,\n  \"2021-12-23\": 0.08,\n  \"2021-12-27\": 0.06,\n  \"2021-12-28\": 0.06,\n  \"2021-12-29\": 0.05,\n  \"2021-12-30\": 0.05,\n  \"2021-12-31\": 0.06,\n  \"2022-01-03\": 0.09,\n  \"2022-01-04\": 0.08,\n  \"2022-01-05\": 0.09,\n  \"2022-01-06\": 0.10,\n  \"2022-01-07\": 0.10,\n  \"2022-01-10\": 0.13,\n  \"2022-01-11\": 0.12,\n  \"2022-01-12\": 0.12,\n  \"2022-01-13\": 0.12,\n  \"2022-01-14\": 0.13,\n  \"2022-01-18\": 0.17,\n  \"2022-01-19\": 0.17,\n  \"2022-01-20\": 0.18,\n  \"2022-01-21\": 0.17,\n  \"2022-01-24\": 0.20,\n  \"2022-01-25\": 0.20,\n  \"2022-01-26\": 0.19,\n  \"2022-01-27\": 0.20,\n  \"2022-01-28\": 0.19,\n  \"2022-01-31\": 0.24,\n  \"2022-02-01\": 0.20,\n  \"2022-02-02\": 0.20,\n  \"2022-02-03\": 0.21,\n  \"2022-02-04\": 0.23,\n  \"2022-02-07\": 0.28,\n  \"2022-02-08\": 0.27,\n  \"2022-02-09\": 0.27,\n  \"2022-02-10\": 0.41,\n  \"2022-02-11\": 0.37,\n  \"2022-02-14\": 0.45,\n  \"2022-02-15\": 0.41,\n  \"2022-02-16\": 0.39,\n  \"2022-02-17\": 0.37,\n  \"2022-02-18\": 0.35,\n  \"2022-02-22\": 0.39,\n  \"2022-02-23\": 0.36,\n  \"2022-02-24\": 0.33,\n  \"2022-02-25\": 0.33,\n  \"2022-02-28\": 0.37,\n  \"2022-03-01\": 0.32,\n  \"2022-03-02\": 0.33,\n  \"2022-03-03\": 0.37,\n  \"2022-03-04\": 0.33,\n  \"2022-03-07\": 0.38,\n  \"2022-03-08\": 0.36,\n  \"2022-03-09\": 0.38,\n  \"2022-03-10\": 0.38,\n  \"2022-03-11\": 0.39,\n  \"2022-03-14\": 0.45,\n  \"2022-03-15\": 0.46,\n  \"2022-03-16\": 0.43,\n  \"2022-03-17\": 0.40,\n  \"2022-03-18\": 0.41,\n  \"2022-03-21\": 0.55,\n  \"2022-03-22\": 0.51,\n  \"2022-03-23\": 0.50,\n  \"2022-03-24\": 0.50,\n  \"2022-03-25\": 0.53,\n  \"2022-03-28\": 0.60,\n  \"2022-03-29\": 0.56,\n  \"2022-03-30\": 0.55,\n  \"2022-03-31\": 0.51,\n  \"2022-04-01\": 0.52,\n  \"2022-04-04\": 0.67,\n  \"2022-04-05\": 0.65,\n  \"2022-04-06\": 0.67,\n  \"2022-04-07\": 0.68,\n  \"2022-04-08\": 0.69,\n  \"2022-04-11\": 0.78,\n  \"2022-04-12\": 0.74,\n  \"2022-04-13\": 0.75,\n  \"2022-04-14\": 0.78,\n  \"2022-04-18\": 0.82,\n  \"2022-04-19\": 0.82,\n  \"2022-04-20\": 0.82,\n  \"2022-04-21\": 0.82,\n  \"2022-04-22\": 0.82,\n  \"2022-04-25\": 0.93,\n  \"2022-04-26\": 0.84,\n  \"2022-04-27\": 0.82,\n  \"2022-04-28\": 0.81,\n  \"2022-04-29\": 0.83,\n  \"2022-05-02\": 0.90,\n  \"2022-05-03\": 0.90,\n  \"2022-05-04\": 0.88,\n  \"2022-05-05\": 0.84,\n  \"2022-05-06\": 0.84,\n  \"2022-05-09\": 0.92,\n  \"2022-05-10\": 0.89,\n  \"2022-05-11\": 0.90,\n  \"2022-05-12\": 0.95,\n  \"2022-05-13\": 1.01,\n  \"2022-05-16\": 1.07,\n  \"2022-05-17\": 1.06,\n  \"2022-05-18\": 1.02,\n  \"2022-05-19\": 1.04,\n  \"2022-05-20\": 1.01,\n  \"2022-05-23\": 1.07,\n  \"2022-05-24\": 1.05,\n  \"2022-05-25\": 1.05,\n  \"2022-05-26\": 1.06,\n  \"2022-05-27\": 1.06,\n  \"2022-05-31\": 1.13,\n  \"2022-06-01\": 1.12,\n  \"2022-06-02\": 1.13,\n  \"2022-06-03\": 1.17,\n  \"2022-06-06\": 1.23,\n  \"2022-06-07\": 1.24,\n  \"2022-06-08\": 1.25,\n  \"2022-06-09\": 1.26,\n  \"2022-06-10\": 1.34,\n  \"2022-06-13\": 1.69,\n  \"2022-06-14\": 1.78,\n  \"2022-06-15\": 1.69,\n  \"2022-06-16\": 1.54,\n  \"2022-06-17\": 1.58,\n  \"2022-06-21\": 1.66,\n  \"2022-06-22\": 1.57,\n  \"2022-06-23\": 1.59,\n  \"2022-06-24\": 1.66,\n  \"2022-06-27\": 1.75,\n  \"2022-06-28\": 1.75,\n  \"2022-06-29\": 1.73,\n  \"2022-06-30\": 1.66,\n  \"2022-07-01\": 1.66,\n  \"2022-07-05\": 1.86,\n  \"2022-07-06\": 1.85,\n  \"2022-07-07\": 1.89,\n  \"2022-07-08\": 1.91,\n  \"2022-07-11\": 2.13,\n  \"2022-07-12\": 2.16,\n  \"2022-07-13\": 2.33,\n  \"2022-07-14\": 2.33,\n  \"2022-07-15\": 2.29,\n  \"2022-07-18\": 2.44,\n  \"2022-07-19\": 2.46,\n  \"2022-07-20\": 2.44,\n  \"2022-07-21\": 2.40,\n  \"2022-07-22\": 2.41,\n  \"2022-07-25\": 2.55,\n  \"2022-07-26\": 2.48,\n  \"2022-07-27\": 2.37,\n  \"2022-07-28\": 2.35,\n  \"2022-07-29\": 2.34,\n  \"2022-08-01\": 2.48,\n  \"2022-08-02\": 2.48,\n  \"2022-08-03\": 2.44,\n  \"2022-08-04\": 2.41,\n  \"2022-08-05\": 2.48,\n  \"2022-08-08\": 2.57,\n  \"2022-08-09\": 2.58,\n  \"2022-08-10\": 2.56,\n  \"2022-08-11\": 2.52,\n  \"2022-08-12\": 2.53,\n  \"2022-08-15\": 2.63,\n  \"2022-08-16\": 2.61,\n  \"2022-08-17\": 2.59,\n  \"2022-08-18\": 2.61,\n  \"2022-08-19\": 2.64,\n  \"2022-08-22\": 2.74,\n  \"2022-08-23\": 2.71,\n  \"2022-08-24\": 2.73,\n  \"2022-08-25\": 2.78,\n  \"2022-08-26\": 2.78,\n  \"2022-08-29\": 2.89,\n  \"2022-08-30\": 2.88,\n  \"2022-08-31\": 2.87,\n  \"2022-09-01\": 2.88,\n  \"2022-09-02\": 2.85,\n  \"2022-09-06\": 2.96,\n  \"2022-09-07\": 2.98,\n  \"2022-09-08\": 2.97,\n  \"2022-09-09\": 2.98,\n  \"2022-09-12\": 3.09,\n  \"2022-09-13\": 3.19,\n  \"2022-09-14\": 3.14,\n  \"2022-09-15\": 3.12,\n  \"2022-09-16\": 3.10,\n  \"2022-09-19\": 3.29,\n  \"2022-09-20\": 3.26,\n  \"2022-09-21\": 3.21,\n  \"2022-09-22\": 3.19,\n  \"2022-09-23\": 3.12,\n  \"2022-09-26\": 3.30,\n  \"2022-09-27\": 3.26,\n  \"2022-09-28\": 3.29,\n  \"2022-09-29\": 3.26,\n  \"2022-09-30\": 3.22,\n  \"2022-10-03\": 3.34,\n  \"2022-10-04\": 3.32,\n  \"2022-10-05\": 3.33,\n  \"2022-10-06\": 3.32,\n  \"2022-10-07\": 3.31,\n  \"2022-10-11\": 3.53,\n  \"2022-10-12\": 3.56,\n  \"2022-10-13\": 3.64,\n  \"2022-10-14\": 3.65,\n  \"2022-10-17\": 3.82,\n  \"2022-10-18\": 3.89,\n  \"2022-10-19\": 3.91,\n  \"2022-10-20\": 3.91,\n  \"2022-10-21\": 3.90,\n  \"2022-10-24\": 4.00,\n  \"2022-10-25\": 3.97,\n  \"2022-10-26\": 3.94,\n  \"2022-10-27\": 3.95,\n  \"2022-10-28\": 3.99,\n  \"2022-10-31\": 4.06,\n  \"2022-11-01\": 4.06,\n  \"2022-11-02\": 4.04,\n  \"2022-11-03\": 4.06,\n  \"2022-11-04\": 4.02,\n  \"2022-11-07\": 4.12,\n  \"2022-11-08\": 4.10,\n  \"2022-11-09\": 4.11,\n  \"2022-11-10\": 4.09,\n  \"2022-11-14\": 4.16,\n  \"2022-11-15\": 4.14,\n  \"2022-11-16\": 4.14,\n  \"2022-11-17\": 4.13,\n  \"2022-11-18\": 4.15,\n  \"2022-11-21\": 4.23,\n  \"2022-11-22\": 4.21,\n  \"2022-11-23\": 4.21,\n  \"2022-11-25\": 4.22,\n  \"2022-11-28\": 4.30,\n  \"2022-11-29\": 4.27,\n  \"2022-11-30\": 4.27,\n  \"2022-12-01\": 4.22,\n  \"2022-12-02\": 4.22,\n  \"2022-12-05\": 4.27,\n  \"2022-12-06\": 4.27,\n  \"2022-12-07\": 4.20,\n  \"2022-12-08\": 4.17,\n  \"2022-12-09\": 4.19,\n  \"2022-12-12\": 4.29,\n  \"2022-12-13\": 4.26,\n  \"2022-12-14\": 4.23,\n  \"2022-12-15\": 4.22,\n  \"2022-12-16\": 4.20,\n  \"2022-12-19\": 4.28,\n  \"2022-12-20\": 4.25,\n  \"2022-12-21\": 4.22,\n  \"2022-12-22\": 4.24,\n  \"2022-12-23\": 4.23,\n  \"2022-12-27\": 4.35,\n  \"2022-12-28\": 4.35,\n  \"2022-12-29\": 4.34,\n  \"2022-12-30\": 4.30,\n  \"2023-01-03\": 4.40,\n  \"2023-01-04\": 4.41,\n  \"2023-01-05\": 4.51,\n  \"2023-01-06\": 4.51,\n  \"2023-01-09\": 4.55,\n  \"2023-01-10\": 4.57,\n  \"2023-01-11\": 4.57,\n  \"2023-01-12\": 4.50,\n  \"2023-01-13\": 4.51,\n  \"2023-01-17\": 4.56,\n  \"2023-01-18\": 4.54,\n  \"2023-01-19\": 4.55,\n  \"2023-01-20\": 4.57,\n  \"2023-01-23\": 4.58,\n  \"2023-01-24\": 4.57,\n  \"2023-01-25\": 4.56,\n  \"2023-01-26\": 4.55,\n  \"2023-01-27\": 4.57,\n  \"2023-01-30\": 4.59,\n  \"2023-01-31\": 4.58,\n  \"2023-02-01\": 4.54,\n  \"2023-02-02\": 4.53,\n  \"2023-02-03\": 4.57,\n  \"2023-02-06\": 4.59,\n  \"2023-02-07\": 4.59,\n  \"2023-02-08\": 4.59,\n  \"2023-02-09\": 4.64,\n  \"2023-02-10\": 4.66,\n  \"2023-02-13\": 4.68,\n  \"2023-02-14\": 4.67,\n  \"2023-02-15\": 4.66,\n  \"2023-02-16\": 4.70,\n  \"2023-02-17\": 4.70,\n  \"2023-02-21\": 4.72,\n  \"2023-02-22\": 4.71,\n  \"2023-02-23\": 4.71,\n  \"2023-02-24\": 4.72,\n  \"2023-02-27\": 4.74,\n  \"2023-02-28\": 4.72,\n  \"2023-03-01\": 4.73,\n  \"2023-03-02\": 4.74,\n  \"2023-03-03\": 4.74,\n  \"2023-03-06\": 4.76,\n  \"2023-03-07\": 4.87,\n  \"2023-03-08\": 4.89,\n  \"2023-03-09\": 4.87,\n  \"2023-03-10\": 4.83,\n  \"2023-03-13\": 4.70,\n  \"2023-03-14\": 4.71,\n  \"2023-03-15\": 4.59,\n  \"2023-03-16\": 4.57,\n  \"2023-03-17\": 4.36,\n  \"2023-03-20\": 4.65,\n  \"2023-03-21\": 4.62,\n  \"2023-03-22\": 4.63,\n  \"2023-03-23\": 4.57,\n  \"2023-03-24\": 4.57,\n  \"2023-03-27\": 4.75,\n  \"2023-03-28\": 4.64,\n  \"2023-03-29\": 4.64,\n  \"2023-03-30\": 4.80,\n  \"2023-03-31\": 4.68,\n  \"2023-04-03\": 4.77,\n  \"2023-04-04\": 4.74,\n  \"2023-04-05\": 4.72,\n  \"2023-04-06\": 4.77,\n  \"2023-04-07\": 4.81,\n  \"2023-04-10\": 4.94,\n  \"2023-04-11\": 4.89,\n  \"2023-04-12\": 4.87,\n  \"2023-04-13\": 4.95,\n  \"2023-04-14\": 4.98,\n  \"2023-04-17\": 5.06,\n  \"2023-04-18\": 5.04,\n  \"2023-04-19\": 5.01,\n  \"2023-04-20\": 4.97,\n  \"2023-04-21\": 4.98,\n  \"2023-04-24\": 5.04,\n  \"2023-04-25\": 4.97,\n  \"2023-04-26\": 5.00,\n  \"2023-04-27\": 5.03,\n  \"2023-04-28\": 4.95,\n  \"2023-05-01\": 5.10,\n  \"2023-05-02\": 5.08,\n  \"2023-05-03\": 5.09,\n  \"2023-05-04\": 5.10,\n  \"2023-05-05\": 5.10,\n  \"2023-05-08\": 5.15,\n  \"2023-05-09\": 5.13,\n  \"2023-05-10\": 5.08,\n  \"2023-05-11\": 5.04,\n  \"2023-05-12\": 5.08,\n  \"2023-05-15\": 5.06,\n  \"2023-05-16\": 5.07,\n  \"2023-05-17\": 5.10,\n  \"2023-05-18\": 5.14,\n  \"2023-05-19\": 5.12,\n  \"2023-05-22\": 5.24,\n  \"2023-05-23\": 5.18,\n  \"2023-05-24\": 5.21,\n  \"2023-05-25\": 5.21,\n  \"2023-05-26\": 5.16,\n  \"2023-05-30\": 5.28,\n  \"2023-05-31\": 5.26,\n  \"2023-06-01\": 5.24,\n  \"2023-06-02\": 5.23,\n  \"2023-06-05\": 5.20,\n  \"2023-06-06\": 5.18,\n  \"2023-06-07\": 5.16,\n  \"2023-06-08\": 5.12,\n  \"2023-06-09\": 5.11,\n  \"2023-06-12\": 5.14,\n  \"2023-06-13\": 5.11,\n  \"2023-06-14\": 5.10,\n  \"2023-06-15\": 5.07,\n  \"2023-06-16\": 5.09,\n  \"2023-06-20\": 5.14,\n  \"2023-06-21\": 5.15,\n  \"2023-06-22\": 5.15,\n  \"2023-06-23\": 5.15,\n  \"2023-06-26\": 5.24,\n  \"2023-06-27\": 5.19,\n  \"2023-06-28\": 5.18,\n  \"2023-06-29\": 5.20,\n  \"2023-06-30\": 5.17,\n  \"2023-07-03\": 5.21,\n  \"2023-07-05\": 5.21,\n  \"2023-07-06\": 5.23,\n  \"2023-07-07\": 5.22,\n  \"2023-07-10\": 5.25,\n  \"2023-07-11\": 5.25,\n  \"2023-07-12\": 5.24,\n  \"2023-07-13\": 5.24,\n  \"2023-07-14\": 5.25,\n  \"2023-07-17\": 5.26,\n  \"2023-07-18\": 5.25,\n  \"2023-07-19\": 5.26,\n  \"2023-07-20\": 5.26,\n  \"2023-07-21\": 5.27,\n  \"2023-07-24\": 5.28,\n  \"2023-07-25\": 5.28,\n  \"2023-07-26\": 5.28,\n  \"2023-07-27\": 5.28,\n  \"2023-07-28\": 5.28,\n  \"2023-07-31\": 5.28,\n  \"2023-08-01\": 5.27,\n  \"2023-08-02\": 5.27,\n  \"2023-08-03\": 5.27,\n  \"2023-08-04\": 5.28,\n  \"2023-08-07\": 5.29,\n  \"2023-08-08\": 5.30,\n  \"2023-08-09\": 5.28,\n  \"2023-08-10\": 5.28,\n  \"2023-08-11\": 5.28,\n  \"2023-08-14\": 5.29,\n  \"2023-08-15\": 5.29,\n  \"2023-08-16\": 5.29,\n  \"2023-08-17\": 5.29,\n  \"2023-08-18\": 5.28,\n  \"2023-08-21\": 5.30,\n  \"2023-08-22\": 5.30,\n  \"2023-08-23\": 5.30,\n  \"2023-08-24\": 5.31,\n  \"2023-08-25\": 5.34,\n  \"2023-08-28\": 5.34,\n  \"2023-08-29\": 5.33,\n  \"2023-08-30\": 5.32,\n  \"2023-08-31\": 5.32,\n  \"2023-09-01\": 5.30,\n  \"2023-09-05\": 5.32,\n  \"2023-09-06\": 5.31,\n  \"2023-09-07\": 5.30,\n  \"2023-09-08\": 5.31,\n  \"2023-09-11\": 5.32,\n  \"2023-09-12\": 5.32,\n  \"2023-09-13\": 5.31,\n  \"2023-09-14\": 5.31,\n  \"2023-09-15\": 5.32,\n  \"2023-09-18\": 5.31,\n  \"2023-09-19\": 5.31,\n  \"2023-09-20\": 5.33,\n  \"2023-09-21\": 5.33,\n  \"2023-09-22\": 5.32,\n  \"2023-09-25\": 5.35,\n  \"2023-09-26\": 5.34,\n  \"2023-09-27\": 5.34,\n  \"2023-09-28\": 5.32,\n  \"2023-09-29\": 5.32,\n  \"2023-10-02\": 5.35,\n  \"2023-10-03\": 5.35,\n  \"2023-10-04\": 5.34,\n  \"2023-10-05\": 5.34,\n  \"2023-10-06\": 5.36,\n  \"2023-10-10\": 5.34,\n  \"2023-10-11\": 5.34,\n  \"2023-10-12\": 5.35,\n  \"2023-10-13\": 5.35,\n  \"2023-10-16\": 5.34,\n  \"2023-10-17\": 5.35,\n  \"2023-10-18\": 5.34,\n  \"2023-10-19\": 5.33,\n  \"2023-10-20\": 5.31,\n  \"2023-10-23\": 5.32,\n  \"2023-10-24\": 5.31,\n  \"2023-10-25\": 5.32,\n  \"2023-10-26\": 5.32,\n  \"2023-10-27\": 5.32,\n  \"2023-10-30\": 5.33,\n  \"2023-10-31\": 5.33,\n  \"2023-11-01\": 5.31,\n  \"2023-11-02\": 5.28,\n  \"2023-11-03\": 5.27,\n  \"2023-11-06\": 5.29,\n  \"2023-11-07\": 5.28,\n  \"2023-11-08\": 5.28,\n  \"2023-11-09\": 5.27,\n  \"2023-11-10\": 5.26,\n  \"2023-11-13\": 5.28,\n  \"2023-11-14\": 5.26,\n  \"2023-11-15\": 5.26,\n  \"2023-11-16\": 5.25,\n  \"2023-11-17\": 5.25,\n  \"2023-11-20\": 5.27,\n  \"2023-11-21\": 5.26,\n  \"2023-11-22\": 5.27,\n  \"2023-11-24\": 5.28,\n  \"2023-11-27\": 5.28,\n  \"2023-11-28\": 5.27,\n  \"2023-11-29\": 5.25,\n  \"2023-11-30\": 5.25,\n  \"2023-12-01\": 5.23,\n  \"2023-12-04\": 5.26,\n  \"2023-12-05\": 5.25,\n  \"2023-12-06\": 5.25,\n  \"2023-12-07\": 5.24,\n  \"2023-12-08\": 5.24,\n  \"2023-12-11\": 5.26,\n  \"2023-12-12\": 5.26,\n  \"2023-12-13\": 5.24,\n  \"2023-12-14\": 5.23,\n  \"2023-12-15\": 5.24,\n  \"2023-12-18\": 5.26,\n  \"2023-12-19\": 5.23,\n  \"2023-12-20\": 5.24,\n  \"2023-12-21\": 5.22,\n  \"2023-12-22\": 5.24,\n  \"2023-12-26\": 5.25,\n  \"2023-12-27\": 5.24,\n  \"2023-12-28\": 5.25,\n  \"2023-12-29\": 5.20,\n  \"2024-01-02\": 5.22,\n  \"2024-01-03\": 5.24,\n  \"2024-01-04\": 5.24,\n  \"2024-01-05\": 5.24,\n  \"2024-01-08\": 5.25,\n  \"2024-01-09\": 5.24,\n  \"2024-01-10\": 5.23,\n  \"2024-01-11\": 5.23,\n  \"2024-01-12\": 5.22,\n  \"2024-01-16\": 5.22,\n  \"2024-01-17\": 5.24,\n  \"2024-01-18\": 5.22,\n  \"2024-01-19\": 5.22,\n  \"2024-01-22\": 5.22,\n  \"2024-01-23\": 5.21,\n  \"2024-01-24\": 5.21,\n  \"2024-01-25\": 5.21,\n  \"2024-01-26\": 5.21,\n  \"2024-01-29\": 5.22,\n  \"2024-01-30\": 5.21,\n  \"2024-01-31\": 5.22,\n  \"2024-02-01\": 5.22,\n  \"2024-02-02\": 5.23,\n  \"2024-02-05\": 5.22,\n  \"2024-02-06\": 5.23,\n  \"2024-02-07\": 5.23,\n  \"2024-02-08\": 5.23,\n  \"2024-02-09\": 5.24,\n  \"2024-02-12\": 5.23,\n  \"2024-02-13\": 5.25,\n  \"2024-02-14\": 5.23,\n  \"2024-02-15\": 5.23,\n  \"2024-02-16\": 5.24,\n  \"2024-02-20\": 5.24,\n  \"2024-02-21\": 5.24,\n  \"2024-02-22\": 5.25,\n  \"2024-02-23\": 5.26,\n  \"2024-02-26\": 5.26,\n  \"2024-02-27\": 5.25,\n  \"2024-02-28\": 5.24,\n  \"2024-02-29\": 5.25,\n  \"2024-03-01\": 5.23,\n  \"2024-03-04\": 5.24,\n  \"2024-03-05\": 5.23,\n  \"2024-03-06\": 5.24,\n  \"2024-03-07\": 5.24,\n  \"2024-03-08\": 5.24,\n  \"2024-03-11\": 5.24,\n  \"2024-03-12\": 5.25,\n  \"2024-03-13\": 5.25,\n  \"2024-03-14\": 5.25,\n  \"2024-03-15\": 5.25,\n  \"2024-03-18\": 5.25,\n  \"2024-03-19\": 5.24,\n  \"2024-03-20\": 5.24,\n  \"2024-03-21\": 5.25,\n  \"2024-03-22\": 5.24,\n  \"2024-03-25\": 5.23,\n  \"2024-03-26\": 5.22,\n  \"2024-03-27\": 5.22,\n  \"2024-03-28\": 5.23,\n  \"2024-04-01\": 5.23,\n  \"2024-04-02\": 5.22,\n  \"2024-04-03\": 5.22,\n  \"2024-04-04\": 5.21,\n  \"2024-04-05\": 5.23,\n  \"2024-04-08\": 5.23,\n  \"2024-04-09\": 5.23,\n  \"2024-04-10\": 5.25,\n  \"2024-04-11\": 5.25,\n  \"2024-04-12\": 5.25,\n  \"2024-04-15\": 5.25,\n  \"2024-04-16\": 5.25,\n  \"2024-04-17\": 5.25,\n  \"2024-04-18\": 5.25,\n  \"2024-04-19\": 5.25,\n  \"2024-04-22\": 5.22,\n  \"2024-04-23\": 5.25,\n  \"2024-04-24\": 5.26,\n  \"2024-04-25\": 5.26,\n  \"2024-04-26\": 5.25,\n  \"2024-04-29\": 5.25,\n  \"2024-04-30\": 5.25,\n  \"2024-05-01\": 5.26,\n  \"2024-05-02\": 5.25,\n  \"2024-05-03\": 5.25,\n  \"2024-05-06\": 5.25,\n  \"2024-05-07\": 5.25,\n  \"2024-05-08\": 5.25,\n  \"2024-05-09\": 5.25,\n  \"2024-05-10\": 5.26,\n  \"2024-05-13\": 5.25,\n  \"2024-05-14\": 5.24,\n  \"2024-05-15\": 5.25,\n  \"2024-05-16\": 5.25,\n  \"2024-05-17\": 5.25,\n  \"2024-05-20\": 5.25,\n  \"2024-05-21\": 5.25,\n  \"2024-05-22\": 5.25,\n  \"2024-05-23\": 5.26,\n  \"2024-05-24\": 5.26,\n  \"2024-05-28\": 5.26,\n  \"2024-05-29\": 5.26,\n  \"2024-05-30\": 5.26,\n  \"2024-05-31\": 5.25,\n  \"2024-06-03\": 5.26,\n  \"2024-06-04\": 5.25,\n  \"2024-06-05\": 5.25,\n  \"2024-06-06\": 5.25,\n  \"2024-06-07\": 5.26,\n  \"2024-06-10\": 5.25,\n  \"2024-06-11\": 5.25,\n  \"2024-06-12\": 5.25,\n  \"2024-06-13\": 5.25,\n  \"2024-06-14\": 5.25,\n  \"2024-06-17\": 5.25,\n  \"2024-06-18\": 5.24,\n  \"2024-06-20\": 5.24,\n  \"2024-06-21\": 5.23,\n  \"2024-06-24\": 5.24,\n  \"2024-06-25\": 5.23,\n  \"2024-06-26\": 5.24,\n  \"2024-06-27\": 5.23,\n  \"2024-06-28\": 5.22,\n  \"2024-07-01\": 5.24,\n  \"2024-07-02\": 5.24,\n  \"2024-07-03\": 5.24,\n  \"2024-07-05\": 5.23,\n  \"2024-07-08\": 5.23,\n  \"2024-07-09\": 5.23,\n  \"2024-07-10\": 5.23,\n  \"2024-07-11\": 5.21,\n  \"2024-07-12\": 5.21,\n  \"2024-07-15\": 5.20,\n  \"2024-07-16\": 5.20,\n  \"2024-07-17\": 5.20,\n  \"2024-07-18\": 5.21,\n  \"2024-07-19\": 5.20,\n  \"2024-07-22\": 5.19,\n  \"2024-07-23\": 5.18,\n  \"2024-07-24\": 5.18,\n  \"2024-07-25\": 5.17,\n  \"2024-07-26\": 5.16,\n  \"2024-07-29\": 5.15,\n  \"2024-07-30\": 5.14,\n  \"2024-07-31\": 5.15,\n  \"2024-08-01\": 5.12,\n  \"2024-08-02\": 5.05,\n  \"2024-08-05\": 5.09,\n  \"2024-08-06\": 5.09,\n  \"2024-08-07\": 5.09,\n  \"2024-08-08\": 5.09,\n  \"2024-08-09\": 5.09,\n  \"2024-08-12\": 5.07,\n  \"2024-08-13\": 5.06,\n  \"2024-08-14\": 5.07,\n  \"2024-08-15\": 5.09,\n  \"2024-08-16\": 5.08,\n  \"2024-08-19\": 5.06,\n  \"2024-08-20\": 5.04,\n  \"2024-08-21\": 5.02,\n  \"2024-08-22\": 5.04,\n  \"2024-08-23\": 5.01,\n  \"2024-08-26\": 4.98,\n  \"2024-08-27\": 4.98,\n  \"2024-08-28\": 4.96,\n  \"2024-08-29\": 4.98,\n  \"2024-08-30\": 4.98,\n  \"2024-09-03\": 4.97,\n  \"2024-09-04\": 4.96,\n  \"2024-09-05\": 4.94,\n  \"2024-09-06\": 4.93,\n  \"2024-09-09\": 4.89,\n  \"2024-09-10\": 4.85,\n  \"2024-09-11\": 4.89,\n  \"2024-09-12\": 4.85,\n  \"2024-09-13\": 4.78,\n  \"2024-09-16\": 4.75,\n  \"2024-09-17\": 4.75,\n  \"2024-09-18\": 4.65,\n  \"2024-09-19\": 4.61,\n  \"2024-09-20\": 4.56,\n  \"2024-09-23\": 4.53,\n  \"2024-09-24\": 4.50,\n  \"2024-09-25\": 4.51,\n  \"2024-09-26\": 4.50,\n  \"2024-09-27\": 4.50,\n  \"2024-09-30\": 4.52,\n  \"2024-10-01\": 4.50,\n  \"2024-10-02\": 4.48,\n  \"2024-10-03\": 4.48,\n  \"2024-10-04\": 4.53,\n  \"2024-10-07\": 4.55,\n  \"2024-10-08\": 4.53,\n  \"2024-10-09\": 4.54,\n  \"2024-10-10\": 4.54,\n  \"2024-10-11\": 4.53,\n  \"2024-10-15\": 4.52,\n  \"2024-10-16\": 4.51,\n  \"2024-10-17\": 4.54,\n  \"2024-10-18\": 4.53,\n  \"2024-10-21\": 4.51,\n  \"2024-10-22\": 4.51,\n  \"2024-10-23\": 4.52,\n  \"2024-10-24\": 4.50,\n  \"2024-10-25\": 4.52,\n  \"2024-10-28\": 4.49,\n  \"2024-10-29\": 4.49,\n  \"2024-10-30\": 4.47,\n  \"2024-10-31\": 4.44,\n  \"2024-11-01\": 4.41,\n  \"2024-11-04\": 4.44,\n  \"2024-11-05\": 4.43,\n  \"2024-11-06\": 4.44,\n  \"2024-11-07\": 4.43,\n  \"2024-11-08\": 4.43,\n  \"2024-11-12\": 4.43,\n  \"2024-11-13\": 4.40,\n  \"2024-11-14\": 4.41,\n  \"2024-11-15\": 4.41,\n  \"2024-11-18\": 4.42,\n  \"2024-11-19\": 4.41,\n  \"2024-11-20\": 4.42,\n  \"2024-11-21\": 4.43,\n  \"2024-11-22\": 4.43,\n  \"2024-11-25\": 4.42,\n  \"2024-11-26\": 4.40,\n  \"2024-11-27\": 4.40,\n  \"2024-11-29\": 4.39,\n  \"2024-12-02\": 4.38,\n  \"2024-12-03\": 4.36,\n  \"2024-12-04\": 4.35,\n  \"2024-12-05\": 4.34,\n  \"2024-12-06\": 4.31,\n  \"2024-12-09\": 4.30,\n  \"2024-12-10\": 4.29,\n  \"2024-12-11\": 4.26,\n  \"2024-12-12\": 4.23,\n  \"2024-12-13\": 4.23,\n  \"2024-12-16\": 4.25,\n  \"2024-12-17\": 4.26,\n  \"2024-12-18\": 4.25,\n  \"2024-12-19\": 4.23,\n  \"2024-12-20\": 4.23,\n  \"2024-12-23\": 4.24,\n  \"2024-12-24\": 4.28,\n  \"2024-12-26\": 4.24,\n  \"2024-12-27\": 4.19,\n  \"2024-12-30\": 4.23,\n  \"2024-12-31\": 4.23,\n  \"2025-01-02\": 4.22,\n  \"2025-01-03\": 4.20,\n  \"2025-01-06\": 4.21,\n  \"2025-01-07\": 4.21,\n  \"2025-01-08\": 4.21,\n  \"2025-01-09\": 4.21,\n  \"2025-01-10\": 4.22,\n  \"2025-01-13\": 4.23,\n  \"2025-01-14\": 4.22,\n  \"2025-01-15\": 4.21,\n  \"2025-01-16\": 4.21,\n  \"2025-01-17\": 4.20,\n  \"2025-01-21\": 4.22,\n  \"2025-01-22\": 4.22,\n  \"2025-01-23\": 4.22,\n  \"2025-01-24\": 4.21,\n  \"2025-01-27\": 4.20,\n  \"2025-01-28\": 4.20,\n  \"2025-01-29\": 4.20,\n  \"2025-01-30\": 4.19,\n  \"2025-01-31\": 4.20,\n  \"2025-02-03\": 4.22,\n  \"2025-02-04\": 4.22,\n  \"2025-02-05\": 4.22,\n  \"2025-02-06\": 4.22,\n  \"2025-02-07\": 4.24,\n  \"2025-02-10\": 4.23,\n  \"2025-02-11\": 4.23,\n  \"2025-02-12\": 4.23,\n  \"2025-02-13\": 4.22,\n  \"2025-02-14\": 4.22,\n  \"2025-02-18\": 4.23,\n  \"2025-02-19\": 4.22,\n  \"2025-02-20\": 4.21,\n  \"2025-02-21\": 4.21,\n  \"2025-02-24\": 4.19,\n  \"2025-02-25\": 4.19,\n  \"2025-02-26\": 4.20,\n  \"2025-02-27\": 4.20,\n  \"2025-02-28\": 4.20,\n  \"2025-03-03\": 4.21,\n  \"2025-03-04\": 4.20,\n  \"2025-03-05\": 4.21,\n  \"2025-03-06\": 4.20,\n  \"2025-03-07\": 4.20,\n  \"2025-03-10\": 4.19,\n  \"2025-03-11\": 4.20,\n  \"2025-03-12\": 4.21,\n  \"2025-03-13\": 4.20,\n  \"2025-03-14\": 4.20,\n  \"2025-03-17\": 4.20,\n  \"2025-03-18\": 4.20,\n  \"2025-03-19\": 4.20,\n  \"2025-03-20\": 4.19,\n  \"2025-03-21\": 4.19,\n  \"2025-03-24\": 4.19,\n  \"2025-03-25\": 4.19,\n  \"2025-03-26\": 4.20,\n  \"2025-03-27\": 4.20,\n  \"2025-03-28\": 4.20,\n  \"2025-03-31\": 4.21,\n  \"2025-04-01\": 4.20,\n  \"2025-04-02\": 4.21,\n  \"2025-04-03\": 4.20,\n  \"2025-04-04\": 4.17,\n  \"2025-04-07\": 4.17,\n  \"2025-04-08\": 4.19,\n  \"2025-04-09\": 4.24,\n  \"2025-04-10\": 4.22,\n  \"2025-04-11\": 4.23,\n  \"2025-04-14\": 4.22,\n  \"2025-04-15\": 4.22,\n  \"2025-04-16\": 4.21,\n  \"2025-04-17\": 4.23,\n  \"2025-04-21\": 4.22,\n  \"2025-04-22\": 4.22,\n  \"2025-04-23\": 4.22,\n  \"2025-04-24\": 4.21,\n  \"2025-04-25\": 4.21,\n  \"2025-04-28\": 4.20,\n  \"2025-04-29\": 4.20,\n  \"2025-04-30\": 4.20,\n  \"2025-05-01\": 4.20,\n  \"2025-05-02\": 4.22,\n  \"2025-05-05\": 4.22,\n  \"2025-05-06\": 4.22,\n  \"2025-05-07\": 4.22,\n  \"2025-05-08\": 4.23,\n  \"2025-05-09\": 4.22,\n  \"2025-05-12\": 4.31,\n  \"2025-05-13\": 4.29,\n  \"2025-05-14\": 4.29,\n  \"2025-05-15\": 4.27,\n  \"2025-05-16\": 4.25,\n  \"2025-05-19\": 4.28,\n  \"2025-05-20\": 4.26,\n  \"2025-05-21\": 4.24,\n  \"2025-05-22\": 4.25,\n  \"2025-05-23\": 4.24,\n  \"2025-05-27\": 4.24,\n  \"2025-05-28\": 4.24,\n  \"2025-05-29\": 4.25,\n  \"2025-05-30\": 4.25,\n  \"2025-06-02\": 4.25,\n  \"2025-06-03\": 4.24,\n  \"2025-06-04\": 4.25,\n  \"2025-06-05\": 4.25,\n  \"2025-06-06\": 4.25,\n  \"2025-06-09\": 4.25,\n  \"2025-06-10\": 4.26,\n  \"2025-06-11\": 4.26,\n  \"2025-06-12\": 4.27,\n  \"2025-06-13\": 4.26,\n  \"2025-06-16\": 4.24,\n  \"2025-06-17\": 4.23,\n  \"2025-06-18\": 4.23,\n  \"2025-06-20\": 4.21,\n  \"2025-06-23\": 4.19,\n  \"2025-06-24\": 4.19,\n  \"2025-06-25\": 4.19,\n  \"2025-06-26\": 4.21,\n  \"2025-06-27\": 4.20,\n  \"2025-06-30\": 4.24,\n  \"2025-07-01\": 4.24,\n  \"2025-07-02\": 4.24,\n  \"2025-07-03\": 4.26,\n  \"2025-07-07\": 4.26,\n  \"2025-07-08\": 4.26,\n  \"2025-07-09\": 4.26,\n  \"2025-07-10\": 4.25,\n  \"2025-07-11\": 4.25,\n  \"2025-07-14\": 4.26,\n  \"2025-07-15\": 4.25,\n  \"2025-07-16\": 4.24,\n  \"2025-07-17\": 4.24,\n  \"2025-07-18\": 4.24,\n  \"2025-07-21\": 4.24,\n  \"2025-07-22\": 4.24,\n  \"2025-07-23\": 4.25,\n  \"2025-07-24\": 4.25,\n  \"2025-07-25\": 4.25,\n  \"2025-07-28\": 4.24,\n  \"2025-07-29\": 4.24,\n  \"2025-07-30\": 4.25,\n  \"2025-07-31\": 4.24,\n  \"2025-08-01\": 4.19,\n  \"2025-08-04\": 4.16,\n  \"2025-08-05\": 4.16,\n  \"2025-08-06\": 4.14,\n  \"2025-08-07\": 4.14,\n  \"2025-08-08\": 4.14,\n  \"2025-08-11\": 4.15,\n  \"2025-08-12\": 4.14,\n  \"2025-08-13\": 4.11,\n  \"2025-08-14\": 4.12,\n  \"2025-08-15\": 4.12,\n  \"2025-08-18\": 4.14,\n  \"2025-08-19\": 4.12,\n  \"2025-08-20\": 4.12,\n  \"2025-08-21\": 4.14,\n  \"2025-08-22\": 4.10,\n  \"2025-08-25\": 4.10,\n  \"2025-08-26\": 4.10,\n  \"2025-08-27\": 4.08,\n  \"2025-08-28\": 4.08,\n  \"2025-08-29\": 4.05,\n  \"2025-09-02\": 4.05,\n  \"2025-09-03\": 4.03,\n  \"2025-09-04\": 4.01,\n  \"2025-09-05\": 3.92,\n  \"2025-09-08\": 3.95,\n  \"2025-09-09\": 3.95,\n  \"2025-09-10\": 3.94,\n  \"2025-09-11\": 3.94,\n  \"2025-09-12\": 3.94,\n  \"2025-09-15\": 3.91,\n  \"2025-09-16\": 3.90,\n  \"2025-09-17\": 3.88,\n  \"2025-09-18\": 3.89,\n  \"2025-09-19\": 3.89,\n  \"2025-09-22\": 3.86,\n  \"2025-09-23\": 3.86,\n  \"2025-09-24\": 3.87,\n  \"2025-09-25\": 3.89,\n  \"2025-09-26\": 3.87,\n  \"2025-09-29\": 3.86,\n  \"2025-09-30\": 3.86,\n  \"2025-10-01\": 3.85,\n  \"2025-10-02\": 3.86,\n  \"2025-10-03\": 3.87,\n  \"2025-10-06\": 3.86,\n  \"2025-10-07\": 3.85,\n  \"2025-10-08\": 3.85,\n  \"2025-10-09\": 3.87,\n  \"2025-10-10\": 3.86,\n  \"2025-10-14\": 3.85,\n  \"2025-10-15\": 3.87,\n  \"2025-10-16\": 3.86,\n  \"2025-10-17\": 3.84,\n  \"2025-10-20\": 3.81,\n  \"2025-10-21\": 3.80,\n  \"2025-10-22\": 3.80,\n  \"2025-10-23\": 3.80,\n  \"2025-10-24\": 3.77,\n  \"2025-10-27\": 3.73,\n  \"2025-10-28\": 3.73,\n  \"2025-10-29\": 3.77,\n  \"2025-10-30\": 3.76,\n  \"2025-10-31\": 3.73,\n  \"2025-11-03\": 3.82,\n  \"2025-11-04\": 3.80,\n  \"2025-11-05\": 3.80,\n  \"2025-11-06\": 3.77,\n  \"2025-11-07\": 3.77,\n  \"2025-11-10\": 3.79,\n  \"2025-11-12\": 3.79,\n  \"2025-11-13\": 3.80,\n  \"2025-11-14\": 3.80,\n  \"2025-11-17\": 3.80,\n  \"2025-11-18\": 3.78,\n  \"2025-11-19\": 3.79,\n  \"2025-11-20\": 3.78,\n  \"2025-11-21\": 3.75,\n  \"2025-11-24\": 3.75,\n  \"2025-11-25\": 3.74,\n  \"2025-11-26\": 3.76,\n  \"2025-11-28\": 3.73,\n  \"2025-12-01\": 3.71,\n  \"2025-12-02\": 3.68,\n  \"2025-12-03\": 3.64,\n  \"2025-12-04\": 3.63,\n  \"2025-12-05\": 3.62,\n  \"2025-12-08\": 3.64,\n  \"2025-12-09\": 3.64,\n  \"2025-12-10\": 3.60,\n  \"2025-12-11\": 3.58,\n  \"2025-12-12\": 3.54,\n  \"2025-12-15\": 3.56,\n  \"2025-12-16\": 3.56,\n  \"2025-12-17\": 3.55,\n  \"2025-12-18\": 3.53,\n  \"2025-12-19\": 3.54,\n  \"2025-12-22\": 3.56,\n  \"2025-12-23\": 3.56,\n  \"2025-12-24\": 3.60,\n  \"2025-12-26\": 3.56,\n  \"2025-12-29\": 3.57,\n  \"2025-12-30\": 3.55,\n  \"2025-12-31\": 3.57,\n  // 2026\n  \"2026-01-02\": 3.54,\n  \"2026-01-03\": 3.54,\n  \"2026-01-06\": 3.53,\n  \"2026-01-07\": 3.52,\n  \"2026-01-08\": 3.52,\n  \"2026-01-09\": 3.52,\n  \"2026-01-10\": 3.56,\n  \"2026-01-13\": 3.57,\n  \"2026-01-14\": 3.57,\n  \"2026-01-15\": 3.57,\n  \"2026-01-16\": 3.57,\n  \"2026-01-20\": 3.59,\n  \"2026-01-21\": 3.59,\n  \"2026-01-22\": 3.60,\n  \"2026-01-23\": 3.59,\n  \"2026-01-26\": 3.59,\n  \"2026-01-27\": 3.58,\n  \"2026-01-28\": 3.59,\n  \"2026-01-29\": 3.59,\n  \"2026-01-30\": 3.58,\n  \"2026-02-02\": 3.60,\n  \"2026-02-03\": 3.60,\n  \"2026-02-04\": 3.60,\n  \"2026-02-05\": 3.59,\n  \"2026-02-06\": 3.60,\n  \"2026-02-09\": 3.60,\n  \"2026-02-10\": 3.60,\n  \"2026-02-11\": 3.61,\n  \"2026-02-12\": 3.61,\n};\n","/**\n * Risk-Free Rate Lookup Utility\n *\n * Provides date-based lookup for 3-month Treasury bill rates,\n * used as the risk-free rate in Sharpe/Sortino ratio calculations.\n *\n * Data source: FRED DTB3 series (Federal Reserve Economic Data)\n * Rates are stored as annual percentages (e.g., 4.32 = 4.32% annual)\n */\n\nimport { TREASURY_RATES } from \"../data/treasury-rates\";\n\n// Cache sorted keys for efficient lookup\nlet sortedKeys: string[] | null = null;\n\n/**\n * Get all rate date keys sorted in ascending order\n */\nfunction getSortedKeys(): string[] {\n  if (!sortedKeys) {\n    sortedKeys = Object.keys(TREASURY_RATES).sort();\n  }\n  return sortedKeys;\n}\n\n/**\n * Format a Date object to YYYY-MM-DD string key\n * Uses the date's local values (not UTC) to match US Eastern timezone handling\n */\nexport function formatDateToKey(date: Date): string {\n  const year = date.getFullYear();\n  const month = String(date.getMonth() + 1).padStart(2, \"0\");\n  const day = String(date.getDate()).padStart(2, \"0\");\n  return `${year}-${month}-${day}`;\n}\n\n/**\n * Parse a YYYY-MM-DD string to a Date object\n * Creates date in local timezone (matching project convention for US Eastern time)\n */\nfunction parseKeyToDate(key: string): Date {\n  const [year, month, day] = key.split(\"-\").map(Number);\n  return new Date(year, month - 1, day);\n}\n\n/**\n * Get the risk-free rate (3-month T-bill rate) for a given date.\n *\n * Lookup behavior:\n * - If exact date exists in data, returns that rate\n * - If date is a weekend/holiday (no data), returns most recent prior trading day's rate\n * - If date is before data range, returns earliest available rate\n * - If date is after data range, returns latest available rate\n *\n * @param date - The date to look up the rate for\n * @returns Annual risk-free rate as a percentage (e.g., 4.32 for 4.32%)\n */\nexport function getRiskFreeRate(date: Date): number {\n  const keys = getSortedKeys();\n  const dateKey = formatDateToKey(date);\n\n  // Direct lookup first (most common case for trading days)\n  if (TREASURY_RATES[dateKey] !== undefined) {\n    return TREASURY_RATES[dateKey];\n  }\n\n  // Date is before our data range - return earliest rate\n  if (dateKey < keys[0]) {\n    return TREASURY_RATES[keys[0]];\n  }\n\n  // Date is after our data range - return latest rate\n  if (dateKey > keys[keys.length - 1]) {\n    return TREASURY_RATES[keys[keys.length - 1]];\n  }\n\n  // Date is within range but not found (weekend/holiday)\n  // Binary search to find the nearest prior trading day\n  let left = 0;\n  let right = keys.length - 1;\n\n  while (left < right) {\n    const mid = Math.floor((left + right + 1) / 2);\n    if (keys[mid] <= dateKey) {\n      left = mid;\n    } else {\n      right = mid - 1;\n    }\n  }\n\n  // Return the rate from the most recent prior trading day\n  return TREASURY_RATES[keys[left]];\n}\n\n/**\n * Get the earliest date that has rate data available.\n *\n * @returns Date object for the first available rate date\n */\nexport function getEarliestRateDate(): Date {\n  const keys = getSortedKeys();\n  return parseKeyToDate(keys[0]);\n}\n\n/**\n * Get the latest date that has rate data available.\n *\n * @returns Date object for the last available rate date\n */\nexport function getLatestRateDate(): Date {\n  const keys = getSortedKeys();\n  return parseKeyToDate(keys[keys.length - 1]);\n}\n\n/**\n * Get the date range of available rate data.\n *\n * @returns Object with start and end dates\n */\nexport function getRateDataRange(): { start: Date; end: Date } {\n  return {\n    start: getEarliestRateDate(),\n    end: getLatestRateDate(),\n  };\n}\n\n/**\n * Get the total number of rate entries in the dataset.\n * Useful for data validation and reporting.\n *\n * @returns Number of daily rate entries\n */\nexport function getRateEntryCount(): number {\n  return getSortedKeys().length;\n}\n\n/**\n * Get the risk-free rate for a date specified as a YYYY-MM-DD string key.\n * Avoids Date parsing issues by working directly with string keys.\n *\n * @param dateKey - The date as YYYY-MM-DD string\n * @returns Annual risk-free rate as a percentage (e.g., 4.32 for 4.32%)\n */\nexport function getRiskFreeRateByKey(dateKey: string): number {\n  const keys = getSortedKeys();\n\n  // Direct lookup first (most common case for trading days)\n  if (TREASURY_RATES[dateKey] !== undefined) {\n    return TREASURY_RATES[dateKey];\n  }\n\n  // Date is before our data range - return earliest rate\n  if (dateKey < keys[0]) {\n    return TREASURY_RATES[keys[0]];\n  }\n\n  // Date is after our data range - return latest rate\n  if (dateKey > keys[keys.length - 1]) {\n    return TREASURY_RATES[keys[keys.length - 1]];\n  }\n\n  // Date is within range but not found (weekend/holiday)\n  // Binary search to find the nearest prior trading day\n  let left = 0;\n  let right = keys.length - 1;\n\n  while (left < right) {\n    const mid = Math.floor((left + right + 1) / 2);\n    if (keys[mid] <= dateKey) {\n      left = mid;\n    } else {\n      right = mid - 1;\n    }\n  }\n\n  // Return the rate from the most recent prior trading day\n  return TREASURY_RATES[keys[left]];\n}\n","/**\n * Portfolio Statistics Calculator\n *\n * Calculates comprehensive portfolio statistics from trade data.\n * Based on legacy Python implementation for consistency.\n * Uses math.js for statistical calculations to ensure numpy compatibility.\n *\n * Key improvements for consistency:\n * - Sharpe Ratio: Uses sample std (N-1) via math.js 'uncorrected' parameter\n * - Sortino Ratio: Uses standard downside deviation = sqrt((1/N) * sum(min(excess_i, 0)^2))\n *   where N = total observations (RMS of negative excess returns from zero, not std of negatives)\n * - Mean calculations: Replaced manual reduce operations with math.js mean()\n * - Min/Max calculations: Using math.js min/max functions\n * - Daily returns: Fixed to use previous day's portfolio value as denominator\n *\n * This ensures our calculations match the legacy Python implementation exactly.\n */\n\nimport { std, mean, min, max } from 'mathjs'\nimport { Trade } from '../models/trade'\nimport { DailyLogEntry } from '../models/daily-log'\nimport { PortfolioStats, StrategyStats, AnalysisConfig } from '../models/portfolio-stats'\nimport type { NormalizedPortfolioStats } from '../models/portfolio-stats-normalized'\nimport { asDecimal01 } from '../types/percentage'\nimport { getRiskFreeRate } from '../utils/risk-free-rate'\n\n/**\n * Daily return with associated date for date-based risk-free rate calculations.\n * Used by Sharpe and Sortino ratio calculations.\n */\ninterface DailyReturnWithDate {\n  date: Date\n  return: number\n}\n\n/**\n * Default analysis configuration\n */\nexport const DEFAULT_ANALYSIS_CONFIG: AnalysisConfig = {\n  useBusinessDaysOnly: true,\n  annualizationFactor: 252, // Business days\n  confidenceLevel: 0.95,\n  drawdownThreshold: 0.05,\n}\n\n/**\n * Portfolio statistics calculator\n */\nexport class PortfolioStatsCalculator {\n  private config: AnalysisConfig\n\n  constructor(config: Partial<AnalysisConfig> = {}) {\n    this.config = { ...DEFAULT_ANALYSIS_CONFIG, ...config }\n  }\n\n  /**\n   * Calculate comprehensive portfolio statistics\n   */\n  calculatePortfolioStats(trades: Trade[], dailyLogEntries?: DailyLogEntry[], isStrategyFiltered = false): PortfolioStats {\n    if (trades.length === 0) {\n      return this.getEmptyStats()\n    }\n\n    // Filter out invalid trades and handle errors\n    const validTrades = trades.filter(trade => {\n      try {\n        // Check for required fields\n        if (typeof trade.pl !== 'number' || isNaN(trade.pl)) return false\n        if (!trade.dateOpened) return false\n\n        // Validate date\n        const date = new Date(trade.dateOpened)\n        if (isNaN(date.getTime())) return false\n\n        // Check commissions\n        if (typeof trade.openingCommissionsFees !== 'number' || isNaN(trade.openingCommissionsFees)) return false\n        if (typeof trade.closingCommissionsFees !== 'number' || isNaN(trade.closingCommissionsFees)) return false\n\n        return true\n      } catch {\n        return false\n      }\n    })\n\n    if (validTrades.length === 0) {\n      return this.getEmptyStats()\n    }\n\n    // For strategy-filtered analysis, we CANNOT use daily logs because they represent\n    // the full portfolio performance. Strategy filtering must use trade-based calculations only.\n    const adjustedDailyLogs = isStrategyFiltered\n      ? undefined  // Force trade-based calculations for strategy filtering\n      : dailyLogEntries\n\n    // Debug logging removed for tests\n\n    // Basic statistics\n    const totalTrades = validTrades.length\n    const totalPl = validTrades.map(trade => trade.pl).reduce((sum, pl) => sum + pl, 0)\n    const totalCommissions = validTrades.reduce(\n      (sum, trade) => sum + trade.openingCommissionsFees + trade.closingCommissionsFees,\n      0\n    )\n    const netPl = totalPl - totalCommissions\n\n    // Win/Loss analysis\n    const winningTradesList = validTrades.filter(trade => trade.pl > 0)\n    const losingTradesList = validTrades.filter(trade => trade.pl < 0)\n    const breakEvenTradesList = validTrades.filter(trade => trade.pl === 0)\n\n    const winRate = winningTradesList.length / totalTrades\n    const avgWin = winningTradesList.length > 0\n      ? mean(winningTradesList.map(trade => trade.pl)) as number\n      : 0\n    const avgLoss = losingTradesList.length > 0\n      ? mean(losingTradesList.map(trade => trade.pl)) as number\n      : 0\n\n    // Max win/loss - handle empty arrays\n    const plValues = validTrades.map(trade => trade.pl).filter(pl => typeof pl === 'number' && !isNaN(pl))\n    const maxWin = plValues.length > 0 && winningTradesList.length > 0 ? max(plValues.filter(pl => pl > 0)) as number : 0\n    const maxLoss = plValues.length > 0 && losingTradesList.length > 0 ? min(plValues.filter(pl => pl < 0)) as number : 0\n\n    // Profit factor (gross profit / gross loss)\n    const grossProfit = winningTradesList.reduce((sum, trade) => sum + trade.pl, 0)\n    const grossLoss = Math.abs(losingTradesList.reduce((sum, trade) => sum + trade.pl, 0))\n    const profitFactor = grossLoss > 0 ? grossProfit / grossLoss : grossProfit > 0 ? Infinity : 0\n\n    // Drawdown calculation\n    const maxDrawdown = this.calculateMaxDrawdown(validTrades, adjustedDailyLogs)\n\n    // Daily P/L calculation\n    const avgDailyPl = this.calculateAvgDailyPl(validTrades, adjustedDailyLogs)\n\n    // Sharpe ratio (if we have daily data)\n    const sharpeRatio = this.calculateSharpeRatio(validTrades, adjustedDailyLogs)\n\n    // Advanced metrics\n    const cagr = this.calculateCAGR(validTrades)\n    const sortinoRatio = this.calculateSortinoRatio(validTrades, adjustedDailyLogs)\n    const calmarRatio = this.calculateCalmarRatio(validTrades, adjustedDailyLogs)\n    const kellyPercentage = this.calculateKellyPercentage(validTrades)\n\n    // Streak calculations\n    const streaks = this.calculateStreaks(validTrades)\n\n    // Time in drawdown\n    const timeInDrawdown = this.calculateTimeInDrawdown(validTrades, adjustedDailyLogs)\n\n    // Periodic win rates\n    const periodicWinRates = this.calculatePeriodicWinRates(validTrades)\n\n    // Calculate initial capital (prefer daily logs when available)\n    const initialCapital = PortfolioStatsCalculator.calculateInitialCapital(validTrades, adjustedDailyLogs)\n\n    return {\n      totalTrades,\n      totalPl,\n      winningTrades: winningTradesList.length,\n      losingTrades: losingTradesList.length,\n      breakEvenTrades: breakEvenTradesList.length,\n      winRate,\n      avgWin,\n      avgLoss,\n      maxWin,\n      maxLoss,\n      sharpeRatio,\n      sortinoRatio,\n      calmarRatio,\n      cagr,\n      kellyPercentage,\n      maxWinStreak: streaks.maxWinStreak,\n      maxLossStreak: streaks.maxLossStreak,\n      currentStreak: streaks.currentStreak,\n      timeInDrawdown,\n      monthlyWinRate: periodicWinRates.monthlyWinRate,\n      weeklyWinRate: periodicWinRates.weeklyWinRate,\n      maxDrawdown,\n      avgDailyPl,\n      totalCommissions,\n      netPl,\n      profitFactor,\n      initialCapital,\n    }\n  }\n\n  /**\n   * Calculate strategy-specific statistics\n   */\n  calculateStrategyStats(trades: Trade[]): Record<string, StrategyStats> {\n    if (trades.length === 0) {\n      return {}\n    }\n\n    // Group trades by strategy\n    const tradesByStrategy = trades.reduce((acc, trade) => {\n      const strategy = trade.strategy || 'Unknown'\n      if (!acc[strategy]) {\n        acc[strategy] = []\n      }\n      acc[strategy].push(trade)\n      return acc\n    }, {} as Record<string, Trade[]>)\n\n    // Calculate stats for each strategy\n    const strategyStats: Record<string, StrategyStats> = {}\n\n    Object.entries(tradesByStrategy).forEach(([strategyName, strategyTrades]) => {\n      const portfolioStats = this.calculatePortfolioStats(strategyTrades)\n\n      // Calculate average DTE if available\n      const avgDte = this.calculateAvgDTE(strategyTrades)\n\n      strategyStats[strategyName] = {\n        strategyName,\n        tradeCount: strategyTrades.length,\n        totalPl: portfolioStats.totalPl,\n        winRate: portfolioStats.winRate,\n        avgWin: portfolioStats.avgWin,\n        avgLoss: portfolioStats.avgLoss,\n        maxWin: portfolioStats.maxWin,\n        maxLoss: portfolioStats.maxLoss,\n        avgDte,\n        successRate: portfolioStats.winRate, // Assuming success rate = win rate for now\n        profitFactor: portfolioStats.profitFactor,\n      }\n    })\n\n    return strategyStats\n  }\n\n  /**\n   * Calculate maximum drawdown\n   */\n  private calculateMaxDrawdown(trades: Trade[], dailyLogEntries?: DailyLogEntry[]): number {\n    // If we have daily log data, use it for more accurate drawdown\n    if (dailyLogEntries && dailyLogEntries.length > 0) {\n      // Match legacy: take absolute value of each drawdown, then find maximum\n      let maxDrawdown = 0.0\n\n      for (const entry of dailyLogEntries) {\n        // Daily log contains percentage values (e.g., -5.55), same as legacy Python\n        const drawdownPct = Math.abs(entry.drawdownPct || 0)  // Make sure it's positive\n        maxDrawdown = Math.max(maxDrawdown, drawdownPct)\n      }\n\n      return maxDrawdown\n    }\n\n    // Otherwise calculate from trade data using legacy methodology\n    if (trades.length === 0) return 0\n\n    // Filter to only closed trades that have fundsAtClose data\n    const closedTrades = trades.filter(trade => trade.dateClosed && trade.fundsAtClose !== undefined)\n\n    if (closedTrades.length === 0) return 0\n\n    // Sort trades by close date and time (legacy methodology)\n    const sortedTrades = [...closedTrades].sort((a, b) => {\n      try {\n        const dateA = new Date(a.dateClosed!)\n        const dateB = new Date(b.dateClosed!)\n\n        // Check for valid dates\n        if (isNaN(dateA.getTime()) || isNaN(dateB.getTime())) {\n          return 0\n        }\n\n        const dateCompare = dateA.getTime() - dateB.getTime()\n        if (dateCompare !== 0) return dateCompare\n        return (a.timeClosed || '').localeCompare(b.timeClosed || '')\n      } catch {\n        return 0\n      }\n    })\n\n    // Calculate initial capital using existing helper for consistency\n    let initialCapital = PortfolioStatsCalculator.calculateInitialCapital(sortedTrades)\n    if (!isFinite(initialCapital) || initialCapital <= 0) {\n      initialCapital = sortedTrades[0].fundsAtClose - sortedTrades[0].pl\n    }\n\n    // Build an end-of-day equity series so intraday sequencing doesn't inflate drawdowns\n    let runningEquity = initialCapital\n    const dailyEquity: Array<{ date: string; equity: number }> = []\n\n    sortedTrades.forEach(trade => {\n      const equity = isFinite(trade.fundsAtClose)\n        ? trade.fundsAtClose\n        : runningEquity + trade.pl\n\n      runningEquity = equity\n\n      const closeDate = new Date(trade.dateClosed as Date)\n      const isoDate = closeDate.toISOString()\n      const dayKey = isoDate.slice(0, 10)\n\n      const lastPoint = dailyEquity[dailyEquity.length - 1]\n      if (lastPoint && lastPoint.date.slice(0, 10) === dayKey) {\n        dailyEquity[dailyEquity.length - 1] = { date: isoDate, equity }\n      } else {\n        dailyEquity.push({ date: isoDate, equity })\n      }\n    })\n\n    let peak = initialCapital\n    let maxDrawdown = 0\n\n    for (const point of dailyEquity) {\n      if (point.equity > peak) {\n        peak = point.equity\n      }\n\n      if (peak > 0) {\n        const drawdown = (peak - point.equity) / peak * 100\n        maxDrawdown = Math.max(maxDrawdown, drawdown)\n      }\n    }\n\n    return maxDrawdown\n  }\n\n  /**\n   * Calculate average daily P/L\n   */\n  private calculateAvgDailyPl(trades: Trade[], dailyLogEntries?: DailyLogEntry[]): number {\n    // Use daily log data if available\n    if (dailyLogEntries && dailyLogEntries.length > 0) {\n      const totalDailyPl = dailyLogEntries.reduce((sum, entry) => sum + entry.dailyPl, 0)\n      return totalDailyPl / dailyLogEntries.length\n    }\n\n    // Otherwise calculate from trades\n    if (trades.length === 0) return 0\n\n    // Group trades by date\n    const dailyPl = new Map<string, number>()\n\n    trades.forEach(trade => {\n      try {\n        const date = new Date(trade.dateOpened)\n        if (!isNaN(date.getTime())) {\n          const dateKey = date.toISOString().split('T')[0]\n          const currentPl = dailyPl.get(dateKey) || 0\n          dailyPl.set(dateKey, currentPl + trade.pl)\n        }\n      } catch {\n        // Skip invalid dates\n      }\n    })\n\n    if (dailyPl.size === 0) return 0\n\n    const totalDailyPl = Array.from(dailyPl.values()).reduce((sum, pl) => sum + pl, 0)\n    return totalDailyPl / dailyPl.size\n  }\n\n  /**\n   * Calculate Sharpe ratio using date-based Treasury rates.\n   *\n   * Uses historical 3-month T-bill rates from Phase 25 utility for each day's\n   * excess return calculation instead of a fixed rate.\n   *\n   * Formula: (mean(excessReturns) / std(returns)) * sqrt(252)\n   * Where excessReturn[i] = return[i] - (getRiskFreeRate(date[i]) / 100 / 252)\n   */\n  private calculateSharpeRatio(trades: Trade[], dailyLogEntries?: DailyLogEntry[]): number | undefined {\n    // Get daily returns with dates for date-based risk-free rate lookup\n    const dailyReturnsWithDates = this.calculateDailyReturnsWithDates(trades, dailyLogEntries)\n\n    if (dailyReturnsWithDates.length < 2) return undefined\n\n    // Calculate excess returns using per-day Treasury rates\n    const excessReturns: number[] = []\n\n    for (const { date, return: dailyReturn } of dailyReturnsWithDates) {\n      // Get the actual Treasury rate for this specific date\n      const annualRate = getRiskFreeRate(date) // Returns annual % (e.g., 4.32 for 4.32%)\n      const dailyRiskFreeRate = annualRate / 100 / this.config.annualizationFactor\n\n      excessReturns.push(dailyReturn - dailyRiskFreeRate)\n    }\n\n    // Calculate Sharpe ratio using math.js for statistical consistency\n    // With date-varying risk-free rates, we must use std of excess returns (not raw returns)\n    // because std(rawReturns) != std(excessReturns) when rates change materially\n    const avgExcessReturn = mean(excessReturns) as number\n    const stdDev = std(excessReturns, 'uncorrected') as number // Use sample std (N-1) of excess returns\n\n    if (stdDev === 0) return undefined\n\n    // Annualize the Sharpe ratio\n    const sharpeRatio = (avgExcessReturn / stdDev) * Math.sqrt(this.config.annualizationFactor)\n\n    return sharpeRatio\n  }\n\n  /**\n   * Calculate average days to expiration (DTE)\n   */\n  private calculateAvgDTE(trades: Trade[]): number | undefined {\n    const tradesWithDTE = trades.filter(trade =>\n      trade.dateClosed && trade.dateOpened\n    )\n\n    if (tradesWithDTE.length === 0) return undefined\n\n    const totalDTE = tradesWithDTE.reduce((sum, trade) => {\n      const openDate = new Date(trade.dateOpened)\n      const closeDate = new Date(trade.dateClosed!)\n      const dte = Math.ceil((closeDate.getTime() - openDate.getTime()) / (1000 * 60 * 60 * 24))\n      return sum + dte\n    }, 0)\n\n    return totalDTE / tradesWithDTE.length\n  }\n\n  /**\n   * Calculate Compound Annual Growth Rate (CAGR)\n   */\n  private calculateCAGR(trades: Trade[]): number | undefined {\n    if (trades.length === 0) return undefined\n\n    const sortedTrades = [...trades].sort((a, b) => {\n      const dateCompare = new Date(a.dateOpened).getTime() - new Date(b.dateOpened).getTime()\n      if (dateCompare !== 0) return dateCompare\n      return a.timeOpened.localeCompare(b.timeOpened)\n    })\n\n    const startDate = new Date(sortedTrades[0].dateOpened)\n    const endDate = new Date(sortedTrades[sortedTrades.length - 1].dateClosed || sortedTrades[sortedTrades.length - 1].dateOpened)\n    const totalYears = (endDate.getTime() - startDate.getTime()) / (1000 * 60 * 60 * 24 * 365.25)\n\n    if (totalYears <= 0) return undefined\n\n    const initialCapital = PortfolioStatsCalculator.calculateInitialCapital(trades)\n    const finalValue = initialCapital + trades.reduce((sum, trade) => sum + trade.pl, 0)\n\n    if (initialCapital <= 0 || finalValue <= 0) return undefined\n\n    const cagr = Math.pow(finalValue / initialCapital, 1 / totalYears) - 1\n    return cagr * 100  // Return as percentage\n  }\n\n  /**\n   * Calculate Sortino Ratio using date-based Treasury rates.\n   *\n   * Uses historical 3-month T-bill rates from Phase 25 utility for each day's\n   * excess return calculation instead of a fixed rate.\n   *\n   * Formula: (mean(excessReturns) / downsideDeviation) * sqrt(252)\n   * Where:\n   *   excessReturn[i] = return[i] - (getRiskFreeRate(date[i]) / 100 / 252)\n   *   downsideDeviation = sqrt( (1/N) * sum( min(excessReturn[i], 0)^2 ) )\n   *   N = total number of observations (all days, not just down days)\n   *\n   * The downside deviation is the RMS of negative excess returns from zero,\n   * computed over ALL observations (positive excess returns contribute 0).\n   * This differs from std(negativeReturns) which measures dispersion around\n   * the mean of negatives — that approach inflates Sortino by understating risk.\n   */\n  private calculateSortinoRatio(trades: Trade[], dailyLogEntries?: DailyLogEntry[]): number | undefined {\n    if (trades.length < 2) return undefined\n\n    // Get daily returns with dates for date-based risk-free rate lookup\n    const dailyReturnsWithDates = this.calculateDailyReturnsWithDates(trades, dailyLogEntries)\n    if (dailyReturnsWithDates.length < 2) return undefined\n\n    // Calculate excess returns using per-day Treasury rates\n    const excessReturns: number[] = []\n\n    for (const { date, return: dailyReturn } of dailyReturnsWithDates) {\n      // Get the actual Treasury rate for this specific date\n      const annualRate = getRiskFreeRate(date) // Returns annual % (e.g., 4.32 for 4.32%)\n      const dailyRiskFreeRate = annualRate / 100 / this.config.annualizationFactor\n\n      excessReturns.push(dailyReturn - dailyRiskFreeRate)\n    }\n\n    const avgExcessReturn = mean(excessReturns) as number\n\n    // Calculate downside deviation: RMS of negative excess returns from zero\n    // using ALL N observations. Positive excess returns contribute 0 to the sum.\n    const N = excessReturns.length\n    const sumSquaredDownside = excessReturns.reduce((sum, ret) => {\n      const downside = Math.min(ret, 0)\n      return sum + downside * downside\n    }, 0)\n\n    // If no negative excess returns, downside deviation is 0 — return undefined\n    if (sumSquaredDownside === 0) return undefined\n\n    const downsideDeviation = Math.sqrt(sumSquaredDownside / N)\n\n    // Check for near-zero downside deviation to prevent overflow\n    if (downsideDeviation < 1e-10) return undefined\n\n    const sortinoRatio = (avgExcessReturn / downsideDeviation) * Math.sqrt(this.config.annualizationFactor)\n\n    return sortinoRatio\n  }\n\n  /**\n   * Calculate Calmar Ratio\n   */\n  private calculateCalmarRatio(trades: Trade[], dailyLogEntries?: DailyLogEntry[]): number | undefined {\n    const cagr = this.calculateCAGR(trades)\n    const maxDrawdown = Math.abs(this.calculateMaxDrawdown(trades, dailyLogEntries))\n\n    if (!cagr || maxDrawdown === 0) return undefined\n\n    return cagr / maxDrawdown\n  }\n\n  /**\n   * Calculate Kelly Criterion Percentage\n   */\n  private calculateKellyPercentage(trades: Trade[]): number | undefined {\n    if (trades.length === 0) return undefined\n\n    const winningTrades = trades.filter(trade => trade.pl > 0)\n    const losingTrades = trades.filter(trade => trade.pl < 0)\n\n    if (winningTrades.length === 0 || losingTrades.length === 0) return undefined\n\n    const winRate = winningTrades.length / trades.length\n    const avgWin = winningTrades.reduce((sum, trade) => sum + trade.pl, 0) / winningTrades.length\n    const avgLoss = Math.abs(losingTrades.reduce((sum, trade) => sum + trade.pl, 0) / losingTrades.length)\n\n    if (avgLoss === 0) return undefined\n\n    const winLossRatio = avgWin / avgLoss\n    const kellyPercentage = (winRate * winLossRatio - (1 - winRate)) / winLossRatio\n\n    return kellyPercentage * 100  // Return as percentage\n  }\n\n  /**\n   * Calculate win/loss streaks\n   */\n  private calculateStreaks(trades: Trade[]): {\n    maxWinStreak: number\n    maxLossStreak: number\n    currentStreak: number\n  } {\n    if (trades.length === 0) {\n      return { maxWinStreak: 0, maxLossStreak: 0, currentStreak: 0 }\n    }\n\n    // Sort trades by date only (legacy methodology)\n    const sortedTrades = [...trades].sort((a, b) => {\n      return new Date(a.dateOpened).getTime() - new Date(b.dateOpened).getTime()\n    })\n\n    let maxWinStreak = 0\n    let maxLossStreak = 0\n    let currentWinStreak = 0\n    let currentLossStreak = 0\n\n    for (const trade of sortedTrades) {\n      if (trade.pl > 0) { // Winning trade\n        currentWinStreak++\n        currentLossStreak = 0\n        maxWinStreak = Math.max(maxWinStreak, currentWinStreak)\n      } else if (trade.pl < 0) { // Losing trade\n        currentLossStreak++\n        currentWinStreak = 0\n        maxLossStreak = Math.max(maxLossStreak, currentLossStreak)\n      } else { // Break-even trades (pl == 0) break both streaks (legacy behavior)\n        currentWinStreak = 0\n        currentLossStreak = 0\n      }\n    }\n\n    // Calculate current streak as the most recent active streak\n    const currentStreak = currentWinStreak > 0 ? currentWinStreak : currentLossStreak > 0 ? -currentLossStreak : 0\n\n    return { maxWinStreak, maxLossStreak, currentStreak }\n  }\n\n  /**\n   * Calculate time in drawdown\n   */\n  private calculateTimeInDrawdown(trades: Trade[], dailyLogEntries?: DailyLogEntry[]): number | undefined {\n    if (dailyLogEntries && dailyLogEntries.length > 0) {\n      const daysInDrawdown = dailyLogEntries.filter(entry => entry.drawdownPct < 0).length\n      return (daysInDrawdown / dailyLogEntries.length) * 100\n    }\n\n    // If no daily log, calculate from trade data using legacy methodology\n    if (trades.length === 0) return undefined\n\n    // Filter to only closed trades with fundsAtClose data (legacy approach)\n    const closedTrades = trades.filter(trade => trade.dateClosed && trade.fundsAtClose !== undefined)\n\n    if (closedTrades.length === 0) return undefined\n\n    // Sort by close date and time (legacy methodology)\n    const sortedTrades = [...closedTrades].sort((a, b) => {\n      try {\n        const dateA = new Date(a.dateClosed!)\n        const dateB = new Date(b.dateClosed!)\n\n        // Check for valid dates\n        if (isNaN(dateA.getTime()) || isNaN(dateB.getTime())) {\n          return 0\n        }\n\n        const dateCompare = dateA.getTime() - dateB.getTime()\n        if (dateCompare !== 0) return dateCompare\n        return (a.timeClosed || '').localeCompare(b.timeClosed || '')\n      } catch {\n        return 0\n      }\n    })\n\n    // Calculate initial capital from first trade\n    const firstTrade = sortedTrades[0]\n    const initialCapital = firstTrade.fundsAtClose - firstTrade.pl\n\n    // Track periods in drawdown (legacy methodology)\n    let peak = initialCapital\n    let periodsInDrawdown = 0\n    const totalPeriods = sortedTrades.length\n\n    for (const trade of sortedTrades) {\n      const portfolioValue = trade.fundsAtClose\n\n      // Update peak\n      if (portfolioValue > peak) {\n        peak = portfolioValue\n      }\n\n      // Count if currently in drawdown\n      if (portfolioValue < peak) {\n        periodsInDrawdown++\n      }\n    }\n\n    return totalPeriods > 0 ? (periodsInDrawdown / totalPeriods) * 100 : undefined\n  }\n\n  /**\n   * Calculate periodic win rates\n   */\n  private calculatePeriodicWinRates(trades: Trade[]): {\n    monthlyWinRate: number\n    weeklyWinRate: number\n  } {\n    if (trades.length === 0) {\n      return { monthlyWinRate: 0, weeklyWinRate: 0 }\n    }\n\n    // Group trades by month and week\n    const monthlyTrades = new Map<string, Trade[]>()\n    const weeklyTrades = new Map<string, Trade[]>()\n\n    for (const trade of trades) {\n      const date = new Date(trade.dateOpened)\n\n      // Monthly grouping (YYYY-MM)\n      const monthKey = `${date.getFullYear()}-${String(date.getMonth() + 1).padStart(2, '0')}`\n      if (!monthlyTrades.has(monthKey)) {\n        monthlyTrades.set(monthKey, [])\n      }\n      monthlyTrades.get(monthKey)!.push(trade)\n\n      // Weekly grouping (YYYY-WW)\n      const startOfYear = new Date(date.getFullYear(), 0, 1)\n      const weekNumber = Math.ceil(((date.getTime() - startOfYear.getTime()) / 86400000 + startOfYear.getDay() + 1) / 7)\n      const weekKey = `${date.getFullYear()}-${String(weekNumber).padStart(2, '0')}`\n      if (!weeklyTrades.has(weekKey)) {\n        weeklyTrades.set(weekKey, [])\n      }\n      weeklyTrades.get(weekKey)!.push(trade)\n    }\n\n    // Calculate monthly win rate\n    let profitableMonths = 0\n    for (const [, monthTrades] of monthlyTrades) {\n      const monthPl = monthTrades.reduce((sum, trade) => sum + trade.pl, 0)\n      if (monthPl > 0) profitableMonths++\n    }\n    const monthlyWinRate = monthlyTrades.size > 0 ? (profitableMonths / monthlyTrades.size) * 100 : 0\n\n    // Calculate weekly win rate\n    let profitableWeeks = 0\n    for (const [, weekTrades] of weeklyTrades) {\n      const weekPl = weekTrades.reduce((sum, trade) => sum + trade.pl, 0)\n      if (weekPl > 0) profitableWeeks++\n    }\n    const weeklyWinRate = weeklyTrades.size > 0 ? (profitableWeeks / weeklyTrades.size) * 100 : 0\n\n    return { monthlyWinRate, weeklyWinRate }\n  }\n\n  /**\n   * Calculate daily returns for advanced metrics\n   */\n  private calculateDailyReturns(trades: Trade[], dailyLogEntries?: DailyLogEntry[]): number[] {\n    // Use the new method and extract just the return values\n    return this.calculateDailyReturnsWithDates(trades, dailyLogEntries).map(r => r.return)\n  }\n\n  /**\n   * Calculate daily returns WITH associated dates for date-based risk-free rate calculations.\n   * Returns an array of {date, return} pairs where:\n   * - date: The trading day's date (for looking up that day's Treasury rate)\n   * - return: The portfolio return for that day as a decimal (e.g., 0.01 = 1%)\n   */\n  private calculateDailyReturnsWithDates(trades: Trade[], dailyLogEntries?: DailyLogEntry[]): DailyReturnWithDate[] {\n    if (dailyLogEntries && dailyLogEntries.length > 0) {\n      return dailyLogEntries.map(entry => {\n        // Calculate previous day's portfolio value (net liquidity minus today's P/L)\n        const previousValue = entry.netLiquidity - entry.dailyPl\n        const dailyReturn = previousValue > 0 ? entry.dailyPl / previousValue : 0\n        return {\n          date: new Date(entry.date),\n          return: dailyReturn\n        }\n      })\n    }\n\n    // Calculate from trade data\n    const sortedTrades = [...trades].sort((a, b) => {\n      const dateCompare = new Date(a.dateOpened).getTime() - new Date(b.dateOpened).getTime()\n      if (dateCompare !== 0) return dateCompare\n      return a.timeOpened.localeCompare(b.timeOpened)\n    })\n\n    const dailyReturns: DailyReturnWithDate[] = []\n    const tradesByDate = new Map<string, { date: Date; trades: Trade[] }>()\n\n    // Group trades by date\n    for (const trade of sortedTrades) {\n      const tradeDate = new Date(trade.dateOpened)\n      const dateKey = tradeDate.toISOString().split('T')[0]\n      if (!tradesByDate.has(dateKey)) {\n        tradesByDate.set(dateKey, { date: tradeDate, trades: [] })\n      }\n      tradesByDate.get(dateKey)!.trades.push(trade)\n    }\n\n    // Calculate daily returns with dates\n    const initialCapital = PortfolioStatsCalculator.calculateInitialCapital(trades)\n    let portfolioValue = initialCapital\n\n    // Sort by date key to ensure chronological order\n    const sortedDateKeys = Array.from(tradesByDate.keys()).sort()\n\n    for (const dateKey of sortedDateKeys) {\n      const { date, trades: dayTrades } = tradesByDate.get(dateKey)!\n      const dayPl = dayTrades.reduce((sum, trade) => sum + trade.pl, 0)\n      if (portfolioValue > 0) {\n        dailyReturns.push({\n          date,\n          return: dayPl / portfolioValue\n        })\n        portfolioValue += dayPl\n      }\n    }\n\n    return dailyReturns\n  }\n\n  /**\n   * Get empty statistics (for zero trades)\n   */\n  private getEmptyStats(): PortfolioStats {\n    return {\n      totalTrades: 0,\n      totalPl: 0,\n      winningTrades: 0,\n      losingTrades: 0,\n      breakEvenTrades: 0,\n      winRate: 0,\n      avgWin: 0,\n      avgLoss: 0,\n      maxWin: 0,\n      maxLoss: 0,\n      sharpeRatio: undefined,\n      sortinoRatio: undefined,\n      calmarRatio: undefined,\n      cagr: undefined,\n      kellyPercentage: undefined,\n      maxWinStreak: 0,\n      maxLossStreak: 0,\n      currentStreak: 0,\n      timeInDrawdown: undefined,\n      monthlyWinRate: 0,\n      weeklyWinRate: 0,\n      maxDrawdown: 0,\n      avgDailyPl: 0,\n      totalCommissions: 0,\n      netPl: 0,\n      profitFactor: 0,\n      initialCapital: 0,\n    }\n  }\n\n  /**\n   * Calculate initial capital from trades and/or daily logs\n   *\n   * @param trades - Trade data\n   * @param dailyLogEntries - Optional daily log entries (preferred when available)\n   * @returns Initial capital before any P/L\n   *\n   * When daily logs are provided, calculates: firstEntry.netLiquidity - firstEntry.dailyPl\n   * Otherwise, calculates: firstTrade.fundsAtClose - firstTrade.pl\n   */\n  static calculateInitialCapital(trades: Trade[], dailyLogEntries?: DailyLogEntry[]): number {\n    if (trades.length === 0) return 0\n\n    // Prefer daily log data when available for more accurate initial capital\n    if (dailyLogEntries && dailyLogEntries.length > 0) {\n      const sortedEntries = [...dailyLogEntries].sort((a, b) =>\n        new Date(a.date).getTime() - new Date(b.date).getTime()\n      )\n      const firstEntry = sortedEntries[0]\n      // Initial capital = Net Liquidity - Daily P/L\n      // This accounts for any P/L that occurred on the first day\n      return firstEntry.netLiquidity - firstEntry.dailyPl\n    }\n\n    // Fall back to trade-based calculation\n    // Sort trades chronologically\n    const sortedTrades = [...trades].sort((a, b) => {\n      const dateCompare = new Date(a.dateOpened).getTime() - new Date(b.dateOpened).getTime()\n      if (dateCompare !== 0) return dateCompare\n      return a.timeOpened.localeCompare(b.timeOpened)\n    })\n\n    const firstTrade = sortedTrades[0]\n    return firstTrade.fundsAtClose - firstTrade.pl\n  }\n\n  /**\n   * Calculate portfolio value at any point in time\n   */\n  static calculatePortfolioValueAtDate(trades: Trade[], targetDate: Date, initialCapital?: number): number {\n    if (initialCapital === undefined) {\n      initialCapital = this.calculateInitialCapital(trades)\n    }\n\n    const relevantTrades = trades.filter(trade => {\n      const tradeDate = new Date(trade.dateOpened)\n      return tradeDate <= targetDate\n    })\n\n    const totalPl = relevantTrades.reduce((sum, trade) => sum + trade.pl, 0)\n    return initialCapital + totalPl\n  }\n\n}\n\n/**\n * Convert PortfolioStats to NormalizedPortfolioStats.\n *\n * This function converts percentage fields (0-100) to decimal format (0-1)\n * for consistent handling in APIs and comparisons with Monte Carlo results.\n *\n * Fields converted from percentage to decimal:\n * - `maxDrawdown`: 12 → 0.12\n * - `timeInDrawdown`: 50 → 0.50\n *\n * Fields that are already decimal (no conversion needed):\n * - `winRate`, `cagr`, `monthlyWinRate`, `weeklyWinRate`\n *\n * @param stats - PortfolioStats with mixed unit conventions\n * @returns NormalizedPortfolioStats with all percentages as decimals\n *\n * @example\n * ```typescript\n * const stats = calculator.calculatePortfolioStats(trades)\n * const normalized = normalizePortfolioStats(stats)\n *\n * // Now safe to compare with Monte Carlo (both use decimals)\n * const mcMddMultiplier = mcStats.medianMaxDrawdown / normalized.maxDrawdown\n * ```\n */\nexport function normalizePortfolioStats(stats: PortfolioStats): NormalizedPortfolioStats {\n  return {\n    totalTrades: stats.totalTrades,\n    totalPl: stats.totalPl,\n    winningTrades: stats.winningTrades,\n    losingTrades: stats.losingTrades,\n    breakEvenTrades: stats.breakEvenTrades,\n    // winRate is already decimal in PortfolioStats\n    winRate: asDecimal01(stats.winRate),\n    avgWin: stats.avgWin,\n    avgLoss: stats.avgLoss,\n    maxWin: stats.maxWin,\n    maxLoss: stats.maxLoss,\n    sharpeRatio: stats.sharpeRatio,\n    sortinoRatio: stats.sortinoRatio,\n    calmarRatio: stats.calmarRatio,\n    // cagr is already decimal in PortfolioStats\n    cagr: stats.cagr !== undefined ? asDecimal01(stats.cagr) : undefined,\n    kellyPercentage: stats.kellyPercentage,\n    // maxDrawdown is PERCENTAGE in PortfolioStats, convert to decimal\n    maxDrawdown: asDecimal01(stats.maxDrawdown / 100),\n    avgDailyPl: stats.avgDailyPl,\n    totalCommissions: stats.totalCommissions,\n    netPl: stats.netPl,\n    profitFactor: stats.profitFactor,\n    initialCapital: stats.initialCapital,\n    maxWinStreak: stats.maxWinStreak,\n    maxLossStreak: stats.maxLossStreak,\n    currentStreak: stats.currentStreak,\n    // timeInDrawdown is PERCENTAGE in PortfolioStats, convert to decimal\n    timeInDrawdown: stats.timeInDrawdown !== undefined\n      ? asDecimal01(stats.timeInDrawdown / 100)\n      : undefined,\n    // These are already decimal in PortfolioStats\n    monthlyWinRate: stats.monthlyWinRate !== undefined\n      ? asDecimal01(stats.monthlyWinRate)\n      : undefined,\n    weeklyWinRate: stats.weeklyWinRate !== undefined\n      ? asDecimal01(stats.weeklyWinRate)\n      : undefined,\n  }\n}\n","/**\n * Performance Metrics Calculator\n *\n * Calculates performance data for charts and visualizations.\n * Based on legacy Python performance calculations.\n */\n\nimport { Trade } from '../models/trade'\nimport { DailyLogEntry } from '../models/daily-log'\nimport { PerformanceMetrics, TimePeriod } from '../models/portfolio-stats'\nimport { getRiskFreeRateByKey } from '../utils/risk-free-rate'\n\n/**\n * Performance calculator for chart data and visualizations\n */\nexport class PerformanceCalculator {\n  /**\n   * Calculate comprehensive performance metrics\n   */\n  // eslint-disable-next-line @typescript-eslint/no-unused-vars\n  static calculatePerformanceMetrics(trades: Trade[], _dailyLogEntries?: DailyLogEntry[]): PerformanceMetrics {\n    if (trades.length === 0) {\n      return {\n        cumulativePl: [],\n        drawdownData: [],\n        monthlyPl: {},\n        weeklyPl: {},\n        dailyPl: {},\n      }\n    }\n\n    // Sort trades chronologically\n    const sortedTrades = [...trades].sort((a, b) => {\n      const dateCompare = new Date(a.dateOpened).getTime() - new Date(b.dateOpened).getTime()\n      if (dateCompare !== 0) return dateCompare\n      return a.timeOpened.localeCompare(b.timeOpened)\n    })\n\n    // Calculate cumulative P/L\n    const cumulativePl = this.calculateCumulativePL(sortedTrades)\n\n    // Calculate drawdown data\n    const drawdownData = this.calculateDrawdownData(cumulativePl)\n\n    // Calculate aggregated P/L by time period\n    const dailyPl = this.aggregatePLByPeriod(sortedTrades, 'daily')\n    const weeklyPl = this.aggregatePLByPeriod(sortedTrades, 'weekly')\n    const monthlyPl = this.aggregatePLByPeriod(sortedTrades, 'monthly')\n\n    return {\n      cumulativePl,\n      drawdownData,\n      monthlyPl,\n      weeklyPl,\n      dailyPl,\n    }\n  }\n\n  /**\n   * Calculate cumulative P/L over time\n   */\n  private static calculateCumulativePL(sortedTrades: Trade[]): Array<{\n    date: string\n    cumulativePl: number\n    tradePl: number\n  }> {\n    const result: Array<{ date: string; cumulativePl: number; tradePl: number }> = []\n    let runningTotal = 0\n\n    // Group trades by date to handle multiple trades per day\n    const tradesByDate = new Map<string, Trade[]>()\n\n    sortedTrades.forEach(trade => {\n      const dateKey = new Date(trade.dateOpened).toISOString().split('T')[0]\n      if (!tradesByDate.has(dateKey)) {\n        tradesByDate.set(dateKey, [])\n      }\n      tradesByDate.get(dateKey)!.push(trade)\n    })\n\n    // Sort dates and calculate cumulative P/L\n    const sortedDates = Array.from(tradesByDate.keys()).sort()\n\n    sortedDates.forEach(date => {\n      const dayTrades = tradesByDate.get(date)!\n      const dayPl = dayTrades.reduce((sum, trade) => sum + trade.pl, 0)\n      runningTotal += dayPl\n\n      result.push({\n        date,\n        cumulativePl: runningTotal,\n        tradePl: dayPl,\n      })\n    })\n\n    return result\n  }\n\n  /**\n   * Calculate drawdown data for visualization\n   */\n  private static calculateDrawdownData(cumulativePl: Array<{ date: string; cumulativePl: number; tradePl: number }>): Array<{\n    date: string\n    drawdown: number\n    peak: number\n  }> {\n    const result: Array<{ date: string; drawdown: number; peak: number }> = []\n    let peak = 0\n\n    cumulativePl.forEach(entry => {\n      if (entry.cumulativePl > peak) {\n        peak = entry.cumulativePl\n      }\n\n      const drawdown = peak > 0 ? (entry.cumulativePl - peak) / peak : 0\n\n      result.push({\n        date: entry.date,\n        drawdown,\n        peak,\n      })\n    })\n\n    return result\n  }\n\n  /**\n   * Aggregate P/L by time period\n   */\n  private static aggregatePLByPeriod(trades: Trade[], period: TimePeriod): Record<string, number> {\n    const result: Record<string, number> = {}\n\n    trades.forEach(trade => {\n      const date = new Date(trade.dateOpened)\n      const key = this.getDateKey(date, period)\n\n      if (!result[key]) {\n        result[key] = 0\n      }\n      result[key] += trade.pl\n    })\n\n    return result\n  }\n\n  /**\n   * Generate date key for aggregation\n   */\n  private static getDateKey(date: Date, period: TimePeriod): string {\n    const year = date.getFullYear()\n    const month = date.getMonth() + 1\n    const day = date.getDate()\n\n    switch (period) {\n      case 'daily':\n        return `${year}-${String(month).padStart(2, '0')}-${String(day).padStart(2, '0')}`\n\n      case 'weekly':\n        const weekNumber = this.getWeekNumber(date)\n        return `${year}-W${String(weekNumber).padStart(2, '0')}`\n\n      case 'monthly':\n        return `${year}-${String(month).padStart(2, '0')}`\n\n      case 'yearly':\n        return year.toString()\n\n      default:\n        return date.toISOString().split('T')[0]\n    }\n  }\n\n  /**\n   * Get week number for a date\n   */\n  private static getWeekNumber(date: Date): number {\n    const d = new Date(Date.UTC(date.getFullYear(), date.getMonth(), date.getDate()))\n    const dayNum = d.getUTCDay() || 7\n    d.setUTCDate(d.getUTCDate() + 4 - dayNum)\n    const yearStart = new Date(Date.UTC(d.getUTCFullYear(), 0, 1))\n    return Math.ceil((((d.getTime() - yearStart.getTime()) / 86400000) + 1) / 7)\n  }\n\n  /**\n   * Calculate monthly returns (percentage)\n   */\n  static calculateMonthlyReturns(trades: Trade[], initialCapital?: number): Record<string, number> {\n    if (trades.length === 0) return {}\n\n    if (!initialCapital) {\n      const firstTrade = trades.sort((a, b) => new Date(a.dateOpened).getTime() - new Date(b.dateOpened).getTime())[0]\n      initialCapital = firstTrade.fundsAtClose - firstTrade.pl\n    }\n\n    const monthlyPl = this.aggregatePLByPeriod(trades, 'monthly')\n    const monthlyReturns: Record<string, number> = {}\n\n    let runningCapital = initialCapital\n    const sortedMonths = Object.keys(monthlyPl).sort()\n\n    sortedMonths.forEach(month => {\n      const monthPl = monthlyPl[month]\n      const monthReturn = runningCapital > 0 ? (monthPl / runningCapital) * 100 : 0\n      monthlyReturns[month] = monthReturn\n      runningCapital += monthPl\n    })\n\n    return monthlyReturns\n  }\n\n  /**\n   * Calculate rolling Sharpe ratio using date-based Treasury rates\n   */\n  static calculateRollingSharpe(\n    trades: Trade[],\n    windowDays: number = 30\n  ): Array<{ date: string; sharpe: number }> {\n    if (trades.length === 0) return []\n\n    const dailyPl = this.aggregatePLByPeriod(trades, 'daily')\n    const sortedDates = Object.keys(dailyPl).sort()\n\n    if (sortedDates.length < windowDays) return []\n\n    const result: Array<{ date: string; sharpe: number }> = []\n\n    for (let i = windowDays - 1; i < sortedDates.length; i++) {\n      const windowDates = sortedDates.slice(i - windowDays + 1, i + 1)\n      const windowReturns = windowDates.map(date => dailyPl[date])\n\n      // Calculate average excess returns using date-based Treasury rates\n      // Use getRiskFreeRateByKey to avoid UTC parsing issues with YYYY-MM-DD strings\n      const excessReturns = windowDates.map((date, idx) => {\n        const annualRate = getRiskFreeRateByKey(date) // Returns annual % (e.g., 4.32)\n        const dailyRiskFreeRate = annualRate / 100 / 252\n        return windowReturns[idx] - dailyRiskFreeRate\n      })\n\n      const avgExcessReturn = excessReturns.reduce((sum, ret) => sum + ret, 0) / excessReturns.length\n      // Use std of excess returns (not raw returns) for consistency with date-varying rates\n      const avgExcess = avgExcessReturn\n      const excessVariance = excessReturns.reduce((sum, ret) => sum + Math.pow(ret - avgExcess, 2), 0) / (excessReturns.length - 1)\n      const stdDev = Math.sqrt(excessVariance)\n\n      const sharpe = stdDev > 0 ? (avgExcessReturn / stdDev) * Math.sqrt(252) : 0\n\n      result.push({\n        date: sortedDates[i],\n        sharpe,\n      })\n    }\n\n    return result\n  }\n\n  /**\n   * Calculate win/loss streaks\n   */\n  static calculateStreaks(trades: Trade[]): {\n    longestWinStreak: number\n    longestLossStreak: number\n    currentStreak: { type: 'win' | 'loss' | 'none'; length: number }\n    streakHistory: Array<{ type: 'win' | 'loss'; length: number; startDate: string; endDate: string }>\n  } {\n    if (trades.length === 0) {\n      return {\n        longestWinStreak: 0,\n        longestLossStreak: 0,\n        currentStreak: { type: 'none', length: 0 },\n        streakHistory: [],\n      }\n    }\n\n    const sortedTrades = [...trades].sort((a, b) => {\n      const dateCompare = new Date(a.dateOpened).getTime() - new Date(b.dateOpened).getTime()\n      if (dateCompare !== 0) return dateCompare\n      return a.timeOpened.localeCompare(b.timeOpened)\n    })\n\n    let longestWinStreak = 0\n    let longestLossStreak = 0\n    let currentStreakLength = 0\n    let currentStreakType: 'win' | 'loss' | 'none' = 'none'\n    let streakStartDate = ''\n\n    const streakHistory: Array<{ type: 'win' | 'loss'; length: number; startDate: string; endDate: string }> = []\n\n    sortedTrades.forEach((trade, index) => {\n      const tradeType: 'win' | 'loss' = trade.pl > 0 ? 'win' : 'loss'\n      const tradeDate = new Date(trade.dateOpened).toISOString().split('T')[0]\n\n      if (tradeType === currentStreakType) {\n        // Continue current streak\n        currentStreakLength++\n      } else {\n        // End previous streak and start new one\n        if (currentStreakType !== 'none' && currentStreakLength > 0) {\n          const prevTradeDate = sortedTrades[index - 1] ? new Date(sortedTrades[index - 1].dateOpened).toISOString().split('T')[0] : streakStartDate\n          streakHistory.push({\n            type: currentStreakType,\n            length: currentStreakLength,\n            startDate: streakStartDate,\n            endDate: prevTradeDate,\n          })\n\n          // Update longest streaks\n          if (currentStreakType === 'win') {\n            longestWinStreak = Math.max(longestWinStreak, currentStreakLength)\n          } else {\n            longestLossStreak = Math.max(longestLossStreak, currentStreakLength)\n          }\n        }\n\n        // Start new streak\n        currentStreakType = tradeType\n        currentStreakLength = 1\n        streakStartDate = tradeDate\n      }\n    })\n\n    // Handle final streak\n    if (currentStreakType !== 'none' && currentStreakLength > 0) {\n      const lastTradeDate = new Date(sortedTrades[sortedTrades.length - 1].dateOpened).toISOString().split('T')[0]\n      streakHistory.push({\n        type: currentStreakType,\n        length: currentStreakLength,\n        startDate: streakStartDate,\n        endDate: lastTradeDate,\n      })\n\n      if (currentStreakType === 'win') {\n        longestWinStreak = Math.max(longestWinStreak, currentStreakLength)\n      } else {\n        longestLossStreak = Math.max(longestLossStreak, currentStreakLength)\n      }\n    }\n\n    return {\n      longestWinStreak,\n      longestLossStreak,\n      currentStreak: { type: currentStreakType, length: currentStreakLength },\n      streakHistory,\n    }\n  }\n\n  /**\n   * Calculate trade distribution by P/L ranges\n   */\n  static calculatePLDistribution(trades: Trade[], bucketSize: number = 500): Record<string, number> {\n    const distribution: Record<string, number> = {}\n\n    trades.forEach(trade => {\n      const bucket = Math.floor(trade.pl / bucketSize) * bucketSize\n      const key = `${bucket} to ${bucket + bucketSize - 1}`\n\n      if (!distribution[key]) {\n        distribution[key] = 0\n      }\n      distribution[key]++\n    })\n\n    return distribution\n  }\n}","/**\n * Statistical utility functions for copula analysis\n *\n * Provides:\n * - Normal CDF and quantile (inverse CDF) functions\n * - Probability Integral Transform (PIT) for copula estimation\n */\n\n/**\n * Error function approximation using Horner's method\n * Abramowitz and Stegun approximation 7.1.26\n * Maximum error: 1.5×10⁻⁷\n */\nfunction erf(x: number): number {\n  const sign = x >= 0 ? 1 : -1;\n  x = Math.abs(x);\n\n  const a1 = 0.254829592;\n  const a2 = -0.284496736;\n  const a3 = 1.421413741;\n  const a4 = -1.453152027;\n  const a5 = 1.061405429;\n  const p = 0.3275911;\n\n  const t = 1.0 / (1.0 + p * x);\n  const y =\n    1.0 - ((((a5 * t + a4) * t + a3) * t + a2) * t + a1) * t * Math.exp(-x * x);\n\n  return sign * y;\n}\n\n/**\n * Standard normal cumulative distribution function (CDF)\n * Phi(x) = P(Z <= x) where Z ~ N(0,1)\n *\n * @param x - The value to evaluate\n * @returns Probability P(Z <= x) in range [0, 1]\n */\nexport function normalCDF(x: number): number {\n  return 0.5 * (1 + erf(x / Math.SQRT2));\n}\n\n/**\n * Standard normal quantile function (inverse CDF)\n * Returns x such that P(Z <= x) = p\n *\n * Uses the Beasley-Springer-Moro algorithm which provides\n * good accuracy across the full range (0, 1)\n *\n * @param p - Probability in range (0, 1)\n * @returns The quantile value x\n * @throws Error if p is not in (0, 1)\n */\nexport function normalQuantile(p: number): number {\n  if (p <= 0 || p >= 1) {\n    throw new Error(`normalQuantile: p must be in (0, 1), got ${p}`);\n  }\n\n  // Coefficients for rational approximation\n  const a = [\n    -3.969683028665376e1, 2.209460984245205e2, -2.759285104469687e2,\n    1.383577518672690e2, -3.066479806614716e1, 2.506628277459239e0,\n  ];\n\n  const b = [\n    -5.447609879822406e1, 1.615858368580409e2, -1.556989798598866e2,\n    6.680131188771972e1, -1.328068155288572e1,\n  ];\n\n  const c = [\n    -7.784894002430293e-3, -3.223964580411365e-1, -2.400758277161838e0,\n    -2.549732539343734e0, 4.374664141464968e0, 2.938163982698783e0,\n  ];\n\n  const d = [\n    7.784695709041462e-3, 3.224671290700398e-1, 2.445134137142996e0,\n    3.754408661907416e0,\n  ];\n\n  // Boundary between central rational approximation and tail approximations\n  // This value optimizes accuracy across the full (0,1) range\n  const pLow = 0.02425;\n  const pHigh = 1 - pLow;\n\n  let q: number;\n  let r: number;\n\n  if (p < pLow) {\n    // Lower tail\n    q = Math.sqrt(-2 * Math.log(p));\n    return (\n      (((((c[0] * q + c[1]) * q + c[2]) * q + c[3]) * q + c[4]) * q + c[5]) /\n      ((((d[0] * q + d[1]) * q + d[2]) * q + d[3]) * q + 1)\n    );\n  } else if (p <= pHigh) {\n    // Central region\n    q = p - 0.5;\n    r = q * q;\n    return (\n      ((((((a[0] * r + a[1]) * r + a[2]) * r + a[3]) * r + a[4]) * r + a[5]) *\n        q) /\n      (((((b[0] * r + b[1]) * r + b[2]) * r + b[3]) * r + b[4]) * r + 1)\n    );\n  } else {\n    // Upper tail\n    q = Math.sqrt(-2 * Math.log(1 - p));\n    return (\n      -(\n        (((((c[0] * q + c[1]) * q + c[2]) * q + c[3]) * q + c[4]) * q + c[5]) /\n        ((((d[0] * q + d[1]) * q + d[2]) * q + d[3]) * q + 1)\n      )\n    );\n  }\n}\n\n/**\n * Convert ranks to uniform [0, 1] using Hazen plotting position\n *\n * Uses (rank - 0.5) / n to avoid 0 and 1 which would cause\n * issues when transforming to normal quantiles\n *\n * @param ranks - Array of ranks (1-indexed)\n * @param n - Total number of observations\n * @returns Array of uniform values in (0, 1)\n */\nexport function ranksToUniform(ranks: number[], n: number): number[] {\n  return ranks.map((rank) => (rank - 0.5) / n);\n}\n\n/**\n * Convert array of values to ranks (handling ties with average rank)\n *\n * This is the canonical implementation used by correlation.ts,\n * reconciliation-stats.ts, and tail-risk-analysis.ts.\n *\n * @param values - Array of numeric values\n * @returns Array of ranks (1-indexed, ties get average rank)\n */\nexport function getRanks(values: number[]): number[] {\n  const indexed = values.map((value, index) => ({ value, index }));\n  indexed.sort((a, b) => a.value - b.value);\n\n  const ranks = new Array(values.length);\n  let i = 0;\n\n  while (i < indexed.length) {\n    let j = i;\n    // Find all tied values\n    while (j < indexed.length && indexed[j].value === indexed[i].value) {\n      j++;\n    }\n\n    // Assign average rank to all tied values\n    // For 0-indexed positions i through j-1, the 1-indexed ranks are (i+1) through j\n    // Average of consecutive integers (i+1) to j = (i+1 + j) / 2 = (i + j + 1) / 2\n    const averageRank = (i + j + 1) / 2;\n    for (let k = i; k < j; k++) {\n      ranks[indexed[k].index] = averageRank;\n    }\n\n    i = j;\n  }\n\n  return ranks;\n}\n\n/**\n * Apply Probability Integral Transform (PIT)\n *\n * Transforms arbitrary continuous data to standard normal distribution:\n * 1. Convert values to ranks\n * 2. Convert ranks to uniform [0, 1]\n * 3. Apply inverse normal CDF to get standard normal quantiles\n *\n * This is the key transformation for Gaussian copula estimation.\n * The resulting data has marginal N(0,1) distribution while preserving\n * the dependence structure.\n *\n * @param values - Array of numeric values\n * @returns Array of standard normal quantiles\n */\nexport function probabilityIntegralTransform(values: number[]): number[] {\n  if (values.length === 0) {\n    return [];\n  }\n\n  if (values.length === 1) {\n    // Single value maps to 0 (median of standard normal)\n    return [0];\n  }\n\n  const n = values.length;\n  const ranks = getRanks(values);\n  const uniform = ranksToUniform(ranks, n);\n\n  return uniform.map((u) => normalQuantile(u));\n}\n\n/**\n * Compute Kendall's tau-b correlation coefficient between two arrays\n *\n * Kendall's tau is a rank-based correlation measure that is:\n * - More robust to outliers than Pearson correlation\n * - Based on concordant/discordant pairs rather than linear relationship\n * - Bounded in [-1, 1] like Pearson\n *\n * tau-b handles ties properly using the formula:\n * tau-b = (C - D) / sqrt((C + D + T_x) * (C + D + T_y))\n *\n * where C = concordant pairs, D = discordant pairs,\n * T_x = pairs tied only in x, T_y = pairs tied only in y\n *\n * @param x - First array\n * @param y - Second array\n * @returns Kendall's tau-b in [-1, 1], or 0 if inputs are invalid\n */\nexport function kendallTau(x: number[], y: number[]): number {\n  if (x.length !== y.length || x.length < 2) {\n    return 0;\n  }\n\n  const n = x.length;\n\n  // Check for non-finite values\n  for (let i = 0; i < n; i++) {\n    if (!Number.isFinite(x[i]) || !Number.isFinite(y[i])) {\n      return 0;\n    }\n  }\n\n  let concordant = 0;\n  let discordant = 0;\n  let tiedX = 0;\n  let tiedY = 0;\n\n  // Compare all pairs\n  for (let i = 0; i < n - 1; i++) {\n    for (let j = i + 1; j < n; j++) {\n      const xDiff = x[i] - x[j];\n      const yDiff = y[i] - y[j];\n\n      if (xDiff === 0 && yDiff === 0) {\n        // Tied in both - doesn't count\n        continue;\n      } else if (xDiff === 0) {\n        // Tied only in x\n        tiedX++;\n      } else if (yDiff === 0) {\n        // Tied only in y\n        tiedY++;\n      } else if (xDiff * yDiff > 0) {\n        // Concordant: same direction\n        concordant++;\n      } else {\n        // Discordant: opposite direction\n        discordant++;\n      }\n    }\n  }\n\n  const numerator = concordant - discordant;\n  const denominator = Math.sqrt(\n    (concordant + discordant + tiedX) * (concordant + discordant + tiedY)\n  );\n\n  if (denominator === 0) {\n    return 0;\n  }\n\n  const result = numerator / denominator;\n\n  // Guard against non-finite result\n  if (!Number.isFinite(result)) {\n    return 0;\n  }\n\n  return result;\n}\n\n/**\n * Convert Kendall's tau to Pearson correlation using the sin transformation\n *\n * This mapping preserves positive semi-definiteness of the correlation matrix,\n * which is essential for eigenvalue decomposition to produce valid results.\n *\n * The formula: r = sin(π * τ / 2)\n *\n * This is derived from the relationship between Kendall's tau and Pearson's r\n * for bivariate normal distributions.\n *\n * @param tau - Kendall's tau value in [-1, 1]\n * @returns Pearson-equivalent correlation in [-1, 1]\n */\nexport function kendallTauToPearson(tau: number): number {\n  return Math.sin((Math.PI * tau) / 2);\n}\n\n/**\n * Compute Pearson correlation coefficient between two arrays\n *\n * @param x - First array\n * @param y - Second array\n * @returns Pearson correlation in [-1, 1], or 0 if inputs contain non-finite values\n */\nexport function pearsonCorrelation(x: number[], y: number[]): number {\n  if (x.length !== y.length || x.length === 0) {\n    return 0;\n  }\n\n  const n = x.length;\n  let sumX = 0;\n  let sumY = 0;\n\n  for (let i = 0; i < n; i++) {\n    // Guard against NaN/Infinity in inputs\n    if (!Number.isFinite(x[i]) || !Number.isFinite(y[i])) {\n      return 0;\n    }\n    sumX += x[i];\n    sumY += y[i];\n  }\n\n  const meanX = sumX / n;\n  const meanY = sumY / n;\n\n  let numerator = 0;\n  let sumXSquared = 0;\n  let sumYSquared = 0;\n\n  for (let i = 0; i < n; i++) {\n    const diffX = x[i] - meanX;\n    const diffY = y[i] - meanY;\n\n    numerator += diffX * diffY;\n    sumXSquared += diffX * diffX;\n    sumYSquared += diffY * diffY;\n  }\n\n  const denominator = Math.sqrt(sumXSquared * sumYSquared);\n\n  if (denominator === 0) {\n    return 0;\n  }\n\n  const result = numerator / denominator;\n\n  // Guard against non-finite result from numeric edge cases\n  if (!Number.isFinite(result)) {\n    return 0;\n  }\n\n  return result;\n}\n","import { Trade } from \"../models/trade\";\nimport { mean } from \"mathjs\";\nimport { getRanks } from \"./statistical-utils\";\n\nexport type CorrelationMethod = \"pearson\" | \"spearman\" | \"kendall\";\nexport type CorrelationAlignment = \"shared\" | \"zero-pad\";\nexport type CorrelationNormalization = \"raw\" | \"margin\" | \"notional\";\nexport type CorrelationDateBasis = \"opened\" | \"closed\";\nexport type CorrelationTimePeriod = \"daily\" | \"weekly\" | \"monthly\";\n\nexport interface CorrelationOptions {\n  method?: CorrelationMethod;\n  alignment?: CorrelationAlignment;\n  normalization?: CorrelationNormalization;\n  dateBasis?: CorrelationDateBasis;\n  timePeriod?: CorrelationTimePeriod;\n}\n\nexport interface CorrelationMatrix {\n  strategies: string[];\n  correlationData: number[][];\n  /** Sample size (n) for each strategy pair - number of shared trading days */\n  sampleSizes: number[][];\n}\n\nexport interface CorrelationAnalytics {\n  strongest: {\n    value: number;\n    pair: [string, string];\n    sampleSize: number;\n  };\n  weakest: {\n    value: number;\n    pair: [string, string];\n    sampleSize: number;\n  };\n  averageCorrelation: number;\n  strategyCount: number;\n  /** Number of strategy pairs with insufficient data (below minSamples threshold) */\n  insufficientDataPairs: number;\n}\n\n/**\n * Calculate correlation matrix between trading strategies based on daily returns\n */\nexport function calculateCorrelationMatrix(\n  trades: Trade[],\n  options: CorrelationOptions = {}\n): CorrelationMatrix {\n  const {\n    method = \"pearson\",\n    alignment = \"shared\",\n    normalization = \"raw\",\n    dateBasis = \"opened\",\n    timePeriod = \"daily\",\n  } = options;\n\n  // Group trades by strategy and date (use null prototype to prevent prototype pollution)\n  const strategyDailyReturns: Record<string, Record<string, number>> = Object.create(null);\n\n  for (const trade of trades) {\n    // Skip trades without a strategy\n    if (!trade.strategy || trade.strategy.trim() === \"\") {\n      continue;\n    }\n\n    if (dateBasis === \"closed\" && !trade.dateClosed) {\n      continue;\n    }\n\n    const strategy = trade.strategy;\n    const dateKey = getTradeDateKey(trade, dateBasis);\n    const normalizedReturn = normalizeReturn(trade, normalization);\n\n    if (normalizedReturn === null) {\n      continue;\n    }\n\n    if (!strategyDailyReturns[strategy]) {\n      strategyDailyReturns[strategy] = Object.create(null);\n    }\n\n    strategyDailyReturns[strategy][dateKey] =\n      (strategyDailyReturns[strategy][dateKey] || 0) + normalizedReturn;\n  }\n\n  // Aggregate by time period (no-op for daily)\n  const strategyReturns: Record<string, Record<string, number>> = {};\n  for (const strategy of Object.keys(strategyDailyReturns)) {\n    strategyReturns[strategy] = aggregateByPeriod(\n      strategyDailyReturns[strategy],\n      timePeriod\n    );\n  }\n\n  // Build allDates from aggregated data\n  const allDates = new Set<string>();\n  for (const returns of Object.values(strategyReturns)) {\n    for (const periodKey of Object.keys(returns)) {\n      allDates.add(periodKey);\n    }\n  }\n\n  const strategies = Object.keys(strategyReturns).sort();\n\n  // Need at least 2 strategies\n  if (strategies.length < 2) {\n    const identityMatrix = strategies.map((_, i) =>\n      strategies.map((_, j) => (i === j ? 1.0 : NaN))\n    );\n    const sampleSizeMatrix = strategies.map((strategy) => [\n      Object.keys(strategyReturns[strategy]).length,\n    ]);\n    return { strategies, correlationData: identityMatrix, sampleSizes: sampleSizeMatrix };\n  }\n\n  const correlationData: number[][] = [];\n  const sampleSizes: number[][] = [];\n\n  const sortedPeriods = alignment === \"zero-pad\"\n    ? Array.from(allDates).sort()\n    : [];\n\n  const zeroPaddedReturns: Record<string, number[]> = {};\n  if (alignment === \"zero-pad\") {\n    for (const strategy of strategies) {\n      zeroPaddedReturns[strategy] = sortedPeriods.map(\n        (period) => strategyReturns[strategy][period] || 0\n      );\n    }\n  }\n\n  for (const strategy1 of strategies) {\n    const row: number[] = [];\n    const sampleRow: number[] = [];\n\n    for (const strategy2 of strategies) {\n      if (strategy1 === strategy2) {\n        row.push(1.0);\n        // Diagonal: count of periods for this strategy\n        sampleRow.push(Object.keys(strategyReturns[strategy1]).length);\n        continue;\n      }\n\n      let returns1: number[] = [];\n      let returns2: number[] = [];\n      let sharedPeriodsCount = 0;\n\n      if (alignment === \"zero-pad\") {\n        returns1 = zeroPaddedReturns[strategy1];\n        returns2 = zeroPaddedReturns[strategy2];\n        // Count actual shared periods (where both strategies traded)\n        const strategy1Data = strategyReturns[strategy1];\n        const strategy2Data = strategyReturns[strategy2];\n        for (const period of Object.keys(strategy1Data)) {\n          if (period in strategy2Data) {\n            sharedPeriodsCount++;\n          }\n        }\n      } else {\n        const strategy1Data = strategyReturns[strategy1];\n        const strategy2Data = strategyReturns[strategy2];\n\n        for (const period of Object.keys(strategy1Data)) {\n          if (period in strategy2Data) {\n            returns1.push(strategy1Data[period]);\n            returns2.push(strategy2Data[period]);\n          }\n        }\n        sharedPeriodsCount = returns1.length;\n      }\n\n      // Track sample size (shared periods - not zero-padded length)\n      sampleRow.push(sharedPeriodsCount);\n\n      // Need at least 2 data points for correlation\n      if (returns1.length < 2) {\n        row.push(NaN);\n        continue;\n      }\n\n      let correlation: number;\n      if (method === \"pearson\") {\n        correlation = pearsonCorrelation(returns1, returns2);\n      } else if (method === \"spearman\") {\n        correlation = spearmanCorrelation(returns1, returns2);\n      } else {\n        // Kendall\n        correlation = kendallCorrelation(returns1, returns2);\n      }\n\n      row.push(correlation);\n    }\n\n    correlationData.push(row);\n    sampleSizes.push(sampleRow);\n  }\n\n  return { strategies, correlationData, sampleSizes };\n}\n\n/**\n * Calculate Pearson correlation coefficient\n */\nfunction pearsonCorrelation(x: number[], y: number[]): number {\n  if (x.length !== y.length || x.length === 0) return 0;\n\n  const meanX = mean(x);\n  const meanY = mean(y);\n\n  let numerator = 0;\n  let sumXSquared = 0;\n  let sumYSquared = 0;\n\n  for (let i = 0; i < x.length; i++) {\n    const diffX = x[i] - meanX;\n    const diffY = y[i] - meanY;\n\n    numerator += diffX * diffY;\n    sumXSquared += diffX * diffX;\n    sumYSquared += diffY * diffY;\n  }\n\n  const denominator = Math.sqrt(sumXSquared * sumYSquared);\n\n  if (denominator === 0) return 0;\n\n  return numerator / denominator;\n}\n\n/**\n * Calculate Spearman rank correlation coefficient\n */\nfunction spearmanCorrelation(x: number[], y: number[]): number {\n  if (x.length !== y.length || x.length === 0) return 0;\n\n  // Convert values to ranks\n  const rankX = getRanks(x);\n  const rankY = getRanks(y);\n\n  // Calculate Pearson correlation on ranks\n  return pearsonCorrelation(rankX, rankY);\n}\n\n/**\n * Calculate Kendall's tau correlation coefficient\n */\nfunction kendallCorrelation(x: number[], y: number[]): number {\n  if (x.length !== y.length || x.length === 0) return 0;\n\n  let concordant = 0;\n  let discordant = 0;\n\n  for (let i = 0; i < x.length - 1; i++) {\n    for (let j = i + 1; j < x.length; j++) {\n      const diffX = x[j] - x[i];\n      const diffY = y[j] - y[i];\n\n      if ((diffX > 0 && diffY > 0) || (diffX < 0 && diffY < 0)) {\n        concordant++;\n      } else if ((diffX > 0 && diffY < 0) || (diffX < 0 && diffY > 0)) {\n        discordant++;\n      }\n    }\n  }\n\n  const n = x.length;\n  const denominator = (n * (n - 1)) / 2;\n\n  if (denominator === 0) return 0;\n\n  return (concordant - discordant) / denominator;\n}\n\n// Re-export getRanks for backwards compatibility\nexport { getRanks } from \"./statistical-utils\";\n\nfunction normalizeReturn(\n  trade: Trade,\n  mode: CorrelationNormalization\n): number | null {\n  switch (mode) {\n    case \"margin\": {\n      if (!trade.marginReq) {\n        return null;\n      }\n      return trade.pl / trade.marginReq;\n    }\n    case \"notional\": {\n      const notional = Math.abs(\n        (trade.openingPrice || 0) * (trade.numContracts || 0)\n      );\n      if (!notional) {\n        return null;\n      }\n      return trade.pl / notional;\n    }\n    default:\n      return trade.pl;\n  }\n}\n\nfunction getTradeDateKey(\n  trade: Trade,\n  basis: CorrelationDateBasis\n): string {\n  const date = basis === \"closed\" ? trade.dateClosed : trade.dateOpened;\n\n  if (!date) {\n    throw new Error(\n      \"Trade is missing required date information for correlation calculation\"\n    );\n  }\n\n  // Extract calendar date components directly to preserve Eastern Time date\n  // Using toISOString() would convert to UTC and potentially shift the date\n  const year = date.getFullYear();\n  const month = String(date.getMonth() + 1).padStart(2, \"0\");\n  const day = String(date.getDate()).padStart(2, \"0\");\n  return `${year}-${month}-${day}`;\n}\n\n/**\n * Get ISO week key for a date (YYYY-Www format)\n */\nfunction getIsoWeekKey(dateStr: string): string {\n  const [yearStr, monthStr, dayStr] = dateStr.split(\"-\");\n  const year = Number(yearStr);\n  const month = Number(monthStr) - 1; // zero-based month\n  const day = Number(dayStr);\n\n  // Construct date in UTC to avoid timezone/DST issues\n  const date = new Date(Date.UTC(year, month, day));\n\n  // ISO week: week containing Jan 4 is week 1\n  // Thursday of the week determines which year the week belongs to\n  const thursday = new Date(date.getTime());\n  const dayOfWeek = thursday.getUTCDay() || 7; // make Sunday = 7\n  thursday.setUTCDate(thursday.getUTCDate() + (4 - dayOfWeek));\n\n  const yearStart = new Date(Date.UTC(thursday.getUTCFullYear(), 0, 1));\n  const weekNum = Math.ceil(\n    ((thursday.getTime() - yearStart.getTime()) / 86400000 + 1) / 7\n  );\n\n  return `${thursday.getUTCFullYear()}-W${String(weekNum).padStart(2, \"0\")}`;\n}\n\n/**\n * Get month key for a date (YYYY-MM format)\n */\nfunction getMonthKey(dateStr: string): string {\n  return dateStr.substring(0, 7); // YYYY-MM from YYYY-MM-DD\n}\n\n/**\n * Aggregate daily returns by time period (sum P&L within each period)\n */\nfunction aggregateByPeriod(\n  dailyReturns: Record<string, number>,\n  period: CorrelationTimePeriod\n): Record<string, number> {\n  if (period === \"daily\") return dailyReturns;\n\n  const aggregated: Record<string, number> = {};\n  const getKey = period === \"weekly\" ? getIsoWeekKey : getMonthKey;\n\n  for (const [dateStr, value] of Object.entries(dailyReturns)) {\n    const periodKey = getKey(dateStr);\n    aggregated[periodKey] = (aggregated[periodKey] || 0) + value;\n  }\n\n  return aggregated;\n}\n\n/**\n * Calculate quick analytics from correlation matrix\n * @param matrix The correlation matrix with sample sizes\n * @param minSamples Minimum sample size threshold for valid correlations (default: 2)\n */\nexport function calculateCorrelationAnalytics(\n  matrix: CorrelationMatrix,\n  minSamples: number = 2\n): CorrelationAnalytics {\n  const { strategies, correlationData, sampleSizes } = matrix;\n\n  let strongest = { value: -Infinity, pair: [\"\", \"\"] as [string, string], sampleSize: 0 };\n  let weakest = { value: Infinity, pair: [\"\", \"\"] as [string, string], sampleSize: 0 };\n  let sumCorrelation = 0;\n  let validCount = 0;\n  let insufficientDataPairs = 0;\n\n  // Find strongest and weakest correlations (excluding diagonal)\n  // Strongest = highest correlation (most positive)\n  // Weakest = lowest correlation (most negative)\n  for (let i = 0; i < strategies.length; i++) {\n    for (let j = i + 1; j < strategies.length; j++) {\n      const value = correlationData[i][j];\n      const n = sampleSizes[i][j];\n\n      // Skip if below threshold or NaN\n      if (Number.isNaN(value) || n < minSamples) {\n        insufficientDataPairs++;\n        continue;\n      }\n\n      sumCorrelation += value;\n      validCount++;\n\n      // Strongest is the most positive correlation\n      if (value > strongest.value) {\n        strongest = { value, pair: [strategies[i], strategies[j]], sampleSize: n };\n      }\n\n      // Weakest is the most negative correlation (minimum value)\n      if (value < weakest.value) {\n        weakest = { value, pair: [strategies[i], strategies[j]], sampleSize: n };\n      }\n    }\n  }\n\n  // Handle case where no valid pairs exist\n  if (validCount === 0) {\n    strongest = { value: NaN, pair: [\"\", \"\"], sampleSize: 0 };\n    weakest = { value: NaN, pair: [\"\", \"\"], sampleSize: 0 };\n  }\n\n  return {\n    strongest,\n    weakest,\n    averageCorrelation: validCount > 0 ? sumCorrelation / validCount : NaN,\n    strategyCount: strategies.length,\n    insufficientDataPairs,\n  };\n}\n","/**\n * Tail Risk Analysis using Gaussian Copula\n *\n * Measures tail dependence between strategies - how likely they are to have\n * extreme losses together, even if their day-to-day correlation is low.\n *\n * Key insight: Two strategies can have low Pearson correlation (0.2) but\n * high tail dependence (0.7), meaning they blow up together on big market moves.\n */\n\nimport { eigs, matrix } from \"mathjs\";\nimport {\n  AlignedStrategyReturns,\n  MarginalContribution,\n  TailRiskAnalysisOptions,\n  TailRiskAnalysisResult,\n  TailRiskAnalytics,\n} from \"../models/tail-risk\";\nimport { Trade } from \"../models/trade\";\nimport {\n  kendallTau,\n  kendallTauToPearson,\n  probabilityIntegralTransform,\n} from \"./statistical-utils\";\n\n// Threshold for classifying a strategy pair as having \"high\" tail dependence\n// Pairs above this value are flagged in analytics as concerning\nconst HIGH_DEPENDENCE_THRESHOLD = 0.5;\n\n// Weights for marginal contribution calculation\n// Equal weighting between concentration (factor loading) and average dependence\nconst CONCENTRATION_WEIGHT = 0.5;\nconst DEPENDENCE_WEIGHT = 0.5;\n\n// Minimum number of tail observations required for valid tail dependence calculation\n// With fewer than this, the conditional probability P(j in tail | i in tail) is too noisy\n// This is the absolute floor - dynamic minimum scales with sample size\nconst MIN_TAIL_OBSERVATIONS_FLOOR = 5;\n\n/**\n * Calculate dynamic minimum tail observations based on sample size\n * Scales with tailThreshold and actual observations to be more stringent for larger datasets\n * while maintaining a floor of 5 for small datasets\n */\nfunction getMinTailObservations(\n  tailThreshold: number,\n  sharedTradingDays: number\n): number {\n  // For larger datasets, require at least 10% of expected tail events\n  // This prevents accepting 5 observations when you have 500 potential tail days\n  const expectedTailDays = tailThreshold * sharedTradingDays;\n  const scaledMinimum = Math.ceil(expectedTailDays * 0.1);\n\n  return Math.max(MIN_TAIL_OBSERVATIONS_FLOOR, scaledMinimum);\n}\n\n/**\n * Perform full Gaussian copula tail risk analysis\n *\n * @param trades - Array of trades to analyze\n * @param options - Analysis configuration options\n * @returns Complete tail risk analysis result\n */\nexport function performTailRiskAnalysis(\n  trades: Trade[],\n  options: TailRiskAnalysisOptions = {}\n): TailRiskAnalysisResult {\n  const startTime = performance.now();\n\n  const {\n    tailThreshold: rawTailThreshold = 0.1,\n    minTradingDays = 30,\n    normalization = \"raw\",\n    dateBasis = \"opened\",\n    tickerFilter,\n    strategyFilter,\n    dateRange,\n    varianceThreshold: rawVarianceThreshold = 0.8,\n  } = options;\n\n  // Validate and clamp thresholds to prevent degenerate calculations\n  // tailThreshold must be in (0, 1) - values at boundaries produce empty/full tails\n  const tailThreshold = Math.max(0.01, Math.min(0.99, rawTailThreshold));\n  // varianceThreshold must be in (0, 1) for meaningful factor counting\n  const varianceThreshold = Math.max(0.5, Math.min(0.99, rawVarianceThreshold));\n\n  // Step 1: Filter trades\n  let filteredTrades = trades;\n\n  if (tickerFilter) {\n    filteredTrades = filteredTrades.filter((t) => {\n      // Extract ticker from legs or other fields\n      // For now, check if any leg contains the ticker\n      const legsStr = t.legs || \"\";\n      return legsStr.toUpperCase().includes(tickerFilter.toUpperCase());\n    });\n  }\n\n  if (strategyFilter && strategyFilter.length > 0) {\n    const filterSet = new Set(strategyFilter);\n    filteredTrades = filteredTrades.filter(\n      (t) => t.strategy && filterSet.has(t.strategy)\n    );\n  }\n\n  // Filter by date range if provided\n  if (dateRange?.from || dateRange?.to) {\n    filteredTrades = filteredTrades.filter((t) => {\n      const tradeDate =\n        dateBasis === \"opened\"\n          ? new Date(t.dateOpened)\n          : t.dateClosed\n            ? new Date(t.dateClosed)\n            : null;\n\n      if (!tradeDate) return false;\n\n      if (dateRange.from && tradeDate < dateRange.from) return false;\n      if (dateRange.to) {\n        // Include the entire \"to\" day by comparing to end of day\n        const endOfToDay = new Date(dateRange.to);\n        endOfToDay.setHours(23, 59, 59, 999);\n        if (tradeDate > endOfToDay) return false;\n      }\n\n      return true;\n    });\n  }\n\n  // Step 2: Aggregate daily returns and align strategies\n  const aligned = aggregateAndAlignReturns(\n    filteredTrades,\n    normalization,\n    dateBasis\n  );\n\n  // Handle edge cases\n  if (aligned.strategies.length < 2) {\n    return createEmptyResult(\n      aligned,\n      tailThreshold,\n      varianceThreshold,\n      startTime\n    );\n  }\n\n  if (aligned.dates.length < minTradingDays) {\n    return createEmptyResult(\n      aligned,\n      tailThreshold,\n      varianceThreshold,\n      startTime\n    );\n  }\n\n  // Step 3: Apply PIT to each strategy's returns\n  const transformedReturns = aligned.returns.map((strategyReturns) =>\n    probabilityIntegralTransform(strategyReturns)\n  );\n\n  // Step 4: Compute copula correlation matrix (Pearson on transformed data)\n  const copulaCorrelationMatrix = computeCorrelationMatrix(transformedReturns);\n\n  // Step 5: Eigenvalue decomposition\n  const { eigenvalues, eigenvectors, explainedVariance, effectiveFactors } =\n    performEigenAnalysis(copulaCorrelationMatrix, varianceThreshold);\n\n  // Step 6: Estimate empirical joint tail risk (tail co-probability)\n  const jointTailRiskResult = estimateJointTailRisk(\n    transformedReturns,\n    aligned.tradedMask,\n    tailThreshold\n  );\n\n  // Step 7: Calculate analytics\n  const analytics = calculateTailRiskAnalytics(\n    jointTailRiskResult.matrix,\n    aligned.strategies\n  );\n\n  // Step 8: Calculate marginal contributions\n  const marginalContributions = calculateMarginalContributions(\n    copulaCorrelationMatrix,\n    jointTailRiskResult.matrix,\n    eigenvectors,\n    aligned.strategies\n  );\n\n  const endTime = performance.now();\n\n  return {\n    strategies: aligned.strategies,\n    tradingDaysUsed: aligned.dates.length,\n    dateRange: {\n      start: new Date(aligned.dates[0]),\n      end: new Date(aligned.dates[aligned.dates.length - 1]),\n    },\n    tailThreshold,\n    varianceThreshold,\n    copulaCorrelationMatrix,\n    jointTailRiskMatrix: jointTailRiskResult.matrix,\n    insufficientDataPairs: jointTailRiskResult.insufficientPairs,\n    eigenvalues,\n    eigenvectors,\n    explainedVariance,\n    effectiveFactors,\n    analytics,\n    marginalContributions,\n    computedAt: new Date(),\n    computationTimeMs: endTime - startTime,\n  };\n}\n\n/**\n * Aggregate trades into daily returns and align to shared trading days\n */\nfunction aggregateAndAlignReturns(\n  trades: Trade[],\n  normalization: \"raw\" | \"margin\" | \"notional\",\n  dateBasis: \"opened\" | \"closed\"\n): AlignedStrategyReturns {\n  // Group trades by strategy and date (use null prototype to prevent prototype pollution)\n  const strategyDailyReturns: Record<string, Record<string, number>> = Object.create(null);\n  const allDates = new Set<string>();\n\n  for (const trade of trades) {\n    // Skip trades without a strategy\n    if (!trade.strategy || trade.strategy.trim() === \"\") {\n      continue;\n    }\n\n    if (dateBasis === \"closed\" && !trade.dateClosed) {\n      continue;\n    }\n\n    const strategy = trade.strategy;\n    const date = dateBasis === \"closed\" ? trade.dateClosed : trade.dateOpened;\n\n    if (!date) {\n      continue;\n    }\n\n    const dateKey = date.toISOString().split(\"T\")[0];\n    const normalizedReturn = normalizeReturn(trade, normalization);\n\n    if (normalizedReturn === null) {\n      continue;\n    }\n\n    if (!strategyDailyReturns[strategy]) {\n      strategyDailyReturns[strategy] = Object.create(null);\n    }\n\n    strategyDailyReturns[strategy][dateKey] =\n      (strategyDailyReturns[strategy][dateKey] || 0) + normalizedReturn;\n\n    allDates.add(dateKey);\n  }\n\n  const strategies = Object.keys(strategyDailyReturns).sort();\n\n  if (strategies.length < 2) {\n    return {\n      strategies,\n      dates: [],\n      returns: strategies.map(() => []),\n      tradedMask: strategies.map(() => []),\n    };\n  }\n\n  // Use all dates (union) and zero-pad missing days\n  // This is necessary because strategies may trade on different schedules\n  // (e.g., Monday-only vs Friday-only strategies would have zero shared days)\n  const sortedDates = Array.from(allDates).sort();\n\n  // Build aligned returns matrix with zero-padding for non-trading days\n  // Also track which days each strategy actually traded\n  const returns: number[][] = [];\n  const tradedMask: boolean[][] = [];\n\n  for (const strategy of strategies) {\n    const strategyReturns: number[] = [];\n    const strategyMask: boolean[] = [];\n\n    for (const date of sortedDates) {\n      const traded = date in strategyDailyReturns[strategy];\n      strategyMask.push(traded);\n      strategyReturns.push(traded ? strategyDailyReturns[strategy][date] : 0);\n    }\n\n    returns.push(strategyReturns);\n    tradedMask.push(strategyMask);\n  }\n\n  return {\n    strategies,\n    dates: sortedDates,\n    returns,\n    tradedMask,\n  };\n}\n\n/**\n * Normalize trade return based on selected mode\n * Returns null for invalid/non-finite values to prevent corrupted calculations\n */\nfunction normalizeReturn(\n  trade: Trade,\n  mode: \"raw\" | \"margin\" | \"notional\"\n): number | null {\n  let result: number;\n\n  switch (mode) {\n    case \"margin\": {\n      if (!trade.marginReq || trade.marginReq === 0) {\n        return null;\n      }\n      result = trade.pl / trade.marginReq;\n      break;\n    }\n    case \"notional\": {\n      const notional = Math.abs(\n        (trade.openingPrice || 0) * (trade.numContracts || 0)\n      );\n      if (!notional || notional === 0) {\n        return null;\n      }\n      result = trade.pl / notional;\n      break;\n    }\n    default:\n      result = trade.pl;\n  }\n\n  // Guard against NaN/Infinity from malformed data or division edge cases\n  if (!Number.isFinite(result)) {\n    return null;\n  }\n\n  return result;\n}\n\n/**\n * Compute correlation matrix from transformed returns using Kendall's tau\n *\n * Uses Kendall's tau-b (rank-based) correlation, then maps to Pearson-equivalent\n * using sin(π * τ / 2). This approach:\n * 1. Is more robust to outliers than direct Pearson correlation\n * 2. Guarantees the resulting matrix is positive semi-definite\n * 3. Ensures valid eigenvalue decomposition (all eigenvalues >= 0)\n */\nfunction computeCorrelationMatrix(transformedReturns: number[][]): number[][] {\n  const n = transformedReturns.length;\n  const correlationMatrix: number[][] = [];\n\n  for (let i = 0; i < n; i++) {\n    const row: number[] = [];\n    for (let j = 0; j < n; j++) {\n      if (i === j) {\n        row.push(1.0);\n      } else {\n        // Compute Kendall's tau, then map to Pearson-equivalent\n        const tau = kendallTau(transformedReturns[i], transformedReturns[j]);\n        row.push(kendallTauToPearson(tau));\n      }\n    }\n    correlationMatrix.push(row);\n  }\n\n  return correlationMatrix;\n}\n\n/**\n * Perform eigenvalue decomposition and calculate explained variance\n */\nfunction performEigenAnalysis(\n  correlationMatrix: number[][],\n  varianceThreshold: number = 0.8\n): {\n  eigenvalues: number[];\n  eigenvectors: number[][];\n  explainedVariance: number[];\n  effectiveFactors: number;\n} {\n  const n = correlationMatrix.length;\n\n  if (n === 0) {\n    return {\n      eigenvalues: [],\n      eigenvectors: [],\n      explainedVariance: [],\n      effectiveFactors: 0,\n    };\n  }\n\n  try {\n    // Use mathjs eigs function\n    const result = eigs(matrix(correlationMatrix));\n\n    // Extract eigenvalues (may be complex, take real parts)\n    let eigenvalues: number[] = [];\n    // Handle both array and MathCollection types\n    const rawValues = (\n      Array.isArray(result.values)\n        ? result.values\n        : (result.values as { toArray: () => unknown[] }).toArray()\n    ) as (number | { re: number; im: number })[];\n\n    for (const val of rawValues) {\n      if (typeof val === \"number\") {\n        eigenvalues.push(val);\n      } else if (val && typeof val === \"object\" && \"re\" in val) {\n        eigenvalues.push(val.re);\n      }\n    }\n\n    // Extract eigenvectors\n    // Note: result.eigenvectors is an array of {value, vector} objects\n    // where vector is a DenseMatrix that needs .toArray() called on it\n    type EigenvectorEntry = {\n      value: number | { re: number };\n      vector: { toArray: () => (number | { re: number })[] };\n    };\n    const rawVectors = result.eigenvectors as EigenvectorEntry[];\n    let eigenvectors: number[][] = [];\n\n    for (const ev of rawVectors) {\n      const vecArray = ev.vector.toArray();\n      const vec = vecArray.map((v) => (typeof v === \"number\" ? v : v.re));\n      eigenvectors.push(vec);\n    }\n\n    // Sort by eigenvalue descending\n    const indexed = eigenvalues.map((val, idx) => ({ val, idx }));\n    indexed.sort((a, b) => b.val - a.val);\n\n    eigenvalues = indexed.map((item) => item.val);\n    eigenvectors = indexed.map((item) => eigenvectors[item.idx]);\n\n    // Calculate explained variance\n    const totalVariance = eigenvalues.reduce((sum, val) => sum + val, 0);\n    let cumulative = 0;\n    const explainedVariance = eigenvalues.map((val) => {\n      cumulative += val / totalVariance;\n      return cumulative;\n    });\n\n    // Find effective factors (configurable threshold)\n    let effectiveFactors = eigenvalues.length;\n    for (let i = 0; i < explainedVariance.length; i++) {\n      if (explainedVariance[i] >= varianceThreshold) {\n        effectiveFactors = i + 1;\n        break;\n      }\n    }\n\n    return {\n      eigenvalues,\n      eigenvectors,\n      explainedVariance,\n      effectiveFactors,\n    };\n  } catch (error) {\n    // Fallback for numerical issues (e.g., near-singular matrices)\n    console.warn(\n      \"Eigenvalue decomposition failed, using identity fallback:\",\n      error\n    );\n    return {\n      eigenvalues: new Array(n).fill(1),\n      eigenvectors: correlationMatrix.map((_, i) =>\n        new Array(n).fill(0).map((_, j) => (i === j ? 1 : 0))\n      ),\n      explainedVariance: new Array(n).fill(0).map((_, i) => (i + 1) / n),\n      effectiveFactors: n,\n    };\n  }\n}\n\n/**\n * Result of joint tail risk estimation including insufficient data tracking\n */\ninterface JointTailRiskResult {\n  matrix: number[][];\n  insufficientPairs: number;\n}\n\n/**\n * Estimate empirical joint tail risk (tail co-probability) between strategies\n *\n * For each pair (i, j), calculates P(j in tail | i in tail)\n * where \"in tail\" means below the tailThreshold percentile.\n *\n * Key points:\n * 1. Only considers days where BOTH strategies actually traded (excludes zero-padded days)\n * 2. Requires minimum tail observations for valid estimates (returns NaN otherwise)\n * 3. Uses linear interpolation for threshold calculation\n */\nfunction estimateJointTailRisk(\n  transformedReturns: number[][],\n  tradedMask: boolean[][],\n  tailThreshold: number\n): JointTailRiskResult {\n  const n = transformedReturns.length;\n  const m = transformedReturns[0]?.length || 0;\n\n  if (n === 0 || m === 0) {\n    return { matrix: [], insufficientPairs: 0 };\n  }\n\n  // For each strategy, compute threshold using ONLY days they actually traded\n  // This prevents zero-padded days from affecting the percentile calculation\n  const thresholdValues: number[] = transformedReturns.map((returns, i) => {\n    // Filter to only actual trading days\n    const actualReturns = returns.filter((_, t) => tradedMask[i][t]);\n    const mActual = actualReturns.length;\n\n    if (mActual === 0) {\n      return 0; // No trades, threshold is meaningless\n    }\n\n    const sorted = [...actualReturns].sort((a, b) => a - b);\n    const pos = tailThreshold * (mActual - 1);\n    const lower = Math.floor(pos);\n    const upper = Math.ceil(pos);\n    const frac = pos - lower;\n\n    if (lower === upper || upper >= mActual) {\n      return sorted[Math.max(0, Math.min(lower, mActual - 1))];\n    }\n    return sorted[lower] * (1 - frac) + sorted[upper] * frac;\n  });\n\n  // Identify which observations are in the tail for each strategy\n  // Only mark as \"in tail\" if:\n  // 1. The strategy actually traded that day (not zero-padded)\n  // 2. The return is at or below the threshold\n  const inTail: boolean[][] = transformedReturns.map((returns, i) =>\n    returns.map((val, t) => tradedMask[i][t] && val <= thresholdValues[i])\n  );\n\n  // Compute joint tail risk matrix\n  const jointTailRiskMatrix: number[][] = [];\n  let insufficientPairs = 0;\n\n  for (let i = 0; i < n; i++) {\n    const row: number[] = [];\n    for (let j = 0; j < n; j++) {\n      if (i === j) {\n        row.push(1.0);\n        continue;\n      }\n\n      // Count shared trading days and co-occurrences in tail\n      let sharedTradingDays = 0;\n      let bothInTail = 0;\n      let iInTailAndBothTraded = 0;\n\n      for (let t = 0; t < m; t++) {\n        // Only count days where both strategies actually traded\n        if (tradedMask[i][t] && tradedMask[j][t]) {\n          sharedTradingDays++;\n          if (inTail[i][t]) {\n            iInTailAndBothTraded++;\n            if (inTail[j][t]) {\n              bothInTail++;\n            }\n          }\n        }\n      }\n\n      // Calculate dynamic minimum based on shared trading days for this pair\n      const minTailObs = getMinTailObservations(\n        tailThreshold,\n        sharedTradingDays\n      );\n\n      // Check if we have enough tail observations for a valid estimate\n      if (iInTailAndBothTraded < minTailObs) {\n        row.push(NaN); // Insufficient data\n        insufficientPairs++;\n      } else {\n        // P(j in tail | i in tail) on shared trading days\n        const jointRisk = bothInTail / iInTailAndBothTraded;\n        row.push(jointRisk);\n      }\n    }\n    jointTailRiskMatrix.push(row);\n  }\n\n  return { matrix: jointTailRiskMatrix, insufficientPairs };\n}\n\n/**\n * Calculate analytics from joint tail risk matrix\n */\nfunction calculateTailRiskAnalytics(\n  jointTailRiskMatrix: number[][],\n  strategies: string[]\n): TailRiskAnalytics {\n  const n = strategies.length;\n\n  if (n < 2) {\n    return {\n      highestJointTailRisk: { value: 0, pair: [\"\", \"\"] },\n      lowestJointTailRisk: { value: 0, pair: [\"\", \"\"] },\n      averageJointTailRisk: 0,\n      highRiskPairsPct: 0,\n    };\n  }\n\n  let highest = { value: -Infinity, pair: [\"\", \"\"] as [string, string] };\n  let lowest = { value: Infinity, pair: [\"\", \"\"] as [string, string] };\n  let sum = 0;\n  let validCount = 0;\n  let highRiskCount = 0;\n\n  for (let i = 0; i < n; i++) {\n    for (let j = i + 1; j < n; j++) {\n      // Joint tail risk is asymmetric: P(B in tail | A in tail) ≠ P(A in tail | B in tail)\n      // We average both directions for a single summary metric per pair\n      const valIJ = jointTailRiskMatrix[i][j];\n      const valJI = jointTailRiskMatrix[j][i];\n\n      // Skip pairs with insufficient data (NaN values)\n      if (Number.isNaN(valIJ) || Number.isNaN(valJI)) {\n        continue;\n      }\n\n      const value = (valIJ + valJI) / 2;\n\n      sum += value;\n      validCount++;\n\n      if (value > highest.value) {\n        highest = { value, pair: [strategies[i], strategies[j]] };\n      }\n      if (value < lowest.value) {\n        lowest = { value, pair: [strategies[i], strategies[j]] };\n      }\n      if (value > HIGH_DEPENDENCE_THRESHOLD) {\n        highRiskCount++;\n      }\n    }\n  }\n\n  // Handle case where no valid pairs exist\n  if (validCount === 0) {\n    return {\n      highestJointTailRisk: { value: 0, pair: [\"\", \"\"] },\n      lowestJointTailRisk: { value: 0, pair: [\"\", \"\"] },\n      averageJointTailRisk: 0,\n      highRiskPairsPct: 0,\n    };\n  }\n\n  return {\n    highestJointTailRisk: highest,\n    lowestJointTailRisk: lowest,\n    averageJointTailRisk: sum / validCount,\n    highRiskPairsPct: highRiskCount / validCount,\n  };\n}\n\n/**\n * Calculate marginal contribution of each strategy to portfolio tail risk\n */\nfunction calculateMarginalContributions(\n  _copulaCorrelationMatrix: number[][],\n  jointTailRiskMatrix: number[][],\n  eigenvectors: number[][],\n  strategies: string[]\n): MarginalContribution[] {\n  // Note: copulaCorrelationMatrix is passed for potential future use\n  // (e.g., incorporating copula-based risk measures) but currently unused\n  const n = strategies.length;\n\n  if (n === 0 || eigenvectors.length === 0) {\n    return [];\n  }\n\n  const contributions: MarginalContribution[] = [];\n\n  // Get first eigenvector (dominant factor)\n  const firstEigenvector = eigenvectors[0] || new Array(n).fill(0);\n  const sumAbsLoadings = firstEigenvector.reduce(\n    (sum, val) => sum + Math.abs(val),\n    0\n  );\n\n  for (let i = 0; i < n; i++) {\n    // Concentration score: loading on first factor\n    const concentrationScore =\n      sumAbsLoadings > 0\n        ? Math.abs(firstEigenvector[i]) / sumAbsLoadings\n        : 1 / n;\n\n    // Average joint tail risk with other strategies (skip NaN pairs)\n    let sumJointRisk = 0;\n    let validPairs = 0;\n    for (let j = 0; j < n; j++) {\n      if (i !== j) {\n        const valIJ = jointTailRiskMatrix[i][j];\n        const valJI = jointTailRiskMatrix[j][i];\n\n        // Skip pairs with insufficient data\n        if (!Number.isNaN(valIJ) && !Number.isNaN(valJI)) {\n          sumJointRisk += (valIJ + valJI) / 2;\n          validPairs++;\n        }\n      }\n    }\n    const avgTailDependence = validPairs > 0 ? sumJointRisk / validPairs : 0;\n\n    // Tail risk contribution: weighted combination of concentration and avg dependence\n    // Higher concentration + higher avg dependence = higher contribution\n    const tailRiskContribution =\n      (concentrationScore * CONCENTRATION_WEIGHT +\n        avgTailDependence * DEPENDENCE_WEIGHT) *\n      100;\n\n    contributions.push({\n      strategy: strategies[i],\n      tailRiskContribution,\n      concentrationScore,\n      avgTailDependence,\n    });\n  }\n\n  // Sort by contribution descending\n  contributions.sort((a, b) => b.tailRiskContribution - a.tailRiskContribution);\n\n  return contributions;\n}\n\n/**\n * Create empty result for edge cases\n */\nfunction createEmptyResult(\n  aligned: AlignedStrategyReturns,\n  tailThreshold: number,\n  varianceThreshold: number,\n  startTime: number\n): TailRiskAnalysisResult {\n  const n = aligned.strategies.length;\n  const identity = aligned.strategies.map((_, i) =>\n    aligned.strategies.map((_, j) => (i === j ? 1.0 : 0.0))\n  );\n\n  return {\n    strategies: aligned.strategies,\n    tradingDaysUsed: aligned.dates.length,\n    dateRange: {\n      start: aligned.dates.length > 0 ? new Date(aligned.dates[0]) : new Date(),\n      end:\n        aligned.dates.length > 0\n          ? new Date(aligned.dates[aligned.dates.length - 1])\n          : new Date(),\n    },\n    tailThreshold,\n    varianceThreshold,\n    copulaCorrelationMatrix: identity,\n    jointTailRiskMatrix: identity,\n    insufficientDataPairs: 0,\n    eigenvalues: new Array(n).fill(1),\n    eigenvectors: identity,\n    explainedVariance: new Array(n)\n      .fill(0)\n      .map((_, i) => (i + 1) / Math.max(n, 1)),\n    effectiveFactors: n,\n    analytics: {\n      highestJointTailRisk: { value: 0, pair: [\"\", \"\"] },\n      lowestJointTailRisk: { value: 0, pair: [\"\", \"\"] },\n      averageJointTailRisk: 0,\n      highRiskPairsPct: 0,\n    },\n    marginalContributions: aligned.strategies.map((strategy) => ({\n      strategy,\n      tailRiskContribution: 100 / Math.max(n, 1),\n      concentrationScore: 1 / Math.max(n, 1),\n      avgTailDependence: 0,\n    })),\n    computedAt: new Date(),\n    computationTimeMs: performance.now() - startTime,\n  };\n}\n","import { Trade } from '../models/trade'\nimport { DailyLogEntry } from '../models/daily-log'\nimport {\n  WalkForwardConfig,\n  WalkForwardComputation,\n  WalkForwardParameterRanges,\n  WalkForwardPeriodResult,\n  WalkForwardProgressEvent,\n  WalkForwardResults,\n  WalkForwardSummary,\n  WalkForwardWindow,\n  PerformanceFloorConfig,\n  DiversificationConfig,\n  PeriodDiversificationMetrics,\n  SkippedWindow,\n} from '../models/walk-forward'\nimport { PortfolioStatsCalculator } from './portfolio-stats'\nimport { calculateKellyMetrics } from './kelly'\nimport { PortfolioStats } from '../models/portfolio-stats'\nimport {\n  calculateCorrelationMatrix,\n  calculateCorrelationAnalytics,\n  CorrelationOptions,\n} from './correlation'\nimport { performTailRiskAnalysis } from './tail-risk-analysis'\nimport { TailRiskAnalysisOptions } from '../models/tail-risk'\n\nconst DAY_MS = 24 * 60 * 60 * 1000\nconst DEFAULT_MIN_IN_SAMPLE_TRADES = 10\nconst DEFAULT_MIN_OUT_SAMPLE_TRADES = 3\nconst DEFAULT_FIXED_FRACTION_PCT = 2\nconst MAX_PARAMETER_COMBINATIONS = 20000\nconst YIELD_EVERY = 50\n\ninterface AnalyzeOptions {\n  trades: Trade[]\n  /**\n   * Daily portfolio logs. Reserved for future use to enable more accurate\n   * equity curve calculations during walk-forward periods. Currently unused.\n   */\n  dailyLogs?: DailyLogEntry[]\n  config: WalkForwardConfig\n  signal?: AbortSignal\n  onProgress?: (event: WalkForwardProgressEvent) => void\n}\n\ninterface ScalingBaseline {\n  baseKellyFraction: number\n  avgContracts: number\n}\n\ninterface CombinationIterator {\n  values: Array<Record<string, number>>\n  count: number\n}\n\nexport class WalkForwardAnalyzer {\n  // Cache for trade timestamps to avoid repeated Date parsing\n  private tradeTimestampCache = new Map<Trade, number>()\n\n  private getTradeTimestamp(trade: Trade): number {\n    let ts = this.tradeTimestampCache.get(trade)\n    if (ts === undefined) {\n      ts = new Date(trade.dateOpened).getTime()\n      this.tradeTimestampCache.set(trade, ts)\n    }\n    return ts\n  }\n\n  async analyze(options: AnalyzeOptions): Promise<WalkForwardComputation> {\n    this.ensureValidConfig(options.config)\n\n    // Clear cache for new analysis\n    this.tradeTimestampCache.clear()\n\n    const sortedTrades = this.sortTrades(options.trades)\n    const calculator = new PortfolioStatsCalculator()\n    const startedAt = new Date()\n\n    if (sortedTrades.length === 0) {\n      const emptyResults = this.buildResults([], options.config, 0, 0, sortedTrades.length, startedAt)\n      return {\n        config: options.config,\n        results: emptyResults,\n        startedAt,\n        completedAt: new Date(),\n      }\n    }\n\n    const windows = this.buildWindows(sortedTrades, options.config)\n    options.onProgress?.({\n      phase: 'segmenting',\n      currentPeriod: 0,\n      totalPeriods: windows.length,\n      message: `Prepared ${windows.length} optimization windows`,\n    })\n\n    const periods: WalkForwardPeriodResult[] = []\n    const skippedWindows: SkippedWindow[] = []\n    let totalParameterTests = 0\n\n    for (let index = 0; index < windows.length; index++) {\n      this.throwIfAborted(options.signal)\n\n      const window = windows[index]\n      const inSampleTrades = this.filterTrades(sortedTrades, window.inSampleStart, window.inSampleEnd)\n      const outSampleTrades = this.filterTrades(sortedTrades, window.outOfSampleStart, window.outOfSampleEnd)\n\n      const minInSample = options.config.minInSampleTrades ?? DEFAULT_MIN_IN_SAMPLE_TRADES\n      const minOutSample = options.config.minOutOfSampleTrades ?? DEFAULT_MIN_OUT_SAMPLE_TRADES\n\n      if (inSampleTrades.length < minInSample || outSampleTrades.length < minOutSample) {\n        const reason = inSampleTrades.length < minInSample ? 'insufficient_is_trades' as const : 'insufficient_oos_trades' as const\n        const detail = inSampleTrades.length < minInSample\n          ? `${inSampleTrades.length} IS trades < min ${minInSample}`\n          : `${outSampleTrades.length} OOS trades < min ${minOutSample}`\n        skippedWindows.push({ ...window, reason, detail })\n        continue\n      }\n\n      const combinationIterator = this.buildCombinationIterator(options.config.parameterRanges || {})\n      if (combinationIterator.count > MAX_PARAMETER_COMBINATIONS) {\n        throw new Error(\n          `Walk-forward parameter grid too large (${combinationIterator.count.toLocaleString()} combinations). ` +\n          `Reduce ranges or increase step sizes.`\n        )\n      }\n\n      options.onProgress?.({\n        phase: 'optimizing',\n        currentPeriod: index + 1,\n        totalPeriods: windows.length,\n        totalCombinations: combinationIterator.count,\n        testedCombinations: 0,\n        window,\n      })\n\n      const baseline = this.buildScalingBaseline(inSampleTrades)\n      const inSampleInitialCapital = PortfolioStatsCalculator.calculateInitialCapital(inSampleTrades)\n      const outSampleInitialCapital = PortfolioStatsCalculator.calculateInitialCapital(outSampleTrades)\n\n      let tested = 0\n      let bestCombo: {\n        params: Record<string, number>\n        inSampleStats: PortfolioStats\n        score: number\n      } | null = null\n\n      // Check if diversification constraints need to be enforced during optimization\n      const diversificationConfig = options.config.diversificationConfig\n      const enforceDiversificationConstraints =\n        diversificationConfig?.enableCorrelationConstraint ||\n        diversificationConfig?.enableTailRiskConstraint\n\n      for (const params of combinationIterator.values) {\n        this.throwIfAborted(options.signal)\n        tested++\n\n        const scaledInSampleTrades = this.applyScenario(\n          inSampleTrades,\n          params,\n          baseline,\n          inSampleInitialCapital\n        )\n        const inSampleStats = calculator.calculatePortfolioStats(scaledInSampleTrades)\n\n        if (!this.isRiskAcceptable(params, inSampleStats, scaledInSampleTrades, options.config.performanceFloor)) {\n          continue\n        }\n\n        // Check diversification constraints if enabled\n        // This rejects parameter combinations where strategies are too correlated\n        // or have excessive tail dependence during the in-sample period\n        if (enforceDiversificationConstraints && diversificationConfig) {\n          const inSampleDivMetrics = this.calculateDiversificationMetrics(\n            scaledInSampleTrades,\n            diversificationConfig\n          )\n          if (inSampleDivMetrics && !this.isDiversificationAcceptable(inSampleDivMetrics, diversificationConfig)) {\n            continue\n          }\n        }\n\n        const targetValue = this.getTargetMetricValue(inSampleStats, options.config.optimizationTarget)\n        if (!Number.isFinite(targetValue)) {\n          continue\n        }\n\n        if (!bestCombo || targetValue > bestCombo.score) {\n          bestCombo = {\n            params: { ...params },\n            inSampleStats,\n            score: targetValue,\n          }\n        }\n\n        if (tested % YIELD_EVERY === 0) {\n          await this.yieldToEventLoop()\n        }\n\n        options.onProgress?.({\n          phase: 'optimizing',\n          currentPeriod: index + 1,\n          totalPeriods: windows.length,\n          totalCombinations: combinationIterator.count,\n          testedCombinations: tested,\n          window,\n        })\n      }\n\n      totalParameterTests += tested\n\n      if (!bestCombo) {\n        skippedWindows.push({\n          ...window,\n          reason: 'no_viable_params',\n          detail: `All ${combinationIterator.count} combo${combinationIterator.count === 1 ? '' : 's'} rejected`,\n        })\n        continue\n      }\n\n      const scaledOutSampleTrades = this.applyScenario(\n        outSampleTrades,\n        bestCombo.params,\n        baseline,\n        outSampleInitialCapital\n      )\n      const outSampleStats = calculator.calculatePortfolioStats(scaledOutSampleTrades)\n\n      // Calculate diversification metrics for OOS period if enabled\n      let diversificationMetrics: PeriodDiversificationMetrics | undefined\n      if (enforceDiversificationConstraints && diversificationConfig) {\n        const metrics = this.calculateDiversificationMetrics(\n          scaledOutSampleTrades,\n          diversificationConfig\n        )\n        if (metrics) {\n          diversificationMetrics = metrics\n        }\n      }\n\n      const period: WalkForwardPeriodResult = {\n        ...window,\n        optimalParameters: bestCombo.params,\n        inSampleMetrics: bestCombo.inSampleStats,\n        outOfSampleMetrics: outSampleStats,\n        targetMetricInSample: bestCombo.score,\n        targetMetricOutOfSample: this.getTargetMetricValue(outSampleStats, options.config.optimizationTarget),\n        diversificationMetrics,\n      }\n\n      periods.push(period)\n\n      options.onProgress?.({\n        phase: 'evaluating',\n        currentPeriod: index + 1,\n        totalPeriods: windows.length,\n        testedCombinations: tested,\n        totalCombinations: combinationIterator.count,\n        window,\n      })\n    }\n\n    const completedAt = new Date()\n    const results = this.buildResults(\n      periods,\n      options.config,\n      windows.length,\n      totalParameterTests,\n      sortedTrades.length,\n      startedAt,\n      completedAt,\n      skippedWindows\n    )\n\n    options.onProgress?.({\n      phase: 'completed',\n      currentPeriod: windows.length,\n      totalPeriods: windows.length,\n      message: 'Walk-forward analysis complete',\n    })\n\n    return {\n      config: options.config,\n      results,\n      startedAt,\n      completedAt,\n    }\n  }\n\n  private ensureValidConfig(config: WalkForwardConfig): void {\n    if (config.inSampleDays <= 0) {\n      throw new Error('inSampleDays must be greater than zero')\n    }\n    if (config.outOfSampleDays <= 0) {\n      throw new Error('outOfSampleDays must be greater than zero')\n    }\n    if (config.stepSizeDays <= 0) {\n      throw new Error('stepSizeDays must be greater than zero')\n    }\n  }\n\n  private sortTrades(trades: Trade[]): Trade[] {\n    return [...trades].sort((a, b) => {\n      const dateA = this.getTradeTimestamp(a)\n      const dateB = this.getTradeTimestamp(b)\n      if (dateA !== dateB) return dateA - dateB\n      return (a.timeOpened || '').localeCompare(b.timeOpened || '')\n    })\n  }\n\n  private filterTrades(trades: Trade[], start: Date, end: Date): Trade[] {\n    const startMs = start.getTime()\n    // Add full day to end date to include all trades on that day regardless of time\n    const endMs = end.getTime() + DAY_MS - 1\n    return trades.filter((trade) => {\n      const tradeDate = this.getTradeTimestamp(trade)\n      return tradeDate >= startMs && tradeDate <= endMs\n    })\n  }\n\n  private buildWindows(trades: Trade[], config: WalkForwardConfig): WalkForwardWindow[] {\n    if (trades.length === 0) return []\n\n    const firstDate = this.floorToUTCDate(new Date(trades[0].dateOpened))\n    const lastDate = this.floorToUTCDate(new Date(trades[trades.length - 1].dateOpened))\n    const windows: WalkForwardWindow[] = []\n\n    let cursor = firstDate.getTime()\n\n    while (cursor < lastDate.getTime()) {\n      const inSampleStart = new Date(cursor)\n      const inSampleEnd = new Date(cursor + (config.inSampleDays - 1) * DAY_MS)\n      const outOfSampleStart = new Date(inSampleEnd.getTime() + DAY_MS)\n      const outOfSampleEnd = new Date(outOfSampleStart.getTime() + (config.outOfSampleDays - 1) * DAY_MS)\n\n      if (outOfSampleStart > lastDate) {\n        break\n      }\n\n      windows.push({\n        inSampleStart,\n        inSampleEnd,\n        outOfSampleStart,\n        outOfSampleEnd,\n      })\n\n      cursor += config.stepSizeDays * DAY_MS\n    }\n\n    return windows\n  }\n\n  private floorToUTCDate(date: Date): Date {\n    const floored = new Date(Date.UTC(date.getUTCFullYear(), date.getUTCMonth(), date.getUTCDate()))\n    return floored\n  }\n\n  private buildCombinationIterator(parameterRanges: WalkForwardParameterRanges): CombinationIterator {\n    const entries = Object.entries(parameterRanges || {})\n    if (entries.length === 0) {\n      return { values: [{}], count: 1 }\n    }\n\n    const values = entries.map(([key, [min, max, step]]) => ({\n      key,\n      values: this.buildRangeValues(min, max, step),\n    }))\n\n    const combinations: Array<Record<string, number>> = []\n\n    const recurse = (index: number, current: Record<string, number>) => {\n      if (index === values.length) {\n        combinations.push({ ...current })\n        return\n      }\n\n      const entry = values[index]\n      entry.values.forEach((value) => {\n        current[entry.key] = value\n        recurse(index + 1, current)\n      })\n    }\n\n    recurse(0, {})\n\n    return { values: combinations, count: combinations.length }\n  }\n\n  private buildRangeValues(min: number, max: number, step: number): number[] {\n    if (max < min) {\n      throw new Error(`Invalid parameter range: max (${max}) must be >= min (${min}).`)\n    }\n    if (step <= 0) {\n      throw new Error(`Invalid parameter step size (${step}). Step must be positive.`)\n    }\n\n    const values: number[] = []\n    const totalSteps = Math.floor((max - min) / step)\n    for (let i = 0; i <= totalSteps; i++) {\n      const value = min + i * step\n      values.push(Number(value.toFixed(6)))\n    }\n\n    if (!values.includes(Number(max.toFixed(6)))) {\n      values.push(Number(max.toFixed(6)))\n    }\n\n    return values\n  }\n\n  private buildScalingBaseline(trades: Trade[]): ScalingBaseline {\n    const kellyMetrics = calculateKellyMetrics(trades)\n    const avgContracts =\n      trades.length > 0\n        ? trades.reduce((sum, trade) => sum + Math.abs(trade.numContracts || 0), 0) / trades.length\n        : 1\n\n    return {\n      baseKellyFraction: kellyMetrics.fraction || 0,\n      avgContracts: avgContracts > 0 ? avgContracts : 1,\n    }\n  }\n\n  private applyScenario(\n    trades: Trade[],\n    params: Record<string, number>,\n    baseline: ScalingBaseline,\n    initialCapitalOverride?: number\n  ): Trade[] {\n    if (trades.length === 0) return []\n\n    const initialCapital =\n      typeof initialCapitalOverride === 'number'\n        ? initialCapitalOverride\n        : PortfolioStatsCalculator.calculateInitialCapital(trades)\n\n    const positionMultiplier = this.calculatePositionMultiplier(params, baseline)\n    const strategyWeights = this.buildStrategyWeights(params)\n    const hasStrategyWeights = Object.keys(strategyWeights).length > 0\n\n    // trades are already sorted from filterTrades() which preserves sortedTrades order\n    let runningEquity = initialCapital\n    const scaledTrades: Trade[] = []\n\n    for (const trade of trades) {\n      const strategyWeight = strategyWeights[this.normalizeStrategyKey(trade.strategy)] ?? 1\n\n      // Skip trades from strategies with zero weight (excluded from this combination)\n      // This prevents zero-P/L trades from inflating trade counts and diluting metrics\n      if (hasStrategyWeights && strategyWeight === 0) {\n        continue\n      }\n\n      const scale = positionMultiplier * strategyWeight\n      const scaledPl = trade.pl * scale\n\n      runningEquity += scaledPl\n\n      // Only include fields used by PortfolioStatsCalculator to reduce object copy overhead\n      scaledTrades.push({\n        pl: scaledPl,\n        dateOpened: trade.dateOpened,\n        timeOpened: trade.timeOpened,\n        dateClosed: trade.dateClosed,\n        timeClosed: trade.timeClosed,\n        fundsAtClose: runningEquity,\n        openingCommissionsFees: trade.openingCommissionsFees * Math.abs(scale),\n        closingCommissionsFees: trade.closingCommissionsFees * Math.abs(scale),\n        strategy: trade.strategy,\n      } as Trade)\n    }\n\n    return scaledTrades\n  }\n\n  private calculatePositionMultiplier(params: Record<string, number>, baseline: ScalingBaseline): number {\n    let multiplier = 1\n\n    if (typeof params.kellyMultiplier === 'number' && params.kellyMultiplier > 0) {\n      multiplier *= params.kellyMultiplier\n    }\n\n    if (typeof params.fixedFractionPct === 'number' && params.fixedFractionPct > 0) {\n      multiplier *= params.fixedFractionPct / DEFAULT_FIXED_FRACTION_PCT\n    }\n\n    if (typeof params.fixedContracts === 'number' && params.fixedContracts > 0) {\n      const baseContracts = baseline.avgContracts > 0 ? baseline.avgContracts : 1\n      multiplier *= params.fixedContracts / baseContracts\n    }\n\n    return Math.max(multiplier, 0)\n  }\n\n  private buildStrategyWeights(params: Record<string, number>): Record<string, number> {\n    const weights: Record<string, number> = {}\n    Object.entries(params).forEach(([key, value]) => {\n      if (key.startsWith('strategy:')) {\n        const strategyName = key.slice('strategy:'.length)\n        weights[this.normalizeStrategyKey(strategyName)] = Math.max(0, value)\n      }\n    })\n    return weights\n  }\n\n  private normalizeStrategyKey(strategy?: string): string {\n    return (strategy || 'Unknown').toLowerCase()\n  }\n\n  private isRiskAcceptable(\n    params: Record<string, number>,\n    stats: PortfolioStats,\n    scaledTrades: Trade[],\n    performanceFloor?: PerformanceFloorConfig\n  ): boolean {\n    // Parameter-based risk constraints\n    if (typeof params.maxDrawdownPct === 'number' && stats.maxDrawdown > params.maxDrawdownPct) {\n      return false\n    }\n\n    if (typeof params.consecutiveLossLimit === 'number') {\n      const maxLosses = this.calculateMaxConsecutiveLosses(scaledTrades)\n      if (maxLosses > params.consecutiveLossLimit) {\n        return false\n      }\n    }\n\n    if (typeof params.maxDailyLossPct === 'number') {\n      const initialCapital = PortfolioStatsCalculator.calculateInitialCapital(scaledTrades)\n      const maxDailyLoss = this.calculateMaxDailyLossPct(scaledTrades, initialCapital)\n      if (maxDailyLoss > params.maxDailyLossPct) {\n        return false\n      }\n    }\n\n    // Performance floor checks (Phase 2)\n    if (performanceFloor) {\n      if (performanceFloor.enableMinSharpe && performanceFloor.minSharpeRatio > 0) {\n        const sharpe = stats.sharpeRatio ?? Number.NEGATIVE_INFINITY\n        if (sharpe < performanceFloor.minSharpeRatio) {\n          return false\n        }\n      }\n\n      if (performanceFloor.enableMinProfitFactor && performanceFloor.minProfitFactor > 0) {\n        const pf = stats.profitFactor ?? 0\n        if (pf < performanceFloor.minProfitFactor) {\n          return false\n        }\n      }\n\n      if (performanceFloor.enablePositiveNetPl) {\n        const netPl = stats.netPl ?? 0\n        if (netPl <= 0) {\n          return false\n        }\n      }\n    }\n\n    return true\n  }\n\n  /**\n   * Calculate diversification metrics for a set of trades\n   * Returns null if there aren't enough strategies for meaningful analysis\n   */\n  private calculateDiversificationMetrics(\n    trades: Trade[],\n    config: DiversificationConfig\n  ): PeriodDiversificationMetrics | null {\n    // Need at least 2 strategies for correlation/diversification analysis\n    const strategies = new Set(trades.map((t) => t.strategy).filter(Boolean))\n    if (strategies.size < 2) {\n      return null\n    }\n\n    // Build correlation options from config\n    const correlationOptions: CorrelationOptions = {\n      method: config.correlationMethod,\n      normalization: config.normalization,\n      dateBasis: config.dateBasis,\n      alignment: 'shared',\n      timePeriod: 'daily',\n    }\n\n    // Calculate correlation matrix\n    const correlationMatrix = calculateCorrelationMatrix(trades, correlationOptions)\n    const correlationAnalytics = calculateCorrelationAnalytics(correlationMatrix)\n\n    // Calculate tail risk if enabled\n    let tailRiskResult = null\n    if (config.enableTailRiskConstraint) {\n      const tailRiskOptions: TailRiskAnalysisOptions = {\n        tailThreshold: config.tailThreshold,\n        normalization: config.normalization,\n        dateBasis: config.dateBasis,\n      }\n      tailRiskResult = performTailRiskAnalysis(trades, tailRiskOptions)\n    }\n\n    // Handle NaN values for strongest correlation (occurs when no valid pairs)\n    const maxCorrelation = Number.isNaN(correlationAnalytics.strongest.value)\n      ? 0\n      : correlationAnalytics.strongest.value\n    const maxCorrelationPair = correlationAnalytics.strongest.pair[0]\n      ? correlationAnalytics.strongest.pair\n      : (['', ''] as [string, string])\n\n    // Calculate total pairs for this period\n    const numStrategies = correlationMatrix.strategies.length\n    const totalPairs = (numStrategies * (numStrategies - 1)) / 2\n\n    return {\n      avgCorrelation: Number.isNaN(correlationAnalytics.averageCorrelation)\n        ? 0\n        : correlationAnalytics.averageCorrelation,\n      maxCorrelation,\n      maxCorrelationPair,\n      avgTailDependence: tailRiskResult?.analytics.averageJointTailRisk ?? 0,\n      maxTailDependence: tailRiskResult?.analytics.highestJointTailRisk.value ?? 0,\n      maxTailDependencePair: (tailRiskResult?.analytics.highestJointTailRisk.pair ?? [\n        '',\n        '',\n      ]) as [string, string],\n      effectiveFactors: tailRiskResult?.effectiveFactors ?? correlationMatrix.strategies.length,\n      highRiskPairsPct: tailRiskResult?.analytics.highRiskPairsPct ?? 0,\n      // Track insufficient tail data for UI display\n      insufficientTailDataPairs: tailRiskResult?.insufficientDataPairs ?? totalPairs,\n      totalPairs,\n    }\n  }\n\n  /**\n   * Check if diversification constraints are met\n   */\n  private isDiversificationAcceptable(\n    metrics: PeriodDiversificationMetrics,\n    config: DiversificationConfig\n  ): boolean {\n    // Check correlation constraint\n    if (config.enableCorrelationConstraint) {\n      if (metrics.maxCorrelation > config.maxCorrelationThreshold) {\n        return false\n      }\n    }\n\n    // Check tail risk constraint\n    if (config.enableTailRiskConstraint) {\n      if (metrics.maxTailDependence > config.maxTailDependenceThreshold) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  private calculateMaxConsecutiveLosses(trades: Trade[]): number {\n    let maxLosses = 0\n    let currentLosses = 0\n\n    // trades are already sorted from applyScenario()\n    trades.forEach((trade) => {\n      if (trade.pl < 0) {\n        currentLosses++\n        maxLosses = Math.max(maxLosses, currentLosses)\n      } else {\n        currentLosses = 0\n      }\n    })\n\n    return maxLosses\n  }\n\n  private calculateMaxDailyLossPct(trades: Trade[], initialCapital: number): number {\n    if (initialCapital === 0) return 0\n\n    const lossesByDay = new Map<string, number>()\n\n    trades.forEach((trade) => {\n      const dateKey = this.normalizeDateKey(trade.dateClosed || trade.dateOpened)\n      lossesByDay.set(dateKey, (lossesByDay.get(dateKey) || 0) + trade.pl)\n    })\n\n    let maxLossPct = 0\n\n    lossesByDay.forEach((pl) => {\n      if (pl < 0) {\n        const lossPct = (Math.abs(pl) / initialCapital) * 100\n        maxLossPct = Math.max(maxLossPct, lossPct)\n      }\n    })\n\n    return maxLossPct\n  }\n\n  private normalizeDateKey(date: Date | string): string {\n    const parsed = new Date(date)\n    return parsed.toISOString().split('T')[0]\n  }\n\n  private getTargetMetricValue(stats: PortfolioStats, target: WalkForwardConfig['optimizationTarget']): number {\n    switch (target) {\n      case 'profitFactor':\n        return stats.profitFactor ?? Number.NEGATIVE_INFINITY\n      case 'sharpeRatio':\n        return stats.sharpeRatio ?? Number.NEGATIVE_INFINITY\n      case 'sortinoRatio':\n        return stats.sortinoRatio ?? Number.NEGATIVE_INFINITY\n      case 'calmarRatio':\n        return stats.calmarRatio ?? Number.NEGATIVE_INFINITY\n      case 'cagr':\n        return stats.cagr ?? Number.NEGATIVE_INFINITY\n      case 'avgDailyPl':\n        return stats.avgDailyPl ?? Number.NEGATIVE_INFINITY\n      case 'winRate':\n        return stats.winRate ?? Number.NEGATIVE_INFINITY\n      // Diversification targets are not yet supported for optimization\n      // They require computing correlation/tail risk for EACH parameter combination\n      // which is expensive. For now, they're used as constraints, not targets.\n      case 'minAvgCorrelation':\n      case 'minTailRisk':\n      case 'maxEffectiveFactors':\n        return Number.NEGATIVE_INFINITY\n      case 'netPl':\n      default:\n        return stats.netPl ?? Number.NEGATIVE_INFINITY\n    }\n  }\n\n  private async yieldToEventLoop(): Promise<void> {\n    await new Promise((resolve) => setTimeout(resolve, 0))\n  }\n\n  private throwIfAborted(signal?: AbortSignal): void {\n    if (signal?.aborted) {\n      throw new Error('Walk-forward analysis aborted')\n    }\n  }\n\n  private buildResults(\n    periods: WalkForwardPeriodResult[],\n    config: WalkForwardConfig,\n    totalPeriods: number,\n    totalParameterTests: number,\n    analyzedTrades: number,\n    startedAt: Date,\n    completedAt: Date = new Date(),\n    skippedWindows: SkippedWindow[] = []\n  ): WalkForwardResults {\n    const summary = this.calculateSummary(periods)\n    const stats = {\n      totalPeriods,\n      evaluatedPeriods: periods.length,\n      skippedPeriods: skippedWindows.length,\n      totalParameterTests,\n      analyzedTrades,\n      durationMs: completedAt.getTime() - startedAt.getTime(),\n      consistencyScore: this.calculateConsistencyScore(periods),\n      averagePerformanceDelta: this.calculateAveragePerformanceDelta(periods),\n    }\n\n    const robustnessScore = this.calculateRobustnessScore(summary, stats.consistencyScore)\n\n    return {\n      periods,\n      skippedWindows,\n      summary: { ...summary, robustnessScore },\n      stats,\n    }\n  }\n\n  /**\n   * Calculates summary metrics for walk-forward analysis results.\n   *\n   * The `degradationFactor` (efficiency ratio) compares out-of-sample to in-sample performance.\n   * This is equivalent to Walk Forward Efficiency (WFE) from Pardo's methodology.\n   *\n   * **Why we don't annualize:** Unlike raw return comparisons, we compare the same target metric\n   * (e.g., Sharpe Ratio to Sharpe Ratio, or Net P&L to Net P&L) across IS and OOS periods.\n   * Ratio metrics like Sharpe already normalize for time. Annualization would be appropriate\n   * for comparing raw dollar returns across different period lengths, but our optimization\n   * targets are typically normalized metrics. The Pardo annualization formula applies to\n   * raw profit comparisons, not ratio-based target metrics.\n   *\n   * Formula: `degradationFactor = avgOutOfSamplePerformance / avgInSamplePerformance`\n   * - 1.0 = OOS matches IS perfectly (rare)\n   * - 0.8 = OOS retains 80% of IS performance (good)\n   * - 0.5 = OOS retains 50% of IS performance (concerning)\n   *\n   * @see Pardo, Robert. \"The Evaluation and Optimization of Trading Strategies\" (2008)\n   */\n  private calculateSummary(periods: WalkForwardPeriodResult[]): WalkForwardSummary {\n    if (periods.length === 0) {\n      return {\n        avgInSamplePerformance: 0,\n        avgOutOfSamplePerformance: 0,\n        degradationFactor: 0,\n        parameterStability: 0,\n        robustnessScore: 0,\n      }\n    }\n\n    const inSampleValues = periods.map((p) => p.targetMetricInSample).filter((value) => Number.isFinite(value))\n    const outSampleValues = periods.map((p) => p.targetMetricOutOfSample).filter((value) => Number.isFinite(value))\n\n    const avgInSample =\n      inSampleValues.length > 0\n        ? inSampleValues.reduce((sum, value) => sum + value, 0) / inSampleValues.length\n        : 0\n    const avgOutSample =\n      outSampleValues.length > 0\n        ? outSampleValues.reduce((sum, value) => sum + value, 0) / outSampleValues.length\n        : 0\n\n    const degradationFactor = avgInSample !== 0 ? avgOutSample / avgInSample : 0\n    const parameterStability = this.calculateParameterStability(periods)\n\n    const summary: WalkForwardSummary = {\n      avgInSamplePerformance: avgInSample,\n      avgOutOfSamplePerformance: avgOutSample,\n      degradationFactor,\n      parameterStability,\n      robustnessScore: 0,\n    }\n\n    // Aggregate diversification metrics across periods\n    const periodsWithDiversification = periods.filter((p) => p.diversificationMetrics)\n    if (periodsWithDiversification.length > 0) {\n      summary.avgCorrelationAcrossPeriods =\n        periodsWithDiversification.reduce(\n          (sum, p) => sum + (p.diversificationMetrics?.avgCorrelation ?? 0),\n          0\n        ) / periodsWithDiversification.length\n\n      summary.avgTailDependenceAcrossPeriods =\n        periodsWithDiversification.reduce(\n          (sum, p) => sum + (p.diversificationMetrics?.avgTailDependence ?? 0),\n          0\n        ) / periodsWithDiversification.length\n\n      summary.avgEffectiveFactors =\n        periodsWithDiversification.reduce(\n          (sum, p) => sum + (p.diversificationMetrics?.effectiveFactors ?? 0),\n          0\n        ) / periodsWithDiversification.length\n    }\n\n    return summary\n  }\n\n  /**\n   * Calculates parameter stability across walk-forward periods using coefficient of variation.\n   *\n   * For each optimized parameter, we calculate how much the optimal value varied\n   * across periods. Lower variance = higher stability = more robust parameters.\n   *\n   * **Statistical approach:**\n   * - Uses sample variance (N-1 denominator) rather than population variance (N)\n   * - Sample variance is preferred for small samples (N<30) per standard statistical practice\n   * - The coefficient of variation (CV = stdDev/mean) normalizes across different parameter scales\n   * - CV is inverted to produce a 0-1 stability score (1 = perfectly stable, 0 = highly variable)\n   *\n   * **Interpretation:**\n   * - CV < 0.3 (30%): Parameter is stable across periods\n   * - CV >= 0.3: Parameter shows meaningful variation (potential over-optimization risk)\n   *\n   * @returns Stability score between 0 and 1, where 1 indicates perfectly stable parameters\n   */\n  private calculateParameterStability(periods: WalkForwardPeriodResult[]): number {\n    if (periods.length <= 1) return 1\n\n    const parameterKeys = new Set<string>()\n    periods.forEach((period) => {\n      Object.keys(period.optimalParameters).forEach((key) => parameterKeys.add(key))\n    })\n\n    if (parameterKeys.size === 0) return 1\n\n    const stabilityScores: number[] = []\n\n    parameterKeys.forEach((key) => {\n      const values = periods\n        .map((period) => period.optimalParameters[key])\n        .filter((value): value is number => typeof value === 'number')\n\n      if (values.length <= 1) {\n        stabilityScores.push(1)\n        return\n      }\n\n      const mean =\n        values.reduce((sum, value) => sum + value, 0) / values.length\n      // Use sample variance (N-1) for small sample accuracy\n      // Population variance (N) underestimates true variability for small samples\n      const variance =\n        values.reduce((sum, value) => sum + Math.pow(value - mean, 2), 0) / (values.length - 1)\n      const stdDev = Math.sqrt(variance)\n\n      // Normalize by mean to avoid requiring parameter ranges here\n      const normalizedStd = mean !== 0 ? Math.min(Math.abs(stdDev / mean), 1) : Math.min(stdDev, 1)\n      stabilityScores.push(1 - normalizedStd)\n    })\n\n    const avgStability = stabilityScores.reduce((sum, value) => sum + value, 0) / stabilityScores.length\n    return Math.min(Math.max(avgStability, 0), 1)\n  }\n\n  private calculateConsistencyScore(periods: WalkForwardPeriodResult[]): number {\n    if (periods.length === 0) return 0\n    const profitable = periods.filter((period) => period.targetMetricOutOfSample >= 0)\n    return profitable.length / periods.length\n  }\n\n  private calculateAveragePerformanceDelta(periods: WalkForwardPeriodResult[]): number {\n    if (periods.length === 0) return 0\n    const deltas = periods.map(\n      (period) => period.targetMetricOutOfSample - period.targetMetricInSample\n    )\n    return deltas.reduce((sum, delta) => sum + delta, 0) / deltas.length\n  }\n\n  /**\n   * Calculates a composite robustness score combining efficiency, stability, and consistency.\n   *\n   * **IMPORTANT:** This is a TradeBlocks-specific composite metric, NOT an industry-standard formula.\n   * Individual platforms (MultiCharts, TradeStation, AmiBroker) use configurable weights and\n   * thresholds rather than a single composite score. This metric provides a quick overview\n   * but users should examine individual components for detailed analysis.\n   *\n   * **Components (equally weighted):**\n   * 1. **Efficiency Score** (normalized degradation factor): How well OOS matched IS performance\n   *    - Degradation factor of 1.0 (100% retention) = efficiency score of 0.5\n   *    - Degradation factor of 2.0+ = efficiency score of 1.0 (capped)\n   *    - Based on Pardo's Walk Forward Efficiency concept\n   *\n   * 2. **Stability Score** (parameter stability): How consistent optimal parameters were\n   *    - Uses coefficient of variation (CV) per standard statistical practice\n   *    - Lower CV = higher stability\n   *\n   * 3. **Consistency Score**: Percentage of periods with non-negative OOS performance\n   *    - Similar to MultiCharts \"% Profitable Runs\" metric\n   *    - 70%+ considered good per MultiCharts robustness criteria\n   *\n   * Formula: `robustnessScore = (efficiencyScore + stabilityScore + consistencyScore) / 3`\n   *\n   * @returns Score between 0 and 1, where higher indicates more robust strategy\n   */\n  private calculateRobustnessScore(summary: WalkForwardSummary, consistencyScore: number): number {\n    const efficiencyScore = this.normalize(summary.degradationFactor, 0, 2)\n    const stabilityScore = Math.min(Math.max(summary.parameterStability, 0), 1)\n    const consistency = Math.min(Math.max(consistencyScore, 0), 1)\n\n    const score = (efficiencyScore + stabilityScore + consistency) / 3\n    return Math.min(Math.max(score, 0), 1)\n  }\n\n  private normalize(value: number, min: number, max: number): number {\n    if (max === min) return 0\n    const clamped = Math.max(Math.min(value, max), min)\n    return (clamped - min) / (max - min)\n  }\n}\n","/**\n * Walk-Forward Degradation (WFD) Engine\n *\n * Measures how out-of-sample performance evolves relative to in-sample\n * performance across progressive time windows. Produces OOS efficiency\n * ratios (OOS metric / IS metric) for Sharpe, win rate, and profit factor,\n * with linear regression trend detection and recent-vs-historical comparison.\n *\n * All outputs are factual, numerical data -- no interpretive labels.\n *\n * Consumed by the MCP tool in Plan 02 and by verdict synthesis in Phase 50.\n */\n\nimport { Trade } from '../models/trade'\nimport { PortfolioStatsCalculator } from './portfolio-stats'\nimport { computeTrends, type TrendResult } from './trend-detection'\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface WFDConfig {\n  /** In-sample window duration in calendar days. Default: 365. */\n  inSampleDays: number\n  /** Out-of-sample window duration in calendar days. Default: 90. */\n  outOfSampleDays: number\n  /** Step size in calendar days between consecutive windows. Default: 90. */\n  stepSizeDays: number\n  /** Minimum trade count for a period to be considered sufficient. Default: 10. */\n  minTradesPerPeriod: number\n  /** Number of recent WF periods for recent-vs-historical comparison. Default: 3. */\n  recentPeriodCount: number\n  /** Optional case-insensitive strategy filter. */\n  strategy?: string\n  /** When true, normalize trade P&L to 1-lot (divide pl by numContracts) before computing metrics. Prevents position sizing growth from contaminating IS/OOS efficiency comparisons. */\n  normalizeTo1Lot?: boolean\n  /** Minimum fraction of median OOS trade count for a period to be included in weighted averages. Default: 0.5. Periods below this are computed but excluded from aggregates. Set to 0 to disable. */\n  minOosFraction?: number\n  /** When true, weight efficiency averages by OOS trade count instead of equal weighting. Default: true. */\n  weightByTradeCount?: boolean\n}\n\nexport interface WFDWindow {\n  periodIndex: number\n  inSampleStart: string\n  inSampleEnd: string\n  outOfSampleStart: string\n  outOfSampleEnd: string\n  inSampleTradeCount: number\n  outOfSampleTradeCount: number\n}\n\nexport interface WFDMetricSet {\n  sharpe: number | null\n  winRate: number | null\n  profitFactor: number | null\n}\n\nexport interface WFDPeriodResult {\n  window: WFDWindow\n  metrics: {\n    sharpe: { inSample: number | null; outOfSample: number | null; efficiency: number | null }\n    winRate: { inSample: number | null; outOfSample: number | null; efficiency: number | null }\n    profitFactor: { inSample: number | null; outOfSample: number | null; efficiency: number | null }\n  }\n  sufficient: boolean\n  warnings: string[]\n}\n\nexport interface WFDResult {\n  periods: WFDPeriodResult[]\n  efficiencyTrends: {\n    sharpe: TrendResult | null\n    winRate: TrendResult | null\n    profitFactor: TrendResult | null\n  }\n  recentVsHistorical: {\n    recentPeriodCount: number\n    recentAvgEfficiency: WFDMetricSet\n    historicalAvgEfficiency: WFDMetricSet\n    delta: WFDMetricSet\n  }\n  /** Trade-count weighted overall efficiency across all qualifying periods. */\n  weightedOverallEfficiency: WFDMetricSet\n  config: WFDConfig\n  dataQuality: {\n    totalTrades: number\n    totalPeriods: number\n    sufficientPeriods: number\n    /** Periods excluded by minOosFraction threshold. */\n    excludedByOosFraction: number\n    skippedPeriods: number\n    sufficientForTrends: boolean\n    warnings: string[]\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nconst DAY_MS = 24 * 60 * 60 * 1000\n\nconst EFFICIENCY_EPSILON: Record<string, number> = {\n  sharpe: 0.01,\n  profitFactor: 0.01,\n  winRate: 0,\n}\n\nconst DEFAULT_CONFIG: WFDConfig = {\n  inSampleDays: 365,\n  outOfSampleDays: 90,\n  stepSizeDays: 90,\n  minTradesPerPeriod: 10,\n  recentPeriodCount: 3,\n}\n\n// ---------------------------------------------------------------------------\n// Private helpers\n// ---------------------------------------------------------------------------\n\n/**\n * Sort trades chronologically by dateOpened (local time), then by timeOpened.\n */\nfunction sortTradesChronologically(trades: Trade[]): Trade[] {\n  return [...trades].sort((a, b) => {\n    const dateA = new Date(a.dateOpened)\n    const dateB = new Date(b.dateOpened)\n    const yearA = dateA.getFullYear() * 10000 + dateA.getMonth() * 100 + dateA.getDate()\n    const yearB = dateB.getFullYear() * 10000 + dateB.getMonth() * 100 + dateB.getDate()\n    if (yearA !== yearB) return yearA - yearB\n    return (a.timeOpened || '').localeCompare(b.timeOpened || '')\n  })\n}\n\n/**\n * Format a Date as local YYYY-MM-DD using local time methods.\n */\nfunction formatLocalDate(date: Date): string {\n  const y = date.getFullYear()\n  const m = String(date.getMonth() + 1).padStart(2, '0')\n  const d = String(date.getDate()).padStart(2, '0')\n  return `${y}-${m}-${d}`\n}\n\n/**\n * Floor a Date to midnight in local time (zero out time components).\n */\nfunction floorToLocalDate(date: Date): Date {\n  return new Date(date.getFullYear(), date.getMonth(), date.getDate())\n}\n\n/**\n * Build progressive sliding windows across the trade history.\n */\nfunction buildDegradationWindows(\n  firstTradeDate: Date,\n  lastTradeDate: Date,\n  config: WFDConfig,\n): WFDWindow[] {\n  const windows: WFDWindow[] = []\n  const firstMs = floorToLocalDate(firstTradeDate).getTime()\n  const lastMs = floorToLocalDate(lastTradeDate).getTime()\n  let cursor = firstMs\n  let periodIndex = 0\n\n  while (cursor < lastMs) {\n    const isStart = new Date(cursor)\n    const isEnd = new Date(cursor + (config.inSampleDays - 1) * DAY_MS)\n    const oosStart = new Date(isEnd.getTime() + DAY_MS)\n    const oosEnd = new Date(oosStart.getTime() + (config.outOfSampleDays - 1) * DAY_MS)\n\n    // Stop if OOS starts beyond last trade date\n    if (oosStart.getTime() > lastMs) break\n\n    windows.push({\n      periodIndex,\n      inSampleStart: formatLocalDate(isStart),\n      inSampleEnd: formatLocalDate(isEnd),\n      outOfSampleStart: formatLocalDate(oosStart),\n      outOfSampleEnd: formatLocalDate(oosEnd),\n      inSampleTradeCount: 0,\n      outOfSampleTradeCount: 0,\n    })\n\n    cursor += config.stepSizeDays * DAY_MS\n    periodIndex++\n  }\n\n  return windows\n}\n\n/**\n * Filter trades whose dateOpened falls within [startDate, endDate] inclusive,\n * using local date comparison.\n */\nfunction filterTradesForWindow(sortedTrades: Trade[], startDate: string, endDate: string): Trade[] {\n  return sortedTrades.filter((t) => {\n    const d = formatLocalDate(new Date(t.dateOpened))\n    return d >= startDate && d <= endDate\n  })\n}\n\n/**\n * Compute Sharpe, win rate, and profit factor for a set of trades.\n */\nfunction computeMetrics(trades: Trade[]): WFDMetricSet {\n  if (trades.length === 0) {\n    return { sharpe: null, winRate: 0, profitFactor: 0 }\n  }\n\n  // Sharpe via PortfolioStatsCalculator\n  const calculator = new PortfolioStatsCalculator()\n  const stats = calculator.calculatePortfolioStats(trades)\n  const sharpe = stats.sharpeRatio !== undefined ? stats.sharpeRatio : null\n\n  // Win rate: wins / total\n  let winCount = 0\n  let grossProfit = 0\n  let grossLoss = 0\n  for (const t of trades) {\n    if (t.pl > 0) {\n      winCount++\n      grossProfit += t.pl\n    } else if (t.pl < 0) {\n      grossLoss += Math.abs(t.pl)\n    }\n  }\n  const winRate = winCount / trades.length\n  const profitFactor = grossLoss > 0\n    ? grossProfit / grossLoss\n    : grossProfit > 0 ? Infinity : 0\n\n  return { sharpe, winRate, profitFactor }\n}\n\n/**\n * Compute OOS/IS efficiency ratio with division-by-near-zero safety.\n */\nfunction computeEfficiency(\n  oosValue: number | null,\n  isValue: number | null,\n  metric: string,\n): number | null {\n  if (oosValue === null || isValue === null) return null\n  if (!Number.isFinite(oosValue) || !Number.isFinite(isValue)) return null\n\n  const eps = EFFICIENCY_EPSILON[metric] ?? 0.01\n  if (Math.abs(isValue) < eps) return null\n  // Negative IS Sharpe produces misleading efficiency ratios\n  // (e.g., -0.5 / -1.26 = 0.40 looks good but is meaningless)\n  if (metric === 'sharpe' && isValue < 0) return null\n\n  return oosValue / isValue\n}\n\n/**\n * Average an array of numbers, excluding nulls. Returns null if empty.\n */\nfunction averageNullable(values: (number | null)[]): number | null {\n  const valid = values.filter((v): v is number => v !== null)\n  if (valid.length === 0) return null\n  return valid.reduce((sum, v) => sum + v, 0) / valid.length\n}\n\n/**\n * Weighted average of values by weights, excluding nulls. Returns null if empty.\n */\nfunction weightedAverageNullable(\n  values: (number | null)[],\n  weights: number[],\n): number | null {\n  let totalWeight = 0\n  let weightedSum = 0\n  for (let i = 0; i < values.length; i++) {\n    const v = values[i]\n    if (v === null) continue\n    const w = weights[i] ?? 0\n    weightedSum += v * w\n    totalWeight += w\n  }\n  if (totalWeight === 0) return null\n  return weightedSum / totalWeight\n}\n\n/**\n * Compute median of a numeric array. Returns 0 for empty arrays.\n */\nfunction median(values: number[]): number {\n  if (values.length === 0) return 0\n  const sorted = [...values].sort((a, b) => a - b)\n  const mid = Math.floor(sorted.length / 2)\n  return sorted.length % 2 === 0 ? (sorted[mid - 1] + sorted[mid]) / 2 : sorted[mid]\n}\n\n// ---------------------------------------------------------------------------\n// Main exported function\n// ---------------------------------------------------------------------------\n\n/**\n * Analyze walk-forward degradation across progressive IS/OOS windows.\n *\n * @param trades - Array of Trade objects\n * @param options - Partial WFD configuration (merged with defaults)\n * @returns WFDResult with periods, efficiency trends, recent-vs-historical comparison, and data quality\n */\nexport function analyzeWalkForwardDegradation(\n  trades: Trade[],\n  options?: Partial<WFDConfig>,\n): WFDResult {\n  // Filter out undefined values so they don't overwrite defaults via spread\n  const definedOptions: Partial<WFDConfig> = {}\n  if (options) {\n    for (const [key, value] of Object.entries(options)) {\n      if (value !== undefined) {\n        ;(definedOptions as Record<string, unknown>)[key] = value\n      }\n    }\n  }\n  const config: WFDConfig = { ...DEFAULT_CONFIG, ...definedOptions }\n\n  // 1. Apply strategy filter (case-insensitive)\n  let filtered = trades\n  if (config.strategy) {\n    const strategyLower = config.strategy.toLowerCase()\n    filtered = trades.filter((t) => t.strategy.toLowerCase() === strategyLower)\n  }\n\n  // 2. Sort chronologically\n  const sortedRaw = sortTradesChronologically(filtered)\n\n  // 2b. Optionally normalize to 1-lot (divide pl by numContracts)\n  const sorted = config.normalizeTo1Lot\n    ? sortedRaw.map(t => ({\n        ...t,\n        pl: t.numContracts > 0 ? t.pl / t.numContracts : t.pl,\n      }))\n    : sortedRaw\n\n  // 3. Validate minimum trades\n  const emptyResult = (): WFDResult => ({\n    periods: [],\n    efficiencyTrends: { sharpe: null, winRate: null, profitFactor: null },\n    recentVsHistorical: {\n      recentPeriodCount: config.recentPeriodCount,\n      recentAvgEfficiency: { sharpe: null, winRate: null, profitFactor: null },\n      historicalAvgEfficiency: { sharpe: null, winRate: null, profitFactor: null },\n      delta: { sharpe: null, winRate: null, profitFactor: null },\n    },\n    weightedOverallEfficiency: { sharpe: null, winRate: null, profitFactor: null },\n    config,\n    dataQuality: {\n      totalTrades: sorted.length,\n      totalPeriods: 0,\n      sufficientPeriods: 0,\n      excludedByOosFraction: 0,\n      skippedPeriods: 0,\n      sufficientForTrends: false,\n      warnings: [],\n    },\n  })\n\n  if (sorted.length < 2) {\n    const result = emptyResult()\n    result.dataQuality.warnings.push(\n      `Insufficient trades (${sorted.length}) -- need at least 2 for walk-forward analysis`,\n    )\n    return result\n  }\n\n  // 4. Build windows\n  const firstDate = new Date(sorted[0].dateOpened)\n  const lastDate = new Date(sorted[sorted.length - 1].dateOpened)\n  const windows = buildDegradationWindows(firstDate, lastDate, config)\n\n  if (windows.length === 0) {\n    const result = emptyResult()\n    result.dataQuality.warnings.push(\n      'Insufficient trade history for any IS+OOS window with current configuration',\n    )\n    return result\n  }\n\n  // 5. Process each window\n  const periods: WFDPeriodResult[] = []\n\n  for (const window of windows) {\n    const isTrades = filterTradesForWindow(sorted, window.inSampleStart, window.inSampleEnd)\n    const oosTrades = filterTradesForWindow(sorted, window.outOfSampleStart, window.outOfSampleEnd)\n\n    window.inSampleTradeCount = isTrades.length\n    window.outOfSampleTradeCount = oosTrades.length\n\n    const sufficient =\n      isTrades.length >= config.minTradesPerPeriod &&\n      oosTrades.length >= config.minTradesPerPeriod\n\n    const warnings: string[] = []\n\n    if (!sufficient) {\n      if (isTrades.length < config.minTradesPerPeriod) {\n        warnings.push(\n          `IS period ${window.periodIndex} has ${isTrades.length} trades (min: ${config.minTradesPerPeriod})`,\n        )\n      }\n      if (oosTrades.length < config.minTradesPerPeriod) {\n        warnings.push(\n          `OOS period ${window.periodIndex} has ${oosTrades.length} trades (min: ${config.minTradesPerPeriod})`,\n        )\n      }\n\n      periods.push({\n        window,\n        metrics: {\n          sharpe: { inSample: null, outOfSample: null, efficiency: null },\n          winRate: { inSample: null, outOfSample: null, efficiency: null },\n          profitFactor: { inSample: null, outOfSample: null, efficiency: null },\n        },\n        sufficient: false,\n        warnings,\n      })\n      continue\n    }\n\n    // Compute IS and OOS metrics\n    const isMetrics = computeMetrics(isTrades)\n    const oosMetrics = computeMetrics(oosTrades)\n\n    // Compute efficiency ratios\n    const sharpeEfficiency = computeEfficiency(oosMetrics.sharpe, isMetrics.sharpe, 'sharpe')\n    const winRateEfficiency = computeEfficiency(oosMetrics.winRate, isMetrics.winRate, 'winRate')\n    const pfEfficiency = computeEfficiency(oosMetrics.profitFactor, isMetrics.profitFactor, 'profitFactor')\n\n    // Warn on negative IS Sharpe\n    if (isMetrics.sharpe !== null && isMetrics.sharpe < 0) {\n      warnings.push(\n        `Negative IS Sharpe in period ${window.periodIndex} -- efficiency ratio may be misleading`,\n      )\n    }\n\n    periods.push({\n      window,\n      metrics: {\n        sharpe: { inSample: isMetrics.sharpe, outOfSample: oosMetrics.sharpe, efficiency: sharpeEfficiency },\n        winRate: { inSample: isMetrics.winRate, outOfSample: oosMetrics.winRate, efficiency: winRateEfficiency },\n        profitFactor: { inSample: isMetrics.profitFactor, outOfSample: oosMetrics.profitFactor, efficiency: pfEfficiency },\n      },\n      sufficient: true,\n      warnings,\n    })\n  }\n\n  // 6. Filter sufficient periods, then apply OOS fraction threshold\n  const sufficientPeriods = periods.filter((p) => p.sufficient)\n  const sufficientCount = sufficientPeriods.length\n\n  const minOosFraction = config.minOosFraction ?? 0.5\n  const useWeighting = config.weightByTradeCount !== false // default true\n\n  // Compute median OOS trade count for relative threshold\n  const oosCounts = sufficientPeriods.map((p) => p.window.outOfSampleTradeCount)\n  const medianOos = median(oosCounts)\n  const minOosTrades = Math.floor(medianOos * minOosFraction)\n\n  // Qualifying periods pass both minTradesPerPeriod AND relative OOS threshold\n  const qualifyingPeriods = minOosFraction > 0\n    ? sufficientPeriods.filter((p) => p.window.outOfSampleTradeCount >= minOosTrades)\n    : sufficientPeriods\n  const excludedByOosFraction = sufficientCount - qualifyingPeriods.length\n\n  // Helper to get efficiency values and weights from a period slice\n  const getEfficiencyData = (slice: WFDPeriodResult[]) => ({\n    sharpeEff: slice.map((p) => p.metrics.sharpe.efficiency),\n    winRateEff: slice.map((p) => p.metrics.winRate.efficiency),\n    pfEff: slice.map((p) => p.metrics.profitFactor.efficiency),\n    weights: slice.map((p) => p.window.outOfSampleTradeCount),\n  })\n\n  // Averaging function: weighted or equal depending on config\n  const avgFn = (values: (number | null)[], weights: number[]): number | null =>\n    useWeighting ? weightedAverageNullable(values, weights) : averageNullable(values)\n\n  // 6b. Compute efficiency trends on qualifying periods (unweighted for regression)\n  const sharpeEffValues = qualifyingPeriods.map((p) => p.metrics.sharpe.efficiency).filter((v): v is number => v !== null)\n  const winRateEffValues = qualifyingPeriods.map((p) => p.metrics.winRate.efficiency).filter((v): v is number => v !== null)\n  const pfEffValues = qualifyingPeriods.map((p) => p.metrics.profitFactor.efficiency).filter((v): v is number => v !== null)\n\n  const trendSeries: Record<string, number[]> = {}\n  if (sharpeEffValues.length >= 2) trendSeries.sharpe = sharpeEffValues\n  if (winRateEffValues.length >= 2) trendSeries.winRate = winRateEffValues\n  if (pfEffValues.length >= 2) trendSeries.profitFactor = pfEffValues\n\n  const trends = computeTrends(trendSeries)\n  const efficiencyTrends = {\n    sharpe: (trends.sharpe as TrendResult) ?? null,\n    winRate: (trends.winRate as TrendResult) ?? null,\n    profitFactor: (trends.profitFactor as TrendResult) ?? null,\n  }\n\n  // 7. Compute weighted overall efficiency across all qualifying periods\n  const allData = getEfficiencyData(qualifyingPeriods)\n  const weightedOverallEfficiency: WFDMetricSet = {\n    sharpe: avgFn(allData.sharpeEff, allData.weights),\n    winRate: avgFn(allData.winRateEff, allData.weights),\n    profitFactor: avgFn(allData.pfEff, allData.weights),\n  }\n\n  // 8. Compute recent vs historical comparison (weighted)\n  const qualifyingCount = qualifyingPeriods.length\n  const recentCount = Math.min(config.recentPeriodCount, qualifyingCount)\n  const recentPeriodSlice = qualifyingPeriods.slice(-recentCount)\n  const historicalPeriodSlice = qualifyingPeriods.slice(0, Math.max(0, qualifyingCount - recentCount))\n\n  const recentData = getEfficiencyData(recentPeriodSlice)\n  const historicalData = getEfficiencyData(historicalPeriodSlice)\n\n  const recentAvgEfficiency: WFDMetricSet = {\n    sharpe: avgFn(recentData.sharpeEff, recentData.weights),\n    winRate: avgFn(recentData.winRateEff, recentData.weights),\n    profitFactor: avgFn(recentData.pfEff, recentData.weights),\n  }\n\n  const historicalAvgEfficiency: WFDMetricSet = {\n    sharpe: avgFn(historicalData.sharpeEff, historicalData.weights),\n    winRate: avgFn(historicalData.winRateEff, historicalData.weights),\n    profitFactor: avgFn(historicalData.pfEff, historicalData.weights),\n  }\n\n  const delta: WFDMetricSet = {\n    sharpe:\n      recentAvgEfficiency.sharpe !== null && historicalAvgEfficiency.sharpe !== null\n        ? recentAvgEfficiency.sharpe - historicalAvgEfficiency.sharpe\n        : null,\n    winRate:\n      recentAvgEfficiency.winRate !== null && historicalAvgEfficiency.winRate !== null\n        ? recentAvgEfficiency.winRate - historicalAvgEfficiency.winRate\n        : null,\n    profitFactor:\n      recentAvgEfficiency.profitFactor !== null && historicalAvgEfficiency.profitFactor !== null\n        ? recentAvgEfficiency.profitFactor - historicalAvgEfficiency.profitFactor\n        : null,\n  }\n\n  // 9. Build data quality\n  const skippedPeriods = periods.length - sufficientCount\n  const sufficientForTrends = qualifyingCount >= 4\n  const topWarnings: string[] = []\n\n  if (excludedByOosFraction > 0) {\n    topWarnings.push(\n      `${excludedByOosFraction} period(s) excluded by OOS fraction threshold (${minOosTrades} min trades, median ${medianOos})`,\n    )\n  }\n\n  if (!sufficientForTrends && qualifyingCount > 0) {\n    topWarnings.push(\n      `Only ${qualifyingCount} qualifying periods -- need at least 4 for meaningful trend analysis`,\n    )\n  }\n\n  return {\n    periods,\n    efficiencyTrends,\n    recentVsHistorical: {\n      recentPeriodCount: recentCount,\n      recentAvgEfficiency,\n      historicalAvgEfficiency,\n      delta,\n    },\n    weightedOverallEfficiency,\n    config,\n    dataQuality: {\n      totalTrades: sorted.length,\n      totalPeriods: periods.length,\n      sufficientPeriods: sufficientCount,\n      excludedByOosFraction,\n      skippedPeriods,\n      sufficientForTrends,\n      warnings: topWarnings,\n    },\n  }\n}\n","/**\n * Calculations Engine - Main exports\n *\n * Provides comprehensive calculation functionality for portfolio analysis.\n */\n\nexport * from './portfolio-stats'\nexport * from './performance'\nexport * from './walk-forward-analyzer'\nexport * from './walk-forward-verdict'\nexport * from './correlation'\nexport * from './monte-carlo'\nexport * from './tail-risk-analysis'\nexport * from './kelly'\nexport * from './daily-exposure'\nexport * from './margin-timeline'\nexport * from './streak-analysis'\nexport * from './flexible-filter'\nexport * from './regime-comparison'\nexport * from './table-aggregation'\nexport * from './threshold-analysis'\nexport * from './static-dataset-matcher'\nexport * from './trend-detection'\nexport * from './period-segmentation'\nexport * from './rolling-metrics'\nexport * from './mc-regime-comparison'\nexport * from './walk-forward-degradation'\nexport * from './trade-matching'\nexport * from './live-alignment'\nexport * from './edge-decay-synthesis'\n// Re-export from cumulative-distribution excluding conflicting name\nexport {\n  type CumulativeDistributionPoint,\n  type CumulativeDistributionAnalysis,\n  type DistributionStats,\n  type ThresholdTradeoff,\n  calculateCumulativeDistribution,\n  findOptimalThreshold as findOptimalDistributionThreshold,\n} from './cumulative-distribution'\nexport * from './walk-forward-interpretation'\nexport * from './enrich-trades'\nexport * from './statistical-utils'\nexport * from './mfe-mae'\n\n// Re-export types for convenience\nexport * from '../models/portfolio-stats'\n\n// Calculation cache interface\nexport interface CalculationCache {\n  portfolioStats?: unknown\n  performanceMetrics?: unknown\n  strategyStats?: unknown\n  lastCalculated: Date\n  dataHash: string\n}\n\n// Utility function to generate data hash for caching\nexport function generateDataHash(trades: unknown[], dailyLogs?: unknown[]): string {\n  const data = {\n    tradeCount: trades.length,\n    firstTradeDate: trades.length > 0 ? (trades[0] as { dateOpened?: string })?.dateOpened : null,\n    lastTradeDate: trades.length > 0 ? (trades[trades.length - 1] as { dateOpened?: string })?.dateOpened : null,\n    dailyLogCount: dailyLogs?.length || 0,\n  }\n\n  return btoa(JSON.stringify(data))\n}\n\n// Calculation orchestrator\nexport class CalculationOrchestrator {\n  private cache = new Map<string, CalculationCache>()\n\n  /**\n   * Calculate all metrics for a block\n   */\n  async calculateAll(\n    blockId: string,\n    trades: unknown[],\n    dailyLogs?: unknown[],\n    config?: unknown\n  ): Promise<{\n    portfolioStats: unknown\n    strategyStats: unknown\n    performanceMetrics: unknown\n    calculationTime: number\n  }> {\n    const startTime = Date.now()\n\n    // Check cache\n    const dataHash = generateDataHash(trades, dailyLogs)\n    const cached = this.cache.get(blockId)\n\n    if (cached && cached.dataHash === dataHash) {\n      return {\n        portfolioStats: cached.portfolioStats,\n        strategyStats: cached.strategyStats,\n        performanceMetrics: cached.performanceMetrics,\n        calculationTime: Date.now() - startTime,\n      }\n    }\n\n    // Calculate fresh results\n    const calculator = new PortfolioStatsCalculator(config as Partial<AnalysisConfig>)\n    const portfolioStats = calculator.calculatePortfolioStats(trades as Trade[], dailyLogs as DailyLogEntry[])\n    const strategyStats = calculator.calculateStrategyStats(trades as Trade[])\n    const performanceMetrics = PerformanceCalculator.calculatePerformanceMetrics(trades as Trade[], dailyLogs as DailyLogEntry[])\n\n    // Cache results\n    this.cache.set(blockId, {\n      portfolioStats,\n      strategyStats,\n      performanceMetrics,\n      lastCalculated: new Date(),\n      dataHash,\n    })\n\n    return {\n      portfolioStats,\n      strategyStats,\n      performanceMetrics,\n      calculationTime: Date.now() - startTime,\n    }\n  }\n\n  /**\n   * Clear cache for a specific block\n   */\n  clearCache(blockId: string): void {\n    this.cache.delete(blockId)\n  }\n\n  /**\n   * Clear all cache\n   */\n  clearAllCache(): void {\n    this.cache.clear()\n  }\n\n  /**\n   * Get cache size\n   */\n  getCacheSize(): number {\n    return this.cache.size\n  }\n}\n\n// Global calculation orchestrator instance\nexport const calculationOrchestrator = new CalculationOrchestrator()\n\n// Import legacy calculation classes for compatibility\nimport { PortfolioStatsCalculator } from './portfolio-stats'\nimport { PerformanceCalculator } from './performance'\nimport { Trade } from '../models/trade'\nimport { DailyLogEntry } from '../models/daily-log'\nimport { AnalysisConfig } from '../models/portfolio-stats'\n","/**\n * Reporting trade model represents backtested strategy executions coming from the\n * strategy-trade-log.csv export. These records are used to align theoretical\n * performance with the real trade log for a block.\n */\nexport interface ReportingTrade {\n  strategy: string\n  dateOpened: Date\n  timeOpened?: string\n  openingPrice: number\n  legs: string\n  initialPremium: number\n  numContracts: number\n  pl: number\n  closingPrice?: number\n  dateClosed?: Date\n  timeClosed?: string\n  avgClosingCost?: number\n  reasonForClose?: string\n}\n\n/**\n * Raw reporting trade data direct from the CSV prior to conversion.\n */\nexport interface RawReportingTradeData {\n  \"Strategy\": string\n  \"Date Opened\": string\n  \"Time Opened\"?: string\n  \"Opening Price\": string\n  \"Legs\": string\n  \"Initial Premium\": string\n  \"No. of Contracts\": string\n  \"P/L\": string\n  \"Closing Price\"?: string\n  \"Date Closed\"?: string\n  \"Time Closed\"?: string\n  \"Avg. Closing Cost\"?: string\n  \"Reason For Close\"?: string\n}\n\n/**\n * Required columns that must be present for a reporting log import to be valid.\n */\nexport const REQUIRED_REPORTING_TRADE_COLUMNS = [\n  \"Strategy\",\n  \"Date Opened\",\n  \"Opening Price\",\n  \"Legs\",\n  \"Initial Premium\",\n  \"No. of Contracts\",\n  \"P/L\",\n] as const\n\n/**\n * Column aliases to support slight variations in exports.\n */\nexport const REPORTING_TRADE_COLUMN_ALIASES: Record<string, string> = {\n  \"Initial Premium ($)\": \"Initial Premium\",\n  \"Initial Credit\": \"Initial Premium\",\n  \"Contracts\": \"No. of Contracts\",\n  \"Contracts Traded\": \"No. of Contracts\",\n  \"PL\": \"P/L\",\n}\n","/**\n * TAT (Trade Automation Toolbox) CSV Adapter\n *\n * Converts TAT CSV export rows into ReportingTrade objects.\n * TAT is used for live execution of options strategies (primarily double calendars).\n * This adapter allows comparing TAT execution results against Option Omega backtests\n * using the existing Trading Calendar comparison infrastructure.\n *\n * TAT CSV columns (key fields):\n *   Strategy, OpenDate, OpenTime, CloseDate, CloseTime, PriceOpen, PriceClose,\n *   TotalPremium, Qty, ContractCount, ProfitLoss, Commission, Status,\n *   ShortPut, LongPut, ShortCall, LongCall, UnderlyingSymbol, TradeType, TradeID\n *\n * Key mapping differences from OO:\n *   - strategy ← Template (not Strategy, which is a user-defined grouping in TAT)\n *   - openingPrice: TAT does not report underlying price level (always 0)\n *   - initialPremium ← TotalPremium / Qty (per-spread, matching OO semantics)\n *   - numContracts ← Qty (spreads), NOT ContractCount (total legs)\n */\n\nimport type { ReportingTrade } from '../models/reporting-trade'\n\n/**\n * TAT-specific required headers for format detection.\n * All three must be present (case-insensitive) to identify a TAT export.\n */\nconst TAT_SIGNATURE_HEADERS = ['tradeid', 'profitloss', 'buyingpower']\n\n/**\n * Detect whether CSV headers indicate a TAT export.\n */\nexport function isTatFormat(headers: string[]): boolean {\n  const lower = headers.map(h => h.toLowerCase().trim())\n  return TAT_SIGNATURE_HEADERS.every(sig => lower.includes(sig))\n}\n\n/**\n * Parse a date string preserving the calendar day.\n * Handles both YYYY-MM-DD (precise) and M/D/YYYY (display) formats.\n * Creates Date at local midnight to avoid timezone shifting.\n */\nfunction parseTatDate(dateStr: string): Date | null {\n  if (!dateStr || dateStr.trim() === '') return null\n\n  // Try YYYY-MM-DD first (OpenDate/CloseDate format)\n  const isoMatch = dateStr.match(/^(\\d{4})-(\\d{2})-(\\d{2})/)\n  if (isoMatch) {\n    const [, year, month, day] = isoMatch\n    return new Date(parseInt(year), parseInt(month) - 1, parseInt(day))\n  }\n\n  // Try M/D/YYYY (Date field format)\n  const usMatch = dateStr.match(/^(\\d{1,2})\\/(\\d{1,2})\\/(\\d{4})/)\n  if (usMatch) {\n    const [, month, day, year] = usMatch\n    return new Date(parseInt(year), parseInt(month) - 1, parseInt(day))\n  }\n\n  return null\n}\n\n/**\n * Format a 24-hour time string (HH:MM:SS) to 12-hour format (H:MM AM/PM).\n * Also accepts already-formatted \"H:MM AM/PM\" strings and passes them through.\n */\nfunction formatTatTime(timeStr: string): string | undefined {\n  if (!timeStr || timeStr.trim() === '') return undefined\n\n  // Already in AM/PM format? Pass through.\n  if (/[AP]M$/i.test(timeStr.trim())) return timeStr.trim()\n\n  // Parse 24-hour format: HH:MM or HH:MM:SS\n  const match = timeStr.match(/^(\\d{1,2}):(\\d{2})/)\n  if (!match) return undefined\n\n  const hours = parseInt(match[1], 10)\n  const minutes = match[2]\n  const period = hours >= 12 ? 'PM' : 'AM'\n  const displayHours = hours % 12 || 12\n\n  return `${displayHours}:${minutes} ${period}`\n}\n\n/**\n * Build a human-readable legs string from TAT strike columns.\n *\n * Format: \"SPX 6905P/7125C | 6905P/7125C DC\"\n *         (short legs)      (long legs)   (trade type)\n *\n * The \" | \" separator is required for compatibility with the LegsRow UI\n * component which splits on it.\n */\nexport function buildTatLegsString(row: Record<string, string>): string {\n  const symbol = (row.UnderlyingSymbol || '').trim()\n  const tradeType = (row.TradeType || '').trim()\n  const shortPut = (row.ShortPut || '').trim()\n  const shortCall = (row.ShortCall || '').trim()\n  const longPut = (row.LongPut || '').trim()\n  const longCall = (row.LongCall || '').trim()\n\n  const isPresent = (v: string) => v !== '' && v !== '0'\n\n  // Build short leg description\n  const shortParts: string[] = []\n  if (isPresent(shortPut)) shortParts.push(`${shortPut}P`)\n  if (isPresent(shortCall)) shortParts.push(`${shortCall}C`)\n  const shortLeg = shortParts.join('/')\n\n  // Build long leg description\n  const longParts: string[] = []\n  if (isPresent(longPut)) longParts.push(`${longPut}P`)\n  if (isPresent(longCall)) longParts.push(`${longCall}C`)\n  const longLeg = longParts.join('/')\n\n  // Combine with symbol prefix and trade type suffix\n  const prefix = symbol ? `${symbol} ` : ''\n  const suffix = tradeType ? ` ${tradeType}` : ''\n\n  if (shortLeg && longLeg) {\n    return `${prefix}${shortLeg} | ${longLeg}${suffix}`\n  }\n  if (shortLeg) return `${prefix}${shortLeg}${suffix}`\n  if (longLeg) return `${prefix}${longLeg}${suffix}`\n\n  return tradeType || 'Unknown'\n}\n\n/**\n * Parse a numeric value from a TAT CSV field.\n * Handles empty strings, whitespace, NaN.\n */\nfunction parseNumber(value: string | undefined, defaultValue?: number): number {\n  if (!value || value.trim() === '' || value.toLowerCase() === 'nan') {\n    return defaultValue ?? 0\n  }\n  const cleaned = value.replace(/[$,%]/g, '').trim()\n  const parsed = parseFloat(cleaned)\n  return isNaN(parsed) ? (defaultValue ?? 0) : parsed\n}\n\n/**\n * Convert a single TAT CSV row to a ReportingTrade object.\n * Returns null if the row is missing required data (date or P/L).\n */\n/**\n * Normalize row keys to canonical PascalCase used by TAT exports.\n * This allows conversion to work even if CSV headers have different casing.\n */\nfunction normalizeRowKeys(row: Record<string, string>): Record<string, string> {\n  const keyMap: Record<string, string> = {}\n  for (const key of Object.keys(row)) {\n    keyMap[key.toLowerCase()] = key\n  }\n\n  const canonicalKeys = [\n    'OpenDate', 'Date', 'CloseDate', 'OpenTime', 'CloseTime',\n    'TimeOpened', 'TimeClosed', 'ProfitLoss', 'PriceOpen', 'PriceClose',\n    'TotalPremium', 'Qty', 'Strategy', 'Template', 'Status',\n    'UnderlyingSymbol', 'TradeType', 'ShortPut', 'ShortCall', 'LongPut', 'LongCall',\n  ]\n\n  const normalized: Record<string, string> = { ...row }\n  for (const canonical of canonicalKeys) {\n    if (!(canonical in normalized)) {\n      const actual = keyMap[canonical.toLowerCase()]\n      if (actual) normalized[canonical] = row[actual]\n    }\n  }\n  return normalized\n}\n\nexport function convertTatRowToReportingTrade(\n  row: Record<string, string>\n): ReportingTrade | null {\n  // Normalize keys so conversion works regardless of CSV header casing\n  row = normalizeRowKeys(row)\n\n  // Parse date: prefer OpenDate, fall back to Date\n  const dateOpened = parseTatDate(row.OpenDate) ?? parseTatDate(row.Date)\n  if (!dateOpened || isNaN(dateOpened.getTime())) return null\n\n  // P/L is required\n  const plStr = (row.ProfitLoss || '').trim()\n  if (!plStr) return null\n\n  // Parse closing date: prefer CloseDate, fall back to parsing TimeClosed date\n  const dateClosed = parseTatDate(row.CloseDate) ?? undefined\n\n  // Parse times: prefer precise OpenTime/CloseTime, fall back to TimeOpened/TimeClosed\n  const timeOpened = formatTatTime(row.OpenTime) ?? formatTatTime(row.TimeOpened)\n  const timeClosed = formatTatTime(row.CloseTime) ?? formatTatTime(row.TimeClosed)\n\n  const legs = buildTatLegsString(row)\n\n  const qty = parseNumber(row.Qty, 1)\n\n  return {\n    // Template = strategy name (matches OO's Strategy); Strategy = user-defined grouping\n    strategy: (row.Template || row.Strategy || '').trim() || 'Unknown',\n    dateOpened,\n    timeOpened,\n    openingPrice: 0, // OO reports underlying price level; TAT does not provide this\n    legs,\n    initialPremium: qty !== 0 ? parseNumber(row.TotalPremium) / qty : parseNumber(row.TotalPremium), // Per-spread premium (matches OO semantics)\n    numContracts: qty, // Qty = spreads (matches OO semantics)\n    pl: parseNumber(row.ProfitLoss),\n    closingPrice: row.PriceClose ? parseNumber(row.PriceClose) : undefined,\n    dateClosed,\n    timeClosed,\n    reasonForClose: (row.Status || '').trim() || undefined,\n  }\n}\n","import { Trade } from \"../models/trade\";\n\nexport const MIN_TRADES_PER_YEAR = 10;\nconst MS_PER_DAY = 1000 * 60 * 60 * 24;\n\n/**\n * Estimate annual trade frequency from a sample of trades.\n *\n * Ensures realistic pacing for strategy-filtered simulations where the global\n * portfolio frequency would otherwise overstate the number of opportunities.\n */\nexport function estimateTradesPerYear(\n  sampleTrades: Trade[],\n  fallback: number\n): number {\n  if (sampleTrades.length < 2) {\n    return Math.max(MIN_TRADES_PER_YEAR, fallback);\n  }\n\n  const sortedTrades = [...sampleTrades].sort(\n    (a, b) => a.dateOpened.getTime() - b.dateOpened.getTime()\n  );\n\n  const firstDate = sortedTrades[0].dateOpened;\n  const lastDate = sortedTrades[sortedTrades.length - 1].dateOpened;\n  const daysElapsed = (lastDate.getTime() - firstDate.getTime()) / MS_PER_DAY;\n\n  if (daysElapsed <= 0) {\n    return Math.max(MIN_TRADES_PER_YEAR, fallback);\n  }\n\n  const yearsElapsed = daysElapsed / 365.25;\n  if (yearsElapsed < 0.01) {\n    return Math.max(MIN_TRADES_PER_YEAR, fallback);\n  }\n\n  const computed = Math.round(sampleTrades.length / yearsElapsed);\n  return Math.max(MIN_TRADES_PER_YEAR, computed);\n}\n","/**\n * CSV Discovery & Type Detection\n *\n * Shared module for detecting CSV file types (tradelog, dailylog, reportinglog)\n * by examining column headers. Used by both block-loader.ts and block-sync.ts.\n *\n * This module must NOT import from block-loader.ts to avoid circular dependencies.\n */\n\nimport * as fs from \"fs/promises\";\nimport * as path from \"path\";\nimport { REPORTING_TRADE_COLUMN_ALIASES } from \"@tradeblocks/lib\";\n\n/**\n * CSV file mappings for flexible discovery\n */\nexport interface CsvMappings {\n  tradelog?: string;\n  dailylog?: string;\n  reportinglog?: string;\n}\n\n/**\n * CSV type detection result\n */\nexport type CsvType = \"tradelog\" | \"dailylog\" | \"reportinglog\" | null;\n\n/**\n * Parse a single CSV line handling quoted fields\n */\nfunction parseCSVLine(line: string): string[] {\n  const result: string[] = [];\n  let current = \"\";\n  let inQuotes = false;\n\n  for (let i = 0; i < line.length; i++) {\n    const char = line[i];\n\n    if (char === '\"') {\n      if (inQuotes && line[i + 1] === '\"') {\n        current += '\"';\n        i++;\n      } else {\n        inQuotes = !inQuotes;\n      }\n    } else if (char === \",\" && !inQuotes) {\n      result.push(current.trim());\n      current = \"\";\n    } else {\n      current += char;\n    }\n  }\n\n  result.push(current.trim());\n  return result;\n}\n\n/**\n * Read just the header line from a CSV file (for detection)\n */\nasync function readCsvHeaders(filePath: string): Promise<string[]> {\n  const content = await fs.readFile(filePath, \"utf-8\");\n  const firstLine = content.replace(/^\\uFEFF/, \"\").split(\"\\n\")[0] || \"\";\n  return parseCSVLine(firstLine).map((h) => h.toLowerCase().trim());\n}\n\n/**\n * Detect CSV type by examining column headers.\n * Returns the detected type or null if unrecognized.\n */\nexport async function detectCsvType(filePath: string): Promise<CsvType> {\n  try {\n    const headers = await readCsvHeaders(filePath);\n\n    // Trade log detection:\n    // Required: \"P/L\" or \"P&L\" or \"Profit/Loss\"\n    // Plus at least 2 of: \"Date Opened\", \"Date Closed\", \"Symbol\", \"Strategy\", \"Contracts\", \"Premium\"\n    const plColumnAliases = [\"p/l\", \"p&l\", \"profit/loss\", \"pl\"];\n    const tradeOptionalColumns = [\n      \"date opened\",\n      \"date closed\",\n      \"symbol\",\n      \"strategy\",\n      \"contracts\",\n      \"no. of contracts\",\n      \"premium\",\n      \"legs\",\n    ];\n\n    const hasPl = plColumnAliases.some((alias) => headers.includes(alias));\n    // Match trade columns - require header to contain the full column pattern\n    const matchedTradeColumns = tradeOptionalColumns.filter((col) =>\n      headers.some((h) => h.includes(col))\n    );\n\n    if (hasPl && matchedTradeColumns.length >= 2) {\n      // Before classifying as tradelog, check if this looks like a reporting log.\n      // Option Omega reporting exports share P/L + Date Opened + Strategy + Contracts\n      // but also have \"Initial Premium\" (or aliases) which tradelogs use \"Premium\" instead.\n      const reportingOnlyColumns = [\"initial premium\", \"initial credit\", \"initial premium ($)\"];\n      const hasReportingOnly = reportingOnlyColumns.some((col) =>\n        headers.some((h) => h.includes(col))\n      );\n      if (hasReportingOnly) {\n        return \"reportinglog\";\n      }\n      return \"tradelog\";\n    }\n\n    // Daily log detection:\n    // Required: \"Date\" (but not \"Date Opened\"/\"Date Closed\"), and value column\n    const hasSimpleDate = headers.some(\n      (h) => h === \"date\" || (h.includes(\"date\") && !h.includes(\"opened\") && !h.includes(\"closed\"))\n    );\n    const valueColumnAliases = [\n      \"portfolio value\",\n      \"value\",\n      \"equity\",\n      \"net liquidity\",\n      \"netliquidity\",\n    ];\n    const hasValue = valueColumnAliases.some((alias) =>\n      headers.some((h) => h.includes(alias) || alias.includes(h))\n    );\n\n    // Dailylog: has date + value columns but lacks trade-specific columns\n    if (hasSimpleDate && hasValue && matchedTradeColumns.length < 2) {\n      return \"dailylog\";\n    }\n\n    // TAT (Trade Automation Toolbox) detection:\n    // Has \"TradeID\" AND \"ProfitLoss\" AND \"BuyingPower\"\n    const tatSignature = ['tradeid', 'profitloss', 'buyingpower'];\n    const isTat = tatSignature.every((sig) => headers.includes(sig));\n    if (isTat) {\n      return 'reportinglog';\n    }\n\n    // Reporting log detection:\n    // Has \"Actual P/L\" or columns from REPORTING_TRADE_COLUMN_ALIASES\n    const reportingAliases = Object.keys(REPORTING_TRADE_COLUMN_ALIASES).map(\n      (k) => k.toLowerCase()\n    );\n    const hasReportingColumns = reportingAliases.some((alias) =>\n      headers.includes(alias)\n    );\n    const hasActualPl = headers.some(\n      (h) => h.includes(\"actual\") && h.includes(\"p\")\n    );\n    const hasReportedStyle =\n      headers.includes(\"trade id\") ||\n      headers.some((h) => h.includes(\"reported\"));\n\n    if (hasActualPl || hasReportingColumns || hasReportedStyle) {\n      // Double-check it's not a regular tradelog\n      if (!hasPl || hasActualPl) {\n        return \"reportinglog\";\n      }\n    }\n\n    // If we have P/L and trade columns, fallback to tradelog\n    if (hasPl && matchedTradeColumns.length >= 1) {\n      return \"tradelog\";\n    }\n\n    return null;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Discover CSV files in a folder and detect their types.\n * Returns mapping of detected CSV types to filenames.\n */\nexport async function discoverCsvFiles(\n  folderPath: string\n): Promise<{ mappings: CsvMappings; unrecognized: string[] }> {\n  const mappings: CsvMappings = {};\n  const unrecognized: string[] = [];\n\n  try {\n    const entries = await fs.readdir(folderPath, { withFileTypes: true });\n    const csvFiles = entries\n      .filter((e) => e.isFile() && e.name.toLowerCase().endsWith(\".csv\"))\n      .map((e) => e.name);\n\n    // First, check for exact standard names\n    if (csvFiles.includes(\"tradelog.csv\")) {\n      mappings.tradelog = \"tradelog.csv\";\n    }\n    if (csvFiles.includes(\"dailylog.csv\")) {\n      mappings.dailylog = \"dailylog.csv\";\n    }\n    if (csvFiles.includes(\"reportinglog.csv\")) {\n      mappings.reportinglog = \"reportinglog.csv\";\n    }\n\n    // Second, check for filename patterns (before content detection)\n    if (!mappings.reportinglog) {\n      const strategyLogFile = csvFiles.find((f) => {\n        const lower = f.toLowerCase();\n        return (\n          lower.includes(\"strategy-trade-log\") ||\n          lower.includes(\"strategylog\") ||\n          lower.startsWith(\"strategy-log\")\n        );\n      });\n      if (strategyLogFile) {\n        mappings.reportinglog = strategyLogFile;\n      }\n    }\n\n    // For any remaining CSVs, detect by content\n    for (const csvFile of csvFiles) {\n      // Skip if already mapped via exact name or filename pattern\n      if (\n        csvFile === \"tradelog.csv\" ||\n        csvFile === \"dailylog.csv\" ||\n        csvFile === \"reportinglog.csv\" ||\n        csvFile === mappings.reportinglog\n      ) {\n        continue;\n      }\n\n      const csvPath = path.join(folderPath, csvFile);\n      const detectedType = await detectCsvType(csvPath);\n\n      if (detectedType) {\n        // Only assign if we haven't found this type yet\n        if (detectedType === \"tradelog\" && !mappings.tradelog) {\n          mappings.tradelog = csvFile;\n        } else if (detectedType === \"dailylog\" && !mappings.dailylog) {\n          mappings.dailylog = csvFile;\n        } else if (detectedType === \"reportinglog\" && !mappings.reportinglog) {\n          mappings.reportinglog = csvFile;\n        } else {\n          // Type already found, this is an extra CSV\n          unrecognized.push(csvFile);\n        }\n      } else {\n        unrecognized.push(csvFile);\n      }\n    }\n  } catch {\n    // Folder read error - return empty\n  }\n\n  return { mappings, unrecognized };\n}\n\n/**\n * Log warning when folder has CSVs but none match expected patterns\n */\nexport function logCsvDiscoveryWarning(\n  folderName: string,\n  csvFiles: string[]\n): void {\n  console.error(`Warning: Folder '${folderName}' has CSV files but none match expected trade log format.`);\n  console.error(`  Found: ${csvFiles.join(\", \")}`);\n  console.error(`  Expected columns: P/L, Date Opened, Date Closed, Symbol, Strategy`);\n}\n"],"mappings":";;;;;;AAAA;AAAA;AAAA;AAAA,aAASA,YAAW;AAClB,aAAO,OAAO,UAAUA,YAAW,OAAO,SAAS,OAAO,OAAO,KAAK,IAAI,SAAU,GAAG;AACrF,iBAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,cAAI,IAAI,UAAU,CAAC;AACnB,mBAAS,KAAK,EAAG,EAAC,CAAC,GAAG,eAAe,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,QAChE;AACA,eAAO;AAAA,MACT,GAAG,OAAO,QAAQ,aAAa,MAAM,OAAO,QAAQ,SAAS,IAAI,OAAO,SAASA,UAAS,MAAM,MAAM,SAAS;AAAA,IACjH;AACA,WAAO,UAAUA,WAAU,OAAO,QAAQ,aAAa,MAAM,OAAO,QAAQ,SAAS,IAAI,OAAO;AAAA;AAAA;;;ACFhG,YAAYC,SAAQ;AACpB,YAAYC,WAAU;;;ACgCtB,SAAS,sBAAwC;AACjD,SAAS,gBAAgB;AACzB,YAAY,QAAQ;AACpB,YAAY,UAAU;AACtB,SAAS,iBAAiB;;;ACnB1B,eAAe,UACb,MACA,YACA,WACA,YACkB;AAClB,QAAM,SAAS,MAAM,KAAK,cAAc;AAAA;AAAA;AAAA,2BAGf,UAAU;AAAA,0BACX,SAAS;AAAA,2BACR,UAAU;AAAA,GAClC;AACD,SAAO,OAAO,QAAQ,EAAE,SAAS;AACnC;AAYA,eAAsB,iBAAiB,MAAuC;AAE5E,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GASd;AAID,QAAM,SAAS,MAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA,GAI7B;AACD,QAAM,OAAO,MAAM,OAAO,QAAQ;AAClC,MAAI,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG;AAC5B,UAAM,KAAK,IAAI,kCAAkC;AACjD,UAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KASd;AAAA,EACH;AACF;AAUA,eAAsB,qBAAqB,MAAuC;AAChF,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAkBd;AAGD,MAAI,CAAE,MAAM,UAAU,MAAM,UAAU,cAAc,QAAQ,GAAI;AAC9D,UAAM,KAAK,IAAI,yDAAyD;AAAA,EAC1E;AACF;AAUA,eAAsB,yBAAyB,MAAuC;AACpF,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAkBd;AAGD,MAAI,CAAE,MAAM,UAAU,MAAM,UAAU,kBAAkB,QAAQ,GAAI;AAClE,UAAM,KAAK,IAAI,6DAA6D;AAAA,EAC9E;AACF;;;AClIA,eAAsB,2BAA2B,MAA2D;AAE1G,MAAI;AACF,UAAM,iBAAiB,MAAM,KAAK;AAAA,MAChC;AAAA,IACF;AACA,QAAI,eAAe,QAAQ,EAAE,SAAS,EAAG,QAAO,EAAE,cAAc,EAAE;AAAA,EACpE,QAAQ;AAAA,EAER;AAGA,MAAI,eAAe;AACnB,MAAI;AACF,UAAM,IAAI,MAAM,KAAK,cAAc,qCAAqC;AACxE,mBAAe,OAAO,EAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;AAAA,EAChD,QAAQ;AACN,WAAO,EAAE,cAAc,EAAE;AAAA,EAC3B;AACA,MAAI,iBAAiB,EAAG,QAAO,EAAE,cAAc,EAAE;AAEjD,MAAI,gBAAgB;AAGpB,QAAM,YAAY,MAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,GAKhC;AACD,mBAAiB,OAAO,UAAU,WAAW;AAG7C,QAAM,cAAc,MAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,GAKlC;AACD,mBAAiB,OAAO,YAAY,WAAW;AAG/C,QAAM,cAAc,MAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,GAKlC;AACD,mBAAiB,OAAO,YAAY,WAAW;AAG/C,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,GAKd;AAGD,MAAI;AACF,UAAM,KAAK,IAAI;AAAA;AAAA;AAAA,KAGd;AAAA,EACH,QAAQ;AAAA,EAER;AAEA,SAAO,EAAE,cAAc,cAAc;AACvC;AAUA,eAAsB,mBAAmB,MAAuC;AAG9E,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GA6Cd;AAGD,MAAI;AACF,UAAM,KAAK,IAAI,kDAAkD;AAAA,EACnE,QAAQ;AAAA,EAER;AAGA,aAAW,OAAO,CAAC,eAAe,UAAU,GAAG;AAC7C,QAAI;AACF,YAAM,KAAK,IAAI,wCAAwC,GAAG,EAAE;AAAA,IAC9D,QAAQ;AAAA,IAER;AAAA,EACF;AAGA,aAAW,OAAO;AAAA,IAChB,EAAE,MAAM,0BAA0B,MAAM,SAAS;AAAA,IACjD,EAAE,MAAM,yBAAyB,MAAM,SAAS;AAAA,EAClD,GAAG;AACD,QAAI;AACF,YAAM,KAAK,IAAI,uCAAuC,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA,IAC9E,QAAQ;AAAA,IAER;AAAA,EACF;AAGA,aAAW,OAAO;AAAA,IAChB,EAAE,MAAM,OAAO,MAAM,SAAS;AAAA,IAC9B,EAAE,MAAM,OAAO,MAAM,SAAS;AAAA,EAChC,GAAG;AACD,QAAI;AACF,YAAM,KAAK,IAAI,uCAAuC,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA,IAC9E,QAAQ;AAAA,IAER;AAAA,EACF;AAIA,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAgCd;AAID,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GASd;AAGD,MAAI;AACF,UAAM,KAAK,IAAI,2DAA2D;AAAA,EAC5E,QAAQ;AAAA,EAER;AAGA,MAAI;AACF,UAAM,KAAK,IAAI,+DAA+D;AAAA,EAChF,QAAQ;AAAA,EAER;AAGA,MAAI;AACF,UAAM,KAAK,IAAI,oEAAoE;AAAA,EACrF,QAAQ;AAAA,EAER;AAGA,aAAW,OAAO,CAAC,WAAW,aAAa,aAAa,aAAa,WAAW,GAAG;AACjF,QAAI;AACF,YAAM,KAAK,IAAI,yCAAyC,GAAG,SAAS;AAAA,IACtE,QAAQ;AAAA,IAER;AAAA,EACF;AAIA,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAed;AAGD,aAAW,OAAO,CAAC,OAAO,KAAK,GAAG;AAChC,QAAI;AACF,YAAM,KAAK,IAAI,0CAA0C,GAAG,SAAS;AAAA,IACvE,QAAQ;AAAA,IAER;AAAA,EACF;AAIA,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAYd;AAID,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAUd;AAID,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAcd;AAGD,QAAM,2BAA2B,IAAI;AACvC;;;AC3UA,eAAsB,qBAAqB,MAAuC;AAChF,QAAM,KAAK,IAAI,sCAAsC;AACrD,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAiBd;AAED,QAAM,KAAK,IAAI;AAAA;AAAA,GAEd;AAED,QAAM,KAAK,IAAI,oFAAoF;AACnG,QAAM,KAAK,IAAI,kFAAkF;AACjG,QAAM,KAAK,IAAI,qFAAqF;AACpG,QAAM,KAAK,IAAI,oFAAoF;AACnG,QAAM,KAAK,IAAI,+FAA+F;AAC9G,QAAM,KAAK,IAAI,6FAA6F;AAC5G,QAAM,KAAK,IAAI,2FAA2F;AAK1G,QAAM,uBAAuB,IAAI;AACnC;AAeA,eAAe,uBAAuB,MAAuC;AAC3E,QAAM,YAAY,oBAAI,IAAI,CAAC,YAAY,OAAO,aAAa,aAAa,QAAQ,SAAS,CAAC;AAC1F,QAAM,UAAoC;AAAA,IACxC,SAAS,CAAC,YAAY,KAAK;AAAA,IAC3B,cAAc,CAAC,aAAa,WAAW;AAAA,IACvC,QAAQ,CAAC,aAAa,WAAW;AAAA,IACjC,UAAU,CAAC,QAAQ,SAAS;AAAA,EAC9B;AAGA,QAAM,SAAS,MAAM,KAAK;AAAA,IACxB;AAAA;AAAA;AAAA,EAGF;AAEA,aAAW,OAAO,OAAO,QAAQ,GAAG;AAClC,UAAM,UAAU,OAAO,IAAI,CAAC,CAAC;AAC7B,UAAM,eAAe,OAAO,IAAI,CAAC,CAAC;AAClC,UAAM,UAAU,OAAO,IAAI,CAAC,CAAC;AAE7B,QAAI;AACJ,QAAI;AACF,gBAAU,KAAK,MAAM,OAAO;AAAA,IAC9B,QAAQ;AACN;AAAA,IACF;AAGA,UAAM,iBAAiB,QAAQ,KAAK,CAAC,MAAM,CAAC,UAAU,IAAI,CAAC,CAAC;AAC5D,QAAI,CAAC,eAAgB;AAGrB,UAAM,WAAW,oBAAI,IAAY;AACjC,eAAW,KAAK,SAAS;AACvB,UAAI,UAAU,IAAI,CAAC,GAAG;AACpB,iBAAS,IAAI,CAAC;AAAA,MAChB,WAAW,QAAQ,CAAC,GAAG;AACrB,mBAAW,UAAU,QAAQ,CAAC,EAAG,UAAS,IAAI,MAAM;AAAA,MACtD;AAAA,IAEF;AAEA,UAAM,UAAU,KAAK,UAAU,CAAC,GAAG,QAAQ,EAAE,KAAK,CAAC;AACnD,UAAM,KAAK;AAAA,MACT;AAAA,iCAC2B,OAAO,OAAO,CAAC;AAAA,2BACrB,OAAO,OAAO,CAAC,0BAA0B,OAAO,YAAY,CAAC;AAAA,IACpF;AAAA,EACF;AACF;AAMA,SAAS,OAAO,OAAuB;AACrC,SAAO,MAAM,QAAQ,MAAM,IAAI;AACjC;AAMA,SAAS,OAAO,OAAsB;AACpC,MAAI,iBAAiB,KAAM,QAAO;AAClC,MAAI,OAAO,UAAU,UAAU;AAE7B,WAAO,IAAI,KAAK,OAAO,KAAK,IAAI,GAAI;AAAA,EACtC;AACA,MAAI,OAAO,UAAU,UAAU;AAG7B,WAAO,QAAQ,OAAO,IAAI,KAAK,QAAQ,GAAI,IAAI,IAAI,KAAK,KAAK;AAAA,EAC/D;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,IAAI,KAAK,KAAK;AAAA,EACvB;AACA,SAAO,oBAAI,KAAK;AAClB;AAYA,SAAS,aAAa,KAAiC;AACrD,QAAM,YAAY,CAAC,MAAe;AAChC,QAAI,MAAM,QAAQ,MAAM,OAAW,QAAO,CAAC;AAC3C,QAAI,OAAO,MAAM,SAAU,QAAO,KAAK,MAAM,CAAC;AAC9C,WAAO;AAAA,EACT;AAEA,QAAM,eAAe,CAAC,MAAe;AACnC,QAAI,MAAM,QAAQ,MAAM,OAAW,QAAO,CAAC;AAC3C,QAAI,OAAO,MAAM,SAAU,QAAO,KAAK,MAAM,CAAC;AAC9C,WAAO;AAAA,EACT;AAEA,QAAM,gBAAgB,CAAC,MACrB,MAAM,QAAQ,MAAM,SAAY,SAAY,QAAQ,CAAC;AAEvD,SAAO;AAAA,IACL,SAAS,IAAI,CAAC;AAAA,IACd,cAAc,IAAI,CAAC;AAAA,IACnB,eAAe,IAAI,CAAC;AAAA,IACpB,YAAY,IAAI,CAAC;AAAA,IACjB,QAAQ,IAAI,CAAC;AAAA,IACb,MAAM,UAAU,IAAI,CAAC,CAAC;AAAA,IACtB,cAAc,UAAU,IAAI,CAAC,CAAC;AAAA,IAC9B,WAAW,UAAU,IAAI,CAAC,CAAC;AAAA,IAC3B,iBAAiB,UAAU,IAAI,CAAC,CAAC;AAAA,IACjC,YAAY,aAAa,IAAI,CAAC,CAAC;AAAA,IAC/B,iBAAiB,MAAM;AACrB,YAAM,KAAK,aAAa,IAAI,EAAE,CAAC;AAC/B,aAAO,MAAM,OAAO,KAAK,EAAE,EAAE,SAAS,IAAI,KAAK;AAAA,IACjD,GAAG;AAAA,IACH,YAAY,IAAI,EAAE,KAA2B;AAAA,IAC7C,SAAS,cAAc,IAAI,EAAE,CAAC;AAAA,IAC9B,YAAY,cAAc,IAAI,EAAE,CAAC;AAAA,IACjC,WAAW,cAAc,IAAI,EAAE,CAAC;AAAA,IAChC,oBAAoB,cAAc,IAAI,EAAE,CAAC;AAAA,IACzC,mBAAmB,cAAc,IAAI,EAAE,CAAC;AAAA,IACxC,iBAAiB,cAAc,IAAI,EAAE,CAAC;AAAA,IACtC,WAAW,OAAO,IAAI,EAAE,CAAC;AAAA,IACzB,WAAW,OAAO,IAAI,EAAE,CAAC;AAAA,EAC3B;AACF;AAEA,IAAM,iBAAiB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMrB,KAAK;AAWP,eAAsB,cACpB,MACA,SAC0B;AAC1B,QAAM,WAAW,OAAO,KAAK,UAAU,QAAQ,IAAI,CAAC;AACpD,QAAM,mBAAmB,OAAO,KAAK,UAAU,QAAQ,YAAY,CAAC;AACpE,QAAM,gBAAgB,OAAO,KAAK,UAAU,QAAQ,SAAS,CAAC;AAC9D,QAAM,sBAAsB,OAAO,KAAK,UAAU,QAAQ,eAAe,CAAC;AAC1E,QAAM,iBAAiB,OAAO,KAAK,UAAU,QAAQ,UAAU,CAAC;AAChE,QAAM,qBAAqB,QAAQ,iBAC/B,OAAO,KAAK,UAAU,QAAQ,cAAc,CAAC,IAC7C;AAEJ,QAAM,SAAQ,oBAAI,KAAK,GAAE,YAAY,EAAE,QAAQ,KAAK,GAAG,EAAE,QAAQ,KAAK,EAAE;AAExE,QAAM,gBAAgB,QAAQ,aAAa,IAAI,OAAO,QAAQ,UAAU,CAAC,MAAM;AAC/E,QAAM,aAAa,QAAQ,YAAY,SAAY,SAAS,OAAO,QAAQ,OAAO;AAClF,QAAM,gBAAgB,QAAQ,eAAe,SAAY,SAAS,OAAO,QAAQ,UAAU;AAC3F,QAAM,eAAe,QAAQ,cAAc,SAAY,SAAS,OAAO,QAAQ,SAAS;AACxF,QAAM,wBAAwB,QAAQ,uBAAuB,SAAY,SAAS,OAAO,QAAQ,kBAAkB;AACnH,QAAM,uBAAuB,QAAQ,sBAAsB,SAAY,SAAS,OAAO,QAAQ,iBAAiB;AAChH,QAAM,qBAAqB,QAAQ,oBAAoB,SAAY,SAAS,OAAO,QAAQ,eAAe;AAE1G,QAAM,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,SAQR,OAAO,QAAQ,OAAO,CAAC;AAAA,SACvB,OAAO,QAAQ,YAAY,CAAC;AAAA,SAC5B,OAAO,QAAQ,aAAa,CAAC;AAAA,SAC7B,OAAO,QAAQ,UAAU,CAAC;AAAA,SAC1B,OAAO,QAAQ,MAAM,CAAC;AAAA,SACtB,QAAQ;AAAA,SACR,gBAAgB;AAAA,SAChB,aAAa;AAAA,SACb,mBAAmB;AAAA,SACnB,cAAc;AAAA,QACf,qBAAqB,IAAI,kBAAkB,YAAY,MAAM;AAAA,QAC7D,aAAa;AAAA,QACb,UAAU;AAAA,QACV,aAAa;AAAA,QACb,YAAY;AAAA,QACZ,qBAAqB;AAAA,QACrB,oBAAoB;AAAA,QACpB,kBAAkB;AAAA,qBACL,KAAK;AAAA,qBACL,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kCAmBQ,KAAK;AAAA,GACpC;AAED,QAAM,SAAS,MAAM,WAAW,MAAM,QAAQ,SAAS,QAAQ,YAAY;AAC3E,MAAI,CAAC,QAAQ;AACX,UAAM,IAAI;AAAA,MACR,4CAA4C,QAAQ,OAAO,IAAI,QAAQ,YAAY;AAAA,IACrF;AAAA,EACF;AACA,SAAO;AACT;AAUA,eAAsB,WACpB,MACA,SACA,cACiC;AACjC,QAAM,SAAS,MAAM,KAAK,cAAc;AAAA,aAC7B,cAAc;AAAA;AAAA,wBAEH,OAAO,OAAO,CAAC;AAAA,6BACV,OAAO,YAAY,CAAC;AAAA,GAC9C;AACD,QAAM,OAAO,OAAO,QAAQ;AAC5B,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,SAAO,aAAa,KAAK,CAAC,CAAC;AAC7B;AASA,eAAsB,aACpB,MACA,SAC4B;AAC5B,QAAM,cAAc,UAChB,qBAAqB,OAAO,OAAO,CAAC,MACpC;AAEJ,QAAM,SAAS,MAAM,KAAK,cAAc;AAAA,aAC7B,cAAc;AAAA;AAAA,MAErB,WAAW;AAAA;AAAA,GAEd;AAED,SAAO,OAAO,QAAQ,EAAE,IAAI,YAAY;AAC1C;AAUA,eAAsB,cACpB,MACA,SACA,cACkB;AAElB,QAAM,WAAW,MAAM,WAAW,MAAM,SAAS,YAAY;AAC7D,MAAI,CAAC,SAAU,QAAO;AAEtB,QAAM,KAAK,IAAI;AAAA;AAAA,wBAEO,OAAO,OAAO,CAAC;AAAA,6BACV,OAAO,YAAY,CAAC;AAAA,GAC9C;AAED,SAAO;AACT;;;AHvUA,IAAI,WAAkC;AACtC,IAAI,aAAsC;AAC1C,IAAI,iBAAoD;AACxD,IAAI,eAA8B;AAClC,IAAI,gBAA+B;AACnC,IAAI,oBAAmC;AACvC,IAAI,qBAAoC;AACxC,IAAM,gBAAgB,UAAU,QAAQ;AACxC,IAAM,YAAY,QAAQ,aAAa;AAEvC,SAAS,YAAY,SAA0B;AAC7C,QAAM,QAAQ,QAAQ,YAAY;AAClC,SACE,MAAM,SAAS,4BAA4B,KAC3C,MAAM,SAAS,0BAA0B,KACzC,MAAM,SAAS,8BAA8B,KAC7C,MAAM,SAAS,+BAA+B;AAElD;AAEA,SAAS,mBAAmB,SAAgC;AAC1D,QAAM,QAAQ,QAAQ,MAAM,cAAc;AAC1C,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,MAAM,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AACxC,SAAO,OAAO,SAAS,GAAG,IAAI,MAAM;AACtC;AAEA,SAAS,eAAe,KAAsB;AAC5C,MAAI;AACF,YAAQ,KAAK,KAAK,CAAC;AACnB,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,oBAAoB,KAAqC;AACtE,MAAI;AACF,QAAI,WAAW;AACb,YAAM,EAAE,QAAAC,QAAO,IAAI,MAAM,cAAc,QAAQ;AAAA,QAC7C;AAAA,QAAW;AAAA,QAAS,aAAa,GAAG;AAAA,QAAI;AAAA,QAAO;AAAA,QAAmB;AAAA,MACpE,CAAC;AACD,YAAM,QAAQA,QAAO,MAAM,uBAAuB;AAClD,UAAI,CAAC,MAAO,QAAO;AACnB,YAAMC,QAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAClC,aAAO,OAAO,SAASA,KAAI,IAAIA,QAAO;AAAA,IACxC;AACA,UAAM,EAAE,OAAO,IAAI,MAAM,cAAc,MAAM,CAAC,MAAM,OAAO,GAAG,GAAG,MAAM,OAAO,CAAC;AAC/E,UAAM,OAAO,SAAS,OAAO,KAAK,GAAG,EAAE;AACvC,WAAO,OAAO,SAAS,IAAI,IAAI,OAAO;AAAA,EACxC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,kBAAkB,KAAqC;AACpE,MAAI;AACF,QAAI,WAAW;AACb,YAAM,EAAE,QAAAD,QAAO,IAAI,MAAM,cAAc,QAAQ;AAAA,QAC7C;AAAA,QAAW;AAAA,QAAS,aAAa,GAAG;AAAA,QAAI;AAAA,QAAO;AAAA,QAAe;AAAA,MAChE,CAAC;AACD,YAAM,QAAQA,QAAO,MAAM,kBAAkB;AAC7C,UAAI,CAAC,MAAO,QAAO;AACnB,YAAME,WAAU,MAAM,CAAC,EAAE,KAAK;AAC9B,aAAOA,SAAQ,SAAS,IAAIA,WAAU;AAAA,IACxC;AACA,UAAM,EAAE,OAAO,IAAI,MAAM,cAAc,MAAM,CAAC,MAAM,OAAO,GAAG,GAAG,MAAM,UAAU,CAAC;AAClF,UAAM,UAAU,OAAO,KAAK;AAC5B,WAAO,QAAQ,SAAS,IAAI,UAAU;AAAA,EACxC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,mBAAmB,KAAa,WAAqC;AAClF,QAAM,WAAW,KAAK,IAAI,IAAI;AAC9B,SAAO,KAAK,IAAI,IAAI,UAAU;AAC5B,QAAI,CAAC,eAAe,GAAG,GAAG;AACxB,aAAO;AAAA,IACT;AACA,UAAM,IAAI,QAAQ,CAACC,aAAY,WAAWA,UAAS,GAAG,CAAC;AAAA,EACzD;AACA,SAAO,CAAC,eAAe,GAAG;AAC5B;AAEA,eAAe,wCACb,cACA,QACA,eACkB;AAClB,QAAM,gBAAgB,mBAAmB,YAAY;AACrD,MAAI,CAAC,iBAAiB,kBAAkB,QAAQ,KAAK;AACnD,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,MAAM,kBAAkB,aAAa;AACrD,MAAI,CAAC,SAAS;AACZ,WAAO;AAAA,EACT;AAGA,QAAM,mBAAmB,OAAO,QAAQ,OAAO,GAAG;AAClD,QAAM,kBAAuB,aAAQ,gBAAgB;AACrD,QAAM,uBACJ,QAAQ,SAAS,iBAAiB,KAClC,QAAQ,SAAS,6BAA6B,KAC9C,QAAQ,SAAS,qCAAqC,KACtD,QAAQ,SAAS,gCAAgC,KACjD,QAAQ,SAAS,wCAAwC;AAE3D,QAAM,oBAAoB,QAAQ,QAAQ,OAAO,GAAG;AACpD,QAAM,gBAAgB,kBAAkB,SAAS,gBAAgB,KAAK,kBAAkB,SAAS,eAAe;AAEhH,MAAI,CAAC,wBAAwB,CAAC,eAAe;AAC3C,WAAO;AAAA,EACT;AAMA,QAAM,OAAO,MAAM,oBAAoB,aAAa;AACpD,QAAM,WAAW,YACZ,SAAS,QAAQ,CAAC,eAAe,IAAI,IACtC,SAAS;AACb,MAAI,CAAC,YAAY,CAAC,eAAe;AAC/B,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,WAAW,aAAa;AACvC,QAAM,YAAY,OAAO,SAAS,QAAQ,IAAI,mCAAmC,QAAQ,EAAE;AAE3F,MAAI;AACF,YAAQ,KAAK,eAAe,SAAS;AAAA,EACvC,QAAQ;AACN,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,MAAM;AAAA,IACnB;AAAA,IACA,OAAO,SAAS,SAAS,KAAK,YAAY,IAAI,YAAY;AAAA,EAC5D;AAEA,MAAI,QAAQ;AACV,YAAQ;AAAA,MACN,4BAA4B,MAAM,gBAAgB,MAAM,gCAAgC,aAAa;AAAA,IACvG;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAAS,oBAAoB,SAAyB;AAEpD,QAAM,OAAO,QAAQ;AACrB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,QAAI,KAAK,CAAC,MAAM,iBAAiB,KAAK,IAAI,CAAC,GAAG;AAC5C,aAAY,aAAQ,KAAK,IAAI,CAAC,CAAC;AAAA,IACjC;AAAA,EACF;AAEA,MAAI,QAAQ,IAAI,gBAAgB;AAC9B,WAAY,aAAQ,QAAQ,IAAI,cAAc;AAAA,EAChD;AAEA,SAAY,UAAK,SAAS,eAAe;AAC3C;AAUA,eAAe,eACb,MACA,cACA,MACe;AACf,QAAS,SAAW,aAAQ,YAAY,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9D,QAAM,iBAAiB,SAAS,cAAc,iBAAiB;AAC/D,MAAI;AACF,UAAM,KAAK,IAAI,WAAW,YAAY,cAAc,cAAc,EAAE;AAAA,EACtE,SAAS,OAAO;AACd,UAAM,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACjE,QAAI,IAAI,SAAS,SAAS,KAAK,IAAI,SAAS,SAAS,KAAK,IAAI,SAAS,aAAa,GAAG;AACrF,cAAQ,MAAM,sCAAsC,YAAY,eAAe;AAC/E,UAAI;AAAE,cAAS,UAAO,YAAY;AAAA,MAAG,QAAQ;AAAA,MAA2B;AAExE,UAAI;AAAE,cAAS,UAAO,eAAe,MAAM;AAAA,MAAG,QAAQ;AAAA,MAAe;AACrE,YAAM,KAAK,IAAI,WAAW,YAAY,cAAc,cAAc,EAAE;AAAA,IACtE,OAAO;AACL,YAAM,IAAI,MAAM,qCAAqC,YAAY,KAAK,GAAG,EAAE;AAAA,IAC7E;AAAA,EACF;AACF;AAMA,eAAe,eAAe,MAAuC;AACnE,MAAI;AACF,UAAM,KAAK,IAAI,eAAe;AAAA,EAChC,QAAQ;AAAA,EAER;AACF;AAEA,eAAe,wBACb,QACA,SACA,aAC2B;AAI3B,aAAW,MAAM,eAAe,OAAO,QAAQ;AAAA,IAC7C;AAAA,IACA,cAAc;AAAA,IACd,wBAAwB;AAAA,EAC1B,CAAC;AACD,eAAa,MAAM,SAAS,QAAQ;AAKpC,MAAI;AACF,UAAM,WAAW,IAAI,sCAAsC;AAAA,EAC7D,QAAQ;AAAA,EAER;AAGA,QAAM,eAAe,YAAY,oBAAqB,YAAY;AAWlE,QAAM,WAAW,IAAI,oCAAoC;AACzD,QAAM,iBAAiB,UAAU;AACjC,QAAM,qBAAqB,UAAU;AACrC,QAAM,yBAAyB,UAAU;AACzC,QAAM,mBAAmB,UAAU;AACnC,QAAM,qBAAqB,UAAU;AAGrC,MAAI;AAGF,UAAM,MAAM,MAAM,OAAO,qBAAqB;AAC9C,UAAM,MAAM,MAAM,IAAI,QAAQ,YAAY;AAAA,MACxC,SAAc,aAAQ,MAAM;AAAA,MAC5B,cAAc;AAAA,IAChB,CAAC;AACD,QAAI,KAAK,mBAAoB,uBAAsB,IAAI;AAAA,EACzD,QAAQ;AAAA,EAER;AAEA,mBAAiB;AAEjB,SAAO;AACT;AAEA,eAAe,uBACb,QACA,SACA,aAC2B;AAI3B,aAAW,MAAM,eAAe,OAAO,QAAQ;AAAA,IAC7C;AAAA,IACA,cAAc;AAAA,IACd,wBAAwB;AAAA,IACxB,aAAa;AAAA,EACf,CAAC;AACD,eAAa,MAAM,SAAS,QAAQ;AACpC,MAAI,oBAAoB;AACtB,UAAM,eAAe,YAAY,oBAAoB,WAAW;AAAA,EAClE;AACA,mBAAiB;AACjB,SAAO;AACT;AAEA,SAAS,uBAA6B;AACpC,MAAI,YAAY;AACd,QAAI;AAAE,iBAAW,UAAU;AAAA,IAAG,QAAQ;AAAA,IAAkB;AAAA,EAC1D;AACA,eAAa;AACb,MAAI,UAAU;AACZ,QAAI;AAAE,eAAS,UAAU;AAAA,IAAG,QAAQ;AAAA,IAAkB;AAAA,EACxD;AACA,aAAW;AACX,mBAAiB;AACnB;AAmBA,eAAsB,cAAc,SAA4C;AAE9E,MAAI,YAAY;AACd,WAAO;AAAA,EACT;AAEA,QAAM,SAAc,UAAK,SAAS,kBAAkB;AAGpD,QAAM,UAAU,QAAQ,IAAI,kBAAkB;AAC9C,QAAM,cAAc,QAAQ,IAAI,uBAAuB;AAGvD,iBAAe;AACf,kBAAgB;AAChB,sBAAoB;AACpB,uBAAqB,oBAAoB,OAAO;AAKhD,QAAM,iBAAiB,QAAQ,IAAI,wBAAwB,YAAY;AAEvE,MAAI;AACF,WAAO,MAAM,wBAAwB,QAAQ,SAAS,WAAW;AAAA,EACnE,SAAS,OAAO;AAEd,UAAM,eAAe,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAI1E,QAAI,YAAY,YAAY,GAAG;AAC7B,YAAM,YAAY,MAAM,wCAAwC,cAAc,QAAQ,aAAa;AACnG,UAAI,WAAW;AAEb,iBAAS,UAAU,GAAG,UAAU,GAAG,WAAW;AAC5C,gBAAM,IAAI,QAAQ,CAAC,MAAM,WAAW,GAAG,OAAO,UAAU,EAAE,CAAC;AAC3D,cAAI;AACF,mBAAO,MAAM,wBAAwB,QAAQ,SAAS,WAAW;AAAA,UACnE,SAAS,YAAY;AACnB,kBAAM,WAAW,sBAAsB,QAAQ,WAAW,UAAU,OAAO,UAAU;AACrF,gBAAI,UAAU,KAAK,YAAY,QAAQ,EAAG;AAC1C,iCAAqB;AACrB,kBAAM,IAAI;AAAA,cACR,kCAAkC,MAAM,yBAAyB,QAAQ;AAAA,YAC3E;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,yBAAqB;AAGrB,QACE,aAAa,SAAS,SAAS,KAC/B,aAAa,SAAS,SAAS,KAC/B,aAAa,SAAS,aAAa,GACnC;AACA,YAAM,IAAI;AAAA,QACR,wCAAwC,MAAM,kEAEzB,YAAY;AAAA,MACnC;AAAA,IACF;AAEA,UAAM,IAAI,MAAM,kCAAkC,MAAM,KAAK,YAAY,EAAE;AAAA,EAC7E;AACF;AASA,eAAsB,kBAAiC;AACrD,MAAI,YAAY;AACd,QAAI;AAAE,YAAM,WAAW,IAAI,YAAY;AAAA,IAAG,QAAQ;AAAA,IAAkB;AACpE,QAAI;AAAE,YAAM,eAAe,UAAU;AAAA,IAAG,QAAQ;AAAA,IAA6B;AAC7E,QAAI;AAEF,iBAAW,UAAU;AAAA,IACvB,SAAS,OAAO;AAEd,YAAM,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACjE,cAAQ,MAAM,6CAA6C,GAAG,EAAE;AAAA,IAClE;AACA,iBAAa;AAAA,EACf;AAIA,MAAI,UAAU;AACZ,QAAI;AAAE,eAAS,UAAU;AAAA,IAAG,QAAQ;AAAA,IAAkB;AAAA,EACxD;AACA,aAAW;AACX,mBAAiB;AACnB;AAYA,eAAsB,mBACpB,SACA,SAC2B;AAC3B,MAAI,mBAAmB,gBAAgB,WAAY,QAAO;AAC1D,QAAM,gBAAgB;AAKtB,QAAM,aAAa;AACnB,QAAM,eAAe;AACrB,MAAI,YAA0B;AAE9B,WAAS,UAAU,GAAG,WAAW,YAAY,WAAW;AACtD,QAAI;AACF,aAAO,MAAM,cAAc,OAAO;AAAA,IACpC,SAAS,OAAO;AACd,YAAM,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACjE,UAAI,CAAC,YAAY,GAAG,EAAG,OAAM;AAC7B,kBAAY,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,GAAG;AAC1D,UAAI,UAAU,YAAY;AACxB,cAAM,IAAI,QAAQ,CAAC,MAAM,WAAW,GAAG,YAAY,CAAC;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAGA,MAAI,SAAS,sBAAsB,gBAAgB,iBAAiB,mBAAmB;AACrF,QAAI;AACF,YAAM,uBAAuB,cAAc,eAAe,iBAAiB;AAC3E,UAAI,WAAY,QAAO;AAAA,IACzB,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,QAAM,aAAa,IAAI;AAAA,IACrB;AAAA,EAEF;AACF;AASA,eAAsB,oBAAoB,SAAgC;AACxE,MAAI,mBAAmB,YAAa;AACpC,MAAI,CAAC,WAAY;AACjB,QAAM,gBAAgB;AACtB,MAAI,gBAAgB,iBAAiB,mBAAmB;AACtD,UAAM,uBAAuB,cAAc,eAAe,iBAAiB;AAAA,EAC7E;AACF;AAcO,SAAS,cAAuB;AACrC,SAAO,eAAe;AACxB;AAMA,IAAI,sBAAsB;AAMnB,SAAS,wBAAgC;AAC9C,SAAO;AACT;;;AI5jBA,YAAYC,SAAQ;AACpB,YAAYC,WAAU;;;ACFtB,YAAYC,aAAY;AACxB,YAAYC,SAAQ;AASpB,eAAsB,gBAAgB,UAAmC;AACvE,QAAM,SAAS,MAAS,aAAS,QAAQ;AACzC,SAAc,mBAAW,QAAQ,EAAE,OAAO,MAAM,EAAE,OAAO,KAAK;AAChE;;;ACSA,eAAsB,gBACpB,MACA,SACmC;AACnC,QAAM,SAAS,MAAM,KAAK;AAAA,IACxB;AAAA;AAAA;AAAA,IAGA,CAAC,OAAO;AAAA,EACV;AAEA,QAAM,OAAO,OAAO,QAAQ;AAC5B,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO;AAAA,EACT;AAEA,QAAM,MAAM,KAAK,CAAC;AAClB,SAAO;AAAA,IACL,UAAU,IAAI,CAAC;AAAA,IACf,eAAe,IAAI,CAAC;AAAA,IACpB,eAAe,IAAI,CAAC;AAAA,IACpB,mBAAmB,IAAI,CAAC;AAAA,IACxB,WAAW,IAAI,KAAK,IAAI,CAAC,CAAW;AAAA,IACpC,cAAc,IAAI,CAAC;AAAA,EACrB;AACF;AAQA,eAAsB,mBACpB,MACA,UACe;AACf,QAAM,KAAK;AAAA,IACT;AAAA;AAAA;AAAA,IAGA;AAAA,MACE,SAAS;AAAA,MACT,SAAS;AAAA,MACT,SAAS;AAAA,MACT,SAAS;AAAA,MACT,SAAS,UAAU,YAAY;AAAA,MAC/B,SAAS;AAAA,IACX;AAAA,EACF;AACF;AAQA,eAAsB,mBACpB,MACA,SACe;AACf,QAAM,KAAK;AAAA,IACT;AAAA,IACA,CAAC,OAAO;AAAA,EACV;AACF;AAQA,eAAsB,qBACpB,MACmB;AACnB,QAAM,SAAS,MAAM,KAAK;AAAA,IACxB;AAAA,EACF;AAEA,QAAM,OAAO,OAAO,QAAQ;AAC5B,SAAO,KAAK,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAW;AAC3C;AAyBA,eAAsB,wBACpB,MACA,QACA,QACA,aACsC;AACtC,QAAM,SAAS,MAAM,KAAK;AAAA,IACxB;AAAA;AAAA;AAAA,IAGA,CAAC,QAAQ,QAAQ,WAAW;AAAA,EAC9B;AACA,QAAM,OAAO,OAAO,QAAQ;AAC5B,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,MAAM,KAAK,CAAC;AAClB,SAAO;AAAA,IACL,QAAQ,IAAI,CAAC;AAAA,IACb,QAAQ,IAAI,CAAC;AAAA,IACb,cAAc,IAAI,CAAC;AAAA,IACnB,UAAU,IAAI,CAAC;AAAA,IACf,kBAAkB,IAAI,CAAC;AAAA,IACvB,WAAW,IAAI,KAAK,IAAI,CAAC,CAAW;AAAA,EACtC;AACF;AAMA,eAAsB,2BACpB,MACA,UACe;AACf,QAAM,KAAK;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA;AAAA,MACE,SAAS;AAAA,MACT,SAAS;AAAA,MACT,SAAS;AAAA,MACT,SAAS;AAAA,MACT,SAAS;AAAA,MACT,SAAS,UAAU,YAAY;AAAA,IACjC;AAAA,EACF;AACF;;;ACzLO,IAAM,wBAAwB;AAGrC,IAAM,0BAA0B;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAKO,SAAS,gBAAgB,OAAiD;AAC/E,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,CAAC,QAAS,QAAO;AAErB,QAAM,aAAa,QAAQ,MAAM,KAAK,EAAE,CAAC;AACzC,QAAM,WAAW,WAAW,QAAQ,WAAW,EAAE;AACjD,QAAM,aAAa,SAAS,YAAY,EAAE,QAAQ,iBAAiB,EAAE;AACrE,MAAI,CAAC,WAAY,QAAO;AAGxB,MAAI,CAAC,QAAQ,KAAK,UAAU,EAAG,QAAO;AACtC,SAAO;AACT;AAKO,SAAS,wBACd,QACe;AACf,MAAI,CAAC,OAAQ,QAAO;AACpB,aAAW,SAAS,yBAAyB;AAC3C,UAAM,MAAM,OAAO,KAAK;AACxB,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAM,aAAa,gBAAgB,GAAG;AACtC,UAAI,WAAY,QAAO;AAAA,IACzB;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,mBACd,OACA,WAAmB,uBACX;AACR,SACE,wBAAwB,MAAM,YAAmD,KACjF;AAEJ;AAKO,SAAS,wBACd,KACA,WAAmB,uBACX;AACR,SACE,wBAAwB,GAA8B,KACtD;AAEJ;AAKO,SAAS,oBAAoB,QAAgB,MAAsB;AACxE,SAAO,GAAG,MAAM,IAAI,IAAI;AAC1B;;;ACxEA,YAAYC,SAAQ;AACpB,YAAYC,WAAU;;;ACZtB,qBAAqB;;;ACAd,IAAI,iBAAiB;AAAA;AAAA;AAAA,EAG1B,QAAQ;AAAA;AAAA;AAAA,EAGR,QAAQ;AAAA;AAAA,EAER,QAAQ;AAAA;AAAA,EAER,QAAQ;AAAA;AAAA;AAAA,EAGR,gBAAgB;AAAA;AAAA,EAEhB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA,EAKX,aAAa;AAAA;AAAA;AAAA,EAGb,YAAY;AAAA;AAAA;AAAA;AAAA,EAIZ,cAAc;AAChB;;;AClBA,SAAS,gBAAgB,QAAQ,MAAM;AAErC,MAAI,eAAe,QAAQ,IAAI,GAAG;AAChC,WAAO,OAAO,IAAI;AAAA,EACpB;AACA,MAAI,OAAO,OAAO,IAAI,MAAM,cAAc,aAAa,QAAQ,IAAI,GAAG;AACpE,UAAM,IAAI,MAAM,2BAA2B,OAAO,iBAAiB;AAAA,EACrE;AACA,QAAM,IAAI,MAAM,4BAA4B,OAAO,GAAG;AACxD;AAYA,SAAS,gBAAgB,QAAQ,MAAM,OAAO;AAE5C,MAAI,eAAe,QAAQ,IAAI,GAAG;AAChC,WAAO,IAAI,IAAI;AACf,WAAO;AAAA,EACT;AACA,QAAM,IAAI,MAAM,4BAA4B,OAAO,GAAG;AACxD;AASA,SAAS,eAAe,QAAQ,MAAM;AACpC,MAAI,CAAC,cAAc,MAAM,KAAK,CAAC,MAAM,QAAQ,MAAM,GAAG;AACpD,WAAO;AAAA,EACT;AAGA,MAAI,eAAe,sBAAsB,IAAI,GAAG;AAC9C,WAAO;AAAA,EACT;AAGA,MAAI,QAAQ,OAAO,WAAW;AAI5B,WAAO;AAAA,EACT;AAGA,MAAI,QAAQ,SAAS,WAAW;AAI9B,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAuBA,SAAS,aAAa,QAAQ,QAAQ;AACpC,MAAI,WAAW,QAAQ,WAAW,UAAa,OAAO,OAAO,MAAM,MAAM,YAAY;AACnF,WAAO;AAAA,EACT;AAIA,MAAI,eAAe,QAAQ,MAAM,KAAK,OAAO,kBAAkB,UAAU,OAAO,eAAe,MAAM,GAAG;AACtG,WAAO;AAAA,EACT;AAGA,MAAI,eAAe,mBAAmB,MAAM,GAAG;AAC7C,WAAO;AAAA,EACT;AAGA,MAAI,UAAU,OAAO,WAAW;AAI9B,WAAO;AAAA,EACT;AAGA,MAAI,UAAU,SAAS,WAAW;AAIhC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACA,SAAS,cAAc,QAAQ;AAC7B,SAAO,OAAO,WAAW,YAAY,UAAU,OAAO,gBAAgB;AACxE;AACA,IAAI,uBAAuB;AAAA,EACzB,QAAQ;AAAA,EACR,MAAM;AACR;AACA,IAAI,oBAAoB;AAAA,EACtB,UAAU;AAAA,EACV,SAAS;AAAA,EACT,gBAAgB;AAClB;;;ACjIO,IAAM,oBAAN,MAAwB;AAAA,EAC7B,YAAY,QAAQ;AAClB,SAAK,gBAAgB;AACrB,SAAK,OAAO,QAAQ,IAAI,KAAK;AAAA,EAC/B;AAAA,EACA,OAAO;AACL,WAAO,OAAO,KAAK,KAAK,aAAa,EAAE,OAAO,SAAO,KAAK,IAAI,GAAG,CAAC,EAAE,OAAO;AAAA,EAC7E;AAAA,EACA,IAAI,KAAK;AACP,WAAO,gBAAgB,KAAK,eAAe,GAAG;AAAA,EAChD;AAAA,EACA,IAAI,KAAK,OAAO;AACd,oBAAgB,KAAK,eAAe,KAAK,KAAK;AAC9C,WAAO;AAAA,EACT;AAAA,EACA,IAAI,KAAK;AACP,WAAO,eAAe,KAAK,eAAe,GAAG,KAAK,OAAO,KAAK;AAAA,EAChE;AAAA,EACA,UAAU;AACR,WAAO,YAAY,KAAK,KAAK,GAAG,SAAO,CAAC,KAAK,KAAK,IAAI,GAAG,CAAC,CAAC;AAAA,EAC7D;AAAA,EACA,QAAQ,UAAU;AAChB,aAAS,OAAO,KAAK,KAAK,GAAG;AAC3B,eAAS,KAAK,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,IACnC;AAAA,EACF;AAAA,EACA,OAAO,KAAK;AACV,QAAI,eAAe,KAAK,eAAe,GAAG,GAAG;AAC3C,aAAO,KAAK,cAAc,GAAG;AAAA,IAC/B;AAAA,EACF;AAAA,EACA,QAAQ;AACN,aAAS,OAAO,KAAK,KAAK,GAAG;AAC3B,WAAK,OAAO,GAAG;AAAA,IACjB;AAAA,EACF;AAAA,EACA,IAAI,OAAO;AACT,WAAO,OAAO,KAAK,KAAK,aAAa,EAAE;AAAA,EACzC;AACF;AAoEA,SAAS,YAAY,IAAI,UAAU;AACjC,SAAO;AAAA,IACL,MAAM,MAAM;AACV,UAAI,IAAI,GAAG,KAAK;AAChB,aAAO,EAAE,OAAO,IAAI;AAAA,QAClB,OAAO,SAAS,EAAE,KAAK;AAAA,QACvB,MAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACF;;;ACjHO,SAAS,SAAS,GAAG;AAC1B,SAAO,OAAO,MAAM;AACtB;AACO,SAAS,YAAY,GAAG;AAC7B,MAAI,CAAC,KAAK,OAAO,MAAM,YAAY,OAAO,EAAE,gBAAgB,YAAY;AACtE,WAAO;AAAA,EACT;AACA,MAAI,EAAE,gBAAgB,QAAQ,OAAO,EAAE,YAAY,cAAc,YAAY,EAAE,YAAY,UAAU,gBAAgB,MAAM;AACzH,WAAO;AAAA,EACT;AACA,MAAI,OAAO,EAAE,YAAY,cAAc,cAAc,EAAE,YAAY,UAAU,CAAC,MAAM,MAAM;AACxF,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACO,SAAS,SAAS,GAAG;AAC1B,SAAO,OAAO,MAAM;AACtB;AACO,SAAS,UAAU,GAAG;AAC3B,SAAO,KAAK,OAAO,MAAM,YAAY,OAAO,eAAe,CAAC,EAAE,cAAc,QAAQ;AACtF;AACO,SAAS,WAAW,GAAG;AAC5B,SAAO,KAAK,OAAO,MAAM,YAAY,OAAO,eAAe,CAAC,EAAE,eAAe,QAAQ;AACvF;AACO,SAAS,OAAO,GAAG;AACxB,SAAO,KAAK,EAAE,YAAY,UAAU,WAAW,QAAQ;AACzD;AACO,SAAS,SAAS,GAAG;AAC1B,SAAO,OAAO,MAAM;AACtB;AACO,IAAI,UAAU,MAAM;AACpB,SAAS,SAAS,GAAG;AAC1B,SAAO,KAAK,EAAE,YAAY,UAAU,aAAa,QAAQ;AAC3D;AAOO,SAAS,aAAa,GAAG;AAC9B,SAAO,MAAM,QAAQ,CAAC,KAAK,SAAS,CAAC;AACvC;AACO,SAAS,cAAc,GAAG;AAC/B,SAAO,KAAK,EAAE,iBAAiB,EAAE,YAAY,UAAU,aAAa,QAAQ;AAC9E;AACO,SAAS,eAAe,GAAG;AAChC,SAAO,KAAK,EAAE,kBAAkB,EAAE,YAAY,UAAU,aAAa,QAAQ;AAC/E;AACO,SAAS,QAAQ,GAAG;AACzB,SAAO,KAAK,EAAE,YAAY,UAAU,YAAY,QAAQ;AAC1D;AACO,SAAS,QAAQ,GAAG;AACzB,SAAO,KAAK,EAAE,YAAY,UAAU,YAAY,QAAQ;AAC1D;AACO,SAAS,UAAU,GAAG;AAC3B,SAAO,OAAO,MAAM;AACtB;AACO,SAAS,YAAY,GAAG;AAC7B,SAAO,KAAK,EAAE,YAAY,UAAU,gBAAgB,QAAQ;AAC9D;AACO,SAAS,OAAO,GAAG;AACxB,SAAO,KAAK,EAAE,YAAY,UAAU,WAAW,QAAQ;AACzD;AACO,SAAS,WAAW,GAAG;AAC5B,SAAO,OAAO,MAAM;AACtB;AACO,SAAS,OAAO,GAAG;AACxB,SAAO,aAAa;AACtB;AACO,SAAS,SAAS,GAAG;AAC1B,SAAO,aAAa;AACtB;AACO,SAAS,SAAS,GAAG;AAC1B,SAAO,CAAC,EAAE,KAAK,OAAO,MAAM,YAAY,EAAE,gBAAgB,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,WAAW,CAAC;AACpG;AAUO,SAAS,MAAM,QAAQ;AAG5B,MAAI,CAAC,QAAQ;AACX,WAAO;AAAA,EACT;AACA,SAAO,kBAAkB,OAAO,kBAAkB,qBAAqB,OAAO,OAAO,QAAQ,cAAc,OAAO,OAAO,QAAQ,cAAc,OAAO,OAAO,SAAS,cAAc,OAAO,OAAO,QAAQ;AAC5M;AAOO,SAAS,OAAO,GAAG;AACxB,SAAO,MAAM;AACf;AACO,SAAS,YAAY,GAAG;AAC7B,SAAO,MAAM;AACf;AACO,SAAS,eAAe,GAAG;AAChC,SAAO,KAAK,EAAE,mBAAmB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACtF;AACO,SAAS,YAAY,GAAG;AAC7B,SAAO,KAAK,EAAE,gBAAgB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACnF;AACO,SAAS,iBAAiB,GAAG;AAClC,SAAO,KAAK,EAAE,qBAAqB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACxF;AACO,SAAS,YAAY,GAAG;AAC7B,SAAO,KAAK,EAAE,gBAAgB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACnF;AACO,SAAS,kBAAkB,GAAG;AACnC,SAAO,KAAK,EAAE,sBAAsB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACzF;AACO,SAAS,eAAe,GAAG;AAChC,SAAO,KAAK,EAAE,mBAAmB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACtF;AAeO,SAAS,yBAAyB,GAAG;AAC1C,SAAO,KAAK,EAAE,6BAA6B,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAChG;AACO,SAAS,eAAe,GAAG;AAChC,SAAO,KAAK,EAAE,mBAAmB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACtF;AACO,SAAS,YAAY,GAAG;AAC7B,SAAO,KAAK,EAAE,gBAAgB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACnF;AACO,SAAS,OAAO,GAAG;AACxB,SAAO,KAAK,EAAE,WAAW,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAC9E;AACO,SAAS,aAAa,GAAG;AAC9B,SAAO,KAAK,EAAE,iBAAiB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACpF;AACO,SAAS,eAAe,GAAG;AAChC,SAAO,KAAK,EAAE,mBAAmB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACtF;AACO,SAAS,kBAAkB,GAAG;AACnC,SAAO,KAAK,EAAE,sBAAsB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACzF;AACO,SAAS,YAAY,GAAG;AAC7B,SAAO,KAAK,EAAE,gBAAgB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACnF;AACO,SAAS,iBAAiB,GAAG;AAClC,SAAO,KAAK,EAAE,qBAAqB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACxF;AACO,SAAS,aAAa,GAAG;AAC9B,SAAO,KAAK,EAAE,iBAAiB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AACpF;AACO,SAAS,QAAQ,GAAG;AACzB,SAAO,KAAK,EAAE,YAAY,UAAU,YAAY,QAAQ;AAC1D;AACO,SAAS,OAAO,GAAG;AACxB,MAAI,IAAI,OAAO;AACf,MAAI,MAAM,UAAU;AAClB,QAAI,MAAM,KAAM,QAAO;AACvB,QAAI,YAAY,CAAC,EAAG,QAAO;AAC3B,QAAI,EAAE,eAAe,EAAE,YAAY,KAAM,QAAO,EAAE,YAAY;AAC9D,WAAO;AAAA,EACT;AACA,SAAO;AACT;;;ACrLO,SAAS,MAAM,GAAG;AACvB,MAAI,OAAO,OAAO;AAGlB,MAAI,SAAS,YAAY,SAAS,YAAY,SAAS,YAAY,SAAS,aAAa,MAAM,QAAQ,MAAM,QAAW;AACtH,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,EAAE,UAAU,YAAY;AACjC,WAAO,EAAE,MAAM;AAAA,EACjB;AAGA,MAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,WAAO,EAAE,IAAI,SAAU,OAAO;AAC5B,aAAO,MAAM,KAAK;AAAA,IACpB,CAAC;AAAA,EACH;AACA,MAAI,aAAa,KAAM,QAAO,IAAI,KAAK,EAAE,QAAQ,CAAC;AAClD,MAAI,YAAY,CAAC,EAAG,QAAO;AAG3B,MAAI,SAAS,CAAC,GAAG;AACf,WAAO,UAAU,GAAG,KAAK;AAAA,EAC3B;AACA,MAAI,SAAS,YAAY;AAEvB,WAAO;AAAA,EACT;AACA,QAAM,IAAI,UAAU,+CAA+C,OAAO,GAAG,GAAG,CAAC;AACnF;AAQO,SAAS,UAAU,QAAQ,UAAU;AAC1C,MAAIC,SAAQ,CAAC;AACb,WAAS,OAAO,QAAQ;AACtB,QAAI,eAAe,QAAQ,GAAG,GAAG;AAC/B,MAAAA,OAAM,GAAG,IAAI,SAAS,OAAO,GAAG,CAAC;AAAA,IACnC;AAAA,EACF;AACA,SAAOA;AACT;AAQO,SAAS,OAAO,GAAG,GAAG;AAC3B,WAAS,QAAQ,GAAG;AAClB,QAAI,eAAe,GAAG,IAAI,GAAG;AAC3B,QAAE,IAAI,IAAI,EAAE,IAAI;AAAA,IAClB;AAAA,EACF;AACA,SAAO;AACT;AA2CO,SAAS,gBAAgB,GAAG,GAAG;AACpC,MAAI,MAAM,GAAG;AACb,MAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,QAAI,CAAC,MAAM,QAAQ,CAAC,GAAG;AACrB,aAAO;AAAA,IACT;AACA,QAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,aAAO;AAAA,IACT;AACA,SAAK,IAAI,GAAG,MAAM,EAAE,QAAQ,IAAI,KAAK,KAAK;AACxC,UAAI,CAAC,gBAAgB,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG;AAChC,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT,WAAW,OAAO,MAAM,YAAY;AAClC,WAAO,MAAM;AAAA,EACf,WAAW,aAAa,QAAQ;AAC9B,QAAI,MAAM,QAAQ,CAAC,KAAK,EAAE,aAAa,SAAS;AAC9C,aAAO;AAAA,IACT;AACA,SAAK,QAAQ,GAAG;AAEd,UAAI,EAAE,QAAQ,MAAM,CAAC,gBAAgB,EAAE,IAAI,GAAG,EAAE,IAAI,CAAC,GAAG;AACtD,eAAO;AAAA,MACT;AAAA,IACF;AACA,SAAK,QAAQ,GAAG;AAEd,UAAI,EAAE,QAAQ,IAAI;AAChB,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT,OAAO;AACL,WAAO,MAAM;AAAA,EACf;AACF;AAwGO,SAAS,eAAe,QAAQ,UAAU;AAC/C,SAAO,UAAU,OAAO,eAAe,KAAK,QAAQ,QAAQ;AAC9D;AAmGO,SAAS,YAAY,QAAQ,YAAY;AAC9C,MAAI,OAAO,CAAC;AACZ,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,QAAI,MAAM,WAAW,CAAC;AACtB,QAAI,QAAQ,OAAO,GAAG;AACtB,QAAI,UAAU,QAAW;AACvB,WAAK,GAAG,IAAI;AAAA,IACd;AAAA,EACF;AACA,SAAO;AACT;;;AChXO,IAAI,iBAAiB,CAAC,UAAU,OAAO;AACvC,IAAI,iBAAiB,CAAC,UAAU,aAAa,UAAU,UAAU;;;ANEjE,IAAI,SAAS,SAASC,QAAO,SAAS;AAC3C,MAAI,SAAS;AACX,UAAM,IAAI,MAAM,qPAAuR;AAAA,EACzS;AACA,SAAO,OAAO,OAAO,cAAc;AACrC;AAAA,IACA,eAAAC,SAAS,QAAQ,gBAAgB;AAAA,EAC/B;AAAA,EACA;AACF,CAAC;;;AOdD,SAASC,KAAM;AACb,SAAO;AACT;AAEA,SAASC,QAAS;AAChB,SAAO;AACT;AAEA,SAASC,QAAS;AAChB,SAAOC;AACT;AAEA,IAAMC,qBAAqB;AA0C3B,SAASC,SAAU;AAMjB,WAASC,eAAeC,GAAG;AACzB,WAAO,OAAOA,MAAM,YAAYA,MAAM,QAAQA,EAAEC,gBAAgBC;EAClE;AAEA,QAAMC,SAAS,CACb;IAAEC,MAAM;IAAUC,MAAM,SAAUL,GAAG;AAAE,aAAO,OAAOA,MAAM;IAAS;EAAE,GACtE;IAAEI,MAAM;IAAUC,MAAM,SAAUL,GAAG;AAAE,aAAO,OAAOA,MAAM;IAAS;EAAE,GACtE;IAAEI,MAAM;IAAWC,MAAM,SAAUL,GAAG;AAAE,aAAO,OAAOA,MAAM;IAAU;EAAE,GACxE;IAAEI,MAAM;IAAYC,MAAM,SAAUL,GAAG;AAAE,aAAO,OAAOA,MAAM;IAAW;EAAE,GAC1E;IAAEI,MAAM;IAASC,MAAMC,MAAMC;EAAQ,GACrC;IAAEH,MAAM;IAAQC,MAAM,SAAUL,GAAG;AAAE,aAAOA,aAAaQ;IAAK;EAAE,GAChE;IAAEJ,MAAM;IAAUC,MAAM,SAAUL,GAAG;AAAE,aAAOA,aAAaS;IAAO;EAAE,GACpE;IAAEL,MAAM;IAAUC,MAAMN;EAAc,GACtC;IAAEK,MAAM;IAAQC,MAAM,SAAUL,GAAG;AAAE,aAAOA,MAAM;IAAK;EAAE,GACzD;IAAEI,MAAM;IAAaC,MAAM,SAAUL,GAAG;AAAE,aAAOA,MAAMJ;IAAU;EAAE,CAAC;AAGtE,QAAMc,UAAU;IACdN,MAAM;IACNC,MAAMZ;IACNkB,OAAO;EACT;AAOA,MAAIC;AACJ,MAAIC;AAGJ,MAAIC,eAAe;AAInB,MAAIC,SAAQ;IAAEC,aAAa;EAAE;AAS7B,WAASC,SAAUC,UAAU;AAC3B,UAAMC,OAAOP,QAAQQ,IAAIF,QAAQ;AACjC,QAAIC,MAAM;AACR,aAAOA;IACT;AAEA,QAAIE,UAAU,mBAAmBH,WAAW;AAC5C,UAAMd,SAAOc,SAASI,YAAY;AAClC,QAAIC;AACJ,SAAKA,aAAaV,UAAU;AAC1B,UAAIU,UAAUD,YAAY,MAAMlB,QAAM;AACpCiB,mBAAW,qBAAqBE,YAAY;AAC5C;MACF;IACF;AACA,UAAM,IAAIC,UAAUH,OAAO;EAC7B;AAeA,WAASI,SAAUC,OAA2B;AAAA,QAApBC,aAAUC,UAAAC,SAAA,KAAAD,UAAA,CAAA,MAAAhC,SAAAgC,UAAA,CAAA,IAAG;AACrC,UAAME,cAAcH,aAChBV,SAASU,UAAU,EAAEI,QACrBlB,SAASgB;AACb,UAAMG,WAAW,CAAA;AACjB,aAASC,IAAI,GAAGA,IAAIP,MAAMG,QAAQ,EAAEI,GAAG;AACrC,UAAI,CAACP,MAAMO,CAAC,KAAK,OAAOP,MAAMO,CAAC,EAAE7B,SAAS,YACxC,OAAOsB,MAAMO,CAAC,EAAE5B,SAAS,YAAY;AACrC,cAAM,IAAImB,UAAU,gEAAgE;MACtF;AACA,YAAMN,WAAWQ,MAAMO,CAAC,EAAE7B;AAC1B,UAAIQ,QAAQsB,IAAIhB,QAAQ,GAAG;AACzB,cAAM,IAAIM,UAAU,0BAA0BN,WAAW,GAAG;MAC9D;AACAc,eAASG,KAAKjB,QAAQ;AACtBN,cAAQwB,IAAIlB,UAAU;QACpBd,MAAMc;QACNb,MAAMqB,MAAMO,CAAC,EAAE5B;QACfM,OAAOe,MAAMO,CAAC,EAAEtB;QAChBoB,OAAOD,cAAcG;QACrBI,eAAe,CAAA;;MACjB,CAAC;IACH;AAEA,UAAMC,gBAAgBzB,SAAS0B,MAAMT,WAAW;AAChDjB,eACEA,SAAS0B,MAAM,GAAGT,WAAW,EAAEU,OAAOR,QAAQ,EAAEQ,OAAOF,aAAa;AAEtE,aAASL,IAAIH,cAAcE,SAASH,QAAQI,IAAIpB,SAASgB,QAAQ,EAAEI,GAAG;AACpErB,cAAQQ,IAAIP,SAASoB,CAAC,CAAC,EAAEF,QAAQE;IACnC;EACF;AAQA,WAASQ,QAAS;AAChB7B,cAAU,oBAAI8B,IAAI;AAClB7B,eAAW,CAAA;AACXC,mBAAe;AACfW,aAAS,CAACf,OAAO,GAAG,KAAK;EAC3B;AAGA+B,QAAM;AACNhB,WAAStB,MAAM;AAKf,WAASwC,mBAAoB;AAC3B,QAAIzB;AACJ,SAAKA,YAAYL,UAAU;AACzBD,cAAQQ,IAAIF,QAAQ,EAAEmB,gBAAgB,CAAA;IACxC;AACAvB,mBAAe;EACjB;AAQA,WAAS8B,cAAeC,OAAO;AAC7B,UAAMC,UAAUjC,SAASkC,OAAO3C,CAAAA,WAAQ;AACtC,YAAMe,OAAOP,QAAQQ,IAAIhB,MAAI;AAC7B,aAAO,CAACe,KAAKR,SAASQ,KAAKd,KAAKwC,KAAK;IACvC,CAAC;AACD,QAAIC,QAAQjB,QAAQ;AAClB,aAAOiB;IACT;AACA,WAAO,CAAC,KAAK;EACf;AAOA,WAASE,gBAAiBC,QAAQ;AAChC,WAAOA,UAAU,OAAOA,WAAW,cACjC,wBAAwBA;EAC5B;AAoCA,WAASC,cAAeC,IAAIC,WAAWC,SAAS;AAC9C,QAAI,CAACL,gBAAgBG,EAAE,GAAG;AACxB,YAAM,IAAI3B,UAAU3B,kBAAkB;IACxC;AAGA,UAAMyD,QAAQD,WAAWA,QAAQC;AACjC,UAAMC,kBAAkBjD,MAAMC,QAAQ6C,SAAS,IAC3CA,UAAUI,KAAK,GAAG,IAClBJ;AACJ,UAAMK,SAASC,eAAeH,eAAe;AAC7C,UAAMI,qBAAqBC,gBAAgBH,MAAM;AAGjD,QAAI,CAACH,SAASK,sBAAsBR,GAAGU,YAAY;AAEjD,YAAMC,QACJX,GAAGY,mBAAmBC,aAAa5C,IAAIuC,kBAAkB;AAC3D,UAAIG,OAAO;AACT,eAAOA;MACT;IACF;AAMA,UAAMG,UAAUR,OAAO5B;AACvB,QAAIqC;AACJ,QAAIZ,OAAO;AACTY,4BAAsB,CAAA;AACtB,UAAI9D;AACJ,WAAKA,UAAQ+C,GAAGU,YAAY;AAC1BK,4BAAoB/B,KAAKgB,GAAGY,mBAAmBC,aAAa5C,IAAIhB,MAAI,CAAC;MACvE;IACF,OAAO;AACL8D,4BAAsBf,GAAGY,mBAAmBF;IAC9C;AACA,aAAS5B,IAAI,GAAGA,IAAIgC,SAAS,EAAEhC,GAAG;AAChC,YAAMkC,OAAOV,OAAOxB,CAAC;AACrB,YAAMmC,qBAAqB,CAAA;AAC3B,UAAIC;AACJ,WAAKA,eAAeH,qBAAqB;AACvC,cAAMI,OAAOC,gBAAgBF,YAAYZ,QAAQxB,CAAC;AAClD,YAAI,CAACqC,QAASH,KAAKK,aAAa,CAACF,KAAKE,WAAY;AAChD;QACF;AACA,YAAI,CAACF,KAAKG,QAAQ;AAEhB,gBAAMC,YAAYC,aAAaL,IAAI;AACnC,cAAIH,KAAKzC,MAAMkD,KAAKC,WAAS,CAACH,UAAUxC,IAAI2C,MAAMzE,IAAI,CAAC,GAAG;AACxD;UACF;QACF;AAEAgE,2BAAmBjC,KAAKkC,WAAW;MACrC;AACAH,4BAAsBE;AACtB,UAAIF,oBAAoBrC,WAAW,EAAG;IACxC;AAEA,QAAIiD;AACJ,SAAKA,aAAaZ,qBAAqB;AACrC,UAAIY,UAAUrB,OAAO5B,UAAUoC,SAAS;AACtC,eAAOa;MACT;IACF;AAEA,UAAM,IAAItD,UAAU,sCAAsC2B,GAAG/C,QAAQ,aAAa,MAAMwD,gBAAgBH,QAAQ,IAAI,IAAI,IAAI;EAC9H;AA4BA,WAASsB,KAAM5B,IAAIC,WAAWC,SAAS;AACrC,WAAOH,cAAcC,IAAIC,WAAWC,OAAO,EAAE2B;EAC/C;AAQA,WAASC,QAASpC,OAAO3B,UAAU;AAEjC,UAAMC,OAAOF,SAASC,QAAQ;AAC9B,QAAIC,KAAKd,KAAKwC,KAAK,GAAG;AACpB,aAAOA;IACT;AACA,UAAMqC,cAAc/D,KAAKkB;AACzB,QAAI6C,YAAYrD,WAAW,GAAG;AAC5B,YAAM,IAAIsD,MACR,iCAAiCjE,WAAW,WAAW;IAC3D;AACA,aAASe,IAAI,GAAGA,IAAIiD,YAAYrD,QAAQI,KAAK;AAC3C,YAAMmD,WAAWnE,SAASiE,YAAYjD,CAAC,EAAEoD,IAAI;AAC7C,UAAID,SAAS/E,KAAKwC,KAAK,GAAG;AACxB,eAAOqC,YAAYjD,CAAC,EAAEgD,QAAQpC,KAAK;MACrC;IACF;AAEA,UAAM,IAAIsC,MAAM,oBAAoBtC,QAAQ,SAAS3B,QAAQ;EAC/D;AAQA,WAAS0C,gBAAiBH,QAAyB;AAAA,QAAjB6B,YAAS1D,UAAAC,SAAA,KAAAD,UAAA,CAAA,MAAAhC,SAAAgC,UAAA,CAAA,IAAG;AAC5C,WAAO6B,OAAO8B,IAAIC,OAAKA,EAAEpF,IAAI,EAAEoD,KAAK8B,SAAS;EAC/C;AAOA,WAASG,WAAYC,OAAO;AAC1B,UAAMlB,YAAYkB,MAAMC,QAAQ,KAAK,MAAM;AAC3C,UAAMjE,QAAS,CAAC8C,YACZkB,QACCA,MAAM7D,SAAS,IACZ6D,MAAMnD,MAAM,CAAC,IACb;AAER,UAAMqD,WAAWlE,MAAMmE,MAAM,GAAG,EAAEN,IAAIO,OAAK7E,SAAS6E,EAAEC,KAAK,CAAC,CAAC;AAE7D,QAAItB,SAAS;AACb,QAAIuB,YAAYxB,YAAY,QAAQ;AAEpC,UAAMyB,aAAaL,SAASL,IAAI,SAAUpE,MAAM;AAC9CsD,eAAStD,KAAKR,SAAS8D;AACvBuB,mBAAa7E,KAAKf,OAAO;AAEzB,aAAO;QACLA,MAAMe,KAAKf;QACX8F,WAAW/E,KAAKY;QAChB1B,MAAMc,KAAKd;QACXM,OAAOQ,KAAKR;QACZwF,YAAY;QACZC,iBAAiB;MACnB;IACF,CAAC;AAED,WAAO;MACL1E,OAAOuE;MACP7F,MAAM4F,UAAUzD,MAAM,GAAG,EAAE;;MAC3BkC;MACA4B,eAAe;MACf7B;IACF;EACF;AAQA,WAAS8B,YAAaZ,OAAO;AAC3B,UAAMa,YAAYb,MAAMhE,MAAM6D,IAAIiB,OAAKA,EAAEpG,IAAI;AAC7C,UAAMqG,sBAAsBC,qBAAqBH,SAAS;AAC1D,QAAI9B,SAASiB,MAAMjB;AACnB,QAAIkC,UAAUjB,MAAMtF;AAEpB,UAAMwG,mBAAmBH,oBAAoBlB,IAAI,SAAUY,YAAY;AACrE,YAAMhF,OAAOF,SAASkF,WAAWd,IAAI;AACrCZ,eAAStD,KAAKR,SAAS8D;AACvBkC,iBAAW,MAAMR,WAAWd;AAE5B,aAAO;QACLjF,MAAM+F,WAAWd;QACjBa,WAAW/E,KAAKY;QAChB1B,MAAMc,KAAKd;QACXM,OAAOQ,KAAKR;QACZwF;QACAC,iBAAiBD,WAAWpE;MAC9B;IACF,CAAC;AAED,WAAO;MACLL,OAAOgE,MAAMhE,MAAMc,OAAOoE,gBAAgB;MAC1CxG,MAAMuG;MACNlC;MACA4B,eAAeO,iBAAiB/E,SAAS;MACzC2C,WAAWkB,MAAMlB;IACnB;EACF;AASA,WAASG,aAAce,OAAO;AAC5B,QAAI,CAACA,MAAMmB,SAAS;AAClBnB,YAAMmB,UAAU,oBAAIC,IAAI;AACxBpB,YAAMhE,MAAMqF,QAAQ5F,UAAQuE,MAAMmB,QAAQG,IAAI7F,KAAKf,IAAI,CAAC;IAC1D;AACA,WAAOsF,MAAMmB;EACf;AASA,WAASnD,eAAgBuD,cAAc;AACrC,UAAMxD,SAAS,CAAA;AACf,QAAI,OAAOwD,iBAAiB,UAAU;AACpC,YAAM,IAAIzF,UAAU,4BAA4B;IAClD;AACA,UAAM4B,YAAY6D,aAAalB,KAAK;AACpC,QAAI3C,cAAc,IAAI;AACpB,aAAOK;IACT;AAEA,UAAMyD,YAAY9D,UAAUyC,MAAM,GAAG;AACrC,aAAS5D,IAAI,GAAGA,IAAIiF,UAAUrF,QAAQ,EAAEI,GAAG;AACzC,YAAMkF,cAAc1B,WAAWyB,UAAUjF,CAAC,EAAE8D,KAAK,CAAC;AAClD,UAAIoB,YAAY3C,aAAcvC,MAAMiF,UAAUrF,SAAS,GAAI;AACzD,cAAM,IAAIuF,YACR,gCAAgCF,UAAUjF,CAAC,IAAI,wCACV;MACzC;AAEA,UAAIkF,YAAYzF,MAAMG,WAAW,GAAG;AAClC,eAAO;MACT;AACA4B,aAAOtB,KAAKgF,WAAW;IACzB;AAEA,WAAO1D;EACT;AAOA,WAAS4D,aAAc5D,QAAQ;AAC7B,UAAMiC,QAAQ4B,KAAK7D,MAAM;AACzB,WAAOiC,QAAQA,MAAMlB,YAAY;EACnC;AAQA,WAAS+C,YAAa7B,OAAO;AAC3B,QAAI,CAACA,SAASA,MAAMhE,MAAMG,WAAW,GAAG;AAEtC,aAAOpC;IACT,WAAWiG,MAAMhE,MAAMG,WAAW,GAAG;AACnC,aAAOZ,SAASyE,MAAMhE,MAAM,CAAC,EAAEtB,IAAI,EAAEC;IACvC,WAAWqF,MAAMhE,MAAMG,WAAW,GAAG;AACnC,YAAM2F,QAAQvG,SAASyE,MAAMhE,MAAM,CAAC,EAAEtB,IAAI,EAAEC;AAC5C,YAAMoH,QAAQxG,SAASyE,MAAMhE,MAAM,CAAC,EAAEtB,IAAI,EAAEC;AAC5C,aAAO,SAASqH,GAAI1H,GAAG;AACrB,eAAOwH,MAAMxH,CAAC,KAAKyH,MAAMzH,CAAC;MAC5B;IACF,OAAO;AACL,YAAM2H,QAAQjC,MAAMhE,MAAM6D,IAAI,SAAUpE,MAAM;AAC5C,eAAOF,SAASE,KAAKf,IAAI,EAAEC;MAC7B,CAAC;AACD,aAAO,SAASqH,GAAI1H,GAAG;AACrB,iBAASiC,IAAI,GAAGA,IAAI0F,MAAM9F,QAAQI,KAAK;AACrC,cAAI0F,MAAM1F,CAAC,EAAEjC,CAAC,GAAG;AACf,mBAAO;UACT;QACF;AACA,eAAO;MACT;IACF;EACF;AAOA,WAAS4H,aAAcnE,QAAQ;AAC7B,QAAIkE,OAAOH,OAAOC;AAElB,QAAIJ,aAAa5D,MAAM,GAAG;AAExBkE,cAAQE,QAAQpE,MAAM,EAAE8B,IAAIgC,WAAW;AACvC,YAAMO,WAAWH,MAAM9F;AACvB,YAAMkG,WAAWR,YAAYD,KAAK7D,MAAM,CAAC;AACzC,YAAMuE,gBAAgB,SAAUC,MAAM;AACpC,iBAAShG,IAAI6F,UAAU7F,IAAIgG,KAAKpG,QAAQI,KAAK;AAC3C,cAAI,CAAC8F,SAASE,KAAKhG,CAAC,CAAC,GAAG;AACtB,mBAAO;UACT;QACF;AACA,eAAO;MACT;AAEA,aAAO,SAASiG,SAAUD,MAAM;AAC9B,iBAAShG,IAAI,GAAGA,IAAI0F,MAAM9F,QAAQI,KAAK;AACrC,cAAI,CAAC0F,MAAM1F,CAAC,EAAEgG,KAAKhG,CAAC,CAAC,GAAG;AACtB,mBAAO;UACT;QACF;AACA,eAAO+F,cAAcC,IAAI,KAAMA,KAAKpG,UAAUiG,WAAW;MAC3D;IACF,OAAO;AAEL,UAAIrE,OAAO5B,WAAW,GAAG;AACvB,eAAO,SAASqG,SAAUD,MAAM;AAC9B,iBAAOA,KAAKpG,WAAW;QACzB;MACF,WAAW4B,OAAO5B,WAAW,GAAG;AAC9B2F,gBAAQD,YAAY9D,OAAO,CAAC,CAAC;AAC7B,eAAO,SAASyE,SAAUD,MAAM;AAC9B,iBAAOT,MAAMS,KAAK,CAAC,CAAC,KAAKA,KAAKpG,WAAW;QAC3C;MACF,WAAW4B,OAAO5B,WAAW,GAAG;AAC9B2F,gBAAQD,YAAY9D,OAAO,CAAC,CAAC;AAC7BgE,gBAAQF,YAAY9D,OAAO,CAAC,CAAC;AAC7B,eAAO,SAASyE,SAAUD,MAAM;AAC9B,iBAAOT,MAAMS,KAAK,CAAC,CAAC,KAAKR,MAAMQ,KAAK,CAAC,CAAC,KAAKA,KAAKpG,WAAW;QAC7D;MACF,OAAO;AACL8F,gBAAQlE,OAAO8B,IAAIgC,WAAW;AAC9B,eAAO,SAASW,SAAUD,MAAM;AAC9B,mBAAShG,IAAI,GAAGA,IAAI0F,MAAM9F,QAAQI,KAAK;AACrC,gBAAI,CAAC0F,MAAM1F,CAAC,EAAEgG,KAAKhG,CAAC,CAAC,GAAG;AACtB,qBAAO;YACT;UACF;AACA,iBAAOgG,KAAKpG,WAAW8F,MAAM9F;QAC/B;MACF;IACF;EACF;AAUA,WAAS0C,gBAAiBd,QAAQ1B,OAAO;AACvC,WAAOA,QAAQ0B,OAAO5B,SAClB4B,OAAO1B,KAAK,IACZsF,aAAa5D,MAAM,IAAI6D,KAAK7D,MAAM,IAAI;EAC5C;AAQA,WAAS0E,kBAAmB1E,QAAQ1B,OAAO;AACzC,UAAM2D,QAAQnB,gBAAgBd,QAAQ1B,KAAK;AAC3C,QAAI,CAAC2D,OAAO;AACV,aAAO,oBAAIoB,IAAI;IACjB;AACA,WAAOnC,aAAae,KAAK;EAC3B;AAOA,WAAS0C,YAAajH,MAAM;AAC1B,WAAOA,KAAKgF,eAAe,QAAQhF,KAAKgF,eAAevG;EACzD;AASA,WAASyI,oBAAqBxE,YAAY9B,OAAO;AAC/C,UAAM8E,UAAU,oBAAIC,IAAI;AACxBjD,eAAWkD,QAAQ3D,eAAa;AAC9B,YAAMkF,WAAWH,kBAAkB/E,UAAUK,QAAQ1B,KAAK;AAC1D,UAAI3B;AACJ,WAAKA,UAAQkI,UAAU;AACrBzB,gBAAQG,IAAI5G,MAAI;MAClB;IACF,CAAC;AAED,WAAOyG,QAAQ3E,IAAI,KAAK,IAAI,CAAC,KAAK,IAAI5B,MAAM+E,KAAKwB,OAAO;EAC1D;AAUA,WAAS0B,YAAanI,QAAM6H,MAAMpE,YAAY;AAC5C,QAAI2E,KAAKC;AACT,UAAMC,QAAQtI,UAAQ;AAGtB,QAAIuI,qBAAqB9E;AACzB,QAAI9B;AACJ,SAAKA,QAAQ,GAAGA,QAAQkG,KAAKpG,QAAQE,SAAS;AAC5C,YAAM6G,mBAAmB,CAAA;AACzBD,yBAAmB5B,QAAQ3D,eAAa;AACtC,cAAMsC,QAAQnB,gBAAgBnB,UAAUK,QAAQ1B,KAAK;AACrD,cAAM1B,OAAOkH,YAAY7B,KAAK;AAC9B,aAAK3D,QAAQqB,UAAUK,OAAO5B,UAC5BwF,aAAajE,UAAUK,MAAM,MAC7BpD,KAAK4H,KAAKlG,KAAK,CAAC,GAAG;AACnB6G,2BAAiBzG,KAAKiB,SAAS;QACjC;MACF,CAAC;AAED,UAAIwF,iBAAiB/G,WAAW,GAAG;AAEjC4G,mBAAWJ,oBAAoBM,oBAAoB5G,KAAK;AACxD,YAAI0G,SAAS5G,SAAS,GAAG;AACvB,gBAAMgH,cAAcjG,cAAcqF,KAAKlG,KAAK,CAAC;AAE7CyG,gBAAM,IAAIhH,UAAU,6CAA6CkH,QAC/D,iBAAiBD,SAASjF,KAAK,MAAM,IACrC,eAAeqF,YAAYrF,KAAK,KAAK,IAAI,cAAczB,QAAQ,GAAG;AACpEyG,cAAIM,OAAO;YACTC,UAAU;YACV5F,IAAIuF;YACJ3G;YACAiH,QAAQH;YACRJ;UACF;AACA,iBAAOD;QACT;MACF,OAAO;AACLG,6BAAqBC;MACvB;IACF;AAGA,UAAMK,UAAUN,mBAAmBpD,IAAI,SAAUnC,WAAW;AAC1D,aAAOiE,aAAajE,UAAUK,MAAM,IAChCyF,WACA9F,UAAUK,OAAO5B;IACvB,CAAC;AACD,QAAIoG,KAAKpG,SAASsH,KAAKC,IAAIC,MAAM,MAAMJ,OAAO,GAAG;AAC/CR,iBAAWJ,oBAAoBM,oBAAoB5G,KAAK;AACxDyG,YAAM,IAAIhH,UAAU,mCAAmCkH,QACrD,iBAAiBD,SAASjF,KAAK,MAAM,IACrC,cAAcyE,KAAKpG,SAAS,GAAG;AACjC2G,UAAIM,OAAO;QACTC,UAAU;QACV5F,IAAIuF;QACJ3G,OAAOkG,KAAKpG;QACZ4G;MACF;AACA,aAAOD;IACT;AAGA,UAAMc,YAAYH,KAAKI,IAAIF,MAAM,MAAMJ,OAAO;AAC9C,QAAIhB,KAAKpG,SAASyH,WAAW;AAC3Bd,YAAM,IAAIhH,UAAU,oCAAoCkH,QACtD,iBAAiBY,YAAY,eAAerB,KAAKpG,SAAS,GAAG;AAC/D2G,UAAIM,OAAO;QACTC,UAAU;QACV5F,IAAIuF;QACJ3G,OAAOkG,KAAKpG;QACZ2H,gBAAgBF;MAClB;AACA,aAAOd;IACT;AAGA,UAAMiB,WAAW,CAAA;AACjB,aAASxH,IAAI,GAAGA,IAAIgG,KAAKpG,QAAQ,EAAEI,GAAG;AACpCwH,eAAStH,KAAKS,cAAcqF,KAAKhG,CAAC,CAAC,EAAEuB,KAAK,GAAG,CAAC;IAChD;AACAgF,UAAM,IAAIhH,UAAU,wBAAwBiI,SAASjG,KAAK,IAAI,IAC5D,8DAA8DkF,QAAQ,GAAG;AAC3EF,QAAIM,OAAO;MACTC,UAAU;MACVC,QAAQS;IACV;AACA,WAAOjB;EACT;AAOA,WAASkB,mBAAoBhE,OAAO;AAClC,QAAI0D,OAAMvI,SAASgB,SAAS;AAE5B,aAASI,IAAI,GAAGA,IAAIyD,MAAMhE,MAAMG,QAAQI,KAAK;AAC3CmH,MAAAA,OAAMD,KAAKC,IAAIA,MAAK1D,MAAMhE,MAAMO,CAAC,EAAEiE,SAAS;IAC9C;AAEA,WAAOkD;EACT;AAQA,WAASO,yBAA0BjE,OAAO;AACxC,QAAI0D,OAAMtI,eAAe;AAEzB,aAASmB,IAAI,GAAGA,IAAIyD,MAAMhE,MAAMG,QAAQI,KAAK;AAC3C,UAAI,CAACmG,YAAY1C,MAAMhE,MAAMO,CAAC,CAAC,GAAG;AAChCmH,QAAAA,OAAMD,KAAKC,IAAIA,MAAK1D,MAAMhE,MAAMO,CAAC,EAAEmE,eAAe;MACpD;IACF;AAEA,WAAOgD;EACT;AAgBA,WAASQ,cAAeC,QAAQC,QAAQ;AAGtC,QAAID,OAAOpF,QAAQ;AACjB,UAAI,CAACqF,OAAOrF,QAAQ;AAClB,eAAO;MACT;IACF,WAAWqF,OAAOrF,QAAQ;AACxB,aAAO;IACT;AAGA,QAAIoF,OAAOrF,WAAW;AACpB,UAAI,CAACsF,OAAOtF,WAAW;AACrB,eAAO;MACT;IACF,WAAWsF,OAAOtF,WAAW;AAC3B,aAAO;IACT;AAGA,UAAMuF,WAAWL,mBAAmBG,MAAM,IAAIH,mBAAmBI,MAAM;AACvE,QAAIC,WAAW,GAAG;AAChB,aAAO;IACT;AACA,QAAIA,WAAW,GAAG;AAChB,aAAO;IACT;AAIA,UAAMC,QAAQL,yBAAyBE,MAAM;AAC7C,UAAMI,QAAQN,yBAAyBG,MAAM;AAC7C,QAAID,OAAOxD,eAAe;AACxB,UAAI,CAACyD,OAAOzD,eAAe;AACzB,gBAAQ,IAAI2D,SAAS;MACvB;IACF,WAAWF,OAAOzD,eAAe;AAC/B,aAAO,EAAE,IAAI4D,SAAS;IACxB;AAGA,UAAMC,WAAWF,QAAQC;AACzB,QAAIC,WAAW,GAAG;AAChB,aAAO;IACT;AACA,QAAIA,WAAW,GAAG;AAChB,aAAO;IACT;AAGA,WAAO;EACT;AAeA,WAASC,kBAAmBC,YAAYC,YAAY;AAClD,UAAMC,QAAQF,WAAW3G;AACzB,UAAM8G,QAAQF,WAAW5G;AACzB,UAAM+G,QAAQlD,KAAKgD,KAAK;AACxB,UAAMG,QAAQnD,KAAKiD,KAAK;AACxB,UAAMG,WAAWrD,aAAaiD,KAAK;AACnC,UAAMK,WAAWtD,aAAakD,KAAK;AAGnC,QAAIG,YAAYF,MAAM/F,QAAQ;AAC5B,UAAI,CAACkG,YAAY,CAACF,MAAMhG,QAAQ;AAC9B,eAAO;MACT;IACF,WAAWkG,YAAYF,MAAMhG,QAAQ;AACnC,aAAO;IACT;AAGA,QAAImG,OAAO;AACX,QAAIZ,QAAQ;AACZ,QAAIa;AACJ,SAAKA,OAAOP,OAAO;AACjB,UAAIO,IAAIpG,OAAQ,GAAEmG;AAClB,UAAIC,IAAIxE,cAAe,GAAE2D;IAC3B;AACA,QAAIc,OAAO;AACX,QAAIb,QAAQ;AACZ,SAAKY,OAAON,OAAO;AACjB,UAAIM,IAAIpG,OAAQ,GAAEqG;AAClB,UAAID,IAAIxE,cAAe,GAAE4D;IAC3B;AACA,QAAIW,SAASE,MAAM;AACjB,cAAQF,OAAOE,QAAQ;IACzB;AAGA,QAAIJ,YAAYF,MAAMnE,eAAe;AACnC,UAAI,CAACsE,YAAY,CAACF,MAAMpE,eAAe;AACrC,eAAO;MACT;IACF,WAAWsE,YAAYF,MAAMpE,eAAe;AAC1C,aAAO;IACT;AAGA,QAAI2D,UAAUC,OAAO;AACnB,cAAQD,QAAQC,SAAS;IAC3B;AAGA,QAAIS,UAAU;AACZ,UAAI,CAACC,UAAU;AACb,eAAO;MACT;IACF,WAAWA,UAAU;AACnB,aAAO;IACT;AAGA,UAAMI,mBACHT,MAAMzI,SAAS0I,MAAM1I,WAAW6I,WAAW,OAAO;AACrD,QAAIK,oBAAoB,GAAG;AACzB,aAAOA;IACT;AAMA,UAAMC,cAAc,CAAA;AACpB,QAAIC,KAAK;AACT,aAAShJ,IAAI,GAAGA,IAAIqI,MAAMzI,QAAQ,EAAEI,GAAG;AACrC,YAAMiJ,iBAAiBtB,cAAcU,MAAMrI,CAAC,GAAGsI,MAAMtI,CAAC,CAAC;AACvD+I,kBAAY7I,KAAK+I,cAAc;AAC/BD,YAAMC;IACR;AACA,QAAID,OAAO,GAAG;AACZ,cAASA,KAAK,IAAK,MAAM,MAAMA;IACjC;AAMA,QAAIE;AACJ,QAAIC,QAAQ;AACZ,UAAMC,YAAYD,SAASJ,YAAYnJ,SAAS;AAChD,SAAKsJ,KAAKH,aAAa;AACrB,UAAIG,MAAM,GAAG;AACX,gBAASA,IAAI,IAAK,CAACC,QAAQA,SAASD;MACtC;AACAC,eAASC;IACX;AAGA,WAAO;EACT;AAUA,WAAS3E,qBAAsBH,WAAW;AACxC,QAAIA,UAAU1E,WAAW,GAAG;AAC1B,aAAO,CAAA;IACT;AACA,UAAMH,QAAQ6E,UAAUhB,IAAItE,QAAQ;AACpC,QAAIsF,UAAU1E,WAAW,EAAG,QAAOH,MAAM,CAAC,EAAEW;AAK5C,UAAMiJ,aAAa,IAAIxE,IAAIP,SAAS;AACpC,UAAMK,mBAAmB,oBAAIE,IAAI;AACjC,aAAS7E,IAAI,GAAGA,IAAIP,MAAMG,QAAQ,EAAEI,GAAG;AACrC,iBAAW6B,SAASpC,MAAMO,CAAC,EAAEI,eAAe;AAC1C,YAAI,CAACiJ,WAAWpJ,IAAI4B,MAAMuB,IAAI,EAAGuB,kBAAiBI,IAAIlD,MAAMuB,IAAI;MAClE;IACF;AAGA,UAAMvC,UAAU,CAAA;AAChB,eAAW5B,YAAY0F,kBAAkB;AACvC,UAAI2E,YAAYzK,eAAe;AAC/B,UAAI0K,iBAAiB;AACrB,eAASvJ,IAAI,GAAGA,IAAIP,MAAMG,QAAQ,EAAEI,GAAG;AACrC,mBAAW6B,SAASpC,MAAMO,CAAC,EAAEI,eAAe;AAC1C,cAAIyB,MAAMuB,SAASnE,YAAY4C,MAAM/B,QAAQwJ,WAAW;AACtDA,wBAAYzH,MAAM/B;AAClByJ,6BAAiB1H;UACnB;QACF;MACF;AACAhB,cAAQX,KAAKqJ,cAAc;IAC7B;AAEA,WAAO1I;EACT;AAYA,WAAS2I,yBAA0BhI,QAAQN,IAAI;AAC7C,QAAIuI,YAAYvI;AAIhB,QAAI/C,SAAO;AACX,QAAIqD,OAAOmB,KAAKY,OAAKA,EAAEa,aAAa,GAAG;AACrC,YAAM7B,YAAY6C,aAAa5D,MAAM;AACrC,YAAMkI,sBAAsBlI,OAAO8B,IAAIqG,oBAAoB;AAC3DxL,MAAAA,SAAOuL,oBAAoBpG,IAAIsG,UAAQA,KAAKzL,IAAI,EAAEoD,KAAK,GAAG;AAC1DkI,kBAAY,SAASI,cAAe;AAClC,cAAM7D,OAAO,CAAA;AACb,cAAMX,QAAO9C,YAAY5C,UAAUC,SAAS,IAAID,UAAUC;AAC1D,iBAASI,IAAI,GAAGA,IAAIqF,OAAMrF,KAAK;AAC7BgG,eAAKhG,CAAC,IAAI0J,oBAAoB1J,CAAC,EAAEL,UAAUK,CAAC,CAAC;QAC/C;AACA,YAAIuC,WAAW;AACbyD,eAAKX,KAAI,IAAI1F,UAAU0F,KAAI,EAAE/B,IAAIoG,oBAAoBrE,KAAI,CAAC;QAC5D;AAEA,eAAOnE,GAAGkG,MAAM,MAAMpB,IAAI;MAC5B;IACF;AAEA,QAAI8D,eAAeL;AACnB,QAAIrE,aAAa5D,MAAM,GAAG;AACxB,YAAMuI,SAASvI,OAAO5B,SAAS;AAE/BkK,qBAAe,SAASE,uBAAwB;AAC9C,eAAOP,UAAUrC,MAAM,MACrB9G,MAAMX,WAAW,GAAGoK,MAAM,EAAExJ,OAAO,CAACD,MAAMX,WAAWoK,MAAM,CAAC,CAAC,CAAC;MAClE;IACF;AACA,QAAI5L,OAAMF,QAAOgM,eAAeH,cAAc,QAAQ;MAAElJ,OAAOzC;IAAK,CAAC;AACrE,WAAO2L;EACT;AAQA,WAASH,qBAAsBlG,OAAO;AACpC,QAAI8B,OAAOC,OAAO0E,aAAaC;AAC/B,UAAMzE,QAAQ,CAAA;AACd,UAAMzC,cAAc,CAAA;AACpB,QAAI9E,SAAO;AACXsF,UAAMhE,MAAMqF,QAAQ,SAAU5F,MAAM;AAClC,UAAIA,KAAKgF,YAAY;AACnB/F,QAAAA,UAAQe,KAAKgF,WAAWd,OAAO,OAAOlE,KAAKgF,WAAWkG,KAAK;AAC3D1E,cAAMxF,KAAKlB,SAASE,KAAKgF,WAAWd,IAAI,EAAEhF,IAAI;AAC9C6E,oBAAY/C,KAAKhB,KAAKgF,WAAWlB,OAAO;MAC1C;IACF,CAAC;AACD,QAAI7E,OAAMA,CAAAA,SAAOA,OAAKmC,MAAM,GAAG,EAAE;QAC5BnC,CAAAA,SAAO;AAGZ,QAAIkM,YAAYC,SAAOA;AACvB,YAAQrH,YAAYrD,QAAM;MACxB,KAAK;AAAG;MACR,KAAK;AACH2F,gBAAQG,MAAM,CAAC;AACfwE,sBAAcjH,YAAY,CAAC;AAC3BoH,oBAAY,SAASE,WAAYD,KAAK;AACpC,cAAI/E,MAAM+E,GAAG,GAAG;AACd,mBAAOJ,YAAYI,GAAG;UACxB;AACA,iBAAOA;QACT;AACA;MACF,KAAK;AACH/E,gBAAQG,MAAM,CAAC;AACfF,gBAAQE,MAAM,CAAC;AACfwE,sBAAcjH,YAAY,CAAC;AAC3BkH,sBAAclH,YAAY,CAAC;AAC3BoH,oBAAY,SAASE,WAAYD,KAAK;AACpC,cAAI/E,MAAM+E,GAAG,GAAG;AACd,mBAAOJ,YAAYI,GAAG;UACxB;AACA,cAAI9E,MAAM8E,GAAG,GAAG;AACd,mBAAOH,YAAYG,GAAG;UACxB;AACA,iBAAOA;QACT;AACA;MACF;AACED,oBAAY,SAASE,WAAYD,KAAK;AACpC,mBAAStK,IAAI,GAAGA,IAAIiD,YAAYrD,QAAQI,KAAK;AAC3C,gBAAI0F,MAAM1F,CAAC,EAAEsK,GAAG,GAAG;AACjB,qBAAOrH,YAAYjD,CAAC,EAAEsK,GAAG;YAC3B;UACF;AACA,iBAAOA;QACT;IACJ;AACArM,WAAOgM,eAAeI,WAAW,QAAQ;MAAEzJ,OAAOzC;IAAK,CAAC;AACxD,WAAOkM;EACT;AAmBA,WAASG,YAAahJ,QAAQ;AAC5B,aAASiJ,aAAcjJ,SAAQ1B,OAAO4K,aAAa;AACjD,UAAI5K,QAAQ0B,QAAO5B,QAAQ;AACzB,cAAM6D,QAAQjC,QAAO1B,KAAK;AAC1B,YAAI6K,kBAAkB,CAAA;AAEtB,YAAIlH,MAAMlB,WAAW;AAGnB,gBAAMyB,aAAaP,MAAMhE,MAAMqB,OAAOqF,WAAW;AACjD,cAAInC,WAAWpE,SAAS6D,MAAMhE,MAAMG,QAAQ;AAC1C+K,4BAAgBzK,KAAK;cACnBT,OAAOuE;cACP7F,MAAM,QAAQ6F,WAAWV,IAAIiB,OAAKA,EAAEpG,IAAI,EAAEoD,KAAK,GAAG;cAClDiB,QAAQwB,WAAWrB,KAAK4B,OAAKA,EAAE7F,KAAK;cACpC0F,eAAe;cACf7B,WAAW;YACb,CAAC;UACH;AACAoI,0BAAgBzK,KAAKuD,KAAK;QAC5B,OAAO;AAELkH,4BAAkBlH,MAAMhE,MAAM6D,IAAI,SAAUpE,MAAM;AAChD,mBAAO;cACLO,OAAO,CAACP,IAAI;cACZf,MAAMe,KAAKf;cACXqE,QAAQtD,KAAKR;cACb0F,eAAelF,KAAKgF;cACpB3B,WAAW;YACb;UACF,CAAC;QACH;AAGA,eAAOqI,QAAQD,iBAAiB,SAAUE,WAAW;AACnD,iBAAOJ,aAAajJ,SAAQ1B,QAAQ,GAAG4K,YAAYnK,OAAO,CAACsK,SAAS,CAAC,CAAC;QACxE,CAAC;MACH,OAAO;AAEL,eAAO,CAACH,WAAW;MACrB;IACF;AAEA,WAAOD,aAAajJ,QAAQ,GAAG,CAAA,CAAE;EACnC;AAQA,WAASsJ,YAAaC,SAASC,SAAS;AACtC,UAAMC,KAAK/D,KAAKI,IAAIyD,QAAQnL,QAAQoL,QAAQpL,MAAM;AAElD,aAASI,IAAI,GAAGA,IAAIiL,IAAIjL,KAAK;AAC3B,YAAMkL,WAAWhF,kBAAkB6E,SAAS/K,CAAC;AAC7C,YAAMmL,WAAWjF,kBAAkB8E,SAAShL,CAAC;AAC7C,UAAIoL,UAAU;AACd,UAAIjN;AACJ,WAAKA,UAAQgN,UAAU;AACrB,YAAID,SAASjL,IAAI9B,MAAI,GAAG;AACtBiN,oBAAU;AACV;QACF;MACF;AACA,UAAI,CAACA,SAAS;AACZ,eAAO;MACT;IACF;AAEA,UAAMC,OAAON,QAAQnL;AACrB,UAAM0L,OAAON,QAAQpL;AACrB,UAAM2L,aAAanG,aAAa2F,OAAO;AACvC,UAAMS,aAAapG,aAAa4F,OAAO;AAEvC,WAAOO,aACHC,aAAcH,SAASC,OAASA,QAAQD,OACxCG,aAAcH,QAAQC,OAASD,SAASC;EAC9C;AAUA,WAASG,iBAAkBC,cAAc;AACvC,WAAOA,aAAapI,IAAIpC,QAAM;AAC5B,UAAIyK,cAAczK,EAAE,GAAG;AACrB,eAAO0K,YAAY1K,GAAG0K,YAAYC,QAAQ;MAC5C;AACA,UAAIC,UAAU5K,EAAE,GAAG;AACjB,eAAO6K,YAAY7K,GAAG8K,QAAQC,YAAY/K,GAAG8K,QAAQH,QAAQ;MAC/D;AACA,aAAO3K;IACT,CAAC;EACH;AAaA,WAASgL,mBAAoBD,YAAYP,cAAc3J,cAAc;AACnE,UAAMoK,qBAAqB,CAAA;AAC3B,QAAIC;AACJ,SAAKA,aAAaH,YAAY;AAC5B,UAAII,aAAatK,aAAaqK,SAAS;AACvC,UAAI,OAAOC,eAAe,UAAU;AAClC,cAAM,IAAI9M,UACR,6CAA6C6M,YAAY,GAAG;MAChE;AACAC,mBAAaX,aAAaW,UAAU;AACpC,UAAI,OAAOA,eAAe,YAAY;AACpC,eAAO;MACT;AACAF,yBAAmBjM,KAAKmM,UAAU;IACpC;AACA,WAAOF;EACT;AAaA,WAASG,kBAAmBZ,cAAc3J,cAAcwK,MAAM;AAC5D,UAAMC,oBAAoBf,iBAAiBC,YAAY;AACvD,UAAMe,aAAa,IAAIpO,MAAMmO,kBAAkB5M,MAAM,EAAE8M,KAAK,KAAK;AACjE,QAAIC,iBAAiB;AACrB,WAAOA,gBAAgB;AACrBA,uBAAiB;AACjB,UAAIC,kBAAkB;AACtB,eAAS5M,IAAI,GAAGA,IAAIwM,kBAAkB5M,QAAQ,EAAEI,GAAG;AACjD,YAAIyM,WAAWzM,CAAC,EAAG;AACnB,cAAMkB,KAAKsL,kBAAkBxM,CAAC;AAE9B,YAAI2L,cAAczK,EAAE,GAAG;AACrBsL,4BAAkBxM,CAAC,IAAIkB,GAAG0K,YAAYC,SAASU,IAAI;AAEnDC,4BAAkBxM,CAAC,EAAE4L,cAAc1K,GAAG0K;AACtCa,qBAAWzM,CAAC,IAAI;AAChB4M,4BAAkB;QACpB,WAAWd,UAAU5K,EAAE,GAAG;AACxB,gBAAMiL,qBAAqBD,mBACzBhL,GAAG8K,QAAQC,YAAYO,mBAAmBzK,YAAY;AACxD,cAAIoK,oBAAoB;AACtBK,8BAAkBxM,CAAC,IACjBkB,GAAG8K,QAAQH,SAASzE,MAAM,MAAM+E,kBAAkB;AAEpDK,8BAAkBxM,CAAC,EAAEgM,UAAU9K,GAAG8K;AAClCS,uBAAWzM,CAAC,IAAI;AAChB4M,8BAAkB;UACpB,OAAO;AACLD,6BAAiB;UACnB;QACF;MACF;AAEA,UAAIC,mBAAmBD,gBAAgB;AACrC,cAAM,IAAIxH,YACR,wDAAwD;MAC5D;IACF;AAEA,WAAOqH;EACT;AASA,WAASK,uBAAwBC,eAAe;AAI9C,UAAMC,sBAAsB;AAE5B9O,WAAO+O,KAAKF,aAAa,EAAEhI,QAAQ3D,eAAa;AAC9C,YAAMD,KAAK4L,cAAc3L,SAAS;AAElC,UAAI4L,oBAAoB3O,KAAK8C,GAAG+L,SAAS,CAAC,GAAG;AAC3C,cAAM,IAAI9H,YAAY,kIAE8B;MACtD;IACF,CAAC;EACH;AAYA,WAAS+H,oBAAqB/O,QAAMgP,kBAAkB;AACpDrO,IAAAA,OAAMC;AAEN,QAAId,OAAO+O,KAAKG,gBAAgB,EAAEvN,WAAW,GAAG;AAC9C,YAAM,IAAIuF,YAAY,wBAAwB;IAChD;AAEA,QAAIrG,OAAMsO,2BAA2B;AACnCP,6BAAuBM,gBAAgB;IACzC;AAGA,UAAME,eAAe,CAAA;AACrB,UAAMC,oBAAoB,CAAA;AAC1B,UAAMR,gBAAgB,CAAC;AACvB,UAAMS,wBAAwB,CAAA;AAC9B,QAAIpM;AACJ,SAAKA,aAAagM,kBAAkB;AAElC,UAAI,CAAClP,OAAOuP,UAAUC,eAAeC,KAAKP,kBAAkBhM,SAAS,GAAG;AACtE;MACF;AAEA,YAAMK,SAASC,eAAeN,SAAS;AACvC,UAAI,CAACK,OAAQ;AAEb6L,mBAAavI,QAAQ,SAAU6I,IAAI;AACjC,YAAI7C,YAAY6C,IAAInM,MAAM,GAAG;AAC3B,gBAAM,IAAIjC,UAAU,6BAClBoC,gBAAgBgM,EAAE,IAAI,YACtBhM,gBAAgBH,MAAM,IAAI,IAAI;QAClC;MACF,CAAC;AACD6L,mBAAanN,KAAKsB,MAAM;AAExB,YAAMoM,gBAAgBN,kBAAkB1N;AACxC0N,wBAAkBpN,KAAKiN,iBAAiBhM,SAAS,CAAC;AAClD,YAAM0M,mBAAmBrM,OAAO8B,IAAIe,WAAW;AAE/C,UAAIyJ;AACJ,WAAKA,MAAMtD,YAAYqD,gBAAgB,GAAG;AACxC,cAAME,SAASpM,gBAAgBmM,EAAE;AACjCP,8BAAsBrN,KACpB;UAAEsB,QAAQsM;UAAI3P,MAAM4P;UAAQ7M,IAAI0M;QAAc,CAAC;AACjD,YAAIE,GAAGE,MAAMzK,OAAK,CAACA,EAAEa,aAAa,GAAG;AACnC0I,wBAAciB,MAAM,IAAIH;QAC1B;MACF;IACF;AAEAL,0BAAsBU,KAAK/F,iBAAiB;AAG5C,UAAMsE,oBACJF,kBAAkBgB,mBAAmBR,eAAeoB,UAAU;AAGhE,QAAIrK;AACJ,SAAKA,KAAKiJ,eAAe;AACvB,UAAI7O,OAAOuP,UAAUC,eAAeC,KAAKZ,eAAejJ,CAAC,GAAG;AAC1DiJ,sBAAcjJ,CAAC,IAAI2I,kBAAkBM,cAAcjJ,CAAC,CAAC;MACvD;IACF;AACA,UAAMjC,aAAa,CAAA;AACnB,UAAMuM,uBAAuB,oBAAI1N,IAAI;AACrC,SAAKoD,KAAK0J,uBAAuB;AAI/B,UAAI,CAACY,qBAAqBlO,IAAI4D,EAAE1F,IAAI,GAAG;AACrC0F,UAAE3C,KAAKsL,kBAAkB3I,EAAE3C,EAAE;AAC7BU,mBAAW1B,KAAK2D,CAAC;AACjBsK,6BAAqBhO,IAAI0D,EAAE1F,MAAM0F,CAAC;MACpC;IACF;AAGA,UAAMuK,MAAMxM,WAAW,CAAC,KAAKA,WAAW,CAAC,EAAEJ,OAAO5B,UAAU,KAAK,CAACwF,aAAaxD,WAAW,CAAC,EAAEJ,MAAM;AACnG,UAAM6M,MAAMzM,WAAW,CAAC,KAAKA,WAAW,CAAC,EAAEJ,OAAO5B,UAAU,KAAK,CAACwF,aAAaxD,WAAW,CAAC,EAAEJ,MAAM;AACnG,UAAM8M,MAAM1M,WAAW,CAAC,KAAKA,WAAW,CAAC,EAAEJ,OAAO5B,UAAU,KAAK,CAACwF,aAAaxD,WAAW,CAAC,EAAEJ,MAAM;AACnG,UAAM+M,MAAM3M,WAAW,CAAC,KAAKA,WAAW,CAAC,EAAEJ,OAAO5B,UAAU,KAAK,CAACwF,aAAaxD,WAAW,CAAC,EAAEJ,MAAM;AACnG,UAAMgN,MAAM5M,WAAW,CAAC,KAAKA,WAAW,CAAC,EAAEJ,OAAO5B,UAAU,KAAK,CAACwF,aAAaxD,WAAW,CAAC,EAAEJ,MAAM;AACnG,UAAMiN,MAAM7M,WAAW,CAAC,KAAKA,WAAW,CAAC,EAAEJ,OAAO5B,UAAU,KAAK,CAACwF,aAAaxD,WAAW,CAAC,EAAEJ,MAAM;AACnG,UAAMkN,QAAQN,OAAOC,OAAOC,OAAOC,OAAOC,OAAOC;AAGjD,aAASzO,IAAI,GAAGA,IAAI4B,WAAWhC,QAAQ,EAAEI,GAAG;AAC1C4B,iBAAW5B,CAAC,EAAE5B,OAAOuH,aAAa/D,WAAW5B,CAAC,EAAEwB,MAAM;IACxD;AAEA,UAAMmN,SAASP,MAAM9I,YAAY1D,WAAW,CAAC,EAAEJ,OAAO,CAAC,CAAC,IAAI/D;AAC5D,UAAMmR,SAASP,MAAM/I,YAAY1D,WAAW,CAAC,EAAEJ,OAAO,CAAC,CAAC,IAAI/D;AAC5D,UAAMoR,SAASP,MAAMhJ,YAAY1D,WAAW,CAAC,EAAEJ,OAAO,CAAC,CAAC,IAAI/D;AAC5D,UAAMqR,SAASP,MAAMjJ,YAAY1D,WAAW,CAAC,EAAEJ,OAAO,CAAC,CAAC,IAAI/D;AAC5D,UAAMsR,SAASP,MAAMlJ,YAAY1D,WAAW,CAAC,EAAEJ,OAAO,CAAC,CAAC,IAAI/D;AAC5D,UAAMuR,SAASP,MAAMnJ,YAAY1D,WAAW,CAAC,EAAEJ,OAAO,CAAC,CAAC,IAAI/D;AAE5D,UAAMwR,SAASb,MAAM9I,YAAY1D,WAAW,CAAC,EAAEJ,OAAO,CAAC,CAAC,IAAI/D;AAC5D,UAAMyR,SAASb,MAAM/I,YAAY1D,WAAW,CAAC,EAAEJ,OAAO,CAAC,CAAC,IAAI/D;AAC5D,UAAM0R,SAASb,MAAMhJ,YAAY1D,WAAW,CAAC,EAAEJ,OAAO,CAAC,CAAC,IAAI/D;AAC5D,UAAM2R,SAASb,MAAMjJ,YAAY1D,WAAW,CAAC,EAAEJ,OAAO,CAAC,CAAC,IAAI/D;AAC5D,UAAM4R,SAASb,MAAMlJ,YAAY1D,WAAW,CAAC,EAAEJ,OAAO,CAAC,CAAC,IAAI/D;AAC5D,UAAM6R,SAASb,MAAMnJ,YAAY1D,WAAW,CAAC,EAAEJ,OAAO,CAAC,CAAC,IAAI/D;AAG5D,aAASuC,IAAI,GAAGA,IAAI4B,WAAWhC,QAAQ,EAAEI,GAAG;AAC1C4B,iBAAW5B,CAAC,EAAE+C,iBACZyG,yBAAyB5H,WAAW5B,CAAC,EAAEwB,QAAQI,WAAW5B,CAAC,EAAEkB,EAAE;IACnE;AAEA,UAAMqO,MAAMnB,MAAMxM,WAAW,CAAC,EAAEmB,iBAAiBrF;AACjD,UAAM8R,MAAMnB,MAAMzM,WAAW,CAAC,EAAEmB,iBAAiBrF;AACjD,UAAM+R,MAAMnB,MAAM1M,WAAW,CAAC,EAAEmB,iBAAiBrF;AACjD,UAAMgS,MAAMnB,MAAM3M,WAAW,CAAC,EAAEmB,iBAAiBrF;AACjD,UAAMiS,MAAMnB,MAAM5M,WAAW,CAAC,EAAEmB,iBAAiBrF;AACjD,UAAMkS,MAAMnB,MAAM7M,WAAW,CAAC,EAAEmB,iBAAiBrF;AAEjD,UAAMmS,OAAOzB,MAAMxM,WAAW,CAAC,EAAEJ,OAAO5B,SAAS;AACjD,UAAMyL,OAAOgD,MAAMzM,WAAW,CAAC,EAAEJ,OAAO5B,SAAS;AACjD,UAAM0L,OAAOgD,MAAM1M,WAAW,CAAC,EAAEJ,OAAO5B,SAAS;AACjD,UAAMkQ,OAAOvB,MAAM3M,WAAW,CAAC,EAAEJ,OAAO5B,SAAS;AACjD,UAAMmQ,OAAOvB,MAAM5M,WAAW,CAAC,EAAEJ,OAAO5B,SAAS;AACjD,UAAMoQ,OAAOvB,MAAM7M,WAAW,CAAC,EAAEJ,OAAO5B,SAAS;AAGjD,UAAMqQ,SAASvB,QAAQ,IAAI;AAC3B,UAAMwB,OAAOtO,WAAWhC;AAExB,UAAM8F,QAAQ9D,WAAW0B,IAAIO,CAAAA,OAAKA,GAAEzF,IAAI;AACxC,UAAM+R,MAAMvO,WAAW0B,IAAIO,CAAAA,OAAKA,GAAEd,cAAc;AAChD,UAAMqN,UAAU,SAASA,WAAW;AAClC;AAEA,eAASpQ,IAAIiQ,QAAQjQ,IAAIkQ,MAAMlQ,KAAK;AAClC,YAAI0F,MAAM1F,CAAC,EAAEL,SAAS,GAAG;AACvB,iBAAOwQ,IAAInQ,CAAC,EAAEoH,MAAM,MAAMzH,SAAS;QACrC;MACF;AAEA,aAAOb,OAAMuR,WAAWlS,QAAMwB,WAAWiC,UAAU;IACrD;AAIA,aAASsM,WAAYoC,MAAMC,MAAM;AAC/B;AAEA,UAAI5Q,UAAUC,WAAWiQ,QAAQlB,OAAO2B,IAAI,KAAKrB,OAAOsB,IAAI,GAAG;AAAE,eAAOhB,IAAInI,MAAM,MAAMzH,SAAS;MAAE;AACnG,UAAIA,UAAUC,WAAWyL,QAAQuD,OAAO0B,IAAI,KAAKpB,OAAOqB,IAAI,GAAG;AAAE,eAAOf,IAAIpI,MAAM,MAAMzH,SAAS;MAAE;AACnG,UAAIA,UAAUC,WAAW0L,QAAQuD,OAAOyB,IAAI,KAAKnB,OAAOoB,IAAI,GAAG;AAAE,eAAOd,IAAIrI,MAAM,MAAMzH,SAAS;MAAE;AACnG,UAAIA,UAAUC,WAAWkQ,QAAQhB,OAAOwB,IAAI,KAAKlB,OAAOmB,IAAI,GAAG;AAAE,eAAOb,IAAItI,MAAM,MAAMzH,SAAS;MAAE;AACnG,UAAIA,UAAUC,WAAWmQ,QAAQhB,OAAOuB,IAAI,KAAKjB,OAAOkB,IAAI,GAAG;AAAE,eAAOZ,IAAIvI,MAAM,MAAMzH,SAAS;MAAE;AACnG,UAAIA,UAAUC,WAAWoQ,QAAQhB,OAAOsB,IAAI,KAAKhB,OAAOiB,IAAI,GAAG;AAAE,eAAOX,IAAIxI,MAAM,MAAMzH,SAAS;MAAE;AAEnG,aAAOyQ,QAAQhJ,MAAM,MAAMzH,SAAS;IACtC;AAGA,QAAI;AACF1B,aAAOgM,eAAeiE,YAAY,QAAQ;QAAEtN,OAAOzC;MAAK,CAAC;IAC3D,SAASoI,KAAK;IAGZ;AAMF2H,eAAWtM,aAAakL;AAIxBoB,eAAWpM,qBAAqB;MAC9BF;MACAG,cAAcoM;IAChB;AAEA,WAAOD;EACT;AAQA,WAASsC,YAAarS,QAAM6H,MAAMpE,YAAY;AAC5C,UAAM0E,YAAYnI,QAAM6H,MAAMpE,UAAU;EAC1C;AAOA,WAASgE,QAAS6K,KAAK;AACrB,WAAOnQ,MAAMmQ,KAAK,GAAGA,IAAI7Q,SAAS,CAAC;EACrC;AAOA,WAASyF,KAAMoL,KAAK;AAClB,WAAOA,IAAIA,IAAI7Q,SAAS,CAAC;EAC3B;AASA,WAASU,MAAOmQ,KAAKC,OAAOC,KAAK;AAC/B,WAAOtS,MAAMmP,UAAUlN,MAAMoN,KAAK+C,KAAKC,OAAOC,GAAG;EACnD;AASA,WAASC,YAAaH,KAAKrS,MAAM;AAC/B,aAAS4B,IAAI,GAAGA,IAAIyQ,IAAI7Q,QAAQI,KAAK;AACnC,UAAI5B,KAAKqS,IAAIzQ,CAAC,CAAC,GAAG;AAChB,eAAOyQ,IAAIzQ,CAAC;MACd;IACF;AACA,WAAOrC;EACT;AASA,WAASiN,QAAS6F,KAAK5E,UAAU;AAC/B,WAAOxN,MAAMmP,UAAUjN,OAAO6G,MAAM,CAAA,GAAIqJ,IAAInN,IAAIuI,QAAQ,CAAC;EAC3D;AAaA,WAASG,UAAW;AAClB,UAAMC,aACJrG,QAAQjG,SAAS,EAAE2D,IAAIO,OAAKlC,gBAAgBF,eAAeoC,CAAC,CAAC,CAAC;AAChE,UAAMgI,WAAWxG,KAAK1F,SAAS;AAE/B,QAAI,OAAOkM,aAAa,YAAY;AAClC,YAAM,IAAItM,UAAU,6CAA6C;IACnE;AAEA,WAAOwM,YAAYE,YAAYJ,QAAQ;EACzC;AAEA,WAASE,YAAaE,YAAYJ,UAAU;AAC1C,WAAO;MAAEG,SAAS;QAAEC;QAAYJ;MAAS;IAAE;EAC7C;AAQA,WAASD,YAAaC,UAAU;AAC9B,QAAI,OAAOA,aAAa,YAAY;AAClC,YAAM,IAAItM,UAAU,8CAA8C;IACpE;AAEA,WAAO;MAAEqM,aAAa;QAAEC;MAAS;IAAE;EACrC;AASA,WAASC,UAAW+E,YAAY;AAC9B,WAAOA,cACL,OAAOA,WAAW7E,YAAY,YAC9B3N,MAAMC,QAAQuS,WAAW7E,QAAQC,UAAU,KAC3C,OAAO4E,WAAW7E,QAAQH,aAAa;EAC3C;AASA,WAASF,cAAekF,YAAY;AAClC,WAAOA,cACL,OAAOA,WAAWjF,gBAAgB,YAClC,OAAOiF,WAAWjF,YAAYC,aAAa;EAC/C;AAUA,WAASiF,UAAWC,WAAWrM,SAAS;AACtC,QAAI,CAACqM,WAAW;AACd,aAAOrM;IACT;AACA,QAAIA,WAAWA,YAAYqM,WAAW;AACpC,YAAMxK,MAAM,IAAIrD,MAAM,4CACpB6N,YAAY,eAAerM,UAAU,GAAG;AAC1C6B,UAAIM,OAAO;QAAEE,QAAQrC;QAAS8B,UAAUuK;MAAU;AAClD,YAAMxK;IACR;AACA,WAAOwK;EACT;AAQA,WAASC,cAAeC,KAAK;AAC3B,QAAI9S;AACJ,eAAW+S,OAAOD,KAAK;AAGrB,UAAIhT,OAAOuP,UAAUC,eAAeC,KAAKuD,KAAKC,GAAG,MAC9CnQ,gBAAgBkQ,IAAIC,GAAG,CAAC,KACvB,OAAOD,IAAIC,GAAG,EAAE/P,cAAc,WAAW;AAC3ChD,QAAAA,SAAO2S,UAAU3S,QAAM8S,IAAIC,GAAG,EAAE/S,IAAI;MACtC;IACF;AACA,WAAOA;EACT;AASA,WAASgT,gBAAiBC,MAAMC,QAAQ;AACtC,QAAIH;AACJ,SAAKA,OAAOG,QAAQ;AAClB,UAAIpT,OAAOuP,UAAUC,eAAeC,KAAK2D,QAAQH,GAAG,GAAG;AACrD,YAAIA,OAAOE,MAAM;AACf,cAAIC,OAAOH,GAAG,MAAME,KAAKF,GAAG,GAAG;AAC7B,kBAAM3K,MAAM,IAAIrD,MAAM,gBAAgBgO,MAAM,oBAAoB;AAChE3K,gBAAIM,OAAO;cACT1F,WAAW+P;cACXI,gBAAgBD,OAAOH,GAAG;cAC1BK,cAAcH,KAAKF,GAAG;YACxB;AACA,kBAAM3K;UACR;QAEF;AACA6K,aAAKF,GAAG,IAAIG,OAAOH,GAAG;MACxB;IACF;EACF;AAEA,QAAMM,YAAY1S;AAyBlBA,EAAAA,SAAQ,SAAU2S,WAAW;AAC3B,UAAMC,QAAQ,OAAOD,cAAc;AACnC,UAAMf,QAAQgB,QAAQ,IAAI;AAC1B,QAAIvT,SAAOuT,QAAQD,YAAY;AAC/B,UAAME,gBAAgB,CAAC;AACvB,aAAS3R,IAAI0Q,OAAO1Q,IAAIL,UAAUC,QAAQ,EAAEI,GAAG;AAC7C,YAAM4R,OAAOjS,UAAUK,CAAC;AACxB,UAAI6R,kBAAkB,CAAC;AACvB,UAAIC;AACJ,UAAI,OAAOF,SAAS,YAAY;AAC9BE,mBAAWF,KAAKzT;AAChB,YAAI,OAAOyT,KAAKzQ,cAAc,UAAU;AAEtC0Q,0BAAgBD,KAAKzQ,SAAS,IAAIyQ;QACpC,WAAW7Q,gBAAgB6Q,IAAI,GAAG;AAEhCC,4BAAkBD,KAAKhQ;QACzB;MACF,WAAW9D,eAAc8T,IAAI,GAAG;AAE9BC,0BAAkBD;AAClB,YAAI,CAACF,OAAO;AACVI,qBAAWd,cAAcY,IAAI;QAC/B;MACF;AAEA,UAAI3T,OAAO+O,KAAK6E,eAAe,EAAEjS,WAAW,GAAG;AAC7C,cAAM2G,MAAM,IAAIhH,UACd,kCAAoCS,IAAI,4FACwB;AAClEuG,YAAIM,OAAO;UAAE/G,OAAOE;UAAG+R,UAAUH;QAAK;AACtC,cAAMrL;MACR;AAEA,UAAI,CAACmL,OAAO;AACVvT,QAAAA,SAAO2S,UAAU3S,QAAM2T,QAAQ;MACjC;AACAX,sBAAgBQ,eAAeE,eAAe;IAChD;AAEA,WAAO3E,oBAAoB/O,UAAQ,IAAIwT,aAAa;EACtD;AAEA7S,EAAAA,OAAMjB,SAASA;AACfiB,EAAAA,OAAMC,cAAcyS,UAAUzS;AAC9BD,EAAAA,OAAMuR,aAAaG;AACnB1R,EAAAA,OAAMkT,qBAAqBxB;AAC3B1R,EAAAA,OAAMwH,cAAcA;AACpBxH,EAAAA,OAAM0B,QAAQA;AACd1B,EAAAA,OAAM4B,mBAAmBA;AACzB5B,EAAAA,OAAMU,WAAWA;AACjBV,EAAAA,OAAMmT,YAAYjT;AAClBF,EAAAA,OAAMkN,UAAUA;AAChBlN,EAAAA,OAAM8M,cAAcA;AACpB9M,EAAAA,OAAMkE,UAAUA;AAChBlE,EAAAA,OAAMmC,gBAAgBA;AACtBnC,EAAAA,OAAMgE,OAAOA;AACbhE,EAAAA,OAAMiC,kBAAkBA;AACxBjC,EAAAA,OAAMsO,4BAA4B;AAUlCtO,EAAAA,OAAMoT,UAAU,SAAUhT,MAAMiT,kBAAkB;AAChD,QAAIC,SAAS;AACb,QAAID,qBAAqB,SAASxT,QAAQsB,IAAI,QAAQ,GAAG;AACvDmS,eAAS;IACX;AACAtT,IAAAA,OAAMU,SAAS,CAACN,IAAI,GAAGkT,MAAM;EAC/B;AASA,WAASC,oBAAqBnO,YAAY;AACxC,QAAI,CAACA,cACH,OAAOA,WAAWd,SAAS,YAC3B,OAAOc,WAAWkG,OAAO,YACzB,OAAOlG,WAAWlB,YAAY,YAAY;AAC1C,YAAM,IAAIzD,UAAU,+EAA+E;IACrG;AACA,QAAI2E,WAAWkG,OAAOlG,WAAWd,MAAM;AACrC,YAAM,IAAI+B,YACR,wCAAwCjB,WAAWd,OACnD,cAAc;IAClB;EACF;AAUAtE,EAAAA,OAAMwT,gBAAgB,SAAUpO,YAA2C;AAAA,QAA/B9C,UAAOzB,UAAAC,SAAA,KAAAD,UAAA,CAAA,MAAAhC,SAAAgC,UAAA,CAAA,IAAG;MAAE4S,UAAU;IAAM;AACtEF,wBAAoBnO,UAAU;AAE9B,UAAMkG,KAAKpL,SAASkF,WAAWkG,EAAE;AACjC,UAAMoI,WAAWpI,GAAGhK,cAAc0C,KAAM2P,WAAUA,MAAMrP,SAASc,WAAWd,IAAI;AAEhF,QAAIoP,UAAU;AACZ,UAAIpR,WAAWA,QAAQmR,UAAU;AAC/BzT,QAAAA,OAAM4T,iBAAiB;UAAEtP,MAAMoP,SAASpP;UAAMgH,IAAIlG,WAAWkG;UAAIpH,SAASwP,SAASxP;QAAQ,CAAC;MAC9F,OAAO;AACL,cAAM,IAAIE,MACR,yCAAyCgB,WAAWd,OAAO,WAC3DgH,GAAGjM,OAAO,GAAG;MACjB;IACF;AAEAiM,OAAGhK,cAAcF,KAAK;MACpBkD,MAAMc,WAAWd;MACjBgH,IAAIA,GAAGjM;MACP6E,SAASkB,WAAWlB;MACpBlD,OAAOjB;IACT,CAAC;EACH;AAUAC,EAAAA,OAAM6T,iBAAiB,SAAU1P,aAAa7B,SAAS;AACrD6B,gBAAY6B,QAAQZ,gBAAcpF,OAAMwT,cAAcpO,YAAY9C,OAAO,CAAC;EAC5E;AAWAtC,EAAAA,OAAM4T,mBAAmB,SAAUxO,YAAY;AAC7CmO,wBAAoBnO,UAAU;AAC9B,UAAMkG,KAAKpL,SAASkF,WAAWkG,EAAE;AACjC,UAAMwI,qBACJhC,YAAYxG,GAAGhK,eAAe8I,OAAMA,EAAE9F,SAASc,WAAWd,IAAK;AACjE,QAAI,CAACwP,oBAAoB;AACvB,YAAM,IAAI1P,MACR,mDAAmDgB,WAAWd,OAC9D,SAASc,WAAWkG,EAAE;IAC1B;AACA,QAAIwI,mBAAmB5P,YAAYkB,WAAWlB,SAAS;AACrD,YAAM,IAAIE,MACR,yDAAyD;IAC7D;AACA,UAAMpD,QAAQsK,GAAGhK,cAAcsD,QAAQkP,kBAAkB;AACzDxI,OAAGhK,cAAcyS,OAAO/S,OAAO,CAAC;EAClC;AAYAhB,EAAAA,OAAMgU,UAAU,SAAUC,IAAIC,SAAS;AACrC,QAAI,CAACjS,gBAAgBgS,EAAE,GAAG;AACxB,YAAM,IAAIxT,UAAU3B,kBAAkB;IACxC;AACA,UAAMqV,OAAOF,GAAGjR,mBAAmBF;AACnC,aAAS5B,IAAI,GAAGA,IAAIiT,KAAKrT,QAAQ,EAAEI,GAAG;AACpC,UAAIiT,KAAKjT,CAAC,EAAE5B,KAAK4U,OAAO,GAAG;AACzB,eAAOC,KAAKjT,CAAC;MACf;IACF;AACA,WAAO;EACT;AAEA,SAAOlB;AACT;AAEA,IAAA,yBAAejB,OAAO;;;ACt6Df,SAAS,QAAQqV,QAAMC,gBAAcC,SAAQ,MAAM;AACxD,WAAS,gBAAgB,OAAO;AAI9B,QAAI,OAAO,YAAY,OAAOD,eAAa,IAAI,qBAAqB,CAAC;AACrE,uBAAmBD,QAAMC,gBAAc,KAAK;AAC5C,WAAOC,QAAO,IAAI;AAAA,EACpB;AACA,kBAAgB,YAAY;AAC5B,kBAAgB,KAAKF;AACrB,kBAAgB,eAAeC,eAAa,MAAM,EAAE,KAAK;AACzD,MAAI,MAAM;AACR,oBAAgB,OAAO;AAAA,EACzB;AACA,SAAO;AACT;AAoEO,SAAS,mBAAmBE,QAAMC,gBAAc,OAAO;AAC5D,MAAI,aAAaA,eAAa,OAAO,gBAAc,CAAC,qBAAqB,UAAU,CAAC,EACnF,MAAM,gBAAc,MAAM,UAAU,MAAM,MAAS;AACpD,MAAI,CAAC,YAAY;AACf,QAAI,sBAAsBA,eAAa,OAAO,gBAAc,MAAM,UAAU,MAAM,MAAS;AAG3F,UAAM,IAAI,MAAM,2BAA4B,OAAOD,QAAM,KAAM,IAAI,kCAAkC,OAAO,oBAAoB,IAAI,OAAK,IAAK,OAAO,GAAG,GAAI,CAAC,EAAE,KAAK,IAAI,GAAG,GAAG,CAAC;AAAA,EACjL;AACF;AACO,SAAS,qBAAqB,YAAY;AAC/C,SAAO,cAAc,WAAW,CAAC,MAAM;AACzC;AACO,SAAS,sBAAsB,YAAY;AAChD,SAAO,cAAc,WAAW,CAAC,MAAM,MAAM,WAAW,MAAM,CAAC,IAAI;AACrE;;;ACrHO,SAAS,UAAU,OAAO;AAC/B,MAAI,OAAO,UAAU,WAAW;AAC9B,WAAO;AAAA,EACT;AACA,SAAO,OAAO,SAAS,KAAK,IAAI,UAAU,KAAK,MAAM,KAAK,IAAI;AAChE;AAoBO,SAAS,eAAe,WAAWE,SAAQ;AAChD,MAAIA,QAAO,WAAW,UAAU;AAC9B,QAAI;AACF,aAAO,SAAS;AAAA,IAClB,SAAS,SAAS;AAChB,aAAOA,QAAO;AAAA,IAChB;AAAA,EACF;AACA,SAAOA,QAAO;AAChB;AAOO,IAAI,OAAO,KAAK,QAAQ,SAAU,GAAG;AAC1C,MAAI,IAAI,GAAG;AACT,WAAO;AAAA,EACT,WAAW,IAAI,GAAG;AAChB,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAOO,IAAI,OAAO,KAAK,QAAQ,SAASC,MAAK,GAAG;AAC9C,SAAO,KAAK,IAAI,CAAC,IAAI,KAAK;AAC5B;AAOO,IAAI,QAAQ,KAAK,SAAS,SAASC,OAAM,GAAG;AACjD,SAAO,KAAK,IAAI,CAAC,IAAI,KAAK;AAC5B;AAOO,IAAI,QAAQ,KAAK,SAAS,SAAU,GAAG;AAC5C,SAAO,KAAK,IAAI,IAAI,CAAC;AACvB;AAWO,IAAI,OAAO,KAAK,QAAQ,SAASC,MAAK,GAAG;AAC9C,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AACA,MAAI,SAAS,IAAI;AACjB,MAAI;AACJ,MAAI,QAAQ;AACV,QAAI,CAAC;AAAA,EACP;AACA,MAAI,OAAO,SAAS,CAAC,GAAG;AACtB,aAAS,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;AAEjC,cAAU,KAAK,SAAS,UAAU,IAAI,UAAU;AAAA,EAClD,OAAO;AACL,aAAS;AAAA,EACX;AACA,SAAO,SAAS,CAAC,SAAS;AAC5B;AAOO,IAAI,QAAQ,KAAK,SAAS,SAASC,OAAM,GAAG;AACjD,SAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AACjF;AASA,SAAS,mBAAmB,GAAG,MAAMC,OAAM;AACzC,MAAI,WAAW;AAAA,IACb,GAAG;AAAA,IACH,GAAG;AAAA,IACH,IAAI;AAAA,EACN;AACA,MAAI,SAAS,SAAS,IAAI;AAC1B,MAAI,SAAS;AACb,MAAIA,OAAM;AACR,QAAIA,QAAO,GAAG;AACZ,YAAM,IAAI,MAAM,gCAAgC;AAAA,IAClD;AACA,QAAI,CAAC,UAAUA,KAAI,GAAG;AACpB,YAAM,IAAI,MAAM,yBAAyB;AAAA,IAC3C;AACA,QAAI,IAAI,MAAMA,QAAO,KAAK,KAAK,IAAI,EAAE,MAAMA,QAAO,KAAK;AACrD,YAAM,IAAI,MAAM,8BAA8B,OAAOA,QAAO,GAAG,MAAM,EAAE,OAAOA,QAAO,GAAG,KAAK,CAAC;AAAA,IAChG;AACA,QAAI,CAAC,UAAU,CAAC,GAAG;AACjB,YAAM,IAAI,MAAM,0BAA0B;AAAA,IAC5C;AACA,QAAI,IAAI,GAAG;AACT,UAAI,IAAI,KAAKA;AAAA,IACf;AACA,aAAS,IAAI,OAAOA,KAAI;AAAA,EAC1B;AACA,MAAIC,QAAO;AACX,MAAI,IAAI,GAAG;AACT,QAAI,CAAC;AACL,IAAAA,QAAO;AAAA,EACT;AACA,SAAO,GAAG,OAAOA,KAAI,EAAE,OAAO,MAAM,EAAE,OAAO,EAAE,SAAS,IAAI,CAAC,EAAE,OAAO,MAAM;AAC9E;AAsFO,SAAS,OAAO,OAAO,SAAS;AACrC,MAAI,OAAO,YAAY,YAAY;AAEjC,WAAO,QAAQ,KAAK;AAAA,EACtB;AAGA,MAAI,UAAU,UAAU;AACtB,WAAO;AAAA,EACT,WAAW,UAAU,WAAW;AAC9B,WAAO;AAAA,EACT,WAAW,MAAM,KAAK,GAAG;AACvB,WAAO;AAAA,EACT;AACA,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACA;AAAA,EACF,IAAI,uBAAuB,OAAO;AAGlC,UAAQ,UAAU;AAAA,IAChB,KAAK;AACH,aAAO,QAAQ,OAAO,SAAS;AAAA,IACjC,KAAK;AACH,aAAO,cAAc,OAAO,SAAS;AAAA,IACvC,KAAK;AACH,aAAO,cAAc,OAAO,SAAS;AAAA,IACvC,KAAK;AACH,aAAO,mBAAmB,OAAO,GAAG,QAAQ;AAAA,IAC9C,KAAK;AACH,aAAO,mBAAmB,OAAO,GAAG,QAAQ;AAAA,IAC9C,KAAK;AACH,aAAO,mBAAmB,OAAO,IAAI,QAAQ;AAAA,IAC/C,KAAK;AAEH,aAAO,YAAY,OAAO,WAAW,OAAO,EAAE,QAAQ,uBAAuB,WAAY;AACvF,YAAIC,UAAS,UAAU,CAAC;AACxB,YAAI,IAAI,UAAU,CAAC;AACnB,eAAOA,YAAW,MAAMA,UAAS,IAAI;AAAA,MACvC,CAAC;AAAA,IACH;AACE,YAAM,IAAI,MAAM,uBAAuB,WAAW,kEAAuE;AAAA,EAC7H;AACF;AAUO,SAAS,uBAAuB,SAAS;AAE9C,MAAI,WAAW;AACf,MAAI;AACJ,MAAI;AACJ,MAAI,YAAY,QAAW;AACzB,QAAI,SAAS,OAAO,GAAG;AACrB,kBAAY;AAAA,IACd,WAAW,YAAY,OAAO,GAAG;AAC/B,kBAAY,QAAQ,SAAS;AAAA,IAC/B,WAAW,SAAS,OAAO,GAAG;AAC5B,UAAI,QAAQ,cAAc,QAAW;AACnC,oBAAY,iBAAiB,QAAQ,WAAW,MAAM;AACpD,gBAAM,IAAI,MAAM,kDAAkD;AAAA,QACpE,CAAC;AAAA,MACH;AACA,UAAI,QAAQ,aAAa,QAAW;AAClC,mBAAW,iBAAiB,QAAQ,UAAU,MAAM;AAClD,gBAAM,IAAI,MAAM,iDAAiD;AAAA,QACnE,CAAC;AAAA,MACH;AACA,UAAI,QAAQ,UAAU;AACpB,mBAAW,QAAQ;AAAA,MACrB;AAAA,IACF,OAAO;AACL,YAAM,IAAI,MAAM,oEAAoE;AAAA,IACtF;AAAA,EACF;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAQO,SAAS,YAAY,OAAO;AAEjC,MAAI,QAAQ,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iCAAiC;AAC/E,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,YAAY,oBAAoB,KAAK;AAAA,EACjD;AACA,MAAID,QAAO,MAAM,CAAC;AAClB,MAAIC,UAAS,MAAM,CAAC;AACpB,MAAI,WAAW,WAAW,MAAM,CAAC,KAAK,GAAG;AACzC,MAAIC,OAAMD,QAAO,QAAQ,GAAG;AAC5B,cAAYC,SAAQ,KAAKA,OAAM,IAAID,QAAO,SAAS;AACnD,MAAI,eAAeA,QAAO,QAAQ,KAAK,EAAE,EACxC,QAAQ,OAAO,SAAUE,QAAO;AAE/B,gBAAYA,OAAM;AAClB,WAAO;AAAA,EACT,CAAC,EAAE,QAAQ,OAAO,EAAE,EACnB,MAAM,EAAE,EAAE,IAAI,SAAU,GAAG;AAC1B,WAAO,SAAS,CAAC;AAAA,EACnB,CAAC;AACD,MAAI,aAAa,WAAW,GAAG;AAC7B,iBAAa,KAAK,CAAC;AACnB;AAAA,EACF;AACA,SAAO;AAAA,IACL,MAAAH;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAOO,SAAS,cAAc,OAAO,WAAW;AAC9C,MAAI,MAAM,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG;AAC3C,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,MAAI,QAAQ,YAAY,KAAK;AAC7B,MAAI,UAAU,YAAY,OAAO,SAAS;AAC1C,MAAI,IAAI,QAAQ;AAChB,MAAI,IAAI,QAAQ;AAGhB,MAAI,SAAS,IAAI,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAC/D,MAAI,SAAS,SAAS,GAAG;AAEvB,WAAO,YAAY,EAAE,UAAU,IAAI,SAAS,IAAI,EAAE,QAAQ;AACxD,QAAE,KAAK,CAAC;AAAA,IACV;AAAA,EACF,OAAO;AAGL,QAAI,eAAe,KAAK,IAAI,IAAI,MAAM,KAAK,EAAE,SAAS;AACtD,aAAS,IAAI,GAAG,IAAI,cAAc,KAAK;AACrC,QAAE,KAAK,CAAC;AAAA,IACV;AAAA,EACF;AAGA,MAAI,UAAU,KAAK,IAAI,IAAI,MAAM;AACjC,MAAI,aAAa;AAGjB,SAAO,UAAU,GAAG;AAClB;AACA;AAAA,EACF;AAIA,MAAI,WAAW,EAAE,MAAM,UAAU,EAAE,KAAK,EAAE;AAC1C,MAAI,aAAa,SAAS,SAAS,KAAK,SAAS,UAAU,SAAS,MAAM,OAAO,IAAI,MAAM,WAAW;AACtG,MAAI,MAAM,EAAE,MAAM,GAAG,UAAU,EAAE,KAAK,EAAE,IAAI,aAAa,OAAO,KAAK,IAAI,MAAM,MAAM,OAAO,SAAS;AACrG,SAAO,QAAQ,OAAO;AACxB;AAQO,SAAS,QAAQ,OAAO,WAAW;AACxC,MAAI,MAAM,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG;AAC3C,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,MAAI,aAAa,YAAY,KAAK;AAClC,MAAI,UAAU,OAAO,cAAc,WAAW,YAAY,YAAY,WAAW,WAAW,IAAI,SAAS,IAAI;AAC7G,MAAI,IAAI,QAAQ;AAChB,MAAI,IAAI,QAAQ,WAAW;AAG3B,MAAI,KAAK,KAAK,aAAa;AAC3B,MAAI,EAAE,SAAS,IAAI;AACjB,QAAI,EAAE,OAAO,MAAM,KAAK,EAAE,MAAM,CAAC;AAAA,EACnC;AAGA,MAAI,IAAI,GAAG;AACT,QAAI,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC;AAC1B,QAAI;AAAA,EACN;AAGA,MAAI,IAAI,EAAE,QAAQ;AAChB,MAAE,OAAO,GAAG,GAAG,MAAM,IAAI,OAAO,GAAG;AAAA,EACrC;AACA,SAAO,QAAQ,OAAO,EAAE,KAAK,EAAE;AACjC;AASO,SAAS,cAAc,OAAO,WAAW;AAC9C,MAAI,MAAM,KAAK,KAAK,CAAC,OAAO,SAAS,OAAO,KAAK,CAAC,GAAG;AACnD,WAAO,OAAO,KAAK;AAAA,EACrB;AAGA,MAAI,QAAQ,YAAY,KAAK;AAC7B,MAAI,UAAU,YAAY,YAAY,OAAO,SAAS,IAAI;AAC1D,MAAI,IAAI,QAAQ;AAChB,MAAI,IAAI,QAAQ;AAGhB,MAAI,EAAE,SAAS,WAAW;AACxB,QAAI,EAAE,OAAO,MAAM,YAAY,EAAE,MAAM,CAAC;AAAA,EAC1C;AAGA,MAAI,QAAQ,EAAE,MAAM;AACpB,SAAO,QAAQ,OAAO,SAAS,EAAE,SAAS,IAAI,MAAM,EAAE,KAAK,EAAE,IAAI,MAAM,OAAO,KAAK,IAAI,MAAM,MAAM;AACrG;AAYO,SAAS,YAAY,OAAO,WAAW,SAAS;AACrD,MAAI,MAAM,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG;AAC3C,WAAO,OAAO,KAAK;AAAA,EACrB;AAGA,MAAI,WAAW,mBAAmB,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ,UAAU,EAAE;AACxG,MAAI,WAAW,mBAAmB,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ,UAAU,CAAC;AACvG,MAAI,QAAQ,YAAY,KAAK;AAC7B,MAAI,UAAU,YAAY,YAAY,OAAO,SAAS,IAAI;AAC1D,MAAI,QAAQ,WAAW,YAAY,QAAQ,YAAY,UAAU;AAE/D,WAAO,cAAc,OAAO,SAAS;AAAA,EACvC,OAAO;AACL,QAAI,IAAI,QAAQ;AAChB,QAAI,IAAI,QAAQ;AAGhB,QAAI,EAAE,SAAS,WAAW;AACxB,UAAI,EAAE,OAAO,MAAM,YAAY,EAAE,MAAM,CAAC;AAAA,IAC1C;AAIA,QAAI,EAAE,OAAO,MAAM,IAAI,EAAE,SAAS,KAAK,EAAE,SAAS,YAAY,YAAY,EAAE,SAAS,EAAE,CAAC;AAGxF,QAAI,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC;AACtB,QAAIE,OAAM,IAAI,IAAI,IAAI;AACtB,QAAIA,OAAM,EAAE,SAAS,GAAG;AACtB,QAAE,OAAOA,OAAM,GAAG,GAAG,GAAG;AAAA,IAC1B;AACA,WAAO,QAAQ,OAAO,EAAE,KAAK,EAAE;AAAA,EACjC;AACF;AAUO,SAAS,YAAY,OAAO,WAAW;AAE5C,MAAI,UAAU;AAAA,IACZ,MAAM,MAAM;AAAA,IACZ,cAAc,MAAM;AAAA,IACpB,UAAU,MAAM;AAAA,EAClB;AACA,MAAI,IAAI,QAAQ;AAGhB,SAAO,aAAa,GAAG;AACrB,MAAE,QAAQ,CAAC;AACX,YAAQ;AACR;AAAA,EACF;AACA,MAAI,EAAE,SAAS,WAAW;AACxB,QAAI,UAAU,EAAE,OAAO,WAAW,EAAE,SAAS,SAAS;AACtD,QAAI,QAAQ,CAAC,KAAK,GAAG;AACnB,UAAI,IAAI,YAAY;AACpB,QAAE,CAAC;AACH,aAAO,EAAE,CAAC,MAAM,IAAI;AAClB,UAAE,IAAI;AACN,YAAI,MAAM,GAAG;AACX,YAAE,QAAQ,CAAC;AACX,kBAAQ;AACR;AAAA,QACF;AACA;AACA,UAAE,CAAC;AAAA,MACL;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAOA,SAAS,MAAM,QAAQ;AACrB,MAAI,MAAM,CAAC;AACX,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,KAAK,CAAC;AAAA,EACZ;AACA,SAAO;AACT;AAaO,SAAS,OAAO,OAAO;AAC5B,SAAO,MAAM,cAAc,EAAE,QAAQ,QAAQ,EAAE,EAC9C,QAAQ,cAAc,EAAE,EACxB;AACH;AAmBO,SAAS,YAAY,GAAG,GAAG;AAChC,MAAI,SAAS,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACjF,MAAI,SAAS,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACjF,MAAI,UAAU,GAAG;AACf,UAAM,IAAI,MAAM,2CAA2C;AAAA,EAC7D;AACA,MAAI,SAAS,GAAG;AACd,UAAM,IAAI,MAAM,uCAAuC;AAAA,EACzD;AAGA,MAAI,MAAM,CAAC,KAAK,MAAM,CAAC,GAAG;AACxB,WAAO;AAAA,EACT;AACA,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,SAAS,CAAC,GAAG;AAC9C,WAAO,MAAM;AAAA,EACf;AACA,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AAGA,SAAO,KAAK,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,SAAS,KAAK,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,GAAG,MAAM;AACxF;AA8DA,SAAS,iBAAiB,OAAO,SAAS;AACxC,MAAI,SAAS,KAAK,GAAG;AACnB,WAAO;AAAA,EACT,WAAW,YAAY,KAAK,GAAG;AAC7B,WAAO,MAAM,SAAS;AAAA,EACxB,OAAO;AACL,YAAQ;AAAA,EACV;AACF;AACA,SAAS,mBAAmB,OAAO,cAAc;AAC/C,MAAI,SAAS,KAAK,GAAG;AACnB,WAAO;AAAA,EACT,WAAW,YAAY,KAAK,GAAG;AAC7B,WAAO,MAAM,SAAS;AAAA,EACxB,OAAO;AACL,WAAO;AAAA,EACT;AACF;;;ACzqBA,IAAI,gBAAgB,SAAS,eAAe;AAG1C,kBAAgB,uBAAc;AAC9B,SAAO;AACT;AACA,IAAI,eAAe,CAAC,cAAc,YAAY,gBAAgB,WAAW;AAOlE,IAAI,cAA6B,wBAAQ,SAAS,cAAc,SAASE,aAAY,MAAM;AAChG,MAAI;AAAA,IACF,WAAAC;AAAA,IACA,SAAAC;AAAA,IACA,aAAAC;AAAA,IACA,UAAAC;AAAA,EACF,IAAI;AAIJ,MAAIC,SAAQ,cAAc;AAK1B,EAAAA,OAAM,MAAM;AACZ,EAAAA,OAAM,SAAS;AAAA,IAAC;AAAA,MACd,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA;AAAA,MACE,MAAM;AAAA,MACN,MAAM,OAAK,YAAY,6xgBAA6xgB,KAAK,CAAC;AAAA,IAC5zgB;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IAAG;AAAA,MACD,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA;AAAA,EACA,CAAC;AACD,EAAAA,OAAM,eAAe,CAAC;AAAA,IACpB,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,CAACJ,YAAW;AACd,yBAAiB,CAAC;AAAA,MACpB;AAGA,UAAI,OAAO,CAAC,IAAI,IAAI;AAClB,cAAM,IAAI,UAAU,yFAA8F,IAAI,uDAA4D;AAAA,MACpL;AACA,aAAO,IAAIA,WAAU,CAAC;AAAA,IACxB;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,CAACC,UAAS;AACZ,uBAAe,CAAC;AAAA,MAClB;AACA,aAAO,IAAIA,SAAQ,GAAG,CAAC;AAAA,IACzB;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,CAACA,UAAS;AACZ,uBAAe,CAAC;AAAA,MAClB;AACA,aAAO,IAAIA,SAAQ,EAAE,SAAS,GAAG,CAAC;AAAA,IACpC;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,IAAI,OAAO,kBAAkB;AAC/B,cAAM,IAAI,UAAU,kGAAuG,IAAI,GAAG;AAAA,MACpI;AACA,aAAO,OAAO,CAAC;AAAA,IACjB;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,CAACD,YAAW;AACd,yBAAiB,CAAC;AAAA,MACpB;AACA,aAAO,IAAIA,WAAU,EAAE,SAAS,CAAC;AAAA,IACnC;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,CAACG,WAAU;AACb,wBAAgB,CAAC;AAAA,MACnB;AACA,aAAO,IAAIA,UAAS,CAAC;AAAA,IACvB;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAM,IAAI,UAAU,2JAAgK;AAAA,IACtL;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,CAACF,UAAS;AACZ,uBAAe,CAAC;AAAA,MAClB;AACA,aAAO,IAAIA,SAAQ,EAAE,QAAQ,GAAG,CAAC;AAAA,IACnC;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,CAACE,WAAU;AACb,wBAAgB,CAAC;AAAA,MACnB;AACA,UAAI,IAAI,IAAIA,UAAS,CAAC;AACtB,UAAI,EAAE,QAAQ,MAAM,GAAG;AACrB,cAAM,IAAI,UAAU,qGAA0G,IAAI,qDAA0D;AAAA,MAC9L;AACA,aAAO;AAAA,IACT;AAAA,EACF,GAAG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,IAAI,OAAO,CAAC;AAChB,UAAI,MAAM,CAAC,GAAG;AACZ,cAAM,IAAI,MAAM,qBAAqB,IAAI,eAAe;AAAA,MAC1D;AACA,aAAO;AAAA,IACT;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,CAACH,YAAW;AACd,yBAAiB,CAAC;AAAA,MACpB;AACA,UAAI;AACF,eAAO,IAAIA,WAAU,CAAC;AAAA,MACxB,SAAS,KAAK;AACZ,cAAM,IAAI,MAAM,qBAAqB,IAAI,gBAAgB;AAAA,MAC3D;AAAA,IACF;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI;AACF,eAAO,OAAO,CAAC;AAAA,MACjB,SAAS,KAAK;AACZ,cAAM,IAAI,MAAM,qBAAqB,IAAI,aAAa;AAAA,MACxD;AAAA,IACF;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,CAACG,WAAU;AACb,wBAAgB,CAAC;AAAA,MACnB;AACA,UAAI;AACF,eAAO,IAAIA,UAAS,CAAC;AAAA,MACvB,SAAS,KAAK;AACZ,cAAM,IAAI,MAAM,qBAAqB,IAAI,eAAe;AAAA,MAC1D;AAAA,IACF;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,CAACF,UAAS;AACZ,uBAAe,CAAC;AAAA,MAClB;AACA,UAAI;AACF,eAAO,IAAIA,SAAQ,CAAC;AAAA,MACtB,SAAS,KAAK;AACZ,cAAM,IAAI,MAAM,qBAAqB,IAAI,cAAc;AAAA,MACzD;AAAA,IACF;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,aAAO,CAAC;AAAA,IACV;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,CAACD,YAAW;AACd,yBAAiB,CAAC;AAAA,MACpB;AACA,aAAO,IAAIA,WAAU,CAAC,CAAC;AAAA,IACzB;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,aAAO,OAAO,CAAC,CAAC;AAAA,IAClB;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAI,CAACG,WAAU;AACb,wBAAgB,CAAC;AAAA,MACnB;AACA,aAAO,IAAIA,UAAS,CAAC,CAAC;AAAA,IACxB;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,aAAO,OAAO,CAAC;AAAA,IACjB;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQ,OAAO;AAC/B,UAAI,CAACD,cAAa;AAChB,sBAAc;AAAA,MAChB;AACA,aAAO,IAAIA,aAAY,KAAK;AAAA,IAC9B;AAAA,EACF,GAAG;AAAA,IACD,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,SAAS,SAAS,QAAQG,SAAQ;AAChC,aAAOA,QAAO,QAAQ;AAAA,IACxB;AAAA,EACF,CAAC,CAAC;AAMF,EAAAD,OAAM,aAAa,CAACE,QAAM,MAAM,eAAe;AAC7C,QAAI,aAAaF,OAAM,YAAYE,QAAM,MAAM,UAAU;AACzD,QAAI,CAAC,aAAa,UAAU,EAAE,SAAS,WAAW,KAAK,QAAQ,KAAK,KAAK,WAAW,KAAK,aAAa,KAAK,CAAC,CAAC;AAAA,IAE7G,WAAW,KAAK,SAAO,CAAC,IAAI,OAAO,SAAS,GAAG,CAAC,GAAG;AACjD,UAAI,MAAM,IAAI,UAAU,aAAa,OAAOA,QAAM,0CAA0C,IAAI,4CAA4C,OAAOA,QAAM,KAAK,CAAC;AAC/J,UAAI,OAAO,WAAW;AACtB,YAAM;AAAA,IACR;AACA,UAAM;AAAA,EACR;AAMA,EAAAF,OAAM,aAAa,CAACE,QAAM,MAAM,eAAe;AAC7C,QAAI,aAAaF,OAAM,YAAYE,QAAM,MAAM,UAAU;AACzD,QAAI,CAAC,aAAa,UAAU,EAAE,SAAS,WAAW,KAAK,QAAQ,KAAK,KAAK,WAAW,KAAK,aAAa,KAAK,CAAC,CAAC;AAAA,IAE7G,WAAW,KAAK,SAAO,CAAC,IAAI,OAAO,SAAS,GAAG,CAAC,GAAG;AACjD,UAAI,MAAM,IAAI,UAAU,aAAa,OAAOA,QAAM,0CAA0C,IAAI,4CAA4C,OAAOA,QAAM,KAAK,CAAC;AAC/J,UAAI,OAAO,WAAW;AACtB,YAAM;AAAA,IACR;AACA,UAAM;AAAA,EACR;AACA,SAAOF;AACT,CAAC;AACD,SAAS,iBAAiB,GAAG;AAC3B,QAAM,IAAI,MAAM,wBAAwB,OAAO,GAAG,kDAAkD,CAAC;AACvG;AACA,SAAS,eAAe,GAAG;AACzB,QAAM,IAAI,MAAM,wBAAwB,OAAO,GAAG,qDAAqD,CAAC;AAC1G;AACA,SAAS,gBAAgB;AACvB,QAAM,IAAI,MAAM,qEAAuE;AACzF;AACA,SAAS,gBAAgB,GAAG;AAC1B,QAAM,IAAI,MAAM,wBAAwB,OAAO,GAAG,iDAAiD,CAAC;AACtG;;;ACxbA,IAAI,YAAY;AAAhB,IAIE,aAAa;AAJf,IAOE,WAAW;AAPb,IAUE,OAAO;AAVT,IAaE,KAAK;AAbP,IAiBE,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA,EAOT,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBX,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeV,QAAQ;AAAA;AAAA;AAAA;AAAA,EAIR,UAAU;AAAA;AAAA;AAAA;AAAA,EAIV,UAAW;AAAA;AAAA;AAAA;AAAA,EAIX,MAAM,CAAC;AAAA;AAAA;AAAA;AAAA,EAIP,MAAM;AAAA;AAAA;AAAA,EAGN,QAAQ;AAAA;AACV;AA5EF,IAkFE;AAlFF,IAkFW;AAlFX,IAmFE,WAAW;AAnFb,IAqFE,eAAe;AArFjB,IAsFE,kBAAkB,eAAe;AAtFnC,IAuFE,yBAAyB,eAAe;AAvF1C,IAwFE,oBAAoB,eAAe;AAxFrC,IAyFE,MAAM;AAzFR,IA2FE,YAAY,KAAK;AA3FnB,IA4FE,UAAU,KAAK;AA5FjB,IA8FE,WAAW;AA9Fb,IA+FE,QAAQ;AA/FV,IAgGE,UAAU;AAhGZ,IAiGE,YAAY;AAjGd,IAmGE,OAAO;AAnGT,IAoGE,WAAW;AApGb,IAqGE,mBAAmB;AArGrB,IAuGE,iBAAiB,KAAK,SAAS;AAvGjC,IAwGE,eAAe,GAAG,SAAS;AAxG7B,IA2GE,IAAI,EAAE,aAAa,IAAI;AA0EzB,EAAE,gBAAgB,EAAE,MAAM,WAAY;AACpC,MAAI,IAAI,IAAI,KAAK,YAAY,IAAI;AACjC,MAAI,EAAE,IAAI,EAAG,GAAE,IAAI;AACnB,SAAO,SAAS,CAAC;AACnB;AAQA,EAAE,OAAO,WAAY;AACnB,SAAO,SAAS,IAAI,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC;AAC3D;AAWA,EAAE,YAAY,EAAE,QAAQ,SAAUG,MAAKC,MAAK;AAC1C,MAAI,GACF,IAAI,MACJ,OAAO,EAAE;AACX,EAAAD,OAAM,IAAI,KAAKA,IAAG;AAClB,EAAAC,OAAM,IAAI,KAAKA,IAAG;AAClB,MAAI,CAACD,KAAI,KAAK,CAACC,KAAI,EAAG,QAAO,IAAI,KAAK,GAAG;AACzC,MAAID,KAAI,GAAGC,IAAG,EAAG,OAAM,MAAM,kBAAkBA,IAAG;AAClD,MAAI,EAAE,IAAID,IAAG;AACb,SAAO,IAAI,IAAIA,OAAM,EAAE,IAAIC,IAAG,IAAI,IAAIA,OAAM,IAAI,KAAK,CAAC;AACxD;AAWA,EAAE,aAAa,EAAE,MAAM,SAAU,GAAG;AAClC,MAAI,GAAG,GAAG,KAAK,KACb,IAAI,MACJ,KAAK,EAAE,GACP,MAAM,IAAI,IAAI,EAAE,YAAY,CAAC,GAAG,GAChC,KAAK,EAAE,GACP,KAAK,EAAE;AAGT,MAAI,CAAC,MAAM,CAAC,IAAI;AACd,WAAO,CAAC,MAAM,CAAC,KAAK,MAAM,OAAO,KAAK,KAAK,OAAO,KAAK,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI;AAAA,EAChF;AAGA,MAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAG,QAAO,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK;AAGxD,MAAI,OAAO,GAAI,QAAO;AAGtB,MAAI,EAAE,MAAM,EAAE,EAAG,QAAO,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,IAAI;AAEjD,QAAM,GAAG;AACT,QAAM,GAAG;AAGT,OAAK,IAAI,GAAG,IAAI,MAAM,MAAM,MAAM,KAAK,IAAI,GAAG,EAAE,GAAG;AACjD,QAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAG,QAAO,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI;AAAA,EAC3D;AAGA,SAAO,QAAQ,MAAM,IAAI,MAAM,MAAM,KAAK,IAAI,IAAI;AACpD;AAgBA,EAAE,SAAS,EAAE,MAAM,WAAY;AAC7B,MAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,CAAC,EAAE,EAAG,QAAO,IAAI,KAAK,GAAG;AAG7B,MAAI,CAAC,EAAE,EAAE,CAAC,EAAG,QAAO,IAAI,KAAK,CAAC;AAE9B,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,YAAY,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI;AAC9C,OAAK,WAAW;AAEhB,MAAI,OAAO,MAAM,iBAAiB,MAAM,CAAC,CAAC;AAE1C,OAAK,YAAY;AACjB,OAAK,WAAW;AAEhB,SAAO,SAAS,YAAY,KAAK,YAAY,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI;AAC5E;AAmBA,EAAE,WAAW,EAAE,OAAO,WAAY;AAChC,MAAI,GAAG,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,SACjC,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,CAAC,EAAE,SAAS,KAAK,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAClD,aAAW;AAGX,MAAI,EAAE,IAAI,QAAQ,EAAE,IAAI,GAAG,IAAI,CAAC;AAIhC,MAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,GAAG;AAC9B,QAAI,eAAe,EAAE,CAAC;AACtB,QAAI,EAAE;AAGN,QAAI,KAAK,IAAI,EAAE,SAAS,KAAK,EAAG,MAAM,KAAK,KAAK,KAAK,KAAK,MAAM;AAChE,QAAI,QAAQ,GAAG,IAAI,CAAC;AAGpB,QAAI,WAAW,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,IAAI,IAAI,KAAK;AAErD,QAAI,KAAK,IAAI,GAAG;AACd,UAAI,OAAO;AAAA,IACb,OAAO;AACL,UAAI,EAAE,cAAc;AACpB,UAAI,EAAE,MAAM,GAAG,EAAE,QAAQ,GAAG,IAAI,CAAC,IAAI;AAAA,IACvC;AAEA,QAAI,IAAI,KAAK,CAAC;AACd,MAAE,IAAI,EAAE;AAAA,EACV,OAAO;AACL,QAAI,IAAI,KAAK,EAAE,SAAS,CAAC;AAAA,EAC3B;AAEA,QAAM,IAAI,KAAK,aAAa;AAI5B,aAAS;AACP,QAAI;AACJ,SAAK,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC;AACvB,cAAU,GAAG,KAAK,CAAC;AACnB,QAAI,OAAO,QAAQ,KAAK,CAAC,EAAE,MAAM,CAAC,GAAG,QAAQ,KAAK,EAAE,GAAG,KAAK,GAAG,CAAC;AAGhE,QAAI,eAAe,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,OAAO,IAAI,eAAe,EAAE,CAAC,GAAG,MAAM,GAAG,EAAE,GAAG;AAC/E,UAAI,EAAE,MAAM,KAAK,GAAG,KAAK,CAAC;AAI1B,UAAI,KAAK,UAAU,CAAC,OAAO,KAAK,QAAQ;AAItC,YAAI,CAAC,KAAK;AACR,mBAAS,GAAG,IAAI,GAAG,CAAC;AAEpB,cAAI,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG;AAC7B,gBAAI;AACJ;AAAA,UACF;AAAA,QACF;AAEA,cAAM;AACN,cAAM;AAAA,MACR,OAAO;AAIL,YAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,KAAK;AAG7C,mBAAS,GAAG,IAAI,GAAG,CAAC;AACpB,cAAI,CAAC,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC;AAAA,QAC/B;AAEA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,aAAW;AAEX,SAAO,SAAS,GAAG,GAAG,KAAK,UAAU,CAAC;AACxC;AAOA,EAAE,gBAAgB,EAAE,KAAK,WAAY;AACnC,MAAI,GACF,IAAI,KAAK,GACT,IAAI;AAEN,MAAI,GAAG;AACL,QAAI,EAAE,SAAS;AACf,SAAK,IAAI,UAAU,KAAK,IAAI,QAAQ,KAAK;AAGzC,QAAI,EAAE,CAAC;AACP,QAAI,EAAG,QAAO,IAAI,MAAM,GAAG,KAAK,GAAI;AACpC,QAAI,IAAI,EAAG,KAAI;AAAA,EACjB;AAEA,SAAO;AACT;AAwBA,EAAE,YAAY,EAAE,MAAM,SAAU,GAAG;AACjC,SAAO,OAAO,MAAM,IAAI,KAAK,YAAY,CAAC,CAAC;AAC7C;AAQA,EAAE,qBAAqB,EAAE,WAAW,SAAU,GAAG;AAC/C,MAAI,IAAI,MACN,OAAO,EAAE;AACX,SAAO,SAAS,OAAO,GAAG,IAAI,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK,WAAW,KAAK,QAAQ;AAChF;AAOA,EAAE,SAAS,EAAE,KAAK,SAAU,GAAG;AAC7B,SAAO,KAAK,IAAI,CAAC,MAAM;AACzB;AAQA,EAAE,QAAQ,WAAY;AACpB,SAAO,SAAS,IAAI,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC;AAC3D;AAQA,EAAE,cAAc,EAAE,KAAK,SAAU,GAAG;AAClC,SAAO,KAAK,IAAI,CAAC,IAAI;AACvB;AAQA,EAAE,uBAAuB,EAAE,MAAM,SAAU,GAAG;AAC5C,MAAI,IAAI,KAAK,IAAI,CAAC;AAClB,SAAO,KAAK,KAAK,MAAM;AACzB;AA4BA,EAAE,mBAAmB,EAAE,OAAO,WAAY;AACxC,MAAI,GAAG,GAAG,IAAI,IAAI,KAChB,IAAI,MACJ,OAAO,EAAE,aACT,MAAM,IAAI,KAAK,CAAC;AAElB,MAAI,CAAC,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,EAAE,IAAI,IAAI,IAAI,GAAG;AACpD,MAAI,EAAE,OAAO,EAAG,QAAO;AAEvB,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,YAAY,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI;AAC9C,OAAK,WAAW;AAChB,QAAM,EAAE,EAAE;AAOV,MAAI,MAAM,IAAI;AACZ,QAAI,KAAK,KAAK,MAAM,CAAC;AACrB,SAAK,IAAI,QAAQ,GAAG,CAAC,GAAG,SAAS;AAAA,EACnC,OAAO;AACL,QAAI;AACJ,QAAI;AAAA,EACN;AAEA,MAAI,aAAa,MAAM,GAAG,EAAE,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,IAAI;AAGvD,MAAI,SACF,IAAI,GACJ,KAAK,IAAI,KAAK,CAAC;AACjB,SAAO,OAAM;AACX,cAAU,EAAE,MAAM,CAAC;AACnB,QAAI,IAAI,MAAM,QAAQ,MAAM,GAAG,MAAM,QAAQ,MAAM,EAAE,CAAC,CAAC,CAAC;AAAA,EAC1D;AAEA,SAAO,SAAS,GAAG,KAAK,YAAY,IAAI,KAAK,WAAW,IAAI,IAAI;AAClE;AAiCA,EAAE,iBAAiB,EAAE,OAAO,WAAY;AACtC,MAAI,GAAG,IAAI,IAAI,KACb,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,CAAC,EAAE,SAAS,KAAK,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAElD,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,YAAY,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI;AAC9C,OAAK,WAAW;AAChB,QAAM,EAAE,EAAE;AAEV,MAAI,MAAM,GAAG;AACX,QAAI,aAAa,MAAM,GAAG,GAAG,GAAG,IAAI;AAAA,EACtC,OAAO;AAWL,QAAI,MAAM,KAAK,KAAK,GAAG;AACvB,QAAI,IAAI,KAAK,KAAK,IAAI;AAEtB,QAAI,EAAE,MAAM,IAAI,QAAQ,GAAG,CAAC,CAAC;AAC7B,QAAI,aAAa,MAAM,GAAG,GAAG,GAAG,IAAI;AAGpC,QAAI,SACF,KAAK,IAAI,KAAK,CAAC,GACf,MAAM,IAAI,KAAK,EAAE,GACjB,MAAM,IAAI,KAAK,EAAE;AACnB,WAAO,OAAM;AACX,gBAAU,EAAE,MAAM,CAAC;AACnB,UAAI,EAAE,MAAM,GAAG,KAAK,QAAQ,MAAM,IAAI,MAAM,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;AAAA,IAClE;AAAA,EACF;AAEA,OAAK,YAAY;AACjB,OAAK,WAAW;AAEhB,SAAO,SAAS,GAAG,IAAI,IAAI,IAAI;AACjC;AAmBA,EAAE,oBAAoB,EAAE,OAAO,WAAY;AACzC,MAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,CAAC,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,EAAE,CAAC;AACtC,MAAI,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAEjC,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,YAAY,KAAK;AACtB,OAAK,WAAW;AAEhB,SAAO,OAAO,EAAE,KAAK,GAAG,EAAE,KAAK,GAAG,KAAK,YAAY,IAAI,KAAK,WAAW,EAAE;AAC3E;AAsBA,EAAE,gBAAgB,EAAE,OAAO,WAAY;AACrC,MAAI,IAAI,MACN,OAAO,EAAE,aACT,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GACjB,KAAK,KAAK,WACV,KAAK,KAAK;AAEZ,MAAI,MAAM,IAAI;AACZ,WAAO,MAAM,IAET,EAAE,MAAM,IAAI,MAAM,MAAM,IAAI,EAAE,IAAI,IAAI,KAAK,CAAC,IAE5C,IAAI,KAAK,GAAG;AAAA,EAClB;AAEA,MAAI,EAAE,OAAO,EAAG,QAAO,MAAM,MAAM,KAAK,GAAG,EAAE,EAAE,MAAM,GAAG;AAIxD,OAAK,YAAY,KAAK;AACtB,OAAK,WAAW;AAGhB,MAAI,IAAI,KAAK,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK;AAEpD,OAAK,YAAY;AACjB,OAAK,WAAW;AAEhB,SAAO,EAAE,MAAM,CAAC;AAClB;AAsBA,EAAE,0BAA0B,EAAE,QAAQ,WAAY;AAChD,MAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,EAAE,IAAI,CAAC,EAAG,QAAO,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,IAAI,GAAG;AAC/C,MAAI,CAAC,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,CAAC;AAEpC,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,YAAY,KAAK,KAAK,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI;AACxD,OAAK,WAAW;AAChB,aAAW;AAEX,MAAI,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC;AAErC,aAAW;AACX,OAAK,YAAY;AACjB,OAAK,WAAW;AAEhB,SAAO,EAAE,GAAG;AACd;AAmBA,EAAE,wBAAwB,EAAE,QAAQ,WAAY;AAC9C,MAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,CAAC,EAAE,SAAS,KAAK,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAElD,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,YAAY,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI;AAC5D,OAAK,WAAW;AAChB,aAAW;AAEX,MAAI,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC;AAEpC,aAAW;AACX,OAAK,YAAY;AACjB,OAAK,WAAW;AAEhB,SAAO,EAAE,GAAG;AACd;AAsBA,EAAE,2BAA2B,EAAE,QAAQ,WAAY;AACjD,MAAI,IAAI,IAAI,KAAK,KACf,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,CAAC,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,GAAG;AACtC,MAAI,EAAE,KAAK,EAAG,QAAO,IAAI,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,IAAI,EAAE,OAAO,IAAI,IAAI,GAAG;AAE5E,OAAK,KAAK;AACV,OAAK,KAAK;AACV,QAAM,EAAE,GAAG;AAEX,MAAI,KAAK,IAAI,KAAK,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,EAAG,QAAO,SAAS,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,IAAI;AAE/E,OAAK,YAAY,MAAM,MAAM,EAAE;AAE/B,MAAI,OAAO,EAAE,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC;AAEvD,OAAK,YAAY,KAAK;AACtB,OAAK,WAAW;AAEhB,MAAI,EAAE,GAAG;AAET,OAAK,YAAY;AACjB,OAAK,WAAW;AAEhB,SAAO,EAAE,MAAM,GAAG;AACpB;AAwBA,EAAE,cAAc,EAAE,OAAO,WAAY;AACnC,MAAI,QAAQ,GACV,IAAI,IACJ,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAEjC,MAAI,EAAE,IAAI,EAAE,IAAI,CAAC;AACjB,OAAK,KAAK;AACV,OAAK,KAAK;AAEV,MAAI,MAAM,IAAI;AAGZ,QAAI,MAAM,GAAG;AACX,eAAS,MAAM,MAAM,KAAK,GAAG,EAAE,EAAE,MAAM,GAAG;AAC1C,aAAO,IAAI,EAAE;AACb,aAAO;AAAA,IACT;AAGA,WAAO,IAAI,KAAK,GAAG;AAAA,EACrB;AAIA,OAAK,YAAY,KAAK;AACtB,OAAK,WAAW;AAEhB,MAAI,EAAE,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK;AAE7D,OAAK,YAAY;AACjB,OAAK,WAAW;AAEhB,SAAO,EAAE,MAAM,CAAC;AAClB;AAqBA,EAAE,iBAAiB,EAAE,OAAO,WAAY;AACtC,MAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,KAAK,IAC7B,IAAI,MACJ,OAAO,EAAE,aACT,KAAK,KAAK,WACV,KAAK,KAAK;AAEZ,MAAI,CAAC,EAAE,SAAS,GAAG;AACjB,QAAI,CAAC,EAAE,EAAG,QAAO,IAAI,KAAK,GAAG;AAC7B,QAAI,KAAK,KAAK,cAAc;AAC1B,UAAI,MAAM,MAAM,KAAK,GAAG,EAAE,EAAE,MAAM,GAAG;AACrC,QAAE,IAAI,EAAE;AACR,aAAO;AAAA,IACT;AAAA,EACF,WAAW,EAAE,OAAO,GAAG;AACrB,WAAO,IAAI,KAAK,CAAC;AAAA,EACnB,WAAW,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,KAAK,KAAK,cAAc;AAClD,QAAI,MAAM,MAAM,KAAK,GAAG,EAAE,EAAE,MAAM,IAAI;AACtC,MAAE,IAAI,EAAE;AACR,WAAO;AAAA,EACT;AAEA,OAAK,YAAY,MAAM,KAAK;AAC5B,OAAK,WAAW;AAQhB,MAAI,KAAK,IAAI,IAAI,MAAM,WAAW,IAAI,CAAC;AAEvC,OAAK,IAAI,GAAG,GAAG,EAAE,EAAG,KAAI,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AAE/D,aAAW;AAEX,MAAI,KAAK,KAAK,MAAM,QAAQ;AAC5B,MAAI;AACJ,OAAK,EAAE,MAAM,CAAC;AACd,MAAI,IAAI,KAAK,CAAC;AACd,OAAK;AAGL,SAAO,MAAM,MAAK;AAChB,SAAK,GAAG,MAAM,EAAE;AAChB,QAAI,EAAE,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC;AAE1B,SAAK,GAAG,MAAM,EAAE;AAChB,QAAI,EAAE,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC;AAEzB,QAAI,EAAE,EAAE,CAAC,MAAM,OAAQ,MAAK,IAAI,GAAG,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,MAAK;AAAA,EAC/D;AAEA,MAAI,EAAG,KAAI,EAAE,MAAM,KAAM,IAAI,CAAE;AAE/B,aAAW;AAEX,SAAO,SAAS,GAAG,KAAK,YAAY,IAAI,KAAK,WAAW,IAAI,IAAI;AAClE;AAOA,EAAE,WAAW,WAAY;AACvB,SAAO,CAAC,CAAC,KAAK;AAChB;AAOA,EAAE,YAAY,EAAE,QAAQ,WAAY;AAClC,SAAO,CAAC,CAAC,KAAK,KAAK,UAAU,KAAK,IAAI,QAAQ,IAAI,KAAK,EAAE,SAAS;AACpE;AAOA,EAAE,QAAQ,WAAY;AACpB,SAAO,CAAC,KAAK;AACf;AAOA,EAAE,aAAa,EAAE,QAAQ,WAAY;AACnC,SAAO,KAAK,IAAI;AAClB;AAOA,EAAE,aAAa,EAAE,QAAQ,WAAY;AACnC,SAAO,KAAK,IAAI;AAClB;AAOA,EAAE,SAAS,WAAY;AACrB,SAAO,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC,MAAM;AACnC;AAOA,EAAE,WAAW,EAAE,KAAK,SAAU,GAAG;AAC/B,SAAO,KAAK,IAAI,CAAC,IAAI;AACvB;AAOA,EAAE,oBAAoB,EAAE,MAAM,SAAU,GAAG;AACzC,SAAO,KAAK,IAAI,CAAC,IAAI;AACvB;AAiCA,EAAE,YAAY,EAAE,MAAM,SAAU,MAAM;AACpC,MAAI,UAAU,GAAG,aAAa,GAAG,KAAK,KAAK,IAAI,GAC7C,MAAM,MACN,OAAO,IAAI,aACX,KAAK,KAAK,WACV,KAAK,KAAK,UACV,QAAQ;AAGV,MAAI,QAAQ,MAAM;AAChB,WAAO,IAAI,KAAK,EAAE;AAClB,eAAW;AAAA,EACb,OAAO;AACL,WAAO,IAAI,KAAK,IAAI;AACpB,QAAI,KAAK;AAGT,QAAI,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,GAAG,CAAC,EAAG,QAAO,IAAI,KAAK,GAAG;AAEhE,eAAW,KAAK,GAAG,EAAE;AAAA,EACvB;AAEA,MAAI,IAAI;AAGR,MAAI,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,IAAI,GAAG,CAAC,GAAG;AACzC,WAAO,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,MAAM,IAAI,IAAI,IAAI,CAAC;AAAA,EACxE;AAIA,MAAI,UAAU;AACZ,QAAI,EAAE,SAAS,GAAG;AAChB,YAAM;AAAA,IACR,OAAO;AACL,WAAK,IAAI,EAAE,CAAC,GAAG,IAAI,OAAO,IAAI,MAAK;AACnC,YAAM,MAAM;AAAA,IACd;AAAA,EACF;AAEA,aAAW;AACX,OAAK,KAAK;AACV,QAAM,iBAAiB,KAAK,EAAE;AAC9B,gBAAc,WAAW,QAAQ,MAAM,KAAK,EAAE,IAAI,iBAAiB,MAAM,EAAE;AAG3E,MAAI,OAAO,KAAK,aAAa,IAAI,CAAC;AAgBlC,MAAI,oBAAoB,EAAE,GAAG,IAAI,IAAI,EAAE,GAAG;AAExC,OAAG;AACD,YAAM;AACN,YAAM,iBAAiB,KAAK,EAAE;AAC9B,oBAAc,WAAW,QAAQ,MAAM,KAAK,EAAE,IAAI,iBAAiB,MAAM,EAAE;AAC3E,UAAI,OAAO,KAAK,aAAa,IAAI,CAAC;AAElC,UAAI,CAAC,KAAK;AAGR,YAAI,CAAC,eAAe,EAAE,CAAC,EAAE,MAAM,IAAI,GAAG,IAAI,EAAE,IAAI,KAAK,MAAM;AACzD,cAAI,SAAS,GAAG,KAAK,GAAG,CAAC;AAAA,QAC3B;AAEA;AAAA,MACF;AAAA,IACF,SAAS,oBAAoB,EAAE,GAAG,KAAK,IAAI,EAAE;AAAA,EAC/C;AAEA,aAAW;AAEX,SAAO,SAAS,GAAG,IAAI,EAAE;AAC3B;AAgDA,EAAE,QAAQ,EAAE,MAAM,SAAU,GAAG;AAC7B,MAAI,GAAG,GAAG,GAAG,GAAG,GAAG,KAAK,IAAI,IAAI,IAAI,IAAI,MAAM,IAC5C,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,IAAI,KAAK,CAAC;AAGd,MAAI,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG;AAGhB,QAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAAG,KAAI,IAAI,KAAK,GAAG;AAAA,aAGzB,EAAE,EAAG,GAAE,IAAI,CAAC,EAAE;AAAA,QAKlB,KAAI,IAAI,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,IAAI,GAAG;AAE9C,WAAO;AAAA,EACT;AAGA,MAAI,EAAE,KAAK,EAAE,GAAG;AACd,MAAE,IAAI,CAAC,EAAE;AACT,WAAO,EAAE,KAAK,CAAC;AAAA,EACjB;AAEA,OAAK,EAAE;AACP,OAAK,EAAE;AACP,OAAK,KAAK;AACV,OAAK,KAAK;AAGV,MAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG;AAGpB,QAAI,GAAG,CAAC,EAAG,GAAE,IAAI,CAAC,EAAE;AAAA,aAGX,GAAG,CAAC,EAAG,KAAI,IAAI,KAAK,CAAC;AAAA,QAIzB,QAAO,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC;AAEtC,WAAO,WAAW,SAAS,GAAG,IAAI,EAAE,IAAI;AAAA,EAC1C;AAKA,MAAI,UAAU,EAAE,IAAI,QAAQ;AAC5B,OAAK,UAAU,EAAE,IAAI,QAAQ;AAE7B,OAAK,GAAG,MAAM;AACd,MAAI,KAAK;AAGT,MAAI,GAAG;AACL,WAAO,IAAI;AAEX,QAAI,MAAM;AACR,UAAI;AACJ,UAAI,CAAC;AACL,YAAM,GAAG;AAAA,IACX,OAAO;AACL,UAAI;AACJ,UAAI;AACJ,YAAM,GAAG;AAAA,IACX;AAKA,QAAI,KAAK,IAAI,KAAK,KAAK,KAAK,QAAQ,GAAG,GAAG,IAAI;AAE9C,QAAI,IAAI,GAAG;AACT,UAAI;AACJ,QAAE,SAAS;AAAA,IACb;AAGA,MAAE,QAAQ;AACV,SAAK,IAAI,GAAG,MAAM,GAAE,KAAK,CAAC;AAC1B,MAAE,QAAQ;AAAA,EAGZ,OAAO;AAIL,QAAI,GAAG;AACP,UAAM,GAAG;AACT,WAAO,IAAI;AACX,QAAI,KAAM,OAAM;AAEhB,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK;AACxB,UAAI,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG;AAClB,eAAO,GAAG,CAAC,IAAI,GAAG,CAAC;AACnB;AAAA,MACF;AAAA,IACF;AAEA,QAAI;AAAA,EACN;AAEA,MAAI,MAAM;AACR,QAAI;AACJ,SAAK;AACL,SAAK;AACL,MAAE,IAAI,CAAC,EAAE;AAAA,EACX;AAEA,QAAM,GAAG;AAIT,OAAK,IAAI,GAAG,SAAS,KAAK,IAAI,GAAG,EAAE,EAAG,IAAG,KAAK,IAAI;AAGlD,OAAK,IAAI,GAAG,QAAQ,IAAI,KAAI;AAE1B,QAAI,GAAG,EAAE,CAAC,IAAI,GAAG,CAAC,GAAG;AACnB,WAAK,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC,MAAM,IAAI,IAAG,CAAC,IAAI,OAAO;AAChD,QAAE,GAAG,CAAC;AACN,SAAG,CAAC,KAAK;AAAA,IACX;AAEA,OAAG,CAAC,KAAK,GAAG,CAAC;AAAA,EACf;AAGA,SAAO,GAAG,EAAE,GAAG,MAAM,IAAI,IAAG,IAAI;AAGhC,SAAO,GAAG,CAAC,MAAM,GAAG,GAAG,MAAM,EAAG,GAAE;AAGlC,MAAI,CAAC,GAAG,CAAC,EAAG,QAAO,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC;AAE7C,IAAE,IAAI;AACN,IAAE,IAAI,kBAAkB,IAAI,CAAC;AAE7B,SAAO,WAAW,SAAS,GAAG,IAAI,EAAE,IAAI;AAC1C;AA2BA,EAAE,SAAS,EAAE,MAAM,SAAU,GAAG;AAC9B,MAAI,GACF,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,IAAI,KAAK,CAAC;AAGd,MAAI,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,EAAG,QAAO,IAAI,KAAK,GAAG;AAGvD,MAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG;AAC1B,WAAO,SAAS,IAAI,KAAK,CAAC,GAAG,KAAK,WAAW,KAAK,QAAQ;AAAA,EAC5D;AAGA,aAAW;AAEX,MAAI,KAAK,UAAU,GAAG;AAIpB,QAAI,OAAO,GAAG,EAAE,IAAI,GAAG,GAAG,GAAG,CAAC;AAC9B,MAAE,KAAK,EAAE;AAAA,EACX,OAAO;AACL,QAAI,OAAO,GAAG,GAAG,GAAG,KAAK,QAAQ,CAAC;AAAA,EACpC;AAEA,MAAI,EAAE,MAAM,CAAC;AAEb,aAAW;AAEX,SAAO,EAAE,MAAM,CAAC;AAClB;AASA,EAAE,qBAAqB,EAAE,MAAM,WAAY;AACzC,SAAO,mBAAmB,IAAI;AAChC;AAQA,EAAE,mBAAmB,EAAE,KAAK,WAAY;AACtC,SAAO,iBAAiB,IAAI;AAC9B;AAQA,EAAE,UAAU,EAAE,MAAM,WAAY;AAC9B,MAAI,IAAI,IAAI,KAAK,YAAY,IAAI;AACjC,IAAE,IAAI,CAAC,EAAE;AACT,SAAO,SAAS,CAAC;AACnB;AAwBA,EAAE,OAAO,EAAE,MAAM,SAAU,GAAG;AAC5B,MAAI,OAAO,GAAG,GAAG,GAAG,GAAG,KAAK,IAAI,IAAI,IAAI,IACtC,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,IAAI,KAAK,CAAC;AAGd,MAAI,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG;AAGhB,QAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAAG,KAAI,IAAI,KAAK,GAAG;AAAA,aAMzB,CAAC,EAAE,EAAG,KAAI,IAAI,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,IAAI,GAAG;AAExD,WAAO;AAAA,EACT;AAGA,MAAI,EAAE,KAAK,EAAE,GAAG;AACd,MAAE,IAAI,CAAC,EAAE;AACT,WAAO,EAAE,MAAM,CAAC;AAAA,EAClB;AAEA,OAAK,EAAE;AACP,OAAK,EAAE;AACP,OAAK,KAAK;AACV,OAAK,KAAK;AAGV,MAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG;AAIpB,QAAI,CAAC,GAAG,CAAC,EAAG,KAAI,IAAI,KAAK,CAAC;AAE1B,WAAO,WAAW,SAAS,GAAG,IAAI,EAAE,IAAI;AAAA,EAC1C;AAKA,MAAI,UAAU,EAAE,IAAI,QAAQ;AAC5B,MAAI,UAAU,EAAE,IAAI,QAAQ;AAE5B,OAAK,GAAG,MAAM;AACd,MAAI,IAAI;AAGR,MAAI,GAAG;AAEL,QAAI,IAAI,GAAG;AACT,UAAI;AACJ,UAAI,CAAC;AACL,YAAM,GAAG;AAAA,IACX,OAAO;AACL,UAAI;AACJ,UAAI;AACJ,YAAM,GAAG;AAAA,IACX;AAGA,QAAI,KAAK,KAAK,KAAK,QAAQ;AAC3B,UAAM,IAAI,MAAM,IAAI,IAAI,MAAM;AAE9B,QAAI,IAAI,KAAK;AACX,UAAI;AACJ,QAAE,SAAS;AAAA,IACb;AAGA,MAAE,QAAQ;AACV,WAAO,MAAM,GAAE,KAAK,CAAC;AACrB,MAAE,QAAQ;AAAA,EACZ;AAEA,QAAM,GAAG;AACT,MAAI,GAAG;AAGP,MAAI,MAAM,IAAI,GAAG;AACf,QAAI;AACJ,QAAI;AACJ,SAAK;AACL,SAAK;AAAA,EACP;AAGA,OAAK,QAAQ,GAAG,KAAI;AAClB,aAAS,GAAG,EAAE,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,SAAS,OAAO;AACnD,OAAG,CAAC,KAAK;AAAA,EACX;AAEA,MAAI,OAAO;AACT,OAAG,QAAQ,KAAK;AAChB,MAAE;AAAA,EACJ;AAIA,OAAK,MAAM,GAAG,QAAQ,GAAG,EAAE,GAAG,KAAK,IAAI,IAAG,IAAI;AAE9C,IAAE,IAAI;AACN,IAAE,IAAI,kBAAkB,IAAI,CAAC;AAE7B,SAAO,WAAW,SAAS,GAAG,IAAI,EAAE,IAAI;AAC1C;AASA,EAAE,YAAY,EAAE,KAAK,SAAU,GAAG;AAChC,MAAI,GACF,IAAI;AAEN,MAAI,MAAM,UAAU,MAAM,CAAC,CAAC,KAAK,MAAM,KAAK,MAAM,EAAG,OAAM,MAAM,kBAAkB,CAAC;AAEpF,MAAI,EAAE,GAAG;AACP,QAAI,aAAa,EAAE,CAAC;AACpB,QAAI,KAAK,EAAE,IAAI,IAAI,EAAG,KAAI,EAAE,IAAI;AAAA,EAClC,OAAO;AACL,QAAI;AAAA,EACN;AAEA,SAAO;AACT;AAQA,EAAE,QAAQ,WAAY;AACpB,MAAI,IAAI,MACN,OAAO,EAAE;AAEX,SAAO,SAAS,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,KAAK,QAAQ;AACrD;AAkBA,EAAE,OAAO,EAAE,MAAM,WAAY;AAC3B,MAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,CAAC,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,GAAG;AACtC,MAAI,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAEjC,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,YAAY,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI;AAC9C,OAAK,WAAW;AAEhB,MAAI,KAAK,MAAM,iBAAiB,MAAM,CAAC,CAAC;AAExC,OAAK,YAAY;AACjB,OAAK,WAAW;AAEhB,SAAO,SAAS,WAAW,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI;AAC1D;AAeA,EAAE,aAAa,EAAE,OAAO,WAAY;AAClC,MAAI,GAAG,GAAG,IAAI,GAAG,KAAK,GACpB,IAAI,MACJ,IAAI,EAAE,GACN,IAAI,EAAE,GACN,IAAI,EAAE,GACN,OAAO,EAAE;AAGX,MAAI,MAAM,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG;AAC1B,WAAO,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC;AAAA,EACnE;AAEA,aAAW;AAGX,MAAI,KAAK,KAAK,CAAC,CAAC;AAIhB,MAAI,KAAK,KAAK,KAAK,IAAI,GAAG;AACxB,QAAI,eAAe,CAAC;AAEpB,SAAK,EAAE,SAAS,KAAK,KAAK,EAAG,MAAK;AAClC,QAAI,KAAK,KAAK,CAAC;AACf,QAAI,WAAW,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,IAAI;AAE3C,QAAI,KAAK,IAAI,GAAG;AACd,UAAI,OAAO;AAAA,IACb,OAAO;AACL,UAAI,EAAE,cAAc;AACpB,UAAI,EAAE,MAAM,GAAG,EAAE,QAAQ,GAAG,IAAI,CAAC,IAAI;AAAA,IACvC;AAEA,QAAI,IAAI,KAAK,CAAC;AAAA,EAChB,OAAO;AACL,QAAI,IAAI,KAAK,EAAE,SAAS,CAAC;AAAA,EAC3B;AAEA,QAAM,IAAI,KAAK,aAAa;AAG5B,aAAS;AACP,QAAI;AACJ,QAAI,EAAE,KAAK,OAAO,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG;AAG7C,QAAI,eAAe,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,OAAO,IAAI,eAAe,EAAE,CAAC,GAAG,MAAM,GAAG,EAAE,GAAG;AAC/E,UAAI,EAAE,MAAM,KAAK,GAAG,KAAK,CAAC;AAI1B,UAAI,KAAK,UAAU,CAAC,OAAO,KAAK,QAAQ;AAItC,YAAI,CAAC,KAAK;AACR,mBAAS,GAAG,IAAI,GAAG,CAAC;AAEpB,cAAI,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG;AACpB,gBAAI;AACJ;AAAA,UACF;AAAA,QACF;AAEA,cAAM;AACN,cAAM;AAAA,MACR,OAAO;AAIL,YAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,KAAK;AAG7C,mBAAS,GAAG,IAAI,GAAG,CAAC;AACpB,cAAI,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC;AAAA,QACtB;AAEA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,aAAW;AAEX,SAAO,SAAS,GAAG,GAAG,KAAK,UAAU,CAAC;AACxC;AAgBA,EAAE,UAAU,EAAE,MAAM,WAAY;AAC9B,MAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,CAAC,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,GAAG;AACtC,MAAI,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAEjC,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,YAAY,KAAK;AACtB,OAAK,WAAW;AAEhB,MAAI,EAAE,IAAI;AACV,IAAE,IAAI;AACN,MAAI,OAAO,GAAG,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK,IAAI,CAAC;AAE9D,OAAK,YAAY;AACjB,OAAK,WAAW;AAEhB,SAAO,SAAS,YAAY,KAAK,YAAY,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI;AAC5E;AAwBA,EAAE,QAAQ,EAAE,MAAM,SAAU,GAAG;AAC7B,MAAI,OAAO,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,KAAK,KACjC,IAAI,MACJ,OAAO,EAAE,aACT,KAAK,EAAE,GACP,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG;AAEzB,IAAE,KAAK,EAAE;AAGT,MAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;AAElC,WAAO,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAI5D,MAIA,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,IAAI,EAAE,IAAI,CAAC;AAAA,EACpC;AAEA,MAAI,UAAU,EAAE,IAAI,QAAQ,IAAI,UAAU,EAAE,IAAI,QAAQ;AACxD,QAAM,GAAG;AACT,QAAM,GAAG;AAGT,MAAI,MAAM,KAAK;AACb,QAAI;AACJ,SAAK;AACL,SAAK;AACL,SAAK;AACL,UAAM;AACN,UAAM;AAAA,EACR;AAGA,MAAI,CAAC;AACL,OAAK,MAAM;AACX,OAAK,IAAI,IAAI,MAAM,GAAE,KAAK,CAAC;AAG3B,OAAK,IAAI,KAAK,EAAE,KAAK,KAAI;AACvB,YAAQ;AACR,SAAK,IAAI,MAAM,GAAG,IAAI,KAAI;AACxB,UAAI,EAAE,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI;AACnC,QAAE,GAAG,IAAI,IAAI,OAAO;AACpB,cAAQ,IAAI,OAAO;AAAA,IACrB;AAEA,MAAE,CAAC,KAAK,EAAE,CAAC,IAAI,SAAS,OAAO;AAAA,EACjC;AAGA,SAAO,CAAC,EAAE,EAAE,EAAE,IAAI,GAAE,IAAI;AAExB,MAAI,MAAO,GAAE;AAAA,MACR,GAAE,MAAM;AAEb,IAAE,IAAI;AACN,IAAE,IAAI,kBAAkB,GAAG,CAAC;AAE5B,SAAO,WAAW,SAAS,GAAG,KAAK,WAAW,KAAK,QAAQ,IAAI;AACjE;AAaA,EAAE,WAAW,SAAU,IAAI,IAAI;AAC7B,SAAO,eAAe,MAAM,GAAG,IAAI,EAAE;AACvC;AAaA,EAAE,kBAAkB,EAAE,OAAO,SAAU,IAAI,IAAI;AAC7C,MAAI,IAAI,MACN,OAAO,EAAE;AAEX,MAAI,IAAI,KAAK,CAAC;AACd,MAAI,OAAO,OAAQ,QAAO;AAE1B,aAAW,IAAI,GAAG,UAAU;AAE5B,MAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,MACxB,YAAW,IAAI,GAAG,CAAC;AAExB,SAAO,SAAS,GAAG,KAAK,EAAE,IAAI,GAAG,EAAE;AACrC;AAWA,EAAE,gBAAgB,SAAU,IAAI,IAAI;AAClC,MAAI,KACF,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,OAAO,QAAQ;AACjB,UAAM,eAAe,GAAG,IAAI;AAAA,EAC9B,OAAO;AACL,eAAW,IAAI,GAAG,UAAU;AAE5B,QAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,QACxB,YAAW,IAAI,GAAG,CAAC;AAExB,QAAI,SAAS,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE;AACpC,UAAM,eAAe,GAAG,MAAM,KAAK,CAAC;AAAA,EACtC;AAEA,SAAO,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,IAAI,MAAM,MAAM;AAChD;AAmBA,EAAE,UAAU,SAAU,IAAI,IAAI;AAC5B,MAAI,KAAK,GACP,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,OAAO,QAAQ;AACjB,UAAM,eAAe,CAAC;AAAA,EACxB,OAAO;AACL,eAAW,IAAI,GAAG,UAAU;AAE5B,QAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,QACxB,YAAW,IAAI,GAAG,CAAC;AAExB,QAAI,SAAS,IAAI,KAAK,CAAC,GAAG,KAAK,EAAE,IAAI,GAAG,EAAE;AAC1C,UAAM,eAAe,GAAG,OAAO,KAAK,EAAE,IAAI,CAAC;AAAA,EAC7C;AAIA,SAAO,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,IAAI,MAAM,MAAM;AAChD;AAcA,EAAE,aAAa,SAAU,MAAM;AAC7B,MAAI,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,IAAIC,KAAI,IAAI,GAAG,GACzC,IAAI,MACJ,KAAK,EAAE,GACP,OAAO,EAAE;AAEX,MAAI,CAAC,GAAI,QAAO,IAAI,KAAK,CAAC;AAE1B,EAAAA,MAAK,KAAK,IAAI,KAAK,CAAC;AACpB,OAAK,KAAK,IAAI,KAAK,CAAC;AAEpB,MAAI,IAAI,KAAK,EAAE;AACf,MAAI,EAAE,IAAI,aAAa,EAAE,IAAI,EAAE,IAAI;AACnC,MAAI,IAAI;AACR,IAAE,EAAE,CAAC,IAAI,QAAQ,IAAI,IAAI,IAAI,WAAW,IAAI,CAAC;AAE7C,MAAI,QAAQ,MAAM;AAGhB,WAAO,IAAI,IAAI,IAAIA;AAAA,EACrB,OAAO;AACL,QAAI,IAAI,KAAK,IAAI;AACjB,QAAI,CAAC,EAAE,MAAM,KAAK,EAAE,GAAGA,GAAE,EAAG,OAAM,MAAM,kBAAkB,CAAC;AAC3D,WAAO,EAAE,GAAG,CAAC,IAAK,IAAI,IAAI,IAAIA,MAAM;AAAA,EACtC;AAEA,aAAW;AACX,MAAI,IAAI,KAAK,eAAe,EAAE,CAAC;AAC/B,OAAK,KAAK;AACV,OAAK,YAAY,IAAI,GAAG,SAAS,WAAW;AAE5C,aAAU;AACR,QAAI,OAAO,GAAG,GAAG,GAAG,GAAG,CAAC;AACxB,SAAK,GAAG,KAAK,EAAE,MAAM,EAAE,CAAC;AACxB,QAAI,GAAG,IAAI,IAAI,KAAK,EAAG;AACvB,SAAK;AACL,SAAK;AACL,SAAKA;AACL,IAAAA,MAAK,GAAG,KAAK,EAAE,MAAM,EAAE,CAAC;AACxB,SAAK;AACL,SAAK;AACL,QAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AACvB,QAAI;AAAA,EACN;AAEA,OAAK,OAAO,KAAK,MAAM,EAAE,GAAG,IAAI,GAAG,GAAG,CAAC;AACvC,OAAK,GAAG,KAAK,GAAG,MAAMA,GAAE,CAAC;AACzB,OAAK,GAAG,KAAK,GAAG,MAAM,EAAE,CAAC;AACzB,KAAG,IAAIA,IAAG,IAAI,EAAE;AAGhB,MAAI,OAAOA,KAAI,IAAI,GAAG,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,EAAE,IAAI,OAAO,IAAI,IAAI,GAAG,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,IAC7E,CAACA,KAAI,EAAE,IAAI,CAAC,IAAI,EAAE;AAExB,OAAK,YAAY;AACjB,aAAW;AAEX,SAAO;AACT;AAaA,EAAE,gBAAgB,EAAE,QAAQ,SAAU,IAAI,IAAI;AAC5C,SAAO,eAAe,MAAM,IAAI,IAAI,EAAE;AACxC;AAmBA,EAAE,YAAY,SAAU,GAAG,IAAI;AAC7B,MAAI,IAAI,MACN,OAAO,EAAE;AAEX,MAAI,IAAI,KAAK,CAAC;AAEd,MAAI,KAAK,MAAM;AAGb,QAAI,CAAC,EAAE,EAAG,QAAO;AAEjB,QAAI,IAAI,KAAK,CAAC;AACd,SAAK,KAAK;AAAA,EACZ,OAAO;AACL,QAAI,IAAI,KAAK,CAAC;AACd,QAAI,OAAO,QAAQ;AACjB,WAAK,KAAK;AAAA,IACZ,OAAO;AACL,iBAAW,IAAI,GAAG,CAAC;AAAA,IACrB;AAGA,QAAI,CAAC,EAAE,EAAG,QAAO,EAAE,IAAI,IAAI;AAG3B,QAAI,CAAC,EAAE,GAAG;AACR,UAAI,EAAE,EAAG,GAAE,IAAI,EAAE;AACjB,aAAO;AAAA,IACT;AAAA,EACF;AAGA,MAAI,EAAE,EAAE,CAAC,GAAG;AACV,eAAW;AACX,QAAI,OAAO,GAAG,GAAG,GAAG,IAAI,CAAC,EAAE,MAAM,CAAC;AAClC,eAAW;AACX,aAAS,CAAC;AAAA,EAGZ,OAAO;AACL,MAAE,IAAI,EAAE;AACR,QAAI;AAAA,EACN;AAEA,SAAO;AACT;AAQA,EAAE,WAAW,WAAY;AACvB,SAAO,CAAC;AACV;AAaA,EAAE,UAAU,SAAU,IAAI,IAAI;AAC5B,SAAO,eAAe,MAAM,GAAG,IAAI,EAAE;AACvC;AA8CA,EAAE,UAAU,EAAE,MAAM,SAAU,GAAG;AAC/B,MAAI,GAAG,GAAG,IAAI,GAAG,IAAI,GACnB,IAAI,MACJ,OAAO,EAAE,aACT,KAAK,EAAE,IAAI,IAAI,KAAK,CAAC;AAGvB,MAAI,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAG,QAAO,IAAI,KAAK,QAAQ,CAAC,GAAG,EAAE,CAAC;AAEvE,MAAI,IAAI,KAAK,CAAC;AAEd,MAAI,EAAE,GAAG,CAAC,EAAG,QAAO;AAEpB,OAAK,KAAK;AACV,OAAK,KAAK;AAEV,MAAI,EAAE,GAAG,CAAC,EAAG,QAAO,SAAS,GAAG,IAAI,EAAE;AAGtC,MAAI,UAAU,EAAE,IAAI,QAAQ;AAG5B,MAAI,KAAK,EAAE,EAAE,SAAS,MAAM,IAAI,KAAK,IAAI,CAAC,KAAK,OAAO,kBAAkB;AACtE,QAAI,OAAO,MAAM,GAAG,GAAG,EAAE;AACzB,WAAO,EAAE,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,EAAE;AAAA,EAC1D;AAEA,MAAI,EAAE;AAGN,MAAI,IAAI,GAAG;AAGT,QAAI,IAAI,EAAE,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,GAAG;AAG3C,SAAK,EAAE,EAAE,CAAC,IAAI,MAAM,EAAG,KAAI;AAG3B,QAAI,EAAE,KAAK,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,EAAE,EAAE,UAAU,GAAG;AAC9C,QAAE,IAAI;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAMA,MAAI,QAAQ,CAAC,GAAG,EAAE;AAClB,MAAI,KAAK,KAAK,CAAC,SAAS,CAAC,IACrB,UAAU,MAAM,KAAK,IAAI,OAAO,eAAe,EAAE,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,IAAI,EAAE,IAC3E,IAAI,KAAK,IAAI,EAAE,EAAE;AAKrB,MAAI,IAAI,KAAK,OAAO,KAAK,IAAI,KAAK,OAAO,EAAG,QAAO,IAAI,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC;AAE7E,aAAW;AACX,OAAK,WAAW,EAAE,IAAI;AAMtB,MAAI,KAAK,IAAI,KAAK,IAAI,IAAI,MAAM;AAGhC,MAAI,mBAAmB,EAAE,MAAM,iBAAiB,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE;AAG/D,MAAI,EAAE,GAAG;AAGP,QAAI,SAAS,GAAG,KAAK,GAAG,CAAC;AAIzB,QAAI,oBAAoB,EAAE,GAAG,IAAI,EAAE,GAAG;AACpC,UAAI,KAAK;AAGT,UAAI,SAAS,mBAAmB,EAAE,MAAM,iBAAiB,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AAGjF,UAAI,CAAC,eAAe,EAAE,CAAC,EAAE,MAAM,KAAK,GAAG,KAAK,EAAE,IAAI,KAAK,MAAM;AAC3D,YAAI,SAAS,GAAG,KAAK,GAAG,CAAC;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AAEA,IAAE,IAAI;AACN,aAAW;AACX,OAAK,WAAW;AAEhB,SAAO,SAAS,GAAG,IAAI,EAAE;AAC3B;AAcA,EAAE,cAAc,SAAU,IAAI,IAAI;AAChC,MAAI,KACF,IAAI,MACJ,OAAO,EAAE;AAEX,MAAI,OAAO,QAAQ;AACjB,UAAM,eAAe,GAAG,EAAE,KAAK,KAAK,YAAY,EAAE,KAAK,KAAK,QAAQ;AAAA,EACtE,OAAO;AACL,eAAW,IAAI,GAAG,UAAU;AAE5B,QAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,QACxB,YAAW,IAAI,GAAG,CAAC;AAExB,QAAI,SAAS,IAAI,KAAK,CAAC,GAAG,IAAI,EAAE;AAChC,UAAM,eAAe,GAAG,MAAM,EAAE,KAAK,EAAE,KAAK,KAAK,UAAU,EAAE;AAAA,EAC/D;AAEA,SAAO,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,IAAI,MAAM,MAAM;AAChD;AAiBA,EAAE,sBAAsB,EAAE,OAAO,SAAU,IAAI,IAAI;AACjD,MAAI,IAAI,MACN,OAAO,EAAE;AAEX,MAAI,OAAO,QAAQ;AACjB,SAAK,KAAK;AACV,SAAK,KAAK;AAAA,EACZ,OAAO;AACL,eAAW,IAAI,GAAG,UAAU;AAE5B,QAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,QACxB,YAAW,IAAI,GAAG,CAAC;AAAA,EAC1B;AAEA,SAAO,SAAS,IAAI,KAAK,CAAC,GAAG,IAAI,EAAE;AACrC;AAUA,EAAE,WAAW,WAAY;AACvB,MAAI,IAAI,MACN,OAAO,EAAE,aACT,MAAM,eAAe,GAAG,EAAE,KAAK,KAAK,YAAY,EAAE,KAAK,KAAK,QAAQ;AAEtE,SAAO,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,IAAI,MAAM,MAAM;AAChD;AAOA,EAAE,YAAY,EAAE,QAAQ,WAAY;AAClC,SAAO,SAAS,IAAI,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC;AAC3D;AAQA,EAAE,UAAU,EAAE,SAAS,WAAY;AACjC,MAAI,IAAI,MACN,OAAO,EAAE,aACT,MAAM,eAAe,GAAG,EAAE,KAAK,KAAK,YAAY,EAAE,KAAK,KAAK,QAAQ;AAEtE,SAAO,EAAE,MAAM,IAAI,MAAM,MAAM;AACjC;AAoDA,SAAS,eAAe,GAAG;AACzB,MAAI,GAAG,GAAG,IACR,kBAAkB,EAAE,SAAS,GAC7B,MAAM,IACN,IAAI,EAAE,CAAC;AAET,MAAI,kBAAkB,GAAG;AACvB,WAAO;AACP,SAAK,IAAI,GAAG,IAAI,iBAAiB,KAAK;AACpC,WAAK,EAAE,CAAC,IAAI;AACZ,UAAI,WAAW,GAAG;AAClB,UAAI,EAAG,QAAO,cAAc,CAAC;AAC7B,aAAO;AAAA,IACT;AAEA,QAAI,EAAE,CAAC;AACP,SAAK,IAAI;AACT,QAAI,WAAW,GAAG;AAClB,QAAI,EAAG,QAAO,cAAc,CAAC;AAAA,EAC/B,WAAW,MAAM,GAAG;AAClB,WAAO;AAAA,EACT;AAGA,SAAO,IAAI,OAAO,IAAI,MAAK;AAE3B,SAAO,MAAM;AACf;AAGA,SAAS,WAAW,GAAGF,MAAKC,MAAK;AAC/B,MAAI,MAAM,CAAC,CAAC,KAAK,IAAID,QAAO,IAAIC,MAAK;AACnC,UAAM,MAAM,kBAAkB,CAAC;AAAA,EACjC;AACF;AAQA,SAAS,oBAAoB,GAAG,GAAG,IAAI,WAAW;AAChD,MAAI,IAAI,GAAG,GAAG;AAGd,OAAK,IAAI,EAAE,CAAC,GAAG,KAAK,IAAI,KAAK,GAAI,GAAE;AAGnC,MAAI,EAAE,IAAI,GAAG;AACX,SAAK;AACL,SAAK;AAAA,EACP,OAAO;AACL,SAAK,KAAK,MAAM,IAAI,KAAK,QAAQ;AACjC,SAAK;AAAA,EACP;AAKA,MAAI,QAAQ,IAAI,WAAW,CAAC;AAC5B,OAAK,EAAE,EAAE,IAAI,IAAI;AAEjB,MAAI,aAAa,MAAM;AACrB,QAAI,IAAI,GAAG;AACT,UAAI,KAAK,EAAG,MAAK,KAAK,MAAM;AAAA,eACnB,KAAK,EAAG,MAAK,KAAK,KAAK;AAChC,UAAI,KAAK,KAAK,MAAM,SAAS,KAAK,KAAK,MAAM,SAAS,MAAM,OAAS,MAAM;AAAA,IAC7E,OAAO;AACL,WAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,OACnD,EAAE,KAAK,CAAC,IAAI,IAAI,MAAM,MAAM,QAAQ,IAAI,IAAI,CAAC,IAAI,MAC/C,MAAM,IAAI,KAAK,MAAM,OAAO,EAAE,KAAK,CAAC,IAAI,IAAI,MAAM,MAAM;AAAA,IAC/D;AAAA,EACF,OAAO;AACL,QAAI,IAAI,GAAG;AACT,UAAI,KAAK,EAAG,MAAK,KAAK,MAAO;AAAA,eACpB,KAAK,EAAG,MAAK,KAAK,MAAM;AAAA,eACxB,KAAK,EAAG,MAAK,KAAK,KAAK;AAChC,WAAK,aAAa,KAAK,MAAM,MAAM,QAAQ,CAAC,aAAa,KAAK,KAAK,MAAM;AAAA,IAC3E,OAAO;AACL,YAAM,aAAa,KAAK,MAAM,KAAK,KAAK,KACvC,CAAC,aAAa,KAAK,KAAM,KAAK,KAAK,IAAI,OACrC,EAAE,KAAK,CAAC,IAAI,IAAI,MAAO,MAAM,QAAQ,IAAI,IAAI,CAAC,IAAI;AAAA,IACvD;AAAA,EACF;AAEA,SAAO;AACT;AAMA,SAAS,YAAY,KAAK,QAAQ,SAAS;AACzC,MAAI,GACF,MAAM,CAAC,CAAC,GACR,MACA,IAAI,GACJ,OAAO,IAAI;AAEb,SAAO,IAAI,QAAO;AAChB,SAAK,OAAO,IAAI,QAAQ,SAAS,KAAI,IAAI,KAAK;AAC9C,QAAI,CAAC,KAAK,SAAS,QAAQ,IAAI,OAAO,GAAG,CAAC;AAC1C,SAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAC/B,UAAI,IAAI,CAAC,IAAI,UAAU,GAAG;AACxB,YAAI,IAAI,IAAI,CAAC,MAAM,OAAQ,KAAI,IAAI,CAAC,IAAI;AACxC,YAAI,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,UAAU;AACjC,YAAI,CAAC,KAAK;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AAEA,SAAO,IAAI,QAAQ;AACrB;AAQA,SAAS,OAAO,MAAM,GAAG;AACvB,MAAI,GAAG,KAAK;AAEZ,MAAI,EAAE,OAAO,EAAG,QAAO;AAMvB,QAAM,EAAE,EAAE;AACV,MAAI,MAAM,IAAI;AACZ,QAAI,KAAK,KAAK,MAAM,CAAC;AACrB,SAAK,IAAI,QAAQ,GAAG,CAAC,GAAG,SAAS;AAAA,EACnC,OAAO;AACL,QAAI;AACJ,QAAI;AAAA,EACN;AAEA,OAAK,aAAa;AAElB,MAAI,aAAa,MAAM,GAAG,EAAE,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC;AAGjD,WAAS,IAAI,GAAG,OAAM;AACpB,QAAI,QAAQ,EAAE,MAAM,CAAC;AACrB,QAAI,MAAM,MAAM,KAAK,EAAE,MAAM,KAAK,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC;AAAA,EACrD;AAEA,OAAK,aAAa;AAElB,SAAO;AACT;AAMA,IAAI,SAAU,4BAAY;AAGxB,WAAS,gBAAgB,GAAG,GAAG,MAAM;AACnC,QAAI,MACF,QAAQ,GACR,IAAI,EAAE;AAER,SAAK,IAAI,EAAE,MAAM,GAAG,OAAM;AACxB,aAAO,EAAE,CAAC,IAAI,IAAI;AAClB,QAAE,CAAC,IAAI,OAAO,OAAO;AACrB,cAAQ,OAAO,OAAO;AAAA,IACxB;AAEA,QAAI,MAAO,GAAE,QAAQ,KAAK;AAE1B,WAAO;AAAA,EACT;AAEA,WAAS,QAAQ,GAAG,GAAG,IAAI,IAAI;AAC7B,QAAI,GAAG;AAEP,QAAI,MAAM,IAAI;AACZ,UAAI,KAAK,KAAK,IAAI;AAAA,IACpB,OAAO;AACL,WAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,YAAI,EAAE,CAAC,KAAK,EAAE,CAAC,GAAG;AAChB,cAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI;AACtB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAEA,WAASE,UAAS,GAAG,GAAG,IAAI,MAAM;AAChC,QAAI,IAAI;AAGR,WAAO,QAAO;AACZ,QAAE,EAAE,KAAK;AACT,UAAI,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,IAAI;AACxB,QAAE,EAAE,IAAI,IAAI,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE;AAAA,IACjC;AAGA,WAAO,CAAC,EAAE,CAAC,KAAK,EAAE,SAAS,IAAI,GAAE,MAAM;AAAA,EACzC;AAEA,SAAO,SAAU,GAAG,GAAG,IAAI,IAAI,IAAI,MAAM;AACvC,QAAI,KAAK,GAAG,GAAG,GAAG,SAAS,MAAM,MAAM,OAAO,GAAG,IAAI,KAAK,MAAM,MAAM,IAAI,GAAG,IAAI,IAAI,KACnF,IAAI,IACJ,OAAO,EAAE,aACTC,QAAO,EAAE,KAAK,EAAE,IAAI,IAAI,IACxB,KAAK,EAAE,GACP,KAAK,EAAE;AAGT,QAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;AAElC,aAAO,IAAI;AAAA;AAAA,QACT,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,KAAK,MAAM,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,MAAM;AAAA;AAAA,UAGpD,MAAM,GAAG,CAAC,KAAK,KAAK,CAAC,KAAKA,QAAO,IAAIA,QAAO;AAAA;AAAA,MAAC;AAAA,IACjD;AAEA,QAAI,MAAM;AACR,gBAAU;AACV,UAAI,EAAE,IAAI,EAAE;AAAA,IACd,OAAO;AACL,aAAO;AACP,gBAAU;AACV,UAAI,UAAU,EAAE,IAAI,OAAO,IAAI,UAAU,EAAE,IAAI,OAAO;AAAA,IACxD;AAEA,SAAK,GAAG;AACR,SAAK,GAAG;AACR,QAAI,IAAI,KAAKA,KAAI;AACjB,SAAK,EAAE,IAAI,CAAC;AAIZ,SAAK,IAAI,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,IAAI,IAAI;AAEvC,QAAI,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,GAAI;AAE1B,QAAI,MAAM,MAAM;AACd,WAAK,KAAK,KAAK;AACf,WAAK,KAAK;AAAA,IACZ,WAAW,IAAI;AACb,WAAK,MAAM,EAAE,IAAI,EAAE,KAAK;AAAA,IAC1B,OAAO;AACL,WAAK;AAAA,IACP;AAEA,QAAI,KAAK,GAAG;AACV,SAAG,KAAK,CAAC;AACT,aAAO;AAAA,IACT,OAAO;AAGL,WAAK,KAAK,UAAU,IAAI;AACxB,UAAI;AAGJ,UAAI,MAAM,GAAG;AACX,YAAI;AACJ,aAAK,GAAG,CAAC;AACT;AAGA,gBAAQ,IAAI,MAAM,MAAM,MAAM,KAAK;AACjC,cAAI,IAAI,QAAQ,GAAG,CAAC,KAAK;AACzB,aAAG,CAAC,IAAI,IAAI,KAAK;AACjB,cAAI,IAAI,KAAK;AAAA,QACf;AAEA,eAAO,KAAK,IAAI;AAAA,MAGlB,OAAO;AAGL,YAAI,QAAQ,GAAG,CAAC,IAAI,KAAK;AAEzB,YAAI,IAAI,GAAG;AACT,eAAK,gBAAgB,IAAI,GAAG,IAAI;AAChC,eAAK,gBAAgB,IAAI,GAAG,IAAI;AAChC,eAAK,GAAG;AACR,eAAK,GAAG;AAAA,QACV;AAEA,aAAK;AACL,cAAM,GAAG,MAAM,GAAG,EAAE;AACpB,eAAO,IAAI;AAGX,eAAO,OAAO,KAAK,KAAI,MAAM,IAAI;AAEjC,aAAK,GAAG,MAAM;AACd,WAAG,QAAQ,CAAC;AACZ,cAAM,GAAG,CAAC;AAEV,YAAI,GAAG,CAAC,KAAK,OAAO,EAAG,GAAE;AAEzB,WAAG;AACD,cAAI;AAGJ,gBAAM,QAAQ,IAAI,KAAK,IAAI,IAAI;AAG/B,cAAI,MAAM,GAAG;AAGX,mBAAO,IAAI,CAAC;AACZ,gBAAI,MAAM,KAAM,QAAO,OAAO,QAAQ,IAAI,CAAC,KAAK;AAGhD,gBAAI,OAAO,MAAM;AAUjB,gBAAI,IAAI,GAAG;AACT,kBAAI,KAAK,KAAM,KAAI,OAAO;AAG1B,qBAAO,gBAAgB,IAAI,GAAG,IAAI;AAClC,sBAAQ,KAAK;AACb,qBAAO,IAAI;AAGX,oBAAM,QAAQ,MAAM,KAAK,OAAO,IAAI;AAGpC,kBAAI,OAAO,GAAG;AACZ;AAGA,gBAAAD,UAAS,MAAM,KAAK,QAAQ,KAAK,IAAI,OAAO,IAAI;AAAA,cAClD;AAAA,YACF,OAAO;AAKL,kBAAI,KAAK,EAAG,OAAM,IAAI;AACtB,qBAAO,GAAG,MAAM;AAAA,YAClB;AAEA,oBAAQ,KAAK;AACb,gBAAI,QAAQ,KAAM,MAAK,QAAQ,CAAC;AAGhC,YAAAA,UAAS,KAAK,MAAM,MAAM,IAAI;AAG9B,gBAAI,OAAO,IAAI;AACb,qBAAO,IAAI;AAGX,oBAAM,QAAQ,IAAI,KAAK,IAAI,IAAI;AAG/B,kBAAI,MAAM,GAAG;AACX;AAGA,gBAAAA,UAAS,KAAK,KAAK,OAAO,KAAK,IAAI,MAAM,IAAI;AAAA,cAC/C;AAAA,YACF;AAEA,mBAAO,IAAI;AAAA,UACb,WAAW,QAAQ,GAAG;AACpB;AACA,kBAAM,CAAC,CAAC;AAAA,UACV;AAGA,aAAG,GAAG,IAAI;AAGV,cAAI,OAAO,IAAI,CAAC,GAAG;AACjB,gBAAI,MAAM,IAAI,GAAG,EAAE,KAAK;AAAA,UAC1B,OAAO;AACL,kBAAM,CAAC,GAAG,EAAE,CAAC;AACb,mBAAO;AAAA,UACT;AAAA,QAEF,UAAU,OAAO,MAAM,IAAI,CAAC,MAAM,WAAW;AAE7C,eAAO,IAAI,CAAC,MAAM;AAAA,MACpB;AAGA,UAAI,CAAC,GAAG,CAAC,EAAG,IAAG,MAAM;AAAA,IACvB;AAGA,QAAI,WAAW,GAAG;AAChB,QAAE,IAAI;AACN,gBAAU;AAAA,IACZ,OAAO;AAGL,WAAK,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,KAAK,GAAI;AACzC,QAAE,IAAI,IAAI,IAAI,UAAU;AAExB,eAAS,GAAG,KAAK,KAAK,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI;AAAA,IAC9C;AAEA,WAAO;AAAA,EACT;AACF,GAAG;AAOF,SAAS,SAAS,GAAG,IAAI,IAAI,aAAa;AACzC,MAAIE,SAAQ,GAAG,GAAG,GAAG,IAAI,SAAS,GAAG,IAAI,KACvC,OAAO,EAAE;AAGX,MAAK,KAAI,MAAM,MAAM;AACnB,SAAK,EAAE;AAGP,QAAI,CAAC,GAAI,QAAO;AAWhB,SAAKA,UAAS,GAAG,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,KAAK,GAAI,CAAAA;AAC9C,QAAI,KAAKA;AAGT,QAAI,IAAI,GAAG;AACT,WAAK;AACL,UAAI;AACJ,UAAI,GAAG,MAAM,CAAC;AAGd,WAAK,IAAI,QAAQ,IAAIA,UAAS,IAAI,CAAC,IAAI,KAAK;AAAA,IAC9C,OAAO;AACL,YAAM,KAAK,MAAM,IAAI,KAAK,QAAQ;AAClC,UAAI,GAAG;AACP,UAAI,OAAO,GAAG;AACZ,YAAI,aAAa;AAGf,iBAAO,OAAO,MAAM,IAAG,KAAK,CAAC;AAC7B,cAAI,KAAK;AACT,UAAAA,UAAS;AACT,eAAK;AACL,cAAI,IAAI,WAAW;AAAA,QACrB,OAAO;AACL,gBAAM;AAAA,QACR;AAAA,MACF,OAAO;AACL,YAAI,IAAI,GAAG,GAAG;AAGd,aAAKA,UAAS,GAAG,KAAK,IAAI,KAAK,GAAI,CAAAA;AAGnC,aAAK;AAIL,YAAI,IAAI,WAAWA;AAGnB,aAAK,IAAI,IAAI,IAAI,IAAI,QAAQ,IAAIA,UAAS,IAAI,CAAC,IAAI,KAAK;AAAA,MAC1D;AAAA,IACF;AAGA,kBAAc,eAAe,KAAK,KAChC,GAAG,MAAM,CAAC,MAAM,WAAW,IAAI,IAAI,IAAI,IAAI,QAAQ,IAAIA,UAAS,IAAI,CAAC;AAMvE,cAAU,KAAK,KACV,MAAM,iBAAiB,MAAM,KAAK,OAAO,EAAE,IAAI,IAAI,IAAI,MACxD,KAAK,KAAK,MAAM,MAAM,MAAM,KAAK,eAAe,MAAM;AAAA,KAGpD,IAAI,IAAI,IAAI,IAAI,IAAI,QAAQ,IAAIA,UAAS,CAAC,IAAI,IAAI,GAAG,MAAM,CAAC,KAAK,KAAM,KACvE,OAAO,EAAE,IAAI,IAAI,IAAI;AAE3B,QAAI,KAAK,KAAK,CAAC,GAAG,CAAC,GAAG;AACpB,SAAG,SAAS;AACZ,UAAI,SAAS;AAGX,cAAM,EAAE,IAAI;AAGZ,WAAG,CAAC,IAAI,QAAQ,KAAK,WAAW,KAAK,YAAY,QAAQ;AACzD,UAAE,IAAI,CAAC,MAAM;AAAA,MACf,OAAO;AAGL,WAAG,CAAC,IAAI,EAAE,IAAI;AAAA,MAChB;AAEA,aAAO;AAAA,IACT;AAGA,QAAI,KAAK,GAAG;AACV,SAAG,SAAS;AACZ,UAAI;AACJ;AAAA,IACF,OAAO;AACL,SAAG,SAAS,MAAM;AAClB,UAAI,QAAQ,IAAI,WAAW,CAAC;AAI5B,SAAG,GAAG,IAAI,IAAI,KAAK,IAAI,QAAQ,IAAIA,UAAS,CAAC,IAAI,QAAQ,IAAI,CAAC,IAAI,KAAK,IAAI;AAAA,IAC7E;AAEA,QAAI,SAAS;AACX,iBAAS;AAGP,YAAI,OAAO,GAAG;AAGZ,eAAK,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,KAAK,GAAI;AACzC,cAAI,GAAG,CAAC,KAAK;AACb,eAAK,IAAI,GAAG,KAAK,IAAI,KAAK,GAAI;AAG9B,cAAI,KAAK,GAAG;AACV,cAAE;AACF,gBAAI,GAAG,CAAC,KAAK,KAAM,IAAG,CAAC,IAAI;AAAA,UAC7B;AAEA;AAAA,QACF,OAAO;AACL,aAAG,GAAG,KAAK;AACX,cAAI,GAAG,GAAG,KAAK,KAAM;AACrB,aAAG,KAAK,IAAI;AACZ,cAAI;AAAA,QACN;AAAA,MACF;AAAA,IACF;AAGA,SAAK,IAAI,GAAG,QAAQ,GAAG,EAAE,CAAC,MAAM,IAAI,IAAG,IAAI;AAAA,EAC7C;AAEA,MAAI,UAAU;AAGZ,QAAI,EAAE,IAAI,KAAK,MAAM;AAGnB,QAAE,IAAI;AACN,QAAE,IAAI;AAAA,IAGR,WAAW,EAAE,IAAI,KAAK,MAAM;AAG1B,QAAE,IAAI;AACN,QAAE,IAAI,CAAC,CAAC;AAAA,IAEV;AAAA,EACF;AAEA,SAAO;AACT;AAGA,SAAS,eAAe,GAAG,OAAO,IAAI;AACpC,MAAI,CAAC,EAAE,SAAS,EAAG,QAAO,kBAAkB,CAAC;AAC7C,MAAI,GACF,IAAI,EAAE,GACN,MAAM,eAAe,EAAE,CAAC,GACxB,MAAM,IAAI;AAEZ,MAAI,OAAO;AACT,QAAI,OAAO,IAAI,KAAK,OAAO,GAAG;AAC5B,YAAM,IAAI,OAAO,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,cAAc,CAAC;AAAA,IAC5D,WAAW,MAAM,GAAG;AAClB,YAAM,IAAI,OAAO,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,IACzC;AAEA,UAAM,OAAO,EAAE,IAAI,IAAI,MAAM,QAAQ,EAAE;AAAA,EACzC,WAAW,IAAI,GAAG;AAChB,UAAM,OAAO,cAAc,CAAC,IAAI,CAAC,IAAI;AACrC,QAAI,OAAO,IAAI,KAAK,OAAO,EAAG,QAAO,cAAc,CAAC;AAAA,EACtD,WAAW,KAAK,KAAK;AACnB,WAAO,cAAc,IAAI,IAAI,GAAG;AAChC,QAAI,OAAO,IAAI,KAAK,IAAI,KAAK,EAAG,OAAM,MAAM,MAAM,cAAc,CAAC;AAAA,EACnE,OAAO;AACL,SAAK,IAAI,IAAI,KAAK,IAAK,OAAM,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC;AAChE,QAAI,OAAO,IAAI,KAAK,OAAO,GAAG;AAC5B,UAAI,IAAI,MAAM,IAAK,QAAO;AAC1B,aAAO,cAAc,CAAC;AAAA,IACxB;AAAA,EACF;AAEA,SAAO;AACT;AAIA,SAAS,kBAAkBA,SAAQ,GAAG;AACpC,MAAI,IAAIA,QAAO,CAAC;AAGhB,OAAM,KAAK,UAAU,KAAK,IAAI,KAAK,GAAI;AACvC,SAAO;AACT;AAGA,SAAS,QAAQ,MAAM,IAAI,IAAI;AAC7B,MAAI,KAAK,gBAAgB;AAGvB,eAAW;AACX,QAAI,GAAI,MAAK,YAAY;AACzB,UAAM,MAAM,sBAAsB;AAAA,EACpC;AACA,SAAO,SAAS,IAAI,KAAK,IAAI,GAAG,IAAI,GAAG,IAAI;AAC7C;AAGA,SAAS,MAAM,MAAM,IAAI,IAAI;AAC3B,MAAI,KAAK,aAAc,OAAM,MAAM,sBAAsB;AACzD,SAAO,SAAS,IAAI,KAAK,EAAE,GAAG,IAAI,IAAI,IAAI;AAC5C;AAGA,SAAS,aAAaA,SAAQ;AAC5B,MAAI,IAAIA,QAAO,SAAS,GACtB,MAAM,IAAI,WAAW;AAEvB,MAAIA,QAAO,CAAC;AAGZ,MAAI,GAAG;AAGL,WAAO,IAAI,MAAM,GAAG,KAAK,GAAI;AAG7B,SAAK,IAAIA,QAAO,CAAC,GAAG,KAAK,IAAI,KAAK,GAAI;AAAA,EACxC;AAEA,SAAO;AACT;AAGA,SAAS,cAAc,GAAG;AACxB,MAAI,KAAK;AACT,SAAO,MAAM,OAAM;AACnB,SAAO;AACT;AAUA,SAAS,OAAO,MAAM,GAAG,GAAG,IAAI;AAC9B,MAAI,aACF,IAAI,IAAI,KAAK,CAAC,GAId,IAAI,KAAK,KAAK,KAAK,WAAW,CAAC;AAEjC,aAAW;AAEX,aAAS;AACP,QAAI,IAAI,GAAG;AACT,UAAI,EAAE,MAAM,CAAC;AACb,UAAI,SAAS,EAAE,GAAG,CAAC,EAAG,eAAc;AAAA,IACtC;AAEA,QAAI,UAAU,IAAI,CAAC;AACnB,QAAI,MAAM,GAAG;AAGX,UAAI,EAAE,EAAE,SAAS;AACjB,UAAI,eAAe,EAAE,EAAE,CAAC,MAAM,EAAG,GAAE,EAAE,EAAE,CAAC;AACxC;AAAA,IACF;AAEA,QAAI,EAAE,MAAM,CAAC;AACb,aAAS,EAAE,GAAG,CAAC;AAAA,EACjB;AAEA,aAAW;AAEX,SAAO;AACT;AAGA,SAAS,MAAM,GAAG;AAChB,SAAO,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,IAAI;AAC/B;AAMA,SAAS,SAAS,MAAM,MAAM,GAAG;AAC/B,MAAI,GAAG,GACL,IAAI,IAAI,KAAK,KAAK,CAAC,CAAC,GACpB,IAAI;AAEN,SAAO,EAAE,IAAI,KAAK,UAAS;AACzB,QAAI,IAAI,KAAK,KAAK,CAAC,CAAC;AAGpB,QAAI,CAAC,EAAE,GAAG;AACR,UAAI;AACJ;AAAA,IACF;AAEA,QAAI,EAAE,IAAI,CAAC;AAEX,QAAI,MAAM,KAAK,MAAM,KAAK,EAAE,MAAM,GAAG;AACnC,UAAI;AAAA,IACN;AAAA,EACF;AAEA,SAAO;AACT;AAkCA,SAAS,mBAAmB,GAAG,IAAI;AACjC,MAAI,aAAa,OAAO,GAAGC,MAAKC,MAAK,GAAG,KACtC,MAAM,GACN,IAAI,GACJ,IAAI,GACJ,OAAO,EAAE,aACT,KAAK,KAAK,UACV,KAAK,KAAK;AAGZ,MAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,IAAI,IAAI;AAE/B,WAAO,IAAI,KAAK,EAAE,IACd,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAChC,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;AAAA,EACnC;AAEA,MAAI,MAAM,MAAM;AACd,eAAW;AACX,UAAM;AAAA,EACR,OAAO;AACL,UAAM;AAAA,EACR;AAEA,MAAI,IAAI,KAAK,OAAO;AAGpB,SAAO,EAAE,IAAI,IAAI;AAGf,QAAI,EAAE,MAAM,CAAC;AACb,SAAK;AAAA,EACP;AAIA,UAAQ,KAAK,IAAI,QAAQ,GAAG,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI;AACtD,SAAO;AACP,gBAAcD,OAAMC,OAAM,IAAI,KAAK,CAAC;AACpC,OAAK,YAAY;AAEjB,aAAS;AACP,IAAAD,OAAM,SAASA,KAAI,MAAM,CAAC,GAAG,KAAK,CAAC;AACnC,kBAAc,YAAY,MAAM,EAAE,CAAC;AACnC,QAAIC,KAAI,KAAK,OAAOD,MAAK,aAAa,KAAK,CAAC,CAAC;AAE7C,QAAI,eAAe,EAAE,CAAC,EAAE,MAAM,GAAG,GAAG,MAAM,eAAeC,KAAI,CAAC,EAAE,MAAM,GAAG,GAAG,GAAG;AAC7E,UAAI;AACJ,aAAO,IAAK,CAAAA,OAAM,SAASA,KAAI,MAAMA,IAAG,GAAG,KAAK,CAAC;AAOjD,UAAI,MAAM,MAAM;AAEd,YAAI,MAAM,KAAK,oBAAoBA,KAAI,GAAG,MAAM,OAAO,IAAI,GAAG,GAAG;AAC/D,eAAK,YAAY,OAAO;AACxB,wBAAcD,OAAM,IAAI,IAAI,KAAK,CAAC;AAClC,cAAI;AACJ;AAAA,QACF,OAAO;AACL,iBAAO,SAASC,MAAK,KAAK,YAAY,IAAI,IAAI,WAAW,IAAI;AAAA,QAC/D;AAAA,MACF,OAAO;AACL,aAAK,YAAY;AACjB,eAAOA;AAAA,MACT;AAAA,IACF;AAEA,IAAAA,OAAM;AAAA,EACR;AACF;AAkBA,SAAS,iBAAiB,GAAG,IAAI;AAC/B,MAAI,GAAG,IAAI,aAAa,GAAG,WAAW,KAAKA,MAAK,GAAG,KAAK,IAAI,IAC1D,IAAI,GACJ,QAAQ,IACR,IAAI,GACJ,KAAK,EAAE,GACP,OAAO,EAAE,aACT,KAAK,KAAK,UACV,KAAK,KAAK;AAGZ,MAAI,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,KAAK,GAAG,CAAC,KAAK,KAAK,GAAG,UAAU,GAAG;AACpE,WAAO,IAAI,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,EAAE,KAAK,IAAI,MAAM,KAAK,IAAI,CAAC;AAAA,EACrE;AAEA,MAAI,MAAM,MAAM;AACd,eAAW;AACX,UAAM;AAAA,EACR,OAAO;AACL,UAAM;AAAA,EACR;AAEA,OAAK,YAAY,OAAO;AACxB,MAAI,eAAe,EAAE;AACrB,OAAK,EAAE,OAAO,CAAC;AAEf,MAAI,KAAK,IAAI,IAAI,EAAE,CAAC,IAAI,OAAQ;AAa9B,WAAO,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,EAAE,OAAO,CAAC,IAAI,GAAG;AACtD,UAAI,EAAE,MAAM,CAAC;AACb,UAAI,eAAe,EAAE,CAAC;AACtB,WAAK,EAAE,OAAO,CAAC;AACf;AAAA,IACF;AAEA,QAAI,EAAE;AAEN,QAAI,KAAK,GAAG;AACV,UAAI,IAAI,KAAK,OAAO,CAAC;AACrB;AAAA,IACF,OAAO;AACL,UAAI,IAAI,KAAK,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC;AAAA,IACpC;AAAA,EACF,OAAO;AAKL,QAAI,QAAQ,MAAM,MAAM,GAAG,EAAE,EAAE,MAAM,IAAI,EAAE;AAC3C,QAAI,iBAAiB,IAAI,KAAK,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,KAAK,EAAE,KAAK,CAAC;AACzE,SAAK,YAAY;AAEjB,WAAO,MAAM,OAAO,SAAS,GAAG,IAAI,IAAI,WAAW,IAAI,IAAI;AAAA,EAC7D;AAGA,OAAK;AAKL,EAAAA,OAAM,YAAY,IAAI,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC;AAC1D,OAAK,SAAS,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC;AAChC,gBAAc;AAEd,aAAS;AACP,gBAAY,SAAS,UAAU,MAAM,EAAE,GAAG,KAAK,CAAC;AAChD,QAAIA,KAAI,KAAK,OAAO,WAAW,IAAI,KAAK,WAAW,GAAG,KAAK,CAAC,CAAC;AAE7D,QAAI,eAAe,EAAE,CAAC,EAAE,MAAM,GAAG,GAAG,MAAM,eAAeA,KAAI,CAAC,EAAE,MAAM,GAAG,GAAG,GAAG;AAC7E,MAAAA,OAAMA,KAAI,MAAM,CAAC;AAIjB,UAAI,MAAM,EAAG,CAAAA,OAAMA,KAAI,KAAK,QAAQ,MAAM,MAAM,GAAG,EAAE,EAAE,MAAM,IAAI,EAAE,CAAC;AACpE,MAAAA,OAAM,OAAOA,MAAK,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;AAQrC,UAAI,MAAM,MAAM;AACd,YAAI,oBAAoBA,KAAI,GAAG,MAAM,OAAO,IAAI,GAAG,GAAG;AACpD,eAAK,YAAY,OAAO;AACxB,cAAI,YAAY,IAAI,OAAO,GAAG,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;AAC1D,eAAK,SAAS,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC;AAChC,wBAAc,MAAM;AAAA,QACtB,OAAO;AACL,iBAAO,SAASA,MAAK,KAAK,YAAY,IAAI,IAAI,WAAW,IAAI;AAAA,QAC/D;AAAA,MACF,OAAO;AACL,aAAK,YAAY;AACjB,eAAOA;AAAA,MACT;AAAA,IACF;AAEA,IAAAA,OAAM;AACN,mBAAe;AAAA,EACjB;AACF;AAIA,SAAS,kBAAkB,GAAG;AAE5B,SAAO,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC;AAC7B;AAMA,SAAS,aAAa,GAAG,KAAK;AAC5B,MAAI,GAAG,GAAG;AAIV,OAAK,IAAI,IAAI,QAAQ,GAAG,KAAK,GAAI,OAAM,IAAI,QAAQ,KAAK,EAAE;AAG1D,OAAK,IAAI,IAAI,OAAO,IAAI,KAAK,GAAG;AAG9B,QAAI,IAAI,EAAG,KAAI;AACf,SAAK,CAAC,IAAI,MAAM,IAAI,CAAC;AACrB,UAAM,IAAI,UAAU,GAAG,CAAC;AAAA,EAC1B,WAAW,IAAI,GAAG;AAGhB,QAAI,IAAI;AAAA,EACV;AAGA,OAAK,IAAI,GAAG,IAAI,WAAW,CAAC,MAAM,IAAI,IAAI;AAG1C,OAAK,MAAM,IAAI,QAAQ,IAAI,WAAW,MAAM,CAAC,MAAM,IAAI,EAAE,IAAI;AAC7D,QAAM,IAAI,MAAM,GAAG,GAAG;AAEtB,MAAI,KAAK;AACP,WAAO;AACP,MAAE,IAAI,IAAI,IAAI,IAAI;AAClB,MAAE,IAAI,CAAC;AAMP,SAAK,IAAI,KAAK;AACd,QAAI,IAAI,EAAG,MAAK;AAEhB,QAAI,IAAI,KAAK;AACX,UAAI,EAAG,GAAE,EAAE,KAAK,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC;AAChC,WAAK,OAAO,UAAU,IAAI,MAAM,GAAE,EAAE,KAAK,CAAC,IAAI,MAAM,GAAG,KAAK,QAAQ,CAAC;AACrE,YAAM,IAAI,MAAM,CAAC;AACjB,UAAI,WAAW,IAAI;AAAA,IACrB,OAAO;AACL,WAAK;AAAA,IACP;AAEA,WAAO,MAAM,QAAO;AACpB,MAAE,EAAE,KAAK,CAAC,GAAG;AAEb,QAAI,UAAU;AAGZ,UAAI,EAAE,IAAI,EAAE,YAAY,MAAM;AAG5B,UAAE,IAAI;AACN,UAAE,IAAI;AAAA,MAGR,WAAW,EAAE,IAAI,EAAE,YAAY,MAAM;AAGnC,UAAE,IAAI;AACN,UAAE,IAAI,CAAC,CAAC;AAAA,MAEV;AAAA,IACF;AAAA,EACF,OAAO;AAGL,MAAE,IAAI;AACN,MAAE,IAAI,CAAC,CAAC;AAAA,EACV;AAEA,SAAO;AACT;AAMA,SAAS,WAAW,GAAG,KAAK;AAC1B,MAAI,MAAM,MAAM,SAAS,GAAG,SAAS,KAAK,GAAG,IAAI;AAEjD,MAAI,IAAI,QAAQ,GAAG,IAAI,IAAI;AACzB,UAAM,IAAI,QAAQ,gBAAgB,IAAI;AACtC,QAAI,UAAU,KAAK,GAAG,EAAG,QAAO,aAAa,GAAG,GAAG;AAAA,EACrD,WAAW,QAAQ,cAAc,QAAQ,OAAO;AAC9C,QAAI,CAAC,CAAC,IAAK,GAAE,IAAI;AACjB,MAAE,IAAI;AACN,MAAE,IAAI;AACN,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,KAAK,GAAG,GAAI;AACpB,WAAO;AACP,UAAM,IAAI,YAAY;AAAA,EACxB,WAAW,SAAS,KAAK,GAAG,GAAI;AAC9B,WAAO;AAAA,EACT,WAAW,QAAQ,KAAK,GAAG,GAAI;AAC7B,WAAO;AAAA,EACT,OAAO;AACL,UAAM,MAAM,kBAAkB,GAAG;AAAA,EACnC;AAGA,MAAI,IAAI,OAAO,IAAI;AAEnB,MAAI,IAAI,GAAG;AACT,QAAI,CAAC,IAAI,MAAM,IAAI,CAAC;AACpB,UAAM,IAAI,UAAU,GAAG,CAAC;AAAA,EAC1B,OAAO;AACL,UAAM,IAAI,MAAM,CAAC;AAAA,EACnB;AAIA,MAAI,IAAI,QAAQ,GAAG;AACnB,YAAU,KAAK;AACf,SAAO,EAAE;AAET,MAAI,SAAS;AACX,UAAM,IAAI,QAAQ,KAAK,EAAE;AACzB,UAAM,IAAI;AACV,QAAI,MAAM;AAGV,cAAU,OAAO,MAAM,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI,CAAC;AAAA,EACjD;AAEA,OAAK,YAAY,KAAK,MAAM,IAAI;AAChC,OAAK,GAAG,SAAS;AAGjB,OAAK,IAAI,IAAI,GAAG,CAAC,MAAM,GAAG,EAAE,EAAG,IAAG,IAAI;AACtC,MAAI,IAAI,EAAG,QAAO,IAAI,KAAK,EAAE,IAAI,CAAC;AAClC,IAAE,IAAI,kBAAkB,IAAI,EAAE;AAC9B,IAAE,IAAI;AACN,aAAW;AAQX,MAAI,QAAS,KAAI,OAAO,GAAG,SAAS,MAAM,CAAC;AAG3C,MAAI,EAAG,KAAI,EAAE,MAAM,KAAK,IAAI,CAAC,IAAI,KAAK,QAAQ,GAAG,CAAC,IAAI,QAAQ,IAAI,GAAG,CAAC,CAAC;AACvE,aAAW;AAEX,SAAO;AACT;AAQA,SAAS,KAAK,MAAM,GAAG;AACrB,MAAI,GACF,MAAM,EAAE,EAAE;AAEZ,MAAI,MAAM,GAAG;AACX,WAAO,EAAE,OAAO,IAAI,IAAI,aAAa,MAAM,GAAG,GAAG,CAAC;AAAA,EACpD;AAOA,MAAI,MAAM,KAAK,KAAK,GAAG;AACvB,MAAI,IAAI,KAAK,KAAK,IAAI;AAEtB,MAAI,EAAE,MAAM,IAAI,QAAQ,GAAG,CAAC,CAAC;AAC7B,MAAI,aAAa,MAAM,GAAG,GAAG,CAAC;AAG9B,MAAI,QACF,KAAK,IAAI,KAAK,CAAC,GACf,MAAM,IAAI,KAAK,EAAE,GACjB,MAAM,IAAI,KAAK,EAAE;AACnB,SAAO,OAAM;AACX,aAAS,EAAE,MAAM,CAAC;AAClB,QAAI,EAAE,MAAM,GAAG,KAAK,OAAO,MAAM,IAAI,MAAM,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;AAAA,EACjE;AAEA,SAAO;AACT;AAIA,SAAS,aAAa,MAAM,GAAG,GAAG,GAAG,cAAc;AACjD,MAAI,GAAG,GAAG,GAAG,IACX,IAAI,GACJ,KAAK,KAAK,WACV,IAAI,KAAK,KAAK,KAAK,QAAQ;AAE7B,aAAW;AACX,OAAK,EAAE,MAAM,CAAC;AACd,MAAI,IAAI,KAAK,CAAC;AAEd,aAAS;AACP,QAAI,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,KAAK,MAAM,GAAG,GAAG,IAAI,CAAC;AAClD,QAAI,eAAe,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC;AACxC,QAAI,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,KAAK,MAAM,GAAG,GAAG,IAAI,CAAC;AAClD,QAAI,EAAE,KAAK,CAAC;AAEZ,QAAI,EAAE,EAAE,CAAC,MAAM,QAAQ;AACrB,WAAK,IAAI,GAAG,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,MAAK;AACtC,UAAI,KAAK,GAAI;AAAA,IACf;AAEA,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ;AAAA,EACF;AAEA,aAAW;AACX,IAAE,EAAE,SAAS,IAAI;AAEjB,SAAO;AACT;AAIA,SAAS,QAAQ,GAAG,GAAG;AACrB,MAAI,IAAI;AACR,SAAO,EAAE,EAAG,MAAK;AACjB,SAAO;AACT;AAIA,SAAS,iBAAiB,MAAM,GAAG;AACjC,MAAI,GACF,QAAQ,EAAE,IAAI,GACd,KAAK,MAAM,MAAM,KAAK,WAAW,CAAC,GAClC,SAAS,GAAG,MAAM,GAAG;AAEvB,MAAI,EAAE,IAAI;AAEV,MAAI,EAAE,IAAI,MAAM,GAAG;AACjB,eAAW,QAAQ,IAAI;AACvB,WAAO;AAAA,EACT;AAEA,MAAI,EAAE,SAAS,EAAE;AAEjB,MAAI,EAAE,OAAO,GAAG;AACd,eAAW,QAAQ,IAAI;AAAA,EACzB,OAAO;AACL,QAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AAGvB,QAAI,EAAE,IAAI,MAAM,GAAG;AACjB,iBAAW,MAAM,CAAC,IAAK,QAAQ,IAAI,IAAM,QAAQ,IAAI;AACrD,aAAO;AAAA,IACT;AAEA,eAAW,MAAM,CAAC,IAAK,QAAQ,IAAI,IAAM,QAAQ,IAAI;AAAA,EACvD;AAEA,SAAO,EAAE,MAAM,EAAE,EAAE,IAAI;AACzB;AAQA,SAAS,eAAe,GAAG,SAAS,IAAI,IAAI;AAC1C,MAAI,MAAM,GAAG,GAAG,GAAG,KAAK,SAAS,KAAK,IAAI,GACxC,OAAO,EAAE,aACT,QAAQ,OAAO;AAEjB,MAAI,OAAO;AACT,eAAW,IAAI,GAAG,UAAU;AAC5B,QAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,QACxB,YAAW,IAAI,GAAG,CAAC;AAAA,EAC1B,OAAO;AACL,SAAK,KAAK;AACV,SAAK,KAAK;AAAA,EACZ;AAEA,MAAI,CAAC,EAAE,SAAS,GAAG;AACjB,UAAM,kBAAkB,CAAC;AAAA,EAC3B,OAAO;AACL,UAAM,eAAe,CAAC;AACtB,QAAI,IAAI,QAAQ,GAAG;AAOnB,QAAI,OAAO;AACT,aAAO;AACP,UAAI,WAAW,IAAI;AACjB,aAAK,KAAK,IAAI;AAAA,MAChB,WAAW,WAAW,GAAG;AACvB,aAAK,KAAK,IAAI;AAAA,MAChB;AAAA,IACF,OAAO;AACL,aAAO;AAAA,IACT;AAMA,QAAI,KAAK,GAAG;AACV,YAAM,IAAI,QAAQ,KAAK,EAAE;AACzB,UAAI,IAAI,KAAK,CAAC;AACd,QAAE,IAAI,IAAI,SAAS;AACnB,QAAE,IAAI,YAAY,eAAe,CAAC,GAAG,IAAI,IAAI;AAC7C,QAAE,IAAI,EAAE,EAAE;AAAA,IACZ;AAEA,SAAK,YAAY,KAAK,IAAI,IAAI;AAC9B,QAAI,MAAM,GAAG;AAGb,WAAO,GAAG,EAAE,GAAG,KAAK,IAAI,IAAG,IAAI;AAE/B,QAAI,CAAC,GAAG,CAAC,GAAG;AACV,YAAM,QAAQ,SAAS;AAAA,IACzB,OAAO;AACL,UAAI,IAAI,GAAG;AACT;AAAA,MACF,OAAO;AACL,YAAI,IAAI,KAAK,CAAC;AACd,UAAE,IAAI;AACN,UAAE,IAAI;AACN,YAAI,OAAO,GAAG,GAAG,IAAI,IAAI,GAAG,IAAI;AAChC,aAAK,EAAE;AACP,YAAI,EAAE;AACN,kBAAU;AAAA,MACZ;AAGA,UAAI,GAAG,EAAE;AACT,UAAI,OAAO;AACX,gBAAU,WAAW,GAAG,KAAK,CAAC,MAAM;AAEpC,gBAAU,KAAK,KACV,MAAM,UAAU,aAAa,OAAO,KAAK,QAAQ,EAAE,IAAI,IAAI,IAAI,MAChE,IAAI,KAAK,MAAM,MAAM,OAAO,KAAK,WAAW,OAAO,KAAK,GAAG,KAAK,CAAC,IAAI,KACrE,QAAQ,EAAE,IAAI,IAAI,IAAI;AAE1B,SAAG,SAAS;AAEZ,UAAI,SAAS;AAGX,eAAO,EAAE,GAAG,EAAE,EAAE,IAAI,OAAO,KAAI;AAC7B,aAAG,EAAE,IAAI;AACT,cAAI,CAAC,IAAI;AACP,cAAE;AACF,eAAG,QAAQ,CAAC;AAAA,UACd;AAAA,QACF;AAAA,MACF;AAGA,WAAK,MAAM,GAAG,QAAQ,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI;AAG1C,WAAK,IAAI,GAAG,MAAM,IAAI,IAAI,KAAK,IAAK,QAAO,SAAS,OAAO,GAAG,CAAC,CAAC;AAGhE,UAAI,OAAO;AACT,YAAI,MAAM,GAAG;AACX,cAAI,WAAW,MAAM,WAAW,GAAG;AACjC,gBAAI,WAAW,KAAK,IAAI;AACxB,iBAAK,EAAE,KAAK,MAAM,GAAG,MAAO,QAAO;AACnC,iBAAK,YAAY,KAAK,MAAM,OAAO;AACnC,iBAAK,MAAM,GAAG,QAAQ,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI;AAG1C,iBAAK,IAAI,GAAG,MAAM,MAAM,IAAI,KAAK,IAAK,QAAO,SAAS,OAAO,GAAG,CAAC,CAAC;AAAA,UACpE,OAAO;AACL,kBAAM,IAAI,OAAO,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,UACzC;AAAA,QACF;AAEA,cAAO,OAAO,IAAI,IAAI,MAAM,QAAQ;AAAA,MACtC,WAAW,IAAI,GAAG;AAChB,eAAO,EAAE,IAAI,OAAM,MAAM;AACzB,cAAM,OAAO;AAAA,MACf,OAAO;AACL,YAAI,EAAE,IAAI,IAAK,MAAK,KAAK,KAAK,MAAO,QAAO;AAAA,iBACnC,IAAI,IAAK,OAAM,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,MAC7D;AAAA,IACF;AAEA,WAAO,WAAW,KAAK,OAAO,WAAW,IAAI,OAAO,WAAW,IAAI,OAAO,MAAM;AAAA,EAClF;AAEA,SAAO,EAAE,IAAI,IAAI,MAAM,MAAM;AAC/B;AAIA,SAAS,SAAS,KAAK,KAAK;AAC1B,MAAI,IAAI,SAAS,KAAK;AACpB,QAAI,SAAS;AACb,WAAO;AAAA,EACT;AACF;AAyDA,SAAS,IAAI,GAAG;AACd,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI;AACzB;AASA,SAAS,KAAK,GAAG;AACf,SAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAC1B;AAUA,SAAS,MAAM,GAAG;AAChB,SAAO,IAAI,KAAK,CAAC,EAAE,MAAM;AAC3B;AAWA,SAAS,IAAI,GAAG,GAAG;AACjB,SAAO,IAAI,KAAK,CAAC,EAAE,KAAK,CAAC;AAC3B;AAUA,SAAS,KAAK,GAAG;AACf,SAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAC1B;AAUA,SAAS,MAAM,GAAG;AAChB,SAAO,IAAI,KAAK,CAAC,EAAE,MAAM;AAC3B;AAUA,SAAS,KAAK,GAAG;AACf,SAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAC1B;AAUA,SAAS,MAAM,GAAG;AAChB,SAAO,IAAI,KAAK,CAAC,EAAE,MAAM;AAC3B;AA4BA,SAAS,MAAM,GAAG,GAAG;AACnB,MAAI,IAAI,KAAK,CAAC;AACd,MAAI,IAAI,KAAK,CAAC;AACd,MAAI,GACF,KAAK,KAAK,WACV,KAAK,KAAK,UACV,MAAM,KAAK;AAGb,MAAI,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG;AAChB,QAAI,IAAI,KAAK,GAAG;AAAA,EAGlB,WAAW,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG;AACvB,QAAI,MAAM,MAAM,KAAK,CAAC,EAAE,MAAM,EAAE,IAAI,IAAI,OAAO,IAAI;AACnD,MAAE,IAAI,EAAE;AAAA,EAGV,WAAW,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG;AAC7B,QAAI,EAAE,IAAI,IAAI,MAAM,MAAM,IAAI,EAAE,IAAI,IAAI,KAAK,CAAC;AAC9C,MAAE,IAAI,EAAE;AAAA,EAGV,WAAW,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG;AAC7B,QAAI,MAAM,MAAM,KAAK,CAAC,EAAE,MAAM,GAAG;AACjC,MAAE,IAAI,EAAE;AAAA,EAGV,WAAW,EAAE,IAAI,GAAG;AAClB,SAAK,YAAY;AACjB,SAAK,WAAW;AAChB,QAAI,KAAK,KAAK,OAAO,GAAG,GAAG,KAAK,CAAC,CAAC;AAClC,QAAI,MAAM,MAAM,KAAK,CAAC;AACtB,SAAK,YAAY;AACjB,SAAK,WAAW;AAChB,QAAI,EAAE,IAAI,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC;AAAA,EACrC,OAAO;AACL,QAAI,KAAK,KAAK,OAAO,GAAG,GAAG,KAAK,CAAC,CAAC;AAAA,EACpC;AAEA,SAAO;AACT;AAUA,SAASC,MAAK,GAAG;AACf,SAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAC1B;AASA,SAAS,KAAK,GAAG;AACf,SAAO,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC;AAC7C;AAWA,SAAS,MAAM,GAAGR,MAAKC,MAAK;AAC1B,SAAO,IAAI,KAAK,CAAC,EAAE,MAAMD,MAAKC,IAAG;AACnC;AAqBA,SAASQ,QAAO,KAAK;AACnB,MAAI,CAAC,OAAO,OAAO,QAAQ,SAAU,OAAM,MAAM,eAAe,iBAAiB;AACjF,MAAI,GAAG,GAAG,GACR,cAAc,IAAI,aAAa,MAC/B,KAAK;AAAA,IACH;AAAA,IAAa;AAAA,IAAG;AAAA,IAChB;AAAA,IAAY;AAAA,IAAG;AAAA,IACf;AAAA,IAAY,CAAC;AAAA,IAAW;AAAA,IACxB;AAAA,IAAY;AAAA,IAAG;AAAA,IACf;AAAA,IAAQ;AAAA,IAAG;AAAA,IACX;AAAA,IAAQ,CAAC;AAAA,IAAW;AAAA,IACpB;AAAA,IAAU;AAAA,IAAG;AAAA,EACf;AAEF,OAAK,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK,GAAG;AACjC,QAAI,IAAI,GAAG,CAAC,GAAG,YAAa,MAAK,CAAC,IAAI,SAAS,CAAC;AAChD,SAAK,IAAI,IAAI,CAAC,OAAO,QAAQ;AAC3B,UAAI,UAAU,CAAC,MAAM,KAAK,KAAK,GAAG,IAAI,CAAC,KAAK,KAAK,GAAG,IAAI,CAAC,EAAG,MAAK,CAAC,IAAI;AAAA,UACjE,OAAM,MAAM,kBAAkB,IAAI,OAAO,CAAC;AAAA,IACjD;AAAA,EACF;AAEA,MAAI,IAAI,UAAU,YAAa,MAAK,CAAC,IAAI,SAAS,CAAC;AACnD,OAAK,IAAI,IAAI,CAAC,OAAO,QAAQ;AAC3B,QAAI,MAAM,QAAQ,MAAM,SAAS,MAAM,KAAK,MAAM,GAAG;AACnD,UAAI,GAAG;AACL,YAAI,OAAO,UAAU,eAAe,WACjC,OAAO,mBAAmB,OAAO,cAAc;AAChD,eAAK,CAAC,IAAI;AAAA,QACZ,OAAO;AACL,gBAAM,MAAM,iBAAiB;AAAA,QAC/B;AAAA,MACF,OAAO;AACL,aAAK,CAAC,IAAI;AAAA,MACZ;AAAA,IACF,OAAO;AACL,YAAM,MAAM,kBAAkB,IAAI,OAAO,CAAC;AAAA,IAC5C;AAAA,EACF;AAEA,SAAO;AACT;AAUA,SAAS,IAAI,GAAG;AACd,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI;AACzB;AAUA,SAAS,KAAK,GAAG;AACf,SAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAC1B;AAQA,SAASC,OAAM,KAAK;AAClB,MAAI,GAAG,GAAG;AASV,WAASC,SAAQ,GAAG;AAClB,QAAI,GAAGC,IAAG,GACR,IAAI;AAGN,QAAI,EAAE,aAAaD,UAAU,QAAO,IAAIA,SAAQ,CAAC;AAIjD,MAAE,cAAcA;AAEhB,QAAI,kBAAkB,CAAC,GAAG;AACxB,QAAE,IAAI,EAAE;AAER,UAAI,UAAU;AACZ,YAAI,CAAC,EAAE,KAAK,EAAE,IAAIA,SAAQ,MAAM;AAG9B,YAAE,IAAI;AACN,YAAE,IAAI;AAAA,QACR,WAAW,EAAE,IAAIA,SAAQ,MAAM;AAG7B,YAAE,IAAI;AACN,YAAE,IAAI,CAAC,CAAC;AAAA,QACV,OAAO;AACL,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE,EAAE,MAAM;AAAA,QAClB;AAAA,MACF,OAAO;AACL,UAAE,IAAI,EAAE;AACR,UAAE,IAAI,EAAE,IAAI,EAAE,EAAE,MAAM,IAAI,EAAE;AAAA,MAC9B;AAEA;AAAA,IACF;AAEA,QAAI,OAAO;AAEX,QAAI,MAAM,UAAU;AAClB,UAAI,MAAM,GAAG;AACX,UAAE,IAAI,IAAI,IAAI,IAAI,KAAK;AACvB,UAAE,IAAI;AACN,UAAE,IAAI,CAAC,CAAC;AACR;AAAA,MACF;AAEA,UAAI,IAAI,GAAG;AACT,YAAI,CAAC;AACL,UAAE,IAAI;AAAA,MACR,OAAO;AACL,UAAE,IAAI;AAAA,MACR;AAGA,UAAI,MAAM,CAAC,CAAC,KAAK,IAAI,KAAK;AACxB,aAAK,IAAI,GAAGC,KAAI,GAAGA,MAAK,IAAIA,MAAK,GAAI;AAErC,YAAI,UAAU;AACZ,cAAI,IAAID,SAAQ,MAAM;AACpB,cAAE,IAAI;AACN,cAAE,IAAI;AAAA,UACR,WAAW,IAAIA,SAAQ,MAAM;AAC3B,cAAE,IAAI;AACN,cAAE,IAAI,CAAC,CAAC;AAAA,UACV,OAAO;AACL,cAAE,IAAI;AACN,cAAE,IAAI,CAAC,CAAC;AAAA,UACV;AAAA,QACF,OAAO;AACL,YAAE,IAAI;AACN,YAAE,IAAI,CAAC,CAAC;AAAA,QACV;AAEA;AAAA,MACF;AAGA,UAAI,IAAI,MAAM,GAAG;AACf,YAAI,CAAC,EAAG,GAAE,IAAI;AACd,UAAE,IAAI;AACN,UAAE,IAAI;AACN;AAAA,MACF;AAEA,aAAO,aAAa,GAAG,EAAE,SAAS,CAAC;AAAA,IACrC;AAEA,QAAI,MAAM,UAAU;AAClB,WAAKC,KAAI,EAAE,WAAW,CAAC,OAAO,IAAI;AAChC,YAAI,EAAE,MAAM,CAAC;AACb,UAAE,IAAI;AAAA,MACR,OAAO;AACL,YAAIA,OAAM,GAAI,KAAI,EAAE,MAAM,CAAC;AAC3B,UAAE,IAAI;AAAA,MACR;AAEA,aAAO,UAAU,KAAK,CAAC,IAAI,aAAa,GAAG,CAAC,IAAI,WAAW,GAAG,CAAC;AAAA,IACjE;AAEA,QAAI,MAAM,UAAU;AAClB,UAAI,IAAI,GAAG;AACT,YAAI,CAAC;AACL,UAAE,IAAI;AAAA,MACR,OAAO;AACL,UAAE,IAAI;AAAA,MACR;AAEA,aAAO,aAAa,GAAG,EAAE,SAAS,CAAC;AAAA,IACrC;AAEA,UAAM,MAAM,kBAAkB,CAAC;AAAA,EACjC;AAEA,EAAAD,SAAQ,YAAY;AAEpB,EAAAA,SAAQ,WAAW;AACnB,EAAAA,SAAQ,aAAa;AACrB,EAAAA,SAAQ,aAAa;AACrB,EAAAA,SAAQ,cAAc;AACtB,EAAAA,SAAQ,gBAAgB;AACxB,EAAAA,SAAQ,kBAAkB;AAC1B,EAAAA,SAAQ,kBAAkB;AAC1B,EAAAA,SAAQ,kBAAkB;AAC1B,EAAAA,SAAQ,mBAAmB;AAC3B,EAAAA,SAAQ,SAAS;AAEjB,EAAAA,SAAQ,SAASA,SAAQ,MAAMF;AAC/B,EAAAE,SAAQ,QAAQD;AAChB,EAAAC,SAAQ,YAAY;AAEpB,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,OAAO;AACf,EAAAA,SAAQ,QAAQ;AAChB,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,OAAO;AACf,EAAAA,SAAQ,QAAQ;AAChB,EAAAA,SAAQ,OAAO;AACf,EAAAA,SAAQ,QAAQ;AAChB,EAAAA,SAAQ,QAAQ;AAChB,EAAAA,SAAQ,OAAOH;AACf,EAAAG,SAAQ,OAAO;AACf,EAAAA,SAAQ,QAAQ;AAChB,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,OAAO;AACf,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,QAAQ;AAChB,EAAAA,SAAQ,QAAQ;AAChB,EAAAA,SAAQ,KAAK;AACb,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,QAAQE;AAChB,EAAAF,SAAQ,OAAOG;AACf,EAAAH,SAAQ,MAAM;AACd,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,SAAS;AACjB,EAAAA,SAAQ,QAAQ;AAChB,EAAAA,SAAQ,OAAOP;AACf,EAAAO,SAAQ,MAAM;AACd,EAAAA,SAAQ,OAAO;AACf,EAAAA,SAAQ,OAAO;AACf,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,MAAM;AACd,EAAAA,SAAQ,OAAO;AACf,EAAAA,SAAQ,QAAQ;AAEhB,MAAI,QAAQ,OAAQ,OAAM,CAAC;AAC3B,MAAI,KAAK;AACP,QAAI,IAAI,aAAa,MAAM;AACzB,WAAK,CAAC,aAAa,YAAY,YAAY,YAAY,QAAQ,QAAQ,UAAU,QAAQ;AACzF,WAAK,IAAI,GAAG,IAAI,GAAG,SAAS,KAAI,CAAC,IAAI,eAAe,IAAI,GAAG,GAAG,CAAC,EAAG,KAAI,CAAC,IAAI,KAAK,CAAC;AAAA,IACnF;AAAA,EACF;AAEA,EAAAA,SAAQ,OAAO,GAAG;AAElB,SAAOA;AACT;AAWA,SAAS,IAAI,GAAG,GAAG;AACjB,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAC1B;AAUA,SAAS,IAAI,GAAG;AACd,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI;AACzB;AASA,SAAS,MAAM,GAAG;AAChB,SAAO,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC;AAC7C;AAYA,SAAS,QAAQ;AACf,MAAI,GAAG,GACL,IAAI,IAAI,KAAK,CAAC;AAEhB,aAAW;AAEX,OAAK,IAAI,GAAG,IAAI,UAAU,UAAS;AACjC,QAAI,IAAI,KAAK,UAAU,GAAG,CAAC;AAC3B,QAAI,CAAC,EAAE,GAAG;AACR,UAAI,EAAE,GAAG;AACP,mBAAW;AACX,eAAO,IAAI,KAAK,IAAI,CAAC;AAAA,MACvB;AACA,UAAI;AAAA,IACN,WAAW,EAAE,GAAG;AACd,UAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;AAAA,IACvB;AAAA,EACF;AAEA,aAAW;AAEX,SAAO,EAAE,KAAK;AAChB;AAQA,SAAS,kBAAkB,KAAK;AAC9B,SAAO,eAAe,WAAW,OAAO,IAAI,gBAAgB,OAAO;AACrE;AAUA,SAAS,GAAG,GAAG;AACb,SAAO,IAAI,KAAK,CAAC,EAAE,GAAG;AACxB;AAaA,SAAS,IAAI,GAAG,GAAG;AACjB,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAC1B;AAUA,SAASG,MAAK,GAAG;AACf,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAC1B;AAUA,SAASD,OAAM,GAAG;AAChB,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI,EAAE;AAC3B;AASA,SAAS,MAAM;AACb,SAAO,SAAS,MAAM,WAAW,EAAE;AACrC;AASA,SAAS,MAAM;AACb,SAAO,SAAS,MAAM,WAAW,CAAC;AACpC;AAWA,SAAS,IAAI,GAAG,GAAG;AACjB,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAC1B;AAWA,SAAS,IAAI,GAAG,GAAG;AACjB,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAC1B;AAWA,SAAS,IAAI,GAAG,GAAG;AACjB,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAC1B;AAWA,SAAS,OAAO,IAAI;AAClB,MAAI,GAAG,GAAG,GAAG,GACX,IAAI,GACJ,IAAI,IAAI,KAAK,CAAC,GACd,KAAK,CAAC;AAER,MAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,MACxB,YAAW,IAAI,GAAG,UAAU;AAEjC,MAAI,KAAK,KAAK,KAAK,QAAQ;AAE3B,MAAI,CAAC,KAAK,QAAQ;AAChB,WAAO,IAAI,IAAI,IAAG,GAAG,IAAI,KAAK,OAAO,IAAI,MAAM;AAAA,EAGjD,WAAW,OAAO,iBAAiB;AACjC,QAAI,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC;AAE7C,WAAO,IAAI,KAAI;AACb,UAAI,EAAE,CAAC;AAIP,UAAI,KAAK,OAAQ;AACf,UAAE,CAAC,IAAI,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC;AAAA,MACrD,OAAO;AAIL,WAAG,GAAG,IAAI,IAAI;AAAA,MAChB;AAAA,IACF;AAAA,EAGF,WAAW,OAAO,aAAa;AAG7B,QAAI,OAAO,YAAY,KAAK,CAAC;AAE7B,WAAO,IAAI,KAAI;AAGb,UAAI,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,MAAM,EAAE,IAAI,CAAC,KAAK,QAAQ,EAAE,IAAI,CAAC,IAAI,QAAS;AAGtE,UAAI,KAAK,OAAQ;AACf,eAAO,YAAY,CAAC,EAAE,KAAK,GAAG,CAAC;AAAA,MACjC,OAAO;AAIL,WAAG,KAAK,IAAI,GAAG;AACf,aAAK;AAAA,MACP;AAAA,IACF;AAEA,QAAI,IAAI;AAAA,EACV,OAAO;AACL,UAAM,MAAM,iBAAiB;AAAA,EAC/B;AAEA,MAAI,GAAG,EAAE,CAAC;AACV,QAAM;AAGN,MAAI,KAAK,IAAI;AACX,QAAI,QAAQ,IAAI,WAAW,EAAE;AAC7B,OAAG,CAAC,KAAK,IAAI,IAAI,KAAK;AAAA,EACxB;AAGA,SAAO,GAAG,CAAC,MAAM,GAAG,IAAK,IAAG,IAAI;AAGhC,MAAI,IAAI,GAAG;AACT,QAAI;AACJ,SAAK,CAAC,CAAC;AAAA,EACT,OAAO;AACL,QAAI;AAGJ,WAAO,GAAG,CAAC,MAAM,GAAG,KAAK,SAAU,IAAG,MAAM;AAG5C,SAAK,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,KAAK,GAAI;AAGzC,QAAI,IAAI,SAAU,MAAK,WAAW;AAAA,EACpC;AAEA,IAAE,IAAI;AACN,IAAE,IAAI;AAEN,SAAO;AACT;AAWA,SAAS,MAAM,GAAG;AAChB,SAAO,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,KAAK,QAAQ;AACzD;AAcA,SAAST,MAAK,GAAG;AACf,MAAI,IAAI,KAAK,CAAC;AACd,SAAO,EAAE,IAAK,EAAE,EAAE,CAAC,IAAI,EAAE,IAAI,IAAI,EAAE,IAAK,EAAE,KAAK;AACjD;AAUA,SAAS,IAAI,GAAG;AACd,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI;AACzB;AAUA,SAAS,KAAK,GAAG;AACf,SAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAC1B;AAUA,SAAS,KAAK,GAAG;AACf,SAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAC1B;AAWA,SAAS,IAAI,GAAG,GAAG;AACjB,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAC1B;AAYA,SAAS,MAAM;AACb,MAAI,IAAI,GACN,OAAO,WACP,IAAI,IAAI,KAAK,KAAK,CAAC,CAAC;AAEtB,aAAW;AACX,SAAO,EAAE,KAAK,EAAE,IAAI,KAAK,SAAS,KAAI,EAAE,KAAK,KAAK,CAAC,CAAC;AACpD,aAAW;AAEX,SAAO,SAAS,GAAG,KAAK,WAAW,KAAK,QAAQ;AAClD;AAUA,SAAS,IAAI,GAAG;AACd,SAAO,IAAI,KAAK,CAAC,EAAE,IAAI;AACzB;AAUA,SAAS,KAAK,GAAG;AACf,SAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAC1B;AASA,SAAS,MAAM,GAAG;AAChB,SAAO,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC;AAC7C;AAGA,EAAE,uBAAO,IAAI,4BAA4B,CAAC,IAAI,EAAE;AAChD,EAAE,OAAO,WAAW,IAAI;AAGjB,IAAI,UAAU,EAAE,cAAcM,OAAM,QAAQ;AAGnD,OAAO,IAAI,QAAQ,IAAI;AACvB,KAAK,IAAI,QAAQ,EAAE;AAEnB,IAAO,kBAAQ;;;AC/yJf,IAAI,OAAO;AACX,IAAIK,gBAAe,CAAC,OAAO,QAAQ;AAC5B,IAAI,uBAAsC,wBAAQ,MAAMA,eAAc,UAAQ;AACnF,MAAI;AAAA,IACF;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AACJ,MAAIC,aAAY,gBAAQ,MAAM;AAAA,IAC5B,WAAWD,QAAO;AAAA,IAClB,QAAQ,gBAAQ;AAAA,EAClB,CAAC;AACD,EAAAC,WAAU,YAAY,OAAO,OAAOA,WAAU,SAAS;AAKvD,EAAAA,WAAU,UAAU,OAAO;AAC3B,EAAAA,WAAU,UAAU,cAAc;AAQlC,EAAAA,WAAU,UAAU,SAAS,WAAY;AACvC,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,OAAO,KAAK,SAAS;AAAA,IACvB;AAAA,EACF;AAQA,EAAAA,WAAU,WAAW,SAAU,MAAM;AACnC,WAAO,IAAIA,WAAU,KAAK,KAAK;AAAA,EACjC;AACA,MAAI,IAAI;AAEN,OAAG,UAAU,SAAU,MAAM,MAAM;AACjC,UAAI,KAAK,cAAc,KAAK,WAAW;AACrC,QAAAA,WAAU,OAAO;AAAA,UACf,WAAW,KAAK;AAAA,QAClB,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAOA;AACT,GAAG;AAAA,EACD,SAAS;AACX,CAAC;;;ACzBD,IAAMC,QAAO,KAAK,QAAQ,SAAU,GAAG;AACrC,SAAO,KAAK,IAAI,CAAC,IAAI,OAAO,IAAI,KAAK,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,KAAK;AACrE;AAEA,IAAMC,QAAO,KAAK,QAAQ,SAAU,GAAG;AACrC,SAAO,KAAK,IAAI,CAAC,IAAI,OAAO,KAAK,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,KAAK;AACjE;AAQA,IAAM,QAAQ,OAAK;AAEjB,QAAM,IAAI,KAAK,IAAI,MAAM,CAAC;AAC1B,SAAO,KAAK,IAAI;AAClB;AAEA,IAAMC,SAAQ,SAAU,GAAG,GAAG;AAE5B,MAAI,KAAK,IAAI,CAAC;AACd,MAAI,KAAK,IAAI,CAAC;AAGd,MAAI,IAAI,EAAG,EAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AAGzB,MAAI,IAAI,IAAK,QAAO,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC;AAG3C,OAAK;AACL,SAAO,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC;AAChC;AAEA,IAAM,cAAc,WAAY;AAC9B,QAAM,YAAY,eAAe;AACnC;AASA,SAAS,SAAS,GAAG,GAAG;AAEtB,QAAM,KAAK,KAAK,IAAI,CAAC;AACrB,QAAM,KAAK,KAAK,IAAI,CAAC;AAErB,MAAI,MAAM,GAAG;AACX,WAAO,KAAK,IAAI,EAAE;AAAA,EACpB;AAEA,MAAI,MAAM,GAAG;AACX,WAAO,KAAK,IAAI,EAAE;AAAA,EACpB;AAEA,MAAI,KAAK,OAAQ,KAAK,KAAM;AAC1B,WAAO,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI;AAAA,EACnC;AAkCA,MAAI,IAAI;AACR,MAAI,IAAI;AAER,SAAO,MAAM,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK;AAC9C;AAEA,IAAMC,KAAI,EAAE,MAAM,GAAG,MAAM,EAAE;AAC7B,IAAM,QAAQ,SAAU,GAAG,GAAG;AAE5B,QAAM,IAAIA;AAEV,MAAI,MAAM,UAAa,MAAM,MAAM;AACjC,MAAE,IAAI,IACJ,EAAE,IAAI,IAAI;AAAA,EACd,WAAW,MAAM,QAAW;AAC1B,MAAE,IAAI,IAAI;AACV,MAAE,IAAI,IAAI;AAAA,EACZ;AACE,YAAQ,OAAO,GAAG;AAAA,MAEhB,KAAK;AAEH,YAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B,YAAE,IAAI,IAAI,EAAE,IAAI;AAChB,YAAE,IAAI,IAAI,EAAE,IAAI;AAAA,QAClB,WAAW,SAAS,KAAK,SAAS,GAAG;AACnC,cAAI,CAAC,SAAS,EAAE,KAAK,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,GAAG;AAC7C,mBAAO,QAAQ,UAAU;AAAA,UAC3B;AACA,YAAE,IAAI,IAAI,EAAE,KAAK,IAAI,KAAK,IAAI,EAAE,KAAK,CAAC;AACtC,YAAE,IAAI,IAAI,EAAE,KAAK,IAAI,KAAK,IAAI,EAAE,KAAK,CAAC;AAAA,QACxC,WAAW,OAAO,KAAK,SAAS,GAAG;AACjC,cAAI,CAAC,SAAS,EAAE,GAAG,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,GAAG;AAC3C,mBAAO,QAAQ,UAAU;AAAA,UAC3B;AACA,YAAE,IAAI,IAAI,EAAE,GAAG,IAAI,KAAK,IAAI,EAAE,KAAK,CAAC;AACpC,YAAE,IAAI,IAAI,EAAE,GAAG,IAAI,KAAK,IAAI,EAAE,KAAK,CAAC;AAAA,QACtC,WAAW,EAAE,WAAW,GAAG;AACzB,YAAE,IAAI,IAAI,EAAE,CAAC;AACb,YAAE,IAAI,IAAI,EAAE,CAAC;AAAA,QACf,OAAO;AACL,sBAAY;AAAA,QACd;AACA;AAAA,MAEF,KAAK;AAEH,UAAE,IAAI;AAAA,QACJ,EAAE,IAAI,IAAI;AAEZ,cAAM,SAAS,EAAE,QAAQ,MAAM,EAAE,EAC9B,MAAM,uCAAuC;AAChD,YAAI,OAAO;AACX,YAAI,QAAQ;AAEZ,YAAI,WAAW,MAAM;AACnB,sBAAY;AAAA,QACd;AAEA,iBAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AAEtC,gBAAM,IAAI,OAAO,CAAC;AAElB,cAAI,MAAM,OAAO,MAAM,OAAQ,MAAM,MAAM;AAAA,UAE3C,WAAW,MAAM,KAAK;AACpB;AAAA,UACF,WAAW,MAAM,KAAK;AACpB;AAAA,UACF,WAAW,MAAM,OAAO,MAAM,KAAK;AAEjC,gBAAI,OAAO,UAAU,GAAG;AACtB,0BAAY;AAAA,YACd;AAEA,gBAAI,OAAO,IAAI,CAAC,MAAM,OAAO,CAAC,MAAM,OAAO,IAAI,CAAC,CAAC,GAAG;AAClD,gBAAE,IAAI,KAAK,YAAY,QAAQ,IAAI,MAAM,MAAM,OAAO,IAAI,CAAC,CAAC;AAC5D;AAAA,YACF,OAAO;AACL,gBAAE,IAAI,KAAK,YAAY,QAAQ,IAAI,MAAM,MAAM,GAAG;AAAA,YACpD;AACA,mBAAO,QAAQ;AAAA,UAEjB,OAAO;AAEL,gBAAI,OAAO,UAAU,KAAK,MAAM,CAAC,GAAG;AAClC,0BAAY;AAAA,YACd;AAEA,gBAAI,OAAO,IAAI,CAAC,MAAM,OAAO,OAAO,IAAI,CAAC,MAAM,KAAK;AAClD,gBAAE,IAAI,KAAK,YAAY,QAAQ,IAAI,MAAM,MAAM,CAAC;AAChD;AAAA,YACF,OAAO;AACL,gBAAE,IAAI,KAAK,YAAY,QAAQ,IAAI,MAAM,MAAM,CAAC;AAAA,YAClD;AACA,mBAAO,QAAQ;AAAA,UACjB;AAAA,QACF;AAGA,YAAI,OAAO,QAAQ,GAAG;AACpB,sBAAY;AAAA,QACd;AACA;AAAA,MAEF,KAAK;AACH,UAAE,IAAI,IAAI;AACV,UAAE,IAAI,IAAI;AACV;AAAA,MAEF;AACE,oBAAY;AAAA,IAChB;AAEF,MAAI,MAAM,EAAE,IAAI,CAAC,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG;AAAA,EAGtC;AAEA,SAAO;AACT;AAMA,SAAS,QAAQ,GAAG,GAAG;AAErB,MAAI,EAAE,gBAAgB,UAAU;AAC9B,WAAO,IAAI,QAAQ,GAAG,CAAC;AAAA,EACzB;AAEA,QAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,OAAK,IAAI,IAAI,EAAE,IAAI;AACnB,OAAK,IAAI,IAAI,EAAE,IAAI;AACrB;AAEA,QAAQ,YAAY;AAAA,EAElB,MAAM;AAAA,EACN,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAON,QAAQ,WAAY;AAElB,UAAMC,OAAMF,OAAM,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAExC,WAAO,IAAI;AAAA,MACT,KAAK,IAAI,IAAIE;AAAA,MACb,KAAK,IAAI,IAAIA;AAAA,IAAG;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,UAAM,SAAS,KAAK,YAAY,EAAE;AAClC,UAAM,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,SAAS,EAAE,IAAI,CAAC;AAEtD,QAAI,UAAU,QAAQ;AAEpB,UAAI,UAAU,QAAQ;AAEpB,eAAO,QAAQ,KAAK;AAAA,MACtB;AAEA,aAAO,QAAQ,UAAU;AAAA,IAC3B;AAEA,WAAO,IAAI;AAAA,MACT,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,MACnB,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,IAAC;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,UAAM,SAAS,KAAK,YAAY,EAAE;AAClC,UAAM,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,SAAS,EAAE,IAAI,CAAC;AAEtD,QAAI,UAAU,QAAQ;AAEpB,UAAI,UAAU,QAAQ;AAEpB,eAAO,QAAQ,KAAK;AAAA,MACtB;AAEA,aAAO,QAAQ,UAAU;AAAA,IAC3B;AAEA,WAAO,IAAI;AAAA,MACT,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,MACnB,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,IAAC;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,UAAM,SAAS,KAAK,YAAY,EAAE;AAClC,UAAM,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,SAAS,EAAE,IAAI,CAAC;AACtD,UAAM,UAAU,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM;AACnD,UAAM,UAAU,EAAE,IAAI,MAAM,KAAK,EAAE,IAAI,MAAM;AAG7C,QAAI,UAAU,WAAW,UAAU,SAAS;AAC1C,aAAO,QAAQ,KAAK;AAAA,IACtB;AAGA,QAAI,UAAU,QAAQ;AACpB,aAAO,QAAQ,UAAU;AAAA,IAC3B;AAGA,QAAI,EAAE,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM,GAAG;AACrC,aAAO,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,IAAI,GAAG,CAAC;AAAA,IAC5C;AAEA,WAAO,IAAI;AAAA,MACT,KAAK,IAAI,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,MAC1C,KAAK,IAAI,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,IAAC;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,UAAM,SAAS,KAAK,YAAY,EAAE;AAClC,UAAM,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,SAAS,EAAE,IAAI,CAAC;AACtD,UAAM,UAAU,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM;AACnD,UAAM,UAAU,EAAE,IAAI,MAAM,KAAK,EAAE,IAAI,MAAM;AAG7C,QAAI,WAAW,WAAW,UAAU,QAAQ;AAC1C,aAAO,QAAQ,KAAK;AAAA,IACtB;AAGA,QAAI,WAAW,QAAQ;AACrB,aAAO,QAAQ,UAAU;AAAA,IAC3B;AAGA,QAAI,WAAW,QAAQ;AACrB,aAAO,QAAQ,MAAM;AAAA,IACvB;AAEA,QAAI,MAAM,EAAE,IAAI,GAAG;AAEjB,aAAO,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,IAAI,GAAG,KAAK,IAAI,IAAI,EAAE,IAAI,CAAC;AAAA,IAC/D;AAEA,QAAI,KAAK,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,GAAG;AAEzC,YAAM,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI;AAC1B,YAAM,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,IAAI;AAE9B,aAAO,IAAI;AAAA,SACR,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK;AAAA,SAC/B,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK;AAAA,MAAC;AAAA,IAErC,OAAO;AAEL,YAAM,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI;AAC1B,YAAM,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,IAAI;AAE9B,aAAO,IAAI;AAAA,SACR,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK;AAAA,SAC/B,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK;AAAA,MAAC;AAAA,IACrC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,UAAM,UAAU,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM;AACnD,UAAM,UAAU,EAAE,IAAI,MAAM,KAAK,EAAE,IAAI,MAAM;AAE7C,QAAI,SAAS;AACX,aAAO,QAAQ,KAAK;AAAA,IACtB;AAGA,QAAI,EAAE,IAAI,MAAM,GAAG;AAEjB,UAAI,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,IAAI,GAAG;AAEtC,eAAO,IAAI,QAAQ,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC;AAAA,MAErD,WAAW,KAAK,IAAI,MAAM,GAAG;AAE3B,iBAAS,EAAE,IAAI,IAAI,IAAI,KAAK,GAAG;AAAA,UAC7B,KAAK;AACH,mBAAO,IAAI,QAAQ,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC;AAAA,UACrD,KAAK;AACH,mBAAO,IAAI,QAAQ,GAAG,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC,CAAC;AAAA,UACrD,KAAK;AACH,mBAAO,IAAI,QAAQ,CAAC,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC;AAAA,UACtD,KAAK;AACH,mBAAO,IAAI,QAAQ,GAAG,CAAC,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC,CAAC;AAAA,QACxD;AAAA,MACF;AAAA,IACF;AAqBA,QAAI,WAAW,EAAE,IAAI,IAAI,GAAG;AAC1B,aAAO,QAAQ,MAAM;AAAA,IACvB;AAEA,UAAM,MAAM,KAAK,MAAM,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAC7C,UAAM,MAAM,SAAS,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAE3C,QAAIC,MAAK,KAAK,IAAI,EAAE,IAAI,IAAI,MAAM,EAAE,IAAI,IAAI,GAAG;AAC/C,QAAIC,MAAK,EAAE,IAAI,IAAI,MAAM,EAAE,IAAI,IAAI;AACnC,WAAO,IAAI;AAAA,MACTD,MAAK,KAAK,IAAIC,GAAE;AAAA,MAChBD,MAAK,KAAK,IAAIC,GAAE;AAAA,IAAC;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAElB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,QAAI,MAAM,GAAG;AAEX,UAAI,KAAK,GAAG;AACV,eAAO,IAAI,QAAQ,KAAK,KAAK,CAAC,GAAG,CAAC;AAAA,MACpC,OAAO;AACL,eAAO,IAAI,QAAQ,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC;AAAA,MACrC;AAAA,IACF;AAEA,UAAM,IAAIJ,OAAM,GAAG,CAAC;AAEpB,QAAIG,MAAK,KAAK,KAAK,OAAO,IAAI,KAAK,IAAI,CAAC,EAAE;AAC1C,QAAIC,MAAK,KAAK,IAAI,CAAC,KAAK,IAAID;AAE5B,QAAI,KAAK,GAAG;AACV,aAAO,IAAI,QAAQA,KAAI,IAAI,IAAI,CAACC,MAAKA,GAAE;AAAA,IACzC,OAAO;AACL,aAAO,IAAI,QAAQA,KAAI,IAAI,IAAI,CAACD,MAAKA,GAAE;AAAA,IACzC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAEjB,UAAM,KAAK,KAAK,IAAI,KAAK,IAAI,CAAC;AAE9B,QAAI,KAAK,IAAI,MAAM,GAAG;AACpB,aAAO,IAAI,QAAQ,IAAI,CAAC;AAAA,IAC1B;AACA,WAAO,IAAI;AAAA,MACT,KAAK,KAAK,IAAI,KAAK,IAAI,CAAC;AAAA,MACxB,KAAK,KAAK,IAAI,KAAK,IAAI,CAAC;AAAA,IAAC;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,SAAS,WAAY;AAQnB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,WAAO,IAAI;AAAA,MACT,KAAK,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,MAAM,CAAC;AAAA,MACrC,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,IAAC;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAEjB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,QAAI,MAAM,KAAK,IAAI,GAAG;AACpB,aAAO,IAAI,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC;AAAA,IACnC;AAEA,WAAO,IAAI;AAAA,MACT,SAAS,GAAG,CAAC;AAAA,MACb,KAAK,MAAM,GAAG,CAAC;AAAA,IAAC;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAEjB,WAAOH,OAAM,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAEjB,WAAO,KAAK,MAAM,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAKjB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,WAAO,IAAI;AAAA,MACT,KAAK,IAAI,CAAC,IAAIF,MAAK,CAAC;AAAA,MACpB,KAAK,IAAI,CAAC,IAAIC,MAAK,CAAC;AAAA,IAAC;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAKjB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,WAAO,IAAI;AAAA,MACT,KAAK,IAAI,CAAC,IAAID,MAAK,CAAC;AAAA,MACpB,CAAC,KAAK,IAAI,CAAC,IAAIC,MAAK,CAAC;AAAA,IAAC;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAOjB,UAAM,IAAI,IAAI,KAAK,IAAI;AACvB,UAAM,IAAI,IAAI,KAAK,IAAI;AACvB,UAAM,IAAI,KAAK,IAAI,CAAC,IAAID,MAAK,CAAC;AAE9B,WAAO,IAAI;AAAA,MACT,KAAK,IAAI,CAAC,IAAI;AAAA,MACdC,MAAK,CAAC,IAAI;AAAA,IAAC;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAIjB,UAAM,IAAI,IAAI,KAAK,IAAI;AACvB,UAAM,IAAI,IAAI,KAAK,IAAI;AACvB,UAAM,IAAI,KAAK,IAAI,CAAC,IAAID,MAAK,CAAC;AAE9B,WAAO,IAAI;AAAA,MACT,CAAC,KAAK,IAAI,CAAC,IAAI;AAAA,MACfC,MAAK,CAAC,IAAI;AAAA,IAAC;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAIjB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,MAAMD,MAAK,IAAI,CAAC,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC;AAElD,WAAO,IAAI;AAAA,MACT,KAAK,IAAI,CAAC,IAAIA,MAAK,CAAC,IAAI;AAAA,MACxB,KAAK,IAAI,CAAC,IAAIC,MAAK,CAAC,IAAI;AAAA,IAAC;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAIjB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,MAAMD,MAAK,IAAI,CAAC,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC;AAElD,WAAO,IAAI;AAAA,MACT,KAAK,IAAI,CAAC,IAAIA,MAAK,CAAC,IAAI;AAAA,MACxB,CAAC,KAAK,IAAI,CAAC,IAAIC,MAAK,CAAC,IAAI;AAAA,IAAC;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAIlB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,UAAM,KAAK,IAAI;AAAA,MACb,IAAI,IAAI,IAAI,IAAI;AAAA,MAChB,KAAK,IAAI;AAAA,IAAC,EAAE,MAAM,EAAE;AAEtB,UAAM,KAAK,IAAI;AAAA,MACb,GAAG,IAAI,IAAI;AAAA,MACX,GAAG,IAAI,IAAI;AAAA,IAAC,EAAE,KAAK,EAAE;AAEvB,WAAO,IAAI,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAIlB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,UAAM,KAAK,IAAI;AAAA,MACb,IAAI,IAAI,IAAI,IAAI;AAAA,MAChB,KAAK,IAAI;AAAA,IAAC,EAAE,MAAM,EAAE;AAEtB,UAAM,KAAK,IAAI;AAAA,MACb,GAAG,IAAI,IAAI;AAAA,MACX,GAAG,IAAI,IAAI;AAAA,IAAC,EAAE,KAAK,EAAE;AAEvB,WAAO,IAAI,QAAQ,KAAK,KAAK,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAIlB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,QAAI,MAAM,GAAG;AAEX,UAAI,MAAM,GAAG;AACX,eAAO,IAAI,QAAQ,GAAG,QAAQ;AAAA,MAChC;AAEA,UAAI,MAAM,IAAI;AACZ,eAAO,IAAI,QAAQ,GAAG,SAAS;AAAA,MACjC;AAAA,IACF;AAEA,UAAM,IAAI,IAAI,KAAK,IAAM,MAAM,IAAM;AAErC,UAAM,KAAK,IAAI;AAAA,OACZ,IAAI,IAAI,IAAI,IAAI,KAAK;AAAA,MACtB,KAAK,IAAI;AAAA,IAAC,EAAE,IAAI;AAElB,WAAO,IAAI,QAAQ,OAAO,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAIlB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,QAAI,MAAM,GAAG;AACX,aAAO,IAAI,QAAQ,KAAK,MAAM,GAAG,CAAC,GAAG,CAAC;AAAA,IACxC;AAEA,UAAM,IAAI,IAAI,IAAI,IAAI;AACtB,WAAQ,MAAM,IACV,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,CAAC,IAAI;AAAA,IAAC,EAAE,KAAK,IACb,IAAI;AAAA,MACH,MAAM,IAAK,IAAI,IAAI;AAAA,MACnB,MAAM,IAAK,CAAC,IAAI,IAAI;AAAA,IAAC,EAAE,KAAK;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAIlB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,QAAI,MAAM,KAAK,MAAM,GAAG;AACtB,aAAO,IAAI,QAAQ,GAAG,QAAQ;AAAA,IAChC;AAEA,UAAM,IAAI,IAAI,IAAI,IAAI;AACtB,WAAQ,MAAM,IACV,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,CAAC,IAAI;AAAA,IAAC,EAAE,KAAK,IACb,IAAI;AAAA,MACH,MAAM,IAAK,IAAI,IAAI;AAAA,MACnB,MAAM,IAAK,CAAC,IAAI,IAAI;AAAA,IAAC,EAAE,KAAK;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAIlB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,QAAI,MAAM,KAAK,MAAM,GAAG;AACtB,aAAO,IAAI,QAAQ,KAAK,KAAK,GAAG,QAAQ;AAAA,IAC1C;AAEA,UAAM,IAAI,IAAI,IAAI,IAAI;AACtB,WAAQ,MAAM,IACV,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,CAAC,IAAI;AAAA,IAAC,EAAE,KAAK,IACb,IAAI;AAAA,MACH,MAAM,IAAK,IAAI,IAAI;AAAA,MACnB,MAAM,IAAK,CAAC,IAAI,IAAI;AAAA,IAAC,EAAE,KAAK;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAIlB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,WAAO,IAAI;AAAA,MACTA,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,MACpBD,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,IAAC;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAIlB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,WAAO,IAAI;AAAA,MACTA,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,MACpBC,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,IAAC;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAIlB,UAAM,IAAI,IAAI,KAAK,IAAI;AACvB,UAAM,IAAI,IAAI,KAAK,IAAI;AACvB,UAAM,IAAID,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAE9B,WAAO,IAAI;AAAA,MACTC,MAAK,CAAC,IAAI;AAAA,MACV,KAAK,IAAI,CAAC,IAAI;AAAA,IAAC;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAIlB,UAAM,IAAI,IAAI,KAAK,IAAI;AACvB,UAAM,IAAI,IAAI,KAAK,IAAI;AACvB,UAAM,IAAID,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAE9B,WAAO,IAAI;AAAA,MACTC,MAAK,CAAC,IAAI;AAAA,MACV,CAAC,KAAK,IAAI,CAAC,IAAI;AAAA,IAAC;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAIlB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI,IAAI,CAAC,IAAID,MAAK,IAAI,CAAC;AAEtC,WAAO,IAAI;AAAA,MACT,KAAKC,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;AAAA,MAC7B,IAAID,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;AAAA,IAAC;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,WAAY;AAIlB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI,IAAI,CAAC,IAAIA,MAAK,IAAI,CAAC;AAEtC,WAAO,IAAI;AAAA,MACT,IAAIA,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;AAAA,MAC5B,KAAKC,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;AAAA,IAAC;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,WAAY;AAInB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,QAAI,MAAM,GAAG;AAEX,UAAI,MAAM,GAAG;AACX,eAAO,IAAI,QAAQ,GAAG,CAAC;AAAA,MACzB;AAGA,YAAM,IAAI,KAAK,IAAI,CAAC;AACpB,YAAM,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC;AAE3C,aAAO,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC;AAAA,IACtC;AAGA,UAAM,MAAM,IAAI,IAAI,IAAI,IAAI;AAC5B,UAAM,MAAM,IAAI,IAAI;AAEpB,UAAM,IAAI,IAAI,QAAQ,KAAK,GAAG,EAAE,MAAM,EAAE;AAExC,WAAO,IAAI,QAAQ,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,WAAY;AAInB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,QAAI,MAAM,GAAG;AAGX,UAAI,IAAI,GAAG;AAET,eAAO,IAAI;AAAA,UACT,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC;AAAA,UAAG;AAAA,QAAC;AAAA,MACxD;AAEA,UAAI,IAAI,IAAI;AAEV,cAAM,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC;AAC7B,eAAO,IAAI,QAAQ,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,EAAE;AAAA,MAC9C;AAIA,aAAO,IAAI,QAAQ,GAAG,KAAK,KAAK,CAAC,CAAC;AAAA,IACpC;AAEA,UAAM,KAAK,IAAI,QAAQ,IAAI,GAAG,CAAC,EAAE,MAAM,EAAE;AACzC,UAAM,KAAK,IAAI,QAAQ,IAAI,GAAG,CAAC,EAAE,MAAM,EAAE;AAEzC,WAAO,IAAI;AAAA,MACT,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI;AAAA,MAC5C,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI;AAAA,IAC9C,EAAE,KAAK,EAAE;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,WAAY;AAInB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,QAAI,MAAM,GAAG;AAEX,UAAI,MAAM,GAAG;AACX,eAAO,IAAI,QAAQ,GAAG,CAAC;AAAA,MACzB;AAEA,UAAI,MAAM,GAAG;AAEX,eAAO,IAAI,QAAQ,UAAU,CAAC;AAAA,MAChC;AAEA,UAAI,MAAM,IAAI;AAEZ,eAAO,IAAI,QAAQ,WAAW,CAAC;AAAA,MACjC;AAEA,UAAI,KAAK,KAAK,IAAI,GAAG;AAEnB,eAAO,IAAI;AAAA,UACT,MAAM,KAAK,KAAK,IAAI,MAAM,IAAI,EAAE;AAAA,UAChC;AAAA,QACF;AAAA,MACF;AAEA,UAAI,IAAI,GAAG;AAET,cAAMM,MAAK,IAAI,MAAM,IAAI;AACzB,eAAO,IAAI;AAAA,UACT,MAAM,KAAK,IAAIA,EAAC;AAAA,UAChB,CAAC,KAAK,KAAK;AAAA,QACb;AAAA,MACF;AAGA,YAAM,KAAK,IAAI,MAAM,IAAI;AACzB,aAAO,IAAI;AAAA,QACT,MAAM,KAAK,IAAI,CAAC,CAAC;AAAA;AAAA,QACjB,KAAK,KAAK;AAAA,MACZ;AAAA,IACF;AAGA,UAAM,WAAW,IAAI;AACrB,UAAM,UAAU,IAAI;AACpB,UAAM,IAAI,WAAW,WAAW,IAAI;AAEpC,QAAI,MAAM,GAAG;AAGX,aAAO,IAAI;AAAA,QACR,MAAM,KAAO,IAAI,IAAK;AAAA,QACtB,MAAM,IAAM,IAAI,IAAK;AAAA,MACxB;AAAA,IACF;AAGA,UAAM,MAAM,UAAU,WAAW,IAAI,KAAK;AAC1C,UAAM,MAAM,IAAI,WAAW,UAAU,KAAK;AAG1C,WAAO,IAAI;AAAA,MACT,SAAS,IAAI,EAAE,IAAI;AAAA,MACnB,KAAK,MAAM,IAAI,EAAE,IAAI;AAAA,IACvB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,WAAY;AAInB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAGnB,QAAI,MAAM,KAAK,MAAM,GAAG;AACtB,aAAO,IAAI,QAAQ,GAAG,KAAK,KAAK,CAAC;AAAA,IACnC;AAEA,UAAM,IAAI,IAAI,IAAI,IAAI;AAEtB,QAAI,MAAM,GAAG;AAEX,aAAO,IAAI,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE;AAAA,IAC7C;AAGA,WAAO,IAAI;AAAA,MACR,MAAM,IAAK,IAAI,IAAI;AAAA,MACnB,MAAM,IAAK,CAAC,IAAI,IAAI;AAAA,IACvB,EAAE,OAAO,EAAE;AAAA,EACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,WAAY;AAInB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,QAAI,MAAM,GAAG;AAGX,UAAI,MAAM,GAAG;AAEX,eAAO,IAAI,QAAQ,UAAU,CAAC;AAAA,MAChC;AAGA,YAAMC,OAAM,IAAI;AAChB,aAAO,IAAI;AAAA,QACT,KAAK,IAAIA,OAAM,KAAK,KAAKA,OAAMA,OAAM,CAAC,CAAC;AAAA,QACvC;AAAA,MACF;AAAA,IACF;AAEA,UAAM,IAAI,IAAI,IAAI,IAAI;AAEtB,QAAI,MAAM,GAAG;AAEX,aAAO,IAAI,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE;AAAA,IAC7C;AAGA,WAAO,IAAI;AAAA,MACR,MAAM,IAAK,IAAI,IAAI;AAAA,MACnB,MAAM,IAAK,CAAC,IAAI,IAAI;AAAA,IAAC,EAAE,OAAO,EAAE;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,WAAY;AAInB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,QAAI,KAAK,QAAQ,EAAE,GAAG;AAEpB,aAAO,QAAQ,UAAU;AAAA,IAC3B;AAEA,UAAM,IAAI,IAAI,IAAI,IAAI;AAEtB,QAAI,MAAM,GAAG;AAEX,aAAO,IAAI,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE;AAAA,IAC7C;AAGA,WAAO,IAAI;AAAA,MACR,MAAM,IAAK,IAAI,IAAI;AAAA,MACnB,MAAM,IAAK,CAAC,IAAI,IAAI;AAAA,IAAC,EAAE,OAAO,EAAE;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,WAAY;AAGrB,QAAI,KAAK,QAAQ,EAAE,GAAG;AACpB,aAAO,QAAQ,UAAU;AAAA,IAC3B;AAEA,QAAI,KAAK,YAAY,EAAE,GAAG;AACxB,aAAO,QAAQ,MAAM;AAAA,IACvB;AAEA,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,IAAI;AAEnB,UAAM,IAAI,IAAI,IAAI,IAAI;AAEtB,WAAO,IAAI,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,WAAY;AAEvB,WAAO,IAAI,QAAQ,KAAK,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAEjB,WAAO,IAAI,QAAQ,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,SAAU,QAAQ;AAExB,aAAS,KAAK,IAAI,IAAI,UAAU,CAAC;AAEjC,WAAO,IAAI;AAAA,MACT,KAAK,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,MACjC,KAAK,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,IAAM;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,SAAU,QAAQ;AAEzB,aAAS,KAAK,IAAI,IAAI,UAAU,CAAC;AAEjC,WAAO,IAAI;AAAA,MACT,KAAK,MAAM,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,MAClC,KAAK,MAAM,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,IAAM;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,SAAU,QAAQ;AAEzB,aAAS,KAAK,IAAI,IAAI,UAAU,CAAC;AAEjC,WAAO,IAAI;AAAA,MACT,KAAK,MAAM,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,MAClC,KAAK,MAAM,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,IAAM;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,UAAU,SAAU,GAAG,GAAG;AAExB,UAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,WAAO,KAAK,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,QAAQ,SAAS,KACxD,KAAK,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,QAAQ,SAAS;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,WAAY;AAEnB,WAAO,IAAI,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAAY,WAAY;AAEtB,QAAI,IAAI,KAAK,IAAI;AACjB,QAAI,IAAI,KAAK,IAAI;AACjB,QAAI,MAAM;AAEV,QAAI,KAAK,OAAO,EAAE,GAAG;AACnB,aAAO;AAAA,IACT;AAEA,QAAI,KAAK,YAAY,EAAE,GAAG;AACxB,aAAO;AAAA,IACT;AAEA,QAAI,KAAK,IAAI,CAAC,IAAI,QAAQ,SAAS,GAAG;AACpC,UAAI;AAAA,IACN;AAEA,QAAI,KAAK,IAAI,CAAC,IAAI,QAAQ,SAAS,GAAG;AACpC,UAAI;AAAA,IACN;AAGA,QAAI,MAAM,GAAG;AACX,aAAO,MAAM;AAAA,IACf;AAEA,QAAI,MAAM,GAAG;AACX,aAAO;AACP,aAAO;AACP,UAAI,IAAI,GAAG;AACT,YAAI,CAAC;AACL,eAAO;AAAA,MACT,OAAO;AACL,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT,WAAW,IAAI,GAAG;AAChB,UAAI,CAAC;AACL,aAAO;AAAA,IACT;AAEA,QAAI,MAAM,GAAG;AACX,aAAO;AAAA,IACT;AACA,WAAO,MAAM;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAAY,WAAY;AAEtB,WAAO,CAAC,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,WAAY;AAErB,QAAI,KAAK,IAAI,MAAM,GAAG;AACpB,aAAO,KAAK,IAAI;AAAA,IAClB;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,WAAY;AACnB,WAAO,MAAM,KAAK,IAAI,CAAC,KAAK,MAAM,KAAK,IAAI,CAAC;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAU,WAAY;AACpB,WAAO,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,YAAY,WAAY;AACtB,WAAO,SAAS,KAAK,IAAI,CAAC,KAAK,SAAS,KAAK,IAAI,CAAC;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,cAAc,WAAY;AACxB,WAAO,CAAC,KAAK,UAAU,EAAE;AAAA,EAC3B;AACF;AAEA,QAAQ,MAAM,IAAI,IAAI,QAAQ,GAAG,CAAC;AAClC,QAAQ,KAAK,IAAI,IAAI,QAAQ,GAAG,CAAC;AACjC,QAAQ,GAAG,IAAI,IAAI,QAAQ,GAAG,CAAC;AAC/B,QAAQ,IAAI,IAAI,IAAI,QAAQ,KAAK,IAAI,CAAC;AACtC,QAAQ,GAAG,IAAI,IAAI,QAAQ,KAAK,GAAG,CAAC;AACpC,QAAQ,UAAU,IAAI,IAAI,QAAQ,UAAU,QAAQ;AACpD,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,GAAG;AACrC,QAAQ,SAAS,IAAI;;;AC17CrB,IAAIC,QAAO;AACX,IAAIC,gBAAe,CAAC;AACb,IAAI,qBAAoC,wBAAQD,OAAMC,eAAc,MAAM;AAI/E,SAAO,eAAe,SAAS,QAAQ;AAAA,IACrC,OAAO;AAAA,EACT,CAAC;AACD,UAAQ,UAAU,cAAc;AAChC,UAAQ,UAAU,OAAO;AACzB,UAAQ,UAAU,YAAY;AAO9B,UAAQ,UAAU,SAAS,WAAY;AACrC,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,IAAI,KAAK;AAAA,MACT,IAAI,KAAK;AAAA,IACX;AAAA,EACF;AAOA,UAAQ,UAAU,UAAU,WAAY;AACtC,WAAO;AAAA,MACL,GAAG,KAAK,IAAI;AAAA,MACZ,KAAK,KAAK,IAAI;AAAA,IAChB;AAAA,EACF;AAWA,UAAQ,UAAU,SAAS,SAAU,SAAS;AAC5C,QAAI,MAAM;AACV,QAAIC,MAAK,KAAK;AACd,QAAIC,MAAK,KAAK;AACd,QAAI,QAAQ,OAAO,KAAK,IAAI,OAAO;AACnC,QAAI,QAAQ,OAAO,KAAK,IAAI,OAAO;AAGnC,QAAI,YAAY,SAAS,OAAO,IAAI,UAAU,UAAU,QAAQ,YAAY;AAC5E,QAAI,cAAc,MAAM;AACtB,UAAI,UAAU,KAAK,IAAI,IAAI,CAAC,SAAS;AACrC,UAAI,KAAK,IAAIA,MAAKD,GAAE,IAAI,SAAS;AAC/B,QAAAC,MAAK;AAAA,MACP;AACA,UAAI,KAAK,IAAID,MAAKC,GAAE,IAAI,SAAS;AAC/B,QAAAD,MAAK;AAAA,MACP;AAAA,IACF;AACA,QAAIA,QAAO,GAAG;AAEZ,YAAM;AAAA,IACR,WAAWC,QAAO,GAAG;AAEnB,UAAID,QAAO,GAAG;AACZ,cAAM;AAAA,MACR,WAAWA,QAAO,IAAI;AACpB,cAAM;AAAA,MACR,OAAO;AACL,cAAM,QAAQ;AAAA,MAChB;AAAA,IACF,OAAO;AAEL,UAAIA,MAAK,GAAG;AACV,YAAIA,QAAO,IAAI;AACb,gBAAM,QAAQ;AAAA,QAChB,OAAO;AACL,gBAAM,QAAQ,QAAQ,MAAM,UAAU,CAAC,IAAI;AAAA,QAC7C;AAAA,MACF,OAAO;AACL,YAAIA,QAAO,GAAG;AACZ,gBAAM,QAAQ;AAAA,QAChB,OAAO;AACL,gBAAM,QAAQ,QAAQ,QAAQ;AAAA,QAChC;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAaA,UAAQ,YAAY,SAAU,MAAM;AAClC,YAAQ,UAAU,QAAQ;AAAA,MACxB,KAAK,GACH;AACE,YAAI,MAAM,UAAU,CAAC;AACrB,YAAI,OAAO,QAAQ,UAAU;AAC3B,iBAAO,QAAQ,GAAG;AAAA,QACpB,OAAO;AACL,gBAAM,IAAI,UAAU,gDAAgD;AAAA,QACtE;AAAA,MACF;AAAA,MACF,KAAK,GACH;AACE,YAAI,IAAI,UAAU,CAAC;AACnB,YAAI,MAAM,UAAU,CAAC;AACrB,YAAI,SAAS,CAAC,GAAG;AACf,cAAI,OAAO,GAAG,KAAK,IAAI,QAAQ,OAAO,GAAG;AAEvC,kBAAM,IAAI,SAAS,KAAK;AAAA,UAC1B;AACA,cAAI,SAAS,GAAG,GAAG;AACjB,mBAAO,IAAI,QAAQ;AAAA,cACjB;AAAA,cACA;AAAA,YACF,CAAC;AAAA,UACH;AACA,gBAAM,IAAI,UAAU,wCAAwC;AAAA,QAC9D,OAAO;AACL,gBAAM,IAAI,UAAU,2BAA2B;AAAA,QACjD;AAAA,MACF;AAAA,MACF;AACE,cAAM,IAAI,YAAY,iDAAiD;AAAA,IAC3E;AAAA,EACF;AACA,UAAQ,UAAU,UAAU,QAAQ,UAAU;AAU9C,UAAQ,WAAW,SAAU,MAAM;AACjC,WAAO,IAAI,QAAQ,IAAI;AAAA,EACzB;AAiBA,UAAQ,UAAU,SAAU,GAAG,GAAG;AAChC,QAAI,EAAE,KAAK,EAAE,IAAI;AACf,aAAO;AAAA,IACT;AACA,QAAI,EAAE,KAAK,EAAE,IAAI;AACf,aAAO;AAAA,IACT;AACA,QAAI,EAAE,KAAK,EAAE,IAAI;AACf,aAAO;AAAA,IACT;AACA,QAAI,EAAE,KAAK,EAAE,IAAI;AACf,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT,GAAG;AAAA,EACD,SAAS;AACX,CAAC;;;ACjKD,IAAI,OAAO,WAAW,YAAa,UAAS,SAAU,GAAG;AAAE,MAAI,MAAM,CAAC,EAAG,OAAM,IAAI,MAAM,EAAE;AAAG,SAAO;AAAG;AAExG,IAAM,SAAS,OAAO,CAAC;AACvB,IAAM,QAAQ,OAAO,CAAC;AACtB,IAAM,QAAQ,OAAO,CAAC;AACtB,IAAM,UAAU,OAAO,CAAC;AACxB,IAAM,SAAS,OAAO,CAAC;AACvB,IAAM,QAAQ,OAAO,EAAE;AACvB,IAAM,cAAc,OAAO,OAAO,gBAAgB;AAKlD,IAAM,gBAAgB;AAGtB,IAAME,KAAI;AAAA,EACR,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AACP;AAEA,SAAS,OAAO,GAAG,GAAG;AAEpB,MAAI;AACF,QAAI,OAAO,CAAC;AAAA,EACd,SAAS,GAAG;AACV,UAAM,iBAAiB;AAAA,EACzB;AACA,SAAO,IAAI;AACb;AAEA,SAAS,OAAO,GAAG;AACjB,SAAO,OAAO,MAAM,WAAW,IAAI,KAAK,MAAM,CAAC;AACjD;AAGA,SAAS,YAAY,GAAG,GAAG;AAEzB,MAAI,MAAM,QAAQ;AAChB,UAAM,eAAe;AAAA,EACvB;AAEA,QAAM,IAAI,OAAO,OAAO,SAAS,SAAS;AAC1C,IAAE,GAAG,IAAI,IAAI,SAAS,CAAC,QAAQ;AAE/B,MAAI,IAAI,SAAS,CAAC,IAAI;AAEtB,QAAM,IAAI,IAAI,GAAG,CAAC;AAElB,IAAE,GAAG,IAAI,IAAI;AACb,IAAE,GAAG,IAAI,IAAI;AACb,SAAO;AACT;AAEA,IAAM,cAAc,CAAC,QAAQ,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,OAAO,QAAQ,SAAS,OAAO,QAAQ,OAAO;AACvH,SAAS,UAAU,GAAG;AAEpB,QAAM,UAAU,uBAAO,OAAO,IAAI;AAClC,MAAI,KAAK,OAAO;AACd,YAAQ,CAAC,IAAI;AACb,WAAO;AAAA,EACT;AAEA,QAAMC,OAAM,CAAC,MAAM;AAAE,YAAQ,CAAC,KAAK,QAAQ,CAAC,KAAK,UAAU;AAAA,EAAO;AAElE,SAAO,IAAI,UAAU,QAAQ;AAAE,IAAAA,KAAI,KAAK;AAAG,SAAK;AAAA,EAAO;AACvD,SAAO,IAAI,YAAY,QAAQ;AAAE,IAAAA,KAAI,OAAO;AAAG,SAAK;AAAA,EAAS;AAC7D,SAAO,IAAI,WAAW,QAAQ;AAAE,IAAAA,KAAI,MAAM;AAAG,SAAK;AAAA,EAAQ;AAI1D,WAAS,KAAK,GAAG,IAAI,QAAQ,QAAQ,IAAI,KAAK,KAAI;AAChD,WAAO,IAAI,MAAM,QAAQ;AAAE,MAAAA,KAAI,CAAC;AAAG,WAAK;AAAA,IAAG;AAC3C,SAAK,YAAY,EAAE;AACnB,SAAM,KAAK,IAAK;AAAA,EAClB;AACA,MAAI,IAAI,MAAO,CAAAA,KAAI,CAAC;AACpB,SAAO;AACT;AAEA,IAAMC,SAAQ,SAAU,IAAI,IAAI;AAE9B,MAAI,IAAI,QAAQ,IAAI,OAAO,IAAI;AAE/B,MAAI,OAAO,UAAa,OAAO,MAAM;AAAA,EAErC,WAAW,OAAO,QAAW;AAE3B,QAAI,OAAO,OAAO,UAAU;AAC1B,UAAI;AAAA,IACN,WAAW,MAAM,EAAE,GAAG;AACpB,YAAM,iBAAiB;AAAA,IACzB,WAAW,KAAK,MAAM,GAAG;AACvB,YAAM,oBAAoB;AAAA,IAC5B,OAAO;AACL,UAAI,OAAO,EAAE;AAAA,IACf;AAEA,QAAI,OAAO,OAAO,UAAU;AAC1B,UAAI;AAAA,IACN,WAAW,MAAM,EAAE,GAAG;AACpB,YAAM,iBAAiB;AAAA,IACzB,WAAW,KAAK,MAAM,GAAG;AACvB,YAAM,oBAAoB;AAAA,IAC5B,OAAO;AACL,UAAI,OAAO,EAAE;AAAA,IACf;AAEA,QAAI,IAAI;AAAA,EAEV,WAAW,OAAO,OAAO,UAAU;AACjC,QAAI,OAAO,MAAM,OAAO,IAAI;AAC1B,UAAI,OAAO,GAAG,GAAG,CAAC;AAClB,UAAI,OAAO,GAAG,GAAG,CAAC;AAClB,UAAI,OAAO;AACT,aAAK,OAAO,GAAG,GAAG,CAAC;AAAA,IACvB,WAAW,KAAK,IAAI;AAClB,UAAI,OAAO,GAAG,CAAC,CAAC;AAChB,UAAI,KAAK;AACP,YAAI,OAAO,GAAG,CAAC,CAAC;AAAA,IACpB,WAAW,OAAO,OAAO,UAAU;AACjC,UAAI;AAAA,IACN,OAAO;AACL,YAAM,iBAAiB;AAAA,IACzB;AACA,QAAI,IAAI;AAAA,EACV,WAAW,OAAO,OAAO,UAAU;AAEjC,QAAI,MAAM,EAAE,GAAG;AACb,YAAM,iBAAiB;AAAA,IACzB;AAEA,QAAI,KAAK,GAAG;AACV,UAAI,CAAC;AACL,WAAK,CAAC;AAAA,IACR;AAEA,QAAI,KAAK,MAAM,GAAG;AAChB,UAAI,OAAO,EAAE;AAAA,IACf,OAAO;AAEL,UAAI,IAAI;AAER,UAAI,IAAI,GAAG,IAAI;AACf,UAAI,IAAI,GAAG,IAAI;AAEf,UAAI,IAAI;AAER,UAAI,MAAM,GAAG;AACX,YAAI,MAAM,KAAK,MAAM,IAAI,KAAK,MAAM,EAAE,CAAC;AACvC,cAAM;AAAA,MACR;AAIA,aAAO,KAAK,KAAK,KAAK,GAAG;AACvB,YAAI,KAAK,IAAI,MAAM,IAAI;AAEvB,YAAI,OAAO,GAAG;AACZ,cAAI,IAAI,KAAK,GAAG;AACd,gBAAI,IAAI;AACR,gBAAI,IAAI;AAAA,UACV,WAAW,IAAI,GAAG;AAChB,gBAAI;AACJ,gBAAI;AAAA,UACN,OAAO;AACL,gBAAI;AACJ,gBAAI;AAAA,UACN;AACA;AAAA,QAEF,OAAO;AAEL,cAAI,KAAK,GAAG;AACV,iBAAK;AACL,iBAAK;AAAA,UACP,OAAO;AACL,iBAAK;AACL,iBAAK;AAAA,UACP;AAEA,cAAI,IAAI,GAAG;AACT,gBAAI;AACJ,gBAAI;AAAA,UACN,OAAO;AACL,gBAAI;AACJ,gBAAI;AAAA,UACN;AAAA,QACF;AAAA,MACF;AACA,UAAI,OAAO,CAAC,IAAI,OAAO,CAAC;AACxB,UAAI,OAAO,CAAC;AAAA,IACd;AAAA,EAEF,WAAW,OAAO,OAAO,UAAU;AAEjC,QAAI,MAAM;AAEV,QAAI,IAAI,QAAQ,IAAI,QAAQ,IAAI,QAAQ,IAAI,OAAO,IAAI;AAEvD,QAAI,QAAQ,GAAG,QAAQ,MAAM,EAAE,EAAE,MAAM,QAAQ;AAE/C,QAAI,UAAU;AACZ,YAAM,iBAAiB;AAEzB,QAAI,MAAM,GAAG,MAAM,KAAK;AACtB,UAAI,CAAC;AACL;AAAA,IACF,WAAW,MAAM,GAAG,MAAM,KAAK;AAC7B;AAAA,IACF;AAEA,QAAI,MAAM,WAAW,MAAM,GAAG;AAC5B,UAAI,OAAO,MAAM,KAAK,GAAG,CAAC;AAAA,IAC5B,WAAW,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,GAAG,MAAM,KAAK;AAEvD,UAAI,MAAM,GAAG,MAAM,KAAK;AACtB,YAAI,OAAO,MAAM,KAAK,GAAG,CAAC;AAAA,MAC5B;AACA;AAGA,UAAI,MAAM,MAAM,MAAM,UAAU,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,KAAK;AACpI,YAAI,OAAO,MAAM,GAAG,GAAG,CAAC;AACxB,YAAI,SAAS,OAAO,MAAM,GAAG,EAAE,MAAM;AACrC;AAAA,MACF;AAGA,UAAI,MAAM,GAAG,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,GAAG,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,KAAK;AAChG,YAAI,OAAO,MAAM,MAAM,CAAC,GAAG,CAAC;AAC5B,YAAI,SAAS,OAAO,MAAM,MAAM,CAAC,EAAE,MAAM,IAAI;AAC7C,eAAO;AAAA,MACT;AAAA,IAEF,WAAW,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,KAAK;AAC3D,UAAI,OAAO,MAAM,GAAG,GAAG,CAAC;AACxB,UAAI,OAAO,MAAM,MAAM,CAAC,GAAG,KAAK;AAChC,aAAO;AAAA,IACT,WAAW,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,KAAK;AAC3D,UAAI,OAAO,MAAM,GAAG,GAAG,CAAC;AACxB,UAAI,OAAO,MAAM,MAAM,CAAC,GAAG,CAAC;AAC5B,UAAI,OAAO,MAAM,MAAM,CAAC,GAAG,KAAK;AAChC,aAAO;AAAA,IACT;AAEA,QAAI,MAAM,UAAU,KAAK;AACvB,UAAI,IAAI;AACR;AAAA,MACE,IAAI,IAAI,IAAI,IAAI,IAAI;AAAA,IACxB,OAAO;AACL,YAAM,iBAAiB;AAAA,IACzB;AAAA,EAEF,WAAW,OAAO,OAAO,UAAU;AACjC,QAAI;AACJ,QAAI;AACJ,QAAI;AAAA,EACN,OAAO;AACL,UAAM,iBAAiB;AAAA,EACzB;AAEA,MAAI,MAAM,QAAQ;AAChB,UAAM,eAAe;AAAA,EACvB;AAEA,EAAAF,GAAE,GAAG,IAAI,IAAI,SAAS,CAAC,QAAQ;AAC/B,EAAAA,GAAE,GAAG,IAAI,IAAI,SAAS,CAAC,IAAI;AAC3B,EAAAA,GAAE,GAAG,IAAI,IAAI,SAAS,CAAC,IAAI;AAC7B;AAEA,SAAS,OAAO,GAAG,GAAG,GAAG;AAEvB,MAAI,IAAI;AACR,SAAO,IAAI,QAAQ,IAAK,IAAI,IAAK,GAAG,MAAM,OAAO;AAE/C,QAAI,IAAI,OAAO;AACb,UAAK,IAAI,IAAK;AAAA,IAChB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,SAAS,GAAG,GAAG;AAEtB,SAAO,IAAI,UAAU,QACnB,KAAK,OAAO;AAAA,EACd;AAEA,SAAO,IAAI,WAAW,QACpB,KAAK,QAAQ;AAAA,EACf;AAEA,MAAI,MAAM;AACR,WAAO;AAOT,MAAI,MAAM,QAAQ;AAClB,MAAI,IAAI;AAER,SAAO,QAAQ,OAAO,KAAK;AACzB,UAAM,MAAM,QAAQ;AAEpB,QAAI,IAAI;AACN,aAAO;AAAA,EACX;AACA,SAAO,OAAO,CAAC;AACjB;AAEA,SAAS,WAAW,GAAG,GAAG,KAAK;AAE7B,MAAI,OAAO;AACX,MAAI,OAAO,OAAO,OAAO,KAAK,CAAC;AAE/B,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAG5B,QAAI,SAAS;AACX,aAAO,OAAO,CAAC;AAEjB,WAAO,OAAO,QAAQ;AACtB,WAAO,OAAO,QAAQ;AAAA,EACxB;AACA,SAAO;AACT;AAEA,SAAS,IAAI,GAAG,GAAG;AAEjB,MAAI,CAAC;AACH,WAAO;AACT,MAAI,CAAC;AACH,WAAO;AAET,SAAO,GAAG;AACR,SAAK;AACL,QAAI,CAAC;AACH,aAAO;AACT,SAAK;AACL,QAAI,CAAC;AACH,aAAO;AAAA,EACX;AACF;AASA,SAAS,SAAS,GAAG,GAAG;AAEtB,EAAAE,OAAM,GAAG,CAAC;AAEV,MAAI,gBAAgB,UAAU;AAC5B,QAAI,IAAIF,GAAE,GAAG,GAAGA,GAAE,GAAG,CAAC;AACtB,SAAK,GAAG,IAAIA,GAAE,GAAG;AACjB,SAAK,GAAG,IAAIA,GAAE,GAAG,IAAI;AACrB,SAAK,GAAG,IAAIA,GAAE,GAAG,IAAI;AAAA,EACvB,OAAO;AACL,WAAO,YAAYA,GAAE,GAAG,IAAIA,GAAE,GAAG,GAAGA,GAAE,GAAG,CAAC;AAAA,EAC5C;AACF;AAEA,IAAM,iBAAiB,WAAY;AAAE,SAAO,IAAI,MAAM,kBAAkB;AAAG;AAC3E,IAAM,mBAAmB,WAAY;AAAE,SAAO,IAAI,MAAM,kBAAkB;AAAG;AAC7E,IAAM,sBAAsB,WAAY;AAAE,SAAO,IAAI,MAAM,4BAA4B;AAAG;AAE1F,SAAS,YAAY;AAAA,EAEnB,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOL,OAAO,WAAY;AAEjB,WAAO,YAAY,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAEjB,WAAO,YAAY,CAAC,KAAK,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,IAAAE,OAAM,GAAG,CAAC;AACV,WAAO;AAAA,MACL,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIF,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,MAC3D,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,IAAAE,OAAM,GAAG,CAAC;AACV,WAAO;AAAA,MACL,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIF,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,MAC3D,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,IAAAE,OAAM,GAAG,CAAC;AACV,WAAO;AAAA,MACL,KAAK,GAAG,IAAIF,GAAE,GAAG,IAAI,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,MACtC,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,IAAAE,OAAM,GAAG,CAAC;AACV,WAAO;AAAA,MACL,KAAK,GAAG,IAAIF,GAAE,GAAG,IAAI,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,MACtC,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,WAAY;AACnB,WAAO,YAAY,KAAK,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,SAAU,GAAG,GAAG;AAErB,QAAI,MAAM,QAAW;AACnB,aAAO,YAAY,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK;AAAA,IAC7D;AAEA,IAAAE,OAAM,GAAG,CAAC;AACV,QAAI,WAAWF,GAAE,GAAG,IAAI,KAAK,GAAG,GAAG;AACjC,YAAM,eAAe;AAAA,IACvB;AAaA,WAAO;AAAA,MACL,KAAK,GAAG,KAAKA,GAAE,GAAG,IAAI,KAAK,GAAG,MAAMA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,MACrDA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,IAAC;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,IAAAE,OAAM,GAAG,CAAC;AAKV,WAAO,YAAY,IAAIF,GAAE,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,IAAIA,GAAE,GAAG,GAAG,KAAK,GAAG,CAAC,GAAGA,GAAE,GAAG,IAAI,KAAK,GAAG,CAAC;AAAA,EACxF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,IAAAE,OAAM,GAAG,CAAC;AAKV,QAAIF,GAAE,GAAG,MAAM,UAAU,KAAK,GAAG,MAAM,QAAQ;AAC7C,aAAO,YAAY,QAAQ,KAAK;AAAA,IAClC;AACA,WAAO,YAAYA,GAAE,GAAG,IAAI,KAAK,GAAG,GAAG,IAAIA,GAAE,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,IAAIA,GAAE,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;AAAA,EACxF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,WAAY;AACrB,WAAO,YAAY,KAAK,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,IAAAE,OAAM,GAAG,CAAC;AAIV,QAAIF,GAAE,GAAG,MAAM,OAAO;AAEpB,UAAIA,GAAE,GAAG,IAAI,QAAQ;AACnB,eAAO,aAAa,KAAK,GAAG,IAAI,KAAK,GAAG,MAAMA,GAAE,GAAG,GAAG,KAAK,GAAG,KAAKA,GAAE,GAAG,CAAC;AAAA,MAC3E,OAAO;AACL,eAAO,aAAa,KAAK,GAAG,IAAI,KAAK,GAAG,MAAMA,GAAE,GAAG,GAAG,KAAK,GAAG,KAAKA,GAAE,GAAG,CAAC;AAAA,MAC3E;AAAA,IACF;AAQA,QAAI,KAAK,GAAG,IAAI,OAAQ,QAAO;AAG/B,QAAI,IAAI,UAAU,KAAK,GAAG,CAAC;AAC3B,QAAI,IAAI,UAAU,KAAK,GAAG,CAAC;AAG3B,QAAI,IAAI;AACR,QAAI,IAAI;AACR,aAAS,KAAK,GAAG;AACf,UAAI,MAAM,IAAK;AACf,UAAI,MAAM,KAAK;AACb,YAAI;AACJ;AAAA,MACF;AACA,QAAE,CAAC,KAAKA,GAAE,GAAG;AAEb,UAAI,EAAE,CAAC,IAAIA,GAAE,GAAG,MAAM,QAAQ;AAC5B,UAAE,CAAC,KAAKA,GAAE,GAAG;AAAA,MACf,MAAO,QAAO;AACd,WAAK,OAAO,CAAC,KAAK,EAAE,CAAC;AAAA,IACvB;AAEA,aAAS,KAAK,GAAG;AACf,UAAI,MAAM,IAAK;AACf,QAAE,CAAC,KAAKA,GAAE,GAAG;AAEb,UAAI,EAAE,CAAC,IAAIA,GAAE,GAAG,MAAM,QAAQ;AAC5B,UAAE,CAAC,KAAKA,GAAE,GAAG;AAAA,MACf,MAAO,QAAO;AACd,WAAK,OAAO,CAAC,KAAK,EAAE,CAAC;AAAA,IACvB;AAEA,QAAIA,GAAE,GAAG,IAAI,QAAQ;AACnB,aAAO,YAAY,GAAG,CAAC;AAAA,IACzB;AACA,WAAO,YAAY,GAAG,CAAC;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,IAAAE,OAAM,GAAG,CAAC;AAEV,QAAI,KAAK,GAAG,KAAK,UAAUF,GAAE,GAAG,KAAK,OAAQ,QAAO;AAEpD,UAAM,YAAY,uBAAO,OAAO,IAAI;AAEpC,UAAM,cAAc,UAAUA,GAAE,GAAG,CAAC;AACpC,UAAM,KAAK,UAAUA,GAAE,GAAG,CAAC;AAE3B,UAAM,gBAAgB,UAAU,KAAK,GAAG,CAAC;AACzC,UAAM,KAAK,UAAU,KAAK,GAAG,CAAC;AAE9B,eAAW,SAAS,IAAI;AACtB,kBAAY,KAAK,KAAK,YAAY,KAAK,KAAK,UAAU,GAAG,KAAK;AAAA,IAChE;AACA,eAAW,SAAS,IAAI;AACtB,oBAAc,KAAK,KAAK,cAAc,KAAK,KAAK,UAAU,GAAG,KAAK;AAAA,IACpE;AAEA,eAAW,SAAS,aAAa;AAC/B,UAAI,UAAU,IAAK;AACnB,gBAAU,KAAK,IAAI;AAAA,IACrB;AACA,eAAW,SAAS,eAAe;AACjC,UAAI,UAAU,IAAK;AACnB,gBAAU,KAAK,IAAI;AAAA,IACrB;AAEA,QAAI,OAAO;AACX,QAAI,OAAO;AAGX,eAAW,SAAS,WAAW;AAE7B,YAAM,eAAe,YAAY,KAAK,KAAK;AAC3C,YAAM,iBAAiB,cAAc,KAAK,KAAK;AAE/C,UAAI,iBAAiB,QAAQ;AAC3B,YAAI,mBAAmB,QAAQ;AAC7B,iBAAO;AAAA,QACT;AACA;AAAA,MACF;AAGA,UAAI,OAAO;AACX,UAAI,OAAO;AAGX,YAAM,WAAW,IAAI,MAAM,IAAI;AAC/B,cAAQ;AACR,cAAQ;AAGR,UAAI,SAAS,QAAQ,SAAS,MAAM;AAClC,eAAO;AACP,eAAO;AAAA,MACT,WAAW,OAAO,SAAS,OAAO,MAAM;AACtC,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,SAAS,QAAQ,SAAS,OAC7B,YAAY,MAAM,IAAI,IACtB;AAAA,EACN;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU,SAAU,GAAG,GAAG;AAExB,IAAAE,OAAM,GAAG,CAAC;AACV,WAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIF,GAAE,GAAG,MAAMA,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,EACtE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,SAAU,GAAG,GAAG;AAEpB,IAAAE,OAAM,GAAG,CAAC;AACV,WAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIF,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,IAAAE,OAAM,GAAG,CAAC;AACV,WAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIF,GAAE,GAAG,KAAKA,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,SAAU,GAAG,GAAG;AAEpB,IAAAE,OAAM,GAAG,CAAC;AACV,WAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIF,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,IAAAE,OAAM,GAAG,CAAC;AACV,WAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIF,GAAE,GAAG,KAAKA,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,WAAW,SAAU,GAAG,GAAG;AAEzB,IAAAE,OAAM,GAAG,CAAC;AACV,QAAI,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIF,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG;AAEnE,YAAQ,SAAS,MAAM,IAAI;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,SAAU,QAAQ;AAExB,aAAS,SAAS,OAAO,UAAU,CAAC;AAEpC,WAAO;AAAA,MAAY,OAAO,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,KACjE,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,UAAU,KAAK,GAAG,KAAK,SAAS,QAAQ;AAAA,MAC1E;AAAA,IAAM;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,SAAU,QAAQ;AAEzB,aAAS,SAAS,OAAO,UAAU,CAAC;AAEpC,WAAO;AAAA,MAAY,OAAO,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,KACjE,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,UAAU,KAAK,GAAG,IAAI,SAAS,QAAQ;AAAA,MACzE;AAAA,IAAM;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,SAAU,QAAQ;AAEzB,aAAS,SAAS,OAAO,UAAU,CAAC;AAiBpC,WAAO;AAAA,MAAY,OAAO,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,IAClE,KAAK,GAAG,MAAM,KAAK,GAAG,KAAK,SAAS,QAAQ,UAAU,SAAS,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,KAAK,KAAK,GAAG,IAAI,QAAQ;AAAA,MACrH;AAAA,IAAM;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,SAAU,GAAG,GAAG;AASzB,IAAAE,OAAM,GAAG,CAAC;AAEV,UAAM,IAAI,KAAK,GAAG,IAAIF,GAAE,GAAG;AAC3B,UAAM,IAAI,KAAK,GAAG,IAAIA,GAAE,GAAG;AAC3B,UAAM,IAAI,IAAI;AAGd,QAAI,IAAI,OAAO,IAAI,CAAC;AACpB,QAAI,IAAI,KAAK,GAAG;AACd;AAAA,IACF;AACA,WAAO,YAAY,KAAK,GAAG,IAAI,IAAIA,GAAE,GAAG,GAAGA,GAAE,GAAG,CAAC;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,SAAU,GAAG,GAAG;AAE3B,IAAAE,OAAM,GAAG,CAAC;AACV,QAAIF,GAAE,GAAG,MAAM,OAAQ,QAAO;AAC9B,WAAQ,KAAK,GAAG,IAAIA,GAAE,GAAG,KAAMA,GAAE,GAAG,IAAI,KAAK,GAAG,OAAO;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,WAAY;AAErB,WAAO,OAAO,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,IAAI,OAAO,KAAK,GAAG,CAAC;AAAA,EAEzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAAY,SAAU,MAAM,IAAI;AAE9B,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,IAAI,KAAK,GAAG;AAEhB,QAAI,SAAS,SAAS,GAAG,CAAC;AAC1B,QAAI,SAAS,WAAW,GAAG,GAAG,MAAM;AAEpC,QAAI,MAAM,KAAK,GAAG,IAAI,SAAS,MAAM;AAGrC,WAAO,OAAO,IAAI,CAAC;AAEnB,SAAK;AACL,SAAK;AAEL,QAAI;AACF,aAAO;AAET,QAAI,QAAQ;AAEV,eAAS,IAAI,QAAQ,OAAM;AACzB,eAAO,OAAO,IAAI,CAAC;AACnB,aAAK;AACL,aAAK;AAAA,MACP;AACA,aAAO;AACP,eAAS,IAAI,QAAQ,OAAM;AACzB,eAAO,OAAO,IAAI,CAAC;AACnB,aAAK;AACL,aAAK;AAAA,MACP;AACA,aAAO;AAAA,IACT,OAAO;AACL,eAAS,IAAI,KAAK,KAAK,OAAM;AAC3B,eAAO,OAAO,IAAI,CAAC;AACnB,aAAK;AACL,aAAK;AAAA,MACP;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAc,SAAU,YAAY,OAAO;AAEzC,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,MAAM,KAAK,GAAG,IAAI,SAAS,MAAM;AAErC,QAAI,MAAM,OAAO;AACf,aAAO;AAAA,IACT,OAAO;AACL,YAAM,QAAQ,OAAO,IAAI,CAAC;AAC1B,UAAI,aAAa,QAAQ,QAAQ;AAC/B,eAAO;AACP,eAAO;AACP,aAAK;AAAA,MACP;AAEA,aAAO;AACP,aAAO;AACP,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,SAAU,YAAY,OAAO;AAEtC,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,MAAM,KAAK,GAAG,IAAI,SAAS,MAAM;AAErC,QAAI,MAAM,OAAO;AACf,aAAO;AAAA,IACT,OAAO;AACL,YAAM,QAAQ,OAAO,IAAI,CAAC;AAC1B,UAAI,aAAa,QAAQ,QAAQ;AAC/B,eAAO;AACP,aAAK;AAAA,MACP;AAEA,aAAO;AACP,aAAO;AACP,aAAO;AACP,aAAO;AACP,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,eAAe,WAAY;AAEzB,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,IAAI,KAAK,GAAG;AAChB,UAAM,MAAM,CAAC;AAEb,WAAO,GAAG;AACR,UAAI,KAAK,OAAO,IAAI,CAAC,CAAC;AACtB,YAAM,IAAI,IAAI;AACd,UAAI;AACJ,UAAI;AAAA,IACN;AACA,WAAO;AAAA,EACT;AAAA,EAEA,YAAY,SAAU,MAAM,MAAM;AAMhC,UAAM,OAAO,OAAO,KAAK,KAAK,IAAI,GAAG,CAAC;AAEtC,UAAM,UAAU,KAAK,KAAK,EAAE;AAC5B,UAAM,OAAO,QAAQ,aAAa,EAAE;AAEpC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAEpC,UAAI,IAAI,YAAY,KAAK,IAAI,CAAC,GAAG,KAAK;AACtC,eAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,YAAI,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AAAA,MACnC;AAEA,UAAI,IAAI,EAAE,KAAK,EAAE,OAAO;AACxB,UAAI,EAAE,GAAG,IAAI,OAAO,EAAE,GAAG,GAAG;AAC1B,eAAO,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC;AAAA,MAC3B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;;;AC7gCA,IAAIG,QAAO;AACX,IAAIC,gBAAe,CAAC;AACb,IAAI,sBAAqC,wBAAQD,OAAMC,eAAc,MAAM;AAIhF,SAAO,eAAe,UAAU,QAAQ;AAAA,IACtC,OAAO;AAAA,EACT,CAAC;AACD,WAAS,UAAU,cAAc;AACjC,WAAS,UAAU,OAAO;AAC1B,WAAS,UAAU,aAAa;AAOhC,WAAS,UAAU,SAAS,WAAY;AACtC,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,GAAG,OAAO,KAAK,IAAI,KAAK,CAAC;AAAA,MACzB,GAAG,OAAO,KAAK,CAAC;AAAA,IAClB;AAAA,EACF;AAQA,WAAS,WAAW,SAAU,MAAM;AAClC,WAAO,IAAI,SAAS,IAAI;AAAA,EAC1B;AACA,SAAO;AACT,GAAG;AAAA,EACD,SAAS;AACX,CAAC;;;ACvCD,IAAIC,QAAO;AACX,IAAIC,gBAAe,CAAC;AACb,IAAI,oBAAmC,wBAAQD,OAAMC,eAAc,MAAM;AAuB9E,WAASC,UAAS;AAChB,QAAI,EAAE,gBAAgBA,UAAS;AAC7B,YAAM,IAAI,YAAY,kDAAkD;AAAA,IAC1E;AAAA,EACF;AAKA,EAAAA,QAAO,UAAU,OAAO;AACxB,EAAAA,QAAO,UAAU,WAAW;AAU5B,EAAAA,QAAO,UAAU,UAAU,WAAY;AAErC,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AAUA,EAAAA,QAAO,UAAU,WAAW,WAAY;AAEtC,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AAOA,EAAAA,QAAO,UAAU,SAAS,SAAU,MAAM,UAAU;AAClD,UAAM,IAAI,MAAM,4CAA4C;AAAA,EAC9D;AAeA,EAAAA,QAAO,UAAU,SAAS,SAAU,OAAO,aAAa,cAAc;AAEpE,UAAM,IAAI,MAAM,4CAA4C;AAAA,EAC9D;AAOA,EAAAA,QAAO,UAAU,MAAM,SAAU,OAAO;AAEtC,UAAM,IAAI,MAAM,yCAAyC;AAAA,EAC3D;AAWA,EAAAA,QAAO,UAAU,MAAM,SAAU,OAAO,OAAO,cAAc;AAE3D,UAAM,IAAI,MAAM,yCAAyC;AAAA,EAC3D;AAcA,EAAAA,QAAO,UAAU,SAAS,SAAUC,OAAM,cAAc;AAEtD,UAAM,IAAI,MAAM,4CAA4C;AAAA,EAC9D;AAWA,EAAAD,QAAO,UAAU,UAAU,SAAUC,OAAM,cAAc;AAEvD,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AAMA,EAAAD,QAAO,UAAU,QAAQ,WAAY;AAEnC,UAAM,IAAI,MAAM,2CAA2C;AAAA,EAC7D;AAMA,EAAAA,QAAO,UAAU,OAAO,WAAY;AAElC,UAAM,IAAI,MAAM,0CAA0C;AAAA,EAC5D;AAYA,EAAAA,QAAO,UAAU,MAAM,SAAU,UAAU,WAAW;AAEpD,UAAM,IAAI,MAAM,yCAAyC;AAAA,EAC3D;AAQA,EAAAA,QAAO,UAAU,UAAU,SAAU,UAAU;AAE7C,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AAMA,EAAAA,QAAO,UAAU,OAAO,QAAQ,IAAI,WAAY;AAE9C,UAAM,IAAI,MAAM,mCAAmC;AAAA,EACrD;AAMA,EAAAA,QAAO,UAAU,UAAU,WAAY;AAErC,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AAMA,EAAAA,QAAO,UAAU,UAAU,WAAY;AAErC,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AAUA,EAAAA,QAAO,UAAU,SAAS,SAAU,SAAS;AAE3C,UAAM,IAAI,MAAM,4CAA4C;AAAA,EAC9D;AAMA,EAAAA,QAAO,UAAU,WAAW,WAAY;AAEtC,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AACA,SAAOA;AACT,GAAG;AAAA,EACD,SAAS;AACX,CAAC;;;ACjPD,IAAAE,kBAAqB;;;ACUrB,SAAS,sBAAsB,GAAG,MAAMC,OAAM;AAC5C,MAAI,gBAAgB,EAAE;AACtB,MAAI,OAAO,IAAI,cAAc,CAAC;AAC9B,MAAI,SAAS;AACb,MAAIA,OAAM;AACR,QAAIA,QAAO,GAAG;AACZ,YAAM,IAAI,MAAM,gCAAgC;AAAA,IAClD;AACA,QAAI,CAAC,UAAUA,KAAI,GAAG;AACpB,YAAM,IAAI,MAAM,yBAAyB;AAAA,IAC3C;AACA,QAAI,EAAE,YAAY,KAAK,IAAIA,QAAO,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,SAAS,KAAK,IAAIA,QAAO,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG;AACtF,YAAM,IAAI,MAAM,8BAA8B,OAAOA,QAAO,GAAG,MAAM,EAAE,OAAOA,QAAO,GAAG,KAAK,CAAC;AAAA,IAChG;AACA,QAAI,CAAC,EAAE,UAAU,GAAG;AAClB,YAAM,IAAI,MAAM,0BAA0B;AAAA,IAC5C;AACA,QAAI,EAAE,SAAS,CAAC,GAAG;AACjB,UAAI,EAAE,IAAI,KAAK,IAAIA,KAAI,CAAC;AAAA,IAC1B;AACA,aAAS,IAAI,OAAOA,KAAI;AAAA,EAC1B;AACA,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,GAAG,OAAO,EAAE,SAAS,CAAC,EAAE,OAAO,MAAM;AAAA,IAC9C,KAAK;AACH,aAAO,GAAG,OAAO,EAAE,QAAQ,CAAC,EAAE,OAAO,MAAM;AAAA,IAC7C,KAAK;AACH,aAAO,GAAG,OAAO,EAAE,cAAc,CAAC,EAAE,OAAO,MAAM;AAAA,IACnD;AACE,YAAM,IAAI,MAAM,QAAQ,OAAO,MAAM,iBAAiB,CAAC;AAAA,EAC3D;AACF;AAmFO,SAASC,QAAO,OAAO,SAAS;AACrC,MAAI,OAAO,YAAY,YAAY;AAEjC,WAAO,QAAQ,KAAK;AAAA,EACtB;AAGA,MAAI,CAAC,MAAM,SAAS,GAAG;AACrB,WAAO,MAAM,MAAM,IAAI,QAAQ,MAAM,GAAG,CAAC,IAAI,aAAa;AAAA,EAC5D;AACA,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACA;AAAA,EACF,IAAI,uBAAuB,OAAO;AAGlC,UAAQ,UAAU;AAAA,IAChB,KAAK;AACH,aAAOC,SAAQ,OAAO,SAAS;AAAA,IACjC,KAAK;AACH,aAAOC,eAAc,OAAO,SAAS;AAAA,IACvC,KAAK;AACH,aAAOC,eAAc,OAAO,SAAS;AAAA,IACvC,KAAK;AACH,aAAO,sBAAsB,OAAO,GAAG,QAAQ;AAAA,IACjD,KAAK;AACH,aAAO,sBAAsB,OAAO,GAAG,QAAQ;AAAA,IACjD,KAAK;AACH,aAAO,sBAAsB,OAAO,IAAI,QAAQ;AAAA,IAClD,KAAK,QACH;AAGE,UAAI,WAAWC,oBAAmB,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ,UAAU,EAAE;AACxG,UAAI,WAAWA,oBAAmB,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ,UAAU,CAAC;AAGvG,UAAI,MAAM,OAAO,EAAG,QAAO;AAG3B,UAAI;AACJ,UAAI,UAAU,MAAM,oBAAoB,SAAS;AACjD,UAAIC,OAAM,QAAQ;AAClB,UAAIA,QAAO,YAAYA,OAAM,UAAU;AAErC,cAAM,QAAQ,QAAQ;AAAA,MACxB,OAAO;AAEL,cAAMH,eAAc,OAAO,SAAS;AAAA,MACtC;AAGA,aAAO,IAAI,QAAQ,uBAAuB,WAAY;AACpD,YAAII,UAAS,UAAU,CAAC;AACxB,YAAI,IAAI,UAAU,CAAC;AACnB,eAAOA,YAAW,MAAMA,UAAS,IAAI;AAAA,MACvC,CAAC;AAAA,IACH;AAAA,IACF;AACE,YAAM,IAAI,MAAM,uBAAuB,WAAW,kEAAuE;AAAA,EAC7H;AACF;AAOO,SAASH,eAAc,OAAO,WAAW;AAE9C,MAAI,IAAI,MAAM;AACd,MAAI,SAAS,IAAI,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAG/D,MAAI,kBAAkB,MAAM,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC;AACrD,MAAI,WAAW,gBAAgB,YAAY,SAAS;AACpD,MAAI,SAAS,SAAS,GAAG,GAAG;AAC1B,QAAII,aAAY,MAAM;AACtB,eAAW,IAAIA,WAAU,QAAQ,EAAE,QAAQ;AAAA,EAC7C;AACA,SAAO,WAAW,OAAO,KAAK,IAAI,MAAM,MAAM,OAAO,SAAS;AAChE;AAUO,SAASL,eAAc,OAAO,WAAW;AAC9C,MAAI,cAAc,QAAW;AAC3B,WAAO,MAAM,cAAc,YAAY,CAAC;AAAA,EAC1C,OAAO;AACL,WAAO,MAAM,cAAc;AAAA,EAC7B;AACF;AAQO,SAASD,SAAQ,OAAO,WAAW;AACxC,SAAO,MAAM,QAAQ,SAAS;AAChC;AACA,SAASG,oBAAmB,OAAO,cAAc;AAC/C,MAAI,SAAS,KAAK,GAAG;AACnB,WAAO;AAAA,EACT,WAAW,YAAY,KAAK,GAAG;AAC7B,WAAO,MAAM,SAAS;AAAA,EACxB,OAAO;AACL,WAAO;AAAA,EACT;AACF;;;AC7LO,SAASI,QAAO,OAAO,SAAS;AACrC,MAAI,SAAS,QAAQ,OAAO,OAAO;AACnC,MAAI,WAAW,OAAO,YAAY,YAAY,cAAc,WAAW,OAAO,SAAS,QAAQ,UAAU;AACvG,WAAO,OAAO,UAAU,GAAG,QAAQ,WAAW,CAAC,IAAI;AAAA,EACrD;AACA,SAAO;AACT;AACA,SAAS,QAAQ,OAAO,SAAS;AAC/B,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,OAAa,OAAO,OAAO;AAAA,EACpC;AACA,MAAI,YAAY,KAAK,GAAG;AACtB,WAAOA,QAAgB,OAAO,OAAO;AAAA,EACvC;AAIA,MAAI,kBAAkB,KAAK,GAAG;AAC5B,QAAI,CAAC,WAAW,QAAQ,aAAa,WAAW;AAE9C,aAAO,GAAG,OAAO,MAAM,IAAI,MAAM,GAAG,GAAG,EAAE,OAAO,MAAM,CAAC;AAAA,IACzD,OAAO;AAEL,aAAO,MAAM,SAAS;AAAA,IACxB;AAAA,EACF;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO,YAAY,OAAO,OAAO;AAAA,EACnC;AACA,MAAI,SAAS,KAAK,GAAG;AACnB,WAAO,UAAU,KAAK;AAAA,EACxB;AACA,MAAI,OAAO,UAAU,YAAY;AAC/B,WAAO,MAAM,SAAS,OAAO,MAAM,MAAM,IAAI;AAAA,EAC/C;AACA,MAAI,SAAS,OAAO,UAAU,UAAU;AACtC,QAAI,OAAO,MAAM,WAAW,YAAY;AACtC,aAAO,MAAM,OAAO,OAAO;AAAA,IAC7B,WAAW,SAAS,MAAM,SAAS,OAAO,MAAM,CAAC,EAAE,SAAS,GAAG;AAE7D,aAAO,MAAM,SAAS,OAAO;AAAA,IAC/B,OAAO;AACL,UAAI,UAAU,OAAO,KAAK,KAAK,EAAE,IAAI,SAAO;AAC1C,eAAO,UAAU,GAAG,IAAI,OAAOA,QAAO,MAAM,GAAG,GAAG,OAAO;AAAA,MAC3D,CAAC;AACD,aAAO,MAAM,QAAQ,KAAK,IAAI,IAAI;AAAA,IACpC;AAAA,EACF;AACA,SAAO,OAAO,KAAK;AACrB;AAQO,SAAS,UAAU,OAAO;AAC/B,MAAI,OAAO,OAAO,KAAK;AACvB,MAAI,UAAU;AACd,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,QAAQ;AACtB,QAAI,IAAI,KAAK,OAAO,CAAC;AACrB,eAAW,KAAK,oBAAoB,kBAAkB,CAAC,IAAI;AAC3D;AAAA,EACF;AACA,SAAO,MAAM,UAAU;AACzB;AACA,IAAI,oBAAoB;AAAA,EACtB,KAAK;AAAA,EACL,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAM;AACR;AAuBA,SAAS,YAAY,OAAO,SAAS;AACnC,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,QAAI,MAAM;AACV,QAAI,MAAM,MAAM;AAChB,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,UAAI,MAAM,GAAG;AACX,eAAO;AAAA,MACT;AACA,aAAO,YAAY,MAAM,CAAC,GAAG,OAAO;AAAA,IACtC;AACA,WAAO;AACP,WAAO;AAAA,EACT,OAAO;AACL,WAAOC,QAAO,OAAO,OAAO;AAAA,EAC9B;AACF;AAOA,SAAS,kBAAkB,OAAO;AAChC,SAAO,SAAS,OAAO,UAAU,YAAY,OAAO,MAAM,MAAM,YAAY,OAAO,MAAM,MAAM,YAAY,OAAO,MAAM,MAAM,YAAY;AAC5I;;;ACvKO,SAAS,eAAe,QAAQ,UAAU,UAAU;AACzD,MAAI,EAAE,gBAAgB,iBAAiB;AACrC,UAAM,IAAI,YAAY,kDAAkD;AAAA,EAC1E;AACA,OAAK,SAAS;AACd,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,UAAU,0BAA0B,MAAM,QAAQ,MAAM,IAAI,MAAM,OAAO,KAAK,IAAI,IAAI,MAAM,UAAU,OAAO,KAAK,YAAY,QAAQ,OAAO,MAAM,QAAQ,QAAQ,IAAI,MAAM,SAAS,KAAK,IAAI,IAAI,MAAM,YAAY;AAC1N,OAAK,QAAQ,IAAI,MAAM,EAAE;AAC3B;AACA,eAAe,YAAY,IAAI,WAAW;AAC1C,eAAe,UAAU,cAAc;AACvC,eAAe,UAAU,OAAO;AAChC,eAAe,UAAU,mBAAmB;;;ACZrC,SAAS,WAAW,OAAOC,MAAKC,MAAK;AAC1C,MAAI,EAAE,gBAAgB,aAAa;AACjC,UAAM,IAAI,YAAY,kDAAkD;AAAA,EAC1E;AACA,OAAK,QAAQ;AACb,MAAI,UAAU,SAAS,GAAG;AACxB,SAAK,MAAM;AACX,SAAK,MAAMD;AAAA,EACb,OAAO;AACL,SAAK,MAAMA;AACX,SAAK,MAAMC;AAAA,EACb;AACA,MAAI,KAAK,QAAQ,UAAa,KAAK,QAAQ,KAAK,KAAK;AACnD,SAAK,UAAU,yBAAyB,KAAK,QAAQ,QAAQ,KAAK,MAAM;AAAA,EAC1E,WAAW,KAAK,QAAQ,UAAa,KAAK,SAAS,KAAK,KAAK;AAC3D,SAAK,UAAU,yBAAyB,KAAK,QAAQ,SAAS,KAAK,MAAM,KAAK;AAAA,EAChF,OAAO;AACL,SAAK,UAAU,yBAAyB,KAAK,QAAQ;AAAA,EACvD;AACA,OAAK,QAAQ,IAAI,MAAM,EAAE;AAC3B;AACA,WAAW,YAAY,IAAI,WAAW;AACtC,WAAW,UAAU,cAAc;AACnC,WAAW,UAAU,OAAO;AAC5B,WAAW,UAAU,eAAe;;;AJnB7B,SAAS,UAAU,GAAG;AAC3B,MAAI,IAAI,CAAC;AACT,SAAO,MAAM,QAAQ,CAAC,GAAG;AACvB,MAAE,KAAK,EAAE,MAAM;AACf,QAAI,EAAE,CAAC;AAAA,EACT;AACA,SAAO;AACT;AAWA,SAAS,UAAU,OAAOC,OAAM,KAAK;AACnC,MAAI;AACJ,MAAI,MAAM,MAAM;AAChB,MAAI,QAAQA,MAAK,GAAG,GAAG;AACrB,UAAM,IAAI,eAAe,KAAKA,MAAK,GAAG,CAAC;AAAA,EACzC;AACA,MAAI,MAAMA,MAAK,SAAS,GAAG;AAEzB,QAAI,UAAU,MAAM;AACpB,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK;AACxB,UAAI,QAAQ,MAAM,CAAC;AACnB,UAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,cAAM,IAAI,eAAeA,MAAK,SAAS,GAAGA,MAAK,QAAQ,GAAG;AAAA,MAC5D;AACA,gBAAU,MAAM,CAAC,GAAGA,OAAM,OAAO;AAAA,IACnC;AAAA,EACF,OAAO;AAEL,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK;AACxB,UAAI,MAAM,QAAQ,MAAM,CAAC,CAAC,GAAG;AAC3B,cAAM,IAAI,eAAeA,MAAK,SAAS,GAAGA,MAAK,QAAQ,GAAG;AAAA,MAC5D;AAAA,IACF;AAAA,EACF;AACF;AASO,SAAS,SAAS,OAAOA,OAAM;AACpC,MAAI,WAAWA,MAAK,WAAW;AAC/B,MAAI,UAAU;AAEZ,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,YAAM,IAAI,eAAe,MAAM,QAAQ,CAAC;AAAA,IAC1C;AAAA,EACF,OAAO;AAEL,cAAU,OAAOA,OAAM,CAAC;AAAA,EAC1B;AACF;AAyBO,SAAS,cAAc,OAAO,QAAQ;AAC3C,MAAI,UAAU,QAAW;AACvB,QAAI,CAAC,SAAS,KAAK,KAAK,CAAC,UAAU,KAAK,GAAG;AACzC,YAAM,IAAI,UAAU,sCAAsC,QAAQ,GAAG;AAAA,IACvE;AACA,QAAI,QAAQ,KAAK,OAAO,WAAW,YAAY,SAAS,QAAQ;AAC9D,YAAM,IAAI,WAAW,OAAO,MAAM;AAAA,IACpC;AAAA,EACF;AACF;AAoCO,SAAS,OAAO,OAAOC,OAAM,cAAc;AAEhD,MAAI,CAAC,MAAM,QAAQA,KAAI,GAAG;AACxB,UAAM,IAAI,UAAU,gBAAgB;AAAA,EACtC;AACA,MAAIA,MAAK,WAAW,GAAG;AACrB,UAAM,IAAI,MAAM,qCAAqC;AAAA,EACvD;AAGA,EAAAA,MAAK,QAAQ,SAAU,OAAO;AAC5B,QAAI,CAAC,SAAS,KAAK,KAAK,CAAC,UAAU,KAAK,KAAK,QAAQ,GAAG;AACtD,YAAM,IAAI,UAAU,yDAA8DC,QAAOD,KAAI,IAAI,GAAG;AAAA,IACtG;AAAA,EACF,CAAC;AAGD,MAAI,SAAS,KAAK,KAAK,YAAY,KAAK,GAAG;AACzC,YAAQ,CAAC,KAAK;AAAA,EAChB;AAGA,MAAI,gBAAgB,iBAAiB,SAAY,eAAe;AAChE,UAAQ,OAAOA,OAAM,GAAG,aAAa;AACrC,SAAO;AACT;AAWA,SAAS,QAAQ,OAAOA,OAAM,KAAK,cAAc;AAC/C,MAAI;AACJ,MAAI;AACJ,MAAI,SAAS,MAAM;AACnB,MAAI,SAASA,MAAK,GAAG;AACrB,MAAI,SAAS,KAAK,IAAI,QAAQ,MAAM;AAGpC,QAAM,SAAS;AACf,MAAI,MAAMA,MAAK,SAAS,GAAG;AAEzB,QAAI,UAAU,MAAM;AAGpB,SAAK,IAAI,GAAG,IAAI,QAAQ,KAAK;AAE3B,aAAO,MAAM,CAAC;AACd,UAAI,CAAC,MAAM,QAAQ,IAAI,GAAG;AACxB,eAAO,CAAC,IAAI;AACZ,cAAM,CAAC,IAAI;AAAA,MACb;AACA,cAAQ,MAAMA,OAAM,SAAS,YAAY;AAAA,IAC3C;AAGA,SAAK,IAAI,QAAQ,IAAI,QAAQ,KAAK;AAEhC,aAAO,CAAC;AACR,YAAM,CAAC,IAAI;AAGX,cAAQ,MAAMA,OAAM,SAAS,YAAY;AAAA,IAC3C;AAAA,EACF,OAAO;AAIL,SAAK,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC3B,aAAO,MAAM,QAAQ,MAAM,CAAC,CAAC,GAAG;AAC9B,cAAM,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC;AAAA,MACvB;AAAA,IACF;AAGA,SAAK,IAAI,QAAQ,IAAI,QAAQ,KAAK;AAChC,YAAM,CAAC,IAAI;AAAA,IACb;AAAA,EACF;AACF;AAYO,SAAS,QAAQ,OAAO,OAAO;AACpC,MAAI,YAAY,QAAQ,OAAO,IAAI;AACnC,MAAI,gBAAgB,UAAU;AAC9B,MAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,CAAC,MAAM,QAAQ,KAAK,GAAG;AAClD,UAAM,IAAI,UAAU,gBAAgB;AAAA,EACtC;AACA,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,eAAe,GAAG,eAAe,IAAI;AAAA,EACjD;AACA,UAAQ,qBAAqB,OAAO,aAAa;AACjD,MAAI,YAAY,QAAQ,KAAK;AAC7B,MAAI,kBAAkB,WAAW;AAC/B,UAAM,IAAI,eAAe,WAAW,eAAe,IAAI;AAAA,EACzD;AACA,MAAI;AACF,WAAO,SAAS,WAAW,KAAK;AAAA,EAClC,SAAS,GAAG;AACV,QAAI,aAAa,gBAAgB;AAC/B,YAAM,IAAI,eAAe,WAAW,eAAe,IAAI;AAAA,IACzD;AACA,UAAM;AAAA,EACR;AACF;AASO,SAAS,qBAAqB,OAAO,eAAe;AACzD,MAAI,YAAY,QAAQ,KAAK;AAC7B,MAAI,iBAAiB,MAAM,MAAM;AACjC,MAAI,WAAW;AACf,MAAI,gBAAgB,MAAM,QAAQ,QAAQ;AAC1C,MAAI,wBAAwB,MAAM,QAAQ,UAAU,gBAAgB,CAAC,KAAK;AAC1E,MAAI,uBAAuB;AACzB,UAAM,IAAI,MAAM,iCAAiC;AAAA,EACnD;AACA,MAAI,cAAc,iBAAiB;AACnC,MAAI,qBAAqB,gBAAgB,cAAc;AACvD,MAAI,aAAa;AACf,QAAI,oBAAoB;AACtB,qBAAe,aAAa,IAAI,CAAC,gBAAgB;AAAA,IACnD,OAAO;AACL,YAAM,IAAI,MAAM,uCAAuC,gBAAgB,wBAAwB,CAAC,SAAS;AAAA,IAC3G;AAAA,EACF;AACA,SAAO;AACT;AAOA,SAAS,QAAQ,OAAO;AACtB,SAAO,MAAM,OAAO,CAAC,MAAM,SAAS,OAAO,MAAM,CAAC;AACpD;AAUA,SAAS,SAAS,OAAO,OAAO;AAE9B,MAAI,WAAW;AACf,MAAI;AAEJ,WAAS,YAAY,MAAM,SAAS,GAAG,YAAY,GAAG,aAAa;AACjE,QAAIA,QAAO,MAAM,SAAS;AAC1B,gBAAY,CAAC;AAGb,QAAI,SAAS,SAAS,SAASA;AAC/B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,gBAAU,KAAK,SAAS,MAAM,IAAIA,QAAO,IAAI,KAAKA,KAAI,CAAC;AAAA,IACzD;AAEA,eAAW;AAAA,EACb;AACA,SAAO;AACT;AAkEO,SAAS,UAAU,OAAO,MAAM,OAAOE,OAAM;AAClD,MAAI,IAAIA,SAAQ,UAAU,KAAK;AAG/B,MAAI,OAAO;AACT,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,cAAQ,CAAC,KAAK;AACd,QAAE,QAAQ,CAAC;AAAA,IACb;AAAA,EACF;AAGA,UAAQ,WAAW,OAAO,MAAM,CAAC;AACjC,SAAO,EAAE,SAAS,MAAM;AACtB,MAAE,KAAK,CAAC;AAAA,EACV;AACA,SAAO;AACT;AAUA,SAAS,WAAW,OAAO,MAAM,KAAK;AACpC,MAAI,GAAG;AACP,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,QAAI,OAAO,MAAM;AACjB,SAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,IAAI,IAAI,KAAK;AAC1C,YAAM,CAAC,IAAI,WAAW,MAAM,CAAC,GAAG,MAAM,IAAI;AAAA,IAC5C;AAAA,EACF,OAAO;AACL,aAAS,IAAI,KAAK,IAAI,MAAM,KAAK;AAC/B,cAAQ,CAAC,KAAK;AAAA,IAChB;AAAA,EACF;AACA,SAAO;AACT;AAQO,SAAS,QAAQ,OAAO;AAC7B,MAAI,gBAAgB,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACxF,MAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AAEzB,WAAO;AAAA,EACT;AACA,MAAI,OAAO,kBAAkB,WAAW;AACtC,UAAM,IAAI,UAAU,iDAAiD;AAAA,EACvE;AACA,MAAI,OAAO,CAAC;AACZ,MAAI,eAAe;AACjB,wBAAoB,KAAK;AAAA,EAC3B,OAAO;AACL,aAAS,KAAK;AAAA,EAChB;AACA,SAAO;AACP,WAAS,SAASC,QAAO;AACvB,aAAS,IAAI,GAAG,IAAIA,OAAM,QAAQ,KAAK;AACrC,UAAI,OAAOA,OAAM,CAAC;AAClB,UAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,iBAAS,IAAI;AAAA,MACf,OAAO;AACL,aAAK,KAAK,IAAI;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AACA,WAAS,oBAAoBA,QAAO;AAClC,QAAI,MAAM,QAAQA,OAAM,CAAC,CAAC,GAAG;AAC3B,eAAS,IAAI,GAAG,IAAIA,OAAM,QAAQ,KAAK;AACrC,4BAAoBA,OAAM,CAAC,CAAC;AAAA,MAC9B;AAAA,IACF,OAAO;AACL,eAAS,KAAK,GAAG,KAAKA,OAAM,QAAQ,MAAM;AACxC,aAAK,KAAKA,OAAM,EAAE,CAAC;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AACF;AAmHO,SAAS,iBAAiB,OAAOC,SAAQ;AAC9C,MAAI;AACJ,MAAI,SAAS;AAEb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,QAAI,OAAO,MAAM,CAAC;AAClB,QAAI,WAAW,MAAM,QAAQ,IAAI;AAGjC,QAAI,MAAM,KAAK,UAAU;AACvB,eAAS,KAAK;AAAA,IAChB;AAGA,QAAI,YAAY,KAAK,WAAW,QAAQ;AACtC,aAAO;AAAA,IACT;AACA,QAAI,WAAW,WAAW,iBAAiB,MAAMA,OAAM,IACrDA,QAAO,IAAI;AACb,QAAI,SAAS,QAAW;AACtB,aAAO;AAAA,IACT,WAAW,SAAS,UAAU;AAC5B,aAAO;AAAA,IACT,OAAO;AAAA,IAEP;AAAA,EACF;AACA,SAAO;AACT;AA8BA,SAAS,gBAAgB,GAAG,GAAG,WAAW,KAAK;AAC7C,MAAI,MAAM,WAAW;AAEnB,QAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,YAAM,IAAI,eAAe,EAAE,QAAQ,EAAE,MAAM;AAAA,IAC7C;AACA,QAAI,IAAI,CAAC;AACT,aAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,QAAE,CAAC,IAAI,gBAAgB,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,WAAW,MAAM,CAAC;AAAA,IACvD;AACA,WAAO;AAAA,EACT,OAAO;AAEL,WAAO,EAAE,OAAO,CAAC;AAAA,EACnB;AACF;AAQO,SAAS,SAAS;AACvB,MAAI,SAAS,MAAM,UAAU,MAAM,KAAK,WAAW,GAAG,EAAE;AACxD,MAAI,YAAY,MAAM,UAAU,MAAM,KAAK,WAAW,EAAE;AACxD,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,OAAO,CAAC;AAAA,EACjB;AACA,MAAI,OAAO,SAAS,GAAG;AACrB,WAAO,OAAO,MAAM,CAAC,EAAE,OAAO,SAAU,GAAG,GAAG;AAC5C,aAAO,gBAAgB,GAAG,GAAG,WAAW,CAAC;AAAA,IAC3C,GAAG,OAAO,CAAC,CAAC;AAAA,EACd,OAAO;AACL,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AACF;AAOO,SAAS,iBAAiB;AAC/B,WAAS,OAAO,UAAU,QAAQ,QAAQ,IAAI,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,MAAM,QAAQ;AACxF,UAAM,IAAI,IAAI,UAAU,IAAI;AAAA,EAC9B;AACA,MAAI,aAAa,MAAM,IAAI,OAAK,EAAE,MAAM;AACxC,MAAI,IAAI,KAAK,IAAI,GAAG,UAAU;AAC9B,MAAI,UAAU,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI;AAEpC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,QAAIC,QAAO,MAAM,CAAC;AAClB,QAAI,MAAM,WAAW,CAAC;AACtB,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,UAAI,IAAI,IAAI,MAAM;AAClB,UAAIA,MAAK,CAAC,IAAI,QAAQ,CAAC,GAAG;AACxB,gBAAQ,CAAC,IAAIA,MAAK,CAAC;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AACA,WAAS,MAAM,GAAG,MAAM,MAAM,QAAQ,OAAO;AAC3C,2BAAuB,MAAM,GAAG,GAAG,OAAO;AAAA,EAC5C;AACA,SAAO;AACT;AAOO,SAAS,uBAAuBA,OAAM,QAAQ;AACnD,MAAI,IAAI,OAAO;AACf,MAAI,MAAMA,MAAK;AACf,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,QAAI,IAAI,IAAI,MAAM;AAClB,QAAIA,MAAK,CAAC,IAAI,OAAO,CAAC,KAAKA,MAAK,CAAC,IAAI,KAAKA,MAAK,CAAC,IAAI,OAAO,CAAC,GAAG;AAC7D,YAAM,IAAI,MAAM,wDAAwD,OAAOA,OAAM,wCAAwC,EAAE,OAAO,KAAK,aAAa,EAAE,OAAOA,MAAK,CAAC,GAAG,WAAW,EAAE,OAAO,OAAO,CAAC,CAAC,CAAC;AAAA,IAC1M;AAAA,EACF;AACF;AAQO,SAAS,YAAY,OAAO,QAAQ;AACzC,MAAI,QAAQ,UAAU,KAAK;AAC3B,MAAI,gBAAgB,OAAO,MAAM,GAAG;AAClC,WAAO;AAAA,EACT;AACA,yBAAuB,OAAO,MAAM;AACpC,MAAI,kBAAkB,eAAe,OAAO,MAAM;AAClD,MAAI,IAAI,gBAAgB;AACxB,MAAI,aAAa,CAAC,GAAG,MAAM,IAAI,MAAM,MAAM,EAAE,KAAK,CAAC,GAAG,GAAG,KAAK;AAC9D,MAAI,IAAIC,OAAM,KAAK;AAEnB,MAAI,MAAM,SAAS,GAAG;AACpB,QAAI,QAAQ,GAAG,UAAU;AACzB,YAAQ,UAAU,CAAC;AAAA,EACrB;AAGA,WAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,QAAI,MAAM,GAAG,IAAI,gBAAgB,GAAG,GAAG;AACrC,UAAI,QAAQ,GAAG,gBAAgB,GAAG,GAAG,GAAG;AACxC,cAAQ,UAAU,CAAC;AAAA,IACrB;AAAA,EACF;AACA,SAAO;AACT;AAmCO,SAAS,QAAQ,gBAAgB,eAAe,cAAc;AACnE,SAAO,OAAO,GAAG,MAAM,aAAa,EAAE,KAAK,cAAc,GAAG,YAAY;AAC1E;AAcO,SAAS,IAAI,OAAO,OAAO;AAChC,MAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,UAAM,IAAI,MAAM,gBAAgB;AAAA,EAClC;AACA,MAAIC,QAAO,UAAU,KAAK;AAC1B,MAAI,MAAM,WAAWA,MAAK,QAAQ;AAChC,UAAM,IAAI,eAAe,MAAM,QAAQA,MAAK,MAAM;AAAA,EACpD;AACA,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,kBAAc,MAAM,CAAC,GAAGA,MAAK,CAAC,CAAC;AAAA,EACjC;AACA,SAAO,MAAM,OAAO,CAAC,KAAK,SAAS,IAAI,IAAI,GAAG,KAAK;AACrD;AAaO,SAAS,QAAQ,OAAO,UAAU;AACvC,MAAI,YAAY,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACpF,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,CAAC;AAAA,EACV;AACA,MAAI,WAAW;AACb,WAAO,aAAa,KAAK;AAAA,EAC3B;AACA,MAAI,QAAQ,CAAC;AACb,SAAO,sBAAsB,OAAO,CAAC;AACrC,WAAS,sBAAsB,OAAO,OAAO;AAC3C,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAI,IAAI,MAAM;AACd,UAAI,SAAS,MAAM,CAAC;AACpB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAM,KAAK,IAAI;AACf,eAAO,CAAC,IAAI,sBAAsB,MAAM,CAAC,GAAG,QAAQ,CAAC;AAAA,MACvD;AACA,aAAO;AAAA,IACT,OAAO;AACL,aAAO,SAAS,OAAO,MAAM,MAAM,GAAG,KAAK,GAAG,KAAK;AAAA,IACrD;AAAA,EACF;AACA,WAAS,aAAa,OAAO;AAC3B,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAI,IAAI,MAAM;AACd,UAAI,SAAS,MAAM,CAAC;AACpB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAO,CAAC,IAAI,aAAa,MAAM,CAAC,CAAC;AAAA,MACnC;AACA,aAAO;AAAA,IACT,OAAO;AACL,aAAO,SAAS,KAAK;AAAA,IACvB;AAAA,EACF;AACF;AAYO,SAAS,YAAY,OAAO,UAAU;AAC3C,MAAI,YAAY,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACpF,MAAI,MAAM,WAAW,GAAG;AACtB;AAAA,EACF;AACA,MAAI,WAAW;AACb,qBAAiB,KAAK;AACtB;AAAA,EACF;AACA,MAAI,QAAQ,CAAC;AACb,4BAA0B,OAAO,CAAC;AAClC,WAAS,0BAA0B,OAAO,OAAO;AAC/C,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAI,IAAI,MAAM;AACd,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAM,KAAK,IAAI;AACf,kCAA0B,MAAM,CAAC,GAAG,QAAQ,CAAC;AAAA,MAC/C;AAAA,IACF,OAAO;AACL,eAAS,OAAO,MAAM,MAAM,GAAG,KAAK,GAAG,KAAK;AAAA,IAC9C;AAAA,EACF;AACA,WAAS,iBAAiB,OAAO;AAC/B,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAI,IAAI,MAAM;AACd,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,yBAAiB,MAAM,CAAC,CAAC;AAAA,MAC3B;AAAA,IACF,OAAO;AACL,eAAS,KAAK;AAAA,IAChB;AAAA,EACF;AACF;AAOO,SAASC,OAAM,OAAO;AAC3B,aAAO,gBAAAC,SAAS,CAAC,GAAG,KAAK;AAC3B;;;AKt5BO,SAAS,iBAAiB,UAAU,OAAOC,QAAM,SAAS;AAC/D,MAAI,uBAAM,gBAAgB,QAAQ,GAAG;AACnC,QAAI;AACJ,QAAI,SAAS;AACX,0BAAoB;AAAA,IACtB,OAAO;AACL,UAAIC,QAAO,MAAM,WAAW,MAAM,KAAK,IAAI,UAAU,KAAK;AAG1D,UAAI,UAAUA,MAAK,SAASA,MAAKA,MAAK,SAAS,CAAC,MAAM,IAAI;AAC1D,UAAI,SAAS;AAGX,eAAO;AAAA,UACL;AAAA,UACA,IAAI;AAAA,QACN;AAAA,MACF;AACA,UAAI,aAAaA,MAAK,IAAI,MAAM,CAAC;AACjC,UAAI,aAAa,MAAM,WAAW,MAAM,IAAI,UAAU,IAAI,IAAI,OAAO,UAAU;AAC/E,0BAAoB,4BAA4B,UAAU,YAAY,YAAY,KAAK;AAAA,IACzF;AACA,QAAI;AACJ,QAAI,MAAM,YAAY,MAAM,aAAa,WAAW,MAAM,aAAa,QAAW;AAChF,UAAI,kBAAkB,8BAA8B,UAAU,iBAAiB;AAC/E,qBAAe,oBAAoB,SAAY,kBAAkB;AAAA,IACnE,OAAO;AACL,qBAAe;AAAA,IACjB;AACA,QAAI,qBAAqB,KAAK,qBAAqB,GAAG;AACpD,aAAO;AAAA,QACL,SAAS,sBAAsB;AAAA,QAC/B,IAAI,SAAS,KAAK;AAChB,mBAAS,OAAO,UAAU,QAAQ,OAAO,IAAI,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,MAAM,QAAQ;AACvF,iBAAK,IAAI,IAAI,UAAU,IAAI;AAAA,UAC7B;AACA,iBAAO,qBAAqB,cAAc,KAAK,MAAM,GAAG,iBAAiB,GAAGD,QAAM,SAAS,IAAI;AAAA,QACjG;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,IAAI,SAAS,KAAK;AAChB,iBAAS,QAAQ,UAAU,QAAQ,OAAO,IAAI,MAAM,KAAK,GAAG,QAAQ,GAAG,QAAQ,OAAO,SAAS;AAC7F,eAAK,KAAK,IAAI,UAAU,KAAK;AAAA,QAC/B;AACA,eAAO,qBAAqB,cAAc,MAAMA,QAAM,SAAS,IAAI;AAAA,MACrE;AAAA,IACF;AAAA,EACF;AACA,MAAI,YAAY,QAAW;AACzB,WAAO;AAAA,MACL,SAAS,uBAAuB,QAAQ;AAAA,MACxC,IAAI;AAAA,IACN;AAAA,EACF,OAAO;AACL,WAAO;AAAA,MACL;AAAA,MACA,IAAI;AAAA,IACN;AAAA,EACF;AACF;AACA,SAAS,8BAA8B,UAAU,OAAO;AACtD,MAAI,oBAAoB,CAAC;AACzB,SAAO,QAAQ,SAAS,UAAU,EAAE,QAAQ,UAAQ;AAClD,QAAI,CAAC,WAAW,IAAI,IAAI;AACxB,QAAI,UAAU,MAAM,GAAG,EAAE,WAAW,OAAO;AACzC,wBAAkB,KAAK,IAAI;AAAA,IAC7B;AAAA,EACF,CAAC;AACD,MAAI,kBAAkB,WAAW,GAAG;AAClC,WAAO,kBAAkB,CAAC;AAAA,EAC5B;AACF;AAcA,SAAS,uBAAuB,UAAU;AACxC,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,MAAI,cAAc,SAAS,SAAS;AAEpC,MAAI,YAAY,KAAK,WAAW,EAAG,QAAO;AAG1C,MAAI,YAAY,YAAY,MAAM,SAAS;AAE3C,MAAI,SAAS,KAAK,SAAS,EAAG,QAAO;AACrC,SAAO;AACT;AACA,SAAS,4BAA4B,UAAU,OAAO,OAAO,OAAO;AAClE,MAAI,WAAW,CAAC,OAAO,OAAO,KAAK;AACnC,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,OAAO,SAAS,MAAM,GAAG,CAAC;AAC9B,QAAI,uBAAM,QAAQ,UAAU,IAAI,MAAM,MAAM;AAC1C,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAUA,SAAS,qBAAqB,MAAM,MAAM,eAAe,cAAc;AACrE,MAAI;AACF,WAAO,KAAK,GAAG,IAAI;AAAA,EACrB,SAAS,KAAK;AACZ,yBAAqB,KAAK,MAAM,eAAe,YAAY;AAAA,EAC7D;AACF;AAWA,SAAS,qBAAqB,KAAK,MAAM,eAAe,cAAc;AACpE,MAAI;AAEJ,MAAI,eAAe,eAAe,YAAY,IAAI,UAAU,QAAQ,cAAc,SAAS,SAAS,UAAU,cAAc,aAAa;AACvI,QAAI,WAAW,CAAC;AAChB,aAAS,KAAK,UAAU,OAAO,OAAQ,KAAK,CAAC,CAAC,CAAC,CAAC;AAChD,QAAI,KAAK,UAAU,GAAG;AACpB,eAAS,KAAK,UAAU,OAAO,OAAQ,KAAK,CAAC,CAAC,CAAC,CAAC;AAAA,IAClD;AACA,QAAI,KAAK,UAAU,GAAG;AACpB,eAAS,KAAK,UAAU,OAAO,OAAQ,KAAK,CAAC,CAAC,CAAC,CAAC;AAAA,IAClD;AACA,UAAM,IAAI,UAAU,YAAY,OAAO,eAAe,mCAAmC,IAAI,GAAG,OAAO,cAAc,GAAG,EAAE,OAAO,SAAS,KAAK,IAAI,GAAG,aAAa,EAAE,OAAO,KAAK,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC;AAAA,EACtM,OAAO;AACL,UAAM,IAAI,UAAU,YAAY,OAAO,eAAe,mCAAmC,IAAI,eAAe,OAAO,cAAc,IAAI,EAAE,OAAO,IAAI,OAAO,CAAC;AAAA,EAC5J;AACF;;;AC1JA,IAAIE,QAAO;AACX,IAAIC,gBAAe,CAAC,UAAU,QAAQ;AAC/B,IAAI,yBAAwC,wBAAQD,OAAMC,eAAc,UAAQ;AACrF,MAAI;AAAA,IACF,QAAAC;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AAMJ,WAASC,aAAY,MAAM,UAAU;AACnC,QAAI,EAAE,gBAAgBA,eAAc;AAClC,YAAM,IAAI,YAAY,kDAAkD;AAAA,IAC1E;AACA,QAAI,YAAY,CAAC,SAAS,QAAQ,GAAG;AACnC,YAAM,IAAI,MAAM,uBAAuB,QAAQ;AAAA,IACjD;AACA,QAAI,SAAS,IAAI,GAAG;AAElB,UAAI,KAAK,SAAS,eAAe;AAE/B,aAAK,QAAQ,MAAM,KAAK,KAAK;AAC7B,aAAK,QAAQ,MAAM,KAAK,KAAK;AAC7B,aAAK,YAAY,YAAY,KAAK;AAAA,MACpC,OAAO;AAEL,aAAK,QAAQ,KAAK,QAAQ;AAC1B,aAAK,QAAQ,KAAK,KAAK;AACvB,aAAK,YAAY,YAAY,KAAK;AAAA,MACpC;AAAA,IACF,WAAW,QAAQ,QAAQ,KAAK,IAAI,KAAK,QAAQ,KAAK,IAAI,GAAG;AAE3D,WAAK,QAAQ,KAAK;AAClB,WAAK,QAAQ,KAAK;AAElB,eAAS,KAAK,OAAO,KAAK,KAAK;AAC/B,WAAK,YAAY,YAAY,KAAK;AAAA,IACpC,WAAW,QAAQ,IAAI,GAAG;AAExB,WAAK,QAAQ,WAAW,IAAI;AAE5B,WAAK,QAAQ,UAAU,KAAK,KAAK;AAEjC,eAAS,KAAK,OAAO,KAAK,KAAK;AAE/B,WAAK,YAAY;AAAA,IACnB,WAAW,MAAM;AAEf,YAAM,IAAI,UAAU,+BAA+B,OAAO,IAAI,IAAI,GAAG;AAAA,IACvE,OAAO;AAEL,WAAK,QAAQ,CAAC;AACd,WAAK,QAAQ,CAAC,CAAC;AACf,WAAK,YAAY;AAAA,IACnB;AAAA,EACF;AACA,EAAAA,aAAY,YAAY,IAAIF,QAAO;AAKnC,EAAAE,aAAY,UAAU,oBAAoB,SAAU,MAAM,UAAU;AAClE,WAAO,IAAIA,aAAY,MAAM,QAAQ;AAAA,EACvC;AAKA,SAAO,eAAeA,cAAa,QAAQ;AAAA,IACzC,OAAO;AAAA,EACT,CAAC;AACD,EAAAA,aAAY,UAAU,cAAcA;AACpC,EAAAA,aAAY,UAAU,OAAO;AAC7B,EAAAA,aAAY,UAAU,gBAAgB;AAWtC,EAAAA,aAAY,UAAU,cAAc,WAAY;AAC9C,WAAO,iBAAiB,KAAK,OAAO,MAAM;AAAA,EAC5C;AAWA,EAAAA,aAAY,UAAU,UAAU,WAAY;AAC1C,WAAO;AAAA,EACT;AAWA,EAAAA,aAAY,UAAU,WAAW,WAAY;AAC3C,WAAO,KAAK;AAAA,EACd;AAQA,EAAAA,aAAY,UAAU,SAAS,SAAU,MAAM,UAAU;AACvD,WAAO,IAAIA,aAAY,MAAM,QAAQ;AAAA,EACvC;AAgBA,EAAAA,aAAY,UAAU,SAAS,SAAU,OAAO,aAAa,cAAc;AACzE,YAAQ,UAAU,QAAQ;AAAA,MACxB,KAAK;AACH,eAAO,KAAK,MAAM,KAAK;AAAA;AAAA,MAGzB,KAAK;AAAA,MACL,KAAK;AACH,eAAO,KAAK,MAAM,OAAO,aAAa,YAAY;AAAA,MACpD;AACE,cAAM,IAAI,YAAY,2BAA2B;AAAA,IACrD;AAAA,EACF;AAQA,EAAAA,aAAY,UAAU,MAAM,SAAU,OAAO;AAC3C,WAAO,IAAI,KAAK,OAAO,KAAK;AAAA,EAC9B;AAYA,EAAAA,aAAY,UAAU,MAAM,SAAU,OAAO,OAAO,cAAc;AAChE,QAAI,CAAC,QAAQ,KAAK,GAAG;AACnB,YAAM,IAAI,UAAU,gBAAgB;AAAA,IACtC;AACA,QAAI,MAAM,SAAS,KAAK,MAAM,QAAQ;AACpC,YAAM,IAAI,eAAe,MAAM,QAAQ,KAAK,MAAM,QAAQ,GAAG;AAAA,IAC/D;AACA,QAAI,GAAG,IAAI;AAGX,QAAIC,QAAO,MAAM,IAAI,SAAUC,IAAG;AAChC,aAAOA,KAAI;AAAA,IACb,CAAC;AACD,SAAK,MAAMD,OAAM,YAAY;AAG7B,QAAI,OAAO,KAAK;AAChB,SAAK,IAAI,GAAG,KAAK,MAAM,SAAS,GAAG,IAAI,IAAI,KAAK;AAC9C,eAAS,MAAM,CAAC;AAChB,oBAAc,QAAQ,KAAK,MAAM;AACjC,aAAO,KAAK,MAAM;AAAA,IACpB;AAGA,aAAS,MAAM,MAAM,SAAS,CAAC;AAC/B,kBAAc,QAAQ,KAAK,MAAM;AACjC,SAAK,MAAM,IAAI;AACf,WAAO;AAAA,EACT;AASA,WAAS,KAAKE,SAAQ,OAAO;AAC3B,QAAI,CAAC,QAAQ,KAAK,GAAG;AACnB,YAAM,IAAI,UAAU,eAAe;AAAA,IACrC;AACA,QAAI,WAAWJ,QAAO,eAAe,MAAM,KAAK,EAAE,MAAM,SAAO,QAAQ,CAAC,IAAI,MAAM,SAAS;AAC3F,QAAI,UAAU;AAEZ,aAAOI,QAAO,IAAI,MAAM,IAAI,CAAC;AAAA,IAC/B,OAAO;AAEL,UAAIF,QAAO,MAAM,KAAK;AACtB,UAAIA,MAAK,WAAWE,QAAO,MAAM,QAAQ;AACvC,cAAM,IAAI,eAAeF,MAAK,QAAQE,QAAO,MAAM,MAAM;AAAA,MAC3D;AAGA,UAAIC,OAAM,MAAM,IAAI;AACpB,UAAIC,OAAM,MAAM,IAAI;AACpB,eAAS,IAAI,GAAG,KAAKF,QAAO,MAAM,QAAQ,IAAI,IAAI,KAAK;AACrD,sBAAcC,KAAI,CAAC,GAAGD,QAAO,MAAM,CAAC,CAAC;AACrC,sBAAcE,KAAI,CAAC,GAAGF,QAAO,MAAM,CAAC,CAAC;AAAA,MACvC;AAGA,UAAI,eAAe,IAAIH,aAAY;AACnC,UAAI,YAAY,cAAcG,QAAO,OAAO,KAAK;AACjD,mBAAa,QAAQ,UAAU;AAC/B,mBAAa,YAAYA,QAAO;AAChC,mBAAa,QAAQ,UAAU;AAC/B,aAAOJ,QAAO,eAAe,aAAa,QAAQ,MAAM,KAAK,CAAC,IAAI;AAAA,IACpE;AAAA,EACF;AAWA,WAAS,cAAc,MAAM,OAAO;AAClC,QAAI,WAAW,MAAM,KAAK,EAAE,SAAS;AACrC,QAAIE,QAAO,MAAM,QAAQ;AACzB,WAAO;AAAA,MACL,MAAM,sBAAsB,IAAI;AAAA,MAChC,MAAMA,MAAK,OAAO,OAAK,MAAM,IAAI;AAAA,IACnC;AACA,aAAS,sBAAsBK,OAAM;AACnC,UAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,UAAI,OAAO,MAAM,UAAU,KAAK;AAChC,eAAS,UAAU,KAAK,UAAU;AAEhC,YAAI,SAAS,GAAG,EAAG,QAAO,SAAS,GAAG;AAAA,YAAO,QAAO,IAAI,IAAI,QAAQ,EAAE,QAAQ;AAAA,MAChF;AACA,UAAI,SAAS,IAAI,GAAG;AAClB,QAAAL,MAAK,KAAK,IAAI;AAAA,MAChB,OAAO;AACL,QAAAA,MAAK,KAAK,IAAI,KAAK,KAAK,EAAE,CAAC;AAAA,MAC7B;AACA,UAAI,QAAQ,UAAU;AACpB,eAAO,UAAU,MAAM,cAAY;AACjC,wBAAc,UAAUK,MAAK,MAAM;AACnC,iBAAO,sBAAsBA,MAAK,QAAQ,GAAG,QAAQ,CAAC;AAAA,QACxD,CAAC;AAAA,MACH,OAAO;AACL,eAAO,UAAU,MAAM,cAAY;AACjC,wBAAc,UAAUA,MAAK,MAAM;AACnC,iBAAOA,MAAK,QAAQ;AAAA,QACtB,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAcA,WAAS,KAAKH,SAAQ,OAAO,WAAW,cAAc;AACpD,QAAI,CAAC,SAAS,MAAM,YAAY,MAAM;AACpC,YAAM,IAAI,UAAU,eAAe;AAAA,IACrC;AAGA,QAAI,QAAQ,MAAM,KAAK;AACvB,QAAI,WAAW,MAAM,SAAS;AAG9B,QAAI;AACJ,QAAI,SAAS,SAAS,GAAG;AACvB,sBAAgB,UAAU,KAAK;AAC/B,kBAAY,UAAU,QAAQ;AAAA,IAChC,OAAO;AACL,sBAAgB,UAAU,SAAS;AAAA,IACrC;AACA,QAAI,UAAU;AAIZ,UAAI,cAAc,WAAW,GAAG;AAC9B,cAAM,IAAI,UAAU,iBAAiB;AAAA,MACvC;AACA,MAAAA,QAAO,IAAI,MAAM,IAAI,GAAG,WAAW,YAAY;AAAA,IACjD,OAAO;AAIL,UAAI,CAAC,gBAAgB,eAAe,KAAK,GAAG;AAC1C,YAAI,cAAc,WAAW,GAAG;AAC9B,sBAAY,YAAY,CAAC,SAAS,GAAG,KAAK;AAAA,QAC5C,OAAO;AACL,cAAI;AACF,wBAAY,YAAY,WAAW,KAAK;AAAA,UAC1C,SAAS,OAAO;AAAA,UAAC;AAAA,QACnB;AACA,wBAAgB,UAAU,SAAS;AAAA,MACrC;AAGA,UAAI,MAAM,SAASA,QAAO,MAAM,QAAQ;AACtC,cAAM,IAAI,eAAe,MAAM,QAAQA,QAAO,MAAM,QAAQ,GAAG;AAAA,MACjE;AACA,UAAI,cAAc,SAAS,MAAM,QAAQ;AAEvC,YAAI,IAAI;AACR,YAAI,QAAQ;AACZ,eAAO,MAAM,CAAC,MAAM,KAAK,cAAc,CAAC,MAAM,GAAG;AAC/C;AAAA,QACF;AACA,eAAO,MAAM,CAAC,MAAM,GAAG;AACrB;AACA;AAAA,QACF;AAGA,oBAAY,UAAU,WAAW,MAAM,QAAQ,OAAO,aAAa;AAAA,MACrE;AAGA,UAAI,CAAC,gBAAgB,OAAO,aAAa,GAAG;AAC1C,cAAM,IAAI,eAAe,OAAO,eAAe,GAAG;AAAA,MACpD;AAGA,UAAIF,QAAO,MAAM,IAAI,EAAE,IAAI,SAAUC,IAAG;AACtC,eAAOA,KAAI;AAAA,MACb,CAAC;AACD,WAAKC,SAAQF,OAAM,YAAY;AAG/B,oBAAcE,QAAO,OAAO,OAAO,SAAS;AAAA,IAC9C;AACA,WAAOA;AAAA,EACT;AAUA,WAAS,cAAc,MAAM,OAAO,WAAW;AAC7C,QAAI,WAAW,MAAM,KAAK,EAAE,SAAS;AACrC,0BAAsB,MAAM,SAAS;AACrC,aAAS,sBAAsBG,OAAMC,YAAW;AAC9C,UAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,UAAIC,SAAQ,MAAM,UAAU,KAAK;AACjC,UAAI,oBAAoB,CAAC,YAAY,MAAM;AACzC,sBAAc,YAAYF,MAAK,MAAM;AACrC,8BAAsBA,MAAK,UAAU,GAAGC,WAAU,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC;AAAA,MACpE;AACA,UAAI,gBAAgB,CAAC,YAAY,MAAM;AACrC,sBAAc,YAAYD,MAAK,MAAM;AACrC,QAAAA,MAAK,UAAU,IAAIC,WAAU,EAAE,CAAC,CAAC;AAAA,MACnC;AACA,UAAI,QAAQ,UAAU;AACpB,YAAI,SAASC,MAAK,EAAG,mBAAkBA,QAAO,CAAC,CAAC,CAAC;AAAA,YAAO,CAAAA,OAAM,QAAQ,iBAAiB;AAAA,MACzF,OAAO;AACL,YAAI,SAASA,MAAK,EAAG,eAAcA,QAAO,CAAC,CAAC,CAAC;AAAA,YAAO,CAAAA,OAAM,QAAQ,aAAa;AAAA,MACjF;AAAA,IACF;AAAA,EACF;AAeA,EAAAR,aAAY,UAAU,SAAS,SAAUC,OAAM,cAAc,MAAM;AAEjE,QAAI,CAAC,aAAaA,KAAI,GAAG;AACvB,YAAM,IAAI,UAAU,0BAA0B;AAAA,IAChD;AAGA,QAAI,YAAYA,MAAK,QAAQ,EAAE,IAAI,WAAS;AAC1C,aAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI;AAAA,IACjE,CAAC;AAGD,QAAI,IAAI,OAAO,KAAK,MAAM,IAAI;AAE9B,WAAOQ,SAAQ,GAAG,WAAW,YAAY;AAAA,EAC3C;AACA,WAASA,SAAQN,SAAQF,OAAM,cAAc;AAE3C,QAAIA,MAAK,WAAW,GAAG;AAErB,UAAI,IAAIE,QAAO;AAEf,aAAO,QAAQ,CAAC,GAAG;AACjB,YAAI,EAAE,CAAC;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAEA,IAAAA,QAAO,QAAQF,MAAK,MAAM,CAAC;AAC3B,IAAAE,QAAO,QAAQ,OAAOA,QAAO,OAAOA,QAAO,OAAO,YAAY;AAE9D,WAAOA;AAAA,EACT;AAgBA,EAAAH,aAAY,UAAU,UAAU,SAAUC,OAAM,MAAM;AACpD,QAAI,IAAI,OAAO,KAAK,MAAM,IAAI;AAC9B,MAAE,QAAQ,QAAQ,EAAE,OAAOA,KAAI;AAC/B,QAAI,gBAAgB,EAAE,MAAM,OAAO,CAAC,QAAQA,UAAS,SAASA,KAAI;AAClE,MAAE,QAAQ,qBAAqBA,OAAM,aAAa;AAClD,WAAO;AAAA,EACT;AAWA,WAAS,KAAKE,SAAQF,OAAM,cAAc;AACxC,QAEA,UAAUE,QAAO,MAAM,MAAM,CAAC;AAC9B,QAAI,UAAU;AAGd,WAAO,QAAQ,SAASF,MAAK,QAAQ;AACnC,cAAQ,KAAK,CAAC;AACd,gBAAU;AAAA,IACZ;AAGA,aAAS,IAAI,GAAG,KAAKA,MAAK,QAAQ,IAAI,IAAI,KAAK;AAC7C,UAAIA,MAAK,CAAC,IAAI,QAAQ,CAAC,GAAG;AACxB,gBAAQ,CAAC,IAAIA,MAAK,CAAC;AACnB,kBAAU;AAAA,MACZ;AAAA,IACF;AACA,QAAI,SAAS;AAEX,MAAAQ,SAAQN,SAAQ,SAAS,YAAY;AAAA,IACvC;AAAA,EACF;AAOA,EAAAH,aAAY,UAAU,QAAQ,WAAY;AACxC,QAAI,IAAI,IAAIA,aAAY;AAAA,MACtB,MAAM,MAAM,KAAK,KAAK;AAAA,MACtB,MAAM,MAAM,KAAK,KAAK;AAAA,MACtB,UAAU,KAAK;AAAA,IACjB,CAAC;AACD,WAAO;AAAA,EACT;AAOA,EAAAA,aAAY,UAAU,OAAO,WAAY;AACvC,WAAO,KAAK,MAAM,MAAM,CAAC;AAAA,EAC3B;AAcA,EAAAA,aAAY,UAAU,MAAM,SAAU,UAAU;AAC9C,QAAI,YAAY,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACpF,QAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAClF,QAAI,KAAK;AACT,QAAI,WAAW,GAAG,MAAM,SAAS;AACjC,QAAI,WAAW,EAAG,QAAO,GAAG,MAAM;AAClC,QAAI,eAAe,iBAAiB,UAAU,IAAI,OAAO,OAAO;AAChE,QAAI,iBAAiB,aAAa;AAClC,QAAI,SAAS,GAAG,OAAO,QAAW,GAAG,SAAS;AAC9C,WAAO,QAAQ,GAAG;AAClB,QAAI,WAAW,aAAa,SAAS;AACnC,aAAO,QAAQ,aAAa,GAAG,KAAK;AACpC,aAAO;AAAA,IACT;AACA,QAAI,aAAa,GAAG;AAClB,UAAI,YAAY,GAAG,QAAQ;AAC3B,UAAI,OAAO,MAAM,UAAU,MAAM;AACjC,eAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,aAAK,CAAC,IAAI,eAAe,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE;AAAA,MAChD;AACA,aAAO,QAAQ;AACf,aAAO;AAAA,IACT;AACA,QAAI,QAAQ,CAAC;AACb,WAAO,QAAQ,QAAQ,GAAG,KAAK;AAC/B,WAAO;AACP,aAAS,QAAQM,OAAM;AACrB,UAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,UAAII,UAAS,MAAMJ,MAAK,MAAM;AAC9B,UAAI,QAAQ,UAAU;AACpB,iBAAS,KAAK,GAAG,KAAKA,MAAK,QAAQ,MAAM;AACvC,gBAAM,KAAK,IAAI;AACf,UAAAI,QAAO,EAAE,IAAI,QAAQJ,MAAK,EAAE,GAAG,QAAQ,CAAC;AAAA,QAC1C;AAAA,MACF,OAAO;AACL,iBAAS,MAAM,GAAG,MAAMA,MAAK,QAAQ,OAAO;AAC1C,gBAAM,KAAK,IAAI;AACf,UAAAI,QAAO,GAAG,IAAI,eAAeJ,MAAK,GAAG,GAAG,MAAM,MAAM,GAAG,EAAE;AAAA,QAC3D;AAAA,MACF;AACA,aAAOI;AAAA,IACT;AACA,aAAS,aAAaJ,OAAM;AAC1B,UAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,UAAII,UAAS,MAAMJ,MAAK,MAAM;AAC9B,UAAI,QAAQ,UAAU;AACpB,iBAAS,MAAM,GAAG,MAAMA,MAAK,QAAQ,OAAO;AAC1C,UAAAI,QAAO,GAAG,IAAI,aAAaJ,MAAK,GAAG,GAAG,QAAQ,CAAC;AAAA,QACjD;AAAA,MACF,OAAO;AACL,iBAAS,MAAM,GAAG,MAAMA,MAAK,QAAQ,OAAO;AAC1C,UAAAI,QAAO,GAAG,IAAI,eAAeJ,MAAK,GAAG,CAAC;AAAA,QACxC;AAAA,MACF;AACA,aAAOI;AAAA,IACT;AAAA,EACF;AAWA,EAAAV,aAAY,UAAU,UAAU,SAAU,UAAU;AAClD,QAAI,YAAY,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACpF,QAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAClF,QAAI,KAAK;AACT,QAAI,WAAW,GAAG,MAAM,SAAS;AACjC,QAAI,WAAW,EAAG;AAClB,QAAI,eAAe,iBAAiB,UAAU,IAAI,OAAO,OAAO;AAChE,QAAI,iBAAiB,aAAa;AAClC,QAAI,WAAW,aAAa,SAAS;AACnC,mBAAa,GAAG,KAAK;AACrB;AAAA,IACF;AACA,QAAI,aAAa,GAAG;AAClB,eAAS,IAAI,GAAG,IAAI,GAAG,MAAM,QAAQ,KAAK;AACxC,uBAAe,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE;AAAA,MACrC;AACA;AAAA,IACF;AACA,QAAI,QAAQ,CAAC;AACb,YAAQ,GAAG,KAAK;AAChB,aAAS,QAAQ,MAAM;AACrB,UAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,UAAI,QAAQ,UAAU;AACpB,iBAAS,MAAM,GAAG,MAAM,KAAK,QAAQ,OAAO;AAC1C,gBAAM,KAAK,IAAI;AACf,kBAAQ,KAAK,GAAG,GAAG,QAAQ,CAAC;AAAA,QAC9B;AAAA,MACF,OAAO;AACL,iBAAS,MAAM,GAAG,MAAM,KAAK,QAAQ,OAAO;AAC1C,gBAAM,KAAK,IAAI;AACf,yBAAe,KAAK,GAAG,GAAG,MAAM,MAAM,GAAG,EAAE;AAAA,QAC7C;AAAA,MACF;AAAA,IACF;AACA,aAAS,aAAa,MAAM;AAC1B,UAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,UAAI,QAAQ,UAAU;AACpB,iBAAS,MAAM,GAAG,MAAM,KAAK,QAAQ,OAAO;AAC1C,uBAAa,KAAK,GAAG,GAAG,QAAQ,CAAC;AAAA,QACnC;AAAA,MACF,OAAO;AACL,iBAAS,MAAM,GAAG,MAAM,KAAK,QAAQ,OAAO;AAC1C,yBAAe,KAAK,GAAG,CAAC;AAAA,QAC1B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAMA,EAAAA,aAAY,UAAU,OAAO,QAAQ,IAAI,aAAa;AACpD,QAAI,WAAW,KAAK,MAAM,SAAS;AACnC,QAAI,WAAW,GAAG;AAChB;AAAA,IACF;AACA,QAAI,aAAa,GAAG;AAClB,eAAS,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,KAAK;AAC1C,cAAM;AAAA,UACJ,OAAO,KAAK,MAAM,CAAC;AAAA,UACnB,OAAO,CAAC,CAAC;AAAA,QACX;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,QAAQ,MAAM,WAAW,CAAC,EAAE,KAAK,CAAC;AACtC,QAAI,gBAAgB,KAAK,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AACxD,aAAS,QAAQ,GAAG,QAAQ,eAAe,SAAS;AAElD,UAAI,UAAU,KAAK;AACnB,eAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,kBAAU,QAAQ,MAAM,CAAC,CAAC;AAAA,MAC5B;AACA,YAAM;AAAA,QACJ,OAAO,QAAQ,MAAM,QAAQ,CAAC;AAAA,QAC9B,OAAO,MAAM,MAAM;AAAA,MACrB;AAGA,eAAS,KAAK,UAAU,MAAM,GAAG,MAAM;AACrC,cAAM,EAAE;AACR,YAAI,MAAM,EAAE,IAAI,KAAK,MAAM,EAAE,EAAG;AAChC,cAAM,EAAE,IAAI;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAMA,EAAAA,aAAY,UAAU,OAAO,WAAY;AACvC,QAAI,SAAS,CAAC;AACd,QAAI,IAAI,KAAK,KAAK;AAClB,QAAI,EAAE,WAAW,GAAG;AAClB,YAAM,IAAI,UAAU,4CAA4C;AAAA,IAClE;AACA,QAAI,OAAO,KAAK;AAChB,aAAS,OAAO,MAAM;AACpB,aAAO,KAAK,IAAIA,aAAY,CAAC,GAAG,GAAG,KAAK,SAAS,CAAC;AAAA,IACpD;AACA,WAAO;AAAA,EACT;AAMA,EAAAA,aAAY,UAAU,UAAU,WAAY;AAC1C,QAAI,QAAQ;AACZ,QAAI,SAAS,CAAC;AACd,QAAI,IAAI,KAAK,KAAK;AAClB,QAAI,EAAE,WAAW,GAAG;AAClB,YAAM,IAAI,UAAU,4CAA4C;AAAA,IAClE;AACA,QAAI,OAAO,KAAK;AAChB,QAAI,QAAQ,SAASW,OAAMT,IAAG;AAC5B,UAAI,MAAM,KAAK,IAAI,SAAO,CAAC,IAAIA,EAAC,CAAC,CAAC;AAClC,aAAO,KAAK,IAAIF,aAAY,KAAK,MAAM,SAAS,CAAC;AAAA,IACnD;AACA,aAAS,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,KAAK;AAC7B,YAAM,CAAC;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAOA,EAAAA,aAAY,UAAU,UAAU,WAAY;AAC1C,WAAO,MAAM,KAAK,KAAK;AAAA,EACzB;AAOA,EAAAA,aAAY,UAAU,UAAU,WAAY;AAC1C,WAAO,KAAK;AAAA,EACd;AAWA,EAAAA,aAAY,UAAU,SAAS,SAAU,SAAS;AAChD,WAAOY,QAAO,KAAK,OAAO,OAAO;AAAA,EACnC;AAOA,EAAAZ,aAAY,UAAU,WAAW,WAAY;AAC3C,WAAOY,QAAO,KAAK,KAAK;AAAA,EAC1B;AAOA,EAAAZ,aAAY,UAAU,SAAS,WAAY;AACzC,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,MAAM,KAAK;AAAA,MACX,MAAM,KAAK;AAAA,MACX,UAAU,KAAK;AAAA,IACjB;AAAA,EACF;AAUA,EAAAA,aAAY,UAAU,WAAW,SAAU,GAAG;AAE5C,QAAI,GAAG;AAEL,UAAI,YAAY,CAAC,GAAG;AAClB,YAAI,EAAE,SAAS;AAAA,MACjB;AAEA,UAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AACjC,cAAM,IAAI,UAAU,2CAA2C;AAAA,MACjE;AAAA,IACF,OAAO;AAEL,UAAI;AAAA,IACN;AACA,QAAI,SAAS,IAAI,IAAI,IAAI;AACzB,QAAI,OAAO,IAAI,IAAI,CAAC,IAAI;AAGxB,QAAI,OAAO,KAAK,MAAM,CAAC;AACvB,QAAI,UAAU,KAAK,MAAM,CAAC;AAG1B,QAAI,IAAI,KAAK,IAAI,OAAO,MAAM,UAAU,MAAM;AAG9C,QAAI,OAAO,CAAC;AAGZ,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,WAAK,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,EAAE,IAAI,MAAM;AAAA,IAC3C;AAGA,WAAO,IAAIA,aAAY;AAAA,MACrB;AAAA,MACA,MAAM,CAAC,CAAC;AAAA,MACR,UAAU,KAAK;AAAA,IACjB,CAAC;AAAA,EACH;AAcA,EAAAA,aAAY,WAAW,SAAUC,OAAM,OAAO,GAAG,cAAc;AAC7D,QAAI,CAAC,QAAQA,KAAI,GAAG;AAClB,YAAM,IAAI,UAAU,gCAAgC;AAAA,IACtD;AACA,QAAIA,MAAK,WAAW,GAAG;AACrB,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AAGA,IAAAA,QAAOA,MAAK,IAAI,SAAU,GAAG;AAE3B,UAAI,YAAY,CAAC,GAAG;AAElB,YAAI,EAAE,SAAS;AAAA,MACjB;AAEA,UAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG;AAC1C,cAAM,IAAI,MAAM,uCAAuC;AAAA,MACzD;AACA,aAAO;AAAA,IACT,CAAC;AAGD,QAAI,GAAG;AAEL,UAAI,YAAY,CAAC,GAAG;AAClB,YAAI,EAAE,SAAS;AAAA,MACjB;AAEA,UAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AACjC,cAAM,IAAI,UAAU,2CAA2C;AAAA,MACjE;AAAA,IACF,OAAO;AAEL,UAAI;AAAA,IACN;AACA,QAAI,SAAS,IAAI,IAAI,IAAI;AACzB,QAAI,OAAO,IAAI,IAAI,CAAC,IAAI;AAGxB,QAAI,OAAOA,MAAK,CAAC;AACjB,QAAI,UAAUA,MAAK,CAAC;AAGpB,QAAI,IAAI,KAAK,IAAI,OAAO,MAAM,UAAU,MAAM;AAG9C,QAAI;AAGJ,QAAI,QAAQ,KAAK,GAAG;AAElB,UAAI,MAAM,WAAW,GAAG;AAEtB,cAAM,IAAI,MAAM,4BAA4B;AAAA,MAC9C;AAEA,eAAS,SAASY,QAAO,GAAG;AAE1B,eAAO,MAAM,CAAC;AAAA,MAChB;AAAA,IACF,WAAW,SAAS,KAAK,GAAG;AAE1B,UAAI,KAAK,MAAM,KAAK;AAEpB,UAAI,GAAG,WAAW,KAAK,GAAG,CAAC,MAAM,GAAG;AAElC,cAAM,IAAI,MAAM,uBAAuB;AAAA,MACzC;AAEA,eAAS,SAASA,QAAO,GAAG;AAE1B,eAAO,MAAM,IAAI,CAAC,CAAC,CAAC;AAAA,MACtB;AAAA,IACF,OAAO;AAEL,eAAS,SAASA,UAAS;AAEzB,eAAO;AAAA,MACT;AAAA,IACF;AAGA,QAAI,CAAC,cAAc;AAEjB,qBAAe,YAAY,OAAO,CAAC,CAAC,IAAI,OAAO,CAAC,EAAE,IAAI,CAAC,IACrD;AAAA,IACJ;AAGA,QAAI,OAAO,CAAC;AAGZ,QAAIZ,MAAK,SAAS,GAAG;AAEnB,aAAO,OAAO,MAAMA,OAAM,YAAY;AAEtC,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAK,IAAI,IAAI,EAAE,IAAI,MAAM,IAAI,OAAO,CAAC;AAAA,MACvC;AAAA,IACF;AAGA,WAAO,IAAID,aAAY;AAAA,MACrB;AAAA,MACA,MAAM,CAAC,MAAM,OAAO;AAAA,IACtB,CAAC;AAAA,EACH;AAUA,EAAAA,aAAY,WAAW,SAAU,MAAM;AACrC,WAAO,IAAIA,aAAY,IAAI;AAAA,EAC7B;AAWA,EAAAA,aAAY,UAAU,WAAW,SAAU,GAAG,GAAG;AAE/C,QAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClE,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AAEA,QAAI,KAAK,MAAM,WAAW,GAAG;AAC3B,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AAEA,kBAAc,GAAG,KAAK,MAAM,CAAC,CAAC;AAC9B,kBAAc,GAAG,KAAK,MAAM,CAAC,CAAC;AAG9B,IAAAA,aAAY,UAAU,GAAG,GAAG,KAAK,KAAK;AAEtC,WAAO;AAAA,EACT;AASA,EAAAA,aAAY,YAAY,SAAU,GAAG,GAAG,MAAM;AAE5C,QAAI,KAAK,KAAK,CAAC;AACf,SAAK,CAAC,IAAI,KAAK,CAAC;AAChB,SAAK,CAAC,IAAI;AAAA,EACZ;AASA,WAAS,WAAW,MAAM;AACxB,QAAI,SAAS,IAAI,GAAG;AAClB,aAAO,WAAW,KAAK,QAAQ,CAAC;AAAA,IAClC;AACA,QAAI,QAAQ,IAAI,GAAG;AACjB,aAAO,KAAK,IAAI,UAAU;AAAA,IAC5B;AACA,WAAO;AAAA,EACT;AACA,SAAOA;AACT,GAAG;AAAA,EACD,SAAS;AACX,CAAC;;;AC/gCM,SAAS,QAAQ,KAAK;AAC3B,MAAI,IAAI,IAAI;AACZ,MAAI,IAAI,IAAI,CAAC,EAAE;AACf,MAAI,GAAG;AACP,MAAI,MAAM,CAAC;AACX,OAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AACtB,QAAI,MAAM,CAAC;AACX,SAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AACtB,UAAI,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;AAAA,IACpB;AACA,QAAI,KAAK,GAAG;AAAA,EACd;AACA,SAAO;AACT;;;ACRO,SAAS,oBAAoB,OAAO;AACzC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,QAAI,aAAa,MAAM,CAAC,CAAC,GAAG;AAC1B,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AASO,SAASc,aAAY,OAAO,UAAU;AAC3C,MAAI,SAAS,KAAK,GAAG;AACnB,UAAM,QAAQ,OAAK,SAAS,CAAC,GAAG,OAAO,IAAI;AAAA,EAC7C,OAAO;AACL,gBAAiB,OAAO,UAAU,IAAI;AAAA,EACxC;AACF;AAcO,SAASC,SAAQ,OAAO,UAAU,WAAW;AAClD,MAAI,CAAC,WAAW;AACd,QAAI,SAAS,KAAK,GAAG;AACnB,aAAO,MAAM,IAAI,OAAK,SAAS,CAAC,GAAG,OAAO,IAAI;AAAA,IAChD,OAAO;AACL,aAAO,QAAa,OAAO,UAAU,IAAI;AAAA,IAC3C;AAAA,EACF;AACA,MAAI,oBAAoB,OAAK,MAAM,IAAI,IAAI,SAAS,CAAC;AACrD,MAAI,SAAS,KAAK,GAAG;AACnB,WAAO,MAAM,IAAI,OAAK,kBAAkB,CAAC,GAAG,OAAO,IAAI;AAAA,EACzD,OAAO;AACL,WAAO,QAAa,OAAO,mBAAmB,IAAI;AAAA,EACpD;AACF;AAWO,SAAS,OAAO,KAAK,KAAK,UAAU;AACzC,MAAIC,QAAO,MAAM,QAAQ,GAAG,IAAI,UAAU,GAAG,IAAI,IAAI,KAAK;AAC1D,MAAI,MAAM,KAAK,OAAOA,MAAK,QAAQ;AAEjC,UAAM,IAAI,WAAW,KAAKA,MAAK,MAAM;AAAA,EACvC;AACA,MAAI,SAAS,GAAG,GAAG;AACjB,WAAO,IAAI,OAAO,QAAQ,IAAI,QAAQ,GAAG,KAAK,QAAQ,GAAG,IAAI,SAAS,CAAC;AAAA,EACzE,OAAO;AACL,WAAO,QAAQ,KAAK,KAAK,QAAQ;AAAA,EACnC;AACF;AAUA,SAAS,QAAQ,KAAK,KAAK,UAAU;AACnC,MAAI,GAAG,KAAK,KAAK;AACjB,MAAI,OAAO,GAAG;AACZ,QAAI,CAAC,MAAM,QAAQ,IAAI,CAAC,CAAC,GAAG;AAC1B,YAAM,IAAI,CAAC;AACX,WAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAC/B,cAAM,SAAS,KAAK,IAAI,CAAC,CAAC;AAAA,MAC5B;AACA,aAAO;AAAA,IACT,OAAO;AACL,aAAO,QAAQ,GAAG;AAClB,YAAM,CAAC;AACP,WAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAChC,YAAI,CAAC,IAAI,QAAQ,KAAK,CAAC,GAAG,MAAM,GAAG,QAAQ;AAAA,MAC7C;AACA,aAAO;AAAA,IACT;AAAA,EACF,OAAO;AACL,UAAM,CAAC;AACP,SAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAC/B,UAAI,CAAC,IAAI,QAAQ,IAAI,CAAC,GAAG,MAAM,GAAG,QAAQ;AAAA,IAC5C;AACA,WAAO;AAAA,EACT;AACF;;;ACnHA,IAAIC,QAAO;AACX,IAAIC,gBAAe,CAAC,SAAS,OAAO;AAC7B,IAAI,kBAAiC,wBAAQD,OAAMC,eAAc,UAAQ;AAC9E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,OAAAC;AAAA,EACF,IAAI;AA8BJ,SAAOD,OAAMF,OAAM;AAAA,IACjB,QAAQ,OAAK,OAAO,SAAS,CAAC,IAAIG,OAAM,GAAG,KAAK,MAAM,CAAC,CAAC,IAAI;AAAA,IAC5D,WAAW,OAAK,EAAE,SAAS,IAAIA,OAAM,EAAE,MAAM,GAAG,CAAC,IAAI;AAAA,IACrD,QAAQ,OAAK;AAAA,IACb,UAAU,OAAK,EAAE,MAAM;AAAA,IACvB,kBAAkBD,OAAM,YAAY,UAAQ,OAAKE,SAAQ,GAAG,IAAI,CAAC;AAAA,EACnE,CAAC;AACH,CAAC;;;AC5CD,IAAI,KAAK;AACT,IAAI,KAAK;AACF,SAAS,UAAU,GAAG;AAC3B,SAAO,KAAK,IAAI,CAAC;AACnB;AACA,UAAU,YAAY;AACf,SAAS,UAAU,GAAG,GAAG;AAC9B,SAAO,IAAI;AACb;AACA,UAAU,YAAY;AACf,SAAS,eAAe,GAAG,GAAG;AACnC,SAAO,IAAI;AACb;AACA,eAAe,YAAY;AACpB,SAAS,eAAe,GAAG,GAAG;AACnC,SAAO,IAAI;AACb;AACA,eAAe,YAAY;AACpB,SAAS,aAAa,GAAG,GAAG;AACjC,SAAO,IAAI;AACb;AACA,aAAa,YAAY;AAClB,SAAS,iBAAiB,GAAG;AAClC,SAAO,CAAC;AACV;AACA,iBAAiB,YAAY;AACtB,SAAS,gBAAgB,GAAG;AACjC,SAAO;AACT;AACA,gBAAgB,YAAY;AACrB,SAAS,WAAW,GAAG;AAC5B,SAAO,KAAK,CAAC;AACf;AACA,WAAW,YAAY;AAChB,SAAS,WAAW,GAAG;AAC5B,SAAO,IAAI,IAAI;AACjB;AACA,WAAW,YAAY;AAChB,SAAS,UAAU,GAAG;AAC3B,SAAO,KAAK,IAAI,CAAC;AACnB;AACA,UAAU,YAAY;AACf,SAAS,YAAY,GAAG;AAC7B,SAAO,MAAM,CAAC;AAChB;AACA,YAAY,YAAY;AAQjB,SAAS,UAAU,GAAG,GAAG;AAC9B,MAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,UAAM,IAAI,MAAM,oDAAoD;AAAA,EACtE;AAGA,MAAI;AACJ,SAAO,MAAM,GAAG;AACd,QAAI,IAAI;AACR,QAAI;AACJ,QAAI;AAAA,EACN;AACA,SAAO,IAAI,IAAI,CAAC,IAAI;AACtB;AACA,UAAU,YAAY;AAQf,SAAS,UAAU,GAAG,GAAG;AAC9B,MAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,UAAM,IAAI,MAAM,oDAAoD;AAAA,EACtE;AACA,MAAI,MAAM,KAAK,MAAM,GAAG;AACtB,WAAO;AAAA,EACT;AAIA,MAAI;AACJ,MAAI,OAAO,IAAI;AACf,SAAO,MAAM,GAAG;AACd,QAAI;AACJ,QAAI,IAAI;AACR,QAAI;AAAA,EACN;AACA,SAAO,KAAK,IAAI,OAAO,CAAC;AAC1B;AACA,UAAU,YAAY;AAoBf,SAAS,YAAY,GAAG;AAC7B,SAAO,MAAM,CAAC;AAChB;AACA,YAAY,YAAY;AAOjB,SAAS,WAAW,GAAG;AAC5B,SAAO,KAAK,CAAC;AACf;AACA,WAAW,YAAY;AAOhB,SAAS,YAAY,GAAG;AAC7B,SAAO,MAAM,CAAC;AAChB;AACA,YAAY,YAAY;AASjB,SAAS,UAAU,GAAG,GAAG;AAI9B,SAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC;AAC/C;AACA,UAAU,YAAY;AAwDf,SAAS,WAAW,GAAG;AAC5B,SAAO,KAAK,CAAC;AACf;AACA,WAAW,YAAY;AAChB,SAAS,WAAW,GAAG;AAC5B,SAAO,KAAK,KAAK,CAAC;AACpB;AACA,WAAW,YAAY;AAChB,SAAS,aAAa,GAAG;AAC9B,SAAO,IAAI;AACb;AACA,aAAa,YAAY;AASlB,SAAS,WAAW,GAAG,GAAG;AAE/B,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI,IAAI;AACR,MAAI,QAAQ;AACZ,MAAI,IAAI;AACR,MAAI,QAAQ;AACZ,MAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,UAAM,IAAI,MAAM,qDAAqD;AAAA,EACvE;AACA,SAAO,GAAG;AACR,QAAI,KAAK,MAAM,IAAI,CAAC;AACpB,QAAI,IAAI,IAAI;AACZ,QAAI;AACJ,QAAI,QAAQ,IAAI;AAChB,YAAQ;AACR,QAAI;AACJ,QAAI,QAAQ,IAAI;AAChB,YAAQ;AACR,QAAI;AACJ,QAAI;AAAA,EACN;AACA,MAAI;AACJ,MAAI,IAAI,GAAG;AACT,UAAM,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK;AAAA,EAC3B,OAAO;AACL,UAAM,CAAC,GAAG,IAAI,QAAQ,GAAG,KAAK;AAAA,EAChC;AACA,SAAO;AACT;AACA,WAAW,YAAY;AAQhB,SAAS,UAAU,GAAG,GAAG;AAG9B,MAAI,IAAI,IAAI,KAAK,MAAM,YAAY,IAAI,IAAI,KAAK,MAAM,WAAW;AAC/D,WAAO;AAAA,EACT;AACA,SAAO,KAAK,IAAI,GAAG,CAAC;AACtB;AACA,UAAU,YAAY;AAsBf,SAAS,WAAW,GAAG;AAC5B,SAAO,KAAK,IAAI,CAAC;AACnB;AACA,WAAW,YAAY;;;AC7SvB,IAAIC,MAAK;AACF,SAAS,gBAAgB,GAAG;AACjC,SAAO,UAAU,CAAC;AACpB;AACA,gBAAgB,YAAYA;AACrB,SAAS,iBAAiB,GAAG;AAClC,SAAO,IAAI;AACb;AACA,iBAAiB,YAAYA;AACtB,SAAS,iBAAiB,GAAG;AAClC,SAAO,IAAI;AACb;AACA,iBAAiB,YAAYA;AACtB,SAAS,aAAa,GAAG;AAC9B,SAAO,MAAM;AACf;AACA,aAAa,YAAYA;AAClB,SAAS,YAAY,GAAG;AAC7B,SAAO,OAAO,MAAM,CAAC;AACvB;AACA,YAAY,YAAYA;;;ACLjB,SAASC,aAAY,GAAG,GAAG;AAChC,MAAI,SAAS,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACjF,MAAI,SAAS,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACjF,MAAI,UAAU,GAAG;AACf,UAAM,IAAI,MAAM,2CAA2C;AAAA,EAC7D;AACA,MAAI,SAAS,GAAG;AACd,UAAM,IAAI,MAAM,uCAAuC;AAAA,EACzD;AAEA,MAAI,EAAE,MAAM,KAAK,EAAE,MAAM,GAAG;AAC1B,WAAO;AAAA,EACT;AACA,MAAI,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,GAAG;AAClC,WAAO,EAAE,GAAG,CAAC;AAAA,EACf;AAEA,MAAI,EAAE,GAAG,CAAC,GAAG;AACX,WAAO;AAAA,EACT;AAEA,SAAO,EAAE,MAAM,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,IAAI,EAAE,YAAY,IAAI,EAAE,IAAI,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,MAAM,GAAG,MAAM,CAAC;AACxG;;;ACjCA,IAAIC,QAAO;AACX,IAAIC,gBAAe,CAAC,SAAS,QAAQ;AAC9B,IAAI,mBAAkC,wBAAQD,OAAMC,eAAc,UAAQ;AAC/E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AAgCJ,SAAOD,OAAMF,OAAM;AAAA,IACjB,QAAQ,OAAK,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM,IAAI,QAAQ,iBAAiB,CAAC;AAAA,IACzF,WAAW,OAAKC,aAAe,GAAG,IAAI,EAAE,YAAY,CAAC,GAAGD,QAAO,QAAQA,QAAO,MAAM,IAAI,QAAQ,CAAC,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,MAAM;AAAA,IACtI,QAAQ,OAAK,IAAI;AAAA,IACjB,UAAU,OAAK,EAAE,IAAI,MAAM,EAAE,IAAI;AAAA,IACjC,MAAMD,OAAM,YAAY,UAAQ,OAAKA,OAAM,KAAK,MAAM,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC;AAAA,IAC7E,kBAAkBA,OAAM,YAAY,UAAQ,OAAKG,SAAQ,GAAG,IAAI,CAAC;AAAA,EACnE,CAAC;AACH,CAAC;;;ACjDD,IAAIC,QAAO;AACX,IAAIC,gBAAe,CAAC,SAAS,aAAa;AACnC,IAAI,eAA8B,wBAAQD,OAAMC,eAAc,UAAQ;AAC3E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,aAAAC;AAAA,EACF,IAAI;AAkCJ,SAAOD,OAAMF,OAAM;AAAA,IACjB,2CAA2C,OAAKG,aAAY,GAAG,CAAC;AAAA,IAChE,QAAQ,OAAK,MAAM;AAAA,IACnB,MAAMD,OAAM,YAAY,UAAQ,OAAKA,OAAM,KAAK,MAAM,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC;AAAA,IAC7E,kBAAkBA,OAAM,YAAY,UAAQ,OAAKE,SAAQ,GAAG,IAAI,CAAC;AAAA,EACnE,CAAC;AACH,CAAC;;;AC7CD,IAAIC,QAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,cAA6B,wBAAQD,OAAMC,gBAAc,UAAQ;AAC1E,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AA8BJ,SAAOA,OAAMF,OAAM;AAAA,IACjB,QAAQ;AAAA,IACR,WAAW,SAASG,WAAU,GAAG;AAC/B,aAAO,EAAE,MAAM;AAAA,IACjB;AAAA,IACA,QAAQ,SAAS,OAAO,GAAG;AACzB,aAAO;AAAA,IACT;AAAA,IACA,UAAU,SAASC,UAAS,GAAG;AAC7B,aAAO;AAAA,IACT;AAAA,IACA,SAAS,SAASC,SAAQ,GAAG;AAC3B,aAAO,EAAE,MAAM;AAAA,IACjB;AAAA,IACA,MAAM,SAAS,KAAK,GAAG;AACrB,aAAO,OAAO,MAAM,EAAE,KAAK;AAAA,IAC7B;AAAA,IACA,kBAAkBH,OAAM,YAAY,UAAQ,OAAKI,SAAQ,GAAG,IAAI,CAAC;AAAA,EACnE,CAAC;AACH,CAAC;;;AC9CM,SAAS,cAAc,GAAG,GAAG,QAAQ,QAAQ;AAClD,SAAO,YAAY,EAAE,IAAI,EAAE,IAAI,QAAQ,MAAM,KAAK,YAAY,EAAE,IAAI,EAAE,IAAI,QAAQ,MAAM;AAC1F;;;ACZO,IAAI,qBAAoC,wBAAQ,gBAAgB,CAAC,OAAO,GAAG,UAAQ;AACxF,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AACJ,SAAO;AAAA,IACL,cAAcA,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAChD,UAAI,CAAC,EAAE,UAAU,CAAC,GAAG;AACnB,cAAM,IAAI,MAAM,0CAA0C;AAAA,MAC5D;AACA,aAAOA,OAAM,KAAK,MAAM,CAAC,EAAE,UAAU,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK;AAAA,IAC1E,CAAC;AAAA,EACH;AACF,CAAC;;;ACRD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,QAAQ;AAC9B,IAAI,oBAAmC,wBAAQD,QAAMC,gBAAc,UAAQ;AAChF,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AACJ,MAAI,eAAe,mBAAmB;AAAA,IACpC,OAAAD;AAAA,EACF,CAAC;AAUD,SAAOA,OAAMF,QAAM;AAAA,IACjB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,aAAO,MAAM;AAAA,IACf;AAAA,IACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM;AAAA,IACvD;AAAA,IACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,aAAO,EAAE,GAAG,CAAC,KAAKC,aAAe,GAAG,GAAGD,QAAO,QAAQA,QAAO,MAAM;AAAA,IACrE;AAAA,IACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,MAAM;AAAA,IACf;AAAA,IACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,aAAO,EAAE,OAAO,CAAC;AAAA,IACnB;AAAA,IACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,aAAO,cAAc,GAAG,GAAGA,QAAO,QAAQA,QAAO,MAAM;AAAA,IACzD;AAAA,EACF,GAAG,YAAY;AACjB,CAAC;AACM,IAAI,0BAA0B,QAAQH,QAAM,CAAC,SAAS,QAAQ,GAAG,WAAS;AAC/E,MAAI;AAAA,IACF,OAAAE;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AACJ,SAAOD,OAAMF,QAAM;AAAA,IACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM;AAAA,IACvD;AAAA,EACF,CAAC;AACH,CAAC;;;AC/CD,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,eAAe,QAAQ;AAC7C,IAAI,0BAAyC,wBAAQD,QAAMC,gBAAc,UAAQ;AACtF,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,aAAAC;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AAyBJ,WAASC,cAAa,MAAM,UAAU;AACpC,QAAI,EAAE,gBAAgBA,gBAAe;AACnC,YAAM,IAAI,YAAY,kDAAkD;AAAA,IAC1E;AACA,QAAI,YAAY,CAAC,SAAS,QAAQ,GAAG;AACnC,YAAM,IAAI,MAAM,uBAAuB,QAAQ;AAAA,IACjD;AACA,QAAI,SAAS,IAAI,GAAG;AAElB,wBAAkB,MAAM,MAAM,QAAQ;AAAA,IACxC,WAAW,QAAQ,QAAQ,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG,KAAK,QAAQ,KAAK,IAAI,GAAG;AAEjF,WAAK,UAAU,KAAK;AACpB,WAAK,SAAS,KAAK;AACnB,WAAK,OAAO,KAAK;AACjB,WAAK,QAAQ,KAAK;AAClB,WAAK,YAAY,YAAY,KAAK;AAAA,IACpC,WAAW,QAAQ,IAAI,GAAG;AAExB,uBAAiB,MAAM,MAAM,QAAQ;AAAA,IACvC,WAAW,MAAM;AAEf,YAAM,IAAI,UAAU,+BAA+B,OAAO,IAAI,IAAI,GAAG;AAAA,IACvE,OAAO;AAEL,WAAK,UAAU,CAAC;AAChB,WAAK,SAAS,CAAC;AACf,WAAK,OAAO,CAAC,CAAC;AACd,WAAK,QAAQ,CAAC,GAAG,CAAC;AAClB,WAAK,YAAY;AAAA,IACnB;AAAA,EACF;AACA,WAAS,kBAAkBC,SAAQ,QAAQ,UAAU;AAEnD,QAAI,OAAO,SAAS,gBAAgB;AAElC,MAAAA,QAAO,UAAU,OAAO,UAAU,MAAM,OAAO,OAAO,IAAI;AAC1D,MAAAA,QAAO,SAAS,MAAM,OAAO,MAAM;AACnC,MAAAA,QAAO,OAAO,MAAM,OAAO,IAAI;AAC/B,MAAAA,QAAO,QAAQ,MAAM,OAAO,KAAK;AACjC,MAAAA,QAAO,YAAY,YAAY,OAAO;AAAA,IACxC,OAAO;AAEL,uBAAiBA,SAAQ,OAAO,QAAQ,GAAG,YAAY,OAAO,SAAS;AAAA,IACzE;AAAA,EACF;AACA,WAAS,iBAAiBA,SAAQ,MAAM,UAAU;AAEhD,IAAAA,QAAO,UAAU,CAAC;AAClB,IAAAA,QAAO,SAAS,CAAC;AACjB,IAAAA,QAAO,OAAO,CAAC;AACf,IAAAA,QAAO,YAAY;AAEnB,QAAI,OAAO,KAAK;AAChB,QAAI,UAAU;AAGd,QAAI,KAAKH;AAET,QAAI,OAAO;AACX,QAAI,SAAS,QAAQ,GAAG;AAEtB,WAAKD,OAAM,KAAKC,cAAa,CAAC,UAAU,QAAQ,CAAC,KAAKA;AAEtD,aAAOD,OAAM,QAAQ,GAAG,QAAQ;AAAA,IAClC;AAGA,QAAI,OAAO,GAAG;AAEZ,UAAI,IAAI;AACR,SAAG;AAED,QAAAI,QAAO,KAAK,KAAKA,QAAO,OAAO,MAAM;AAErC,iBAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAE7B,cAAI,MAAM,KAAK,CAAC;AAEhB,cAAI,QAAQ,GAAG,GAAG;AAEhB,gBAAI,MAAM,KAAK,UAAU,IAAI,QAAQ;AACnC,wBAAU,IAAI;AAAA,YAChB;AAEA,gBAAI,IAAI,IAAI,QAAQ;AAElB,kBAAI,IAAI,IAAI,CAAC;AAEb,kBAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,gBAAAA,QAAO,QAAQ,KAAK,CAAC;AAErB,gBAAAA,QAAO,OAAO,KAAK,CAAC;AAAA,cACtB;AAAA,YACF;AAAA,UACF,OAAO;AAEL,gBAAI,MAAM,KAAK,UAAU,GAAG;AAC1B,wBAAU;AAAA,YACZ;AAEA,gBAAI,CAAC,GAAG,KAAK,IAAI,GAAG;AAElB,cAAAA,QAAO,QAAQ,KAAK,GAAG;AAEvB,cAAAA,QAAO,OAAO,KAAK,CAAC;AAAA,YACtB;AAAA,UACF;AAAA,QACF;AAEA;AAAA,MACF,SAAS,IAAI;AAAA,IACf;AAEA,WAAOA,QAAO,KAAK,UAAU,SAAS;AACpC,MAAAA,QAAO,KAAK,KAAKA,QAAO,OAAO,MAAM;AAAA,IACvC;AAEA,IAAAA,QAAO,QAAQ,CAAC,MAAM,OAAO;AAAA,EAC/B;AACA,EAAAD,cAAa,YAAY,IAAID,QAAO;AAKpC,EAAAC,cAAa,UAAU,qBAAqB,SAAU,MAAM,UAAU;AACpE,WAAO,IAAIA,cAAa,MAAM,QAAQ;AAAA,EACxC;AAKA,SAAO,eAAeA,eAAc,QAAQ;AAAA,IAC1C,OAAO;AAAA,EACT,CAAC;AACD,EAAAA,cAAa,UAAU,cAAcA;AACrC,EAAAA,cAAa,UAAU,OAAO;AAC9B,EAAAA,cAAa,UAAU,iBAAiB;AAWxC,EAAAA,cAAa,UAAU,cAAc,WAAY;AAC/C,WAAO,iBAAiB,KAAK,SAAS,MAAM;AAAA,EAC9C;AAWA,EAAAA,cAAa,UAAU,UAAU,WAAY;AAC3C,WAAO;AAAA,EACT;AAWA,EAAAA,cAAa,UAAU,WAAW,WAAY;AAC5C,WAAO,KAAK;AAAA,EACd;AAQA,EAAAA,cAAa,UAAU,SAAS,SAAU,MAAM,UAAU;AACxD,WAAO,IAAIA,cAAa,MAAM,QAAQ;AAAA,EACxC;AAWA,EAAAA,cAAa,UAAU,UAAU,WAAY;AAE3C,QAAI,OAAO,KAAK,MAAM,CAAC;AACvB,QAAI,UAAU,KAAK,MAAM,CAAC;AAE1B,WAAO,SAAS,KAAK,YAAY,IAAI,KAAK,OAAO,UAAU,OAAO,WAAW;AAAA,EAC/E;AAgBA,EAAAA,cAAa,UAAU,SAAS,SAAU,OAAO,aAAa,cAAc;AAE1E,QAAI,CAAC,KAAK,SAAS;AACjB,YAAM,IAAI,MAAM,+CAA+C;AAAA,IACjE;AAGA,YAAQ,UAAU,QAAQ;AAAA,MACxB,KAAK;AACH,eAAO,WAAW,MAAM,KAAK;AAAA;AAAA,MAG/B,KAAK;AAAA,MACL,KAAK;AACH,eAAO,WAAW,MAAM,OAAO,aAAa,YAAY;AAAA,MAC1D;AACE,cAAM,IAAI,YAAY,2BAA2B;AAAA,IACrD;AAAA,EACF;AACA,WAAS,WAAWC,SAAQ,KAAK;AAE/B,QAAI,CAAC,QAAQ,GAAG,GAAG;AACjB,YAAM,IAAI,UAAU,eAAe;AAAA,IACrC;AACA,QAAI,WAAW,IAAI,SAAS;AAC5B,QAAI,UAAU;AAEZ,aAAOA,QAAO,IAAI,IAAI,IAAI,CAAC;AAAA,IAC7B;AAEA,QAAIC,QAAO,IAAI,KAAK;AACpB,QAAIA,MAAK,WAAWD,QAAO,MAAM,QAAQ;AACvC,YAAM,IAAI,eAAeC,MAAK,QAAQD,QAAO,MAAM,MAAM;AAAA,IAC3D;AAGA,QAAI,GAAG,IAAI,GAAG;AAGd,QAAIE,OAAM,IAAI,IAAI;AAClB,QAAIC,OAAM,IAAI,IAAI;AAClB,SAAK,IAAI,GAAG,KAAKH,QAAO,MAAM,QAAQ,IAAI,IAAI,KAAK;AACjD,oBAAcE,KAAI,CAAC,GAAGF,QAAO,MAAM,CAAC,CAAC;AACrC,oBAAcG,KAAI,CAAC,GAAGH,QAAO,MAAM,CAAC,CAAC;AAAA,IACvC;AAGA,QAAI,UAAUA,QAAO;AACrB,QAAI,SAASA,QAAO;AACpB,QAAI,OAAOA,QAAO;AAGlB,QAAI,OAAO,IAAI,UAAU,CAAC;AAC1B,QAAI,UAAU,IAAI,UAAU,CAAC;AAG7B,QAAI,IAAI,CAAC;AACT,QAAI,KAAK,CAAC;AAGV,aAAS,aAAaI,IAAG,GAAG;AAE1B,SAAGA,EAAC,IAAI,EAAE,CAAC;AAEX,QAAEA,EAAC,IAAI;AAAA,IACT;AACA,QAAI,OAAO,UAAU,IAAI,EAAG,cAAa,MAAM,CAAC,CAAC,CAAC;AAAA,QAAO,MAAK,QAAQ,YAAY;AAGlF,QAAI,SAAS,UAAU,CAAC,IAAI;AAC5B,QAAI,QAAQ,CAAC;AACb,QAAI,MAAM,CAAC;AAGX,aAAS,gBAAgB,GAAG;AAE1B,UAAI,KAAK,MAAM,MAAM;AAErB,WAAK,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,KAAK;AAE/C,YAAI,OAAO,CAAC;AAEZ,YAAI,EAAE,CAAC,MAAM,MAAM;AAEjB,gBAAM,KAAK,GAAG,CAAC,CAAC;AAEhB,cAAI,QAAQ;AACV,mBAAO,KAAK,QAAQ,CAAC,CAAC;AAAA,UACxB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,OAAO,UAAU,OAAO,EAAG,iBAAgB,OAAO;AAAA,QAAO,SAAQ,QAAQ,eAAe;AAE5F,QAAI,KAAK,MAAM,MAAM;AAGrB,WAAO,IAAIL,cAAa;AAAA,MACtB;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAAE;AAAA,MACA,UAAUD,QAAO;AAAA,IACnB,CAAC;AAAA,EACH;AACA,WAAS,WAAWA,SAAQ,OAAO,WAAW,cAAc;AAE1D,QAAI,CAAC,SAAS,MAAM,YAAY,MAAM;AACpC,YAAM,IAAI,UAAU,eAAe;AAAA,IACrC;AAGA,QAAI,QAAQ,MAAM,KAAK;AACvB,QAAI,WAAW,MAAM,SAAS;AAG9B,QAAI;AACJ,QAAI,SAAS,SAAS,GAAG;AAEvB,cAAQ,UAAU,KAAK;AAEvB,kBAAY,UAAU,QAAQ;AAAA,IAChC,OAAO;AAEL,cAAQ,UAAU,SAAS;AAAA,IAC7B;AAGA,QAAI,UAAU;AAEZ,UAAI,MAAM,WAAW,GAAG;AACtB,cAAM,IAAI,UAAU,iBAAiB;AAAA,MACvC;AAEA,MAAAA,QAAO,IAAI,MAAM,IAAI,GAAG,WAAW,YAAY;AAAA,IACjD,OAAO;AAEL,UAAI,MAAM,WAAW,KAAK,MAAM,WAAW,GAAG;AAC5C,cAAM,IAAI,eAAe,MAAM,QAAQA,QAAO,MAAM,QAAQ,GAAG;AAAA,MACjE;AAGA,UAAI,MAAM,SAAS,MAAM,QAAQ;AAE/B,YAAI,IAAI;AACR,YAAI,QAAQ;AACZ,eAAO,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,GAAG;AACvC;AAAA,QACF;AACA,eAAO,MAAM,CAAC,MAAM,GAAG;AACrB;AACA;AAAA,QACF;AAEA,oBAAY,UAAU,WAAW,MAAM,QAAQ,OAAO,KAAK;AAAA,MAC7D;AAGA,UAAI,CAAC,gBAAgB,OAAO,KAAK,GAAG;AAClC,cAAM,IAAI,eAAe,OAAO,OAAO,GAAG;AAAA,MAC5C;AAGA,UAAI,MAAM,WAAW,GAAG;AAEtB,YAAIK,SAAQ,MAAM,UAAU,CAAC;AAC7B,sBAAcA,QAAO,CAAC,WAAW,aAAa;AAC5C,wBAAc,SAAS;AACvB,UAAAL,QAAO,IAAI,CAAC,WAAW,CAAC,GAAG,UAAU,SAAS,CAAC,CAAC,GAAG,YAAY;AAAA,QACjE,CAAC;AAAA,MACH,OAAO;AAEL,YAAI,sBAAsB,MAAM,UAAU,CAAC;AAC3C,YAAI,uBAAuB,MAAM,UAAU,CAAC;AAC5C,sBAAc,qBAAqB,CAAC,gBAAgB,kBAAkB;AACpE,wBAAc,cAAc;AAC5B,wBAAc,sBAAsB,CAAC,iBAAiB,mBAAmB;AACvE,0BAAc,eAAe;AAC7B,YAAAA,QAAO,IAAI,CAAC,gBAAgB,eAAe,GAAG,UAAU,cAAc,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,GAAG,YAAY;AAAA,UAC5G,CAAC;AAAA,QACH,CAAC;AAAA,MACH;AAAA,IACF;AACA,WAAOA;AACP,aAAS,cAAcM,QAAO,UAAU;AAEtC,UAAI,SAASA,MAAK,EAAG,UAASA,QAAO,CAAC,CAAC,CAAC;AAAA,UAAO,CAAAA,OAAM,QAAQ,QAAQ;AAAA,IACvE;AAAA,EACF;AAQA,EAAAP,cAAa,UAAU,MAAM,SAAU,OAAO;AAC5C,QAAI,CAAC,QAAQ,KAAK,GAAG;AACnB,YAAM,IAAI,UAAU,gBAAgB;AAAA,IACtC;AACA,QAAI,MAAM,WAAW,KAAK,MAAM,QAAQ;AACtC,YAAM,IAAI,eAAe,MAAM,QAAQ,KAAK,MAAM,MAAM;AAAA,IAC1D;AAGA,QAAI,CAAC,KAAK,SAAS;AACjB,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAGA,QAAI,IAAI,MAAM,CAAC;AACf,QAAI,IAAI,MAAM,CAAC;AAGf,kBAAc,GAAG,KAAK,MAAM,CAAC,CAAC;AAC9B,kBAAc,GAAG,KAAK,MAAM,CAAC,CAAC;AAG9B,QAAI,IAAI,eAAe,GAAG,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,MAAM;AAErE,QAAI,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK,KAAK,OAAO,CAAC,MAAM,GAAG;AAChD,aAAO,KAAK,QAAQ,CAAC;AAAA,IACvB;AACA,WAAO;AAAA,EACT;AAYA,EAAAA,cAAa,UAAU,MAAM,SAAU,OAAO,GAAG,cAAc;AAC7D,QAAI,CAAC,QAAQ,KAAK,GAAG;AACnB,YAAM,IAAI,UAAU,gBAAgB;AAAA,IACtC;AACA,QAAI,MAAM,WAAW,KAAK,MAAM,QAAQ;AACtC,YAAM,IAAI,eAAe,MAAM,QAAQ,KAAK,MAAM,MAAM;AAAA,IAC1D;AAGA,QAAI,CAAC,KAAK,SAAS;AACjB,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAGA,QAAI,IAAI,MAAM,CAAC;AACf,QAAI,IAAI,MAAM,CAAC;AAGf,QAAI,OAAO,KAAK,MAAM,CAAC;AACvB,QAAI,UAAU,KAAK,MAAM,CAAC;AAG1B,QAAI,KAAKF;AAET,QAAI,OAAO;AACX,QAAI,SAAS,KAAK,SAAS,GAAG;AAE5B,WAAKD,OAAM,KAAKC,cAAa,CAAC,KAAK,WAAW,KAAK,SAAS,CAAC,KAAKA;AAElE,aAAOD,OAAM,QAAQ,GAAG,KAAK,SAAS;AAAA,IACxC;AAGA,QAAI,IAAI,OAAO,KAAK,IAAI,UAAU,GAAG;AAEnC,MAAAW,SAAQ,MAAM,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,OAAO,GAAG,YAAY;AAE3E,aAAO,KAAK,MAAM,CAAC;AACnB,gBAAU,KAAK,MAAM,CAAC;AAAA,IACxB;AAGA,kBAAc,GAAG,IAAI;AACrB,kBAAc,GAAG,OAAO;AAGxB,QAAI,IAAI,eAAe,GAAG,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,MAAM;AAErE,QAAI,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK,KAAK,OAAO,CAAC,MAAM,GAAG;AAEhD,UAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,aAAK,QAAQ,CAAC,IAAI;AAAA,MACpB,OAAO;AAEL,gBAAQ,GAAG,GAAG,KAAK,SAAS,KAAK,QAAQ,KAAK,IAAI;AAAA,MACpD;AAAA,IACF,OAAO;AACL,UAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,gBAAQ,GAAG,GAAG,GAAG,GAAG,KAAK,SAAS,KAAK,QAAQ,KAAK,IAAI;AAAA,MAC1D;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,WAAS,eAAe,GAAG,KAAK,QAAQ,OAAO;AAE7C,QAAI,SAAS,QAAQ,GAAG;AACtB,aAAO;AAAA,IACT;AAEA,aAAS,IAAI,KAAK,IAAI,QAAQ,KAAK;AAEjC,UAAI,MAAM,CAAC,MAAM,GAAG;AAClB,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACA,WAAS,QAAQ,GAAG,GAAG,QAAQ,OAAO,KAAK;AAEzC,WAAO,OAAO,GAAG,CAAC;AAClB,UAAM,OAAO,GAAG,CAAC;AAEjB,aAAS,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACvC,UAAI,CAAC;AAAA,IACP;AAAA,EACF;AACA,WAAS,QAAQ,GAAG,GAAG,GAAG,GAAG,QAAQ,OAAO,KAAK;AAE/C,WAAO,OAAO,GAAG,GAAG,CAAC;AAErB,UAAM,OAAO,GAAG,GAAG,CAAC;AAEpB,aAAS,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACvC,UAAI,CAAC;AAAA,IACP;AAAA,EACF;AAiBA,EAAAR,cAAa,UAAU,SAAS,SAAUE,OAAM,cAAc,MAAM;AAElE,QAAI,CAAC,aAAaA,KAAI,GAAG;AACvB,YAAM,IAAI,UAAU,0BAA0B;AAAA,IAChD;AAGA,QAAI,YAAYA,MAAK,QAAQ,EAAE,IAAI,WAAS;AAC1C,aAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI;AAAA,IACjE,CAAC;AACD,QAAI,UAAU,WAAW,GAAG;AAC1B,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AAGA,cAAU,QAAQ,SAAU,OAAO;AACjC,UAAI,CAAC,SAAS,KAAK,KAAK,CAAC,UAAU,KAAK,KAAK,QAAQ,GAAG;AACtD,cAAM,IAAI,UAAU,yDAA8DO,QAAO,SAAS,IAAI,GAAG;AAAA,MAC3G;AAAA,IACF,CAAC;AAGD,QAAI,IAAI,OAAO,KAAK,MAAM,IAAI;AAE9B,WAAOD,SAAQ,GAAG,UAAU,CAAC,GAAG,UAAU,CAAC,GAAG,YAAY;AAAA,EAC5D;AACA,WAASA,SAAQP,SAAQ,MAAM,SAAS,cAAc;AAEpD,QAAI,QAAQ,gBAAgB;AAG5B,QAAI,KAAKH;AAET,QAAI,OAAO;AACX,QAAI,SAASG,QAAO,SAAS,GAAG;AAE9B,WAAKJ,OAAM,KAAKC,cAAa,CAACG,QAAO,WAAWA,QAAO,SAAS,CAAC,KAAKH;AAEtE,aAAOD,OAAM,QAAQ,GAAGI,QAAO,SAAS;AAExC,cAAQJ,OAAM,QAAQ,OAAOI,QAAO,SAAS;AAAA,IAC/C;AAGA,QAAI,MAAM,CAAC,GAAG,OAAO,IAAI;AAGzB,QAAI,IAAIA,QAAO,MAAM,CAAC;AACtB,QAAI,IAAIA,QAAO,MAAM,CAAC;AACtB,QAAI,GAAG,GAAG;AAGV,QAAI,UAAU,GAAG;AAEf,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,QAAAA,QAAO,KAAK,CAAC,IAAIA,QAAO,QAAQ;AAEhC,YAAI,KAAK;AAEP,eAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,YAAAA,QAAO,QAAQ,KAAK,KAAK;AAEzB,YAAAA,QAAO,OAAO,KAAK,CAAC;AAAA,UACtB;AAAA,QACF;AAAA,MACF;AAEA,MAAAA,QAAO,KAAK,OAAO,IAAIA,QAAO,QAAQ;AAAA,IACxC,WAAW,UAAU,GAAG;AAEtB,MAAAA,QAAO,KAAK,OAAO,UAAU,GAAG,IAAI,OAAO;AAE3C,MAAAA,QAAO,QAAQ,OAAOA,QAAO,KAAK,OAAO,GAAGA,QAAO,QAAQ,MAAM;AACjE,MAAAA,QAAO,OAAO,OAAOA,QAAO,KAAK,OAAO,GAAGA,QAAO,OAAO,MAAM;AAAA,IACjE;AAEA,QAAI;AAGJ,QAAI,OAAO,GAAG;AAEZ,UAAI,KAAK;AAEP,YAAI,IAAI;AAER,aAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,UAAAA,QAAO,KAAK,CAAC,IAAIA,QAAO,KAAK,CAAC,IAAI;AAElC,cAAIA,QAAO,KAAK,IAAI,CAAC,IAAI;AAEzB,cAAI,IAAI;AAER,eAAK,IAAI,GAAG,IAAI,MAAM,KAAK,KAAK;AAE9B,YAAAA,QAAO,QAAQ,OAAO,IAAI,GAAG,GAAG,KAAK;AAErC,YAAAA,QAAO,OAAO,OAAO,IAAI,GAAG,GAAG,CAAC;AAEhC;AAAA,UACF;AAAA,QACF;AAEA,QAAAA,QAAO,KAAK,CAAC,IAAIA,QAAO,QAAQ;AAAA,MAClC;AAAA,IACF,WAAW,OAAO,GAAG;AAEnB,UAAI,IAAI;AAER,WAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,QAAAA,QAAO,KAAK,CAAC,IAAIA,QAAO,KAAK,CAAC,IAAI;AAElC,YAAI,KAAKA,QAAO,KAAK,CAAC;AACtB,YAAI,KAAKA,QAAO,KAAK,IAAI,CAAC,IAAI;AAE9B,aAAK,IAAI,IAAI,IAAI,IAAI,KAAK;AAExB,cAAIA,QAAO,OAAO,CAAC;AAEnB,cAAI,IAAI,OAAO,GAAG;AAEhB,YAAAA,QAAO,QAAQ,OAAO,GAAG,CAAC;AAE1B,YAAAA,QAAO,OAAO,OAAO,GAAG,CAAC;AAEzB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,MAAAA,QAAO,KAAK,CAAC,IAAIA,QAAO,QAAQ;AAAA,IAClC;AAEA,IAAAA,QAAO,MAAM,CAAC,IAAI;AAClB,IAAAA,QAAO,MAAM,CAAC,IAAI;AAElB,WAAOA;AAAA,EACT;AAkBA,EAAAD,cAAa,UAAU,UAAU,SAAU,OAAO,MAAM;AAEtD,QAAI,CAAC,QAAQ,KAAK,GAAG;AACnB,YAAM,IAAI,UAAU,gBAAgB;AAAA,IACtC;AACA,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,IAAI,MAAM,wDAAwD;AAAA,IAC1E;AAGA,UAAM,QAAQ,SAAU,OAAO;AAC7B,UAAI,CAAC,SAAS,KAAK,KAAK,CAAC,UAAU,KAAK,KAAK,SAAS,MAAM,UAAU,GAAG;AACvE,cAAM,IAAI,UAAU,+DAAoES,QAAO,KAAK,IAAI,GAAG;AAAA,MAC7G;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,KAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC;AAChD,YAAQ,qBAAqB,OAAO,aAAa;AACjD,QAAI,YAAY,MAAM,CAAC,IAAI,MAAM,CAAC;AAGlC,QAAI,kBAAkB,WAAW;AAC/B,YAAM,IAAI,MAAM,qEAAqE;AAAA,IACvF;AAGA,QAAI,IAAI,OAAO,KAAK,MAAM,IAAI;AAG9B,QAAI,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAC5D,aAAO;AAAA,IACT;AAGA,QAAI,WAAW,CAAC;AAChB,aAAS,IAAI,GAAG,IAAI,EAAE,KAAK,QAAQ,KAAK;AACtC,eAAS,IAAI,GAAG,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,KAAK;AAClD,iBAAS,KAAK,CAAC;AAAA,MACjB;AAAA,IACF;AAGA,QAAI,SAAS,EAAE,QAAQ,MAAM;AAG7B,QAAI,WAAW,EAAE,OAAO,MAAM;AAG9B,aAAS,KAAK,GAAG,KAAK,EAAE,OAAO,QAAQ,MAAM;AAC3C,UAAI,KAAK,SAAS,EAAE;AACpB,UAAI,KAAK,SAAS,EAAE;AACpB,UAAI,OAAO,KAAK,EAAE,MAAM,CAAC,IAAI;AAC7B,eAAS,EAAE,IAAI,OAAO,MAAM,CAAC;AAC7B,eAAS,EAAE,IAAI,KAAK,MAAM,OAAO,MAAM,CAAC,CAAC;AAAA,IAC3C;AASA,MAAE,QAAQ,SAAS;AACnB,MAAE,OAAO,SAAS;AAClB,MAAE,KAAK,SAAS,MAAM,CAAC,IAAI;AAC3B,MAAE,QAAQ,MAAM,MAAM;AACtB,aAAS,MAAM,GAAG,MAAM,EAAE,KAAK,QAAQ,OAAO;AAC5C,QAAE,KAAK,GAAG,IAAI;AAAA,IAChB;AAIA,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAI,MAAM,SAAS,CAAC;AACpB,UAAI,KAAK,SAAS,CAAC;AACnB,UAAI,IAAI,OAAO,CAAC;AAChB,UAAI,IAAI,eAAe,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,KAAK,CAAC,GAAG,EAAE,MAAM;AAChE,cAAQ,GAAG,KAAK,IAAI,GAAG,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI;AAAA,IACpD;AAIA,WAAO;AAAA,EACT;AAOA,EAAAT,cAAa,UAAU,QAAQ,WAAY;AACzC,QAAI,IAAI,IAAIA,cAAa;AAAA,MACvB,QAAQ,KAAK,UAAU,MAAM,KAAK,OAAO,IAAI;AAAA,MAC7C,OAAO,MAAM,KAAK,MAAM;AAAA,MACxB,KAAK,MAAM,KAAK,IAAI;AAAA,MACpB,MAAM,MAAM,KAAK,KAAK;AAAA,MACtB,UAAU,KAAK;AAAA,IACjB,CAAC;AACD,WAAO;AAAA,EACT;AAOA,EAAAA,cAAa,UAAU,OAAO,WAAY;AACxC,WAAO,KAAK,MAAM,MAAM,CAAC;AAAA,EAC3B;AAaA,EAAAA,cAAa,UAAU,MAAM,SAAU,UAAU,WAAW;AAE1D,QAAI,CAAC,KAAK,SAAS;AACjB,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAEA,QAAI,KAAK;AAET,QAAI,OAAO,KAAK,MAAM,CAAC;AACvB,QAAI,UAAU,KAAK,MAAM,CAAC;AAC1B,QAAI,eAAe,iBAAiB,UAAU,IAAI,KAAK;AAEvD,QAAI,SAAS,SAASU,QAAO,GAAG,GAAG,GAAG;AAEpC,aAAO,aAAa,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;AAAA,IACtC;AAEA,WAAO,KAAK,MAAM,GAAG,OAAO,GAAG,GAAG,UAAU,GAAG,QAAQ,SAAS;AAAA,EAClE;AAMA,WAAS,KAAKT,SAAQ,QAAQ,QAAQ,WAAW,WAAW,UAAU,WAAW;AAE/E,QAAI,SAAS,CAAC;AACd,QAAI,QAAQ,CAAC;AACb,QAAI,MAAM,CAAC;AAGX,QAAI,KAAKH;AAET,QAAI,OAAO;AACX,QAAI,SAASG,QAAO,SAAS,GAAG;AAE9B,WAAKJ,OAAM,KAAKC,cAAa,CAACG,QAAO,WAAWA,QAAO,SAAS,CAAC,KAAKH;AAEtE,aAAOD,OAAM,QAAQ,GAAGI,QAAO,SAAS;AAAA,IAC1C;AAGA,QAAI,SAAS,SAASS,QAAO,GAAG,GAAG,GAAG;AAEpC,UAAIC,SAAQ,SAAS,GAAG,GAAG,CAAC;AAE5B,UAAI,CAAC,GAAGA,QAAO,IAAI,GAAG;AAEpB,eAAO,KAAKA,MAAK;AAEjB,cAAM,KAAK,CAAC;AAAA,MACd;AAAA,IACF;AAEA,aAAS,IAAI,WAAW,KAAK,WAAW,KAAK;AAE3C,UAAI,KAAK,OAAO,MAAM;AAEtB,UAAI,KAAKV,QAAO,KAAK,CAAC;AACtB,UAAI,KAAKA,QAAO,KAAK,IAAI,CAAC;AAC1B,UAAI,WAAW;AAEb,iBAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,cAAI,IAAIA,QAAO,OAAO,CAAC;AAEvB,cAAI,KAAK,UAAU,KAAK,QAAQ;AAE9B,mBAAOA,QAAO,QAAQ,CAAC,GAAG,IAAI,QAAQ,IAAI,SAAS;AAAA,UACrD;AAAA,QACF;AAAA,MACF,OAAO;AAEL,YAAI,UAAU,CAAC;AACf,iBAAS,KAAK,IAAI,KAAK,IAAI,MAAM;AAC/B,cAAI,MAAMA,QAAO,OAAO,EAAE;AAC1B,kBAAQ,GAAG,IAAIA,QAAO,QAAQ,EAAE;AAAA,QAClC;AAIA,iBAAS,MAAM,QAAQ,OAAO,QAAQ,OAAO;AAC3C,cAAI,QAAQ,OAAO,UAAU,QAAQ,GAAG,IAAI;AAC5C,iBAAO,OAAO,MAAM,QAAQ,IAAI,SAAS;AAAA,QAC3C;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,OAAO,MAAM;AAEtB,WAAO,IAAID,cAAa;AAAA,MACtB;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAM,CAAC,SAAS,SAAS,GAAG,YAAY,YAAY,CAAC;AAAA,IACvD,CAAC;AAAA,EACH;AAYA,EAAAA,cAAa,UAAU,UAAU,SAAU,UAAU,WAAW;AAE9D,QAAI,CAAC,KAAK,SAAS;AACjB,YAAM,IAAI,MAAM,gDAAgD;AAAA,IAClE;AAEA,QAAI,KAAK;AAET,QAAI,OAAO,KAAK,MAAM,CAAC;AACvB,QAAI,UAAU,KAAK,MAAM,CAAC;AAC1B,QAAI,eAAe,iBAAiB,UAAU,IAAI,SAAS;AAE3D,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,UAAI,KAAK,KAAK,KAAK,CAAC;AACpB,UAAI,KAAK,KAAK,KAAK,IAAI,CAAC;AACxB,UAAI,WAAW;AAEb,iBAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,cAAI,IAAI,KAAK,OAAO,CAAC;AAIrB,uBAAa,GAAG,KAAK,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;AAAA,QAC7C;AAAA,MACF,OAAO;AAEL,YAAI,SAAS,CAAC;AACd,iBAAS,MAAM,IAAI,MAAM,IAAI,OAAO;AAClC,cAAI,MAAM,KAAK,OAAO,GAAG;AACzB,iBAAO,GAAG,IAAI,KAAK,QAAQ,GAAG;AAAA,QAChC;AAIA,iBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,cAAI,QAAQ,OAAO,SAAS,OAAO,GAAG,IAAI;AAC1C,uBAAa,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE;AAAA,QACrC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAMA,EAAAA,cAAa,UAAU,OAAO,QAAQ,IAAI,aAAa;AACrD,QAAI,CAAC,KAAK,SAAS;AACjB,YAAM,IAAI,MAAM,sCAAsC;AAAA,IACxD;AACA,QAAI,UAAU,KAAK,MAAM,CAAC;AAC1B,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,UAAI,KAAK,KAAK,KAAK,CAAC;AACpB,UAAI,KAAK,KAAK,KAAK,IAAI,CAAC;AACxB,eAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,YAAI,IAAI,KAAK,OAAO,CAAC;AACrB,cAAM;AAAA,UACJ,OAAO,KAAK,QAAQ,CAAC;AAAA,UACrB,OAAO,CAAC,GAAG,CAAC;AAAA,QACd;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAOA,EAAAA,cAAa,UAAU,UAAU,WAAY;AAC3C,WAAO,SAAS,KAAK,SAAS,KAAK,QAAQ,KAAK,MAAM,KAAK,OAAO,IAAI;AAAA,EACxE;AAOA,EAAAA,cAAa,UAAU,UAAU,WAAY;AAC3C,WAAO,SAAS,KAAK,SAAS,KAAK,QAAQ,KAAK,MAAM,KAAK,OAAO,KAAK;AAAA,EACzE;AACA,WAAS,SAAS,QAAQ,OAAO,KAAKE,OAAM,MAAM;AAEhD,QAAI,OAAOA,MAAK,CAAC;AACjB,QAAI,UAAUA,MAAK,CAAC;AAEpB,QAAI,IAAI,CAAC;AAET,QAAI,GAAG;AAEP,SAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,QAAE,CAAC,IAAI,CAAC;AACR,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAC5B,UAAE,CAAC,EAAE,CAAC,IAAI;AAAA,MACZ;AAAA,IACF;AAGA,SAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,UAAI,KAAK,IAAI,CAAC;AACd,UAAI,KAAK,IAAI,IAAI,CAAC;AAElB,eAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,YAAI,MAAM,CAAC;AAEX,UAAE,CAAC,EAAE,CAAC,IAAI,SAAS,OAAO,MAAM,OAAO,CAAC,CAAC,IAAI,OAAO,CAAC,IAAI;AAAA,MAC3D;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAWA,EAAAF,cAAa,UAAU,SAAS,SAAU,SAAS;AAEjD,QAAI,OAAO,KAAK,MAAM,CAAC;AACvB,QAAI,UAAU,KAAK,MAAM,CAAC;AAE1B,QAAI,UAAU,KAAK,QAAQ;AAE3B,QAAI,MAAM,oBAAoBS,QAAO,MAAM,OAAO,IAAI,QAAQA,QAAO,SAAS,OAAO,IAAI,gBAAgBA,QAAO,SAAS,OAAO,IAAI;AAEpI,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,UAAI,KAAK,KAAK,KAAK,CAAC;AACpB,UAAI,KAAK,KAAK,KAAK,IAAI,CAAC;AAExB,eAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,YAAI,IAAI,KAAK,OAAO,CAAC;AAErB,eAAO,YAAYA,QAAO,GAAG,OAAO,IAAI,OAAOA,QAAO,GAAG,OAAO,IAAI,YAAY,KAAK,UAAUA,QAAO,KAAK,QAAQ,CAAC,GAAG,OAAO,IAAI;AAAA,MACpI;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAOA,EAAAT,cAAa,UAAU,WAAW,WAAY;AAC5C,WAAOS,QAAO,KAAK,QAAQ,CAAC;AAAA,EAC9B;AAOA,EAAAT,cAAa,UAAU,SAAS,WAAY;AAC1C,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,QAAQ,KAAK;AAAA,MACb,OAAO,KAAK;AAAA,MACZ,KAAK,KAAK;AAAA,MACV,MAAM,KAAK;AAAA,MACX,UAAU,KAAK;AAAA,IACjB;AAAA,EACF;AAUA,EAAAA,cAAa,UAAU,WAAW,SAAU,GAAG;AAE7C,QAAI,GAAG;AAEL,UAAI,YAAY,CAAC,GAAG;AAClB,YAAI,EAAE,SAAS;AAAA,MACjB;AAEA,UAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AACjC,cAAM,IAAI,UAAU,2CAA2C;AAAA,MACjE;AAAA,IACF,OAAO;AAEL,UAAI;AAAA,IACN;AACA,QAAI,SAAS,IAAI,IAAI,IAAI;AACzB,QAAI,OAAO,IAAI,IAAI,CAAC,IAAI;AAGxB,QAAI,OAAO,KAAK,MAAM,CAAC;AACvB,QAAI,UAAU,KAAK,MAAM,CAAC;AAG1B,QAAI,IAAI,KAAK,IAAI,OAAO,MAAM,UAAU,MAAM;AAG9C,QAAI,SAAS,CAAC;AACd,QAAI,QAAQ,CAAC;AACb,QAAI,MAAM,CAAC;AAEX,QAAI,CAAC,IAAI;AAET,aAAS,IAAI,QAAQ,IAAI,WAAW,OAAO,SAAS,GAAG,KAAK;AAE1D,UAAI,KAAK,KAAK,KAAK,CAAC;AACpB,UAAI,KAAK,KAAK,KAAK,IAAI,CAAC;AAExB,eAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,YAAI,IAAI,KAAK,OAAO,CAAC;AAErB,YAAI,MAAM,IAAI,SAAS,MAAM;AAE3B,iBAAO,KAAK,KAAK,QAAQ,CAAC,CAAC;AAE3B,gBAAM,OAAO,SAAS,CAAC,IAAI,IAAI;AAE/B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,KAAK,OAAO,MAAM;AAEtB,WAAO,IAAIA,cAAa;AAAA,MACtB;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAM,CAAC,GAAG,CAAC;AAAA,IACb,CAAC;AAAA,EACH;AAUA,EAAAA,cAAa,WAAW,SAAU,MAAM;AACtC,WAAO,IAAIA,cAAa,IAAI;AAAA,EAC9B;AAcA,EAAAA,cAAa,WAAW,SAAUE,OAAM,OAAO,GAAG,cAAc,UAAU;AACxE,QAAI,CAAC,QAAQA,KAAI,GAAG;AAClB,YAAM,IAAI,UAAU,gCAAgC;AAAA,IACtD;AACA,QAAIA,MAAK,WAAW,GAAG;AACrB,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AAGA,IAAAA,QAAOA,MAAK,IAAI,SAAU,GAAG;AAE3B,UAAI,YAAY,CAAC,GAAG;AAElB,YAAI,EAAE,SAAS;AAAA,MACjB;AAEA,UAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG;AAC1C,cAAM,IAAI,MAAM,uCAAuC;AAAA,MACzD;AACA,aAAO;AAAA,IACT,CAAC;AAGD,QAAI,GAAG;AAEL,UAAI,YAAY,CAAC,GAAG;AAClB,YAAI,EAAE,SAAS;AAAA,MACjB;AAEA,UAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AACjC,cAAM,IAAI,UAAU,2CAA2C;AAAA,MACjE;AAAA,IACF,OAAO;AAEL,UAAI;AAAA,IACN;AAGA,QAAI,KAAKJ;AAET,QAAI,OAAO;AACX,QAAI,SAAS,QAAQ,GAAG;AAEtB,WAAKD,OAAM,KAAKC,cAAa,CAAC,UAAU,QAAQ,CAAC,KAAKA;AAEtD,aAAOD,OAAM,QAAQ,GAAG,QAAQ;AAAA,IAClC;AACA,QAAI,SAAS,IAAI,IAAI,IAAI;AACzB,QAAI,OAAO,IAAI,IAAI,CAAC,IAAI;AAGxB,QAAI,OAAOK,MAAK,CAAC;AACjB,QAAI,UAAUA,MAAK,CAAC;AAGpB,QAAI,IAAI,KAAK,IAAI,OAAO,MAAM,UAAU,MAAM;AAG9C,QAAI;AAGJ,QAAI,QAAQ,KAAK,GAAG;AAElB,UAAI,MAAM,WAAW,GAAG;AAEtB,cAAM,IAAI,MAAM,4BAA4B;AAAA,MAC9C;AAEA,eAAS,SAASU,QAAOP,IAAG;AAE1B,eAAO,MAAMA,EAAC;AAAA,MAChB;AAAA,IACF,WAAW,SAAS,KAAK,GAAG;AAE1B,UAAI,KAAK,MAAM,KAAK;AAEpB,UAAI,GAAG,WAAW,KAAK,GAAG,CAAC,MAAM,GAAG;AAElC,cAAM,IAAI,MAAM,uBAAuB;AAAA,MACzC;AAEA,eAAS,SAASO,QAAOP,IAAG;AAE1B,eAAO,MAAM,IAAI,CAACA,EAAC,CAAC;AAAA,MACtB;AAAA,IACF,OAAO;AAEL,eAAS,SAASO,UAAS;AAEzB,eAAO;AAAA,MACT;AAAA,IACF;AAGA,QAAI,SAAS,CAAC;AACd,QAAI,QAAQ,CAAC;AACb,QAAI,MAAM,CAAC;AAGX,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,UAAI,KAAK,OAAO,MAAM;AAEtB,UAAI,IAAI,IAAI;AAEZ,UAAI,KAAK,KAAK,IAAI,GAAG;AAEnB,YAAI,IAAI,OAAO,CAAC;AAEhB,YAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,gBAAM,KAAK,IAAI,IAAI;AAEnB,iBAAO,KAAK,CAAC;AAAA,QACf;AAAA,MACF;AAAA,IACF;AAEA,QAAI,KAAK,OAAO,MAAM;AAEtB,WAAO,IAAIZ,cAAa;AAAA,MACtB;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAM,CAAC,MAAM,OAAO;AAAA,IACtB,CAAC;AAAA,EACH;AAWA,EAAAA,cAAa,UAAU,WAAW,SAAU,GAAG,GAAG;AAEhD,QAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClE,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AAEA,QAAI,KAAK,MAAM,WAAW,GAAG;AAC3B,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AAEA,kBAAc,GAAG,KAAK,MAAM,CAAC,CAAC;AAC9B,kBAAc,GAAG,KAAK,MAAM,CAAC,CAAC;AAG9B,IAAAA,cAAa,UAAU,GAAG,GAAG,KAAK,MAAM,CAAC,GAAG,KAAK,SAAS,KAAK,QAAQ,KAAK,IAAI;AAEhF,WAAO;AAAA,EACT;AAWA,EAAAA,cAAa,cAAc,SAAU,GAAG,QAAQ,OAAO,KAAK,UAAU;AAEpE,QAAI,KAAK,IAAI,CAAC;AACd,QAAI,KAAK,IAAI,IAAI,CAAC;AAGlB,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,eAAS,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,IAC9B;AAAA,EACF;AAYA,EAAAA,cAAa,YAAY,SAAU,GAAG,GAAG,SAAS,QAAQ,OAAO,KAAK;AAEpE,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,UAAI,KAAK,IAAI,CAAC;AACd,UAAI,KAAK,IAAI,IAAI,CAAC;AAElB,UAAI,KAAK,eAAe,GAAG,IAAI,IAAI,KAAK;AAExC,UAAI,KAAK,eAAe,GAAG,IAAI,IAAI,KAAK;AAExC,UAAI,KAAK,MAAM,KAAK,MAAM,MAAM,EAAE,MAAM,KAAK,MAAM,EAAE,MAAM,GAAG;AAE5D,YAAI,QAAQ;AACV,cAAI,IAAI,OAAO,EAAE;AACjB,iBAAO,EAAE,IAAI,OAAO,EAAE;AACtB,iBAAO,EAAE,IAAI;AAAA,QACf;AAEA;AAAA,MACF;AAEA,UAAI,KAAK,MAAM,MAAM,EAAE,MAAM,MAAM,MAAM,MAAM,MAAM,EAAE,MAAM,IAAI;AAE/D,YAAI,KAAK,SAAS,OAAO,EAAE,IAAI;AAE/B,cAAM,OAAO,IAAI,GAAG,CAAC;AACrB,YAAI,QAAQ;AACV,iBAAO,OAAO,IAAI,GAAG,EAAE;AAAA,QACzB;AAEA,cAAM,OAAO,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC;AACtC,YAAI,QAAQ;AACV,iBAAO,OAAO,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,QACzC;AAEA;AAAA,MACF;AAEA,UAAI,KAAK,MAAM,MAAM,EAAE,MAAM,MAAM,MAAM,MAAM,MAAM,EAAE,MAAM,IAAI;AAE/D,YAAI,KAAK,SAAS,OAAO,EAAE,IAAI;AAE/B,cAAM,OAAO,IAAI,GAAG,CAAC;AACrB,YAAI,QAAQ;AACV,iBAAO,OAAO,IAAI,GAAG,EAAE;AAAA,QACzB;AAEA,cAAM,OAAO,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC;AACtC,YAAI,QAAQ;AACV,iBAAO,OAAO,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAOA;AACT,GAAG;AAAA,EACD,SAAS;AACX,CAAC;;;ACt+CD,IAAIa,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AAO3B,SAAS,yBAAyB,OAAO;AACvC,MAAI,2BAA2B,MAAM,MAAM,wCAAwC;AACnF,MAAI,0BAA0B;AAC5B,QAAI,QAAQ;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,IACR,EAAE,yBAAyB,CAAC,CAAC;AAC7B,QAAI,cAAc,yBAAyB,CAAC;AAC5C,QAAI,iBAAiB,yBAAyB,CAAC;AAC/C,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAOA,SAAS,8BAA8B,OAAO;AAC5C,MAAI,IAAI,SAAS,MAAM,aAAa,MAAM,KAAK;AAC/C,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,MAAM,eAAe,QAAQ,KAAK;AACpD,QAAI,aAAa,SAAS,MAAM,eAAe,CAAC,GAAG,MAAM,KAAK;AAC9D,SAAK,aAAa,KAAK,IAAI,MAAM,OAAO,IAAI,CAAC;AAAA,EAC/C;AACA,MAAI,SAAS,IAAI;AACjB,MAAI,MAAM,MAAM,GAAG;AACjB,UAAM,IAAI,YAAY,aAAa,MAAM,QAAQ,yBAAyB;AAAA,EAC5E;AACA,SAAO;AACT;AACO,IAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AA0BJ,MAAIC,UAASD,OAAM,UAAU;AAAA,IAC3B,IAAI,SAAS,IAAI;AACf,aAAO;AAAA,IACT;AAAA,IACA,QAAQ,SAASC,QAAO,GAAG;AACzB,aAAO;AAAA,IACT;AAAA,IACA,QAAQ,SAAS,OAAO,GAAG;AACzB,UAAI,MAAM,MAAO,QAAO;AACxB,UAAI,wBAAwB,yBAAyB,CAAC;AACtD,UAAI,uBAAuB;AACzB,eAAO,8BAA8B,qBAAqB;AAAA,MAC5D;AACA,UAAIC,QAAO;AACX,UAAI,sBAAsB,EAAE,MAAM,+BAA+B;AACjE,UAAI,qBAAqB;AAGvB,QAAAA,QAAO,OAAO,oBAAoB,CAAC,CAAC;AACpC,YAAI,oBAAoB,CAAC;AAAA,MAC3B;AACA,UAAI,MAAM,OAAO,CAAC;AAClB,UAAI,MAAM,GAAG,GAAG;AACd,cAAM,IAAI,YAAY,aAAa,IAAI,yBAAyB;AAAA,MAClE;AACA,UAAI,qBAAqB;AAGvB,YAAI,MAAM,KAAKA,QAAO,GAAG;AAEvB,gBAAM,IAAI,YAAY,WAAY,OAAO,GAAG,mBAAoB,CAAC;AAAA,QACnE;AAEA,YAAI,OAAO,MAAMA,QAAO,IAAI;AAC1B,gBAAM,MAAM,KAAKA;AAAA,QACnB;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IACA,WAAW,SAASC,WAAU,GAAG;AAC/B,aAAO,EAAE,SAAS;AAAA,IACpB;AAAA,IACA,QAAQ,SAAS,OAAO,GAAG;AACzB,aAAO,OAAO,CAAC;AAAA,IACjB;AAAA,IACA,UAAU,SAASC,UAAS,GAAG;AAC7B,aAAO,EAAE,QAAQ;AAAA,IACnB;AAAA,IACA,MAAMJ,OAAM,YAAY,UAAQ,OAAK;AACnC,UAAIK,SAAQ,EAAE,MAAM;AACpB,MAAAA,OAAM,QAAQ,KAAK,EAAE,KAAK;AAC1B,aAAOA;AAAA,IACT,CAAC;AAAA,IACD,MAAM,SAAS,MAAM,GAAG;AACtB,aAAO;AAAA,IACT;AAAA,IACA,uBAAuB,SAAS,kBAAkB,MAAM,eAAe;AACrE,aAAO,KAAK,SAAS,aAAa;AAAA,IACpC;AAAA,IACA,kBAAkBL,OAAM,YAAY,UAAQ,OAAKM,SAAQ,GAAG,IAAI,CAAC;AAAA,EACnE,CAAC;AAOD,EAAAL,QAAO,WAAW,SAAU,MAAM;AAChC,WAAO,WAAW,KAAK,KAAK;AAAA,EAC9B;AACA,SAAOA;AACT,CAAC;;;ACnJD,IAAIM,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,WAAW;AACjC,IAAI,kBAAiC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,WAAAC;AAAA,EACF,IAAI;AA0BJ,SAAOD,OAAM,aAAa;AAAA,IACxB,IAAI,SAAS,IAAI;AACf,aAAO,IAAIC,WAAU,CAAC;AAAA,IACxB;AAAA,IACA,QAAQ,SAASC,QAAO,GAAG;AAEzB,aAAO,IAAID,WAAU,IAAI,EAAE;AAAA,IAC7B;AAAA,IACA,QAAQ,SAAS,OAAO,GAAG;AACzB,UAAI,sBAAsB,EAAE,MAAM,+BAA+B;AACjE,UAAI,qBAAqB;AAEvB,YAAIE,QAAO,oBAAoB,CAAC;AAChC,YAAI,IAAIF,WAAU,oBAAoB,CAAC,CAAC;AACxC,YAAI,aAAa,IAAIA,WAAU,CAAC,EAAE,IAAI,OAAOE,KAAI,CAAC;AAClD,YAAI,EAAE,GAAG,WAAW,IAAI,CAAC,CAAC,GAAG;AAC3B,gBAAM,IAAI,YAAY,WAAY,OAAO,GAAG,mBAAoB,CAAC;AAAA,QACnE;AACA,YAAI,mBAAmB,IAAIF,WAAU,CAAC,EAAE,IAAI,OAAOE,KAAI,IAAI,CAAC;AAC5D,YAAI,EAAE,IAAI,gBAAgB,GAAG;AAC3B,iBAAO,EAAE,IAAI,UAAU;AAAA,QACzB,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO,IAAIF,WAAU,CAAC;AAAA,IACxB;AAAA,IACA,WAAW,SAASA,WAAU,GAAG;AAE/B,aAAO;AAAA,IACT;AAAA,IACA,QAAQ,SAAS,OAAO,GAAG;AACzB,aAAO,IAAIA,WAAU,EAAE,SAAS,CAAC;AAAA,IACnC;AAAA,IACA,MAAMD,OAAM,YAAY,UAAQ,OAAK;AACnC,UAAII,SAAQ,EAAE,MAAM;AACpB,MAAAA,OAAM,QAAQ,KAAK,EAAE,KAAK;AAC1B,aAAOA;AAAA,IACT,CAAC;AAAA,IACD,UAAU,SAASC,UAAS,GAAG;AAC7B,aAAO,IAAIJ,WAAU,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,OAAO,EAAE,CAAC,CAAC,EAAE,MAAM,OAAO,EAAE,CAAC,CAAC;AAAA,IACtE;AAAA,IACA,MAAM,SAAS,MAAM,IAAI;AACvB,aAAO,IAAIA,WAAU,CAAC;AAAA,IACxB;AAAA,IACA,kBAAkBD,OAAM,YAAY,UAAQ,OAAKM,SAAQ,GAAG,IAAI,CAAC;AAAA,EACnE,CAAC;AACH,CAAC;;;AC/ED,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,SAAS;AAC/B,IAAI,gBAA+B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC5E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,SAAAC;AAAA,EACF,IAAI;AA6CJ,SAAOD,OAAM,WAAW;AAAA,IACtB,IAAI,SAAS,IAAI;AACf,aAAOC,SAAQ;AAAA,IACjB;AAAA,IACA,QAAQ,SAASC,QAAO,GAAG;AACzB,aAAO,IAAID,SAAQ,GAAG,CAAC;AAAA,IACzB;AAAA,IACA,kBAAkB,SAAS,cAAcE,KAAIC,KAAI;AAC/C,aAAO,IAAIH,SAAQE,KAAIC,GAAE;AAAA,IAC3B;AAAA;AAAA,IAEA,wBAAwB,SAAS,oBAAoBD,KAAIC,KAAI;AAC3D,aAAO,IAAIH,SAAQE,IAAG,SAAS,GAAGC,IAAG,SAAS,CAAC;AAAA,IACjD;AAAA,IACA,UAAU,SAASC,UAAS,GAAG;AAC7B,aAAO,IAAIJ,SAAQ,EAAE,QAAQ,GAAG,CAAC;AAAA,IACnC;AAAA,IACA,SAAS,SAASA,SAAQ,GAAG;AAC3B,aAAO,EAAE,MAAM;AAAA,IACjB;AAAA,IACA,QAAQ,SAAS,OAAO,GAAG;AACzB,aAAOA,SAAQ,CAAC;AAAA,IAClB;AAAA,IACA,MAAM,SAAS,MAAM,GAAG;AACtB,aAAOA,SAAQ,CAAC;AAAA,IAClB;AAAA,IACA,QAAQ,SAASK,QAAO,GAAG;AACzB,UAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B,eAAO,IAAIL,SAAQ,EAAE,IAAI,EAAE,EAAE;AAAA,MAC/B;AACA,UAAI,OAAO,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS,GAAG;AACtD,eAAO,IAAIA,SAAQ,CAAC;AAAA,MACtB;AACA,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AAAA,IACA,kBAAkBD,OAAM,YAAY,UAAQ,OAAKO,SAAQ,GAAG,IAAI,CAAC;AAAA,EACnE,CAAC;AACH,CAAC;;;ACxFD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU;AAChC,IAAI,iBAAgC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC7E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,UAAAC;AAAA,EACF,IAAI;AA8CJ,SAAOD,OAAM,YAAY;AAAA,IACvB,QAAQ,SAASE,QAAO,GAAG;AACzB,UAAI,CAAC,OAAO,SAAS,CAAC,KAAK,MAAM,CAAC,GAAG;AACnC,cAAM,IAAI,MAAM,IAAI,sCAAsC;AAAA,MAC5D;AACA,aAAO,IAAID,UAAS,CAAC;AAAA,IACvB;AAAA,IACA,QAAQ,SAAS,OAAO,GAAG;AACzB,aAAO,IAAIA,UAAS,CAAC;AAAA,IACvB;AAAA,IACA,kBAAkB,SAAS,cAAc,WAAW,aAAa;AAC/D,aAAO,IAAIA,UAAS,WAAW,WAAW;AAAA,IAC5C;AAAA,IACA,kBAAkB,SAAS,cAAc,WAAW,aAAa;AAC/D,aAAO,IAAIA,UAAS,WAAW,WAAW;AAAA,IAC5C;AAAA,IACA,MAAM,SAAS,MAAM,GAAG;AACtB,aAAO,IAAIA,UAAS,CAAC;AAAA,IACvB;AAAA,IACA,WAAW,SAASE,WAAU,GAAG;AAC/B,aAAO,IAAIF,UAAS,EAAE,SAAS,CAAC;AAAA,IAClC;AAAA,IACA,QAAQ,SAAS,OAAO,GAAG;AACzB,aAAO,IAAIA,UAAS,EAAE,SAAS,CAAC;AAAA,IAClC;AAAA,IACA,UAAU,SAASA,UAAS,GAAG;AAC7B,aAAO;AAAA,IACT;AAAA,IACA,MAAMD,OAAM,YAAY,UAAQ,OAAK;AACnC,UAAII,SAAQ,EAAE,MAAM;AACpB,MAAAA,OAAM,QAAQ,KAAK,EAAE,KAAK;AAC1B,aAAOA;AAAA,IACT,CAAC;AAAA,IACD,QAAQ,SAASC,QAAO,GAAG;AACzB,aAAO,IAAIJ,UAAS,CAAC;AAAA,IACvB;AAAA,IACA,kBAAkBD,OAAM,YAAY,UAAQ,OAAKM,SAAQ,GAAG,IAAI,CAAC;AAAA,EACnE,CAAC;AACH,CAAC;;;AC3FD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,cAAc;AAC7D,IAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,aAAAC;AAAA,IACA,cAAAC;AAAA,EACF,IAAI;AAwCJ,SAAOH,OAAMF,QAAM;AAAA,IACjB,IAAI,SAAS,IAAI;AACf,aAAO,QAAQ,CAAC,CAAC;AAAA,IACnB;AAAA,IACA,QAAQ,SAAS,OAAOM,SAAQ;AAC9B,aAAO,QAAQ,CAAC,GAAGA,OAAM;AAAA,IAC3B;AAAA,IACA,kBAAkB,SAAS,cAAcA,SAAQ,UAAU;AACzD,aAAO,QAAQ,CAAC,GAAGA,SAAQ,QAAQ;AAAA,IACrC;AAAA,IACA,OAAO,SAASC,OAAM,MAAM;AAC1B,aAAO,QAAQ,IAAI;AAAA,IACrB;AAAA,IACA,QAAQ,SAASJ,QAAO,MAAM;AAC5B,aAAO,QAAQ,MAAM,KAAK,QAAQ,CAAC;AAAA,IACrC;AAAA,IACA,0BAA0B;AAAA,IAC1B,kCAAkC;AAAA,EACpC,CAAC;AAUD,WAAS,QAAQ,MAAMG,SAAQ,UAAU;AAEvC,QAAIA,YAAW,WAAWA,YAAW,aAAaA,YAAW,QAAW;AACtE,aAAO,IAAIF,aAAY,MAAM,QAAQ;AAAA,IACvC;AACA,QAAIE,YAAW,UAAU;AACvB,aAAO,IAAID,cAAa,MAAM,QAAQ;AAAA,IACxC;AACA,UAAM,IAAI,UAAU,yBAAyB,KAAK,UAAUC,OAAM,IAAI,GAAG;AAAA,EAC3E;AACF,CAAC;;;ACtFD,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,WAAW,MAAM;AACjD,IAAI,0BAAyC,wBAAQD,QAAMC,gBAAc,UAAQ;AACtF,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,SAAAC;AAAA,IACA,MAAAC;AAAA,EACF,IAAI;AAuBJ,SAAOH,OAAMF,QAAM;AAAA,IACjB,YAAY,SAASM,OAAM,KAAK;AAC9B,aAAO,aAAa,GAAG;AAAA,IACzB;AAAA,IACA,aAAa,SAASC,QAAO,KAAK;AAChC,aAAOJ,QAAO,aAAa,IAAI,IAAI,OAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;AAAA,IACvD;AAAA;AAAA,EAGF,CAAC;AACD,WAAS,aAAa,KAAK;AACzB,QAAI,IAAI,WAAW,EAAG,OAAM,IAAI,UAAU,sDAAsD;AAChG,QAAI,IAAI,+BAA+B,IAAI,CAAC,CAAC;AAG7C,QAAI,SAAS,CAAC;AACd,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAO,CAAC,IAAI,CAAC;AAAA,IACf;AAGA,aAAS,OAAO,KAAK;AACnB,UAAI,YAAY,+BAA+B,GAAG;AAClD,UAAI,cAAc,GAAG;AACnB,cAAM,IAAI,UAAU,wCAAwC,IAAI,KAAK,cAAS,YAAY,EAAE;AAAA,MAC9F;AACA,UAAI,IAAIC,SAAQ,GAAG;AAGnB,eAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,eAAO,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC;AAAA,MACvB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,WAAS,+BAA+B,KAAK;AAC3C,QAAI,IAAIC,MAAK,GAAG;AAChB,QAAI,EAAE,WAAW,GAAG;AAElB,aAAO,EAAE,CAAC;AAAA,IACZ,WAAW,EAAE,WAAW,GAAG;AAEzB,UAAI,EAAE,CAAC,MAAM,GAAG;AAEd,eAAO,EAAE,CAAC;AAAA,MACZ,WAAW,EAAE,CAAC,MAAM,GAAG;AAErB,eAAO,EAAE,CAAC;AAAA,MACZ,OAAO;AACL,cAAM,IAAI,UAAU,gDAAgD;AAAA,MACtE;AAAA,IACF,OAAO;AACL,YAAM,IAAI,UAAU,qDAAqD;AAAA,IAC3E;AAAA,EACF;AACF,CAAC;;;ACpFD,IAAIG,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,mBAAkC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC/E,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAwBJ,SAAOA,OAAMF,QAAM;AAAA,IACjB,QAAQ;AAAA,IACR,kCAAkC,OAAK,EAAE,IAAI;AAAA,IAC7C,QAAQ,OAAK,CAAC;AAAA,IACd,MAAME,OAAM,YAAY,UAAQ,OAAK;AACnC,UAAI,MAAM,EAAE,MAAM;AAClB,UAAI,QAAQA,OAAM,KAAK,MAAM,IAAI,UAAU,CAAC,EAAE,EAAE,KAAK;AACrD,aAAO;AAAA,IACT,CAAC;AAAA;AAAA,IAED,kBAAkBA,OAAM,YAAY,UAAQ,OAAKC,SAAQ,GAAG,MAAM,IAAI,CAAC;AAAA;AAAA,EAGzE,CAAC;AACH,CAAC;;;AC3CD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAyBJ,SAAOA,OAAMF,QAAM;AAAA,IACjB,QAAQ;AAAA,IACR,yCAAyC,OAAK,EAAE,IAAI;AAAA,IACpD,QAAQ,OAAK,IAAI,KAAK,CAAC,IAAI;AAAA;AAAA,IAE3B,kBAAkBE,OAAM,YAAY,UAAQ,OAAKC,SAAQ,GAAG,MAAM,IAAI,CAAC;AAAA,EACzE,CAAC;AACH,CAAC;;;ACpCD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,WAAW;AACjC,IAAI,kBAAiC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,WAAAC;AAAA,EACF,IAAI;AAsCJ,SAAOD,OAAMF,QAAM;AAAA,IACjB,gDAAgD,SAAS,yCAAyC,KAAK,KAAK,UAAU;AACpH,UAAI,CAACG,WAAU,GAAG,GAAG;AACnB,cAAM,IAAI,UAAU,uCAAuC;AAAA,MAC7D;AACA,UAAIC,QAAO,MAAM,QAAQ,GAAG,IAAI,UAAU,GAAG,IAAI,IAAI,KAAK;AAC1D,UAAI,MAAM,KAAK,OAAOA,MAAK,QAAQ;AACjC,cAAM,IAAI,WAAW,KAAKA,MAAK,MAAM;AAAA,MACvC;AACA,UAAI,SAAS,GAAG,GAAG;AACjB,eAAO,IAAI,OAAO,WAAW,IAAI,QAAQ,GAAG,KAAK,QAAQ,GAAG,IAAI,SAAS,CAAC;AAAA,MAC5E,OAAO;AACL,eAAO,WAAW,KAAK,KAAK,QAAQ;AAAA,MACtC;AAAA,IACF;AAAA,EACF,CAAC;AACH,GAAG;AAAA,EACD,UAAU;AACZ,CAAC;AAUD,SAAS,WAAW,KAAK,KAAK,UAAU;AACtC,MAAI,GAAG,KAAK;AACZ,MAAI,OAAO,GAAG;AACZ,QAAI,CAAC,MAAM,QAAQ,IAAI,CAAC,CAAC,GAAG;AAC1B,aAAO,SAAS,GAAG;AAAA,IACrB,OAAO;AACL,aAAOC,SAAQ,GAAG;AAClB,YAAM,CAAC;AACP,WAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAChC,YAAI,CAAC,IAAI,WAAW,KAAK,CAAC,GAAG,MAAM,GAAG,QAAQ;AAAA,MAChD;AACA,aAAO;AAAA,IACT;AAAA,EACF,OAAO;AACL,UAAM,CAAC;AACP,SAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAC/B,UAAI,CAAC,IAAI,WAAW,IAAI,CAAC,GAAG,MAAM,GAAG,QAAQ;AAAA,IAC/C;AACA,WAAO;AAAA,EACT;AACF;AAQA,SAASA,SAAQ,KAAK;AACpB,MAAI,IAAI,IAAI;AACZ,MAAI,IAAI,IAAI,CAAC,EAAE;AACf,MAAI,GAAG;AACP,MAAI,MAAM,CAAC;AACX,OAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AACtB,QAAI,MAAM,CAAC;AACX,SAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AACtB,UAAI,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;AAAA,IACpB;AACA,QAAI,KAAK,GAAG;AAAA,EACd;AACA,SAAO;AACT;;;ACnHA,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,kBAAiC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9E,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAaJ,SAAOA,OAAMF,QAAM;AAAA,IACjB,kBAAkB;AAAA,IAClB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,aAAO,EAAE,IAAI,CAAC;AAAA,IAChB;AAAA,IACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,aAAO,EAAE,KAAK,CAAC;AAAA,IACjB;AAAA,IACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,IAAI;AAAA,IACb;AAAA,IACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,aAAO,EAAE,IAAI,CAAC;AAAA,IAChB;AAAA,IACA,cAAcE,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAChD,UAAI,EAAE,UAAU,QAAQ,EAAE,UAAU,QAAW;AAC7C,cAAM,IAAI,MAAM,kDAAkD;AAAA,MACpE;AACA,UAAI,EAAE,UAAU,QAAQ,EAAE,UAAU,QAAW;AAC7C,cAAM,IAAI,MAAM,kDAAkD;AAAA,MACpE;AACA,UAAI,CAAC,EAAE,UAAU,CAAC,EAAG,OAAM,IAAI,MAAM,oBAAoB;AACzD,UAAI,MAAM,EAAE,MAAM;AAClB,UAAI,QAAQA,OAAM,KAAK,MAAM,CAAC,IAAI,UAAU,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK;AACjF,UAAI,YAAY;AAChB,aAAO;AAAA,IACT,CAAC;AAAA,EACH,CAAC;AACH,CAAC;;;AC9CD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAaJ,SAAOA,OAAMF,QAAM;AAAA,IACjB,kBAAkB;AAAA,IAClB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,aAAO,EAAE,IAAI,CAAC;AAAA,IAChB;AAAA,IACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,aAAO,EAAE,MAAM,CAAC;AAAA,IAClB;AAAA,IACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,IAAI;AAAA,IACb;AAAA,IACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,aAAO,EAAE,IAAI,CAAC;AAAA,IAChB;AAAA,IACA,cAAcE,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAChD,UAAI,EAAE,UAAU,QAAQ,EAAE,UAAU,QAAW;AAC7C,cAAM,IAAI,MAAM,kDAAkD;AAAA,MACpE;AACA,UAAI,EAAE,UAAU,QAAQ,EAAE,UAAU,QAAW;AAC7C,cAAM,IAAI,MAAM,kDAAkD;AAAA,MACpE;AACA,UAAI,CAAC,EAAE,UAAU,CAAC,EAAG,OAAM,IAAI,MAAM,oBAAoB;AACzD,UAAI,MAAM,EAAE,MAAM;AAClB,UAAI,QAAQA,OAAM,KAAK,MAAM,CAAC,IAAI,UAAU,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK;AACjF,UAAI,YAAY;AAChB,aAAO;AAAA,IACT,CAAC;AAAA,EACH,CAAC;AACH,CAAC;;;AC/CD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,IAAI,sBAAqC,wBAAQD,QAAMC,gBAAc,UAAQ;AAClF,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,aAAAC;AAAA,EACF,IAAI;AAoBJ,SAAO,SAAS,cAAc,GAAG,GAAG,UAAU,SAAS;AAErD,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE;AAGZ,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,oEAAoE;AAAA,IACtF;AAGA,QAAI,OAAO,MAAM,CAAC;AAClB,QAAI,UAAU,MAAM,CAAC;AAGrB,QAAI;AAEJ,QAAI,KAAKA;AAET,QAAI,OAAO;AAEX,QAAI,KAAK;AAGT,QAAI,OAAO,QAAQ,UAAU;AAE3B,WAAK;AAEL,WAAKD,OAAM,KAAKC,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,aAAOD,OAAM,QAAQ,GAAG,EAAE;AAE1B,UAAIA,OAAM,QAAQ,GAAG,EAAE;AAEvB,WAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,IACpC;AAGA,QAAI,UAAU,CAAC;AACf,QAAI,SAAS,CAAC;AACd,QAAI,OAAO,CAAC;AAGZ,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,WAAK,CAAC,IAAI,OAAO;AAEjB,eAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,YAAI,IAAI,OAAO,CAAC;AAEhB,YAAI,IAAI,UAAU,GAAG,GAAG,QAAQ,CAAC,CAAC,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC;AAEtD,YAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,iBAAO,KAAK,CAAC;AACb,kBAAQ,KAAK,CAAC;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAEA,SAAK,OAAO,IAAI,OAAO;AAGvB,WAAO,EAAE,mBAAmB;AAAA,MAC1B,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,KAAK;AAAA,MACL,MAAM,CAAC,MAAM,OAAO;AAAA,MACpB,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AACF,CAAC;;;ACrGD,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,IAAI,sBAAqC,wBAAQD,QAAMC,gBAAc,UAAQ;AAClF,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,aAAAC;AAAA,EACF,IAAI;AAoBJ,SAAO,SAAS,cAAc,GAAG,GAAG,UAAU,SAAS;AAErD,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE;AAGZ,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,oEAAoE;AAAA,IACtF;AAGA,QAAI,OAAO,MAAM,CAAC;AAClB,QAAI,UAAU,MAAM,CAAC;AAGrB,QAAI;AAEJ,QAAI,KAAK;AAGT,QAAI,OAAO,QAAQ,UAAU;AAE3B,WAAK;AAEL,UAAID,OAAM,QAAQ,GAAG,EAAE;AAEvB,WAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,IACpC;AAGA,QAAI,QAAQ,CAAC;AAGb,QAAI,IAAI,CAAC;AAET,QAAI,IAAI,CAAC;AAGT,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,UAAI,OAAO,IAAI;AAEf,eAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,YAAI,IAAI,OAAO,CAAC;AAEhB,UAAE,CAAC,IAAI,QAAQ,CAAC;AAChB,UAAE,CAAC,IAAI;AAAA,MACT;AAEA,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAE7B,YAAI,MAAM,GAAG;AAEX,gBAAM,CAAC,IAAI,CAAC;AAAA,QACd;AAEA,YAAI,EAAE,CAAC,MAAM,MAAM;AAEjB,gBAAM,CAAC,EAAE,CAAC,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC;AAAA,QAClD,OAAO;AAEL,gBAAM,CAAC,EAAE,CAAC,IAAI,UAAU,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC;AAAA,QAC5C;AAAA,MACF;AAAA,IACF;AAGA,WAAO,IAAIC,aAAY;AAAA,MACrB,MAAM;AAAA,MACN,MAAM,CAAC,MAAM,OAAO;AAAA,MACpB,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AACF,CAAC;;;ACtGD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,qBAAoC,wBAAQD,QAAMC,gBAAc,UAAQ;AACjF,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAgBJ,SAAO,SAAS,aAAa,GAAG,GAAG,UAAU,SAAS;AAEpD,QAAI,QAAQ,EAAE;AACd,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE;AAGZ,QAAI;AAEJ,QAAI,KAAK;AAGT,QAAI,OAAO,QAAQ,UAAU;AAE3B,WAAK;AAEL,UAAIA,OAAM,QAAQ,GAAG,EAAE;AAEvB,WAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,IACpC;AAGA,QAAI,QAAQ,MAAM,SAAS,IAAI,SAAS,IAAI,GAAG,OAAO,MAAM,CAAC,GAAG,OAAO,GAAG,OAAO,IAAI,CAAC;AAGtF,WAAO,EAAE,kBAAkB;AAAA,MACzB,MAAM;AAAA,MACN,MAAM,MAAM,KAAK;AAAA,MACjB,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAGA,WAAS,SAAS,GAAG,OAAO,GAAG,GAAG,IAAI,IAAI,SAAS;AAEjD,QAAI,KAAK,CAAC;AAEV,QAAI,UAAU,EAAE,SAAS,GAAG;AAE1B,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,WAAG,CAAC,IAAI,UAAU,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,EAAE;AAAA,MAC9C;AAAA,IACF,OAAO;AAEL,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,WAAG,CAAC,IAAI,SAAS,GAAG,QAAQ,GAAG,GAAG,EAAE,QAAQ,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,OAAO;AAAA,MACpE;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF,CAAC;;;ACzED,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,sBAAqC,wBAAQD,QAAMC,gBAAc,UAAQ;AAClF,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAoBJ,SAAO,SAAS,cAAc,aAAa,cAAc,UAAU,SAAS;AAE1E,QAAI,QAAQ,YAAY;AACxB,QAAI,QAAQ,YAAY;AACxB,QAAI,MAAM,YAAY,aAAa,YAAY,YAAY;AAE3D,QAAI,UAAU,aAAa;AAC3B,QAAI,SAAS,aAAa;AAC1B,QAAI,OAAO,aAAa;AACxB,QAAI,QAAQ,aAAa;AACzB,QAAI,MAAM,aAAa,aAAa,aAAa,UAAU,SAAY,aAAa,YAAY,aAAa,YAAY;AAGzH,QAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,YAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,IACrD;AAGA,QAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,YAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,IACzG;AAGA,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,oEAAoE;AAAA,IACtF;AAGA,QAAI,OAAO,MAAM,CAAC;AAClB,QAAI,UAAU,MAAM,CAAC;AAGrB,QAAI;AAEJ,QAAI,OAAO;AAEX,QAAI,KAAK;AAGT,QAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAE7D,WAAK;AAEL,aAAOA,OAAM,QAAQ,GAAG,EAAE;AAE1B,WAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,IACpC;AAGA,QAAI,QAAQ,CAAC;AAGb,aAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAE7B,YAAM,CAAC,IAAI,CAAC;AAAA,IACd;AAGA,QAAI,IAAI,CAAC;AAET,QAAI,IAAI,CAAC;AAGT,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,UAAI,OAAO,IAAI;AAEf,eAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,YAAI,IAAI,OAAO,CAAC;AAEhB,UAAE,CAAC,IAAI,UAAU,GAAG,QAAQ,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;AACzE,UAAE,CAAC,IAAI;AAAA,MACT;AAEA,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAE7B,YAAI,EAAE,CAAC,MAAM,MAAM;AAEjB,gBAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,QACnB,OAAO;AAEL,gBAAM,CAAC,EAAE,CAAC,IAAI,UAAU,GAAG,MAAM,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI;AAAA,QACtE;AAAA,MACF;AAAA,IACF;AAGA,WAAO,YAAY,kBAAkB;AAAA,MACnC,MAAM;AAAA,MACN,MAAM,CAAC,MAAM,OAAO;AAAA,MACpB,UAAU,QAAQ,YAAY,aAAa,QAAQ,aAAa,YAAY,KAAK;AAAA,IACnF,CAAC;AAAA,EACH;AACF,CAAC;;;ACvHD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,IAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,aAAAC;AAAA,EACF,IAAI;AAmBJ,SAAO,SAAS,eAAe,GAAG,GAAG,UAAU;AAE7C,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAG7E,QAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,YAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,IACrD;AAGA,QAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,YAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,IACzG;AAGA,QAAI,OAAO,MAAM,CAAC;AAClB,QAAI,UAAU,MAAM,CAAC;AAGrB,QAAI;AAEJ,QAAI,KAAKA;AAET,QAAI,OAAO;AAEX,QAAI,KAAK;AAGT,QAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAE7D,WAAK;AAEL,WAAKD,OAAM,KAAKC,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,aAAOD,OAAM,QAAQ,GAAG,EAAE;AAE1B,WAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,IACpC;AAGA,QAAI,UAAU,WAAW,UAAU,CAAC,IAAI;AACxC,QAAI,SAAS,CAAC;AACd,QAAI,OAAO,CAAC;AAGZ,QAAI,KAAK,UAAU,CAAC,IAAI;AACxB,QAAI,KAAK,UAAU,CAAC,IAAI;AAExB,QAAI,KAAK,CAAC;AACV,QAAI,KAAK,CAAC;AAGV,QAAI,GAAG,GAAG,GAAG;AAGb,SAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,WAAK,CAAC,IAAI,OAAO;AAEjB,UAAI,OAAO,IAAI;AAEf,WAAK,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,KAAK;AAE/C,YAAI,OAAO,CAAC;AAEZ,eAAO,KAAK,CAAC;AAEb,WAAG,CAAC,IAAI;AAER,YAAI,IAAI;AACN,aAAG,CAAC,IAAI,QAAQ,CAAC;AAAA,QACnB;AAAA,MACF;AAEA,WAAK,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,KAAK;AAE/C,YAAI,OAAO,CAAC;AAEZ,YAAI,GAAG,CAAC,MAAM,MAAM;AAElB,iBAAO,KAAK,CAAC;AAAA,QACf;AAEA,WAAG,CAAC,IAAI;AAER,YAAI,IAAI;AACN,aAAG,CAAC,IAAI,QAAQ,CAAC;AAAA,QACnB;AAAA,MACF;AAEA,UAAI,SAAS;AAEX,YAAI,KAAK,CAAC;AAEV,eAAO,IAAI,OAAO,QAAQ;AAExB,cAAI,OAAO,CAAC;AAEZ,cAAI,MAAM,GAAG,CAAC;AACd,cAAI,MAAM,GAAG,CAAC;AAEd,cAAI,QAAQ,QAAQ,QAAQ,MAAM;AAEhC,gBAAI,KAAK,QAAQ,OAAO,GAAG,CAAC,IAAI;AAChC,gBAAI,KAAK,QAAQ,OAAO,GAAG,CAAC,IAAI;AAEhC,gBAAI,KAAK,GAAG,IAAI,EAAE;AAElB,gBAAI,CAAC,GAAG,IAAI,IAAI,GAAG;AAEjB,sBAAQ,KAAK,EAAE;AAEf;AAAA,YACF,OAAO;AAEL,qBAAO,OAAO,GAAG,CAAC;AAAA,YACpB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,SAAK,OAAO,IAAI,OAAO;AAGvB,WAAO,EAAE,mBAAmB;AAAA,MAC1B,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,KAAK;AAAA,MACL,MAAM,CAAC,MAAM,OAAO;AAAA,MACpB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,IAC9D,CAAC;AAAA,EACH;AACF,CAAC;;;ACxKD,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,qBAAoC,wBAAQD,QAAMC,gBAAc,UAAQ;AACjF,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAeJ,SAAO,SAAS,aAAa,GAAG,GAAG,UAAU;AAE3C,QAAI,QAAQ,EAAE;AACd,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE;AAEZ,QAAI,QAAQ,EAAE;AACd,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE;AAEZ,QAAI,QAAQ,CAAC;AAGb,QAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,YAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,IACrD;AAGA,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAErC,UAAI,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AACzB,cAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,MACzG;AAEA,YAAM,CAAC,IAAI,MAAM,CAAC;AAAA,IACpB;AAGA,QAAI;AAEJ,QAAI,KAAK;AAGT,QAAI,OAAO,QAAQ,YAAY,QAAQ,KAAK;AAE1C,WAAK;AAEL,WAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,IACpC;AAGA,QAAI,QAAQ,MAAM,SAAS,IAAI,SAAS,IAAI,GAAG,OAAO,MAAM,CAAC,GAAG,OAAO,KAAK,IAAI,CAAC;AAGjF,WAAO,EAAE,kBAAkB;AAAA,MACzB,MAAM;AAAA,MACN,MAAM;AAAA,MACN,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAGA,WAAS,SAAS,GAAG,OAAO,GAAG,GAAG,IAAI,IAAI;AAExC,QAAI,KAAK,CAAC;AAEV,QAAI,UAAU,EAAE,SAAS,GAAG;AAE1B,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,WAAG,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,MACxB;AAAA,IACF,OAAO;AAEL,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,WAAG,CAAC,IAAI,SAAS,GAAG,QAAQ,GAAG,GAAG,EAAE,QAAQ,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,MAC9D;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF,CAAC;;;AChFM,SAAS,UAAU,GAAG,GAAG;AAC9B,MAAI,gBAAgB,EAAE,KAAK,GAAG,EAAE,KAAK,CAAC,GAAG;AAEvC,WAAO,CAAC,GAAG,CAAC;AAAA,EACd;AAGA,MAAI,UAAU,eAAe,EAAE,KAAK,GAAG,EAAE,KAAK,CAAC;AAG/C,SAAO,CAAC,GAAG,CAAC,EAAE,IAAI,OAAK,aAAa,GAAG,OAAO,CAAC;AACjD;AAUA,SAAS,aAAa,GAAGC,OAAM;AAC7B,MAAI,gBAAgB,EAAE,KAAK,GAAGA,KAAI,GAAG;AACnC,WAAO;AAAA,EACT;AACA,SAAO,EAAE,OAAO,YAAY,EAAE,QAAQ,GAAGA,KAAI,GAAG,EAAE,SAAS,CAAC;AAC9D;;;AClCA,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,QAAQ;AAC9B,IAAI,6BAA4C,wBAAQD,QAAMC,gBAAc,UAAQ;AACzF,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AACJ,MAAI,eAAe,mBAAmB;AAAA,IACpC,OAAAD;AAAA,EACF,CAAC;AACD,MAAI,eAAe,mBAAmB;AAAA,IACpC,OAAAA;AAAA,EACF,CAAC;AAmBD,SAAO,SAAS,qBAAqB,SAAS;AAC5C,QAAI,OAAO,QAAQ;AACnB,QAAI,KAAK,QAAQ,MAAM,QAAQ;AAC/B,QAAI;AACJ,QAAI,MAAM;AAER,yBAAmB;AAAA,QACjB,4BAA4B,CAAC,GAAG,MAAM,aAAa,GAAG,UAAU,GAAG,CAAC,GAAG,IAAI;AAAA,QAC3E,gBAAgB,CAAC,GAAG,MAAM,aAAa,GAAG,UAAUC,QAAO,CAAC,GAAGA,QAAO,CAAC,CAAC,GAAG,IAAI,EAAE,QAAQ;AAAA,QACzF,sBAAsB,CAAC,GAAG,MAAM,aAAa,GAAG,UAAUA,QAAO,CAAC,GAAG,CAAC,GAAG,IAAI;AAAA,QAC7E,sBAAsB,CAAC,GAAG,MAAM,aAAa,GAAG,UAAU,GAAGA,QAAO,CAAC,CAAC,GAAG,IAAI;AAAA,MAC/E;AAEA,UAAI,QAAQ,IAAI;AACd,yBAAiB,4BAA4B,IAAI,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,UAAU,GAAG,CAAC,GAAG,MAAM,KAAK;AAAA,MACvG;AACA,UAAI,QAAQ,IAAI;AACd,yBAAiB,2BAA2B,IAAI,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,UAAU,GAAG,CAAC,GAAG,MAAM,KAAK;AACpG,yBAAiB,qBAAqB,IAAI,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,UAAUA,QAAO,CAAC,GAAG,CAAC,GAAG,MAAM,KAAK;AAAA,MACxG;AACA,UAAI,IAAI;AACN,yBAAiB,2BAA2B,IAAI,CAAC,GAAG,MAAM,GAAG,GAAG,UAAU,GAAG,CAAC,GAAG,MAAM,IAAI;AAC3F,yBAAiB,qBAAqB,IAAI,CAAC,GAAG,MAAM,GAAG,GAAG,UAAUA,QAAO,CAAC,GAAG,CAAC,GAAG,MAAM,IAAI;AAAA,MAC/F;AAAA,IACF,OAAO;AAGL,yBAAmB;AAAA,QACjB,4BAA4BD,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAC9D,iBAAO,aAAa,GAAG,UAAU,GAAG,CAAC,GAAG,IAAI;AAAA,QAC9C,CAAC;AAAA,QACD,gBAAgBA,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAClD,iBAAO,aAAa,GAAG,UAAUC,QAAO,CAAC,GAAGA,QAAO,CAAC,CAAC,GAAG,IAAI,EAAE,QAAQ;AAAA,QACxE,CAAC;AAAA,QACD,sBAAsBD,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AACxD,iBAAO,aAAa,GAAG,UAAUC,QAAO,CAAC,GAAG,CAAC,GAAG,IAAI;AAAA,QACtD,CAAC;AAAA,QACD,sBAAsBD,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AACxD,iBAAO,aAAa,GAAG,UAAU,GAAGC,QAAO,CAAC,CAAC,GAAG,IAAI;AAAA,QACtD,CAAC;AAAA,MACH;AAEA,UAAI,QAAQ,IAAI;AACd,yBAAiB,4BAA4B,IAAID,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AACnF,iBAAO,QAAQ,GAAG,GAAG,UAAU,GAAG,CAAC,GAAG,MAAM,KAAK;AAAA,QACnD,CAAC;AAAA,MACH;AACA,UAAI,QAAQ,IAAI;AACd,yBAAiB,2BAA2B,IAAIA,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAClF,iBAAO,QAAQ,GAAG,GAAG,UAAU,GAAG,CAAC,GAAG,MAAM,KAAK;AAAA,QACnD,CAAC;AACD,yBAAiB,qBAAqB,IAAIA,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAC5E,iBAAO,QAAQ,GAAG,GAAG,UAAUC,QAAO,CAAC,GAAG,CAAC,GAAG,MAAM,KAAK;AAAA,QAC3D,CAAC;AAAA,MACH;AACA,UAAI,IAAI;AACN,yBAAiB,2BAA2B,IAAID,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAClF,iBAAO,GAAG,GAAG,UAAU,GAAG,CAAC,GAAG,MAAM,IAAI;AAAA,QAC1C,CAAC;AACD,yBAAiB,qBAAqB,IAAIA,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAC5E,iBAAO,GAAG,GAAG,UAAUC,QAAO,CAAC,GAAG,CAAC,GAAG,MAAM,IAAI;AAAA,QAClD,CAAC;AAAA,MACH;AAAA,IACF;AAGA,QAAI,SAAS,QAAQ,UAAU;AAC/B,QAAI,KAAK,QAAQ,MAAM,QAAQ;AAC/B,QAAI,IAAI;AACN,UAAI,MAAM;AACR,yBAAiB,iBAAiB,MAAM,IAAI,CAAC,GAAG,MAAM,aAAa,GAAG,GAAG,MAAM,KAAK;AACpF,yBAAiB,SAAS,eAAe,IAAI,CAAC,GAAG,MAAM,aAAa,GAAG,GAAG,MAAM,IAAI;AACpF,yBAAiB,WAAW,MAAM,IAAI,CAAC,GAAG,MAAM,aAAaA,QAAO,CAAC,GAAG,GAAG,MAAM,KAAK,EAAE,QAAQ;AAChG,yBAAiB,SAAS,SAAS,IAAI,CAAC,GAAG,MAAM,aAAaA,QAAO,CAAC,GAAG,GAAG,MAAM,IAAI,EAAE,QAAQ;AAAA,MAClG,OAAO;AACL,yBAAiB,iBAAiB,MAAM,IAAID,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAC9E,iBAAO,aAAa,GAAG,GAAG,MAAM,KAAK;AAAA,QACvC,CAAC;AACD,yBAAiB,SAAS,eAAe,IAAIA,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAC/E,iBAAO,aAAa,GAAG,GAAG,MAAM,IAAI;AAAA,QACtC,CAAC;AACD,yBAAiB,WAAW,MAAM,IAAIA,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AACxE,iBAAO,aAAaC,QAAO,CAAC,GAAG,GAAG,MAAM,KAAK,EAAE,QAAQ;AAAA,QACzD,CAAC;AACD,yBAAiB,SAAS,SAAS,IAAID,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AACzE,iBAAO,aAAaC,QAAO,CAAC,GAAG,GAAG,MAAM,IAAI,EAAE,QAAQ;AAAA,QACxD,CAAC;AAAA,MACH;AAAA,IACF;AACA,QAAI,KAAK,QAAQ,OAAO,SAAY,QAAQ,KAAK,QAAQ;AACzD,QAAI,MAAM;AACR,UAAI,QAAQ,IAAI;AACd,yBAAiB,kBAAkB,MAAM,IAAI,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,GAAG,MAAM,KAAK;AAAA,MACrF;AACA,UAAI,IAAI;AACN,yBAAiB,SAAS,gBAAgB,IAAI,CAAC,GAAG,MAAM,GAAG,GAAG,GAAG,MAAM,IAAI;AAAA,MAC7E;AAAA,IACF,OAAO;AACL,UAAI,QAAQ,IAAI;AACd,yBAAiB,kBAAkB,MAAM,IAAID,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAC/E,iBAAO,QAAQ,GAAG,GAAG,GAAG,MAAM,KAAK;AAAA,QACrC,CAAC;AAAA,MACH;AACA,UAAI,IAAI;AACN,yBAAiB,SAAS,gBAAgB,IAAIA,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAChF,iBAAO,GAAG,GAAG,GAAG,MAAM,IAAI;AAAA,QAC5B,CAAC;AAAA,MACH;AAAA,IACF;AAEA,QAAI,QAAQ,KAAK,YAAY;AAC3B,aAAO,kBAAkB,KAAK,UAAU;AAAA,IAC1C;AACA,WAAO;AAAA,EACT;AACF,CAAC;;;ACrJD,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAoBJ,SAAO,SAAS,WAAW,aAAa,cAAc,UAAU,SAAS;AAEvE,QAAI,QAAQ,YAAY;AACxB,QAAI,QAAQ,YAAY;AACxB,QAAI,MAAM,YAAY,aAAa,YAAY,YAAY;AAE3D,QAAI,UAAU,aAAa;AAC3B,QAAI,SAAS,aAAa;AAC1B,QAAI,OAAO,aAAa;AACxB,QAAI,QAAQ,aAAa;AACzB,QAAI,MAAM,aAAa,aAAa,aAAa,UAAU,SAAY,aAAa,YAAY,aAAa,YAAY;AAGzH,QAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,YAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,IACrD;AAGA,QAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,YAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,IACzG;AAGA,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,oEAAoE;AAAA,IACtF;AAGA,QAAI,OAAO,MAAM,CAAC;AAClB,QAAI,UAAU,MAAM,CAAC;AAGrB,QAAI,KAAK,OAAO,QAAQ,YAAY,QAAQ,WAAW,QAAQ,MAAM,MAAM;AAE3E,QAAI,KAAK,KAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC,IAAI;AAG/C,QAAI,GAAG;AAGP,QAAI,QAAQ,CAAC;AAEb,SAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,YAAM,CAAC,IAAI,CAAC;AAAA,IACd;AAGA,QAAI,IAAI,CAAC;AAET,QAAI,IAAI,CAAC;AAGT,SAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,UAAI,OAAO,IAAI;AAEf,eAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,YAAI,OAAO,CAAC;AAEZ,UAAE,CAAC,IAAI,UAAU,GAAG,QAAQ,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;AAEzE,UAAE,CAAC,IAAI;AAAA,MACT;AAEA,WAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AAEzB,YAAI,EAAE,CAAC,MAAM,MAAM;AAEjB,gBAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,QACnB,OAAO;AAEL,gBAAM,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC;AAAA,QAC1B;AAAA,MACF;AAAA,IACF;AAGA,WAAO,YAAY,kBAAkB;AAAA,MACnC,MAAM;AAAA,MACN,MAAM,CAAC,MAAM,OAAO;AAAA,MACpB,UAAU,QAAQ,YAAY,aAAa,QAAQ,aAAa,YAAY,KAAK;AAAA,IACnF,CAAC;AAAA,EACH;AACF,CAAC;;;AC7GD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,IAAI,yBAAwC,wBAAQD,QAAMC,gBAAc,UAAQ;AACrF,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,aAAAC;AAAA,EACF,IAAI;AAmBJ,SAAO,SAAS,iBAAiB,GAAG,GAAG,UAAU;AAE/C,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAG7E,QAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,YAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,IACrD;AAGA,QAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,YAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,IACzG;AAGA,QAAI,OAAO,MAAM,CAAC;AAClB,QAAI,UAAU,MAAM,CAAC;AAGrB,QAAI;AAEJ,QAAI,KAAKA;AAET,QAAI,OAAO;AAEX,QAAI,KAAK;AAGT,QAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAE7D,WAAK;AAEL,WAAKD,OAAM,KAAKC,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,aAAOD,OAAM,QAAQ,GAAG,EAAE;AAE1B,WAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,IACpC;AAGA,QAAI,UAAU,WAAW,UAAU,CAAC,IAAI;AACxC,QAAI,SAAS,CAAC;AACd,QAAI,OAAO,CAAC;AAGZ,QAAI,KAAK,WAAW,UAAU,CAAC,IAAI;AACnC,QAAI,KAAK,WAAW,UAAU,CAAC,IAAI;AAEnC,QAAI,KAAK,CAAC;AACV,QAAI,KAAK,CAAC;AAGV,QAAI,GAAG,GAAG,GAAG,IAAI;AAGjB,SAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,WAAK,CAAC,IAAI,OAAO;AAEjB,UAAI,OAAO,IAAI;AAEf,WAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,YAAI,OAAO,CAAC;AAEZ,eAAO,KAAK,CAAC;AAEb,WAAG,CAAC,IAAI;AAER,YAAI,IAAI;AACN,aAAG,CAAC,IAAI,QAAQ,CAAC;AAAA,QACnB;AAAA,MACF;AAEA,WAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,YAAI,OAAO,CAAC;AAEZ,YAAI,GAAG,CAAC,MAAM,MAAM;AAElB,cAAI,IAAI;AAEN,gBAAI,IAAI,GAAG,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;AAE5B,gBAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,iBAAG,CAAC,IAAI;AAAA,YACV,OAAO;AAEL,iBAAG,CAAC,IAAI;AAAA,YACV;AAAA,UACF;AAAA,QACF,OAAO;AAEL,iBAAO,KAAK,CAAC;AAEb,aAAG,CAAC,IAAI;AAER,cAAI,IAAI;AACN,eAAG,CAAC,IAAI,QAAQ,CAAC;AAAA,UACnB;AAAA,QACF;AAAA,MACF;AAEA,UAAI,MAAM,IAAI;AAEZ,YAAI,KAAK,CAAC;AAEV,eAAO,IAAI,OAAO,QAAQ;AAExB,cAAI,OAAO,CAAC;AAEZ,cAAI,GAAG,CAAC,MAAM,MAAM;AAElB,oBAAQ,CAAC,IAAI,GAAG,CAAC;AAEjB;AAAA,UACF,WAAW,GAAG,CAAC,MAAM,MAAM;AAEzB,oBAAQ,CAAC,IAAI,GAAG,CAAC;AAEjB;AAAA,UACF,OAAO;AAEL,mBAAO,OAAO,GAAG,CAAC;AAAA,UACpB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,SAAK,OAAO,IAAI,OAAO;AAGvB,WAAO,EAAE,mBAAmB;AAAA,MAC1B,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,KAAK;AAAA,MACL,MAAM,CAAC,MAAM,OAAO;AAAA,MACpB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,IAC9D,CAAC;AAAA,EACH;AACF,CAAC;;;ACjLD,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,IAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,aAAAC;AAAA,EACF,IAAI;AAoBJ,SAAO,SAAS,eAAe,GAAG,GAAG,UAAU,SAAS;AAEtD,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE;AAGZ,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,oEAAoE;AAAA,IACtF;AAGA,QAAI,OAAO,MAAM,CAAC;AAClB,QAAI,UAAU,MAAM,CAAC;AAGrB,QAAI;AAEJ,QAAI,KAAK;AAGT,QAAI,OAAO,QAAQ,UAAU;AAE3B,WAAK;AAEL,UAAID,OAAM,QAAQ,GAAG,EAAE;AAEvB,WAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,IACpC;AAGA,QAAI,QAAQ,CAAC;AAGb,QAAI,IAAI,CAAC;AAET,QAAI,IAAI,CAAC;AAGT,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,UAAI,OAAO,IAAI;AAEf,eAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,YAAI,IAAI,OAAO,CAAC;AAEhB,UAAE,CAAC,IAAI,QAAQ,CAAC;AAChB,UAAE,CAAC,IAAI;AAAA,MACT;AAEA,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAE7B,YAAI,MAAM,GAAG;AAEX,gBAAM,CAAC,IAAI,CAAC;AAAA,QACd;AAEA,YAAI,EAAE,CAAC,MAAM,MAAM;AAEjB,gBAAM,CAAC,EAAE,CAAC,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC;AAAA,QAClD,OAAO;AAEL,gBAAM,CAAC,EAAE,CAAC,IAAI;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAGA,WAAO,IAAIC,aAAY;AAAA,MACrB,MAAM;AAAA,MACN,MAAM,CAAC,MAAM,OAAO;AAAA,MACpB,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AACF,CAAC;;;ACtGD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAaJ,SAAOA,OAAM,kBAAkB;AAAA,IAC7B,kBAAkB;AAAA,IAClB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,aAAO,EAAE,IAAI,CAAC;AAAA,IAChB;AAAA,IACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,aAAO,EAAE,MAAM,CAAC;AAAA,IAClB;AAAA,IACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,IAAI;AAAA,IACb;AAAA,IACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,aAAO,EAAE,IAAI,CAAC;AAAA,IAChB;AAAA,IACA,iDAAiD,CAAC,GAAG,MAAM,EAAE,SAAS,CAAC;AAAA,IACvE,wDAAwD,CAAC,GAAG,MAAM,EAAE,SAAS,CAAC;AAAA,EAChF,CAAC;AACH,CAAC;;;AChCD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,aAAa,kBAAkB,eAAe,KAAK;AACnF,IAAI,iBAAgC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC7E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,aAAAC;AAAA,IACA,KAAAC;AAAA,EACF,IAAI;AACJ,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAL;AAAA,IACA,aAAAI;AAAA,EACF,CAAC;AACD,MAAI,eAAe,mBAAmB;AAAA,IACpC,OAAAJ;AAAA,EACF,CAAC;AACD,WAAS,0BAA0B,OAAO,OAAO;AAE/C,YAAQ,MAAM,QAAQ;AAAA,MACpB,KAAK;AAEH,gBAAQ,MAAM,QAAQ;AAAA,UACpB,KAAK;AAEH,gBAAI,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAEzB,oBAAM,IAAI,WAAW,yEAAyE;AAAA,YAChG;AACA;AAAA,UACF,KAAK;AAEH,gBAAI,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAEzB,oBAAM,IAAI,WAAW,0DAA0D,MAAM,CAAC,IAAI,+BAA+B,MAAM,CAAC,IAAI,GAAG;AAAA,YACzI;AACA;AAAA,UACF;AACE,kBAAM,IAAI,MAAM,iEAAiE,MAAM,SAAS,cAAc;AAAA,QAClH;AACA;AAAA,MACF,KAAK;AAEH,gBAAQ,MAAM,QAAQ;AAAA,UACpB,KAAK;AAEH,gBAAI,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAEzB,oBAAM,IAAI,WAAW,2DAA2D,MAAM,CAAC,IAAI,iCAAiC,MAAM,CAAC,IAAI,GAAG;AAAA,YAC5I;AACA;AAAA,UACF,KAAK;AAEH,gBAAI,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAEzB,oBAAM,IAAI,WAAW,6DAA6D,MAAM,CAAC,IAAI,iCAAiC,MAAM,CAAC,IAAI,GAAG;AAAA,YAC9I;AACA;AAAA,UACF;AACE,kBAAM,IAAI,MAAM,iEAAiE,MAAM,SAAS,cAAc;AAAA,QAClH;AACA;AAAA,MACF;AACE,cAAM,IAAI,MAAM,iEAAiE,MAAM,SAAS,cAAc;AAAA,IAClH;AAAA,EACF;AAUA,WAAS,sBAAsB,GAAG,GAAG,GAAG;AAEtC,QAAI,MAAM,GAAG;AACX,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AACA,WAAOK,KAAI,GAAG,CAAC;AAAA,EACjB;AAUA,WAAS,sBAAsB,GAAG,GAAG;AAEnC,QAAI,EAAE,QAAQ,MAAM,SAAS;AAC3B,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AACA,WAAO,2BAA2B,GAAG,CAAC;AAAA,EACxC;AAUA,WAAS,2BAA2B,GAAG,GAAG;AAExC,QAAI,QAAQ,EAAE;AACd,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,QAAI,QAAQ,EAAE;AACd,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,QAAI,UAAU,MAAM,CAAC;AACrB,QAAI,WAAW,MAAM,CAAC;AAGtB,QAAI;AAEJ,QAAI,KAAKH;AAET,QAAI,KAAKC;AAGT,QAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAE3E,WAAK;AAEL,WAAKH,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,WAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AAAA,IAC1C;AAGA,QAAI,IAAI,CAAC;AAGT,aAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAEjC,UAAIG,OAAM,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;AAElC,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,QAAAA,OAAM,GAAGA,MAAK,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,MACzC;AACA,QAAE,CAAC,IAAIA;AAAA,IACT;AAGA,WAAO,EAAE,kBAAkB;AAAA,MACzB,MAAM;AAAA,MACN,MAAM,CAAC,QAAQ;AAAA,MACf,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,IAC9D,CAAC;AAAA,EACH;AAUA,MAAI,wBAAwBN,OAAM,yBAAyB;AAAA,IACzD,oBAAoB;AAAA,IACpB,qBAAqB;AAAA,EACvB,CAAC;AAUD,MAAI,wBAAwBA,OAAM,yBAAyB;AAAA,IACzD,4BAA4B;AAAA,IAC5B,6BAA6B;AAAA,IAC7B,6BAA6B;AAAA,IAC7B,8BAA8B;AAAA,EAChC,CAAC;AAUD,WAAS,2BAA2B,GAAG,GAAG;AAExC,QAAI,QAAQ,EAAE;AACd,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,QAAI,QAAQ,MAAM,CAAC;AACnB,QAAI,WAAW,MAAM,CAAC;AAGtB,QAAI;AAEJ,QAAI,KAAKE;AAET,QAAI,KAAKC;AAGT,QAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAE3E,WAAK;AAEL,WAAKH,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,WAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AAAA,IAC1C;AAGA,QAAI,IAAI,CAAC;AAGT,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAE9B,UAAI,MAAM,MAAM,CAAC;AAEjB,UAAIG,OAAM,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;AAE7B,eAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAEjC,QAAAA,OAAM,GAAGA,MAAK,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAAA,MACpC;AACA,QAAE,CAAC,IAAIA;AAAA,IACT;AAGA,WAAO,EAAE,kBAAkB;AAAA,MACzB,MAAM;AAAA,MACN,MAAM,CAAC,KAAK;AAAA,MACZ,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,IAC9D,CAAC;AAAA,EACH;AAUA,WAAS,gCAAgC,GAAG,GAAG;AAG7C,QAAI,QAAQ,EAAE;AACd,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,QAAI,QAAQ,EAAE;AACd,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,QAAI,QAAQ,MAAM,CAAC;AACnB,QAAI,WAAW,MAAM,CAAC;AACtB,QAAI,WAAW,MAAM,CAAC;AAGtB,QAAI;AAEJ,QAAI,KAAKJ;AAET,QAAI,KAAKC;AAGT,QAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,WAAW,QAAQ,SAAS;AAE9F,WAAK;AAEL,WAAKH,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,WAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AAAA,IAC1C;AAGA,QAAI,IAAI,CAAC;AAGT,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAE9B,UAAI,MAAM,MAAM,CAAC;AAEjB,QAAE,CAAC,IAAI,CAAC;AAER,eAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAEjC,YAAIG,OAAM,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;AAEhC,iBAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAEjC,UAAAA,OAAM,GAAGA,MAAK,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,QACvC;AACA,UAAE,CAAC,EAAE,CAAC,IAAIA;AAAA,MACZ;AAAA,IACF;AAGA,WAAO,EAAE,kBAAkB;AAAA,MACzB,MAAM;AAAA,MACN,MAAM,CAAC,OAAO,QAAQ;AAAA,MACtB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,IAC9D,CAAC;AAAA,EACH;AAUA,WAAS,iCAAiC,GAAG,GAAG;AAE9C,QAAI,QAAQ,EAAE;AACd,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,wDAAwD;AAAA,IAC1E;AAEA,QAAI,QAAQ,MAAM,CAAC;AACnB,QAAI,WAAW,MAAM,CAAC;AAGtB,QAAI;AAEJ,QAAI,KAAKJ;AAET,QAAI,KAAKC;AAET,QAAI,KAAKC;AAET,QAAI,OAAO;AAGX,QAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAE3E,WAAK;AAEL,WAAKJ,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,WAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AACxC,WAAKH,OAAM,KAAKI,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,aAAOJ,OAAM,QAAQ,GAAG,EAAE;AAAA,IAC5B;AAGA,QAAI,UAAU,CAAC;AACf,QAAI,SAAS,CAAC;AACd,QAAI,OAAO,CAAC;AAEZ,QAAI,IAAI,EAAE,mBAAmB;AAAA,MAC3B,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,KAAK;AAAA,MACL,MAAM,CAAC,OAAO,QAAQ;AAAA,MACtB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,IAC9D,CAAC;AAGD,aAAS,KAAK,GAAG,KAAK,UAAU,MAAM;AAEpC,WAAK,EAAE,IAAI,OAAO;AAElB,UAAI,MAAM,KAAK,EAAE;AACjB,UAAI,MAAM,KAAK,KAAK,CAAC;AAErB,UAAI,MAAM,KAAK;AAEb,YAAI,OAAO;AAEX,iBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAE9B,cAAI,OAAO,IAAI;AAEf,cAAI,MAAM;AAEV,mBAAS,KAAK,KAAK,KAAK,KAAK,MAAM;AAEjC,gBAAI,KAAK,OAAO,EAAE;AAElB,gBAAI,SAAS,MAAM;AAEjB,oBAAM,GAAG,MAAM,CAAC,EAAE,EAAE,GAAG,QAAQ,EAAE,CAAC;AAElC,qBAAO;AAAA,YACT,OAAO;AAEL,oBAAM,GAAG,KAAK,GAAG,MAAM,CAAC,EAAE,EAAE,GAAG,QAAQ,EAAE,CAAC,CAAC;AAAA,YAC7C;AAAA,UACF;AAEA,cAAI,SAAS,QAAQ,CAAC,GAAG,KAAK,IAAI,GAAG;AAEnC,mBAAO,KAAK,CAAC;AACb,oBAAQ,KAAK,GAAG;AAAA,UAClB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,SAAK,QAAQ,IAAI,OAAO;AAGxB,WAAO;AAAA,EACT;AAUA,WAAS,4BAA4B,GAAG,GAAG;AAEzC,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,wDAAwD;AAAA,IAC1E;AAEA,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,QAAI,QAAQ,EAAE,MAAM,CAAC;AACrB,QAAI,QAAQ,EAAE,MAAM,CAAC;AAErB,QAAI,UAAU,CAAC;AACf,QAAI,SAAS,CAAC;AACd,QAAI,OAAO,CAAC;AAGZ,QAAI;AAEJ,QAAI,KAAKE;AAET,QAAI,KAAKC;AAET,QAAI,KAAKC;AAET,QAAI,OAAO;AAGX,QAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAE3E,WAAK;AAEL,WAAKJ,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,WAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AACxC,WAAKH,OAAM,KAAKI,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,aAAOJ,OAAM,QAAQ,GAAG,EAAE;AAAA,IAC5B;AAGA,QAAI,IAAI,CAAC;AAET,QAAI,IAAI,CAAC;AAGT,SAAK,CAAC,IAAI;AAEV,aAAS,KAAK,GAAG,KAAK,OAAO,MAAM;AAEjC,UAAI,MAAM,MAAM,EAAE;AAElB,UAAI,CAAC,GAAG,KAAK,IAAI,GAAG;AAElB,iBAAS,MAAM,KAAK,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM;AAErE,cAAI,KAAK,OAAO,EAAE;AAElB,cAAI,CAAC,EAAE,EAAE,GAAG;AAEV,cAAE,EAAE,IAAI;AAER,mBAAO,KAAK,EAAE;AAEd,cAAE,EAAE,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;AAAA,UAC7B,OAAO;AAEL,cAAE,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,KAAK,QAAQ,EAAE,CAAC,CAAC;AAAA,UACxC;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,aAAS,KAAK,OAAO,QAAQ,IAAI,GAAG,IAAI,IAAI,KAAK;AAE/C,UAAI,KAAK,OAAO,CAAC;AAEjB,cAAQ,CAAC,IAAI,EAAE,EAAE;AAAA,IACnB;AAEA,SAAK,CAAC,IAAI,OAAO;AAGjB,WAAO,EAAE,mBAAmB;AAAA,MAC1B,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,KAAK;AAAA,MACL,MAAM,CAAC,OAAO,CAAC;AAAA,MACf,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,IAC9D,CAAC;AAAA,EACH;AAUA,WAAS,iCAAiC,GAAG,GAAG;AAE9C,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,wDAAwD;AAAA,IAC1E;AAEA,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,QAAI,QAAQ,EAAE,MAAM,CAAC;AACrB,QAAI,QAAQ,EAAE,MAAM,CAAC;AACrB,QAAI,WAAW,EAAE,MAAM,CAAC;AAGxB,QAAI;AAEJ,QAAI,KAAKE;AAET,QAAI,KAAKC;AAET,QAAI,KAAKC;AAET,QAAI,OAAO;AAGX,QAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAE3E,WAAK;AAEL,WAAKJ,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,WAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AACxC,WAAKH,OAAM,KAAKI,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,aAAOJ,OAAM,QAAQ,GAAG,EAAE;AAAA,IAC5B;AAGA,QAAI,UAAU,CAAC;AACf,QAAI,SAAS,CAAC;AACd,QAAI,OAAO,CAAC;AAEZ,QAAI,IAAI,EAAE,mBAAmB;AAAA,MAC3B,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,KAAK;AAAA,MACL,MAAM,CAAC,OAAO,QAAQ;AAAA,MACtB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,IAC9D,CAAC;AAGD,QAAI,IAAI,CAAC;AAET,QAAI,IAAI,CAAC;AAGT,aAAS,KAAK,GAAG,KAAK,UAAU,MAAM;AAEpC,WAAK,EAAE,IAAI,OAAO;AAElB,UAAI,OAAO,KAAK;AAEhB,eAAS,KAAK,GAAG,KAAK,OAAO,MAAM;AAEjC,YAAI,OAAO,MAAM,EAAE,EAAE,EAAE;AAEvB,YAAI,CAAC,GAAG,MAAM,IAAI,GAAG;AAEnB,mBAAS,MAAM,KAAK,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM;AAErE,gBAAI,KAAK,OAAO,EAAE;AAElB,gBAAI,EAAE,EAAE,MAAM,MAAM;AAElB,gBAAE,EAAE,IAAI;AAER,qBAAO,KAAK,EAAE;AAEd,gBAAE,EAAE,IAAI,GAAG,MAAM,QAAQ,EAAE,CAAC;AAAA,YAC9B,OAAO;AAEL,gBAAE,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,MAAM,QAAQ,EAAE,CAAC,CAAC;AAAA,YACzC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,eAAS,KAAK,KAAK,EAAE,GAAG,KAAK,OAAO,QAAQ,IAAI,IAAI,IAAI,IAAI,KAAK;AAE/D,YAAI,KAAK,OAAO,CAAC;AAEjB,gBAAQ,CAAC,IAAI,EAAE,EAAE;AAAA,MACnB;AAAA,IACF;AAEA,SAAK,QAAQ,IAAI,OAAO;AAGxB,WAAO;AAAA,EACT;AAUA,WAAS,kCAAkC,GAAG,GAAG;AAE/C,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAG7E,QAAI,QAAQ,EAAE,MAAM,CAAC;AACrB,QAAI,WAAW,EAAE,MAAM,CAAC;AAExB,QAAI,SAAS,WAAW;AAGxB,QAAI;AAEJ,QAAI,KAAKE;AAET,QAAI,KAAKC;AAGT,QAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAE3E,WAAK;AAEL,WAAKH,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,WAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AAAA,IAC1C;AAGA,QAAI,UAAU,SAAS,CAAC,IAAI;AAC5B,QAAI,SAAS,CAAC;AACd,QAAI,OAAO,CAAC;AAEZ,QAAI,IAAI,EAAE,mBAAmB;AAAA,MAC3B,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,KAAK;AAAA,MACL,MAAM,CAAC,OAAO,QAAQ;AAAA,MACtB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,IAC9D,CAAC;AAGD,QAAI,IAAI,SAAS,CAAC,IAAI;AAEtB,QAAI,IAAI,CAAC;AAET,QAAI,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI;AAEpC,aAAS,KAAK,GAAG,KAAK,UAAU,MAAM;AAEpC,WAAK,EAAE,IAAI,OAAO;AAElB,UAAI,OAAO,KAAK;AAEhB,WAAK,MAAM,KAAK,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM;AAEjE,aAAK,OAAO,EAAE;AAEd,YAAI,QAAQ;AAEV,eAAK,MAAM,KAAK,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM;AAEjE,iBAAK,OAAO,EAAE;AAEd,gBAAI,EAAE,EAAE,MAAM,MAAM;AAElB,gBAAE,EAAE,IAAI;AAER,qBAAO,KAAK,EAAE;AAEd,gBAAE,EAAE,IAAI,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAAC;AAAA,YACrC,OAAO;AAEL,gBAAE,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAAC,CAAC;AAAA,YAChD;AAAA,UACF;AAAA,QACF,OAAO;AAEL,eAAK,MAAM,KAAK,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM;AAEjE,iBAAK,OAAO,EAAE;AAEd,gBAAI,EAAE,EAAE,MAAM,MAAM;AAElB,gBAAE,EAAE,IAAI;AAER,qBAAO,KAAK,EAAE;AAAA,YAChB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,UAAI,QAAQ;AAEV,iBAAS,KAAK,KAAK,EAAE,GAAG,KAAK,OAAO,QAAQ,IAAI,IAAI,IAAI,IAAI,KAAK;AAE/D,cAAI,KAAK,OAAO,CAAC;AAEjB,kBAAQ,CAAC,IAAI,EAAE,EAAE;AAAA,QACnB;AAAA,MACF;AAAA,IACF;AAEA,SAAK,QAAQ,IAAI,OAAO;AAGxB,WAAO;AAAA,EACT;AAmCA,SAAOH,OAAMF,QAAMK,iBAAgB;AAAA;AAAA,IAGjC,gBAAgBH,OAAM,QAAQ,kBAAkB,YAAU,CAAC,GAAG,MAAM;AAElE,gCAA0B,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC;AAGpD,UAAI,IAAI,OAAOC,QAAO,CAAC,GAAGA,QAAO,CAAC,CAAC;AAEnC,aAAO,SAAS,CAAC,IAAI,EAAE,QAAQ,IAAI;AAAA,IACrC,CAAC;AAAA,IACD,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAE7C,UAAI,QAAQ,EAAE,KAAK;AACnB,UAAI,QAAQ,EAAE,KAAK;AAGnB,gCAA0B,OAAO,KAAK;AAGtC,UAAI,MAAM,WAAW,GAAG;AAEtB,YAAI,MAAM,WAAW,GAAG;AAEtB,iBAAO,sBAAsB,GAAG,GAAG,MAAM,CAAC,CAAC;AAAA,QAC7C;AAEA,eAAO,sBAAsB,GAAG,CAAC;AAAA,MACnC;AAEA,UAAI,MAAM,WAAW,GAAG;AAEtB,eAAO,sBAAsB,GAAG,CAAC;AAAA,MACnC;AAEA,aAAO,sBAAsB,GAAG,CAAC;AAAA,IACnC;AAAA,IACA,iBAAiBD,OAAM,QAAQ,iBAAiB,YAAU,CAAC,GAAG,MAAM,OAAO,GAAGC,QAAO,CAAC,CAAC,CAAC;AAAA,IACxF,iBAAiBD,OAAM,YAAY,UAAQ,CAAC,GAAG,MAAM;AAEnD,aAAO,KAAKC,QAAO,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC;AAAA,IACvC,CAAC;AAAA,IACD,qBAAqB,SAAS,iBAAiB,GAAG,GAAG;AACnD,aAAO,cAAc,GAAG,GAAGE,iBAAgB,KAAK;AAAA,IAClD;AAAA,IACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,aAAO,aAAa,GAAG,GAAGA,iBAAgB,KAAK;AAAA,IACjD;AAAA,IACA,qBAAqB,SAAS,iBAAiB,GAAG,GAAG;AACnD,aAAO,cAAc,GAAG,GAAGA,iBAAgB,IAAI;AAAA,IACjD;AAAA,IACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,aAAO,aAAa,GAAG,GAAGA,iBAAgB,IAAI;AAAA,IAChD;AAAA,IACA,cAAc,SAAS,UAAU,GAAG,GAAG;AAErC,aAAO,aAAaF,QAAO,CAAC,GAAG,GAAGE,iBAAgB,KAAK,EAAE,QAAQ;AAAA,IACnE;AAAA,IACA,cAAc,SAAS,UAAU,GAAG,GAAG;AAErC,aAAO,aAAaF,QAAO,CAAC,GAAG,GAAGE,iBAAgB,IAAI,EAAE,QAAQ;AAAA,IAClE;AAAA,IACA,YAAYA;AAAA,IACZ,oBAAoBH,OAAM,YAAY,UAAQ,CAAC,GAAG,GAAG,SAAS;AAC5D,UAAI,SAAS,KAAK,GAAG,CAAC;AACtB,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,iBAAS,KAAK,QAAQ,KAAK,CAAC,CAAC;AAAA,MAC/B;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACH,CAAC;AACH,CAAC;;;AC52BD,IAAIO,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,aAAa,YAAY,SAAS;AACxD,IAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,WAAW;AAAA,IACX,SAAAC;AAAA,IACA,UAAU;AAAA,EACZ,IAAI;AA+BJ,SAAOD,OAAMF,QAAM;AAAA,IACjB,QAAQ;AAAA,IACR,SAAS,SAASI,SAAQ,GAAG;AAC3B,aAAO,EAAE,OAAO,IAAID,SAAQ,WAAW,EAAE,EAAE,CAAC,IAAI,EAAE,KAAK;AAAA,IACzD;AAAA,IACA,WAAW,SAASE,WAAU,GAAG;AAC/B,aAAO,IAAI,WAAW,EAAE,IAAI,CAAC,CAAC;AAAA,IAChC;AAAA,IACA,QAAQ,SAAS,OAAO,GAAG;AACzB,aAAO,IAAI,KAAK,KAAK,IAAI,KAAK,CAAC,KAAK;AAAA,IACtC;AAAA,IACA,UAAU,SAASC,UAAS,GAAG;AAC7B,aAAO,EAAE,MAAM,KAAK,IAAI,UAAU,CAAC,IAAI,IAAI,UAAU,EAAE,CAAC;AAAA,IAC1D;AAAA;AAAA,IAEA,kBAAkBJ,OAAM,YAAY,UAAQ,OAAKK,SAAQ,GAAG,MAAM,IAAI,CAAC;AAAA,IACvE,MAAML,OAAM,YAAY,UAAQ,OAAK;AACnC,UAAI,CAAC,EAAE,WAAW,KAAK,EAAE,MAAM,CAAC,EAAE,KAAK,WAAW,GAAG;AACnD,cAAM,IAAI,UAAU,yCAAyC;AAAA,MAC/D;AACA,aAAOA,OAAM,KAAK,MAAM,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK;AAAA,IAChD,CAAC;AAAA,EACH,CAAC;AACH,CAAC;;;AChED,IAAIM,SAAO;AACX,IAAIC,iBAAe,CAAC,UAAU,SAAS,SAAS;AACzC,IAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,MAAI;AAAA,IACF,QAAAC;AAAA,IACA,OAAAC;AAAA,IACA,SAAAC;AAAA,EACF,IAAI;AA2BJ,SAAOD,OAAM,QAAQ;AAAA,IACnB,QAAQ;AAAA,IACR,SAAS,SAASC,SAAQ,GAAG;AAC3B,aAAO,EAAE,KAAK;AAAA,IAChB;AAAA,IACA,WAAW,SAASC,WAAU,GAAG;AAC/B,UAAI,CAAC,EAAE,WAAW,KAAKH,QAAO,aAAa;AACzC,eAAO,EAAE,KAAK;AAAA,MAChB,OAAO;AAEL,eAAO,YAAY,EAAE,SAAS,CAAC;AAAA,MACjC;AAAA,IACF;AAAA,IACA,MAAM,SAAS,KAAK,GAAG;AAErB,aAAO,EAAE,IAAI,GAAG;AAAA,IAClB;AAAA,EACF,CAAC;AAQD,WAAS,YAAY,GAAG;AACtB,QAAI,MAAM,CAAC,GAAG;AACZ,aAAO;AAAA,IACT,WAAW,KAAK,KAAKA,QAAO,aAAa;AACvC,aAAO,KAAK,KAAK,CAAC;AAAA,IACpB,OAAO;AACL,aAAO,IAAIE,SAAQ,GAAG,CAAC,EAAE,KAAK;AAAA,IAChC;AAAA,EACF;AACF,CAAC;;;AC9DD,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,kBAAkB,cAAc,eAAe,QAAQ;AACtG,IAAI,iBAAgC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC7E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,aAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,YAAAC;AAAA,IACA,aAAAC;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AAGJ,MAAI,iBAAiB,qBAAqB;AAAA,IACxC,OAAAN;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAA;AAAA,EACF,CAAC;AACD,MAAI,iBAAiB,qBAAqB;AAAA,IACxC,OAAAA;AAAA,IACA,aAAAE;AAAA,EACF,CAAC;AACD,MAAI,iBAAiB,qBAAqB;AAAA,IACxC,OAAAF;AAAA,IACA,aAAAK;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAL;AAAA,IACA,aAAAK;AAAA,EACF,CAAC;AACD,MAAI,uBAAuB,2BAA2B;AAAA,IACpD,OAAAL;AAAA,IACA,QAAAC;AAAA,IACA,QAAAK;AAAA,EACF,CAAC;AAgCD,SAAON,OAAMF,QAAM;AAAA,IACjB,YAAYK;AAAA,EACd,GAAG,qBAAqB;AAAA,IACtB,MAAMA;AAAA,IACN,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EACN,CAAC,CAAC;AACJ,CAAC;;;ACnFD,IAAII,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,cAAc;AACpC,IAAI,sBAAqC,wBAAQD,QAAMC,gBAAc,UAAQ;AAClF,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,cAAAC;AAAA,EACF,IAAI;AAeJ,SAAO,SAAS,cAAc,GAAG,GAAG,UAAU;AAE5C,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAC7E,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAG7E,QAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,YAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,IACrD;AACA,QAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,YAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,IACzG;AAGA,QAAI,OAAO,MAAM,CAAC;AAClB,QAAI,UAAU,MAAM,CAAC;AAGrB,QAAI;AACJ,QAAI,OAAO;AACX,QAAI,KAAK;AAGT,QAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAC7D,WAAK;AACL,aAAOD,OAAM,QAAQ,GAAG,EAAE;AAC1B,WAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,IACpC;AAGA,QAAI,UAAU,CAAC;AACf,QAAI,SAAS,CAAC;AACd,QAAI,OAAO,IAAI,MAAM,UAAU,CAAC,EAAE,KAAK,CAAC;AAGxC,QAAI,KAAK,CAAC;AACV,QAAI,KAAK,CAAC;AACV,QAAI,KAAK,CAAC;AACV,QAAI,KAAK,CAAC;AAGV,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,UAAI,OAAO,IAAI;AACf,UAAI,eAAe;AACnB,eAAS,GAAG,GAAG,IAAI,IAAI,IAAI;AAC3B,eAAS,GAAG,GAAG,IAAI,IAAI,IAAI;AAG3B,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,YAAI,KAAK,GAAG,CAAC,MAAM,OAAO,GAAG,CAAC,IAAI;AAClC,YAAI,KAAK,GAAG,CAAC,MAAM,OAAO,GAAG,CAAC,IAAI;AAGlC,YAAI,MAAM,GAAG,IAAI,EAAE;AAEnB,YAAI,QAAQ,KAAK,QAAQ,OAAO;AAC9B,iBAAO,KAAK,CAAC;AACb,kBAAQ,KAAK,GAAG;AAChB;AAAA,QACF;AAAA,MACF;AAGA,WAAK,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI;AAAA,IAC1B;AAGA,WAAO,IAAIC,cAAa;AAAA,MACtB,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,KAAK;AAAA,MACL,MAAM,CAAC,MAAM,OAAO;AAAA,MACpB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,IAC9D,CAAC;AAAA,EACH;AACA,WAAS,SAAS,GAAG,GAAG,GAAG,GAAG,MAAM;AAElC,QAAI,SAAS,EAAE;AACf,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE;AAEZ,aAAS,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,KAAK;AAEjD,UAAI,IAAI,MAAM,CAAC;AAEf,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI,OAAO,CAAC;AAAA,IACjB;AAAA,EACF;AACF,CAAC;;;AChHD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AA0BJ,SAAOA,OAAMF,QAAM;AAAA,IACjB,iCAAiC,OAAK;AAAA,IACtC,SAAS,OAAK,EAAE,UAAU;AAAA,IAC1B,MAAME,OAAM,YAAY,UAAQ,OAAK,IAAI,EAAE,YAAY,KAAK,EAAE,UAAU,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;AAAA,IAC5F,kBAAkBA,OAAM,YAAY,UAAQ,OAAKC,SAAQ,GAAG,IAAI,CAAC;AAAA,EACnE,CAAC;AACH,CAAC;;;ACrCD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,WAA0B,wBAAQD,QAAMC,gBAAc,UAAQ;AACvE,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AA4BJ,SAAOA,OAAMF,QAAM;AAAA,IACjB,QAAQ,MAAM;AAAA,IACd,wBAAwB,OAAK,EAAE,IAAI,CAAC;AAAA,IACpC,SAAS,OAAK,EAAE;AAAA,IAChB,kBAAkBE,OAAM,YAAY,UAAQ,OAAKC,SAAQ,GAAG,IAAI,CAAC;AAAA,EACnE,CAAC;AACH,CAAC;;;ACvCD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,WAA0B,wBAAQD,QAAMC,gBAAc,UAAQ;AACvE,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AA4BJ,SAAOA,OAAMF,QAAM;AAAA,IACjB,iCAAiC,OAAK;AAAA,IACtC,SAAS,OAAK,EAAE;AAAA,IAChB,kBAAkBE,OAAM,YAAY,UAAQ,OAAKC,SAAQ,GAAG,IAAI,CAAC;AAAA,EACnE,CAAC;AACH,CAAC;;;AClCD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,WAAW;AAC3C,IAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,EACF,IAAI;AA8BJ,SAAOF,OAAMF,QAAM;AAAA;AAAA,IAEjB,0CAA0C,SAAS,iCAAiC,MAAM;AACxF,UAAI;AACJ,UAAI,MAAM,KAAK;AACf,UAAI,MAAM;AACV,UAAI;AACJ,UAAI,WAAW;AACf,UAAI,WAAW,CAAC;AAEhB,WAAK,IAAI,GAAG,IAAI,KAAK,KAAK;AACxB,YAAI,MAAM,KAAK,CAAC;AAGhB,YAAI,SAAS,GAAG,GAAG;AACjB,qBAAW;AAAA,QACb;AACA,YAAI,SAAS,GAAG,KAAK,YAAY,GAAG,GAAG;AACrC,cAAI,MAAM,MAAM,GAAG;AACjB,kBAAM,IAAI,MAAM,8CAA8C;AAAA,UAChE;AAGA,oBAAU;AACV,gBAAM,IAAI,QAAQ;AAElB,cAAI,CAACI,WAAU,GAAG,GAAG;AACnB,kBAAM,IAAI,UAAU,uCAAuC;AAAA,UAC7D;AACA,cAAI,MAAM,KAAK,IAAI,KAAK,MAAM,SAAS;AAErC,kBAAM,IAAI,WAAW,KAAK,UAAU,CAAC;AAAA,UACvC;AAAA,QACF,OAAO;AAEL,cAAI,IAAI,MAAM,GAAG,EAAE,QAAQ;AAC3B,cAAIC,QAAO,UAAU,CAAC;AACtB,mBAAS,CAAC,IAAI;AACd,oBAAU;AACV,gBAAMA,MAAK,SAAS;AAGpB,cAAI,IAAI,KAAK,QAAQ,SAAS;AAC5B,kBAAM,IAAI,eAAe,UAAU,GAAG,MAAM,CAAC;AAAA,UAC/C;AAAA,QACF;AAAA,MACF;AACA,UAAI,SAAS,WAAW,GAAG;AACzB,cAAM,IAAI,YAAY,8BAA8B;AAAA,MACtD;AACA,UAAI,MAAM,SAAS,MAAM;AACzB,aAAO,SAAS,QAAQ;AACtB,cAAM,OAAQ,KAAK,SAAS,MAAM,GAAG,GAAG;AAAA,MAC1C;AACA,aAAO,WAAWF,QAAO,GAAG,IAAI;AAAA,IAClC;AAAA,IACA,aAAa,SAAS,OAAO,MAAM;AACjC,aAAO,KAAK,KAAK,EAAE;AAAA,IACrB;AAAA,EACF,CAAC;AACH,CAAC;;;ACnGD,IAAIG,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,SAAS,UAAU,OAAO;AAChD,IAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,OAAAC;AAAA,EACF,IAAI;AAsBJ,SAAOH,OAAMF,QAAM;AAAA,IACjB,kBAAkB;AAAA,IAClB,iBAAiB,SAAS,aAAa,OAAOM,SAAQ;AACpD,aAAO,QAAQF,QAAO,MAAM,KAAK,CAAC,GAAGE,OAAM,EAAE,QAAQ;AAAA,IACvD;AAAA,EACF,CAAC;AAQD,WAAS,QAAQ,OAAOA,SAAQ;AAE9B,QAAI,MAAM,KAAK,EAAE,WAAW,GAAG;AAC7B,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AACA,kBAAcA,SAAQ,MAAM,KAAK,EAAE,CAAC,CAAC;AACrC,QAAI,WAAWD,OAAM,GAAG,MAAM,KAAK,EAAE,CAAC,CAAC;AACvC,QAAI,QAAQ,IAAIF,OAAM,UAAU,CAACG,OAAM,CAAC;AACxC,QAAI,SAAS,MAAM,OAAO,KAAK;AAE/B,WAAO,SAAS,MAAM,IAAI,SAASF,QAAO,CAAC,CAAC,MAAM,CAAC,CAAC;AAAA,EACtD;AACF,CAAC;;;ACvDD,IAAIG,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,cAAc;AAC7D,IAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,aAAAC;AAAA,IACA,cAAAC;AAAA,EACF,IAAI;AAsCJ,SAAOH,OAAMF,QAAM;AAAA;AAAA,IAGjB,OAAO,SAASM,OAAM,GAAG;AACvB,aAAO,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,IAAI;AAAA,IACvC;AAAA,IACA,iBAAiB,SAAS,aAAa,GAAG,GAAG;AAC3C,aAAO,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,IAAI;AAAA,IACvC;AAAA,IACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,aAAO,MAAM,GAAG,EAAE,SAAS,GAAG,UAAU,CAAC,GAAG,IAAI;AAAA,IAClD;AAAA,IACA,iBAAiB,SAAS,aAAa,GAAGC,SAAQ;AAChD,aAAO,MAAM,GAAG,GAAG,UAAU,CAAC,GAAGA,OAAM;AAAA,IACzC;AAAA,IACA,yBAAyB,SAAS,oBAAoB,GAAG,GAAGA,SAAQ;AAClE,aAAO,MAAM,GAAG,GAAG,UAAU,CAAC,GAAGA,OAAM;AAAA,IACzC;AAAA,IACA,4BAA4B,SAAS,uBAAuB,GAAG,GAAGA,SAAQ;AACxE,aAAO,MAAM,GAAG,EAAE,SAAS,GAAG,UAAU,CAAC,GAAGA,OAAM;AAAA,IACpD;AAAA,IACA,QAAQ,SAASC,QAAO,GAAG;AACzB,aAAO,MAAM,GAAG,GAAG,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,IAC1C;AAAA,IACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,MAAM,GAAG,GAAG,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,IAC1C;AAAA,IACA,qBAAqB,SAAS,iBAAiB,GAAG,GAAG;AACnD,aAAO,MAAM,GAAG,EAAE,SAAS,GAAG,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,IACrD;AAAA,IACA,kBAAkB,SAAS,cAAc,GAAGD,SAAQ;AAClD,aAAO,MAAM,GAAG,GAAG,EAAE,KAAK,GAAGA,OAAM;AAAA,IACrC;AAAA,IACA,0BAA0B,SAAS,qBAAqB,GAAG,GAAGA,SAAQ;AACpE,aAAO,MAAM,GAAG,GAAG,EAAE,KAAK,GAAGA,OAAM;AAAA,IACrC;AAAA,IACA,6BAA6B,SAAS,wBAAwB,GAAG,GAAGA,SAAQ;AAC1E,aAAO,MAAM,GAAG,EAAE,SAAS,GAAG,EAAE,KAAK,GAAGA,OAAM;AAAA,IAChD;AAAA,EACF,CAAC;AAWD,WAAS,MAAM,GAAG,GAAGE,OAAMF,SAAQ;AACjC,QAAI,CAAC,UAAU,CAAC,GAAG;AACjB,YAAM,IAAI,UAAU,sDAAsD;AAAA,IAC5E;AACA,QAAI,SAAS,IAAI,IAAI,IAAI;AACzB,QAAI,OAAO,IAAI,IAAI,CAAC,IAAI;AAGxB,YAAQE,MAAK,QAAQ;AAAA,MACnB,KAAK;AACH,eAAO,sBAAsB,GAAG,GAAGF,SAAQE,MAAK,CAAC,GAAG,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,aAAa,GAAG,GAAGF,SAAQE,OAAM,MAAM,MAAM;AAAA,IACxD;AACA,UAAM,IAAI,WAAW,gDAAgD;AAAA,EACvE;AACA,WAAS,sBAAsB,GAAG,GAAGF,SAAQ,GAAG,MAAM,QAAQ;AAE5D,QAAI,KAAK,CAAC,IAAI,MAAM,IAAI,MAAM;AAC9B,QAAIA,WAAUA,YAAW,YAAYA,YAAW,SAAS;AACvD,YAAM,IAAI,UAAU,uBAAuB,OAAOA,SAAQ,GAAI,CAAC;AAAA,IACjE;AAGA,QAAI,IAAIA,YAAW,WAAWF,cAAa,SAAS,IAAI,GAAG,CAAC,IAAID,aAAY,SAAS,IAAI,GAAG,CAAC;AAE7F,WAAOG,YAAW,OAAO,IAAI,EAAE,QAAQ;AAAA,EACzC;AACA,WAAS,aAAa,GAAG,GAAGA,SAAQ,GAAG,MAAM,QAAQ;AAEnD,QAAI,SAAS,CAAC,GAAG;AAEf,UAAI,KAAK,EAAE,SAAS,CAAC;AAErB,UAAIA,YAAW,MAAM;AAEnB,YAAIA,YAAW,GAAG,QAAQ,GAAG;AAC3B,iBAAOJ,QAAO,IAAII,OAAM;AAAA,QAC1B;AACA,eAAO;AAAA,MACT;AACA,aAAO,GAAG,QAAQ;AAAA,IACpB;AAEA,QAAI,IAAI,KAAK,IAAI,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,IAAI,MAAM;AAE3C,QAAI,SAAS,CAAC;AAEd,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAO,CAAC,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,MAAM;AAAA,IACpC;AAEA,WAAOA,YAAW,OAAOJ,QAAO,MAAM,IAAI;AAAA,EAC5C;AACF,CAAC;;;ACxJD,IAAIO,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,gBAA+B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC5E,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAoBJ,SAAOA,OAAMF,QAAM;AAAA,IACjB,OAAO,SAASG,OAAM,GAAG;AACvB,aAAO,QAAa,CAAC;AAAA,IACvB;AAAA,IACA,aAAa,SAASC,aAAY,GAAG;AAGnC,aAAO,EAAE,OAAO,QAAa,EAAE,QAAQ,GAAG,IAAI,GAAG,EAAE,SAAS,CAAC;AAAA,IAC/D;AAAA,IACA,cAAc,SAASC,cAAa,IAAI;AACtC,YAAM,IAAI,UAAU,kKAA4K;AAAA,IAClM;AAAA,EACF,CAAC;AACH,CAAC;;;ACrCD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,0BAAyC,wBAAQD,QAAMC,gBAAc,UAAQ;AACtF,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAmCJ,SAAOA,OAAMF,QAAM;AAAA,IACjB,OAAO,SAASG,OAAM,GAAG;AACvB,aAAO,iBAAiB,GAAG,MAAM;AAAA,IACnC;AAAA,IACA,QAAQ,SAASC,QAAO,GAAG;AACzB,aAAO,EAAE,YAAY;AAAA,IACvB;AAAA,EACF,CAAC;AACH,CAAC;;;AC/CD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,UAAU,aAAa,eAAe,cAAc;AACpF,IAAI,iBAAgC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC7E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,IACA,aAAAC;AAAA,IACA,cAAAC;AAAA,EACF,IAAI;AA+BJ,SAAOL,OAAMF,QAAM;AAAA,IACjB,IAAI,SAAS,IAAI;AACf,aAAOG,QAAO,WAAW,WAAWC,QAAO,CAAC,CAAC,IAAI,CAAC;AAAA,IACpD;AAAA,IACA,QAAQ,SAAS,OAAOI,SAAQ;AAC9B,aAAOJ,QAAOI,OAAM;AAAA,IACtB;AAAA,IACA,sBAAsB,SAAS,kBAAkB,MAAM;AACrD,aAAO,UAAU,MAAM,MAAML,QAAO,WAAW,WAAW,UAAU,MAAS;AAAA,IAC/E;AAAA,IACA,8BAA8B,SAAS,yBAAyB,MAAMK,SAAQ;AAC5E,aAAO,UAAU,MAAM,MAAMA,OAAM;AAAA,IACrC;AAAA,IACA,0CAA0C,SAAS,oCAAoC,MAAM,MAAM;AACjG,aAAO,UAAU,MAAM,MAAML,QAAO,WAAW,WAAW,UAAU,MAAS;AAAA,IAC/E;AAAA,IACA,kDAAkD,SAAS,2CAA2C,MAAM,MAAMK,SAAQ;AACxH,aAAO,UAAU,MAAM,MAAMA,OAAM;AAAA,IACrC;AAAA,IACA,OAAO,SAASC,OAAMC,OAAM;AAC1B,aAAO,gBAAgBA,KAAI;AAAA,IAC7B;AAAA,IACA,iBAAiB,SAAS,aAAaA,OAAMF,SAAQ;AACnD,aAAO,gBAAgBE,OAAMF,OAAM;AAAA,IACrC;AAAA,IACA,QAAQ,SAASG,QAAOD,OAAM;AAC5B,aAAO,gBAAgBA,MAAK,QAAQ,GAAGA,MAAK,QAAQ,CAAC;AAAA,IACvD;AAAA,IACA,kBAAkB,SAAS,cAAcA,OAAMF,SAAQ;AACrD,aAAO,gBAAgBE,MAAK,QAAQ,GAAGF,OAAM;AAAA,IAC/C;AAAA,EACF,CAAC;AACD,WAAS,gBAAgBE,OAAMF,SAAQ;AACrC,YAAQE,MAAK,QAAQ;AAAA,MACnB,KAAK;AACH,eAAOF,UAASJ,QAAOI,OAAM,IAAI,CAAC;AAAA,MACpC,KAAK;AACH,eAAO,UAAUE,MAAK,CAAC,GAAGA,MAAK,CAAC,GAAGF,OAAM;AAAA,MAC3C,KAAK;AACH,eAAO,UAAUE,MAAK,CAAC,GAAGA,MAAK,CAAC,GAAGF,OAAM;AAAA,MAC3C;AACE,cAAM,IAAI,MAAM,uCAAuC;AAAA,IAC3D;AAAA,EACF;AAUA,WAAS,UAAU,MAAM,MAAMA,SAAQ;AAErC,QAAI,MAAM,YAAY,IAAI,KAAK,YAAY,IAAI,IAAIH,aAAY;AAC/D,QAAI,YAAY,IAAI,EAAG,QAAO,KAAK,SAAS;AAC5C,QAAI,YAAY,IAAI,EAAG,QAAO,KAAK,SAAS;AAC5C,QAAI,CAAC,UAAU,IAAI,KAAK,OAAO,GAAG;AAChC,YAAM,IAAI,MAAM,2DAA2D;AAAA,IAC7E;AACA,QAAI,CAAC,UAAU,IAAI,KAAK,OAAO,GAAG;AAChC,YAAM,IAAI,MAAM,2DAA2D;AAAA,IAC7E;AACA,QAAI,MAAM,MAAM,IAAIA,WAAU,CAAC,IAAI;AACnC,QAAI,eAAe,MAAM,IAAI,IAAI,CAAC,IAAI;AACtC,QAAIK,QAAO,CAAC,MAAM,IAAI;AAGtB,QAAIF,SAAQ;AAEV,UAAIA,YAAW,UAAU;AACvB,eAAOD,cAAa,SAASG,OAAM,KAAK,GAAG,YAAY;AAAA,MACzD;AACA,UAAIF,YAAW,SAAS;AACtB,eAAOF,aAAY,SAASI,OAAM,KAAK,GAAG,YAAY;AAAA,MACxD;AACA,YAAM,IAAI,UAAU,wBAAyB,OAAOF,SAAQ,GAAI,CAAC;AAAA,IACnE;AAGA,QAAI,MAAM,OAAO,CAAC,GAAGE,OAAM,YAAY;AAEvC,QAAI,UAAU,OAAO,OAAO,OAAO;AAEnC,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,UAAI,CAAC,EAAE,CAAC,IAAI;AAAA,IACd;AACA,WAAO;AAAA,EACT;AACF,CAAC;;;ACpID,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAoDJ,SAAOA,OAAMF,QAAM;AAAA,IACjB,mBAAmB;AAAA,IACnB,oBAAoB,SAAS,gBAAgB,GAAG,UAAU;AACxD,aAAO,EAAE,IAAI,QAAQ;AAAA,IACvB;AAAA,IACA,wDAAwD,CAAC,GAAG,GAAG,SAAS,aAAa,CAAC,GAAG,GAAG,GAAG,KAAK,MAAM,GAAG,KAAK,SAAS,CAAC,CAAC,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC;AAAA,EACvJ,CAAC;AAaD,WAAS,aAAa,QAAQ,eAAe;AAC3C,QAAI,OAAO,kBAAkB,YAAY;AACvC,YAAM,IAAI,MAAM,2CAA2C;AAAA,IAC7D;AACA,QAAI,qBAAqB,OAAO,CAAC,EAAE;AACnC,QAAI,QAAQ,OAAO,IAAI,OAAK,EAAE,WAAW,EAAE,KAAK,IAAI,UAAU,CAAC,CAAC;AAChE,QAAI,UAAU,eAAe,GAAG,KAAK;AACrC,QAAI,iBAAiB,OAAO;AAC5B,QAAI,OAAO,qBAAqB,CAACG,SAAQ,QAAQA,QAAO,IAAI,GAAG,IAAI;AACnE,QAAI,cAAc,OAAO,IAAI,CAAC,YAAY,MAAM;AAC9C,UAAI,aAAa,MAAM,CAAC,EAAE,IAAI,MAAM,CAAC;AACrC,aAAO,WAAW,WAAW,WAAW,IAAI,UAAU,IAAI,IAAI,YAAY,UAAU;AAAA,IACtF,CAAC;AACD,QAAI,mBAAmBD,OAAM,gBAAgB,aAAa,IAAI,0BAA0B,eAAe,aAAa,QAAQ,IAAI,MAAM,CAAC,GAAG,MAAM,IAAI,qBAAqB,eAAe,cAAc;AACtM,QAAI,mBAAmB,GAAG;AACxB,UAAI,YAAY,oBAAoB,kBAAkB,eAAe,IAAI;AACzE,aAAO,YAAY,QAAQ,SAAS;AAAA,IACtC;AACA,QAAI,oBAAoB,qBAAqB,OAAO,IAAI,OAAK,EAAE,WAAW,EAAE,OAAO,YAAY,EAAE,QAAQ,GAAG,OAAO,GAAG,EAAE,SAAS,CAAC,IAAI,OAAO,CAAC,EAAE,OAAO,YAAY,EAAE,QAAQ,GAAG,OAAO,CAAC,CAAC,IAAI,OAAO,IAAI,OAAK,EAAE,WAAW,YAAY,EAAE,QAAQ,GAAG,OAAO,IAAI,YAAY,GAAG,OAAO,CAAC;AACrR,QAAI,WAAW,oBAAoB,kBAAkB,eAAe,iBAAiB;AACrF,QAAI,4BAA4B,CAAC,GAAG,QAAQ,SAAS,CAAC,GAAG,GAAG,kBAAkB,MAAM,CAAC,EAAE,IAAI,WAAS,KAAK,OAAO,GAAG,CAAC,CAAC,GAAG,GAAG;AAC3H,QAAI,oBAAoB;AACtB,aAAO,kBAAkB,CAAC,EAAE,IAAI,yBAAyB;AAAA,IAC3D,OAAO;AACL,aAAO,UAAU,kBAAkB,CAAC,GAAG,yBAAyB;AAAA,IAClE;AAAA,EACF;AACA,WAAS,YAAY,aAAa,UAAU;AAG1C,QAAI,kBAAkB,YAAY,CAAC;AACnC,QAAI,SAAS,YAAY,IAAI,gBAAc,WAAW,WAAW,WAAW,QAAQ,IAAI,UAAU;AAClG,QAAI,QAAQ,YAAY,IAAI,gBAAc,WAAW,WAAW,WAAW,KAAK,IAAI,UAAU,UAAU,CAAC;AACzG,QAAI,YAAY,eAAe,GAAG,KAAK;AAEvC,QAAI,UAAU,MAAM,IAAI,CAAAE,UAAQ,UAAU,SAASA,MAAK,MAAM;AAC9D,QAAI,WAAW,UAAU,SAAS;AAClC,QAAI,oBAAoB,SAAS,SAAS;AAC1C,QAAI,QAAQ,oBAAoB,CAAC,IAAI;AACrC,QAAI,eAAe,QAAQ,QAAQ,CAAC;AACpC,QAAI,gBAAgB,UAAU;AAC5B,UAAI,gBAAgB,gBAAgB,OAAO;AAC3C,oBAAc,QAAQ;AACtB,oBAAc,QAAQ;AACtB,aAAO;AAAA,IACT,OAAO;AACL,aAAO;AAAA,IACT;AACA,aAAS,QAAQC,SAAQ;AACvB,UAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAEhF,UAAI,uBAAuB,UAAU,KAAK;AAC1C,UAAI,SAAS,MAAM,oBAAoB;AACvC,UAAI,QAAQ,UAAU;AACpB,YAAI,QAAQ,SAASC,OAAMC,IAAG;AAC5B,cAAI,MAAO,OAAM,KAAK,IAAIA;AAI1B,iBAAOA,EAAC,IAAI,QAAQF,QAAO,IAAI,CAAC,OAAO,eAAe,QAAQ,UAAU,IAAI,QAAQ,QAAQ,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI,MAAME,EAAC,CAAC,GAAG,QAAQ,CAAC;AAAA,QAClJ;AACA,iBAAS,IAAI,GAAG,IAAI,sBAAsB,KAAK;AAC7C,gBAAM,CAAC;AAAA,QACT;AAAA,MACF,OAAO;AACL,YAAI,SAAS,SAASC,QAAOC,KAAI;AAC/B,cAAI,MAAO,OAAM,KAAK,IAAIA;AAC1B,iBAAOA,GAAE,IAAI,SAASJ,QAAO,IAAI,OAAK,EAAE,WAAW,IAAI,EAAE,CAAC,IAAI,EAAEI,GAAE,CAAC,GAAG,QAAQ,MAAM,MAAM,IAAI,MAAS;AAAA,QACzG;AACA,iBAAS,KAAK,GAAG,KAAK,sBAAsB,MAAM;AAChD,iBAAO,EAAE;AAAA,QACX;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF;AASA,WAAS,oBAAoB,kBAAkB,eAAe,mBAAmB;AAC/E,YAAQ,kBAAkB;AAAA,MACxB,KAAK;AACH,eAAO,OAAK,cAAc,GAAG,CAAC;AAAA,MAChC,KAAK;AACH,eAAO,CAAC,GAAG,QAAQ,cAAc,GAAG,GAAG,GAAG;AAAA,MAC5C,KAAK;AACH,eAAO,CAAC,GAAG,QAAQ,cAAc,GAAG,GAAG,KAAK,GAAG,iBAAiB;AAAA,IACpE;AAAA,EACF;AAQA,WAAS,qBAAqB,UAAU,gBAAgB;AACtD,QAAI,cAAc,SAAS,SAAS;AAEpC,QAAI,YAAY,KAAK,WAAW,EAAG,QAAO;AAG1C,QAAI,YAAY,YAAY,MAAM,SAAS;AAE3C,QAAI,SAAS,KAAK,SAAS,EAAG,QAAO;AACrC,QAAI,SAAS,SAAS,iBAAiB,GAAG;AACxC,aAAO;AAAA,IACT;AACA,QAAI,SAAS,WAAW,iBAAiB,GAAG;AAC1C,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAWA,WAAS,0BAA0B,UAAU,QAAQ,KAAK,QAAQ;AAChE,QAAIP,OAAM,QAAQ,UAAU,CAAC,GAAG,QAAQ,KAAK,GAAG,MAAM,CAAC,MAAM,MAAM;AACjE,aAAO;AAAA,IACT;AACA,QAAIA,OAAM,QAAQ,UAAU,CAAC,GAAG,QAAQ,GAAG,CAAC,MAAM,MAAM;AACtD,aAAO;AAAA,IACT;AACA,QAAIA,OAAM,QAAQ,UAAU,MAAM,MAAM,MAAM;AAC5C,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAQA,WAAS,UAAU,OAAO,UAAU;AAClC,QAAI,eAAe,iBAAiB,UAAU,OAAOF,MAAI;AACzD,WAAO,QAAQ,OAAO,aAAa,IAAI,aAAa,OAAO;AAAA,EAC7D;AACF,CAAC;;;ACvOM,SAAS,cAAc;AAC5B,QAAM,IAAI,MAAM,yCAAyC;AAC3D;AACO,SAAS,aAAa;AAC3B,QAAM,IAAI,MAAM,wCAAwC;AAC1D;AACO,SAAS,WAAW;AACzB,QAAM,IAAI,MAAM,sCAAsC;AACxD;;;ACNA,IAAIU,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,WAAW,cAAc,SAAS,WAAW,aAAa,UAAU,YAAY,OAAO,UAAU,YAAY;AAC7I,IAAI,cAA6B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC1E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,IACA,SAAAC;AAAA,IACA,WAAAC;AAAA,IACA,QAAAC;AAAA,IACA,UAAAC;AAAA,IACA,KAAAC;AAAA,IACA,QAAAC;AAAA,IACA,YAAAC;AAAA,EACF,IAAI;AAsDJ,SAAOV,OAAMF,QAAM;AAAA;AAAA,IAGjB,QAAQ;AAAA,IACR,mBAAmB;AAAA,IACnB,QAAQ,SAASa,QAAO,MAAM;AAC5B,YAAM,IAAI,UAAU,0CAA0C,OAAO,IAAI,CAAC;AAAA,IAC5E;AAAA,IACA,SAAS,SAAS,QAAQ,MAAM;AAC9B,YAAM,IAAI,UAAU,sDAAsD,OAAO,MAAM,oCAAoC,CAAC;AAAA,IAC9H;AAAA,IACA,kBAAkB,SAAS,cAAc,OAAO,KAAK;AACnD,aAAO,KAAK,OAAO,OAAO,KAAK,GAAG,KAAK,CAAC;AAAA,IAC1C;AAAA,IACA,0BAA0B,SAAS,qBAAqB,OAAO,KAAK,MAAM;AACxE,aAAO,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC;AAAA,IAC7C;AAAA,IACA,2BAA2B,SAAS,sBAAsB,OAAO,KAAK,YAAY;AAChF,aAAO,KAAK,OAAO,OAAO,KAAK,GAAG,UAAU,CAAC;AAAA,IAC/C;AAAA,IACA,mCAAmC,SAAS,6BAA6B,OAAO,KAAK,MAAM,YAAY;AACrG,aAAO,KAAK,OAAO,OAAO,KAAK,MAAM,UAAU,CAAC;AAAA,IAClD;AAAA;AAAA,IAEA,yBAAyB,SAAS,oBAAoB,OAAO,KAAK;AAChE,aAAO,KAAK,OAAO,OAAO,KAAK,IAAI,KAAK,CAAC;AAAA,IAC3C;AAAA,IACA,kBAAkB,SAAS,cAAc,OAAO,KAAK;AACnD,aAAO,KAAK,OAAO,OAAO,KAAK,GAAG,KAAK,IAAI,KAAK,CAAC;AAAA,IACnD;AAAA,IACA,wCAAwC,SAAS,iCAAiC,OAAO,KAAK,MAAM;AAClG,aAAO,KAAK,OAAO,OAAO,KAAK,OAAO,IAAI,GAAG,KAAK,CAAC;AAAA,IACrD;AAAA,IACA,iCAAiC,SAAS,2BAA2B,OAAO,KAAK,MAAM;AACrF,aAAO,KAAK,OAAO,OAAO,KAAK,GAAG,KAAK,OAAO,IAAI,GAAG,KAAK,CAAC;AAAA,IAC7D;AAAA,IACA,kCAAkC,SAAS,4BAA4B,OAAO,KAAK,YAAY;AAC7F,aAAO,KAAK,OAAO,OAAO,KAAK,IAAI,UAAU,CAAC;AAAA,IAChD;AAAA,IACA,2BAA2B,SAAS,sBAAsB,OAAO,KAAK,YAAY;AAChF,aAAO,KAAK,OAAO,OAAO,KAAK,GAAG,KAAK,IAAI,UAAU,CAAC;AAAA,IACxD;AAAA,IACA,iDAAiD,SAAS,yCAAyC,OAAO,KAAK,MAAM,YAAY;AAC/H,aAAO,KAAK,OAAO,OAAO,KAAK,OAAO,IAAI,GAAG,UAAU,CAAC;AAAA,IAC1D;AAAA,IACA,0CAA0C,SAAS,mCAAmC,OAAO,KAAK,MAAM,YAAY;AAClH,aAAO,KAAK,OAAO,OAAO,KAAK,GAAG,KAAK,OAAO,IAAI,GAAG,UAAU,CAAC;AAAA,IAClE;AAAA,IACA,wBAAwB,SAAS,oBAAoB,OAAO,KAAK;AAC/D,UAAIC,aAAY,MAAM;AACtB,aAAO,KAAK,OAAO,OAAO,KAAK,IAAIA,WAAU,CAAC,GAAG,KAAK,CAAC;AAAA,IACzD;AAAA,IACA,mCAAmC,SAAS,8BAA8B,OAAO,KAAK,MAAM;AAC1F,aAAO,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC;AAAA,IAC7C;AAAA,IACA,iCAAiC,SAAS,4BAA4B,OAAO,KAAK,YAAY;AAC5F,UAAIA,aAAY,MAAM;AACtB,aAAO,KAAK,OAAO,OAAO,KAAK,IAAIA,WAAU,CAAC,GAAG,UAAU,CAAC;AAAA,IAC9D;AAAA,IACA,4CAA4C,SAAS,sCAAsC,OAAO,KAAK,MAAM,YAAY;AACvH,aAAO,KAAK,OAAO,OAAO,KAAK,MAAM,UAAU,CAAC;AAAA,IAClD;AAAA,IACA,sBAAsB,SAAS,kBAAkB,OAAO,KAAK;AAC3D,aAAO,KAAK,OAAO,OAAO,KAAK,GAAG,KAAK,CAAC;AAAA,IAC1C;AAAA,IACA,gCAAgC,SAAS,2BAA2B,OAAO,KAAK,MAAM;AACpF,aAAO,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC;AAAA,IAC7C;AAAA,IACA,+BAA+B,SAAS,0BAA0B,OAAO,KAAK,YAAY;AACxF,aAAO,KAAK,OAAO,OAAO,KAAK,GAAG,UAAU,CAAC;AAAA,IAC/C;AAAA,IACA,yCAAyC,SAAS,mCAAmC,OAAO,KAAK,MAAM,YAAY;AACjH,aAAO,KAAK,OAAO,OAAO,KAAK,MAAM,UAAU,CAAC;AAAA,IAClD;AAAA,IACA,oBAAoB,SAAS,eAAe,OAAO,KAAK,MAAM;AAC5D,aAAO,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC;AAAA,IAC7C;AAAA,IACA,6BAA6B,SAAS,uBAAuB,OAAO,KAAK,MAAM,YAAY;AACzF,aAAO,KAAK,OAAO,OAAO,KAAK,MAAM,UAAU,CAAC;AAAA,IAClD;AAAA,EACF,CAAC;AACD,WAAS,KAAK,KAAK;AACjB,QAAIX,QAAO,WAAW,UAAU;AAC9B,aAAOC,UAASA,QAAO,GAAG,IAAI,SAAS;AAAA,IACzC;AACA,WAAO;AAAA,EACT;AACA,WAAS,UAAU,KAAK,YAAY;AAClC,QAAI,IAAI,OAAO,GAAG;AAClB,QAAI,CAAC,GAAG;AACN,YAAM,IAAI,YAAY,aAAa,MAAM,qBAAqB;AAAA,IAChE;AACA,QAAID,QAAO,WAAW,aAAa;AACjC,UAAIE,eAAc,QAAW;AAC3B,oBAAY;AAAA,MACd;AACA,aAAO,KAAK,OAAOA,WAAU,EAAE,KAAK,GAAGA,WAAU,EAAE,GAAG,GAAGA,WAAU,EAAE,IAAI,CAAC,GAAG,UAAU;AAAA,IACzF,OAAO;AACL,aAAO,KAAK,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAAA,IACxD;AAAA,EACF;AAWA,WAAS,OAAO,OAAO,KAAK,MAAM,YAAY;AAC5C,QAAI,QAAQ,CAAC;AACb,QAAIM,QAAO,IAAI,EAAG,OAAM,IAAI,MAAM,uBAAuB;AACzD,QAAI,UAAUC,YAAW,IAAI,IAAI,aAAaL,aAAYD,WAAU,aAAaG,YAAWD;AAC5F,QAAI,IAAI;AACR,WAAO,QAAQ,GAAG,GAAG,GAAG;AACtB,YAAM,KAAK,CAAC;AACZ,UAAIE,KAAI,GAAG,IAAI;AAAA,IACjB;AACA,WAAO;AAAA,EACT;AAWA,WAAS,OAAO,KAAK;AACnB,QAAI,OAAO,IAAI,MAAM,GAAG;AAGxB,QAAI,OAAO,KAAK,IAAI,SAAU,KAAK;AAEjC,aAAO,OAAO,GAAG;AAAA,IACnB,CAAC;AACD,QAAI,UAAU,KAAK,KAAK,SAAU,KAAK;AACrC,aAAO,MAAM,GAAG;AAAA,IAClB,CAAC;AACD,QAAI,SAAS;AACX,aAAO;AAAA,IACT;AACA,YAAQ,KAAK,QAAQ;AAAA,MACnB,KAAK;AACH,eAAO;AAAA,UACL,OAAO,KAAK,CAAC;AAAA,UACb,KAAK,KAAK,CAAC;AAAA,UACX,MAAM;AAAA,QACR;AAAA,MACF,KAAK;AACH,eAAO;AAAA,UACL,OAAO,KAAK,CAAC;AAAA,UACb,KAAK,KAAK,CAAC;AAAA,UACX,MAAM,KAAK,CAAC;AAAA,QACd;AAAA,MACF;AACE,eAAO;AAAA,IACX;AAAA,EACF;AACF,CAAC;;;ACxOD,IAAIK,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,aAAa,QAAQ;AAC3C,IAAI,gBAA+B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC5E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,WAAAC;AAAA,EACF,IAAI;AAyCJ,SAAOD,OAAMF,QAAM;AAAA,IACjB,iBAAiB,SAAS,aAAa,GAAG,OAAO;AAC/C,aAAO,EAAE,QAAQ,OAAO,IAAI;AAAA,IAC9B;AAAA,IACA,gBAAgB,SAAS,YAAY,GAAG,OAAO;AAC7C,YAAM,QAAQ,SAAUI,OAAM;AAC5B,YAAI,CAACD,WAAUC,KAAI,GAAG;AACpB,gBAAM,IAAI,UAAU,iCAAiCA,KAAI;AAAA,QAC3D;AAAA,MACF,CAAC;AACD,aAAO,QAAa,GAAG,KAAK;AAAA,IAC9B;AAAA,EACF,CAAC;AACH,CAAC;;;AC5DD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AA2BJ,SAAOA,OAAMF,QAAM;AAAA,IACjB,QAAQ,OAAK,EAAE,KAAK;AAAA,IACpB,OAAO;AAAA,IACP,QAAQ,OAAK,CAAC,EAAE,MAAM;AAAA;AAAA,IAEtB,wDAAwD,QAAM,CAAC;AAAA,EACjE,CAAC;AACH,CAAC;;;ACrCD,IAAIG,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,UAAU,WAAW;AACrD,IAAI,cAA6B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC1E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,EACF,IAAI;AAiCJ,SAAOH,OAAMF,QAAM;AAAA,IACjB,IAAI,SAAS,IAAI;AACf,aAAOG,QAAO,WAAW,UAAU,OAAO,CAAC,CAAC,IAAI,OAAO,CAAC,GAAG,SAAS;AAAA,IACtE;AAAA;AAAA;AAAA,IAGA,kCAAkC,SAAS,0BAA0BG,OAAM;AACzE,UAAI,OAAOA,MAAKA,MAAK,SAAS,CAAC;AAC/B,UAAI,OAAO,SAAS,UAAU;AAC5B,YAAIC,UAASD,MAAK,IAAI;AACtB,eAAO,OAAOA,OAAMC,OAAM;AAAA,MAC5B,WAAWJ,QAAO,WAAW,SAAS;AACpC,eAAO,OAAOG,KAAI;AAAA,MACpB,OAAO;AACL,eAAO,OAAOA,OAAM,SAAS;AAAA,MAC/B;AAAA,IACF;AAAA,IACA,OAAO;AAAA,IACP,QAAQ,SAASE,QAAOF,OAAM;AAC5B,UAAIC,UAASD,MAAK,QAAQ;AAC1B,aAAO,OAAOA,MAAK,QAAQ,GAAGC,OAAM;AAAA,IACtC;AAAA,IACA,0BAA0B,SAAS,qBAAqBD,OAAMC,SAAQ;AACpE,aAAO,OAAOD,MAAK,QAAQ,GAAGC,OAAM;AAAA,IACtC;AAAA,EACF,CAAC;AASD,WAAS,OAAOD,OAAMC,SAAQ;AAC5B,QAAI,gBAAgB,WAAWD,KAAI;AACnC,QAAI,eAAe,gBAAgB,IAAID,WAAU,CAAC,IAAI;AACtD,IAAAI,WAAUH,KAAI;AACd,QAAIC,SAAQ;AAEV,UAAI,IAAIH,QAAOG,OAAM;AACrB,UAAID,MAAK,SAAS,GAAG;AACnB,eAAO,EAAE,OAAOA,OAAM,YAAY;AAAA,MACpC;AACA,aAAO;AAAA,IACT,OAAO;AAEL,UAAI,MAAM,CAAC;AACX,UAAIA,MAAK,SAAS,GAAG;AACnB,eAAO,OAAO,KAAKA,OAAM,YAAY;AAAA,MACvC;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAGA,WAAS,WAAWA,OAAM;AACxB,QAAI,gBAAgB;AACpB,IAAAA,MAAK,QAAQ,SAAU,OAAO,OAAO,KAAK;AACxC,UAAI,YAAY,KAAK,GAAG;AACtB,wBAAgB;AAChB,YAAI,KAAK,IAAI,MAAM,SAAS;AAAA,MAC9B;AAAA,IACF,CAAC;AACD,WAAO;AAAA,EACT;AAGA,WAASG,WAAUH,OAAM;AACvB,IAAAA,MAAK,QAAQ,SAAU,OAAO;AAC5B,UAAI,OAAO,UAAU,YAAY,CAAC,UAAU,KAAK,KAAK,QAAQ,GAAG;AAC/D,cAAM,IAAI,MAAM,wDAAwD;AAAA,MAC1E;AAAA,IACF,CAAC;AAAA,EACH;AACF,CAAC;;;AC5GM,SAAS,oBAAoB,KAAK,QAAQ,OAAO;AAEtD,MAAI;AACJ,MAAI,OAAO,GAAG,EAAE,SAAS,iBAAiB,GAAG;AAC3C,cAAU,UAAU,SAAS,IAAI,aAAa,OAAO,KAAK,IAAI,cAAc,KAAK,UAAU,KAAK,IAAI,MAAM,aAAa,IAAI,KAAK,SAAS;AACzI,WAAO,IAAI,UAAU,sBAAsB,SAAS,kCAAkC,OAAO;AAAA,EAC/F;AACA,MAAI,OAAO,GAAG,EAAE,SAAS,iBAAiB,GAAG;AAC3C,cAAU,UAAU,SAAS,IAAI,aAAa,OAAO,KAAK,IAAI,cAAc,KAAK,UAAU,KAAK,IAAI,MAAM;AAC1G,WAAO,IAAI,UAAU,sBAAsB,SAAS,0DAA0D,OAAO;AAAA,EACvH;AACA,SAAO;AACT;;;ACrBA,IAAII,SAAO;AACX,IAAIC,iBAAe,CAAC,UAAU,cAAc,WAAW;AAChD,IAAI,gBAA+B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC5E,MAAI;AAAA,IACF,QAAQ;AAAA,IACR,WAAAC;AAAA,IACA,UAAAC;AAAA,EACF,IAAI;AACJ,MAAI,kBAAkB;AAAA,IACpB,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,UAAU;AAAA,EACZ;AAGA,MAAI,mBAAmB;AAAA,IACrB,QAAQ,OAAK,QAAQ,CAAC;AAAA,IACtB,WAAWD,aAAY,OAAKA,WAAU,CAAC,IAAI;AAAA,IAC3C,QAAQ,OAAK,OAAO,CAAC;AAAA,IACrB,UAAUC,YAAW,OAAKA,UAAS,CAAC,IAAI;AAAA,EAC1C;AAsCA,SAAO,SAASC,SAAQ,OAAO;AAC7B,QAAI,aAAa,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACrF,QAAI,QAAQ,UAAU,SAAS,IAAI,UAAU,CAAC,IAAI;AAClD,QAAI,UAAU,QAAW;AACvB,YAAM,IAAI,YAAY,sCAAsC;AAAA,IAC9D;AACA,QAAI,YAAY,OAAO,KAAK;AAC5B,QAAI,EAAE,aAAa,kBAAkB;AACnC,YAAM,IAAI,UAAU,oBAAoB,QAAQ,eAAe,YAAY,8BAA8B,OAAO,KAAK,eAAe,EAAE,KAAK,IAAI,CAAC;AAAA,IAClJ;AACA,QAAI,EAAE,cAAc,mBAAmB;AACrC,YAAM,IAAI,UAAU,oBAAoB,QAAQ,eAAe,aAAa,+BAA+B,OAAO,KAAK,gBAAgB,EAAE,KAAK,IAAI,CAAC;AAAA,IACrJ;AACA,QAAI,eAAe,WAAW;AAC5B,aAAO;AAAA,IACT,OAAO;AACL,aAAO,iBAAiB,UAAU,EAAE,KAAK;AAAA,IAC3C;AAAA,EACF;AACF,CAAC;;;AChFD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,SAAS;AAC/B,IAAI,qBAAoC,wBAAQD,QAAMC,gBAAc,UAAQ;AACjF,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,SAAAC;AAAA,EACF,IAAI;AAaJ,SAAOD,OAAMF,QAAM;AAAA,IACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,IAAI;AAAA,IACb;AAAA,IACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,aAAO,EAAE,IAAI,CAAC;AAAA,IAChB;AAAA,IACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,aAAO,EAAE,IAAI,CAAC;AAAA,IAChB;AAAA,IACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,IAAI;AAAA,IACb;AAAA,IACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,aAAO,EAAE,IAAI,CAAC;AAAA,IAChB;AAAA,IACA,wDAAwD,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC;AAAA,IAC5E,iDAAiD,CAAC,GAAG,MAAM,EAAE,WAAW,CAAC;AAAA,EAC3E,CAAC;AACH,CAAC;;;ACpCM,SAAS,sBAAsB,MAAM;AAC1C,MAAI;AAAA,IACF,aAAAI;AAAA,EACF,IAAI;AAUJ,SAAO,SAAS,gBAAgB,GAAG,GAAG,MAAM;AAC1C,QAAI,QAAQ,EAAE,KAAK;AACnB,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,IAAI,WAAW,2CAA2CC,QAAO,KAAK,IAAI,GAAG;AAAA,IACrF;AACA,QAAI,OAAO,MAAM,CAAC;AAClB,QAAI,UAAU,MAAM,CAAC;AACrB,QAAI,SAAS,SAAS;AACpB,YAAM,IAAI,WAAW,kCAAkCA,QAAO,KAAK,IAAI,GAAG;AAAA,IAC5E;AACA,QAAI,OAAO,CAAC;AACZ,QAAI,SAAS,CAAC,GAAG;AACf,UAAI,QAAQ,EAAE,KAAK;AACnB,UAAI,QAAQ,EAAE;AAGd,UAAI,MAAM,WAAW,GAAG;AACtB,YAAI,MAAM,CAAC,MAAM,MAAM;AACrB,gBAAM,IAAI,WAAW,8DAA8D;AAAA,QACrF;AACA,iBAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,eAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAAA,QACrB;AACA,eAAO,IAAID,aAAY;AAAA,UACrB;AAAA,UACA,MAAM,CAAC,MAAM,CAAC;AAAA,UACd,UAAU,EAAE;AAAA,QACd,CAAC;AAAA,MACH;AAGA,UAAI,MAAM,WAAW,GAAG;AACtB,YAAI,MAAM,CAAC,MAAM,QAAQ,MAAM,CAAC,MAAM,GAAG;AACvC,gBAAM,IAAI,WAAW,8DAA8D;AAAA,QACrF;AACA,YAAI,cAAc,CAAC,GAAG;AACpB,cAAI,MAAM;AACR,mBAAO,CAAC;AACR,qBAAS,KAAK,GAAG,KAAK,MAAM,MAAM;AAChC,mBAAK,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AAAA,YAC1B;AACA,mBAAO,IAAIA,aAAY;AAAA,cACrB;AAAA,cACA,MAAM,CAAC,MAAM,CAAC;AAAA,cACd,UAAU,EAAE;AAAA,YACd,CAAC;AAAA,UACH;AACA,iBAAO;AAAA,QACT;AACA,YAAI,eAAe,CAAC,GAAG;AACrB,mBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,iBAAK,GAAG,IAAI,CAAC,CAAC;AAAA,UAChB;AACA,cAAI,SAAS,EAAE;AACf,cAAI,QAAQ,EAAE;AACd,cAAI,MAAM,EAAE;AACZ,mBAAS,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,KAAK;AAC7C,gBAAI,MAAM,MAAM,CAAC;AACjB,iBAAK,GAAG,EAAE,CAAC,IAAI,OAAO,CAAC;AAAA,UACzB;AACA,iBAAO,IAAIA,aAAY;AAAA,YACrB;AAAA,YACA,MAAM,CAAC,MAAM,CAAC;AAAA,YACd,UAAU,EAAE;AAAA,UACd,CAAC;AAAA,QACH;AAAA,MACF;AACA,YAAM,IAAI,WAAW,iFAAiF;AAAA,IACxG;AACA,QAAI,QAAQ,CAAC,GAAG;AACd,UAAI,QAAQ,UAAU,CAAC;AACvB,UAAI,MAAM,WAAW,GAAG;AACtB,YAAI,MAAM,CAAC,MAAM,MAAM;AACrB,gBAAM,IAAI,WAAW,8DAA8D;AAAA,QACrF;AACA,iBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,eAAK,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC;AAAA,QACrB;AACA,eAAO,IAAIA,aAAY;AAAA,UACrB;AAAA,UACA,MAAM,CAAC,MAAM,CAAC;AAAA,QAChB,CAAC;AAAA,MACH;AACA,UAAI,MAAM,WAAW,GAAG;AACtB,YAAI,MAAM,CAAC,MAAM,QAAQ,MAAM,CAAC,MAAM,GAAG;AACvC,gBAAM,IAAI,WAAW,8DAA8D;AAAA,QACrF;AACA,iBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,eAAK,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AAAA,QACxB;AACA,eAAO,IAAIA,aAAY;AAAA,UACrB;AAAA,UACA,MAAM,CAAC,MAAM,CAAC;AAAA,QAChB,CAAC;AAAA,MACH;AACA,YAAM,IAAI,WAAW,iFAAiF;AAAA,IACxG;AAAA,EACF;AACF;;;AChHA,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,gBAAgB,kBAAkB,kBAAkB,eAAe,aAAa;AAChH,IAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,cAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,aAAAC;AAAA,IACA,aAAAC;AAAA,EACF,IAAI;AACJ,MAAI,kBAAkB,sBAAsB;AAAA,IAC1C,aAAAA;AAAA,EACF,CAAC;AA0BD,SAAON,OAAMF,QAAM;AAAA,IACjB,gCAAgC,SAAS,2BAA2B,GAAG,GAAG;AACxE,aAAO,4BAA4B,GAAG,CAAC;AAAA,IACzC;AAAA,IACA,+BAA+B,SAAS,0BAA0B,GAAG,GAAG;AACtE,aAAO,2BAA2B,GAAG,CAAC;AAAA,IACxC;AAAA,IACA,yBAAyB,SAAS,oBAAoB,GAAG,GAAG;AAC1D,UAAI,IAAIG,QAAO,CAAC;AAChB,UAAI,IAAI,2BAA2B,GAAG,CAAC;AACvC,aAAO,EAAE,QAAQ;AAAA,IACnB;AAAA,EACF,CAAC;AACD,WAAS,2BAA2B,GAAG,GAAG;AAExC,QAAI,gBAAgB,GAAG,GAAG,IAAI;AAC9B,QAAI,QAAQ,EAAE;AACd,QAAI,OAAO,EAAE,MAAM,CAAC;AACpB,QAAI,UAAU,EAAE,MAAM,CAAC;AAGvB,QAAI,IAAI,CAAC;AACT,QAAI,QAAQ,EAAE;AAEd,aAAS,IAAI,UAAU,GAAG,KAAK,GAAG,KAAK;AAErC,UAAI,KAAK,MAAM,CAAC,EAAE,CAAC,KAAK;AAExB,UAAI,KAAK;AACT,UAAI,CAACI,aAAY,IAAI,CAAC,GAAG;AAEvB,YAAI,MAAM,MAAM,CAAC,EAAE,CAAC;AACpB,YAAIA,aAAY,KAAK,CAAC,GAAG;AAEvB,gBAAM,IAAI,MAAM,yDAAyD;AAAA,QAC3E;AACA,aAAKH,cAAa,IAAI,GAAG;AAGzB,iBAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAE/B,gBAAM,CAAC,IAAI,CAACE,gBAAe,MAAM,CAAC,EAAE,CAAC,KAAK,GAAGD,gBAAe,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAAA,QAC/E;AAAA,MACF,OAAO;AAEL,aAAK;AAAA,MACP;AAEA,QAAE,CAAC,IAAI,CAAC,EAAE;AAAA,IACZ;AACA,WAAO,IAAIG,aAAY;AAAA,MACrB,MAAM;AAAA,MACN,MAAM,CAAC,MAAM,CAAC;AAAA,IAChB,CAAC;AAAA,EACH;AACA,WAAS,4BAA4B,GAAG,GAAG;AAEzC,QAAI,gBAAgB,GAAG,GAAG,IAAI;AAC9B,QAAI,QAAQ,EAAE;AACd,QAAI,OAAO,EAAE,MAAM,CAAC;AACpB,QAAI,UAAU,EAAE,MAAM,CAAC;AACvB,QAAI,SAAS,EAAE;AACf,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE;AAGZ,QAAI,IAAI,CAAC;AAGT,aAAS,IAAI,UAAU,GAAG,KAAK,GAAG,KAAK;AACrC,UAAI,KAAK,MAAM,CAAC,EAAE,CAAC,KAAK;AACxB,UAAI,CAACD,aAAY,IAAI,CAAC,GAAG;AAGvB,YAAI,MAAM;AAGV,YAAI,UAAU,CAAC;AACf,YAAI,WAAW,CAAC;AAGhB,YAAI,aAAa,IAAI,CAAC;AACtB,YAAI,YAAY,IAAI,IAAI,CAAC;AAGzB,iBAAS,IAAI,YAAY,GAAG,KAAK,YAAY,KAAK;AAChD,cAAI,IAAI,MAAM,CAAC;AAGf,cAAI,MAAM,GAAG;AACX,kBAAM,OAAO,CAAC;AAAA,UAChB,WAAW,IAAI,GAAG;AAEhB,oBAAQ,KAAK,OAAO,CAAC,CAAC;AACtB,qBAAS,KAAK,CAAC;AAAA,UACjB;AAAA,QACF;AAGA,YAAIA,aAAY,KAAK,CAAC,GAAG;AACvB,gBAAM,IAAI,MAAM,yDAAyD;AAAA,QAC3E;AACA,YAAI,KAAKH,cAAa,IAAI,GAAG;AAC7B,iBAAS,KAAK,GAAG,aAAa,SAAS,QAAQ,KAAK,YAAY,MAAM;AACpE,cAAI,KAAK,SAAS,EAAE;AACpB,gBAAM,EAAE,IAAI,CAACE,gBAAe,MAAM,EAAE,EAAE,CAAC,GAAGD,gBAAe,IAAI,QAAQ,EAAE,CAAC,CAAC,CAAC;AAAA,QAC5E;AACA,UAAE,CAAC,IAAI,CAAC,EAAE;AAAA,MACZ,OAAO;AAEL,UAAE,CAAC,IAAI,CAAC,CAAC;AAAA,MACX;AAAA,IACF;AACA,WAAO,IAAIG,aAAY;AAAA,MACrB,MAAM;AAAA,MACN,MAAM,CAAC,MAAM,CAAC;AAAA,IAChB,CAAC;AAAA,EACH;AACF,CAAC;;;AC9JD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,gBAAgB,kBAAkB,kBAAkB,eAAe,aAAa;AAChH,IAAI,kBAAiC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,cAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,aAAAC;AAAA,IACA,aAAAC;AAAA,EACF,IAAI;AACJ,MAAI,kBAAkB,sBAAsB;AAAA,IAC1C,aAAAA;AAAA,EACF,CAAC;AA0BD,SAAON,OAAMF,QAAM;AAAA,IACjB,gCAAgC,SAAS,2BAA2B,GAAG,GAAG;AACxE,aAAO,4BAA4B,GAAG,CAAC;AAAA,IACzC;AAAA,IACA,+BAA+B,SAAS,0BAA0B,GAAG,GAAG;AACtE,aAAO,2BAA2B,GAAG,CAAC;AAAA,IACxC;AAAA,IACA,yBAAyB,SAAS,oBAAoB,GAAG,GAAG;AAC1D,UAAI,IAAIG,QAAO,CAAC;AAChB,UAAI,IAAI,2BAA2B,GAAG,CAAC;AACvC,aAAO,EAAE,IAAI,OAAK,EAAE,QAAQ,CAAC;AAAA,IAC/B;AAAA,EACF,CAAC;AACD,WAAS,2BAA2B,GAAG,IAAI;AAKzC,QAAI,IAAI,CAAC,gBAAgB,GAAG,IAAI,IAAI,EAAE,MAAM,IAAI,OAAK,EAAE,CAAC,CAAC,CAAC;AAC1D,QAAI,IAAI,EAAE;AACV,QAAI,OAAO,EAAE,MAAM,CAAC;AACpB,QAAI,UAAU,EAAE,MAAM,CAAC;AAGvB,aAAS,IAAI,UAAU,GAAG,KAAK,GAAG,KAAK;AACrC,UAAI,IAAI,EAAE;AAGV,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,IAAI,EAAE,CAAC;AACX,YAAI,CAACI,aAAY,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG;AAG5B,YAAE,CAAC,IAAIH,cAAa,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AACjC,mBAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAE/B,cAAE,CAAC,IAAIE,gBAAe,EAAE,CAAC,GAAGD,gBAAe,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,UAC3D;AAAA,QACF,WAAW,CAACE,aAAY,EAAE,CAAC,GAAG,CAAC,GAAG;AAGhC,cAAI,MAAM,GAAG;AAEX,mBAAO,CAAC;AAAA,UACV,OAAO;AAEL,cAAE,OAAO,GAAG,CAAC;AACb,iBAAK;AACL,iBAAK;AAAA,UACP;AAAA,QACF,WAAW,MAAM,GAAG;AAGlB,cAAI,OAAO,CAAC,GAAG,CAAC;AAChB,eAAK,CAAC,IAAI;AACV,mBAAS,KAAK,IAAI,GAAG,MAAM,GAAG,MAAM;AAClC,iBAAK,EAAE,IAAID,gBAAe,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;AAAA,UAC9C;AACA,YAAE,KAAK,IAAI;AAAA,QACb;AAAA,MACF;AAAA,IACF;AACA,WAAO,EAAE,IAAI,OAAK,IAAIE,aAAY;AAAA,MAChC,MAAM,EAAE,IAAI,OAAK,CAAC,CAAC,CAAC;AAAA,MACpB,MAAM,CAAC,MAAM,CAAC;AAAA,IAChB,CAAC,CAAC;AAAA,EACJ;AACA,WAAS,4BAA4B,GAAG,IAAI;AAE1C,QAAI,IAAI,CAAC,gBAAgB,GAAG,IAAI,IAAI,EAAE,MAAM,IAAI,OAAK,EAAE,CAAC,CAAC,CAAC;AAC1D,QAAI,OAAO,EAAE,MAAM,CAAC;AACpB,QAAI,UAAU,EAAE,MAAM,CAAC;AACvB,QAAI,SAAS,EAAE;AACf,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE;AAGZ,aAAS,IAAI,UAAU,GAAG,KAAK,GAAG,KAAK;AACrC,UAAI,IAAI,EAAE;AAGV,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,IAAI,EAAE,CAAC;AAGX,YAAI,UAAU,CAAC;AACf,YAAI,WAAW,CAAC;AAGhB,YAAI,aAAa,IAAI,CAAC;AACtB,YAAI,YAAY,IAAI,IAAI,CAAC;AAGzB,YAAI,MAAM;AACV,iBAAS,IAAI,YAAY,GAAG,KAAK,YAAY,KAAK;AAChD,cAAI,IAAI,MAAM,CAAC;AAEf,cAAI,MAAM,GAAG;AACX,kBAAM,OAAO,CAAC;AAAA,UAChB,WAAW,IAAI,GAAG;AAEhB,oBAAQ,KAAK,OAAO,CAAC,CAAC;AACtB,qBAAS,KAAK,CAAC;AAAA,UACjB;AAAA,QACF;AACA,YAAI,CAACD,aAAY,KAAK,CAAC,GAAG;AAGxB,YAAE,CAAC,IAAIH,cAAa,EAAE,CAAC,GAAG,GAAG;AAG7B,mBAAS,MAAM,GAAG,aAAa,SAAS,QAAQ,MAAM,YAAY,OAAO;AACvE,gBAAI,KAAK,SAAS,GAAG;AACrB,cAAE,EAAE,IAAIE,gBAAe,EAAE,EAAE,GAAGD,gBAAe,EAAE,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC;AAAA,UAClE;AAAA,QACF,WAAW,CAACE,aAAY,EAAE,CAAC,GAAG,CAAC,GAAG;AAGhC,cAAI,MAAM,GAAG;AAEX,mBAAO,CAAC;AAAA,UACV,OAAO;AAEL,cAAE,OAAO,GAAG,CAAC;AACb,iBAAK;AACL,iBAAK;AAAA,UACP;AAAA,QACF,WAAW,MAAM,GAAG;AAGlB,cAAI,OAAO,CAAC,GAAG,CAAC;AAChB,eAAK,CAAC,IAAI;AAGV,mBAAS,MAAM,GAAG,cAAc,SAAS,QAAQ,MAAM,aAAa,OAAO;AACzE,gBAAI,MAAM,SAAS,GAAG;AACtB,iBAAK,GAAG,IAAID,gBAAe,KAAK,GAAG,GAAG,QAAQ,GAAG,CAAC;AAAA,UACpD;AACA,YAAE,KAAK,IAAI;AAAA,QACb;AAAA,MACF;AAAA,IACF;AACA,WAAO,EAAE,IAAI,OAAK,IAAIE,aAAY;AAAA,MAChC,MAAM,EAAE,IAAI,OAAK,CAAC,CAAC,CAAC;AAAA,MACpB,MAAM,CAAC,MAAM,CAAC;AAAA,IAChB,CAAC,CAAC;AAAA,EACJ;AACF,CAAC;;;ACxLD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,eAAe,cAAc;AAC5E,IAAI,cAA6B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC1E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,aAAAC;AAAA,IACA,aAAAC;AAAA,IACA,QAAAC;AAAA,IACA,cAAAC;AAAA,EACF,IAAI;AACJ,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAL;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAA;AAAA,IACA,cAAAK;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAL;AAAA,IACA,aAAAG;AAAA,EACF,CAAC;AACD,MAAI,uBAAuB,2BAA2B;AAAA,IACpD,OAAAH;AAAA,IACA,QAAAC;AAAA,EACF,CAAC;AA2DD,SAAOD,OAAMF,QAAM,kBAAkB;AAAA,IACnC,OAAAE;AAAA,IACA,aAAAE;AAAA,EACF,CAAC,GAAG,qBAAqB;AAAA,IACvB,MAAMA;AAAA,IACN,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EACN,CAAC,CAAC;AACJ,CAAC;AACM,IAAI,oBAAoB,QAAQJ,QAAM,CAAC,SAAS,aAAa,GAAG,WAAS;AAC9E,MAAI;AAAA,IACF,OAAAE;AAAA,IACA,aAAAE;AAAA,EACF,IAAI;AACJ,SAAOF,OAAMF,QAAM;AAAA,IACjB,YAAY,SAAS,QAAQ,GAAG,GAAG;AAEjC,UAAI,MAAM,MAAM;AACd,eAAO,MAAM;AAAA,MACf;AACA,UAAI,MAAM,MAAM;AACd,eAAO,MAAM;AAAA,MACf;AACA,UAAI,MAAM,QAAW;AACnB,eAAO,MAAM;AAAA,MACf;AACA,UAAI,MAAM,QAAW;AACnB,eAAO,MAAM;AAAA,MACf;AACA,aAAOI,aAAY,GAAG,CAAC;AAAA,IACzB;AAAA,EACF,CAAC;AACH,CAAC;;;AClHD,IAAII,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,aAAa,UAAU,eAAe,UAAU,cAAc;AAC9F,IAAI,gBAA+B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC5E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,IACA,QAAAC;AAAA,IACA,aAAAC;AAAA,IACA,QAAAC;AAAA,IACA,cAAAC;AAAA,EACF,IAAI;AACJ,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAN;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAA;AAAA,IACA,cAAAM;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAN;AAAA,IACA,aAAAI;AAAA,EACF,CAAC;AACD,MAAI,uBAAuB,2BAA2B;AAAA,IACpD,OAAAJ;AAAA,IACA,QAAAG;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACD,MAAI,eAAe,mBAAmB;AAAA,IACpC,OAAAL;AAAA,EACF,CAAC;AAiCD,WAAS,cAAc,GAAG,GAAG;AAC3B,WAAO,EAAE,GAAG,CAAC,KAAK,CAACO,aAAe,GAAG,GAAGN,QAAO,QAAQA,QAAO,MAAM;AAAA,EACtE;AACA,SAAOD,OAAMF,QAAM,oBAAoB;AAAA,IACrC,OAAAE;AAAA,IACA,QAAAC;AAAA,EACF,CAAC,GAAG;AAAA,IACF,oBAAoB,CAAC,GAAG,MAAM,IAAI;AAAA,IAClC,wBAAwB;AAAA,IACxB,kBAAkB,CAAC,GAAG,MAAM,IAAI;AAAA,IAChC,sBAAsB,CAAC,GAAG,MAAM,EAAE,QAAQ,CAAC,MAAM;AAAA,IACjD,uBAAuB,SAAS,mBAAmB,GAAG,GAAG;AACvD,aAAO,cAAcC,WAAU,CAAC,GAAG,CAAC;AAAA,IACtC;AAAA,IACA,uBAAuB,SAAS,mBAAmB,GAAG,GAAG;AACvD,aAAO,cAAc,GAAGA,WAAU,CAAC,CAAC;AAAA,IACtC;AAAA,IACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,YAAM,IAAI,UAAU,qDAAqD;AAAA,IAC3E;AAAA,EACF,GAAG,cAAc,qBAAqB;AAAA,IACpC,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EACN,CAAC,CAAC;AACJ,CAAC;AACM,IAAI,sBAAqC,wBAAQJ,QAAM,CAAC,SAAS,QAAQ,GAAG,WAAS;AAC1F,MAAI;AAAA,IACF,OAAAE;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AACJ,SAAOD,OAAMF,QAAM;AAAA,IACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,IAAI,KAAK,CAAC,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM;AAAA,IACjE;AAAA,EACF,CAAC;AACH,CAAC;;;ACnGD,IAAIO,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,UAAU,eAAe,UAAU,cAAc;AACjF,IAAI,kBAAiC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,QAAAC;AAAA,IACA,aAAAC;AAAA,IACA,QAAAC;AAAA,IACA,cAAAC;AAAA,EACF,IAAI;AACJ,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAL;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAA;AAAA,IACA,cAAAK;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAL;AAAA,IACA,aAAAG;AAAA,EACF,CAAC;AACD,MAAI,uBAAuB,2BAA2B;AAAA,IACpD,OAAAH;AAAA,IACA,QAAAE;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACD,MAAI,eAAe,mBAAmB;AAAA,IACpC,OAAAJ;AAAA,EACF,CAAC;AA6BD,SAAOA,OAAMF,QAAM,sBAAsB;AAAA,IACvC,OAAAE;AAAA,IACA,QAAAC;AAAA,EACF,CAAC,GAAG;AAAA,IACF,oBAAoB,CAAC,GAAG,MAAM,KAAK;AAAA,IACnC,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,aAAO,EAAE,IAAI,CAAC,KAAKK,aAAe,GAAG,GAAGL,QAAO,QAAQA,QAAO,MAAM;AAAA,IACtE;AAAA,IACA,kBAAkB,CAAC,GAAG,MAAM,KAAK;AAAA,IACjC,sBAAsB,CAAC,GAAG,MAAM,EAAE,QAAQ,CAAC,MAAM;AAAA,IACjD,oBAAoB,SAAS,kBAAkB;AAC7C,YAAM,IAAI,UAAU,qDAAqD;AAAA,IAC3E;AAAA,EACF,GAAG,cAAc,qBAAqB;AAAA,IACpC,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EACN,CAAC,CAAC;AACJ,CAAC;AACM,IAAI,wBAAuC,wBAAQH,QAAM,CAAC,SAAS,QAAQ,GAAG,WAAS;AAC5F,MAAI;AAAA,IACF,OAAAE;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AACJ,SAAOD,OAAMF,QAAM;AAAA,IACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,KAAK,KAAK,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM;AAAA,IACjE;AAAA,EACF,CAAC;AACH,CAAC;;;ACvFD,IAAIM,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,aAAa,UAAU,eAAe,UAAU,cAAc;AAC9F,IAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,IACA,QAAAC;AAAA,IACA,aAAAC;AAAA,IACA,QAAAC;AAAA,IACA,cAAAC;AAAA,EACF,IAAI;AACJ,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAN;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAA;AAAA,IACA,cAAAM;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAN;AAAA,IACA,aAAAI;AAAA,EACF,CAAC;AACD,MAAI,uBAAuB,2BAA2B;AAAA,IACpD,OAAAJ;AAAA,IACA,QAAAG;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACD,MAAI,eAAe,mBAAmB;AAAA,IACpC,OAAAL;AAAA,EACF,CAAC;AAiCD,WAAS,aAAa,GAAG,GAAG;AAC1B,WAAO,EAAE,GAAG,CAAC,KAAK,CAACO,aAAe,GAAG,GAAGN,QAAO,QAAQA,QAAO,MAAM;AAAA,EACtE;AACA,SAAOD,OAAMF,QAAM,mBAAmB;AAAA,IACpC,OAAAE;AAAA,IACA,QAAAC;AAAA,EACF,CAAC,GAAG;AAAA,IACF,oBAAoB,CAAC,GAAG,MAAM,IAAI;AAAA,IAClC,wBAAwB;AAAA,IACxB,kBAAkB,CAAC,GAAG,MAAM,IAAI;AAAA,IAChC,sBAAsB,CAAC,GAAG,MAAM,EAAE,QAAQ,CAAC,MAAM;AAAA,IACjD,uBAAuB,SAAS,mBAAmB,GAAG,GAAG;AACvD,aAAO,aAAaC,WAAU,CAAC,GAAG,CAAC;AAAA,IACrC;AAAA,IACA,uBAAuB,SAAS,mBAAmB,GAAG,GAAG;AACvD,aAAO,aAAa,GAAGA,WAAU,CAAC,CAAC;AAAA,IACrC;AAAA,IACA,oBAAoB,SAAS,kBAAkB;AAC7C,YAAM,IAAI,UAAU,qDAAqD;AAAA,IAC3E;AAAA,EACF,GAAG,cAAc,qBAAqB;AAAA,IACpC,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EACN,CAAC,CAAC;AACJ,CAAC;AACM,IAAI,qBAAoC,wBAAQJ,QAAM,CAAC,SAAS,QAAQ,GAAG,WAAS;AACzF,MAAI;AAAA,IACF,OAAAE;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AACJ,SAAOD,OAAMF,QAAM;AAAA,IACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,IAAI,KAAK,CAAC,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM;AAAA,IACjE;AAAA,EACF,CAAC;AACH,CAAC;;;ACnGD,IAAIO,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,UAAU,eAAe,UAAU,cAAc;AACjF,IAAI,iBAAgC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC7E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,QAAAC;AAAA,IACA,aAAAC;AAAA,IACA,QAAAC;AAAA,IACA,cAAAC;AAAA,EACF,IAAI;AACJ,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAL;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAA;AAAA,IACA,cAAAK;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAL;AAAA,IACA,aAAAG;AAAA,EACF,CAAC;AACD,MAAI,uBAAuB,2BAA2B;AAAA,IACpD,OAAAH;AAAA,IACA,QAAAE;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACD,MAAI,eAAe,mBAAmB;AAAA,IACpC,OAAAJ;AAAA,EACF,CAAC;AA6BD,SAAOA,OAAMF,QAAM,qBAAqB;AAAA,IACtC,OAAAE;AAAA,IACA,QAAAC;AAAA,EACF,CAAC,GAAG;AAAA,IACF,oBAAoB,CAAC,GAAG,MAAM,KAAK;AAAA,IACnC,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,aAAO,EAAE,IAAI,CAAC,KAAKK,aAAe,GAAG,GAAGL,QAAO,QAAQA,QAAO,MAAM;AAAA,IACtE;AAAA,IACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,KAAK;AAAA,IACd;AAAA,IACA,sBAAsB,CAAC,GAAG,MAAM,EAAE,QAAQ,CAAC,MAAM;AAAA,IACjD,oBAAoB,SAAS,kBAAkB;AAC7C,YAAM,IAAI,UAAU,qDAAqD;AAAA,IAC3E;AAAA,EACF,GAAG,cAAc,qBAAqB;AAAA,IACpC,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EACN,CAAC,CAAC;AACJ,CAAC;AACM,IAAI,uBAAsC,wBAAQH,QAAM,CAAC,SAAS,QAAQ,GAAG,WAAS;AAC3F,MAAI;AAAA,IACF,OAAAE;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AACJ,SAAOD,OAAMF,QAAM;AAAA,IACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,aAAO,KAAK,KAAK,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM;AAAA,IACjE;AAAA,EACF,CAAC;AACH,CAAC;;;AC7FD,IAAIM,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,WAAW,UAAU,OAAO;AAC5D,IAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,SAAAC;AAAA,IACA,QAAAC;AAAA,IACA,OAAO;AAAA,EACT,IAAI;AAgCJ,SAAOH,OAAMF,QAAM;AAAA;AAAA,IAEjB,kBAAkB;AAAA;AAAA,IAElB,sCAAsC,SAAS,gCAAgC,OAAO,KAAK;AACzF,aAAO,OAAO,OAAO,IAAI,QAAQ,GAAG,QAAQ;AAAA,IAC9C;AAAA;AAAA,IAEA,OAAO,SAAS,EAAE,MAAM;AACtB,UAAI,oBAAoB,IAAI,GAAG;AAC7B,cAAM,IAAI,UAAU,wCAAwC;AAAA,MAC9D;AACA,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF,CAAC;AASD,WAAS,SAAS,GAAG,GAAG;AACtB,QAAI;AACF,aAAOK,QAAO,GAAG,CAAC,IAAI,IAAI;AAAA,IAC5B,SAAS,KAAK;AACZ,YAAM,oBAAoB,KAAK,OAAO,CAAC;AAAA,IACzC;AAAA,EACF;AAQA,WAAS,KAAK,OAAO;AACnB,QAAI;AACJ,IAAAC,aAAY,OAAO,SAAU,OAAO;AAClC,UAAI;AACF,YAAI,UAAU,KAAK,GAAG;AACpB,gBAAM;AAAA,QACR,WAAW,QAAQ,UAAaD,QAAO,OAAO,GAAG,GAAG;AAClD,gBAAM;AAAA,QACR;AAAA,MACF,SAAS,KAAK;AACZ,cAAM,oBAAoB,KAAK,OAAO,KAAK;AAAA,MAC7C;AAAA,IACF,CAAC;AACD,QAAI,QAAQ,QAAW;AACrB,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AAGA,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAMD,SAAQ,KAAK,eAAe,KAAKD,OAAM,CAAC;AAAA,IAChD;AACA,WAAO;AAAA,EACT;AACF,CAAC;;;ACrGD,IAAII,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,WAAW,WAAW,OAAO;AAC7D,IAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,SAAAC;AAAA,IACA,SAAAC;AAAA,IACA,OAAO;AAAA,EACT,IAAI;AAgCJ,SAAOH,OAAMF,QAAM;AAAA;AAAA,IAEjB,kBAAkB;AAAA;AAAA,IAElB,sCAAsC,SAAS,gCAAgC,OAAO,KAAK;AACzF,aAAO,OAAO,OAAO,IAAI,QAAQ,GAAG,SAAS;AAAA,IAC/C;AAAA;AAAA,IAEA,OAAO,SAAS,EAAE,MAAM;AACtB,UAAI,oBAAoB,IAAI,GAAG;AAC7B,cAAM,IAAI,UAAU,wCAAwC;AAAA,MAC9D;AACA,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF,CAAC;AASD,WAAS,UAAU,GAAG,GAAG;AACvB,QAAI;AACF,aAAOK,SAAQ,GAAG,CAAC,IAAI,IAAI;AAAA,IAC7B,SAAS,KAAK;AACZ,YAAM,oBAAoB,KAAK,OAAO,CAAC;AAAA,IACzC;AAAA,EACF;AAQA,WAAS,KAAK,OAAO;AACnB,QAAIC;AACJ,IAAAC,aAAY,OAAO,SAAU,OAAO;AAClC,UAAI;AACF,YAAI,UAAU,KAAK,GAAG;AACpB,UAAAD,OAAM;AAAA,QACR,WAAWA,SAAQ,UAAaD,SAAQ,OAAOC,IAAG,GAAG;AACnD,UAAAA,OAAM;AAAA,QACR;AAAA,MACF,SAAS,KAAK;AACZ,cAAM,oBAAoB,KAAK,OAAO,KAAK;AAAA,MAC7C;AAAA,IACF,CAAC;AACD,QAAIA,SAAQ,QAAW;AACrB,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AAGA,QAAI,OAAOA,SAAQ,UAAU;AAC3B,MAAAA,OAAMF,SAAQE,MAAK,eAAeA,MAAKH,OAAM,CAAC;AAAA,IAChD;AACA,WAAOG;AAAA,EACT;AACF,CAAC;;;ACtGD,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,WAAW,aAAa;AACrC,IAAI,kCAAiD,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9F,MAAI;AAAA,IACF,SAAAC;AAAA,IACA,aAAAC;AAAA,EACF,IAAI;AACJ,WAASC,sBAAqB,MAAM,UAAU;AAC5C,QAAI,EAAE,gBAAgBA,wBAAuB;AAC3C,YAAM,IAAI,YAAY,kDAAkD;AAAA,IAC1E;AACA,QAAI,YAAY,CAAC,SAAS,QAAQ,GAAG;AACnC,YAAM,IAAI,MAAM,uBAAuB,QAAQ;AAAA,IACjD;AACA,QAAI,SAAS,IAAI,KAAK,QAAQ,IAAI,GAAG;AAEnC,UAAIC,UAAS,IAAIF,aAAY,MAAM,QAAQ;AAE3C,WAAK,QAAQE,QAAO;AACpB,WAAK,QAAQA,QAAO;AACpB,WAAK,YAAYA,QAAO;AACxB,WAAK,OAAO;AACZ,WAAK,OAAO;AAAA,IACd,WAAW,QAAQ,QAAQ,KAAK,IAAI,KAAK,QAAQ,KAAK,IAAI,GAAG;AAE3D,WAAK,QAAQ,KAAK;AAClB,WAAK,QAAQ,KAAK;AAClB,WAAK,YAAY,KAAK;AACtB,WAAK,OAAO,OAAO,KAAK,QAAQ,cAAc,KAAK,MAAM;AACzD,WAAK,OAAO,OAAO,KAAK,QAAQ,cAAc,KAAK,MAAM;AAAA,IAC3D,WAAW,MAAM;AAEf,YAAM,IAAI,UAAU,+BAA+B,OAAO,IAAI,IAAI,GAAG;AAAA,IACvE,OAAO;AAEL,WAAK,QAAQ,CAAC;AACd,WAAK,QAAQ,CAAC,CAAC;AACf,WAAK,YAAY;AACjB,WAAK,OAAO;AACZ,WAAK,OAAO;AAAA,IACd;AAAA,EACF;AACA,EAAAD,sBAAqB,YAAY,IAAID,aAAY;AAKjD,EAAAC,sBAAqB,UAAU,OAAO;AACtC,EAAAA,sBAAqB,UAAU,yBAAyB;AAexD,EAAAA,sBAAqB,UAAU,SAAS,SAAU,OAAO;AACvD,YAAQ,UAAU,QAAQ;AAAA,MACxB,KAAK,GACH;AAEE,YAAI,IAAID,aAAY,UAAU,OAAO,KAAK,MAAM,KAAK;AAErD,YAAI,SAAS,CAAC,GAAG;AAEf,iBAAO,IAAIC,sBAAqB;AAAA,YAC9B,MAAM,EAAE;AAAA,YACR,MAAM,EAAE;AAAA,YACR,UAAU,EAAE;AAAA,UACd,CAAC;AAAA,QACH;AACA,eAAO;AAAA,MACT;AAAA;AAAA,MAEF,KAAK;AAAA,MACL,KAAK;AACH,cAAM,IAAI,MAAM,0DAA0D;AAAA,MAC5E;AACE,cAAM,IAAI,YAAY,2BAA2B;AAAA,IACrD;AAAA,EACF;AAWA,EAAAA,sBAAqB,UAAU,MAAM,WAAY;AAC/C,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACrE;AAcA,EAAAA,sBAAqB,UAAU,SAAS,WAAY;AAClD,UAAM,IAAI,MAAM,sDAAsD;AAAA,EACxE;AAOA,EAAAA,sBAAqB,UAAU,UAAU,WAAY;AACnD,UAAM,IAAI,MAAM,uDAAuD;AAAA,EACzE;AAMA,EAAAA,sBAAqB,UAAU,QAAQ,WAAY;AACjD,WAAO,IAAIA,sBAAqB;AAAA,MAC9B,MAAM,MAAM,KAAK,KAAK;AAAA,MACtB,MAAM,MAAM,KAAK,KAAK;AAAA,MACtB,UAAU,KAAK;AAAA,IACjB,CAAC;AAAA,EACH;AAMA,EAAAA,sBAAqB,UAAU,SAAS,WAAY;AAClD,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,MAAM,KAAK;AAAA,MACX,MAAM,KAAK;AAAA,MACX,UAAU,KAAK;AAAA,IACjB;AAAA,EACF;AASA,EAAAA,sBAAqB,WAAW,SAAU,MAAM;AAC9C,WAAO,IAAIA,sBAAqB,IAAI;AAAA,EACtC;AAUA,EAAAA,sBAAqB,UAAU,WAAW,WAAY;AACpD,UAAM,IAAI,MAAM,wDAAwD;AAAA,EAC1E;AAMA,EAAAA,sBAAqB,UAAU,MAAM,WAAY;AAE/C,QAAI,KAAK,SAAS,MAAM;AAEtB,UAAI,IAAI;AAER,WAAK,QAAQ,SAAU,GAAG;AACxB,YAAI,MAAM,QAAQF,SAAQ,GAAG,CAAC,GAAG;AAC/B,cAAI;AAAA,QACN;AAAA,MACF,CAAC;AACD,WAAK,OAAO,MAAM,OAAO,IAAI;AAAA,IAC/B;AACA,WAAO,KAAK;AAAA,EACd;AAMA,EAAAE,sBAAqB,UAAU,MAAM,WAAY;AAE/C,QAAI,KAAK,SAAS,MAAM;AAEtB,UAAI,IAAI;AAER,WAAK,QAAQ,SAAU,GAAG;AACxB,YAAI,MAAM,QAAQF,SAAQ,GAAG,CAAC,GAAG;AAC/B,cAAI;AAAA,QACN;AAAA,MACF,CAAC;AACD,WAAK,OAAO,MAAM,OAAO,IAAI;AAAA,IAC/B;AACA,WAAO,KAAK;AAAA,EACd;AACA,SAAOE;AACT,GAAG;AAAA,EACD,SAAS;AACX,CAAC;;;ACxND,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,wBAAwB,mBAAmB;AACxD,IAAI,mBAAkC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC/E,MAAI;AAAA,IACF,sBAAAC;AAAA,IACA,mBAAAC;AAAA,EACF,IAAI;AAuBJ,WAASC,SAAQ;AACf,QAAI,EAAE,gBAAgBA,SAAQ;AAC5B,YAAM,IAAI,YAAY,kDAAkD;AAAA,IAC1E;AACA,SAAK,cAAc,CAAC;AACpB,SAAK,cAAc,CAAC;AACpB,SAAK,YAAY;AACjB,aAAS,IAAI,GAAG,KAAK,UAAU,QAAQ,IAAI,IAAI,KAAK;AAClD,UAAI,MAAM,IAAI,KAAK,UAAU,UAAU,IAAI,SAAY,UAAU,CAAC;AAClE,UAAI,aAAa,QAAQ,GAAG;AAC5B,UAAI,cAAc,SAAS,GAAG;AAC9B,UAAI,UAAU,OAAO;AACrB,UAAI,aAAa;AACjB,UAAI,QAAQ,GAAG,GAAG;AAChB,aAAK,YAAY,KAAK,GAAG;AACzB,aAAK,YAAY;AAAA,MACnB,WAAW,cAAc,aAAa;AAEpC,YAAI,IAAI;AACR,aAAK,YAAY;AACjB,YAAID,mBAAkB,GAAG,MAAM,WAAW;AACxC,cAAI,WAAY,KAAI,uBAAuB,gCAAgC,GAAG,EAAE,QAAQ,CAAC;AACzF,cAAI,YAAa,KAAI,uBAAuB,gCAAgC,IAAI,KAAK,EAAE,QAAQ,CAAC;AAChG,uBAAa,IAAI,QAAQ,EAAE;AAAA,QAC7B,OAAO;AACL,cAAI,uBAAuB,IAAI,QAAQ,CAAC;AAAA,QAC1C;AACA,aAAK,YAAY,KAAK,CAAC;AAAA,MACzB,WAAW,YAAY,UAAU;AAC/B,aAAK,YAAY,KAAK,GAAG;AAAA,MAC3B,WAAW,YAAY,UAAU;AAC/B,aAAK,YAAY,KAAK,OAAO,GAAG,CAAC;AAAA,MACnC,WAAW,YAAY,UAAU;AAE/B,aAAK,YAAY,KAAK,GAAG;AAAA,MAC3B,OAAO;AACL,cAAM,IAAI,UAAU,sEAAsE;AAAA,MAC5F;AACA,WAAK,YAAY,KAAK,UAAU;AAAA,IAElC;AAAA,EACF;AAKA,EAAAC,OAAM,UAAU,OAAO;AACvB,EAAAA,OAAM,UAAU,UAAU;AAC1B,WAAS,uBAAuB,KAAK;AAEnC,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,IAAI,GAAG,KAAK;AAC1C,UAAI,CAAC,SAAS,IAAI,CAAC,CAAC,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC,GAAG;AAC3C,cAAM,IAAI,UAAU,mDAAmD;AAAA,MACzE;AAAA,IACF;AAEA,QAAIC,UAAS,IAAIH,sBAAqB;AACtC,IAAAG,QAAO,QAAQ;AACf,IAAAA,QAAO,QAAQ,CAAC,IAAI,MAAM;AAC1B,WAAOA;AAAA,EACT;AAOA,EAAAD,OAAM,UAAU,QAAQ,WAAY;AAClC,QAAI,QAAQ,IAAIA,OAAM;AACtB,UAAM,cAAc,MAAM,KAAK,WAAW;AAC1C,UAAM,YAAY,KAAK;AACvB,UAAM,cAAc,KAAK;AACzB,WAAO;AAAA,EACT;AASA,EAAAA,OAAM,SAAS,SAAU,QAAQ;AAC/B,QAAI,QAAQ,IAAIA,OAAM;AACtB,IAAAA,OAAM,MAAM,OAAO,MAAM;AACzB,WAAO;AAAA,EACT;AAOA,EAAAA,OAAM,UAAU,OAAO,WAAY;AACjC,QAAIE,QAAO,CAAC;AACZ,aAAS,IAAI,GAAG,KAAK,KAAK,YAAY,QAAQ,IAAI,IAAI,KAAK;AACzD,UAAI,IAAI,KAAK,YAAY,CAAC;AAC1B,MAAAA,MAAK,CAAC,IAAI,SAAS,CAAC,KAAK,SAAS,CAAC,IAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAAA,IACvD;AACA,WAAOA;AAAA,EACT;AAOA,EAAAF,OAAM,UAAU,MAAM,WAAY;AAChC,QAAI,SAAS,CAAC;AACd,aAAS,IAAI,GAAG,KAAK,KAAK,YAAY,QAAQ,IAAI,IAAI,KAAK;AACzD,UAAIG,SAAQ,KAAK,YAAY,CAAC;AAC9B,aAAO,CAAC,IAAI,SAASA,MAAK,KAAK,SAASA,MAAK,IAAIA,SAAQA,OAAM,IAAI;AAAA,IACrE;AACA,WAAO;AAAA,EACT;AAOA,EAAAH,OAAM,UAAU,MAAM,WAAY;AAChC,QAAI,SAAS,CAAC;AACd,aAAS,IAAI,GAAG,KAAK,KAAK,YAAY,QAAQ,IAAI,IAAI,KAAK;AACzD,UAAIG,SAAQ,KAAK,YAAY,CAAC;AAC9B,aAAO,CAAC,IAAI,SAASA,MAAK,KAAK,SAASA,MAAK,IAAIA,SAAQA,OAAM,IAAI;AAAA,IACrE;AACA,WAAO;AAAA,EACT;AASA,EAAAH,OAAM,UAAU,UAAU,SAAU,UAAU;AAC5C,aAAS,IAAI,GAAG,KAAK,KAAK,YAAY,QAAQ,IAAI,IAAI,KAAK;AACzD,eAAS,KAAK,YAAY,CAAC,GAAG,GAAG,IAAI;AAAA,IACvC;AAAA,EACF;AAQA,EAAAA,OAAM,UAAU,YAAY,SAAU,KAAK;AACzC,QAAI;AACJ,QAAI,CAAC,SAAS,GAAG,GAAG;AAClB,aAAO;AAAA,IACT;AACA,YAAQ,wBAAwB,KAAK,YAAY,GAAG,OAAO,QAAQ,0BAA0B,SAAS,wBAAwB;AAAA,EAChI;AAMA,EAAAA,OAAM,UAAU,mBAAmB,WAAY;AAC7C,WAAO,KAAK,YAAY,WAAW,KAAK,SAAS,KAAK,YAAY,CAAC,CAAC;AAAA,EACtE;AAOA,EAAAA,OAAM,UAAU,oBAAoB,WAAY;AAC9C,WAAO,KAAK,iBAAiB,IAAI,KAAK,YAAY,CAAC,IAAI;AAAA,EACzD;AAUA,EAAAA,OAAM,UAAU,WAAW,WAAY;AACrC,WAAO,KAAK;AAAA,EACd;AAQA,EAAAA,OAAM,UAAU,UAAU,WAAY;AACpC,QAAI,QAAQ,CAAC;AACb,aAAS,IAAI,GAAG,KAAK,KAAK,YAAY,QAAQ,IAAI,IAAI,KAAK;AACzD,UAAI,YAAY,KAAK,YAAY,CAAC;AAClC,YAAM,KAAK,SAAS,SAAS,KAAK,SAAS,SAAS,IAAI,YAAY,UAAU,QAAQ,CAAC;AAAA,IACzF;AACA,WAAO;AAAA,EACT;AAQA,EAAAA,OAAM,UAAU,UAAUA,OAAM,UAAU;AAO1C,EAAAA,OAAM,UAAU,WAAW,WAAY;AACrC,QAAI,UAAU,CAAC;AACf,aAAS,IAAI,GAAG,KAAK,KAAK,YAAY,QAAQ,IAAI,IAAI,KAAK;AACzD,UAAI,YAAY,KAAK,YAAY,CAAC;AAClC,UAAI,SAAS,SAAS,GAAG;AACvB,gBAAQ,KAAK,KAAK,UAAU,SAAS,CAAC;AAAA,MACxC,OAAO;AACL,gBAAQ,KAAK,UAAU,SAAS,CAAC;AAAA,MACnC;AAAA,IACF;AACA,WAAO,MAAM,QAAQ,KAAK,IAAI,IAAI;AAAA,EACpC;AAQA,EAAAA,OAAM,UAAU,SAAS,WAAY;AACnC,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,YAAY,KAAK;AAAA,IACnB;AAAA,EACF;AASA,EAAAA,OAAM,WAAW,SAAU,MAAM;AAC/B,WAAOA,OAAM,OAAO,KAAK,UAAU;AAAA,EACrC;AACA,SAAOA;AACT,GAAG;AAAA,EACD,SAAS;AACX,CAAC;AAOD,SAAS,gCAAgC,mBAAmB;AAE1D,MAAI,iBAAiB,CAAC;AACtB,oBAAkB,QAAQ,CAAC,MAAM,QAAQ;AACvC,QAAI,MAAM;AACR,qBAAe,KAAK,GAAG;AAAA,IACzB;AAAA,EACF,CAAC;AACD,SAAO;AACT;;;AC7SA,IAAII,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AAwBJ,SAAOA,OAAM,QAAQ;AAAA,IACnB,QAAQ,SAASC,QAAO,GAAG;AACzB,aAAO,KAAK,KAAK,CAAC;AAAA,IACpB;AAAA,IACA,SAAS,SAASC,SAAQ,GAAG;AAC3B,aAAO,EAAE,KAAK;AAAA,IAChB;AAAA,IACA,WAAW,SAASC,WAAU,GAAG;AAC/B,aAAO,EAAE,KAAK;AAAA,IAChB;AAAA,EACF,CAAC;AACH,CAAC;;;ACxCM,IAAI,iBAAgC,wBAAQ,YAAY,CAAC,OAAO,GAAG,UAAQ;AAChF,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AACJ,SAAO;AAAA,IACL,MAAMA,OAAM,YAAY,UAAQ,OAAK;AACnC,UAAI,CAAC,EAAE,QAAQ,EAAE,YAAY,WAAW,KAAK,GAAG;AAC9C,cAAM,IAAI,UAAU,kCAAkC;AAAA,MACxD;AACA,aAAOA,OAAM,KAAK,MAAM,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK;AAAA,IAChD,CAAC;AAAA,EACH;AACF,CAAC;;;ACXD,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AACJ,MAAI,WAAW,eAAe;AAAA,IAC5B,OAAAA;AAAA,EACF,CAAC;AA6BD,SAAOA,OAAMF,QAAM;AAAA,IACjB,QAAQ,KAAK;AAAA,IACb,uBAAuB,OAAK,EAAE,IAAI;AAAA,EACpC,GAAG,QAAQ;AACb,CAAC;;;ACzCD,IAAIG,SAAO;AACX,IAAIC,iBAAe,CAAC,OAAO;AACpB,IAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,MAAI;AAAA,IACF,OAAAC;AAAA,EACF,IAAI;AACJ,MAAI,WAAW,eAAe;AAAA,IAC5B,OAAAA;AAAA,EACF,CAAC;AA6BD,SAAOA,OAAMF,QAAM;AAAA,IACjB,QAAQ,KAAK;AAAA,IACb,uBAAuB,OAAK,EAAE,IAAI;AAAA,EACpC,GAAG,QAAQ;AACb,CAAC;;;ACtCD,IAAIG,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,aAAa,eAAe,eAAe,gBAAgB,QAAQ;AACnG,IAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,IACA,aAAAC;AAAA,IACA,aAAAC;AAAA,IACA,cAAAC;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AACJ,MAAI,iBAAiB,qBAAqB;AAAA,IACxC,OAAAN;AAAA,EACF,CAAC;AACD,MAAI,mBAAmB,uBAAuB;AAAA,IAC5C,OAAAA;AAAA,IACA,aAAAG;AAAA,EACF,CAAC;AACD,MAAI,iBAAiB,qBAAqB;AAAA,IACxC,OAAAH;AAAA,IACA,aAAAI;AAAA,EACF,CAAC;AACD,MAAI,uBAAuB,2BAA2B;AAAA,IACpD,OAAAJ;AAAA,IACA,QAAAC;AAAA,IACA,QAAAK;AAAA,EACF,CAAC;AA0CD,SAAON,OAAMF,QAAM;AAAA,IACjB,YAAYI;AAAA,IACZ,oBAAoBF,OAAM,YAAY,UAAQ,CAAC,GAAG,GAAG,SAAS;AAC5D,UAAI,SAAS,KAAK,GAAG,CAAC;AACtB,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,iBAAS,KAAK,QAAQ,KAAK,CAAC,CAAC;AAAA,MAC/B;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACH,GAAG,qBAAqB;AAAA,IACtB,MAAME;AAAA,IACN,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EACN,CAAC,CAAC;AACJ,CAAC;;;ACvFD,IAAIK,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,aAAa,kBAAkB,QAAQ,MAAM;AACnE,IAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,WAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,MAAAC;AAAA,IACA,MAAAC;AAAA,EACF,IAAI;AAwBJ,SAAOJ,OAAMF,QAAM;AAAA,IACjB,4CAA4C;AAAA,IAC5C,8BAA8B;AAAA,EAChC,CAAC;AACD,WAAS,aAAa,GAAG,GAAG;AAC1B,QAAI,QAAQM,MAAK,CAAC;AAClB,QAAI,QAAQA,MAAK,CAAC;AAClB,QAAI,MAAM;AACV,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO,MAAM,CAAC;AAAA,IAChB,WAAW,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,GAAG;AAC/C,aAAO,MAAM,CAAC;AAAA,IAChB,OAAO;AACL,YAAM,IAAI,WAAW,6DAA6D,MAAM,KAAK,IAAI,IAAI,GAAG;AAAA,IAC1G;AACA,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO,MAAM,CAAC;AAAA,IAChB,WAAW,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,GAAG;AAC/C,aAAO,MAAM,CAAC;AAAA,IAChB,OAAO;AACL,YAAM,IAAI,WAAW,6DAA6D,MAAM,KAAK,IAAI,IAAI,GAAG;AAAA,IAC1G;AACA,QAAI,SAAS,KAAM,OAAM,IAAI,WAAW,qCAAqC,OAAO,SAAS,OAAO,GAAG;AACvG,QAAI,SAAS,EAAG,OAAM,IAAI,WAAW,mDAAmD;AACxF,WAAO;AAAA,EACT;AACA,WAAS,UAAU,GAAG,GAAG;AACvB,QAAI,IAAI,aAAa,GAAG,CAAC;AACzB,QAAI,QAAQ,SAAS,CAAC,IAAI,EAAE,QAAQ;AACpC,QAAI,MAAM,SAAS,CAAC,IAAI,EAAE,aAAa,EAAE,YAAY,IAAI;AACzD,QAAI,QAAQ,SAAS,CAAC,IAAI,EAAE,QAAQ;AACpC,QAAI,MAAM,SAAS,CAAC,IAAI,EAAE,aAAa,EAAE,YAAY,IAAI;AAGzD,QAAI,YAAYA,MAAK,CAAC,EAAE,WAAW;AACnC,QAAI,YAAYA,MAAK,CAAC,EAAE,WAAW;AACnC,QAAIC,OAAMJ;AACV,QAAIK,OAAMJ;AAGV,QAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAC3E,UAAI,KAAK;AAET,MAAAG,OAAML,OAAM,KAAKC,YAAW,CAAC,IAAI,EAAE,CAAC;AACpC,MAAAK,OAAMN,OAAM,KAAKE,iBAAgB,CAAC,IAAI,EAAE,CAAC;AAAA,IAC3C;AAGA,QAAI,CAAC,aAAa,CAAC,WAAW;AAC5B,UAAI,IAAII,KAAIH,MAAK,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;AACpC,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAIE,KAAI,GAAGC,KAAIH,MAAK,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAAA,MAC1C;AACA,aAAO;AAAA,IACT;AAGA,QAAI,CAAC,aAAa,WAAW;AAC3B,UAAI,KAAKG,KAAIH,MAAK,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;AACxC,eAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,aAAKE,KAAI,IAAIC,KAAIH,MAAK,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;AAAA,MACjD;AACA,aAAO;AAAA,IACT;AAGA,QAAI,aAAa,CAAC,WAAW;AAC3B,UAAI,MAAMG,KAAIH,MAAK,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;AACzC,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,cAAME,KAAI,KAAKC,KAAIH,MAAK,MAAM,GAAG,EAAE,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;AAAA,MACrD;AACA,aAAO;AAAA,IACT;AAGA,QAAI,aAAa,WAAW;AAC1B,UAAI,MAAMG,KAAIH,MAAK,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;AAC5C,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,cAAME,KAAI,KAAKC,KAAIH,MAAK,MAAM,GAAG,EAAE,CAAC,CAAC,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;AAAA,MACxD;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACA,WAAS,WAAW,GAAG,GAAG;AACxB,iBAAa,GAAG,CAAC;AACjB,QAAI,SAAS,EAAE;AACf,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,UAAU,EAAE;AAGhB,QAAI,IAAI;AACR,QAAIE,OAAMJ;AACV,QAAIK,OAAMJ;AACV,QAAI,IAAI;AACR,QAAI,IAAI;AACR,WAAO,IAAI,OAAO,UAAU,IAAI,OAAO,QAAQ;AAC7C,UAAI,IAAI,OAAO,CAAC;AAChB,UAAI,IAAI,OAAO,CAAC;AAChB,UAAI,IAAI,GAAG;AACT;AACA;AAAA,MACF;AACA,UAAI,IAAI,GAAG;AACT;AACA;AAAA,MACF;AACA,UAAI,MAAM,GAAG;AACX,YAAIG,KAAI,GAAGC,KAAI,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;AACtC;AACA;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF,CAAC;;;ACtJD,IAAAC,kBAAqB;AAErB,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,SAAS,YAAY,UAAU,SAAS,QAAQ,QAAQ,QAAQ,cAAc,aAAa,gBAAgB,kBAAkB,kBAAkB,SAAS;AACxL,IAAI,WAA0B,wBAAQD,QAAMC,gBAAc,UAAQ;AACvE,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,OAAAC;AAAA,IACA,UAAAC;AAAA,IACA,QAAAC;AAAA,IACA,OAAAC;AAAA,IACA,MAAAC;AAAA,IACA,MAAAC;AAAA,IACA,MAAAC;AAAA,IACA,YAAAC;AAAA,IACA,WAAAC;AAAA,IACA,cAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,SAAAC;AAAA,EACF,IAAI;AA4CJ,aAAO,gBAAAC,SAASf,OAAMF,QAAM;AAAA,IAC1B,aAAa,SAASkB,aAAY,GAAG;AACnC,aAAO,SAAS,CAAC;AAAA,IACnB;AAAA,IACA,cAAc,SAASC,cAAa,GAAG;AACrC,aAAO,UAAU,CAAC;AAAA,IACpB;AAAA,IACA,OAAO,SAASC,OAAM,GAAG;AAEvB,UAAI,IAAIjB,QAAO,CAAC;AAEhB,UAAI,IAAI,SAAS,CAAC;AAElB,aAAO;AAAA,QACL,GAAG,EAAE,EAAE,QAAQ;AAAA,QACf,GAAG,EAAE,EAAE,QAAQ;AAAA,MACjB;AAAA,IACF;AAAA,EACF,CAAC,GAAG;AAAA,IACF;AAAA,EACF,CAAC;AACD,WAAS,aAAa,GAAG;AAEvB,QAAI,OAAO,EAAE,MAAM,CAAC;AACpB,QAAI,OAAO,EAAE,MAAM,CAAC;AAEpB,QAAI,IAAIE,UAAS,CAAC,IAAI,GAAG,OAAO;AAChC,QAAI,QAAQ,EAAE;AACd,QAAI,IAAI,EAAE,MAAM;AAChB,QAAI,QAAQ,EAAE;AAGd,QAAI,GAAG,GAAG;AACV,QAAI,IAAID,OAAM,CAAC,IAAI,GAAG,EAAE;AACxB,SAAK,IAAI,GAAG,IAAI,KAAK,IAAI,MAAM,IAAI,GAAG,EAAE,GAAG;AAyBzC,UAAI,QAAQ,MAAM,CAAC,EAAE,CAAC;AACtB,UAAI,MAAMO,YAAWJ,OAAM,OAAO,CAAC,IAAI,IAAIC,MAAK,KAAK,CAAC;AACtD,UAAI,UAAUE,MAAK,GAAG;AACtB,UAAI,eAAe;AACnB,WAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,uBAAeE,WAAU,cAAcE,gBAAe,MAAM,CAAC,EAAE,CAAC,GAAGJ,MAAK,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAAA,MACvF;AACA,UAAI,QAAQI,gBAAe,KAAKL,MAAK,YAAY,CAAC;AAClD,UAAI,CAACH,QAAO,KAAK,GAAG;AAElB,YAAI,KAAKS,gBAAe,OAAO,KAAK;AAGpC,UAAE,CAAC,IAAI;AACP,aAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,YAAE,CAAC,IAAIF,cAAa,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE;AAAA,QACrC;AAGA,YAAI,MAAMF,YAAWD,MAAKG,cAAa,IAAI,KAAK,CAAC,CAAC;AAClD,YAAI,IAAI;AAcR,aAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,cAAI;AAGJ,eAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,gBAAID,WAAU,GAAGE,gBAAeJ,MAAK,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,UAC1D;AAGA,cAAII,gBAAe,GAAG,GAAG;AACzB,eAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,kBAAM,CAAC,EAAE,CAAC,IAAIA,gBAAeC,gBAAe,MAAM,CAAC,EAAE,CAAC,GAAGD,gBAAe,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO;AAAA,UAC5F;AAAA,QACF;AAQA,aAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,cAAI;AAGJ,eAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,gBAAIF,WAAU,GAAGE,gBAAe,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAAA,UACpD;AAGA,cAAIA,gBAAe,GAAG,GAAG;AACzB,eAAK,IAAI,GAAG,IAAI,MAAM,EAAE,GAAG;AACzB,kBAAM,CAAC,EAAE,CAAC,IAAID,cAAaE,gBAAe,MAAM,CAAC,EAAE,CAAC,GAAGD,gBAAe,GAAGJ,MAAK,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO;AAAA,UAChG;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,UAAU,SAAS,WAAW;AAC5B,eAAO,QAAQ,KAAK,EAAE,SAAS,IAAI,UAAU,KAAK,EAAE,SAAS;AAAA,MAC/D;AAAA,IACF;AAAA,EACF;AACA,WAAS,SAAS,GAAG;AACnB,QAAI,MAAM,aAAa,CAAC;AACxB,QAAI,QAAQ,IAAI,EAAE;AAClB,QAAI,EAAE,MAAM,SAAS,GAAG;AACtB,UAAI,OAAO,MAAM,CAAC,EAAE,CAAC,EAAE,SAAS,YAAYM,SAAQ,CAAC,IAAI;AACzD,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,GAAG;AACrC,iBAAS,IAAI,GAAG,IAAI,KAAK,KAAK,MAAM,CAAC,KAAK,CAAC,GAAG,QAAQ,EAAE,GAAG;AACzD,gBAAM,CAAC,EAAE,CAAC,IAAI;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,WAAS,UAAU,GAAG;AACpB,UAAM,IAAI,MAAM,4CAA4C;AAAA,EAC9D;AACF,CAAC;;;ACzND,IAAIK,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,kBAAkB,YAAY,gBAAgB,UAAU,YAAY;AACpG,IAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,UAAAC;AAAA,IACA,cAAAC;AAAA,IACA,QAAAC;AAAA,IACA,YAAAC;AAAA,EACF,IAAI;AA0BJ,SAAON,OAAMF,QAAM;AAAA,IACjB,KAAK,SAAS,IAAI,GAAG;AACnB,aAAO,MAAM,CAAC;AAAA,IAChB;AAAA,IACA,kBAAkB,SAASS,KAAI,GAAG;AAChC,UAAIC;AACJ,UAAI,SAAS,CAAC,GAAG;AACf,QAAAA,QAAO,EAAE,KAAK;AAAA,MAChB,WAAW,MAAM,QAAQ,CAAC,GAAG;AAC3B,YAAIP,QAAO,CAAC;AACZ,QAAAO,QAAO,EAAE,KAAK;AAAA,MAChB,OAAO;AAEL,QAAAA,QAAO,CAAC;AAAA,MACV;AACA,cAAQA,MAAK,QAAQ;AAAA,QACnB,KAAK;AAEH,iBAAO,MAAM,CAAC;AAAA,QAChB,KAAK;AAEH,cAAIA,MAAK,CAAC,MAAM,GAAG;AACjB,mBAAO,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;AAAA,UAC7B;AACA,cAAIA,MAAK,CAAC,MAAM,GAAG;AACjB,mBAAO;AAAA,UACT,OAAO;AACL,kBAAM,IAAI,WAAW,kCAAuCC,QAAOD,KAAI,IAAI,GAAG;AAAA,UAChF;AAAA,QACF,KAAK,GACH;AAEE,cAAI,OAAOA,MAAK,CAAC;AACjB,cAAI,OAAOA,MAAK,CAAC;AACjB,cAAI,SAAS,MAAM;AACjB,mBAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAG,MAAM,IAAI;AAAA,UAC7C;AACA,cAAI,SAAS,GAAG;AACd,mBAAO;AAAA,UACT,OAAO;AACL,kBAAM,IAAI,WAAW,kCAAuCC,QAAOD,KAAI,IAAI,GAAG;AAAA,UAChF;AAAA,QACF;AAAA,QACF;AAEE,gBAAM,IAAI,WAAW,2CAAgDC,QAAOD,KAAI,IAAI,GAAG;AAAA,MAC3F;AAAA,IACF;AAAA,EACF,CAAC;AAUD,WAAS,KAAKP,SAAQ,MAAM,MAAM;AAChC,QAAI,SAAS,GAAG;AAEd,aAAO,MAAMA,QAAO,CAAC,EAAE,CAAC,CAAC;AAAA,IAC3B,WAAW,SAAS,GAAG;AAGrB,aAAOC,gBAAeC,UAASF,QAAO,CAAC,EAAE,CAAC,GAAGA,QAAO,CAAC,EAAE,CAAC,CAAC,GAAGE,UAASF,QAAO,CAAC,EAAE,CAAC,GAAGA,QAAO,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,IAClG,OAAO;AAIL,UAAI,UAAU;AACd,UAAI,aAAa,IAAI,MAAM,IAAI,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAGS,OAAMA,EAAC;AACxD,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,YAAI,KAAK,WAAW,CAAC;AACrB,YAAIL,QAAOJ,QAAO,EAAE,EAAE,CAAC,CAAC,GAAG;AACzB,cAAI,KAAK;AACT,eAAK,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM;AAChC,gBAAI,CAACI,QAAOJ,QAAO,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG;AACtC,mBAAK,WAAW,EAAE;AAClB,yBAAW,EAAE,IAAI,WAAW,CAAC;AAC7B,yBAAW,CAAC,IAAI;AAChB,wBAAU,CAAC;AACX;AAAA,YACF;AAAA,UACF;AACA,cAAI,OAAO,KAAM,QAAOA,QAAO,EAAE,EAAE,CAAC;AAAA,QACtC;AACA,YAAI,MAAMA,QAAO,EAAE,EAAE,CAAC;AACtB,YAAI,OAAO,MAAM,IAAI,IAAIA,QAAO,WAAW,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC;AACxD,iBAAS,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;AACjC,cAAI,KAAK,WAAW,CAAC;AACrB,mBAAS,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;AACjC,YAAAA,QAAO,EAAE,EAAE,CAAC,IAAIG,cAAaF,gBAAeC,UAASF,QAAO,EAAE,EAAE,CAAC,GAAG,GAAG,GAAGE,UAASF,QAAO,EAAE,EAAE,CAAC,GAAGA,QAAO,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI;AAAA,UACzH;AAAA,QACF;AAAA,MACF;AACA,UAAIM,OAAMN,QAAO,WAAW,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC;AAC/C,aAAO,UAAUK,YAAWC,IAAG,IAAIA;AAAA,IACrC;AAAA,EACF;AACF,CAAC;;;ACzID,IAAII,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,gBAAgB,aAAa,YAAY,cAAc,OAAO,YAAY,KAAK;AAC/G,IAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,cAAAC;AAAA,IACA,WAAAC;AAAA,IACA,UAAAC;AAAA,IACA,YAAAC;AAAA,IACA,KAAAC;AAAA,IACA,UAAAC;AAAA,IACA,KAAAC;AAAA,EACF,IAAI;AAqBJ,SAAOR,OAAMF,QAAM;AAAA,IACjB,kBAAkB,SAAS,cAAc,GAAG;AAC1C,UAAIW,QAAO,SAAS,CAAC,IAAI,EAAE,KAAK,IAAI,UAAU,CAAC;AAC/C,cAAQA,MAAK,QAAQ;AAAA,QACnB,KAAK;AAEH,cAAIA,MAAK,CAAC,MAAM,GAAG;AACjB,gBAAI,SAAS,CAAC,GAAG;AACf,qBAAOR,QAAO,CAACC,cAAa,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;AAAA,YACjD,OAAO;AACL,qBAAO,CAACA,cAAa,GAAG,EAAE,CAAC,CAAC,CAAC;AAAA,YAC/B;AAAA,UACF,OAAO;AACL,kBAAM,IAAI,WAAW,kCAAuCQ,QAAOD,KAAI,IAAI,GAAG;AAAA,UAChF;AAAA,QACF,KAAK,GAEH;AACE,cAAI,OAAOA,MAAK,CAAC;AACjB,cAAI,OAAOA,MAAK,CAAC;AACjB,cAAI,SAAS,MAAM;AACjB,gBAAI,SAAS,CAAC,GAAG;AACf,qBAAOR,QAAO,KAAK,EAAE,QAAQ,GAAG,MAAM,IAAI,GAAG,EAAE,QAAQ,CAAC;AAAA,YAC1D,OAAO;AAEL,qBAAO,KAAK,GAAG,MAAM,IAAI;AAAA,YAC3B;AAAA,UACF,OAAO;AACL,kBAAM,IAAI,WAAW,kCAAuCS,QAAOD,KAAI,IAAI,GAAG;AAAA,UAChF;AAAA,QACF;AAAA,QACF;AAEE,gBAAM,IAAI,WAAW,2CAAgDC,QAAOD,KAAI,IAAI,GAAG;AAAA,MAC3F;AAAA,IACF;AAAA,IACA,KAAK,SAAS,IAAI,GAAG;AAEnB,aAAOP,cAAa,GAAG,CAAC;AAAA,IAC1B;AAAA,EACF,CAAC;AAUD,WAAS,KAAK,KAAK,MAAM,MAAM;AAC7B,QAAI,GAAG,GAAG,GAAG,OAAO;AACpB,QAAI,SAAS,GAAG;AAEd,cAAQ,IAAI,CAAC,EAAE,CAAC;AAChB,UAAI,UAAU,GAAG;AACf,cAAM,MAAM,+CAA+C;AAAA,MAC7D;AACA,aAAO,CAAC,CAACA,cAAa,GAAG,KAAK,CAAC,CAAC;AAAA,IAClC,WAAW,SAAS,GAAG;AAErB,UAAI,IAAII,KAAI,GAAG;AACf,UAAI,MAAM,GAAG;AACX,cAAM,MAAM,+CAA+C;AAAA,MAC7D;AACA,aAAO,CAAC,CAACJ,cAAa,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAGA,cAAaG,YAAW,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAACH,cAAaG,YAAW,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAGH,cAAa,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAAA,IACpJ,OAAO;AAQL,UAAI,IAAI,IAAI,OAAO;AACnB,WAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,UAAE,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO;AAAA,MACrB;AAIA,UAAI,IAAIK,UAAS,IAAI,EAAE,QAAQ;AAG/B,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAE7B,YAAI,OAAOC,KAAI,EAAE,CAAC,EAAE,CAAC,CAAC;AACtB,YAAI,OAAO;AACX,YAAI,IAAI;AACR,eAAO,IAAI,MAAM;AACf,cAAIA,KAAI,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM;AACvB,mBAAOA,KAAI,EAAE,CAAC,EAAE,CAAC,CAAC;AAClB,mBAAO;AAAA,UACT;AACA;AAAA,QACF;AACA,YAAI,SAAS,GAAG;AACd,gBAAM,MAAM,+CAA+C;AAAA,QAC7D;AACA,YAAI;AACJ,YAAI,MAAM,GAAG;AACX,iBAAO,EAAE,CAAC;AACV,YAAE,CAAC,IAAI,EAAE,CAAC;AACV,YAAE,CAAC,IAAI;AACP,iBAAO,EAAE,CAAC;AACV,YAAE,CAAC,IAAI,EAAE,CAAC;AACV,YAAE,CAAC,IAAI;AAAA,QACT;AAGA,YAAI,KAAK,EAAE,CAAC;AACZ,YAAI,KAAK,EAAE,CAAC;AACZ,aAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,cAAI,KAAK,EAAE,CAAC;AACZ,cAAI,KAAK,EAAE,CAAC;AACZ,cAAI,MAAM,GAAG;AAEX,gBAAI,GAAG,CAAC,MAAM,GAAG;AACf,kBAAIN,cAAaG,YAAW,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;AAIzC,mBAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,mBAAG,CAAC,IAAIF,WAAU,GAAG,CAAC,GAAGC,UAAS,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,cAC7C;AACA,mBAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,mBAAG,CAAC,IAAID,WAAU,GAAG,CAAC,GAAGC,UAAS,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,cAC7C;AAAA,YACF;AAAA,UACF,OAAO;AAGL,gBAAI,GAAG,CAAC;AACR,iBAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,iBAAG,CAAC,IAAIF,cAAa,GAAG,CAAC,GAAG,CAAC;AAAA,YAC/B;AACA,iBAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,iBAAG,CAAC,IAAIA,cAAa,GAAG,CAAC,GAAG,CAAC;AAAA,YAC/B;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACF,CAAC;;;ACvLD,IAAAS,kBAAqB;;;ACCd,SAAS,kBAAkB,MAAM;AACtC,MAAI;AAAA,IACF,WAAAC;AAAA,IACA,UAAAC;AAAA,IACA,SAAAC;AAAA,IACA,UAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,cAAAC;AAAA,IACA,MAAAC;AAAA,IACA,KAAAC;AAAA,IACA,WAAAC;AAAA,IACA,MAAAC;AAAA,IACA,MAAAC;AAAA,IACA,SAAAC;AAAA,IACA,KAAAC;AAAA,IACA,IAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,IACA,OAAAC;AAAA,IACA,SAAAC;AAAA,IACA,QAAAC;AAAA,IACA,SAAAC;AAAA,IACA,mBAAAC;AAAA,IACA,KAAAC;AAAA,EACF,IAAI;AAUJ,WAAS,YAAY,KAAK,GAAG,MAAM,MAAM;AACvC,QAAI,cAAc,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAMtF,QAAI,IAAI,QAAQ,KAAK,GAAG,MAAM,MAAM,WAAW;AAc/C,uBAAmB,KAAK,GAAG,MAAM,MAAM,aAAa,CAAC;AAIrD,QAAI;AAAA,MACF;AAAA,MACA;AAAA,IACF,IAAI,uBAAuB,KAAK,GAAG,MAAM,MAAM,WAAW;AAQ1D,QAAI,aAAa;AACf,UAAI,eAAe,iBAAiB,KAAK,GAAG,GAAG,GAAG,QAAQ,MAAM,IAAI;AACpE,aAAO;AAAA,QACL;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,MACL;AAAA,IACF;AAAA,EACF;AASA,WAAS,QAAQ,KAAK,GAAG,MAAM,MAAM,aAAa;AAChD,QAAI,MAAM,SAAS;AACnB,QAAI,OAAO,SAAS;AACpB,QAAI,WAAW,MAAMb,WAAU,CAAC,IAAI;AACpC,QAAI,MAAM,MAAMA,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AACnD,QAAI,UAAU,MAAMT,WAAU,CAAC,IAAI;AAGnC,QAAI,QAAQ,MAAMA,WAAU,EAAE,IAAI;AAClC,QAAI,UAAUJ,gBAAe,OAAO,KAAK;AAGzC,QAAI;AACJ,QAAI,aAAa;AACf,cAAQ,MAAM,CAAC,EAAE,KAAK,GAAG;AAAA,IAC3B;AAGA,QAAI,OAAO;AACX,WAAO,CAAC,MAAM;AAEZ,aAAO;AACP,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAG1B,YAAI,UAAU;AACd,YAAI,UAAU;AACd,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAI,MAAM,EAAG;AACb,oBAAUJ,WAAU,SAASO,KAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3C,oBAAUP,WAAU,SAASO,KAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,QAC7C;AACA,YAAI,CAACS,OAAM,SAAS,CAAC,KAAK,CAACA,OAAM,SAAS,CAAC,GAAG;AAK5C,cAAI,IAAI;AACR,cAAI,IAAI;AACR,cAAI,cAAcX,cAAa,SAAS,KAAK;AAC7C,cAAI,cAAcD,gBAAe,SAAS,KAAK;AAC/C,iBAAOe,SAAQ,GAAG,WAAW,GAAG;AAC9B,gBAAIf,gBAAe,GAAG,OAAO;AAC7B,gBAAIA,gBAAe,GAAG,KAAK;AAAA,UAC7B;AACA,iBAAOc,QAAO,GAAG,WAAW,GAAG;AAC7B,gBAAIb,cAAa,GAAG,OAAO;AAC3B,gBAAIA,cAAa,GAAG,KAAK;AAAA,UAC3B;AAIA,cAAI,YAAYc,SAAQd,cAAaL,WAAU,GAAG,OAAO,GAAG,CAAC,GAAGI,gBAAeJ,WAAU,SAAS,OAAO,GAAG,IAAI,CAAC;AAGjH,cAAI,WAAW;AAGb,mBAAO;AACP,gBAAI,IAAIK,cAAa,GAAG,CAAC;AACzB,qBAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,kBAAI,MAAM,IAAI;AACZ;AAAA,cACF;AACA,kBAAI,CAAC,EAAE,EAAE,IAAID,gBAAe,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC;AACzC,kBAAI,EAAE,EAAE,CAAC,IAAIA,gBAAe,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC;AAAA,YAC3C;AAGA,gBAAI,aAAa;AACf,oBAAM,CAAC,IAAIA,gBAAe,MAAM,CAAC,GAAG,CAAC;AAAA,YACvC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,WAAO,cAAcK,MAAK,KAAK,IAAI;AAAA,EACrC;AAUA,WAAS,mBAAmB,KAAK,GAAG,MAAM,MAAM,aAAa,GAAG;AAC9D,QAAI,MAAM,SAAS;AACnB,QAAI,OAAO,SAAS;AACpB,QAAI,OAAO,MAAMD,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AACpD,QAAI,KAAK;AACP,aAAOT,WAAU,IAAI;AAAA,IACvB;AACA,aAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAG9B,UAAI,WAAW;AACf,UAAIc,OAAM;AACV,eAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,YAAI,KAAK,IAAI,CAAC,EAAE,CAAC;AACjB,YAAIH,SAAQZ,KAAIe,IAAG,GAAGf,KAAI,EAAE,CAAC,GAAG;AAC9B,UAAAe,OAAM;AACN,qBAAW;AAAA,QACb;AAAA,MACF;AAGA,UAAIH,SAAQZ,KAAIe,IAAG,GAAG,IAAI,GAAG;AAC3B;AAAA,MACF;AACA,UAAI,aAAa,IAAI,GAAG;AAEtB,YAAI,OAAO,IAAI,QAAQ;AACvB,YAAI,QAAQ,IAAI,IAAI,IAAI,CAAC;AACzB,YAAI,IAAI,CAAC,IAAI;AAGb,iBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,cAAI,OAAO,IAAI,GAAG,EAAE,QAAQ;AAC5B,cAAI,GAAG,EAAE,QAAQ,IAAI,IAAI,GAAG,EAAE,IAAI,CAAC;AACnC,cAAI,GAAG,EAAE,IAAI,CAAC,IAAI;AAAA,QACpB;AAGA,YAAI,aAAa;AACf,cAAI,OAAO,EAAE,QAAQ;AACrB,YAAE,QAAQ,IAAI,EAAE,IAAI,CAAC;AACrB,YAAE,IAAI,CAAC,IAAI;AAAA,QACb;AAAA,MACF;AAGA,eAAS,MAAM,IAAI,GAAG,MAAM,GAAG,OAAO;AACpC,YAAI,IAAIjB,cAAa,IAAI,GAAG,EAAE,CAAC,GAAGiB,IAAG;AACrC,YAAI,MAAM,GAAG;AACX;AAAA,QACF;AAGA,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAI,GAAG,EAAE,CAAC,IAAIrB,UAAS,IAAI,GAAG,EAAE,CAAC,GAAGG,gBAAe,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,QACtE;AAGA,iBAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,cAAI,EAAE,EAAE,IAAI,CAAC,IAAIJ,WAAU,IAAI,EAAE,EAAE,IAAI,CAAC,GAAGI,gBAAe,GAAG,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC;AAAA,QAC5E;AAGA,YAAI,aAAa;AACf,mBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,cAAE,GAAG,EAAE,GAAG,IAAIH,UAAS,EAAE,GAAG,EAAE,GAAG,GAAGG,gBAAe,GAAG,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;AAAA,UACtE;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAOA,WAAS,uBAAuB,GAAG,GAAG,MAAM,MAAM,aAAa;AAC7D,QAAI,MAAM,SAAS;AACnB,QAAI,OAAO,SAAS;AACpB,QAAI,MAAM,MAAMI,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AACnD,QAAI,KAAK;AACP,aAAOT,WAAU,IAAI;AAAA,IACvB;AAWA,QAAI,MAAM,MAAM,CAAC;AAGjB,QAAI,UAAU,CAAC;AAGf,QAAI,IAAI;AAIR,QAAI,QAAQ,CAAC;AAGb,QAAI,SAAS,cAAcC,MAAK,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC,IAAI;AAGtD,QAAI,WAAW,cAAcA,MAAK,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC,IAAI;AAGxD,QAAI,wBAAwB;AAC5B,WAAO,yBAAyB,KAAK;AACnC,+BAAyB;AAMzB,UAAI,IAAI,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC;AAOxB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,EAAE,CAAC,IAAIR,UAAS,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;AAAA,MACnC;AAGA,UAAI;AAAA,QACF;AAAA,QACA;AAAA,MACF,IAAIY,IAAG,GAAG;AACV,YAAMV,UAAS,GAAG,CAAC;AACnB,eAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,YAAI,EAAE,EAAE,EAAE,IAAIH,WAAU,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC;AAAA,MACxC;AAGA,UAAI,aAAa;AACf,mBAAWG,UAAS,UAAU,CAAC;AAAA,MACjC;AAGA,UAAI,MAAM,KAAKgB,SAAQZ,KAAI,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG;AACpD,gCAAwB;AACxB,gBAAQ,KAAK,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAG9B,YAAI,aAAa;AACf,gBAAM,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AACnB,wBAAc,UAAU,CAAC;AACzB,mBAASJ,UAAS,QAAQ,QAAQ;AAClC,cAAI,IAAI,GAAG;AACT,uBAAWM,MAAK,MAAM,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;AAAA,UACxC;AAAA,QACF;AAGA,aAAK;AACL,YAAI,IAAI;AACR,iBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,cAAI,GAAG,EAAE,IAAI;AAAA,QACf;AAAA,MAGF,WAAW,MAAM,KAAKU,SAAQZ,KAAI,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG;AAC3D,gCAAwB;AACxB,YAAI,KAAK,eAAe,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAClG,gBAAQ,KAAK,GAAG,EAAE;AAGlB,YAAI,aAAa;AACf,gBAAM,QAAQ,cAAc,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,IAAI,CAAC;AACjI,wBAAc,UAAU,CAAC;AACzB,mBAASJ,UAAS,QAAQ,QAAQ;AAClC,cAAI,IAAI,GAAG;AACT,uBAAWM,MAAK,MAAM,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;AAAA,UACxC;AAAA,QACF;AAGA,aAAK;AACL,YAAI,IAAI;AACR,YAAI,IAAI;AACR,iBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,cAAI,GAAG,EAAE,IAAI;AACb,cAAI,GAAG,EAAE,IAAI;AAAA,QACf;AAAA,MACF;AACA,UAAI,MAAM,GAAG;AACX;AAAA,MACF;AAAA,IACF;AAGA,YAAQ,KAAK,CAAC,GAAG,MAAM,CAACR,UAASM,KAAI,CAAC,GAAGA,KAAI,CAAC,CAAC,CAAC;AAGhD,QAAI,wBAAwB,KAAK;AAC/B,UAAI,MAAM,MAAM,uEAAuE,QAAQ,KAAK,IAAI,CAAC;AACzG,UAAI,SAAS;AACb,UAAI,UAAU,CAAC;AACf,YAAM;AAAA,IACR;AAIA,QAAI,IAAI,cAAcJ,UAAS,QAAQ,UAAU,OAAO,CAAC,CAAC,IAAI;AAC9D,WAAO;AAAA,MACL,QAAQ;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAWA,WAAS,iBAAiB,GAAG,GAAG,GAAG,GAAG,QAAQ,MAAM,MAAM;AACxD,QAAI,OAAOS,KAAI,CAAC;AAChB,QAAI,IAAIT,UAAS,MAAM,GAAG,CAAC;AAC3B,QAAI,MAAM,SAAS;AACnB,QAAI,OAAO,SAAS;AACpB,QAAI,OAAO,MAAMK,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AACpD,QAAI,MAAM,MAAMT,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AAInD,QAAI,eAAe,CAAC;AACpB,QAAI,iBAAiB,CAAC;AACtB,aAAS,UAAU,QAAQ;AACzB,UAAI,IAAI,QAAQ,cAAc,QAAQD,MAAK;AAC3C,UAAI,MAAM,IAAI;AACZ,qBAAa,KAAK,MAAM;AACxB,uBAAe,KAAK,CAAC;AAAA,MACvB,OAAO;AACL,uBAAe,CAAC,KAAK;AAAA,MACvB;AAAA,IACF;AAMA,QAAI,UAAU,CAAC;AACf,QAAI,MAAM,aAAa;AACvB,QAAI,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI;AAC1B,QAAI,IAAIP,MAAK,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC;AAC/B,QAAI,QAAQ,SAASc,SAAQ;AAC3B,UAAIC,UAAS,aAAa,GAAG;AAC7B,UAAI,IAAIvB,UAAS,GAAGE,UAASqB,SAAQ,CAAC,CAAC;AAEvC,UAAI,YAAYT,WAAU,GAAG,CAAC;AAC9B,gBAAU,MAAM;AAKhB,aAAO,UAAU,SAAS,eAAe,GAAG,GAAG;AAC7C,YAAI,YAAY,eAAe,GAAG,GAAG,WAAW,MAAM,IAAI;AAC1D,YAAI,cAAc,MAAM;AACtB;AAAA,QACF;AACA,kBAAU,KAAK,SAAS;AAAA,MAC1B;AAGA,UAAI,aAAaZ,UAASS,KAAI,CAAC,GAAG,CAAC;AACnC,kBAAY,UAAU,IAAI,OAAKT,UAAS,YAAY,CAAC,CAAC;AACtD,cAAQ,KAAK,GAAG,UAAU,IAAI,QAAM;AAAA,QAClC,OAAOqB;AAAA,QACP,QAAQtB,SAAQ,CAAC;AAAA,MACnB,EAAE,CAAC;AAAA,IACL;AACA,aAAS,MAAM,GAAG,MAAM,KAAK,OAAO;AAClC,YAAM;AAAA,IACR;AACA,WAAO;AAAA,EACT;AAMA,WAAS,eAAe,GAAG,GAAG,GAAG,GAAG;AAElC,QAAI,MAAMF,WAAU,GAAG,CAAC;AACxB,QAAI,OAAOC,UAASG,gBAAe,GAAG,CAAC,GAAGA,gBAAe,GAAG,CAAC,CAAC;AAC9D,QAAI,IAAIA,gBAAe,KAAK,GAAG;AAC/B,QAAI,IAAIA,gBAAeE,MAAKL,UAASG,gBAAe,KAAK,GAAG,GAAGA,gBAAe,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG;AAC7F,WAAO,CAACJ,WAAU,GAAG,CAAC,GAAGC,UAAS,GAAG,CAAC,CAAC;AAAA,EACzC;AASA,WAAS,cAAc,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,MAAM,MAAM;AACrD,QAAI,MAAM,SAAS;AACnB,QAAI,OAAO,SAAS;AACpB,QAAI,OAAO,MAAMO,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AACpD,QAAI,MAAM,MAAMT,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AAInD,QAAIE,SAAQZ,KAAI,CAAC,GAAG,IAAI,GAAG;AACzB,aAAO,CAAC,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;AAAA,IAClC;AAIA,QAAIW,QAAOX,KAAIN,UAAS,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG;AACvC,aAAO,CAAC,CAACA,UAAS,IAAI,CAAC,GAAGA,UAAS,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAAA,IACpD;AAIA,QAAI,KAAKA,UAAS,GAAG,EAAE;AACvB,QAAI,KAAKA,UAAS,GAAG,EAAE;AAKvB,QAAIkB,SAAQZ,KAAI,CAAC,GAAG,IAAI,KAAKY,SAAQZ,KAAI,EAAE,GAAG,IAAI,GAAG;AACnD,aAAO,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC;AAAA,IAC9B,OAAO;AACL,aAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC;AAAA,IAC9B;AAAA,EACF;AAMA,WAAS,cAAc,KAAK,GAAG;AAE7B,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAI,CAAC,EAAE,KAAK,GAAG,MAAM,IAAI,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AAAA,IACjD;AAGA,aAAS,MAAM,IAAI,QAAQ,MAAM,GAAG,OAAO;AACzC,UAAI,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;AACzB,UAAI,GAAG,EAAE,GAAG,IAAI;AAAA,IAClB;AACA,WAAO;AAAA,EACT;AAOA,WAAS,UAAU,KAAK,GAAG;AACzB,QAAI,IAAI,CAAC;AACT,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAE,CAAC,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AAAA,IACxB;AACA,QAAI,IAAI;AACR,aAASkB,QAAO,KAAK;AACnB,UAAI,IAAIA,KAAI;AACZ,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAE,IAAI,GAAG,EAAE,IAAI,CAAC,IAAIA,KAAI,GAAG,EAAE,CAAC;AAAA,QAChC;AAAA,MACF;AACA,WAAK;AAAA,IACP;AACA,WAAO;AAAA,EACT;AAUA,WAAS,QAAQ,KAAK,IAAI,IAAI;AAC5B,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAI,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG;AAClB,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAgBA,WAAS,eAAe,GAAG,GAAG,QAAQ,MAAM,MAAM;AAChD,QAAI,WAAW,SAAS,cAAcjB,WAAU,GAAI,IAAI;AACxD,QAAI;AAGJ,QAAI,IAAI;AACR,WAAO,IAAI,GAAG,EAAE,GAAG;AACjB,UAAI,uBAAuB,GAAG,QAAQ,IAAI;AAC1C,UAAI;AACF,YAAIM,QAAO,GAAG,CAAC;AAAA,MACjB,SAAS,SAAS;AAGhB;AAAA,MACF;AACA,UAAII,QAAO,KAAK,CAAC,GAAG,QAAQ,GAAG;AAC7B;AAAA,MACF;AAAA,IACF;AACA,QAAI,KAAK,GAAG;AACV,aAAO;AAAA,IACT;AAGA,QAAI;AACJ,WAAO,MAAM;AACX,UAAI,IAAIJ,QAAO,GAAG,CAAC;AACnB,UAAIK,SAAQ,KAAK,qBAAqB,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG;AACrD;AAAA,MACF;AACA,UAAI,EAAE,KAAK,IAAI;AACb,eAAO;AAAA,MACT;AACA,UAAI,UAAU,CAAC;AAAA,IACjB;AACA,WAAO;AAAA,EACT;AAUA,WAAS,uBAAuB,GAAG,QAAQ,MAAM;AAC/C,QAAI,MAAM,SAAS;AACnB,QAAI,OAAO,SAAS;AAGpB,QAAI,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,OAAK,IAAI,KAAK,OAAO,IAAI,CAAC;AACvD,QAAI,KAAK;AACP,UAAI,EAAE,IAAI,OAAKX,WAAU,CAAC,CAAC;AAAA,IAC7B;AACA,QAAI,MAAM;AACR,UAAI,EAAE,IAAI,OAAKS,SAAQ,CAAC,CAAC;AAAA,IAC3B;AAGA,QAAI,qBAAqB,GAAG,MAAM;AAGlC,WAAO,UAAU,GAAG,IAAI;AAAA,EAC1B;AAKA,WAAS,qBAAqB,GAAG,QAAQ;AACvC,QAAI,cAAcP,MAAK,CAAC;AACxB,aAAS,KAAK,QAAQ;AACpB,UAAIC,SAAQ,GAAG,WAAW;AAE1B,UAAIV,UAAS,GAAGE,UAASE,cAAagB,KAAI,GAAG,CAAC,GAAGA,KAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AAAA,IACjE;AACA,WAAO;AAAA,EACT;AAOA,WAAS,KAAK,GAAG;AACf,WAAOd,KAAID,MAAKe,KAAI,GAAG,CAAC,CAAC,CAAC;AAAA,EAC5B;AASA,WAAS,UAAU,GAAG,MAAM;AAC1B,QAAI,MAAM,SAAS;AACnB,QAAI,OAAO,SAAS;AACpB,QAAI,MAAM,MAAMb,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AACnD,WAAOd,UAASE,cAAa,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC;AAAA,EAC/C;AACA,SAAO;AACT;;;ACxrBO,SAAS,oBAAoB,MAAM;AACxC,MAAI;AAAA,IACF,QAAAqB;AAAA,IACA,WAAAC;AAAA,IACA,UAAAC;AAAA,IACA,KAAAC;AAAA,IACA,MAAAC;AAAA,IACA,KAAAC;AAAA,IACA,KAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,KAAAC;AAAA,IACA,WAAAC;AAAA,IACA,UAAAC;AAAA,IACA,KAAAC;AAAA,EACF,IAAI;AAOJ,WAAS,KAAK,KAAK,GAAG;AACpB,QAAI,OAAO,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAIX,QAAO;AACtF,QAAI,OAAO,UAAU,SAAS,IAAI,UAAU,CAAC,IAAI;AACjD,QAAI,iBAAiB,UAAU,SAAS,IAAI,UAAU,CAAC,IAAI;AAC3D,QAAI,SAAS,UAAU;AACrB,aAAOY,MAAK,KAAK,MAAM,cAAc;AAAA,IACvC;AACA,QAAI,SAAS,aAAa;AACxB,aAAO,QAAQ,KAAK,MAAM,cAAc;AAAA,IAC1C;AACA,UAAM,UAAU,4BAA4B,IAAI;AAAA,EAClD;AAGA,WAASA,MAAK,GAAG,WAAW,gBAAgB;AAC1C,QAAI,IAAI,EAAE;AACV,QAAI,KAAK,KAAK,IAAI,YAAY,CAAC;AAC/B,QAAI;AACJ,QAAI;AACJ,QAAI,gBAAgB;AAClB,YAAM,IAAI,MAAM,CAAC;AAEjB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACxB,YAAI,CAAC,EAAE,CAAC,IAAI;AAAA,MACd;AAAA,IACF;AAEA,QAAI,MAAM,OAAO,CAAC;AAClB,WAAO,KAAK,IAAI,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,EAAE,GAAG;AACvC,UAAI,KAAK,IAAI,CAAC,EAAE,CAAC;AACjB,UAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AAChB,YAAM,SAAS,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;AAC3C,UAAI,GAAG,GAAG,KAAK,IAAI,CAAC;AACpB,UAAI,eAAgB,OAAM,KAAK,KAAK,KAAK,IAAI,CAAC;AAC9C,YAAM,OAAO,CAAC;AAAA,IAChB;AACA,QAAI,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC;AACxB,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,SAAG,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG;AAAA,IACtB;AACA,WAAO,QAAQ,MAAM,EAAE,GAAG,KAAK,cAAc;AAAA,EAC/C;AAGA,WAAS,QAAQ,GAAG,WAAW,gBAAgB;AAC7C,QAAI,IAAI,EAAE;AACV,QAAI,KAAKT,KAAI,YAAY,CAAC;AAC1B,QAAI;AACJ,QAAI;AACJ,QAAI,gBAAgB;AAClB,YAAM,IAAI,MAAM,CAAC;AAEjB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACxB,YAAI,CAAC,EAAE,CAAC,IAAI;AAAA,MACd;AAAA,IACF;AAEA,QAAI,MAAM,UAAU,CAAC;AACrB,WAAOA,KAAI,IAAI,CAAC,CAAC,KAAKA,KAAI,EAAE,GAAG;AAC7B,UAAI,MAAM,IAAI,CAAC,EAAE,CAAC;AAClB,UAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AAChB,YAAM,YAAY,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;AACjD,UAAI,MAAM,GAAG,KAAK,KAAK,CAAC;AACxB,UAAI,eAAgB,OAAM,QAAQ,KAAK,KAAK,KAAK,CAAC;AAClD,YAAM,UAAU,CAAC;AAAA,IACnB;AACA,QAAI,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC;AACxB,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,SAAG,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG;AAAA,IACtB;AAEA,WAAO,QAAQ,MAAM,EAAE,GAAG,KAAK,cAAc;AAAA,EAC/C;AAGA,WAAS,SAAS,KAAK,KAAK,KAAK;AAC/B,QAAI,QAAQ,MAAM;AAClB,QAAI,KAAK,IAAI,KAAK,KAAKH,QAAO,QAAQ;AACpC,aAAO,KAAK,KAAK;AAAA,IACnB,OAAO;AACL,aAAO,MAAM,KAAK,KAAK,IAAM,OAAO,MAAM,IAAI;AAAA,IAChD;AAAA,EACF;AAGA,WAAS,YAAY,KAAK,KAAK,KAAK;AAClC,QAAI,QAAQE,UAAS,KAAK,GAAG;AAC7B,QAAIC,KAAI,KAAK,KAAKH,QAAO,QAAQ;AAC/B,aAAOS,WAAU,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC;AAAA,IACnC,OAAO;AACL,aAAOF,gBAAe,KAAKH,MAAKM,UAAS,GAAK,KAAKF,KAAI,KAAK,CAAC,CAAC,CAAC;AAAA,IACjE;AAAA,EACF;AAGA,WAAS,KAAK,KAAK,OAAO,GAAG,GAAG;AAC9B,QAAI,IAAI,IAAI;AACZ,QAAI,IAAI,KAAK,IAAI,KAAK;AACtB,QAAI,IAAI,KAAK,IAAI,KAAK;AACtB,QAAI,MAAM,MAAM,CAAC,EAAE,KAAK,CAAC;AACzB,QAAI,MAAM,MAAM,CAAC,EAAE,KAAK,CAAC;AACzB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AACrC,UAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AAAA,IACvC;AACA,aAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,UAAI,EAAE,EAAE,CAAC,IAAI,IAAI,EAAE;AACnB,UAAI,EAAE,EAAE,CAAC,IAAI,IAAI,EAAE;AAAA,IACrB;AACA,WAAO;AAAA,EACT;AAEA,WAAS,QAAQ,KAAK,OAAO,GAAG,GAAG;AACjC,QAAI,IAAI,IAAI;AACZ,QAAI,IAAIH,KAAI,KAAK;AACjB,QAAI,IAAIC,KAAI,KAAK;AACjB,QAAI,MAAM,MAAM,CAAC,EAAE,KAAKG,WAAU,CAAC,CAAC;AACpC,QAAI,MAAM,MAAM,CAAC,EAAE,KAAKA,WAAU,CAAC,CAAC;AACpC,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,CAAC,IAAIP,UAASK,gBAAe,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAGA,gBAAe,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5E,UAAI,CAAC,IAAIN,WAAUM,gBAAe,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAGA,gBAAe,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,IAC/E;AACA,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,UAAI,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG;AACrB,UAAI,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG;AAAA,IACvB;AACA,WAAO;AAAA,EACT;AAGA,WAAS,MAAM,KAAK,OAAO,GAAG,GAAG;AAC/B,QAAI,IAAI,IAAI;AACZ,QAAI,IAAIE,WAAUJ,KAAI,KAAK,CAAC;AAC5B,QAAI,IAAII,WAAUH,KAAI,KAAK,CAAC;AAC5B,QAAI,KAAKC,gBAAe,GAAG,CAAC;AAC5B,QAAI,KAAKA,gBAAe,GAAG,CAAC;AAC5B,QAAI,MAAM,MAAM,CAAC,EAAE,KAAKE,WAAU,CAAC,CAAC;AACpC,QAAI,MAAM,MAAM,CAAC,EAAE,KAAKA,WAAU,CAAC,CAAC;AAEpC,QAAI,QAAQC,UAASD,WAAU,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;AAElD,QAAI,MAAMR,WAAUC,UAASK,gBAAe,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,GAAGA,gBAAe,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AACjG,QAAI,MAAMI,KAAIJ,gBAAe,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,OAAOA,gBAAe,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAEjF,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,CAAC,IAAIL,UAASK,gBAAe,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAGA,gBAAe,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5E,UAAI,CAAC,IAAIN,WAAUM,gBAAe,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAGA,gBAAe,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,IAC/E;AAEA,QAAI,CAAC,EAAE,CAAC,IAAI;AACZ,QAAI,CAAC,EAAE,CAAC,IAAI;AACZ,QAAI,CAAC,EAAE,CAAC,IAAIE,WAAU,CAAC;AACvB,QAAI,CAAC,EAAE,CAAC,IAAIA,WAAU,CAAC;AAEvB,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,UAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B,YAAI,CAAC,EAAE,GAAG,IAAI,IAAI,GAAG;AACrB,YAAI,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG;AACrB,YAAI,CAAC,EAAE,GAAG,IAAI,IAAI,GAAG;AACrB,YAAI,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG;AAAA,MACvB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAGA,WAAS,GAAG,KAAK,OAAO,GAAG,GAAG;AAC5B,QAAI,IAAI,IAAI;AACZ,QAAI,IAAI,KAAK,IAAI,KAAK;AACtB,QAAI,IAAI,KAAK,IAAI,KAAK;AACtB,QAAI,KAAK,IAAI;AACb,QAAI,KAAK,IAAI;AACb,QAAI,MAAM,MAAM,CAAC,EAAE,KAAK,CAAC;AACzB,QAAI,MAAM,MAAM,CAAC,EAAE,KAAK,CAAC;AAEzB,QAAI,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;AAChE,QAAI,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;AAEhE,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AACrC,UAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AAAA,IACvC;AAEA,QAAI,CAAC,EAAE,CAAC,IAAI;AACZ,QAAI,CAAC,EAAE,CAAC,IAAI;AACZ,QAAI,CAAC,EAAE,CAAC,IAAI;AACZ,QAAI,CAAC,EAAE,CAAC,IAAI;AAEZ,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,UAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B,YAAI,CAAC,EAAE,GAAG,IAAI,IAAI,GAAG;AACrB,YAAI,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG;AACrB,YAAI,CAAC,EAAE,GAAG,IAAI,IAAI,GAAG;AACrB,YAAI,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG;AAAA,MACvB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAGA,WAAS,OAAO,KAAK;AACnB,QAAI,IAAI,IAAI;AACZ,QAAI,SAAS;AACb,QAAI,QAAQ,CAAC,GAAG,CAAC;AACjB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,YAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG;AAC1C,mBAAS,KAAK,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC;AAC3B,kBAAQ,CAAC,GAAG,CAAC;AAAA,QACf;AAAA,MACF;AAAA,IACF;AACA,WAAO,CAAC,OAAO,MAAM;AAAA,EACvB;AAGA,WAAS,UAAU,KAAK;AACtB,QAAI,IAAI,IAAI;AACZ,QAAI,SAAS;AACb,QAAI,QAAQ,CAAC,GAAG,CAAC;AACjB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,YAAIN,KAAI,MAAM,IAAIA,KAAI,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG;AAChC,mBAASA,KAAI,IAAI,CAAC,EAAE,CAAC,CAAC;AACtB,kBAAQ,CAAC,GAAG,CAAC;AAAA,QACf;AAAA,MACF;AAAA,IACF;AACA,WAAO,CAAC,OAAO,MAAM;AAAA,EACvB;AAGA,WAAS,QAAQ,GAAG,GAAG,gBAAgB;AACrC,QAAI,IAAI,EAAE;AACV,QAAI,SAAS,MAAM,CAAC;AACpB,QAAI;AACJ,QAAI,gBAAgB;AAClB,aAAO,MAAM,CAAC;AACd,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAK,CAAC,IAAI,MAAM,CAAC;AAAA,MACnB;AAAA,IACF;AACA,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,QAAQ;AACZ,UAAI,OAAO,EAAE,CAAC;AACd,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,YAAIA,KAAI,EAAE,CAAC,CAAC,IAAIA,KAAI,IAAI,GAAG;AACzB,kBAAQ;AACR,iBAAO,EAAE,KAAK;AAAA,QAChB;AAAA,MACF;AACA,aAAO,CAAC,IAAI,EAAE,OAAO,OAAO,CAAC,EAAE,CAAC;AAChC,UAAI,gBAAgB;AAClB,iBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,eAAK,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK;AAC3B,YAAE,GAAG,EAAE,OAAO,OAAO,CAAC;AAAA,QACxB;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,eAAgB,QAAO;AAAA,MAC1B;AAAA,IACF;AACA,QAAI,eAAe,KAAK,IAAI,CAAC,QAAQU,QAAO;AAAA,MAC1C,OAAO,OAAOA,EAAC;AAAA,MACf;AAAA,IACF,EAAE;AACF,WAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;AFlSA,IAAIC,SAAO;AAGX,IAAIC,iBAAe,CAAC,UAAU,SAAS,UAAU,aAAa,SAAS,YAAY,OAAO,QAAQ,OAAO,OAAO,kBAAkB,gBAAgB,OAAO,aAAa,YAAY,OAAO,UAAU,UAAU,WAAW,UAAU,WAAW,QAAQ,QAAQ,QAAQ,WAAW,MAAM,UAAU,aAAa,MAAM,MAAM,WAAW,qBAAqB,KAAK;AACvV,IAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,MAAI;AAAA,IACF,QAAAC;AAAA,IACA,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,IACA,UAAAC;AAAA,IACA,OAAAC;AAAA,IACA,KAAAC;AAAA,IACA,MAAAC;AAAA,IACA,KAAAC;AAAA,IACA,KAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,cAAAC;AAAA,IACA,KAAAC;AAAA,IACA,WAAAC;AAAA,IACA,UAAAC;AAAA,IACA,KAAAC;AAAA,IACA,QAAAC;AAAA,IACA,QAAAC;AAAA,IACA,SAAAC;AAAA,IACA,QAAAC;AAAA,IACA,SAAAC;AAAA,IACA,MAAAC;AAAA,IACA,MAAAC;AAAA,IACA,MAAAC;AAAA,IACA,SAAAC;AAAA,IACA,IAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,IACA,IAAAC;AAAA,IACA,IAAAC;AAAA,IACA,SAAAC;AAAA,IACA,mBAAAC;AAAA,IACA,KAAAC;AAAA,EACF,IAAI;AACJ,MAAI,kBAAkB,oBAAoB;AAAA,IACxC,QAAAhC;AAAA,IACA,WAAAG;AAAA,IACA,UAAAC;AAAA,IACA,QAAAa;AAAA,IACA,SAAAC;AAAA,IACA,OAAAb;AAAA,IACA,KAAAC;AAAA,IACA,MAAAC;AAAA,IACA,KAAAC;AAAA,IACA,KAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,KAAAE;AAAA,IACA,WAAAC;AAAA,IACA,SAAAO;AAAA,IACA,UAAAN;AAAA,IACA,KAAAC;AAAA,EACF,CAAC;AACD,MAAI,gBAAgB,kBAAkB;AAAA,IACpC,QAAAf;AAAA,IACA,WAAAG;AAAA,IACA,UAAAC;AAAA,IACA,UAAAU;AAAA,IACA,gBAAAJ;AAAA,IACA,SAAAQ;AAAA,IACA,cAAAP;AAAA,IACA,MAAAU;AAAA,IACA,KAAAf;AAAA,IACA,WAAAO;AAAA,IACA,MAAAS;AAAA,IACA,MAAAC;AAAA,IACA,SAAAC;AAAA,IACA,IAAAC;AAAA,IACA,KAAAb;AAAA,IACA,QAAAc;AAAA,IACA,WAAAC;AAAA,IACA,OAAAtB;AAAA,IACA,SAAAe;AAAA,IACA,QAAAJ;AAAA,IACA,SAAAc;AAAA,IACA,mBAAAC;AAAA,IACA,KAAAC;AAAA,EACF,CAAC;AA8DD,SAAO/B,OAAM,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOnB,OAAO,SAASgC,OAAM,GAAG;AACvB,aAAO,OAAO/B,QAAO,CAAC,CAAC;AAAA,IACzB;AAAA,IACA,2BAA2B,SAAS,sBAAsB,GAAG,MAAM;AACjE,aAAO,OAAOA,QAAO,CAAC,GAAG;AAAA,QACvB,WAAW;AAAA,MACb,CAAC;AAAA,IACH;AAAA,IACA,gBAAgB,GAAG,MAAM;AACvB,aAAO,OAAOA,QAAO,CAAC,GAAG,IAAI;AAAA,IAC/B;AAAA,IACA,QAAQ,SAASgC,QAAO,KAAK;AAC3B,aAAO,OAAO,KAAK;AAAA,QACjB,WAAW;AAAA,MACb,CAAC;AAAA,IACH;AAAA,IACA,4BAA4B,SAAS,uBAAuB,KAAK,MAAM;AACrE,aAAO,OAAO,KAAK;AAAA,QACjB,WAAW;AAAA,QACX,WAAW;AAAA,MACb,CAAC;AAAA,IACH;AAAA,IACA,kBAAkB,SAAS,cAAc,KAAK,MAAM;AAClD,UAAI,UAAU;AAAA,QACZ,WAAW;AAAA,MACb;AACA,0BAAAC,SAAS,SAAS,IAAI;AACtB,aAAO,OAAO,KAAK,OAAO;AAAA,IAC5B;AAAA,EACF,CAAC;AACD,WAAS,OAAO,KAAK;AACnB,QAAI;AACJ,QAAI,OAAO,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC;AAChF,QAAI,iBAAiB,kBAAkB,OAAO,KAAK,eAAe;AAClE,QAAI,QAAQ,kBAAkB,KAAK,eAAe,QAAQ,oBAAoB,SAAS,kBAAkBnC,QAAO;AAChH,QAAI,SAAS,wBAAwB,KAAK,MAAM,cAAc;AAC9D,QAAI,KAAK,WAAW;AAClB,aAAO,SAASE,QAAO,OAAO,MAAM;AACpC,UAAI,gBAAgB;AAClB,eAAO,eAAe,OAAO,aAAa,IAAI,WAAS;AACrD,cAAI;AAAA,YACF;AAAA,YACA;AAAA,UACF,IAAI;AACJ,iBAAO;AAAA,YACL;AAAA,YACA,QAAQA,QAAO,MAAM;AAAA,UACvB;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AACA,QAAI,gBAAgB;AAClB,aAAO,eAAe,QAAQ,WAAW;AAAA,QACvC,YAAY;AAAA;AAAA;AAAA,QAGZ,KAAK,MAAM;AACT,gBAAM,IAAI,MAAM,oDAAoD;AAAA,QACtE;AAAA,MACF,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AACA,WAAS,wBAAwB,KAAK,MAAM,gBAAgB;AAC1D,QAAI,MAAM,IAAI,QAAQ;AAEtB,QAAI,QAAQ,IAAI,KAAK;AACrB,QAAI,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAC/C,YAAM,IAAI,WAAW,gCAAgC,OAAOkC,QAAO,KAAK,GAAG,GAAG,CAAC;AAAA,IACjF;AACA,QAAI,IAAI,MAAM,CAAC;AACf,QAAI,OAAO,KAAK,GAAG,IAAI,GAAG;AACxB,iBAAW,KAAK,CAAC;AAEjB,UAAI,YAAY,KAAK,GAAG,IAAI,GAAG;AAC7B,YAAI,QAAQ,YAAY,KAAK,KAAK,CAAC;AACnC,eAAO,gBAAgB,KAAK,GAAG,MAAM,OAAO,cAAc;AAAA,MAC5D;AAAA,IACF;AACA,QAAI,OAAO,YAAY,KAAK,KAAK,CAAC;AAClC,WAAO,cAAc,KAAK,GAAG,MAAM,MAAM,cAAc;AAAA,EACzD;AAGA,WAAS,YAAY,KAAK,GAAG,MAAM;AACjC,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,YAAIpB,QAAOH,WAAUP,KAAIF,UAAS,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG;AAChE,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAGA,WAAS,OAAO,KAAK,GAAG,MAAM;AAC5B,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,YAAIY,QAAOH,WAAUP,KAAIsB,IAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG;AAC/C,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,WAAS,WAAW,KAAK,GAAG;AAC1B,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,EAAE,CAAC,IAAIC,IAAG,IAAI,CAAC,EAAE,CAAC,CAAC;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;AAGA,WAAS,YAAY,KAAK,KAAK,GAAG;AAEhC,QAAI,OAAO,IAAI,SAAS;AACxB,QAAI,SAAS,YAAY,SAAS,eAAe,SAAS,WAAW;AACnE,aAAO;AAAA,IACT;AACA,QAAI,YAAY;AAChB,QAAI,SAAS;AACb,QAAI,aAAa;AACjB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,KAAK,IAAI,CAAC,EAAE,CAAC;AACjB,YAAI,SAAS,EAAE,KAAK,WAAW,EAAE,GAAG;AAClC,sBAAY;AAAA,QACd,WAAW,YAAY,EAAE,GAAG;AAC1B,mBAAS;AAAA,QACX,WAAW,UAAU,EAAE,GAAG;AACxB,uBAAa;AAAA,QACf,OAAO;AACL,gBAAM,UAAU,iCAAiC,OAAO,EAAE,CAAC;AAAA,QAC7D;AAAA,MACF;AAAA,IACF;AACA,QAAI,UAAU,YAAY;AACxB,cAAQ,KAAK,wEAAwE;AAAA,IACvF;AACA,QAAI,YAAY;AACd,eAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,iBAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,cAAI,EAAE,EAAE,EAAE,IAAIT,SAAQ,IAAI,EAAE,EAAE,EAAE,CAAC;AAAA,QACnC;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,QAAI,QAAQ;AACV,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,iBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,cAAI,GAAG,EAAE,GAAG,IAAIP,WAAU,IAAI,GAAG,EAAE,GAAG,CAAC;AAAA,QACzC;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,QAAI,WAAW;AACb,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,iBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,cAAI,GAAG,EAAE,GAAG,IAAIM,QAAO,IAAI,GAAG,EAAE,GAAG,CAAC;AAAA,QACtC;AAAA,MACF;AACA,aAAO;AAAA,IACT,OAAO;AACL,YAAM,UAAU,yCAAyC;AAAA,IAC3D;AAAA,EACF;AACF,CAAC;;;AGnUD,IAAIkB,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,UAAU,YAAY,eAAe,gBAAgB,KAAK;AAChF,IAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,UAAAC;AAAA,IACA,aAAAC;AAAA,IACA,cAAAC;AAAA,IACA,KAAAC;AAAA,EACF,IAAI;AACJ,MAAI,gBAAgB,oBAAoB;AAAA,IACtC,OAAAL;AAAA,IACA,aAAAG;AAAA,EACF,CAAC;AACD,MAAI,eAAe,mBAAmB;AAAA,IACpC,OAAAH;AAAA,EACF,CAAC;AAiCD,SAAOA,OAAM,UAAU,OAAO;AAAA;AAAA,IAG5B,kCAAkC,SAAS,4BAA4B,GAAG,GAAG;AAK3E,aAAOE,UAAS,GAAGG,KAAI,CAAC,CAAC;AAAA,IAC3B;AAAA,IACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,aAAO,aAAa,GAAG,GAAGD,eAAc,KAAK;AAAA,IAC/C;AAAA,IACA,qBAAqB,SAAS,iBAAiB,GAAG,GAAG;AACnD,aAAO,cAAc,GAAG,GAAGA,eAAc,KAAK;AAAA,IAChD;AAAA,IACA,cAAc,SAAS,UAAU,GAAG,GAAG;AAErC,aAAO,aAAaH,QAAO,CAAC,GAAG,GAAGG,eAAc,KAAK,EAAE,QAAQ;AAAA,IACjE;AAAA,IACA,uBAAuB,SAAS,kBAAkB,GAAG,GAAG;AACtD,aAAOF,UAAS,GAAGG,KAAI,CAAC,CAAC;AAAA,IAC3B;AAAA,EACF,GAAGD,cAAa,UAAU,CAAC;AAC7B,CAAC;;;AC1ED,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,OAAO,QAAQ;AACrC,IAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,KAAAC;AAAA,IACA,QAAAC;AAAA,EACF,IAAI;AA4BJ,SAAOF,OAAMF,QAAM;AAAA;AAAA,IAEjB,kBAAkB;AAAA;AAAA,IAElB,sCAAsC;AAAA;AAAA,IAEtC,OAAO,SAAS,EAAE,MAAM;AACtB,UAAI,oBAAoB,IAAI,GAAG;AAC7B,cAAM,IAAI,UAAU,yCAAyC;AAAA,MAC/D;AACA,aAAO,MAAM,IAAI;AAAA,IACnB;AAAA,EACF,CAAC;AAUD,WAAS,UAAU,OAAO,KAAK;AAC7B,QAAI;AACF,UAAIK,OAAM,OAAO,OAAO,KAAKF,IAAG;AAChC,UAAI,IAAI,MAAM,QAAQ,KAAK,IAAI,UAAU,KAAK,IAAI,MAAM,KAAK;AAC7D,aAAOC,QAAOC,MAAK,EAAE,GAAG,CAAC;AAAA,IAC3B,SAAS,KAAK;AACZ,YAAM,oBAAoB,KAAK,MAAM;AAAA,IACvC;AAAA,EACF;AAQA,WAAS,MAAM,OAAO;AACpB,QAAIA;AACJ,QAAI,MAAM;AACV,IAAAC,aAAY,OAAO,SAAU,OAAO;AAClC,UAAI;AACF,QAAAD,OAAMA,SAAQ,SAAY,QAAQF,KAAIE,MAAK,KAAK;AAChD;AAAA,MACF,SAAS,KAAK;AACZ,cAAM,oBAAoB,KAAK,QAAQ,KAAK;AAAA,MAC9C;AAAA,IACF,CAAC;AACD,QAAI,QAAQ,GAAG;AACb,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AACA,WAAOD,QAAOC,MAAK,GAAG;AAAA,EACxB;AACF,CAAC;;;ACzFD,IAAI,wBAAwB;AAC5B,IAAIE,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,OAAO,YAAY,YAAY,UAAU,aAAa,OAAO;AACnF,IAAI,iBAAgC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC7E,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,KAAAC;AAAA,IACA,UAAAC;AAAA,IACA,UAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,IACA,OAAO;AAAA,EACT,IAAI;AAsDJ,SAAOL,OAAMF,QAAM;AAAA;AAAA,IAEjB,kBAAkB,SAAS,cAAc,OAAO;AAC9C,aAAO,KAAK,OAAO,qBAAqB;AAAA,IAC1C;AAAA;AAAA,IAEA,0BAA0B;AAAA;AAAA,IAE1B,sCAAsC,SAAS,gCAAgC,OAAO,KAAK;AACzF,aAAO,QAAQ,OAAO,KAAK,qBAAqB;AAAA,IAClD;AAAA;AAAA,IAEA,8CAA8C;AAAA;AAAA,IAE9C,OAAO,SAAS,EAAE,MAAM;AACtB,aAAO,KAAK,MAAM,qBAAqB;AAAA,IACzC;AAAA,EACF,CAAC;AAaD,WAAS,KAAK,OAAO,eAAe;AAClC,QAAIQ;AACJ,QAAI,MAAM;AACV,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,IAAI,YAAY,gEAAgE;AAAA,IACxF;AAGA,IAAAC,aAAY,OAAO,SAAU,OAAO;AAClC,UAAI;AACF,QAAAD,OAAMA,SAAQ,SAAY,QAAQL,KAAIK,MAAK,KAAK;AAChD;AAAA,MACF,SAAS,KAAK;AACZ,cAAM,oBAAoB,KAAK,YAAY,KAAK;AAAA,MAClD;AAAA,IACF,CAAC;AACD,QAAI,QAAQ,EAAG,OAAM,IAAI,MAAM,6CAA6C;AAC5E,QAAIE,QAAOJ,QAAOE,MAAK,GAAG;AAG1B,IAAAA,OAAM;AACN,IAAAC,aAAY,OAAO,SAAU,OAAO;AAClC,UAAI,OAAOL,UAAS,OAAOM,KAAI;AAC/B,MAAAF,OAAMA,SAAQ,SAAYH,UAAS,MAAM,IAAI,IAAIF,KAAIK,MAAKH,UAAS,MAAM,IAAI,CAAC;AAAA,IAChF,CAAC;AACD,QAAI,UAAUG,IAAG,GAAG;AAClB,aAAOA;AAAA,IACT;AACA,YAAQ,eAAe;AAAA,MACrB,KAAK;AACH,eAAOF,QAAOE,MAAK,GAAG;AAAA,MACxB,KAAK;AACH,eAAOF,QAAOE,MAAK,MAAM,CAAC;AAAA,MAC5B,KAAK,YACH;AACE,YAAI,OAAO,YAAYA,IAAG,IAAIA,KAAI,IAAI,CAAC,IAAI;AAC3C,eAAO,QAAQ,IAAI,OAAOF,QAAOE,MAAK,MAAM,CAAC;AAAA,MAC/C;AAAA,MACF;AACE,cAAM,IAAI,MAAM,4BAA4B,gBAAgB,6DAAkE;AAAA,IAClI;AAAA,EACF;AACA,WAAS,QAAQ,OAAO,KAAK,eAAe;AAC1C,QAAI;AACF,UAAI,MAAM,WAAW,GAAG;AACtB,cAAM,IAAI,YAAY,gEAAgE;AAAA,MACxF;AACA,aAAOD,WAAU,OAAO,KAAK,OAAK,KAAK,GAAG,aAAa,CAAC;AAAA,IAC1D,SAAS,KAAK;AACZ,YAAM,oBAAoB,KAAK,UAAU;AAAA,IAC3C;AAAA,EACF;AACF,CAAC;;;ACtJD,IAAII,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,OAAO,QAAQ,UAAU;AAC/C,IAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,MAAI;AAAA,IACF,OAAAC;AAAA,IACA,KAAAC;AAAA,IACA,MAAAC;AAAA,IACA,UAAAC;AAAA,EACF,IAAI;AAqDJ,SAAOH,OAAMF,QAAM;AAAA;AAAA,IAEjB,kBAAkB;AAAA;AAAA,IAElB,0BAA0B;AAAA;AAAA,IAE1B,sCAAsC;AAAA;AAAA,IAEtC,8CAA8C;AAAA;AAAA,IAE9C,OAAO,SAAS,EAAE,MAAM;AACtB,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF,CAAC;AACD,WAAS,KAAK,OAAO,eAAe;AAClC,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,IAAI,YAAY,2DAA2D;AAAA,IACnF;AACA,QAAI;AACF,UAAI,IAAIK,UAAS,MAAM,MAAM,SAAS;AACtC,UAAI,aAAa,CAAC,GAAG;AACnB,eAAOF,KAAI,GAAGC,KAAI;AAAA,MACpB,OAAO;AACL,eAAOA,MAAK,CAAC;AAAA,MACf;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,eAAe,aAAa,IAAI,QAAQ,SAAS,WAAW,GAAG;AACjE,cAAM,IAAI,UAAU,IAAI,QAAQ,QAAQ,aAAa,MAAM,CAAC;AAAA,MAC9D,OAAO;AACL,cAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACF,CAAC;;;ACxFM,IAAI,YAA2B,qCAAqB;AAAA,EACzD;AACF,CAAC;AACM,IAAIE,WAAyB,mCAAmB,CAAC,CAAC;AAUlD,IAAIC,YAA0B,oCAAoB,CAAC,CAAC;AAgBpD,IAAI,SAAwB,kCAAkB,CAAC,CAAC;AA0BhD,IAAI,cAA6B,uCAAuB;AAAA,EAC7D;AAAA,EACA;AACF,CAAC;AAkBM,IAAI,QAAuB,4BAAY;AAAA,EAC5C;AAAA,EACA,SAAAC;AAAA,EACA;AAAA,EACA,UAAAC;AACF,CAAC;AAKM,IAAIC,OAAqB,0BAAU;AAAA,EACxC;AACF,CAAC;AAgBM,IAAI,YAA2B,gCAAgB;AAAA,EACpD;AACF,CAAC;AAaM,IAAIC,QAAsB,2BAAW;AAAA,EAC1C;AACF,CAAC;AAqBM,IAAI,UAAyB,8BAAc;AAAA,EAChD,SAAAC;AAAA,EACA;AACF,CAAC;AACM,IAAI,OAAsB,2BAAW;AAAA,EAC1C;AACF,CAAC;AACM,IAAIC,OAAqB,0BAAU;AAAA,EACxC;AACF,CAAC;AAYM,IAAI,cAA6B,kCAAkB;AAAA,EACxD;AAAA,EACA;AACF,CAAC;AAcM,IAAIC,WAAyB,8BAAc;AAAA,EAChD;AACF,CAAC;AAOM,IAAI,oBAAmC,wCAAwB;AAAA,EACpE;AACF,CAAC;AAKM,IAAI,KAAoB,yBAAS;AAAA,EACtC;AACF,CAAC;AAIM,IAAIC,SAAuB,4BAAY;AAAA,EAC5C;AACF,CAAC;AAyBM,IAAI,MAAqB,0BAAU;AAAA,EACxC;AACF,CAAC;AAMM,IAAI,iBAAgC,qCAAqB;AAAA,EAC9D;AACF,CAAC;AAIM,IAAI,SAAwB,6BAAa;AAAA,EAC9C;AACF,CAAC;AAgBM,IAAI,KAAoB,yBAAS;AAAA,EACtC;AACF,CAAC;AAKM,IAAIC,QAAsB,2BAAW;AAAA,EAC1C;AAAA,EACA,UAAAC;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACM,IAAIC,OAAqB,0BAAU;AAAA,EACxC;AACF,CAAC;AACM,IAAI,OAAsB,2BAAW;AAAA,EAC1C;AACF,CAAC;AACM,IAAI,eAA8B,wCAAwB;AAAA,EAC/D;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAUM,IAAI,iBAAgC,qCAAqB;AAAA,EAC9D;AACF,CAAC;AAyBM,IAAI,YAA2B,gCAAgB;AAAA,EACpD;AAAA,EACA;AACF,CAAC;AAWM,IAAI,MAAqB,0BAAU;AAAA,EACxC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAcM,IAAI,SAAwB,6BAAa;AAAA,EAC9C;AAAA,EACA;AACF,CAAC;AACM,IAAI,SAAwB,6BAAa;AAAA,EAC9C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAMM,IAAI,WAA0B,+BAAe;AAAA,EAClD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AA2BM,IAAIC,QAAsB,2BAAW;AAAA,EAC1C,SAAAC;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAiBM,IAAIC,SAAuB,4BAAY;AAAA,EAC5C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAyBM,IAAI,OAAsB,2BAAW;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACM,IAAI,QAAuB,4BAAY;AAAA,EAC5C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACM,IAAI,WAA0B,+BAAe;AAAA,EAClD,UAAAC;AAAA,EACA;AACF,CAAC;AACM,IAAI,WAA0B,+BAAe;AAAA,EAClD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACM,IAAIC,aAA2B,gCAAgB;AAAA,EACpD;AAAA,EACA;AACF,CAAC;AAMM,IAAI,YAA2B,gCAAgB;AAAA,EACpD,WAAAC;AAAA,EACA;AACF,CAAC;AAEM,IAAI,oBAAmC,wCAAwB;AAAA,EACpE,SAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACM,IAAI,UAAyB,8BAAc;AAAA,EAChD;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAOM,IAAIC,WAAyB,8BAAc;AAAA,EAChD,WAAAC;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAUM,IAAI,aAA4B,iCAAiB;AAAA,EACtD;AACF,CAAC;AAmBM,IAAIC,UAAwB,6BAAa;AAAA,EAC9C,WAAAC;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAUM,IAAI,eAA8B,mCAAmB;AAAA,EAC1D;AAAA,EACA;AACF,CAAC;AA4BM,IAAI,aAA4B,iCAAiB;AAAA,EACtD;AAAA,EACA;AACF,CAAC;AACM,IAAI,SAAwB,6BAAa;AAAA,EAC9C;AAAA,EACA;AAAA,EACA;AAAA,EACA,QAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAwBM,IAAIC,OAAqB,0BAAU;AAAA,EACxC;AAAA,EACA,OAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAgCM,IAAI,KAAoB,yBAAS;AAAA,EACtC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,MAAAC;AAAA,EACA,MAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,OAAAC;AACF,CAAC;AASM,IAAI,UAAyB,8BAAc;AAAA,EAChD;AAAA,EACA;AAAA,EACA;AAAA,EACA,QAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACM,IAAI,WAA0B,+BAAe;AAAA,EAClD;AAAA,EACA,QAAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAWM,IAAI,SAAwB,6BAAa;AAAA,EAC9C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAQM,IAAIC,OAAqB,0BAAU;AAAA,EACxC;AAAA,EACA;AAAA,EACA;AAAA,EACA,QAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAoEM,IAAI,MAAqB,0BAAU;AAAA,EACxC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AA6CM,IAAI,uBAAsC,gDAAgC;AAAA,EAC/E;AAAA,EACA;AACF,CAAC;AACM,IAAI,QAAuB,iCAAiB;AAAA,EACjD;AAAA,EACA;AACF,CAAC;AA6BM,IAAI,WAA0B,+BAAe;AAAA,EAClD;AAAA,EACA;AAAA,EACA,QAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAuBM,IAAIC,OAAqB,0BAAU;AAAA,EACxC;AAAA,EACA,OAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAuDM,IAAI,YAA2B,gCAAgB;AAAA,EACpD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAwCM,IAAI,MAAqB,0BAAU;AAAA,EACxC,KAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AA8EM,IAAI,YAA2B,gCAAgB;AAAA,EACpD;AAAA,EACA;AAAA,EACA,QAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAqCM,IAAIC,UAAwB,6BAAa;AAAA,EAC9C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAkEM,IAAI,OAAsB,2BAAW;AAAA,EAC1C,KAAAC;AAAA,EACA,QAAAC;AAAA,EACA;AACF,CAAC;AAsCM,IAAI,QAAuB,4BAAY;AAAA,EAC5C;AAAA,EACA;AAAA,EACA,KAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAqFM,IAAI,SAAwB,6BAAa;AAAA,EAC9C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAoBM,IAAI,OAAsB,2BAAW;AAAA,EAC1C,KAAAC;AAAA,EACA,KAAAC;AAAA,EACA;AAAA,EACA,MAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,KAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAAAC;AAAA,EACA,KAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA,MAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAoJM,IAAI,WAA0B,+BAAe;AAAA,EAClD,KAAAC;AAAA,EACA,QAAAC;AAAA,EACA,OAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AA6GM,IAAI,MAAqB,0BAAU;AAAA,EACxC;AAAA,EACA,MAAAC;AAAA,EACA;AAAA,EACA;AACF,CAAC;;;ACxpDM,IAAM,iBAAyC;AAAA,EACpD,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA;AAAA,EAEd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAChB;;;ACpuGA,IAAI,aAA8B;AAKlC,SAAS,gBAA0B;AACjC,MAAI,CAAC,YAAY;AACf,iBAAa,OAAO,KAAK,cAAc,EAAE,KAAK;AAAA,EAChD;AACA,SAAO;AACT;AAMO,SAAS,gBAAgB,MAAoB;AAClD,QAAM,OAAO,KAAK,YAAY;AAC9B,QAAM,QAAQ,OAAO,KAAK,SAAS,IAAI,CAAC,EAAE,SAAS,GAAG,GAAG;AACzD,QAAM,MAAM,OAAO,KAAK,QAAQ,CAAC,EAAE,SAAS,GAAG,GAAG;AAClD,SAAO,GAAG,IAAI,IAAI,KAAK,IAAI,GAAG;AAChC;AAuBO,SAAS,gBAAgB,MAAoB;AAClD,QAAM,OAAO,cAAc;AAC3B,QAAM,UAAU,gBAAgB,IAAI;AAGpC,MAAI,eAAe,OAAO,MAAM,QAAW;AACzC,WAAO,eAAe,OAAO;AAAA,EAC/B;AAGA,MAAI,UAAU,KAAK,CAAC,GAAG;AACrB,WAAO,eAAe,KAAK,CAAC,CAAC;AAAA,EAC/B;AAGA,MAAI,UAAU,KAAK,KAAK,SAAS,CAAC,GAAG;AACnC,WAAO,eAAe,KAAK,KAAK,SAAS,CAAC,CAAC;AAAA,EAC7C;AAIA,MAAI,OAAO;AACX,MAAI,QAAQ,KAAK,SAAS;AAE1B,SAAO,OAAO,OAAO;AACnB,UAAM,MAAM,KAAK,OAAO,OAAO,QAAQ,KAAK,CAAC;AAC7C,QAAI,KAAK,GAAG,KAAK,SAAS;AACxB,aAAO;AAAA,IACT,OAAO;AACL,cAAQ,MAAM;AAAA,IAChB;AAAA,EACF;AAGA,SAAO,eAAe,KAAK,IAAI,CAAC;AAClC;AAmDO,SAAS,qBAAqB,SAAyB;AAC5D,QAAM,OAAO,cAAc;AAG3B,MAAI,eAAe,OAAO,MAAM,QAAW;AACzC,WAAO,eAAe,OAAO;AAAA,EAC/B;AAGA,MAAI,UAAU,KAAK,CAAC,GAAG;AACrB,WAAO,eAAe,KAAK,CAAC,CAAC;AAAA,EAC/B;AAGA,MAAI,UAAU,KAAK,KAAK,SAAS,CAAC,GAAG;AACnC,WAAO,eAAe,KAAK,KAAK,SAAS,CAAC,CAAC;AAAA,EAC7C;AAIA,MAAI,OAAO;AACX,MAAI,QAAQ,KAAK,SAAS;AAE1B,SAAO,OAAO,OAAO;AACnB,UAAM,MAAM,KAAK,OAAO,OAAO,QAAQ,KAAK,CAAC;AAC7C,QAAI,KAAK,GAAG,KAAK,SAAS;AACxB,aAAO;AAAA,IACT,OAAO;AACL,cAAQ,MAAM;AAAA,IAChB;AAAA,EACF;AAGA,SAAO,eAAe,KAAK,IAAI,CAAC;AAClC;;;AC3IO,IAAM,0BAA0C;AAAA,EACrD,qBAAqB;AAAA,EACrB,qBAAqB;AAAA;AAAA,EACrB,iBAAiB;AAAA,EACjB,mBAAmB;AACrB;AAKO,IAAM,2BAAN,MAAM,0BAAyB;AAAA,EAC5B;AAAA,EAER,YAAYC,UAAkC,CAAC,GAAG;AAChD,SAAK,SAAS,EAAE,GAAG,yBAAyB,GAAGA,QAAO;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA,EAKA,wBAAwB,QAAiB,iBAAmC,qBAAqB,OAAuB;AACtH,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,KAAK,cAAc;AAAA,IAC5B;AAGA,UAAM,cAAc,OAAO,OAAO,WAAS;AACzC,UAAI;AAEF,YAAI,OAAO,MAAM,OAAO,YAAY,MAAM,MAAM,EAAE,EAAG,QAAO;AAC5D,YAAI,CAAC,MAAM,WAAY,QAAO;AAG9B,cAAM,OAAO,IAAI,KAAK,MAAM,UAAU;AACtC,YAAI,MAAM,KAAK,QAAQ,CAAC,EAAG,QAAO;AAGlC,YAAI,OAAO,MAAM,2BAA2B,YAAY,MAAM,MAAM,sBAAsB,EAAG,QAAO;AACpG,YAAI,OAAO,MAAM,2BAA2B,YAAY,MAAM,MAAM,sBAAsB,EAAG,QAAO;AAEpG,eAAO;AAAA,MACT,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AAED,QAAI,YAAY,WAAW,GAAG;AAC5B,aAAO,KAAK,cAAc;AAAA,IAC5B;AAIA,UAAM,oBAAoB,qBACtB,SACA;AAKJ,UAAM,cAAc,YAAY;AAChC,UAAM,UAAU,YAAY,IAAI,WAAS,MAAM,EAAE,EAAE,OAAO,CAACC,MAAK,OAAOA,OAAM,IAAI,CAAC;AAClF,UAAM,mBAAmB,YAAY;AAAA,MACnC,CAACA,MAAK,UAAUA,OAAM,MAAM,yBAAyB,MAAM;AAAA,MAC3D;AAAA,IACF;AACA,UAAM,QAAQ,UAAU;AAGxB,UAAM,oBAAoB,YAAY,OAAO,WAAS,MAAM,KAAK,CAAC;AAClE,UAAM,mBAAmB,YAAY,OAAO,WAAS,MAAM,KAAK,CAAC;AACjE,UAAM,sBAAsB,YAAY,OAAO,WAAS,MAAM,OAAO,CAAC;AAEtE,UAAM,UAAU,kBAAkB,SAAS;AAC3C,UAAM,SAAS,kBAAkB,SAAS,IACtC,KAAK,kBAAkB,IAAI,WAAS,MAAM,EAAE,CAAC,IAC7C;AACJ,UAAM,UAAU,iBAAiB,SAAS,IACtC,KAAK,iBAAiB,IAAI,WAAS,MAAM,EAAE,CAAC,IAC5C;AAGJ,UAAM,WAAW,YAAY,IAAI,WAAS,MAAM,EAAE,EAAE,OAAO,QAAM,OAAO,OAAO,YAAY,CAAC,MAAM,EAAE,CAAC;AACrG,UAAM,SAAS,SAAS,SAAS,KAAK,kBAAkB,SAAS,IAAIC,KAAI,SAAS,OAAO,QAAM,KAAK,CAAC,CAAC,IAAc;AACpH,UAAM,UAAU,SAAS,SAAS,KAAK,iBAAiB,SAAS,IAAIC,KAAI,SAAS,OAAO,QAAM,KAAK,CAAC,CAAC,IAAc;AAGpH,UAAM,cAAc,kBAAkB,OAAO,CAACF,MAAK,UAAUA,OAAM,MAAM,IAAI,CAAC;AAC9E,UAAM,YAAY,KAAK,IAAI,iBAAiB,OAAO,CAACA,MAAK,UAAUA,OAAM,MAAM,IAAI,CAAC,CAAC;AACrF,UAAM,eAAe,YAAY,IAAI,cAAc,YAAY,cAAc,IAAI,WAAW;AAG5F,UAAM,cAAc,KAAK,qBAAqB,aAAa,iBAAiB;AAG5E,UAAM,aAAa,KAAK,oBAAoB,aAAa,iBAAiB;AAG1E,UAAM,cAAc,KAAK,qBAAqB,aAAa,iBAAiB;AAG5E,UAAM,OAAO,KAAK,cAAc,WAAW;AAC3C,UAAM,eAAe,KAAK,sBAAsB,aAAa,iBAAiB;AAC9E,UAAM,cAAc,KAAK,qBAAqB,aAAa,iBAAiB;AAC5E,UAAM,kBAAkB,KAAK,yBAAyB,WAAW;AAGjE,UAAM,UAAU,KAAK,iBAAiB,WAAW;AAGjD,UAAM,iBAAiB,KAAK,wBAAwB,aAAa,iBAAiB;AAGlF,UAAM,mBAAmB,KAAK,0BAA0B,WAAW;AAGnE,UAAM,iBAAiB,0BAAyB,wBAAwB,aAAa,iBAAiB;AAEtG,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,eAAe,kBAAkB;AAAA,MACjC,cAAc,iBAAiB;AAAA,MAC/B,iBAAiB,oBAAoB;AAAA,MACrC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,cAAc,QAAQ;AAAA,MACtB,eAAe,QAAQ;AAAA,MACvB,eAAe,QAAQ;AAAA,MACvB;AAAA,MACA,gBAAgB,iBAAiB;AAAA,MACjC,eAAe,iBAAiB;AAAA,MAChC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,uBAAuB,QAAgD;AACrE,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,CAAC;AAAA,IACV;AAGA,UAAM,mBAAmB,OAAO,OAAO,CAAC,KAAK,UAAU;AACrD,YAAM,WAAW,MAAM,YAAY;AACnC,UAAI,CAAC,IAAI,QAAQ,GAAG;AAClB,YAAI,QAAQ,IAAI,CAAC;AAAA,MACnB;AACA,UAAI,QAAQ,EAAE,KAAK,KAAK;AACxB,aAAO;AAAA,IACT,GAAG,CAAC,CAA4B;AAGhC,UAAM,gBAA+C,CAAC;AAEtD,WAAO,QAAQ,gBAAgB,EAAE,QAAQ,CAAC,CAAC,cAAc,cAAc,MAAM;AAC3E,YAAM,iBAAiB,KAAK,wBAAwB,cAAc;AAGlE,YAAM,SAAS,KAAK,gBAAgB,cAAc;AAElD,oBAAc,YAAY,IAAI;AAAA,QAC5B;AAAA,QACA,YAAY,eAAe;AAAA,QAC3B,SAAS,eAAe;AAAA,QACxB,SAAS,eAAe;AAAA,QACxB,QAAQ,eAAe;AAAA,QACvB,SAAS,eAAe;AAAA,QACxB,QAAQ,eAAe;AAAA,QACvB,SAAS,eAAe;AAAA,QACxB;AAAA,QACA,aAAa,eAAe;AAAA;AAAA,QAC5B,cAAc,eAAe;AAAA,MAC/B;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,qBAAqB,QAAiB,iBAA2C;AAEvF,QAAI,mBAAmB,gBAAgB,SAAS,GAAG;AAEjD,UAAIG,eAAc;AAElB,iBAAW,SAAS,iBAAiB;AAEnC,cAAM,cAAc,KAAK,IAAI,MAAM,eAAe,CAAC;AACnD,QAAAA,eAAc,KAAK,IAAIA,cAAa,WAAW;AAAA,MACjD;AAEA,aAAOA;AAAA,IACT;AAGA,QAAI,OAAO,WAAW,EAAG,QAAO;AAGhC,UAAM,eAAe,OAAO,OAAO,WAAS,MAAM,cAAc,MAAM,iBAAiB,MAAS;AAEhG,QAAI,aAAa,WAAW,EAAG,QAAO;AAGtC,UAAM,eAAe,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,GAAG,MAAM;AACpD,UAAI;AACF,cAAM,QAAQ,IAAI,KAAK,EAAE,UAAW;AACpC,cAAM,QAAQ,IAAI,KAAK,EAAE,UAAW;AAGpC,YAAI,MAAM,MAAM,QAAQ,CAAC,KAAK,MAAM,MAAM,QAAQ,CAAC,GAAG;AACpD,iBAAO;AAAA,QACT;AAEA,cAAM,cAAc,MAAM,QAAQ,IAAI,MAAM,QAAQ;AACpD,YAAI,gBAAgB,EAAG,QAAO;AAC9B,gBAAQ,EAAE,cAAc,IAAI,cAAc,EAAE,cAAc,EAAE;AAAA,MAC9D,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AAGD,QAAI,iBAAiB,0BAAyB,wBAAwB,YAAY;AAClF,QAAI,CAAC,SAAS,cAAc,KAAK,kBAAkB,GAAG;AACpD,uBAAiB,aAAa,CAAC,EAAE,eAAe,aAAa,CAAC,EAAE;AAAA,IAClE;AAGA,QAAI,gBAAgB;AACpB,UAAM,cAAuD,CAAC;AAE9D,iBAAa,QAAQ,WAAS;AAC5B,YAAM,SAAS,SAAS,MAAM,YAAY,IACtC,MAAM,eACN,gBAAgB,MAAM;AAE1B,sBAAgB;AAEhB,YAAM,YAAY,IAAI,KAAK,MAAM,UAAkB;AACnD,YAAM,UAAU,UAAU,YAAY;AACtC,YAAM,SAAS,QAAQ,MAAM,GAAG,EAAE;AAElC,YAAM,YAAY,YAAY,YAAY,SAAS,CAAC;AACpD,UAAI,aAAa,UAAU,KAAK,MAAM,GAAG,EAAE,MAAM,QAAQ;AACvD,oBAAY,YAAY,SAAS,CAAC,IAAI,EAAE,MAAM,SAAS,OAAO;AAAA,MAChE,OAAO;AACL,oBAAY,KAAK,EAAE,MAAM,SAAS,OAAO,CAAC;AAAA,MAC5C;AAAA,IACF,CAAC;AAED,QAAI,OAAO;AACX,QAAI,cAAc;AAElB,eAAW,SAAS,aAAa;AAC/B,UAAI,MAAM,SAAS,MAAM;AACvB,eAAO,MAAM;AAAA,MACf;AAEA,UAAI,OAAO,GAAG;AACZ,cAAM,YAAY,OAAO,MAAM,UAAU,OAAO;AAChD,sBAAc,KAAK,IAAI,aAAa,QAAQ;AAAA,MAC9C;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,QAAiB,iBAA2C;AAEtF,QAAI,mBAAmB,gBAAgB,SAAS,GAAG;AACjD,YAAMC,gBAAe,gBAAgB,OAAO,CAACJ,MAAK,UAAUA,OAAM,MAAM,SAAS,CAAC;AAClF,aAAOI,gBAAe,gBAAgB;AAAA,IACxC;AAGA,QAAI,OAAO,WAAW,EAAG,QAAO;AAGhC,UAAM,UAAU,oBAAI,IAAoB;AAExC,WAAO,QAAQ,WAAS;AACtB,UAAI;AACF,cAAM,OAAO,IAAI,KAAK,MAAM,UAAU;AACtC,YAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,GAAG;AAC1B,gBAAM,UAAU,KAAK,YAAY,EAAE,MAAM,GAAG,EAAE,CAAC;AAC/C,gBAAM,YAAY,QAAQ,IAAI,OAAO,KAAK;AAC1C,kBAAQ,IAAI,SAAS,YAAY,MAAM,EAAE;AAAA,QAC3C;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF,CAAC;AAED,QAAI,QAAQ,SAAS,EAAG,QAAO;AAE/B,UAAM,eAAe,MAAM,KAAK,QAAQ,OAAO,CAAC,EAAE,OAAO,CAACJ,MAAK,OAAOA,OAAM,IAAI,CAAC;AACjF,WAAO,eAAe,QAAQ;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,qBAAqB,QAAiB,iBAAuD;AAEnG,UAAM,wBAAwB,KAAK,+BAA+B,QAAQ,eAAe;AAEzF,QAAI,sBAAsB,SAAS,EAAG,QAAO;AAG7C,UAAM,gBAA0B,CAAC;AAEjC,eAAW,EAAE,MAAM,QAAQ,YAAY,KAAK,uBAAuB;AAEjE,YAAM,aAAa,gBAAgB,IAAI;AACvC,YAAM,oBAAoB,aAAa,MAAM,KAAK,OAAO;AAEzD,oBAAc,KAAK,cAAc,iBAAiB;AAAA,IACpD;AAKA,UAAM,kBAAkB,KAAK,aAAa;AAC1C,UAAM,SAAS,IAAI,eAAe,aAAa;AAE/C,QAAI,WAAW,EAAG,QAAO;AAGzB,UAAM,cAAe,kBAAkB,SAAU,KAAK,KAAK,KAAK,OAAO,mBAAmB;AAE1F,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,QAAqC;AAC3D,UAAM,gBAAgB,OAAO;AAAA,MAAO,WAClC,MAAM,cAAc,MAAM;AAAA,IAC5B;AAEA,QAAI,cAAc,WAAW,EAAG,QAAO;AAEvC,UAAM,WAAW,cAAc,OAAO,CAACA,MAAK,UAAU;AACpD,YAAM,WAAW,IAAI,KAAK,MAAM,UAAU;AAC1C,YAAM,YAAY,IAAI,KAAK,MAAM,UAAW;AAC5C,YAAM,MAAM,KAAK,MAAM,UAAU,QAAQ,IAAI,SAAS,QAAQ,MAAM,MAAO,KAAK,KAAK,GAAG;AACxF,aAAOA,OAAM;AAAA,IACf,GAAG,CAAC;AAEJ,WAAO,WAAW,cAAc;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA,EAKQ,cAAc,QAAqC;AACzD,QAAI,OAAO,WAAW,EAAG,QAAO;AAEhC,UAAM,eAAe,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM;AAC9C,YAAM,cAAc,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ;AACtF,UAAI,gBAAgB,EAAG,QAAO;AAC9B,aAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AAAA,IAChD,CAAC;AAED,UAAM,YAAY,IAAI,KAAK,aAAa,CAAC,EAAE,UAAU;AACrD,UAAM,UAAU,IAAI,KAAK,aAAa,aAAa,SAAS,CAAC,EAAE,cAAc,aAAa,aAAa,SAAS,CAAC,EAAE,UAAU;AAC7H,UAAM,cAAc,QAAQ,QAAQ,IAAI,UAAU,QAAQ,MAAM,MAAO,KAAK,KAAK,KAAK;AAEtF,QAAI,cAAc,EAAG,QAAO;AAE5B,UAAM,iBAAiB,0BAAyB,wBAAwB,MAAM;AAC9E,UAAM,aAAa,iBAAiB,OAAO,OAAO,CAACA,MAAK,UAAUA,OAAM,MAAM,IAAI,CAAC;AAEnF,QAAI,kBAAkB,KAAK,cAAc,EAAG,QAAO;AAEnD,UAAM,OAAO,KAAK,IAAI,aAAa,gBAAgB,IAAI,UAAU,IAAI;AACrE,WAAO,OAAO;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBQ,sBAAsB,QAAiB,iBAAuD;AACpG,QAAI,OAAO,SAAS,EAAG,QAAO;AAG9B,UAAM,wBAAwB,KAAK,+BAA+B,QAAQ,eAAe;AACzF,QAAI,sBAAsB,SAAS,EAAG,QAAO;AAG7C,UAAM,gBAA0B,CAAC;AAEjC,eAAW,EAAE,MAAM,QAAQ,YAAY,KAAK,uBAAuB;AAEjE,YAAM,aAAa,gBAAgB,IAAI;AACvC,YAAM,oBAAoB,aAAa,MAAM,KAAK,OAAO;AAEzD,oBAAc,KAAK,cAAc,iBAAiB;AAAA,IACpD;AAEA,UAAM,kBAAkB,KAAK,aAAa;AAI1C,UAAM,IAAI,cAAc;AACxB,UAAM,qBAAqB,cAAc,OAAO,CAACA,MAAK,QAAQ;AAC5D,YAAM,WAAW,KAAK,IAAI,KAAK,CAAC;AAChC,aAAOA,OAAM,WAAW;AAAA,IAC1B,GAAG,CAAC;AAGJ,QAAI,uBAAuB,EAAG,QAAO;AAErC,UAAM,oBAAoB,KAAK,KAAK,qBAAqB,CAAC;AAG1D,QAAI,oBAAoB,MAAO,QAAO;AAEtC,UAAM,eAAgB,kBAAkB,oBAAqB,KAAK,KAAK,KAAK,OAAO,mBAAmB;AAEtG,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,qBAAqB,QAAiB,iBAAuD;AACnG,UAAM,OAAO,KAAK,cAAc,MAAM;AACtC,UAAM,cAAc,KAAK,IAAI,KAAK,qBAAqB,QAAQ,eAAe,CAAC;AAE/E,QAAI,CAAC,QAAQ,gBAAgB,EAAG,QAAO;AAEvC,WAAO,OAAO;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA,EAKQ,yBAAyB,QAAqC;AACpE,QAAI,OAAO,WAAW,EAAG,QAAO;AAEhC,UAAM,gBAAgB,OAAO,OAAO,WAAS,MAAM,KAAK,CAAC;AACzD,UAAM,eAAe,OAAO,OAAO,WAAS,MAAM,KAAK,CAAC;AAExD,QAAI,cAAc,WAAW,KAAK,aAAa,WAAW,EAAG,QAAO;AAEpE,UAAM,UAAU,cAAc,SAAS,OAAO;AAC9C,UAAM,SAAS,cAAc,OAAO,CAACA,MAAK,UAAUA,OAAM,MAAM,IAAI,CAAC,IAAI,cAAc;AACvF,UAAM,UAAU,KAAK,IAAI,aAAa,OAAO,CAACA,MAAK,UAAUA,OAAM,MAAM,IAAI,CAAC,IAAI,aAAa,MAAM;AAErG,QAAI,YAAY,EAAG,QAAO;AAE1B,UAAM,eAAe,SAAS;AAC9B,UAAM,mBAAmB,UAAU,gBAAgB,IAAI,YAAY;AAEnE,WAAO,kBAAkB;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,QAIvB;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,EAAE,cAAc,GAAG,eAAe,GAAG,eAAe,EAAE;AAAA,IAC/D;AAGA,UAAM,eAAe,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM;AAC9C,aAAO,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ;AAAA,IAC3E,CAAC;AAED,QAAI,eAAe;AACnB,QAAI,gBAAgB;AACpB,QAAI,mBAAmB;AACvB,QAAI,oBAAoB;AAExB,eAAW,SAAS,cAAc;AAChC,UAAI,MAAM,KAAK,GAAG;AAChB;AACA,4BAAoB;AACpB,uBAAe,KAAK,IAAI,cAAc,gBAAgB;AAAA,MACxD,WAAW,MAAM,KAAK,GAAG;AACvB;AACA,2BAAmB;AACnB,wBAAgB,KAAK,IAAI,eAAe,iBAAiB;AAAA,MAC3D,OAAO;AACL,2BAAmB;AACnB,4BAAoB;AAAA,MACtB;AAAA,IACF;AAGA,UAAM,gBAAgB,mBAAmB,IAAI,mBAAmB,oBAAoB,IAAI,CAAC,oBAAoB;AAE7G,WAAO,EAAE,cAAc,eAAe,cAAc;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA,EAKQ,wBAAwB,QAAiB,iBAAuD;AACtG,QAAI,mBAAmB,gBAAgB,SAAS,GAAG;AACjD,YAAM,iBAAiB,gBAAgB,OAAO,WAAS,MAAM,cAAc,CAAC,EAAE;AAC9E,aAAQ,iBAAiB,gBAAgB,SAAU;AAAA,IACrD;AAGA,QAAI,OAAO,WAAW,EAAG,QAAO;AAGhC,UAAM,eAAe,OAAO,OAAO,WAAS,MAAM,cAAc,MAAM,iBAAiB,MAAS;AAEhG,QAAI,aAAa,WAAW,EAAG,QAAO;AAGtC,UAAM,eAAe,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,GAAG,MAAM;AACpD,UAAI;AACF,cAAM,QAAQ,IAAI,KAAK,EAAE,UAAW;AACpC,cAAM,QAAQ,IAAI,KAAK,EAAE,UAAW;AAGpC,YAAI,MAAM,MAAM,QAAQ,CAAC,KAAK,MAAM,MAAM,QAAQ,CAAC,GAAG;AACpD,iBAAO;AAAA,QACT;AAEA,cAAM,cAAc,MAAM,QAAQ,IAAI,MAAM,QAAQ;AACpD,YAAI,gBAAgB,EAAG,QAAO;AAC9B,gBAAQ,EAAE,cAAc,IAAI,cAAc,EAAE,cAAc,EAAE;AAAA,MAC9D,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AAGD,UAAM,aAAa,aAAa,CAAC;AACjC,UAAM,iBAAiB,WAAW,eAAe,WAAW;AAG5D,QAAI,OAAO;AACX,QAAI,oBAAoB;AACxB,UAAM,eAAe,aAAa;AAElC,eAAW,SAAS,cAAc;AAChC,YAAM,iBAAiB,MAAM;AAG7B,UAAI,iBAAiB,MAAM;AACzB,eAAO;AAAA,MACT;AAGA,UAAI,iBAAiB,MAAM;AACzB;AAAA,MACF;AAAA,IACF;AAEA,WAAO,eAAe,IAAK,oBAAoB,eAAgB,MAAM;AAAA,EACvE;AAAA;AAAA;AAAA;AAAA,EAKQ,0BAA0B,QAGhC;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,EAAE,gBAAgB,GAAG,eAAe,EAAE;AAAA,IAC/C;AAGA,UAAM,gBAAgB,oBAAI,IAAqB;AAC/C,UAAM,eAAe,oBAAI,IAAqB;AAE9C,eAAW,SAAS,QAAQ;AAC1B,YAAM,OAAO,IAAI,KAAK,MAAM,UAAU;AAGtC,YAAM,WAAW,GAAG,KAAK,YAAY,CAAC,IAAI,OAAO,KAAK,SAAS,IAAI,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC;AACtF,UAAI,CAAC,cAAc,IAAI,QAAQ,GAAG;AAChC,sBAAc,IAAI,UAAU,CAAC,CAAC;AAAA,MAChC;AACA,oBAAc,IAAI,QAAQ,EAAG,KAAK,KAAK;AAGvC,YAAM,cAAc,IAAI,KAAK,KAAK,YAAY,GAAG,GAAG,CAAC;AACrD,YAAM,aAAa,KAAK,OAAO,KAAK,QAAQ,IAAI,YAAY,QAAQ,KAAK,QAAW,YAAY,OAAO,IAAI,KAAK,CAAC;AACjH,YAAM,UAAU,GAAG,KAAK,YAAY,CAAC,IAAI,OAAO,UAAU,EAAE,SAAS,GAAG,GAAG,CAAC;AAC5E,UAAI,CAAC,aAAa,IAAI,OAAO,GAAG;AAC9B,qBAAa,IAAI,SAAS,CAAC,CAAC;AAAA,MAC9B;AACA,mBAAa,IAAI,OAAO,EAAG,KAAK,KAAK;AAAA,IACvC;AAGA,QAAI,mBAAmB;AACvB,eAAW,CAAC,EAAE,WAAW,KAAK,eAAe;AAC3C,YAAM,UAAU,YAAY,OAAO,CAACA,MAAK,UAAUA,OAAM,MAAM,IAAI,CAAC;AACpE,UAAI,UAAU,EAAG;AAAA,IACnB;AACA,UAAM,iBAAiB,cAAc,OAAO,IAAK,mBAAmB,cAAc,OAAQ,MAAM;AAGhG,QAAI,kBAAkB;AACtB,eAAW,CAAC,EAAE,UAAU,KAAK,cAAc;AACzC,YAAM,SAAS,WAAW,OAAO,CAACA,MAAK,UAAUA,OAAM,MAAM,IAAI,CAAC;AAClE,UAAI,SAAS,EAAG;AAAA,IAClB;AACA,UAAM,gBAAgB,aAAa,OAAO,IAAK,kBAAkB,aAAa,OAAQ,MAAM;AAE5F,WAAO,EAAE,gBAAgB,cAAc;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA,EAKQ,sBAAsB,QAAiB,iBAA6C;AAE1F,WAAO,KAAK,+BAA+B,QAAQ,eAAe,EAAE,IAAI,OAAK,EAAE,MAAM;AAAA,EACvF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,+BAA+B,QAAiB,iBAA0D;AAChH,QAAI,mBAAmB,gBAAgB,SAAS,GAAG;AACjD,aAAO,gBAAgB,IAAI,WAAS;AAElC,cAAM,gBAAgB,MAAM,eAAe,MAAM;AACjD,cAAM,cAAc,gBAAgB,IAAI,MAAM,UAAU,gBAAgB;AACxE,eAAO;AAAA,UACL,MAAM,IAAI,KAAK,MAAM,IAAI;AAAA,UACzB,QAAQ;AAAA,QACV;AAAA,MACF,CAAC;AAAA,IACH;AAGA,UAAM,eAAe,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM;AAC9C,YAAM,cAAc,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ;AACtF,UAAI,gBAAgB,EAAG,QAAO;AAC9B,aAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AAAA,IAChD,CAAC;AAED,UAAM,eAAsC,CAAC;AAC7C,UAAM,eAAe,oBAAI,IAA6C;AAGtE,eAAW,SAAS,cAAc;AAChC,YAAM,YAAY,IAAI,KAAK,MAAM,UAAU;AAC3C,YAAM,UAAU,UAAU,YAAY,EAAE,MAAM,GAAG,EAAE,CAAC;AACpD,UAAI,CAAC,aAAa,IAAI,OAAO,GAAG;AAC9B,qBAAa,IAAI,SAAS,EAAE,MAAM,WAAW,QAAQ,CAAC,EAAE,CAAC;AAAA,MAC3D;AACA,mBAAa,IAAI,OAAO,EAAG,OAAO,KAAK,KAAK;AAAA,IAC9C;AAGA,UAAM,iBAAiB,0BAAyB,wBAAwB,MAAM;AAC9E,QAAI,iBAAiB;AAGrB,UAAM,iBAAiB,MAAM,KAAK,aAAa,KAAK,CAAC,EAAE,KAAK;AAE5D,eAAW,WAAW,gBAAgB;AACpC,YAAM,EAAE,MAAM,QAAQ,UAAU,IAAI,aAAa,IAAI,OAAO;AAC5D,YAAM,QAAQ,UAAU,OAAO,CAACA,MAAK,UAAUA,OAAM,MAAM,IAAI,CAAC;AAChE,UAAI,iBAAiB,GAAG;AACtB,qBAAa,KAAK;AAAA,UAChB;AAAA,UACA,QAAQ,QAAQ;AAAA,QAClB,CAAC;AACD,0BAAkB;AAAA,MACpB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgC;AACtC,WAAO;AAAA,MACL,aAAa;AAAA,MACb,SAAS;AAAA,MACT,eAAe;AAAA,MACf,cAAc;AAAA,MACd,iBAAiB;AAAA,MACjB,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,aAAa;AAAA,MACb,cAAc;AAAA,MACd,aAAa;AAAA,MACb,MAAM;AAAA,MACN,iBAAiB;AAAA,MACjB,cAAc;AAAA,MACd,eAAe;AAAA,MACf,eAAe;AAAA,MACf,gBAAgB;AAAA,MAChB,gBAAgB;AAAA,MAChB,eAAe;AAAA,MACf,aAAa;AAAA,MACb,YAAY;AAAA,MACZ,kBAAkB;AAAA,MAClB,OAAO;AAAA,MACP,cAAc;AAAA,MACd,gBAAgB;AAAA,IAClB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,OAAO,wBAAwB,QAAiB,iBAA2C;AACzF,QAAI,OAAO,WAAW,EAAG,QAAO;AAGhC,QAAI,mBAAmB,gBAAgB,SAAS,GAAG;AACjD,YAAM,gBAAgB,CAAC,GAAG,eAAe,EAAE;AAAA,QAAK,CAAC,GAAG,MAClD,IAAI,KAAK,EAAE,IAAI,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,IAAI,EAAE,QAAQ;AAAA,MACxD;AACA,YAAM,aAAa,cAAc,CAAC;AAGlC,aAAO,WAAW,eAAe,WAAW;AAAA,IAC9C;AAIA,UAAM,eAAe,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM;AAC9C,YAAM,cAAc,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ;AACtF,UAAI,gBAAgB,EAAG,QAAO;AAC9B,aAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AAAA,IAChD,CAAC;AAED,UAAM,aAAa,aAAa,CAAC;AACjC,WAAO,WAAW,eAAe,WAAW;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,8BAA8B,QAAiB,YAAkB,gBAAiC;AACvG,QAAI,mBAAmB,QAAW;AAChC,uBAAiB,KAAK,wBAAwB,MAAM;AAAA,IACtD;AAEA,UAAM,iBAAiB,OAAO,OAAO,WAAS;AAC5C,YAAM,YAAY,IAAI,KAAK,MAAM,UAAU;AAC3C,aAAO,aAAa;AAAA,IACtB,CAAC;AAED,UAAM,UAAU,eAAe,OAAO,CAACA,MAAK,UAAUA,OAAM,MAAM,IAAI,CAAC;AACvE,WAAO,iBAAiB;AAAA,EAC1B;AAEF;;;ACt0BO,IAAM,wBAAN,MAA4B;AAAA;AAAA;AAAA;AAAA;AAAA,EAKjC,OAAO,4BAA4B,QAAiB,kBAAwD;AAC1G,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO;AAAA,QACL,cAAc,CAAC;AAAA,QACf,cAAc,CAAC;AAAA,QACf,WAAW,CAAC;AAAA,QACZ,UAAU,CAAC;AAAA,QACX,SAAS,CAAC;AAAA,MACZ;AAAA,IACF;AAGA,UAAM,eAAe,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM;AAC9C,YAAM,cAAc,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ;AACtF,UAAI,gBAAgB,EAAG,QAAO;AAC9B,aAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AAAA,IAChD,CAAC;AAGD,UAAM,eAAe,KAAK,sBAAsB,YAAY;AAG5D,UAAM,eAAe,KAAK,sBAAsB,YAAY;AAG5D,UAAM,UAAU,KAAK,oBAAoB,cAAc,OAAO;AAC9D,UAAM,WAAW,KAAK,oBAAoB,cAAc,QAAQ;AAChE,UAAM,YAAY,KAAK,oBAAoB,cAAc,SAAS;AAElE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,sBAAsB,cAIlC;AACD,UAAM,SAAyE,CAAC;AAChF,QAAI,eAAe;AAGnB,UAAM,eAAe,oBAAI,IAAqB;AAE9C,iBAAa,QAAQ,WAAS;AAC5B,YAAM,UAAU,IAAI,KAAK,MAAM,UAAU,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE,CAAC;AACrE,UAAI,CAAC,aAAa,IAAI,OAAO,GAAG;AAC9B,qBAAa,IAAI,SAAS,CAAC,CAAC;AAAA,MAC9B;AACA,mBAAa,IAAI,OAAO,EAAG,KAAK,KAAK;AAAA,IACvC,CAAC;AAGD,UAAM,cAAc,MAAM,KAAK,aAAa,KAAK,CAAC,EAAE,KAAK;AAEzD,gBAAY,QAAQ,UAAQ;AAC1B,YAAM,YAAY,aAAa,IAAI,IAAI;AACvC,YAAM,QAAQ,UAAU,OAAO,CAACK,MAAK,UAAUA,OAAM,MAAM,IAAI,CAAC;AAChE,sBAAgB;AAEhB,aAAO,KAAK;AAAA,QACV;AAAA,QACA,cAAc;AAAA,QACd,SAAS;AAAA,MACX,CAAC;AAAA,IACH,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,sBAAsB,cAIlC;AACD,UAAM,SAAkE,CAAC;AACzE,QAAI,OAAO;AAEX,iBAAa,QAAQ,WAAS;AAC5B,UAAI,MAAM,eAAe,MAAM;AAC7B,eAAO,MAAM;AAAA,MACf;AAEA,YAAM,WAAW,OAAO,KAAK,MAAM,eAAe,QAAQ,OAAO;AAEjE,aAAO,KAAK;AAAA,QACV,MAAM,MAAM;AAAA,QACZ;AAAA,QACA;AAAA,MACF,CAAC;AAAA,IACH,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,oBAAoB,QAAiB,QAA4C;AAC9F,UAAM,SAAiC,CAAC;AAExC,WAAO,QAAQ,WAAS;AACtB,YAAM,OAAO,IAAI,KAAK,MAAM,UAAU;AACtC,YAAM,MAAM,KAAK,WAAW,MAAM,MAAM;AAExC,UAAI,CAAC,OAAO,GAAG,GAAG;AAChB,eAAO,GAAG,IAAI;AAAA,MAChB;AACA,aAAO,GAAG,KAAK,MAAM;AAAA,IACvB,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,WAAW,MAAY,QAA4B;AAChE,UAAM,OAAO,KAAK,YAAY;AAC9B,UAAM,QAAQ,KAAK,SAAS,IAAI;AAChC,UAAM,MAAM,KAAK,QAAQ;AAEzB,YAAQ,QAAQ;AAAA,MACd,KAAK;AACH,eAAO,GAAG,IAAI,IAAI,OAAO,KAAK,EAAE,SAAS,GAAG,GAAG,CAAC,IAAI,OAAO,GAAG,EAAE,SAAS,GAAG,GAAG,CAAC;AAAA,MAElF,KAAK;AACH,cAAM,aAAa,KAAK,cAAc,IAAI;AAC1C,eAAO,GAAG,IAAI,KAAK,OAAO,UAAU,EAAE,SAAS,GAAG,GAAG,CAAC;AAAA,MAExD,KAAK;AACH,eAAO,GAAG,IAAI,IAAI,OAAO,KAAK,EAAE,SAAS,GAAG,GAAG,CAAC;AAAA,MAElD,KAAK;AACH,eAAO,KAAK,SAAS;AAAA,MAEvB;AACE,eAAO,KAAK,YAAY,EAAE,MAAM,GAAG,EAAE,CAAC;AAAA,IAC1C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,cAAc,MAAoB;AAC/C,UAAM,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK,YAAY,GAAG,KAAK,SAAS,GAAG,KAAK,QAAQ,CAAC,CAAC;AAChF,UAAM,SAAS,EAAE,UAAU,KAAK;AAChC,MAAE,WAAW,EAAE,WAAW,IAAI,IAAI,MAAM;AACxC,UAAM,YAAY,IAAI,KAAK,KAAK,IAAI,EAAE,eAAe,GAAG,GAAG,CAAC,CAAC;AAC7D,WAAO,KAAK,OAAQ,EAAE,QAAQ,IAAI,UAAU,QAAQ,KAAK,QAAY,KAAK,CAAC;AAAA,EAC7E;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,wBAAwB,QAAiB,gBAAiD;AAC/F,QAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AAEjC,QAAI,CAAC,gBAAgB;AACnB,YAAM,aAAa,OAAO,KAAK,CAAC,GAAG,MAAM,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC;AAC/G,uBAAiB,WAAW,eAAe,WAAW;AAAA,IACxD;AAEA,UAAM,YAAY,KAAK,oBAAoB,QAAQ,SAAS;AAC5D,UAAM,iBAAyC,CAAC;AAEhD,QAAI,iBAAiB;AACrB,UAAM,eAAe,OAAO,KAAK,SAAS,EAAE,KAAK;AAEjD,iBAAa,QAAQ,WAAS;AAC5B,YAAM,UAAU,UAAU,KAAK;AAC/B,YAAM,cAAc,iBAAiB,IAAK,UAAU,iBAAkB,MAAM;AAC5E,qBAAe,KAAK,IAAI;AACxB,wBAAkB;AAAA,IACpB,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,uBACL,QACA,aAAqB,IACoB;AACzC,QAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AAEjC,UAAM,UAAU,KAAK,oBAAoB,QAAQ,OAAO;AACxD,UAAM,cAAc,OAAO,KAAK,OAAO,EAAE,KAAK;AAE9C,QAAI,YAAY,SAAS,WAAY,QAAO,CAAC;AAE7C,UAAM,SAAkD,CAAC;AAEzD,aAAS,IAAI,aAAa,GAAG,IAAI,YAAY,QAAQ,KAAK;AACxD,YAAM,cAAc,YAAY,MAAM,IAAI,aAAa,GAAG,IAAI,CAAC;AAC/D,YAAM,gBAAgB,YAAY,IAAI,UAAQ,QAAQ,IAAI,CAAC;AAI3D,YAAM,gBAAgB,YAAY,IAAI,CAAC,MAAM,QAAQ;AACnD,cAAM,aAAa,qBAAqB,IAAI;AAC5C,cAAM,oBAAoB,aAAa,MAAM;AAC7C,eAAO,cAAc,GAAG,IAAI;AAAA,MAC9B,CAAC;AAED,YAAM,kBAAkB,cAAc,OAAO,CAACA,MAAK,QAAQA,OAAM,KAAK,CAAC,IAAI,cAAc;AAEzF,YAAM,YAAY;AAClB,YAAM,iBAAiB,cAAc,OAAO,CAACA,MAAK,QAAQA,OAAM,KAAK,IAAI,MAAM,WAAW,CAAC,GAAG,CAAC,KAAK,cAAc,SAAS;AAC3H,YAAM,SAAS,KAAK,KAAK,cAAc;AAEvC,YAAM,SAAS,SAAS,IAAK,kBAAkB,SAAU,KAAK,KAAK,GAAG,IAAI;AAE1E,aAAO,KAAK;AAAA,QACV,MAAM,YAAY,CAAC;AAAA,QACnB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,iBAAiB,QAKtB;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO;AAAA,QACL,kBAAkB;AAAA,QAClB,mBAAmB;AAAA,QACnB,eAAe,EAAE,MAAM,QAAQ,QAAQ,EAAE;AAAA,QACzC,eAAe,CAAC;AAAA,MAClB;AAAA,IACF;AAEA,UAAM,eAAe,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM;AAC9C,YAAM,cAAc,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ;AACtF,UAAI,gBAAgB,EAAG,QAAO;AAC9B,aAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AAAA,IAChD,CAAC;AAED,QAAI,mBAAmB;AACvB,QAAI,oBAAoB;AACxB,QAAI,sBAAsB;AAC1B,QAAI,oBAA6C;AACjD,QAAI,kBAAkB;AAEtB,UAAM,gBAAqG,CAAC;AAE5G,iBAAa,QAAQ,CAAC,OAAO,UAAU;AACrC,YAAM,YAA4B,MAAM,KAAK,IAAI,QAAQ;AACzD,YAAM,YAAY,IAAI,KAAK,MAAM,UAAU,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE,CAAC;AAEvE,UAAI,cAAc,mBAAmB;AAEnC;AAAA,MACF,OAAO;AAEL,YAAI,sBAAsB,UAAU,sBAAsB,GAAG;AAC3D,gBAAM,gBAAgB,aAAa,QAAQ,CAAC,IAAI,IAAI,KAAK,aAAa,QAAQ,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE,CAAC,IAAI;AAC3H,wBAAc,KAAK;AAAA,YACjB,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,WAAW;AAAA,YACX,SAAS;AAAA,UACX,CAAC;AAGD,cAAI,sBAAsB,OAAO;AAC/B,+BAAmB,KAAK,IAAI,kBAAkB,mBAAmB;AAAA,UACnE,OAAO;AACL,gCAAoB,KAAK,IAAI,mBAAmB,mBAAmB;AAAA,UACrE;AAAA,QACF;AAGA,4BAAoB;AACpB,8BAAsB;AACtB,0BAAkB;AAAA,MACpB;AAAA,IACF,CAAC;AAGD,QAAI,sBAAsB,UAAU,sBAAsB,GAAG;AAC3D,YAAM,gBAAgB,IAAI,KAAK,aAAa,aAAa,SAAS,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE,CAAC;AAC3G,oBAAc,KAAK;AAAA,QACjB,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,SAAS;AAAA,MACX,CAAC;AAED,UAAI,sBAAsB,OAAO;AAC/B,2BAAmB,KAAK,IAAI,kBAAkB,mBAAmB;AAAA,MACnE,OAAO;AACL,4BAAoB,KAAK,IAAI,mBAAmB,mBAAmB;AAAA,MACrE;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,eAAe,EAAE,MAAM,mBAAmB,QAAQ,oBAAoB;AAAA,MACtE;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,wBAAwB,QAAiB,aAAqB,KAA6B;AAChG,UAAM,eAAuC,CAAC;AAE9C,WAAO,QAAQ,WAAS;AACtB,YAAM,SAAS,KAAK,MAAM,MAAM,KAAK,UAAU,IAAI;AACnD,YAAM,MAAM,GAAG,MAAM,OAAO,SAAS,aAAa,CAAC;AAEnD,UAAI,CAAC,aAAa,GAAG,GAAG;AACtB,qBAAa,GAAG,IAAI;AAAA,MACtB;AACA,mBAAa,GAAG;AAAA,IAClB,CAAC;AAED,WAAO;AAAA,EACT;AACF;;;ACtTO,SAAS,eAAe,GAAmB;AAChD,MAAI,KAAK,KAAK,KAAK,GAAG;AACpB,UAAM,IAAI,MAAM,4CAA4C,CAAC,EAAE;AAAA,EACjE;AAGA,QAAM,IAAI;AAAA,IACR;AAAA,IAAsB;AAAA,IAAqB;AAAA,IAC3C;AAAA,IAAqB;AAAA,IAAsB;AAAA,EAC7C;AAEA,QAAM,IAAI;AAAA,IACR;AAAA,IAAsB;AAAA,IAAqB;AAAA,IAC3C;AAAA,IAAqB;AAAA,EACvB;AAEA,QAAM,IAAI;AAAA,IACR;AAAA,IAAuB;AAAA,IAAuB;AAAA,IAC9C;AAAA,IAAsB;AAAA,IAAqB;AAAA,EAC7C;AAEA,QAAM,IAAI;AAAA,IACR;AAAA,IAAsB;AAAA,IAAsB;AAAA,IAC5C;AAAA,EACF;AAIA,QAAM,OAAO;AACb,QAAM,QAAQ,IAAI;AAElB,MAAI;AACJ,MAAI;AAEJ,MAAI,IAAI,MAAM;AAEZ,QAAI,KAAK,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC;AAC9B,gBACO,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,SAC/D,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI;AAAA,EAEvD,WAAW,KAAK,OAAO;AAErB,QAAI,IAAI;AACR,QAAI,IAAI;AACR,gBACQ,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAClE,SACG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI;AAAA,EAEpE,OAAO;AAEL,QAAI,KAAK,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC;AAClC,WACE,OACO,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,SAC/D,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI;AAAA,EAGzD;AACF;AAYO,SAAS,eAAe,OAAiB,GAAqB;AACnE,SAAO,MAAM,IAAI,CAAC,UAAU,OAAO,OAAO,CAAC;AAC7C;AAWO,SAAS,SAAS,QAA4B;AACnD,QAAM,UAAU,OAAO,IAAI,CAAC,OAAO,WAAW,EAAE,OAAO,MAAM,EAAE;AAC/D,UAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAExC,QAAM,QAAQ,IAAI,MAAM,OAAO,MAAM;AACrC,MAAI,IAAI;AAER,SAAO,IAAI,QAAQ,QAAQ;AACzB,QAAI,IAAI;AAER,WAAO,IAAI,QAAQ,UAAU,QAAQ,CAAC,EAAE,UAAU,QAAQ,CAAC,EAAE,OAAO;AAClE;AAAA,IACF;AAKA,UAAM,eAAe,IAAI,IAAI,KAAK;AAClC,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAM,QAAQ,CAAC,EAAE,KAAK,IAAI;AAAA,IAC5B;AAEA,QAAI;AAAA,EACN;AAEA,SAAO;AACT;AAiBO,SAAS,6BAA6B,QAA4B;AACvE,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,CAAC;AAAA,EACV;AAEA,MAAI,OAAO,WAAW,GAAG;AAEvB,WAAO,CAAC,CAAC;AAAA,EACX;AAEA,QAAM,IAAI,OAAO;AACjB,QAAM,QAAQ,SAAS,MAAM;AAC7B,QAAM,UAAU,eAAe,OAAO,CAAC;AAEvC,SAAO,QAAQ,IAAI,CAAC,MAAM,eAAe,CAAC,CAAC;AAC7C;AAoBO,SAAS,WAAW,GAAa,GAAqB;AAC3D,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,GAAG;AACzC,WAAO;AAAA,EACT;AAEA,QAAM,IAAI,EAAE;AAGZ,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,CAAC,OAAO,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,SAAS,EAAE,CAAC,CAAC,GAAG;AACpD,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,aAAa;AACjB,MAAI,aAAa;AACjB,MAAI,QAAQ;AACZ,MAAI,QAAQ;AAGZ,WAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,aAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,YAAM,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;AACxB,YAAM,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;AAExB,UAAI,UAAU,KAAK,UAAU,GAAG;AAE9B;AAAA,MACF,WAAW,UAAU,GAAG;AAEtB;AAAA,MACF,WAAW,UAAU,GAAG;AAEtB;AAAA,MACF,WAAW,QAAQ,QAAQ,GAAG;AAE5B;AAAA,MACF,OAAO;AAEL;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,YAAY,aAAa;AAC/B,QAAM,cAAc,KAAK;AAAA,KACtB,aAAa,aAAa,UAAU,aAAa,aAAa;AAAA,EACjE;AAEA,MAAI,gBAAgB,GAAG;AACrB,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,YAAY;AAG3B,MAAI,CAAC,OAAO,SAAS,MAAM,GAAG;AAC5B,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAgBO,SAAS,oBAAoB,KAAqB;AACvD,SAAO,KAAK,IAAK,KAAK,KAAK,MAAO,CAAC;AACrC;;;AC1PO,SAAS,2BACd,QACA,UAA8B,CAAC,GACZ;AACnB,QAAM;AAAA,IACJ,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,gBAAgB;AAAA,IAChB,YAAY;AAAA,IACZ,aAAa;AAAA,EACf,IAAI;AAGJ,QAAM,uBAA+D,uBAAO,OAAO,IAAI;AAEvF,aAAW,SAAS,QAAQ;AAE1B,QAAI,CAAC,MAAM,YAAY,MAAM,SAAS,KAAK,MAAM,IAAI;AACnD;AAAA,IACF;AAEA,QAAI,cAAc,YAAY,CAAC,MAAM,YAAY;AAC/C;AAAA,IACF;AAEA,UAAM,WAAW,MAAM;AACvB,UAAM,UAAU,gBAAgB,OAAO,SAAS;AAChD,UAAM,mBAAmB,gBAAgB,OAAO,aAAa;AAE7D,QAAI,qBAAqB,MAAM;AAC7B;AAAA,IACF;AAEA,QAAI,CAAC,qBAAqB,QAAQ,GAAG;AACnC,2BAAqB,QAAQ,IAAI,uBAAO,OAAO,IAAI;AAAA,IACrD;AAEA,yBAAqB,QAAQ,EAAE,OAAO,KACnC,qBAAqB,QAAQ,EAAE,OAAO,KAAK,KAAK;AAAA,EACrD;AAGA,QAAM,kBAA0D,CAAC;AACjE,aAAW,YAAY,OAAO,KAAK,oBAAoB,GAAG;AACxD,oBAAgB,QAAQ,IAAI;AAAA,MAC1B,qBAAqB,QAAQ;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAGA,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,WAAW,OAAO,OAAO,eAAe,GAAG;AACpD,eAAW,aAAa,OAAO,KAAK,OAAO,GAAG;AAC5C,eAAS,IAAI,SAAS;AAAA,IACxB;AAAA,EACF;AAEA,QAAM,aAAa,OAAO,KAAK,eAAe,EAAE,KAAK;AAGrD,MAAI,WAAW,SAAS,GAAG;AACzB,UAAM,iBAAiB,WAAW;AAAA,MAAI,CAAC,GAAG,MACxC,WAAW,IAAI,CAACC,IAAG,MAAO,MAAM,IAAI,IAAM,GAAI;AAAA,IAChD;AACA,UAAM,mBAAmB,WAAW,IAAI,CAAC,aAAa;AAAA,MACpD,OAAO,KAAK,gBAAgB,QAAQ,CAAC,EAAE;AAAA,IACzC,CAAC;AACD,WAAO,EAAE,YAAY,iBAAiB,gBAAgB,aAAa,iBAAiB;AAAA,EACtF;AAEA,QAAM,kBAA8B,CAAC;AACrC,QAAM,cAA0B,CAAC;AAEjC,QAAM,gBAAgB,cAAc,aAChC,MAAM,KAAK,QAAQ,EAAE,KAAK,IAC1B,CAAC;AAEL,QAAM,oBAA8C,CAAC;AACrD,MAAI,cAAc,YAAY;AAC5B,eAAW,YAAY,YAAY;AACjC,wBAAkB,QAAQ,IAAI,cAAc;AAAA,QAC1C,CAAC,WAAW,gBAAgB,QAAQ,EAAE,MAAM,KAAK;AAAA,MACnD;AAAA,IACF;AAAA,EACF;AAEA,aAAW,aAAa,YAAY;AAClC,UAAM,MAAgB,CAAC;AACvB,UAAM,YAAsB,CAAC;AAE7B,eAAW,aAAa,YAAY;AAClC,UAAI,cAAc,WAAW;AAC3B,YAAI,KAAK,CAAG;AAEZ,kBAAU,KAAK,OAAO,KAAK,gBAAgB,SAAS,CAAC,EAAE,MAAM;AAC7D;AAAA,MACF;AAEA,UAAI,WAAqB,CAAC;AAC1B,UAAI,WAAqB,CAAC;AAC1B,UAAI,qBAAqB;AAEzB,UAAI,cAAc,YAAY;AAC5B,mBAAW,kBAAkB,SAAS;AACtC,mBAAW,kBAAkB,SAAS;AAEtC,cAAM,gBAAgB,gBAAgB,SAAS;AAC/C,cAAM,gBAAgB,gBAAgB,SAAS;AAC/C,mBAAW,UAAU,OAAO,KAAK,aAAa,GAAG;AAC/C,cAAI,UAAU,eAAe;AAC3B;AAAA,UACF;AAAA,QACF;AAAA,MACF,OAAO;AACL,cAAM,gBAAgB,gBAAgB,SAAS;AAC/C,cAAM,gBAAgB,gBAAgB,SAAS;AAE/C,mBAAW,UAAU,OAAO,KAAK,aAAa,GAAG;AAC/C,cAAI,UAAU,eAAe;AAC3B,qBAAS,KAAK,cAAc,MAAM,CAAC;AACnC,qBAAS,KAAK,cAAc,MAAM,CAAC;AAAA,UACrC;AAAA,QACF;AACA,6BAAqB,SAAS;AAAA,MAChC;AAGA,gBAAU,KAAK,kBAAkB;AAGjC,UAAI,SAAS,SAAS,GAAG;AACvB,YAAI,KAAK,GAAG;AACZ;AAAA,MACF;AAEA,UAAI;AACJ,UAAI,WAAW,WAAW;AACxB,sBAAc,mBAAmB,UAAU,QAAQ;AAAA,MACrD,WAAW,WAAW,YAAY;AAChC,sBAAc,oBAAoB,UAAU,QAAQ;AAAA,MACtD,OAAO;AAEL,sBAAc,mBAAmB,UAAU,QAAQ;AAAA,MACrD;AAEA,UAAI,KAAK,WAAW;AAAA,IACtB;AAEA,oBAAgB,KAAK,GAAG;AACxB,gBAAY,KAAK,SAAS;AAAA,EAC5B;AAEA,SAAO,EAAE,YAAY,iBAAiB,YAAY;AACpD;AAKA,SAAS,mBAAmB,GAAa,GAAqB;AAC5D,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAG,QAAO;AAEpD,QAAM,QAAQ,KAAK,CAAC;AACpB,QAAM,QAAQ,KAAK,CAAC;AAEpB,MAAI,YAAY;AAChB,MAAI,cAAc;AAClB,MAAI,cAAc;AAElB,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAM,QAAQ,EAAE,CAAC,IAAI;AACrB,UAAM,QAAQ,EAAE,CAAC,IAAI;AAErB,iBAAa,QAAQ;AACrB,mBAAe,QAAQ;AACvB,mBAAe,QAAQ;AAAA,EACzB;AAEA,QAAM,cAAc,KAAK,KAAK,cAAc,WAAW;AAEvD,MAAI,gBAAgB,EAAG,QAAO;AAE9B,SAAO,YAAY;AACrB;AAKA,SAAS,oBAAoB,GAAa,GAAqB;AAC7D,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAG,QAAO;AAGpD,QAAM,QAAQ,SAAS,CAAC;AACxB,QAAM,QAAQ,SAAS,CAAC;AAGxB,SAAO,mBAAmB,OAAO,KAAK;AACxC;AAKA,SAAS,mBAAmB,GAAa,GAAqB;AAC5D,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAG,QAAO;AAEpD,MAAI,aAAa;AACjB,MAAI,aAAa;AAEjB,WAAS,IAAI,GAAG,IAAI,EAAE,SAAS,GAAG,KAAK;AACrC,aAAS,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACrC,YAAM,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;AACxB,YAAM,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;AAExB,UAAK,QAAQ,KAAK,QAAQ,KAAO,QAAQ,KAAK,QAAQ,GAAI;AACxD;AAAA,MACF,WAAY,QAAQ,KAAK,QAAQ,KAAO,QAAQ,KAAK,QAAQ,GAAI;AAC/D;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,IAAI,EAAE;AACZ,QAAM,cAAe,KAAK,IAAI,KAAM;AAEpC,MAAI,gBAAgB,EAAG,QAAO;AAE9B,UAAQ,aAAa,cAAc;AACrC;AAKA,SAAS,gBACP,OACA,MACe;AACf,UAAQ,MAAM;AAAA,IACZ,KAAK,UAAU;AACb,UAAI,CAAC,MAAM,WAAW;AACpB,eAAO;AAAA,MACT;AACA,aAAO,MAAM,KAAK,MAAM;AAAA,IAC1B;AAAA,IACA,KAAK,YAAY;AACf,YAAM,WAAW,KAAK;AAAA,SACnB,MAAM,gBAAgB,MAAM,MAAM,gBAAgB;AAAA,MACrD;AACA,UAAI,CAAC,UAAU;AACb,eAAO;AAAA,MACT;AACA,aAAO,MAAM,KAAK;AAAA,IACpB;AAAA,IACA;AACE,aAAO,MAAM;AAAA,EACjB;AACF;AAEA,SAAS,gBACP,OACA,OACQ;AACR,QAAM,OAAO,UAAU,WAAW,MAAM,aAAa,MAAM;AAE3D,MAAI,CAAC,MAAM;AACT,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAIA,QAAM,OAAO,KAAK,YAAY;AAC9B,QAAM,QAAQ,OAAO,KAAK,SAAS,IAAI,CAAC,EAAE,SAAS,GAAG,GAAG;AACzD,QAAM,MAAM,OAAO,KAAK,QAAQ,CAAC,EAAE,SAAS,GAAG,GAAG;AAClD,SAAO,GAAG,IAAI,IAAI,KAAK,IAAI,GAAG;AAChC;AAKA,SAAS,cAAc,SAAyB;AAC9C,QAAM,CAAC,SAAS,UAAU,MAAM,IAAI,QAAQ,MAAM,GAAG;AACrD,QAAM,OAAO,OAAO,OAAO;AAC3B,QAAM,QAAQ,OAAO,QAAQ,IAAI;AACjC,QAAM,MAAM,OAAO,MAAM;AAGzB,QAAM,OAAO,IAAI,KAAK,KAAK,IAAI,MAAM,OAAO,GAAG,CAAC;AAIhD,QAAM,WAAW,IAAI,KAAK,KAAK,QAAQ,CAAC;AACxC,QAAM,YAAY,SAAS,UAAU,KAAK;AAC1C,WAAS,WAAW,SAAS,WAAW,KAAK,IAAI,UAAU;AAE3D,QAAM,YAAY,IAAI,KAAK,KAAK,IAAI,SAAS,eAAe,GAAG,GAAG,CAAC,CAAC;AACpE,QAAM,UAAU,KAAK;AAAA,MACjB,SAAS,QAAQ,IAAI,UAAU,QAAQ,KAAK,QAAW,KAAK;AAAA,EAChE;AAEA,SAAO,GAAG,SAAS,eAAe,CAAC,KAAK,OAAO,OAAO,EAAE,SAAS,GAAG,GAAG,CAAC;AAC1E;AAKA,SAAS,YAAY,SAAyB;AAC5C,SAAO,QAAQ,UAAU,GAAG,CAAC;AAC/B;AAKA,SAAS,kBACP,cACA,QACwB;AACxB,MAAI,WAAW,QAAS,QAAO;AAE/B,QAAM,aAAqC,CAAC;AAC5C,QAAM,SAAS,WAAW,WAAW,gBAAgB;AAErD,aAAW,CAAC,SAAS,KAAK,KAAK,OAAO,QAAQ,YAAY,GAAG;AAC3D,UAAM,YAAY,OAAO,OAAO;AAChC,eAAW,SAAS,KAAK,WAAW,SAAS,KAAK,KAAK;AAAA,EACzD;AAEA,SAAO;AACT;;;AC1VA,IAAM,4BAA4B;AAIlC,IAAM,uBAAuB;AAC7B,IAAM,oBAAoB;AAK1B,IAAM,8BAA8B;AAOpC,SAAS,uBACP,eACA,mBACQ;AAGR,QAAM,mBAAmB,gBAAgB;AACzC,QAAM,gBAAgB,KAAK,KAAK,mBAAmB,GAAG;AAEtD,SAAO,KAAK,IAAI,6BAA6B,aAAa;AAC5D;AASO,SAAS,wBACd,QACA,UAAmC,CAAC,GACZ;AACxB,QAAM,YAAY,YAAY,IAAI;AAElC,QAAM;AAAA,IACJ,eAAe,mBAAmB;AAAA,IAClC,iBAAiB;AAAA,IACjB,gBAAgB;AAAA,IAChB,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA,mBAAmB,uBAAuB;AAAA,EAC5C,IAAI;AAIJ,QAAM,gBAAgB,KAAK,IAAI,MAAM,KAAK,IAAI,MAAM,gBAAgB,CAAC;AAErE,QAAM,oBAAoB,KAAK,IAAI,KAAK,KAAK,IAAI,MAAM,oBAAoB,CAAC;AAG5E,MAAI,iBAAiB;AAErB,MAAI,cAAc;AAChB,qBAAiB,eAAe,OAAO,CAAC,MAAM;AAG5C,YAAM,UAAU,EAAE,QAAQ;AAC1B,aAAO,QAAQ,YAAY,EAAE,SAAS,aAAa,YAAY,CAAC;AAAA,IAClE,CAAC;AAAA,EACH;AAEA,MAAI,kBAAkB,eAAe,SAAS,GAAG;AAC/C,UAAM,YAAY,IAAI,IAAI,cAAc;AACxC,qBAAiB,eAAe;AAAA,MAC9B,CAAC,MAAM,EAAE,YAAY,UAAU,IAAI,EAAE,QAAQ;AAAA,IAC/C;AAAA,EACF;AAGA,MAAI,WAAW,QAAQ,WAAW,IAAI;AACpC,qBAAiB,eAAe,OAAO,CAAC,MAAM;AAC5C,YAAM,YACJ,cAAc,WACV,IAAI,KAAK,EAAE,UAAU,IACrB,EAAE,aACA,IAAI,KAAK,EAAE,UAAU,IACrB;AAER,UAAI,CAAC,UAAW,QAAO;AAEvB,UAAI,UAAU,QAAQ,YAAY,UAAU,KAAM,QAAO;AACzD,UAAI,UAAU,IAAI;AAEhB,cAAM,aAAa,IAAI,KAAK,UAAU,EAAE;AACxC,mBAAW,SAAS,IAAI,IAAI,IAAI,GAAG;AACnC,YAAI,YAAY,WAAY,QAAO;AAAA,MACrC;AAEA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAGA,QAAM,UAAU;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAGA,MAAI,QAAQ,WAAW,SAAS,GAAG;AACjC,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,QAAQ,MAAM,SAAS,gBAAgB;AACzC,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,qBAAqB,QAAQ,QAAQ;AAAA,IAAI,CAAC,oBAC9C,6BAA6B,eAAe;AAAA,EAC9C;AAGA,QAAM,0BAA0B,yBAAyB,kBAAkB;AAG3E,QAAM,EAAE,aAAa,cAAc,mBAAmB,iBAAiB,IACrE,qBAAqB,yBAAyB,iBAAiB;AAGjE,QAAM,sBAAsB;AAAA,IAC1B;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,EACF;AAGA,QAAM,YAAY;AAAA,IAChB,oBAAoB;AAAA,IACpB,QAAQ;AAAA,EACV;AAGA,QAAM,wBAAwB;AAAA,IAC5B;AAAA,IACA,oBAAoB;AAAA,IACpB;AAAA,IACA,QAAQ;AAAA,EACV;AAEA,QAAM,UAAU,YAAY,IAAI;AAEhC,SAAO;AAAA,IACL,YAAY,QAAQ;AAAA,IACpB,iBAAiB,QAAQ,MAAM;AAAA,IAC/B,WAAW;AAAA,MACT,OAAO,IAAI,KAAK,QAAQ,MAAM,CAAC,CAAC;AAAA,MAChC,KAAK,IAAI,KAAK,QAAQ,MAAM,QAAQ,MAAM,SAAS,CAAC,CAAC;AAAA,IACvD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,qBAAqB,oBAAoB;AAAA,IACzC,uBAAuB,oBAAoB;AAAA,IAC3C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY,oBAAI,KAAK;AAAA,IACrB,mBAAmB,UAAU;AAAA,EAC/B;AACF;AAKA,SAAS,yBACP,QACA,eACA,WACwB;AAExB,QAAM,uBAA+D,uBAAO,OAAO,IAAI;AACvF,QAAM,WAAW,oBAAI,IAAY;AAEjC,aAAW,SAAS,QAAQ;AAE1B,QAAI,CAAC,MAAM,YAAY,MAAM,SAAS,KAAK,MAAM,IAAI;AACnD;AAAA,IACF;AAEA,QAAI,cAAc,YAAY,CAAC,MAAM,YAAY;AAC/C;AAAA,IACF;AAEA,UAAM,WAAW,MAAM;AACvB,UAAM,OAAO,cAAc,WAAW,MAAM,aAAa,MAAM;AAE/D,QAAI,CAAC,MAAM;AACT;AAAA,IACF;AAEA,UAAM,UAAU,KAAK,YAAY,EAAE,MAAM,GAAG,EAAE,CAAC;AAC/C,UAAM,mBAAmBC,iBAAgB,OAAO,aAAa;AAE7D,QAAI,qBAAqB,MAAM;AAC7B;AAAA,IACF;AAEA,QAAI,CAAC,qBAAqB,QAAQ,GAAG;AACnC,2BAAqB,QAAQ,IAAI,uBAAO,OAAO,IAAI;AAAA,IACrD;AAEA,yBAAqB,QAAQ,EAAE,OAAO,KACnC,qBAAqB,QAAQ,EAAE,OAAO,KAAK,KAAK;AAEnD,aAAS,IAAI,OAAO;AAAA,EACtB;AAEA,QAAM,aAAa,OAAO,KAAK,oBAAoB,EAAE,KAAK;AAE1D,MAAI,WAAW,SAAS,GAAG;AACzB,WAAO;AAAA,MACL;AAAA,MACA,OAAO,CAAC;AAAA,MACR,SAAS,WAAW,IAAI,MAAM,CAAC,CAAC;AAAA,MAChC,YAAY,WAAW,IAAI,MAAM,CAAC,CAAC;AAAA,IACrC;AAAA,EACF;AAKA,QAAM,cAAc,MAAM,KAAK,QAAQ,EAAE,KAAK;AAI9C,QAAM,UAAsB,CAAC;AAC7B,QAAM,aAA0B,CAAC;AAEjC,aAAW,YAAY,YAAY;AACjC,UAAM,kBAA4B,CAAC;AACnC,UAAM,eAA0B,CAAC;AAEjC,eAAW,QAAQ,aAAa;AAC9B,YAAM,SAAS,QAAQ,qBAAqB,QAAQ;AACpD,mBAAa,KAAK,MAAM;AACxB,sBAAgB,KAAK,SAAS,qBAAqB,QAAQ,EAAE,IAAI,IAAI,CAAC;AAAA,IACxE;AAEA,YAAQ,KAAK,eAAe;AAC5B,eAAW,KAAK,YAAY;AAAA,EAC9B;AAEA,SAAO;AAAA,IACL;AAAA,IACA,OAAO;AAAA,IACP;AAAA,IACA;AAAA,EACF;AACF;AAMA,SAASA,iBACP,OACA,MACe;AACf,MAAI;AAEJ,UAAQ,MAAM;AAAA,IACZ,KAAK,UAAU;AACb,UAAI,CAAC,MAAM,aAAa,MAAM,cAAc,GAAG;AAC7C,eAAO;AAAA,MACT;AACA,eAAS,MAAM,KAAK,MAAM;AAC1B;AAAA,IACF;AAAA,IACA,KAAK,YAAY;AACf,YAAM,WAAW,KAAK;AAAA,SACnB,MAAM,gBAAgB,MAAM,MAAM,gBAAgB;AAAA,MACrD;AACA,UAAI,CAAC,YAAY,aAAa,GAAG;AAC/B,eAAO;AAAA,MACT;AACA,eAAS,MAAM,KAAK;AACpB;AAAA,IACF;AAAA,IACA;AACE,eAAS,MAAM;AAAA,EACnB;AAGA,MAAI,CAAC,OAAO,SAAS,MAAM,GAAG;AAC5B,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAWA,SAAS,yBAAyB,oBAA4C;AAC5E,QAAM,IAAI,mBAAmB;AAC7B,QAAM,oBAAgC,CAAC;AAEvC,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,MAAgB,CAAC;AACvB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,MAAM,GAAG;AACX,YAAI,KAAK,CAAG;AAAA,MACd,OAAO;AAEL,cAAM,MAAM,WAAW,mBAAmB,CAAC,GAAG,mBAAmB,CAAC,CAAC;AACnE,YAAI,KAAK,oBAAoB,GAAG,CAAC;AAAA,MACnC;AAAA,IACF;AACA,sBAAkB,KAAK,GAAG;AAAA,EAC5B;AAEA,SAAO;AACT;AAKA,SAAS,qBACP,mBACA,oBAA4B,KAM5B;AACA,QAAM,IAAI,kBAAkB;AAE5B,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,MACL,aAAa,CAAC;AAAA,MACd,cAAc,CAAC;AAAA,MACf,mBAAmB,CAAC;AAAA,MACpB,kBAAkB;AAAA,IACpB;AAAA,EACF;AAEA,MAAI;AAEF,UAAM,SAAS,KAAK,OAAO,iBAAiB,CAAC;AAG7C,QAAI,cAAwB,CAAC;AAE7B,UAAM,YACJ,MAAM,QAAQ,OAAO,MAAM,IACvB,OAAO,SACN,OAAO,OAAwC,QAAQ;AAG9D,eAAW,OAAO,WAAW;AAC3B,UAAI,OAAO,QAAQ,UAAU;AAC3B,oBAAY,KAAK,GAAG;AAAA,MACtB,WAAW,OAAO,OAAO,QAAQ,YAAY,QAAQ,KAAK;AACxD,oBAAY,KAAK,IAAI,EAAE;AAAA,MACzB;AAAA,IACF;AASA,UAAM,aAAa,OAAO;AAC1B,QAAI,eAA2B,CAAC;AAEhC,eAAW,MAAM,YAAY;AAC3B,YAAM,WAAW,GAAG,OAAO,QAAQ;AACnC,YAAM,MAAM,SAAS,IAAI,CAAC,MAAO,OAAO,MAAM,WAAW,IAAI,EAAE,EAAG;AAClE,mBAAa,KAAK,GAAG;AAAA,IACvB;AAGA,UAAM,UAAU,YAAY,IAAI,CAAC,KAAK,SAAS,EAAE,KAAK,IAAI,EAAE;AAC5D,YAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;AAEpC,kBAAc,QAAQ,IAAI,CAAC,SAAS,KAAK,GAAG;AAC5C,mBAAe,QAAQ,IAAI,CAAC,SAAS,aAAa,KAAK,GAAG,CAAC;AAG3D,UAAM,gBAAgB,YAAY,OAAO,CAACC,MAAK,QAAQA,OAAM,KAAK,CAAC;AACnE,QAAI,aAAa;AACjB,UAAM,oBAAoB,YAAY,IAAI,CAAC,QAAQ;AACjD,oBAAc,MAAM;AACpB,aAAO;AAAA,IACT,CAAC;AAGD,QAAI,mBAAmB,YAAY;AACnC,aAAS,IAAI,GAAG,IAAI,kBAAkB,QAAQ,KAAK;AACjD,UAAI,kBAAkB,CAAC,KAAK,mBAAmB;AAC7C,2BAAmB,IAAI;AACvB;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF,SAAS,OAAO;AAEd,YAAQ;AAAA,MACN;AAAA,MACA;AAAA,IACF;AACA,WAAO;AAAA,MACL,aAAa,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AAAA,MAChC,cAAc,kBAAkB;AAAA,QAAI,CAAC,GAAG,MACtC,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,CAACC,IAAG,MAAO,MAAM,IAAI,IAAI,CAAE;AAAA,MACtD;AAAA,MACA,mBAAmB,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,OAAO,IAAI,KAAK,CAAC;AAAA,MACjE,kBAAkB;AAAA,IACpB;AAAA,EACF;AACF;AAqBA,SAAS,sBACP,oBACA,YACA,eACqB;AACrB,QAAM,IAAI,mBAAmB;AAC7B,QAAM,IAAI,mBAAmB,CAAC,GAAG,UAAU;AAE3C,MAAI,MAAM,KAAK,MAAM,GAAG;AACtB,WAAO,EAAE,QAAQ,CAAC,GAAG,mBAAmB,EAAE;AAAA,EAC5C;AAIA,QAAM,kBAA4B,mBAAmB,IAAI,CAAC,SAAS,MAAM;AAEvE,UAAM,gBAAgB,QAAQ,OAAO,CAAC,GAAG,MAAM,WAAW,CAAC,EAAE,CAAC,CAAC;AAC/D,UAAM,UAAU,cAAc;AAE9B,QAAI,YAAY,GAAG;AACjB,aAAO;AAAA,IACT;AAEA,UAAM,SAAS,CAAC,GAAG,aAAa,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACtD,UAAM,MAAM,iBAAiB,UAAU;AACvC,UAAM,QAAQ,KAAK,MAAM,GAAG;AAC5B,UAAM,QAAQ,KAAK,KAAK,GAAG;AAC3B,UAAM,OAAO,MAAM;AAEnB,QAAI,UAAU,SAAS,SAAS,SAAS;AACvC,aAAO,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,UAAU,CAAC,CAAC,CAAC;AAAA,IACzD;AACA,WAAO,OAAO,KAAK,KAAK,IAAI,QAAQ,OAAO,KAAK,IAAI;AAAA,EACtD,CAAC;AAMD,QAAM,SAAsB,mBAAmB;AAAA,IAAI,CAAC,SAAS,MAC3D,QAAQ,IAAI,CAAC,KAAK,MAAM,WAAW,CAAC,EAAE,CAAC,KAAK,OAAO,gBAAgB,CAAC,CAAC;AAAA,EACvE;AAGA,QAAM,sBAAkC,CAAC;AACzC,MAAI,oBAAoB;AAExB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,MAAgB,CAAC;AACvB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,MAAM,GAAG;AACX,YAAI,KAAK,CAAG;AACZ;AAAA,MACF;AAGA,UAAI,oBAAoB;AACxB,UAAI,aAAa;AACjB,UAAI,uBAAuB;AAE3B,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,YAAI,WAAW,CAAC,EAAE,CAAC,KAAK,WAAW,CAAC,EAAE,CAAC,GAAG;AACxC;AACA,cAAI,OAAO,CAAC,EAAE,CAAC,GAAG;AAChB;AACA,gBAAI,OAAO,CAAC,EAAE,CAAC,GAAG;AAChB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAGA,YAAM,aAAa;AAAA,QACjB;AAAA,QACA;AAAA,MACF;AAGA,UAAI,uBAAuB,YAAY;AACrC,YAAI,KAAK,GAAG;AACZ;AAAA,MACF,OAAO;AAEL,cAAM,YAAY,aAAa;AAC/B,YAAI,KAAK,SAAS;AAAA,MACpB;AAAA,IACF;AACA,wBAAoB,KAAK,GAAG;AAAA,EAC9B;AAEA,SAAO,EAAE,QAAQ,qBAAqB,kBAAkB;AAC1D;AAKA,SAAS,2BACP,qBACA,YACmB;AACnB,QAAM,IAAI,WAAW;AAErB,MAAI,IAAI,GAAG;AACT,WAAO;AAAA,MACL,sBAAsB,EAAE,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,EAAE;AAAA,MACjD,qBAAqB,EAAE,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,EAAE;AAAA,MAChD,sBAAsB;AAAA,MACtB,kBAAkB;AAAA,IACpB;AAAA,EACF;AAEA,MAAI,UAAU,EAAE,OAAO,WAAW,MAAM,CAAC,IAAI,EAAE,EAAsB;AACrE,MAAI,SAAS,EAAE,OAAO,UAAU,MAAM,CAAC,IAAI,EAAE,EAAsB;AACnE,MAAID,OAAM;AACV,MAAI,aAAa;AACjB,MAAI,gBAAgB;AAEpB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAG9B,YAAM,QAAQ,oBAAoB,CAAC,EAAE,CAAC;AACtC,YAAM,QAAQ,oBAAoB,CAAC,EAAE,CAAC;AAGtC,UAAI,OAAO,MAAM,KAAK,KAAK,OAAO,MAAM,KAAK,GAAG;AAC9C;AAAA,MACF;AAEA,YAAM,SAAS,QAAQ,SAAS;AAEhC,MAAAA,QAAO;AACP;AAEA,UAAI,QAAQ,QAAQ,OAAO;AACzB,kBAAU,EAAE,OAAO,MAAM,CAAC,WAAW,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE;AAAA,MAC1D;AACA,UAAI,QAAQ,OAAO,OAAO;AACxB,iBAAS,EAAE,OAAO,MAAM,CAAC,WAAW,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE;AAAA,MACzD;AACA,UAAI,QAAQ,2BAA2B;AACrC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,MAAI,eAAe,GAAG;AACpB,WAAO;AAAA,MACL,sBAAsB,EAAE,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,EAAE;AAAA,MACjD,qBAAqB,EAAE,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,EAAE;AAAA,MAChD,sBAAsB;AAAA,MACtB,kBAAkB;AAAA,IACpB;AAAA,EACF;AAEA,SAAO;AAAA,IACL,sBAAsB;AAAA,IACtB,qBAAqB;AAAA,IACrB,sBAAsBA,OAAM;AAAA,IAC5B,kBAAkB,gBAAgB;AAAA,EACpC;AACF;AAKA,SAAS,+BACP,0BACA,qBACA,cACA,YACwB;AAGxB,QAAM,IAAI,WAAW;AAErB,MAAI,MAAM,KAAK,aAAa,WAAW,GAAG;AACxC,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,gBAAwC,CAAC;AAG/C,QAAM,mBAAmB,aAAa,CAAC,KAAK,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AAC/D,QAAM,iBAAiB,iBAAiB;AAAA,IACtC,CAACA,MAAK,QAAQA,OAAM,KAAK,IAAI,GAAG;AAAA,IAChC;AAAA,EACF;AAEA,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,UAAM,qBACJ,iBAAiB,IACb,KAAK,IAAI,iBAAiB,CAAC,CAAC,IAAI,iBAChC,IAAI;AAGV,QAAI,eAAe;AACnB,QAAI,aAAa;AACjB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,MAAM,GAAG;AACX,cAAM,QAAQ,oBAAoB,CAAC,EAAE,CAAC;AACtC,cAAM,QAAQ,oBAAoB,CAAC,EAAE,CAAC;AAGtC,YAAI,CAAC,OAAO,MAAM,KAAK,KAAK,CAAC,OAAO,MAAM,KAAK,GAAG;AAChD,2BAAiB,QAAQ,SAAS;AAClC;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,UAAM,oBAAoB,aAAa,IAAI,eAAe,aAAa;AAIvE,UAAM,wBACH,qBAAqB,uBACpB,oBAAoB,qBACtB;AAEF,kBAAc,KAAK;AAAA,MACjB,UAAU,WAAW,CAAC;AAAA,MACtB;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAGA,gBAAc,KAAK,CAAC,GAAG,MAAM,EAAE,uBAAuB,EAAE,oBAAoB;AAE5E,SAAO;AACT;AAKA,SAAS,kBACP,SACA,eACA,mBACA,WACwB;AACxB,QAAM,IAAI,QAAQ,WAAW;AAC7B,QAAME,YAAW,QAAQ,WAAW;AAAA,IAAI,CAAC,GAAG,MAC1C,QAAQ,WAAW,IAAI,CAACD,IAAG,MAAO,MAAM,IAAI,IAAM,CAAI;AAAA,EACxD;AAEA,SAAO;AAAA,IACL,YAAY,QAAQ;AAAA,IACpB,iBAAiB,QAAQ,MAAM;AAAA,IAC/B,WAAW;AAAA,MACT,OAAO,QAAQ,MAAM,SAAS,IAAI,IAAI,KAAK,QAAQ,MAAM,CAAC,CAAC,IAAI,oBAAI,KAAK;AAAA,MACxE,KACE,QAAQ,MAAM,SAAS,IACnB,IAAI,KAAK,QAAQ,MAAM,QAAQ,MAAM,SAAS,CAAC,CAAC,IAChD,oBAAI,KAAK;AAAA,IACjB;AAAA,IACA;AAAA,IACA;AAAA,IACA,yBAAyBC;AAAA,IACzB,qBAAqBA;AAAA,IACrB,uBAAuB;AAAA,IACvB,aAAa,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AAAA,IAChC,cAAcA;AAAA,IACd,mBAAmB,IAAI,MAAM,CAAC,EAC3B,KAAK,CAAC,EACN,IAAI,CAAC,GAAG,OAAO,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,CAAC;AAAA,IACzC,kBAAkB;AAAA,IAClB,WAAW;AAAA,MACT,sBAAsB,EAAE,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,EAAE;AAAA,MACjD,qBAAqB,EAAE,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,EAAE;AAAA,MAChD,sBAAsB;AAAA,MACtB,kBAAkB;AAAA,IACpB;AAAA,IACA,uBAAuB,QAAQ,WAAW,IAAI,CAAC,cAAc;AAAA,MAC3D;AAAA,MACA,sBAAsB,MAAM,KAAK,IAAI,GAAG,CAAC;AAAA,MACzC,oBAAoB,IAAI,KAAK,IAAI,GAAG,CAAC;AAAA,MACrC,mBAAmB;AAAA,IACrB,EAAE;AAAA,IACF,YAAY,oBAAI,KAAK;AAAA,IACrB,mBAAmB,YAAY,IAAI,IAAI;AAAA,EACzC;AACF;;;ACtvBA,IAAM,SAAS,KAAK,KAAK,KAAK;;;AC0E9B,IAAMC,UAAS,KAAK,KAAK,KAAK;;;AC5CvB,SAAS,iBAAiB,QAAmB,WAA+B;AACjF,QAAM,OAAO;AAAA,IACX,YAAY,OAAO;AAAA,IACnB,gBAAgB,OAAO,SAAS,IAAK,OAAO,CAAC,GAA+B,aAAa;AAAA,IACzF,eAAe,OAAO,SAAS,IAAK,OAAO,OAAO,SAAS,CAAC,GAA+B,aAAa;AAAA,IACxG,eAAe,WAAW,UAAU;AAAA,EACtC;AAEA,SAAO,KAAK,KAAK,UAAU,IAAI,CAAC;AAClC;AAGO,IAAM,0BAAN,MAA8B;AAAA,EAC3B,QAAQ,oBAAI,IAA8B;AAAA;AAAA;AAAA;AAAA,EAKlD,MAAM,aACJ,SACA,QACA,WACAC,SAMC;AACD,UAAM,YAAY,KAAK,IAAI;AAG3B,UAAM,WAAW,iBAAiB,QAAQ,SAAS;AACnD,UAAM,SAAS,KAAK,MAAM,IAAI,OAAO;AAErC,QAAI,UAAU,OAAO,aAAa,UAAU;AAC1C,aAAO;AAAA,QACL,gBAAgB,OAAO;AAAA,QACvB,eAAe,OAAO;AAAA,QACtB,oBAAoB,OAAO;AAAA,QAC3B,iBAAiB,KAAK,IAAI,IAAI;AAAA,MAChC;AAAA,IACF;AAGA,UAAM,aAAa,IAAI,yBAAyBA,OAAiC;AACjF,UAAM,iBAAiB,WAAW,wBAAwB,QAAmB,SAA4B;AACzG,UAAM,gBAAgB,WAAW,uBAAuB,MAAiB;AACzE,UAAM,qBAAqB,sBAAsB,4BAA4B,QAAmB,SAA4B;AAG5H,SAAK,MAAM,IAAI,SAAS;AAAA,MACtB;AAAA,MACA;AAAA,MACA;AAAA,MACA,gBAAgB,oBAAI,KAAK;AAAA,MACzB;AAAA,IACF,CAAC;AAED,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,iBAAiB,KAAK,IAAI,IAAI;AAAA,IAChC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,SAAuB;AAChC,SAAK,MAAM,OAAO,OAAO;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,gBAAsB;AACpB,SAAK,MAAM,MAAM;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA,EAKA,eAAuB;AACrB,WAAO,KAAK,MAAM;AAAA,EACpB;AACF;AAGO,IAAM,0BAA0B,IAAI,wBAAwB;;;AC3F5D,IAAM,iCAAyD;AAAA,EACpE,uBAAuB;AAAA,EACvB,kBAAkB;AAAA,EAClB,aAAa;AAAA,EACb,oBAAoB;AAAA,EACpB,MAAM;AACR;;;ACpCA,IAAM,wBAAwB,CAAC,WAAW,cAAc,aAAa;AAK9D,SAAS,YAAY,SAA4B;AACtD,QAAM,QAAQ,QAAQ,IAAI,OAAK,EAAE,YAAY,EAAE,KAAK,CAAC;AACrD,SAAO,sBAAsB,MAAM,SAAO,MAAM,SAAS,GAAG,CAAC;AAC/D;AAOA,SAAS,aAAa,SAA8B;AAClD,MAAI,CAAC,WAAW,QAAQ,KAAK,MAAM,GAAI,QAAO;AAG9C,QAAM,WAAW,QAAQ,MAAM,0BAA0B;AACzD,MAAI,UAAU;AACZ,UAAM,CAAC,EAAE,MAAM,OAAO,GAAG,IAAI;AAC7B,WAAO,IAAI,KAAK,SAAS,IAAI,GAAG,SAAS,KAAK,IAAI,GAAG,SAAS,GAAG,CAAC;AAAA,EACpE;AAGA,QAAM,UAAU,QAAQ,MAAM,gCAAgC;AAC9D,MAAI,SAAS;AACX,UAAM,CAAC,EAAE,OAAO,KAAK,IAAI,IAAI;AAC7B,WAAO,IAAI,KAAK,SAAS,IAAI,GAAG,SAAS,KAAK,IAAI,GAAG,SAAS,GAAG,CAAC;AAAA,EACpE;AAEA,SAAO;AACT;AAMA,SAAS,cAAc,SAAqC;AAC1D,MAAI,CAAC,WAAW,QAAQ,KAAK,MAAM,GAAI,QAAO;AAG9C,MAAI,UAAU,KAAK,QAAQ,KAAK,CAAC,EAAG,QAAO,QAAQ,KAAK;AAGxD,QAAM,QAAQ,QAAQ,MAAM,oBAAoB;AAChD,MAAI,CAAC,MAAO,QAAO;AAEnB,QAAM,QAAQ,SAAS,MAAM,CAAC,GAAG,EAAE;AACnC,QAAM,UAAU,MAAM,CAAC;AACvB,QAAM,SAAS,SAAS,KAAK,OAAO;AACpC,QAAM,eAAe,QAAQ,MAAM;AAEnC,SAAO,GAAG,YAAY,IAAI,OAAO,IAAI,MAAM;AAC7C;AAWO,SAAS,mBAAmB,KAAqC;AACtE,QAAM,UAAU,IAAI,oBAAoB,IAAI,KAAK;AACjD,QAAM,aAAa,IAAI,aAAa,IAAI,KAAK;AAC7C,QAAM,YAAY,IAAI,YAAY,IAAI,KAAK;AAC3C,QAAM,aAAa,IAAI,aAAa,IAAI,KAAK;AAC7C,QAAM,WAAW,IAAI,WAAW,IAAI,KAAK;AACzC,QAAM,YAAY,IAAI,YAAY,IAAI,KAAK;AAE3C,QAAM,YAAY,CAAC,MAAc,MAAM,MAAM,MAAM;AAGnD,QAAM,aAAuB,CAAC;AAC9B,MAAI,UAAU,QAAQ,EAAG,YAAW,KAAK,GAAG,QAAQ,GAAG;AACvD,MAAI,UAAU,SAAS,EAAG,YAAW,KAAK,GAAG,SAAS,GAAG;AACzD,QAAM,WAAW,WAAW,KAAK,GAAG;AAGpC,QAAM,YAAsB,CAAC;AAC7B,MAAI,UAAU,OAAO,EAAG,WAAU,KAAK,GAAG,OAAO,GAAG;AACpD,MAAI,UAAU,QAAQ,EAAG,WAAU,KAAK,GAAG,QAAQ,GAAG;AACtD,QAAM,UAAU,UAAU,KAAK,GAAG;AAGlC,QAAM,SAAS,SAAS,GAAG,MAAM,MAAM;AACvC,QAAM,SAAS,YAAY,IAAI,SAAS,KAAK;AAE7C,MAAI,YAAY,SAAS;AACvB,WAAO,GAAG,MAAM,GAAG,QAAQ,MAAM,OAAO,GAAG,MAAM;AAAA,EACnD;AACA,MAAI,SAAU,QAAO,GAAG,MAAM,GAAG,QAAQ,GAAG,MAAM;AAClD,MAAI,QAAS,QAAO,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM;AAEhD,SAAO,aAAa;AACtB;AAMA,SAAS,YAAY,OAA2B,cAA+B;AAC7E,MAAI,CAAC,SAAS,MAAM,KAAK,MAAM,MAAM,MAAM,YAAY,MAAM,OAAO;AAClE,WAAO,gBAAgB;AAAA,EACzB;AACA,QAAM,UAAU,MAAM,QAAQ,UAAU,EAAE,EAAE,KAAK;AACjD,QAAM,SAAS,WAAW,OAAO;AACjC,SAAO,MAAM,MAAM,IAAK,gBAAgB,IAAK;AAC/C;AAUA,SAAS,iBAAiB,KAAqD;AAC7E,QAAM,SAAiC,CAAC;AACxC,aAAW,OAAO,OAAO,KAAK,GAAG,GAAG;AAClC,WAAO,IAAI,YAAY,CAAC,IAAI;AAAA,EAC9B;AAEA,QAAM,gBAAgB;AAAA,IACpB;AAAA,IAAY;AAAA,IAAQ;AAAA,IAAa;AAAA,IAAY;AAAA,IAC7C;AAAA,IAAc;AAAA,IAAc;AAAA,IAAc;AAAA,IAAa;AAAA,IACvD;AAAA,IAAgB;AAAA,IAAO;AAAA,IAAY;AAAA,IAAY;AAAA,IAC/C;AAAA,IAAoB;AAAA,IAAa;AAAA,IAAY;AAAA,IAAa;AAAA,IAAW;AAAA,EACvE;AAEA,QAAM,aAAqC,EAAE,GAAG,IAAI;AACpD,aAAW,aAAa,eAAe;AACrC,QAAI,EAAE,aAAa,aAAa;AAC9B,YAAM,SAAS,OAAO,UAAU,YAAY,CAAC;AAC7C,UAAI,OAAQ,YAAW,SAAS,IAAI,IAAI,MAAM;AAAA,IAChD;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,8BACd,KACuB;AAEvB,QAAM,iBAAiB,GAAG;AAG1B,QAAM,aAAa,aAAa,IAAI,QAAQ,KAAK,aAAa,IAAI,IAAI;AACtE,MAAI,CAAC,cAAc,MAAM,WAAW,QAAQ,CAAC,EAAG,QAAO;AAGvD,QAAM,SAAS,IAAI,cAAc,IAAI,KAAK;AAC1C,MAAI,CAAC,MAAO,QAAO;AAGnB,QAAM,aAAa,aAAa,IAAI,SAAS,KAAK;AAGlD,QAAM,aAAa,cAAc,IAAI,QAAQ,KAAK,cAAc,IAAI,UAAU;AAC9E,QAAM,aAAa,cAAc,IAAI,SAAS,KAAK,cAAc,IAAI,UAAU;AAE/E,QAAM,OAAO,mBAAmB,GAAG;AAEnC,QAAM,MAAM,YAAY,IAAI,KAAK,CAAC;AAElC,SAAO;AAAA;AAAA,IAEL,WAAW,IAAI,YAAY,IAAI,YAAY,IAAI,KAAK,KAAK;AAAA,IACzD;AAAA,IACA;AAAA,IACA,cAAc;AAAA;AAAA,IACd;AAAA,IACA,gBAAgB,QAAQ,IAAI,YAAY,IAAI,YAAY,IAAI,MAAM,YAAY,IAAI,YAAY;AAAA;AAAA,IAC9F,cAAc;AAAA;AAAA,IACd,IAAI,YAAY,IAAI,UAAU;AAAA,IAC9B,cAAc,IAAI,aAAa,YAAY,IAAI,UAAU,IAAI;AAAA,IAC7D;AAAA,IACA;AAAA,IACA,iBAAiB,IAAI,UAAU,IAAI,KAAK,KAAK;AAAA,EAC/C;AACF;;;AChNA,IAAM,aAAa,MAAO,KAAK,KAAK;;;ACMpC,YAAYC,SAAQ;AACpB,YAAYC,WAAU;AAoBtB,SAAS,aAAa,MAAwB;AAC5C,QAAM,SAAmB,CAAC;AAC1B,MAAI,UAAU;AACd,MAAI,WAAW;AAEf,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,OAAO,KAAK,CAAC;AAEnB,QAAI,SAAS,KAAK;AAChB,UAAI,YAAY,KAAK,IAAI,CAAC,MAAM,KAAK;AACnC,mBAAW;AACX;AAAA,MACF,OAAO;AACL,mBAAW,CAAC;AAAA,MACd;AAAA,IACF,WAAW,SAAS,OAAO,CAAC,UAAU;AACpC,aAAO,KAAK,QAAQ,KAAK,CAAC;AAC1B,gBAAU;AAAA,IACZ,OAAO;AACL,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,SAAO,KAAK,QAAQ,KAAK,CAAC;AAC1B,SAAO;AACT;AAKA,eAAe,eAAe,UAAqC;AACjE,QAAM,UAAU,MAAS,aAAS,UAAU,OAAO;AACnD,QAAM,YAAY,QAAQ,QAAQ,WAAW,EAAE,EAAE,MAAM,IAAI,EAAE,CAAC,KAAK;AACnE,SAAO,aAAa,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,CAAC;AAClE;AAMA,eAAsB,cAAc,UAAoC;AACtE,MAAI;AACF,UAAM,UAAU,MAAM,eAAe,QAAQ;AAK7C,UAAM,kBAAkB,CAAC,OAAO,OAAO,eAAe,IAAI;AAC1D,UAAM,uBAAuB;AAAA,MAC3B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,UAAM,QAAQ,gBAAgB,KAAK,CAAC,UAAU,QAAQ,SAAS,KAAK,CAAC;AAErE,UAAM,sBAAsB,qBAAqB;AAAA,MAAO,CAAC,QACvD,QAAQ,KAAK,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC;AAAA,IACrC;AAEA,QAAI,SAAS,oBAAoB,UAAU,GAAG;AAI5C,YAAM,uBAAuB,CAAC,mBAAmB,kBAAkB,qBAAqB;AACxF,YAAM,mBAAmB,qBAAqB;AAAA,QAAK,CAAC,QAClD,QAAQ,KAAK,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC;AAAA,MACrC;AACA,UAAI,kBAAkB;AACpB,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAIA,UAAM,gBAAgB,QAAQ;AAAA,MAC5B,CAAC,MAAM,MAAM,UAAW,EAAE,SAAS,MAAM,KAAK,CAAC,EAAE,SAAS,QAAQ,KAAK,CAAC,EAAE,SAAS,QAAQ;AAAA,IAC7F;AACA,UAAM,qBAAqB;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,UAAM,WAAW,mBAAmB;AAAA,MAAK,CAAC,UACxC,QAAQ,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,KAAK,MAAM,SAAS,CAAC,CAAC;AAAA,IAC5D;AAGA,QAAI,iBAAiB,YAAY,oBAAoB,SAAS,GAAG;AAC/D,aAAO;AAAA,IACT;AAIA,UAAM,eAAe,CAAC,WAAW,cAAc,aAAa;AAC5D,UAAM,QAAQ,aAAa,MAAM,CAAC,QAAQ,QAAQ,SAAS,GAAG,CAAC;AAC/D,QAAI,OAAO;AACT,aAAO;AAAA,IACT;AAIA,UAAM,mBAAmB,OAAO,KAAK,8BAA8B,EAAE;AAAA,MACnE,CAAC,MAAM,EAAE,YAAY;AAAA,IACvB;AACA,UAAM,sBAAsB,iBAAiB;AAAA,MAAK,CAAC,UACjD,QAAQ,SAAS,KAAK;AAAA,IACxB;AACA,UAAM,cAAc,QAAQ;AAAA,MAC1B,CAAC,MAAM,EAAE,SAAS,QAAQ,KAAK,EAAE,SAAS,GAAG;AAAA,IAC/C;AACA,UAAM,mBACJ,QAAQ,SAAS,UAAU,KAC3B,QAAQ,KAAK,CAAC,MAAM,EAAE,SAAS,UAAU,CAAC;AAE5C,QAAI,eAAe,uBAAuB,kBAAkB;AAE1D,UAAI,CAAC,SAAS,aAAa;AACzB,eAAO;AAAA,MACT;AAAA,IACF;AAGA,QAAI,SAAS,oBAAoB,UAAU,GAAG;AAC5C,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAMA,eAAsB,iBACpB,YAC4D;AAC5D,QAAM,WAAwB,CAAC;AAC/B,QAAM,eAAyB,CAAC;AAEhC,MAAI;AACF,UAAM,UAAU,MAAS,YAAQ,YAAY,EAAE,eAAe,KAAK,CAAC;AACpE,UAAM,WAAW,QACd,OAAO,CAAC,MAAM,EAAE,OAAO,KAAK,EAAE,KAAK,YAAY,EAAE,SAAS,MAAM,CAAC,EACjE,IAAI,CAAC,MAAM,EAAE,IAAI;AAGpB,QAAI,SAAS,SAAS,cAAc,GAAG;AACrC,eAAS,WAAW;AAAA,IACtB;AACA,QAAI,SAAS,SAAS,cAAc,GAAG;AACrC,eAAS,WAAW;AAAA,IACtB;AACA,QAAI,SAAS,SAAS,kBAAkB,GAAG;AACzC,eAAS,eAAe;AAAA,IAC1B;AAGA,QAAI,CAAC,SAAS,cAAc;AAC1B,YAAM,kBAAkB,SAAS,KAAK,CAAC,MAAM;AAC3C,cAAM,QAAQ,EAAE,YAAY;AAC5B,eACE,MAAM,SAAS,oBAAoB,KACnC,MAAM,SAAS,aAAa,KAC5B,MAAM,WAAW,cAAc;AAAA,MAEnC,CAAC;AACD,UAAI,iBAAiB;AACnB,iBAAS,eAAe;AAAA,MAC1B;AAAA,IACF;AAGA,eAAW,WAAW,UAAU;AAE9B,UACE,YAAY,kBACZ,YAAY,kBACZ,YAAY,sBACZ,YAAY,SAAS,cACrB;AACA;AAAA,MACF;AAEA,YAAM,UAAe,WAAK,YAAY,OAAO;AAC7C,YAAM,eAAe,MAAM,cAAc,OAAO;AAEhD,UAAI,cAAc;AAEhB,YAAI,iBAAiB,cAAc,CAAC,SAAS,UAAU;AACrD,mBAAS,WAAW;AAAA,QACtB,WAAW,iBAAiB,cAAc,CAAC,SAAS,UAAU;AAC5D,mBAAS,WAAW;AAAA,QACtB,WAAW,iBAAiB,kBAAkB,CAAC,SAAS,cAAc;AACpE,mBAAS,eAAe;AAAA,QAC1B,OAAO;AAEL,uBAAa,KAAK,OAAO;AAAA,QAC3B;AAAA,MACF,OAAO;AACL,qBAAa,KAAK,OAAO;AAAA,MAC3B;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AAEA,SAAO,EAAE,UAAU,aAAa;AAClC;AAKO,SAAS,uBACd,YACA,UACM;AACN,UAAQ,MAAM,oBAAoB,UAAU,2DAA2D;AACvG,UAAQ,MAAM,YAAY,SAAS,KAAK,IAAI,CAAC,EAAE;AAC/C,UAAQ,MAAM,qEAAqE;AACrF;;;A/HrMA,SAAS,+BAA+B,SAAuB;AAC7D,QAAM,QAAQ,QAAQ,MAAM,2BAA2B;AACvD,MAAI,OAAO;AACT,UAAM,CAAC,EAAE,MAAM,OAAO,GAAG,IAAI;AAC7B,WAAO,IAAI,KAAK,SAAS,IAAI,GAAG,SAAS,KAAK,IAAI,GAAG,SAAS,GAAG,CAAC;AAAA,EACpE;AACA,SAAO,IAAI,KAAK,OAAO;AACzB;AAKA,SAASC,aACP,OACA,cACQ;AACR,MAAI,CAAC,SAAS,MAAM,KAAK,MAAM,MAAM,MAAM,YAAY,MAAM,OAAO;AAClE,QAAI,iBAAiB,OAAW,QAAO;AACvC,WAAO;AAAA,EACT;AACA,QAAM,UAAU,MAAM,QAAQ,UAAU,EAAE,EAAE,KAAK;AACjD,QAAM,SAAS,WAAW,OAAO;AACjC,SAAO,MAAM,MAAM,IAAI,gBAAgB,IAAI;AAC7C;AAEA,IAAM,sBAAsB,oBAAI,IAAI;AAAA,EAClC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAKD,SAAS,SAAS,SAA2C;AAE3D,QAAM,QAAQ,QAAQ,QAAQ,WAAW,EAAE,EAAE,KAAK,EAAE,MAAM,IAAI;AAC9D,MAAI,MAAM,SAAS,EAAG,QAAO,CAAC;AAE9B,QAAM,UAAUC,cAAa,MAAM,CAAC,CAAC;AACrC,QAAM,UAAoC,CAAC;AAE3C,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,SAASA,cAAa,MAAM,CAAC,CAAC;AACpC,QAAI,OAAO,WAAW,EAAG;AAEzB,UAAM,SAAiC,CAAC;AACxC,YAAQ,QAAQ,CAAC,QAAQ,QAAQ;AAC/B,aAAO,MAAM,IAAI,OAAO,GAAG,KAAK;AAAA,IAClC,CAAC;AACD,YAAQ,KAAK,MAAM;AAAA,EACrB;AAEA,SAAO;AACT;AAKA,SAASA,cAAa,MAAwB;AAC5C,QAAM,SAAmB,CAAC;AAC1B,MAAI,UAAU;AACd,MAAI,WAAW;AAEf,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,OAAO,KAAK,CAAC;AAEnB,QAAI,SAAS,KAAK;AAChB,UAAI,YAAY,KAAK,IAAI,CAAC,MAAM,KAAK;AACnC,mBAAW;AACX;AAAA,MACF,OAAO;AACL,mBAAW,CAAC;AAAA,MACd;AAAA,IACF,WAAW,SAAS,OAAO,CAAC,UAAU;AACpC,aAAO,KAAK,QAAQ,KAAK,CAAC;AAC1B,gBAAU;AAAA,IACZ,OAAO;AACL,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,SAAO,KAAK,QAAQ,KAAK,CAAC;AAC1B,SAAO;AACT;AAKA,SAAS,eAAe,KAA6B,SAAgC;AACnF,MAAI;AACF,UAAM,aAAa,+BAA+B,IAAI,aAAa,CAAC;AACpE,QAAI,MAAM,WAAW,QAAQ,CAAC,EAAG,QAAO;AAExC,UAAM,aAAa,IAAI,aAAa,IAChC,+BAA+B,IAAI,aAAa,CAAC,IACjD;AAEJ,UAAM,YAAY,IAAI,UAAU,KAAK,IAAI,KAAK,KAAK,WAAW;AAE9D,UAAM,cAAc,IAAI,SAAS,KAAK,IAAI,QAAQ,SAAS,EAAE,EAAE,KAAK;AACpE,UAAM,mBACJ,cAAc,CAAC,WAAW,SAAS,GAAG,IAAI,UAAU;AACtD,UAAM,OAAO,IAAI,MAAM,KAAK,IAAI,QAAQ,KAAK;AAE7C,UAAM,QAAe;AAAA,MACnB;AAAA,MACA,YAAY,IAAI,aAAa,KAAK;AAAA,MAClC,cAAcD,aAAY,IAAI,eAAe,CAAC;AAAA,MAC9C;AAAA,MACA,SAASA,aAAY,IAAI,SAAS,CAAC;AAAA,MACnC;AAAA,MACA,cAAc,IAAI,eAAe,IAC7BA,aAAY,IAAI,eAAe,CAAC,IAChC;AAAA,MACJ;AAAA,MACA,YAAY,IAAI,aAAa,KAAK;AAAA,MAClC,gBAAgB,IAAI,mBAAmB,IACnCA,aAAY,IAAI,mBAAmB,CAAC,IACpC;AAAA,MACJ,gBAAgB,IAAI,kBAAkB,KAAK;AAAA,MAC3C,IAAIA,aAAY,IAAI,KAAK,CAAC;AAAA,MAC1B,cAAc,KAAK,MAAMA,aAAY,IAAI,kBAAkB,GAAG,CAAC,CAAC;AAAA,MAChE,cAAcA,aAAY,IAAI,gBAAgB,CAAC;AAAA,MAC/C,WAAWA,aAAY,IAAI,aAAa,CAAC;AAAA,MACzC;AAAA,MACA,wBAAwBA;AAAA,QACtB,IAAI,4BAA4B,KAAK,IAAI,sBAAsB;AAAA,QAC/D;AAAA,MACF;AAAA,MACA,wBAAwBA;AAAA,QACtB,IAAI,4BAA4B,KAAK,IAAI,sBAAsB;AAAA,QAC/D;AAAA,MACF;AAAA,MACA,uBAAuBA,aAAY,IAAI,0BAA0B,GAAG,CAAC;AAAA,MACrE,uBAAuB,IAAI,0BAA0B,IACjDA,aAAY,IAAI,0BAA0B,CAAC,IAC3C;AAAA,MACJ,YAAY,IAAI,aAAa,IACzBA,aAAY,IAAI,aAAa,CAAC,IAC9B;AAAA,MACJ,YAAY,IAAI,aAAa,IACzBA,aAAY,IAAI,aAAa,CAAC,IAC9B;AAAA,MACJ,KAAK,IAAI,KAAK,IAAIA,aAAY,IAAI,KAAK,CAAC,IAAI;AAAA,MAC5C,UAAU,IAAI,UAAU,IAAIA,aAAY,IAAI,UAAU,CAAC,IAAI;AAAA,MAC3D,WAAW,IAAI,YAAY,IACvBA,aAAY,IAAI,YAAY,CAAC,IAC7B;AAAA,MACJ,SAAS,IAAI,UAAU,IAAIA,aAAY,IAAI,UAAU,CAAC,IAAI;AAAA,IAC5D;AAEA,UAAM,eAAgD,CAAC;AACvD,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,GAAG,GAAG;AAC9C,UAAI,CAAC,oBAAoB,IAAI,GAAG,KAAK,UAAU,UAAa,MAAM,KAAK,MAAM,IAAI;AAC/E,cAAM,UAAU,MAAM,QAAQ,UAAU,EAAE,EAAE,KAAK;AACjD,cAAM,SAAS,WAAW,OAAO;AACjC,qBAAa,GAAG,IAAI,CAAC,MAAM,MAAM,KAAK,SAAS,MAAM,IAAI,SAAS,MAAM,KAAK;AAAA,MAC/E;AAAA,IACF;AACA,QAAI,OAAO,KAAK,YAAY,EAAE,SAAS,GAAG;AACxC,YAAM,eAAe;AAAA,IACvB;AAEA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAKA,SAAS,uBACP,KACA,SACsB;AACtB,MAAI;AACF,UAAM,OAAO,+BAA+B,IAAI,MAAM,CAAC;AACvD,QAAI,MAAM,KAAK,QAAQ,CAAC,EAAG,QAAO;AAElC,WAAO;AAAA,MACL;AAAA,MACA,cAAcA,aAAY,IAAI,eAAe,CAAC;AAAA,MAC9C,cAAcA,aAAY,IAAI,eAAe,CAAC;AAAA,MAC9C,WAAWA,aAAY,IAAI,WAAW,GAAG,CAAC;AAAA,MAC1C,cAAcA,aAAY,IAAI,eAAe,CAAC;AAAA,MAC9C,SAASA,aAAY,IAAI,KAAK,CAAC;AAAA,MAC/B,YAAYA,aAAY,IAAI,OAAO,CAAC;AAAA,MACpC,aAAaA,aAAY,IAAI,YAAY,CAAC;AAAA,MAC1C;AAAA,IACF;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAOA,eAAe,WACb,WACA,WAAmB,gBACnB,SACkB;AAClB,QAAM,eAAoB,WAAK,WAAW,QAAQ;AAClD,QAAM,UAAU,MAAS,aAAS,cAAc,OAAO;AACvD,QAAM,UAAU,SAAS,OAAO;AAEhC,QAAM,SAAkB,CAAC;AACzB,aAAW,UAAU,SAAS;AAC5B,UAAM,QAAQ,eAAe,QAAQ,OAAO;AAC5C,QAAI,OAAO;AACT,aAAO,KAAK,KAAK;AAAA,IACnB;AAAA,EACF;AAGA,SAAO,KAAK,CAAC,GAAG,MAAM;AACpB,UAAM,cACJ,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ;AACpE,QAAI,gBAAgB,EAAG,QAAO;AAC9B,WAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AAAA,EAChD,CAAC;AAED,SAAO;AACT;AAQA,eAAe,cACb,WACA,SACA,WAAmB,gBACmB;AACtC,QAAM,eAAoB,WAAK,WAAW,QAAQ;AAElD,MAAI;AACF,UAAS,WAAO,YAAY;AAC5B,UAAM,UAAU,MAAS,aAAS,cAAc,OAAO;AACvD,UAAM,UAAU,SAAS,OAAO;AAEhC,UAAM,UAA2B,CAAC;AAClC,eAAW,UAAU,SAAS;AAC5B,YAAM,QAAQ,uBAAuB,QAAQ,OAAO;AACpD,UAAI,OAAO;AACT,gBAAQ,KAAK,KAAK;AAAA,MACpB;AAAA,IACF;AAGA,YAAQ;AAAA,MACN,CAAC,GAAG,MAAM,IAAI,KAAK,EAAE,IAAI,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,IAAI,EAAE,QAAQ;AAAA,IAClE;AAEA,WAAO,QAAQ,SAAS,IAAI,UAAU;AAAA,EACxC,QAAQ;AAEN,WAAO;AAAA,EACT;AACF;AAMA,eAAsB,UACpB,SACA,SACsB;AACtB,QAAM,YAAiB,WAAK,SAAS,OAAO;AAG5C,QAAM,EAAE,SAAS,IAAI,MAAM,iBAAiB,SAAS;AAGrD,QAAM,mBAAmB,SAAS,YAAY;AAC9C,QAAM,eAAoB,WAAK,WAAW,gBAAgB;AAG1D,MAAI;AACF,UAAS,WAAO,YAAY;AAAA,EAC9B,QAAQ;AACN,UAAM,IAAI,MAAM,wCAAwC,OAAO,EAAE;AAAA,EACnE;AAGA,QAAM,mBAAmB,SAAS,YAAY;AAE9C,QAAM,SAAS,MAAM,WAAW,WAAW,kBAAkB,OAAO;AACpE,QAAM,YAAY,MAAM,cAAc,WAAW,SAAS,gBAAgB;AAE1E,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAMA,SAAS,aAAa,KAA2B;AAC/C,MAAI,OAAO,KAAM,QAAO;AACxB,MAAI,eAAe,KAAM,QAAO;AAEhC,MAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,UAAU,KAAK;AAC5D,WAAO,IAAI,KAAM,IAAyB,OAAO,KAAQ;AAAA,EAC3D;AACA,MAAI,OAAO,QAAQ,UAAU;AAE3B,WAAO,IAAI,KAAK,MAAM,KAAQ;AAAA,EAChC;AACA,MAAI,OAAO,QAAQ,UAAU;AAE3B,UAAM,QAAQ,IAAI,MAAM,0BAA0B;AAClD,QAAI,OAAO;AACT,aAAO,IAAI,KAAK,SAAS,MAAM,CAAC,CAAC,GAAG,SAAS,MAAM,CAAC,CAAC,IAAI,GAAG,SAAS,MAAM,CAAC,CAAC,CAAC;AAAA,IAChF;AACA,WAAO,IAAI,KAAK,GAAG;AAAA,EACrB;AACA,SAAO;AACT;AAOA,eAAsB,WAAW,SAAuC;AACtE,QAAM,SAAsB,CAAC;AAE7B,MAAI;AACF,UAAM,OAAO,MAAM,cAAc,OAAO;AAGxC,UAAM,mBAAmB,MAAM,KAAK,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAUjD;AAGD,UAAM,mBAAmB,MAAM,KAAK,cAAc;AAAA;AAAA;AAAA;AAAA,KAIjD;AACD,UAAM,oBAAoB,oBAAI,IAAsB;AACpD,eAAW,OAAO,iBAAiB,QAAQ,GAAG;AAC5C,YAAM,MAAM,IAAI,CAAC;AACjB,UAAI,CAAC,kBAAkB,IAAI,GAAG,EAAG,mBAAkB,IAAI,KAAK,CAAC,CAAC;AAC9D,wBAAkB,IAAI,GAAG,EAAG,KAAK,IAAI,CAAC,CAAW;AAAA,IACnD;AAGA,UAAM,aAAa,oBAAI,IAOpB;AAEH,eAAW,OAAO,iBAAiB,QAAQ,GAAG;AAC5C,YAAM,UAAU,IAAI,CAAC;AACrB,YAAM,aAAa,OAAO,IAAI,CAAC,CAAC;AAChC,YAAM,UAAU,aAAa,IAAI,CAAC,CAAC;AACnC,YAAM,UAAU,aAAa,IAAI,CAAC,CAAC;AACnC,YAAM,UAAU,OAAO,IAAI,CAAC,CAAC,KAAK;AAClC,YAAM,QAAQ,OAAO,IAAI,CAAC,CAAC,KAAK;AAChC,YAAM,aAAa,kBAAkB,IAAI,OAAO,KAAK,CAAC;AAEtD,iBAAW,IAAI,SAAS;AAAA,QACtB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AAAA,IACH;AAGA,UAAM,kBAAkB,MAAM,KAAK,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAUhD;AAED,UAAM,iBAAiB,oBAAI,IAMxB;AAEH,eAAW,OAAO,gBAAgB,QAAQ,GAAG;AAC3C,YAAM,UAAU,IAAI,CAAC;AACrB,qBAAe,IAAI,SAAS;AAAA,QAC1B,YAAY,OAAO,IAAI,CAAC,CAAC;AAAA,QACzB,eAAe,OAAO,IAAI,CAAC,CAAC;AAAA,QAC5B,SAAS,OAAO,IAAI,CAAC,CAAC,KAAK;AAAA,QAC3B,SAAS,IAAI,CAAC;AAAA,QACd,SAAS,IAAI,CAAC;AAAA,MAChB,CAAC;AAAA,IACH;AAGA,UAAM,aAAa,MAAM,KAAK,cAAc;AAAA;AAAA,KAE3C;AAED,UAAM,WAAW,oBAAI,IAGlB;AAEH,eAAW,OAAO,WAAW,QAAQ,GAAG;AACtC,YAAM,UAAU,IAAI,CAAC;AACrB,eAAS,IAAI,SAAS;AAAA,QACpB,aAAa,IAAI,CAAC,KAAK;AAAA,QACvB,iBAAiB,IAAI,CAAC,KAAK;AAAA,MAC7B,CAAC;AAAA,IACH;AAGA,UAAM,UAAU,MAAS,YAAQ,SAAS,EAAE,eAAe,KAAK,CAAC;AACjE,UAAM,eAAe,oBAAI,IAAY;AAErC,eAAW,SAAS,SAAS;AAC3B,UAAI,CAAC,MAAM,YAAY,EAAG;AAC1B,UAAI,MAAM,KAAK,WAAW,GAAG,EAAG;AAChC,mBAAa,IAAI,MAAM,IAAI;AAAA,IAC7B;AAIA,eAAW,WAAW,WAAW,KAAK,GAAG;AACvC,mBAAa,IAAI,OAAO;AAAA,IAC1B;AAGA,eAAW,WAAW,cAAc;AAClC,YAAM,QAAQ,WAAW,IAAI,OAAO;AACpC,YAAM,OAAO,SAAS,IAAI,OAAO;AACjC,YAAM,YAAY,eAAe,IAAI,OAAO;AAE5C,UAAI,SAAS,MAAM,aAAa,GAAG;AAEjC,cAAM,OAAkB;AAAA,UACtB;AAAA,UACA,MAAM;AAAA,UACN,YAAY,MAAM;AAAA,UAClB,aAAa,MAAM,eAAe;AAAA,UAClC,iBAAiB,MAAM,mBAAmB;AAAA,UAC1C,WAAW;AAAA,YACT,OAAO,MAAM;AAAA,YACb,KAAK,MAAM;AAAA,UACb;AAAA,UACA,YAAY,MAAM;AAAA,UAClB,SAAS,MAAM;AAAA,UACf,OAAO,MAAM;AAAA,QACf;AAGA,YAAI,WAAW;AACb,eAAK,eAAe;AAAA,YAClB,YAAY,UAAU;AAAA,YACtB,eAAe,UAAU;AAAA,YACzB,SAAS,UAAU;AAAA,YACnB,WAAW;AAAA,cACT,OAAO,UAAU;AAAA,cACjB,KAAK,UAAU;AAAA,YACjB;AAAA,YACA,OAAO;AAAA;AAAA,UACT;AAAA,QACF;AAEA,eAAO,KAAK,IAAI;AAAA,MAClB,WAAW,CAAC,OAAO;AAGjB,cAAM,YAAiB,WAAK,SAAS,OAAO;AAC5C,YAAI;AACF,gBAAM,EAAE,SAAS,IAAI,MAAM,iBAAiB,SAAS;AACrD,cAAI,SAAS,UAAU;AAErB,mBAAO,KAAK;AAAA,cACV;AAAA,cACA,MAAM;AAAA,cACN,YAAY;AAAA,cACZ,aAAa,CAAC,CAAC,SAAS;AAAA,cACxB,iBAAiB,CAAC,CAAC,SAAS;AAAA,cAC5B,WAAW,EAAE,OAAO,MAAM,KAAK,KAAK;AAAA,cACpC,YAAY,CAAC;AAAA,cACb,SAAS;AAAA,cACT,OAAO;AAAA,YACT,CAAC;AAAA,UACH;AAAA,QACF,QAAQ;AAAA,QAER;AAAA,MACF;AAAA,IACF;AAGA,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AAElD,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,0BAA2B,MAAgB,OAAO,EAAE;AAAA,EACtE;AACF;AAKA,SAAS,uBACP,KACwB;AACxB,QAAM,aAAqC,EAAE,GAAG,IAAI;AACpD,SAAO,QAAQ,8BAA8B,EAAE;AAAA,IAC7C,CAAC,CAAC,OAAO,SAAS,MAAM;AACtB,UAAI,WAAW,KAAK,MAAM,QAAW;AACnC,mBAAW,SAAS,IAAI,WAAW,KAAK;AACxC,eAAO,WAAW,KAAK;AAAA,MACzB;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,wBACd,KACuB;AAEvB,QAAM,OAAO,OAAO,KAAK,GAAG;AAC5B,MAAI,YAAY,IAAI,GAAG;AACrB,WAAO,8BAA8B,GAAG;AAAA,EAC1C;AAGA,MAAI;AACF,UAAM,aAAa,uBAAuB,GAAG;AAE7C,UAAM,aAAa,+BAA+B,WAAW,aAAa,CAAC;AAC3E,QAAI,MAAM,WAAW,QAAQ,CAAC,EAAG,QAAO;AAExC,UAAM,aAAa,WAAW,aAAa,IACvC,+BAA+B,WAAW,aAAa,CAAC,IACxD;AAEJ,UAAM,YAAY,WAAW,UAAU,KAAK,IAAI,KAAK,KAAK;AAE1D,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,YAAY,WAAW,aAAa,KAAK;AAAA,MACzC,cAAcA,aAAY,WAAW,eAAe,CAAC;AAAA,MACrD,MAAM,WAAW,MAAM,KAAK;AAAA,MAC5B,gBAAgBA,aAAY,WAAW,iBAAiB,CAAC;AAAA,MACzD,cAAcA,aAAY,WAAW,kBAAkB,GAAG,CAAC;AAAA,MAC3D,IAAIA,aAAY,WAAW,KAAK,CAAC;AAAA,MACjC,cAAc,WAAW,eAAe,IACpCA,aAAY,WAAW,eAAe,CAAC,IACvC;AAAA,MACJ;AAAA,MACA,YAAY,WAAW,aAAa,KAAK;AAAA,MACzC,gBAAgB,WAAW,mBAAmB,IAC1CA,aAAY,WAAW,mBAAmB,CAAC,IAC3C;AAAA,MACJ,gBAAgB,WAAW,kBAAkB,KAAK;AAAA,IACpD;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAOA,eAAsB,iBACpB,SACA,SAC2B;AAC3B,QAAM,YAAiB,WAAK,SAAS,OAAO;AAG5C,QAAM,EAAE,SAAS,IAAI,MAAM,iBAAiB,SAAS;AACrD,QAAM,WAAW,SAAS,gBAAgB;AAC1C,QAAM,mBAAwB,WAAK,WAAW,QAAQ;AAGtD,MAAI;AACF,UAAS,WAAO,gBAAgB;AAAA,EAClC,QAAQ;AACN,UAAM,IAAI,MAAM,wCAAwC,OAAO,EAAE;AAAA,EACnE;AAEA,QAAM,UAAU,MAAS,aAAS,kBAAkB,OAAO;AAC3D,QAAM,UAAU,SAAS,OAAO;AAEhC,QAAM,SAA2B,CAAC;AAClC,aAAW,UAAU,SAAS;AAC5B,UAAM,QAAQ,wBAAwB,MAAM;AAC5C,QAAI,OAAO;AACT,aAAO,KAAK,KAAK;AAAA,IACnB;AAAA,EACF;AAGA,SAAO;AAAA,IACL,CAAC,GAAG,MACF,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ;AAAA,EACtE;AAEA,SAAO;AACT;AAiCA,SAAS,YAAY,KAAqB;AACxC,SAAO,IACJ,QAAQ,mBAAmB,OAAO,EAClC,QAAQ,WAAW,GAAG,EACtB,QAAQ,kBAAkB,EAAE,EAC5B,YAAY,EACZ,QAAQ,OAAO,GAAG,EAClB,QAAQ,UAAU,EAAE;AACzB;AAKA,SAAS,mBACP,SACA,SACoC;AACpC,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO,EAAE,OAAO,OAAO,OAAO,wCAAwC;AAAA,EACxE;AAEA,QAAM,UAAU,OAAO,KAAK,QAAQ,CAAC,CAAC;AAEtC,UAAQ,SAAS;AAAA,IACf,KAAK,YAAY;AAEf,YAAM,WAAW,CAAC,eAAe,KAAK;AACtC,YAAM,UAAU,SAAS,OAAO,CAAC,QAAQ,CAAC,QAAQ,SAAS,GAAG,CAAC;AAC/D,UAAI,QAAQ,SAAS,GAAG;AACtB,eAAO;AAAA,UACL,OAAO;AAAA,UACP,OAAO,0CAA0C,QAAQ,KAAK,IAAI,CAAC;AAAA,QACrE;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA,KAAK,YAAY;AAEf,YAAM,WAAW,CAAC,QAAQ,eAAe;AACzC,YAAM,UAAU,SAAS,OAAO,CAAC,QAAQ,CAAC,QAAQ,SAAS,GAAG,CAAC;AAC/D,UAAI,QAAQ,SAAS,GAAG;AACtB,eAAO;AAAA,UACL,OAAO;AAAA,UACP,OAAO,0CAA0C,QAAQ,KAAK,IAAI,CAAC;AAAA,QACrE;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA,KAAK,gBAAgB;AAEnB,UAAI,YAAY,OAAO,GAAG;AACxB;AAAA,MACF;AAEA,YAAM,oBAAoB,CAAC,eAAe,aAAa;AACvD,YAAM,YAAY,CAAC,OAAO,IAAI;AAC9B,YAAM,gBAAgB,kBAAkB;AAAA,QAAK,CAAC,QAC5C,QAAQ,SAAS,GAAG;AAAA,MACtB;AACA,YAAM,QAAQ,UAAU,KAAK,CAAC,QAAQ,QAAQ,SAAS,GAAG,CAAC;AAC3D,YAAM,UAAoB,CAAC;AAC3B,UAAI,CAAC,cAAe,SAAQ,KAAK,aAAa;AAC9C,UAAI,CAAC,MAAO,SAAQ,KAAK,KAAK;AAC9B,UAAI,QAAQ,SAAS,GAAG;AACtB,eAAO;AAAA,UACL,OAAO;AAAA,UACP,OAAO,8CAA8C,QAAQ,KAAK,IAAI,CAAC;AAAA,QACzE;AAAA,MACF;AACA;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,KAAK;AACvB;AAYA,eAAsB,UACpB,SACA,SAC0B;AAC1B,QAAM,EAAE,SAAS,UAAU,IAAI;AAC/B,MAAI,EAAE,UAAU,WAAW,IAAI;AAG/B,MAAI;AACF,UAAS,WAAO,OAAO;AAAA,EACzB,QAAQ;AACN,UAAM,IAAI,MAAM,uBAAuB,OAAO,EAAE;AAAA,EAClD;AAGA,QAAM,UAAU,MAAS,aAAS,SAAS,OAAO;AAClD,QAAM,UAAU,SAAS,OAAO;AAIhC,MAAI,YAAY,cAAc,QAAQ,SAAS,GAAG;AAChD,UAAM,UAAU,OAAO,KAAK,QAAQ,CAAC,CAAC;AACtC,QAAI,YAAY,OAAO,GAAG;AACxB,gBAAU;AAAA,IACZ;AAAA,EACF;AAGA,QAAM,aAAa,mBAAmB,SAAS,OAAO;AACtD,MAAI,CAAC,WAAW,OAAO;AACrB,UAAM,IAAI,MAAM,WAAW,KAAK;AAAA,EAClC;AAGA,QAAME,SAAO;AACb,QAAM,UAAU,YAAYA,MAAI;AAEhC,MAAI,CAAC,SAAS;AACZ,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAGA,QAAM,YAAiB,WAAK,SAAS,OAAO;AAC5C,MAAI;AACF,UAAS,WAAO,SAAS;AACzB,UAAM,IAAI;AAAA,MACR,UAAU,OAAO;AAAA,IACnB;AAAA,EACF,SAAS,OAAO;AAEd,QAAK,MAAgC,SAAS,UAAU;AACtD,YAAM;AAAA,IACR;AAAA,EACF;AAGA,QAAS,UAAM,WAAW,EAAE,WAAW,KAAK,CAAC;AAG7C,QAAM,iBACJ,YAAY,aACR,iBACA,YAAY,aACV,iBACA;AAGR,QAAM,aAAkB,WAAK,WAAW,cAAc;AACtD,QAAS,aAAS,SAAS,UAAU;AAGrC,MAAI,YAA0D;AAAA,IAC5D,OAAO;AAAA,IACP,KAAK;AAAA,EACP;AACA,MAAI,aAAuB,CAAC;AAE5B,MAAI,YAAY,YAAY;AAE1B,UAAM,SAAkB,CAAC;AACzB,eAAW,UAAU,SAAS;AAC5B,YAAM,QAAQ,eAAe,QAAQ,SAAS;AAC9C,UAAI,MAAO,QAAO,KAAK,KAAK;AAAA,IAC9B;AAEA,QAAI,OAAO,SAAS,GAAG;AACrB,YAAM,QAAQ,OAAO,IAAI,CAAC,MAAM,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAC;AAChE,kBAAY;AAAA,QACV,OAAO,IAAI,KAAK,KAAK,IAAI,GAAG,KAAK,CAAC,EAAE,YAAY;AAAA,QAChD,KAAK,IAAI,KAAK,KAAK,IAAI,GAAG,KAAK,CAAC,EAAE,YAAY;AAAA,MAChD;AACA,mBAAa,MAAM,KAAK,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,EAAE,KAAK;AAAA,IACvE;AAAA,EACF,WAAW,YAAY,YAAY;AAEjC,UAAM,UAA2B,CAAC;AAClC,eAAW,UAAU,SAAS;AAC5B,YAAM,QAAQ,uBAAuB,QAAQ,OAAO;AACpD,UAAI,MAAO,SAAQ,KAAK,KAAK;AAAA,IAC/B;AAEA,QAAI,QAAQ,SAAS,GAAG;AACtB,YAAM,QAAQ,QAAQ,IAAI,CAAC,MAAM,IAAI,KAAK,EAAE,IAAI,EAAE,QAAQ,CAAC;AAC3D,kBAAY;AAAA,QACV,OAAO,IAAI,KAAK,KAAK,IAAI,GAAG,KAAK,CAAC,EAAE,YAAY;AAAA,QAChD,KAAK,IAAI,KAAK,KAAK,IAAI,GAAG,KAAK,CAAC,EAAE,YAAY;AAAA,MAChD;AAAA,IACF;AAAA,EACF,WAAW,YAAY,gBAAgB;AAErC,UAAM,SAA2B,CAAC;AAClC,eAAW,UAAU,SAAS;AAC5B,YAAM,QAAQ,wBAAwB,MAAM;AAC5C,UAAI,MAAO,QAAO,KAAK,KAAK;AAAA,IAC9B;AAEA,QAAI,OAAO,SAAS,GAAG;AACrB,YAAM,QAAQ,OAAO,IAAI,CAAC,MAAM,IAAI,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAC;AAChE,kBAAY;AAAA,QACV,OAAO,IAAI,KAAK,KAAK,IAAI,GAAG,KAAK,CAAC,EAAE,YAAY;AAAA,QAChD,KAAK,IAAI,KAAK,KAAK,IAAI,GAAG,KAAK,CAAC,EAAE,YAAY;AAAA,MAChD;AACA,mBAAa,MAAM,KAAK,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,EAAE,KAAK;AAAA,IACvE;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA,MAAAA;AAAA,IACA;AAAA,IACA,aAAa,QAAQ;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AJt7BA,SAASC,UAAS,SAA2C;AAE3D,QAAM,QAAQ,QAAQ,QAAQ,WAAW,EAAE,EAAE,KAAK,EAAE,MAAM,IAAI;AAC9D,MAAI,MAAM,SAAS,EAAG,QAAO,CAAC;AAE9B,QAAM,UAAUC,cAAa,MAAM,CAAC,CAAC;AACrC,QAAM,UAAoC,CAAC;AAE3C,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,SAASA,cAAa,MAAM,CAAC,CAAC;AACpC,QAAI,OAAO,WAAW,EAAG;AAEzB,UAAM,SAAiC,CAAC;AACxC,YAAQ,QAAQ,CAAC,QAAQ,QAAQ;AAC/B,aAAO,MAAM,IAAI,OAAO,GAAG,KAAK;AAAA,IAClC,CAAC;AACD,YAAQ,KAAK,MAAM;AAAA,EACrB;AAEA,SAAO;AACT;AAKA,SAASA,cAAa,MAAwB;AAC5C,QAAM,SAAmB,CAAC;AAC1B,MAAI,UAAU;AACd,MAAI,WAAW;AAEf,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,OAAO,KAAK,CAAC;AAEnB,QAAI,SAAS,KAAK;AAChB,UAAI,YAAY,KAAK,IAAI,CAAC,MAAM,KAAK;AACnC,mBAAW;AACX;AAAA,MACF,OAAO;AACL,mBAAW,CAAC;AAAA,MACd;AAAA,IACF,WAAW,SAAS,OAAO,CAAC,UAAU;AACpC,aAAO,KAAK,QAAQ,KAAK,CAAC;AAC1B,gBAAU;AAAA,IACZ,OAAO;AACL,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,SAAO,KAAK,QAAQ,KAAK,CAAC;AAC1B,SAAO;AACT;AAUA,SAAS,iBAAiB,OAA0C;AAClE,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,MAAM,MAAM,KAAK;AACvB,MAAI,CAAC,IAAK,QAAO;AAEjB,MAAI,sBAAsB,KAAK,GAAG,EAAG,QAAO;AAE5C,QAAM,WAAW,IAAI,MAAM,2CAA2C;AACtE,MAAI,CAAC,SAAU,QAAO;AAEtB,QAAM,QAAQ,OAAO,SAAS,CAAC,CAAC;AAChC,QAAM,MAAM,OAAO,SAAS,CAAC,CAAC;AAC9B,MAAI,OAAO,OAAO,SAAS,CAAC,CAAC;AAE7B,MAAI,OAAO,MAAM,KAAK,KAAK,OAAO,MAAM,GAAG,KAAK,OAAO,MAAM,IAAI,GAAG;AAClE,WAAO;AAAA,EACT;AACA,MAAI,OAAO,KAAK;AACd,YAAQ,QAAQ,KAAK,OAAO;AAAA,EAC9B;AAEA,QAAM,KAAK,IAAI,KAAK,KAAK,IAAI,MAAM,QAAQ,GAAG,GAAG,CAAC;AAClD,MACE,GAAG,eAAe,MAAM,QACxB,GAAG,YAAY,IAAI,MAAM,SACzB,GAAG,WAAW,MAAM,KACpB;AACA,WAAO;AAAA,EACT;AAEA,QAAM,KAAK,OAAO,KAAK,EAAE,SAAS,GAAG,GAAG;AACxC,QAAM,KAAK,OAAO,GAAG,EAAE,SAAS,GAAG,GAAG;AACtC,SAAO,GAAG,IAAI,IAAI,EAAE,IAAI,EAAE;AAC5B;AAQA,eAAe,iBACb,WACwB;AACxB,QAAM,EAAE,SAAS,IAAI,MAAM,iBAAiB,SAAS;AACrD,SAAO,SAAS,YAAY;AAC9B;AAMA,eAAe,qBACb,WACmE;AACnE,QAAM,EAAE,SAAS,IAAI,MAAM,iBAAiB,SAAS;AACrD,SAAO;AAAA,IACL,UAAU,SAAS,YAAY;AAAA,IAC/B,cAAc,SAAS,gBAAgB;AAAA,EACzC;AACF;AAaA,eAAe,iBACb,MACA,SACA,SACA,UACA,WACe;AACf,QAAM,QAAQ,QAAQ,MAAM,UAAU,WAAW,SAAS;AAC1D,MAAI,MAAM,WAAW,EAAG;AAIxB,QAAM,gBAAgB;AACtB,QAAM,eAAyB,CAAC;AAChC,QAAM,SAAqC,CAAC;AAE5C,WAAS,SAAS,GAAG,SAAS,MAAM,QAAQ,UAAU;AACpD,UAAM,SAAS,MAAM,MAAM;AAC3B,UAAM,YAAY,SAAS,gBAAgB;AAC3C,UAAM,kBAAkB,MAAM;AAAA,MAC5B,EAAE,QAAQ,cAAc;AAAA,MACxB,CAAC,GAAG,MAAM,IAAI,YAAY,CAAC;AAAA,IAC7B;AACA,iBAAa,KAAK,IAAI,gBAAgB,KAAK,IAAI,CAAC,GAAG;AAGnD,UAAM,UAAU,WAAW,OAAO,SAAS,CAAC;AAC5C,UAAM,eAAe,SAAS,OAAO,kBAAkB,GAAG,EAAE;AAC5D,UAAM,KAAK,WAAW,OAAO,KAAK,CAAC;AACnC,UAAM,YAAY,WAAW,OAAO,aAAa,CAAC;AAClD,UAAM,qBAAqB,WAAW,OAAO,4BAA4B,CAAC;AAC1E,UAAM,qBAAqB,WAAW,OAAO,4BAA4B,CAAC;AAC1E,UAAM,SAAS,wBAAwB,MAAM;AAG7C,WAAO;AAAA,MACL;AAAA;AAAA,MACA,iBAAiB,OAAO,aAAa,CAAC;AAAA;AAAA,MACtC,OAAO,aAAa,KAAK;AAAA;AAAA,OACxB,OAAO,UAAU,KAAK,IAAI,KAAK,KAAK;AAAA;AAAA,MACrC,OAAO,MAAM,KAAK;AAAA;AAAA,MAClB,MAAM,OAAO,IAAI,OAAO;AAAA;AAAA,MACxB,MAAM,YAAY,IAAI,IAAI;AAAA;AAAA,MAC1B,MAAM,EAAE,IAAI,IAAI;AAAA;AAAA,MAChB,iBAAiB,OAAO,aAAa,CAAC;AAAA;AAAA,MACtC,OAAO,aAAa,KAAK;AAAA;AAAA,MACzB,OAAO,kBAAkB,KAAK;AAAA;AAAA,MAC9B,MAAM,SAAS,IAAI,OAAO;AAAA;AAAA,MAC1B,MAAM,kBAAkB,IAAI,IAAI;AAAA;AAAA,MAChC,MAAM,kBAAkB,IAAI,IAAI;AAAA;AAAA,MAChC;AAAA;AAAA,IACF;AAAA,EACF;AAEA,QAAM,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA,eAKC,aAAa,KAAK,IAAI,CAAC;AAAA;AAGpC,QAAM,KAAK,IAAI,KAAK,MAAM;AAC5B;AAMA,SAAS,gBAAgB,MAAuC;AAC9D,MAAI,CAAC,QAAQ,MAAM,KAAK,QAAQ,CAAC,EAAG,QAAO;AAC3C,QAAM,OAAO,KAAK,YAAY;AAC9B,QAAM,QAAQ,OAAO,KAAK,SAAS,IAAI,CAAC,EAAE,SAAS,GAAG,GAAG;AACzD,QAAM,MAAM,OAAO,KAAK,QAAQ,CAAC,EAAE,SAAS,GAAG,GAAG;AAClD,SAAO,GAAG,IAAI,IAAI,KAAK,IAAI,GAAG;AAChC;AAcA,eAAe,qBACb,MACA,SACA,QACA,SACA,UACA,WACe;AACf,QAAM,QAAQ,OAAO,MAAM,UAAU,WAAW,SAAS;AACzD,QAAM,eAAe,QAAQ,MAAM,UAAU,WAAW,SAAS;AACjE,MAAI,MAAM,WAAW,EAAG;AAGxB,QAAM,gBAAgB;AACtB,QAAM,eAAyB,CAAC;AAChC,QAAM,SAAqC,CAAC;AAE5C,WAAS,SAAS,GAAG,SAAS,MAAM,QAAQ,UAAU;AACpD,UAAM,QAAQ,MAAM,MAAM;AAC1B,UAAM,YAAY,SAAS,gBAAgB;AAC3C,UAAM,kBAAkB,MAAM;AAAA,MAC5B,EAAE,QAAQ,cAAc;AAAA,MACxB,CAAC,GAAG,MAAM,IAAI,YAAY,CAAC;AAAA,IAC7B;AACA,iBAAa,KAAK,IAAI,gBAAgB,KAAK,IAAI,CAAC,GAAG;AAEnD,WAAO;AAAA,MACL;AAAA,MACA,gBAAgB,MAAM,UAAU;AAAA,MAChC,MAAM,cAAc;AAAA,MACpB,MAAM,YAAY;AAAA,MAClB,MAAM,QAAQ;AAAA,MACd,MAAM,kBAAkB;AAAA,MACxB,MAAM,gBAAgB;AAAA,MACtB,MAAM,MAAM;AAAA,MACZ,gBAAgB,MAAM,UAAU;AAAA,MAChC,MAAM,cAAc;AAAA,MACpB,MAAM,gBAAgB;AAAA,MACtB,MAAM,kBAAkB;AAAA,MACxB,MAAM,kBAAkB;AAAA,MACxB,MAAM,gBAAgB;AAAA,MACtB,aAAa,MAAM;AAAA,IACrB;AAAA,EACF;AAEA,QAAM,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA,eAKC,aAAa,KAAK,IAAI,CAAC;AAAA;AAGpC,QAAM,KAAK,IAAI,KAAK,MAAM;AAC5B;AAUA,IAAM,gBAAgB;AAEtB,SAAS,cAAc,MAAsB;AAC3C,SAAO,GAAG,IAAI,IAAI,aAAa;AACjC;AAkBA,eAAsB,kBACpB,MACA,SACA,WAC0B;AAC1B,MAAI;AAEF,UAAM,mBAAmB,MAAM,gBAAgB,MAAM,OAAO;AAG5D,UAAM,mBAAmB,MAAM,iBAAiB,SAAS;AACzD,QAAI,CAAC,kBAAkB;AAErB,UAAI,kBAAkB;AACpB,cAAM,KAAK,IAAI,mBAAmB;AAClC,YAAI;AACF,gBAAM,KAAK;AAAA,YACT;AAAA,YACA,CAAC,OAAO;AAAA,UACV;AACA,gBAAM,KAAK;AAAA,YACT;AAAA,YACA,CAAC,OAAO;AAAA,UACV;AACA,gBAAM,mBAAmB,MAAM,OAAO;AACtC,gBAAM,KAAK,IAAI,QAAQ;AACvB,iBAAO,EAAE,SAAS,QAAQ,UAAU;AAAA,QACtC,SAAS,KAAK;AACZ,gBAAM,KAAK,IAAI,UAAU;AACzB,gBAAM;AAAA,QACR;AAAA,MACF;AAEA,aAAO;AAAA,QACL;AAAA,QACA,QAAQ;AAAA,QACR,OAAO;AAAA,MACT;AAAA,IACF;AAEA,UAAM,eAAoB,WAAK,WAAW,gBAAgB;AAG1D,UAAM,eAAe,cAAc,MAAM,gBAAgB,YAAY,CAAC;AAItE,QAAI,oBAAoB,iBAAiB,kBAAkB,cAAc;AAEvE,YAAM,eAAe,MAAM,qBAAqB,SAAS;AACzD,UAAI,aAAa,cAAc;AAC7B,cAAM,mBAAwB,WAAK,WAAW,aAAa,YAAY;AACvE,cAAM,mBAAmB,cAAc,MAAM,gBAAgB,gBAAgB,CAAC;AAC9E,YAAI,iBAAiB,sBAAsB,kBAAkB;AAAA,QAE7D,OAAO;AACL,iBAAO,EAAE,SAAS,QAAQ,YAAY;AAAA,QACxC;AAAA,MACF,OAAO;AAEL,YAAI,iBAAiB,sBAAsB,MAAM;AAAA,QAEjD,OAAO;AACL,iBAAO,EAAE,SAAS,QAAQ,YAAY;AAAA,QACxC;AAAA,MACF;AAAA,IACF;AAIA,UAAM,KAAK,IAAI,mBAAmB;AAElC,QAAI;AAEF,YAAM,KAAK;AAAA,QACT;AAAA,QACA,CAAC,OAAO;AAAA,MACV;AAGA,YAAM,aAAa,MAAS,aAAS,cAAc,OAAO;AAC1D,YAAM,UAAUD,UAAS,UAAU;AAGnC,YAAM,YAAY;AAClB,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,WAAW;AAClD,cAAM,iBAAiB,MAAM,SAAS,SAAS,GAAG,SAAS;AAAA,MAC7D;AAGA,YAAM,eAAe,MAAM,qBAAqB,SAAS;AACzD,UAAI,eAA8B;AAClC,UAAI,mBAAkC;AAEtC,UAAI,aAAa,UAAU;AACzB,YAAI;AACF,yBAAe,cAAc,MAAM;AAAA,YAC5B,WAAK,WAAW,aAAa,QAAQ;AAAA,UAC5C,CAAC;AAAA,QACH,QAAQ;AAAA,QAER;AAAA,MACF;AAEA,UAAI,aAAa,cAAc;AAC7B,YAAI;AACF,6BAAmB,cAAc,MAAM;AAAA,YAChC,WAAK,WAAW,aAAa,YAAY;AAAA,UAChD,CAAC;AAAA,QACH,QAAQ;AAAA,QAER;AAAA,MACF;AAIA,YAAM,KAAK;AAAA,QACT;AAAA,QACA,CAAC,OAAO;AAAA,MACV;AAEA,UAAI,aAAa,gBAAgB,kBAAkB;AAGjD,cAAM,gBAAqB,WAAK,WAAW,aAAa,YAAY;AACpE,cAAM,mBAAmB,MAAS,aAAS,eAAe,OAAO;AACjE,cAAM,mBAAmBA,UAAS,gBAAgB;AAElD,cAAM,kBAAoC,CAAC;AAC3C,cAAM,mBAA6B,CAAC;AACpC,mBAAW,UAAU,kBAAkB;AACrC,gBAAM,QAAQ,wBAAwB,MAAM;AAC5C,cAAI,OAAO;AACT,4BAAgB,KAAK,KAAK;AAC1B,6BAAiB,KAAK,wBAAwB,MAAM,CAAC;AAAA,UACvD;AAAA,QACF;AAGA,iBAAS,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK,WAAW;AAC1D,gBAAM,qBAAqB,MAAM,SAAS,iBAAiB,kBAAkB,GAAG,SAAS;AAAA,QAC3F;AAAA,MACF;AAGA,YAAM,cAAiC;AAAA,QACrC,UAAU;AAAA,QACV,eAAe;AAAA,QACf,eAAe;AAAA,QACf,mBAAmB;AAAA,QACnB,WAAW,oBAAI,KAAK;AAAA,QACpB,eAAe,kBAAkB,gBAAgB,KAAK;AAAA,MACxD;AACA,YAAM,mBAAmB,MAAM,WAAW;AAG1C,YAAM,KAAK,IAAI,QAAQ;AAEvB,aAAO;AAAA,QACL;AAAA,QACA,QAAQ;AAAA,QACR,YAAY,QAAQ;AAAA,MACtB;AAAA,IACF,SAAS,KAAK;AAEZ,YAAM,KAAK,IAAI,UAAU;AAIzB,UAAI,kBAAkB;AACpB,YAAI;AACF,gBAAM,KAAK,IAAI,mBAAmB;AAClC,gBAAM,KAAK;AAAA,YACT;AAAA,YACA,CAAC,OAAO;AAAA,UACV;AACA,gBAAM,KAAK;AAAA,YACT;AAAA,YACA,CAAC,OAAO;AAAA,UACV;AACA,gBAAM,mBAAmB,MAAM,OAAO;AACtC,gBAAM,KAAK,IAAI,QAAQ;AAAA,QACzB,QAAQ;AAEN,cAAI;AACF,kBAAM,KAAK,IAAI,UAAU;AAAA,UAC3B,QAAQ;AAAA,UAER;AAAA,QACF;AAAA,MACF;AAEA,YAAM;AAAA,IACR;AAAA,EACF,SAAS,KAAK;AACZ,UAAM,WAAW,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAChE,WAAO;AAAA,MACL;AAAA,MACA,QAAQ;AAAA,MACR,OAAO;AAAA,IACT;AAAA,EACF;AACF;AAaA,eAAsB,mBACpB,MACA,SACmD;AACnD,QAAM,SAAmB,CAAC;AAC1B,QAAM,WAAqB,CAAC;AAG5B,QAAM,iBAAiB,IAAI,IAAI,MAAM,qBAAqB,IAAI,CAAC;AAG/D,QAAM,UAAU,MAAS,YAAQ,SAAS,EAAE,eAAe,KAAK,CAAC;AACjE,QAAM,cAAc,oBAAI,IAAY;AAEpC,aAAW,SAAS,SAAS;AAC3B,QAAI,CAAC,MAAM,YAAY,EAAG;AAC1B,QAAI,MAAM,KAAK,WAAW,GAAG,KAAK,MAAM,KAAK,WAAW,GAAG,EAAG;AAC9D,QAAI,MAAM,KAAK,SAAS,MAAM,KAAK,MAAM,KAAK,SAAS,SAAS,KAAK,MAAM,KAAK,SAAS,aAAa,EAAG;AAEzG,UAAM,UAAU,MAAM;AACtB,gBAAY,IAAI,OAAO;AAEvB,UAAM,YAAiB,WAAK,SAAS,OAAO;AAG5C,QAAI,CAAC,eAAe,IAAI,OAAO,GAAG;AAEhC,YAAM,WAAW,MAAM,iBAAiB,SAAS;AACjD,UAAI,UAAU;AACZ,eAAO,KAAK,OAAO;AAAA,MACrB;AACA;AAAA,IACF;AAGA,UAAM,mBAAmB,MAAM,iBAAiB,SAAS;AACzD,QAAI,CAAC,kBAAkB;AAErB,eAAS,KAAK,OAAO;AACrB;AAAA,IACF;AAEA,QAAI;AACF,YAAM,eAAoB,WAAK,WAAW,gBAAgB;AAC1D,YAAM,cAAc,cAAc,MAAM,gBAAgB,YAAY,CAAC;AACrE,YAAM,WAAW,MAAM,gBAAgB,MAAM,OAAO;AAEpD,UAAI,CAAC,YAAY,SAAS,kBAAkB,aAAa;AACvD,eAAO,KAAK,OAAO;AAAA,MACrB,OAAO;AAEL,cAAM,eAAe,MAAM,qBAAqB,SAAS;AACzD,YAAI,aAAa,cAAc;AAC7B,gBAAM,mBAAwB,WAAK,WAAW,aAAa,YAAY;AACvE,gBAAM,gBAAgB,cAAc,MAAM,gBAAgB,gBAAgB,CAAC;AAC3E,cAAI,SAAS,sBAAsB,eAAe;AAEhD,mBAAO,KAAK,OAAO;AAAA,UACrB;AAAA,QACF,WAAW,UAAU,sBAAsB,MAAM;AAE/C,iBAAO,KAAK,OAAO;AAAA,QACrB;AAAA,MACF;AAAA,IACF,QAAQ;AAEN,aAAO,KAAK,OAAO;AAAA,IACrB;AAAA,EACF;AAGA,aAAW,iBAAiB,gBAAgB;AAC1C,QAAI,CAAC,YAAY,IAAI,aAAa,GAAG;AACnC,eAAS,KAAK,aAAa;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO,EAAE,QAAQ,SAAS;AAC5B;AAUA,eAAsB,qBACpB,MACA,iBACe;AACf,aAAW,WAAW,iBAAiB;AACrC,UAAM,KAAK,IAAI,mBAAmB;AAClC,QAAI;AACF,YAAM,KAAK;AAAA,QACT;AAAA,QACA,CAAC,OAAO;AAAA,MACV;AACA,YAAM,KAAK;AAAA,QACT;AAAA,QACA,CAAC,OAAO;AAAA,MACV;AACA,YAAM,mBAAmB,MAAM,OAAO;AACtC,YAAM,KAAK,IAAI,QAAQ;AAAA,IACzB,SAAS,KAAK;AACZ,YAAM,KAAK,IAAI,UAAU;AACzB,YAAM;AAAA,IACR;AAAA,EACF;AACF;;;ALvmBA,IAAI,aAA4B;AAEzB,SAAS,aAAa,KAAmB;AAC9C,eAAa;AACf;AAEO,SAAS,aAAa,SAAyB;AACpD,SAAO,cAAc;AACvB;AAcA,eAAsB,cAAc,SAAsC;AACxE,QAAM,OAAO,MAAM,cAAc,OAAO;AACxC,QAAM,YAAY,aAAa,OAAO;AACtC,QAAM,UAA6B,CAAC;AACpC,QAAM,SAAoD,CAAC;AAG3D,QAAM,EAAE,QAAQ,SAAS,IAAI,MAAM,mBAAmB,MAAM,SAAS;AAGrE,aAAW,WAAW,UAAU;AAC9B,QAAI;AACF,YAAM,qBAAqB,MAAM,CAAC,OAAO,CAAC;AAC1C,cAAQ,KAAK,EAAE,SAAS,QAAQ,UAAU,CAAC;AAAA,IAC7C,SAAS,KAAK;AACZ,YAAM,WAAW,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAChE,aAAO,KAAK,EAAE,SAAS,OAAO,qBAAqB,QAAQ,GAAG,CAAC;AAAA,IACjE;AAAA,EACF;AAGA,aAAW,WAAW,QAAQ;AAC5B,UAAM,YAAiB,WAAK,WAAW,OAAO;AAC9C,UAAM,SAAS,MAAM,kBAAkB,MAAM,SAAS,SAAS;AAC/D,YAAQ,KAAK,MAAM;AACnB,QAAI,OAAO,WAAW,WAAW,OAAO,OAAO;AAC7C,aAAO,KAAK,EAAE,SAAS,OAAO,OAAO,MAAM,CAAC;AAAA,IAC9C;AAAA,EACF;AAEA,SAAO;AAAA,IACL,iBAAiB,QAAQ;AAAA,IACzB,cAAc,QAAQ,OAAO,CAAC,MAAM,EAAE,WAAW,QAAQ,EAAE;AAAA,IAC3D,iBAAiB,QAAQ,OAAO,CAAC,MAAM,EAAE,WAAW,WAAW,EAAE;AAAA,IACjE,eAAe,QAAQ,OAAO,CAAC,MAAM,EAAE,WAAW,SAAS,EAAE;AAAA,IAC7D;AAAA,IACA;AAAA,EACF;AACF;AAYA,eAAsB,UACpB,SACA,SAC0B;AAC1B,QAAM,OAAO,MAAM,cAAc,OAAO;AACxC,QAAM,YAAY,aAAa,OAAO;AACtC,QAAM,YAAiB,WAAK,WAAW,OAAO;AAG9C,MAAI;AACF,UAAS,WAAO,SAAS;AAAA,EAC3B,QAAQ;AAEN,UAAM,WAAW,MAAM,gBAAgB,MAAM,OAAO;AACpD,QAAI,UAAU;AACZ,YAAM,qBAAqB,MAAM,CAAC,OAAO,CAAC;AAC1C,aAAO,EAAE,SAAS,QAAQ,UAAU;AAAA,IACtC;AACA,WAAO,EAAE,SAAS,QAAQ,SAAS,OAAO,2BAA2B,OAAO,GAAG;AAAA,EACjF;AAEA,SAAO,kBAAkB,MAAM,SAAS,SAAS;AACnD;","names":["_extends","fs","path","stdout","ppid","command","resolve","fs","path","crypto","fs","fs","path","clone","config","_extends","ok","notOk","undef","undefined","NOT_TYPED_FUNCTION","create","isPlainObject","x","constructor","Object","_types","name","test","Array","isArray","Date","RegExp","anyType","isAny","typeMap","typeList","nConversions","typed","createCount","findType","typeName","type","get","message","toLowerCase","otherName","TypeError","addTypes","types","beforeSpec","arguments","length","beforeIndex","index","newTypes","i","has","push","set","conversionsTo","affectedTypes","slice","concat","clear","Map","clearConversions","findTypeNames","value","matches","filter","isTypedFunction","entity","findSignature","fn","signature","options","exact","stringSignature","join","params","parseSignature","canonicalSignature","stringifyParams","signatures","match","_typedFunctionData","signatureMap","nParams","remainingSignatures","want","filteredSignatures","possibility","have","getParamAtIndex","restParam","hasAny","haveTypes","paramTypeSet","some","wtype","candidate","find","implementation","convert","conversions","Error","fromType","from","separator","map","p","parseParam","param","indexOf","typeDefs","split","s","trim","paramName","exactTypes","typeIndex","conversion","conversionIndex","hasConversion","expandParam","typeNames","t","matchingConversions","availableConversions","newName","convertibleTypes","typeSet","Set","forEach","add","rawSignature","rawParams","parsedParam","SyntaxError","hasRestParam","last","compileTest","test0","test1","or","tests","compileTests","initial","varIndex","lastTest","testRestParam","args","testArgs","getTypeSetAtIndex","isExactType","mergeExpectedParams","paramSet","createError","err","expected","_name","matchingSignatures","nextMatchingDefs","actualTypes","data","category","actual","lengths","Infinity","Math","min","apply","maxLength","max","expectedLength","argTypes","getLowestTypeIndex","getLowestConversionIndex","compareParams","param1","param2","typeDiff","conv1","conv2","convDiff","compareSignatures","signature1","signature2","pars1","pars2","last1","last2","hasRest1","hasRest2","any1","par","any2","lengthCriterion","comparisons","tc","thisComparison","c","bonus","decrement","knownTypes","bestIndex","bestConversion","compileArgsPreprocessing","fnConvert","compiledConversions","compileArgConversion","conv","convertArgs","fnPreprocess","offset","preprocessRestParams","defineProperty","conversion0","conversion1","to","convertor","arg","convertArg","splitParams","_splitParams","paramsSoFar","resultingParams","flatMap","nextParam","conflicting","params1","params2","ii","typeSet1","typeSet2","overlap","len1","len2","restParam1","restParam2","clearResolutions","functionList","isReferToSelf","referToSelf","callback","isReferTo","makeReferTo","referTo","references","collectResolutions","resolvedReferences","reference","resolution","resolveReferences","self","resolvedFunctions","isResolved","fill","leftUnresolved","nothingResolved","validateDeprecatedThis","signaturesMap","deprecatedThisRegex","keys","toString","createTypedFunction","rawSignaturesMap","warnAgainstDeprecatedThis","parsedParams","originalFunctions","preliminarySignatures","prototype","hasOwnProperty","call","pp","functionIndex","conversionParams","sp","spName","every","sort","theTypedFn","internalSignatureMap","ok0","ok1","ok2","ok3","ok4","ok5","allOk","test00","test10","test20","test30","test40","test50","test01","test11","test21","test31","test41","test51","fn0","fn1","fn2","fn3","fn4","fn5","len0","len3","len4","len5","iStart","iEnd","fns","generic","onMismatch","arg0","arg1","_onMismatch","arr","start","end","findInArray","objectOrFn","checkName","nameSoFar","getObjectName","obj","key","mergeSignatures","dest","source","sourceFunction","destFunction","saveTyped","maybeName","named","allSignatures","item","theseSignatures","thisName","argument","throwMismatchError","_findType","addType","beforeObjectTest","before","_validateConversion","addConversion","override","existing","other","removeConversion","addConversions","existingConversion","splice","resolve","tf","argList","sigs","name","dependencies","create","name","dependencies","config","log2","log10","cbrt","expm1","size","sign","digits","dot","zeros","createTyped","BigNumber","Complex","DenseMatrix","Fraction","typed","matrix","name","min","max","n1","subtract","sign","digits","pow","sum","cbrt","config","clone","Decimal","i","log10","log2","dependencies","config","BigNumber","cosh","sinh","hypot","P","abs","re","im","t","inv","name","dependencies","im","re","P","add","parse","name","dependencies","name","dependencies","Matrix","size","import_extends","size","format","toFixed","toExponential","toEngineering","_toNumberOrDefault","exp","digits","BigNumber","format","format","min","max","size","size","format","size","array","typeOf","size","clone","size","clone","_extends","name","size","name","dependencies","Matrix","config","DenseMatrix","size","i","matrix","min","max","data","submatrix","range","_resize","result","_loop","format","_value","deepForEach","deepMap","size","name","dependencies","typed","equal","deepMap","n1","nearlyEqual","name","dependencies","typed","config","nearlyEqual","deepMap","name","dependencies","typed","equalScalar","deepMap","name","dependencies","typed","BigNumber","Fraction","Complex","deepMap","typed","name","dependencies","typed","config","nearlyEqual","name","dependencies","typed","equalScalar","Matrix","SparseMatrix","matrix","size","min","max","i","range","index","_resize","format","invoke","value","_value","name","dependencies","typed","number","size","BigNumber","Fraction","clone","deepMap","name","dependencies","typed","BigNumber","number","size","clone","Fraction","deepMap","name","dependencies","typed","Complex","number","re","im","Fraction","Object","deepMap","name","dependencies","typed","Fraction","number","BigNumber","clone","Object","deepMap","name","dependencies","typed","Matrix","DenseMatrix","SparseMatrix","format","Array","name","dependencies","typed","matrix","flatten","size","Array","Matrix","name","dependencies","typed","deepMap","name","dependencies","typed","deepMap","name","dependencies","typed","isInteger","size","_switch","name","dependencies","typed","name","dependencies","typed","name","dependencies","typed","equalScalar","name","dependencies","typed","DenseMatrix","name","dependencies","typed","name","dependencies","typed","name","dependencies","typed","equalScalar","name","dependencies","typed","size","name","dependencies","typed","matrix","name","dependencies","typed","name","dependencies","typed","equalScalar","name","dependencies","typed","DenseMatrix","name","dependencies","typed","name","dependencies","typed","matrix","addScalar","multiplyScalar","equalScalar","dot","sum","name","dependencies","typed","complex","Complex","BigNumber","Fraction","deepMap","name","dependencies","config","typed","Complex","BigNumber","name","dependencies","typed","matrix","equalScalar","subtractScalar","unaryMinus","DenseMatrix","concat","name","dependencies","typed","SparseMatrix","name","dependencies","typed","deepMap","name","dependencies","typed","deepMap","name","dependencies","typed","deepMap","name","dependencies","typed","matrix","isInteger","size","name","dependencies","typed","Index","matrix","range","column","name","dependencies","typed","matrix","DenseMatrix","SparseMatrix","Array","format","Matrix","size","name","dependencies","typed","Array","DenseMatrix","SparseMatrix","name","dependencies","typed","Array","Matrix","name","dependencies","typed","config","matrix","BigNumber","DenseMatrix","SparseMatrix","format","Array","size","Matrix","name","dependencies","typed","matrix","size","arrays","_loop","i","_loop2","_i","name","dependencies","typed","config","matrix","bignumber","smaller","smallerEq","larger","largerEq","add","isZero","isPositive","number","BigNumber","name","dependencies","typed","isInteger","size","name","dependencies","typed","name","dependencies","typed","config","matrix","BigNumber","size","format","Matrix","_validate","name","dependencies","bignumber","fraction","numeric","name","dependencies","typed","numeric","DenseMatrix","format","name","dependencies","typed","matrix","divideScalar","multiplyScalar","subtractScalar","equalScalar","DenseMatrix","name","dependencies","typed","matrix","divideScalar","multiplyScalar","subtractScalar","equalScalar","DenseMatrix","name","dependencies","typed","matrix","equalScalar","DenseMatrix","concat","SparseMatrix","name","dependencies","typed","config","bignumber","matrix","DenseMatrix","concat","SparseMatrix","nearlyEqual","name","dependencies","typed","config","matrix","DenseMatrix","concat","SparseMatrix","nearlyEqual","name","dependencies","typed","config","bignumber","matrix","DenseMatrix","concat","SparseMatrix","nearlyEqual","name","dependencies","typed","config","matrix","DenseMatrix","concat","SparseMatrix","nearlyEqual","name","dependencies","typed","config","numeric","larger","deepForEach","name","dependencies","typed","config","numeric","smaller","min","deepForEach","name","dependencies","smaller","DenseMatrix","ImmutableDenseMatrix","matrix","name","dependencies","ImmutableDenseMatrix","getMatrixDataType","Index","matrix","size","range","name","dependencies","typed","number","Complex","BigNumber","typed","name","dependencies","typed","name","dependencies","typed","name","dependencies","typed","matrix","addScalar","equalScalar","DenseMatrix","SparseMatrix","concat","name","dependencies","typed","addScalar","multiplyScalar","conj","size","add","mul","import_extends","name","dependencies","typed","matrix","zeros","identity","isZero","equal","sign","sqrt","conj","unaryMinus","addScalar","divideScalar","multiplyScalar","subtractScalar","complex","_extends","DenseMatrix","SparseMatrix","Array","name","dependencies","typed","matrix","subtractScalar","multiply","divideScalar","isZero","unaryMinus","det","size","format","i","name","dependencies","typed","matrix","divideScalar","addScalar","multiply","unaryMinus","det","identity","abs","size","format","import_extends","addScalar","subtract","flatten","multiply","multiplyScalar","divideScalar","sqrt","abs","bignumber","diag","size","reshape","inv","qr","usolve","usolveAll","equal","complex","larger","smaller","matrixFromColumns","dot","max","_loop","lambda","sub","config","addScalar","subtract","abs","atan","cos","sin","multiplyScalar","inv","bignumber","multiply","add","diag","i","name","dependencies","config","typed","matrix","addScalar","subtract","equal","abs","atan","cos","sin","multiplyScalar","divideScalar","inv","bignumber","multiply","add","larger","column","flatten","number","complex","sqrt","diag","size","reshape","qr","usolve","usolveAll","im","re","smaller","matrixFromColumns","dot","Array","Matrix","_extends","format","name","dependencies","typed","matrix","multiply","equalScalar","divideScalar","inv","name","dependencies","typed","add","divide","sum","deepForEach","name","dependencies","typed","add","subtract","multiply","divide","mapSlices","sum","deepForEach","mean","name","dependencies","typed","map","sqrt","variance","Complex","Fraction","Complex","Fraction","abs","atan","Complex","cos","flatten","isNaN","sign","Fraction","sin","sqrt","Complex","zeros","Fraction","isInteger","isInteger","flatten","reshape","isInteger","concat","isInteger","concat","max","isNaN","sign","sqrt","zeros","concat","add","concat","concat","min","isNaN","abs","concat","divide","add","divide","add","abs","add","atan","cos","flatten","reshape","sin","sqrt","add","divide","isNaN","sqrt","config","sum","max","min","maxDrawdown","totalDailyPl","sum","_","normalizeReturn","sum","_","identity","DAY_MS","config","fs","path","parseNumber","parseCSVLine","name","parseCSV","parseCSVLine"]}